Theoretical Computer Science
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
Types and programming languages
Types and programming languages
(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Parametric parameter passing λ-calculus
Information and Computation
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical 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 |
The parametric lambda calculus subsumes different existing @l-calculi, in particular the classical @l@b-calculus and the @l@b"v-calculus of Plotkin. Previously established results on the parametric calculus, such as confluence and standardization, are primarily syntactical. In this paper our attention is mainly addressed to semantics, although we start again from a syntactical point of view. We propose an analysis of the notion of contextual preorders of usual operational semantics. Given a contextual preorder, we build a parametric complete lattice based on a closure operator. This lattice provides a fully abstract model for the considered preorder, via a completion.