References

  1. Beniamino Accattoli (2017): The complexity of abstract machines. In: WPTE 2016, EPTCS 235, pp. 1–15, doi:10.4204/EPTCS.235.1.
  2. Beniamino Accattoli, Pablo Barenbaum & Damiano Mazza (2014): Distilling abstract machines. In: ICFP 2014. ACM, pp. 363–376, doi:10.1145/2628136.2628154.
  3. Beniamino Accattoli & Bruno Barras (2017): Environments and the complexity of abstract machines. In: PPDP 2017. ACM, pp. 4–16, doi:10.1145/3131851.3131855.
  4. Beniamino Accattoli & Ugo Dal Lago (2016): (Leftmost-outermost) beta reduction is invariant, indeed. Logical Methods in Comp. Sci. 12(1), doi:10.2168/LMCS-12(1:4)2016.
  5. Beniamino Accattoli & Stefano Guerrini (2009): Jumping boxes. In: CSL 2009, Lect. Notes Comp. Sci. 5771. Springer, pp. 55–70, doi:10.1007/978-3-642-04027-6_7.
  6. Beniamino Accattoli & Claudio Sacerdoti Coen (2014): On the value of variables. In: WoLLIC 2014, Lect. Notes Comp. Sci. 8652. Springer, pp. 36–50, doi:10.1007/978-3-662-44145-9_3.
  7. Pierre Crégut (2007): Strongly reducing variants of the Krivine abstract machine. Higher-Order and Symbolic Computation 20(3), pp. 209–230, doi:10.1007/s10990-007-9015-z.
  8. Vincent Danos & Laurent Regnier (1996): Reversible, irreversible and optimal lambda-machines. Elect. Notes in Theor. Comp. Sci. 3, pp. 40–60, doi:10.1016/S1571-0661(05)80402-5.
  9. Olivier Danvy, Kevin Millikin, Johan Munk & Ian Zerny (2012): On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation. Theor. Comp. Sci. 435, pp. 21–42, doi:10.1016/j.tcs.2012.02.023.
  10. Olivier Danvy & Ian Zerny (2013): A synthetic operational account of call-by-need evaluation. In: PPDP 2013. ACM, pp. 97–108, doi:10.1145/2505879.2505898.
  11. Maribel Fernández & Ian Mackie (2002): Call-by-value lambda-graph rewriting without rewriting. In: ICGT 2002, LNCS 2505. Springer, pp. 75–89, doi:10.1007/3-540-45832-8_8.
  12. Maribel Fernández, Ian Mackie & François-Régis Sinot (2005): Closed reduction: explicit substitutions without alpha-conversion. Math. Struct. in Comp. Sci. 15(2), pp. 343–381, doi:10.1017/S0960129504004633.
  13. Maribel Fernández & Nikolaos Siafakas (2009): New developments in environment machines. Elect. Notes in Theor. Comp. Sci. 237, pp. 57–73, doi:10.1016/j.entcs.2009.03.035.
  14. Jean-Yves Girard (1987): Linear logic. Theor. Comp. Sci. 50, pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  15. Jean-Yves Girard (1989): Geometry of Interaction I: interpretation of system F. In: Logic Colloquium 1988, Studies in Logic & Found. Math. 127. Elsevier, pp. 221–260, doi:10.1016/S0049-237X(08)70271-4.
  16. Naohiko Hoshino, Koko Muroya & Ichiro Hasuo (2014): Memoryful Geometry of Interaction: from coalgebraic components to algebraic effects. In: CSL-LICS 2014. ACM, pp. 52:1–52:10, doi:10.1145/2603088.2603124.
  17. Aleks Kissinger (2012): Pictures of processes: automated graph rewriting for monoidal categories and applications to quantum computing. CoRR abs/1203.0202. Available at http://arxiv.org/abs/1203.0202.
  18. Peter Landin (1964): The mechanical evaluation of expressions. The Comp. Journ. 6(4), pp. 308–320, doi:10.1093/comjnl/6.4.308.
  19. Ian Mackie (1995): The Geometry of Interaction machine. In: POPL 1995. ACM, pp. 198–208, doi:10.1145/199448.199483.
  20. John Maraist, Martin Odersky, David N. Turner & Philip Wadler (1999): Call-by-name, call-by-value, call-by-need and the linear lambda calculus. Theor. Comp. Sci. 228(1-2), pp. 175–210, doi:10.1016/S0304-3975(98)00358-2.
  21. Paul-André Melliès (2006): Functorial boxes in string diagrams. In: CSL 2006, Lect. Notes Comp. Sci. 4207. Springer, pp. 1–30, doi:10.1007/11874683_1.
  22. Koko Muroya & Dan R. Ghica (2017): The dynamic Geometry of Interaction machine: a call-by-need graph rewriter. In: CSL 2017, LIPIcs 82, pp. 32:1–32:15, doi:10.4230/LIPIcs.CSL.2017.32.
  23. Gordon Plotkin (1975): Call-by-name, call-by-value and the lambda-calculus. Theor. Comp. Sci. 1(2), pp. 125–259, doi:10.1016/0304-3975(75)90017-1.
  24. Ulrich Schöpp (2014): Call-by-value in a basic logic for interaction. In: APLAS 2014, Lect. Notes Comp. Sci. 8858. Springer, pp. 428–448, doi:10.1007/978-3-319-12736-1_23.
  25. Peter Sestoft (1997): Deriving a lazy abstract machine. J. Funct. Program. 7(3), pp. 231–264, doi:10.1017/S0956796897002712.
  26. François-Régis Sinot (2005): Call-by-name and call-by-value as token-passing interaction nets. In: TLCA 2005, Lect. Notes Comp. Sci. 3461. Springer, pp. 386–400, doi:10.1007/11417170_28.
  27. François-Régis Sinot (2006): Call-by-need in token-passing nets. Math. Struct. in Comp. Sci. 16(4), pp. 639–666, doi:10.1017/S0960129506005408.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org