CINNI - A generic calculus of explicit substitutions and its application to λ- ς- and π-Calculi

Electronic Notes in Theoretical Computer Science

Volumn 36, Issue , 2000, Pages 70-92

  Stehr, Mark Oliver ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

Explicit Substitutions; Higher Order Languages; Lambda Calculus; Logical Frameworks; Maude; Pi Calculus; Rewriting Logic; Sigma Calculus

Indexed keywords

ABSTRACTING; COMPUTER SCIENCE; DIFFERENTIATION (CALCULUS); INDEXING (OF INFORMATION); LOGIC PROGRAMMING; MATHEMATICAL OPERATORS; OBJECT ORIENTED PROGRAMMING; THEOREM PROVING;

EXPLICIT SUBSTITUTIONS; HIGHER-ORDER LANGUAGES; LAMBDA-CALCULUS; LOGICAL FRAMEWORK; MAUDE; PI-CALCULUS; REWRITING LOGICS; SIGMA-CALCULUS;

HIGH LEVEL LANGUAGES;

EID: 18944375475     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80125-2     Document Type: Conference Paper

References (39)

1. Abadi M., Cardelli L. A Theory of Objects. Monographs in Computer Science. 1996;Springer-Verlag
2. Abadi M., Cardelli L., Curien P.-L., Lévy J.-J. Explicit substitutions. Journal of Functional Programming. 1:(4):1991;375-416
3. Barendregt H.P. Lambda-calculi with types. Abramsky S., Gabbay D.M., Maibaum T.S.E. Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science. 1992;Oxford: Clarendon Press
4. Benaissa Z., Briaud D., Lescanne P., Rouyer-Degli J. λv, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming. 6:(5):September 1996;699-722
5. Berardi S. 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
6. Berkling K.J. A symmetric complement to the lambda-calulus. Technical Report Interner Bericht ISF-76-7, GMD. 1976;St.Augustin, Germany
7. Berkling K.J., Fehr E. A consistent extension of the lambda-calculus as a base for functional programming languages. Information and Control. 55:1982;89-101
8. R. Bloo. Preservation of Termination for Explicit Substitution. PhD thesis, Eindhoven University of Technology, 1997. IPA Dissertation Series 1997-05.
9. Bloo R., Rose K.H. Combinatory reduction systems with explicit substitution that preserve strong normalisation. Ganzinger H. RTA '96-Rewriting Techniques and Applications, New Brunswick, New Jersey, July 1996, Rutgers University, volume 1103 of Lecture Notes in Computer Science. 1996;169-183 Springer-Verlag
10. Bouhoula A., Jouannaud J.-P., Meseguer J. Specification and proof in membership equational logic. Theoretical Computer Science. 236:2000;35-132
11. M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Marti-Oliet, J. Meseguer, and J. Quesada. A tutorial on Maude. SRI International, March 2000, http://maude.csl.sri.com.
12. Clavel M., Duran F., Eker S., Lincoln P., Marti-Oliet N., Meseguer J., Quesada J. Maude: Specification and Programming in Rewriting Logic. 1999;Computer Science Laboratory, SRI International, Menlo Park. http://maude.csl.sri.com
13. Coquand T., Huet G. The calculus of constructions. Information and Computation. 76(2/3):1988;95-120
14. Curien P.-L. An abstract framework for environment machines. Theoretical Computer Science. 82:1991;389-402
15. Curien P.-L., Hardin T., Lévy J.-J. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM. 43:(2):1996;362-397
16. de Bruijn N.G. Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. In Proc. Kninkl. Nederl. Akademie van Wetenschappen. volume 75:(5):1972;381-392
17. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions. In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science, San Diego, California, June 1995, pages 366-374. IEEE Computer Society Press, 1995.
18. G. Dowek, T. Hardin, and C. Kirchner. HOL-lambda-sigma: An intentional first-order expression of higher-order logic. In P. Narendran and M. Rusinowitch, editors, Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99), Trento, Italy, July 1999, volume 1631 of Lecture Notes in Computer Science, pages 317-331. Springer-Verlag, 1999.
19. J. Field. On laziness and optimality in lambda interpreters: Tools for specification and analysis. In Proceedings of the 17th Anual ACM Symposium on Principles of Programming Languages, Orlando (Florida, USA), pages 1-15. ACM, San Francisco, 1990.
20. Hardin T. Confluence results for the pure strong categorical combinatory logic. Theoretical Computer Science. 1988
21. D. Hirschkoff. Handling substitutions explicitely in the pi-calculus. In Proceedings of WESTAPP'99, Second International Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs, July 5, 1999, Trento, Italy.
22. Kamareddine F., Ríos A. Relating the λΔ and λs-styles of explicit substitutions. Journal of Logic and Computation. 2000
23. Kesner D., López P.E.M. Explicit substitutions for objects and functions. The Journal of Functional and Logic Programming. 1999;. Special Issue 2
24. P. Lescanne. Termination of rewrite systems by elementary interpretations. In H. Kirchner and G. Levi, editors, Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 1992, Proceedings, volume 632 of Lecture Notes in Computer Science, pages 21 - 36. Springer-Verlag, 1992.
25. P. Lescanne. From λδ to λv, a journey through calculi of explicit substitutions. In Hans Boehm, editor, Proc. 21st Annual ACM Synposium on Principles of Programming Languages, Portland, USA, pages 60-69. ACM, 1994.
26. P. Lescanne and J. Rouyer-Degli. The calculus of explicit substitutions λv. Technical Report RR-2222, INRIA-Lorraine, January 1994.
27. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science. 96:1992;73-155
28. Meseguer J. Membership algebra as a logical framework for equational specification. Parisi-Presicce F. 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. 1998;18-61 Springer-Verlag
29. Milner R. Communicating and Mobile Systems: The Pi-Calculus. May 1999;Cambridge University Press
30. Muñoz C. A calculus of substitutions for incomplete-proof representation in type theory. Technical Report RR-3309, Unite de recherche INRIA-Rocquencourt. Novembre 1997
31. C. Muñoz. Proof synthesis via explicit substitutions on open terms. In Proc. International Workshop on Explicit Substitutions, Theory and Applications, WESTAPP 98, Tsukuba (Japan), April 1998.
32. O'Donnell M.J. Computing in systems descibed by equations. volume 58 of Lecture Notes in Computer Science. 1977;Springer-Verlag
33. B. Pagano. X.R.S.: Explicit reduction systems - a first-order calculus for higher-order calculi. In C. Kirchner and H. Kirchner, editors, Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 1998, Proceedings, volume 1421 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1998.
34. C. Reinke. Functions, Frames and Interactions - completing a λ-calculus-based purely functional language with respect to programming-in-the-large and interactions with runtime environments. PhD thesis, Christian-Albrechts-Universitat Kiel, Germany, 1998. Report 9804.
35. Rose K.H. Explicit substitution - tutorial & survey. Technical Report Lecture Series LS-96-3, BRIGS, Dept. of Computer Science, University of Aarhus. September 1996;. http://www.brics.dk/LS/96/3/BRICS-LS-96-3/BRICS-LS-96-3.html
36. M.-O. Stehr and J. Meseguer. Pure type systems in rewriting logic. In Proc. of LFM'99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September 28, 1999.
37. M.O. Stehr. CINNI - A Generic Calculus of Explicit Substitutions and its Application to lambda-, sigma- and pi-calculi. Extended version of this paper available at http://www.csl.sri/~stehr, October 2000.
38. Terlouw J. Een nadere bewijstheoretische Analyse van GSTTs. Manuscript. 1989;University of Nijmegen, The Netherlands
39. P. Viry. Input/output for ELAN. In J. Meseguer, editor, Proceedings of the 1st International Workshop on Rewriting Logic and its Applications, Asilomar, California, September 1996, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996. http://www.elsevier.com/locate/ entcs/volume4.html.