Harnessing MLFwith the power of system F

Authors:
Giulio Manzonetto;Paolo Tranquilli
Affiliations:
Laboratoire LIPN, CNRS, UMR, Université Paris Nord, France;LIP, CNRS, UMR, INRIA, ENS de Lyon, Université Claude Bernard Lyon 1, France
Venue:
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Year:
2010

Citing 8
Cited 3

Proofs and types

Proofs and types
Typed compilation of inclusive subtyping

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML
Coercion and type inference

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
Recasting MLF

Information and Computation

On the power of coercion abstraction

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strong normalization of MLF via a calculus of coercions

Theoretical Computer Science
A church-style intermediate language for MLF

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a strong normalization result for MLF, a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calculus of coercions, and showing that this calculus is just a decorated version of system F.