Please use this identifier to cite or link to this item:
https://doi.org/10.1145/1190315.1190324
| Title: | System F with type equality coercions | Authors: | Sulzmann, M. Chakravarty, M.M.T. Jones, S.P. Donnelly, K. |
Keywords: | Advanced type features Typed intermediate language |
Issue Date: | 2007 | Citation: | Sulzmann, M., Chakravarty, M.M.T., Jones, S.P., Donnelly, K. (2007). System F with type equality coercions. Proceedings of the TLDI 2007: 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation - Papers Presented at the Workshop : 53-66. ScholarBank@NUS Repository. https://doi.org/10.1145/1190315.1190324 | Abstract: | We introduce System F(C), which extends System F with support for non-syntactic type equality. There are two main extensions: (i) explicit witnesses for type equalities, and (ii) open, non-parametric type functions, given meaning by top-level equality axioms. Unlike System F, F(C) is expressive enough to serve as a target for several different source-language features, including Haskell's newtype, generalised algebraic data types, associated types, functional dependencies, and perhaps more besides. © 2007 ACM. | Source Title: | Proceedings of the TLDI 2007: 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation - Papers Presented at the Workshop | URI: | http://scholarbank.nus.edu.sg/handle/10635/41911 | ISBN: | 159593393X | DOI: | 10.1145/1190315.1190324 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.