Call-by-Value is Dual to Call-by-Name

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 8, Issue , 2003, Pages 189-201

  Wadler, Philip ^a  

^a AVAYA LABS RESEARCH   (United States)

Author keywords

Curry Howard correspondence; De Morgan dual; Lambda calculus; Lambda mu calculus; Logic; Natural deduction; Sequent calculus

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; SEMANTICS; SYNTACTICS; THEOREM PROVING;

CURRY-HOWARD CORRESPONDENCE; DE MORGAN DUAL; LAMBDA CALCULAS; LAMBDAMU CALCULUS; NATURAL DEDUCTION; SEQUENT CALCULUS;

COMPUTER SCIENCE;

EID: 1142275464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/944705.944723     Document Type: Conference Paper

References (36)

1. ZENA ARIOLA AND HUGO HERBELIN (2003) Minimal classical logic and control operators. In 30'th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands.
2. F. BARBANERA AND S. BERARDI (1996) A symmetric lambda calculus for classical program extraction. Information and Computation, 125(2):103-117.
3. P. BERNAYS (1936) Review of "Some Properties of Conversion" by Alonzo Church and J. B. Rosser. Journal of Symbolic Logic, 1:74-75.
4. GEORGE BOOLE (1847) The mathematical analysis of logic. Macmillan, Barclay, and Macmillan, Cambridge.
5. ALONZO CHURCH (1932) A set of postulates for the foundation of logic. Annals of Mathematics, II.33:346-366.
6. ALONZO CHURCH (1940) A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68.
7. P.-L. CURIEN AND H. HERBELIN (2000) The duality of computation. In 5'th International Conference on Functional Programming, pages 233-243, ACM, September 2000.
8. H. B. CURRY AND R. FEYS (1958) Combinatory Logic. North-Holland (see Chapter 9, Section E).
9. V. DANOS, J-B. JOINET AND H. SCHELLINX (1995) LKQ and LKT: Sequent calculi for second order logic based upon linear decomposition of classical implication. In Advances in Linear Logic, J-Y. Girard, Y Lafont and L. Regnier editors, London Mathematical Society Lecture Note Series 222, Cambridge University Press, pp. 211-224.
10. N. G. DE BRUIJN (1968) The mathematical language Automath, its usage, and some of its extensions. In Symposium on Automatic Demonstration, Versailles, 1968, pages 29-61. Springer-Verlag, Lecture Notes in Mathematics 125, 1970.
11. M. FELLEISEN, D. FRIEDMAN, E. KOHLBECKER, AND B. DUBA (1986) Reasoning with continuations. In Proceedings of the First Symposium on Logic in Computer Science, pages 131-141, IEEE.
12. ANDRZEJ FILINSKI (1989) Declarative continuations and categorical duality. Master's thesis, University of Copenhagen, Copenhagen, Denmark, August 1989. (DIKU Report 89/11.)
13. GOTTLOB FREGE (1879) Begriffsschrift,a formula language, modeled upon that of arithmetic, for pure thought. Halle. Reprinted in Jan van Heijenoort, editor, From Frege to Gödel, A Sourcebook in Mathematical Logic, 1879-1931, Harvard University Press, 1967.
14. GOTTLOB FREGE (1879) Begriffsschrift,a formula language, modeled upon that of arithmetic, for pure thought. Halle. Reprinted in Jan van Heijenoort, editor, From Frege to Gödel, A Sourcebook in Mathematical Logic, 1879-1931, Harvard University Press, 1967.
15. GERHARD GENTZEN (1935) Investigations into Logical Deduction. Mathematische Zeitschrift 39:176-210, 405-431. Reprinted in M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, North-Holland, 1969.
16. GERHARD GENTZEN (1935) Investigations into Logical Deduction. Mathematische Zeitschrift 39:176-210, 405-431. Reprinted in M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, North-Holland, 1969.
17. JOSEPH DIAZ GERGONNE (1826) Annales de mathématique pures et appliquées, 16:209.
18. TIMOTHY GRIFFIN (1990) A formulae-as-types notion of control. In 17'th Symposium on Principles of Programming Languages, San Francisco, CA, ACM, January 1990.
19. IVOR GRATTAN GUINNESS (2000) The Search for Mathematical Roots 1870-1940. Princeton University Press.
20. HUGO HERBELIN (1994) A lambda-calculus structure isomorphic to sequent calculus structure. In Computer Science Logic, pages 61-75, Springer-Verlag, LNCS 933.
21. M. HOFMANN AND T. STREICHER (1997) Continuation models are universal for λμ-calculus. In Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 387-397.
22. EUGENIO MOGGI (1988) Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-66, Edinburgh University, Department of Computer Science.
23. P. H. NIDDITCH (1969) The Development of Mathematical Logic. Thoemmes Press, Bristol (reprinted 1998).
24. C.-H. L. ONG (1996) A semantic view of classical proofs: Type-theoretic, categorical, and denotational characterizations. In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 230-241.
25. C.-H. L. ONG AND C. A. STEWART (1997) A Curry-Howard foundation for functional computation with control. In Proceedings of the Symposium on Principles of Programming Languages, pages 215-227.
26. M. PARIGOT (1992) λμ-calculus: an algorithmic interpretation of classical natural deduction. In LPAR 1992, pages 190-201, Springer-Verlag, LNCS 624.
27. G. D. PLOTKIN (1975) Call-by-name, call-by-value and the A-calculus. In Theoretical Computer Science, 1:125-159.
28. JEAN-VICTOR PONCELET (1818) Annales de mathématique pures et appliquées, 8:201.
29. DAG PRAWITZ (1965) Natural Deduction: A Proof-Theoretical Study. Almqvist and Wiksell, Stockholm.
30. JOHN REYNOLDS (1993) The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4):233-248.
31. AMR SABRY AND MATTHIAS FELLEISEN (1993) Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation, 6(3/4):289-360.
32. AMR SABRY AND PHILIP WADLER (1997) A reflection on call-by-value. In ACM Transactions on Programming Languages and Systems, 19(6):916-941.
33. F. W. K. E. SCHRÖDER (1890) Vorlesungen über die Algebra der Logik (Teachings on the Algebra of Logic), Volume 1. Teubner Press, Leibzig.
34. PETER SELINGER (1998) Control categories and duality: an axiomatic approach to the semantics of functional control. Talk presented at Mathematical Foundations of Programming Semantics, London, May 1998.
35. PETER SELINGER (2001) Control categories and duality: on the categorical semantics of the lambda-mu calculus. In Mathematical Structures in Computer Science, 11:207-260.
36. GERALD JAY SUSSMAN AND GUY LEWIS STEELE JR. (1975) Scheme: an interpreter for extended lambda calculus. MIT AI Memo 319, December 1975.