skip to main content
research-article
Open Access

The theory of call-by-value solvability

Published:31 August 2022Publication History
Skip Abstract Section

Abstract

The semantics of the untyped (call-by-name) lambda-calculus is a well developed field built around the concept of solvable terms, which are elegantly characterized in many different ways. In particular, unsolvable terms provide a consistent notion of meaningless term. The semantics of the untyped call-by-value lambda-calculus (CbV) is instead still in its infancy, because of some inherent difficulties but also because CbV solvable terms are less studied and understood than in call-by-name. On the one hand, we show that a carefully crafted presentation of CbV allows us to recover many of the properties that solvability has in call-by-name, in particular qualitative and quantitative characterizations via multi types. On the other hand, we stress that, in CbV, solvability plays a different role: identifying unsolvable terms as meaningless induces an inconsistent theory.

References

  1. Samson Abramsky. 1991. Domain Theory in Logical Form. Ann. Pure Appl. Log., 51, 1-2 (1991), 1–77. https://doi.org/10.1016/0168-0072(91)90065-T Google ScholarGoogle ScholarCross RefCross Ref
  2. Beniamino Accattoli. 2015. Proof nets and the call-by-value λ -calculus. Theor. Comput. Sci., 606 (2015), 2–24. https://doi.org/10.1016/j.tcs.2015.08.006 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Beniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, and Claudio Sacerdoti Coen. 2019. Crumbling Abstract Machines. In Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, PPDP 2019, Porto, Portugal, October 7-9, 2019. ACM, 4:1–4:15. https://doi.org/10.1145/3354166.3354169 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Beniamino Accattoli, Andrea Condoluci, and Claudio Sacerdoti Coen. 2021. Strong Call-by-Value is Reasonable, Implosively. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. IEEE, 1–14. https://doi.org/10.1109/LICS52264.2021.9470630 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Beniamino Accattoli and Ugo Dal Lago. 2012. On the Invariance of the Unitary Cost Model for Head Reduction. In 23rd International Conference on Rewriting Techniques and Applications (RTA’12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 22–37. https://doi.org/10.4230/LIPIcs.RTA.2012.22 Google ScholarGoogle ScholarCross RefCross Ref
  6. Beniamino Accattoli, Ugo Dal Lago, and Gabriele Vanoni. 2021. The (In)Efficiency of interaction. Proc. ACM Program. Lang., 5, POPL (2021), 1–33. https://doi.org/10.1145/3434332 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Beniamino Accattoli, Ugo Dal Lago, and Gabriele Vanoni. 2021. The Space of Interaction. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. IEEE, 1–13. https://doi.org/10.1109/LICS52264.2021.9470726 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Beniamino Accattoli, Stéphane Graham-Lengrand, and Delia Kesner. 2018. Tight typings and split bounds. PACMPL, 2, ICFP (2018), 94:1–94:30. https://doi.org/10.1145/3236789 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Beniamino Accattoli and Giulio Guerrieri. 2016. Open Call-by-Value. In Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Hanoi, Vietnam, November 21-23, 2016, Proceedings (Lecture Notes in Computer Science, Vol. 10017). Springer, 206–226. https://doi.org/10.1007/978-3-319-47958-3_12 Google ScholarGoogle ScholarCross RefCross Ref
  10. Beniamino Accattoli and Giulio Guerrieri. 2018. Types of Fireballs. In Programming Languages and Systems - 16th Asian Symposium, APLAS 2018, Wellington, New Zealand, December 2-6, 2018, Proceedings (Lecture Notes in Computer Science, Vol. 11275). Springer, 45–66. https://doi.org/10.1007/978-3-030-02768-1_3 Google ScholarGoogle ScholarCross RefCross Ref
  11. Beniamino Accattoli and Giulio Guerrieri. 2022. The Theory of Call-by-Value Solvability (long version). CoRR, abs/2207.08697 (2022), arxiv:2207.08697 Google ScholarGoogle Scholar
  12. Beniamino Accattoli, Giulio Guerrieri, and Maico Leberle. 2019. Types by Need. In Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings (Lecture Notes in Computer Science, Vol. 11423). Springer, 410–439. https://doi.org/10.1007/978-3-030-17184-1_15 Google ScholarGoogle ScholarCross RefCross Ref
  13. Beniamino Accattoli, Giulio Guerrieri, and Maico Leberle. 2021. Semantic Bounds and Strong Call-by-Value Normalization. CoRR, abs/2104.13979 (2021), arxiv:2104.13979 Google ScholarGoogle Scholar
  14. Beniamino Accattoli and Luca Paolini. 2012. Call-by-Value Solvability, Revisited. In Functional and Logic Programming - 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012. Proceedings. Springer, 4–16. https://doi.org/10.1007/978-3-642-29822-6_4 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Beniamino Accattoli and Claudio Sacerdoti Coen. 2015. On the Relative Usefulness of Fireballs. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. IEEE, 141–155. https://doi.org/10.1109/LICS.2015.23 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Beniamino Accattoli and Claudio Sacerdoti Coen. 2017. On the value of variables. Information and Computation, 255 (2017), 224–242. https://doi.org/10.1016/j.ic.2017.01.003 Google ScholarGoogle ScholarCross RefCross Ref
  17. Sandra Alves, Delia Kesner, and Daniel Ventura. 2019. A Quantitative Understanding of Pattern Matching. In 25th International Conference on Types for Proofs and Programs, TYPES 2019, June 11-14, 2019, Oslo, Norway (LIPIcs, Vol. 175). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 3:1–3:36. https://doi.org/10.4230/LIPIcs.TYPES.2019.3 Google ScholarGoogle ScholarCross RefCross Ref
  18. Henk Barendregt, Mario Coppo, and Mariangiola Dezani-Ciancaglini. 1983. A Filter Lambda Model and the Completeness of Type Assignment. J. Symb. Log., 48, 4 (1983), 931–940. https://doi.org/10.2307/2273659 Google ScholarGoogle ScholarCross RefCross Ref
  19. Hendrik Pieter Barendregt. 1971. Some extensional term models for combinatory logics and λ -calculi. Ph. D. Dissertation. Univ. Utrecht. Google ScholarGoogle Scholar
  20. Hendrik Pieter Barendregt. 1977. Solvability in lambda-calculi. In Colloque international de logique : Clermont-Ferrand, 18-25 juillet 1975, M. Guillaume (Ed.). Éditions du C.N.R.S., Paris. 209–219. Google ScholarGoogle Scholar
  21. Hendrik Pieter Barendregt. 1984. The Lambda Calculus – Its Syntax and Semantics. 103, North-Holland. Google ScholarGoogle Scholar
  22. Alexis Bernadet and Stéphane Lengrand. 2013. Non-idempotent intersection types and strong normalisation. Logical Methods in Computer Science, 9, 4 (2013), https://doi.org/10.2168/LMCS-9(4:3)2013 Google ScholarGoogle ScholarCross RefCross Ref
  23. Antonio Bucciarelli and Thomas Ehrhard. 2001. On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Logic, 109, 3 (2001), 205–241. https://doi.org/10.1016/S0168-0072(00)00056-7 Google ScholarGoogle ScholarCross RefCross Ref
  24. Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, and Andrés Viso. 2020. The Bang Calculus Revisited. In Functional and Logic Programming - 15th International Symposium, FLOPS 2020, Akita, Japan, September 14-16, 2020, Proceedings. Springer, 13–32. https://doi.org/10.1007/978-3-030-59025-3_2 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Antonio Bucciarelli, Delia Kesner, and Simona Ronchi Della Rocca. 2021. Solvability = Typability + Inhabitation. Log. Methods Comput. Sci., 17, 1 (2021), https://doi.org/10.23638/LMCS-17(1:7)2021 Google ScholarGoogle ScholarCross RefCross Ref
  26. Antonio Bucciarelli, Delia Kesner, and Daniel Ventura. 2017. Non-idempotent intersection types for the Lambda-Calculus. Logic Journal of the IGPL, 25, 4 (2017), 431–464. https://doi.org/10.1093/jigpal/jzx018 Google ScholarGoogle ScholarCross RefCross Ref
  27. Alberto Carraro and Giulio Guerrieri. 2014. A Semantical and Operational Account of Call-by-Value Solvability. In Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Grenoble, France, April 5-13, 2014, Proceedings. Springer, 103–118. https://doi.org/10.1007/978-3-642-54830-7_7 Google ScholarGoogle ScholarCross RefCross Ref
  28. Mario Coppo and Mariangiola Dezani-Ciancaglini. 1978. A new type assignment for λ -terms. Arch. Math. Log., 19, 1 (1978), 139–156. https://doi.org/10.1007/BF02011875 Google ScholarGoogle ScholarCross RefCross Ref
  29. Mario Coppo and Mariangiola Dezani-Ciancaglini. 1980. An extension of the basic functionality theory for the λ -calculus. Notre Dame Journal of Formal Logic, 21, 4 (1980), 685–693. https://doi.org/10.1305/ndjfl/1093883253 Google ScholarGoogle ScholarCross RefCross Ref
  30. Mario Coppo, Mariangiola Dezani-Ciancaglini, and Maddalena Zacchi. 1987. Type Theories, Normal Forms and D_∞ -Lambda-Models. Inf. Comput., 72, 2 (1987), 85–116. https://doi.org/10.1016/0890-5401(87)90042-3 Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Pierre-Louis Curien and Hugo Herbelin. 2000. The duality of computation. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP ’00), Montreal, Canada, September 18-21, 2000. 233–243. https://doi.org/10.1145/351240.351262 Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Ugo Dal Lago, Claudia Faggian, and Simona Ronchi Della Rocca. 2021. Intersection types and (positive) almost-sure termination. Proc. ACM Program. Lang., 5, POPL (2021), 1–32. https://doi.org/10.1145/3434313 Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Daniel de Carvalho. 2007. Sémantiques de la logique linéaire et temps de calcul. Université Aix-Marseille II. Google ScholarGoogle Scholar
  34. Daniel de Carvalho. 2018. Execution time of λ -terms via denotational semantics and intersection types. Math. Str. in Comput. Sci., 28, 7 (2018), 1169–1203. https://doi.org/10.1017/S0960129516000396 Google ScholarGoogle ScholarCross RefCross Ref
  35. Daniel de Carvalho, Michele Pagani, and Lorenzo Tortora de Falco. 2011. A semantic measure of the execution time in linear logic. Theor. Comput. Sci., 412, 20 (2011), 1884–1902. https://doi.org/10.1016/j.tcs.2010.12.017 Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Daniel de Carvalho and Lorenzo Tortora de Falco. 2016. A semantic account of strong normalization in linear logic. Inf. Comput., 248 (2016), 104–129. https://doi.org/10.1016/j.ic.2015.12.010 Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Roy Dyckhoff and Stéphane Lengrand. 2007. Call-by-Value lambda-calculus and LJQ. J. Log. Comput., 17, 6 (2007), 1109–1134. https://doi.org/10.1093/logcom/exm037 Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Lavinia Egidi, Furio Honsell, and Simona Ronchi Della Rocca. 1992. Operational, denotational and logical descriptions: a case study. Fundam. Inform., 16, 1 (1992), 149–169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Thomas Ehrhard. 2012. Collapsing non-idempotent intersection types. In Computer Science Logic (CSL’12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France (LIPIcs, Vol. 16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 259–273. https://doi.org/10.4230/LIPIcs.CSL.2012.259 Google ScholarGoogle ScholarCross RefCross Ref
  40. José Espírito Santo. 2020. The Call-By-Value Lambda-Calculus with Generalized Applications. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain, Maribel Fernández and Anca Muscholl (Eds.) (LIPIcs, Vol. 152). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 35:1–35:12. https://doi.org/10.4230/LIPIcs.CSL.2020.35 Google ScholarGoogle ScholarCross RefCross Ref
  41. Álvaro García-Pérez and Pablo Nogueira. 2016. No solvable lambda-value term left behind. Logical Methods in Computer Science, 12, 2 (2016), https://doi.org/10.2168/LMCS-12(2:12)2016 Google ScholarGoogle ScholarCross RefCross Ref
  42. Philippa Gardner. 1994. Discovering Needed Reductions Using Type Theory. In TACS ’94 (Lecture Notes in Computer Science, Vol. 789). Springer, 555–574. isbn:3-540-57887-0 https://doi.org/10.1007/3-540-57887-0_115 Google ScholarGoogle ScholarCross RefCross Ref
  43. Silvia Ghilezan. 2001. Full Intersection Types and Topologies in Lambda Calculus. J. Comput. Syst. Sci., 62, 1 (2001), 1–14. https://doi.org/10.1006/jcss.2000.1703 Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Jean-Yves Girard. 1987. Linear Logic. Theoretical Computer Science, 50 (1987), 1–102. https://doi.org/10.1016/0304-3975(87)90045-4 Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Jean-Yves Girard. 1988. Normal functors, power series and the λ -calculus. Annals of Pure and Applied Logic, 37 (1988), 129–177. https://doi.org/10.1016/0168-0072(88)90025-5 Google ScholarGoogle ScholarCross RefCross Ref
  46. Benjamin Grégoire and Xavier Leroy. 2002. A compiled implementation of strong reduction. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, ICFP ’02. ACM, 235–246. https://doi.org/10.1145/581478.581501 Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Giulio Guerrieri. 2015. Head reduction and normalization in a call-by-value lambda-calculus. In 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE 2015, July 2, 2015, Warsaw, Poland (OASIcs, Vol. 46). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 3–17. https://doi.org/10.4230/OASIcs.WPTE.2015.3 Google ScholarGoogle ScholarCross RefCross Ref
  48. Giulio Guerrieri. 2019. Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus. In Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, DCM/ITRS 2018. (EPTCS, Vol. 293). 57–72. https://doi.org/10.4204/EPTCS.293.5 Google ScholarGoogle ScholarCross RefCross Ref
  49. Giulio Guerrieri, Luca Paolini, and Simona Ronchi Della Rocca. 2015. Standardization of a Call-By-Value Lambda-Calculus. In 13th International Conference on Typed Lambda Calculi and Applications, TLCA 2015, July 1-3, 2015, Warsaw, Poland (LIPIcs, Vol. 38). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 211–225. https://doi.org/10.4230/LIPIcs.TLCA.2015.211 Google ScholarGoogle ScholarCross RefCross Ref
  50. Giulio Guerrieri, Luca Paolini, and Simona Ronchi Della Rocca. 2017. Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. Logical Methods in Computer Science, 13, 4 (2017), https://doi.org/10.23638/LMCS-13(4:29)2017 Google ScholarGoogle ScholarCross RefCross Ref
  51. Hugo Herbelin and Stéphane Zimmermann. 2009. An operational account of Call-by-Value Minimal and Classical λ -calculus in Natural Deduction form. In Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings (Lecture Notes in Computer Science, Vol. 5608). Springer, 142–156. https://doi.org/10.1007/978-3-642-02273-9_12 Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Roger Hindley and Giuseppe Longo. 1980. Lambda-Calculus Models and Extensionality. Mathematical Logic Quarterly, 26, 19-21 (1980), 289–310. https://doi.org/10.1002/malq.19800261902 Google ScholarGoogle ScholarCross RefCross Ref
  53. Furio Honsell and Simona Ronchi Della Rocca. 1992. An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus. J. Comput. Syst. Sci., 45, 1 (1992), 49–75. https://doi.org/10.1016/0022-0000(92)90040-P Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Richard Kennaway, Vincent van Oostrom, and Fer-Jan de Vries. 1999. Meaningless Terms in Rewriting. J. Funct. Log. Program., 1999, 1 (1999). Google ScholarGoogle Scholar
  55. Axel Kerinec, Giulio Manzonetto, and Simona Ronchi Della Rocca. 2021. Call-By-Value, Again!. In 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021 (LIPIcs, Vol. 195). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7:1–7:18. https://doi.org/10.4230/LIPIcs.FSCD.2021.7 Google ScholarGoogle ScholarCross RefCross Ref
  56. Delia Kesner, Loïc Peyrot, and Daniel Ventura. 2021. The Spirit of Node Replication. In Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Proceedings (Lecture Notes in Computer Science, Vol. 12650). Springer, 344–364. https://doi.org/10.1007/978-3-030-71995-1_18 Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Delia Kesner and Pierre Vial. 2020. Consuming and Persistent Types for Classical Logic. In LICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020. 619–632. https://doi.org/10.1145/3373718.3394774 Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. Delia Kesner and Andrés Viso. 2022. Encoding Tight Typing in a Unified Framework. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain (LIPIcs, Vol. 216). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 27:1–27:20. https://doi.org/10.4230/LIPIcs.CSL.2022.27 Google ScholarGoogle ScholarCross RefCross Ref
  59. Assaf J. Kfoury. 2000. A linearization of the Lambda-calculus and consequences. J. Log. Comput., 10, 3 (2000), 411–436. https://doi.org/10.1093/logcom/10.3.411 Google ScholarGoogle ScholarCross RefCross Ref
  60. Jean-Louis Krivine. 1993. Lambda-calculus, types and models. Masson. isbn:978-0-13-062407-9 Google ScholarGoogle Scholar
  61. Søren B. Lassen. 2005. Eager Normal Form Bisimulation. In 20th IEEE Symposium on Logic in Computer Scienc, LICS 2005. IEEE Computer Society, 345–354. https://doi.org/10.1109/LICS.2005.15 Google ScholarGoogle ScholarDigital LibraryDigital Library
  62. Paul Blain Levy, John Power, and Hayo Thielecke. 2003. Modelling environments in call-by-value programming languages. Inf. Comput., 185, 2 (2003), 182–210. https://doi.org/10.1016/S0890-5401(03)00088-9 Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. Giuseppe Longo. 1983. Set-theoretical models of λ -calculus: theories, expansions, isomorphisms. Ann. Pure Appl. Log., 24, 2 (1983), 153–188. https://doi.org/10.1016/0168-0072(83)90030-1 Google ScholarGoogle ScholarCross RefCross Ref
  64. Giulio Manzonetto, Michele Pagani, and Simona Ronchi Della Rocca. 2019. New Semantical Insights Into Call-by-Value λ -Calculus. Fundam. Inform., 170, 1-3 (2019), 241–265. https://doi.org/10.3233/FI-2019-1862 Google ScholarGoogle ScholarCross RefCross Ref
  65. John Maraist, Martin Odersky, David N. Turner, and Philip Wadler. 1999. Call-by-name, Call-by-value, Call-by-need and the Linear λ -Calculus. Theor. Comput. Sci., 228, 1-2 (1999), 175–210. https://doi.org/10.1016/S0304-3975(98)00358-2 Google ScholarGoogle ScholarDigital LibraryDigital Library
  66. Damiano Mazza, Luc Pellissier, and Pierre Vial. 2018. Polyadic Approximations, Fibrations and Intersection Types. Proceedings of the ACM on Programming Languages, 2, POPL (2018), 6:1–6:28. https://doi.org/10.1145/3158094 Google ScholarGoogle ScholarDigital LibraryDigital Library
  67. Eugenio Moggi. 1988. Computational λ -Calculus and Monads. University of Edinburgh. http://www.lfcs.inf.ed.ac.uk/reports/88/ECS-LFCS-88-66/ECS-LFCS-88-66.pdf Google ScholarGoogle Scholar
  68. Eugenio Moggi. 1989. Computational λ -Calculus and Monads. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS ’89), Pacific Grove, California, USA, June 5-8, 1989. IEEE Computer Society, 14–23. https://doi.org/10.1109/LICS.1989.39155 Google ScholarGoogle ScholarCross RefCross Ref
  69. Peter Møller Neergaard and Harry G. Mairson. 2004. Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In ICFP 2004. 138–149. https://doi.org/10.1145/1016850.1016871 Google ScholarGoogle ScholarDigital LibraryDigital Library
  70. Luca Paolini. 2001. Call-by-Value Separability and Computability. In Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings. 74–89. https://doi.org/10.1007/3-540-45446-2_5 Google ScholarGoogle ScholarCross RefCross Ref
  71. Luca Paolini and Simona Ronchi Della Rocca. 1999. Call-by-value Solvability. RAIRO Theor. Informatics Appl., 33, 6 (1999), 507–534. https://doi.org/10.1051/ita:1999130 Google ScholarGoogle ScholarCross RefCross Ref
  72. Andrew M. Pitts. 2012. Howe’s method for higher-order languages. In Advanced Topics in Bisimulation and Coinduction, Davide Sangiorgi and Jan J. M. M. Rutten (Eds.) (Cambridge tracts in theoretical computer science, Vol. 52). Cambridge University Press, 197–232. Google ScholarGoogle Scholar
  73. Gordon D. Plotkin. 1975. Call-by-Name, Call-by-Value and the lambda-Calculus. Theoretical Computer Science, 1, 2 (1975), 125–159. https://doi.org/10.1016/0304-3975(75)90017-1 Google ScholarGoogle ScholarCross RefCross Ref
  74. Gordon D. Plotkin. 1993. Set-Theoretical and Other Elementary Models of the lambda-Calculus. Theor. Comput. Sci., 121, 1&2 (1993), 351–409. https://doi.org/10.1016/0304-3975(93)90094-A Google ScholarGoogle ScholarDigital LibraryDigital Library
  75. Garrel Pottinger. 1980. A type assignment for the strongly normalizable λ -terms. In To HB Curry: essays on combinatory logic, λ -calculus and formalism. 561–577. Google ScholarGoogle Scholar
  76. Alberto Pravato, Simona Ronchi Della Rocca, and Luca Roversi. 1999. The call-by-value ł -calculus: a semantic investigation. Math. Str. in Comput. Sci., 9, 5 (1999), 617–650. Google ScholarGoogle ScholarDigital LibraryDigital Library
  77. Simona Ronchi Della Rocca and Luca Paolini. 2004. The Parametric ł -Calculus – A Metamodel for Computation. Springer. https://doi.org/10.1007/978-3-662-10394-4 Google ScholarGoogle ScholarCross RefCross Ref
  78. Amr Sabry and Matthias Felleisen. 1993. Reasoning about Programs in Continuation-Passing Style. Lisp and Symbolic Computation, 6, 3-4 (1993), 289–360. Google ScholarGoogle ScholarDigital LibraryDigital Library
  79. Amr Sabry and Philip Wadler. 1997. A Reflection on Call-by-Value. ACM Trans. Program. Lang. Syst., 19, 6 (1997), 916–941. https://doi.org/10.1145/267959.269968 Google ScholarGoogle ScholarDigital LibraryDigital Library
  80. Masako Takahashi. 1994. A Simple Proof of the Genericity Lemma. In Logic, Language and Computation (Lecture Notes in Computer Science, Vol. 792). Springer, 117–118. https://doi.org/10.1007/BFb0032397 Google ScholarGoogle ScholarCross RefCross Ref
  81. Christopher P. Wadsworth. 1971. Semantics and pragmatics of the lambda-calculus. University of Oxford. Google ScholarGoogle Scholar
  82. Christopher P. Wadsworth. 1976. The Relation Between Computational and Denotational Properties for Scott’s D_∞ -Models of the Lambda-Calculus. SIAM J. Comput., 5, 3 (1976), 488–521. https://doi.org/10.1137/0205036 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The theory of call-by-value solvability

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!