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

Cited in

(75)

Cut-elimination in the strict intersection type assignment system is strongly normalizing
From Böhm's theorem to observational equivalences: an informal account
On infinite -expansion
Strong normalization from an unusual point of view
Type inference with recursive types: Syntax and semantics
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
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
Inhabitation for non-idempotent intersection types
Filter models for conjunctive-disjunctive $\lambda$-calculi
Intersection type assignment systems
On the construction of stable models of untyped $\lambda$-calculus
Upper bounds for standardizations and an application
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
European meeting of the Association for Symbolic Logic, Mons, Belgium, 1978
Typing and computational properties of lambda expressions
The infinitary lambda calculus of the infinite eta Böhm trees
Intersection types for $\lambda$-trees
A characterization of F-complete type assignments
Type theories, normal forms, and $D_{\infty}$-lambda-models
Polymorphic type inference and containment
Completeness of transfinite evaluation in an extension of the lambda calculus
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
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
scientific article; zbMATH DE number 3827824 (Why is no real title available?)
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
Functional type assignment for Featherweight Java. To Rinus Plasmeijer, in honour of his 61st birthday
The IO- and OI-hierarchies
Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
Infinitary lambda calculus and discrimination of Berarducci trees.
Definability and full abstraction
Approximation and normalization results for typeable term rewriting systems
Light genericity
Semantics of algorithmic languages
Expressive power of typed and type-free programming languages
Intersection and union types
scientific article; zbMATH DE number 3659565 (Why is no real title available?)
scientific article; zbMATH DE number 7577574 (Why is no real title available?)
A discrimination algorithm inside --calculus
Order-incompleteness and finite lambda reduction models
A class of bounded functions, a database language and an extended lambda calculus
Algebraic semantics and complexity of term rewriting systems
On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
Easiness in graph models
Type inference with partial types
Fully abstract models of typed $\lambda$-calculi
Strongly normalising cut-elimination with strict intersection types
Relating graph and term rewriting via Böhm models
Parametric $\lambda $-theories
Degrees of sensible 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
Relational graph models at work
Intersection types and domain operators
Approximation properties of abstract data types
Semantic types and approximation for Featherweight Java
Call-by-value Solvability
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
Uniqueness of Scott's reflexive domain in $P\omega $
scientific article; zbMATH DE number 7204439 (Why is no real title available?)

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)