A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus

Cited in

(37)

From Böhm's theorem to observational equivalences: an informal account
On infinite -expansion
Strong normalization from an unusual point of view
Genericity through stratification
Full abstraction and recursion
On the construction of stable models of untyped -calculus
Relational graph models, Taylor expansion and extensionality
Classical lambda calculus in modern dress
An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
Algebraic interpretation of lambda calculus with resources
$\mathbb{T}^\omega$ as a universal domain
Aλδ-calculus with an algorithmicδ
A syntactical proof of the operational equivalence of two -terms
Intersection types for -trees
Completeness of type assignment in continuous lambda models
A characterization of F-complete type assignments
Type theories, normal forms, and $D_{\infty}$-lambda-models
Polymorphic type inference and containment
Innocent game models of untyped -calculus
On the semantics of the call-by-name CPS transform
Lazy lambda calculus: theories, models and local structure characterization (extended abstract)
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
Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
Böhm's theorem for resource lambda calculus through Taylor expansion
Infinitary lambda calculus and discrimination of Berarducci trees.
Definability and full abstraction
Invertible terms in the lambda calculus
Order-incompleteness and finite lambda reduction models
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
Parametric $\lambda $-theories
A General Class of Models of $\mathcal{H}^*$
Relational graph models at work
Some reasons for generalising domain theory
Call-by-value Solvability
scientific article; zbMATH DE number 7204439 (Why is no real title available?)

This page was built for publication: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus

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