λ

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

Volumn 2741, Issue , 2003, Pages 136-150

  Hendriks, Dimitri ^a   van Oostrom, Vincent ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; DIFFERENTIATION (CALCULUS); THEOREM PROVING;

ALPHA-EQUIVALENCE; BETA-REDUCTION; LAMBDA CALCULUS; LAMBDA TERMS;

CALCULATIONS;

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

References (26)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991
2. A. Asperti and S. Guerrini. The Optimal Implementation of Functional Programming Languages. Cambridge University Press, 1998
3. H.P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984
4. S. Baro and F. Maurel. The qν and qνk calculi: name capture and control. PPS prépublication 16, Université Denis Diderot, 2003
5. K.J. Berkling. A symmetric complement to the lambda-calculus. Interner Bericht ISF-76-7, GMD, D-5205, St. Augustin 1, West Germany, 1976
6. R.S. Bird and R.A. Paterson. De Bruijn notation as a nested datatype. Journal of Functional Programming, 9(1):77–91, 1999
7. S.C.C. Blom. Term Graph Rewriting, syntax and semantics. PhD thesis, Vrije Universiteit Amsterdam, 2001
8. E. Bonelli. Substitutions explicites et réécriture de termes. PhD thesis, Université Paris XI, 2001
9. L. Cardelli and A.D. Gordon. Mobile ambients. In M. Nivat, editor, FOSSACS ’98, volume 1378 of LNCS, pages 140–155. Springer, 1998
10. C. Chen and H. Xi. Meta-programming through typeful code representation. http://www.cs.bu.edu/$\sim$hwxi/
11. A. Church. A set of postulates for the foundation of logic. Annals of Mathematics, 33:346–366, 1932
12. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. http://www.grappa.univ-lille3.fr/tata
13. R. David and B. Guillaume. A λ-calculus with explicit weakening and explicit substitution. Mathematical Structures for Computer Science, 11:169–206, 2001
14. N.G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34:381–392, 1972
15. R. Di Cosmo, D. Kesner, and E. Polonovski. Proof nets and explicit substitutions. In FOSSACS) ’00, volume 1784 of LNCS, pages 63–81. Springer, 2000
16. A.D. Gordon and T.F. Melham. Five axioms of alpha-conversion. In J. vonWright, J. Grundy, and J. Harrison, editors, TPHOLs ’96, volume 1125 of LNCS, pages 173–190. Springer, 1996
17. M. Hollenberg and C.F.M Vermeulen. Counting variables in a dynamic setting. Journal of Logic and Computation, 6(5):725–744, 1996
18. S. Kahrs. Context rewriting. In M. Rusinowitch and J.-L. Rémy, editors, CTRS ’92, volume 656 of LNCS, pages 21–35. Springer, 1993
19. Y. Lafont. Interaction nets. In POPL ’90, pages 95–108. ACM Press, 1990
20. Y. Lafont. From proof-nets to interaction nets. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series, pages 225–248. Cambridge University Press, 1995
21. J. Lamping. An algorithm for optimal lambda calculus reduction. In POPL ’90, pages 16–30. ACM Press, 1990
22. J.-J. Lévy. Réductions correctes et optimales dans le λ-calcul. Thèse de doctorat d’état, Université Paris VII, 1978
23. J. Parrow. The fusion calculus: Expressiveness and symmetry in mobile processes. In LICS ’98, pages 176–185. IEEE Computer Society, 1998
24. D.E. Schroer. The Church–Rosser Theorem. PhD thesis, Cornell University, 1965
25. Terese. Term Rewriting Systems. Cambridge University Press, 2003
26. R. Vestergaard and J. Brotherston. A formalised first-order confluence proof for the λ-calculus using one-sorted variable names. In A. Middeldorp, editor, RTA ’01, LNCS, pages 306–321. Springer, 2001.