Call-by-name call-by-value, call-by-need and the linear lambda calculus

Authors:
J. Maraist;M. Odersky;D. N. Turner;P. Wadler
Affiliations:
Univ. of Australia, South Australia, Australia;Univ. of Australia, South Australia, Australia;An Teallach Limited, Edinburgh, Scotland, UK;Bell Laboratories, Murray Hill, NJ
Venue:
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Year:
1999

Programming with variable functions

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A Study of Abramsky's Linear Chemical Abstract Machine

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Program equivalence in a linear functional language

Journal of Functional Programming
Natural deduction via graphs: formal definition and computation rules

Mathematical Structures in Computer Science
From parametric polymorphism to models of polymorphic fpc

Mathematical Structures in Computer Science
The structural λ-calculus

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Linear dependent types in a call-by-value scenario

Proceedings of the 14th symposium on Principles and practice of declarative programming

Hi-index	0.00