Fr'ed'eric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive data type systems. To appear in Theoretical Computer Science, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Specification and Verification of a Formal System for Structurally .. - Abel (2000) (1 citation) (Correct)
....for structural recursion which he calls guarded by destructors [Gim95] He gives, however, no proof for the soundness of his criterion. Furthermore we believe that our approach is more concise and more flexible in how functions can be defined. Jouannaud, Okada [JO97] and later also Blanqui [BJO00] deal with inductive types, too, but in the area of extensible term rewriting systems. Since they also do not handle mutual recursion, our present approach seems to have the same expressive power than their Extended General Schema. But both approaches differ considerably in the notion of a ....
Fr'ed'eric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive data type systems. To appear in Theoretical Computer Science, 2000.
A Predicative Strong Normalisation Proof for a.. - Abel, Altenkirch (2000) (Correct)
....by Ralph Matthes [Mat98] using an impredicative meta theory. Benl presents a predicative strong normalisation proof for non interleaving inductive types [Ben98] but this has not been extended to interleaving inductive types or coinductive types. Jouannaud and Okada [JO97] later with Blanqui [BJO99], also do not treat interleaving inductive types, which they call mutually inductive. Furthermore their normalisation proof is not predicative from our perspective, since they use the theorem of Knaster and Tarski to construct the computability predicates. This requires quantification over all ....
Fr'ed'eric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive data type systems. To appear in Theoretical Computer Science, 1999.
A Predicative Strong Normalisation Proof for a.. - Abel, Altenkirch (Correct)
....by Ralph Matthes [Mat98] using an impredicative meta theory. Benl presents a predicative strong normalisation proof for non interleaving inductive types [Ben98] but this has not been extended to interleaving inductive types or coinductive types. Jouannaud and Okada [JO97] later with Blanqui [BJO99], also do not treat interleaving inductive types, which they call mutually inductive. Furthermore 3 their normalisation proof is not predicative from our perspective, since they use the theorem of Knaster and Tarski to construct the computability predicates. This requires quanti cation over all ....
Frederic Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive data type systems. To appear in Theoretical Computer Science, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC