Type checking dependent (record) types and subtyping

Journal of Functional Programming

Volumn 10, Issue 2, 2000, Pages 137-166

  Betarte, Gustavo ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346007449     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003627     Document Type: Article

References (29)

1. Aspinall, D. and Compagnoni, A. (1996) Subtyping dependent types. Proceedings of the 11th IEEE Symposium on Logic in Computer Science.
2. Augustsson, L. (1997) HBC - The Chalmers Haskell Compiler. http://www.cs.chalmers.se/augustss/hbc/hbc.html.
3. Augustsson, L. (1998) Cayenne - a language with dependent types. Proceedings of ICFP 98.
4. Barendregt, H. (1992) Lambda Calculi with Types. In: D. M. Gabbay, S. Abramsky and T. S. E. Maibaum (eds.), Handbook of Logic in Computer Science, pp. 117-309. Oxford University Press.
5. Betarte, G. (1998) Dependent record types and algebraic structures in type theory. PhD thesis, PMG, Department of Computing Science, University of Göteborg and Chalmers University of Technology.
6. Betarte, G. and Tasistro, A. (1998) Extension of Martin-Löf's Type Theory with Record Types and Subtyping. In: Sambin, G. and Smith, J. M. (eds.), Twenty-five Years of Constructive Type Theory, pp. 21-39. Oxford University Press.
7. Burge, W. H. (1975) Recursive Programming Techniques. Addison-Wesley.
8. Cardelli, L. (1987) Typechecking dependent types and subtypes. In: M. Boscarol, L. C. Aiello and Levi, G. (eds.), Proc. Workshop on Foundations of Logic and Functional Programming. Lectures Notes in Computer Science, 306. Springer-Verlag.
9. Coquand, Th. (1991) An algorithm for testing conversion in type theory. In: G. Huet and G. Plotkin (eds.), Logical Frameworks, pp. 71-92. Cambridge University Press.
10. Coquand, Th. (1996) An algorithm for type-checking dependent types. Science of Computer Programming 26, pp. 167-177.
11. Coquand, Th., Nordström, B., Smith, J. M. and von Sydow, B. (1994) Type theory and programming. EATCS 52.
12. Dowek, G. (1993) The undecidability of typability in the lambda-pi-calculus. In: M. Bezem and J. F. Groote (eds.), TLCA, Lecture Notes in Computer Science, 664. Springer-Verlag.
13. Gaspes, V. (1998) Deriving instances of Abstract Insertion Sort in an implementation of Martin-Löf's type theory extended with dependent record types and subtyping. Talk given at The Winter Meeting 1998, Department of Computing Science, Chalmers University of Technology.
14. Hutton, G. (1992) Higher-order functions for parsing. J. Functional Programming, 2, 323-343.
15. Jones, A., Luo, Z. and Soloviev, S. (1997) Some algorithmic and proof-theoretical aspects of coercive subtyping. In: Proceedings of Types '96, Lecture Notes in Computer Science, 1512. Springer-Verlag.
16. Luo, Z. (1996) Coercive subtyping in type theory. CSL'96, 1996 Annual Conference of the European Association for Computer Science Logic.
17. Magnusson, L. (1995) The Implementation of ALF - a Proof Editor based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Programming Methodology Group, Department of Computing Science, University of Göteborg and Chalmers University of Technology.
18. Martin-Löf, P. (1987) Philosophical Implications of Type Theory. Lectures given at the Facoltá de Lettere e Filosofia, Universitá degli Studi di Firenze, Florence, March 15-May 15. Privately circulated notes.
19. Martin-Löf, P. (1992) Substitution calculus. Talks given in Göteborg.
20. McKinna, J. and Pollack, R. (1993) Pure type systems formalized. In: M. Bezem and J. F. Groote (eds.), Proc. International Conference on Typed Lambda Calculi and Applications. Lecture Notes in Computer Science. 664. Springer-Verlag.
21. Nordström, B. The typechecking algorithm. In preparation.
22. Nordström, B., Petersson, K. and Smith, J. M. (1989) Programming in Martin-Löf's Type Theory. An Introduction. Oxford University Press.
23. Pollack, R. (1994) The Theory of LEGO: a proof checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh.
24. Pollak, R. (1994) Closure under alpha-conversion. Types for Proofs and Programs: International Workshop TYPES'93, Nijmegen. Lecture Notes in Computer Science, 806. Springer-Verlag.
25. Röjemo, N. (1995) Garbage collection, and memory efficiency, in lazy functional languages. PhD thesis, Department of Computing Science, University of Göteborg and Chalmers University of Technology.
26. Sambin, G. and Smith, J. M. (eds). (1998) Twenty-five Years of Constructive Type Theory. Oxford University Press.
27. Seven, P. (1996) Normalisation in Lambda Calculus and its relation to type inference. PhD thesis, Eindhoven University of Technology.
28. Tasistro, A. (1997) Substitution, record types and subtyping in type theory, with applications to the theory of programming. PhD thesis, PMG, Department of Computing Science, University of Göteborg and Chalmers University of Technology.
29. Wadler, P. (1992) The essence of functional programming. 1992 Symposium on Principles of Programming Languages, pp. 1-14.