Effective λ-models versus recursively enumerable λ-theories

DOI10.1017/S0960129509990053zbMath1186.03023MaRDI QIDQ3643360

Giulio Manzonetto, Antonino Salibra, Chantal Berline

Publication date: 11 November 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

models; effective models; \(\lambda\)-theories; \(\lambda \)-models; recursive enumerablility

Mathematics Subject Classification ID

03B40: Combinatory logic and lambda calculus

Related Items

Easy lambda-terms are not always simple

Cites Work

• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• An extension of basic functionality theory for \(\lambda\)-calculus
• Classical recursion theory. The theory of functions and sets of natural numbers
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• LCF considered as a programming language
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• PCF extended with real numbers
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Order-incompleteness and finite lambda reduction models
• Computability on dl-domains
• Easiness in graph models
• Graph lambda theories
• Lambda Theories of Effective Lambda Models
• Effectively given domains and lambda-calculus models
• The interpretation of unsolvable λ-terms in models of untyped λ-calculus
• βη-complete models for System F
• The Lattice of Lambda Theories
• Topological incompleteness and order incompleteness of the lambda calculus
• Graph models of $\lambda$-calculus at work, and variations
• On the construction of stable models of untyped \(\lambda\)-calculus