Abstract:
Sangiorgi has shown that the semantics induced by Milner's encoding of the call-by-name-calculus in the ��-calculus is the equality of L#vy-Longo trees. Later it was realized that Milner's encodings are actually variations on well-known continuation passing style transforms. Then a question is: is the discriminating ability due to ��-calculus features, or is it already ooeered by the cps transform? We show that the latter is true: the semantics induced by the call-by-name cps transform on-terms is L#vy-Longo trees equality.
Citations
|
318
|
The polyadic -calculus: a tutorial
– Milner
- 1991
|
|
295
|
Functions as processes
– Milner
- 1992
|
|
151
|
The lambda calculus
– Barendregt
- 1984
|
|
78
|
The relation between computational and denotational properties for Scott's D1-models of the lambda-calculus
– Wadsworth
- 1976
|
|
65
|
The pi-calculus in direct style
– Boudol
- 1997
|
|
65
|
The reflexive CHAM and the join-calculus
– Fournet, Gonthier
- 1996
|
|
53
|
The Lazy Lambda Calculus in a Concurrency Scenario
– Sangiorgi
- 1994
|
|
48
|
Categorical Structure of Continuation Passing Style
– Thielecke
- 1997
|
|
40
|
A Syntactic Characterization of the Equality in some Models for the Lambda Calculus
– Hyland
- 1976
|
|
27
|
Call-by-name, call-by-value and the -calculus, Theoret
– Plotkin
- 1975
|
|
17
|
Thunks and the -calculus
– Hatcliff, Danvy
- 1997
|
|
12
|
Set-theoretical models of -calculus: theories, expansions, isomorphisms
– Longo
- 1983
|
|
4
|
Applying #: Towards a Basis for Concurrent Imperative Programming
– Odersky
- 1995
|
|
3
|
Calculus, multiplicities and the ��-calculus, INRIA Res
– Boudol, Laneve
- 1995
|
|
3
|
calculus characterizations of some practical -calculus reduction strategies
– Ostheimer, Davie
- 1993
|
|
1
|
An algebraic interpretation of the fiK-calculus; and an application of a labelled -calculus
– Lvy
- 1976
|