DMCA
Inductive-Data-Type Systems (2002)
Cached
Download Links
| Citations: | 821 - 23 self |
BibTeX
@MISC{Blanqui02inductive-data-typesystems,
author = {Frederic Blanqui and Jean-Pierre Jouannaud and Mitsuhiro Okada},
title = {Inductive-Data-Type Systems},
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #-calA#Ik enriched by pattern-matching definitions folnitio a certain format,calat the "General Schema", whichgeneral39I theusual recursor definitions fornatural numbers and simil9 "basic inductive types". This combined lmbined was shown to bestrongl normalIk39f The purpose of this paper is toreformul33 and extend theGeneral Schema in order to make it easil extensibl3 to capture a more general cler of inductive types, cals, "strictly positive", and to ease the strong normalgAg9Ik proof of theresulGGg system. Thisresul provides a computation model for the combination of anal"DAfGI specification language based on abstract data types and of astrongl typed functional language with strictly positive inductive types.
Keyphrases
inductive-data-type system abstract data type certain format anal dafgi specification language extend thegeneral schema pattern-matching definition positive inductive type theusual recursor definition fornatural number inductive type computation model general cler previous work theresulggg system strongl normal3zg9 alrmal rewrite system functional language abstract data type system simil9 basic inductive type strong normalgag9ik proof typed cala ik general schema
