Journal article
Backtracking with cut via a distributive law and left-zero monoids
- Abstract:
- We employ the framework of algebraic effects to augment the list monad with the pruning cut operator known from Prolog. We give two descriptions of the resulting monad: as the monad of free left-zero monoids, and as a composition via a distributive law of the list monad and the ‘unary idempotent operation’ monad. The scope delimiter of cut arises as a handler.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 193.0KB, Terms of use)
-
- Publisher copy:
- 10.1017/S0956796817000077
Authors
- Publisher:
- Cambridge University Press
- Journal:
- Journal of Functional Programming More from this journal
- Volume:
- 27
- Pages:
- e17
- Publication date:
- 2017-07-13
- Acceptance date:
- 2017-05-12
- DOI:
- EISSN:
-
1469-7653
- ISSN:
-
0956-7968
- Pubs id:
-
pubs:701252
- UUID:
-
uuid:24d512bd-4cd6-42ed-98c9-cba98a4bee98
- Local pid:
-
pubs:701252
- Source identifiers:
-
701252
- Deposit date:
-
2017-06-19
Terms of use
- Copyright holder:
- © Cambridge University Press 2017
- Copyright date:
- 2017
- Notes:
- This is the author accepted manuscript following peer review version of the article. The final version is available online from Cambridge University Press at: 10.1017/S0956796817000077
If you are the owner of this record, you can report an update to it here: Report update to this record