LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Research topics in functional programming
Intersection and union types: syntax and semantics
Information and Computation
Duality beyond sober spaces: topological spaces and observation frames
Selected papers of the workshop on Topology and completion in semantics
Toward an infinitary logic of domains: Abramsky logic for transition systems
Information and Computation
Compositional Characterizations of lambda-Terms Using Intersection Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
A type theory with infinitary intersection and union types for the lazy 驴-calculus is introduced. Types are viewed as upper closed subsets of a Scott domain. Intersection and union type constructors are interpreted as the set-theoretic intersection and union, respectively, even when they are not finite. The assignment of types to 驴-terms extends naturally the basic type assignment system. We prove soundness and completeness using a generalization of Abramsky's finitary domain logic for applicative transition systems.