Practical Datatype Specializations with Phantom Types and Recursion Schemes

Simple item page
dc.creatorFluet, Matthew
dc.creatorPucella, Riccardo
dc.date2005-10-24
dc.date.accessioned2026-07-07T06:46:18Z
dc.date.available2026-07-07T06:46:18Z
dc.descriptionDatatype specialization is a form of subtyping that captures program invariants on data structures that are expressed using the convenient and intuitive datatype notation. Of particular interest are structural invariants such as well-formedness. We investigate the use of phantom types for describing datatype specializations. We show that it is possible to express statically-checked specializations within the type system of Standard ML. We also show that this can be done in a way that does not lose useful programming facilities such as pattern matching in case expressions.
dc.description25 pages. Appeared in the Proc. of the 2005 ACM SIGPLAN Workshop on ML
dc.identifierhttps://arxiv.org/abs/cs/0510074
dc.identifierhttp://arxiv.org/abs/cs/0510074
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103290
dc.subjectProgramming Languages
dc.subjectD.1.1; D.3.3; F.3.3
dc.titlePractical Datatype Specializations with Phantom Types and Recursion Schemes
dc.typetext

Files

Collections

arXiv