Partial combinatory algebra and generalized numberings

DOI10.1016/j.tcs.2022.04.054OpenAlexW2981017762MaRDI QIDQ2148902

Sebastiaan A. Terwijn, Hendrik Pieter Barendregt

Publication date: 24 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.07750

zbMATH Keywords

extensionalitypartial combinatory algebramodels of the lambda calculusprecomplete numberings

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizability. An introduction to its categorical side
• Index sets of quotient objects of the Post numeration
• Classical recursion theory. Vol. II
• Extensions of Scott's graph model and Kleene's second algebra
• Fixed point theorems for precomplete numberings
• A Survey on Universal Computably Enumerable Equivalence Relations
• A Note on Positive Equivalence Relations
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Classifying positive equivalence relations
• Higher-Order Computability
• Theorie der Numerierungen I
• The λ-calculus is ω-incomplete
• GENERALIZATIONS OF THE RECURSION THEOREM
• More on Geometric Morphisms between Realizability Toposes