# G Bibliography

Bowen et al., 1983
  D. L. Bowen, L. M. Byrd, and WF. Clocksin. A portable Prolog compiler. In L. M. Pereira, editor, Proceedings of the Logic Programming Workshop 1983, Lisabon, Portugal, 1983. Universidade nova de Lisboa.
Bratko, 1986
  I. Bratko. Prolog Programming for Artificial Intelligence. Addison-Wesley, Reading, Massachusetts, 1986.
Butenhof, 1997
  David R. Butenhof. Programming with POSIX threads. Ad d i s on-Wes l ey, Reading, MA, USA, 1997.
Byrd, 1980
  L. Byrd. Understanding the control flow of Prolog programs. Logic Programming Workshop, 1980.
Clocksin & Melish, 1987
  W. F. Clocksin and C. S. Melish. Programming in Prolog. Springer-Verlag, New York, Third, Revised and Extended edition, 1987.
Demoen, 2002
  Bart Demoen. Dynamic attributes, their hProlog implementation, and a first evaluation. Report CW 350, Department of Computer Science, K.U.Leuven, Leuven, Belgium, oct 2002. URL = http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW350.abs.html.
Desouter et al., 2015
  Benoit Desouter, Marko van Dooren, and Tom Schrijvers. Tabling as a library with delimited control. TPLP, 15(4-5):419--433, 2015.
Freire et al., 1997
  Juliana Freire, David S. Warren, Konstantinos Sagonas, Prasad Rao, and Terrance Swift. XSB: A system for efficiently computing well-founded semantics. In Proceedings of LPNMR 97, pages 430--440, Berlin, Germany, jan 1997. Springer Verlag. LNCS 1265.
Frühwirth,
  T. Frühwirth. Thom Fruehwirth's constraint handling rules website. http://www.constraint-handling-rules.org.
Frühwirth, 2009
  T. Frühwirth. Constraint Handling Rules. Cambridge University Press, 2009.
Graham et al., 1982
  Susan L. Graham, Peter B. Kessler, and Marshall K. McKusick. gprof: a call graph execution profiler. In SIGPLAN Symposium on Compiler Construction, pages 120--126, 1982.
Hodgson, 1998
  Jonathan Hodgson. validation suite for conformance with part 1 of the standard, 1998, http://www.sju.edu/~jhodgson/pub/suite.tar.gz.
Holzbaur, 1992
  Christian Holzbaur. Metastructures versus attributed variables in the context of extensible unification. In PLILP, volume 631, pages 260--268. Springer-Verlag, 1992. LNCS 631.
Kernighan & Ritchie, 1978
  B. W. Kernighan and D. M. Ritchie. The C Programming Language. Prentice-Hall, Englewood Cliffs, New Jersey, 1978.
Neumerkel, 1993
  Ulrich Neumerkel. The binary WAM, a simplified Prolog engine. Technical report, Technische Universität Wien , 1993. http://www.complang.tuwien.ac.at/ulrich/papers/PDF/binwam-nov93.pdf.
O'Keefe, 1990
  R. A. O'Keefe. The Craft of Prolog. MIT Press, Massachussetts, 1990.
Pereira, 1986
  F. Pereira. C-Prolog User's Manual. EdCaad, University of Edinburgh, 1986.
Qui, 1997
  AI International ltd., Berkhamsted, UK. Quintus Prolog, User Guide and Reference Manual, 1997.
Schimpf, 2002
  Joachim Schimpf. Logical loops. In PeterJ. Stuckey, editor, Logic Programming, volume 2401 of Lecture Notes in Computer Science, pages 224--238. Springer Berlin Heidelberg, 2002.
Schrijvers et al., 2013
  Tom Schrijvers, Bart Demoen, Benoit Desouter, and Jan Wielemaker. Delimited continuations for prolog. TPLP, 13(4-5):533--546, 2013.
Sterling & Shapiro, 1986
  L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, Cambridge, Massachusetts, 1986.
Tarau, 2011
  Paul Tarau. Coordination and concurrency in multi-engine prolog. In Wolfgang De Meuter and Gruia-Catalin Roman, editors, Coordination Models and Languages - 13th International Conference, COORDINATION 2011, Reykjavik, Iceland, June 6-9, 2011. Proceedings, volume 6721 of Lecture Notes in Computer Science, pages 157--171. Springer, 2011.
Triska, 2016
  Markus Triska. The Boolean constraint solver of SWI-Prolog: System description. In FLOPS, volume 9613 of LNCS, pages 45--61, 2016. https://www.metalevel.at/swiclpb.pdf.