The Rho cube

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2030, Issue , 2001, Pages 168-183

  Cirstea, Horatiu ^a   Kirchner, Claude ^a   Liquori, Luigi ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATION THEORY; DIFFERENTIATION (CALCULUS); GEOMETRY;

ABSTRACTION MECHANISM; CALCULUS OF CONSTRUCTION; LAMBDA CALCULUS; LOGICAL FRAMEWORKS; NON DETERMINISM; REWRITING CALCULUS; RHO CALCULUS; TYPE SYSTEMS;

CALCULATIONS;

EID: 84945290680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_11     Document Type: Conference Paper

References (27)

1. H. Barendregt. Lambda Calculus: its Syntax and Semantics. North Holland, 1984.
2. H. Barendregt. Lambda Calculi with Types. In Handbook of Logic in Computer Science, volume 2, pages 118-310. Oxford University Press, 1992.
3. 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
4. S. Berardi: Type Dependence and Constructive Cathematics. PhD thesis, Dipartimento di Matematica, Universitá di Torino, 1990.
5. H.-J. Bürckert. Matching-A Special Case of Unification? Journal of Symbolic Computation, 8(5):523-536, 1989.
6. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95-120, 1988.
7. A. Church. A Formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5:56-68, 1941.
8. H. Cirstea. Calcul de Réécriture: Fondements et Applications. Thése de Doctorat d'Université, Université Henri Poincaré - Nancy I, 2000.
9. H. Cirstea and C. Kirchner: An Introduction to the Rewriting Calculus. Research Report RR-3818, INRIA, 1999.
10. 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.
11. H. Cirstea and C. Kirchner. The Typed Rewriting Calculus. In Third International Workshop on Rewriting Logic and Application, 2000.
12. H. Cirstea, C. Kirchner, and L. Liquori: Matching Power. Research Report A00-RR-363, LORIA, 2000. Submitted.
13. T. Coquand. Metamathematical Investigations of a Calculus of Constructions. In Logic and Computer Science, pages 91-122. Academic Press, 1991.
14. 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.
15. J.Y. Girard. Interpretation Fonctionnelle et Élimination des Coupures dans l'Arithmétique d'Ordre Supérieur. PhD thesis, Université Paris VII, 1972.
16. J.Y. Girard. The System F of Variable Types, Fifteen Years Later. Theoretical Computer Science, 45:159-192, 1986.
17. 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.
18. R. Harper, F. Honsell, and G. Plotkin. A Framework for Defining Logics. Journal of the ACM, 40(1):143-184, 1992.
19. J.-M. Hullot. Associative-Commutative Pattern Matching. In Proc. of IJCAI, 1979.
20. 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.
21. 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.
22. C. Kirchner and H. Kirchner. Rewriting, Solving, Proving. A preliminary version of a book available at www.loria.fr/~ckirchne/rsp.ps.gz, 1999.
23. F. Kamareddine and T. Laan: A Correspondence between Martin-Löf Type Theory, the Ramiéd Theory of Types and Pure Type Systems. Journal of Logic, Language and Information, 2001. To appear.
24. F. Kamareddine and R. Nederpelt. Canonical Typing and π-conversion in the λ-cube. Journal of Functional Programming, 6(2):85-109, 1996.
25. Z. Luo. ECC: An Extended Calculus of Constructions. In Proceedings of LICS, pages 385-395, 1990.
26. P. Martin-Löf. Intuitionistic Type Theory, volume 1 of Studies in Proof Theory. Bibliopolis, Naples, 1984.
27. S.L. Peyton Jones and E. Meijer. Henk: a Typed Intermediate Language. In Types in Compilation Workshop, 1997