Parametric parameter passing Lambda-calculus

@article{Paolini2004ParametricPP,
  title={Parametric parameter passing Lambda-calculus},
  author={Luca Paolini and S. Rocca},
  journal={Inf. Comput.},
  year={2004},
  volume={189},
  pages={87-106}
}
A λ-calculus is defined, which is parametric with respect to a set V of input values and subsumes all the different λ-calculi given in the literature, in particular the classical one and the call-by-value λ-calculus of Plotkin. It is proved that it enjoy the confluence property, and a necessary and sufficient condition is given, under which it enjoys the standardization property. Its operational semantics is given through a reduction machine, parametric with respect to both V and a set Vo of… Expand
18 Citations
Parametric lambda -theories
  • Luca Paolini
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2008
  • 1
Lazy Logical Semantics
  • 5
  • PDF
Standardization of a Call-By-Value Lambda-Calculus
  • 18
  • PDF
A standardisation proof for algebraic pattern calculi
  • 4
  • PDF
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
  • 15
  • PDF
An Operational Characterization of Strong Normalization
  • 6
  • PDF
Modules, abstraction, and parametric polymorphism
  • 16
  • PDF
Lazy Strong Normalization
  • 10
  • PDF
Linearity, Non-determinism and Solvability
  • 27
  • PDF
A nonstandard standardization theorem
  • 51
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 20 REFERENCES
Operational semantics and extensionality
  • 7
Final Semantics for untyped lambda-calculus
  • 27
Call-by-value Solvability
  • 48
  • PDF
Notes on Simply Typed Lambda Calculus
  • 29
Call-by-Name, Call-by-Value and the lambda-Calculus
  • G. Plotkin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1975
  • 1,061
  • PDF
Parallel Reductions in lambda-Calculus
  • 27
Full Abstraction in the Lazy Lambda Calculus
  • 284
Introduction to combinators and λ-calculus
  • 577
The duality of computation
  • 427
  • PDF
...
1
2
...