Computability in higher types, P and the completeness of type assignment
From MaRDI portal
(Redirected from Publication:579245)
Computability in higher types, P\(\omega\) and the completeness of type assignment
Computability in higher types, P\(\omega\) and the completeness of type assignment
Recommendations
Cites work
- scientific article; zbMATH DE number 3648679 (Why is no real title available?)
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 3163761 (Why is no real title available?)
- scientific article; zbMATH DE number 3829227 (Why is no real title available?)
- scientific article; zbMATH DE number 3904559 (Why is no real title available?)
- scientific article; zbMATH DE number 3933052 (Why is no real title available?)
- scientific article; zbMATH DE number 3664393 (Why is no real title available?)
- scientific article; zbMATH DE number 3664931 (Why is no real title available?)
- scientific article; zbMATH DE number 3783068 (Why is no real title available?)
- scientific article; zbMATH DE number 3628934 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 3216998 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- A filter lambda model and the completeness of type assignment
- A theory of type polymorphism in programming
- Completeness of type assignment in continuous lambda models
- Computability concepts for programming language semantics
- Computable functionals of finite types
- Data Types as Lattices
- Effective operations on partial recursive functions
- Effectively given domains
- Effectively given domains and lambda-calculus models
- Filter spaces and continuous functionals
- Lambda‐Calculus Models and Extensionality
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- On combinatory algebras and their expansions
- Recursion on the countable functionals
- Recursion theoretic operators and morphisms on numbered sets
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The Principal Type-Scheme of an Object in Combinatory Logic
- The completeness theorem for typing lambda-terms
- The hereditary partial effective functionals and recursion theory in higher types
- The lambda calculus, its syntax and semantics
- The lambda calculus. Its syntax and semantics. Rev. ed.
- What is a model of the lambda calculus?
- \(\lambda\)-calculus and computer science theory. Proceedings of the symposium held in Rome, March 25-27, 1975
- \(\mathbb{T}^\omega\) as a universal domain
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(9)- Higher types, finite domains and resource-bounded Turing machines
- The computational power of \({\mathcal M}^\omega\)
- scientific article; zbMATH DE number 4087654 (Why is no real title available?)
- Constructive natural deduction and its ‘ω-set’ interpretation
- scientific article; zbMATH DE number 3933051 (Why is no real title available?)
- Completeness of type assignment in continuous lambda models
- scientific article; zbMATH DE number 1870418 (Why is no real title available?)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- Interpreting higher computations as types with totality
This page was built for publication: Computability in higher types, P\(\omega\) and the completeness of type assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579245)
