Algebra of constructions. I. The word problem for partial algebras

DOI10.1016/0890-5401(87)90018-6zbMath0653.03010OpenAlexW2081822152MaRDI QIDQ1107515

Adam Obtułowicz

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90018-6

zbMATH Keywords

word problemlambda-calculusnormal systemcartesian closed categoriesalgebra of constructionsalgebraic approach to abstract computing systemspartial equational logicrecursive partial algebra

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Partial algebras (08A55) Combinatory logic and lambda calculus (03B40) Word problems (aspects of algebraic structures) (08A50)

Related Items

Algebra of constructions II: an algebraic approach to Martin-Löf type theory and the calculus of constructions, Categorical models for non-extensional λ-calculi and combinatory logic, A confluent reduction for the λ-calculus with surjective pairing and terminal object, Near-equational and equational systems of logic for partial functions. I, Normalisation of the TheoryTof Cartesian Closed Categories and Conservativity of ExtensionsT[x ofT]

Cites Work

• Algebra of proofs
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Combinators, \(\lambda\)-terms and proof theory
• Locally cartesian closed categories and type theory
• Constructive mathematics and computer programming
• Functional completeness of cartesian categories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item