Theoretical Computer Science
Lambda-calculus, types and models
Lambda-calculus, types and models
An extension of system F with subtyping
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Termination of system F-bounded: a complete proof
Information and Computation
Typed compilation of inclusive subtyping
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
MLF: raising ML to the power of system F
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A type directed translation of MLF to system F
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Light types for polynomial time computation in lambda calculus
Information and Computation
Information and Computation
Harnessing MLFwith the power of system F
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
| Hi-index | 5.23 |
ML^F is a type system extending ML with first-class polymorphism as in system F. The main goal of the present paper is to show that ML^F enjoys strong normalization, i.e., it has no infinite reduction paths. The proof of this result is achieved in several steps. We first focus on xML^F, the Church-style version of ML^F, and show that it can be translated into a calculus of coercions: terms are mapped into terms and instantiations into coercions. This coercion calculus can be seen as a decorated version of system F, so that the simulation result entails strong normalization of xML^F through the same property of system F. We then transfer the result to all other versions of ML^F using the fact that they can be compiled into xML^F and showing there is a bisimulation between the two. We conclude by discussing what results and issues are encountered when using the candidates of reducibility approach to the same problem.