• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 29 matches

• 1989
• 
  Harvey Abramson, M. H. Rogers:
  Meta-Programming in Logic Programming, Workshop on Meta-Programming in Logic, META 1988, University of Bristol, 22-24 June, 1988. MIT Press 1989, ISBN 0-262-51047-2 [contents]
• 1988
• 
  Seiki Akama, Akira Ishikawa:
  Semantically Constrained Parsing and Logic Programming. META 1988: 157-168
• 
  Jonas Barklund:
  What Is a Meta-Variable in Prolog? META 1988: 383-398
• 
  Howard A. Blair:
  Metalogic Programming and Direct Universal Computability. META 1988: 53-63
• 
  Andrew Bowles, Paul Wilk:
  Tracing Requirements for Multi-Layered Meta-Programming. META 1988: 205-215
• 
  Albert Bruffaerts, Eric Henin:
  Negation as Failure: Proofs, Inference Rules and Meta-Interpreters. META 1988: 169-190
• 
  Marco Cavalieri, Evelina Lamma, Paola Mello, Antonio Natali:
  Meta-Programming in Prolog Through Direct Introspection: Comparison with Meta-Interpretation Techniques. META 1988: 399-415
• 
  David Chan, Mark Wallace:
  A Treatment of Negation during Partial Evaluation. META 1988: 299-317
• 
  Mantis H. M. Cheng, Maarten H. van Emden, Paul A. Strooper:
  Complete Sets of Frontiers in Logic-Based Program Transformation. META 1988: 283-297
• 
  Ilyas Cicekli:
  Design and Implementation of An Abstract MetaProlog Engine for MetaProlog. META 1988: 417-433
• 
  Michael Codish, John P. Gallagher, Ehud Shapiro:
  Using Safe Approximations of Fixed Points for Analysis of Logic Programs. META 1988: 233-261
• 
  Verónica Dahl, Pierre Massicotte:
  Processing Techniques for Dsicontinuous Grammars. META 1988: 141-156
• 
  Wlodzimierz Drabent, Simin Nadjm-Tehrani, Jan Maluszynski:
  Algorithmic Debugging with Assertions. META 1988: 501-521
• 
  Thom W. Frühwirth:
  Type Inference by Program Transformation and Partial Evaluation. META 1988: 263-282
• 
  Fausto Giunchiglia, Alan Smaill:
  Reflection in Constructive and Non-constructive Automated Reasoning. META 1988: 123-140
• 
  John Hannan, Dale Miller:
  A Meta-Logic for Functional Programming. META 1988: 453-476
• 
  Frank van Harmelen:
  A Classification of Meta-level Architectures. META 1988: 103-122
• 
  Patricia M. Hill, John W. Lloyd:
  Analysis of Meta-Programs. META 1988: 23-51
• 
  Lynette Hirschman:
  A Meta-Rule Treatment for Englich Wh-Constructions. META 1988: 1-21
• 
  Yue Jun Jiang, Nader Azarmi:
  Meta Logic Programming for Epistemic Notions. META 1988: 477-499
• 
  Stephen Owen:
  Issues in the Partial Evaluation of Meta-Interpreters. META 1988: 319-339
• 
  Brian J. Ross:
  The Partial Evaluation of Imperative Programs Using Prolog. META 1988: 341-363
• 
  Francesca Rossi, Ugo Montanari:
  Hypergraph Grammars and Networks of Constraints versus Logic Programming and Metaprogramming. META 1988: 531-544
• 
  Danny De Schreye, Maurice Bruynooghe:
  The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. META 1988: 217-231
• 
  John Staples, Peter J. Robinson, R. A. Paterson, R. A. Hagen, A. J. Craddock, P. C. Wallis:
  Qu-Prolog: An Extended Prolog for Meta Level Programming. META 1988: 435-452
• 
  V. S. Subrahmanian:
  A Simple Formulation of the Theory of Metalogic Programming. META 1988: 65-101
• 
  Paul Tarau, Michel Boyer:
  Prolog Meta-Programming with Soft Databases. META 1988: 365-381
• 
  Paul J. Voda:
  The Logical Reconstruction of Cuts as One Solution Operators. META 1988: 523-530
• 
  L. Ümit Yalçinalp, Leon Sterling:
  An Integrated Interpreter for Explaining Prolog's Successes and Failures. META 1988: 191-203