Electronic Notes in Theoretical Computer Science, Volume 30

Volume 30, Number 1, 1999

• Christoph Beierle, Reinhold Kloos, Gregor Meyer:
  A Pragmatic Type Concept for Prolog Supporting Polymorphism, Subtyping, and Meta-Programming. 1-21
  
• Marco Comini, Roberta Gori, Giorgio Levi, Paolo Volpe:
  Abstract Interpretation based Verification of Logic Programs. 22-38
  
• Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
  Automatic Termination Analysis of Programs Containing Arithmetic Predicates. 39-58
  
• Pascal Hitzler, Anthony Karel Seda:
  Acceptable Programs Revisited. 59-76
  
• Dino Pedreschi, Salvatore Ruggieri:
  On Logic Programs That Do Not Fail. 77-101
  
• Annalisa Bossi, Sandro Etalle, Sabina Rossi:
  Properties of Input-Consuming Derivations. 102-124
  
• Sandro Etalle, Jan-Georg Smaus:
  Preface - Workshop on Verification of Logic Programs. 125
  

Volume 30, Number 2, 1999

• Michael Leuschel:
  Preface - Workshop on Optimization and Implementation of Declarative Programs. 127-128
  
• Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
  Rules and Strategies for Contextual Specialization of Constraint Logic Programs. 129-144
  
• Marco Gavanelli, Michela Milano:
  On the Need for a Different Backtracking Rule when Dealing with Late Evaluation. 145-156
  
• Michael Leuschel, Jesper Jørgensen:
  Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN. 157-162
  
• Germán Puebla, Manuel V. Hermenegildo:
  Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs. 163-187
  
• Kazunori Ueda:
  Linearity Analysis of Concurrent Logic Programs. 188
  
• Wim Vanhoof, Maurice Bruynooghe:
  Towards Modular Binding-Time Analysis for First-order Mercury. 189-198
  
• Neng-Fa Zhou, Sosuke Kaneko:
  A Hybrid Algorithm for Compiling Equality Constraints and its Implementation. 199-207
  

Volume 30, Number 3, 1999

• Inês de Castro Dutra, Vítor Santos Costa, Gopal Gupta, Enrico Pontelli, Manuel Carro, Péter Kacsuk:
  Preface. 1-2
  
• Kyoung-Sun Kang, Naoyuki Tamura:
  A Static Analysis Method for a Classical Linear Logic Programming Language. 3-19
  
• Mutsunori Banbara, Naoyuki Tamura:
  Translating a Linear Logic Programming Language into Java. 20-45
  
• Henri Lesourd:
  The Implementation of the Hammurabi System: Indexing and Interprocess Communication. 46-66
  
• Baoqiu Cui, David Scott Warren:
  Attributed Variables in XSB. 67-80
  
• Lígia Ferreira, Salvador Abreu:
  A Constraint Logic Programming Framwork in Java. 81-92
  
• Martin Henz, Tobias Müller, Ka Boon Ng:
  Figaro: Yet Another Constraint Programming Library. 93-105
  
• Manuel Eduardo Correia, Vítor Santos Costa:
  IAP for dummies: The YAP Design. 106-121
  
• Daniel Cabeza Gras, Manuel V. Hermenegildo:
  The Ciao Module System: A New Module System for Prolog. 122-142
  
• Paul Tarau:
  Multi-engine Horn Clause Prolog. 143
  
• Daniel Cabeza Gras, Manuel V. Hermenegildo:
  The Ciao Modular, Standalone Compiler and Its Generic Program Processing Library. 144-162
  

Volume 30, Number 4, 1999

• Mireille Ducassé, Anthony J. Kusalik, Germán Puebla:
  Preface. 197
  
• Clinton J. Jeffery:
  The Alamo Execution Monitor Architecture. 198-214
  
• Wlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak:
  Type-based Diagnosis of CLP Programs. 215-234
  
• Marija Kulas:
  Debugging Prolog Using Annotations. 235-255
  
• Zoltan Somogyi, Fergus Henderson:
  The Implementation Technology of the Mercury Debugger. 256-275
  
• Yoshihiro Adachi, Kensei Tsuchida, Takanori Imaki, Takeo Yaku:
  Logichart - Intelligible Program Diagram for Prolog and its Processing System. 276-288
  
• Manuel V. Hermenegildo:
  A System for Automatically Generating Documentation for (C)LP Programs. 289-307
  
• Erwan Jahier, Mireille Ducassé, Olivier Ridoux:
  Specifying Byrd's Box Model with a Continuation Semantics. 308-315
  

Last update Sat May 18 20:56:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page