Effective applicative structures

DOI10.1007/3-540-60164-3_21zbMath1502.03010OpenAlexW1583968748MaRDI QIDQ5057467

Andrea Asperti, Agata Ciabattoni

Publication date: 16 December 2022

Published in: Category Theory and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60164-3_21

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Related Items

Collapsing partial combinatory algebras, Introduction to Turing categories

Cites Work

• The discrimination theorem holds for combinatory weak reduction
• Classical recursion theory. The theory of functions and sets of natural numbers
• A discrimination algorithm inside \(\lambda -\beta\)-calculus
• A theory of rules for enumerated classes of functions
• A sufficient condition for completability of partial combinatory algebras
• Partial Applicative Theories and Explicit Substitutions
• Algebraically Generalized Recursive Function Theory
• Uniformly Reflexive Structures: On the Nature of Godelizations and Relative Computability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item