Deriving backtracking monad transformers Export

@article{citeulike:2851579, abstract = {In a paper about pretty printing J. Hughes introduced two fundamental techniques for deriving programs from their specication, where a specication consists of a signature and properties that the operations of the signature are required to satisfy. Briey, the rst technique, the term implementation, represents the operations by terms and works by dening a mapping from operations to observations | this mapping can be seen as dening a simple interpreter. The second, the context-passing...}, author = {Hinze, Ralf}, citeulike-article-id = {2851579}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4164}, journal = {ACM SIG\-PLAN Notices}, keywords = {backtracking, haskell, monad-transformers, monads}, number = {9}, pages = {186--197}, posted-at = {2008-05-31 01:42:18}, priority = {0}, title = {Deriving backtracking monad transformers}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4164}, volume = {35}, year = {2000} }

TY - JOUR ID - citeulike:2851579 L3 - citeulike-article-id:2851579 N2 - In a paper about pretty printing J. Hughes introduced two fundamental techniques for deriving programs from their specication, where a specication consists of a signature and properties that the operations of the signature are required to satisfy. Briey, the rst technique, the term implementation, represents the operations by terms and works by dening a mapping from operations to observations | this mapping can be seen as dening a simple interpreter. The second, the context-passing... IS - 9 JF - ACM SIG\-PLAN Notices EP - 197 TI - Deriving backtracking monad transformers VL - 35 SP - 186 KW - backtracking KW - haskell KW - monad-transformers KW - monads AU - Hinze, Ralf PY - 2000/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4164 ER -