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

Cited in

(37)

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

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)