Isomorphism and equational equivalence of continuous \(\lambda\)-models
From MaRDI portal
Publication:1580649
DOI10.1023/A:1005018121791zbMath0964.03015MaRDI QIDQ1580649
Publication date: 16 July 2001
Published in: Studia Logica (Search for Journal in Brave)
Related Items (9)
The interpretation of unsolvable λ-terms in models of untyped λ-calculus ⋮ Easy lambda-terms are not always simple ⋮ Graph easy sets of mute lambda terms ⋮ Easiness in graph models ⋮ Graph lambda theories ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ On the construction of stable models of untyped \(\lambda\)-calculus ⋮ Effective λ-models versus recursively enumerable λ-theories ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
This page was built for publication: Isomorphism and equational equivalence of continuous \(\lambda\)-models
