%A John Backus
%T Function level programs as mathematical objects
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 1-10

%A John Guttag
%A James Horning
%A John Williams
%T FP with data abstraction and strong typing
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 11-24

%A Philip Wadler
%T Applicative style programming, program transformation,
and list operators
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 25-32

%A N. Islam
%A T.J. Myers
%A P. Broome
%T A simple optimiser for FP-like languages
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 33-39

%A Richard B. Kieburtz
%A Jonathan Shultis
%T Transformations of FP program schemes
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 41-48
%K algebra

%A G. Berry
%T Programming with concrete data structures and sequential algorithms
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 49-57

%A D. Kapur
%A D.R. Musser
%A A.A. Stepanov
%T Operators and algebraic structures
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 59-63
%K associativity, commutativity, parallel reduction

%A John Darlington
%A Mike Reeve
%T ALICE: a multi-processor reduction machine
for the parallel evaluation of applicative languages
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 65-75

%A A.J. Catto
%A J.R. Gurd
%T Resource management in dataflow
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 77-84

%A D.A. Turner
%T The semantic elegance of applicative languages
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 85-92
%K KRC

%A Gyula Mago
%T Copying operands versus copying results:
a solution to the problem of large operands in FFP's
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 93-98
%K implementation

%A Donald F. Stanat
%A E. Hollins Williams,\ Jr.
%T Optimal associative searching on a cellular computer
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 99-106
%K implementation, architecture, Mago tree machine

%A H.A. Presnell
%A R.P. Pargas
%T Communication along shortest paths in a tree machine
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 107-114

%A Donald MacDavid Toile
%T Implanting FFP trees in binary trees: an architectural proposal
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 115-122

%A Robert M. Keller
%A Gary Lindstrom
%T Applications of feedback in functional programming
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 123-130

%A Robert M. Keller
%A M. Ronan Sleep
%T Applicative caching:
programmer control of object sharing and lifetime
in distributed implementations of applicative languages
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 131-140

%A Bengt Nordstrom
%T Programming in constructive set theory: some examples
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 141-153
%K functional programming, types, typing, Lisp

%A Michel Sintzoff
%T Proof-oriented and applicative valuations
in definitions of algorithms
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 155-162

%A John S. Conery
%A Dennis F. Kibler
%T Parallel interpretations of logic programs
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 163-170

%A Keith L. Clark
%A Steve Gregory
%T A relational language for parallel programming
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 171-178

%A R.L. Page
%A M.G. Conant
%A D.H. Grit
%T If-then-else as a concurrency inhibitor
in eager beaver evaluation of recursive programs
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 179-186

%A F. Warren Burton
%A M. Ronan Sleep
%T Executing functional: programs on a virtual tree of processors
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 187-194

%A Peter Buneman
%A Rishiyur Nikhil
%A Robert Frankel
%T A practical functional programming system for databases
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 195-201

%A V.M. Malhotra
%A V. Rajaraman
%T A data-flow language for business data processing applications
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 203-212

%A B.J. MacLennan
%T Introduction to relational programming
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 213-220

%A Geoffrey A. Frank
%T Specification of data structures for FP programs
%J Proceedings of the 1981 Symposium on
Functional Programming and Computer Architecture
%C Portsmouth, New Hampshire
%D October 1981
%K fpca fpca81
%P 221-228
%K methodology

%A David A. Turner
%T Miranda: a non-strict functional language with polymorphic types
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 1-16

%A M. L. Welcome
%A S. K. Skedzielewski
%T Dataflow graph optimization in IF1
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 17-34

%A C. Clack
%A Simon L. Peyton-Jones
%T Strict analysis - a practical approach
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 35-49

%A Guy Cousineau
%A P.L. Curien
%A M. Mauny
%T The categorical abstract machine
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 50-64

%A Patrick Bellot
%T High order programming in extended FP
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 65-80

%A S. Abramsky
%A R. Sykes
%T Seed-m: a virtual machine for applicative programming
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 81-98

%A M.J. Shute
%A P.E. Osmon
%A C.L. Hankin
%T COBWEB: a combinator reduction architecture
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 99-112

%A Philip Wadler
%T How to replace failure by a list of successes
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 113-128

%A John Hughes
%T Lazy memo-functions
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 129-146

%A David A. Plaisted
%T An architecture for fast data movement in the FFP machine
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 147-163

%A J.T. O'Donnell
%T An architecture that efficiently updates
associative aggregates in applicative programming languages
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 164-189

%A T. Johnsson
%T Lambda lifting: transforming programs to recursive equations
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 190-203

%A Saumya K. Debray
%T Optimizing almost-tail-recursive Prolog programs
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 204-219
%K transformation

%A M. Sheeran
%T Designing regular array architectures using higher order functions
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 220-237

%A M. Ercegovac
%A M. Schlag
%T nuFP: an environment for the multi-level
specification, analysis, and synthesis of hardware algorithms
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 238-255

%A J. Hughes
%T A distributed garbage collection algorithm
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 256-272

%A D.R. Brownbridge
%T Cyclic reference counting for combinator machines
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 273-288

%A D.S. Wise
%T Design for a multiprocessing heap with on-board reference counting
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 289-304

%A M.F. Young
%T A functional language and modular architecture
for scientific computing
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 305-318

%A R.S. Nikhil
%T Practical polymorphism
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 319-333

%A P. Dybjer
%T Program verification in a logical theory of constructions
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 334-349

%A V.J. Bush
%A J.R. Gurd
%T Transforming recursive programs for execution on parallel machines
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 350-367

%A L. Augustsson
%T Compiling pattern matching
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 368-381

%A B. Goldberg
%A P. Hudak
%T Serial combinators: optimal grains of parallelism
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 382-399

%A R.B. Kieburtz
%T The G machine: a fast, graph-reduction evaluator
%J Proceedings of the 1985 Symposium on
Functional Programming Languages and Computer Architecture
%C Nancy, France
%D September 1985
%E Jean-Pierre Jouannaud
%K fpca fplca fpca85 fplca85
%P 400-416