Harnessing ML F with the Power of System F

DOI10.1007/978-3-642-15155-2_46zbMath1287.68022OpenAlexW1538843523MaRDI QIDQ3586110

Paolo Tranquilli, Giulio Manzonetto

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_46

zbMATH Keywords

strong normalizationcoercionspolymorphic types\(\mathrm{ML}^{\mathrm F}\)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (2)

A Church-style intermediate language for ML\(^{\text F}\) ⋮ Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions

This page was built for publication: Harnessing ML F with the Power of System F