Instruction merging and specialization in the SICStus Prolog virtual machine

Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2001, Pages 49-60

  Nässén, Henrik ^a   Carlsson, Mats ^a   Sagonas, Konstantinos ^b  

^a Swedish Space Science Institute   (Sweden)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; STATISTICAL METHODS; VIRTUAL REALITY;

VIRTUAL MACHINES;

PROLOG (PROGRAMMING LANGUAGE);

EID: 0035790286     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773184.773191     Document Type: Conference Paper

References (18)

1. H. Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. The MIT Press, Cambridge, Massachusetts, 1991. See also: http://www.isg.sfu.ca/̃hak/documents/wam.html.
2. K. Appelby, M. Carlsson, S. Haridi, and D. Sahlin. Garbage collection for Prolog based on WAM. Commun. ACM, 31(6):719-741, Feb. 1988.
3. J. R. Bell. Threaded code. Commun. ACM, 16(8):370-373, June 1973.
4. B. Demoen and P.-L. Nguyen. On the impact of argument passing on the performance of the WAM and B-Prolog. Technical Report CW 300, K.U. Leuven, 2000.
5. B. Demoen and P.-L. Nguyen. So many WAM variations, so little time. In J. Lloyd et al., editors, Proceedings of Computational Logic - CL-2000, number 1861 in LNAI, pages 1240-1254. Springer, July 2000.
6. M. A. Ertl. Stack caching for interpreters. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'95), pages 315-327. ACM Press, June 1995.
7. M. A. Ertl and D. Gregg. Hardware support for efficient interpreters: Fast indirect branches. Unpublished manuscript, 2000.
8. C. W. Fraser, E. W. Myers, and A. L. Wendt. Analysing and compressing assembly code. In Proceedings of the SIGPLAN'84 Symposium on Compiler Construction, pages 117-121. ACM, June 1984.
9. C. Holzbaur. Metastructures vs. attributed variables in the context of extensible unification. In M. Bruynooghe and M. Wirsing, editors, Proceedings of the Fourth International Symposium on PLILP, number 631 in LNCS, pages 260-268. Springer-Verlag, Aug. 1992.
10. X. Leroy et al. The Objective Carol system release 3.01. INRIA, Mar. 2001. See also http://caml.inria.fr/ocaml/.
11. E. Miranda. BrouHaHa - a portable Smalltalk interpreter. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA '87), pages 354-365. ACM Press, Oct. 1987.
12. H. Nässén. Optimizing the SICStus Prolog virtual machine instruction set. Master's thesis, Computing Science Department, Uppsala University, Max. 2001.
13. I. Piumarta and F. Riccardi. Optimizing direct threaded code by selective inlining. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98), pages 291-300. ACM Press, June 1998.
14. T. A. Proebsting. Optimizing an ANSI C interpreter with superoperators. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 322-332. ACM Press, Jan. 1995.
15. V. Santos Costa. Optimising bytecode emulation for Prolog. In G. Nadathur, editor, Principles and Practice of Declarative Programming: Proceedings of PPDP'99, number 1702 in LNCS, pages 261-267. Springer-Verlag, Sept./Oct. 1999.
16. P. Van Roy. 1983-1993: The wonder years of sequential Prolog implementation. Journal of Logic Programming, 19/20:385-441, May/July 1994.
17. P. Van Roy and A. M. Despain. High-performance logic programming with the Aquarius Prolog compiler. IEEE Computer, 25(1):54-68, Jan. 1992.
18. D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI International, Menlo Park, U.S.A., Oct. 1983.