The differential λ μ-calculus

Theoretical Computer Science

Volumn 379, Issue 1-2, 2007, Pages 166-209

  Vaux, Lionel ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Classical logic; Differential lambda calculus; Lambda mu calculus; Linear logic

Indexed keywords

COMPUTATIONAL METHODS; LINEAR SYSTEMS; NUMERICAL METHODS; PROBLEM SOLVING;

CLASSICAL LOGIC; DIFFERENTIAL LAMBDA-CALCULUS; LAMBDA-MU CALCULUS; LINEAR LOGIC;

DIFFERENTIATION (CALCULUS);

EID: 34248374749     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.028     Document Type: Article

References (19)

1. Barendregt H. The Lambda-calculus (1984), North-Holland
2. de Groote P. An environment machine for the lambda-mu calculus. Mathematical Structures in Computer Science 8 (1998) 637-669. Available at http://www.loria.fr/~degroote/papers/mscs98.ps
3. de' Liguoro U., and Piperno A. Nondeterministic extensions of untyped λ-calculus. Information and Computation 122 (1995) 149-177
4. David R., and Py W. Lambda mu-calculus and Böhm's theorem. The Journal of Symbolic Logic 66 1 (2001) 407-413. http://www.lama.univ-savoie.fr/~david/ftp/bohm.ps Available at
5. Ehrhard T. On Köthe sequence spaces and linear logic. Mathematical Structures in Computer Science 12 (2001) 579-623. http://iml.univ-mrs.fr/~ehrhard/pub/kothe.ps.gz Available at
6. Ehrhard T. Finiteness spaces. Mathematical Structures in Computer Science 15 4 (2005) 615-646. http://iml.univ-mrs.fr/~ehrhard/pub/finite.ps.gz Available at
7. Ehrhard T., and Régnier L. The differential lambda-calculus. Theoretical Computer Science 309 (2003) 1-41. http://iml.univ-mrs.fr/~ehrhard/pub/difflamb.ps.gz Available at
8. Thomas Ehrhard, Laurent Régnier, Uniformity and the taylor expansion of ordinary lambda-terms. Available at http://iml.univ-mrs.fr/~ehrhard/pub/resources.ps.gz, 2004
9. Thomas Ehrhard, Laurent Régnier, Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms. Available at http://iml.univ-mrs.fr/~ehrhard/pub/bkt.ps.gz, 2005
10. Girard J.-Y. Linear logic. Theoretical Computer Science 50 (1987) 1-102. http://iml.univ-mrs.fr/~girard/linear.pdf Available at
11. Krivine J.-L. Lambda-calcul, Types et modèles (1990), Masson, Paris
12. Olivier Laurent, Réseaux de preuve polarisés: des réseaux pour LC. Mémoire de D.E.A. de logique et fondements de l'informatique, Université Paris VII, September 1998. Available at http://www.pps.jussieu.fr/~laurent/dea.ps.gz
13. Laurent O. Polarized proof-nets and λ μ-calculus. Theoretical Computer Science 290 1 (2003) 161-188. http://www.pps.jussieu.fr/~laurent/lmpn.ps.gz Available at
14. Michel Parigot, Free deduction: An analysis of computations in classical logic, in: RCLP, 1991, pp. 361-380
15. Parigot M. λ μ-calculus: An algorithmic interpretation of classical natural deduction. LPAR '92: Proceedings of the International Conference on Logic Programming and Automated Reasoning (1992), Springer-Verlag, London 190-201
16. Parigot M. Proofs of strong normalisation for second order classical natural deduction. The Journal of Symbolic Logic 62 4 (1997) 1461-1479
17. Alexis Saurin, Separation with streams in the λ μ-calculus, in: LICS, 2005, pp. 356-365. Revised version available at http://www.eleves.ens.fr/home/saurin/Recherche/Separation_Lambdamu.pdf
18. Streicher T., and Reus B. Classical logic, continuation semantics and abstract machines. Journal of Functional Programming 8 6 (1998) 543-572. http://www.mathematik.tu-darmstadt.de/~streicher/CONT/JFP.ps.gz Available at
19. Lionel Vaux, λ-calculus in an algebraic setting. Available at http://iml.univ-mrs.fr/~vaux/articles/alglam.ps.gz, 2006