Unknown (ResearchIndex)

See this document in CiteSeerX!

Unknown (Make Corrections)
A Methodology for Implementing Inductive Schemata Yong Luo and Zhaohui Luo...

Rate this article:

(Enter summary)
Abstract: Here, we give recursive denitions for elimination rule and computation rules of inductive schemata. The new denitions are good for implementing inductive types, and one can get algorithms form them straightforwardly; and have been implemented in a type checker. 1 Inductive data types A strictly positive operator with respect to a variable (placeholder) Y : (s 1 : S 1 ):::(s k : S k )Type is of one of the following forms: 1. Y (s 1 ; :::; s k ) , or 2. (x : K) 0 , where K is a small ... (Update)

Active bibliography (related documents): More All
0.0: A Type-theoretic Semantics for Propositional Linear Planning - Fox, Long (Correct)
0.0: Coercive subtyping and lexical semantics (Extended Abstract) - Luo, Callaghan (1998) (Correct)
0.0: Towards Lean Proof Checking - Barthe, Elbers (1996) (Correct)

Similar documents based on text: More All
0.3: Weak Transitivity in Coercive Subtyping - Zhaohui (2001) (Correct)
0.3: Combining Incoherent Coercions for Σ-types - Luo, Luo (Correct)
0.2: Implementation Techniques for Inductive Types in Plastic - Callaghan, Luo (2000) (Correct)

BibTeX entry: (Update)

@misc{ -unknown,
  title = "Unknown",
  url = "citeseer.ist.psu.edu/689956.html" }