Call-by-value, call-by-name and the logic of values

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1258, Issue , 1997, Pages 431-445

  Stärk, Robert F ^a  

^a UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; RECONFIGURABLE HARDWARE;

CALL-BY-NAME; FIRST ORDER PREDICATE CALCULUS; LAMBDA ABSTRACTION; VALUE EVALUATIONS; VALUE LOGIC;

COMPUTER CIRCUITS;

EID: 0002478296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_54     Document Type: Conference Paper

References (14)

1. Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A call-by-need lambda calculus. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL '95), pages 233-246. ACM Press, 1995.
2. M. J. Beeson. Foundations of Constructive Mathematics. Springer-Ver.lag, 1985.
3. W. Clinger and J. A. Rees. The revised 4 report on the algorithmic language Scheme. ACM LISP Pointers, 4(3), 1991.
4. S. Feferman. A language and axioms for explicit mathematics. In J. N. Crossley, editor, Algebra and Logic, pages 87-139, Berlin, 1975. Springer-Verlag, Lecture Notes in Mathematics 450.
5. S. Feferman. Polymorphic typed lambda-calculi in a type-flee axiomatic flamework. In W. Sieg, editor, Logic and Computation, volume 106 of Contemporary Mathematics, pages 101-136, Providence, Rhode Island, 1990. American Mathematical Society.
6. S. Feferman. Definedness. Technical report, Department of Mathematics, Stanford University, 1995.
7. P. Hudlak, S. Peyton Jones, and P. Wadler. Report on the programming language Haskell, a non-strict purely functional language. ACM SIGPLAN Notices, 27(5), 1992.
8. R. Milner, M. Torte, and R. Harper. The definition of Standard ML. The MIT Press, 1990.
9. G. Plotkin. Call-by-name, call-by-value and the A-calculus. Theoretical Computer Science, 1:125-159, 1975.
10. A. Sabry and P. Wadler. A reflection on call-by-value. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '96), pages 13-24, Philadelphia, Pennsylvania, 1996. ACM Press.
11. R. F. Stärk. Why the constant undefined? Logics of partial and undefined terms for strict and non-strict functional programming languages. Technical Report 96-11, Institute of Informatics, University of Fribourg, Switzerland, 1996.
12. T. Strahm. Partial applicative theories and explicit substitutions. J. of Logic and Computation, 6(1):55-77, 1996.
13. A. S. Troelstra and D. van Dalen. Constructivism in Mathematics: an Introduction. North-Hollland, Amsterdam, 1988.
14. D. A. Turner. An overview of Miranda. ACM SIGPLAN Notices, 21(12):158-166, 1986.