Practical Datatype Specializations with Phantom Types and Recursion Schemes

Details Practical Datatype Specializations with Phantom Types and Recursion Schemes Practical Datatype Specializations with Phantom Types and Recursion Schemes

2005-10-24

arxiv.org/abs/cs/0510074v1

Computer Science

Programming Languages

25 pages. Appeared in the Proc. of the 2005 ACM SIGPLAN Workshop on ML

Scientific paper

Datatype 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.

Affiliated with

Also associated with

No associations

Rating

Practical Datatype Specializations with Phantom Types and Recursion Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Practical Datatype Specializations with Phantom Types and Recursion Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Practical Datatype Specializations with Phantom Types and Recursion Schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522600