Extending hindley-milner type inference with coercive structural subtyping

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

Volumn 7078 LNCS, Issue , 2011, Pages 89-104

  Traytel, Dmitriy ^a   Berghofer, Stefan ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ISABELLE; LAMBDA CALCULUS; PROOF ASSISTANT; SUBTYPINGS; TYPE INFERENCE ALGORITHM; TYPE INFERENCES; TYPE INFORMATION; TYPE SYSTEMS;

ALGORITHMS; DIFFERENTIATION (CALCULUS);

INFERENCE ENGINES;

EID: 84055184525     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25318-8_10     Document Type: Conference Paper

References (20)

1. Benke, M.: Complexity of type reconstruction in programming languages with subtyping. Ph.D. thesis, Warsaw University (1997)
2. Bourdoncle, F., Merz, S.: On the integration of functional programming, classbased object-oriented programming, and multi-methods. Research Report 26, Centre de Mathématiques Appliquées, Ecole des Mines de Paris (March 1996)
3. Coq development team: The Coq proof assistant reference manual. INRIA (2010), http://coq.inria.fr version 8.3
4. Frey, A.: Satisfying subtype inequalities in polynomial space. Theor. Comput. Sci. 277(1-2), 105-117 (2002)
5. Fuh, Y.C., Mishra, P.: Type inference with subtypes. In: Ganzinger, H. (ed.) ESOP 1988. LNCS, vol. 300, pp. 94-114. Springer, Heidelberg (1988)
6. Luo, Z.: Coercions in a polymorphic type system. Mathematical Structures in Computer Science 18(4), 729-751 (2008)
7. Milner, R.: A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17(3), 348-375 (1978)
8. Mitchell, J.C.: Coercion and type inference. In: POPL, pp. 175-185 (1984)
9. Mitchell, J.C.: Type inference with simple subtypes. J. Funct. Program. 1(3), 245-285 (1991)
10. Nipkow, T.: Order-sorted polymorphism in Isabelle. In: Huet, G., Plotkin, G. (eds.) Logical Environments, pp. 164-188. CUP (1993)
11. Nordlander, J.: Polymorphic subtyping in O'Haskell. Sci. Comput. Program. 43(2-3), 93-127 (2002)
12. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)
13. Pottier, F.: Simplifying subtyping constraints: a theory. Information & Computation 170(2), 153-183 (2001)
14. Pratt, V.R., Tiuryn, J.: Satisfiability of inequalities in a poset. Fundam. Inform. 28(1-2), 165-182 (1996)
15. Saïbi, A.: Typing algorithm in type theory with inheritance. In: POPL, pp. 292-301 (1997)
16. Shields, M., Peyton Jones, S.: Object-oriented style overloading for Haskell. In: First Workshop on Multi-language Inferastructure and Interoperability (BABEL 2001), Firenze, Italy (September 2001)
17. Simonet, V.: Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 283-302. Springer, Heidelberg (2003)
18. Tiuryn, J.: Subtype inequalities. In: LICS, pp. 308-315 (1992)
19. Traytel, D., Berghofer, S., Nipkow, T.: Extending Hindley-Milner type inference with coercive subtyping (long version) (2011), www.in.tum.de/~nipkow/ pubs/coercions.pdf
20. Wand, M., O'Keefe, P.: On the complexity of type inference with coercion. In: FPCA 1989: Functional Programming Languages and Computer Architecture, pp. 293-298. ACM, New York (1989)