395

LCF considered as a programming language
– G Plotkin
 1977

130

LambdaCalculus Models of Programming Languages
– J H Morris
 1968

92

Algebraically complete categories
– P Freyd
 1990

1565

The Definition of Standard ML
– Robin Milner, Mads Tofte
 1990

105

Functional Programming and Input/Output
– Andrew D Gordon
 1993

121

Bisimilarity as a theory of functional programming
– A D Gordon

3219

Communication and Concurrency
– R Milner
 1990

231

Domain Theory in Logical Form
– Samson Abramsky
 1991

40

A Coinduction Principle for Recursively Defined Domains
– Andrew M. Pitts
 1992

110

Fully abstract models of typed lambda calculi
– R Milner
 1977

43

New Foundations for Fixpoint Computations: FIXHyperdoctrines and the FIXLogic
– R L Crole, A M Pitts
 1990

62

Remarks on algebraically compact categories
– P J Freyd
 1991

123

A domain equation for bisimulation
– S Abramsky
 1991

267

Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series
– C Gunter
 1992

39

An extension of the basic functionality theory for the calculus
– M Coppo, M DezaniCiancaglini
 1980

315

Functions as processes
– R Milner
 1990

55

The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract)
– Davide Sangiorgi
 1994

83

Control operators, the SECD machine and the calculus
– M Felleisen, D P Friedman
 1986

41

Lambdacalculi for (strict) parallel functions
– G BOUDOL
 1992
