Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • Tabling as a library with delimited control

  • BENOIT DESOUTER, MARKO VAN DOOREN, TOM SCHRIJVERS
  • Journal:
    Theory and Practice of Logic Programming / Volume 15 / Issue 4-5 / July 2015
    Published online by Cambridge University Press:
    03 September 2015, pp. 419-433
    • Article
      • You have access
    • PDF
    • Export citation

  • Tabling is probably the most widely studied extension of Prolog. But despite its importance and practicality, tabling is not implemented by most Prolog systems. Existing approaches require substantial changes to the Prolog engine, which is an investment out of reach of most systems. To enable more widespread adoption, we present a new implementation of tabling in under 600 lines of Prolog code. Our lightweight approach relies on delimited control and provides reasonable performance.

  • Delimited continuations for prolog

  • TOM SCHRIJVERS, BART DEMOEN, BENOIT DESOUTER, JAN WIELEMAKER
  • Journal:
    Theory and Practice of Logic Programming / Volume 13 / Issue 4-5 / July 2013
    Published online by Cambridge University Press:
    25 September 2013, pp. 533-546

  • Delimited continuations are a famous control primitive that originates in the functional programming world. It allows the programmer to suspend and capture the remaining part of a computation in order to resume it later. We put a new Prolog-compatible face on this primitive and specify its semantics by means of a meta-interpreter. Moreover, we establish the power of delimited continuations in Prolog with several example definitions of high-level language features. Finally, we show how to easily and effectively add delimited continuations support to the WAM.