Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

MFCS
2010
Springer

favoriteEmaildiscussreport

155views Theoretical Computer Science» more MFCS 2010»

Harnessing MLF with the Power of System F

13 years 2 months ago

Harnessing MLF with the Power of System F

Download perso.ens-lyon.fr

We provide a strong normalization result for MLF , a type system generalizing ML with ﬁrst-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.

Giulio Manzonetto, Paolo Tranquilli

Real-time Traffic

Calculus | Generalizing | MFCS 2010 | Theoretical Computer Science | ﬁrst-class Polymorphism |

claim paper

Related Content

» MLF raising ML to the power of system F

» A Metamodel for the Measurement of ObjectOriented Systems An Analysis using Alloy

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	MFCS
Authors	Giulio Manzonetto, Paolo Tranquilli

Comments (0)