First-Class Phantom Types
| dc.contributor.author | Cheney, James | en_US |
| dc.contributor.author | Hinze, Ralf | en_US |
| dc.date.accessioned | 2007-04-04T19:20:53Z | |
| dc.date.available | 2007-04-04T19:20:53Z | |
| dc.date.issued | 2003-07-10 | en_US |
| dc.description.abstract | Classical phantom types are datatypes in which type constraints are expressed using type variables that do not appear in the datatype cases themselves. They can be used to embed typed languages into Haskell or ML. However, while such encodings guarantee that only well-formed data can be constructed, they do not permit type-safe deconstruction without additional tagging and run-time checks. We introduce first-class phantom types, which make such constraints explicit via type equations. Examples of first-class phantom types include typed type representations and typed higher-order abstract syntax trees. These types can be used to support typed generic functions, dynamic typing, and staged compilation in higher-order, statically typed languages such as Haskell or Standard ML. In our system, type constraints can be equations between type constructors as well as type functions of higher-order kinds. We prove type soundness and decidability for a Haskell-like language extended by first-class phantom types. | en_US |
| dc.format.extent | 361331 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1901 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5614 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | First-Class Phantom Types | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1