Dependently Typed Pattern Matching
Creators
- 1. Computer Science Department Boston University, Boston, MA, United States of America
Description
The mechanism for declaring datatypes to model data structures in programming languages such as Standard ML and Haskell can offer both convenience in programming and clarity in code. With the introduction of dependent datatypes in DML, the programmer can model data structures with more accuracy, thus capturing more program invariants. In this paper, we study some practical aspects of dependent datatypes that affect both type-checking and compiling pattern matching. The results, which have already been tested, demonstrate that dependent datatype can not only o#er various programming benefits but also lead to performance gains, yielding a concrete case where safer programs run faster.
Files
jucs_article_28087.pdf
Files
(179.9 kB)
Name | Size | Download all |
---|---|---|
md5:7bcc7e839fc615fd6f8cf9795c85d595
|
179.9 kB | Preview Download |