Implementation techniques for inductive types in plastic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1956, Issue , 2000, Pages 94-113

  Callaghan, Paul ^a   Luo, Zhaohui ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Implementation; Inductive types; LF; Type theory

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

IMPLEMENTATION; IMPLEMENTATION TECHNIQUES; INDUCTIVE-TYPE; LAMBDA ABSTRACTION; LOGICAL FRAMEWORKS; NONLINEAR PATTERN; REDUCTION MECHANISMS; TYPE THEORY;

PATTERN MATCHING;

EID: 84876608004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44557-9_6     Document Type: Conference Paper

References (23)

1. David Aspinall. Proof General WWW Site. http://www.dcs.ed.ac.uk/home/-proofgen.
2. P. Callaghan. Coherence Checking of Coercions in Plastic. In Proc. Workshop on Subtyping & Dependent Types in Programming, July 2000.
3. P. Callaghan and Z. Luo. Mathematical vernacular in type theory based proof assistants. User Interfaces for Theorem Provers (UITP’98), Eindhoven, 1998.
4. Paul Callaghan and Zhaohui Luo. Plastic: an Implementation of LF with Coercive Subtyping & Universes. Journal of Automated Reasoning (Special Issue on Logical Frameworks), 2000. (to appear).
5. Coq. Coq WWW Page. http://pauillac.inria.fr/coq.
6. C. Coquand and Th. Coquand. Structured type theory. In Proc. Workshop on Logical Frameworks and Meta-languages (LFM’99), 1999.
7. Th. Coquand and Ch. Paulin-Mohring. Inductively defined types. Lecture Notes in Computer Science, 417, 1990.
8. P. Dybjer. Inductive sets and families in Martin-Löfs type theory and their set-theoretic semantics. In G. Huet and G. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.
9. E. Gimenez. Structural Recursive Definitions in Type Theory. In Proceedings of ICALP’98, volume 1443 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
10. H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, 1994.
11. Haskell. Haskell WWW Site. http://www.haskell.org.
12. Isabelle. Isabelle WWW Site. www.cl.cam.ac.uk/Research/HVG/Isabelle/.
13. A. Jones, Z. Luo, and S. Soloviev. Some proof-theoretic and algorithmic aspects of coercive subtyping. Types for proofs and programs (eds, E. Gimenez and, C. Paulin-Mohring), Proc. of the Inter. Conf. TYPES’96, LNCS 1512, 1998.
14. Z. Luo. A unifying theory of dependent types: the schematic approach. Proc. of Symp. on Logical Foundations of Computer Science (Logic at Tver’92), LNCS 620, 1992. Also as LFCS Report ECS-LFCS-92-202, Dept. of Computer Science, University of Edinburgh.
15. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
16. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9(1):105-130, 1999.
17. Z. Luo and P. Callaghan. Mathematical vernacular and conceptual well-formedness in mathematical language. Proceedings of the 2nd Inter. Conf. on Logical Aspects of Computational Linguistics, LNCS/LNAI 1582, 1998.
18. L. Magnusson and B. Nordstrom. The ALF proof editor and its proof engine. In Types for Proof and Programs, LNCS, 1994.
19. C. McBride. Dependently typed functional programs and their proofs. PhD thesis, University of Edinburgh, 2000.
20. B. Nordstrom, K. Petersson, and J. Smith. Programming in Martin-Lof’s Type Theory: An Introduction. Oxford University Press, 1990.
21. L. C. Paulson. A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions On page: http://www.cl.cam.ac.uk/Research/HVG/Isabelle/docs.html, 1999.
22. S. L Peyton Jones et al. GHC Haskell Compiler WWW Site.. http://-www.haskell.org/ghc.
23. R. Pollack et al. Lego WWW Page. http://www.dcs.ed.ac.uk/home/lego.