Skip to Main content Skip to Navigation

Syntactic theories and the algebra of record terms

Didier Rémy 1
INRIA Rocquencourt
Abstract : Recently, many type systems for records have been proposed. For most of them, the types cannot be describes as the terms of an algebra. In this case, type checking or type inference in the case of first order type systems, cannot be derived from existing algorithms. We define record terms as the terms of an equational algebra. We prove decidability of the unification problem for records terms by showing that its equational theory is syntactic. We derive a complete algorithm and prove its determination. We define a notion of canonical terms and approximations of record terms by canonical terms, and show that approximations commute with unification. We also study generic record terms, which extend record terms to model a form os sharing between terms. We prove that the equational theory of generic record terms and that the corresponding unification algorithm always terminates.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 4:27:35 PM
Last modification on : Thursday, February 11, 2021 - 2:50:07 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:24:04 PM


  • HAL Id : inria-00074804, version 1



Didier Rémy. Syntactic theories and the algebra of record terms. [Research Report] RR-1869, INRIA. 1993. ⟨inria-00074804⟩



Record views


Files downloads