Next: 23 Appendix
Up: BinProlog 5.75 User
Previous: 22 Related work
References
- 1
-
K. De Bosschere, D. Perron, and P. Tarau.
LogiMOO: Prolog Technology for Virtual Worlds.
In Proceedings of PAP'96, pages 51-64, London, Apr. 1996.
ISBN 0 9525554 1 7.
- 2
-
K. De Bosschere and P. Tarau.
Blackboard-based Extensions for Parallel Programming in
BinProlog.
In Proceedings of the 1993 ILPS Conference, page 664,
Vancouver, Canada, 1993.
Poster Abstract.
- 3
-
K. De Bosschere and P. Tarau.
Blackboard Communication in Logic Programming.
In Proceedings of the PARCO'93 Conference, pages 257-264,
Grenoble, France, Sept. 1993.
- 4
-
K. De Bosschere and P. Tarau.
High Performance Continuation Passing Style Prolog-to-C
Mapping.
In E. Deaton, D. Oppenheim, J. Urban, and H. Berghel, editors,
Proceedings of the 1994 ACM Symposium on Applied Computing, pages 383-387,
Phoenix/AZ, Mar. 1994. ACM Press.
- 5
-
K. De Bosschere and P. Tarau.
Blackboard-based Extensions in Prolog.
Software -- Practice and Experience, 26(1):49-69, Jan. 1996.
- 6
-
B. Demoen.
On the Transformation of a Prolog program to a more efficient
Binary program.
Technical Report 130, K.U.Leuven, Dec. 1990.
- 7
-
B. Demoen, G. Engels, and P. Tarau.
Segment Preserving Copying Garbage Collection for WAM based
Prolog.
In Proceedings of the 1996 ACM Symposium on Applied Computing,
pages 380-386, Philadelphia, Feb. 1996. ACM Press.
- 8
-
B. Demoen and A. Mariën.
Implementation of Prolog as binary definite Programs.
In A. Voronkov, editor, Logic Programming, RCLP Proceedings,
number 592 in Lecture Notes in Artificial Intelligence, pages 165-176,
Berlin, Heidelberg, 1992. Springer-Verlag.
- 9
-
T. Lindgren.
Compiling logic programs using a binary continuation style, Dec.
1992.
draft, Uppsala University.
- 10
-
U. Neumerkel.
Specialization of Prolog Programs with Partially Static Goals
and Binarization.
Phd thesis, Technische Universität Wien, 1992.
- 11
-
U. Neumerkel.
A transformation based on the equality between terms.
In Logic Program Synthesis and Transformation, LOPSTR 1993.
Springer-Verlag, 1993.
- 12
-
P. 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.
- 13
-
P. 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, Sept. 1992.
- 14
-
P. Tarau.
Program Transformations and WAM-support for the Compilation
of Definite Metaprograms.
In A. Voronkov, editor, Logic Programming, RCLP Proceedings,
number 592 in Lecture Notes in Artificial Intelligence, pages 462-473,
Berlin, Heidelberg, 1992. Springer-Verlag.
- 15
-
P. Tarau.
WAM-optimizations in BinProlog: Towards a Realistic
Continuation Passing Prolog Engine.
Technical Report 92-3, Dept. d'Informatique, Université de
Moncton, July 1992.
available by ftp from clement.info.umoncton.ca.
- 16
-
P. Tarau.
An Efficient Specialization of the WAM for Continuation
Passing Binary programs.
In Proceedings of the 1993 ILPS Conference, Vancouver, Canada,
1993. MIT Press.
poster.
- 17
-
P. Tarau.
Language Issues and Programming Techniques in BinProlog.
In D. Sacca, editor, Proceeding of the GULP'93 Conference,
Gizzeria Lido, Italy, June 1993.
- 18
-
P. 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.
- 19
-
P. Tarau and M. 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, Aug. 1990.
- 20
-
P. Tarau, V. Dahl, and A. Fall.
Backtrackable State with Linear Assumptions, Continuations
and Hidden Accumulator Grammars.
In ILPS'95 Workshop on Visions for the Future of Logic
Programming, Nov. 1995.
- 21
-
P. Tarau, V. Dahl, and A. Fall.
Backtrackable State with Linear Affine Implication and
Assumption Grammars.
In J. Jaffar and R. H. Yap, editors, Concurrency and
Parallelism, Programming, Networking, and Security, Lecture Notes in
Computer Science 1179, pages 53-64, Singapore, Dec. 1996. Springer.
- 22
-
P. Tarau and K. De Bosschere.
Memoing with Abstract Answers and Delphi Lemmas.
In Y. Deville, editor, Logic Program Synthesis and
Transformation, Springer-Verlag, Workshops in Computing, pages 196-209,
Louvain-la-Neuve, July 1993.
- 23
-
P. Tarau and K. De Bosschere.
Virtual World Brokerage with BinProlog and Netscape.
In P. Tarau, A. Davison, K. De Bosschere, and M. Hermenegildo,
editors, Proceedings of the 1st Workshop on Logic Programming Tools for
INTERNET Applications, JICSLP'96, Bonn, Sept. 1996.
http://clement.info.umoncton.ca/ lpnet.
- 24
-
P. Tarau, K. De Bosschere, and B. Demoen.
Partial Translation: Towards a Portable and Efficient Prolog
Implementation Technology.
Journal of Logic Programming, 29(1-3):65-83, Nov. 1996.
- 25
-
P. Tarau and B. Demoen.
Language Embedding by Dual Compilation and State Mirroring.
In M. Fromherz, A. Kusalik, and O. Nytro, editors, Proceedings
of 6-th Workshop on Logic Programming Environments, Santa Margherita Ligure,
1994, pages 15-20, June 1994.
also available as TR N-7034 Norges Tek. Hogscole, TRONDHEIM.
- 26
-
P. Tarau, B. Demoen, and K. De Bosschere.
The Power of Partial Translation: an Experiment with the
C-ification of Binary Prolog.
In K. George, J. Carrol, E. Deaton, D. Oppenheim, and J. Hightower,
editors, Proceedings of the 1995 ACM Symposium on Applied Computing,
pages 152-176, Nashville, Feb. 1995. ACM Press.
- 27
-
P. Tarau and U. 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, Sept. 1994.
- 28
-
D. H. D. Warren.
An Abstract Prolog Instruction Set.
Technical Note 309, SRI International, Oct. 1983.
Next: 23 Appendix
Up: BinProlog 5.75 User
Previous: 22 Related work
Paul Tarau
Thu Apr 3 10:26:39 AST 1997