Pure type systems in rewriting logic: Specifying typed higher-order languages in a first-order logical framework

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

Volumn 2635, Issue , 2004, Pages 334-375

  Stehr, Mark Oliver ^a,b   Meseguer, José ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC;

CALCULUS OF CONSTRUCTION; HIGHER-ORDER LANGUAGES; LOGICAL FRAMEWORKS; MEMBERSHIP EQUATIONAL LOGIC; OPEN CALCULUS OF CONSTRUCTIONS; OPERATIONAL ASPECTS; OPERATIONAL DESCRIPTION; PURE TYPE SYSTEMS;

COMPUTER CIRCUITS;

EID: 9444283908     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39993-3_16     Document Type: Article

References (53)

1. H. P. Barendregt. Lambda-calculi with types. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science. Claredon Press, Oxford, 1992.
2. B. Barras, S. Boutin, C. Cornes, J. Courant, Y. Coscoy, D. Delahaye, D. de Rauglaudre, J. C . Filliatre, E. Giménez, H. Herbelin, G. Huet, H. Laulhère, C. Muñoz, C. Murthy, C. Parent-Vigouroux, P. Loiseleur, C. Paulin, A. Saibi, and B. Werner. The Coq Proof Assistent Reference Manual, Version 6.3.1, Coq Project. Technical report, INRIA, 1999. http://logical.inria.fr/.
3. D. Basin, M. Clavel, and J. Meseguer. Reflective metalogical frameworks. In LFM'99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September 28, 1999, Proceedings, 1999. http://plan9.bell-labs.com/who/felty/LFM99/.
4. D. Basin, M. Clavel, and J. Meseguer. Rewriting logic as a metalogical framework. In S. Kapoor and S. Prasad, editors, Twentieth Conference on the Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, December 13-15, 2000, Proceedings, volume 1974 of Lecture Notes in Computer Science, pages 55-80. Springer-Verlag, 2000.
5. Z. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli. λυ, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming, 6(5):699-722, September 1996.
6. S. Berardi. Towards a mathematical analysis of the Coquand-Huet calculus of constructions and other systems in Barendregt's cube. Technical report, Carnegie Mellon University and Universita di Torino, 1988.
7. K. J. Berkling. A symmetric complement to the lambda-calulus. Interner Bericht ISF-76-7, GMD, St. Augustin, Germany, 1976.
8. K. J. Berkling and E. Fehr. A consistent extension of the lambda-calculus as a base for functional programming languages. Information and Control, 55:89-101, 1982.
9. F. Blanqui, J.-P. Jouannaud, and M. Okada. The calculus of algebraic constructions. In Rewriting Techniques and Applications, Lecture Notes in Computer Science. Springer-Verlag, 1999.
10. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. In M. Bidoit and M. Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, Frace, April 1997, Proceedings, volume 1214 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
11. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236:35-132, 2000.
12. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5(1), 1940.
13. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: Specification and Programming in Rewriting Logic. SRI International, January 1999. http://maude.csl.sri.com.
14. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. A tutorial on maude. http://maude.csl.sri.com, March 2000.
15. T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.
16. T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76(2/3):95-120, 1988.
17. T. Coquand and C. Paulin-Mohring. Inductively defined types. In COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings, volume 417 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
18. N. G. de Bruijn. Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. In Proceedings Kninkl. Nederl. Akademie van Wetenschappen, volume 75(5), pages 381-392, 1972.
19. S. Feferman. Finitary inductive systems. In R. Ferro, editor, Proceedings of Logic Colloquium '88, Padova, Italy, August 1988, pages 191-220. North-Holland, 1988.
20. P. Gardner. Representing Logics in Type Theory. PhD thesis, University of Edinburgh, 1992.
21. H. Geuvers. Logics and Type Systems. PhD thesis, University of Nijmegen, 1993.
22. 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, April 1991.
23. J. Y. Girard. Interpretation fonctionelle et elimination des coupures dans l'arithmetique d'ordre superieur. PhD thesis, Université Paris VII, 1972.
24. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. In Second Annual Symposium on Logic in Computer Science, Ithaca, New York, 22-25 June 1987, Proceedings, pages 193-204. IEEE, 1987.
25. G. Huet. The constructive engine. In R. Narasimhan, editor, A Perspective in Theoretical Computer Science. World Scientific, 1989.
26. J.-P. Jouannaud. Membership equational logic, calculus of inductive constructions, and rewrite logic. In International Workshop on Rewriting Logic and its Applications Abbaye des Prémontrés at Pont-à-Mousson, France, September 1998, Proceedings, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier, 1998. http://www.elsevier.nl/locate/entcs/volume15.html.
27. P. Lescanne. From λσ to λυ, a journey through calculi of explicit substitutions. In Hans Boehm, editor, Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, January 17-21, 1994, pages 60-69. ACM, 1994.
28. P. Lescanne and J. Rouyer-Degli. The calculus of explicit substitutions λυ. Technical Report RR-2222, INRIA-Lorraine, January 1994.
29. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. International Series of Monographs on Computer Science. Oxford University Press, 1994.
30. L. Magnussen. The Implementation of ALF - A Proof Editor based on Martin-Löf's Monomorphic Type Theory with Explicit Substitutions. PhD thesis, University of Göteborg, Department of Computer Science, 1994.
31. N. Martí-Oliet and J. Meseguer. General logics and logical frameworks. In D. Gabbay, editor, What is a Logical System?, pages 355-392. Oxford University Press, 1994.
32. N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. In RWLW'96, First International Workshop on Rewriting Logic and its Applications Asilomar Conference Center, Pacific Grove, CA, USA, September 3-6, 1996, Proceedings, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996. http://www.elsevier.nl/locate/entcs/volume4.html.
33. To appear in D. M. Gabbay, F. Guenthner, (eds.), Handbook of Philosophical Logic (2nd edition), Kluwer Academic Publishers.
34. P. Martin-Löf. An intuitionistic theory of types. Technical report, University of Stockhohn, 1972.
35. J. McKinna and R. Pollack. Pure type systems formalized. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA '93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings, volume 664 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
36. J. Meseguer. General logics. In H.-D. Ebbinghaus et al., editors, Logic Colloquium'87, Granada, Spain, July 1987, Proceedings, pages 275-329. North-Holland, 1989.
37. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73-155, 1992.
38. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT'97, Tarquinia, Italy, June 3-7, 1997, Selected Papers, volume 1376 of Lecture Notes in Computer Science, pages 18 - 61. Springer-Verlag, 1998.
39. M. J. O'Donnell. Computing in systems descibed by equations. In Fundamentals of Computation Theory, International Conference, Poznañ-Kornik, Poland September 19-83, 1977, Proceedings, volume 58 of Lecture Notes in Computer Science. Springer-Verlag, 1977.
40. L. C. Paulson. Isabelle, volume 828 of Lecture Notes in Computer Science. Springer Verlag, 1994.
41. R. Pollack. Closure under alpha-conversion. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs: International Workshop TYPES'93, Nijmegen, May 1993, Selected Papers, volume 806 of Lecture Notes in Computer Science, pages 313-332. Springer-Verlag, 1993.
42. R. Pollack. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994.
43. R. Pollack. A verified typechecker. In M. Dezani-Ciancaglini and G. D. Plotkin, editors, Second International Conference on Typed Lambda Calculi and Applications, Edinburgh, UK, April 10-12, 1995, volume 902 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
44. J. Reynolds. Towards a theory of type structure. In Programming Symposium, Paris, volume 19 of Lecture Notes in Computer Science. Springer-Verlag, 1974.
45. C. Schürmann and F. Pfenning. Automated theorem proving in a simple meta-logic for LF. In C. Kirchner and H. Kirchner, editors, Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings, volume 1421 of Lecture Notes in Artificial Intelligence, pages 286-300. Springer-Verlag, 1998.
46. P. G. Severi. Normalization in Lambda Calculus and its relation to Type Inference. PhD thesis, Eindhoven University of Technology, 1996.
47. M.-O. Stehr. CINNI - A New Calculus of Explicit Substitutions and its Application to Pure Type Systems. Manuscript, CSL, SRI-International, Menlo Park, CA, USA, 1999.
48. M.-O. Stehr. CINNI - A Generic Calculus of Explicit Substitutions and its Application to λ-, σ- and π-calculi. In K. Futatsugi, editor, The 3rd International Workshop on Rewriting Logic and its Applications Kanazawa City Cultural Hall, Kanzawa Japan, September 18-20, 2000, Proceedings, volume 36 of Electronic Notes in Theoretical Computer Science, pages 71 - 92. Elsevier, 2000. http://www.elsevier.nl/locate/entcs/volume36.html. Extended version at http://www.csl.sri.com/∼stehr.
49. M.-O. Stehr. Programming, Specification, and Interactive Theorem Proving - Towards a Unified Language based on Equational Logic, Rewriting Logic, and Type Theory. Doctoral Thesis, Universität Hamburg, Fachbereich Informatik, Germany, 2002. http://www.sub.uni-hamburg.de/disse/810/.
50. M.-O. Stehr and J. Meseguer. Pure type systems in rewriting logic. In LFM'99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September 28, 1999, Proceedings, 1999. http://plan9.bell-labs.com/who/felty/LFM99/.
51. J. Terlouw. Een nadere bewijstheoretische analyse van GSTTs. Manuscript, University of Nijmegen, The Netherlands, 1989.
52. L. S. van Benthem Jutting. Typing in pure type systems. Information and Computation, 105:30-41, 1993.
53. L. S. van Benthem Jutting, J. McKinna, and R. Pollack. Checking algorithms for pure type systems. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs: International Workshop TYPES'93, Nijmegen, May 1993, Selected Papers, volume 806 of Lecture Notes in Computer Science, pages 19-61. Springer-Verlag, 1993.