Inductive-data-type Systems

Abstract : In a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching definitions following a certain format, called the ''General Schema'', which generalizes the usual recursor definitions for natural numbers and similar ''basic inductive types''. This combined language was shown to be strongly normalizing. The purpose of this paper is to reformulate and extend the General Schema in order to make it easily extensible, to capture a more general class of inductive types, called ''strictly positive'', and to ease the strong normalization proof of the resulting system. This result provides a computation model for the combination of an algebraic specification language based on abstract data types and of a strongly typed functional language with strictly positive inductive types.
Document type :
Journal articles
Theoretical Computer Science, Elsevier, 2002, <10.1016/S0304-3975(00)00347-9>
Liste complète des métadonnées
Contributor : Frédéric Blanqui <>
Submitted on : Friday, September 13, 2013 - 12:32:14 PM
Last modification on : Wednesday, January 4, 2017 - 4:21:49 PM
Document(s) archivé(s) le : Thursday, April 6, 2017 - 7:25:19 PM


Files produced by the author(s)




Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada. Inductive-data-type Systems. Theoretical Computer Science, Elsevier, 2002, <10.1016/S0304-3975(00)00347-9>. <inria-00105578v2>



Record views


Document downloads