References

  1. Andrea Asperti, Vincent Danos, Cosimo Laneve & Laurent Regnier (1994): Paths in the lambda-calculus. In: Logic in Computer Science, 1994. LICS'94. Proceedings., Symposium on. IEEE, pp. 426–436, doi:10.1109/LICS.1994.316048.
  2. Andrea Asperti & Cosimo Laneve (1995): Paths, computations and labels in the lambda-calculus. Theoretical Computer Science 142(2), pp. 277–297, doi:10.1016/0304-3975(94)00279-7.
  3. Ugo Dal Lago (2009): Context semantics, linear logic, and computational complexity. ACM Transactions on Computational Logic (TOCL) 10(4), pp. 25:1–25:32, doi:10.1145/1555746.1555749.
  4. Vincent Danos & Thomas Ehrhard (2011): Probabilistic coherence spaces as a model of higher-order probabilistic computation. Information and Computation 209(6), pp. 966–991, doi:10.1016/j.ic.2011.02.001.
  5. Vincent Danos & Laurent Regnier (1995): Proof-nets and the Hilbert space. In: Jean-Yves Girard, Yves Lafont & Laurent Regnier: Advances in Linear Logic. Cambridge University Press, pp. 307–328, doi:10.1017/CBO9780511629150.016.
  6. Thomas Ehrhard & Laurent Regnier (2003): The differential lambda-calculus. Theoretical Computer Science 309(1), pp. 1–41, doi:10.1016/S0304-3975(03)00392-X.
  7. Thomas Ehrhard & Laurent Regnier (2006): Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. In: Arnold Beckmann, Ulrich Berger, Benedikt Löwe & JohnV. Tucker: Logical Approaches to Computational Barriers, Lecture Notes in Computer Science 3988. Springer Berlin Heidelberg, pp. 186–197, doi:10.1007/11780342_20.
  8. Marc de Falco (2008): The geometry of interaction of differential interaction nets. In: Logic in Computer Science, 2008. LICS'08. 23rd Annual IEEE Symposium on. IEEE, pp. 465–475, doi:10.1109/LICS.2008.23.
  9. Jean-Yves Girard (1989): Geometry of interaction I: Interpretation of System F. Studies in Logic and the Foundations of Mathematics 127, pp. 221–260, doi:10.1016/S0049-237X(08)70271-4.
  10. Georges Gonthier, Martìn Abadi & Jean-Jacques Lévy (1992): The geometry of optimal lambda reduction. In: Proceedings of the 19th ACM SIGPLAN SIGACT symposium on Principles of programming languages, POPL '92. ACM, pp. 15–26, doi:10.1145/143165.143172.
  11. Ian Mackie (1995): The geometry of interaction machine. In: POPL 95 Proceedings of the 22nd ACM SIGPLAN SIGACT symposium on Principles of programming languages. ACM, pp. 198–208, doi:10.1145/199448.199483.
  12. Michele Pagani, Peter Selinger & Benoit Valiron (2014): Applying Quantitative Semantics to Higher-Order Quantum Computing. In: P. Sewell: The 41th Annual ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages, POPL14, San Diego, USA. ACM, doi:10.1145/2535838.2535879.
  13. Jorge Sousa Pinto (2001): Parallel Implementation Models for the Lambda-Calculus Using the Geometry of Interaction. In: Samson Abramsky: Typed Lambda Calculi and Applications, Lecture Notes in Computer Science 2044. Springer Berlin Heidelberg, pp. 385–399, doi:10.1007/3-540-45413-6_30.

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