BinProlog and Jinni
related Research Papers
References in
bibref format
Selected Papers
2000
1999
1998
1997
-
Paul Tarau. Logic Programming Tools for Advanced
Internet Programming. In Jan Maluszynski, editor, Logic Programming, Proceedings
of the 1997 International Symposium, pages 33-34, MIT press.
-
V. Dahl, P. Tarau. Assumption
Grammars: Parsing as Hypothetical Reasoning
-
P. Tarau, K. De Bosschere, and Bart Demoen. On
Delphi Lemmas And other Memoing Techniques For Deterministic Logic Programs.
Journal
of Logic Programming, 30(2):145-163, February 1997.
1996
-
Paul Tarau, Veronica Dahl, and
Andrew Fall. Backtrackable
State with Linear Affine Implication and Assumption Grammars. In Joxan
Jaffar and Roland H.C. Yap, editors, Concurrency and Parallelism, Programming,
Networking, and Security, Lecture Notes in Computer Science 1179, pages
53-64, Singapore, December 1996. "Springer".
-
K. De Bosschere and P. Tarau. Blackboard-based Extensions
in Prolog. Software - Practice and Experience, 26(1):49-69, January 1996.
-
Paul Tarau, Koen De Bosschere, and Bart Demoen. Partial
Translation: Towards a Portable
and Efficient Prolog Implementation Technology. Journal of Logic Programming,
29(1-3):65-83, November 1996.
-
Bart Demoen, Geert Engels, and Paul Tarau. Segment
Preserving Copying Garbage Collection for WAM based Prolog. In Proceedings
of the 1996 ACM Symposium on Applied Computing, pages 380-386, Philadelphia,
February 1996. ACM Press.
1995
-
Yves Bekkers and Paul Tarau. Monadic
Constructs for Logic Programming. In John Lloyd, editor, Proceedings
of ILPS'95, pages 51-65, Portland, Oregon, December 1995. MIT Press.
-
Paul Tarau and Bart Demoen. Higher-Order
Programming in an OR-intensive Style. In Manuel Hermenegildo and Pedro
Lopez, editors, Proceedings of the 1995 COMPULOG-NET Workshop and Area
Meeting on Parallelism and Implementation Technology, 1995.
-
Paul Tarau, Veronica Dahl, and Andrew Fall. Backtrackable
State with Linear Assumptions, Continuations and Hidden Accumulator Grammars.
Technical Report 95-2, Département d'Informatique, Université
de Moncton, April 1995.
1994 and before
-
Paul Tarau, Ulrich Neumerkel. A
Novel Term Compression Scheme and Data Representation in the BinWAM. In
M. Hermenegildo and J. Penjam, editors, Proceedings of Programming Language
Implementation and Logic Programming, Lecture Notes in Computer Science
844, pages 73-87. "Springer", September 1994.
-
Paul Tarau and Veronica Dahl. Logic
Programming and Logic Grammars with First-order Continuations. In Proceedings
of LOPSTR'94, LNCS, Springer, Pisa, June 1994.
-
Paul Tarau. Low
level Issues in Implementing a High-Performance Continuation Passing Binary
Prolog Engine. In M.-M. Corsini, editor, Proceedings of JFPL'94, June
1994.
-
Paul Tarau. Ecological
Memory Management in a Continuation Passing Prolog Engine. In Y. Bekkers
and J. Cohen, editors, Memory Management International Workshop IWMM 92
Proceedings, number 637 in Lecture Notes in Computer Science, pages 344-356.
Springer, September 1992.
-
Paul Tarau. Program
Transformations and WAM-support for the Compilation of Definite Metaprograms.
In Andrei Voronkov, editor, Logic Programming, RCLP Proceedings, number
592 in Lecture Notes in Artificial Intelligence, pages 462-473, Berlin,
Heidelberg, 1992. Springer-Verlag.
-
Paul Tarau. A
Simplified Abstract Machine for the Execution of Binary Metaprograms.
In Proceedings of the Logic Programming Conference'91, pages 119-128. ICOT,
Tokyo, 7 1991.
-
Paul Tarau and Michel Boyer. Elementary
Logic Programs. In P. Deransart and J. Maluszynski, editors, Proceedings
of Programming Language Implementation and Logic Programming, number 456
in Lecture Notes in Computer Science, pages 159-173. Springer, August 1990.
Various Papers from 1990 to
Present
http://www.cs.unt.edu/~tarau/research/BinPrologPapers/
http://www.cs.unt.edu/~tarau/research/NewBinPrologPapers/
http://www.cs.unt.edu/~tarau/research/JinniPapers/