Dependently typed records for representing mathematical structure

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

Volumn 1869, Issue , 2000, Pages 462-479

  Pollack, Robert ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84949189457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44659-1_29     Document Type: Conference Paper

References (19)

1. P. Aczel. Simple overloading for type theories. Privately circulated notes, 1994.
2. A. Bailey. The Machine-checked Literate Formalisation of Algebra in Type Theory. PhD thesis, Univ. of Manchester, 1998.
3. G. Betarte. Dependent Record Types and Formal Abstract Reasoning. PhD thesis, Chalmers Univ. of Technology, 1998.
4. G. Betarte and A. Tasistro. Extension of Martin-Lof's type theory with record types and subtyping. In G. Sambin and J. Smith, editors, Twenty Five Years of Constructive Type Theory. Oxford Univ. Press, 1998.
5. The Coq Project, 1999. http://pauillac.inria.fr/coq/.
6. J. Courant. MC: A module calculus for Pure Type Systems. Technical Report 1217, CNRS Universite Paris Sud 8623: LRI, June 1999.
7. N. G. de Bruijn. Telescopic mappings in typed lambda calculus. Information and Computation, 91(2).T89-204, April 1991.
8. Peter Dybjer. A general notion of simultaneous inductive-recursive definition in type theory. Journal of Symbolic Logic, 1997. To appear.
9. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In POPL'94- ACM Press, 1994.
10. F. Kammiiller. Modular structures as dependent types in isabelle. In T. Al-tenkirch, W. Naraschewski, and B. Reus, editors, TYPES'98, Selected Papers, volume 1657 of LNCS. Springer-Verlag, 1999.
11. B. Lampson and R. Burstall. Pebble, a kernel language for modules and abstract data types. Information and Computation, 76(2/3), 1988.
12. The LEGO Proof Assistant, 1999. http://www.dcs.ed.ac.uk/home/lego/.X.
13. Leroy. Manifest types, modules, and separate compilation. In POPL'94, New York, NY, USA, 1994. ACM Press.
14. Z. Luo and S. Soloviev. Dependent coercions. In Category Theory in Computer Science, CTCS'99, Electronic Notes in Theoretical Computer Science. Elsevier, 1999.
15. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9(1), 1999.
16. D. MacQueen. Using dependent types to express modular structure. In POPL'86, 1986.
17. Loic Pottier. Algebra with Coq. See User contributions in Coq release [Coq99], 1999.
18. A. Saibi. Typing algorithm in type theory with inheritance. POPL'97, 1997.
19. A. Tasistro. Substitution, Record Types and Subtyping in Type Theory, with Applications to the Theory of Programming. PhD thesis, Chalmers Univ. of Technology, May 1997.