References

  1. S. Abramsky (1993): Computational Interpretations of Linear Logic. Theoretical Computer Science 111(1&2), pp. 3–57, doi:10.1016/0304-3975(93)90181-R.
  2. B. Accattoli (2015): Proof nets and the call-by-value λ-calculus. Theoretical Computer Science 606, pp. 2–24, doi:10.1016/j.tcs.2015.08.006.
  3. B. Accattoli & G. Guerrieri (2016): Open Call-by-Value. In: Programming Languages and Systems - 14th Asian Symposium (APLAS 2016), Lecture Notes in Computer Science 10017, pp. 206–226, doi:10.1007/978-3-319-47958-3_12.
  4. B. Accattoli & G. Guerrieri (2018): Types of Fireballs. In: Programming Languages and Systems - 16th Asian Symposium (APLAS 2018), Lecture Notes in Computer Science 11275, pp. 45–66, doi:10.1007/978-3-030-02768-1_3.
  5. H. P. Barendregt (1984): The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundation of Mathematics 103. North-Holland, Amsterdam.
  6. P. N. Benton, G. M. Bierman, V. de Paiva & M. Hyland (1993): A Term Calculus for Intuitionistic Linear Logic. In: Typed Lambda Calculi and Applications (TLCA '93), Lecture Notes in Computer Science 664, pp. 75–90, doi:10.1007/BFb0037099.
  7. P. N. Benton & P. Wadler (1996): Linear Logic, Monads and the Lambda Calculus. In: 11th Annual IEEE Symposium on Logic in Computer Science (LICS '96), pp. 420–431, doi:10.1109/LICS.1996.561458.
  8. A. Bucciarelli & T. Ehrhard (2001): On phase semantics and denotational semantics: the exponentials. Annals of Pure and Applied Logic 109(3), pp. 205–241, doi:10.1016/S0168-0072(00)00056-7.
  9. V. Danos (1990): La Logique Linéaire appliqué à l'étude de divers processus de normalisation (principalement du λ-calcul). Université Paris 7.
  10. V. Danos & T. Ehrhard (2011): Probabilistic coherence spaces as a model of higher-order probabilistic computation. Information and Computation 152(1), pp. 111–137, doi:10.1016/j.ic.2011.02.001.
  11. T. Ehrhard (1993): Hypercoherences: A Strongly Stable Model of Linear Logic. Mathematical Structures in Computer Science 3(4), pp. 365–385, doi:10.1017/S0960129500000281.
  12. T. Ehrhard (2005): Finiteness spaces. Mathematical Structures in Computer Science 15(4), pp. 615–646, doi:10.1017/S0960129504004645.
  13. T. Ehrhard (2012): Collapsing non-idempotent intersection types. In: Computer Science Logic (CSL'12), LIPIcs 16, pp. 259–273, doi:10.4230/LIPIcs.CSL.2012.259.
  14. T. Ehrhard (2012): The Scott model of linear logic is the extensional collapse of its relational model. Theoretical Computer Science 424, pp. 20–45, doi:10.1016/j.tcs.2011.11.027.
  15. T. Ehrhard (2016): Call-By-Push-Value from a Linear Logic point of view. In: Programming Languages and Systems - 25th European Symposium on Programming (ESOP 2016), Lecture Notes in Computer Science 9632, pp. 202–228, doi:10.1007/978-3-662-49498-1_9.
  16. T. Ehrhard & G. Guerrieri (2016): The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value. In: Principles and Practice of Declarative Programming (PPDP'16). ACM, pp. 174–187, doi:10.1145/2967973.2968608.
  17. J.-Y. Girard (1987): Linear Logic. Theoretical Computer Science 50(1), pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  18. O. Laurent (2003): Polarized proof-nets and λμ-calculus. Theoretical Computer Science 290(1), pp. 161–188, doi:10.1016/S0304-3975(01)00297-3.
  19. P. B. Levy (1999): Call-by-Push-Value: A Subsuming Paradigm. In: Typed Lambda Calculi and Applications (TLCA'99), Lecture Notes in Computer Science 1581, pp. 228–242, doi:10.1007/3-540-48959-2_17.
  20. P. B. Levy (2006): Call-by-push-value: Decomposing call-by-value and call-by-name. Higher-Order and Symbolic Computation 19(4), pp. 377–414, doi:10.1007/s10990-006-0480-6.
  21. P. Lincoln & J. C. Mitchell (1992): Operational aspects of linear lambda calculus. In: Seventh Annual Symposium on Logic in Computer Science (LICS '92), pp. 235–246, doi:10.1109/LICS.1992.185536.
  22. J. Maraist, M. Odersky, D. N. Turner & P. Wadler (1999): Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus. Theoretical Computer Science 228(1-2), pp. 175–210, doi:10.1016/S0304-3975(98)00358-2.
  23. P.-A. Melliès (2009): Categorical semantics of linear logic. In: Interactive models of computation and program behaviour, Panoramas et Synthèses 27. Société Mathématique de France, pp. 1–196.
  24. E. Moggi (1989): Computational Lambda-Calculus and Monads. In: Fourth Annual Symposium on Logic in Computer Science (LICS '89), pp. 14–23, doi:10.1109/LICS.1989.39155.
  25. E. Moggi (1991): Notions of Computation and Monads. Information and Computation 93(1), pp. 55–92, doi:10.1016/0890-5401(91)90052-4.
  26. A. M. Pitts (1993): Computational Adequacy via ``Mixed'' Inductive Definitions. In: Mathematical Foundations of Programming Semantics (MFPS'93), Lecture Notes in Computer Science 802, pp. 72–82, doi:10.1007/3-540-58027-1.
  27. G. D. Plotkin (1975): Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1(2), pp. 125–159, doi:10.1016/0304-3975(75)90017-1.
  28. A. Pravato, S. Ronchi Della Rocca & L. Roversi (1999): The call-by-value λ-calculus: a semantic investigation. Mathematical Structures in Computer Science 9(5), pp. 617–650, doi:10.1017/S0960129598002722.
  29. L. Regnier (1992): Lambda calcul et réseaux. Université Paris 7.
  30. S. Ronchi Della Rocca & L. Roversi (1997): Lambda Calculus and Intuitionistic Linear Logic. Studia Logica 59(3), pp. 417–448, doi:10.1023/A:1005092630115.
  31. A. Simpson (2005): Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. In: Term Rewriting and Applications (RTA 2005), Lecture Notes in Computer Science 3467, pp. 219–234, doi:10.1007/b135673.
  32. M. Takahashi (1995): Parallel Reductions in lambda-Calculus. Information and Computation 118(1), pp. 120–127, doi:10.1006/inco.1995.1057.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org