Type theories, normal forms, and D∞-lambda-models
Information and Computation
Research topics in functional programming
Full abstraction in the lazy lambda calculus
Information and Computation
Call-by-Value Separability and Computability
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Parametric parameter passing λ-calculus
Information and Computation
Fully abstract models of the lazy lambda calculus
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
An operational characterization of strong normalization
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Hi-index | 5.23 |
A new complete characterization of @b-strong normalization is given, both in the classical and in the lazy @l-calculus, through the notion of potential valuability inside two suitable parametric calculi.