The Relation between Computational and Denotational Properties for Scott’s {\text{D}}_\infty -Models of the Lambda-Calculus

Cited In (75)

Inhabitation for non-idempotent intersection types
European meeting of the Association for Symbolic Logic, Mons, Belgium, 1978
The infinitary lambda calculus of the infinite eta Böhm trees
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
Functional type assignment for Featherweight Java. To Rinus Plasmeijer, in honour of his 61st birthday
Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
Light genericity
A class of bounded functions, a database language and an extended lambda calculus
Relating graph and term rewriting via Böhm models
Degrees of sensible lambda theories
Relational graph models at work
Title not available (Why is that?)
On infinite $\eta$-expansion
Strong normalization from an unusual point of view
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
Type inference with recursive types: Syntax and semantics
The heart of intersection type assignment: Normalisation proofs revisited
Recursively defined domains and their induction principles
State-transition machines for lambda-calculus expressions
State-transition machines, revisited
On the construction of stable models of untyped $\lambda$-calculus
Upper bounds for standardizations and an application
Intersection type assignment systems
Filter models for conjunctive-disjunctive $\lambda$-calculi
Substitution revisited
Sequential algorithms on concrete data structures
The origins of structural operational semantics
Strictness analysis of the untyped $\lambda$-calculus
Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
Normalization, approximation, and semantics for combinator systems
Full abstraction and limiting completeness in equational languages
$\mathbb{T}^\omega$ as a universal domain
Intersection types for $\lambda$-trees
Typing and computational properties of lambda expressions
Completeness of transfinite evaluation in an extension of the lambda calculus
A characterization of F-complete type assignments
Type theories, normal forms, and $D_{\infty}$-lambda-models
Polymorphic type inference and containment
A domain-theoretic approach to functional and logic programming
Innocent game models of untyped $\lambda$-calculus
On the semantics of the call-by-name CPS transform
Title not available (Why is that?)
Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
From computation to foundations via functions and application: The $\lambda$-calculus and its webbed models
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
The IO- and OI-hierarchies
Infinitary lambda calculus and discrimination of Berarducci trees.
Approximation and normalization results for typeable term rewriting systems
Definability and full abstraction
Semantics of algorithmic languages
Expressive power of typed and type-free programming languages
Intersection and union types
Title not available (Why is that?)
Title not available (Why is that?)
A discrimination algorithm inside $\lambda -\beta$-calculus
Order-incompleteness and finite lambda reduction models
Algebraic semantics and complexity of term rewriting systems
On Church's formal theory of functions and functionals. The $\lambda$- calculus: Connections to higher type recursion theory, proof theory, category theory
Easiness in graph models
Strongly normalising cut-elimination with strict intersection types
Type inference with partial types
Fully abstract models of typed $\lambda$-calculi
Parametric $\lambda $-theories
The insensitivity theorem for nonreducing reflexive types
Relating graph and term rewriting via Böhm models
A General Class of Models of $\mathcal{H}^*$
Intersection types for combinatory logic
Intersection types and domain operators
Approximation properties of abstract data types
Call-by-value Solvability
Semantic types and approximation for Featherweight Java
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
Uniqueness of Scott's reflexive domain in $P\omega $
From Böhm's theorem to observational equivalences: an informal account
Cut-elimination in the strict intersection type assignment system is strongly normalizing

This page was built for publication: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4115133)