The system F of variable types, fifteen years later
Theoretical Computer Science
Information and Computation - Semantics of Data Types
Matching - A special case of unification?
Journal of Symbolic Computation
ECC, and extended calculus of constructions
Proceedings of the Fourth Annual Symposium on Logic in computer science
A framework for defining logics
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 2)
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems
Journal of Logic, Language and Information
Associative commutative pattern matching
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Exceptions in the Rewriting Calculus
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A Conditional Logical Framework
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Polymorphic Type System for the Lambda-Calculus with Constructors
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Strategic term rewriting and its application to a VDM-SL to SQL conversion
FM'05 Proceedings of the 2005 international conference on Formal Methods
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 |
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting and λ-calculus. The original presentation of the calculus was untyped. In this paper we present a uniform way to decorate the terms of the calculus with types. This gives raise to a new presentation à la Church, together with nine (8+1) type systems which can be placed in a ρ-cube that extends the λ-cube of Barendregt. Due to the matching capabilities of the calculus, the type systems use only one abstraction mechanism and therefore gives an original answer to the identification of the standard "λ" and "Π" abstractors. As a consequence, this brings matching and rewriting as the first class concepts of the Rho-versions of the Logical Framework (LF) of Harper-Honsell-Plotkin, and of the Calculus of Constructions (CC) of Coquand-Huet.