We present an extension of System F with types for term-level equations. This internalization of the rich equational theory of the polymorphic lambda calculus yields an expressive core language, suitable for formalizing features such as Haskell's rewriting rules mechanism or Extended ML signatures. © 2012 Springer-Verlag.
CITATION STYLE
Krishnaswami, N. R., & Benton, N. (2012). Adding equations to system F types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7211 LNCS, pp. 417–435). https://doi.org/10.1007/978-3-642-28869-2_21
Mendeley helps you to discover research relevant for your work.