Inductive Data Type Systems - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2002

Inductive Data Type Systems

(1) , (1) , (2)
1
2
Mitsuhiro Okada
  • Function : Author
  • PersonId : 835883

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.
Fichier principal
Vignette du fichier
main.pdf (294.83 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00105578 , version 1 (11-10-2006)
inria-00105578 , version 2 (13-09-2013)
inria-00105578 , version 3 (16-02-2018)

Identifiers

Cite

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada. Inductive Data Type Systems. Theoretical Computer Science, 2002, ⟨10.1016/S0304-3975(00)00347-9⟩. ⟨inria-00105578v3⟩
189 View
546 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More