|
26
|
Call-by-Name, Call-by-Value, Call-by-Need, and the Linear Lambda Calculus
– John Maraist, Martin Odersky, David N. Turner, Philip Wadler
- 1994
|
|
31
|
Linear Logic, Monads and the Lambda Calculus
– Nick Benton, Philip Wadler
- 1996
|
|
51
|
Computational Types from a Logical Perspective I
– P.N. Benton, G.M. Bierman, V.C.V. de Paiva
- 1995
|
|
75
|
A Taste of Linear Logic
– Philip Wadler
- 1993
|
|
61
|
Models of Sharing Graphs: A Categorical Semantics of let and letrec
– Masahito Hasegawa
- 1997
|
|
17
|
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory
– Marcelo Fiore, Gordon D. Plotkin
- 1997
|
|
2
|
Separating Weakening and Contraction in a Linear Lambda Calculus
– John Maraist
- 1996
|
|
21
|
Operational Interpretations of Linear Logic
– David N. Turner, Philip Wadler
- 1998
|
|
7
|
Recursive Types in Kleisli Categories
– Alex K. Simpson
- 1992
|
|
|
A Unified Approach to Strictness Analysis and Optimising Transformations
– Benton University, P. N. Benton
- 1996
|
|
53
|
A Brief Guide to Linear Logic
– Andre Scedrov
- 1993
|
|
38
|
A lambda calculus for quantum computation
– AndrĂ© Van Tonder
|
|
3
|
Categories for Computation in Context and Unified Logic: The "Intuitionist" Case
– R. F. Blute, J.R.B. Cockett, R.A.G. Seely
- 1997
|
|
27
|
Parameterised notions of computation
– Robert Atkey
- 2006
|
|
94
|
How to Declare an Imperative
– Philip Wadler
- 1995
|
|
39
|
Geometry of Interaction and Linear Combinatory Algebras
– Samson Abramsky, Esfandiar Haghverdi, Philip Scott
- 2000
|
|
6
|
Semantics of linear continuation-passing in call-by-name
– Masahito Hasegawa
- 2004
|
|
31
|
A Semantic analysis of control
– James David Laird
- 1998
|
|
5
|
Lightweight linear types in system F o
– Karl Mazurak, Jianzhou Zhao, Steve Zdancewic
- 2010
|