Coercions in Hindley-Milner Systems

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

Volumn 3085, Issue , 2004, Pages 259-275

  Kießling, Robert ^a   Luo, Zhaohui ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; INFERENCE ENGINES;

COERCIVE SUBTYPING; DEPENDENT TYPE THEORY; SOUND AND COMPLETE; TYPE INFERENCE ALGORITHM; TYPE SYSTEMS; TYPING SYSTEMS;

FUNCTIONAL PROGRAMMING;

EID: 33644910547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24849-1_17     Document Type: Article

References (23)

1. A. Bailey. The Machine-checked Literate Formalisation of Algebra in Type Theory. PhD thesis, University of Manchester, 1999.
2. B. Barras et al. The Coq Proof Assistant Reference Manual (Version 6.3.1). INRIA-Rocquencourt, 2000.
3. Val Breazu-Tannen, Thierry Coquand, Carl Gunter, and André Ščedrov. Inheritance as implicit coercion. Information and Computation, 93:172-221, 1991. Also in the collection [9].
4. P. Callaghan and Z. Luo. An implementation of LF with coercive subtyping and universes. Journal of Automated Reasoning, 27(1):3-27, 2001.
5. Luca Cardelli and Peter Wegner. On understanding types, data abstraction and polymorphism. Computing Surveys, 17(4):471-522, 1985.
6. G. Chen. Subtyping, Type Conversion and Transitivity Elimination. PhD thesis, University of Paris VII, 1998.
7. Luis Damas. Type Assignment in Programming Languages. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1985. CST-33-85.
8. Luis Damas and Robin Milner. Principal type-schemes for functional programming languages. In Ninth Annual Symposium on Principles of Programming Languages (POPL) (Albuquerque, NM), pages 207-212. ACM, January 1982.
9. Carl A. Gunter and John G. Mitchell. Theoretical Aspects of Object-Oriented Programming, Types, Semantics, and Language Design. Foundations of Computing Series. MIT Press, 1994.
10. Simon Peyton Jones, Mark Jones, and Erik Meijer. Type classes: an exploration of the design space, 1997.
11. Robert Kießling. Coercions in Hindley-Milner systems, forthcoming thesis, 2004.
12. Giuseppe Longo, Kathleen Milsted, and Sergei Soloviev. Coherence and transitivity of subtyping as entailment. Journal of Logic and Computation, 10(4):493-526, August 2000.
13. Y. Luo and Z. Luo. Coherence and transitivity in coercive subtyping. Proc. of the 8th Inter. Conf. on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'01), Havana, Cuba. LNAI 2250, 2001.
14. Z. Luo. Coercive subtyping. Journal of Logic and Computation, 9(1):105-130, 1999.
15. Z. Luo and R. Pollack. LEGO Proof Development System: User's Manual. LFCS Report ECS-LFCS-92-211, Department of Computer Science, University of Edinburgh, 1992.
16. James McKinna. personal communication, 2001.
17. John C. Mitchell. Coercion and type inference. In Tenth Annual Symposium on Principles of Programming Languages (POPL) (Austin, TX), pages 175-185. ACM, January 1983.
18. John C. Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1(2):245-286, July 1991.
19. A. Saïbi. Typing algorithm in type theory with inheritance. Proc of POPL'97, 1997.
20. S. Soloviev and Z. Luo. Coercion completion and conservativity in coercive subtyping. Annals of Pure and Applied Logic, 113(1-3):297-322, 2002.
21. Simon Thompson. Type Theory and Functional Programming. International Computer Science Series. Addison-Wesley, 1991.
22. Philip Wadler. Monads for functional programming. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925 of Lecture Notes in Computer Science, pages 24-52. Springer-Verlag, 1995.
23. Philip Wadler and Stephen Blott. How to make ad-hoc polymorhism less ad-hoc. In Proceedings of POPL '89, pages 60-76. ACM, January 1989.