References

  1. Sergio Antoy (2005): Evaluation Strategies for Functional Logic Programming. J. Symb. Comput. 40(1), pp. 875–903, doi:10.1016/j.jsc.2004.12.007.
  2. Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani & Jennifer Widom (2002): Models and Issues in Data Stream Systems. In: Proceedings of the Twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '02. ACM, New York, NY, USA, pp. 1–16, doi:10.1145/543613.543615.
  3. David M. Beazley (2009): Python Essential Reference, 4th edition. Addison-Wesley Professional.
  4. Harald Beck, Minh Dao-Tran, Thomas Eiter & Michael Fink (2015): LARS: A Logic-based Framework for Analyzing Reasoning over Streams. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI'15. AAAI Press, pp. 1431–1438, doi:10.1016/j.artint.2018.04.003.
  5. Amadeo Casas, Daniel Cabeza & Manuel V. Hermenegildo (2006): A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems. In: Masami Hagiya & Philip Wadler: Functional and Logic Programming, 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006, Proceedings, Lecture Notes in Computer Science 3945. Springer, pp. 146–162, doi:10.1007/11737414_11.
  6. Amadeo Casas, Daniel Cabeza Gras & Manuel V Hermenegildo (2005): Functional notation and lazy evaluation in Ciao. CICLOPS 2005. https://cliplab.org/papers/lazy-functions-ciclops05.pdf.
  7. Christian Holzbaur (1992): Metastructures vs. attributed variables in the context of extensible unification. In: Maurice Bruynooghe & Martin Wirsing: Programming Language Implementation and Logic Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 260–268, doi:10.1007/3-540-55844-6_141.
  8. Paul Hudak, John Hughes, Simon Peyton Jones & Philip Wadler (2007): A History of Haskell: Being Lazy with Class. In: Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages, HOPL III. ACM, New York, NY, USA, pp. 12–1–12–55, doi:10.1145/1238844.1238856.
  9. Yan-Nei Law, Haixun Wang & Carlo Zaniolo (2011): Relational Languages and Data Models for Continuous Queries on Sequences and Data Streams. ACM Trans. Database Syst. 36(2), pp. 8:1–8:32, doi:10.1145/1966385.1966386.
  10. Eugenio Moggi (1991): Notions of Computation and Monads. Information and Computation 93, pp. 55–92, doi:10.1016/0890-5401(91)90052-4.
  11. Guido van Rossum & Fred L. Drake (2011): The Python Language Reference Manual. Network Theory Ltd..
  12. Tom Schrijvers, Bart Demoen, Benoit Desouter & Jan Wielemaker (2013): Delimited continuations for Prolog. Theory and Practice of Logic Programming 13(4-5), pp. 533–546, doi:10.1017/S1471068413000331.
  13. Tom Schrijvers, Bart Demoen, Markus Triska & Benoit Desouter (2014): Tor: Modular search with hookable disjunction. Science of Computer Programming 84, pp. 101–120, doi:10.1016/j.scico.2013.05.008.
  14. Paul Tarau (2000): Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects. In: John Lloyd: Computational Logic–CL 2000: First International Conference, London, UK, doi:10.1007/3-540-44957-4_82. LNCS 1861, Springer-Verlag.
  15. Paul Tarau (2012): The BinProlog Experience: Architecture and Implementation Choices for Continuation Passing Prolog and First-Class Logic Engines. Theory and Practice of Logic Programming 12(1-2), pp. 97–126, doi:10.1017/S1471068411000433.
  16. Paul Tarau (2013): Compact Serialization of Prolog Terms (with Catalan Skeletons, Cantor Tupling and Gödel Numberings). Theory and Practice of Logic Programming 13(4-5), pp. 847–861, doi:10.1017/S1471068413000537.
  17. Paul Tarau & Arun Majumdar (2009): Interoperating Logic Engines. In: Practical Aspects of Declarative Languages, 11th International Symposium, PADL 2009. Springer, LNCS 5418, Savannah, Georgia, pp. 137–151, doi:10.1007/978-3-540-92995-6_10.
  18. Philip Wadler (1993): Monads and composable continuations. Lisp and Symbolic Computation, pp. 1–17, doi:10.1007/BF01019944.
  19. Jan Wielemaker (2003): Native Preemptive Threads in SWI-Prolog. In: Catuscia Palamidessi: Practical Aspects of Declarative Languages. Springer Verlag, Berlin, Germany, pp. 331–345, doi:10.1007/978-3-540-24599-5_23. LNCS 2916.
  20. Jan Wielemaker, Tom Schrijvers, Markus Triska & Torbjorn Lager (2012): SWI-Prolog. Theory and Practice of Logic Programming 12, pp. 67–96, doi:10.1017/S1471068411000494.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org