Parallel reductions in λ-calculus
Journal of Symbolic Computation
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
The clausal theory of types
Handbook of logic in computer science (vol. 2)
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Information and Computation
Theoretical Computer Science - Special issue: algebraic development techniques
Cayenne—a language with dependent types
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Exceptions in the Rewriting Calculus
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
An Introduction to Dependent Type Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Proof-assistants using dependent type systems
Handbook of automated reasoning
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Semantics of the reFLect language
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
iRho: an imperative rewriting calculus
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Expressing combinatory reduction systems derivations in the rewriting calculus
Higher-Order and Symbolic Computation
A Framework for Defining Logical Frameworks
Electronic Notes in Theoretical Computer Science (ENTCS)
A ρ-calculus of explicit constraint application
Higher-Order and Symbolic Computation
Term Collections in λ and ρ-calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
From Functional Programs to Interaction Nets via the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
Imperative LF Meta-Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Sharing Strategy for the Graph Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Strong normalisation in two pure pattern type systems
Mathematical Structures in Computer Science
Irho: An imperative rewriting calculus
Mathematical Structures in Computer Science
A Conditional Logical Framework
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Journal of Functional Programming
A Polymorphic Type System for the Lambda-Calculus with Constructors
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A Rewriting Calculus for Cyclic Higher-order Term Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
The Polymorphic Rewriting-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical Semantics for the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Language for Verification and Manipulation of Web Documents
Electronic Notes in Theoretical Computer Science (ENTCS)
The rewriting calculus as a combinatory reduction system
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Confluence of pattern-based calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
On the confluence of lambda-calculus with conditional rewriting
Theoretical Computer Science
On the confluence of λ-calculus with conditional rewriting
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
The graph rewriting calculus: confluence and expressiveness
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
LFP: a logical framework with external predicates
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
25 years of formal proof cultures: some problems, some philosophy, bright future
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction application with built-in matching facilities. This framework, that we call "Pure Pattern Type Systems", is particularly well-suited for the foundations of programming (meta)languages and proof assistants since it provides in a fully unified setting higher-order capabilities and pattern matching ability together with powerful type systems. We prove some standard properties like confluence and subject reduction for the case of a syntactic theory and under a syntactical restriction over the shape of patterns. We also conjecture the strong normalization of typable terms. This work should be seen as a contribution to a formal connection between logics and rewriting, and a step towards new proof engines based on the Curry-Howard isomorphism.