%A S.K. Abdali
%T An Abstraction Algorithm for Combinatory Logic
%J Journal of Symbolic Logic
%V 41
%N 1
%D March 1976
%P 222-224
%K lambda
%X Usage of infinite classes of combinators for abstraction
%Y jacek

%A P.S. Abrams
%T An APL Machine
%R Ph.D. Dissertation
%I Stanford University
%D February 1970
%K lambda

%A William B. Ackerman
%T Data Flow Languages
%B Proceedings of ACM 1979 National Computer Conference
%V 48
%D June 1979
%P 1087-1095

%A William B. Ackerman
%A Jack Dennis
%T VAL \- A value-oriented algorithmic language:
Preliminary Reference Manual
%R TR-218
%I MIT Laboratory for Computer Science
%C Cambridge, Massachusetts
%D June 1979

%A William B. Ackerman
%T Data Flow Languages
%J COMPUTER
%D FEB
%P 15-25

%A M. Amamiya
%A R. Hasegawa
%T Dataflow Computing and Eager and Lazy Evaluations
%J New Generation Computing
%V 2
%D 1984
%P 105-129
%Y jacek

%A K.R. Apt
%A G.D. Plotkin
%T A Cook's Tour of Contable Nondeterminism
%B Proceedings of the Eighth International Conference
on Automata, Languages and Programming
%E S. Even
%E O. Kariv
%S LNCS
%V 115
%I SPRINGER
%C Acre, Israel
%D July 1981
%P 479-493
%Y jacek

%A C.Aquilano
%A R. Babuti
%A P. Bocchetti
%A M. Martelli
%T Negation as Failure. Completeness of the Query Evaluation Process
for Horn Clause Programs with Recursive Definitions
%R Manuscript
%D 1985
%P 33
%Y jacek

%A Dr. Arvind
%A K.P. Gostelow
%A W. Plouffe
%T Programming in a Viable Data Flow Language
%R 89
%I University of California, Irvine
%D August 1976

%A Dr. Arvind
%A K.P. Gostelow
%A W. Plouffe
%T An Asynchronous Programming Language and Computing Machine
%R 114a
%I University of California, Irvine
%D December 1978

%A Dr. Arvind
%A K.P. Gostelow
%T The U-interpreter
%J COMPUTER
%V 15
%D February 1982
%P 42-49
%Y Engineering library

%A Dr. Arvind
%A J. D. Brock
%T Streams and Managers
%R Memo 217
%I Computation Structure Group,
Massachusetts Institute of Technology
%D June 1982

%A K. Aspetsberger
%T Substitution Expressions: Extracting Solutions of Non-Horn Proofs
%B EUROCAL'85 Conference
%C Linz, Austria
%D April 1985
%Y jacek

%A E. Astesiano
%A G. Costa
%T Distributive Semantics for Nondeterministic Typed Lambda Calculi
%J Theoretical Computer Science
%V 32
%D 1984
%P 121-156
%Y jacek

%A J. Backus
%T The Algebra of Functional Programs: Function level reasoning,
linear equations and extended definitions
%B Proceedings of the International Symposium
on the Formalization of Programming
%S LNCS
%V 107
%I SPRINGER
%C Peniscola, Spain
%D April 1981
%P 1-43
%K backus-fp
%Y jas

%A J. Backus
%T Function Level Programs as Mathematical Objects
%J FP&ARCH81
%D October 1981
%P 1-10
%K functional programming, algebra
%Y jas

%A S.B. Baden
%T Berkeley FP User's Manual, Rev.4.1
%R Research Report/Memorandum(?)
%I University of California, Berkeley
%D December 1982
%P 38
%K functional programming
%X How to use the Berkeley FP system, with some examples
%Y jas

%A S.B. Baden
%T Combinatory Reduction Survey
%R Research Report(?)
%I University of California, Berkeley
%D May 1983
%P 15
%K combinator
%X A good overview of progress in using combinatory reduction
as an execution strategy (looks at Turner, Hughes, Mago etc.)
%Y jas

%A J.C.M. Baeten
%A J.A. Bergstra
%A J.W. Klop
%T Priority Rewrite Systems
%R CS-R8407
%I Centre for Mathematics and Computer Science
%D May 1984
%P 52
%K functional programming
%Y jacek

%A J.W. de\ Bakker
%A J.N. Kok
%T Towards a Uniform Topological Treatment of Streams
and Functions on Streams
%R CS-R8422
%I Centre for Mathematics and Computer Science
%D July 1984?
%P 18
%K denotational semantics, topology, typed lambda calculus
%Y jas jacek

%A H.P. Barendregt
%T Normed Uniformly Reflexive Structures
%B Proceedings of the Lambda-Calculus and Computer Science Symposium,
Rome
%E Corrado Bohm
%S LNCS
%V 37
%I Springer Verlag
%D March 1975
%K lambda
%Y library?

%A H.P. Barendregt
%T The Lambda Calculus, Its Syntax and Semantics
%S Studies in Logic
%N 103
%I North-Holland
%D 1981
%K lambda
%Y jacek

%A F. Bellegarde
%T Rewriting Systems on FP Expressions that Reduce the Number
of Sequences they Yield
%J LISPFP84
%P 63-73
%X Uses algebra of programs to develop a system to transform FP
programs into more space-efficient ones.
Implemented in the Reve system (qv).
%Y jas

%A M. Bellia
%A P. Degano
%A G. Levi
%T A Functional Plus Predicate Logic Programming Language
%S LNCS
%V ??
%P 334-347
%Y jacek

%A P. Bellot
%T Systemes de Programmation Fonctionelle sans Variables
%J C.R. Acadamie Sciences Paris
%V 297
%D September 1983
%P 207-208
%K french
%X "Variable-free Functional Programming Systems" (translated by jas)
shows that FFP is URS and that FFP have the same expressive power
as FP+Apply
%Y jacek

%A P. Bellot
%T JYM 2.0 - Interprete d'un Systeme de Programmation Fonctionelle
sans Variables
%R Research Report
%I University of Paris
%D 1984
%X User manual for an FFP interpreter implemented in LeLisp.
%Y jacek

%A P. Bellot
%T Semantiques Comparees des Systemes de Programmation Fonctionelle
FP et FFP de J.W. Backus
%B Proceedings of Colloque International sur la Programmation
%C Toulouse
%D January 1984
%X Compares FP and FFP systems
%Y jacek

%A P. Bellot
%T URS et Programmation Functionelle
%R These de 3eme cycle
%I LITP
%D in preparation

%A J. Bergstra
%A J.W. Klop
%T Church-Rosser Strategies in the Lambda Calculus
%J Theoretical Computer Science
%N 9
%D 1979
%P 27-38
%K lambda reduction
%X Discusses some problems of Church-Rosser strategies
%Y jacek

%A J. Bergstra
%A J.W. Klop
%T Conditional Rewrite Rules: Confluency and Termination
%R IW 198/82
%I Stiching Mathematisch Centrum
%D 1982
%K reduction
%Y jacek

%A J. Bergstra
%A M. Broy
%A J.V. Tucker
%A M. Wirsing
%T On the Power of Algebraic Specifications
%S Lecture Notes in Computer Science
%N 118
%D 1983
%P 193-204
%Y jacek

%A K.J. Berkling
%T A Recursive Control Structure for Processing
Reduction Machine Languages
%B Microarchitecture of Computer Systems
%E R. W. Harnstein
%E Rodney Zaks
%I EUROMICRO, North-Holland
%D 1975
%P 191-200
%K reduction
%X An early description of reduction machines.
Used to implement Backus' RED langauges (qv).
%Y jas

%A K.J. Berkling
%T Reduction Languages for Reduction Machines
%B Proceedings of the IEEE International Symposium
on Computer Architecture
%D January 1975
%P 133-140
%K reduction

%A K.J. Berkling
%A E. Fehr
%T A Modification of the Lambda Calculus as a Base
for Functional Programming Languages
%J Information and Control
%V 55
%D 1982
%P 89-101
%K reduction
%Y jacek

%A W. Bibel
%T Automated Theorem Proving
%B Vieweg
%C Braunschweig, Wiesbaden
%D 1982
%X Interesting things: about induction, higher-order logic and
aspects of actual implementations
%Y jacek

%A W. Bibel
%A B. Buchberger
%T Towards a Connection Machine for Logical Inference
%J FGCS (to appear)
%D 1985
%Y jacek

%A C. Bohm
%A Mariangiola Dezani-Ciancaglini
%T A CUCH-Machine: The Automatic Treatment of Bound Variables
%J JCSS
%V 1
%N 2
%D 1972
%P 171-191
%Y jacek

%A C. Bohm
%A M. Dezani-Ciancaglini
%T Can Syntax Be Ignored During Translation?
Number Theory
%B Automata, Languages and Programming
%E M. Nivat
%C North-Holland
%D 1973
%K lambda, algebra

%A C. Bohm
%T Logic and Computers: Combinatory Logic as Extension of Elementary
Number Theory
%B Modern Logic - A Survey
%E E. Agazzi
%D 1980
%P 297-309
%K lambda, algebra
%Y jacek

%A A.B. Bondi
%A S.M. Dunn
%A B.E. Todd
%T Letter to the Editor
%J ACM SIG\&PLAN Notices
%V 15
%N 6
%D June 1980
%P 5-6
%X Graduate students from Purdue criticising Chiarini's
exponentiation functional form (qv).
%Y jas

%A G. Boudol
%A L. Kott
%T Recursion Induction Principle Revisited
%J Theoretical Computer Science
%N 22
%D 1983
%Y jacek

%A M. Broy
%T A Fixed Point Approach to Applicative Multiprogramming
%B Theoretical Foundations of Programmming Methodology
%E M. Broy
%E G. Schmidt
%I D. Reidel Publishing Company
%D 1982
%Y jacek

%A M. Broy
%T On the Herbrand-Kleene Universe for Nondeterministic Computations
%J Theoretical Computer Science
%N 36
%D 1985
%P 1-19
%Y jacek

%A K. Bruce
%A G. Longo
%T On Combinatory Algebras and Their Expansions
%J Theoretical Computer Science
%N 31
%D 1984
%Y jacek

%A M.W. Bunder
%T The Naturalness of Combinatory Logic as a Basis for Mathematics
%B To H.B. Curry: Essays on Combinatory Logic, A Calculus and Formalism
%E J.R. Hindley
%E J.P. Seldin
%I Academic Press
%C New York
%D 1980
%Y jacek jas

%A M.W. Bunder
%T Natural Numbers in Illative Combinatory Logic
%B Proceedings of the 5th Latin American Symposium on Mathematical Logic
%E X. Caicea
%S Lecture Notes in Pure and Applied Mathematics
%I Springer-Verlag
%C Bogota
%D 1981
%Y jacek jas

%A M.W. Bunder
%T Predicate Calculus and Naive Set Theory in Pure Combinatory Logic
%J Archiv fur Mathematische Logik und Grundlagenforschung
%V 21
%N 3-4
%D 1981
%P 169-177
%Y jacek jas

%A M.W. Bunder
%T Predicate Calculus of Arbitrarily High Finite Order
%J Archiv fur Mathematische Logik und Grundlagenforschung
%V 23
%N 1-2
%D 1983
%P 1-10
%Y jacek

%A M.W. Bunder
%T Category Theory Based on Combinatory Logic
%J Archiv fur Mathematische Logik und Grundlagenforschung
%V 24
%N 1-2
%D 1984
%P 1-15
%Y jacek

%A M.W. Bunder
%T Some Problems and Inadequacies in the van der Poel\-Schaap\-van der Mey Theory of Combinators
%J Proceedings of the Koninklijke Nederlandse Akademie van Wtenschappen
%V 87
%N 4
%D December 1984
%P 373-377
%Y jacek

%A P. Buneman
%A R. Nikhil
%A R.E. Frankel
%T A Practical Functional Programming System for Databases
%J FP&ARCH81
%P 195-202
%K functional programming, applications
%Y jas

%A P. Buneman
%A R.E. Frankel
%A R. Nikhil
%T An Implementation Technique for Database Query Languages
%J TODS
%V 7
%N 2
%D 1982
%P 164-186
%K functional programming, applications
%Y jas

%A W.H. Burge
%T ISWIM \- A Mixture of APL and LISP
%R RC 6967
%I IBM Corporation
%C Yorktown Heights, New York
%D January 1978
%K functional programming, applications

%A R.M. Burstall
%A J. Darlington
%T A Transformation System for Developing Recursive Programs
%J JACM
%V 24
%N 1
%D Jan 1977

%A R.M. Burstall
%A D.B. MacQueen
%A D.T. Sannella
%T HOPE: An Experimental Applicative Language
%R Internal Report CSR-62-80
%I Department of Computer Science, University of Edinburgh
%D May 1980
%P 21
%X also in Proceedings of the ACM 1980 LISP Conference, Stanford, California
%Y jas rwt zs

%A R.M. Burstall
%A J.A. Goguen
%T Algebras, Theories and Freeness: an Introduction for Computer Scientists
%B Theoretical Foundations of Programmming Methodology
%E M. Broy
%E G. Schmidt
%I D. Reidel Publishing Company
%D 1982
%P 329-348
%Y jacek

%A Rod Burstall
%T Inductively Defined Functions
%B TAPSOFT'85 Conference
%S Lecture Notes in Computer Science
%V 185
%D 1985
%P 374-387
%Y jacek

%A F.W. Burton
%T A Linear Space Translation of Functional Programs
to Turner Combinators
%J IPL
%V 14
%N 5
%D July 1983
%P 201-204
%K combinators
%Y jas

%A A. Chiarini
%T Letter to the Editor
%J SIGPLAN
%V 15
%N 3
%D March 1980
%P 8-9
%K functional programming, implementation
%X Announces an implementation of Backus' FP ... with a new PFO
(exponentiation) ... written in Pascal on an IBM 370/168
%Y jas

%A K.L. Clark
%A S. Gregory
%T PARLOG: a Parallel Logic Programming Language
%R Research Report DOC 83/5
%I Imperial College of Science and Technology
%D May 1983
%K functional programming, prolog
%X An overview of eager, lazy and parallel evaluation in a logic
programming context with some reference to functional programming
%Y jas

%A T.J.W. Clarke
%A A.C. Norman
%A W.R. Stoye
%T Speeding up the SKIM list processor with caches
%B Proceedings of the RSYMSAC
%C Wako-Shi, Tokyo
%D August 1984
%K combinators
%Y jacek

%A D. Comte
%A N. Hifde
%T Lau Multiprocessor: Microfunctional Description
and Technological Choices
%B Proceedings of the First Conference
on Parallel and Distributed Processing
%D 1979
%P 8-15
%K architecture

%A D. Cooperstock
%T Alternative Axiomatizations of Models of the Lambda Calculus
%R Technical Report, University of Toronto
%N 151
%D 1981
%K lambda
%Y jacek

%A T. Coquand
%A G. Huet
%T Constructions: A Higher Order Proof System for Mechanizing Mathematics
%B EUROCAL'85 Conference
%C Linz, Austria
%D April 1985
%Y jacek

%A G. Cousineau
%A P.-L. Curien
%A M. Mauny
%T The Categorical Abstract Machine
%R Publications du LITP, 85-8
%D January 1985
%K combinators
%Y jacek jas

%A R.J. Cunningham
%A A.J.J. Dick
%T Rewrite Systems on a Lattice of Types
%R DOC 83/7
%I Imperial College
%D September 1984
%P 22
%K combinators
%Y jacek

%A H.B. Curry
%A R. Feys
%A W. Craig
%T Combinatory Logic, Vol.I
%I North-Holland
%D 1958
%K lambda
%Y library

%A H.B. Curry
%A J.R. Hindley
%A J.P. Seldin
%T Combinatory Logic, Vol.II
%S Studies in Logic
%N 65
%I North-Holland
%D 1972
%K lambda
%Y library

%A H.B. Curry
%T Some Philosophical Aspects of Combinatory Logic
%B The Kleene Symposium
%E J.H. Barwise
%E H.J. Keisler
%E K. Kunen
%I North-Holland
%D 1980
%P 223-265
%K lambda
%X A syntactic overview of Combinatory Logic (cf. Scott)
%Y jacek jas

%A J. Darlington
%A P. Henderson
%A D.A. Turner
%T Functional Programming and its Applications (An Advanced Course),
University of Newcastle upon Tyne
%I Cambridge University Press
%D July 1981
%Y jll

%A A.L. Davis
%T A Data FLow Evaluation System Based on the Concept
of Recursive Locality
%B Proceedings of the AFIPS National Computer Conference
%V 48
%D 1979
%P 1079-1086

%A A.J.J. Dick
%T ERIL-Equational Reasoning: An Interactive Laboratory
%B EUROCAL'85 Conference
%C Linz, Austria
%D April 1985
%Y jacek

%A A. Eick
%A Elfriede Fehr
%T Inconsistencies of Pure LISP
%B Theoretical Computer Science, 6th GI-Conference
%S LNCS
%V 145
%I Springer Verlag
%D 1983
%P 101-110
%K lambda
%Y jacek jas

%A E. Engeler
%T A New Type of Models of Computation
%B Proceedings of the Sixth Symposium on Symposium on the Mathematical Foundations of Computer Science, Tatranska Lominca, Czechoslovakia
%S LNCS
%V 53
%I Springer Verlag
%D September 1977
%P 52-58
%K lambda
%Y jacek

%A E. Engeler
%T Algebras and Combinators
%J Algebra Universalis
%N 13
%D 1981
%P 398-392
%K lambda, algebra
%Y jacek

%A E. Engeler
%T Equations in Combinatory Algebras
%S LNCS
%V 164
%I Springer Verlag
%D 1984
%P 193-205
%K lambda, algebra
%Y jacek

%A F. Fages
%A G. Huet
%T Complete Sets of Unifiers and Matches in Equational Theories
%S Lecture Notes in Computer Science
%V 159
%D 1983
%P 205-220
%Y jacek

%A Francois Fages
%T Associative-Communicative Unfication
%B 7th International Conference on Automated Deduction
%S Lecture Notes in Computer Science
%V 170
%I Springer Verlag
%D 1984
%P 194-208
%Y jacek

%A Elfriede Fehr
%T The 'Simplest Functional Programming Language' is
neither Simple nor Functional
%J ACM SIG\&PLAN Notices
%V 18
%N 4
%D April 1983
%P 55-57
%Y library

%A Elfriede Fehr
%T Dokumentaion eines PROLOG-Interpreters implementiert
in der funktionalen Sprache BRL
%R Arbeitspapiere der GMD Nr. 122
%I Gesellschaft Fur Mathematik und Datenverarbeitung MBH
%D November 1984
%P 18
%K Functional Programming
%Y jacek

%A S. Fickas
%T Automatic Goal-Directed Program Transformation
%B Proceedings of the 1st Annual National Conference on Artificial Intelligence
%C Stanford, California
%D August 1980
%P 68-70
%Y jll

%A L. Fribourg
%T Oriented Equational Clauses as a Programming Language
%S Lecture Notes in Computer Science
%V 172
%I Springer Verlag
%D July 1984
%P 162-173
%Y jacek

%A L. Fribourg
%T SLOG: A Logic Programming Languages Interpreter Based on Clausal
Superposition and Rewriting
%R Manuscript
%D 1985
%P 20
%Y jacek

%A Daniel P. Friedman
%A David S. Wise
%T CONS Should not Evaluate its Arguments
%B Third International Colloqium on Automata, Languages and Programming
%C Edinburgh University Press, Scotland
%D July 1976
%P 257-284
%Y library

%A Jacek Gibert
%T An Elementary Model for Functional Programming with Infinite Objects
%R Technical Report 37
%I Monash University
%C Clayton, Australia
%D May 1983
%K functional programming, algebra
%Y jacek jas

%A Jacek Gibert
%A John Andrew Shepherd
%T From Algebra to Compiler: A Combinator-Based Implementation of Functional Programming
%B Proceedings of the Third Conference on Foundations of Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1983
%P 290-314
%K functional programming, algebra
%X Describes how to turn a denotational semantics for Backus' FP
systems into an algebraically equivalent combinatory reduction system
and suggests an architecture for such a system.
%Y jacek jas

%A Jacek Gibert
%T Functional Programming with Combinators
%B Proceedings of the Logic and Computation Conference
%E John Norbert Crossley
%E Joxan Jaffar
%V 1
%C Monash University, Australia
%D January 1984
%K functional programming, algebra

%A Jacek Gibert
%T J-Machine Users' Manual
%R Technical Report 84/10
%I University of Melbourne
%C Parkville, Australia
%D September 1984
%K functional programming
%Y jacek

%A Jacek Gibert
%T Functional Programming with Combinators
%J submitted for publication in Journal of Symbolic Computation
%D October 1984
%K functional programming, algebra

%A J.A. Goguen
%A R.M. Burstall
%T Introducing Institutions
%B Logic of Programs
%S Lecture Notes in Computer Science
%V 164
%D 1983
%P 221-256
%Y jacek

%A Joseph Goguen
%A Jose Meseguer
%T Equality, Types, and Generics for Logic Programming
%R CSLI-84-5
%I Stanford
%D March 1984
%P 30
%Y jacek

%A Joseph A. Goguen
%A J. W. Thatcher
%A Eric G. Wagner
%A Jesse B. Wright
%T Initial Algebra Semantics and Continuous Algebras
%J Journal of the ACM
%V 24
%N 1
%D January 1977
%P 68-95
%K algebra, semantics
%Y jacek jas

%A N. D. Goodman
%T A Simplification of Combinatory Logic
%J The Journal of Symbolic Logic
%V 37
%N 2
%D June 1972
%P 225-246
%Y jacek

%A Michael J. C. Gordon
%T On the Power of List Iteration
%J The Computer Journal
%V 22
%N 4
%D 1979
%P 376-379
%Y library

%A A. K. Goswami
%A L. M. Patnaik
%T Functional Programming Systems Revisited
%B Proceedings of the Fourth Conference on the Foundations of
Software Technology and Theoretical Computer Science
%C Bangalore, India
%D December 1984
%P ??

%A C. Gram
%A Elliot I. Organick
%T Characteristics of a Functional Language
%R UUCS-80-103
%I Computer Science Department, University of Utah
%D July 1980

%A J.M.. Greif
%T The SMP Pattern Matcher
%B EUROCAL'85 Conference
%C Linz, Austria
%D April 1985
%Y jacek

%A I. Guessarian
%T Algebraic Semantics
%B Lecture Notes in Computer Science
%D 1982
%P 160
%Y jacek

%A John V. Guttag
%T Notes on Using Types and Type Abstraction in Functional Programming
%B Functional Programming and its Applications (An Advanced Course),
University of Newcastle-upon-Tyne
%E John Darlington
%E Peter Henderson
%E David Turner
%I Cambridge University Press
%D July 1981
%P 73-101
%K functional programming, data abstraction
%Y jas jll

%A John V. Guttag
%A James J. Horning
%T An Introduction to the Larch Shared Language
%B Information Processing 83
%E R. E. A. Mason
%I Elsevier (North-Holland)
%D 1983
%P 809-814
%X The Larch Project is aimed at developing tools and techniques
for putting formal specifications to productive use.
This paper describes preliminary development of the "Larch shared
language", a specification language which embodies concepts common
to all programming languages.
%Y jas

%A Patrick A.V. Hall
%T Relational Algebras, Logic, and Functional Programming
%B Proceedings of Annual Meeting of SIGMOD
%C Boston, MA
%D June 1984
%P 326-333
%X a very naive paper on mixture of the three areas
%Y jacek

%A David Harel
%A Dexter Kozen
%T A Programming Language for the Inductive Sets, and Applications
%S LNCS
%V 140
%P 313-329
%X The programming language IND provides a natural query language for the
set of fixpoint queries over a relational database
%Y jacek

%A Peter Henderson
%T Functional Programming: Applications and Implementation
%I Prentice Hall
%C Englewood Cliffs, New Jersey
%D 1980
%Y jll, ballieu

%A Roger Hindley
%T Combinatory reductions and Lambda Reductions Compared
%J Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik
%V 23
%D 1977
%P 169-180
%X This paper is an informal comparison of some of the basic properties
of combinatory and lambda reductions. The parallels between the two systems
cannot be too close, because of the different structure of the two kinds of
terms, but I think it is worth seeing how close they can be pushed.
%Y jacek

%T Mathematical Logic and Computer Programming
%E C. A. R. Hoare
%E J. C. Shepherdson
%I Prentice/Hall International
%D 1984
%P 184
%X Transcripts and discussions for a series of lectures held by
the Royal Society in February 1984. Mostly high-level, philosophical
papers by Kowalski, Turner, Milner, Hoare, etc.
%Y library

%A Gerard Huet
%T Confluent Reduction: Abstract Properties and Applications to
Term Rewriting Systems
%B SFCS18
%P 30-45
%Y library

%A Gerard Huet
%A Derek C. Oppen
%T Equations and Rewrite Rules, A Survey
%B Formal Language Theory, Perspectives and Open Problems
%I Academic Press
%C New York
%D 1980
%K equations, reduction
%Y jacek

%A Tetsuo Ida
%A M. Sato
%A S. Hayashi
%A M. Hagiya
%A T. Kurokawa
%A T. Hikita
%A K. Futatsugi
%A K. Sakai
%A T. Toyama
%A T. Matsuda
%T Higher Order: Its Implications to Programming Languages
and Computational Models
%R ICOT Technical Report: TM-0029
%C Tokyo, Japan
%D October 1983
%P 50
%K combinators, functional programming
%X A summary of discussions of meetings of working group WG5 of
the FGCS Project. Attempts to clarify the notion "higher-order" as
used in various fields of computer science and mathematics.
Has a number of clear and concise overviews of functional programming
and combinatory logic.
%Y jas

%A Tetsuo Ida
%T Some FP Algebra with Currying Operation
%J Information Processing Letters
%V 17
%D December 1983
%P 259-261
%K backus-fp
%Y jacek jas

%A P. Jorrand
%T FP2: Functional Parallel Programming Based on Term Substitution
%R LIFIA-IMAG, 15
%D November 1984
%K functional programming
%Y jacek

%A Kent Karlsson
%T An Outline of the Sky Reduction Machine
%R 1981-02-03
%I Department of Computer Science, University of Goeteborg
%C Goeteborg, Sweden
%D 1982

%A S. Kasif
%A M. Kohli
%A J. Minker
%T PRISM, a Parallel Inference System for Problem Solving
%R TR-1243
%I Department of Computer Science, University of Maryland
%D January 1983
%Y jacek

%A Robert M. Keller
%T Semantics of Parallel Program Graphs
%R UUCS-77-110
%I Department of Computer Science, University of Utah
%D July 1977

%A Robert M. Keller
%T Semantics and Applications of Function Graphs
%R UUCS-80-112
%I Department of Computer Science, University of Utah
%D October 1980

%A R. B. Kieburtz
%T The G-Machine: A Fast Graph Reduction Processor
%R Technical Report 84-003
%I The Oregon Graduate Center
%D 1984

%A Steven C. Kleene
%T Introduction to Metamathematics
%I North-Holland
%D 1952
%Y library

%A Werner E. Kluge
%A Heinz Schlutter
%T Petri Net Models for the Evaluation of Applicative Programs Based on
Lambda-Expressions
%V SE-9
%N 4
%I IEEE Transactions on Software Engineering
%D July 1983
%Y jacek

%A Alexis Koster
%T An Algorithm for Translating LISP Programs into Reduction Language Programs
%B Proceedings of the Fourth International Symposium on Programming
%S LNCS
%V 83
%I Springer Verlag
%C Paris, France
%D April 1980
%P 193-206
%K abstraction
%X Describes a method for converting LISP programs with bound variables
into FP/RED systems without variables. Could this be bracket abstraction
in sheep's clothing?
%Y jas

%A C. P. J. Koymans
%T Models of the Lambda Calculus
%J Information and Control
%V 52
%D 1982
%P 306-332
%Y jacek

%A D. Kozen
%T Pebbing, Edging, and Equational Logic
%B Proceedings of the 16th Annual ACM Symposium on Theory of Computing
%C Washington, D.C.
%D April 1984
%P 428-435
%X A lower bound of O(n/logn) space is shown for two natural
proof systems for equational logic
%Y jacek

%A Peter J. Landin
%T The Mechanical Evaluation of Expressions
%J The Computer Journal
%V 6
%N 4
%D January 1964
%P 308-320
%Y library

%A Peter J. Landin
%T The Next 700 Programming Languages
%J Communications of the ACM
%V 9
%N 3
%D March 1966
%P 157-165
%Y jas

%A Pierre Lescanne
%T Computer Experiments with the \fIREVE\fP Term Rewriting System Generator
%B Conference Record of the Tenth ACM Symposium on Principles of Programming Languages
%C Austin, Texas
%D January 1983
%D January 1983
%P 99-107
%K equational theories, induction, theorem prover, verifier
%Y jas

%A Jacek Leszczylowski
%T Theory of FP Systems in Edinburgh LCF
%R Internal Report CSR-61-80
%I Department of Computer Science, University of Edinburgh
%D April 1980

%A Jacek Leszczylowski
%T Theory of FP Systems in Edinburgh LCF
%B Seventh International Colloqium on Automata, Languages and Programming,
Noodwijkerhout, Netherlands
%E J.W. de\ Bakker
%E J. van\ Leeuwen
%S LNCS
%V 85 (MAYBE??)
%I Springer Verlag
%D July 1980
%P 374-386
%Y jacek

%A Jacek Leszczylowski
%T On Proving Laws of the Algebra of FP-Systems in Edinburgh LCF
%B Proceedings of the American National Conference on Artificial Intelligence
%C Palo Alto, California
%D August 1980
%D 1980
%P 84-86

%A A. A. Letichevsky
%T Algebra of Algorithms, Data Structures and Parallel Computation
%B Information Processing
%C Paris, France
%D 1983
%P 859-864
%Y jacek

%A Th. Letschert
%T Type Inference in the Presence of Polymorphism, Overloading
and Coercions
%R PU2R5-84
%I Technical University of Darmstadt
%D April 1984
%P 31
%Y jacek

%A Th. Letschert
%T Language Implementation as Data Type Refinement
%R PU2R7-84
%I Technical University of Darmstadt
%D October 1984
%P 20
%Y jacek

%A Gary Lindstrom
%A Prakash Panagaden
%T Stream Based Execution of Logic Programs
%B Conference Proceedings of the 1984 International Symposium on Logic Programming
%C Atlantic City, New Jersey
%D February 1984
%P 168-176
%Y jacek jas jll

%A W. M. Lippe
%A F. Simon
%T Semantics for LISP without reference to an Interpreter
%B Not exactly sure?
%S LNCS
%V unknown?
%D unknown?
%Y jas

%A R. J. Lipton
%A L. Snyder
%T On the Power of Applicative Languages
%B Formal Descriptions of Programming Concepts
%E E.J. Neuhold
%I North-Holland
%D 1978
%Y library

%A G. Longo
%A S. Martini
%T Computability in Higher Types and the Universal Domain Pw
%B Lecture Notes in Computer Science
%N 166
%I Springer Verlag
%D 1984
%P 186-220
%K lambda
%Y jacek

%A G. Longo
%T Limits, Higher Type Computability and Type Free Languages
%S Lecture Notes in Computer Science
%V 176
%D 1984
%P 96-114
%Y jacek

%A G. Longo
%A E. Moggi
%T Godel Numberings, Principal Morphisms, Combinatory Algebras
%S Lecture Notes in Computer Science
%V 176
%D 1984
%P 397-406
%X A category theoretic characterization of functional completeness
%Y jacek

%A J.A. Makowsky
%T Why Horn Formulas Matter in Computer Science:
Initial Structures and Generic Examples
%B TAPSOFT'85 Conference
%S Lecture Notes in Computer Science
%V 185
%D 1985
%P 374-387
%Y jacek

%A A. Martelli
%A U. Montanari
%T Unification in Linear Time and Space: A Structured Presentation
%R Nota Interna B76-16
%I Instituto di Elaborazione Della Informazione, Pisa
%D 1976
%P 42
%Y jacek

%A John McCarthy
%T Recursive Functions of Symbol Expressions and their Computation by Machine
%J Communications of the ACM
%V 3
%N 4
%D April 1960
%P 184-194
%Y library

%A John McCarthy
%T A Basis for a Mathematical Theory of Computer Science
%B Computer Programming and Formal Systems
%E Bradford
%E Hirsching
%I North-Holland
%D 1963
%P 33-70

%A James R. McGraw
%A Stephen K. Skedzielewski
%T Streams and Iteration in VAL Additions to a Data Flow Language
%R UCRL-87414
%I Lawrence Livermore National Laboratory, University of California, Davis
%D March 1982
%O Submitted to the Third International Conference on Distributed Computing Systems

%A James R. McGraw
%A Stephen K. Skedzielewski
%A Stephen Allan
%A Dale Grit
%A Rod Oldehoeft
%A John Glauert
%A Ivan Dobes
%A Paul Hohensee
%T SISAL: Streams and Iteration in a Single-Assignment Language
%R N-146
%I Lawrence Livermore National Laboratory, University of California, Davis
%D July 1983
%O Language Reference Manual, V. 1.1

%A Albert R. Meyer
%T What is a Model of the Lambda Calculus?, Extended Version
%J Information and Control
%V 52
%N 1
%D January 1982
%K lambda
%Y jacek jas

%A B. Moller
%T An Algebraic Semantics for Busy (Data-Driven) and Lazy (Demand-Driven)
Evaluation and its Application to a Functional Language
%B Tenth International Colloqium on Automata, Languages and Programming
%E J. Diaz
%S LNCS
%V 154
%I Springer Verlag
%C Barcelona, Spain
%D July 1983
%P 513-526
%Y jas jacek

%A James H. Morris
%T Real Programming in Functional Languages
%R CSL-81-11
%I Xerox Palo Alto Research Centre
%D July 1981

%A J. Moses
%T The function of FUNCTION in LISP
%R AI Memo 199
%I MIT Artificial Intelligence Laboratory
%D June 1970

%A Morio Nagata
%A Teruo Akiyama
%A Yasutaka Fujikake
%T An Interactive Supporting System for Functional Recursive Programming
%B Proceedings of IFIP 1980
%D 1980
%P 263-268

%A M. Navarro
%A F. Orejas
%T On Equivalence of Hierarchical and Non-Hierarchical Rewraiting on Conditional Term Rewriting Systems
%B Lecture Notes in Computer Science
%N 174
%D July 1984
%P 74-85

%A A. Nerode
%A J. Remmel
%T A Survey of Lattices of R.E. Substructures
%B Manuscript
%D 1983
%P 103
%Y jacek

%A Bengt Nordstrom
%T Description of a Simple Programming Language
%R Research Paper
%I Programming Methodology Group, University of Goteborg
%C Goteborg, Sweden
%D sometime, 1982
%X Describes ASP, a simple typed functional language; gives a denotational
semantics which fits in less than a page.
%Y jas

%A J. T. O'Donnell
%T A Systolic Associative LISP Computer Architecture with
Incremental Parallel Storage Management
%R Ph.D. Dissertation
%I University of Iowa
%D 1981

%A H.-G. Oberhauser
%A R. Wilhelm
%T Flow Analysis in Combinator Implementation of Functional Programming Languages
%R SFB 124-C1
%I Universitat Saarbruecken
%D April 1984
%Y jacek

%A A. Obtulowicz
%A A. Wiweger
%T Functional Interpretation of Lambda Terms
%B Colloquia Mathematica Societatis Janos Bolyai, 26,
Mathematical Logic in Computer Science (Hungary 1978)
%C North-Holland
%D 1981
%K lambda, algebra
%Y jacek

%A Levent Orman
%T Functions in Information Systems
%J Data Base
%D August 1985
%P 10-13
%K functional databases, interactive information systems, architecture
%X A comprehensive functional approach to interactive information
systems is suggested. The pervasive use of functions in a variety
of subfields ranging from data modelling and retrieval to software
development and evaluation is summarised as a justification for
further investigation into a comprehensive functional approach to
interactive informations systems. A purely functional architecture
is described.
%Y jas

%A Dorab R. Patel
%T A System Organisation for Applicative Programming
%I MSc Thesis, University of California, Los Angeles
%D 1980
%P 101
%K architecture, functional programming
%Y jas

%A Ross Paterson
%T Reasoning about Functional Programs
%B Proceedings of the 7th Australian Computer Science Conference
%C Adelaide, Australia
%D February 1984
%P 153-161
%K proof, algebra, types
%X Investigates methods of program proof in a functional setting.
Argues that program proofs may be simplified by the right choice
of basic language constructs, a type structure, identification and
investigation of useful program operators and by the use of partial predicates.
%Y jacek jas

%A E. Paul
%T On Solving the Equality Problem in Theories Defined by Horn Clauses
%B Proceedings of EUROCAL Conference
%C Linz, Austria
%D April 1985
%Y jacek

%A J. F. Perrot
%T LISP et LAMBDA-CALCUL, Lambda-Calcul et Semantique Formelle des Languages
de Programmation
%B Actes de la 6eme ecole d'informatque theorique
%E Bernard Robinet
%I LITP-ENSTA
%D 1978
%P 277-299

%A W. L. van\ der\ Poel
%A C. E. Schaap
%A G. van\ der\ Mey
%T New Arithmetical Operators in the Theory of Combinators (Parts I,II,III)
%J Indag. Math.
%V 42
%D September 1980
%P 271-325
%X Describes a number of possible representations for numbers and arithmetic
using combinators, and proposes combinatory logic as a basis for a theory
of computation. Also gives all the gory details of an implementation in LISP.
%Y jacek jas

%A A. Poigne
%T On Semantic Algebras, Higher Order Structures
%R Research Report 156
%I Universitat Dortmund
%D 1983
%P 61
%K lambda
%Y jacek

%A A. Poigne
%A J. Voss
%T Programs over Abstract Data Types
 \- On the Implementation of Abstract Data Types
%R Research Report
%I Universitat Dortmund
%D 1983
%P 73
%K lambda
%Y jacek

%A A. Poigne
%T Higher Order Data Structures, Cartesian Closure versus Lambda-Calculus
%S Lecture Notes in Computer Science
%V 166
%I Springer Verlag
%D 1984
%P 175-185
%K lambda
%Y jacek

%A A. Poigne
%T On Specifications, Theories and Models with Higher Types
%B Proceedings of STACS
%C Paris
%D 1984
%P 56
%K lambda
%Y jacek

%A A. A. Radensky
%T An Infinite Expansion in Iterative Combinatorial Spaces and in
Functional Programming Systems
%J Comptes rendus de l'Academie bulgare des Sciences
%V 35
%N 5
%D 1982
%X Extends Backus and Williams linear expansion theorem to a general
expansion theorem which yields an infinite expansion for ANY set of
recursive equations defining a functional program.
%Y jacek

%A J.C. Reynolds
%T Three Approaches to Type Structure
%B TAPSOFT'85 Conference
%S Lecture Notes in Computer Science
%V 185
%D 1985
%P 374-387
%Y jacek

%A Bernard Robinet
%T Programmation sans Variables ou La Logique Combinatiore
a la Backus
%R Publications du LITP, 80-6
%D 1980
%K functional programming
%Y jacek jas

%A Bernard Robinet
%T Un modele logico-combinatoire des systemes de Backus
%R Publications du LITP, 80-21
%D 1980
%K functional programming
%Y jacek jas

%A Hartley Rogers
%T Theory of Recursive Functions and Effective Comptability
%I McGraw-Hill
%D 1967
%Y library

%A Masahiko Sato
%T Qute: A Prolog/Lisp Type Language for Logic Programming
%B Proceedings of the 1981 International Joint Conference on Artificial Intelligence
%C Vancouver, Canada
%D August 1981
%P 507-513
%Y jacek jas

%A Masahiko Sato
%T A Formal Theory of Symbolic Expressions
%R Research Report
%I University of Tokyo
%D July 1983
%P 18
%X Presents partial results of the follow up to the Theoretical Computer Science paper.
%Y jacek jas

%A Masahiko Sato
%T Qute: A Prolog/Lisp Type Language for Logic Programming
%R Research Report
%I University of Tokyo
%D August 1983
%P 18
%X Updates the work reported in International Joint Conference on Artificial Intelligence-81; there have been some changes
to the basic data structures of the language.
%Y jacek jas

%A M. Schonfinkel
%T Uber die Bausteine der Mathematischen Logik
%J Math. Annalen
%V 92
%D 1924
%P 305-316

%A Dana Scott
%T Lambda Calculus: Some Models, Some Philosophy
%B The Kleene Symposium
%E H. J. Barwise
%I North-Holland
%D 1980
%P 223-265
%K lambda
%X A very good semantic overview of Combinatory Logic (cf. Curry)
%Y jacek jas

%A J. H. Sickel
%T Invertibility of Logic Programs
%B 4th International Conference on Automated Deduction
%D 1979
%Y jacek

%A F. Simon
%T Lambda Calculus and Lisp
%R Bericht Nr. 8006
%I Universitat Kiel
%D 1980
%K functional programming
%Y jacek

%A D. P. Silberberg
%T An Analysis of Data Sharing Schemes in a Functional Programming
Environment
%R Research Report RJ-3030
%I IBM Research Laboratory
%C San Jose, California
%D 1981
%K functional programming, implementation
%Y jas

%A M. Ronan Sleep
%T Applicative Languages, Dataflow and Pure Combinatory Code
%B Proceedings of Compcon Spring 1980
%P 112-115
%Y jacek

%A T. A. Standish
%A D. C. Harriman
%A D. F. Kibler
%A J. M. Neighbors
%T Improving and Refining Programs by Program Manipulation
%J Proceedings of the ACM National Conference
%D 1976

%A Guy Lewis Steele
%A Gerald Jay Sussman
%T LAMBDA \- The Ultimate Imperative
%R AI Memo 353
%I MIT Artificial Intelligence Laboratory
%D March 1976

%A Guy Lewis Steele
%T LAMBDA \- The Ultimate Declarative
%R AI Memo 379
%I MIT Artificial Intelligence Laboratory
%D November 1976

%A Guy Lewis Steele
%A Gerald J. Sussman
%T Revised Report on SCHEME, a Dialect of LISP
%R AI Memo 452
%I MIT Artificial Intelligence Laboratory
%D January 1978

%A Guy Lewis Steele
%A Gerald Jay Sussman
%T The Dream of a Lifetime: A Lazy Variable Extent Mechanism
%B Proceedings of the ACM 1980 LISP Conference
%C Stanford, California
%D August 1980
%P 163-172

%A Guy Lewis Steele
%T Report on the 1980 LISP Conference
%J ACM SIGPLAN Notices
%V 17
%N 3
%D March 1982
%P 22-36
%Y jas

%A Joseph E. Stoy
%T Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
%C The MIT Press
%D 1977
%Y jas

%A H. R. Strong
%T Algebraically Generalised Recursive Function Theory
%J IBM Journal of Research and Development
%V 12
%N 11
%D November 1968
%P 465-475
%Y jas

%A P. A. Subrahmanyam
%A J. H. You
%T On Embedding Functions in Logic
%J Infomation Processing Letters
%V 19
%D July 1984
%P 41-46
%Y jas

%A Shigeo Sugimoto
%A Koichi Tabata
%A Kiyoshi Agusa
%A Yutaka Ohno
%T Concurrent LISP on a Multi-micro-processor System
%B Proceedings of the 1981 International Joint Conference on Artificial Intelligence
%C Vancouver, Canada
%D August 1981
%P 949-954
%Y jas

%A Gerald Jay Sussman
%A Guy Lewis Steele
%T SCHEME \- An Interpreter for Extended Lambda Calculus
%R AI Memo 349
%I MIT Artificial Intelligence Laboratory
%D December 1975

%A H. Tamaki
%A T. Sato
%T A Transformation System for Logic Programs which Preserves Equivalence
%R TR-018
%I ICOT
%D July 1983
%Y jj jacek

%A J. W. Thatcher
%A Eric G. Wagner
%A Jesse B. Wright
%T More on Advice on Structuring Compilers and Proving Them Correct
%J Theoretical Computer Science
%V 15
%D 1981
%K algebra, semantics
%Y jacek

%A J. Tiuryn
%T Unique Fixed Points vs Least fixed Points
%J Theoretical Computer Science
%V 12
%D 1980
%P 229-254
%K fixed points, algebra
%X it is shown that iterative algebras can be extended to partially
ordered regular algebras in such a way that the iteration becomes
a suitable least fixed point in the partial ordering.
%Y jacek

%A David S. Touretzky
%T A Comparison of Reduction in APL with Polyarity in LISP
%B Proceedings of the APL Conference
%D 1983
%K functional programming
%X When designing an applicative language, it would be especially
elegant if we could provide a way to bestow polyarity on a dyadic
function simply by specifying a model control structure for it
%Y jacek

%A P. C. Treleaven
%A I. G. Lima
%T Japan's Fifth Generation Computer Systems
%R Technical Report No.176
%C University of Newcastle Upon Tyne
%D May 1982
%P 23
%K logic programming

%A D. A. Turner
%T SASL Language Manual
%I St. Andrews University
%C Fife, Scotland
%D 1976
%K functional programming

%A D. A. Turner
%T The Future of Applicative Languages
%S LNCS
%V 123
%I Springer Verlag
%D October 1981
%P 334-348
%K functional programming

%A David A. Turner
%T Another Algorithm for Bracket Abstraction
%J Journal of Symbolic Logic
%V 44
%N 2
%D 1979
%K functional programming

%A David A. Turner
%T Implementing Applicative Languages
%R Research Report 56
%I University of Newcastle upon Tyne
%D 1981
%K functional programming

%A David A. Turner
%T Functional Programs as Executable Specifications
%B Mathematical Logic and Programming Languages
%E C. A. R. Hoare
%E J. C. Shepherdson
%D April 1984
%P 29-49
%K functional programming, MIRANDA, SASL, KRC
%O first published in Philisophical Transactions of the Royal Society,
Series A, Volume 312, 1984
%Y jas

%A J.S. Vitter
%A R.A. Simons
%T Parallel Algorithms for Unification and Other Complete Problems in P
%B Proceedings of the ACM Annual Conference, the Fifth Generation Challenge
%D October 1984
%P 75-84
%X This is an extended abstract
%Y jacek

%A Philp L. Wadler
%T "Listlessness is better than Laziness: An Algorithm that Transforms
Applicative Programs to Eliminate Intermediate Lists
%R Ph.D. Dissertation
%I Carnegie-Mellon University
%D 1983

%A Eric G. Wagner
%T Uniformly Reflexive Structures: An Axiomatic Approach to Computability
%J Information Sciences
%V 1
%D 1968

%A Eric G. Wagner
%T Functorial Hierarchies of Functional Languages
%R IBM RC 9327
%D 1982
%K functional programming, algebra
%Y jacek

%A D.S. Warren
%T The Runtime Environment for a Prolog Compiler Using a Copy Algorithm
%R Manuscript
%D March 1984
%P 46
%Y jas jacek

%A C. Weissman
%T LISP 1.5 Primer
%I Dickenson
%C Belmont, California
%D 1967
%P 135-173
%Y library

%A John H. Williams
%T Formal Representations for Recursively Defined Functional Programs
%R RJ3058
%I IBM Research Labs
%C San Jose, California
%D February 1981
%K functional programming

%A John H. Williams
%T Formal Representations for Recursively Defined Functional Programs
%B Proceedings of the International Symposium on the Formalization of Programming, Peniscola, Spain
%S LNCS
%V 107
%I Springer Verlag
%D April 1981
%P 460-470
%K functional programming
%Y jacek jas

%A John H. Williams
%A Edward L. Wimmers
%A Joseph Y. Halpern
%A Timothy C. Winkler
%T Denotational Semantics and Rewrite Rules for FP
%B Conference Record of the Twelfth ACM Symposium on Principles of Programming Languages
%C New Orleans, Louisiana
%D January 1985
%K functional programming

%A S.C. Wray
%T A New Strictness Detection Algorithm
%I Cambridge University Computer Laboratory
%D 1984
%Y jacek

%A T. Yuba
%A Y. Yamaguchi
%A T. Shimada
%T A Control Mechanism of a LISP-Based Data-Driven Machine
%J Information Processing Letters
%V 16
%N 3
%D 1983
%K lisp, functional programming, implementation
%Y jas