The λ-context Calculus

Electronic Notes in Theoretical Computer Science

Volumn 196, Issue C, 2008, Pages 19-35

  Gabbay, Murdoch J ^a   Lengrand, Stéphane ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

calculus of explicit substitutions; capture avoiding substitution; capturing substitution; confluence; contexts; instantiation; Lambda calculus; meta variables; nominal techniques

Indexed keywords

LOGIC PROGRAMMING; SYNTACTICS; THEOREM PROVING;

CALCULUS OF EXPLICIT SUBSTITUTIONS; CAPTURE-AVOIDING SUBSTITUTION; LAMBDA-CALCULUS; META-VARIABLES;

DIFFERENTIATION (CALCULUS);

EID: 38549133343     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.09.015     Document Type: Article

References (29)

1. Baader F., and Nipkow T. Term rewriting and all that (1998), Cambridge University Press
2. Barendregt H.P. The lambda calculus: its syntax and semantics. revised ed. (1984), North-Holland
3. Roel Bloo and Kristoffer Høgsbro Rose, Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection, CSN-95: Computer Science in the Netherlands, 1995
4. Mirna Bognar, Contexts in lambda calculus, Ph.D. thesis, Vrije Universiteit Amsterdam, 2002
5. Cheney J. A simpler proof theory for nominal logic. FOSSACS (2005), Springer 379-394
6. Gabbay M.J. A new calculus of contexts. PPDP '05: Proc. of the 7th ACM SIGPLAN int'l conf. on Principles and Practice of Declarative Programming (2005), ACM Press 94-105
7. Gabbay M.J. Hierarchical nominal rewriting. LFMTP'06: Logical Frameworks and Meta-Languages: Theory and Practice (2006) 32-47
8. Gabbay M.J., and Mathijssen A. Capture-avoiding substitution as a nominal algebra. ICTAC'2006: 3rd Int'l Colloquium on Theoretical Aspects of Computing (2006) 198-212
9. Gabbay M.J., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 3-5 (2001) 341-363
10. Geuvers H., and Jojgov G.I. Open proofs and open terms: A basis for interactive logic. CSL (2002), Springer 537-552
11. Hashimoto M., and Ohori A. A typed context calculus. Theor. Comput. Sci. 266 1-2 (2001) 249-272
12. Dimitri Hendriks and Vincent van Oostrom, Adbmal, CADE, 2003, pp. 136-150
13. Jojgov G.I. Holes with binding power. TYPES. LNCS vol. 2646 (2002), Springer 162-181
14. Samuel Kamin and Jean-Jacques Lévy, Attempts for generalizing the recursive path orderings, Handwritten paper, University of Illinois, 1980
15. Lescanne P. From lambda-sigma to lambda-upsilon a journey through calculi of explicit substitutions. POPL '94: Proc. 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1994), ACM Press 60-69
16. Milner R., Parrow J., and Walker D. A calculus of mobile processes, II. Information and Computation 100 1 (1992) 41-77
17. Paulson L.C. ML for the working programmer. 2nd ed. (1996), Cambridge University Press
18. Pitts A.M. Operationally-based theories of program equivalence. In: Dybjer P., and Pitts A.M. (Eds). Semantics and Logics of Computation (1997), Cambridge University Press 241-298 Publications of the Newton Institute
19. Pitts A.M., and Gabbay M.J. A metalanguage for programming with bound names modulo renaming. In: Backhouse R., and Oliveira J.N. (Eds). Mathematics of Program Construction. 5th Int'l Conf., Proceedings. MPC2000, Ponte de Lima, Portugal, July 2000. LNCS vol. 1837 (2000), Springer-Verlag 230-255
20. Pitts A.M., and Stark I.D.B. Operational reasoning for functions with local state. In: Gordon A.D., and Pitts A.M. (Eds). Higher Order Operational Techniques in Semantics (1998), Cambridge University Press 227-273 Publications of the Newton Institute
21. Sato M., Sakurai T., and Burstall R. Explicit environments. Fundamenta Informaticae 45 1-2 (2001) 79-115
22. Sato M., Sakurai T., and Kameyama Y. A simply typed context calculus with first-class environments. Journal of Functional and Logic Programming 2002 4 (2002) 359-374
23. Sato M., Sakurai T., Kameyama Y., and Igarashi A. Calculi of meta-variables. In: Baaz M. (Ed). Computer Science Logic and 8th Kurt Gödel Colloquium. Proccedings. (CSL'03 & KGC), Vienna, Austria. LNCS vol. 2803 (2003) 484-497
24. Francois Maurel Sylvain Baro, The qnu and qnuk calculi : name capture and control, Tech. report, Université Paris VII, 2003, Extended Abstract, Prépublication PPS//03/11//n16
25. Terese. Term rewriting systems. Cambridge Tracts in Theoretical Computer Science no. 55 (2003), Cambridge University Press
26. Thompson S. Haskell: The Craft of Functional Programming (1996), Addison Wesley
27. Urban C., Pitts A.M., and Gabbay M.J. Nominal unification. Theoretical Computer Science 323 1-3 (2004) 473-497
28. van Benthem J. Modal foundations for predicate logic. Logic Journal of the IGPL 5 2 (1997) 259-286
29. van Benthem J. Higher-order logic. In: Gabbay D.M., and Guenthner F. (Eds). Handbook of Philosophical Logic, vol. 1. 2nd Edition (2001), Kluwer 189-244