• 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 27 matches

• 2013
• 
  Sergio Antoy, Andy Jost:
  Are needed redexes really needed? PPDP 2013: 61-71
• 
  Kazuyuki Asada, Soichiro Hidaka, Hiroyuki Kato, Zhenjiang Hu, Keisuke Nakano:
  A parameterized graph transformation calculus for finite graphs with monadic branches. PPDP 2013: 73-84
• 
  Roberto Bagnara, Fred Mesnard:
  Eventual linear ranking functions. PPDP 2013: 229-238
• 
  Rafael Caballero, Peter J. Stuckey, Antonio Tenorio-Fornes:
  Finite type extensions in constraint programming. PPDP 2013: 217-227
• 
  Marco Calautti, Sergio Greco, Irina Trubitsyna:
  Detecting decidable classes of finitely ground logic programs with function symbols. PPDP 2013: 239-250
• 
  Jan Christiansen, Michael Hanus, Fabian Reck, Daniel Seidel:
  A semantics for weakly encapsulated search in functional logic programs. PPDP 2013: 49-60
• 
  Joana Côrte-Real, Inês de Castro Dutra, Ricardo Rocha:
  Prolog programming with a map-reduce parallel construct. PPDP 2013: 285-296
• 
  Olivier Danvy, Ian Zerny:
  A synthetic operational account of call-by-need evaluation. PPDP 2013: 97-108
• 
  Álvaro García-Pérez, Pablo Nogueira, Juan José Moreno-Navarro:
  Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order. PPDP 2013: 85-96
• 
  Stefan Holdermans:
  Random testing of purely functional abstract datatypes: guidelines for dealing with operation invariance. PPDP 2013: 275-284
• 
  Wojciech Jedynak, Malgorzata Biernacka, Dariusz Biernacki:
  An operational foundation for the tactic language of Coq. PPDP 2013: 25-36
• 
  Andrew Kennedy, Nick Benton, Jonas Braband Jensen, Pierre-Évariste Dagand:
  Coq: the world's best macro assembler? PPDP 2013: 13-24
• 
  Jael Kriener, Andy King, Sandrine Blazy:
  Proofs you can believe in: proving equivalences between Prolog semantics in Coq. PPDP 2013: 37-48
• 
  Edmund S. L. Lam, Iliano Cervesato:
  Decentralized execution of constraint handling rules for ensembles. PPDP 2013: 205-216
• 
  Yngve Lamo, Florian Mantz, Adrian Rutle, Juan de Lara:
  A declarative and bidirectional model transformation approach based on graph co-spans. PPDP 2013: 1-12
• 
  Louis Mandel, Cédric Pasteur, Marc Pouzet:
  Time refinement in a functional synchronous language. PPDP 2013: 169-180
• 
  Kazutaka Matsuda, Meng Wang:
  Bidirectionalization for free with runtime recording: or, a light-weight approach to the view-update problem. PPDP 2013: 297-308
• 
  Jan Midtgaard, Norman Ramsey, Bradford Larsen:
  Engineering definitional interpreters. PPDP 2013: 121-132
• 
  Manuel Montenegro, Ricardo Peña, Clara Segura:
  Shape analysis in a functional language by using regular languages. PPDP 2013: 251-262
• 
  John T. O'Donnell:
  Extensible sparse functional arrays with circuit parallelism. PPDP 2013: 133-144
• 
  Luis Fernando Pino, Filippo Bonchi, Frank D. Valencia:
  Efficient computation of program equivalence for confluent concurrent constraint programming. PPDP 2013: 263-274
• 
  Edward Robbins, Jacob M. Howe, Andy King:
  Theory propagation and rational-trees. PPDP 2013: 193-204
• 
  Robert J. Simmons, Ian Zerny:
  A logical correspondence between natural semantics and abstract machines. PPDP 2013: 109-119
• 
  Gordon Stewart, Anindya Banerjee, Aleksandar Nanevski:
  Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures. PPDP 2013: 145-156
• 
  Yuting Wang, Kaustuv Chaudhuri, Andrew Gacek, Gopalan Nadathur:
  Reasoning about higher-order relational specifications. PPDP 2013: 157-168
• 
  Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
  Unifying the Knuth-Bendix, recursive path and polynomial orders. PPDP 2013: 181-192
• 
  Ricardo Peña, Tom Schrijvers:
  15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13, Madrid, Spain, September 16-18, 2013. ACM 2013, ISBN 978-1-4503-2154-9 [contents]