distributed / parallel logic programming...lp technology (june 03, 2007, 61 pages) 5 [armstrong,...

Distributed / Parallel Logic Programming

Cees Visser

June 03, 2007

Logic programming implementation / application issues : Compiler con-struction / optimizations, Efficient operator precedence (bottom-up) parsers,Native code backend specifications, Multi-threaded runtime systems and au-tomatic memory management, Parallel active objects and synchronization,Multi-language interoperability,

Rule-based 3D multi-player games and intelli-bots, Constraints-basedproblem solving models, Networked virtual worlds and distributed artificialintelligence, Virtual Reality Modeling, 3D simulation visualizations,

Robust software systems (myths and reality): Strong typing myths versusstrong testing reality, . . .

Work in progress: about 22 pages of this bibliography should be removedand about 8 pages (w better, more appropriate ) LP implementation + ap-plication entries will be added . . .

References

[Abdennadher and Fruhwirth, 2003] Slim Abdennadher and ThomFruhwirth, Essentials of Constraint Programming, Springer-Verlag,2003, http://www.informatik.uni-ulm.de/pm/

[Abdullahi et al., 1992] Saleh E. Abdullahi, Eliot E. Miranda, and Graem A.Ringwood, Distributed Garbage, in Memory Management, Lecture Notesin Computer Science, 637, pp. 43-81, Springer-Verlag, 1992 (A=F)

[Abdullahi, 1995] Saleh E. Abdullahi, Empirical Studies of DistributedGarbage Collection, PhD. dissertation, Queen Mary and Westfield Col-lege, Dec 1995 (A=F)

1

2 (ctv at cs.vu.nl)

[Abdullahi and Ringwood, 1998] Saleh E. Abdullahi and Graem A. Ring-wood, Garbage collecting the Internet: a survey of distributed garbagecollection, in ACM Computing Surveys, 30(3), pp. 330–373, Sept 1998(A=F)

[Abe et al., 1987] S. Abe, T. Bandoh, S. Yamaguchi, K. Kurosawa, and K.Kiriyama, High performance integrated Prolog processor IPP, in ISCA’87: Proceedings of the 14th annual international symposium on Com-puter architecture, pp. 100–107, ACM Press, 1987 (A=F)

[Abramsky and Hankin, 1987] S. Abramsky and C. Hankin (eds.), AbstractInterpretation of Declarative Languages, Ellis Horwood, 1987

[Agha et al., 1993] G. Agha, P. Wegner and A. Yonezawa (eds.), Researchdirections in concurrent object-oriented programming, The MIT Press,1993

[Aiken et al., 1995 (TR)] Alex Aiken, Manuel Fahndrich, and Raph Levien,Better static memory management: improving region-based analysis ofhigher-order languages, Technical report, University of California atBerkeley, 1995 (A=F)

[Aiken et al., 1995] A. Aiken, M. Fahndrich, and Raph Levien, Better staticmemory management: improving region-based analysis of higher-orderlanguages, in [Wall, PLDI 1995], pp. 174–185 (A=F)

[Airiyan et al., 1998] H. Airiyan, F. O’Brien, Investigations into functionalprogramming with Erlang, Proc. Software Engineering: Education andPractice, pp. 209–212, 1998

[Albert et al., 2001] Elvira Albert, Michael Hanus, German Vidal, A Practi-cal Partial Evaluator for a Multi-Paradigm Declarative Language, in Proc.International Symposium on Functional and Logic Programming, 2001

[Ali and Haridi, 1987] Khayri A.M. Ali and Seif Haridi, Global Garbage Col-lection for Distributed Heap Storage Systems, SICS Report R87005, 1987(A=C)

[Ali, 1995] K. Ali, A Parallel Copying Garbage Collection Scheme for Shared-Memory Multiprocessors, in [Tick and Chikayama, 1994]

LP Technology (June 03, 2007, 61 Pages) 3

[Ali, 1998] K. A. M. Ali, A Simple Generational Real-Time Garbage Collec-tion Scheme, New Generation Computing, 16(2), Feb 1998

[Ambriola et al., 1990] V. Ambriola, P. Ciancarini, and M. Danelutto, De-sign and Distributed Implementation of the Parallel Logic LanguageShared Prolog, in Second ACM SIGPLAN symposium on Principles &practice of parallel programming, 25(3), pp. 40–49, March 1990 (A=F)

[Ambriola and Tortora, 1992] V. Ambriola and G. Tortora (eds.), Advancesin Software Engineering and Knowledge Engineering, World ScientificPublishing, 1992

[Ames et al., 2001] Andrea L. Ames, David R. Nadeau, John L. Moreland,VRML 2.0 SourceBook, Wiley, 2001

[Ames, 2005] Ben Ames, Vetronics for the Future Combat Systems, Militaryand Aerospace Electronics, Distributed Publish-Subscribe Data Services,Aug 2005

[Anderson, 2006] Christopher Lyon Anderson, Type Inference for JavaScript,PhD. dissertation, Department of Computing, Imperial College London,March 2006 (A=F)

[Appel, 1988] A.W. Appel, Simple Generational Garbage Collection and FastAllocation, 1988 (A=F)

[Appel, 1992] Andrew W. Appel, Compiling with Continuations, CambridgeUniversity Press, 1992

[Appel and Aiken, POPL 1999] Andrew Appel and Alex Aiken (eds.), Pro-ceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principlesof programming languages, ACM Press, 1999

[Appleby et al., 1988] Karen Appleby, Mats Carlsson, Seif Haridi, and DanSahlin, Garbage Collection for Prolog Based on WAM, Communicationsof the ACM, 31(6), pp. 719–741, June 1988 (A=C/F)

[Apt, 1992] K.R. Apt (ed.), Proc. Joint International Conference and Sym-posium on Logic Programming, The MIT Press, 1992

4 (ctv at cs.vu.nl)

[Apt et al., 1993] K.R. Apt, J.W. de Bakker, and J.J.M.M. Rutten (eds.),Logic programming languages: constraints, functions and objects, TheMIT Press, 1993

[Apt, 1999] K.R. Apt, Book review of Programming with Constraints: AnIntroduction, by Kim Marriot, Peter J. Stuckey, MIT Press, Artificial In-telligence in Medicine, 16, pp. 315–319, 1999, http://www.cwi.nl/~apt/

[Apt et al., 1999] K.R. Apt, V.W. Marek, M. Truszczynski, D.S. War-ren (eds.), The Logic Programming Paradigm: a 25-Year Perspective,Springer-Verlag, 1999

[Araujo and Ruz, 1994] Lourdes Araujo and Jose J. Ruz, A Parallel PrologSystem for Distributed Memory, Journal of Logic Programming, 19/20(1),1994 (A=F)

[Armstrong and Virding, 1990] J.L. Armstrong and S.R. Virding, Erlang –An Experimental Telephony Programming Language, Computer ScienceLaboratory, Ellemtel, 1990 (A=F)

[Armstrong et al., 1992] J.L. Armstrong, B.O. Dacker, S.R. Virding, andM.C. Williams, Implementing a functional language for highly parallelreal-time applications, in Software Engineering for TelecommunicationSwitching Systems, March 1992

[Armstrong and Virding, 1995] Joe Armstrong and Robert Virding, Onepass Real-Time Generational Mark-Sweep Garbage Collection, in[Baker H.G., IWMM 1995] , pp. 313–322 (A=F)

[Armstrong et al., 1996] Joe Armstrong, Robert Virding, Claes Wikstromand Mike Williams, Concurrent Programming in Erlang, Prentice-Hall,1996, http://www.sics.se/~joe/

[Armstrong, 2002] Joe Armstrong, Concurrent Oriented Programming in Er-lang, in Lightweight Languages Workshop, 2002

[Armstrong, 2003] Joe Armstrong, Making reliable distributed systems in thepresence of software errors, PhD. dissertation, Royal Institute of Tech-nology, Stockholm, Dec 2003


[Armstrong, 2007] Joe Armstrong, Programming Erlang, Pragmatic Book-shelf, 2007

[Asperti and Guerrini, 1998] Andrea Asperti and Stefano Guerrini, The Op-timal Implementation of Functional Programming Languages, CambridgeTracts in Theoretical Computer Science, No 45, Cambridge UniversityPress, 1998

[Azzoune, 1988] H. Azzoune, Type Inference in Prolog, in Proc. 9th Int’lConf. on Automated Deduction, Lecture Notes in Computer Science, 310,pp. 258–277, Springer-Verlag, May 1988 (A=C)

[Bacon et al., 2003] David F. Bacon, Perry Cheng, and V. T. Rajan, A real-time garbage collector with low overhead and consistent utilization, in[Morrisett and Aiken, POPL 2003], pp. 285–298 (A=C)

[Baker H.G., IWMM 1995] Henry G. Baker (ed.), Memory Management, In-ternational Workshop IWMM 95, Lecture Notes in Computer Science,986, Springer-Verlag, 1996

[Baker T.P. and Riccardi, 1985] T.P. Baker and G.A. Riccardi, Ada Tasking:from Semantics to Efficient Implementation, IEEE Software, pp. 34–45,March 1985 (A=F)

[Baldan et al., 1997] Dante Baldan, Nicola Civran and Gilberto File, An ex-tension of the WAM for uninitialized variables, in [Dutra et al., 1997],Oct 1997 (A=F)

[Baldan et al., 1999] Dante Baldan, Nicola Civran, Gilberto File, FrancescoPulvirenti, A Simple and General Method for Integrating Abstract Inter-pretation in SICStus, in [Nadathur, PPDP 1999]

[Barbuti et al., 1984] R. Barbuti, M. Bellia, G. Levi, and M. Martelli, Onthe Integration of Logic Programming and Functional Programming, inProc. International Symposium on Logic Programming, 1984

[Barbuti and Giacobazzi, 1992] R. Barbuti and R. Giacobazzi, A bottom-uppolymorphic type inference in logic programming, Science of ComputerProgramming, 19(3), pp. 281–313, Dec 1992

6 (ctv at cs.vu.nl)

[Barbuti et al., 1993] Roberto Barbuti, Roberto Giacobazzi, and GiorgioLevi, A General Framework for Semantics-Based Bottom-Up AbstractInterpretation of Logic Programs, ACM Transactions on ProgrammingLanguages and Systems, 15(1), pp. 133–181, Jan 1993

[Barklund and Millroth, TR 1986] Jonas Barklund and Hakan Millroth,Garbage Cut, Technical Report No. 38, Uppsala University, 1986 (A=C)

[Barklund and Millroth, SLP 1986] Jonas Barklund and Hakan Millroth,Garbage Cut for Garbage Collection of Iterative Prolog Programs, in Pro-ceedings Symposium on Logic Programming, pp. 276–283, 1986 (A=C)

[Barklund, 1987] Jonas Barklund, Efficient interpretation of Prolog pro-grams, in SIGPLAN ’87. Papers of the Symposium on Interpreters andInterpretive Techniques, pp. 132–137, 1987 (A=F)

[Barklund and Millroth, 1987] Jonas Barklund and Hakan Millroth, HashTables in Logic Programming, in [Lassez, ICLP 1987], pp. 411–427, 1987(A=C)

[Barklund (TR), 1987] Jonas Barklund, A Garbage Collection Algorithm forTricia, Upmail TR 37B, Uppsala University, December 1987

[Barklund et al., 1994] J. Barklund, B. Jayaraman and J. Tanaka (eds.),Proceedings of the post-ICLP’94 Workshop on Parallel and Data Par-allel Extensions of Logic Programs, Uppsala University, UPMAIL TR no.78, June 1994

[Beaumont and Gupta, 1991] A. Beaumont and G. Gupta (ed.), Parallel Ex-ecution of Logic Programs, Lecture Notes in Computer Science, 569,Springer-Verlag, 1991

[Becket et al., 2006] Ralph Becket, Maria J. Garca de la Banda, Kim Mar-riott, Zoltan Somogyi, Peter J. Stuckey, and Mark Wallace, Adding Con-straint Solving to Mercury, in [Hentenryk, PADL 2006] , pp. 118–133(A=F)

[Beemster, 1996] Marcel Beemster, Fine-grained Parallelism in a Lazy Func-tional Language, PhD. dissertation, University of Amsterdam, March1996 (A=C)


[Beer, 1989] Joachim Beer, Concepts, Design, and Performance Analysis ofa Parallel Prolog Machine, Lecture Notes in Computer Science, 404,Springer-Verlag, 1989

[Beierle et al., 1994] C. Beierle, S. Bottcher and G. Meyer, Report of the logicprogramming language PROTOS-L, FU-Hagen, July 1994 (A=C)

[Beierle and Meyer, 1994] Christoph Beierle and Gregor Meyer, Run-timeType Computations in the Warren Abstract Machine, Journal of LogicProgramming, 18(2), pp. 123–148, Feb 1994 (A=C)

[Beierle and Pluemer, 1995] C. Beierle and L. Pluemer (eds.), Logic Pro-gramming: Formal Methods and Practical Applications, North Holland,1995

[Beierle, 1995] Christoph Beierle, Type Inferencing for Polymorphic Order-Sorted Logic Programs, in [Sterling, 1995] , 1995 (A=C)

[Bekkers and Ungaro, 1990] Y. Bekkers and L. Ungaro, Real-time memorymanagement for Prolog, in [Voronkov, 1990], pp. 1–12, 1990 (A=C)

[Bekkers and Ungaro, 1991] Yves Bekkers and L. Ungaro, Implementing par-allel garbage collection for Prolog, in [Voronkov, 1990], 1991

[Bekkers and Cohen, IWMM 1992] Y. Bekkers and J. Cohen (eds.), Inter-national Workshop IWMM’92, Memory Management, Lecture Notes inComputer Science, 637, Springer-Verlag, Sept 1992

[Bekkers et al., 1992(a)] Yves Bekkers, Olivier Ridoux, and Lucien Ungaro,Dynamic Memory Management for Sequential Logic Programming Lan-guages, in [Bekkers and Cohen, IWMM 1992], pp. 82–102, 1992 (A=C)

[Bekkers et al., 1992(b)] Y. Bekkers, O. Ridoux, and L. Ungaro,A survey on memory management for logic programming, in[Bekkers and Cohen, IWMM 1992], 1992

[Bell J.R., 1969] James R. Bell, A new method for determining linear prece-dence functions for precedence grammars, Communications of the ACM,12(10), pp. 567–569, Oct 1969 (A=F)

[Benhamou, 1994] Frederic Benhamou, Interval Constraint Logic Program-ming, in [Podelski, CP 1994] , pp. 1–21, 1994

8 (ctv at cs.vu.nl)

[Benton et al., 1998] Nick Benton, Andrew Kennedy, and George Russell,Compiling standard ML to Java bytecodes, in Proc. International Confer-ence on Functional Programming 1998, pp. 129–140, 1998 (A=C)

[Bernstein, 1985] Robert L. Bernstein, Producing good code for the casestatement, Software — Practice and Experience, 15(10), pp. 1021–1024,1985

[Bevemyr and Lindgren, 1994(a)] Johan Bevemyr and Thomas Lindgren, ASimple and Efficient Copying Garbage Collector for Prolog, Lecture Notesin Computer Science, 844, pp. 88–101, Springer-Verlag, 1994 (A=C)

[Bevemyr and Lindgren, 1994(b)] J. Bevemyr and T. Lindgren, A Simpleand Efficient Copying Garbage Collector for Prolog, TR 87, Uppsala Uni-versity, Aug 1994 (A=C)

[Bevemyr, 1995] Johan Bevemyr, A Generational Parallel Copying GarbageCollector for Shared Memory Prolog, TR 117, Uppsala University, Nov1995 (A=C)

[Bevemyr, 1996] Johan Bevemyr, Data-Parallel Implementation of Prolog,PhD. dissertation, Uppsala University, 1996 (A=C)

[Bharadwaj et al., 2000] Jay Bharadwaj, William Y. Chen, Weihaw Chuang,Gerolf Hoflehner, Kishore Menezes, Kalyan Muthukumar, and Jim Pierce,The Intel IA-64 Compiler Code Generator, IEEE Micro, 20(5), pp. 44–53,Sept/Oct 2000 (A=F)

[Bigot and Debray, 1997] Peter A. Bigot and Saumya K. Debray, A simpleapproach to supporting untagged objects in dynamically typed languages,Journal of Logic Programming, 32(1), pp. 25–47, July 1997

[Boehm and Detlefs, ISMM 2002] Hans-J. Boehm and David Detlefs (eds.),Proceedings of the third international symposium on Memory manage-ment, ACM Press, 2002

[Boerger and Demoen, 1991] E. Boerger and B. Demoen, A framework tospecify database update views for Prolog, in Proceedings of the Third In-ternational Symposium on Programming Language Implementation andLogic Programming, pp. 147–158, Aug 1991


[Boizumault, 1986] P. Boizumault, A general model to implement dif andfreeze, in [Shapiro, ICLP’86], pp. 585–592, 1986 (A=C)

[Boizumault, 1988] P. Boizumault, Prolog: l’implantation, Masson, Paris,1988

[Boizumault, 1993] P. Boizumault, The Implementation of Prolog, PrincetonSeries in Computer Science, 1993

[Bond and Soetarman, 1990] Alan H. Bond and Basuki Soetarman, Integrat-ing Prolog and CADAM to Produce an Intelligent CAD System, Software— Practice and Experience, 20(10), pp. 1049–1076, Oct 1990

[Bordini, 2005] R.H. Bordini, M. Dastani, J. Dix, A.E.F. Seghrouchni (eds.),Programming Multi-Agent Systems, Third International Workshop, Pro-MAS , Lecture Notes in Computer Science, 3862, Springer-Verlag, July2005

[De Bosschere et al., 1994] K. de Bosschere, B. Demoen, and P. Tarau (eds.),ILPS’94 Post-Conference Workshop on Implementation Techniques forLogic Programming Languages, Nov 1994

[Bosschere and Tarau, 1994] Koen De Bosschere and Paul Tarau, High per-formance continuation passing style Prolog-to-C mapping, in Symposiumon Applied Computing, Proceedings of the 1994 ACM symposium on Ap-plied computing, pp. 383–387, 1994

[Bosschere and Tarau, 1996] K. de Bosschere and P. Tarau, Blackboard-basedExtensions in Prolog, Software — Practice and Experience, 26(1), pp. 49–69, Jan 1996

[Bosschere, 1996] K. de Bosschere, An Operator Precedence Parser for Stan-dard Prolog Text, Software — Practice and Experience, 26(7), pp. 763–779, July 1996

[Bothner, 1998] P. Bothner, Kawa: Compiling Scheme to Java, in UsenixConference Proceedings, Dec 1998 (A=C)

[Bowen D.L., and Byrd, 1983] D.L. Bowen and L.M. Byrd, A portable Prologcompiler, in Proceedings of the Logic Programming Workshop, 1983

10 (ctv at cs.vu.nl)

[Bowen K.A., 1979] Kenneth A. Bowen, Prolog, in ACM/CSC-ER, Proceed-ings of the 1979 Annual Conference, pp. 14–23, 1979 (A=F)

[Bowen K.A. et al., 1986] K.A. Bowen, K.A. Buettner, I. Cicekli and A.K.Turk, The Design and Implementation of a High-Speed IncrementalPortable Prolog Compiler, in [Shapiro, ICLP’86], pp. 650–656, 1986(A=C)

[Boyapati, 2004] Chandrasekhar Boyapati, SafeJava: A Unified Type Systemfor Safe Programming, PhD. dissertation, MIT EECS, Feb 2004 (A=F)

[Bratko, 1990] I. Bratko, Prolog: programming for artificial intelligence,Addison-Wesley, 1990

[Bratko, 2000] I. Bratko, Prolog: programming for artificial intelligence,Addison-Wesley, 2000

[Bratvold, 1994] Tore Andreas Bratvold, Skeleton-Based Parallelisation ofFunctional Programs, PhD. dissertation, Dept of Computing and Electri-cal Engineering, Heriot-Watt University, Nov 1994 (A=F)

[Bres et al., 2004] Yannis Bres, Bernard Paul Serpette, and Manuel Serrano,Compiling Scheme Programs to .NET Common Intermediate Language,in Proceedings .NET Technologies Workshop, 2004 (A=F)

[Brogi and Ciancarini, 1991] Antonio Brogi and Paolo Ciancarini, The Con-current Language Shared Prolog, ACM Transactions on ProgrammingLanguages and Systems, 13(1), pp. 99–123, Jan 1991 (A=F)

[Brogi and Gorrieri, 1993] Antonio Brogi and Roberto Gorrieri, DistributedLogic Programming, Journal of Logic Programming, 15(4), pp. 295–335,Apr 1993

[Bruynooghe, 1982] Maurice Bruynooghe, The Memory Management of Pro-log Implementations, in [Clark and Tarnlund, 1982] , pp. 83–98

[Bruynooghe, 1982 (ICLP)] M. Bruynooghe, A Note on Garbage-Collectionin Prolog Interpreters, in [Caneghem, ICLP 1982] , pp. 52–55

[Bruynooghe, 1986] Maurice Bruynooghe, Compile-time garbage collection,Report CW43, Katholieke Universiteit Leuven


[Bruynooghe and Janssens, 1988] M. Bruynooghe and G. Janssens, An In-stance of Abstract Interpretation Integrating Type and Mode Inference, in[Kowalski and Bowen, 1988], pp. 669–683

[Bruynooghe et al., 1989] Maurice Bruynooghe, Danny De Schreye andBruno Krekels, Compiling Control, Journal of Logic Programming, 6(1 &2), pp. 135–162, Jan/Mar 1989

[Bruynooghe META’90] M. Bruynooghe (ed.), Proceedings of the 2nd Work-shop on Meta-Programming in Logic Programming, K.U. Leuven, Dept.of Computer Science, 1990

[Bruynooghe, 1991] Maurice Bruynooghe, A Practical Framework for the Ab-stract Interpretation of Logic Programs, Journal of Logic Programming,10(2), pp. 91–124, Feb 1991 (A=C)

[Bruynooghe and Wirsing, PLILP’92] M. Bruynooghe and M. Wirsing(eds.), 4th International Symposium on Programming Language Imple-mentation and Logic Programming, Lecture Notes in Computer Science,631, Springer-Verlag, Aug 1992

[Bueno et al., 1996] F. Bueno, D. Cabeza, M. Hermenegildo, and G. Puebla,Data-flow Analysis of Standard Prolog Programs, in European Symposiumon Programming, Lecture Notes in Computer Science, 1058, pp. 108–124,Springer-Verlag, April 1996

[Buettner, 1986] K.A. Buettner, Fast decompilation of compiled Prologclauses, in [Shapiro, ICLP’86], pp. 663–670, 1986 (A=C)

[Burke and Soffa, PLDI 2001] Michael Burke and Mary Lou Soffa (eds.),Proceedings of the ACM SIGPLAN conference on Programming languagedesign and implementation, 2001

[Busby et al., 2004] Jason Busby, Zak Parrish, and Joel van Eenwyk, Mas-tering Unreal Technology, Sams.net Publishing, 2004

[Cabeza and Hermenegildo, 2000] Daniel Cabeza and Manuel Hermenegildo,A New Module System for Prolog, in [Lloyd et al., CL 2000]

[Cabeza and Hermenegildo, 2001] Daniel Cabeza and Manuel Hermenegildo,Distributed WWW programming using (Ciao-)Prolog and the PiLLoW


library, Theory and Practice of Logic Programming, 1(3), pp. 251–282,2001

[Campbell, 1984] J.A. Campbell (ed.), Implementations of Prolog, Ellis Hor-wood, 1984

[Caneghem, ICLP 1982] Michel van Caneghem (ed.), Proceedings of the FirstInternational Logic Programming Conference, Sept 1982

[Carey and Bell, 1997] Rikk Carey and Gavin Bell, Annotated VRML 2.0Reference Manual, Addison-Wesley, 1997

[Carlsson, 1986] Mats Carlsson, Freeze, Indexing and other ImplementationIssues in the WAM, Research Report R86011B, SICS, 1986 (A=C)

[Carlsson, 1987] Mats Carlsson, Freeze, Indexing and other ImplementationIssues in the WAM, in [Lassez, ICLP 1987], pp. 40–58

[Carlsson, 1989] M. Carlsson, On the efficiency of optimising shallow back-tracking in compiled Prolog, in [Levi and Martelli, ICLP 1989], pp. 3–16

[Carlsson, 1990] M. Carlsson, On the Efficiency of Optimising Shallow Back-tracking in Compiled Prolog, SICS TR R90:03

[Carlsson and Sahlin, 1990] Mats Carlsson and Dan Sahlin, Variable shunt-ing for the WAM, in [Mills, 1990]

[Carlsson, 1991] Mats Carlsson, Variable shunting for the WAM, SICS Tech-nical Report R91:07, 1991 (A=F)

[Carlsson, 1991] Mats Carlsson, The SICStus Emulator, SICS Technical Re-port T91:15, 1991 (A=C)

[Carlton and Van Roy, 1988] Mike Carlton and Peter van Roy, A DistributedProlog System with And-Parallelism, IEEE Software, 5(1), pp. 43–51, Jan1988 (A=F)

[Carro and Hermenegildo, 1999] Manuel Carro, Manuel Hermenegildo, Con-currency in Prolog Using Threads and a Shared Database, in Proc. Inter-national Conference on Logic Programming, pp. 320–334, 1999

[Carter, 2007] Chad Carter, Microsoft XNA, SAMS, 2007


[Castagnetti and Ciancarini, 1991] T. Castagnetti and P. Ciancarini, StaticAnalysis of a Parallel Logic Language Based on the Blackboard Model,Journal of Parallel and Distributed Computing, 13(4), pp. 412–423, Dec1991

[Castro and Santos Costa, 2001] Luis Castro and Vitor Santos Costa,Understanding Memory Management In Prolog Systems, in[Codognet, 2001], pp. 11–26 (A=F)

[Castro et al., 2002] Luis F. Castro, Vitor S. Costa, and Ricardo Lopes, Onthe cache performance of Prolog systems, in [Demoen, CICLOPS 2002] ,2002 (A=F)

[Chailloux et al., 2004] Emmanuel Chailloux, Gregoire Henry, and RaphaelMontelatici, Mixing the Objective Caml and C# Programming Models inthe .NET Framework, International Workshop on Multiparadigm Pro-gramming with OO Languages, June 2004 (A=F)

[Chakravarty and Lock, 1994] M.M.T Chakravarty and H.C.R. Lock, TheJUMP machine : a generic basis for the integration of declarativeparadigms, TU Berlin, 1994

[Chambers and Hoskin, ISMM 2000] Craig Chambers and Antony Hosking(eds.), International Symposium on Memory Management, Proceedingsof the second international symposium on Memory management, ACMPress, Oct 2000

[Chang and Despain, 1985] J.H. Chang and A.M. Despain, Semi intelligentbacktracking of Prolog based on static data dependency analysis, in 1985Symposium on Logic Programming, pp. 10–21, IEEE, July 1985

[Chang, 1986] J.-H. Chang, High performance execution of Prolog programsbased on a static dependency analysis, PhD. dissertation, Univ. Calif.Berkeley, 1986

[Charlier, 1994] Baudouin Le Charlier (ed.), 1st International Static Analy-sis Symposium, SAS ’94, Namur, Belgium, Lecture Notes in ComputerScience, 864, Springer-Verlag, Sept 1994

[Chase, 1987] David R. Chase, Garbage Collection and Other Optimizations,PhD. dissertation, Rice University, August 1987 (A=F)


[Chen T. et al., 1994] Ta Chen, I.V. Ramakrishnan and R. Ramesh, Multi-stage indexing algorithms for speeding Prolog execution, Software — Prac-tice and Experience, 24(12), pp. 1097–1119, Dec 1994 (A=C)

[Cheng and Blelloch, 2001] Perry Cheng and Guy E. Blelloch, A parallel,real-time garbage collector, in [Burke and Soffa, PLDI 2001], pp. 125–136

[Cheng, 2001] Perry Cheng, Scalable Real-Time Parallel Garbage Collectionfor Symmetric Multiprocessors, PhD. dissertation, Carnegie Mellon Uni-versity, 2001 (A=F)

[Cheong FC, 1992] Fah-Chun Cheong, OASIS: An Agent-Oriented Program-ming Language for Heterogeneous Distributed Environments, PhD. disser-tation, University of Michigan, 1992 (A=C / F)

[Cheong MH, 2005] Mun Hon Cheong, Functional Programming and 3DGames, Bachelor of Engineering Thesis, University of New South Wales,Nov 2005 (A=F)

[Chikayama and Kimura, 1987] T. Chikayama and Y. Kimura, Multiple Ref-erence Management in Flat GHC, in [Lassez, ICLP 1987] , pp. 276–293

[Choi et al., 2001] Kwanghoon Choi, Hyun-il Lim, and Taisook Han, Com-piling Lazy Functional Programs for the Java Virtual Machine on thebasis of the Spineless Tagless G-machine, in Proc. International Sympo-sium on Functional and Logic Programming, Lecture Notes in ComputerScience, Springer-Verlag, 2001

[Chu, 1993] D. Chu, IC Prolog II : a multi-threaded Prolog system, in[Tick and Succi, 1993], pp. 16–33, 1993

[Chung et al., 2000] Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, andDan Sahlin, Reducing sweep time for a nearly empty heap, in Proceed-ings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles ofProgramming Languages, pp. 378–389, 2000 (A=F)

[Ciancarini and Levi, 1992] P. Ciancarini and G. Levi, Applications of logicprogramming in software engineering, 1992


[Ciancarini and Levi, 1992 (b)] P. Ciancarini and G. Levi, Whatis Logic Programming good for in Software Engineering?, in[Ambriola and Tortora, 1992], pp. 109–134, 1992

[Ciancarini, 1992 (c)] P. Ciancarini, Parallel programming with logic lan-guages, a survey, Computer Languages, 17(4), pp. 213–239, 1992

[Ciancarini and Sterling, 1996] P. Ciancarini and L. Sterling (eds.), Applica-tions of logic programming in software engineering, International Journalon Software Engineering and Knowledge Engineering, 6(1), 1996

[Ciepielewski et al., 1989] Andrzej Ciepielewski, Seif Haridi and BogumilHausman, Or-Parallel Prolog on Shared Memory Multiprocessors, Journalof Logic Programming, 7(2), pp. 125–148, Sept 1989

[Clark et al., 1982] K.L. Clark, F.G. McCabe and S.Gregory, IC-Prolog Lan-guage Features, in [Clark and Tarnlund, 1982], pp. 253–266, 1982

[Clark and Tarnlund, 1982] Keith L. Clark and Sten-Ake Tarnlund (eds.),Logic Programming, Academic Press, 1982

[Clark and Gregory, 1985] Keith Clark and Steve Gregory, Notes on the Im-plementation of Parlog, Journal of Logic Programming, 2(1), pp. 17–42,April 1985

[Clark and Gregory, 1986] Keith L. Clark and Steve Gregory, Parlog: Paral-lel Programming in Logic, ACM Transactions on Programming Languagesand Systems, 8(1), pp. 1–49, Jan 1986

[Clark, 1990] K.L. Clark, Parallel Logic Programming, Computer Journal,33(6), pp. 482–493, 1990

[Clark et al., 2001] Keith Clark, Peter J. Robinson, and Richard Hagen,Multi-threading and Message Communication in Qu-Prolog, Theory andPractice of Logic Programming, 2001 (A=F)

[Clocksin, 1985] W.F. Clocksin, Implementation Techniques for PrologDatabases, Software — Practice and Experience, 15(7), pp. 669–675, July1985

[Clocksin and Mellish, 2003] W.F. Clocksin and C.S. Mellish, Programmingin Prolog, Springer-Verlag, 2003


[Codish, 1999] Michael Codish, Efficient goal directed bottom-up evaluationof logic programs, Journal of Logic Programming, 38(3), March 1999

[Codognet and Diaz, 1995] Philippe Codognet and Daniel Diaz, WAMCC:Compiling Prolog to C, in [Sterling, 1995], pp. 317–331, 1995 (A=C)

[Codognet, 2001] P. Codognet (ed.), Proceedings 17th International Confer-ence, ICLP 2001, Lecture Notes in Computer Science, 2237, Springer-Verlag, 2001

[Cohen, 1985] J. Cohen, Describing Prolog by Its Interpretation and Com-pilation, Communications of the ACM, 28(12), pp. 1311–1324, Dec 1985(A=F)

[Cohen and Hickey, 1987] Jacques Cohen, Timothy J. Hickey, Parsing andCompiling Using Prolog, ACM Transactions on Programming Languagesand Systems, 9(2), pp. 125–163, April 1987 (A=C / F)

[Cohen, 1988] J. Cohen, A view of the origins and development of Prolog,Communications of the ACM, 31(1), pp. 26–36, Jan 1988 (A=F)

[Cohen, 1990] Jacques Cohen, Constraint logic programming languages,Communications of the ACM, 33(7), pp. 52–68, July 1990 (A=F)

[Cohen, 1996] Jacques Cohen, Logic programming and constraint logic pro-gramming, ACM Computing Surveys, 28(1), pp. 257–259, March 1996(A=F)

[Colmerauer, 1982 (NLP)] Alain Colmerauer, An Interesting Subset of Nat-ural Language, in [Clark and Tarnlund, 1982] , pp. 46–66

[Colmerauer, 1985] Alain Colmerauer, Prolog in 10 figures, Communicationsof the ACM, 28(12), pp. 1296–1310, Dec 1985

[Colmerauer, 1990] A. Colmerauer, An Introduction to Prolog III, Commu-nications of the ACM, 33(7), pp. 69–90, July 1990 (A=F)

[Colmerauer and Roussel, 1993] A. Colmerauer and P. Roussel, The Birthof Prolog, ACM SIGPLAN Notices, History of programming languagesconference, 28(3), pp. 37–52, 1993 (A=F)


[Colomb, 1991] Robert M. Colomb, Enhancing Unification in Prolog throughClause Indexing, Journal of Logic Programming, 10(1,2,3 & 4), pp. 23–44,1991

[Conery, 1987] J.S. Conery, Object oriented programming with first orderlogic, Technical Report TR 87/9, University of Oregon, 1987 (A=C)

[Conery and Meyer, 1987] J.S. Conery and D.M. Meyer, OM : a virtual pro-cessor for parallel logic programs, Technical Report TR 87/1, Universityof Oregon, 1987

[Conery, 1987(c)] John S. Conery, Parallel Execution of Logic Programs,Kluwer Academic Publishers Group, 1987 (A=C)

[Conway T, 2002] Thomas Conway, Towards parallel Mercury, PhD. disser-tation, University of Melbourne, July 2002

[Cook, 2004 (SPE)] Jonathan J. Cook, P#: a concurrent Prolog for the .NETframework, Software — Practice and Experience, 34(9), July 2004 (A=F)

[Cook, 2004 (Thesis)] Jonathan J. Cook, Language Interoperability andLogic Programming Languages, PhD. dissertation, University of Edin-burgh, 2004 (A=F)

[Cousot et al., WSA’93] Patrick Cousot, Moreno Falaschi, Gilberto File, andAntoine Rauzy (eds.), Static Analysis, Proceedings Third InternationalWorkshop, Lecture Notes in Computer Science, 724, Springer-Verlag,Sept 1993

[Cousot and Schmidt, 1996] R. Cousot and D.A. Schmidt (eds.), Static Anal-ysis, 3rd International Symposium, SAS ’96, Aachen, Germany, LectureNotes in Computer Science, 1145, Springer-Verlag, 1996

[Covington et al., 1988] M.A. Covington, D. Nute and A. Vellino, Prolog pro-gramming in depth, Prentice-Hall, 1988

[Covington, 1994] Michael A. Covington, Natural Language Processing forProlog Programmers, Prentice-Hall, 1994

[Crammond and Lindholm, 1993] Jim Crammond and Tim Lindholm, Mem-ory management in Quintus Prolog, in [Tick and Succi, 1993], pp. 35–42


[Dahl and Wadler, PADL 2003] Veronica Dahl and Philip Wadler (eds.),Proceedings Fifth International Symposium on Practical Aspects ofDeclarative Languages, Lecture Notes in Computer Science, 2562,Springer-Verlag, 2003

[Dart and Zobel, 1992] Philip W. Dart and Justin Zobel, Efficient Run-TimeType Checking of Typed Logic Programs, Journal of Logic Programming,14(1,2,3 & 4), pp. 31–69, 1992 (A=C)

[Das, 1998] Manuvir Das, Partial Evaluation using Dependence Graphs,PhD. dissertation, University of Wisconsin-Madison, 1998 (A=C / F)

[Davison, 1993] A. Davison, A survey of logic programming-based object-oriented languages, in [Agha et al., 1993], pp. 42–106, 1993,http://fivedots.coe.psu.ac.th/~ad/

[Davison, 1993(b)] A. Davison, 15th July 1972: A Significant Moment forLogic Programming, ACM SIGPLAN Notices, 28(4), 1993

[Davison, 2000] A. Davison, Enhancing VRML97 Scripting, PSU, Thailand,Nov 2000

[Davison, 2002] A. Davison, Logic Programming Languages for the Internet,in [Kakas and Sadri, 2002] (A=F)

[Davison, 2006] Andrew Davison, The Myths (and Truths) of Java GamesProgramming, in Proc. Game’On 2006 (A=F)

[Dawson et al., 1995] S. Dawson, C.R. Ramakrishnan, and I.V. Ramakrish-nan, Design and Implementation of Jump Tables for Fast Indexing ofLogic Programs, in [Hermenegildo and Swierstra, PLILP’95], pp. 133–150 (A=C)

[Debray, 1986] S.K. Debray, Register allocation in a Prolog machine, in Sym-posium on Logic Programming, pp. 267–275, The Computer Society Press,Sept 1986

[Debray, 1988] S.K. Debray, Profiling Prolog Programs, Software — Practiceand Experience, 18(9), pp. 821–839, Sept 1988


[Debray and Warren, 1988] S. K. Debray and D.S. Warren, Automatic modeinference for Prolog programs, Journal of Logic Programming, 5(3), pp.207–229, Sept 1988

[Debray, 1989] S.K. Debray, Static inference of modes and data dependenciesin logic programs, ACM Transactions on Programming Languages andSystems, 11(3), pp. 418–450, July 1989 (A=C)

[Debray, 1989(b)] S.K. Debray, Flow analysis of dynamic logic programs,Journal of Logic Programming, 7(2), pp. 149–176, Sept 1989

[Debray and Warren, 1990] S.K. Debray and D.S. Warren, Towards Banish-ing the Cut from Prolog, IEEE Transactions on Software Engineering,16(3), pp. 335–349, Mar 1990 (A=F)

[Debray, 1992(b)] S. K. Debray, Efficient dataflow analysis of logic programs,Journal of the Association for Computing Machinery, 39(4), pp. 949–984,Oct 1992

[Debray and Ramakrishnan, 1994] S. Debray and R. Ramakrishnan, Ab-stract Interpretation of Logic Programs Using Magic Transformations,Journal of Logic Programming, 18(2), pp. 149–176, Feb 1994

[Debray, 1995] S. Debray, Abstract Interpretation and Low Level Code Op-timization, in Proc. 1995 ACM Symposium on Partial Evaluation andSemantics-Based Program Manipulation, 1995

[Debray, 1995(b)] Saumya K. Debray, On the Complexity of Dataflow Anal-ysis of Logic Programs, ACM Transactions on Programming Languagesand Systems, 17(2), pp. 331–365, Mar 1995

[Debray and Lin, 1995] Saumya K. Debray and Nai-Wei Lin, Cost Analysisof Logic Programs, Technical Report, University of Arizona, Aug 1995(A=C)

[Debray and Proebsting, 1997] Saumya K. Debray and Todd A. Proebsting,Interprocedural control flow analysis of first-order programs with tail-calloptimization, ACM Transactions on Programming Languages and Sys-tems, 19(4), pp. 568–585, July 1997


[DeltaCE, 2005] DeltaCE, LP Tutorials and Systems web site,http://www.xs4all.nl/~deltace/prolog/

[Demoen and Marien, 1989] Bart Demoen and Andre Marien, Indexing Pro-log Clauses, in [Lusk and Overbeek, 1989]

[Demoen and Maris, 1994] Bart Demoen and Greet Maris, A comparison ofsome schemes for translating logic to C, in [Barklund et al., 1994] (A=C)

[Demoen et al., 1996] Bart Demoen, Geert Engels, and Paul Tarau, Segmentpreserving copying garbage collection for WAM based Prolog, in Proceed-ings of the 1996 ACM Symposium on Applied Computing, pp. 380–386,ACM Press, Feb 1996 (A=C)

[Demoen and Sagonas, 1998] Bart Demoen and Konstantinos Sag-onas, Memory Management for Prolog with Tabling, in[Peyton Jones and Jones, ISMM 1998], pp. 97–106 (A=F)

[Demoen and Sagonas, 1999] Bart Demoen and Konstantinos Sagonas,CHAT: the Copy-Hybrid Approach to Tabling, in [Gupta, PADL’99], pp.106–121

[Demoen, MM 2000] Bart Demoen (ed.), Proceedings of the first workshop onmemory management in logic programming implementations (CL 2000),Report CW 294, K.U. Leuven, July 2000

[Demoen and Nguyen, 2000] Bart Demoen and Phuong-Lan Nguyen, SoMany WAM Variations, So Little Time, in [Lloyd et al., CL 2000]

[Demoen and Sagonas, 2000] Bart Demoen and Konstantinos Sagonas,Heap Garbage Collection in XSB: Practice and Experience, in[Pontelli and Santos Costa, PADL 2000]

[Demoen and Sagonas, 2001] Bart Demoen and Konstantinos Sagonas,Memory management for Prolog with Tabling, Technical report CW 261,K.U. Leuven, Dec 2001

[Demoen, 2002] Bart Demoen, A Different Look at Garbage Collection forthe WAM, in [Stuckey, ICLP 2002]


[Demoen et al., 2002] Bart Demoen, Phuong-Lan Nguyen, and Ruben Van-deginste, Copying Garbage Collection for the WAM: To Mark or Not toMark?, in [Stuckey, ICLP 2002]

[Demoen, CICLOPS 2002] Bart Demoen (ed.), Proceedings of the CICLOPSColloquium on Implementation of Constraint and Logic ProgrammingSystems, Technical Report CW344, K.U. Leuven, July 2002 (A=F)

[Demoen and Nguyen, 2006 TR 455] Bart Demoen and Phuong-LanNguyen, Allocating WAM environments/choice points on the heap,Research Report CW 455, Leuven University, July 2006 (A=F)

[Demoen and Nguyen, 2006 TR 456] Bart Demoen and Phuong-LanNguyen, Reconstructing a semantics for Action Rules by a transforma-tion to almost plain Prolog, Research report CW 456, Leuven University,Aug 2006 (A=F)

[Demoen and Nguyen, 2006 TR 471] Bart Demoen and Phuong-LanNguyen, Suspension frames on the WAM heap, Research Report CW471, Leuven University, Dec 2006 (A=F)

[Deransart and Ma luszynski, 1985] Pierre Deransart and Jan Ma luszynski,Relating Logic Programs and Attribute Grammars, Journal of Logic Pro-gramming, 2(2), pp. 119–156, July 1985

[Deransart et al., PLILP’89] P. Deransart, B. Lorho and J. Ma luszynski(eds.), International Workshop, Programming Languages Implementa-tion and Logic Programming, Lecture Notes in Computer Science, 348,Springer-Verlag, 1989

[Deransart and Ma luszynski, PLILP’90] P. Deransart and J. Ma luszynski(eds.), 2nd International Workshop, Programming Languages Implemen-tation and Logic Programming, Lecture Notes in Computer Science, 456,Springer-Verlag, Aug 1990

[Deransart et el., 1996] P. Deransart, A. Ed-Dbali and L. Cervoni, Prolog:The Standard, Springer-Verlag, 1996

[Diaz and Codognet, 1993] D. Diaz and P. Codognet, A minimal extensionof the WAM for clp(FD), in [Warren D.S., ICLP’93], pp. 774–792, TheMIT Press, 1993


[Diaz and Codognet, 2000 (PADL)] Daniel Diaz and PhilippeCodognet, GNU Prolog: Beyond Compiling Prolog to C, in[Pontelli and Santos Costa, PADL 2000]

[Diaz and Codognet, 2000 (SAC)] Daniel Diaz, Philippe Codognet, TheGNU Prolog System and its Implementation, in ACM Symposium on Ap-plied computing, pp. 728–732, 1992 (A=F)

[Dietrich and Hagl, 1988] R. Dietrich and F. Hagl, A polymorphic type sys-tem with subtypes for Prolog, in 2nd European Symposium on Logic Pro-gramming, Lecture Notes in Computer Science, 300, pp. 79–93, Springer-Verlag, 1988

[Dincbas and Van Hentenryck, 1987] Mehmet Dincbas and Pascal van Hen-tenryck, Extended Unification Algorithms for the Integration of Func-tional Programming into Logic Programming, Journal of Logic Program-ming, 4(3), pp. 199–228, Sept 1987

[Dobry, 1990] T.P. Dobry, A high performance architecture for Prolog,Kluwer Academic Publishers Group, 1990

[Doorenbos, 1995] Robert B. Doorenbos, Production Matching for LargeLearning Systems, PhD. dissertation, Carnegie Mellon University, Jan1995 (A=F)

[Dotan and Arazi, 1990] Yoheved Dotan and Benjamin Arazi, ConcurrentLogic Programming as a Hardware Description Tool, IEEE Transactionson Computers, 39(1), pp. 72 –88, Jan 1990 (A=F)

[Durdanovic, 1991] Igor Durdanovic, A fast garbage collection algorithm forWAM-based PROLOG, in Proceedings of 4th Workshop on ComputerScience Logic, Lecture Notes in Computer Science, 533, pp. 110–127,Springer-Verlag, Oct 1991

[Dutra et al., 1997] Ines Dutra, Vitor Santos Costa, Fernando Silva, EnricoPontelli and Gopal Gupta (eds.), Proceedings of the Workshop on Par-allelism and Implementation Technology for (Constraint) Logic Program-ming Systems, Technical Report: DCC-97-11, University of Porto, Oct1997 (A=F)


[Eisenstadt and Bradshaw, 1988] Marc Eisenstadt and Mike Bradshaw, TheTransparent Prolog Machine (TPM): An Execution Model and GraphicalDebugger for Logic Programming, Journal of Logic Programming, 5(4),pp. 277–342, Dec 1988

[Eisenstadt et al., 1991] M. Eisenstadt, M. Brayshaw, and J. Paine, TheTransparent Prolog Machine : Visualizing Logic Programs, Kluwer Aca-demic Publishers Group, 1991

[Eliens, 1992] A. Eliens, DLP: A Language for Distributed Logic Program-ming, Wiley, 1992, http://www.cs.vu.nl/~eliens/online/dlp/

[Eliens et. al., 2002] A. Eliens, Z. Huang, and C. Visser, A Platform for Em-bodied Conversational Agents based on Distributed Logic Programming, inProc. AAMAS 2002 Workshop on Embodied Conversational Agents, 2002

[Elshiewy, 1990 (PhD)] N. A. Elshiewy, Sandra: Robust Coordinated Reac-tive Computing, PhD. dissertation, TRITA-TCS-9005, SICS/D – 91/04,Dept. of Telecoms and Computer Systems, Royal Institute of TechnologyKTH, 1990

[Elshiewy, 1990 (JLP)] Nabiel A. Elshiewy, Logic Programming for Real-Time Control of Telecommunication Switching Systems, Journal of LogicProgramming, 8(1 & 2), pp. 121–144, Jan / Mar 1990 (A=F)

[Elshiewy, 1990 (SIGOPS)] Nabiel A. Elshiewy , Concurrent logic program-ming of correct and robust coordinated reactive computations, in Proceed-ings of the 4th workshop on ACM SIGOPS European workshop, pp. 1–7,1990 (A=F)

[Englebert et al., 1992] V. Englebert, B. Le Charlier, D. Roland, and P.van Hentenryck, Generic Abstract Interpretation Algorithms for Pro-log: Two Optimization Techniques and Their Experimental Evaluation,in [Bruynooghe and Wirsing, PLILP’92], pp. 311–325, 1992 (A=C)

[Englebert et al., 1993] V. Englebert, B. Le Charlier, D. Roland, and P. vanHentenryck, Generic Abstract Interpretation Algorithms for Prolog: TwoOptimization Techniques and their Experimental Evaluation, Software —Practice and Experience, 23(4), pp. 419–459, Apr 1993


[Eriksson et al., 1992] L.-H. Eriksson, L. Hallnas and P. Schroeder-Heister(eds.), Proceedings of the Second International Workshop on Extensionsof Logic Programming, Lecture Notes in Computer Science, 596, Springer-Verlag, Jan 1992

[Eskilson, 1998] Jesper Eskilson, SICStus-MT – A Multithreaded ExecutionEnvironment for SICStus Prolog, M.Sc. Thesis, Jan 1998 (A=F)

[Eskilson and Carlsson, 1998] Jesper Eskilson and Mats Carlsson, SICStus-MT – A Multithreaded Execution Environment for SICStus Prolog, in[Palamidessi et al., 1998] (A=C)

[Etalle and Truszczynski, ICLP 2006] Sandro Etalle and MiroslawTruszczynski (eds.), Proceedings 22nd International Conference,Lecture Notes in Computer Science, 4079, Springer-Verlag, 2006

[Fecht, 1997] C. Fecht, Abstrakte Interpretation Logischer Programme: The-orie, Implementierung, Generierung, PhD. dissertation, Universitat desSaarlandes, 1997

[Feldman and Gries, 1968] Jerome Feldman and David Gries, TranslatorWriting Systems, Communications of the ACM, 11(2), pp. 77–113, Feb1968 (A=F)

[Ferreira and Damas, 1998] Michel Ferreira and Luıs Damas, Multiple Spe-cialization through Local Analysis, Technical Report DCC-98-3, Univer-sity of Porto, 1998 (A=C)

[Ferreira and Damas, 1999] Michel Ferreira and Luıs Damas, Multiple Spe-cialization of WAM Code, in [Gupta, PADL’99], pp. 243–258, 1999(A=C)

[Ferreira and Damas, 2001] Michel Ferreira and Luis Damas, WAM LocalAnalysis, Technical Report DCC-2001-8, Universidade do Porto, 2001

[Ferreira and Damas, 2003] Michel Ferreira and Luis Damas, WAM LocalAnalysis, in [Dahl and Wadler, PADL 2003], pp. 286–303

[Floyd, 1963] Robert W. Floyd, Syntactic Analysis and Operator Precedence,Journal of the Association for Computing Machinery, 10(3), pp. 316–333,July 1963 (A=F)


[Ford, 1988] Ray Ford, Concurrent Algorithms for Real-Time Memory Man-agement, IEEE Software, 5(5), pp. 10–23, Sept/Oct 1988 (A=F)

[Forgy, 1982] C.L. Forgy, RETE: A fast algorithm for the many pattern /many object pattern match problem, Artificial Intelligence, 19(1), pp. 17–38, 1982

[Foster and Winsborough, 1991] Ian Foster and Will Winsborough,Copy avoidance through compile-time analysis and local reuse, in[Saraswat and Ueda, 1991], pp. 455–469, 1991

[Fruhwirth, 1990] T.W. Fruhwirth, Polymorphic Type Checking with Sub-types in Prolog, in [Miola, 1990], pp. 121–130, 1990 (A=C)

[Fruhwirth and Abdennadher, 1997] T. W. Fruhwirth and S. Abdennadher,Constraint-Programmierung, Springer-Verlag, 1997

[Fruhwirth, 1998] Thom Fruhwirth, Theory and practice of constraint han-dling rules, Journal of Logic Programming, 37(1–3), Oct 1998

[Fruhwirth and Abdennadher, 2003] Thom Fruhwirth and Slim Abdennad-her, Essentials of Constraint Programming, Springer-Verlag, 2003

[Fukunaga and Hirose, 1986] Koichi Fukunaga and Shin-ichi Hirose, An Ex-perience with a Prolog-based Object-Oriented Language, ACM SIGPLANNotices, 21(11), pp. 224–231, Nov 1986 (A=F)

[Furukawa, 1991] Koichi Furukawa (ed.), 8th International Conference onLogic Programming, The MIT Press, June 1991

[Furukawa, 1992] Koichi Furukawa, Logic programming as the integrator ofthe Fifth Generation Computer Systems Project, Communications of theACM, 35(3), pp. 82–92, March 1992 (A=F)

[Futo, 1994] I. Futo, The Real-Time Extension of CS-Prolog Professional, inICLP ’94 Workshop, 1994

[Gabriel et al., 1985] J. Gabriel, T. Lindholm, E.L. Lusk and R.A. Over-beek, A tutorial on the Warren abstract machine for computational logic,Technical Report ANL-84-84, Argonne National Laboratory, June 1985


[Gabbrielli and Pfenning, PPDP 2000] Maurizio Gabbrielli and Frank Pfen-ning (eds.), Proceedings of the 2nd ACM SIGPLAN Conference on Prin-ciples and Practice of Declarative Programming, ACM Press New York,2000

[Gabbrielli and Gupta, ICLP 2005] Maurizio Gabbrielli and Gopal Gupta(eds.), Proceedings Logic Programming: 21st International Conference,ICLP 2005, Sitges, Spain, October 2-5, Lecture Notes in Computer Sci-ence, 3668, Springer-Verlag, 2005

[Gajos, 2001] Krzysztof Gajos, Luke Weisman and Howard Shrobe, DesignPrinciples for Resource Management Systems for Intelligent Spaces, in[Laddaga et al., 2003] , pp. 198–215 (A=F)

[Gal et al., 1991] Annie Gal, Guy Lapalme, Patrick Saint-Dizier and HaroldSomers, Prolog for Natural Language Processing, Wiley, 1991

[Garcia de la Banda et al., 1996] M. Garcia de la Banda, M. Hermenegildo,M. Bruynooghe, V. Dumortier, G. Janssens, W. Simoens, Global anal-ysis of constraint logic programs, ACM Transactions on ProgrammingLanguages and Systems, 18(5), pp. 564–614, Sept 1996 (A=F)

[Garcia de la Banda et al., 2005] Maria Garcia de la Banda, Warwick Har-vey, Kim Marriott, Peter J. Stuckey, Bart Demoen, Checking Modes ofHAL Programs, Theory and Practice of Logic Programming, 5(6), Nov2005 (A=F)

[Gazdar and Mellish, 1989] G. Gazdar, C.S. Mellish, Natural Language Pro-cessing in PROLOG: An Introduction to Computational Linguistics,Addison-Wesley, 1989

[Gee et al., 1987] Jeff Gee, Stephen W. Melvin, and Yale N. Patt, Advantagesof Implementing Prolog by Microprogramming a Host General PurposeComputer, in [Lassez, ICLP 1987], pp. 1–20, 1987

[Getzinger, 1993] Thomas W. Getzinger, Abstract Interpretation for theCompile-Time Analysis of Logic Programs, PhD. dissertation, Universityof Southern California, Dec 1993 (A=C)


[Getzinger, 1994] T.W. Getzinger, The Costs and Benefits of AbstractInterpretation-driven Prolog Optimization, in [Charlier, 1994], pp. 1–25,1994 (A=C)

[Giegerich and Graham, 1992] Robert Giegerich and Susan L. Graham(eds.), Code Generation – Concepts, Tools, Techniques, Dagstuhl ’91,Workshops in Computing, Springer-Verlag, 1992

[Giegerich and Steffen, 2006] Robert Giegerich and Peter Steffen, Challengesin the compilation of a domain specific language for dynamic program-ming, in [Haddad, SAC 2006] , pp. 1603–1609 (A=F)

[De Gloria and Faraboschi, 1992] Alessandro De Gloria and Paolo Fara-boschi, Instruction-level parallelism in Prolog: analysis and architecturalsupport, in ISCA ’92; Proceedings of the 19th annual international sympo-sium on computer architecture, ACM SIGARCH Computer ArchitectureNews, 20(2), pp. 224–233, May 1992 (A=F)

[Gong, 1998] Li Gong, Secure Java Class Loading, IEEE Internet Comput-ing, 2(6), Nov/Dec 1998

[Gooley and Wah, 1989] Markian M. Gooley and Benjamin W. Wah, Effi-cient Reordering of Prolog Programs, IEEE Transactions on Knowlegdeand Data Engineering Systems, 1(4), Dec 1989 (A=F)

[Gough, 2001] John Gough, Compiling for the .NET Common LanguageRuntime, Prentice-Hall, 2001

[Graunke et al.] Paul Graunke, Shriram Krishnamurthi, Steve Van Der Ho-even, and Matthias Felleisen, Programming the Web with High-Level Pro-gramming Languages, in Proc. European Symposium on Programming,Lecture Notes in Computer Science, 2028, Springer-Verlag, 2001

[Gregory, 1987] Steve Gregory, Parallel Logic Programming in PARLOG :The Language and its Implementation, Addison-Wesley, 1987

[Guo H.-F., 2000] Hai-Feng Guo, High Performance Logic Programming,PhD. dissertation, New Mexico State University, Oct 2000 (A=F)

[Guo H.-F. and Gupta, 2001] Hai-Feng Guo and Gopal Gupta, A SimpleScheme for Implementing Tabled Logic Programming Systems based onDynamic Reordering of Alternatives, in [Codognet, 2001]


[Guo H.-F. and Gupta, 2003] Hai-Feng Guo and Gopal Gupta, A New ModeDeclaration for Tabled Predicates, in Proceedings ICLP, 2003

[Guo H.-F. and Gupta, 2003] Hai-Feng Guo and Gopal Gupta, SimplifyingDynamic Programming via Tabling, in CICLOPS, 2003

[Guo H.-F. and Gupta, 2004] Hai-Feng Guo and Gopal Gupta, SimplifyingDynamic Programming via Tabling, in [Jayaraman, PADL 2004], pp.163–177, 2004 (A=F)

[Guo H.-F. and Pontelli, CICLOPS 2006] H-F. Guo and E. Pontelli (eds.),CICLOPS 2006: Colloquium on Implementation of Constraint LOgicProgramming Systems, Aug 2006 (A=F)

[Guo L., 2007] Li Guo, Enacting a Decentralised Workflow Management Sys-tem on a Multi-agent Platform, PhD. dissertation, 2007 (A=F)

[Gupta (A.) and Tarau, 2001] Anima Gupta and Paul Tarau, Logic Pro-gramming Techniques for Dynamic VRML Web Content Generation, in[Ramakrishnan, PADL 2001]

[Gupta (G.), 1994] G. Gupta, Multiprocessor Execution of Logic Programs,Kluwer Academic Press, 1994

[Gupta and Carlsson, 1996] Gopal Gupta and Mats Carlsson (eds.), HighPerformance Implementations of Logic Programming Systems, Special is-sue Journal of Logic Programming, 29(1–3), Nov 1996

[Gupta, PADL’99] Gopal Gupta (ed.), Proc. Practical Aspects of DeclarativeLanguages, Lecture Notes in Computer Science, 1551, Springer-Verlag,1999

[Gupta et al., 2001] Gopal Gupta, Enrico Pontelli, Khayri A.M. Ali, MatsCarlsson, Manuel V. Hermenegildo, Parallel execution of prolog programs:a survey, ACM Transactions on Programming Languages and Systems,23(4), pp. 472–602, July 2001 (A=F)

[Haddad, SAC 2006] Hisham M. Haddad, Conference Chair, Proceedings ofthe 2006 ACM Symposium on Applied computing, ACM Press, 2006


[Haemmerle and Fages, 2006] Remy Haemmerle and Francois Fages, Mod-ules for Prolog Revisited, in [Etalle and Truszczynski, ICLP 2006] , pp.41–55 (A=F)

[Hans, 1992] Werner Hans, A Complete Indexing Scheme for WAM-basedAbstract Machines, in [Bruynooghe and Wirsing, PLILP’92], pp. 232–244, 1992 (A=C)

[Hanus, CC’94] M. Hanus, Towards the Global Optimization of FunctionalLogic Programs, in Proc. 5th International Conference on Compiler Con-struction, Lecture Notes in Computer Science, 786, pp. 68–82, Springer-Verlag, 1994

[Haridi and Keller, 1989] S. Haridi and R. Keller (eds.), Third IEEE sympo-sium on logic programming, Elsevier, 1989

[Hausman, 1993] B. Hausman, Turbo Erlang approaching the speed of C, in[Tick and Succi, 1993], pp. 120–136, 1993

[Hattori et al., 1985] F. Hattori, K, Kushima, T. Wasano, A comparison ofLisp, Prolog, and Ada programming productivity in AI area, in Proceed-ings of the 8th international conference on Software engineering, pp. 285–291 (A=F)

[Haygood, 1994] Ralp Clarke Haygood, Native code compilation in SICStusProlog, in [Hentenryck, ICLP’94], pp. 190–204, 1994

[Henderson D.S. and Levy, 1976] D.S. Henderson and M.R. Levy, An ex-tended operator-precedence parsing algorithm, Computer Journal, 19(3),pp. 229–233 (A=F)

[Henglein et al., 2001] Fritz Henglein, Henning Makholm, and Henning Niss,A direct approach to control-flow sensitive region-based memory manage-ment, in [Søndergaard, PPDP 2001]

[Hentenryck et al., 1993] Pascal Van Hentenryck, Olivier Degimbe, Bau-douin Le Charlier, Laurent Michel, The Impact of Granularity in AbstractInterpretation of Prolog, in [Cousot et al., WSA’93], pp. 1–14, 1993

[Hentenryck, ICLP’94] Pascal van Hentenryck (ed.), 11th International Con-ference on Logic Programming, The MIT Press, June 1994


[Hentenryck et al., 1994] P. van Hentenryck, A. Cortesi and B. Le Charlier,Type Analysis of Prolog Using Type Graphs, in Proceedings of the ACMSIGPLAN ’94 Conference on Programming Language Design and Imple-mentation, pp. 337–348, 1994 (A=F)

[Hentenryk, PADL 2006] Pascal Hentenryck (ed.), Proc. Practical Aspectsof Declarative Languages: 8th International Symposium, PADL 2006,Charleston, SC, USA, January 9-10, 2006, Lecture Notes in ComputerScience, 3819, Springer-Verlag

[Hermenegildo et al., 1992] Manuel V. Hermenegildo, Richard Warren, andSaumya K. Debray, Global flow analysis as a practical compilation tool,Journal of Logic Programming, 13(4), pp. 349–366, Aug 1992

[Hermenegildo and Penjam, PLILP’94] M. Hermenegildo and J. Penjam(eds.), Proc. 6th Programming Languages: Implementations, Logics andPrograms, Lecture Notes in Computer Science, 844, Springer-Verlag, Sept1994

[Hermenegildo and Swierstra, PLILP’95] M. Hermenegildo and S. DoaitseSwierstra (eds.), Proc. 7th International Symposium, Programming Lan-guages: Implementations, Logics and Programs, Lecture Notes in Com-puter Science, 982, Springer-Verlag, Sept 1995

[Hermenegildo and Puebla, 2002] M. Hermenegildo, G. Puebla (eds.), Pro-ceedings 9th International Static Analysis Symposium, 2477, Springer-Verlag, 2002

[Hickey and Mudambi, 1989] Timothy Hickey and Shyam Mudambi, GlobalCompilation of Prolog, Journal of Logic Programming, 7(3), pp. 193–230,Nov 1989 (A=C+F)

[Hill and Lloyd, 1994] Patricia Hill and John Lloyd, The Godel ProgrammingLanguage, The MIT Press, 1994

[Holmer et al., 1990] Bruce K. Holmer, Barton Sano, Michael Carlton, Petervan Roy, Raplh Haygood, William R. Bush, Alvin M. Despain, JoanM. Pendleton, Tep Dobry, Fast Prolog with an extended general purposearchitecture, in Proceedings of the 17th annual international symposiumon Computer Architecture, pp. 282–291, 1990 (A=F)


[Holmer, 1993] Bruce Kester Holmer, Automatic Design of Computer In-struction Sets, PhD. dissertation, University of California, Berkeley, 1993(A=C)

[Horiuchi and Kanamori, 1987] K. Horiuchi and T. Kanamori, PolymorphicType Inference in Prolog by Abstract Interpretation, in Proc. 6th LogicProgramming Conference, Lecture Notes in Computer Science, 315, pp.195–214, Springer-Verlag, June 1987 (A=C)

[Horspool and Levy, 1987] R.N. Horspool and M.R. Levy, Correctness of anextended operator-precedence parsing algorithm, Information ProcessingLetters, 24, pp. 265–273, March 1987 (A=F)

[Horspool, 1990] N. Horspool, Mode Analysis Techniques for Discovery ofLists in Prolog, pp. 305–312, U. of Geneva, July 1990

[Hu and Rodrıguez-Artalejo, FLOPS 2002] Z. Hu and M. Rodrıguez-Artalejo (eds.), Proceedings 6th International Symposium, FLOPS 2002Aizu, Japan, Lecture Notes in Computer Science, 2441, Springer-Verlag,2002

[Huang et. al., 2004] Z. Huang, A. Eliens, and C. Visser, STEP: a Script-ing Language for Embodied Agents, in Life-like Characters, Tools, Af-fective Functions and Applications, pp. 87–109, Springer-Verlag, 2004,http://wasp.cs.vu.nl/~huang/

[Huang et. al., AAMAS 2004] Z. Huang, A. Eliens, and C. Visser, Facial Ex-pressions for Embodied Agents in STEP, in Proceedings of AAMAS 2004Workshop on Embodied Conversational Agents

[Le Huitouze, 1990] S. Le Huitouze, A New Data Structure for Implement-ing Extensions to Prolog, in [Deransart and Ma luszynski, PLILP’90], pp.136–150, 1990

[Huntbach, 1991] Matthew Huntbach, Parallel branch-and-bound search inParlog, International Journal of Parallel Programming, 20(4), pp. 299–314, Aug 1991 (A=F)

[Huntbach, 1995 (JOOP)] Matthew Huntbach, An Introduction to RGDC asa Concurrent Object-Oriented Language, Journal of Object-Oriented Pro-gramming, 8(5), pp. 29–37, 1995


[Huntbach, 1995 (SAC 1)] Matthew Huntbach, The Concurrent Object-Oriented Language Braid, in Proceedings of the 1995 ACM Symposiumon Applied Computing, pp. 140–146, 1995 (A=F)

[Huntbach, 1995 (SAC 2)] Matthew Huntbach, Search in Concurrent LogicLanguages, in Proceedings of the 1995 ACM Symposium on Applied Com-puting, pp. 164–170, 1995 (A=F)

[Huntbach and Ringwood, 1995] M. Huntbach and G. Ringwood, Program-ming in Concurrent Logic Languages, IEEE Software, 12(6), pp. 71–82,Nov 1995 (A=F)

[Huntbach and Ringwood, 1999] Matthew M. Huntbach and Graem A.Ringwood, Agent-Oriented Programming: From Prolog to Guarded Defi-nite Clauses, Lecture Notes in Computer Science, 1630, Springer-Verlag,1999 (A=F)

[Huntbach, 2000] Matthew Huntbach, The Concurrent Language Aldwych,in RULE 2000, First International Workshop on Rule-Based Program-ming, 2000 (A=F)

[Huntbach, 2002] Matthew Huntbach, Coordination using a Single-WriterMultiple-Reader Concurrent Logic Language, Research Report RR-02-03,Oct 2002 (A=F)

[Hutchins and Somers, 1992] W. John Hutchins and Harold L. Somers, AnIntroduction to Machine Translation, Academic-Press, 1992

[Ichiyoshi et al., 1987] N. Ichiyoshi, T.Miyazaki, and K. Taki, A DistributedImplementation of Flat GHC on the Multi-PSI, in [Lassez, ICLP 1987]

[Jaffar and Lassez, 1987] Joxan Jaffar and Jean-Louis Lassez, ConstraintLogic Programming, in Symposium on Principles of Programming Lan-guages, pp. 111–119, ACM Press, 1987 (A=F)

[Jaffar and Maher, 1994] Joxan Jaffar and Michael J. Maher, ConstraintLogic Programming: A Survey, Journal of Logic Programming, 19/20,pp. 503–581, May/July 1994

[Janssens et al., 1988] G. Janssens, B. Demoen, and A. Marien, Im-proving the register allocation of WAM by reordering unification, in[Kowalski and Bowen, 1988], pp. 1388–1402, 1988


[Jayaraman, PADL 2004] Bharat Jayaraman (ed.), Proc. Practical Aspectsof Declarative Languages, 6th International Symposium, Lecture Notesin Computer Science, 3057, Springer-Verlag, 2004

[Jeffrey, 2002] David Jeffrey, Expressive type systems for logic programminglanguages, PhD. dissertation, University of Melbourne, Feb 2002

[Jergova et al., 1992] A. Jergova, L. Matyska, P. Mejzlık, V. Racansky, D.Toman, and J. Zlatuska, WAM Based Efficient Implementation of LogicProgramming Languages, University of Toronto, Sept 1992

[Johansson et al., 1999 (TR-03)] Erik Johansson, Sven-Olof Nystrom,Thomas Lindgren, Christer Jonsson, Evaluation of HiPE, an ErlangNative Code Compiler, Technical Report ASTEC 99/03, Sept 1999

[Johansson et al., 1999 (TR-04)] Erik Johansson, Sven-Olof Nystrom,Mikael Pettersson, Konstantinos Sagonas, HiPE: High PerformanceErlang, Technical Report ASTEC 99/04, Oct 1999

[Johansson et al., 2000] Erik Johansson, Mikael Pettersson, KonstantinosSagonas, A High Performance Erlang System, in Proc. International Con-ference on Principles and Practice of Declarative Programming, pp. 32–43, 2000 (A=F)

[Johansson et al., 2002] Erik Johansson, Konstantinos Sagonas, Jesper Wil-helmsson, Heap Architectures for Concurrent Languages Using MessagePassing, in [Boehm and Detlefs, ISMM 2002], pp. 88–99, 2002

[Jones C.B., 1989] Christopher B. Jones , Cartographic Name Placementwith Prolog , IEEE Computer Graphics and Applications , 9(5), pp. 36–47, Sept 1989 (A=F)

[Jones R. and Lins, 1996] Richard Jones and Rafael Lins, Garbage collec-tion: algorithms for automatic dynamic memory management, Wiley,1996

[de Jong, 2004] Steven de Jong, Hybrid AI Approaches for Playing ResourceManagement Games, M.Sc. Thesis, Maastricht University, The Nether-lands, 2004 (A=F)


[de Jong et al., 2005] Steven de Jong, Pieter Spronck, and Nico Roos, Re-quirements for resource management game AI, in IJCAI-05 Workshopon Reasoning, Representation, and Learning in Computer Games, 2005(A=F)

[Kacsuk, 1991] P. Kacsuk, A Parallel Prolog Abstract Machine and its Multi-Transputer Implementation, Computer Journal, 34(1), pp. 52–63, Feb1991

[Kacsuk and Wise, 1992] P. Kacsuk and M. Wise (eds.), Implementations ofdistributed Prolog, Wiley, 1992 (A=B)

[Kahn K., 1982] Kenneth Kahn, Intermission – Actors in Prolog, in[Clark and Tarnlund, 1982] , pp. 213–228

[Kahn K. et al., 1986] Kenneth Kahn, Eric Dean Tribble, Mark S. Miller,and Daniel G. Bobrow, Objects in concurrent logic programming lan-guages, ACM SIGPLAN Notices, 21(11), pp. 242–257, Nov 1986 (A=F)

[Kahn and Saraswat, 1990] Kenneth Kahn and Vijay A. Saraswat, Actors asa special case of concurrent constraint (logic) programming, in Proceedingsof the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications, pp. 57–66,1990 (A=F)

[Kakas and Sadri, 2002] Antonis C. Kakas and Fariba Sadri (eds.), Compu-tational Logic: Logic Programming and Beyond, Part I, Lecture Notes inArtificial Intelligence, 2407, Springer-Verlag, 2002

[Kakas and Sadri, 2002b] Antonis C. Kakas and Fariba Sadri (eds.), Compu-tational Logic: Logic Programming and Beyond, Part II, Lecture Notesin Artificial Intelligence, 2408, Springer-Verlag, 2002

[Karlsson, 1992] Roland Karlsson, A High Performance OR-parallel PrologSystem, PhD. dissertation, Royal Institute of Technology, Stockholm,March 1992 (A=F)

[Karlsson, 1992] Roland Karlsson, How build your own OR-parallel PrologSystem, SICS TR 92:03, March 1992 (A=F)


[de Kergommeaux and Codognet, 1994] Jacques Chassin de Kergommeauxand Philippe Codognet, Parallel logic programming systems, ACM Com-puting Surveys, 26(3), pp. 295–336, Sept 1994

[King et al., 2006] Andy King, Lunjin Lu and Samir Genaim, Detecting De-terminacy in Prolog Programs, in [Etalle and Truszczynski, ICLP 2006], pp. 132–147 (A=F)

[Klintskog, 2005] Erik Klintskog, Generic Distribution Support for Program-ming Systems, PhD. dissertation, Royal Institute of Technology (KTH) ,June 2005 (A=F)

[Koch et al., 2006] Fernando Koch, John-Jules C. Meyer, Frank Dignum,and Iyad Rahwan, Programming Deliberative Agents for Mobile Services:The 3APL-M Platform, in [Bordini, 2005] , pp. 222-235 (A=F)

[Koehler and Horspool, 1997] B. Koehler and R.N. Horspool, CCC : Acaching Compiler for C, Software — Practice and Experience, 27(2), pp.155–165, Feb 1997

[Koster, 1984] Alexis Koster, Compiling prolog programs for parallel execu-tion on a cellular machine, in Proceedings of the 1984 annual conferenceof the ACM on The fifth generation challenge, pp. 167–178, 1984 (A=F)

[Kowalski, 1979] Robert Kowalski, Algorithm = Logic + Control, Communi-cations of the ACM, 22(7), pp. 424–436, July 1979 (A=F)

[Kowalski, 1988] R.A. Kowalski, The Early Years of Logic Programming,Communications of the ACM, 31(1), pp. 38–43, Jan 1988 (A=C)

[Kowalski and Bowen, 1988] R. Kowalski and K. Bowen (eds.), Logic Pro-gramming: Proceedings of the Fifth International Conference and Sym-posium, The MIT Press, Aug 1988

[Kowalski, 2002] Robert A. Kowalski, Directions for Logic Programming, in[Kakas and Sadri, 2002], pp. 26–32

[Krall and Neumerkel, 1990] Andreas Krall and Ulrich Neumerkel, The Vi-enna Abstract Machine, in [Deransart and Ma luszynski, PLILP’90], pp.121–135, 1990 (A=C)


[Krall and Berger, 1992] Andreas Krall and Thomas Berger, Fast Prolog witha VAM based Prolog Compiler, in [Bruynooghe and Wirsing, PLILP’92],pp. 245–259, 1992 (A=C)

[Krall, 1994] A. Krall, Implementation techniques for Prolog, in WorkshopLogische Programmierung, pp. 1–15, 1994 (A=F)

[Krueger, 1989] Per Krueger, An Extension of WAM to Execute FunctionalPrograms, Technical Report T89:16, SICS, 1989 (A=C)

[Krishnamurthi and Ramakrishnan, PADL 2002] S. Krishnamurthi andC.R. Ramakrishnan (eds.), Proceedings 4th International Symposium,PADL 2002, Lecture Notes in Computer Science, 2257, Springer-Verlag,2002

[Kuchen and Swierstra, PLILP’96] H. Kuchen and S. Doaitse Swierstra(eds.), Proceedings of the 8th International Symposium, ProgrammingLanguages: Implementations, Logics, and Programs, Lecture Notes inComputer Science, 1140, Springer-Verlag, Sept 1996

[Kumar and Lin, 1988] Vipin Kumar and Yow-Jian Lin, A Data-Dependency-Based Intelligent Backtracking Scheme for Prolog, Journalof Logic Programming, 5(2), pp. 165–182, June 1988

[Kuncak, 2007] Viktor Kuncak, Modular Data Structure Verification, PhD.dissertation, Massachusetts Institute of Technology, Feb 2007 (A=F)

[Laddaga et al., 2003] Robert Laddaga, Paul Robertson, Howie Shrobe(eds.), Self-Addaptive Software: Applications, Second InternationalWork-shop, IWSAS 2001, Lecture Notes in Computer Science, 2614, Springer-Verlag, 2003

[LaLonde and Rivieres, 1981] Wilf R. LaLonde and Jim des Rivieres, Han-dling Operator Precedence in Arithmetic Expressions with Tree Transfor-mations, 3(1), pp. 83–103, Jan 1981 (A=F)

[Lassez, ICLP 1987] Jean-Louis Lassez (ed.), Logic Programming, Proceed-ings of the Fourth International Conference, The MIT Press, 1987

[Levi and Martelli, ICLP 1989] G. Levi and M. Martelli (eds.), Proc. of theSixth International Conference on Logic Programming, The MIT Press,June 1989


[Levy, 1975] M.R. Levy, Complete operator precedence, Information Process-ing Letters, 4(2), pp. 38–40, Nov 1975 (A=F)

[Li, 2000] Xining Li, Efficient memory management in a merged heap/stackProlog machine, in [Gabbrielli and Pfenning, PPDP 2000], pp. 245–256,2000 (A=F)

[Li, 2001] Xining Li, IMAGO: A Prolog-based System for Intelligent MobileAgents, in [Pierre and Glitho, 2001]

[Liang, 2000] Chuck Liang, A Deterministic Shift-Reduce Parser Generatorfor a Logic Programming Language, in [Lloyd et al., CL 2000] , 2000

[Lidin, 2002] Serge Lidin, Inside Microsoft .NET IL Assembler, MicrosoftPress, 2002

[Lin and Hunt, 1989] F. Lin and F.E. Hunt, LCD-reification: a formalmethod for developing Prolog programs, in Proceedings of the 5th interna-tional workshop on Software specification and design, pp. 249–256, 1989(A=F)

[Lindgren et al., 1995] Thomas Lindgren, Per Mildner, and Johan Bevemyr,On Taylor’s Scheme for Unbound Variables, Technical Report 116, Upp-sala University, Oct 1995 (A=C)

[Lindgren, 1996 (PHD)] Thomas Lindgren, Compilation Techniques for Pro-log, PhD. dissertation, Uppsala University, 1996 (A=C)

[Lindgren, 1996 (TR)] Thomas Lindgren, The Impact of Structure Analysison Prolog Compilation, Technical Report 142, Uppsala University, May1996 (A=F)

[Lindgren and Mildner, 1997] Thomas Lindgren and Per Mildner, The Pre-cision of a Simple Structure Analyzer, Technical Report 140, UppsalaUniversity, April 1997 (A=F)

[Lindholm and O’Keefe, 1987] Timothy G. Lindholm and Richard A.O’Keefe, Efficient Implementation of a Defensible Semantics for DynamicProlog Code, in [Lassez, ICLP 1987], pp. 21–39 (A=C)


[Lloyd et al., CL 2000] J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau,C. Palamidessi, L.M. Pereira, Y. Sagiv, and P.J. Stuckey (eds.), Pro-ceedings of the First International Conference on Computational Logic,Lecture Notes in Artificial Intelligence, 1861, Springer-Verlag, 2000

[Loke, 1998] Seng Wai Loke, Adding Logic Programming Behaviour to theWorld Wide Web, PhD. dissertation, University of Melbourne, 1998(A=C)

[Loke and Davison, 1998] Seng Wai Loke and Andrew Davison, LogicWeb:Enhancing the Web with logic programming, Journal of Logic Program-ming, 36(3), pp. 195–240, Sept 1998

[Loke and Davison, 2001] S.W. Loke and A. Davison, Secure Prolog BasedMobile Code, Theory and Practice of Logic Programming, 1(1), 2001

[Lopes and Santos Costa, 1996] R. Lopes and V. Santos Costa, The YAIL:An Intermediate Language for the Native Compilation of Prolog Pro-grams, in Fourth Compulog Net Workshop on Parallelism and Implemen-tation Technologies for (Constraint) Logic Languages, Sept 1996 (A=C)

[Lopes and Santos Costa, 2000] Ricardo Lopes and Vitor Santos Costa,Memory Management for the BEAM, in [Demoen, MM 2000]

[Lopes, 2002] Ricardo Lopes, Luıs fernando Castro, and Vıtor SDantosCosta, From Simulation to Practice: Cache Performance Study of a Pro-log System, in Proc. MSP 2002, Workshop on Memory System Perfor-mance, pp. 56–64, 2002 (A=F)

[Lu, 1994] Lunjin Lu, Abstract Interpretation, Bug Detection and Bug Diag-nosis in Normal Logic Programs, PhD. dissertation, University of Birm-ingham, Sept 1994 (A=C)

[Lu, 1998] Lunjin Lu, Polymorphic type analysis in logic programs by abstractinterpretation, Journal of Logic Programming, 36(1), pp. 1–54, July 1998

[Lu, 2000] Lunjin Lu, A precise type analysis of logic programs, in[Gabbrielli and Pfenning, PPDP 2000], pp. 214–225

[Lusk and Overbeek, 1989] E.L. Lusk and R.A. Overbeek (eds.), Proceed-ings of the North American Conference on Logic Programming, The MITPress, Oct 1989


[Maier and Warren, 1988] D. Maier and D.S. Warren, Computing with logic,The Benjamin/Cummings publishing company, 1988

[Makholm, 2000 (MSc)] Henning Makholm, Region-Based Memory Manage-ment in Prolog, M.Sc. Thesis, University of Copenhagen, Feb 2000 (A=C)

[Makholm, 2000] Henning Makholm, A Region-based Memory Manager forProlog, in [Demoen, MM 2000]

[Makholm, 2000 (ISMM)] Henning Makholm, A Region-based Memory Man-ager for Prolog, in [Chambers and Hoskin, ISMM 2000], pp. 25–34

[Makholm and Sagonas, 2002] Henning Makholm and Konstanti-nos Sagonas, On Enabling the WAM with Region Support, in[Stuckey, ICLP 2002], 2002

[Ma luszynski and Wirsing, PLILP’91] J. Ma luszynski and M. Wirsing(eds.), International Workshop, Programming Languages Implementa-tion and Logic Programming, Lecture Notes in Computer Science, 528,Springer-Verlag, 1991

[Marien and Demoen, 1989] Andre Marien and Bart Demoen, On the man-agement of Choicepoint and Environment Frames in the WAM, in[Lusk and Overbeek, 1989] , pp. 1030–1047, 1989

[Marien and Demoen, 1989] A. Marien and B. Demoen, On the managementof E and B in WAM, in Proc. North American Conference on Logic Pro-gramming, pp. 1030–1047, 1989

[Marien and Demoen, 1991] A. Marien and B. Demoen, A new scheme forunification in WAM, in International Symposium on Logic Programming,pp. 257–271, 1991

[Marriott and Søndergaard, 1992] Kim Marriott and Harald Søndergaard,Bottom-Up Dataflow Analysis of Normal Logic Programs, Journal ofLogic Programming, 13(2 & 3), pp. 181–204, July 1992

[Marriott and Stuckey, 1993] Kim Marriott and Peter J. Stuckey, The 3 R’sof optimizing constraint logic programs: refinement, removal and reorder-ing, in Symposium on Principles of Programming Languages, pp. 334–344,ACM Press, 1993 (A=F)


[Marriott and Stuckey, 1998] Kim Marriott and Peter J. Stuckey, Program-ming with constraints: an introduction, The MIT Press, 1998, See also[Apt, 1999] (A=B)

[Martelli and Montanari, 1982] Alberto Martelli and Ugo Montanari, An Ef-ficient Unification Algorithm, ACM Transactions on Programming Lan-guages and Systems, 4(2), pp. 258–282, 1982

[Martin, 1968] David F. Martin, Boolean matrix methods for the detection ofsimple precedence grammars, Communications of the ACM, 11(10), pp.685 - 687, Oct 1968 (A=F)

[Martin, 1972] David F. Martin, A Boolean matrix method for the computa-tion of linear precedence functions, Communications of the ACM, 15(6),pp. 448–454, 1972 (A=F)

[Matthews C., 1998] Clive Matthews, An introduction to Natural LanguageProcessing through Prolog, Longman, 1998

[Matthews D.C.J. and Le Sergent, 1995] David C. J. Matthews and ThierryLe Sergent, LEMMA: A distributed shared memory with global and localgarbage collection, in [Baker H.G., IWMM 1995] , pp. 297–311 (A=F)

[Matyska et al., 1991] L. Matyska, A. Jergova, and D. Toman, The RegisterAllocation in WAM, in [Furukawa, 1991], pp. 142–156, 1991

[Matyska et al., 1991(b)] L. Matyska, A. Jergova, and D. Toman, The Regis-ter Allocation in WAM, Report Masaryk University, Czechoslovakia, 1991(A=C)

[McCabe, 1992] F.G. McCabe, Logic and objects, Prentice-Hall, 1992

[McDermott, 1980] Drew McDermott, The prolog phenomenon, ACMSIGART Bulletin, pp. 16–20, 1980 (A=F)

[McKeever, 1993] S. McKeever, A Framework for generating compilers fromnatural semantics specifications, TR-10-93, NTU Athens, Greece, Oct1993

[Meehan and Joy, 1999] G. Meehan and M. Joy, Compiling Lazy FunctionalPrograms to Java Bytecode, Software — Practice and Experience, 29(7),pp. 617–645, 1999 (A=C)


[Meier, 1989] Micha Meier, Compilation of Compound Terms in Prolog, in[Lusk and Overbeek, 1989], pp. 63–79, 1989

[Meier, 1995 (TR9)] Micha Meier, Event Handling in Prolog, Technical Re-port ECRC-95-09, ECRC, 1995 (A=F)

[Meier, 1995 (TR11)] Micha Meier, Shallow Backtracking in Prolog Pro-grams, Technical Report ECRC-95-11, 1995 (A=F)

[Meier, 1995 (TR12)] Micha Meier, Compilation of Compound Terms in Pro-log, Technical Report ECRC-95-12, 1995 (A=F)

[Mellish, 1982] C.S. Mellish, An lternative to Structure Sharing in the Im-plementation of a Prolog Interpreter, in [Clark and Tarnlund, 1982] , pp.99–106

[Mellish, 1985] C.S. Mellish, Some global optimizations for a Prolog compiler,Journal of Logic Programming, 2(1), pp. 43–66, April 1985

[Mellish, 1986] C.S. Mellish, Abstract Interpretation of Prolog Programs, in[Shapiro, ICLP’86], pp. 463–474, 1986 (A=C)

[Mellish, 1987] C.S. Mellish, Abstract Interpretation of Prolog Programs, in[Abramsky and Hankin, 1987], pp. 181–198, 1987

[Mello et al., 1989] P. Mello, A. Natali, and C. Ruggieri, Logic Programmingin a Software Engineering Perspective, in [Lusk and Overbeek, 1989],1989

[Meyer, 1996] Gregor Meyer, On the Use of Types in Logic Programming,Technical Report 199, FU-Hagen, June 1996 (A=C)

[Meyer, 1996] Gregor Meyer, Type Checking and Type Inferencing for LogicPrograms with Subtypes and Parametric Polymorphism, Technical Report200, FU-Hagen, June 1996 (A=C)

[Meyer, 1999] Gregor Meyer, On Types and Type Consistency in Logic Pro-gramming, PhD. dissertation, FernUniversitat Hagen, 1999

[Mildner, 1999] P. Mildner, Type Domains for Abstract Interpretation: ACritical Study, PhD. dissertation, Uppsala University, May 1999 (A=C)


[Millroth, 1990] Hakan Millroth, Reforming Compilation of Logic Programs,PhD. dissertation, University of Uppsala, Oct 1990

[Mills, 1989] J.W. Mills, A High-Performance Low RISC Machine for LogicProgramming, Journal of Logic Programming, 1/2(6), pp. 179–212, 1989

[Mills, 1990] J.W. Mills (ed.), NACLP’90 Post-Conf. Workshop on LogicProgramming Architectures and Implementations, 1990

[Miola, 1990] A. Miola (ed.), Design and Implementation of Symbolic Com-putation Systems, in Proc. of the International Symposium DISCO’90,Lecture Notes in Computer Science, 429, Springer-Verlag, 1990

[Miranker and Lofaso, 1991] D.P. Miranker and B.J. Lofaso, The organiza-tion and performance of a TREAT-Based production system compiler,IEEE Transactions on Knowlegde and Data Engineering Systems, 3(1),pp. 3–10, March 1991

[Mishra, 1984] P. Mishra, Towards a Theory of Types in Prolog, in Proc.1984 IEEE Symp. on Logic Programming, pp. 289–298, 1984

[Montelatici et al., 2004] Raphael Montelatici, Emmanuel Chailloux, andBruno Pagano, Objective Caml on .NET: The OCamIL Compiler andToplevel, PPS Technical Report 29, April 2004 (A=F)

[Morales et al., 2005] Jose F. Morales, Manuel Carro, German Puebla,and Manuel Hermenegildo, A Generator of Efficient Abstract Ma-chine Implementations and Its Application to Emulator Minimization,in [Gabbrielli and Gupta, ICLP 2005] (A=F)

[Morrisett, 1998] Greg Morrisett, Proofs, Types, and Safe Mobile Code, 1998

[Morrisett and Aiken, POPL 2003] Greg Morrisett and Alex Aiken (eds.),Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Princi-ples of programming languages, ACM Press, 2003

[Moss, 1994] C. Moss, Prolog++ : The power of object-oriented and logicprogramming, Addison-Wesley, 1994

[Mulder and Tick, 1987] Hans Mulder and Evan Tick, A PerformanceComparison between the PLM and an M68020 Prolog Processor, in[Lassez, ICLP 1987], pp. 59–73 (A=C)


[Mulkers et al., 1990] A. Mulkers, W. Winsborough, and M. Bruynooghe,Analysis of Shared Data Structures for Compile-Time Garbage Collectionin Logic Programs, in ICLP ’90, The MIT Press, 1990

[Mulkers, 1993] Anne Mulkers, Live Data Structures in Logic Programs, Lec-ture Notes in Computer Science, 675, Springer-Verlag, 1993

[Muthukumar and Hermenegildo, 1992] K. Muthukumar and M.Hermenegildo, Compile-Time Derivation of Variable DependencyUsing Abstract Interpretation, Journal of Logic Programming, 13(2 &3), pp. 315–347, 1992

[Mycroft and O’Keefe, 1984] Alan Mycroft and Richard A. O’Keefe, A Poly-morphic Type System for Prolog, Artificial Intelligence, 23(3), pp. 295–307, 1984 (A=F)

[Mycroft, 1995] A. Mycroft (ed.), Proc. 2nd International Symposium, SAS’95, Static Analysis, Glasgow, UK, Lecture Notes in Computer Science,983, Springer-Verlag, Sept 1995

[Nadathur, PPDP 1999] Gopalan Nadathur (ed.), Proceedings InternationalConference Principles and Practice of Declarative Programming, LectureNotes in Computer Science, 1702, Springer-Verlag, 1999

[Nassen et al., 2001] Henrik Nassen, Mats Carlsson, Konstantinos Sagonas,Instruction Merging and Specialization in the SICStus Prolog VirtualMachine, in ACM-SIGPLAN Conference on Principles and Practice ofDeclarative Programming (PPDP 2001) (A=F)

[Nassen, 2001 (TR)] Henrik Nassen, Optimizing the SICStus Prolog VirtualMachine Instruction Set, SICS Technical Report, Mar 2001 (A=F)

[Nilsen, 1995] Kelvin Nilsen, Progress in Hardware-Assisted Real-TimeGarbage Collection, in [Baker H.G., IWMM 1995] , pp. 355-379 (A=F)

[Nilsson, 1992] Ulf Nilsson, Abstract Interpretation and Abstract Machines:Contribution to a Methodology for the Implementation of Logic Programs,PhD. dissertation, Linkoping University, 1992

[Nordlander, 1999] Johan Nordlander, Reactive Objects and Functional Pro-gramming, PhD. dissertation, Chalmers University of Technology, May1999 (A=C)


[O’Keefe, 1985] R.A. O’Keefe, On the treatment of cuts in Prolog source-levelcode, in IEEE Symposium on logic programming, pp. 68–72, 1985

[O’Keefe, 1990] R.A. O’Keefe, The Craft of Prolog, The MIT Press, 1990

[Older and Rummell, 1992] William J. Older and John A. Rummell, An In-cremental Garbage Collector for WAM-Based Prolog, Bell-Northern Re-search CRL Technical Report, 1992

[Older and Rummell, 1992] William J. Older and John A. Rummell, An In-cremental Garbage Collector for WAM-Based Prolog, in [Apt, 1992], pp.369–383, 1992

[OMG, 1999] Object Management Group, CORBA 2.3.1 Specification, TheCommon Object Request Broker: Architecture and Specification, Oct 1999

[Overton, 2003] David Overton, Precise and Expressive Mode Systems forTyped Logic Programming Languages, Department of Computer Scienceand Software Engineering, University of Melbourne, Dec 2003 (A=F)

[Paakki, 1991] J. Paakki, Prolog in Practical Compiler Writing, The Com-puter Journal, 34(1), pp. 64–72, 1991

[Palamidessi et al., 1998] C. Palamidessi, H. Glaser, K. Meinke (eds.), Prin-ciples of Declarative Programming, Lecture Notes in Computer Science,1490, Springer-Verlag, 1998

[Partington, 1997] Vincent Partington, Implementation of an ImperativeProgramming Language with Backtracking, University of Amsterdam,July 1997 (A=C)

[Pell, 1993] Barney Pell, Logic Programming for General Game-Playing, inProceedings of the workshop on Knowledge Compilation and SpeedupLearning, 1993 (A=F)

[Pelov and Bruynooghe, 2000] Nikolay Pelov and Maurice Bruynooghe, Ex-tending constraint logic programming with open functions, in Proceedingsof the 2nd ACM SIGPLAN International Conference on Principles andPractice of Declarative Programming, pp. 235–244, 2000 (A=F)


[Pereira and Warren, 1980] F.C.N. Pereira and D.H.D. Warren, Definiteclause grammars for language analysis – a survey of the formalism anda comparison with augmented transition networks, Artificial Intelligence,13, pp. 231–278, 1980

[Pereira and Porto, 1982] Luis Moniz Pereira and Antonio Porto, SelectiveBacktracking, in [Clark and Tarnlund, 1982] , pp. 107–114

[Pereira and Shieber, 1987] Fernando C.N. Pereira and Stuart M. Shieber,Prolog and Natural Language Analysis, CSLI Publications, 1987

[Pereira and Shieber, 2002] Fernando C.N. Pereira and Stuart M. Shieber,Prolog and Natural Language Analysis, Millenial reissue, 2002

[Pettersson, 1990] M. Pettersson, Generating efficient code from continua-tion semantics, in Compiler Compilers – Third International Conference,Lecture Notes in Computer Science, 477, pp. 165–178, Springer-Verlag,1990

[Pettersson and Fritzson, 1992] M. Pettersson and P. Fritzson, DML – AMeta-language compiler and system for the generation of practical andefficient compilers from denotational specifications, in Proceedings of the4th International Conference on Computer Languages, pp. 127–136, 1992

[Pettersson, 1995] M. Pettersson, Compiling Natural Semantics, PhD. dis-sertation, Linkoping University, Dec 1995 (A=C)

[Pettersson, 1997] M. Pettersson, The definition of RML, Report 1997-04-08,Linkoping University, 1997 (A=C)

[Pettersson, 1999] Mikael Pettersson, Compiling Natural Semantics, LectureNotes in Computer Science, 1549, Springer-Verlag, 1999

[Peyton Jones, 1987] S.L. Peyton Jones, The Implementation of FunctionalProgramming Languages, Prentice-Hall, 1987

[Peyton Jones and Jones, ISMM 1998] Simon Peyton Jones and RichardJones (eds.), Proceedings of the first international symposium on Memorymanagement, ACM Press, 1998


[Peyton Jones and Lester, 2000] Simon L. Peyton Jones and David R.Lester, Implementing Functional Languages: a tutorial, Technical Re-port, University of Glasgow, March 2000 (A=C)

[Pfenning and Kirchner, PPDP 2002] Frank Pfenning and Claude Kirchner(eds.), Proceedings of the Fourth ACM SIGPLAN Conference on Prin-ciples and Practice of Declarative Programming, ACM Press New York,NY, USA, 2002

[Pierre and Glitho, 2001] S. Pierre and R. Glitho (eds.), Mobile Agents forTelecommunication Applications (MATA’01), Lecture Notes in ComputerScience, 2164, Springer-Verlag, 2001

[Pique, 1992] J.F. Pique, Dynamic revision of choice points during garbagecollection in Prolog [II/III], in [Bekkers and Cohen, IWMM 1992], pp.330–343, 1992 (A=C)

[Pittomvils et al., 1985] Edwin Pittomvils, Maurice Bruynooghe and YvesD. Willems, Towards a Real-Time Garbage Collector for Prolog, in[SLP, 1985], pp. 185–198, 1985

[Plainfosse and Shapiro, 1995] David Plainfosse and Marc Shapiro, A surveyof distributed garbage collection techniques, in [Baker H.G., IWMM 1995], pp. 211–249 (A=F)

[Plasmeijer and Eekelen, 1993] Rinus Plasmeijer and Marko van Eekelen,Functional Programming and Parallel Graph Rewriting, Addison-Wesley,1993

[Podelski, CP 1994] Andreas Podelski, Selected Papers from Constraint Pro-gramming: Basics and Trends, Lecture Notes in Computer Science, 910,Springer-Verlag, May 1994

[Ponsen, 2004] Marc Ponsen, Improving Adaptive Game AI with Evolution-ary Learning, M.Sc. Thesis, Delft University of Technology, 2004 (A=F)

[Ponsen et al., 2005] Marc J.V. Ponsen, Stephen Lee-Urban, Hector Munoz-Avila, David W. Aha, and Matthew Molineaux, Stratagus: An open-source game engine for research in real-time strategy games, in IJCAI2005 Workshop on Reasoning, Representation, and Learning in ComputerGames, 2005 (A=F)


[Ponsen et al., 2006] Marc Ponsen, Hector Munoz-Avila, Pieter Spronck,and David W. Aha, Automatically Generating Game Tactics with Evolu-tionary Learning, AI Magazine, 27(3), pp. 75–84, 2006 (A=F)

[Ponsen et al., 2007] Marc Ponsen, Pieter Spronck, Hector Munoz-Avila,and David W. Aha, Knowledge Acquisition for Adaptive Game AI, 2007

[Pontelli, 1997] Enrico Pontelli and Gopal Gupta, W-ACE: A Logic Lan-guage for Intelligent Internet Programming, New Mexico State Univer-sity, May 1997 (A=C)

[Pontelli and Santos Costa, 1999] E. Pontelli and V. Santos Costa (eds.), Im-plementation of Logic and Constraint Languages, Special issue Journal ofFunctional and Logic Programming, 1999

[Pontelli and Santos Costa, PADL 2000] E. Pontelli and V. Santos Costa(eds.), Proc. Practical Aspects of Declarative Languages, Lecture Notesin Computer Science, 1753, Springer-Verlag, 2000

[Porto, 2002] Antonio Porto, Structural Abstraction and Application in LogicProgramming, in [Hu and Rodrıguez-Artalejo, FLOPS 2002], pp. 275–289

[Porto, 2003] Antonio Porto, An Integrated Information System Powered byProlog, in [Dahl and Wadler, PADL 2003], pp. 92–109

[Post et al., 1993] Kjell Post, Allen van Gelder, and James Kerr, Determin-istic Parsing of Languages with Dynamic Operators, Report UCSC-CRL-93-15, University of California, Santa Cruz, July 1993

[Post, 1994] Kjell Post, Analysis and Transformation of Logic Programs,PhD. dissertation, University of California, Santa Cruz, Dec 1994

[Puget, 2004] Jean-Francois Puget, Constraint Programming Next Chal-lenge: Simplicity of Use, in [Wallace, CP 2004] (A=F)

[Ramakrishna, 1997] Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakr-ishnan, Scott A. Smolka, Terrance Swift, and David S. Warren, EfficientModel Checking Using Tabled Resolution, in Proceedings Computer AidedVerification (CAV), 1997 (A=F)


[Ramakrishnan, 2000] I.V. Ramakrishnan, Current Trendsin Logic Programming: Prospects and Promises, in[Pontelli and Santos Costa, PADL 2000]

[Ramakrishnan, PADL 2001] I.V. Ramakrishnan (ed.), Proceedings ThirdInternational Symposium, Practical Aspects of Declarative Languages,PADL 2001, Lecture Notes in Computer Science, 1990, Springer-Verlag,2001

[Ramkumar and Kale, 1990] B. Ramkumar and L.V. Kale, A Chare kernelimplementation of a parallel Prolog compiler, in Proceedings of the secondACM SIGPLAN symposium on Principles & practice of parallel program-ming, pp. 99–108, 1990 (A=F)

[Ringwood, 1988] G.A. Ringwood, Parlog86 and the dining logicians, Com-munications of the ACM, 31(1), pp. 10–25, Jan 1988

[Robinson, 1963] J.A. Robinson, Theorem-Proving on the Computer, Journalof the Association for Computing Machinery, 10(2), pp. 163–174, April1963 (A=F)

[Robinson, 1965] J.A. Robinson, A Machine-Oriented Logic Based on theResolution Principle, Journal of the Association for Computing Machin-ery, 12(1), pp. 23–41, Jan 1965 (A=F)

[Robinson, 1983] J.A. Robinson, Logic Programming – Past, Present andFuture, New Generation Computing, 1(2), pp. 107–124, 1983

[Robinson, 1992] J. A. Robinson, Logic and logic programming, Communi-cations of the ACM, 35(3), pp. 40–65, Mar 1992

[Robinson, 2000] John Alan Robinson, Computational Logic: Memories ofthe Past and Challenges for the Future, in [Lloyd et al., CL 2000] , 2000

[Rocha, 2001] Ricardo Rocha, On Applying Or-Parallelism and Tabling toLogic Programs, PhD. dissertation, University of Porto, Nov 2001 (A=F)

[Rocha et al., 2002] Ricardo Rocha, Fernando Silva, and Vıtor Santos Costa,Achieving Scalability in Parallel Tabled Logic Programs, in Proceedings16th International Parallel and Distributed Processing Symposium, April2002 (A=F)


[Rocha et el., 2005] Ricardo Rocha, Ricardo Lopes, Fernando Silva, andVıtor Santos Costa, IMPACT: Innovative Models for Prolog withAdvanced Control and Tabling, in [Gabbrielli and Gupta, ICLP 2005](A=F)

[Rocha, 2006] Ricardo Rocha, Handling Incomplete and Complete Tables inTabled Logic Programs, in [Etalle and Truszczynski, ICLP 2006] , pp.427–428 (A=F)

[Ross, 1989] Peter Ross, Advanced Prolog: Techniques and Examples,Addison-Wesley, 1989

[Roy, 1984] Peter L. van Roy, A Prolog Compiler for the PLM, TechnicalReportCSD-84-203, University of California, Berkeley, 1984

[Roy et al., 1987] P. van Roy, B. Demoen and Y.D. Willems, Improving theExecution Speed of Compiled Prolog with Modes, Clause Selection, andDeterminism, in International Conference on the Theory and Practiceof Software Development, Lecture Notes in Computer Science, 250, pp.111–125, Springer-Verlag, 1987

[Roy, 1989] P. van Roy, A useful extension to Prolog’s definite clause gram-mar notation, ACM SIGPLAN Notices, 24(11), pp. 132–134, Nov 1989

[Roy, 1990] Peter van Roy, Can Logic Programming Execute as Fast asImperative Programming?, PhD. dissertation, University of California,Berkeley, Nov 1990 (A=C)

[Roy and Despain, 1992] P. van Roy and A.M. Despain, High-PerformanceLogic Programming with the Aquarius Prolog Compiler, Computer, 25(1),pp. 54–68, Jan 1992 (A=C/F)

[Roy, 1993] Peter van Roy, 1983 — 1993: The Wonder Years of SequentialProlog Implementation, Report 36, DEC PRL, Dec 1993 (A=C/F)

[Roy, 1994] P. van Roy, 1983 — 1993: The Wonder Years of SequentialProlog Implementation, Journal of Logic Programming, 19 & 20, pp. 385–441, May/July 1994

[Roy et al., 1997] Peter van Roy, Seif Haridi, Per Brand, Gert Smolka,Michael Mehl, and Ralf Scheidhauer, Mobile objects in distributed Oz,


ACM Transactions on Programming Languages and Systems, 19(5), pp.804–851, Sept 1997

[Roy, 1999] Peter van Roy, Logic Programming in Oz with Mozart, in Proc.ICLP, pp. 38–51

[Roy and Haridi, 2002] Peter van Roy and Seif Haridi, Concepts, Techniques,and Models of Computer Programming, Draft, 2002

[Roy and Haridi, 2004] Peter van Roy and Seif Haridi, Concepts, Techniques,and Models of Computer Programming, The MIT Press, 2004

[Ruckhaus et al., 2006] Edna Ruckhaus, Maria-Esther Vidal and EduardoRuiz, Query Evaluation and Optimization in the Semantic Web, in CEURProc. Workshop Applications of Logic Programming in the Semantic Weband Semantic Web Services, 2006

[Rueher, 1993] M. Rueher, A First Exploration of Prolog III’s Capabilities,Software — Practice and Experience, 23(2), pp. 177–200, Feb 1993

[Sagonas et al., 1994] Konstantinos Sagonas, Terrance Swift, and DavidScott Warren, XSB as an Efficient Deductive Database Engine, in Pro-ceedings of the 1994 ACM SIGMOD Conference, pp. 442–453, 1994

[Sagonas, 1996] Konstantinos Sagonas, The SLG-WAM: A Search EfficientEngine for Well-Founded Evaluation of Normal Logic Programs, PhD.dissertation, SUNY Stony Brook, Aug 1996

[Sahlin, 1987] Dan Sahlin, Making Garbage Collection Independent of theAmount of Garbage, Research Report R87008, SICS, 1987 (A=C)

[Sahlin and Carlsson, 1991] Dan Sahlin and Mats Carlsson, Variable Shunt-ing for the WAM, SICS Research Report 91:07, March 1991 (A=C)

[Sahlin, 1991] Dan Sahlin, Determinacy analysis for full Prolog, in PEPM’91; Proceedings of the symposium on Partial evaluation and semantics-based program manipulation, ACM SIGPLAN Notices, 26(9), pp. 23–30,Sept 1991 (A=F)

[Sahlin, 1991] Dan Sahlin, An Automatic Partial Evaluator for Full Prolog,PhD. dissertation, SICS, March 1991


[Sahlin, 1991] Dan Sahlin, Introduction to partial evaluation for Prolog, SICSReport, Dec 1991

[Salcianu, 2006] Alexandru D. Salcianu, Pointer Analysis for Java Programs:Novel Techniques and Applications, PhD. dissertation, Massachusetts In-stitute of Technology, Sept 2006 (A=F)

[Santane-Toth and Szeredi, 1982] E. Santane-Toth and P. Szeredi, PrologApplications in Hungary, in [Clark and Tarnlund, 1982] , pp. 19–31

[Santos Costa, 1999] Vıtor Santos Costa, Optimising Bytecode Emulation forProlog, in [Nadathur, PPDP 1999], pp. 261–277

[Saraswat and Ueda, 1991] V. Saraswat and K. Ueda (eds.), Symposium onLogic Programming, The MIT Press, Oct 1991

[Sato et al., 1987] M. Sato, H. Shimizu, A. Matsumoto, K. Rokusawa,KL1 Execution Model for PIM Cluster with Shared Memory, in[Lassez, ICLP 1987] , pp. 338–355

[Savor and Dasiewicz, 1993] Tony Savor and Paul Dasiewicz, A Real-TimeExtension to Logic Programming Based on the Concurrent ConstraintLogic Programming Paradigm, in Principles and Practice of ConstraintProgramming, pp. 269–277, 1993 (A=F)

[Schachte, 1997] P. Schachte, Global Variables in Logic Programming, inProc. ICLP ’97, pp. 3-17, 1997

[Schimpf, 1990] Joachim Schimpf, Garbage collection for Prolog based ontwin cells, in Proceedings 2nd NACLP Workshop on Logic ProgrammingArchitectures and Implementations, 1992 (A=F)

[Schleiermacher and Winkler, 1990] A. Schleiermacher and J.F.H. Winkler,The Implementation of ProTest: a Prolog Debugger for a Refined BoxModel, Software — Practice and Experience, 20(10), pp. 985–1006, Oct1990

[Schmidt and Belli, 1990] A. Schmidt and F. Belli, An extension of PRO-LOG for object-oriented programming in logic, in Proceedings of the thirdinternational conference on Industrial and engineering applications of ar-tificial intelligence and expert systems, pp. 1153–1161, 1990 (A=F)


[Schmidt, 1999] David A. Schmidt, A Return to Elegance: The Reapplicationof Declarative Notation to Software Design, in [Gupta, PADL’99], pp.360–364, 1999

[Schnupp and Leibrandt, 1984] P. Schnupp and U. Leibrandt, PROLOG asa Basis for Software Engineering Environments, in Software — Practiceand Experience, Proceedings of the 2nd Software Engineering Conference,pp. 118-123, June 1984

[Schreye et al., 2000] Danny De Schreye, Maurice Bruynooghe, Bart De-moen, Marc Denecker, Gerda Janssens and Bern Martens, Project reporton LP+: a second generation logic programming language, AI Communi-cations, 13(1), pp. 13–18, 2000

[Schrijvers and Demoen, 2002] Tom Schrijvers and Bart Demoen, Com-bining an improvement to PARMA trailing with trailing analysis, in[Pfenning and Kirchner, PPDP 2002], pp. 88-98

[Schrijvers and Demoen, 2004] Tom Schrijvers and Bart Demoen, The K.U.Leuven CHR System: Implementation and Application, in First Work-shop on Constraint Handling Rules, 2004 (A=F)

[Schrijvers et al., 2006 TR 449] T. Schrijvers, N. Zhou, and B. Demoen, Acompilation schema from Constraint Handling Rules into Action Rules,Research Report CW 449 , Leuven University , June 2006 (A=F)

[Sergot, 1982] Marek Sergot, Prospects for Representing the Law as LogicPrograms, in [Clark and Tarnlund, 1982] , pp. 33–42

[Serpette and Serrano, 2002] Bernard Paul Serpette and Manuel Serrano,Compiling scheme to JVM bytecode: a performance study, in Proceedingsof the seventh ACM SIGPLAN international conference on Functionalprogramming, Pittsburgh, PA, USA, pp. 259–270, 2002

[Shaalan, 1995] Khaled Fouad Sayed Shaalan, Software Development Envi-ronment Based on Object-Oriented and Logic Programming Paradigms,PhD. dissertation, Cairo University, 1995 (A=F)

[Shapiro, ICLP’86] E. Shapiro (ed.), Third International Conference onLogic Programming, Lecture Notes in Computer Science, 225, Springer-Verlag, July 1986


[Shapiro, 1987 (Vol.1)] Ehud Shapiro (ed.), Concurrent Prolog, CollectedPapers, Volume 1, The MIT Press, 1987

[Shapiro, 1987 (Vol.2)] Ehud Shapiro (ed.), Concurrent Prolog, CollectedPapers, Volume 2, The MIT Press, 1987

[Shapiro, 1989] Ehud Shapiro, The Family of Concurrent Logic Program-ming Languages, ACM Computing Surveys, 21(3), pp. 413–510, Sept1989 (A=F)

[Singhal and Zyda, 1999] Sandeep Singhal and Michael Zyda, NetworkedVirtual Environments: Design and Implementation, Addison-Wesley,1999

[Sjoland and Sahlin, 1995] Thomas Sjoland and Dan Sahlin, Fixpoint Anal-ysis of Type and Alias in AKL Programs, SICS Technical Report, Jan1995 (A=F)

[Slonneger, 1992] Ken Slonneger, Implementing denotational semantics withlogic programming, in CSC ’92; Proceedings of the 1992 ACM ComputerScience 20th annual conference on Communications, pp. 337–344, 1992

[SLP, 1985] , Proceedings of the Second Symposium on Logic Programming,IEEE Computer Society Press, July 1985

[Smolka and Treinen, 1994] Gert Smolka and Ralf Treinen, Records for logicprogramming, Journal of Logic Programming, 18(2), pp. 229–258, Aug1994

[Smolka, 1994] Gert Smolka, The Definition of Kernel Oz, in[Podelski, CP 1994] , 1994

[Sneyers et al., 2005] Jon Sneyers, Tom Schrijvers, Bart Demoen, Guard andContinuation Optimization for Occurrence Representations of CHR, in[Gabbrielli and Gupta, ICLP 2005] (A=F)

[Sneyers et al., 2006] Jon Sneyers, Tom Schrijvers, and Bart Demoen, Mem-ory reuse for CHR, in [Etalle and Truszczynski, ICLP 2006] , pp. 72–86(A=F)

[Somogyi, 1987] Z. Somogyi, A System of Precise Modes for Logic Programs,in [Lassez, ICLP 1987], pp. 769–787, 1987 (A=C)


[Somogyi et al., 1996] Zoltan Somogyi, fergus Henderson, and Thomas Con-way, The Execution Algorithm of Mercury, An Efficient Purely Declara-tive Logic Programming Language, 29(1,2 & 3), 1996 (A=C)

[Somogyi and Stuckey, 2002] Zoltan Somogyi and Peter J.Stuckey, Using the heap to eliminate stack accesses, in[Pfenning and Kirchner, PPDP 2002]

[Somogyi and Sagonas, 2006] Zoltan Somogyi and Konstantinos F.Sagonas, Tabling in Mercury: Design and Implementation, in[Hentenryk, PADL 2006] , pp. 150–167 (A=F)

[Søndergaard, PPDP 2001] Harald Søndergaard (ed.), Proc. 3rd Interna-tional ACM SIGPLAN Conference on Principles and Practice of Declar-ative Programming, ACM Press, 2001

[Spronck et al., 2002] Pieter Spronck, Ida Sprinkhuizen-Kuyper, and EricPostma, Evolving Improved Opponent Intelligence, in GAME-ON 20023rd International Conference on Intelligent Games and Simulation, pp.94–98 (A=F)

[Spronck, 2005] Pieter Spronck, Adaptive Game AI, PhD. dissertation,Maastricht University, May 2005 (A=F)

[Spronck et al., 2006] Pieter Spronck, Marc Ponsen, Ida Sprinkhuizen-Kuyper, and Eric Postma, Adaptive Game AI with Dynamic Scripting,Machine Learning, 63(3), pp. 217–248, 2006 (A=F)

[Sterling and Shapiro, 1994] L. Sterling and E. Shapiro, The Art of Prolog,The MIT Press, 1994

[Sterling, 1995] Leon Sterling (ed.), Proc. of the 12th International Confer-ence on Logic Programming, The MIT Press, 1995

[Sterling and Yalcinalp, 1996] L. Sterling and U. Yalcinalp, Logic program-ming and software engineering — implications for software design, TR-96-31, Melbourne University, 1996

[Sterling and Yalcinalp, 1996] L. Sterling and U. Yalcinalp, Logic program-ming and software engineering — implications for software design,Knowledge Engineering Review, 11, pp. 1-13, 1996


[Sterling, 1996] L. Sterling, Editorial: Special issue: Applications of logicprogramming, Journal of Logic Programming, 8, pp. 91, 1996

[Sterling, 2002] Leon Sterling, Patterns for Prolog Programming, in[Kakas and Sadri, 2002], pp. 374–401

[Stickel, 1987] Mark E. Stickel, A Prolog Technology Theorem Prover: Imple-mentation by an Extended Prolog Compiler, in Proceedings of the EighthInternational Conference on Automated Deduction, 1987 (A=F)

[Stickel, 1988] M.E. Stickel, A Prolog Technology Theorem Prover: Imple-mentation by an Extended Prolog Compiler, Journal of Automated Rea-soning, pp. 353–380, 1988

[Stuckey, ICLP 2002] P.J. Stuckey (ed.), Proceedings 18th InternationalConference, ICLP 2002, Lecture Notes in Computer Science, 2401,Springer-Verlag, 2002

[Sutter, 2006] Herb Sutter, A Design Rationale for C++/CLI, Version 1.1,Feb 2006 (A=F)

[Sweeney, 2005] Tim Sweeney, The Next Mainstream Programming Lan-guage: A Game Developer’s Perspective, Advanced Functional Program-ming Workshop, 2005 (A=F)

[Swift, 1994] Terrance Swift, Efficient Evaluation of Normal Logic Programs,PhD. dissertation, State University of New York at Stony Brook, Dec1994 (A=F)

[Szabo and Szeredi, 2006] Peter Szabo and Peter Seredi, Improvingthe ISO Prolog standard by analysing compliance test results, in[Etalle and Truszczynski, ICLP 2006] , pp. 257–269 (A=F)

[Szuba, 1984] T. Szuba, PC-PROLOG for process control applications, Ange-wandte Informatik (Germany) ISSN: 0013-5704, 4, pp. 164-172, 1984

[Szuba, 1984(b)] T. Szuba, PROLOG as a Real-Time Language for ProcessControl, Angewandte Informatik (Germany) ISSN: 0013-5704, 9, pp. 370–375, 1984

[Takeuchi, 1993] Akikazu Takeuchi, Parallel Logic Programming, Wiley, 1993


[Tan and Lin, 1992] Jichan Tan, I-Peng Lin, Compiling dataflow analysis oflogic programs, in Proc. Conference on Programming Language Designand Implementation, 27(7), pp. 106–115, July 1992 (A=F)

[Tarau, 1992] Paul Tarau, Ecological Memory Management in a Continua-tion Passing Prolog Engine, in [Bekkers and Cohen, IWMM 1992]

[Tarau, 1999] Paul Tarau, Inference and Computation Mobility in Jinni, in[Apt et al., 1999]

[Tarau, 2000] Paul Tarau, Fluents: A Refactoring of Prolog for Uniform Re-flection and Operation with External Objects, in [Lloyd et al., CL 2000](A=F)

[Taylor, 1991] Andrew Taylor, High performance Prolog Implementation,PhD. dissertation, University of Sydney, June 1991 (A=C)

[Taylor, 1994] A. Taylor, PARMA–Bridging the performance gap between im-perative and logic programming, Journal of Logic Programming, 29, pp.5–16, 1994 (A=C)

[Thompson, 1991] S. Thompson, Type theory and functional programming,Addison-Wesley, 1991

[Tick and Warren, 1983] E. Tick and D.H.D. Warren, Towards a pipelinedprocessor, Technical Report, AI Center SRI, Aug 1983

[Tick, 1988 (SCA)] E. Tick, Data buffer performance for sequential Prologarchitectures, in Proceedings of the 15th Annual International Symposiumon Computer architecture, pp. 434–442, 1988 (A=F)

[Tick, 1988 (KAP)] E. Tick, Memory performance of Prolog architectures,Kluwer Academic Publishers Group, 1988

[Tick, 1991] Evan Tick, Parallel Logic Programming, The MIT Press, 1991

[Tick, 1991 (b)] Evan Tick, Memory- and buffer-referencing characteristicsof a WAM-based Prolog, Journal of Logic Programming, 11(1 & 2), pp.133–162, July 1991


[Tick and Succi, 1993] Evan Tick and Giancarlo Succi (eds.), Proc. of theImplementations of Logic Programming Systems Workshops (ICLP’93),Oct 1993

[Tick and Chikayama, 1994] Evan Tick and Takashi Chikayama (eds.), Pro-ceedings of the ICOT/NSF Workshop on Parallel Logic Programmingand its Programming Environments, CSI-TR-94-04, University of Ore-gon, Mar 1994

[Touati, 1988] Herve Touati, A Prolog Garbage Collector for Aquarius, TRCSD-88-443, University of California, Berkeley, 1988 (A=F)

[Touati and Hama, 1988] H. Touati and T. Hama, A Light-Weight PrologGarbage Collector, in Proc. of the International Conference on Fifth Gen-eration Computing Systems, pp. 922–930, 1988

[Turk, 1986] Andrew K. Turk, Compiler Optimizations for the WAM, in[Shapiro, ICLP’86], pp. 657–662, 1986 (A=C)

[Tyagi and Tarau, 2001] Satyam Tyagi and Paul Tarau, A Most SpecificMethod Finding Algorithm for Reflection Based Dynamic Prolog-to-JavaInterfaces, in [Ramakrishnan, PADL 2001], 2001

[Vandeginste et al., 2002] Ruben Vandeginste, Konstantinos Sagonas, andBart Demoen, Segment Order Preserving and Generational Garbage Col-lection for Prolog, in [Krishnamurthi and Ramakrishnan, PADL 2002]

[Vandeginste and Demoen, 2003] Ruben Vandeginste and Bart Demoen, In-cremental Copying Garbage Collection for WAM-based Prolog systems, inProc. CICLOPS, 2003

[Vandeginste and Demoen, 200X] Ruben Vandeginste and Bart Demoen, In-cremental Copying Garbage Collection for WAM-based Prolog systems, inTheory and Practice of Logic Programming, accepted Dec 22, 2005 (A=F)

[Vaucher and Lapalme, 1988] J. Vaucher and G. Lapalme, SCOOP, Struc-tured Concurrent Object-Oriented Prolog, in Proc. European Conf. onObject-Oriented Programming (ECOOP), Lecture Notes in Computer Sci-ence, 322, pp. 191–211, Aug 1988


[Vaucheret and Bueno, 2002] Claudio Vaucheret and Francisco Bueno,More Precise Yet Efficient Type Inference for Logic Programs, in[Hermenegildo and Puebla, 2002], pp. 102–116 (A=F)

[Virding, 1995] Robert Virding, A garbage collector for the concurrent real-time language Erlang, in [Baker H.G., IWMM 1995] , pp. 343–354 (A=F)

[Vitek, 1995] Jan Vitek, Compact Dispatch Tables for Dynamically TypedProgramming Languages, M.Sc. Thesis, University of Victoria, 1995(A=C)

[Voronkov, 1990] A. Voronkov (ed.), Proc. First/Second Russian Confer-ence on Logic Programming, Lecture Notes in Artificial Intelligence, 592,Springer-Verlag, Sept 1990, Sept 1991

[Wærn, 1988] Annika Wærn, An Implementation Technique for The AbstractInterpretation of Prolog, SICS Research Report R88004, 1988 (A=C)

[Wærn, 1988(b)] Annika Wærn, An Implementation Technique for the Ab-stract Interpretation of Prolog, in [Kowalski and Bowen, 1988], pp. 700–710, 1988

[Wakeling, 1997] D. Wakeling, A Haskell to Java Virtual Machine CodeCompiler, in Proceedings of the 9th International Workshop on the Imple-mentation of Functional Languages, Lecture Notes in Computer Science,1467, pp. 39–52, Springer-Verlag, 1997 (A=C)

[Wakeling, 1998] D. Wakeling, Mobile Haskell: Compiling Lazy FunctionalPrograms for the Java Virtual Machine, in Proceedings of the 1998 Con-ference on Programming Languages,Implementations, Logics and Pro-grams (PLILP’98), Lecture Notes in Computer Science, 1490, pp. 335–352, Springer-Verlag, 1998 (A=C)

[Wakeling, 1999] D. Wakeling, Compiling Lazy Functional Programs for theJava Virtual Machine, Journal of Functional Programming, 9(6), pp.579–603, Nov 1999 (A=C)

[Wall, PLDI 1995] David W. Wall (ed.), Proceedings of the ACM SIGPLANconference on Programming language design and implementation, ACMPress, 1995


[Wallace, CP 2004] M. Wallace (ed.), Proceedings 10th International Confer-ence, Principles and Practice of Constraint Programming, Lecture Notesin Computer Science, 3258, Springer-Verlag, 2004

[Wang, 1960] Hao Wang, Proving Theorems by Pattern Recognition I, Com-munications of the ACM, 3(4), pp. 220–234, April 1960 (A=F)

[Warren, 1977] D.H.D. Warren, Implementing Prolog - Compiling PredicateLogic Programs, Reports 39 and 40, University of Edinburgh, May 1977

[Warren, 1977(b)] D.H.D. Warren, Logic programming and compiler writing,University of Edinburgh, RR 44, 1977

[Warren, 1977(c)] D.H.D. Warren, Applied logic - its use and implementationas a programming tool, Technical Report 290, AI Center SRI, 1977

[Warren, 1980] D.H.D. Warren, Logic programming and compiler writing,Software — Practice and Experience, 10, pp. 97–125, 1980

[Warren, 1983] D.H.D. Warren, An Abstract Prolog Instruction Set, Techni-cal Note 309, AI Center SRI, Oct 1983

[Warren DS, 1984] D.S. Warren, Efficient Prolog Memory Management forFlexible Control Strategies, in Proceedings of the 1984 Symposium onLogic Programming, pp. 198–202, IEEE Computer Science Press, 1984

[Warren D.S., 1992] D.S. Warren, Memoing for Logic Programs, Communi-cations of the ACM, 35(3), pp. 94–111, 1992

[Warren D.S., ICLP’93] D.S Warren (ed.), Logic Programming: Proceedingsof the 10th International Conference, The MIT Press, June 21–25 1993

[Warren D.S., 1999] David Scott Warren, Programming in Tabled Prolog,Draft, July 1999 (A=F)

[Weemeeuw, 1993] Patrick Weemeeuw, Two Parallel Garbage Collection Al-gorithms for Prolog, PhD. dissertation, K.U. Leuven, 1993

[Weemeeuw and Demoen, 1994] Patrick Weemeeuw and Bart Demoen, Afine-grained memory compaction algorithm, Journal of Parallel and Dis-tributed Computing, 20(2), pp. 176–186, 1994


[Williams, 1979] M.H. Williams, Conditions for extended operator precedenceparsing, Computer Journal, 22(3), pp. 164–168 (A=F)

[Wilson et al., 1995] Paul R. Wilson, Mark S. Johnstone, Michael Neely andDavid Boles, Dynamic storage allocation: A survey and critical review,in [Baker H.G., IWMM 1995] , pp. 1–116 (A=F)

[Wirth and Weber, 1966] Niklaus Wirth and Helmut Weber, EULER: a gen-eralization of ALGOL, and its formal definition: Part II, Communica-tions of the ACM, 9(2), Feb 1966 (A=F)

[Wise, 1982] Michael J. Wise, A parallel Prolog: The construction of a datadriven model, in Proceedings of the 1982 ACM Symposium on LISP andFunctional Programming, pp. 56–66, 1982 (A=F)

[Wise, 1982 (ACM)] Michael J. Wise, EPILOG = PROLOG + Data Flow:arguments for combining Prolog with a data driven mechanism, ACMSIGPLAN Notices, pp. 80–86, 1982 (A=F)

[Wise, 1993] M.J. Wise, Experience with PMS-Prolog: a Distributed Coarse-grain-parallel Prolog with Processes, Modules and Streams, Software —Practice and Experience, 23(2), pp. 151–175, Feb 1993

[Wu, 1991] Shaun-inn Wu, LogiC++ : An integrated logic and object-oriented programming language, in Usenix C++ Conference Proceedings,pp. 235–243, April 1991

[Xirogiannis and Taylor, 2002] G. Xirogiannis and H. Taylor, PAN: APortable, Parallel Prolog: Its Design, Realisation and Performance, NewGeneration Computing, 20(4), Aug 2002

[Xu and Warren, 1988] J. Xu and D.S. Warren, A Type Inference Systemfor Prolog, in Proc. Int’l Conf. on Logic Programming, pp. 604–619, Aug1988

[Yang J., 2001] Jun Yang, Improving Polymorphic Type Explanations, PhD.dissertation, Department of Computing and Electrical Engineering,Heriot-Watt University, May 2001 (A=F)

[Yang R. and Aiso, 1986] Rong Yang and Hideo Aiso, P-Prolog: a parallellogic programming language based on exclusive relation, in Proceedingson Third international conference on logic programming, pp. 255 - 269


[Yang R., 1987] Rong Yang, P-Prolog: A Parallel Logic Programming Lan-guage, World Scientific Publishing, 1987

[Yardeni et al., 1991] E. Yardeni, T.W. Fruhwirth, and E. Shapiro, Polymor-phically Typed Logic Programs, TR ECRC-LP-61, 1991

[Zhou, 1996] Neng-Fa Zhou, Parameter Passing and Control Stack Manage-ment in Prolog Implementation Revisited, ACM Transactions on Pro-gramming Languages and Systems, 18(6), pp. 752–779, Nov 1996

[Zhou, 1996 (ICLP)] Neng-Fa Zhou, A Novel Implementation Method of De-lay, in Joint International Conference and Symposium on Logic Program-ming, 1996 (A=F)

[Zhou et al., 2000] Neng-Fa Zhou et al., Implementation of a Linear TablingMechanism, in [Pontelli and Santos Costa, PADL 2000], pp. 109–123(A=F)

[Zhou, 2000] Neng-Fa Zhou, Garbage Collection in B-Prolog, in[Demoen, MM 2000], July 2000

[Zhou and Tarau, 2003] Qinan Zhou and Paul Tarau, GarbageCollection Algorithms for Java–Based Prolog Engines, in[Dahl and Wadler, PADL 2003], pp. 304–319 (A=C)

[Zibin and Gil, 2003] Yoav Zibin and Joseph (Yossi) Gil, Incremen-tal algorithms for dispatching in dynamically typed languages, in[Morrisett and Aiken, POPL 2003], pp. 126–138 (A=C)

[Zobel, 1987] J. Zobel, Derivation of Polymorphic Types for Prolog Pro-grams, in [Lassez, ICLP 1987], pp. 817–838, 1987 (A=C)

distributed / parallel logic programming...lp technology (june 03, 2007, 61 pages) 5 [armstrong,...

Documents