论文信息 - Algebra of Constructions. I. The Word Problem for Partial Algebras

Algebra of Constructions. I. The Word Problem for Partial Algebras

Abstract A new algebraic approach to abstract computing systems based on lambda calculi and cartesian closed categories is proposed. The main result is a new proof of decidability of the word problem for cartesian closed categories. The decidability of this problem is demonstrated by a normal system which is a recursive partial algebra as a free model of some theory of cartesian closed categories.

Adam Obtulowicz

[1] P. Martin-Löf. Constructive mathematics and computer programming , 1984 .

[2] M. E. Szabo. Algebra of proofs , 1978 .

[3] J. Lambek. Functional completeness of cartesian categories , 1974 .

[4] S. Lane. Categories for the Working Mathematician , 1971 .

[5] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .

[6] Adam Obtułowicz,et al. Categorical, functorial and algebraic aspects of the type-free lambda calculus , 1982 .

[7] Georg Kreisel,et al. Foundations of Intuitionistic Logic , 1962 .

[8] George Gratzer,et al. Universal Algebra , 1979 .

[9] H. Lausch,et al. Algebra of Polynomials , 1974 .

[10] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .

[11] Adam Obtułowicz. The logic of categories of partial functions and its applications , 1986 .

[12] R. Seely,et al. Locally cartesian closed categories and type theory , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[13] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .

[14] Alfred Tarski,et al. Equational Logic and Equational Theories of Algebras , 1968 .