Abstract
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and non- determinism. 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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Barendregt. Lambda Calculus: its Syntax and Semantics. North Holland, 1984.
H. Barendregt. Lambda Calculi with Types. In Handbook of Logic in Computer Science, volume II, pages 118–310. Oxford University Press, 1992.
S. Berardi. Towards a Mathematical Analysis of Type Dependence in Coquand-Huet Calculus of Constructions and the Other Systems in Barendregt’s Cube. Technical report, Dept. of Computer Science, Carnegie Mellon University, and Dip. di Matematica, Università di Torino, 1988.
S. Berardi. Type Dependence and Constructive Cathematics. PhD thesis, Dipartimento di Matematica, Università di Torino, 1990.
H.-J. Bürckert. Matching-A Special Case of Unification? Journal of Symbolic Computation, 8(5):523–536, 1989.
T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95–120, 1988.
A. Church. A Formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5:56–68, 1941.
H. Cirstea. Calcul de Réécriture: Fondements et Applications. Thèse de Doctorat d’Université, Université Henri Poincaré-Nancy I, 2000.
H. Cirstea and C. Kirchner. An Introduction to the Rewriting Calculus. Research Report RR-3818, INRIA, 1999.
H. Cirstea and C. Kirchner. Combining Higher-Order and First-Order Computation Using ρ-calculus: Towards a Semantics of ELAN. In Frontiers of Combining Systems 2, pages 95–120. Wiley, 1999.
H. Cirstea and C. Kirchner. The Typed Rewriting Calculus. In Third International Workshop on Rewriting Logic and Application, 2000.
H. Cirstea, C. Kirchner, and L. Liquori. Matching Power. Research Report A00-RR-363, LORIA, 2000. Submitted.
T. Coquand. Metamathematical Investigations of a Calculus of Constructions. In Logic and Computer Science, pages 91–122. Academic Press, 1991.
N. G. de Bruijn. A Survey of the Project AUTOMATH. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, pages 589–606. Academic Press, 1980.
J.Y. Girard. Interpretation Fonctionnelle et-Elimination des Coupures dans l’Arithmétique d’Ordre Supérieur. PhD thesis, Université Paris VII, 1972.
J.Y. Girard. The System F of Variable Types, Fifteen Years Later. Theoretical Computer Science, 45:159–192, 1986.
H. Geuvers and M.J. Nederhof. A Modular Proof of Strong Normalization for the Calculus of Constructions. Journal of Functional Programming, 1(2):155–189, 1991.
R. Harper, F. Honsell, and G. Plotkin. A Framework for Defining Logics. Journal of the ACM, 40(1):143–184, 1992.
J.-M. Hullot. Associative-Commutative Pattern Matching. In Proc. of IJCAI, 1979.
J.-P. Jouannaud and C. Kirchner. Solving Equations in Abstract Algebras: A Rule-based Survey of Unification. In Computational Logic. Essays in Honor of Alan Robinson, chapter 8, pages 257–321. The MIT press, 1991.
F. Kamareddine, R. Bloo, and R. Nederpelt. On π-conversion on the λ-cube and the Combination with Abbreviations. Annals of Pure and Applied Logics, 97(1-3):27–45, 1999.
C. Kirchner and H. Kirchner. Rewriting, Solving, Proving. A preliminary version of a book available at http://www.loria.fr/~ckirchne/rsp.ps.gz, 1999.
F. Kamareddine and T. Laan. A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems. Journal of Logic, Language and Information, 2001. To appear.
F. Kamareddine and R. Nederpelt. Canonical Typing and π-conversion in the λ-cube. Journal of Functional Programming, 6(2):85–109, 1996.
Z. Luo. ECC: An Extended Calculus of Constructions. In Proceedings of LICS, pages 385–395, 1990.
P. Martin-Löf. Intuitionistic Type Theory, volume 1 of Studies in Proof Theory. Bibliopolis, Naples, 1984.
S.L. Peyton Jones and E. Meijer. Henk: a Typed Intermediate Language. In Types in Compilation Workshop, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cirstea, H., Kirchner, C., Liquori, L. (2001). The Rho Cube. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive