Type theories, normal forms, and D∞-lambda-models
Information and Computation
Abstract and concrete categories
Abstract and concrete categories
A domain equation for bisimulation
Information and Computation
Operational, denotational and logical descriptions: a case study
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Journal of Computer and System Sciences
Full abstraction in the lazy lambda calculus
Information and Computation
Semantical analysis of perpetual strategies in &lgr;-calculus
Theoretical Computer Science - Special issue: Gentzen
Theoretical Computer Science - Modern algebra and its applications
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
The Y-combinator in Scott''s Lambda-calculus Models
The Y-combinator in Scott''s Lambda-calculus Models
Intersection types and domain operators
Theoretical Computer Science - Logic, semantics and theory of programming
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
The Parametric Lambda Calculus: A Meta-Model for Computation (Texts in Theoretical Computer Science)
The Parametric Lambda Calculus: A Meta-Model for Computation (Texts in Theoretical Computer Science)
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
| Hi-index | 5.23 |
In this paper we introduce a new filter model, which is of a kind that has escaped investigation up to now: it is induced by an intersection type theory generated in a non-standard way, by a preorder which puts into relation an atom with an arrow type, without equating them. We study the domain-theoretic implications of this choice, that are not trivial: in order to describe this filter model a new category is introduced and a special purpose functor defined. The filter model is then characterized as the initial algebra of the functor.