Dependently typed records in type theory

Formal Aspects of Computing

Volumn 13, Issue 3-5, 2002, Pages 386-402

  Pollack, Robert ^a,b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Dependent types; Inductive recursive; Manifest types; Module; Pebble; Sharing; Signature

Indexed keywords

COMPUTATIONAL METHODS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROBLEM SOLVING;

DEPENDENT TYPES; INDUCTIVE-RECURSIVE; INFORMATIVE SIGNATURES; LANGUAGE PEBBLE; MANIFEST TYPES; MODULES; SHARING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 23944501589     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001650200018     Document Type: Article

References (32)

1. [Acz94] Aczel, P.: Simple overloading for type theories. Privately circulated notes, 1994.
2. [Bai98] Bailey, A.: The Machine-checked Literate Formalisation of Algebra in Type Theory. PhD thesis, University of Manchester, 1998.
3. [Bet98] Betarte, G.: Dependent Record Types and Formal Abstract Reasoning. PhD thesis, Chalmers University of Technology, 1998.
4. [BuG77] Burstall, R. and Goguen, J.: Putting theories together to make specifications. In Fifth International Joint Conference on Artificial Intelligence, MIT, Cambridge, pages 1045-1058, 1977.
5. [BuL84] Burstall, R. and Lampson, B.: Pebble, a kernel language for modules and abstract data types. LNCS, 173, 1984.
6. [BuM93] Burstall, R. and McKinna, J.: Deliverables: a categorical approach to program development in type theory. In Proceedings of Mathematical Foundation of Computer Science, MFCS'93, LNCS 711. Springer-Verlag, 1993.
7. [BeT98] Betarte, G. and Tasistro, A.: Extension of Martin-Löfs type theory with record types and subtyping. In G. Sambin and J. Smith, editors, Twenty Five Years of Constructive Type Theory. Oxford University Press, 1998.
8. [Bur84] Burstall, R.: Programming with modules as typed functional programming. In Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, 1984.
9. [Bur93] Burstall, R.: Extended Calculus of Constructions as a specification language. In R. Bird and C. Morgan, editors, Mathematics of Program Construction, 1993. Invited talk.
10. [Coq01] The Coq Project, 2001. http://coq.inria.fr/.
11. [Cou99] Courant, J.: MC: a module calculus for Pure Type Systems. Technical Report 1217, CNRS Université Paris Sud 8623: LRI, June 1999.
12. [Dyb00] Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic, 65(2): 525-549, June 2000.
13. [HaL94] Harper, R. and Lillibridge, M.: A type-theoretic approach to higher-order modules with sharing. In POPL'94. ACM Press, 1994.
14. [Kam99] Kammüller, F.: Modular structures as dependent types in isabelle. In T. Altenkirch, W. Naraschewski, and B. Reus, editors, TYPES'98, Selected Papers, volume 1657 of LNCS. Springer-Verlag, 1999.
15. [LaB88] Lampson, B. and Burstall, R.: Pebble, a kernel language for modules and abstract data types. Information and Computation, 76(2/3): 278-346, 1988.
16. [LuB92] Luo, Z. and Burstall, R.: A set-theoretic setting for structuring theories in proof development. LFCS Report ECS-LFCS-92-206, Computer Science Department, University of Edinburgh, 1992.
17. [LEG01] The LEGO Proof Assistant, 2001. www.dcs.ed.ac.uk/homa/lego/.
18. [Ler94] Leroy, X.: Manifest types, modules, and separate compilation. In POPL'94, New York, NY, 1994. ACM Press, 1994.
19. [Ler96] Leroy, X.: A syntactic theory of type generativity and sharing. Journal of Functional Programming, 6(5): 667-698, 1996.
20. [LuP92] Luo, Z. and Pollack, R.: LEGO proof development system: user's manual. Technical Report ECS-LFCS-92-211, Computer Science Department, University of Edinburgh, 1992. See [LEG01].
21. [LuS99] Luo, Z. and Soloviev, S.: Dependent coercions. In Category Theory in Computer Science, CTCS'99, Electronic Notes in Theoretical Computer Science. Elsevier, 1999.
22. [Luo94] Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. International Series of Monographs on Computer Science. Oxford University Press, 1994.
23. [Luo99] Luo, Z.: Coercive subtyping. Journal of Logic and Computation, 9(1): 105-130, 1999.
24. [Mac84] MacQueen, D.: Modules for standard ML. In ACM Symposium on Lisp and Functional Programming, 1984.
25. [Mac86] MacQueen, D.: Using dependent types to express modular structure. In POPL'86, 1986.
26. [Mar84] Martin-Löf, P.: Intuitionistic Type Theory, volume 1 of Studies in Proof Theory. Bibliopolis, Naples, 1984.
27. [MMS79] Mitchell, J., Maybury, W., and Sweet, R. Mesa language manual. Technical report, Xerox PARC, 1979.
28. [NPS90] Nordström, B., Petersson, K. and Smith, J.; Programming in Martin-Löf's Type Theory: An Introduction. Oxford University Press, 1990. Out of print, but available from www.cs.chalmers.se/Cs/Research/Logic/book/.
29. [Pot99] Pottier, L.: Algebra with Coq. See User Contributions in Coq release [Coq01], 1999.
30. [Sai97] Saibi, A.: Typing algorithm in type theory with inheritance. In POPL'97, 1997.
31. [SaB83] Sannella, D. and Burstall, R.; Structured theories in LCF. Proceedings of the 8th Colloquium on Trees in Algebra and Programming, 1983.
32. [Tas97] Tasistro, A.; Substitution, Record Types and Subtyping in Type Theory, with Applications to the Theory of Programming. PhD thesis, Chalmers University of Technology, May 1997.