Normalisation of the TheoryTof Cartesian Closed Categories and Conservativity of ExtensionsT[x] ofT

DOI10.1051/ita:1999115zbMath0936.03011OpenAlexW2040138329MaRDI QIDQ4718892

Anne Preller, P. Duroux

Publication date: 17 May 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/221951

zbMATH Keywords

decidabilityCartesian closed categoriesrewrite systemfunctional completenesssimply typed lambda calculusgraph of generatorsinductive definition of normal terms

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40) Foundations, relations to logic and deductive systems (18A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Algebra of constructions. I. The word problem for partial algebras
• Normalization and the Yoneda embedding

This page was built for publication: Normalisation of the TheoryTof Cartesian Closed Categories and Conservativity of ExtensionsT[x] ofT