Typed contracts for functional programming Export

@inproceedings{citeulike:5820554, abstract = {Abstract. A robust software component fulfills a contract: it expects data satisfying a certain property and promises to return data satisfying another property. The object-oriented community uses the design-bycontract approach extensively. Proposals for language extensions that add contracts to higher-order functional programming have appeared recently. In this paper we propose an embedded domain-specific language for typed, higher-order and first-class contracts, which is both more expressive than previous proposals, and allows for a more informative blame assignment. We take some first steps towards an algebra of contracts, and we show how to define a generic contract combinator for arbitrary algebraic data types. The contract language is implemented as a library in Haskell using the concept of generalised algebraic data types. 1}, author = {Hinze, Ralf and Jeuring, Johan and L\"{o}h, Andres}, booktitle = {In FLOPS '06: Functional and Logic Programming: 8th International Symposium}, citeulike-article-id = {5820554}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.8217}, keywords = {algebraic, blame\_passing, contracts, dependent, haskell, lazy, picky, typed}, pages = {208--225}, posted-at = {2009-09-22 14:42:49}, priority = {0}, title = {Typed contracts for functional programming}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.8217}, volume = {11}, year = {2006} }

TY - CONF ID - citeulike:5820554 L3 - citeulike-article-id:5820554 N2 - Abstract. A robust software component fulfills a contract: it expects data satisfying a certain property and promises to return data satisfying another property. The object-oriented community uses the design-bycontract approach extensively. Proposals for language extensions that add contracts to higher-order functional programming have appeared recently. In this paper we propose an embedded domain-specific language for typed, higher-order and first-class contracts, which is both more expressive than previous proposals, and allows for a more informative blame assignment. We take some first steps towards an algebra of contracts, and we show how to define a generic contract combinator for arbitrary algebraic data types. The contract language is implemented as a library in Haskell using the concept of generalised algebraic data types. 1 EP - 225 TI - Typed contracts for functional programming VL - 11 T2 - In FLOPS ’06: Functional and Logic Programming: 8th International Symposium SP - 208 KW - algebraic KW - blame_passing KW - contracts KW - dependent KW - haskell KW - lazy KW - picky KW - typed AU - Hinze, Ralf AU - Jeuring, Johan AU - Löh, Andres PY - 2006/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.8217 ER -