Faking it---simulating dependent types in Haskell Export

@misc{citeulike:4850, abstract = {Dependent types reflect the fact that validity of data is often a relative notion by allowing prior data to affect the types of subsequent data. Not only does this make for a precise type system, but also a highly generic one: both the type and the program for each instance of a family of operations can be computed from the data which codes for that instance. Recent experimental extensions to the Haskell type class mechanism give us strong tools to relativize types to other types. We may...}, author = {Mcbride, C.}, citeulike-article-id = {4850}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/mcbride01faking.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/mcbride01faking.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/mcbride01faking.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/mcbride01faking.html}, keywords = {dependent-types, types}, posted-at = {2005-01-10 23:29:11}, priority = {2}, title = {Faking it---simulating dependent types in Haskell}, url = {http://citeseer.ist.psu.edu/mcbride01faking.html}, year = {2001} }

TY - GEN ID - citeulike:4850 L3 - citeulike-article-id:4850 N2 - Dependent types reflect the fact that validity of data is often a relative notion by allowing prior data to affect the types of subsequent data. Not only does this make for a precise type system, but also a highly generic one: both the type and the program for each instance of a family of operations can be computed from the data which codes for that instance. Recent experimental extensions to the Haskell type class mechanism give us strong tools to relativize types to other types. We may... TI - Faking it---simulating dependent types in Haskell KW - dependent-types KW - types AU - Mcbride, C PY - 2001/// UR - http://citeseer.ist.psu.edu/mcbride01faking.html ER -