Abstract machines for programming language implementation

Future Generation Computer Systems

Volumn 16, Issue 7, 2000, Pages 739-751

  Diehl, Stephan ^a   Hartel, Pieter ^b   Sestoft, Peter ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS;

ABSTRACT MACHINES; CONCURRENT PROGRAMMING; FUNCTIONAL PROGRAMMING; IMPERATIVE PROGRAMMING; INTERMEDIATE LANGUAGES;

MACHINE ORIENTED LANGUAGES;

EID: 0033743591     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(99)00088-6     Document Type: Article

References (139)

1. A.V. Aho, B.W. Kernighan, P.J. Weinberger, The AWK Programming Language, Addison-Wesley, Reading, MA, 1988.
2. H. Aït-Kaci, Warren's Abstract Machine - A Tutorial Reconstruction, MIT Press, Cambridge, MA, 1991.
3. Engelhardt, Alexander, Wendelborn, An overview of the Adl language project, Proceedings of the Conference on High Performance Functional Computing, Denver, Colorado, 1995.
4. K.A.M. Ali, OR-parallel execution of Prolog on BC-machine, Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1531-1545.
5. K.A.M. Ali, R. Karlsson, Scheduling OR-Parallelism in MUSE, Proceedings of the 1990 North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 807-821.
6. K.A.M. Ali, R. Karlsson, The MUSE Or-Parallel Prolog Model and its Performance, Proceedings of the Eighth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 757-776.
7. U. Ammann, Code Generation of a Pascal-Compiler, In: D.W. Barron (Ed.), Pascal - The Language and its Implementation, Wiley, New York, 1981.
8. G. Argo, Improving the three instruction machine, Fourth International Conference on Functional Programming Languages and Computer Architecture, Imperial College, London, Addison-Wesley, Reading, MA, September 1989, pp. 100-112.
9. J.L. Armstrong, B.O. Däcker, S.R. Virding, M.C. Williams, Implementing a functional language for highly parallel real time applications, Proceedings of the Conference on Software Engineering for Telecommunication Systems and Services (SETSS'92), Florence, 1992.
10. L. Augustsson, A compiler for lazy ML, 1984 ACM Symposium on Lisp and Functional Programming, Austin, Texas, ACM, 1984, pp. 218-227.
11. Augustsson L. The interactive lazy ML system. J. Funct. Programming. 3(1):1993;77-92.
12. L. Augustsson, T. Johnsson, Parallel graph reduction with the 〈ν,G〉 machine, Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA'89), London, ACM, New York, 1989, pp. 202-213.
13. L. Augustsson, HBC - The Chalmers Haskell compiler, Web Page, 1999, URL: http://www.cs.chalmers.se/ augustss/hbc.html.
14. J. Batali et al., The Scheme-81 architecture, system and chip, MIT Conference on Advanced Research in VLSI, 1982.
15. A. Beguelin, J. Dongarra, A. Geist, B. Manchek, V. Sunderam, Recent Enhancements to PVM, Internat. J. Supercomput. Appl. 9(2) (1995).
16. C. Beierle, Formal design of an abstract machine for constraint logic programming, IFIP Congress, vol. 1, 1994, pp. 377-382.
17. C. Beierle, G. Meyer, H. Semele, Extending the Warren Abstract Machine to Polymorphic Order-sorted Resolution, Technical Report IWBS Report 181, Institute for Knowledge-based Systems, Stuttgart, 1991.
18. G.S. Blair, A convergence of parallel and distributed computing, in: M. Kara, J.R. Davy, D. Goodeve, J. Nash (Eds.), Abstract Machine Model for Parallel and Distributed Computing, IOS Press, Amsterdam, 1996.
19. J. Blazwicz, K.H. Ecker, G. Schmidt, J. Weglarz, Scheduling in Computer and Manufacturing Systems, Springer, Berlin, 1994.
20. E. Börger, D. Rosenzweig, The WAM - Definition and Compiler Correctness, in: C. Beierle, L. Plümer (Eds.), Logic Programming: Formal Methods and Practical Applications, North-Holland, Amsterdam, 1995, pp. 22-90.
21. P.G. Bosco, C. Cecchi, C. Moiso, An extension of WAM for K-LEAF: a WAM-based compilation of conditional narrowing, Proceedings of the Sixth International Conference on Logic Programming (Lisboa), MIT Press, Cambridge, MA, 1989.
22. S. Breitinger, U. Klusik, R. Loogen, Y. Ortega-Mallén, R. Pena, DREAM: The DistRibuted Eden Abstract Machine, in: Implementation of Functional Languages - Selected Papers of the Ninth International Workshop (IFL'97), Lecture Notes in Computer Science, vol. 1467, Springer, Berlin, 1997, pp. 250-269.
23. P.J. Brown, Macro Processors and Techniques for Portable Software, Wiley, Chichester, UK, 1988.
24. R. Butler, T. Disz, E. Lusk, R. Olson, R. Overbeek, R. Stevens, Scheduling Or-Parallelism: An Argonne Perspective, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988.
25. Campbell B., Goodman J.M. HAM: a general purpose hypertext abstract machine. Commun. ACM. 31(7):1988;856-861.
26. L. Cardelli, The functional abstract machine, Technical Report TR-107, AT&T Bell Labs, 1983.
27. L. Cardelli, Compiling a functional language, Lisp and Functional Programming, ACM, New York, 1984.
28. C. Chambers, D. Ungar, E. Lee, An efficient implementation of Self, a dynamically typed object-oriented language based on prototypes, in: OOPSLA'89, New Orleans, LA, October 1989, SIGPLAN Notices 24 (10) (1989) 49-70.
29. Chambers C., Ungar D., Lee E. An efficient implementation of Self, a dynamically typed object-oriented language based on prototypes. Lisp Symbol. Comput. 4(3):1991;57-95.
30. Chow F.C., Ganapathi M. Intermediate languages in compiler Construction-A bibliography. ACM SIGPLAN Notices. 18(11):1983;21-23.
31. Ciepielewski A., Haridi S., Hausman B. Or-Parallel Prolog on Shared Memory Multiprocessors. J. Logic Programming. 7:1989;125-147.
32. R. Clark, S. Koehler, The UCSD Pascal Handbook, Prentice-Hall, Englewood Cliffs, NJ, 1982.
33. Conway M.E. Proposal for an UNCOL. Commun. ACM. 1(10):1958;5-8.
34. G. Cousineau, P.-L. Curien, M. Mauny, The Categorial Abstract Machine, Proceedings of FPCA'85, Springer, LNCS 201, 1985.
35. G. Cousineau, M. Mauny, The Functional Approach to Programming, Cambridge University Press, Cambridge, 1998.
36. P. Crégut, An abstract machine for the normalization of λ terms, ACM Conference on Lisp and Functional Programming, Nice, France, ACM Press, 1990, pp. 333-340.
37. P. Crégut, Machinesá environnement pour la réduction symbolique et l'évaluation partielle, Ph.D. Thesis, Université Paris VII, France, 1991.
38. D. Culler, S.C. Goldstein, K. Schauser, T. von Eicken, TAM - A Compiler Controlled Threaded Abstract Machine, Special Issue on Dataflow, J. Parallel Distrib. Comput. 1993.
39. P.L. Curien, The λρ -calculus: an abstract framework for environment machines, Rapport de Recherche LIENS-88-10, Ecole Normale Supérieure, Paris, France, 1988.
40. H.B. Curry, R. Feys, Combinatory Logic, vol. I, North-Holland, Amsterdam, 1958.
41. J. Darlington, M.J. Reeve, ALICE: A multiple-processor reduction machine for the parallel evaluation of applicative languages, Proceedings of FPCA'81, 1981, pp. 65-76.
42. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, North-Holland, Amsterdam, 1990, pp. 243-320.
43. S. Diehl, Semantics-directed generation of compilers and abstract machines, Ph.D. Thesis, University Saarbrücken, Germany 1996, http://www.cs.uni-sb.de/ diehl/phd.html.
44. S. Diehl, An experiment in abstract machine design, Software - Practice and Experience 27 (1) (1997).
45. S. Diehl, Transformations of evolving algebras, Proceedings of the VIII International Conference on Logic and Computer Science LIRA'97, Novi Sad,Yugoslavia, 1997, pp. 43-50.
46. S. Diehl, Natural semantics-directed generation of compilers and abstract machines, Formal Aspects of Computing, in press.
47. Engelhardt, Wendelborn, A partitioning-independent paradigm for nested data parallelism, Internat. J. Parallel Programming 24 (2) (1996).
48. J. Fairbairn, S.C. Wray, TIM: A simple, lazy abstract machine to execute supercombinators, in: G. Kahn (Ed.), Functional Programming Languages and Computer Architecture, Portland, Oregon, Lecture Notes in Computer Science, vol. 274, Springer, Berlin, 1987, pp. 34-45.
49. Fowler G. A case for make. Software-practice and experience. 20(S1):1990;35-46.
50. J. Gabriel, T. Lindholm, E.L. Lusk, R.A. Overbeek, A Tutorial on the Warren Abstract Machine, Technical Report ANL-84-84, Argonne National Laboratory, Argonne, IL, 1985.
51. A. Goldberg, D. Robson, Smalltalk-80, The Language and Its Implementation, Addison-Wesley, Reading, MA, 1983.
52. A. Goldberg, D. Robson, Smalltalk-80, The Language and Its Implementation, Addison-Wesley, Reading, MA, 1989.
53. R.E. Griswold, The Macro Implementation of SNOLBOL4, Freeman, New York, 1972.
54. R.E. Griswold, J.F. Poage, I.P. Polonsky, The SNOLBOL4 programming language, Prentice-Hall, Englewood Cliffs, New Jersey, 1971.
55. G. Gupta, B. Jayaraman, A model for AND-OR parallel execution of logic programs, Proceedings of the 18th International Conference on Parallel Processing, 1989.
56. Hannan J. Operational semantics-directed compilers and machine architectures. ACM Transactions on Programming Languages and Systems. 16(4):1994;1215-1247.
57. M. Hanus, Compiling logic programs with equality, Proceedings of Second International Workshop on Programming Language Implementation and Logic Programming (PLILP'90), Lecture Notes in Computer Science, vol. 456, Springer, Berlin, 1990, pp. 387-401.
58. P.H. Hartel, M. Feeley, M. Alt, L. Augustsson, P. Baumann, M. Beemster, E. Chailloux, C.H. Flood, W. Grieskamp, J.H.G, van Groningen, K. Hammond, B. Hausman, M.Y. Ivory, R.E. Jones, J. Kamperman, P. Lee, X. Leroy, R.D. Lins, S. Loosemore, N. Röjemo, M. Serrano, J.-P. Talpin, J. Thackray, S. Thomas, P. Walters, P. Weis, P. Wentworth, Benchmarking implementations of functional languages with "pseudoknot", a Float-Intensive benchmark, J. Funct. Programming 6(4) (1996) 621-655, ftp.wins.uva.nl pub computer-systems functional reports JFP pseudoknotI.ps.Z.
59. M.V. Hermenegildo, An abstract machine based execution model for parallel execution of logic programs, Ph.D. Thesis, University of Texas at Austin, Austin, 1986.
60. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985.
61. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
62. R.J.M. Hughes, Super-combinators: A new implementation method for applicative languages, ACM Symposium on Lisp and Functional Programming, Pittsburgh, Pennsylvania, ACM, August 1982, pp. 1-10.
63. J. Hugunin, Python and Java - the best of both worlds, Proceedings of the Sixth International Python Conference, San Jose, California, October 1997, Corporation for National Research Initiatives, Reston, Virginia.
64. Adobe Systems, Inc., PostScript Language Reference Manual, Addison-Wesley, Reading, MA, 1990.
65. J. Jaffar, P.J. Stuckey, S. Michaylov, R.H.C. Yap, An Abstract Machine for CLP(R), in: PLDI'92, San Francisco, SIGPLAN Notices, 1992.
66. G. Janssens, B. Demoen, A. Mariën, Improving the register allocation in WAM by reordering unificiation, Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1388-1402.
67. R. Johnson, K. Shen, M. Fisher, J. Keane, A. Nisbet, An abstract machine for prototyping parallel proof mechanisms, in: M. Kara, J.R. Davy, D. Goodeve, J. Nash (Eds.), Abstract Machine Model for Parallel and Distributed Computing, IOS Press, Amsterdam, 1996.
68. T. Johnsson, Efficient compilation of lazy evaluation, Proceedings of the ACM SIGPLAN'84 Symposium on Compiler Construction, SIGPLAN Notices 19(6) (1984) 58-69.
69. R. Jones, R. Lins, Garbage Collection - Algorithms for Automatic Dynamic Memory Management, Wiley, New York, 1996.
70. U. Jørring, W.L. Scherlis, Compilers and staging transformations, Proceedings of the 13th ACM Symposium on Principles of Programming Languages, 1986.
71. P. Kacsuk, Execution Models of Prolog for Parallel Computers, MIT Press, Cambridge, MA, 1990.
72. J.F.T. Kamperman, H.R. Walters, ARM - Abstract rewriting machine, in: H.A. Wijshoff (Ed.), Computing Science in the Netherlands, 1993.
73. M. Kara, J.R. Davy, D. Goodeve, J. Nash (Eds.), Abstract Machine Model for Parallel and Distributed Computing, IOS Press, Amsterdam, 1996.
74. Kernighan B.W., Van Wyk C.J. Timing trials, or the trials of timing: experiments with scripting and user-interface languages. Software - practice and experience. 28(8):1998;819-843.
75. R.B. Kieburtz, The G-machine: A fast, graph-reduction evaluator, in: J.-P. Jouannaud (Ed.), Function Programming Languages and Computer Architecture, Nancy, France, September 1985, Lecture Notes in Computer Science, vol. 201. Springer, Berlin, 1985.
76. D.E. Knuth, TeX: The Program, Addison-Wesley, Reading, MA, 1986.
77. P. Koopman, Stack Computers: the new wave, Ellis Horwood, Chichester, UK, 1989, URL: http://www.cs.cmu.edu/ koopman/stack/computers/.
78. D.G. Korn, KSH - an extensible high level language, Very High Level Languages (VHLL), Santa Fe, New Mexico, Usenix Association, Berkely, CA, 1994, pp. 129-146.
79. H. Kuchen, R. Loogen, J.J. Moreno-Navarro, M. Rodríguez-Artalejo, Graph-based implementation of a functional logic language, Proceedings of European Symposium on Programming Languages (ESOP'90), Lecture Notes in Computer Science, vol. 432, Springer, Berlin, 1990, pp. 271-290.
80. P. Kursawe, How to invent a Prolog machine, Proceedings of the Third International Conference on Logic Programming, Lecture Notes in Computer Science, vol. 225, Springer, Berlin, 1986, pp. 134-148.
81. P.J. Landin, The mechanical evaluation of expressions, Comput. J. 6 (4) (1964).
82. X. Leroy, The Zinc experiment: An economical implementation of the ML language, Rapport Technique 117, INRIA Rocquencourt, France 1990.
83. INMOS Limited, Occam 2 Reference Manual, Prentice-Hall, London, 1988, ISBN 0-13-629312-3.
84. INMOS Limited, Transputer Instruction Set - A Compiler Writer's Guide, Prentice-Hall, London, 1988, ISBN 0-13-929100-8.
85. Y.-J. Lin, V. Kumar, AND-parallel execution of logic programs on a shared memory multiprocessor: a summary of results, Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1123-1141.
86. T. Lindholm, F. Yellin, The Java Virtual Machine Specification, Addison-Wesley, Reading, MA, 1996.
87. M. Lutz, Programming Python, O'Reilly, Sebastopol, California, October 1996.
88. L. Matyska, A. Jergova, D. Toman, Register allocation, in WAM, Proceedings of the Eighth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991.
89. S. McKeever, A framework for generating compilers from natural semantics specifications, in: P.D. Mosses (Ed.), Proceedings of the First Workshop on Action Semantics, BRICS-NS-94-1, University of Aarhus, Denmark, 1994.
90. M. Mehl, R. Scheidhauer, C. Schulte, An abstract machine for Oz, in: M. Hermenegildo, S.D. Swierstra (Eds.), Proceedings of the Seventh International Symposium, PLILP'95, vol. LNCS 982, Springer, Berlin, 1995.
91. J. Meyer, T. Downing, Java Virtual Machine, O'Reilly, Sebastopol, California, 1997.
92. The Microengine Company, Newport Beach, California, USA, Pascal Microengine Computer User's Manual, 1979.
93. Sun Microsystems, Microjava-701 java processor, Sun Microsystems Data Sheet, January 1998, URL: http://www.sun.com/microelectronics/microJava-701.
94. C. Moore, Forth: A new way to program a mini-computer, Astron. Astrophys. (Suppl.) 15 (1974) 497-511.
95. C. Moore, C.H. Ting, MuP21 - a high performance MISC processor, Forth Dimensions, January 1995. URL: http://www.UltraTechnology, com/mup21.html.
96. L. Moreau, The PCKS-machine: An abstract machine for sound evaluation of parallel functional programs with first-class continuations, Proceedings of the European Symposium on Programming Languages (ESOP'94), Lecture Notes in Computer Science, vol. 788, Springer, Berlin, 1994, pp. 424-438.
97. A. Mück, Camel: An extension of the categorial abstract machine to compile functional logic programs, PLILP'92, Lecture Notes in Computer Science, vol. 631, Springer, Berlin, 1992.
98. Nilsson U. Towards a methodology for the design of abstract machines for logic programming. J. Logic Programming. 16:1993;163-188.
99. K. Ogata, K. Ohhara, K. Futatsugi, TRAM: An abstract machine for order-sorted conditional term rewriting systems, Proceedings of the Eighth International Conference on Rewriting Techniques and Applications (RTA'97), Lecture Notes in Computer Science, vol. 1232, Springer, Berlin, 1997, pp. 335-338.
100. J.K. Ousterhout, Tcl and the Tk tookit, Addison-Wesley, Reading, MA, 1994.
101. Ousterhout J.K. Scripting: Higher level programming for the 21st century. IEEE Computer. 31(3):1998;23-30.
102. S. Pemberton, M. Daniels, Pascal Implementation: The P4 Compiler and Interpreter, Ellis Horwood, Chichester, UK, 1983, ISBN 0-13-653-0311.
103. S.L. Peyton Jones, C.V. Hall, K. Hammond, W.D. Partain, P.L. Wadler, The Glasgow Haskell compiler: a technical overview, Joint Framework for Information Technology (JFIT) Technical Conference, Keele, England, March 1993, DTI/SERC, pp. 249-257.
104. S.L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice-Hall, Englewood Cliffs, NJ, 1987.
105. Peyton Jones S.L. Implementing lazy functional languages on stock hardware, the spineless tagless G-machine. J. Funct. Programming. 2(2):1992;127-202.
106. S.L. Peyton Jones, C. Clark, J. Salkild, M. Hardie, GRIP: a high-performance architecture for parallel graph reduction, in: T.J. Fountain, M.J. Shute (Eds.), Multi-Processor Computer Architectures, North-Holland, Amsterdam, 1990.
107. G.D. Plotkin, A structural approach to operational semantics, Technical Report FN-19, DAIMI, Aarhus University, Denmark, 1981.
108. I.V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, D.S. Warren, Efficient tabling mechanisms for logic programs, in: L. Sterling (Ed.), Proceedings of the 12th International Conference on Logic Programming ,Tokyo, MIT Press, Cambridge, MA, 1995.
109. B. Randell, L.J. Russel, Algol60 Implementation, Academic Press, New York, 1964.
110. T.H. Romer, D. Lee, G.M. Voelker, A. Wolman, W.A. Wong, J.-L. Baer, B.N. Bershad, H.M. Levy, The structure and performance of interpreters, Proceedings of the 7th Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Cambridge, MA, September 1996, ACM, New York, 1996, pp. 150-159.
111. Russinoff D.M. A verified Prolog compiler for the Warren abstract machine. J. Logic Programming. 13:1992;367-412.
112. Sansom P.M., Peyton Jones S.L. Formally based profiling for higher-order functional languages. ACM Trans. Programming Languages Systems. 19(2):1997;334-385.
113. Schönfinkel M. Über die Bausteine der mathematischen Logik. Mathematische Annalen. 92(6)(6):1924;305-316.
114. H. Seidl, R. Wilhelm, Probabilistic load balancing for parallel graph reduction, Proceedings IEEE Region 10 Conference, IEEE Press, New York, 1989.
115. P. Sestoft, Analysis and efficient implementation of functional programs, Ph.D. Thesis, DIKU, University of Copenhagen, Denmark, 1991, DIKU Research Report 92/6.
116. P. Sestoft, Deriving a lazy abstract machine, J. Programming 7 (3) (1997).
117. P. Sestoft, Moscow, ML, Web Page, 1999, URL: http://www.dina.kvl.dk/ sestoft/mosml.html.
118. S. Srinivasan, Advanced Perl Programming, O'Reilly, Sebastopol, California, August 1997.
119. T.B. Steel Jr., A first version of UNCOL, Western Joint Comp. Conf., pp. 371-378. IRE and AIEE and ACM and AFIPS, New York, May 1961.
120. Sunderam V.S. PVM: a framework for parallel distributed computing. Software - Practice and Experience. 2(4):1990;315-339.
121. A.S. Tanenbaum, Modern Operating Systems, Prentice-Hall, Englewood Cliffs, NJ, 1992.
122. P.W. Trinder, K. Hammond, J.S. Mattson Jr., A.S. Patridge, GUM: a portable parallel implementation of Haskell, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'96), Philadelphia, 1996.
123. Turner D.A. A new implementation technique for applicative languages. Software - Practice and Experience. 9:1979;31-49.
124. P. van Roy, 1983-1993: The wonder years of sequential Prolog implementation, J. Logic Programming (1994).
125. P. van Roy, A.M. Despain, The benefits of global dataflow analysis for an optimizing Prolog compiler, Proceedings of the 1990 North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1990.
126. van Roy P., Haridi S., Brand P., Smolka G., Mehl M., Scheidhauer R. Mobile objects in distributed Oz. ACM Trans. Programming Languages Systems. 19(5):1997;804-851.
127. P.L. van Roy, Can logic programming execute as fast as imperative programming, Ph.D. Thesis, University of California at Berkley, Berkley, 1990.
128. L. Wall, T. Christiansen, R.L. Schwartz, Programming Perl, 2nd ed., O'Reilly, Sebastopol, California, September 1996.
129. H.R. Walters, J.F.Th. Kamperman, EPIC: an equational language - abstract machine and supporting tools, Proceedings of the Seventh Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 1103, Springer, Berlin, 1996, pp. 424-427.
130. M. Wand, Semantics-directed machine architecture, Proceedings of POPL 82, 1982.
131. M. Wand, From interpreter to compiler: a representational derivation, in: H. Ganzinger, N.D. Jones (Eds.), Programs as Data Objects, Lecture Notes in Computer Science, vol. 217, Springer, Berlin, 1986.
132. D.H.D. Warren, Implementing Prolog - compiling predicate logic programs, D.A.I Research Report No. 40, Edinburgh, 1977.
133. D.H.D. Warren, An abstract Prolog instruction set, Technical Note 309, SRI International, Menlo Park, CA, 1983.
134. D.H.D. Warren, The SRI-Model for OR-Parallel Execution of Prolog - Abstract Design and Implementation Issues, IEEE Symposium on Logic Programming, San Francisco, 1987, pp. 125-133.
135. Pierre Weis, The Caml Language, Web Page, 1999, URL: http://pauillac.inria.fr/caml/.
136. B. Weissman, B. Gomes, J.W. Quittek, M. Holtkamp, Efficient fine-grain thread migration with active threads, Proceedings of 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, 1996.
137. R. Wilhelm, M. Alt, F. Martin, M. Raber, Parallel implementation of functional languages, in: M. Dam (Ed.), Fifth LOMAPS Workshop, Analysis and Verification of Multiple-Agent Languages, Lecture Notes in Computer Science, vol. 1192, Springer, Berlin, June 1997.
138. R. Wilhelm, D. Maurer, Compiler Design: Theory, Construction, Generation, Addison-Wesley, Reading, MA, 1995.
139. S. Wintner, E. Gabrilovich, N. Francez, Amalia - a unified platform for parsing and generation, Proceedings of Recent Advances in Natural Language Processing, Tzigov Chark, Bulgaria, 1997.