Effectively given domains and lambda-calculus models
From MaRDI portal
Publication:3734353
DOI10.1016/S0019-9958(84)80009-1zbMath0599.03008MaRDI QIDQ3734353
Publication date: 1984
Published in: Information and Control (Search for Journal in Brave)
Theory of numerations, effectively presented structures (03D45) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (10)
A computable expression of closure to efficient causation ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Effective inseparability in a topological setting ⋮ A category-theoretic characterization of functional completeness ⋮ On effective topological spaces ⋮ Total sets and objects in domain theory ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ Stability and computability in coherent domains ⋮ Effective λ-models versus recursively enumerable λ-theories
This page was built for publication: Effectively given domains and lambda-calculus models
