Skip to main content
    • Aa
    • Aa

Backtracking with cut via a distributive law and left-zero monoids*

  • MACIEJ PIRÓG (a1) and SAM STATON (a2)

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.

Hide All

Research supported by a Royal Society University Research Fellowship and EPSRC Grant EP/N007387/1

Hide All
M. Barr & C. Wells (1985) Toposes, Triples and Theories. Springer-Verlag.

J. M. Beck (1969) Distributive laws. In Seminar on Triples and Categorical Homology Theory, Lecture Notes in Mathematics, vol. 80. Berlin/Heidelberg: Springer, pp. 119140.

M. Hyland , G. D. Plotkin & J. Power (2006) Combining effects: Sum and tensor. Theor. Comput. Sci. 357 (1–3), 7099.

G. D. Plotkin & A. J. Power (2004) Computational effects and operations: An overview. Electron. Notes Theor. Comput. Sci. 73, 149163.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 14 *
Loading metrics...

Abstract views

Total abstract views: 138 *
Loading metrics...

* Views captured on Cambridge Core between 13th July 2017 - 16th October 2017. This data will be updated every 24 hours.