Collapsing partial combinatory algebras

DOI10.1007/3-540-61254-8_19zbMath1434.03048OpenAlexW2110333178MaRDI QIDQ4645804

Jan Willem Klop, Inge Bethke

Publication date: 11 January 2019

Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1388

zbMATH Keywords

congruence relationrecursive functionhomomorphic imagecombinatory logicpartial algebra

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Partial algebras (08A55) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A simple model construction for the Calculus of Constructions ⋮ Introduction to Turing categories ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Algebras and combinators
• Finite type structures within combinatory algebras
• Constructivism in mathematics. An introduction. Volume II
• Some new results on easy lambda-terms
• Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
• On the existence of extensional partial combinatory algebras
• Data Types as Lattices
• Effective applicative structures
• Algebraically Generalized Recursive Function Theory
• Uniformly Reflexive Structures: On the Nature of Godelizations and Relative Computability

This page was built for publication: Collapsing partial combinatory algebras