Typed Contracts for Functional Programming Export

@book{citeulike:661450, 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-by-contract 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.}, author = {Hinze, Ralf and Jeuring, Johan and L\"{o}h, Andres}, citeulike-article-id = {661450}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/11737414_15}, citeulike-linkout-1 = {http://www.springerlink.com/content/w01115742074578r}, citeulike-linkout-2 = {http://www.comlab.ox.ac.uk/people/ralf.hinze/publications/Contract.pdf}, citeulike-linkout-3 = {http://people.cs.uu.nl/johanj/publications/Contract.pdf}, doi = {10.1007/11737414_15}, journal = {Lecture Notes in Computer Science}, keywords = {combinators, contracts, domain-specific-languages, gadts, haskell, higher-order-functions, sorting, type-safety}, month = {January}, pages = {208--225}, posted-at = {2009-04-14 15:27:25}, priority = {2}, title = {Typed Contracts for Functional Programming}, url = {http://dx.doi.org/10.1007/11737414_15}, volume = {3945}, year = {2006} }

TY - BOOK ID - citeulike:661450 L3 - citeulike-article-id:661450 N2 - 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-by-contract 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. JF - Lecture Notes in Computer Science EP - 225 TI - Typed Contracts for Functional Programming VL - 3945 SP - 208 KW - combinators KW - contracts KW - domain-specific-languages KW - gadts KW - haskell KW - higher-order-functions KW - sorting KW - type-safety AU - Hinze, Ralf AU - Jeuring, Johan AU - Löh, Andres PY - 2006/01// UR - http://dx.doi.org/10.1007/11737414_15 ER -