Abstract
ML F is a type system that seamlessly merges ML-style implicit but second-class polymorphism with System-F explicit first-class polymorphism. We present x ML F, a Church-style version of ML F with full type information that can easily be maintained during reduction. All parameters of functions are explicitly typed and both type abstraction and type instantiation are explicit. However, type instantiation in x ML F is more general than type application in System F. We equip x ML F with a small-step reduction semantics that allows reduction in any context and show that this relation is confluent and type preserving. We also show that both subject reduction and progress hold for weak-reduction strategies, including call-by-value with the value-restriction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam (1984), ISBN: 0-444-86748-1
Crary, K.: Typed compilation of inclusive subtyping. In: ICFP 2000: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pp. 68–81. ACM, New York (2000)
Herms, P.: Partial Type Inference with Higher-Order Types. Master’s thesis, University of Pisa and INRIA (2009) (to appear)
Le Botlan, D.: MLF: An extension of ML with second-order polymorphism and implicit instantiation. PhD thesis, Ecole Polytechnique (June 2004) (english version)
Le Botlan, D., Rémy, D.: MLF: Raising ML to the power of System-F. In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, August 2003, pp. 27–38 (2003)
Le Botlan, D., Rémy, D.: Recasting MLF. Research Report 6228, INRIA, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France (June 2007)
Leijen, D.: A type directed translation of MLF to System F. In: The International Conference on Functional Programming (ICFP 2007). ACM Press, New York (2007)
Leijen, D.: Flexible types: robust type inference for first-class polymorphism. In: Proceedings of the 36th annual ACM Symposium on Principles of Programming Languages (POPL 2009), pp. 66–77. ACM, New York (2009)
Leijen, D., Löh, A.: Qualified types for MLF. In: ICFP 2005: Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, pp. 144–155. ACM Press, New York (2005)
Mitchell, J.C.: Polymorphic type inference and containment. Information and Computation 2/3(76), 211–249 (1988)
Jones, S.P.: Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, Cambridge (2003), ISBN: 0521826144
Rémy, D., Yakobowski, B.: A church-style intermediate language for MLF (extended version) (September 2008a), http://gallium.inria.fr/~remy/mlf/xmlf.pdf
Rémy, D., Yakobowski, B.: From ML to MLF: Graphic type constraints with efficient type inference. In: The 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008), Victoria, BC, Canada, September 2008, pp. 63–74 (2008b)
Yakobowski, B.: Graphical types and constraints: second-order polymorphism and inference. PhD thesis, University of Paris 7 (December 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rémy, D., Yakobowski, B. (2010). A Church-Style Intermediate Language for ML F . In: Blume, M., Kobayashi, N., Vidal, G. (eds) Functional and Logic Programming. FLOPS 2010. Lecture Notes in Computer Science, vol 6009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12251-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-12251-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12250-7
Online ISBN: 978-3-642-12251-4
eBook Packages: Computer ScienceComputer Science (R0)