Name
Abstract | ||
|---|---|---|
We introduce an untyped -calculus with input-output, based on Gordon's continuation-passing model of input-output. This calculus is intended to allow the classification of possibly infinite input-output behaviors, such as those required for servers or distributed systems. We define two terms to be operationally approximate iff they have similar behaviors in any context. We then define a notion of applicative approximation and show that it coincides with operational approximation for these new behaviors. Last, we consider the theory of pure -terms under this notion of operational equivalence. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-61064-2_46 | CAAP |
Keywords | Field | DocType |
untyped lambda-calculus,lambda calculus,distributed system,input output | Lambda calculus,Algebra,Typed lambda calculus,Normalisation by evaluation,Simply typed lambda calculus,Computer science,System F,Lambda lifting,Church encoding,Higher-order function | Conference |
ISBN | Citations | PageRank |
3-540-61064-2 | 5 | 0.43 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jerzy Tiuryn | 1 | 1210 | 126.00 |
| Mitchell Wand | 2 | 1499 | 293.30 |