• 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

• 1981
• 
  John W. Backus:
  Function level programs as mathematical objects. FPCA 1981: 1-10
• 
  Gérard Berry:
  Programming with concrete data structures and sequential algorithms. FPCA 1981: 49-58
• 
  Peter Buneman, Rishiyur S. Nikhil, Robert E. Frankel:
  A practical functional programming system for databases. FPCA 1981: 195-202
• 
  F. Warren Burton, M. Ronan Sleep:
  Executing functional programs on a virtual tree of processors. FPCA 1981: 187-194
• 
  Arthur J. Catto, John R. Gurd:
  Resource management in dataflow. FPCA 1981: 77-84
• 
  Keith L. Clark, Steve Gregory:
  A relational language for parallel programming. FPCA 1981: 171-178
• 
  John S. Conery, Dennis F. Kibler:
  Parallel interpretation of logic programs. FPCA 1981: 163-170
• 
  John Darlington, Mike Reeve:
  ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages. FPCA 1981: 65-76
• 
  Geoffrey A. Frank:
  Specification of data structures for FP programs. FPCA 1981: 221-228
• 
  John V. Guttag, James J. Horning, John Williams:
  FP with data abstraction and strong typing. FPCA 1981: 11-24
• 
  Noorul Islam, Thomas J. Myers, Paul Broome:
  A simple optimizer for FP-like languages. FPCA 1981: 33-40
• 
  Deepak Kapur, David R. Musser, Alexander A. Stepanov:
  Operators and algebraic structures. FPCA 1981: 59-64
• 
  Robert M. Keller, Gary Lindstrom:
  Applications of feedback in functional programming. FPCA 1981: 123-130
• 
  Robert M. Keller, M. Ronan Sleep:
  Applicative caching: Programmer control of object sharing and lifetime in. distributed implementations of applicative languages. FPCA 1981: 131-140
• 
  Richard B. Kieburtz, Jonathan C. Shultis:
  Transformations of FP program schemes. FPCA 1981: 41-48
• 
  Bruce J. MacLennan:
  Introduction to relational programming. FPCA 1981: 213-220
• 
  Gyula Magó:
  Copying operands versus copying results: A solution to the problem of large operands in FFP'S. FPCA 1981: 93-98
• 
  Vishv M. Malhotra, V. Rajaraman:
  A data-flow language for specifying business data processing applications. FPCA 1981: 203-212
• 
  Bengt Nordström:
  Programming in Constructive Set Theory: Some examples. FPCA 1981: 141-154
• 
  Rex L. Page, M. G. Conant, Dale H. Grit:
  If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs. FPCA 1981: 179-186
• 
  H. A. Presnell, Roy P. Pargas:
  Communication along shortest paths in a tree machine. FPCA 1981: 107-114
• 
  Michel Sintzoff:
  Proof-oriented and applicative valuations in definitions of algorithms. FPCA 1981: 155-162
• 
  Donald F. Stanat, E. Hollins Williams Jr.:
  Optimal associative searching on a cellular computer. FPCA 1981: 99-106
• 
  Donald MacDavid Tolle:
  Implanting FFP trees in binary trees: An architectural proposal. FPCA 1981: 115-122
• 
  D. A. Turner:
  The semantic elegance of applicative languages. FPCA 1981: 85-92
• 
  Philip Wadler:
  Applicative style programming, program transformation, and list operators. FPCA 1981: 25-32
• 
  Arvind, Jack B. Dennis:
  Proceedings of the 1981 conference on Functional programming languages and computer architecture, FPCA 1981, Wentworth, New Hampshire, USA, October 1981. ACM 1981, ISBN 0-89791-060-5 [contents]