Abstract is missing.
- Logic Programming and Model CheckingBaoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, David Scott Warren. 1-20 [doi]
- CAT: The Copying Approach to TablingBart Demoen, Konstantinos F. Sagonas. 21-35 [doi]
- SICStus MT - A Multithreaded Execution Environment for SICStus PrologJesper Eskilson, Mats Carlsson. 36-53 [doi]
- A Framework for Bottom Up Specialisation of Logic ProgramsWim Vanhoof, Danny De Schreye, Bern Martens. 54-72 [doi]
- Termination of Logic Programs with block Declarations Running in Several ModesJan-Georg Smaus, Patricia M. Hill, Andy King. 73-88 [doi]
- The Boolean Logic of Set Sharing AnalysisMichael Codish, Harald Søndergaard. 89-101 [doi]
- Derivation of Proof Methods by Abstract InterpretationGiorgio Levi, Paolo Volpe. 102-117 [doi]
- Detecting Unsolvable Queries for Definite Logic ProgramsMaurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker. 118-133 [doi]
- Staging Static Analyses Using Abstraction-Based Program SpecializationJohn Hatcliff, Matthew B. Dwyer, Shawn Laubach. 134-151 [doi]
- An Experiment in Domain Refinement: Type Domains and Type Representations for Logic ProgramsGiorgio Levi, Fausto Spoto. 152-169 [doi]
- Architecture Software Using A Methodology for Language DevelopmentCharles Consel, Renaud Marlet. 170-194 [doi]
- Explicit Substitutions for Objects and FunctionsDelia Kesner, Pablo E. Martínez López. 195-212 [doi]
- The Complexity of Late-Binding in Dynamic Object-Oriented LanguagesEnrico Pontelli, Desh Ranjan, Gopal Gupta. 213-229 [doi]
- A Compiler for Rewrite Programs in Associative-Commutative TheoriesPierre-Etienne Moreau, Hélène Kirchner. 230-249 [doi]
- Solution to the Problem of Zantema on a Persistent Property of Term Rewriting SystemsTakahito Aoto. 250-265 [doi]
- A General Framework for R-Unification ProblemsSébastien Limet, Frédéric Saubion. 266-281 [doi]
- Operational Versus Denotational Methods in the Semantics of Higher Order LanguagesAndrew M. Pitts. 282-283 [doi]
- Functional Implementations of Continuos Modeled AnimationConal Elliott. 284-299 [doi]
- Compiling Erlang to SchemeMarc Feeley, Martin Larose. 300-317 [doi]
- From (Sequential) Haskell to (Parallel) Eden: An Implementation Point of ViewSilvia Breitinger, Ulrike Klusik, Rita Loogen. 318-334 [doi]
- Mobile Haskell: Compiling Lazy Functional Programs for the Java Virtual MachineDavid Wakeling. 335-352 [doi]
- Program Analysis in Lambda-PrologJohn Hannan. 353-354 [doi]
- A Game Semantics Foundation for Logic Programming (Extended Abstract)Roberto Di Cosmo, Jean-Vincent Loddo, Stephane Nicolet. 355-373 [doi]
- Controlling Search in Declarative ProgramsMichael Hanus, Frank Steiner. 374-390 [doi]
- Encapsulating Data in Logic Programming via Categorial ConstraintsJames Lipton, Robert McGrail. 391-410 [doi]
- Constructive Negation Using Typed Existence PropertiesJohn G. Cleary, Lunjin Lu. 411-426 [doi]
- Optimal Reduction of Functional ExpressionsAndrea Asperti. 427-428 [doi]
- Embedding Multiset Constraints into a Lazy Functional Logic LanguagePuri Arenas-Sánchez, Francisco Javier López-Fraguas, Mario Rodrúguez-Arteljo. 429-444 [doi]
- A Hidden Herbrand TheoremJoseph A. Goguen, Grant Malcolm, Tom Kemp. 445-462 [doi]
- Integrating Constraint Propagation in Complete Solving of Linear Diophantine SystemsFarid Ajili, Hendrik C. R. Lock. 463-480 [doi]
- Approaches to the Incremental Detection of Implicit Equalities with the Revised Simplex MethodPhilippe Refalo. 481-496 [doi]