The Calculus of Algebraic Constructions

Frédéric Blanqui (1) , Jean-Pierre Jouannaud (1) , Mitsuhiro Okada (2)

1 LRI - Laboratoire de Recherche en Informatique
2 Keio University - Department of Philosophy

This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalizes inductive types equipped with higher-order primitive recursion, by providing definitions of functions by pattern-matching which capture recursor definitions for arbitrary non-dependent and non-polymorphic inductive types satisfying a strictly positivity condition. CAC also generalizes the first-order framework of abstract data types by providing dependent types and higher-order rewrite rules.

Keywords: rewriting; termination; lambda-calculus; dependent types; polymorphism

Domains: Logic in Computer Science [cs.LO]

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada. The Calculus of Algebraic Constructions. Rewriting Techniques and Applications, 10th International Conference, RTA-99, Jul 1999, Trento, Italy. ⟨inria-00105545v2⟩