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

• 1991
• 
  Shail Aditya, Rishiyur S. Nikhil:
  Incremental Polymorphism. FPCA 1991: 379-405
• 
  Alexander Aiken, Brian R. Murphy:
  Implementing Regular Tree Expressions. FPCA 1991: 427-447
• 
  Gebreselassie Baraki:
  A Note on Abstract Interpretation of Polymorphic Functions. FPCA 1991: 367-378
• 
  Paul S. Barth, Rishiyur S. Nikhil, Arvind:
  M-Structures: Extending a Parallel, Non-strict, Functional Language with State. FPCA 1991: 538-568
• 
  Tzi-cker Chiueh:
  An Architectural Technique for Cache-level Garbage Collection. FPCA 1991: 520-537
• 
  Charles Consel, Olivier Danvy:
  For a Better Support of Static Data Flow. FPCA 1991: 496-519
• 
  Pascal Fradet:
  Syntactic Detection of Single-Threading Using Continuations. FPCA 1991: 241-258
• 
  Gudmund Skovbjerg Frandsen, Carl Sturtivant:
  What is an Efficient Implementation of the \lambda-calculus? FPCA 1991: 289-312
• 
  John Hannan:
  Making Abstract Machines Less Abstract. FPCA 1991: 618-635
• 
  Fritz Henglein:
  Efficient Type Inference for Higher-Order Binding-Time Analysis. FPCA 1991: 448-472
• 
  Michael L. Heytens, Rishiyur S. Nikhil:
  List Comprehensions in Agna, A Parallel Persistant Object System. FPCA 1991: 569-591
• 
  Carsten Kehler Holst:
  Finiteness Analysis. FPCA 1991: 473-495
• 
  Thomas P. Jensen:
  Strictness Analysis in Logical Form. FPCA 1991: 352-366
• 
  Simon L. Peyton Jones, John Launchbury:
  Unboxed Values as First Class Citizens in a Non-Strict Functional Language. FPCA 1991: 636-666
• 
  John Launchbury:
  A Strongly-Typed Self-Applicable Partial Evaluator. FPCA 1991: 145-164
• 
  Xavier Leroy, Michel Mauny:
  Dynamics in ML. FPCA 1991: 406-426
• 
  Allen Leung, Prateek Mishra:
  Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages. FPCA 1991: 328-351
• 
  David J. Lillie, Peter G. Harrison:
  A Projection Model of Types. FPCA 1991: 259-288
• 
  Harry G. Mairson:
  Outline of a Proof Theory of Parametricity. FPCA 1991: 313-327
• 
  Luc Maranget:
  GAML: a Parallel Implementation of Lazy ML. FPCA 1991: 102-123
• 
  Erik Meijer, Maarten M. Fokkinga, Ross Paterson:
  Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. FPCA 1991: 124-144
• 
  Tobias Nipkow, Gregor Snelting:
  Type Classes and Overloading Resolution via Order-Sorted Unification. FPCA 1991: 1-14
• 
  Klaus E. Schauser, David E. Culler, Thorsten von Eicken:
  Compiler-Controlled Multithreading for Lenient Parallel Languages. FPCA 1991: 50-72
• 
  Sjaak Smetsers, Eric Nöcker, John H. G. van Groningen, Marinus J. Plasmeijer:
  Generating Efficient Code for Lazy Functional Languages. FPCA 1991: 592-617
• 
  Vipin Swarup, Uday S. Reddy, Evan Ireland:
  Assignments for Applicative Languages. FPCA 1991: 192-214
• 
  Satish R. Thatte:
  Coercive Type Isomorphism. FPCA 1991: 29-49
• 
  Kenneth R. Traub:
  Multi-thread Code Generation for Dataflow Architectures from Non-Strict Programs. FPCA 1991: 73-101
• 
  Dennis M. Volpano, Geoffrey S. Smith:
  On the Complexity of ML Typability with Overloading. FPCA 1991: 15-28
• 
  David Wakeling, Colin Runciman:
  Linearity and Laziness. FPCA 1991: 215-240
• 
  Daniel Weise, Roland Conybeare, Erik Ruf, Scott Seligman:
  Automatic Online Partial Evaluation. FPCA 1991: 165-191

skipping 1 more match