A Church-style intermediate language for ML^ F
From MaRDI portal
Publication:428892
Recommendations
- A church-style intermediate language for ML\(^{\text{F}}\)
- Towards an intersection typed system à la Church
- The ML approach to the readable all-purpose language
- Church-Rosser systems with respect to formal languages
- Compiling a functional logic language: \textit{The Fair Scheme}
- Sequent calculus as a compiler intermediate language
- Implicit typing à la ML for the join-calculus
- scientific article; zbMATH DE number 1956524
Cites work
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- A theory of qualified types
- A type directed translation of MLF to System F
- Engineering formal metatheory
- From ML to ML F
- Generative type abstraction and type-level computation
- Harnessing \(\mathrm{ML}^{\mathrm F}\) with the power of system F
- ML F
- Polymorphic type inference and containment
- Qualified types for MLF
- Recasting ML\(^{\text F}\)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Typed compilation of inclusive subtyping
Cited in
(4)
This page was built for publication: A Church-style intermediate language for ML\(^{\text F}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428892)