Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Parallel reductions in λ-calculus
Journal of Symbolic Computation
Operational, denotational and logical descriptions: a case study
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Full abstraction in the lazy lambda calculus
Information and Computation
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Operational semantics and extensionality
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Types and programming languages
Types and programming languages
Final Semantics for untyped lambda-calculus
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
The call-by-value λ-calculus: a semantic investigation
Mathematical Structures in Computer Science
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Calculi, types and applications
Theoretical Computer Science
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Strong normalization from an unusual point of view
Theoretical Computer Science
An operational characterization of strong normalization
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
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 output values.