Effectively given domains and lambda-calculus models

DOI10.1016/S0019-9958(84)80009-1MaRDI QIDQ3734353zbMATH OpenFDO

Authors Paola Giannini, Giuseppe Longo

Publication date 1984

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(84)80009-1

zbMATH Keywords

computability over modelssemantics

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• Effective λ-models versus recursively enumerable λ-theories
• Lambda Theories of Effective Lambda Models
• Models of the lambda calculus: an introduction
• From term models to domains
• On the completeness of order-theoretic models of the \(\lambda \)-calculus

Cited in

(11)

• An effectively given initial semigroup
• On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
• Total sets and objects in domain theory
• A computable expression of closure to efficient causation
• Effective inseparability in a topological setting
• Effective λ-models versus recursively enumerable λ-theories
• On effective topological spaces
• Computability in higher types, P and the completeness of type assignment
• Representations versus numberings: On the relationship of two computability notions
• Stability and computability in coherent domains
• A category-theoretic characterization of functional completeness

This page was built for publication: Effectively given domains and lambda-calculus models

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