%T An Efficiency Comparison of Some Representations of Purely Functional Arrays
%A A. Aasa, S. Holmstrm, C. Nilsson
%I aasa87
%S Chalmers University of Technology, 1987
%K vectors, aggregate structures, updating, version trees, benchmarks, measurement
%C 

%T Concrete Syntax for Data Objects in Functional Languages
%A A. Aasa, K. Petersson, D. Synek
%I aasa88
%S In acm88, pp96-105, also Report 47, Programming Methodology Group, Chalmers University of Technology, Gteborg, 1988
%K data types
%C 

%T Dynamic Typing in a Statically Typed Language
%A M. Abadi, Luca Cardelli, B.C. Pierce, Gordon Plotkin
%I abad89
%S DEC Systems Research Center Report 47
%K operational semantics, type checking, soundness, denotational semantics, polymorphism, abstract data types, higher order pattern variables, persistent storage
%C 

%T Explicit Substitutions
%A M. Abadi, L. Cardelli, P-L. Curien, J-J. Levy
%I abad90
%S JFP 1,4, 1991 --- also Digital Systems Research Center Report 54, Palo alto, 1990
%K lambda-sigma lambda calculus, delayed substitution, de Bruijn notation, higher order type systems
%C The l-s-calculus is a refinement of the l-calculus where
substitutions are manipulated explicitly. The -l-s-calculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical l-calculus and concrete implementations.

%T A Combinatory Logic Model of Programming Languages
%A S.K. Abdali
%I abda74
%S Ph.D. Thesis, Univ. of Wisconsin
%K 
%C 

%T A Lambda-Calculus Model of Programming Languages --- I. Simple Constructs
%A S.K. Abdali
%I abda75a
%S Computer Languages 1,4, 1975
%K semantics, block structure, susbstitution, correctness
%C 

%T A Lambda-Calculus Model of Programming Languages --- II. Jumps and Procedures
%A S.K. Abdali
%I abda75b
%S Computer Languages 1,4, 1975
%K semantics, call by name, side effects, correctness, program equivalence
%C 

%T An Abstraction Algorithm for Combinatory Logic
%A S.K. Abdali
%I abda76
%S Journal of Symbolic Logic 41,1, 1976
%K 
%C 

%T Structure and Interpretation of Computer Programs
%A H. Abelson, G.J. Sussman, J. Sussman
%I abel85
%S MIT Press, 1985
%K LISP, general, SCHEME, interpreters, abstraction, modularity, state, register machines
%C 
1987 edition?

%T Unification in Applicative Programming Languages
%A H. Abramson
%I abra81
%S Dept. Comp. Sci., Univ. British Columbia, Vancouver, 1981
%K pattern matching, conditional binding, interpreter, binding, logic programming, SASL
%C 

%T SECD-M: A Virtual Machine for Applicative Multiprogramming
%A S. Abramsky
%I abra82a
%S Computer Systems Lab., Queen Mary College, London Univ., 1982
%K concurrency, laziness, interaction, non-determinism, device interfacing, interrupt driven, polling, distributed systems, scheduling, operational semantics
%C 

%T Unification-based Conditional Binding Constructs
%A H. Abramson
%I abra82b
%S TR 82-7 Dept. Comp. Sci., Univ. British Columbia, Vancouver, 1982 and Proc. First Internat. Logic Programming Conf., Marseille, 1982
%K pattern matching, conditional binding, interpreter
%C 

%T A Simple Proof Theory for Non-Deterministic Recursive Programs
%A S. Abramsky
%I abra82c
%S Queen Mary College, Computer Systems Lab., 1982
%K 
%C 

%T Unification-Based Conditional Binding Constructs
%A H. Abramson
%I abra82d
%S TR 82-7,CS, Univ of British Columbia, Canada
%K 
%C 

%T On Semantic Foundations for Applicative Multiprogramming
%A S. Abramsky
%I abra83a
%S In LNCS 154
%K concurrency, streams unbounded non-determinism, fair merge, categories, power domains, multisets, computability
%C Order-theoretic fixed-point semantics encounters serious problems with (i) non-discrete data domains, even with bounded non-determinism, and (ii) unbounded non-determinism, even with discrete domains. This paper develops an approach which appears to overcome these problems.

%T Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming
%A S. Abramsky
%I abra83b
%S In LNCS 158
%K multiprogramming, non-determinism, operational semantics, powerdomains, denotational semantics, full abstraction
%C 

%T A Prological Definition of HASL, a Purely Functional Language with Unification Based Conditional Binding Expressions
%A H. Abramson
%I abra83c
%S Dept. Comp. Sci., Univ. British Columbia, Vancoucer, 1983 and New Generation Computing 2, 1984 and in degr86 ``Functional and Logic Programming'' ed. Degroot & Lindstrom, Prentice Hall, 1986, pp73-130 and New Generation Computing 2,1,pp3-35, 1984
%K definite clause grammars, abstraction, combinators, reduction
%C The author presents a definition in Prolog of a new purely functional
language HASL (HArvey's Static Language). HASL is a descendent of Turner's SASL.

%T Secd-m: A Virtual Machine for Applicative Programming
%A S. Abramsky, R. Sykes
%I abra85a
%S FPCA'85, Nancy, LNCS 201, pp81-98
%K 
%C The machine extends Landin's secd machine to support multiple concurrent expression evaluation, non-determinism in the form of the fair merge, and a full range of input and output devices

%T Strictness Analysis and Polymorphic Invariance
%A S. Abramsky
%I abra85b
%S In LNCS 217
%K types, polymorhism
%C 

%T Strictness Analysis Based on Logical Relations
%A S. Abramsky
%I abra85c
%S Unpublished
%K 
%C 

%T Abstract Interpretation of Declarative Languages
%A S. Abramsky, C. Hankin
%I abra87
%S Ellis Horwood Ltd. ISBN 0-7458-0109-9
%K 
%C 

%T The Lazy Lambda Calculus
%A S. Abramsky
%I abra90
%S in turn90a, Research Topics in Functional Programming
%K 
%C 

%T Computational Interpretations of Linear Logic
%A S. Abramsky
%I abra90b
%S DOC 90/20, Dept. of Computing, Imperial College
%K 
%C 

%T Programming as a Mathematical Exercise
%A J.R. Abrial
%I abri85
%S In hoar85b
%K 
%C 

%T Annotations for Load Distribution
%A P. Achten
%I acht91
%S In glas91
%K 
%C 

%T High-level specification of I/O in Functional Languages
%A P.M. Achten, J.H.G. van Groningen, M.J. Plasmeijer
%I acht92
%S Proc. Glasgow Workshop on Functional programming
%K 
%C 

%T The Beauty and the Beast
%A P.M. Achten, M.J. Plasmeijer
%I acht93
%S Technical Report No.93-03, Research Institute for Declarative Systems, Department of Informatics, Faculty of Mathematics and Informatics,
University of Nijmegen
%K concurrent clean, input/output, term graph rewriting, library
%C 

%T A Structure Processing Facility for Data Flow Computers
%A W.B. Ackerman
%I acke78
%S Proc. 1978 Internat. Conf. on Parallel Processing, 1978
%K 
%C 

%T VAL - A Value-Oriented Algorithmic Language - Preliminary Reference Manual
%A W.B. Ackerman, Jack B. Dennis
%I acke79
%S MIT Laboratory for Computer Science, 1979
%K 
%C 

%T Data Flow Languages
%A W.B. Ackerman
%I acke82
%S Computer 15, 2, 1982 also AFIPS 43, 1087-1095
%K 
%C 

%T On Parallel Divide-and-Conquer
%A L. Acker, D. Miranker
%I acke91
%S Department of Computer Sciences, University of Texas at Austin, Report TR-91-27
%K 
%C 

%T Conference Record of the 1980 LISP Conference

%A ACM
%I acm80
%S Stanford University, August 1980
%K general
%C 

%T 1981 Conference on Functional Programming Languages and Computer Architecture
%A ACM
%I acm81
%S Portsmouth, New Hampshire. October, 1981
%K general
%C 

%T Conference Record of the 1982 ACM Symposium on LISP and Functional Programming
%A ACM
%I acm82
%S Pittsburgh, August 1982
%K general
%C 

%T Conference Record of the 1984 ACM Symposium on LISP and Functional Programming
%A ACM
%I acm84a
%S Austin, August 1984
%K general
%C 

%T Proceedings of the SIGPLAN '84 Symposium on Compiler Construction
%A ACM
%I acm84b
%S SIGPLAN 19,6, 1984
%K general, implementation
%C 

%T Proceedings of the 1986 ACM Conference on LISP and Functional Programming
%A ACM
%I acm86
%S MIT, Cambridge, Mass. , August 1986
%K general
%C 

%T Proceedings of the 1988 ACM Conference on LISP and Functional Programming
%A ACM
%I acm88
%S Snowbird, Utah, 1988
%K general
%C 

%T 1989 Conference on Functional Programming Languages and Computer Architecture
%A ACM
%I acm89
%S Imperial College, London. September, 1989
%K general
%C 

%T Proceedings of the 1990 ACM Conference on LISP and Functional Programming
%A ACM
%I acm90
%S Nice
%K general
%C 

%T 1991 Conference on Functional Programming Languages and Computer Architecture
%A ACM
%I acm91
%S LNCS 523, Cambridge, MA, August 1991
%K general
%C 

%T Proc. 1992 ACM Conference on LISP and Functional Programming
%A acm
%I acm92
%S ISBN 0-89791-481-3, ACM Order No. 552920
%K general conference
%C 

%T Proc. Conference on Functional Programming Languages and Computer Architecture
%A acm
%I acm93
%S ACM Press, ACM order 407930, ISBN 0-89791-595-X
%K general
%C Copenhagen, Denmark, 9-11 June 1993

%T A Theoretical Study on the Time Analysis of Programs
%A A. Adachi, T. Kasai, E. Moriya
%I adac79
%S LNCS 74
%K granularity analysis
%C An algorithm is developed that constructs time bound programs for a class of imperative programs called simple loop programs

%T Report on an Evaluation Study of Data Flow Computation
%A G.B. Adams, R.L. Brown, Denning

%I adam85
%S RIACS-TR85 2, Ames Research Group

%K 
%C 

%T Object-Oriented Programming in Scheme
%A N. Adams, J. Rees
%I adam88
%S In acm88, pp277-288
%K 
%C 

%T Incremental Polymorphism
%A S. Aditya, R.S. Nikhil
%I adit91
%S FPCA 1991, pp379-405
%K 
%C 

%T Implementing SASL Without Garbage Collection
%A J.H.P. Aerts
%I aert81
%S EUT-Report 81--WSK--05, Dept. Mathematics, Eindhoven Univ., 1981
%K 
%C 

%T A Strategy for the Run-Time Management of Fine-Grained Parallelism
%A G. Aharoni, Y. Farber, A. Barak

%I ahar91
%S In glas91
%K 
%C 

%T A Run-time Algorithm for Managing the Granularity of Parallel Functional Programs
%A G. Aharoni, D.G. Feitelson, A. Barak

%I ahar92
%S JFP 2,4, pp387-405
%K 
%C 

%T General Calculator Based on Lambda Conversion
%A A. Aiba, N. Masakasu
%I aiba81
%S Keio Mathematics Seminar Reports 6, pp1-9, 1981
%K 
%C 

%T Programing Language Semantics in a Typed Lambda Calculus
%A L. Aiello, M. Aiello
%I aiel75
%S LNCS 37
%K 
%C 

%T Towards a More Declarative Programming Style
%A L. Aiello, et al.
%I aiel78
%S In ``Formal Descriptions of Programming Concepts'' ed. E.J. Neuhold, North Holland, 0--444--85107--0, 1978

QA76.6I6
%K efficiency, structural recursion, composition of homomorphisms, PROLOG, transformations
%C 

%T An Efficient Interpreter for the Lambda Calculus
%A L. Aiello, G. Prini
%I aiel81
%S J. Comput. Syst. Sci., 23,3, 1981
%K call by need, graph reduction, LISP
%C 

%T Solving Type Equations by Graph Rewriting
%A Hassan At-Kaci
%I atk85
%S In LNCS 202
%K types, subsumption, distributive lattice of types, term rewriting
%C 

%T Integrating Data Type Inheritance into Logic Programming
%A Hassan At-Kaci, R. Nasr
%I atk85a
%S In ``Persistence and Data Types'' --- Papers for the Appin Workshop, Ed. M.~Atkinson, P.~Buneman & R.~Morrison, Persistent Programming Research Report 16, Universities of St.Andrews and Glasgow, 1985
%K inheritance
%C 

%T LOGIN: A Logic Programming Language with Built-In Inheritance
%A Hassan At-Kaci
%I atk85b
%S MCC Tech. Rep. AI--068--85, Microelectronics and Computer Technology Corp., 9430 Research Boulevard, Austin, TX 78759
%K Prolog, higher order terms, unification, types
%C 

%T Integrating Logic and Functional Programming
%A H. At-Kaci, R. Nasr
%I aitk89
%S Lisp and Symbolic Computation, 2, pp51-89
%K 
%C 

%T The WAM: A (Real) Tutorial
%A Hassan At-Kaci
%I aitk90a
%S DEC, Paris Research Labs Report 5, Jan. 1990
%K 
%C 

%T Is there a Meaning to LIFE
%A Hassan At-Kaci, Andreas Podelski
%I aitk90b
%S Private Circulation - to be published in ICLP '91?
%K 
%C 

%T Functions as Passive Constraints in LIFE
%A H. At-Kaci, A. Podelski
%I aitk91
%S DEC, Paris Research Lab. report 13, Rueil-Malmaison, France
%K 
%C Revised, November 1992
You can obtain this by ftp from gatekeeper.dec.com:
	binary
	cd .b/DEC/PRL/research-reports
	get PRL-RR-13.ps.Z

%T Towards a Meaning of LIFE
%A H. At-Kaci, A. Podelski
%I aitk93
%S Journal of Logic Programming, 16, 3&4, pp195-234
%K 
%C In article <CCL3ty.17o@cdsmail.cdc.com>, ramana@svl.cdc.com (Mr. Ramana (Indian analyst)) writes: 
> Is there a Prolog version which allows user defined functions?
One does -- LIFE (Logic, Inheritance, Functions, and Equation) -- check it out: also available in its tech report form as: PRL-RR-11.ps.Z from gatekeeper.dec.com:
	binary
	cd .b/DEC/PRL/research-reports

%T Integral Software Development through a Functional Language
%A T. Ajisaja, et al.
%I ajis82
%S In Proc. Internat. Symp. on Current Issues in Requirements Engineering Environments, Kyoto, 1982
%K 
%C 

%T A Parallel Functional Database on GRIP
%A G. Akerholt, K. Hammond, S.L. Peyton Jones
%I aker91
%S in glas91
%K 
%C 

%T Galileo: A Strongly Typed, Interactive Conceptual Language
%A A. Albano, L. Cardelli, R. Orsini
%I alba85
%S Transactions on Database Systems, 10, pp230 et seq., 1985
%K DBMS, abstract data types, structures, data models, schema, data description languages, query languages, data manipulation languaes, type hierarchy, databse semantics, integrity constraints, exception handling, environments, classes, encapsulation, modularization, transactions, failure handling, exceptions
%C 

%T Experience with an Uncommon LISP
%A C.N. Alberga, et al.
%I albe86
%S In acm86, pp39-53
%K 
%C 

%T Using Functional Programming for Hierarchical Structures in Image Processing
%A N.A. Alexandridis, N.A. Bilalis, P.D. Tsanakas
%I alex85
%S In Digital Techniques in Simulation, Communication and Control Ed. S.G. Tzafestas, pp175-181, Elsevier Science Publishers, Amsterdam, 1985
%K 
%C A quadtree is a form of picture encoding which is compact and easily handled. This paper proposes a method of storing quadtrees and operating on images by using a Functional Programming Language.

%T HEP SISAL: Parallel Functional programming
%A S.J. Allan, R.R. Oldehoeft
%I alla85
%S In Parallel MIMD Computation, ed. J.S. Kowalik, MIT Press, ISBN 0-262-11101-2, 1985
%K 
%C 

%T The Anatomy of LISP
%A J.R. Allen
%I alle78
%S McGraw-Hill, 1978
%K 
%C 

%T Don't Overlook LISP
%A J.R. Allen
%I alle79a
%S Byte 4,3, 1979
%K 
%C 

%T An Overview of LISP
%A J.R. Allen
%I alle79b
%S Byte 4,8, 1979
%K 
%C 

%T Programming Denotational Semantics
%A L. Allison
%I alli83
%S Computer J. 26, 2, 164-174
%K 
%C 

%T Programming Denotational Semantics II
%A L. Allison
%I alli83b
%S Computer J. 28, 5, 480-486
%K 
%C 

%T Some applications of continuations
%A L. Allison
%I alli88
%S Computer Journal 31(1) pp9-11
%K 
%C 

%T Two Functional Programming Techniques: Continuations, Circular Programs
%A L. Allison
%I alli87
%S TR 87/91, Dept. CS, Monash University, Clayton, Australia
%K backtracking, coroutines, non-determinism
%C 

%T Circular programs and self-referential structures
%A L. Allison
%I alli89
%S Software, 19,2, pp99-109
%K lazy, breadth first search, graphs, circular programs
%C 

%T Applications of Recursively Defined Data Structures
%A L. Allison
%I alli93
%S Australian Computer J. 25, 1 pp14-20  also TR 88/119 Dept. CS, Monash University, Clayton, Australia
%K laziness, Hamming problem, cicular lists, circular trees, search trees, permutations, N queens problem, irreducible sequences, good sequences
%C 

%T A List-Processing-Oriented Data Flow Machine Architecture
%A M. Amamiya, et al.
%I amam82
%S Proc. Nat. Comput. Conf., 1982
%K 
%C 

%T Dataflow Computing and Eager and Lazy Evaluations
%A M. Amamiya, R. Hasegawa
%I amam84
%S New Generation Computing 2,2, 1984
%K demand driven evaluation, streams, lenient cons
%C Eager and Lazy evaluations in a dataflow model are proposed. Several dataflow computation models are discussed from the viewpoint of their by-value and by-reference mechanisms, i.e. their token to data correspondence.

%T Data Flow Computing and Parallel Reduction Machine
%A M. Amamiya
%I amam88
%S Future Generation Computer Systems 4, 53-67
%K cell toke flow, multi-thread control flow, architecture
%C 

%T Functional Programming in a Parallel Environment: The Implementation of FP in MDC
%A D.K. Ameiss, T.W. Christopher
%I amei90
%S SIGPLAN, 25, 11, pp85-94, 1990
%K 
%C 

%T Issues in the Formal Specification of Programming Languages
%A E.R. Anderson, F.C. Belz
%I ande77
%S In "Formal Description of Programming Concepts" Ed. E.J. Neuhold, North Holland 1978, pp1-30
%K operational semantics vs. denotational semantics, higher order functions, representational semantics, algebraic computation bases and traces, metalanguages and their methodologies, syntax specification, modelling stores and assignment, evaluation and control semantics
%C 

%T Analysing A Restricted Class Of Functional Programs
%A S. Anderson
%I ande83
%S Declarative Programming Workshop, University College, London, 66-97
%K 
%C 

%T COBWEB-2: Structures Specification of a Wafer-Scale Supercomputer
%A P. Anderson, et al.
%I ande87
%S LNCS 258, pp51-67
%K 
%C Describes the COBWEB-2 machine with emphasis on formal spec as used in the development of the architecture

%T Strictness Analysis using Structural Operational Semantics
%A J. Andersen, C. Hankin
%I ande88
%S Aspens 88, [john88a], pp75-88
%K 
%C 

%T Efficient Compilation of Haskell Array Comprehensions
%A S. Anderson, Paul R. Hudak
%I ande89
%S Tech. Rep. YALEU/DCS/RR693
%K 
%C 

%T Compilation of Haskell Array Comprehensions for Scientific Computing
%A S. Anderson, Paul R. Hudak
%I ande90
%S pp137-149, SIGPLAN 25,6 - '90 Conference on Programming Language Design and Implementation
%K vectors, data dependency, copying, subscript analysis, efficiency, strictness, dependence graphs, write collisions, thunkless code generation, loop direction scheduling, nested loops, single threaded updates, parallelisation
%C 

%T Sparse Arrays
%A anon
%I anon93
%S FLARE project, Glasgow University
%K 
%C A Haskell Module rather than a paper. A substitute for PreludeArray oriented to sparse arrays

%T Compile-Time Evaluation and Code Generation for semantics Directed Compilers 

%A A.W. Appel
%I appe85
%S Carnegie Mellon University Technical Report CMU--CS--85--147
%K denotational semantics, annotated reduction, abstraction
%C 

%T A Standard ML Compiler
%A A.W. Appel, D.B. MacQueen
%I appe87
%S LNCS 274 p301-324. Proc 1987 FPCA
%K 
%C The authors describe the first compiler written for Standard ML in
Standard ML

%T Garbage Collection Can Be Faster Than Stack Allocation
%A A.W. Appel
%I appe87b
%S Information Processing Letters, 25,4, pp275-279
%K 
%C 

%T Profiling in the Presence of Optimization and Garbage Collection
%A A.W. Appel, B.F. Duba, D.B. MacQueen
%I appe88
%S SML Distribution, Nov. 88
%K 
%C 

%T Allocation without Locking
%A A.W. Appel
%I appe88b
%S Princeton University CS-TR-182-88
%K 
%C 

%T Vectorized Garbage Collection
%A A.W. Appel, A. Bendiksen
%I appe88c
%S Prineton University, CS-TR-169-88
%K 
%C 

%T Real-time Concurrent Garbage Collection on Stock Multiprocessors
%A A.W. Appel, J.R. Ellis, K. Li
%I appe88d
%S SIGPLAN 23,7, pp11-20 - Proceedings of '88 Conference on Programming Language Design and Implementation
%K 
%C Not real real-time, but a very cool algorithm.

%T Optimizing Closure Environment Representations
%A A.W. Appel, T.T.Y. Jim
%I appe88e
%S Princeton University, CS-TR-168-88
%K 
%C 

%T Simple Generational Garbage Collection and Fast Allocation
%A A.W. Appel
%I appe89
%S Software, 19(2), pp171-183
%K 
%C 

%T Runtime Tags Aren't Necessary
%A A.W. Appel
%I appe89b
%S Lisp and Symbolic Computation, 2, pp153-162
%K 
%C 

%T A runtime system
%A A.W. Appel
%I appe90
%S Lisp & Symbolic Computation 1990, 3, pp343-380
%K 
%C 

%T Garbage Collection
%A A.W. Appel
%I appe91
%S In lee91
%K 
%C Talks about generational g.c. (possibly others as well?)

%T Virtual Memory Primitives for User Programs
%A A.W. Appel, K. Li
%I appe91b
%S ASPLOS '91, pp. 96--107, 1991
%K 
%C In the opinion of some, OS's should provide support for user-level light-weight MMU operations. In addition to heap-exhaustion it can be used to test for stack exhaustion and updates in mutable areas.

%T Compiling with Continuations
%A A.W. Appel
%I appe92
%S CUP, ISBN 0-521-41695-7
%K CPS, optimization, conversion to CPS, beta expansion, hoisting, common subexpressions, closure conversion, register spilling, space complexity, abstract machine, code generation, performance evaluation, measurement, runtime system, parallelism
%C 

%T Operational and Denotational Semantics of Prolog
%A B.  Arbab,  D.M.  Berry
%I arba
%S J. Logic Programming 4, pp309-329
%K 
%C 

%T The Pattern-of-Calls Expansion is the Canonical Fixpoint of Recursive Definitions
%A M. Arbib, E. Manes
%I arbi82
%S JACM 29,2, 1982
%K pattern of calls, program constructs, tree induction, abstract recursion schemes
%C 

%T Implementing Functional Databases
%A G. Argo, J. Fairbairn, R.J.M. Hughes, E.J. Launchbury, P.W. Trinder
%I argo87
%S LNCS 470
%K 
%C Needs source updated. It got corrupt

%T Improving the Three Instruction Machine
%A G. Argo
%I argo89
%S FPCA, Imperial College, 1989, pp100-115
%K 
%C 

%T Lifetime Analysis
%A G. Argo
%I argo90
%S In peyt91b
%K 
%C 

%T P-TAC: A Parallel Intermediate Language
%A Z. Ariola, Arvind
%I ario89
%S FPCA, Imperial College, 1989, pp230-242
%K 
%C 

%T Erlang - an Experimental Telephony Programming Language
%A J.L. Armstrong, S.R. Virding
%I arms90
%S XIII International Switching Symposium,
May 27 - June 1, 1990
%K 
%C euagate.eua.ericsson.se 
Address:  134.138.134.16
collect the file /pub/eua/erlang/latex/erlang_doc_tar.Z

%T Implementing a Functional Language for Highly Parallel Real Time Applications
%A J.L. Armstrong, B. O. Dcker, S.R. Virding, M.C. Williams
%I arms92
%S Software Engineering for Telecommunication Switching Systems, March 30 - April 1, 1992 Florence
%K Erlang
%C 

%T Use of Prolog for Developing a New Programming Language
%A J.L. Armstrong, S.R. Virding, M C Williams
%I arms92b
%S The Practical Application of Prolog, April 1 - 3 1992, London
%K Erlang
%C 

%T Concurrent Programming in Erlang
%A J. Armstrong, M. Williams, R. Virding
%I arms93
%S Prentice Hall, ISBN 0-13-285792-8
%K 
%C Erlang is  a  concurrent functional programming  language designed
for large industrial real-time systems.  Erlang  is  dynamically typed and has  a  pattern  matching  syntax.   Functions are  defined  using recursion  equations.   Erlang  provides   explicit  concurrency,  has asynchronous message passing and is relatively free from side effects.
     Distributed   Erlang   programs    can   run   transparently    on
cross-platform  multi-vendor systems.  The language has detecting  run-time  errors  and  for dynamic  code replacement  (i.e.
changes  to code  can be made in  a running  real-time system, without stopping system).
     Erlang has real-time GC, modules and a foreign language interface. Erlang was  developed  at  the Ellemtel  Telecommunication Systems Laboratories  and is used within Ericsson for product development  and prototyping.

%T Storage administration in a virtual memory SIMULA system
%A S. Arnborg
%I arnb72
%S BIT 12, pp125-141
%K 
%C 

%T Metric interpretations of infinite trees and semantics of non-deterministic recursive programs
%A A. Arnold, M. Nivat
%I arno80
%S Theoretical Computer Science, 11, 181-205
%K 
%C 

%T Some Techniques for Recursion Removal from Recursive Functions
%A J. Arsac, Y. Kodratoff
%I arsa82
%S TOPLAS 4,2, 1982
%K computation trace, recursion removal, tail recursion
%C 

%T A Computer Capable of Exchanging Processors for Time
%A Arvind, K.P. Gostelow
%I arvi77
%S Proc. IFIP Congress
%K 
%C 

%T The (Preliminary) Id Report: An Asynchronous Programming Language and Computing Machine
%A Arvind, K.P. Gostelow, W. Plouffe
%I arvi78
%S Univ. Calif. Irvine report TR114a, 1978
%K dataflow, streams, resource management, abstract data types, parallel processing, architecture, program schemata
%C 

%T I-Structures: An Efficient Data Type for Functional Languages
%A Arvind, R.E. Thomas
%I arvi80a
%S Rep. LCS/TM-178, Lab. for Comp. Sci., MIT, 1980
%K streams, lists, array, dataflow
%C An I-Structure is a new array-like data structure which can substantially reduce data structure overhead in functional programs when data structures are generated or consumed "monotonically"

%T Streams and Managers
%A Arvind, J.D. Brock
%I arvi80b
%S In LNCS 143
%K stream functions, input/output, side effects, controlled access to shared resources, non-determinism, scheduling
%C 

%T A Multiple Processor Data Flow Machine that Supports Generalized Procedures
%A Arvind, V. Kathail
%I arvi81
%S SIGARCH 9,3, 1981
Proc. 8th Annual Symp. on Computer Architecture
%K 
%C 

%T The U-Interpreter
%A Arvind, K.P. Gostelow
%I arvi82
%S Computer 15,2, 1981
%K 
%C 

%T Sharing of Computation in Functional Language Implementations
%A Arvind, V. Kathail, K. Pingali
%I arvi84a
%S Proc. Internat. Workshop on High-Level Computer Architecture, Los Angeles, pp5.1-5.12. Also Lab. for Computer Science Technical Report, MIT, 1984 --- Also in Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K fully lazy interpreters, G Machine, architecture, mfe lemma, reduction, combinators
%C 

%T Resource Managers in Functional Programming
%A Arvind, J.D. Brock
%I arvi84b
%S Journal of Parallel and Distributed Computing 1, pp5-21
%K input output, side effects, streams, nondeterminism, scheduling
%C I/O and comms using the stream concept. Shared access to resources. By incorporating the history of communication into a stream, functional programs can be written for I/O and communication. Using the stream concept, managers may be written to control access to resources shared by several processes

%T I-Structures: Data Structures for Parallel Computing
%A Arvind, R.S. Nikhil, K.K. Pingali
%I arvi86a
%S In LNCS 279 - also MIT Computation Structures Group Memo 269, More modern version in TOPLAS 11, 4, pp598-632
%K Id, arrays, agregates, update, bulk operations, copying, reference counts, subscript analysis, strictness, shared computation, memo functions, operational semantics, vectors
%C 

%T Dataflow Architectures
%A Arvind, D.E. Culler
%I arvi86b
%S In Annual Reviews in Computer Science pp225-253, Annual Reviews Inc., Palo Alto, 1986
%K Id, arrays, agregates, update, bulk operations, parallelism, copying, reference counts, subscript analysis, strictness, shared computation, memo functions, I-structures, operational semantics
%C 

%T Executing a Program on the MIT Tagged-Token Dataflow Architecture
%A Arvind, R.S. Nikhil
%I arvi87a
%S PARLE, LNCS 259, - Also IEEE Trans on Computers 39(3):300-318, March 1990
%K parallelism
%C 

%T Two Fundamental Issues in Multiprocessing
%A Arvind, R.A. Iannucci

%I arvi87b
%S Proc. DFVLR Conf. in Parallel Processing in Science and Engineering, Bonn-Bad Godesberg, 1987
%K 
%C 

%T Future Scientific Programming on Parallel Machines
%A Arvind, K. Ekanadham
%I arvi87c
%S LNCS 279
%K 
%C 

%T Resource Requirements of Dataflow Programs
%A Arvind, D.E. Culler
%I arvi87d
%S Computational Structures Group Memo 280, Lab. for Comp. Sci., MIT
%K resource allocation, profiling parallelism
%C 

%T Programming Generality and Parallel Computers
%A Arvind, S. K. Heller, R.S. Nikhil
%I arvi88
%S Fourth International Symposium on Biological and Artificial Intelligence Systems, Trento, Italy. Also Computational Structures Group Memo 287, Lab. for CS, MIT
%K dataflow, Id, I-structures
%C 

%T Assessing the Benefits of Fine-grained Parallelism in Dataflow Programs
%A Arvind, D.E. Culler, G.K. Maa
%I arvi88b
%S Compuational Structures Group Memo 279, Lab. for CS, MIT
%K Id, Profiling
%C 

%T A Functional Approach to Picture Manipulation
%A K. Arya
%I arya82
%S Computer Graphics Forum 3,1, 1982
%K 
%C 

%T Processes in a Functional Animation System
%A K. Arya
%I arya89
%S FPCA, Imperial College, 1989, pp382-
%K operating systems, process networks, parallelism
%C 

%T Program Proving without Tears
%A E.A. Ashcroft, W. Wadge
%I ashc75
%S Report CS--75--03, Dept. Comp. Sci., Univ. of Waterloo, 1975
%K 
%C 

%T LUCID --- A Formal System for Writing and Proving Programs
%A E.A. Ashcroft, W.W. Wadge
%I ashc76
%S SIAM Journal of Computing 5,3, 1976 pp336-354
%K 
%C 

%T LUCID --- A Non-procedural Language with Iteration
%A E.A. Ashcroft, W.W. Wadge
%I ashc77
%S CACM 20,7, 1977
%K program proving, semantics, iteration, logic, implementation
%C 

%T Clauses: Scope Structures and Defining Functions in Lucid
%A E.A. Ashcroft, W.W. Wadge
%I ashc78
%S 5th POPL pp17-22
%K 
%C 

%T Some Common Misconceptions about LUCID
%A E.A. Ashcroft, W.W. Wadge
%I ashc80a
%S SIGPLAN 15,10, 1980
%K dataflow, single assignment, coroutine, efficiency
%C 

%T Structured LUCID
%A E.A. Ashcroft, W.W. Wadge
%I ashc80b
%S Theory of Computation Report 33, Dept. CS, Univ. Warwick
%K 
%C 

%T Receipt for Semantics
%A E.A. Ashcroft, W. Wadge
%I ashc82
%S TOPLAS 4,2, 1982
%K denotational semantics, operational semantics, Scott-Strachey method, LUCID, prescriptive methods
%C 

%T Lucid, The Dataflow Language
%A E.A. Ashcroft, W. Wadge
%I ashc85
%S Addison Wesley, 1985
%K 
%C 

%T Eazyflow Architecture
%A E.A. Ashcroft
%I ashc85b
%S SRI Technical Report CSL-147, SRI International, Menlo Park, CA, 1985
%K dataflow,lucid, flucid
%C This report describes a multiprocessor architectre that embodies a novel computation strategy combining demand-driven and data-driven evaluation. The architecture is directly programmed with a high-level language, Lucid

%T The Syntax and Semantics of Lucid
%A E.A. Ashcroft, W.W. Wadge
%I ashc85c
%S SRI Technical Report CSL-146, SRI International, Menlo Park, CA, 1985
%K dataflow, flucid, ferds
%C This report gives a short description of the syntax and semantics of
Lucid, followed by a discussion of operational ideas appropriate to
the language

%T An Intensional Language for Parallel Applications Programming
%A E.A. Ashcroft, A.A. Faustini, R. Jagannathan
%I ashc91
%S In szym91
%K 
%C 

%T A Categorical Understanding of Environment Machines
%A A. Asperti
%I aspe92
%S JFP 2,1, pp23-59
%K CAM
%C 

%T Reducing Types in Applicative Languages with Structured Data
%A E. Astesiano
%I aste81
%S In LNCS 107
%K self application, types, cartesian products, disjoint unions
%C 

%T An Approach to Persistent Programming
%A M.P. Atkinson, P.J. Bailey, K.J. Chisholm, P. W. Cockshott, R. Morrison
%I atki83
%S CJ 26,4 , pp360-365
%K 
%C 

%T Experimenting with the Functional Data Model
%A Malcolm P. Atkinson, K. Kulkarni
%I atki84a
%S Tech. Rep. PPR-5-83 at the Universities of St.Andrews and Edinburgh Dept. Comp. Sci. s. Also in ``Databases --- role and Structure'' Eds. P.M. Stocker, et al., CUP, 1984
%K persistent programming, PS-Algol, DAPLEX, Interactive Query Language
%C 

%T Persistent First Class Procedures are Enough
%A Malcolm P. Atkinson, R. Morrison
%I atki84b
%S In LNCS 181
%K 
%C 

%T Persistence and Data Types --- Papers for the Appin Workshop
%A Malcolm P. Atkinson, Peter Buneman, R. Morrison, Eds.
%I atki85
%S Universities of St.Andrews and Glasgow Persistent Programming Research Report 16, 1985
%K persistence, types, general
%C 

%T Types and Persistence in Database Programming Languages
%A Malcolm P. Atkinson, Peter Buneman
%I atki87
%S Computing Surveys, 19(2):105-190, June 1987
%K 
%C 

%T Mechanizing Structural Induction: Parts I and II
%A A. Aubin
%I aubi79
%S Theoretical Computer Science 9,3, 1979
%K 
%C 

%T FC Manual
%A L. Augustsson
%I augu82
%S Programming Methodology Group Memo PMG--13, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1982
%K 
%C 

%T An Applicative Algorithm for Generating a List of Paraffines
%A L. Augusteijn
%I augu83
%S Memorandum INF--83--7, Twente Univ. of Technology, Dept. Comp. Sci., Enschede, The Netherlands, 1983
%K Twentel, set abstraction, paraffines, SASL
%C 

%T A Compiler for Lazy ML
%A L. Augustsson
%I augu84a
%S In acm84a, 218-227
%K LML, pattern matching, types, scopes, transformations, lambda lifting, code generation
%C 

%T A Translation of Combinator Graphs into Machinecode
%A L. Augusteijn
%I augu84b
%S Twente Univ. of Technology, Enschede, The Netherlands, 1984
%K combinators, graphs, implementation, code generation, machine code
%C 

%T Compiling Pattern Matching
%A L. Augustsson
%I augu85a
%S FPCA'85, Nancy, LNCS 201, pp368-381 --- Also Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K implementation, equations, laziness, pattern matching, case expressions, G-machine, graph reduction, LML
%C Since the author regards pattern matching as an important feature (in LML) it should also yield efficient code. Only pattern-matchine in case expressions is described, as the author regards this as the basic pattern-matching facility

%T Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%A L. Augustsson, et al.
%I augu85b
%S Programming Methodology Group Report 17, University of Gteborg and Chalmers University of Technology, 1985
%K general, conference, reduction, sharing, parallelism, architecture, strictness analysis, cache, interactive debugging, tail recursion, efficient pattern matching, lambda lifting, supercombinators, laziness, partial evaluation, AMBER, categorical abstract machine, SKIM, director strings, functional operating systems, memo functions, garbage collection over distributed storage, NORMA, SASL
%C 

%T SMALL --- A Small Interactive Functional System
%A L. Augustsson
%I augu86
%S Programming Methodology Group Report 28, University of Gteborg and Chalmers University of Technology, 1986
%K lazy, untyped, combinators, implementation, input, abstraction, bootstrapping, benchmarks
%C 

%T Compiling Lazy Functional Languages, Part II
%A L. Augustsson
%I augu87
%S Ph.D. Thesis, Chalmers University of Technology, 1987 
%K LML, implementation, parallel evaluation, denotational semantics, transformations, case clauses, case analysis, pattern matching, strictness analysis, peephole optimisation, measurement, semantics of list comprehensions
%C --- incorporates extended versions of augu84a and augu85a

%T Garbage Collection in a Distributed Environment
%A L. Augusteijn
%I augu87b
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259
%K on the fly garbage collection, mark sweep, termination detection
%C 

%T Parallel Graph Reduction with the <nu,G>-machine
%A L. Augustsson, T. Johnsson
%I augu89a
%S FPCA, Imperial College, 1989, pp202-213 --- also Aspens 88, [john88a], pp401-412
%K 
%C a parallel reduction machine implemented on commercially available shared memory multiprocessor, that achieves real speedup compared to a fast compiled implementation of the conventional G-machine

%T Functional Non-deterministic Programming, or, How to make your own Oracle
%A L. Augustsson
%I augu89b
%S Chalmers Report?
%K 
%C 

%T Lazy ML Users Manual
%A L. Augustsson
%I augu89c
%S Dept. Of CoS, Gteborg
%K 
%C 

%T The Chalmers Lazy-ML Compiler
%A L. Augustsson, T. Johnsson
%I augu89d
%S Computer Journal, Special Issue on Lazy Functional Programming, 32(2), pp127-141
%K 
%C The authors present the principles and pragmatics of a compiler for Lazy ML, a lazy and purely functional variant of ML. The aim has been to develop an implementation that enables efficient execution on today's computers

%T Functional I/O Using System Tokens
%A L. Augustsson
%I augu89e
%S PMG Memo 72, CS, Chalmers University of Technology
%K 
%C 

%T The Interactive Lazy ML System
%A L. Augustsson
%I augu93
%S JFP 3,1, pp77-92
%K implementation, LML, reflexivity, efficiency, interpreter, G code, type safety, exceptions, interfacing compiled and interpreted code
%C 

%T On the Description of Time Varying Systems in Lambda-Calculus
%A G. Ausiello
%I ausi75
%S LNCS 37
%K 
%C 

%T Using Typed Lambda Calculus to Implement Formal Systems on a Machine
%A A. Avron, F.A. Honsell, I.A. Mason
%I avro87
%S Report ECS-LFCS-87-31, Department of Computer Science, University of Edinburgh, Edinburgh, 1987, Also CSR-237-87.
%K 
%C 

%T Lecture Notes on Functional Programming
%A T.H. Axford
%I axfo86
%S Internal Report CSR-86-13, Univ. of Birmingham
%K 
%C 

%T Partial Evaluation in a Functional Language
%A T.H. Axford
%I axfo87b
%S Functional Language Implementation Project Document 15, Univs. of Warwick and Birmingham, 1987
%K 
%C A simple language for partial evaluation is described. The abstract language is a pure functional language with normal order semantics. The concrete text representation is a medium level language with constructs that are easy to understand. Partial evaluation is done by source reduction of a graphical representation of the program

%T Reference Counting of Cyclic Graphs for Functional Programs
%A T.H. Axford
%I axfo90
%S Computer Journal,  33, 5, pp466-470 also Functional Language Implementation Project Document 6, Univs. of Warwick and Birmingham, 1987
%K 
%C A simple method of reference counting applicable to graphs of functional language programs is described. The graph contains strong and weak pointers, but only the strong pointers are counted in the reference counts and by the graph deletion algorithms. It is shown that graphs of functional programs can be constructed in such a way that the sub-graph got by removing all weak pointers is connected and acyclic. The weak pointers are used only for those recursive references which create cycles in an otherwise acyclic graph

%T An Elementary Language Construct for Parallel Programming
%A T.H. Axford
%I axfo90b
%S SIGPLAN, 27, 7, pp72-80, 1990, - Also Research Report CSR-90-4, School of Computer Science, University of Birmingham (1990)
%K divide and conquer
%C It is suggested that there may be considerable advantages in avoiding the use of loop structures in procedural languages and raw recursion in any type of language. Instead, programs could be written using a general divide-and-conquer construct which is typically just as easy to use, but allows easy parallel implementation.

%T An Abstract Model for Parallel Programming
%A T.H. Axford
%I axfo91
%S Internal Report CSR-91-5, Department of Computer Science, University of Birmingham, 1991
%K 
%C 

%T List Processing Primitives for Parallel Computation
%A T. Axford, M. Joy
%I axfo93
%S Computer Languages 19,1, pp1-17
%K balancing, divide and conquer
%C 

%T Functional language Directed Data Driven Machine
%A H. Azaria, Y. Veler
%I azar85
%S Microprocessors and Microprogramming, 16, pp127-132, 1985
%K tagged architecture, hll
%C This paper deals with a new machine which is designed to be efficient in list processing and parallel execution even on large data structures. The machine architecture is tagged Lisp based data driven with a novel
parallel control mechanism

%T Combinator Evaluation of Functional Programs with Logical Variables
%A G. Baage, G. Lindstrom
%I baag87
%S UUCS-87-027, Department of Computer Science, University of Utah, Salt Lake City, UT, 1987
%K 
%C 

%T Reduction Languages and Variable-Free Programming
%A J. Backus
%I back72
%S IBM Res. Lab. San Jose Report RJ1010, 1972
%K 
%C 

%T Programming Language Semantics and Closed Applicative Languages
%A J. Backus
%I back73
%S Proc. 1st POPL,Boston, 1973
%K interpretation, closed languages, complete languages, language realisations, constructors, reduction, recursive definitions
%C 

%T Can Programming be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs
%A J. Backus
%I back78
%S Turing Award Lecture, CACM 21, 8 pp613-641, 1978
%K algebra of programs, combining forms, functional forms, von Neumann computers and languages, state transition systems, program transformation, correctness, termination, metacomposition
%C 

%T The Algebra of Functional Programs: Functional Level Reasoning, Linear Equations and Extended Definitions
%A J. Backus
%I back81a
%S In LNCS 107, Proc. Colloqu. Formalization of Programming Concepts, Peniscola, 1981
%K variable free programming, algebra, FP style, modularity, algebra of programs, solutions of linear functional equations, linear forms, composition, linear expansion, linear approximation
%C 

%T Function Level Programs as Mathematical Objects
%A J. Backus
%I back81b
%S In acm81
%K object level programs, algebra of programs, FP style, function level programs, lifting, safe computation rules
%C 

%T Is Computer Science Based on the Wrong Fundamental Concept of `Program'? An Extended Concept
%A J. Backus
%I back81c
%S In Proc. Int. Symp. on Algorithmic Languages, ed. J.W. de Bakker, North Holland, 1981
%K von Neumann concepts, function level view, algebra of programs
%C 

%T Function-Level Computing
%A J. Backus
%I back82
%S IEEE Spectrum 19,8, 1982
%K 
%C 

%T From Function Level Semantics to Program Transformation and Optimization
%A J. Backus
%I back85
%S In LNCS 185
%K software crisis, software engineering, von Neumann programming, combining forms, function level programming, FP, object level programming, algebra of programs, recursion removal, program transformation, optimization
%C 

%T FL language manual (preliminary version)
%A J. Backus, J.H. Williams, E.L. Wimmers
%I back86
%S Tech. Rep. RJ 5339 (54809) Computer Science, IBM Almaden Research Center, Almaden CA
%K 
%C 

%T An Exploration of the {B}ird--{M}eertens Formalism
%A R.C. Backhouse
%I back88
%S Department of Mathematics and Computing Science,
University of Groningen, 1988, Computing Science Notes CS 8810
%K 
%C 

%T FL Language Manual (Parts 1 and 2)
%A J. Backus, J.H. Williams, E.L. Wimmers, P. Lucas, A. Aiken
%I back89
%S Research Report RJ 7100 (67163), IBM Almaden Research Center, San Jose, CA, 1986
%K 
%C 

%T An Introduction to the Programming Language FL
%A J. Backus, J.H. Williams, E.L. Wimmers
%I back90
%S in turn90a, Research Topics in Functional Programming
%K 
%C 

%T Combinatory Reduction Survey
%A S.B. Baden
%I bade83
%S Unpublished Memo, Univ. of Calif. at Berkeley, 1983
%K 
%C 

%T An Introduction to Functional Programming using HOPE
%A R. Bailey
%I bail84
%S Imperial College, London University, 1984
%K HOPE, general, tutorial introduction, repetitive evaluation, data structures, types, list manipulation, recursion equations, pattern matching, constructor functions, polymorphic functions, higher order functions
%C 

%T A HOPE Tutorial
%A R. Bailey
%I bail85
%S Byte 10,8, pp235-258
%K HOPE, introduction, tutorial, data types
%C 

%T FP/M Abstract Syntax Description
%A R. Bailey
%I bail85b
%S Department od CS, Imperial College
%K 
%C 

%T Data Type Definition and Abstraction in the Applicative Language G
%A P.A. Bailes,
%I bail86
%S Tech. Rep. 65, CS Dept., Univ. Queensland, St. Lucia, Australia, 1986
%K 
%C 

%T A Functional Language with Generic Abstract Data Types
%A P.A.G. Bailes
%I bail87a
%S Computer Languages, 12, 2, pp69-94, 1987
%K 
%C G is designed on the sole criterion of support for data abstraction.
Comparative analysis shows that the benefit of the author's simple
and general structure justifies the need for dynamic type checking

%T Software Development by Functional Language Prototyping
%A P.A.G. Bailes, E.J. Salzman
%I bail87b
%S Univ. of Queensland, Brisbane, CS Technical Report 79, 1987
%K 
%C An approach to software prototyping which integrates programming and language design is justified. The characteristics of a new functional language which supports a most general notion of semantic extensibility by generic data abstraction are outlined. The language is used for the application of the authors' prototyping approach in the solution of a file processing problem. This involves the synthesis of a package of relational data base structures and operations, for which a natural-language-like interface is provided

%T An Introduction to Hope
%A R. Bailey
%I bail87c
%S In eise87
%K tutorial
%C 

%T Functional Programming Using Abstract Data Types
%A R. Bailey
%I bail87d
%S In eise87
%K tutorial
%C 

%T The 1987 G Hierarchy: Data Type Mechanism
%A P.A. Bailes
%I bail88
%S Technical report No. 88, Department of CS , University of Queensland, St. Lucia, 1988
%K 
%C A hierarchy of functional languages which develops a powerful system of (dynamic) abstract data type definition and checking facilities is presented in detail

%T DM2 - A Declarative Dialect of Modula-2 for Rapid Prototyping
%A P.A. Bailes, E.J. Salzman
%I bail88b
%S Technical Report No. 91, 1988, Department of Computer Science, University of Queensland, St. Lucia, Australia
%K 
%C A functional-style variant of Modula-2, implemented by preprocessing, represents a means of providing a portable prototyping tool which, by its similarity to a well-known language family, will encourage rather than discourage programmers as yet unfamiliar with declarative programming and language

%T The 1989 G Hierarchy
%A P.A. Bailes, L. Tan
%I bail89
%S Technical Report No. 113,Department of Computer Science, University of Queensland,St. Lucia,1989
%K 
%C A hierarchy of functional languages which develops a powerful system of (dynamic) abstract data type definition and checking facilities is presented in detail

%T The Hierarchical Development of a Generic Type Mechanism for Functional Languages
%A P.A. Bailes
%I bail90
%S Computer Languages 15,1 pp1-26
%K extensible languages, language design
%C 

%T Functional Programming with Hope
%A R. Bailey
%I bail90b
%S Ellis Horwood, ISBN 0-13-338237-0
%K 
%C 

%T An Expressively-Complete Functional Language
%A P.A. Bailes, G. Ming, A. Moran
%I bail91
%S Technical Report No. 185, Department of Computer Science, University of Queensland, St.Lucia, 1991
%K semantics
%C 

%T List Processing in Real Time on a Serial Computer
%A Henry G. Baker
%I bake78a
%S CACM 21,4, pp280-294
%K real time, compacting garbage collection, virtual storage, storage allocation, cdr coding, reference counts, vectors, arrays, database management
%C 

%T Shallow Binding in LISP 1.5
%A Henry G. Baker
%I bake78b
%S CACM 21,7, 1978
%K shallow binding, rerooting, environment trees, variable access, lookup, deep binding, multiprogramming, display
%C 

%T The Incremental Garbage Collection of Processes
%A Henry G. Baker, Carl E. Hewitt
%I bake80
%S SIGPLAN 12,8, 1980
%K 
%C 

%T The Paging Behavior of the Cheney List Copying Algorithm
%A H.G. Baker
%I bake80
%S TR, University of Rochester CS
%K 
%C Copies available from the author

%T Algebraic, Operational and Denotational Semantics of the Lambda Calculus
%A C.A. Baker-Finch
%I bake84
%S Australian Computer Journal 16,3, 1984
%K denotational semantics, algebraic semantics, operational semantics
%C 

%T Unify and Conquer (Garbage, Updating, Aliasing, ...) in Functional Languages
%A H.G. Baker
%I bake90
%S In acm90, 218-226
%K 
%C 

%T Equal Rights for Functional Objects
%A H.G. Baker
%I bake90b
%S Unpublished
%K 
%C 

%T The Treadmill, real-time Garbage Collection without Motion Sickness
%A H.G. Baker
%I bake92
%S SIGPLAN 27,3, pp66-70
%K 
%C 

%T CONS should not CONS its Arguments, or a Lazy Alloc is a Smart Alloc
%A H.G. Baker
%I bake92b
%S SIGPLAN 27,3, pp24-34
%K 
%C 

%T Lively linear lisp -- 'Look Ma, No Garbage'
%A H.G. Baker
%I bake92c
%S SIGPLAN 27,8
%K 
%C 

%T Cache-Conscious Copying Collection
%A H.G. Baker
%I bake92d
%S OOPSLA 1991 Workshop on Garbage Collection in Object-Oriented Systems.
%K 
%C Available via anonymous internet ftp from cs.utexas.edu (/pub/garbage/GC91/baker.ps)

%T A Study of Sensitivity in Extreme Point Linear Fractional Functional Programming Problems
%A H.C. Bakhshi
%I bakh79
%S Journal of the Mathematical Sciences, 14/15, 1979/80
%K 
%C 

%T Implementation of a Parallel Logic Plus Functional Language
%A G.P. Balboni, et al.
%I balb89
%S In "Parallel Computers: Object Oriented, Functional & Logic"  ed. P. Treleaven, Wiley 1989
%K 
%C 

%T A Parallel Machine for Multiset Transformation and its Programming Style
%A J-P. Bantre, A. Coutant, D. LeMtayer
%I bana88
%S Future Generation Computer Systems, North Holland, 1988
%K nondeterminism
%C 

%T Chemical Reaction as a Computational Model
%A J-P. Bantre, D. LeMtayer
%I bana89
%S In davi89b
%K gamma
%C A new formalism called GAMMA is presented which relies on the chemical reaction metaphor; the only data structure is the multiset and the computation can be seen as a succession of chemical reactions consuming elements of the multiset and producing new elements according to specific rules

%T The GAMMA Model and its Discipline of Programming
%A J.-P. Banatre, D. Le Metayer
%I bana90
%S Science of Programming, 15, 1, pp 55-77
%K non-determinism, parallel
%C 

%T Prospects for Functional Programming in Software Engineering
%A J.-P. Bantre, S.B. Jones, D. Le Mtayer
%I bana91
%S ESPRIT Research Reports, Project 302, 1;
ISBN 3-540-53852-6; EUR-13016-EN, Springer Verlag, 1991
%K 
%C 

%T The Denotation of Polymorphic Objects
%A G. Baraki
%I bara88
%S Proc. Glasgow 1988 Workshop, hall89, pp1-7
%K 
%C 

%T Abstract Interpretation of Polymorphic Functions
%A G. Baraki, J. Hughes
%I bara89
%S In davi89b
%K 
%C An abstract interpretation of polymorphic functions is defined which may be used to perform strictness analysis

%T A Note on Abstract Interpretation of Polymorphic Functions
%A G. Baraki
%I bara91
%S In acm91, pp367-378
%K 
%C 

%T Static Type Checking for Languages with Parametric Types and Polymorphic Procedures
%A R. Barbuti, A. Martelli
%I barb80
%S In LNCS 83
%K type checking, polymorphism, parametric types
%C 

%T Programming Environment Generation Based on Denotational Semantics
%A R. Barbuti, et al.
%I barb83
%S In ``Theory and Practice of Software Technology'' --- Proc. Int. Seminars on SE, Capri, 1980/82, Eds. D. Ferrari, et al., ISBN 0--444--86647--7, Elsevier, 1983
%K 
%C 

%T On the Integration of Logic Programming and Functional Programming
%A R. Barbuti, M. Bellia, G. Levi, M. Martelli
%I barb84
%S In Proc. Internat. Symp. on Logic Programming, Atlantic City, NJ, pp160-166, IEEE Computer Society Press, 1984, ISBN 0-8186-0522-7
%K 
%C This paper describes a project whose goal is the integration of an algebraic functional language and a declarative language, consisting of Horn clauses and equational logic

%T LEAF: A Language that Integrates Logic Equations and Functions
%A R. Barbuti, et al.
%I barb86
%S In degr86
%K 
%C 

%T Some Extensional Term Models for Combinatory Logics and Lambda Calculi
%A H.P. Barendregt
%I bare71
%S Ph.D. Thesis, Univ. of Utrecht, 1971
%K 
%C 

%T A Characterisation of Terms of the lambda-I-Calculus Having a Normal Form
%A H.P. Barendregt
%I bare73
%S J. Symb. Logic 38 pp441-445
%K 
%C 

%T Normed Uniformly Reflexive Structures
%A H. Barendregt
%I bare75
%S LNCS 37
%K lambda calculus
%C 

%T The Lambda Calculus: Its Syntax and Semantics (Revised Edn.)
%A H.P. Barendregt
%I bare84
%S ISBN 0--444--87508--5 North Holland, 1984
%K lambda calculus, combinators, syntax, semantics, conversion, reduction, theories, models, Bhm trees, strong equivalence, reduction strategies
%C A Bible on Lambda Calculus.

%T Functional Programming and the Language TALE
%A H. Barendregt, M. van Leeuwen
%I bare85
%S Tech. Rep. 412, Mathematical Institute, Budapestlaan 6, 3508 TA Utrecht, The Netherlands, 1985
%K 
%C 

%T Introduction to Lambda Calculus
%A H.P. Barendregt
%I bare85
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K type free lambda calculus, application, abstraction, conversion, models, Church-Rosser theorem, theories, Bohm trees
%C 

%T Term Graph Rewriting
%A H.P. Barendregt, et al.
%I bare86a
%S Univ. of Nijmegen internal report nr. 87, 1986 also in Parallel Architectures and Languages Europe (PARLE), LNCS 259, pp 141-158 also SYS-C87-01, School of Information Systems, Univ. of E. Anglia,1987
%K graph reduction, semantics
%C 

%T Needed Recursion and Spine Strategies for the Lambda Calculus
%A H.P. Barendregt, et al.
%I bare86b
%S CS-R8621, Centrum voor Wiskunde en Informatica, Amsterdam
%K 
%C The authors present efficient algorithms for identifying needed sets of redexes in a term

%T Towards an Intermediate Language Based on Graph Rewriting
%A H.P. Barendregt, et al.
%I bare87
%S LNCS 259, pp159-175, Parallel Architectures and Languages Europe (PARLE), LNCS 259
%K Lean, imperative constructs, semantics, abstract machine
%C 

%T The Dutch Parallel Reduction Machine Project
%A H.P. Barendregt, M.C.J.D. van Eekelen, P.H. Hartel, L.O. Hertzberger, M.J. Plasmeijer, W.G. Vree
%I bare87b
%S Future Generations Computer Systems, 3, 4, pp261-270, 1987
%K 
%C 

%T Types in Lambda Calculi and Programming Languages
%A H.P. Barendregt, K. Hemerik
%I bare90
%S Technical Report no. 90-4, 1990, Department of Informatics, University of Nijmegen
%K 
%C 

%T Introduction to Generalized Type Systems
%A H. Barendregt
%I bare91
%S JFP, 1,2, pp125-154, 1991
%K 
%C 

%T An Unsolvable Numeral System in Lambda Calculus
%A E. Barendsen
%I bare91b
%S JFP 1,3, 1991, pp367-371
%K 
%C 

%T Self-interpretation in Lambda Calculus
%A H. Barendregt
%I bare91c
%S JFP 1,2, 229-234
%K 
%C 

%T Enumerators of Lambda Terms are Reducing
%A H. Barendregt
%I bare92
%S JFP 2,2, pp233-236
%K 
%C 

%T Representing 'undefined' in Lambda Calculus
%A H. Barendregt
%I bare92b
%S JFP 2,3, pp367-374
%K 
%C 

%T Programming Clustered Reduction Machines
%A H.P. Barendregt, M. Beemster, P.H. Hartel, L.O. Hertzberger, R.F.H. Hofman, K.G. Langendoen, L.L. Li, R. Milikowski, J.C. Mulder, W.G. Vree
%I bare92c
%S Tech. Rep. CS-92-05, Dept. of CS, Univ. of Amsterdam
%K 
%C 

%T Conventional and Uniqueness Typing in Graph Rewrite Systems
%A E. Barendsen, J.E.W. Smetsers
%I bare93
%S 
%K 
%C The full paper can be retrieved from the authors (just reply to me). An extended abstract will appear in the Proceedings of the 13th Conference on the Foundations of Software Technology & Theoretical Computer Science, 15--17 December 1993, Bombay, India. Publisher is Springer-Verlag in the LNCS series

%T Recursive Techniques in Programming
%A David W. Barron
%I barr68
%S Macdonald Computer Monographs No. 3, 1968
%K 
%C 

%T POP-11 A Practical Language for Artificial Intelligence
%A R. Barrett, A. Ramsay, A. Sloman
%I barr85
%S Ellis Horwood, Chichester, England and John Wiley N.Y.,USA
%K 
%C 

%T Derivation of a Pattern-Matching Compiler
%A G. Barrett, P. Wadler
%I barr86
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--, 1986
%K pattern matching, case evaluation, failure, constructor functions, termination
%C 

%T Shifting Garbage Collection Overhead to Compile Time
%A J.M. Barth
%I bart77
%S CACM 20,7, pp513-518
%K 
%C 

%T M-Structures: Extending a Parallel, Non-strict, Functional Language with State
%A P.S. Barth, R.S. Nikhil, Arvind
%I bart91
%S In acm91, pp538-568
%K 
%C 

%T The Implementation of PC Scheme
%A D.H. Bartley, et al.
%I bart86
%S In acm86, pp86-93
%K 
%C 

%T Compacting Garbage Collection With Ambiguous Roots
%A J.F. Bartlett
%I bart88
%S TR 88/2, Digital Equipment Corporation Western Research Laboratory
%K 
%C Excellent trick here -make newness a page property, not an address-range property

%T SCHEME->C a Portable Scheme-to-C Compiler
%A J.F. Bartlett
%I bart89
%S Research Report 89/1, Dec. Western Research Laboratory, Palo Alto, California
%K 
%C 

%T A Comparison of the Axiomatic and Functional Models of Structured Programming
%A V.R. Basili, R.E. Noonan
%I basi80
%S IEEE Transactions on SE--6,5, 1980
%K 
%C 

%T The Scheme-81 Architecture - System and Chip
%A J. Batali, et al.
%I bata82
%S Proc. MIT Conf. on Advanced Research in VLSI, Artech House, Dedham, Mass, 1982, pp69-77
%K 
%C 

%T On Intensionality and Referential Transparency
%A J. Bates
%I bate81
%S Carnegie Mellon University Technical Report CMU-CS-81-144, 1981
%K 
%C 

%T Implementation of Interlisp on the VAX
%A Raymond L. Bates, et al.
%I bate82
%S In acm82
%K LISP, UNIX, Interlisp, implementation, memory management, garbage collection, shallow binding, deep binding
%C 

%T Recent Developments in ISI-Interlisp
%A R.L. Bates, D. Dyer, M. Feber
%I bate84
%S In acm84a, pp129-139
%K 
%C 

%T Some Properties of Subbases in Weak Combinatory Logic
%A C. Batini, A. Pettorossi
%I bati75
%S Report 75-04, Istituto di Automatica, Roma
%K 
%C 

%T On Subrecursiveness in Weak Combinatory Logic
%A C. Batini, A. Pettorossi
%I bati75
%S LNCS 37
%K 
%C 

%T The Formula Controlled Logical Computer `Stanislaus'
%A F.G. Bauer
%I baue60
%S Math. Comp. 14,69, 1960
%K 
%C 

%T A Philosophy of Programming
%A F.L. Bauer
%I baue76
%S LNCS 46
%K 
%C 

%T Detailization and Lazy Evaluation, Infinite Objects and Pointer Representation
%A F.L. Bauer
%I baue79
%S In LNCS 69
%K lazy evaluation, detailization, infinite data structures, pointers, selective updating
%C 

%T Nondeterministic Concepts and Tools in Functional Programming
%A F.L. Bauer, M. Broy
%I baue81a
%S Institut fur Informatik, Technische Universitat Munchen, 1981
%K 
%C 

%T Programming in a Wide Spectrum Language: A Collection of Examples
%A F.L. Bauer, et al.
%I baue81b
%S Science of Computer Programming 1,1, pp73-114
%K types, sets, mappings, sequences, S-expressions, structures, CIP-L, interpreter, text editor, FPL
%C 

%T Connection Graphs
%A A. Bawden
%I bawd86
%S In acm86, pp258-265
%K 
%C 

%T Syntactic Closures
%A A. Bawden, J. Rees
%I bawd88
%S In acm88, pp86-95
%K 
%C 

%T Reification without Evaluation
%A A. Bawden
%I bawd88b
%S In acm88, pp342-351
%K reflexion, self reference
%C 

%T Compiling ADL/1 to Combinators
%A N.C.L. Beale
%I beal82a
%S Beale Electronic Systems Ltd. Tech. Rep. TR8202, 1982
%K 
%C 

%T CRS/1 Combinator Reduction System
%A N.C.L. Beale
%I beal82b
%S Beale Electronic Systems Ltd. Tech. Rep. 1982
%K 
%C 

%T A Partial Evaluator and its Use as a Programming Tool
%A L. Beckman, et al.
%I beck76
%S Artificial Intelligence 7,4 pp319-357
%K 
%C 

%T Memory Management
%A Y. Bekkers, J. Cohen, Eds.
%I bekk92
%S LNCS 637, Proc. International Workshop IWMM 92, St. Malo, France, 
%K garbage collection, distributed systems, parallelism, functional, object oriented, logic programming, incremental, improving locality
%C 

%T A Functional Plus Predicate Logic Programming Language
%A M. Bellia, et al.
%I bell80
%S Proc. Logic Programming Workshop, 1980
%K 
%C 

%T Applicative Communicating Processes in First Order Logic
%A M. Bellia, et al.
%I bell82a
%S In LNCS 137
%K communicating agents, lazy evaluation, demand driven, streams, rewrite rules, operational semantics, fixed point semantics
%C 

%T The Call by Name Semantics of a Clause Language with Functions
%A M. Bellia, et al.
%I bell82b
%S In Logic Programming Eds. K.L. Clark, S.A. Tarnlund, Academic Press, 1982
%K 
%C 

%T Rewriting Systems on FP Expressions that Reduce the Number of Sequences they Yield
%A Franoise Bellegarde
%I bell84a
%S In acm84a, pp63-73
%K transformation, FP, Knuth-Bendix procedure, algebra, REVE, rewriting
%C 

%T A Formal Model for Lazy Implementations of a Prolog Compatible Functional Language
%A M. Bellia, et al.
%I bell84b
%S In ``Implementations of PROLOG'' Ed. J.A. Campbell, ISBN 0--85312--675--5, Ellis Horwood, 1984
%K rewrite rules, operational semantics, laziness, abstract interpreter, unification, PROLOG
%C 

%T High Order Programming in Extended FP
%A Patrick Bellot
%I bell85a
%S FPCA'85, Nancy, LNCS 201, pp65-80
%K FP, JYM, languages
%C This work is meant to strengthen FP. The first modification is the
unification of the universe so that there is only one type of object

%T Convergent Term Rewriting Systems Can be Used for Program Transformation
%A Franoise Bellegarde
%I bell85b
%S In LNCS 217
%K FP, Transformation, term rewriting, termination
%C 

%T Streams are not Dreams
%A P. Bellot
%I bell85c
%S In cous85a, LNCS 242, pp1-20
%K stream processing, call by need, call by value, GRAAL, FP style
%C The main goal of this work is to provide an implementation of streams in a functional language using call-by-value. Stream is introduced
as a new and primitive data structure with its own primitive operators

%T GRAAL: A Functional Programming System with Uncurryfied Combinators and its Reduction Machine
%A P. Bellot
%I bell86
%S ESOP 86, LNCS 213, 1986
%K GRAAL, FP systems, call by value, architecture, tail recursion
%C This work presents a new programming language issued from Functional Programming systems of J.W. Backus.


%T Rewriting Systems on FP Expressions to reduce the Number of Sequences Yielded
%A F. Bellegarde
%I bell86b
%S Science of Computer Programming, 6, pp11-34, 1986
%K 
%C The author is concerned in transforming FP programs so as to minimize the number of intermediate sequences appearing in FP expressions that express iterative programs

%T The Relation between Logic and Functional Languages
%A M. Bellia, G. Levi
%I bell86b
%S Journal of Logic Programming, 3, 1986, pp217-236
%K 
%C 

%T A Theory of Natural Modelisation and Implementation of Functions with Variable Arity
%A P. Bellot, V. Jay
%I bell87
%S LNCS 274, FPCA Portland, 1987, pp212-233
%K 
%C The aim of this article is to provide a new theoretical framework based on combinators for the study and implementation of applicative programming languages. This formal theory can be viewed as a Computability theory where functions are defined in a natural and usable way because Curryfication is abolished

%T Algorithms for On-the-Fly Garbage Collection
%A M. Ben-Ari
%I bena84
%S TOPLAS 6,3, 333-345
%K 
%C 

%T The TRANSPOSE Machine - A Global Implementation of a Parallel Graph Reducer
%A Y. Ben-Asher, H. Seidl, R. Wilhelm
%I bena89
%S Proc. IEEE TENCON '89, Bombay
%K 
%C 

%T Simulation of Multicache Parallel Graph Reduction
%A A.J. Bennett, P.H.J. Kelly
%I benn92
%S 4th International Workshop on the Parallel Implementation of Functional Languages, Aachen
%K multiprocessor simulation
%C 

%T Church-Rosser Strategies in the Lambda Calculus
%A J. Bergstra, J.W. Klop
%I berg79
%S Theoretical Computer Science 9, pp27-38
%K 
%C 

%T Invertible Terms in the Lambda Calculus
%A J. Bergstra, J.W. Klop
%I berg80
%S Theoretical Computer Science 11, pp19-37
%K 
%C 

%T Strong Normalization and Perpetual Reductions in the Lambda Calculus
%A J.A. Bergstra, J.W. Klop
%I berg82
%S EIK J. Inf. Process. Cybern. 18,7/8, 1982
%K 
%C 

%T FP + OOP = Haskell
%A E. Berger
%I berg92
%S Technical report, U. of Texas at Austin
%K 
%C Haskell adds O-O functionality (using a concept known as type classes) to a pure functional programming framework. This paper describes and analyses accomplishments and problems.

%T Reduction Languages for Reduction Machines
%A K.J. Berkling
%I berk75
%S Proc. 2nd Annual IEEE Symp. on Computer Architecture, New York, 1975
%K 
%C 

%T Transformations in a Reduction System
%A K.J. Berkling
%I berk81
%S Symp. on Functional Languages and Computer Architecture, Chalmers, Gteborg, 1981
%K 
%C 

%T A Consistent Extension of the Lambda-Calculus as a base for Functional Programming Languages
%A K.J. Berkling, E. Fehr
%I berk82
%S Inf. Control  55,1--3, 1982 also LNCS 140, 35-47(slightly different title)
%K lambda bar operator, renaming, BRL, reduction calculus
%C 

%T A Modification of the Lambda-Calculus as a Base for Functional Programming Languages
%A K.J. Berkling, E. Fehr
%I berk82b
%S LNCS 140
%K 
%C 

%T Head Order Reduction: A Graph Reduction Scheme for the Operational Lambda Calculus
%A K. Berkling
%I berk86
%S In LNCS 279
%K head order, graph reduction, LNF-calculus, reduction in the large, environments, sharing, order of reduction
%C This paper introduces a new reduction order for the lambda calculus, called head order. The head normal form of a lambda expression corresponds closely to K.J. Greene's lazy normal form of his LNF-calculus, that is, the head order normal form will have the same variable (respectively, constant) as head and the same number of arguments as its normal form

%T A Complete Abstract Lambda Calculus Machine
%A K.J. Berkling
%I berk??
%S Referenced in hugh83
%K 
%C 

%T Scheme86: A System for Interpreting Scheme
%A A.A. Berlin, H.M. Wu
%I berl88
%S In acm88, pp116-123
%K 
%C 

%T Partial Evaluation Applied to Numerical Computation
%A A.A. Berlin
%I berl90
%S In acm90, 139-150
%K 
%C 

%T Squentialit de l'evaluation formelle des lambda-expressions
%A G. Berry
%I berr78
%S Proc. 3er Colloque Internat. sur la Programmation
%K 
%C 

%T Stable Models of Typed Lambda-Calculi
%A G. Berry
%I berr78b
%S LNCS 62, pp72-89
%K 
%C 

%T A Survey of Some Syntactic Results in the Lambda-Calculus
%A G. Berry, J.-J. Lvy
%I berr79
%S LNCS 74, pp552-566
%K 
%C 

%T On the Definition of Lambda-Calculus Models
%A G. Berry
%I berr81
%S LNCS 107, pp218-230
%K 
%C 

%T Les Espaces Informatiques, Leur Existence, leurs Rapports avec la Logique Combinatoire et les Lambda-Calculs
%A F. le Berre, L. Nolin
%I berr81
%S Revue Technique Thomson-CSF
13, 1981, pp599-633
%K 
%C 

%T Full Abstraction for Sequential Languages
%A G. Berry, et al.
%I berr82
%S Acts of the French-American Seminar on Semantics, Fontainbleau, 1982
%K 
%C 

%T The Pifl Programmer's Manual
%A D. Berry
%I berr85
%S Dept. CS, Univ. Warwick, 1985(81?)
%K 
%C 

%T The Chemical Abstract Machine
%A G. Berry, G. Boudol
%I berr90
%S POPL 90, pp81-94
%K 
%C 

%T A Semantics for ML Concurrency Primitives
%A D. Berry, R. Milner, D.N. Turner
%I berr92
%S In 19th POPL Conference pp119-129
%K threads, semantics
%C 

%T FORLISP 1: Un LISP Hyperportable
%A M. Berthod
%I bert76
%S Rapport de Rcherche 174, IRIA Laboria, Rocquencourt, 1976
%K 
%C 

%T Towards a Formal Language for Functional Specifications
%A M. Berthaud
%I bert78
%S In `Constructing Quality Software' ed. P.G. Hibbard, S.A. Schuman, North Holland, 1978
%K 
%C 

%T Design and Implementation of a Generic, Logic and Functional Programming Language
%A D. Bert, R. Echahed
%I bert86
%S ESOP 86, LNCS 213, 1986
%K LPG, modules, algebras, Horn clause logic, equality, instantiation mechanism, E-unification
%C This paper presents the broad outlines of LPG, a language designed for generic specification and programming

%T Specification and Implementation of Abstract Data Types
%A A.T. Berztiss, S. Thatte
%I berz83
%S In Advances in Computers 22, 1983
%K 
%C 

%T The Connection Machine Opportunity for the Implementation of a Concurrent Functional Language
%A C. Bettini, L. Spampinato
%I bett92
%S Future Generation Computer Systems 7, 231-245
%K lazy evaluation, massively parallel computers, parlam
%C 

%T Distributed garbage Collection using Reference Counting
%A D.I. Bevan
%I beva87a
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259
%K 
%C 

%T Overview of a Parallel Reduction Machine Project
%A D.I. Bevan, et al.
%I beva87b
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259
%K 
%C Describes ESPRIT 415 developing a distributed memory architecture for functional languages

%T Principles for the Design of a Distributed Memory Architecture for Parallel Graph Reduction
%A D.I. Bevan, G.L. Burn, R.J. Karia, J.D. Robson
%I beva89
%S The Computer Journal, 32, 5, pp461-470, 1989
%K combinators, supercombinators, evaluation transformers
%C An Evaluation Transformer says how much evaluation can be done to an argument expression in a function application, given the amount of evaluation that can be done to the application


%T DoNaLd: A Line-Drawing System Based on Definitive Principles
%A W.M. Beynon, D. Angier, T. Bissell, S. Hunt
%I beyn86
%S Research Report 86, University of Warwick, Department of Computer Science, Coventry, 1986

%K 
%C 

%T ARCA - A Notation for Displaying and Manipulating Combinatorial Diagrams
%A W.M. Beynon
%I beyn86b
%S Research Report 78, University of Warwick, Department of Computer Science, Coventry,1986
%K 
%C 

%T A Bibliography on Parallel Inference Machines
%A W. Bibel, K. Aspetsberger
%I bibe85
%S Journal of Symbolic Computation 1,1, 1985
%K architecture, bibliography, parallelism, hardware, symbolic computation
%C 

%T On Transformations of Programs
%A R. S. Bird
%I bird74
%S Journal of Computer and System Sciences 8,1, 1974
%K transformations, complexity, semantics, speed up theorem
%C 

%T On the Tabulation of Recursive Programs, Part I
%A Richard S. Bird
%I bird77a
%S University of Reading Dept. Comp. Sci., University of Reading Dept. Comp. Sci. Report RCS 73, 1977
%K tabulation, recursion elimination, non-determinism, pattern matching, language recognition, memo functions
%C 

%T Improving Programs by the Introduction of Recursion
%A Richard S. Bird
%I bird77b
%S CACM 20,11, 1977
%K program transformation, optimization, recursion elimination, pattern matching, computational induction
%C 

%T Notes on Recursion Elimination
%A Richard S. Bird
%I bird77c
%S CACM 20,6, 1977
%K 
%C 

%T On the Tabulation of Recursive Programs, Part II
%A Richard S. Bird
%I bird77d
%S University of Reading Dept. Comp. Sci., University of Reading Dept. Comp. Sci. Report RCS 75, 1977
%K tabulation, recursion elimination, non-determinism, pattern matching, language recognition, memo functions
%C 

%T Tabulation Techniques for Recursive Programs
%A Richard S. Bird
%I bird80
%S Computing Surveys 12,4, pp403-417
%K redundancy, tabulation, recursion elimination, transformation, pebble games, dynamic programming, dependency graphs, memo functions, efficiency, Fibonnaci series, overtabulation
%C 

%T Using Circular Programs to Eliminate Multiple Traversals of Data
%A Richard S. Bird
%I bird84a
%S Oxford Univ. Prog. Res. Group, 1984, also Acta Informatica 21, 3, pp239-250
%K 
%C This paper describes a technique for transforming functional programs that repeatedly traverse a data structure into more efficient alternatives that do not. The transformation makes essential use of lazy evaluation and local recursion to build a circular program

%T The Promotion and Accumulation Strategies in Transformational Programming
%A Richard S. Bird
%I bird84b
%S TOPLAS 6,4, 1984
%K algorithms, verification, correctness
%C 

%T Transformational Programming and the Paragraph Problem
%A R.S. Bird
%I bird86
%S Science of Computer Programming, 6 pp159-189
%K 
%C 

%T The Alpha-Beta Algorithm: An Exercise in Program Transformation
%A Richard S. Bird, R.J.M. Hughes
%I bird87a
%S Information Processing Letters 24,1, 1987
%K alpha beta pruning, minimaxing, transformation
%C 

%T An Introduction to the Theory of Lists
%A R.S. Bird
%I bird87b
%S Oxford Univ Prog. Research Group Monograph 56 -- also  --In M. Broy (Ed.) "Logic of Programming and Calculi of Discrete Design", Springer, pp3-42
%K 
%C 

%T A Formal Development of an Efficient Supercombinator Compiler
%A R.S. Bird
%I bird87c
%S Science of Computer Programming 8, 1987, pp113--137
%K 
%C 

%T Lectures on Constructive Functional Programming
%A R.S. Bird
%I bird88
%S Oxford Univ Prog. Research Group Monograph 69
%K 
%C 

%T Introduction to Functional Programming
%A R.S. Bird, P.L. Wadler
%I bird88b
%S Prentice Hall, 1988
%K Miranda
%C 

%T Algebraic Identities for Program Calculation
%A R.S. Bird
%I bird89
%S Computer Journal, Special Issue on Lazy Functional Programming, 32(2), pp122-126
%K skeletons
%C To calculate a program means to derive it from a suitable specification by a process of equational reasoning. The author describes a number of basic algebraic identities that turn out to be extremely useful in this task

%T Formal Derivation of a Pattern Matching Algorithm
%A R.S. Bird, J. Gibbons, G. Jones
%I bird89b
%S Science of Computer Programming, 12, 1989, pp93--104
%K 
%C 

%T Lectures on Constructive Functional Programming
%A R.S. Bird
%I bird89c
%S In "Constructive Methods in Computing Science",
NATO ASI Series, F55, M. Broy( Ed.), 151--216, Springer--Verlag, 1989
%K 
%C 

%T A Calculus of Functions for Program Derivation
%A R.S. Bird
%I bird90
%S in turn90a, Research Topics in Functional Programming
%K 
%C 

%T The Minout Problem
%A R.S. Bird
%I bird91
%S Functional Pearls, J. Functional Programming, 1(1), pp121-4
%K 
%C 

%T On Removing Duplicates
%A R. Bird
%I bird91b
%S JFP 1,2, pp235-243
%K 
%C 

%T Two Greedy Algorithms
%A R.S. Bird
%I bird92
%S JFP 2,2, pp237-244
%K decimal-binary conversion, TeX, replacing blanks by tabs
%C 

%T Unravelling Greedy Algorithms
%A R.S. Bird
%I bird92b
%S JFP 2,3, pp375-385
%K 
%C 

%T The Last Tail
%A R.S. Bird
%I bird93
%S JFP 3,1, pp117-122
%K 
%C 

%T Computer Systems with a Very Large Address Space and Garbage Collection
%A P.B. Bishop
%I bish75
%S PhD Thesis, Massachussets Institute of Technology Laboratory of Computer Science Technical Report LCS TR 178, 1975
%K 
%C 

%T A Compositional Approach to Time Analysis of First Order Lazy Functional Programs
%A B. Bjerner, S. Holmstrm
%I bjer89
%S FPCA, Imperial College 1989, pp157-165
%K profiling, complexity, time analysis
%C A method is presented for computing the number of steps needed to compute a lazy first order functional program (to an approximation of its value).

%T Time Complexity of Programs in Type Theory
%A B. Bjerner
%I bjer89b
%S Ph.D. Thesis, Chalmers University of Technology
%K granularity analysis
%C 

%T Partial Evaluation and Mixed Computation
%A D. Bjrner, A.P. Ershov and N.D. Jones
%I bjor88
%S North-Holland
Amsterdam, 1988
%K 
%C 

%T Efficient Calculation of Prime Implicants of a Logical Function --- Prototyping Example in a Functional Language
%A G.A. Blaaw, A.J.W. Duijvestijn
%I blaa85
%S Twente Univ. of Technology Report, 1985
%K minimisation, prototyping, APLDL
%C 

%T Variations on Strictness Analysis
%A A. Bloss, Paul R. Hudak
%I blos86
%S In acm86, pp132-142
%K strictness analysis, path analysis, forward analysis, backward analysis, first order strictness
%C 

%T Path Semantics
%A A. Bloss, Paul R. Hudak
%I blos87
%S LNCS 298, pp476-489
Proc. 3rd Workshop on Mathematical Foundations of Programming Language Semantics, Tulane Univ. April 1987
%K non-standard semantics, order of evaluation, optimisation, first order, lazy evaluation, strictness analysis, process scheduling, thunks, graph reduction
%C 

%T Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages
%A A. Bloss
%I blos88a
%S Ph. D. Thesis, Yale University 1988
%K 
%C 

%T Code Optimizations for Lazy Evaluation
%A A. Bloss, P. Hudak, J. Young
%I blos88b
%S Aspens 88, [john88a], pp283-300 - Also Lisp and Symbolic Computation 1, pp147-164
%K 
%C 

%T An Optimizing Compiler for a Modern Functional Language
%A A. Bloss, P. Hudak, J. Young
%I blos88c
%S Comp J., 31(6), pp152-161
%K alfl, lisp, orbit, strictness analysis, benchmarks
%C The goal of the project described in this paper has been to design an
optimising compiler that produces fast code for functional languages on conventional sequential and parallel machines.

%T Update Analysis and the Efficient Implementation of Functional Aggregates
%A A. Bloss
%I blos89a
%S FPCA89, Imperial College, London, 1989, pp26-38
%K arrays, path analysis, copying, updating, single threads, targeting, trailers, destructive updates, occurrence paths, benchmarks, measurement, complexity
%C In this paper a technique is introduced for efficiently implementaing incrementally updatable qggregates in sequential first-order lazy functional languages. The technique is based on path analysis, a compile-time analysis that yields information about order of evaluation of expressions.

%T Path Analysis and the Optimization of Non-Strict Functional Languages
%A A. Bloss
%I blos89b
%S Ph.D. Yale Univ. YALEU/DCS/RR-704
%K 
%C 

%T An Optimising Compiler for a Modern Functional Language
%A A. Bloss, P. Hudak, J. Young
%I blos89c
%S Computer Journal, Special Issue on Lazy Functional Programming, 32(2), pp152161
%K 
%C 

%T Type Inference and Type Classes
%A S. Blott
%I blot89
%S In davi89b
%K overloading, validity, assumption sets, syntactic soundness, syntactic completeness, principal typings, implementation
%C 

%T A Model and Stack Implementation of Multiple Environments
%A D.G. Bobrow, Ben Wegbeit
%I bobr73
%S CACM 16,10, 1973
%K control structures, environments, stack allocation, dendrarchy, retention, dynamic storage allocation, access environments, FUNARG problem, multitasking, coroutines, backtracking, label-valued variables, first class citizenship, functional arguments, multiprocessor systems, extensible control structures, cactus stacks, spaghetti stacks
%C 

%T Compact Encodings of List Structure
%A D.G. Bobrow, D.W. Clark
%I bobr79a
%S TOPLAS, 1,2, pp266-286
%K 
%C Good words on CDR-coding

%T Managing Reentrant Structures Using Reference Counts
%A D.G. Bobrow
%I bobr80
%S TOPLAS 2,3, pp269-273
%K 
%C 

%T Common LISP Object System Specification
%A D.G. Bobrow, L.G. DeMichiel, R.P. Gabriel, S.E. Keene, G. Kiczales, D.A. Moon
%I bobr88
%S X3J13 Document 88-002R, SIGPLAN, 23, 1988
%K 
%C 

%T The Common Lisp Object System Metaobject Kernel: A Status Report
%A D.G. Bobrow
%I bobr88b
%S In acm88, pp309-315
%K 
%C 

%T Partial Polymorphic Type Inference is Undecidable
%A H-J. Boehm
%I boeh85
%S Proc 26th Symp. on Foundations of Computer Science, IEEE pp339-345
%K 
%C 

%T Exact Real Arithmetic: A Case Study of Higher Order Programming
%A H-J. Boehm, et al.
%I boeh86
%S In acm86, pp162-173
%K 
%C 

%T Exact Real Arithmetic: Formulating Real Numbers as Functions
%A H-J. Boehm, R. Cartwright
%I boeh90
%S in turn90a, Research Topics in Functional Programming
%K lazy evaluation, constructive reals, radix notation, functional representation, incremental evaluation, abstract data types, parallel or, continued fractions
%C 

%T Hardware and Operating System Support for Conservative Garbage Collection
%A H-J. Boehm
%I boeh91
%S International Workshop on Memory Management, Palo-Alto, IEEE press, pp61-67
%K 
%C 

%T Turtle Graphics in Miranda
%A E. Bogdan
%I bogd93
%S ?
%K 
%C Eniko Bogdan <eniko@csd4.csd.uwm.edu>
The Turtle Graphics program is written in Miranda version 2.009 (Nov. 1989), a pure functional language.  Turtle Graphics is an interactive program and it prompts for turtle commands.  Turtle commands help to produce drawings which are displayed on a visual interface. Turtle Graphics consists on moving the turtle on the screen, producing geometric designs. A geometric design is a sequence of connected lines, whose symmetry and regularity provokes the user investigate deeper in geometry and number theory.

%T Introduction to the CUCH
%A C. Bhm, W. Gross
%I bhm66a
%S In ``Automata Theory'' --- Ed. E.R. Cainiello --- Academic Press 1966
%K CUCH, Curry, Church, combinators, completeness, morphology, reduction rules
%C 

%T The CUCH as a formal Description Language
%A C. Bhm
%I bhm66b
%S In stee71
%K CUCH, Curry, Church, combinators, reflexivity, self describing language, operational semantics
%C 

%T A CUCH-Machine: The Automatic Treatment of Bound Variables
%A C. Bhm, M. Dezani-Ciancaglini
%I bohm72
%S International Journal of Computer and Information Sciences, 1, 1972, pp171-291
%K 
%C 

%T Combinatorial Problems, Combinator Equations and Normal Forms
%A C. Bhm, M. Dezani-Ciancaglini
%I bohm74
%S LNCS 14, 1974, pp185-199
%K 
%C 

%T Lambda-Calculus and Computer Science Theory
%A C. Bhm
%I bhm75
%S In LNCS 37
%K general, theory, conference
%C 

%T lambda-Terms as Total or Partial Functions on Normal Forms
%A C. Bhm, M. Dezani-Ciancaglini
%I bohm75b
%S In lambda-Calculus and Computer Science Theory
G. Goos and J. Hartmanis, pp96-121, Springer-Verlag, Berlin, 1975
%K 
%C 

%T Termination Tests Inside Lambda-Calculus
%A C. Bhm, et al.
%I bhm77
%S In LNCS 52, Springer-Verlag, 1977
%K normal forms, termination, access paths
%C 

%T An Abstract Approach to (Hereditary) Finite Sequences of Combinators
%A C. Bhm
%I bhm80
%S In hind80
%K combinators, finite sequences, hereditary finite sequences
%C 

%T Minimal Forms in Lambda-Calculus Computations
%A C. Bhm, S. Micali
%I bohm80b
%S Journal of Symbolic Logic, 45, 1980, pp165-171
%K 
%C 

%T Logic and Computers: Logic as an extension of Elementary Number Theory
%A C. Bhm
%I bhm81
%S In ``Modern Logic - A Survey'' Ed. E. Agazzi, Reidel, 1981
%K 
%C 

%T Combinatory Foundation of Functional Programming
%A C. Bhm

%I bohm82
%S In acm 82, pp29-36
%K FP, combinators, algebra
%C 

%T Efficient Dataflow Code Generation for SISAL
%A A.P.W. Bohm, J. Sargeant
%I bohm85
%S UMCS-85-10-2, Department of Computer Science, University of Manchester, Manchester, 1985
%K data flow, optimisation
%C 

%T Reducing recursion to Iteration by Algebraic Extension
%A C. Bhm
%I bohm86
%S ESOP 86, pp111-118, LNCS 213, 1986
%K 
%C 

%T The Heterogeneous Multi-Ring Dataflow Machine Simulator
%A A.P.W. Bhm, Y.M. Teo
%I bohm89
%S Technical Report UMCS-89-3-1, Department of Computer Science, University of Manchester, 1989
%K 
%C This report serves as the defining document for the simulator MR

%T FIT-PROLOG: A Functional/Relational Language Comparison
%A H. Boley
%I bole83
%S SEKI-83-14, Fachbereich Informatik, Universitt Kaiserslautern, Kaiserslautern, 1983
%K 
%C 

%T LISP: eine Funktionale Einfhrung
%A H. Boley
%I bole84
%S SEKI-84-05, Fachbereich Informatik, Universitt Kaiserslautern, Kaiserslautern, 1984
%K 
%C 

%T LISP: eine FunktionaLISPLOG: Momentaufnahmen einer LISP/PROLOG-Vereinheitlichungle Einfhrung
%A H. Boley, F. Kammermeier
%I bole85
%S SEKI-85-03, Fachbereich Informatik, Universitt Kaiserslautern, Kaiserslautern, 1985
%K 
%C 

%T RELFUN: A Relational/Functional Integration with Valued Clauses
%A H. Boley
%I bole86
%S SEKI-86-04, Fachbereich Informatik, Universitt Kaiserslautern, Kaiserslautern, 1986
%K 
%C 

%T Iconic-Declarative Programming and Adaptation Rules
%A H. Boley
%I bole88
%S SEKI-88-04, Fachbereich Informatik, Universitt Kaiserslautern, Kaiserslautern, 1988
%K 
%C To obtain optimum intelligibility, declarative programs should be iconic,
i.e. directly model their domain, as illustrated imperatively by
object-oriented languages. An advanced iconic-declarative language technique in the functional/logical AI language FIT is presented.

%T Declarative Operations on Nets
%A H. Boley
%I bole90
%S Research Report RR-90-12, Deutsches Forschungszentrum fr Knstliche Intelligenz, Kaiserslautern, 1990
%K 
%C 

%T A Relational/Functional Language and its Compilation into the WAM
%A H. Boley
%I bole90b
%S SEKI Report SR-90-05, Fachbereich Informatik, Universitatt Kaiserslautern, Kaiserslautern, 1990
%K 
%C 

%T RFM Manual: Compiling RELFUN into the Relational/Functional Machine
%A H. Boley, K. Elsbernd, T. Krause
%I bole91
%S Document D-91-03, DFKI, Kaiserslautern, 1991
%K 
%C 

%T A Sampler of Relational/Functional Definitions
%A H. Boley, Ed.
%I bole91b
%S Technical Memo TM-91-04, DFKI, Kaiserslautern, 1991
%K 
%C 

%T Extended Logic-plus-Functional Programming
%A H. Boley
%I bole92
%S Research Report RR-92-03, Deutsches Forschungszentrum fr Knstliche Intelligenz, Kaiserslautern,1992
%K 
%C 

%T Parallel Object-Oriented Descriptions of Graph Reduction machines
%A D. Bolton, C. Hankin, P. Kelly
%I bolt89
%S PARLE '89, LNCS 365, p158-175
%K 
%C 

%T Compiling Laziness by Partial Evaluation
%A A. Bondorf
%I bond91
%S In peyt91b
%K 
%C 

%T Improving Binding Times without Explicit CPS-Conversion
%A A. Bondorf
%I bond92
%S In acm92, pp1-10
%K 
%C 

%T An Environment Model for the Integration of Logic and Functional Programming
%A P. Bonzon
%I bonz87
%S Technical Report UCSC-CRL-87-3, Computer Research Laboratory, University of California, Santa Cruz, CA, 1987
%K 
%C The author proposes a unified environment model for the evaluation of both function and relation (or predicate) applications; as an illustration, simple extensions of a subset of Scheme are introduced, together with their interpreter.

%T A logical Operational Semantics of Full Prolog
%A E. Brger
%I borg90
%S IBM Technical Report IKBS 117
%K 
%C 

%T Program Changes and the Cost of Selective Recompilation
%A E.A. Borison
%I bori89
%S Carnegie Mellon Report, CMU-CS-89-205
%K 
%C 

%T Foundations of Logic and Functional Programming
%A M. Boscarol, L.C. Aiello, G. Levi, Eds.
%I bosc86
%S LNCS 306, Workshop at Trnto, Italy
%K Theory, general,
%C 

%T IDEAL and K-Leaf Implementation: A Progress Report
%A P.G. Bosco, C. Cecchi, C. Moiso
%I bosc89
%S PARLE '89, LNCS 365/366
%K integrating functional and logic programming
%C 

%T Using FP as a Query Language for Relational Data-Bases
%A A. Bossi, C. Ghezzi
%I boss84
%S Computer Languages, 9, 1, pp25-37, 1984
%K 
%C 

%T Computational Semantics of Term Rewriting Systems
%A G. Boudol
%I boud83
%S Tech. Rep. 192, INRIA, Rocquencourt Le Chesnay, France, 1983
%K 
%C 

%T Abstract Interpretation by Dynamic Partitioning
%A F. Bourdoncle
%I bour92
%S JFP 2,4, pp407-435
%K 
%C 

%T Combinators as Machine Code for Implementing Functional Languages
%A B. Boutel
%I bout87
%S In eise87
%K hope, dataflow
%C 

%T Tui Language Manual
%A B.E. Boutel
%I bout88
%S Tech. Rep. CSD-8-021, Victoria University of Wellington, 1988
%K 
%C 

%T A Confluent Calculus of Macro Expansion and Evaluation
%A A. Bove, L. Arbilla
%I bove92
%S In acm92, pp278-287
%K substitution
%C 

%T Proving Theorems about Lisp Functions
%A R.S. Boyer, J.S. Moore
%I boye75
%S JACM 22,1, pp129-75
%K 
%C 

%T On the Feasibility of Mechanically Verifying SASL Programs
%A R.S. Boyer, M. Kaufmann
%I boye84a
%S Burroughs Austin Research Center Report ARC 84--16, 1984
%K verification, SASL, Boyer-Moore Theorem Prover, fixpoint induction
%C 

%T A Prototype Theorem-Prover for a Higher-Order Functional Language
%A R.S. Boyer, M. Kaufmann
%I boye84b
%S Burroughs Austin Research Center Report ARC 84--17, 1984
%K verification, SASL, Boyer-Moore Theorem Prover, fixpoint induction, lifting
%C 

%T A Computational Logic
%A R.S. Boyer, J.S. Moore
%I boye84c
%S Academic Press, 1984
%K 
%C 

%T Strictness Analysis for SASL
%A R.S. Boyer, J.S. Moore
%I boye84c
%S Draft, Univ. of Texas, Austin, 1984
%K 
%C 

%T Functional Program Transformation Projects 1987
%A M.D. Boyes, et al.
%I boye87
%S Functional Language Implementation Project Document 10. Univs. Warwick/Birmingham, CS Dept.
%K specification
%C Originally a specification for undergraduate projects.

%T Functional Program Transformation
%A M. Boyes
%I boye87b
%S Project Dissertation, Department of Computer Science, University of Birmingham, 1987
%K 
%C 

%T A Practical Functional Program for the CRAY X-MP
%A J.M. Boyle, T.J. Harmer
%I boyl92
%S JFP 2,1, pp81-126
%K 
%C 

%T Deriving Sequential and Parallel Programs from Pure Lisp Specifications by Program Transformation
%A J.M. Boyle, K.W. Dritz, M.N. Muralidharan, R.J. Taylor
%I boyl86
%S In "Program Specification and Transformation", Bad Tlz, pp 2-19, North Holland
%K 
%C 

%T Computer Programming and Formal Systems
%A P. Braffort, D. Hirshberg (Eds.)
%I braf63
%S North Holland Publishers, 1963
%K 
%C 

%T The Fifth Generation: An Annotated Bibliography
%A M. Bramer, D. Bramer
%I bram84
%S Addison Wesley, 1984
%K 
%C 

%T Advances in Lisp for the iPSC/2
%A J. Brandenburg et al.
%I brand88
%S TR, Intel Scientific Computers, Beaverton, Oregon
%K explicit parallelism
%C 

%T Determining Useful Parallelism in Higher Order Functions
%A T.A. Bratvold
%I brat92
%S 4th International Workshop on the Parallel Implementation of Functional Languages, Aachen
%K skeletons
%C 

%T Inhertiance and Explicit Coercion
%A V. Breazu-Tannen, et. al.
%I brea89
%S 4th LICS Symposium, IEEE Coputer Society Press, 1989
%K 
%C 

%T Computing with Coercions
%A V. Breazu-Tannen, C.A. Gunter, A. Scedrov
%I brea90
%S In acm90, 44-60
%K multiple inheritance
%C 

%T On Extending Computational Adequacy by Data Abstraction
%A V. Breazu-Tannen, R. Subrahmanyam
%I brea92
%S In acm92, pp161-169
%K 
%C 

%T An Exception Handling Construct for Functional Languages
%A M. Bretz, J. Ebert
%I bret88
%S LNCS 300, pp160-174, 2nd European Symp. on Programming, Nancy, March 1988
%K error recovery, interrupted operation, forced termination, parallelism, determinism, side effects, referential transparency, higher order functions, ALEX, static binding, type inference
%C 

%T The Implementation of the Data Language - DL
%A P.T. Breuer
%I breu88
%S Report CUED/F-INFENG/TR17, Engineering Department, Cambridge University, Cambridge,1988
%K 
%C DL is a database language which uses the functional programming model, of computation as its substrate. This gives it an inbuilt high-level, query language

%T A Data Language - DL
%A P.T. Breuer
%I breu88b
%S Report CUED/F-INFENG/TR16, Engineering Department, Cambridge University, Cambridge,1988
%K 
%C DL is a database language which uses the functional programming model, of computation as its substrate. This gives it an inbuilt high-level, query language

%T A Variety of Functional Programming Sublanguages
%A P.T. Breuer
%I breu88c
%S Report CUED/F-INFENG/TR26, Engineering Department, Cambridge University, Cambridge,1988
%K DL, database, CACSD
%C This is a collection of three papers which have grown up out of
work connected with the preogramming language DL, designed to help in the investigation of data-models for Computer-Aided Control-System Design

%T Applicative Query Languages
%A P.T. Breuer
%I breu90
%S University Computing 12, pp2-12, IUCC 1990
%K ZF notation, set comprehension, relational databases, domain queries, query languages, transform calculus
%C 

%T Axiomatization of a Functional Logic Language
%A F. Bronsard, U.S. Reddy
%I bron90
%S In LNCS 463
%K 
%C 

%T S-1 Common LISP Implementation
%A Rodney A. Brooks, et al.
%I broo82a
%S In acm82
%K Common LISP
%C 

%T An Optimizing Compiler for Lexically Scoped LISP
%A Rodney A. Brooks, et al.
%I broo82b
%S Proc. SIGPLAN '82 Symp. on Compiler Construction, SIGPLAN 17,6 1982
%K LISP, lexical scoping, static scoping, source transformations, register allocation, allocation on stack
%C 

%T A Critique of Common LISP
%A R.A. Brooks, R.P. Gabriel
%I broo84a
%S In acm84a, pp1-8
%K 
%C 

%T Trading Data Space for Reduced Time and Code Space in Real-Time Garbage Collection on Stock Hardware
%A R.A. Brooks
%I broo84b
%S In acm84a, pp256-262
%K 
%C 

%T Design of an Optimizing, Dynamically Retargetable Compiler for Common Lisp
%A R.A. Brooks, et al.
%I broo86
%S In acm86, pp67-85
%K 
%C 

%T Semantics of Programming Languages
%A S. Brookes
%I broo??
%S To Appear (Referenced in kauf85)
%K 
%C 

%T A New Concept in Programming
%A G. Brown
%I brow62
%S In `Management and the Computer of the Future', Ed. M. Greenberger, Wiley, 1962
%K 
%C 

%T Knowledge-Based Visual Interpretation using Declarative Schemata
%A R. Browse
%I brow83
%S Ph. D. Thesis, Univ. British Columbia, Vancouver, 1982
%K 
%C 

%T Cyclic Reference Counting for Combinator Machines
%A D.R. Brownbridge
%I brow85
%S FPCA'85, Nancy, LNCS 201, pp273-288 --- Also Univ. Newcastle Upon Tyne, Computing Lab. Report 207
%K garbage collection, cyclic structures, combinators
%C This new algorithm deals correctly and automatically with the kind of
cyclic structures which arise in a combinator graph reduction machine. By extending the standard reference count algorithm, cycles can be handled at little extra cost. Cyclic reference counting uses one extra bit per pointer
and per object

%T IO Streams: Abstract Types, Real Programs
%A M.R. Brown, G. Nelson
%I brow89
%S DEC Systems Research Center Report 53

%K I/O
%C 

%T An Integrated Model for Persistent Lazy Functional programming
%A A.L. Brown, A.J.T. Davie, D.J. McNally
%I brow92
%S University of St.Andrews Dept. of Math. and CS, Research Report CS/92/5
%K modules, streams, object stores
%C The STAPLE persistent lazy functional system is described. The motivation for using persistence to prolong the evaluation states of functional values is presented. Two models based on persistent modules and stream persistence are desribed.  Current and future work on an integration of these models is discussed. The interface to a stable heap and persistent object store is presented.

%T A Fixed Point Approach to Applicative Multiprogramming
%A M. Broy
%I broy82
%S In `Theoretical Foundations of Programming Methodology' --- Lecture Notes of a NATO Summer School. NATO Advanced Study Institute Series C91, Reidel Publ., 1982
%K 
%C 

%T Program Construction by Transformations: a family tree of Sorting Programs
%A M. Broy
%I broy83a
%S In ``Computer Program Synthesis Methodologies'', Ed. A.W. Biermann, G. Guiho, Reidel, 1983
%K transformation, specification, sorting, folding and unfolding, procedural programs, predicate transformation, efficiency, program synthesis
%C 

%T Applicative Real Time Programming
%A M. Broy
%I broy83b
%S IFIP '83 --- Proc. 9th World Computer Congress, Paris, Ed. R.E.A.~Mason, ISBN 0--444--86729--5, Elsevier, North Holland, 1983
%K explicit discrete time, delay functions, concurrency, causality, nondeterminism, ART
%C 

%T Algebraic Definition of a Functional Programming Language and its Semantic Models
%A M. Broy, M. Wirsing
%I broy83c
%S Revue Franaise d'Automatique, d'Informatique, et de Recherche Operationelle: Informatique 17,2, 1983
%K 
%C 

%T Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprocessing
%A M. Broy
%I broy83d
%S Information Processing Letters 17,1, 1983
%K communicating sequential processes, streams
%C 

%T Logic of Programming and Calculi of Discrete Design
%A M. Broy, Ed.
%I broy87
%S NATO ASI Series Vol. {F}36, Sprinver Verlag
%K 
%C 

%T Programming Concepts and Methods
%A M. Broy, C. Jones, eds.
%I broy90
%S North Holland
%K 
%C 

%T Modelling Operating System Structures by Timed Stream Processing Functions
%A M. Broy, C. Dendorfer
%I broy92
%S JFP 2,1, pp1-21
%K 
%C 

%T The Semantics of Second Order Polymorphic Lambda Calculus
%A K.B. Bruce, A.R. Meyer
%I bruc84
%S LNCS 173
%K 
%C 

%T The Semantics of Miranda's Algebraic Types
%A K.B. Bruce, J.G. Riecke
%I bruc87
%S LNCS 298, Proc 3rd Workshop on Math. Foundations of Programming Language Semantics
%K polymorphism, algebraic types, denotational semantics, constructor expressions, kind checking, soundness
%C 

%T MetaMorph  A Formal Methods Toolkit with Application to the Design of Digital Hardware
%A P.J. Brumfitt
%I brum92
%S JFP 2,4, pp437-473
%K 
%C 

%T CLEAN: A Language for Functional Graph Rewriting
%A T.H. Brus, M.C.J.D. van Eekelen, M.O. van Leer, M.J. Plasmeijer
%I brus87
%S LNCS 274, FPCA Portland, 1987, pp364-384
%K trs, grs, term graph system
%C Clean is based on an extension of Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a, possibly cyclic, directed graph, called the data graph and graph rewrite rules which specify how this graph may be rewritten.

%T Set Theory based on Combinatory Logic
%A M.W. Bunder
%I bund69
%S PhD Thesis., University of Amsterdam, 1969
%K 
%C 

%T Propositional and Predicate Calculus based on Combinatory Logic
%A M.W. Bunder
%I bund74
%S Notre Dame Journal of Formal Logic, 15, pp25-34, 1974
%K 
%C 

%T Various Systems of Set Theory based on Combinatory Logic
%A M.W. Bunder
%I bund74b
%S Notre Dame Journal of Formal Logic, 15, 1974
%K 
%C 

%T Lambda-Elimination in Illative Combinatory Logic
%A M.W. Bunder
%I bund79
%S Notre Dame Journal of Formal Logic, 20, 1979
%K 
%C 

%T Scott's Models and Illative Combinatory Logic
%A M.W. Bunder
%I bund79b
%S Notre Dame Journal of Formal Logic, 20, 1979, pp609-612
%K 
%C 

%T Variable Binding Term Operators in Lambda-Calculus
%A M.W. Bunder
%I bund79c
%S Notre Dame Journal of Formal Logic, 20, pp876-878, 1979
%K 
%C 

%T Paraconsistent Combinatory Logic
%A M.W. Bunder
%I bund79c
%S Polish Academy of Sciences Institute of Philosophy and Sociology, Bulletin of the Logic Section, 8, 4, pp177-181, 1979
%K 
%C 

%T Predicate Calculus and Nave Set Theory in Pure Combinatory
%A M.W. Bunder
%I bund81
%S Archiv fr Mathematische Logik und Grundlagenforschung, 21, 1981, pp169-177
%K 
%C 

%T FQL --- A Functional Query Language
%A Peter Buneman, R.E. Frankel
%I bune79
%S In Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, 1979
%K 
%C 

%T A Practical Functional Programming System for Databases
%A Peter Buneman, R. Nikhil
%I bune81
%S In acm81
%K databases, query languages, lazy evaluation, FQL, implementation, FP style, type checking, type inference
%C 

%T An Implementation Technique for Database Query Languages
%A Peter Buneman, R.E. Frankel, R. Nikhil
%I bune82
%S TODS, 7, 2, pp164-187, 1982
%K 
%C 

%T Functional Programming and Databases
%A P. Buneman
%I bune90
%S in turn90a, Research Topics in Functional Programming, pp155-169
%K 
%C 

%T A Comparison of Strict and Non-strict Semantics for Lists
%A J.R. Burch
%I burc88
%S Report Caltech-CS-TR-88-12, Pasadena, CA, 1988, MSc Thesis.
%K 
%C 

%T The Evaluation, Classification and Interpretation of Expressions
%A W.H. Burge
%I burg64a
%S Proc. 19th National ACM Conf., New York, 1964
%K 
%C 

%T Interpretation, Stacks and Evaluation
%A W.H. Burge
%I burg64b
%S In ``Introduction to Systems Programming'' --- Ed. P. Wegner --- Academic Press, 1964
%K GIPSY, interpreters, reverse Polish, transformation
%C 

%T MCG --- A Functional Programming System
%A W.H. Burge
%I burg68
%S IBM Research Division, Yorktown Heights, 1968
%K 
%C 

%T Some Examples of the Use of Function Producing Functions
%A W.H. Burge
%I burg71
%S Proc. 2nd Symp. on Symbolic and Algebraic Manipulation, Los Angeles, 1971
%K 
%C 

%T Combinatory Programming and Combinatorial Analysis
%A W.H. Burge
%I burg72
%S IBM Journal of Research and Development 16,5, 1972
%K sets, generating functions, streams, trees
%C 

%T Recursive Programming Techniques
%A W.H. Burge
%I burg75a
%S Addison-Wesley, 1975
%K general, stream functions, laziness, combinators
%C 

%T Stream Processing Functions
%A W.H. Burge
%I burg75b
%S IBM Journal of Research and Development 19,1, 1975
%K stream processing, describing data, coroutines, sequences
%C 

%T PRISM: A DSM Multiprocessor Reduction Machine for the Parallel Implementation of Applicative Languages
%A P.C. Burkimsher
%I burk83
%S Proc. Joint SERC/Chalmers Workshop on Declarative Programming, Univ. College London, 1983
%K 
%C 

%T Combinator Reduction in a Shared-Memory Multiprocessor
%A P.C. Burkimsher
%I burk87
%S Computer Journal, 30, 3, pp214-222, 1987
%K prism
%C A parallel combinator reduction machine for a shared-memory multiprocessor is described. The system, called Prism, uses a graphical internal representation and features a de-centralised scheduling algorithm which is independent of the number of processors available.

%T The Theory and Practice of Strictness Analysis for Higher Order Functions
%A Geoffrey L. Burn, Chris L. Hankin, S. Abramsky
%I burn85
%S In LNCS 217, also Imperial College research report 85/6
%K strictness analysis, higher order functions, abstract interpretation, parallel processing, power domains
%C 

%T Strictness Analysis for Higher Order Functions
%A Geoffrey L. Burn, Chris L. Hankin, S. Abramsky
%I burn86
%S Science of Computer Programming, 7 pp249-278, 1986
%K strictness analysis, higher order functions, abstract interpretation, parallel processing, power domains
%C 

%T Evaluation Transformers - A Model for the Parallel Evaluation of Functional Languages
%A G.L. Burn
%I burn87a
%S LNCS 274, FPCA Portland, 1987, pp446-
%K 
%C Extended Abstract. Allows compile time analysis of programs to add annotations about parallelism and strictness. A semantic criterion is given which ensures that a parallel machine does not become swamped with the computation of expressions whose values are not needed in order to produce the result from a program


%T Abstract Interpretation and the Parallel Evaluation of Functional Languages
%A G.L. Burn
%I burn87b
%S ESPRIT Project 415 Report, Dept. Computing, Imperial College, Ph.D. thesis, 1987
%K 
%C Burn presents a semantic criterion which restricts the expressions which are evaluated to those which would eventually have been evaluated using a lazy evaluator. The complete analysis may be implemented as one of the passes in a compiler, so that programs can be automatically annotated with parallelism information.


%T The Spineless G-machine

%A Geoffrey L. Burn, Simon L. Peyton Jones, J.D. Robson
%I burn88a
%S In acm88 pp244-258
%K sharing, avoiding updating, graph reduction, tim
%C 

%T A Shared Memory Parallel G-machine Based on the Evaluation Transformer Model of Computation
%A G. Burn
%I burn88b
%S Aspens 88, [john88a], pp301-330
%K 
%C 

%T Parallel Architectures and Languages for Advanced Information Processing - A VLSI Directed Approach
%A G. Burn
%I burn88c
%S Aspens 88, [john88a], pp331-340
%K 
%C 

%T Overview of a Parallel Reduction machine Project II
%A G.L. Burn
%I burn89
%S PARLE '89, LNCS 365/366
%K 
%C 

%T A Relationship between abstract interpretation and projection analysis
%A G.L. Burn
%I burn90a
%S 17th POPL, pp 151-156, San Francisco, Jan. 1990
%K 
%C Extended Abstract

%T Using Projection Analysis in Compiling Lazy Functional Programs
%A G.L. Burn
%I burn90b
%S In acm90, pp227-241
%K sequential, parallelism, evaluation transformers
%C 

%T Implementing Lazy Functional Languages on Parallel Architectures
%A G.L. Burn
%I burn90c
%S In "Parallel Computers - Object-Oriented, Functional, Logic", ed P.C. Treleaven, Wiley Series in ParallelComputing
%K graph reduction, evaluation transformers
%C 

%T A New Domain For Head-Strictnes
%A G. Burn
%I burn90d
%S TR, DoC, Imperial College
%K 
%C 

%T Lazy Functional Languages: Abstract Interpretation and Compilation
%A G.L. Burn
%I burn91
%S Pitman in association with MIT press, ISBN 0-273-08832-7, 0-262-52160-1, 1991
%K 
%C 

%T The Evaluation Transformer Model of Reduction and its Correctness
%A G.L. Burn
%I burn91b
%S TAPSOFT '91, LNCS 494, pp458-482
%K strictness analysis, parallelism, abstract interpretation, projection analysis, laziness, typed lambda calculus, operational semantics
%C 

%T Implementing the Evaluation Transformer Model of Reduction on Parallel Machines
%A G.L. Burn
%I burn91c
%S JFP 1(2), also Research Report DoC 90/24, Department of Computing, Imperial College, London (1990)
%K 
%C The evaluation transformer model of reduction generalises lazy evaluation in two ways: it can start the evaluation of expressions before their first use, and it can evaluate expressions further than weak head normal form. Moreover, the amount of evaluation required of an argument to a function may depend on the amount of evaluation required of the function application

%T Cps-Translation and the Correctness of Optimising Compilers
%A G. Burn, D. Le Metayer
%I burn92
%S TR DoC92/20, Imperial College
%K 
%C We show that compiler optimizations based on strictness analysis can be expressed formally in the functional framework using continuations. This formal presentation has two benefits: it allows us to give a rigorous correctness proof of the optimized compiler; and it exposes the various optimizations made possible by strictness analysis. These benefits are especially significant in the presence of partially evaluated data structures.

%T Circular Letter
%A Anon
%I burr84
%S Burroughs Corporation, Austin, TX

%K 
%C Referenced in Mike Joy's Bibliography, joy91

%T Some Remarks on C. Strachey's Lectures (On CPL)
%A R.M. Burstall
%I burs67
%S NATO Summer School, Copenhagen 1967
%K CPL, POP-2, semantic types
%C 

%T Writing Search Algorithms in Functional Form
%A R.M. Burstall
%I burs68
%S In ``Machine Intellegence 3'', Ed. D. Michie, Edinburgh University Press, 1968
%K searching, controlled search, graph traversing, reluctance, Landin's J operator
%C 

%T The POP-2 Reference Manual
%A  R.M. Burstall, R.J. Popplestone
%I burs68b
%S Machine Intelligence 2, pp. 205-46, eds Dale,E. and Michie,D. Oliver and Boyd, Edinburgh, Scotland
%K 
%C 

%T Proving Properties of Programs by Structural Induction
%A R.M. Burstall
%I burs69
%S Computer Journal. 12,1, 1969
%K structural induction, data structures, pattern matching, decons, Noetherian induction, tree sort, correctness, compiler correctness
%C 

%T Programming in POP-2
%A R.M. Burstall, J.S. Collins, R.J. Popplestone
%I burs71
%S Edinburgh University Press, 1971
%K POP-2, general, partial application, macros, library of useful programs, doublets
%C 

%T An Algebraic Description of Programs with Assertions, Verification and Simulation
%A R.M. Burstall
%I burs72
%S SIGPLAN 7,1, 1972
%K flow diagrams, functors, category theory, Floyd-Hoare method of assertions, verification, simulation
%C 

%T Program Proving as Hand Simulation with a Little Induction
%A R.M. Burstall
%I burs74
%S IFIP '74
%K proving, correctness, verification, induction, modal logic
%C 

%T Reasoning about Programs
%A R.M. Burstall
%I burs76
%S Privately Circulated Lecture Notes, 1976
%K correctness, recursion equations, induction, structural induction, inductive assertion, abstract data types
%C 

%T A Transformation System for Developing Recursive Programs
%A R.M. Burstall, J. Darlington
%I burs77a
%S JACM 24,1, pp 44-67,1977
%K transformation, recursion equations, efficiency, folding, unfolding
%C 

%T Putting Theories Together to make Specifications
%A R.M. Burstall, J.A. Goguen
%I burs77b
%S Proc. 5th Int. Joint. Conf. on AI, Cambridge, Mass., 1977
%K 
%C 

%T Design Considerations for a Functional Programming Language
%A R.M. Burstall
%I burs77c
%S In Infotech State of the Art Conference. The Software Revolution. Infotech, Copenhagen, 1977
%K NPL, Hope, List comprehension
%C 

%T HOPE: An Experimental Applicative Language
%A R.M. Burstall, D.B. McQueen, D.T. Sannella
%I burs80a
%S CSR-62-80, Dept of Computer Science, University of Edinburgh, also in acm80
%K HOPE, user defined data types, polymorphism, overloaded operators, recursion equations, pattern matching, higher order functions and types, lazy evaluation, modular packages, abstract data types, input output, implementation
%C The authors list some aspects of programming languages which contribute to accuracy and flexibility. They illustrate them by describing an applicative language, called HOPE, which they have developed and implemented. This is followed by an example of a complete HOPE program. Finally they discuss the strengths and weaknesses of HOPE.


%T Electronic Category Theory
%A R.M. Burstall
%I burs80b
%S Proc. Conf. on Math. Foundations of Comp. Sci., Rydzyna, Poland, 1984 (Springer?)
%K 
%C 

%T Algebras, Theories and Freeness: An Introduction for Computer Scientists
%A R.M. Burstall, J.A. Goguen
%I burs82
%S Edinburgh Dept. Comp. Sci., CSR--101--82, 1982
%K 
%C 

%T A Handbook for HOPE: An Applicative Programming Language
%A R.M. Burstall, et al.
%I burs83
%S Edinburgh University, Dept. Comp. Sci., 1983
%K HOPE, abstract data types, modules, specification language, sets
%C 

%T A Kernel Language for Abstract Data Types and Modules
%A Rod M. Burstall, B. Lampson
%I burs84a
%S In LNCS 173
%K Pebble, bindings, first class types and declarations, modules, interfaces, implementations, abstract data types, generic types, recursive types, unions, operational semantics, polymorphism, dependent types
%C 

%T A Kernel Language for Modules and Abstract Data Types
%A Rod M. Burstall, B. Lampson
%I burs84b
%S Digital Equipment Corp. Report, Systems Research Centre, Palo Alto, 1984
%K Pebble, bindings, first class types and declarations, modules, interfaces, implementations, abstract data types, generic types, recursive types, unions, operational semantics, polymorphism, dependent types
%C 

%T Programming with Modules as Typed Functional Programming
%A Rod M. Burstall
%I burs84c
%S Proc. Internat. Conf. on 5th Generation Computing Systems, Tokyo, 1984
%K Pebble, bindings, first class types and declarations, modules, interfaces, implementations, abstract data types, generic types, recursive types, unions, operational semantics, polymorphism, dependent types
%C 

%T Inductively Defined Functions
%A R.M. Burstall
%I burs85
%S In LNCS 185
%K initial algebras, unique homomorphism property, proving inequations, ML, case expressions, types, obvious termination, equational data types
%C 

%T Inductively Defined Functions in Functional Programming Languages
%A R.M. Burstall
%I burs86
%S Journal of Computer and System Sciences, 34, 2/3, pp409-421, 1986
%K 
%C This paper proposes a notation for defining functions or procedures in such a way that their termination is guaranteed by the scope rules. It uses an extension of case expressions

%T A Network for the Rapid Distribution of Work
%A F. Warren Burton, M.R. Sleep
%I burt80
%S Rep. CS/80/018/E, School of Computer Studies, Univ. E. Anglia, 1980
%K 
%C 

%T Executing Functional Programs on a Virtual Tree of Processors
%A F. Warren Burton, M.R. Sleep
%I burt81a
%S In acm81
%K reduction strategies, R-N-cube networks, concurrency, parallelism, virtual process trees, interprocess communication
%C 

%T Communication in a Distributed Implementation of an Applicative Language
%A F. Warren Burton, M.R. Sleep
%I burt81b
%S In Proc. 6th ACM European Regional Conference, London 1981
%K 
%C 

%T A Linear Space Translation of Functional Programs to Turner Combinators
%A F. Warren Burton
%I burt82a
%S Information Processing Letters 14,5, 201-204
%K combinators, complexity, balancing
%C 

%T An Efficient Functional Implementation of FIFO Queues
%A F. Warren Burton
%I burt82b
%S Information Processing Letters 14,5, 1982
%K queues
%C 

%T Annotations to Control Communications and Synchronization in the Distributed Evaluation of Functional Programs
%A F.W. Burton
%I burt83
%S TOPLAS 6, 2, pp159-174, also Department of Electrical Engineering and Computer Science, University of Colorado at Denver, CO, 1983
%K 
%C 

%T Virtual Tree Machines
%A F. Warren Burton, Matthew M. Huntbach
%I burt84a
%S IEEE Transactions on Computers 33, pp 278-280, 1984
%K parallel, offloading, annotations
%C 

%T Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
%A F. Warren Burton
%I burt84b
%S TOPLAS 6,2, 1983 pp159-174 - also Dept. Electr. Engineering and Comp Sci, Univ. Collorado at Denver research report
%K concurrency, parallelism, annotated lambda calculus, orders of reduction, laziness, eagerness, process scheduling, pipelines
%C 

%T Nondeterminism with Referential Transparency in Functional Programming Languages
%A F. Warren Burton
%I burt84c
%S Comp. J. 31, 3 pp243-247, 1988 --- also Dept. Elec. Eng. and Comp. Sci., Univ. Colorado at Denver, 1984
%K 
%C 

%T A Space Efficient Optimization of Call-By-Need
%A F.W. Burton, D. Maurer, H.G. Oberhauser, R. Wilhelm
%I burt84d
%S 
%K 
%C referenced in joy91

%T Controlling Speculative Computation in a Parallel Functional Programming Language
%A F. Warren Burton
%I burt85a
%S Proc. 5th Internat. Conf. on Distributed Computing Systems, Denver, CO, 1985
%K 
%C 

%T Functional Programming for Concurrent and Distributed Computation
%A F.W. Burton
%I burt85b
%S Dept. Elec. Eng. and Comp. Sci., Univ. Colorado at Denver, 1985 - also Comp. J 30,5, pp437-450, 1987
%K 
%C The author proposes a small and simple set of annotations (or pragmas) to control the run-time behaviour of a functional program

%T Speculative Computation, Parallelism and Functional Programming
%A F.W. Burton
%I burt85c
%S IEEE Trans. Comput, C-34(12), pp1190-3
%K 
%C 

%T Controlling Reduction Partial Order in Functional Parallel Programs
%A F.W. Burton
%I burt86
%S In LNCS 279 
%K 
%C Shows that reduction partial order can be controlled by a mixture of call by value, call by need and call by speculation

%T Storage Management in Virtual Tree Machines
%A F.W. Burton
%I burt88
%S IEEE, Transactions on Computers 37, 3, pp321-328
%K 
%C 

%T Nondeterminism with referential transparency in functional programming languages
%A F.W. Burton
%I burt88
%S Computer Journal, 31, 3, pp243-247
%K decision stream as input
%C 

%T Indeterminate Behaviour with Determinate Semantics in Parallel Programs
%A F. Warren Burton
%I burt89
%S FPCA, Imperial College, 1989, pp340-346 also Tech. Rep. Css/LCCR TR 98-03, Simon Fraser Univ.
%K 
%C 

%T A Note on Higher-Order Functions versus Logical Variables
%A F.W. Burton
%I burt89
%S Information Processing Letters, 31, 91-95, 1989
%K 
%C A commonly cited advantage of Prolog and similar logic languages is that data structures may contain logical (i.e. free) variables. These variables may be regarded as hooks into the data structure, to places where unification may be used to insert new information into the data structure. The author shows that the same technique can be used in a functional programming language. A data structure is represented as a function

%T Type Extension Through Polymorphism
%A F.W. Burton
%I burt90
%S TOPLAS 12, 1, pp135-138, 1990
%K 
%C 

%T Manipulating Multilinked Data Structures in a Purely Functional Language
%A F.W. Burton, H.-K. Yangs
%I burt90b
%S Software 20, 11, pp1167-1185, 1990
%K 
%C They cheat. They implement heaps and pointers; the heap must be carried round as an explicit argument to, and sometimes result of, each list-processing function. Making the heap an explicit argument and result stuffs up the transformational programming approach.    jeremy@cs.aukuni.ac.nz

%T Encapsulating Non-Determinacy in an Abstract Data Type with Determinate Semantics
%A F. Warren Burton
%I burt91
%S J. Functional Programming 1,1, pp3-30
%K parallelism, intederminacy, improving values, speculative evaluation, alpha-beta search, breadth first search, scheduling, priorities, polymorphism
%C We propose a new construct, a polymorphic abstract type called an improving value, with operations that have indeterminate behavior but simple determinate semantics. These operations allow the type of indeterminate behavior required by many parallel algorithms

%T Distributed Random Number Generation
%A F.W. Burton, R.L. Page
%I burt92
%S JFP 2,2, pp203-212
%K 
%C 

%T FP as a basis for Program Transformation
%A V.J. Bush, et al.
%I bush83
%S University of Manchester, Dept. Comp. Sci., Dataflow Research Project, 1983
%K 
%C 

%T Transforming Recursive Programs for Execution on Parallel Machines
%A V.J. Bush, J.R. Gurd
%I bush85
%S FPCA'85, Nancy, LNCS 201, pp350-367
%K transformation, parallelism, FP
%C Describes the conditions under which linear and bilinear recursive forms are equivalent

%T A Behavioural Semantics for Linda-2
%A P. Butcher
%I butc90
%S Report YCS-137, Department of Computer Science, University of York, 1990
%K 
%C 

%T A Practical Course on Functional Programming
%A A.S. Calle, J.A.V. Iturbide
%I call89
%S FIM/54.1/LyS/89, Facultad de Informatica, Universidad Politcnica, Madrid, 1989
%K 
%C 

%T Optimal Use of Storage in a Simple Model of Garbage Collection
%A J.A. Campbell
%I camp74
%S Information Processing Letters 3,2, 1974
%K garbage collection, list processing, storage allocation strategies
%C 

%T An Abstract Machine for a Purely Functional Language
%A W.A. Campbell
%I camp79
%S St.Andrews Univ., Dept. Comp. Sci. Technical Rep. July 1979
%K SASL, abstract machine, interpreter, SECD machine, interactive programming, clausal form, applicative programming, laziness, non-strictness, implementation
%C 

%T Symbolic Computing with and without LISP
%A J.A. Campbell, J.P. Fitch
%I camp80
%S In acm80
%K LISP, symbolic programming, algebra, REDUCE, MACSYMA
%C 

%T Complexitde la Rduction en Logique Combinatoire
%A R. Canal
%I cana78
%S RAIRO Informatique Thoretique, 12, pp339-367, 1978
%K 
%C 

%T ??
%A R. Canal, J. Vignolle
%I cana78b
%S Proceedings of the AFCET Congress 1, pp288-298, 1978
%K 
%C referenced in Joy91

%T Reference Count and Copy Elimination for Parallel Applicative Computing
%A D.C. Cann, R.R. Oldehoeft
%I cann88
%S Technical Report CS-88-129, Department of Computer Science, Colorado State University, Fort Collins, CO, 1988
%K dataflow, sisal
%C 

%T Compilation Techniques for High Performance Applicative Computation
%A D.C. Cann
%I cann89
%S Technical Report CS-89-108, Department of Computer Science, Colorado State University, Fort Collins, CO, 1989
%K dataflow, sisal, benchmarks
%C 

%T F-Bounded Polymorphism for Object-Oriented Programming
%A P. Canning, et. al.
%I cann89b
%S FPCA, Imperial College, 1989, pp273-280
%K bounded, fbounded, oop
%C 

%T Retire Fortran? A Debate Rekindled
%A D. Cann
%I cann93
%S Lawrence Livermore National Lab., 19??
%K SISAL
%C The Sisal project has developed a functional language (Sisal) intended for parallel numerical computations. Version 1.2 of the language is a bit of a dog but the "soon to be released" version 2.0 looks a lot nicer
Sisal is a functional language runs under unix environment. It is available by anonymous ftp from sisal.llnl.gov

%T Two-Dimensional Syntax for Functional Languages
%A Luca Cardelli
%I card82
%S In ``Integrated Interactive Computing Systems'' --- Proc. European ECICS 82 Conf., Stresa, 1982, Eds. P. Degano, E. Sandwall, ISBN 0--444--86595--0, Elsevier, 1983
%K 
%C 

%T The Functional Abstract Machine
%A Luca Cardelli
%I card83a
%S Bell Labs Tech. Rep. TR--107, 1983 --- also Polymorphism --- The ML/LCF/Hope Newsletter I,1, 1983
%K interpreter, compiler, ML, SECD machine, operational semantic, Fam, intermediate code
%C 

%T Stream Input/Output
%A Luca Cardelli
%I card83c
%S Polymorphism --- The ML/LCF/Hope Newsletter I,3, 1983
%K input, output, unix, files, processes, streams
%C 

%T ML under UNIX
%A L. Cardelli
%I card83d
%S Bell Labs, Murray Hill, NJ, 1983
%K 
%C 

%T Basic Polymorphic Typechecking
%A Luca Cardelli
%I card84a
%S AT, T Bell Labs., 1984(?) --- also Polymorphism --- The ML/LCF/Hope NewsletterII,1, 1985
%K polymorphism, types, type checking, ML, pragmatics, systems of type equations, type inference
%C 

%T ML under UNIX
%A Luca Cardelli
%I card84b
%S Polymorphism --- The ML/LCF/Hope Newsletter I,3, 1984
%K ML, language definition, reference manual
%C 

%T A Semantics of Multiple Inheritance
%A Luca Cardelli
%I card84c
%S In LNCS 173 --- also in Information and Computation, 76, pp138-164
%K inheritance, taxonomy, objects, records, types, variants, multiple inheritance, type inference, join and meet types, Galileo
%C 

%T Compiling a Functional Language
%A Luca Cardelli
%I card84d
%S In acm84a, pp208-217
%K ML, strong typing, polymorphism, efficiency, variable access, closures, pattern matching, FAM, functional abstract machine, modules, separate compilation
%C 

%T Amber
%A Luca Cardelli
%I card84e
%S AT&T Bell Labs. Report TM 11271-840924-10, 1984 --- also cous85a, LNCS 242, pp21-47, also Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K Amber, languages, workstations, persistence, higher order functions, modules, multiple inheritance, concurrency, graphics
%C The Amber language embeds many recent ideas in programming language design, and tries to introduce all the features in their minimal, essential form. Multiple inheritance and persistent objects are integrated in a strongly typed language.


%T On Understanding Types, Data Abstraction and Polymorphism
%A Luca Cardelli, P. Wegner
%I card85a
%S Tech. Rep. CS--85--14, Brown University, 1985 --- also in Computing Surveys 17, 4, 471-522
%K types, abstraction, polymorphism, types as sets of values, universal quantification, generic functions, parametric types, existential quantification, information hiding, packages, abstract data types, modules as first class values, bounded quantification, subtyping, inheritance, partial abstraction, type checking, type inference, taxonomy of type systems
%C 

%T Persistence and Type Abstraction
%A Luca Cardelli, D. MacQueen
%I card85b
%S In ``Persistence and Data Types'' --- Papers for the Appin Workshop, Ed. M. Atkinson, P. Buneman & R. Morrison, Persistent Programming Research Report 16, Universities of St.Andrews and Glasgow, 1985
%K abstract types, polymorphism, packages, existential types, witness models
%C 

%T The Amber Machine
%A L. Cardelli
%I card85c
%S In cous85a LNCS 242, pp48-70
%K amber, abstract machine, architecture, signals, bitmap graphics, persistence, meta-level execution
%C The Amber machine is a stack machine designed as an intermediate
language for compiling higher-order languages.

%T A Polymorphic Lambda-calculus with Type:Type
%A Luca Cardelli
%I card86a
%S Digital Equipment Corporation Report, 1986
%K types, polymorphism, dependent types, type inference, Lambda-calculus
%C 

%T Typechecking Dependent Types and Subtypes
%A Luca Cardelli
%I card86b
%S In bosc86, LNCS306
%K types, polymorphism, dependent types, type inference, subtypes, stratified type systems, type checking, recursion, records and variants
%C 

%T Phase Distinctions in Type Theory
%A Luca Cardelli
%I card87
%S D.E.C. report, draft only, 1987
%K impredicative type syatems, predicative type syatems, reference types, existential types, universal types, phased type systems, phases, kinds, dependent types, PEBBLE, static type checking, run time, compile time
%C 

%T Structural Subtyping and the Notion of Power Type
%A L. Cardelli
%I card88
%S 15th POPL, 1988
%K 
%C 

%T Typeful Programming
%A Luca Cardelli
%I card89a
%S DEC Systems Research Center Report 45
%K types, languages, polymorphism, quantifiers, subtypes, signatures, binding, Quest, function types, tuple types, option types, auto types, recursive types, mutable types, exception types, operators, kinds, power kinds, records, variants, higher order subtypes, bounded universal types, bounded existential types, large programs, modules, interfaces, manifest types, diamond import, programming in the large, open systems, closed systems, sealed systems, dynamic types, stack allocation, type violations, style
%C The use of types in programming --- in particular in Quest.
All you ever wanted to know about types?

%T Operations on Records
%A Luca Cardelli, John Mitchell
%I card89b
%S DEC Systems Research Center Report 48 - AND In Mathematical Structures in Computer Science No1. Also to appear in Math. Foundations of Programming Language Semantics
%K 
%C 

%T Modula-3 Report(Revised)
%A L. Cardelli, et al.
%I card89c
%S DEC Systems Research Center Report 52

%K 
%C 

%T A Semantic Basis for Quest
%A L. Cardelli, G. Longo
%I card90a
%S DEC Systems Research Center Report 55, also JFP, 1, 4, 1991, pp417-458, also in acm90, 30-43
%K 
%C Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics of Quest is rather challenging. In particular, difficulties arise when we try to model simultaneously features such as contravariant function spaces, record types, subtyping, recursive types and fixpoints.

%T Abstract Types and the Dot Notation
%A L. Cardelli, X. Leroy
%I card90b
%S DEC Systems Research Center Report 56
%K 
%C 

%T An Extension of System F with Subtyping
%A L. Cardelli
%I card91
%S Digital Systems Research Center Report 80
%K 
%C 

%T Operations on Records
%A L. Cardelli, J.C. Mitchell
%I card91b
%S Mathematical Structures in Computer Science 1,1 pp3-48
%K 
%C 

%T Extensible Records in a Pure Calculus of Subtyping
%A L. Cardelli
%I card92
%S Digital Systems Research Center Report 81
%K 
%C 

%T On Implementing Prolog in Functional Programming
%A M. Carlsson
%I carl84
%S New Generation Computing 2, pp347-359, 1984, also Proceedings of the International Symposium on Logic Programming, Atlantic City, NJ, pp154-159, IEEE Computer Society Press, 1984, ISBN 0-8186-0522-7.
%K continuations, interpreters, PROLOG, logic-functional programming, backtracking, proof streams, structure sharing, structure copying, cut
%C This report surveys the techniques for implementing the programming language Prolog. It focuses on explaining the procedural semantics of the language in terms of functional programming constructs.

%T A Graphical User Interface in a Lazy Functional Language
%A M. Carlsson, T. Hallgren
%I carl93
%S fpca 93, pp321-330
%K X windows, toolkit, LML, menus, buttons, message passing, oracles, non-determinism, sequential, parallel, Motif, composition, Input, Output, combinators, layout, Panels, Life, stream processing, interaction
%C 

%T Some Lattice-based Scientific Problems, Expressed in Haskell
%A D.B. Carpenter
%I carp93
%S FAST project research paper, Southampton University dept. of Electronics and Computer Science
%K poisson equation, gauge theory
%C 

%T Linda in Context
%A N. Carriero, D. Gelernter
%I carr89
%S CACM 32,4, pp444-458
%K 
%C 

%T User Defined Data Types as an Aid to Verifying LISP Programs
%A R.S. Cartwright
%I cart76a
%S Automata, Languages and Programming, Edinburgh Univ. Press, 1976, pp228-296
%K 
%C 

%T A Practical Formal Semantic Definition and Verification System for Typed LISP
%A R.S. Cartwright
%I cart76b
%S Tech. Rep. AIM-296 Stanford A.I. Lab. --- also Ph.D. Thesis, Dept. Comp. Sci., Stanford University 1977
%K 
%C 

%T Recursive Programs as Functions in a First Order Theory
%A R.S. Cartwright
%I cart79
%S Proc. Intern. Conf. on Mathematical Studies of Information Processing, Kyoto, 1979
%K 
%C 

%T A Constructive Alternative to Axiomatic Type Definitions
%A R.S. Cartwright
%I cart80
%S In acm80
%K 
%C 

%T The Semantics of Lazy (and Industrious) Evaluation
%A R.S. Cartwright, P. Donahue
%I cart82
%S In acm82
%K laziness, computability, domains, retractions, axiomatisation, correctness, proof
%C 

%T Observable sequentiality and full abstraction
%A Cartwright, Felleisen
%I cart92
%S POPL 92
%K 
%C extended version is Rice Tech report tr91-167.  Both of these
are available by ftp from titan.cs.rice.edu in directory public/languages
This paper gives the first fully abstract denotational model for PCF
extended with errors.  In essence, the result says that since real
languages can produce errors, and programs can observe the order of evaluation through such errors, the model must reflect this.

%T A Functional Model for Describing and Reasoning About Time Behaviour of Computing Systems
%A P. Caspi, N. Halbwachs
%I casp86
%S Acta Informatica V22, pp 595-627
%K 
%C 

%T LUSTRE : A Declarative Language for Programming Synchronous Systems
%A P. Caspi, D. Pilaud, N. Halbwachs, J.A. Plaice
%I casp87
%S 14th POPL
%K 
%C 

%T Towards the Design of a Parallel Graph Reduction Machine: The MaRS Project
%A M. Castan, et al.
%I cast86
%S In LNCS 279
%K 
%C 

%T A Set of Combinators for Abstraction in Linear Space
%A M. Castan, M.-H. Durand, M. Lematre
%I cast87
%S Information Processing Letters, 24, pp183-188, 1987

%K 
%C 

%T A Calculus for Overloaded Functions with Subtyping
%A G. Castagna, G. Ghelli, G. Longo
%I cast92
%S In acm92, pp182-192
%K 
%C 

%T A Translator from FP to the Lambda Calculus
%A A. Cazes
%I caze87
%S Research Report RC12844, IBM Watson Research Center, Yorktown Heights, New York
%K 
%C 

%T LE LISP, a Portable and Efficient LISP System
%A J. Chailloux, M. Devin, J-M. Hullot
%I chai84
%S In acm84a, pp113-122
%K 
%C 

%T An Efficient Way of Compiling ML to C
%A E. Chailloux
%I chai92
%S ACM SIGPLAN Workshop on ML and its Applications, San Francisco, pp37-51
%K 
%C 

%T The Programming Methodology Group
%A 
%I chal83
%S Proc. Joint SERC/Chalmers Workshop on Declarative Programming, Univ. College London, 1983
%K 
%C 

%T Distributed Computing
%A F.B. Chambers, D.A. Duce, G.P. Jones, Eds
%I cham84
%S Academic Press, London, 1984, APIC Studies in Data Processing No. 20; ISBN 0-12-167370-2.

%K parallel, survey
%C 

%T An efficient Implementation of SELF ...
%A C. Chambers, D. Ungar, E. Lee
%I cham91
%S Lisp & Symbolic Computation 1991, 4, pp243-281 (and also OOPSALA 89?)
%K 
%C 

%T An Implementation of a Barotropic Numerical Weather Prediction Model in the Functional Language SISAL
%A P.S. Chang, G.K. Egan
%I chan90
%S SIGPLAN, 25, 3, pp109-117, 1990
%K 
%C 

%T A Distributed Function Computer with Dedicated Processors
%A R. Chattergy, U.W. Pooch
%I chat79
%S Comp. J. 22, pp37-40, 1979
%K 
%C 

%T The Applicability of SKI(BC) Combinators in a Parallel Rewrite Rule Environment
%A A. Cheese
%I chee85
%S Masters Thesis, DoCS, University of Manchester
%K 
%C 

%T A Fully Lazy Functional Language Computational Model
%A Andy Cheese
%I chee86
%S Univ. Nottingham CS, Tech. Rep. TR0016, 1986
%K flagship, graph reduction, packets, Alice, sharing of computation
%C 

%T Combinatory Code and a Parallel Packet-Based Computational Model
%A A. Cheese
%I chee87
%S SIGPLAN, 22, 4, pp49-58, 1987
%K graph reduction, implementation
%C 

%T A Nonrecursive List Compacting Algorithm
%A C.J. Cheney
%I chen70
%S CACM 13,11
%K list compacting, garbage collection, LISP, copying
%C 

%T Crystal: A Synthesis Approach to Programming Parallel Machines
%A M.C. Chen
%I chen85
%S In "First Conference on Hypercube Multiprocessors", Knoxville, Tennessee, ed. M.T. Health
%K dataflow
%C 

%T Transformations of Parallel Programs in Crystal
%A M.C. Chen
%I chen86
%S Information Processing '86, Elsevier North Holland 1
%K 
%C 

%T Very-high-level Parallel Programming by Aggregate Set Operations
%A M.C. Chen
%I chen86
%S YALEU/DCS/RR-499, Yale University,1986
%K 
%C 

%T A Design Methodology for Synthesizing Parallel Algorithms and Architectures
%A M.C. Chen
%I chen86b
%S YALEU/DCS/TR-457, Yale University, Dept. of CS, 1986
%K 
%C 

%T Crystal: Theory and Pragmatics of Generating Efficient Parallel Code
%A M. Chen, Y.-I. Choo, J. Li
%I chen91
%S In szym91, pp255-308
%K Compilation
%C 

%T Parametric Type Classes
%A K. Chen, P. Hudak, M. Odersky
%I chen92
%S In acm92, pp170-181
%K Haskell, type parameters, container classes, overloading data constructors and selectors, type inference, unification, type reconstruction, monads
%C 

%T On FP Languages Combining Forms
%A A. Chiarini
%I chia80
%S SIGPLAN 15,9, 1980
%K exponentiation, selective apply, conditional insert, generalised functional
%C 

%T The Translation of Miranda to FLIC
%A K.T. Chilcott
%I chil91
%S Department of Computer Science, University of Warwick,1991
%K 
%C Originally an undergraduate dissertation. A description of software for translating David Turner's lazy evaluation functional language Miranda to FLIC. This was originally a third-year undergraduate project, a continuation of Lord's work in 1987.

%T Automatic Methods for Program Transformation
%A W.N. Chin
%I chin90
%S Imperial College, London, 1990, PhD Thesis.
%K 
%C 

%T Safe Fusion of Functional Expressions
%A W-N. Chin
%I chin92
%S In acm92, pp11-20
%K transformation deforestation
%C 

%T Proving Memory Management Invariants for a Language Based on Linear Logic
%A J. Chirimar, C.A. Gunter, J.G. Riecke
%I chir92
%S In acm92, pp139-147
%K 
%C 

%T A LISP Compiler for FP Language and its Proof via Algebraic Semantics
%A C. Choppy, et al.
%I chop85
%S In LNCS 185
%K FP, algebraic semantics, sorts, initial algebra semantics, LISP, strictness, fixpoint semantics, correctness
%C 

%T User Manual for CERES
%A H. Christiansen
%I chri82
%S Dept. Comp. Sci., Aarhus University, Denmark, 1982
%K 
%C 

%T Syntax, Semantics, and Implementation Strategies for Programming Languages with Powerful Abstraction Mechanisms
%A H. Christiansen
%I chri85
%S Roskilde University Centre, Dept. Comp. Sci., Post Box 260, DK--4000, Denmark --- Report 1/1985, Also Proc. 18th Hawaii Conf. on System Sciences, 1985
%K abstraction, implementation, syntax, denotational semantics, attribute grammars, modularisation, top down compiling, recursive descent compiling, binding, generative languages
%C 

%T Backward Analysis for Higher-Order Functions Using Inverse Images
%A T-R. Chuang, B. Goldberg
%I chua91
%S TR DoCS, New York University
%K strictness analysis, abstract interpretation
%C We propose a method for performing backward analysis on
higher-order functional programming languages based on computing inverse images
of functions over abstract domains. The method can be viewed as abstract
interpretation done backward. Given an abstract semantics which supports
forward analysis, we can transform it into an abstract semantics which
performs backward analysis. We show that if the original semantics is
correct and computable, then the transformed version of the abstract semantics
is also correct and computable. More specifically, given a forward abstract
semantics of a higher-order functional language which is expressed in terms of
Scott-closed powerdomains, we derive a backward abstraction semantics which is
expressed in terms of Scott-open powerdomains. The derivation is shown to be
correct and the relationships between forward analysis and backward analysiss is
established. We apply this method to the classic strictness analysis in
functional languages and obtain promising results. We show that the time
complexity of inverse image based backward analysis is not much worse than the
forward analysis from which it is derived. We then compare this work with
previous works of Wadler, Hughes, and Burn, showing that some special
restrictions and constructions in previous works have natural interpretation in
the Scott-closed/Scott-open powerdomain framework. A brief outline of applying
the inverse image method to other backward semantics analysis is also given.
%T A Syntactic Approach to Fixed Point Computation on Finite Domains
%A T-R. Chuang, B. Goldberg
%I chua92
%S In acm92, pp109-118
%K 
%C 

%T A Set of Postulates for the Foundation of Logic Part I
%A A. Church
%I chur32
%S Ann. of Math. (2) 33-34, 346-366, 839-864, 1932-33
%K 
%C 

%T A Set of Postulates for the Foundation of Logic Part II
%A A. Church
%I chur33
%S Ann. of Math. (2) 34, 1933
%K 
%C 

%T An Unsolvable Problem of Elementary Number Theory
%A A. Church
%I chur36a
%S Amer. J. of Math 58, 1936
%K 
%C 

%T Some Properties of Conversion
%A A. Church, J.B. Rosser
%I chur36b
%S Trans. Amer. Math. Soc 39, 472-482
%K 
%C 

%T The Calculi of Lambda Conversion
%A A. Church
%I chur41
%S Princeton UP --- Kraus Reprint, 1971, --- also Annals of Mathematical Studies No. 6, Princeton University Press, 1941
%K 
%C 

%T Generating Parallelism from Strictness Analysis
%A Chris Clack, Simon L. Peyton Jones
%I clac85a
%S Dept. Comp. Sci., Univ. Coll. London Internal Note 1679, 1985 --- Also in Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K parallelism, lazy evaluation, strictness analysis, tutorial, measurement, degree of parallelism, simulation
%C 

%T Strictness Analysis --- A Practical Approach
%A Chris Clack, Simon L. Peyton Jones
%I clac85b
%S FPCA'85, Nancy, LNCS 201, pp35-49
%K parallelism, laziness, strictness, concurrency, fixed points, abstract interpretation
%C The authors discuss the use of strictness analysis to determine at compile time which parts of program evaluation can safely be carried out concurrently.

%T The Four-Stroke Reduction Engine
%A Chris Clack, Simon L. Peyton Jones
%I clac86
%S In acm86, pp220-232 and peyt87b
%K concurrency, parallelism, graph reduction, synchronisation, blocking, scheduling, colouring graphs
%C 

%T Efficient Parallel Graph Reduction on GRIP
%A C. Clack, S.L. Peyton Jones
%I clac88
%S Research Note RN/88/29, Department of Computer Science, University College London, London, 1988
%K 
%C This paper outlines some of the issues raised by parallel graph reduction and presents the solutions adopted in order to produce an efficient implementation.

%T Algorithm Classification through Synthesis
%A K.L. Clark, J. Darlington
%I clar80a
%S Computer J 23,1, 1980
%K sorting, transformation, specification
%C 

%T SKIM --- The S,K,I Reduction Machine
%A T.J.W. Clarke, P.J.S. Gladstone, C.D. MacLean, A.C. Norman
%I clar80b
%S In acm80, 128-135
%K hardware, combinators, reduction, SKIM, Small, machine architecture, microcode, performance
%C SKIM is a computer built to explore pure functional programming, combinators as a machine language and the use of hardware to provide direct support for a high level language. Its design stresses simplicity and aims at providing minicomputer performance (in its particular application areas) for microcomputer costs. This paper discusses the high level reduction language that SKIM supports, the way in which this language is compiled into combinators and the hardware and microcode that then evaluate programs.

%T A Relational Language for Parallel Programming
%A K.L. Clark, S. Gregory
%I clar81
%S in acm81, pp171-178
%K 
%C 

%T Logic Programming
%A Clark, Tarnlund, Eds.
%I clar82
%S Academic Press, 1982
%K 
%C 

%T S-K Reduction Engine for an Applicative Language
%A T.S. Clark
%I clar82b
%S Report UIUCDCS-R-82-1119, Dept CS, University of Illinois at Urbana-Champaign, IL, 1982, MSc Thesis.
%K SASL, parallel
%C 

%T m-PROLOG: Programming in Logic
%A K.L. Clark, F.G. McCabe
%I clar84a
%S Prentice-Hall, 1984
%K 
%C 

%T PARLOG: Parallel Programming in Logic
%A K.L. Clark, S. Gregory
%I clar84b
%S Imperial College, London Research Report DOC 84/4, 1984
%K 
%C 

%T A Preliminary Study of Fast Hardware Support for Combinator Reduction
%A T.J.W. Clarke
%I clar84c
%S Diploma Dissertation, Computer Lab., Cambridge, 1984
%K 
%C 

%T Assessing the Performance of Declarative Language Implementations
%A A.R. Clare, M.R. Sleep
%I clar86
%S SYS-C86-09, School of Information Systems, University of East Anglia, Norwich, 1986
%K lisp, prolog, logic, KRC

%C 

%T The D-RISC: An Architecture for use in Multiprocessors
%A T.J.W. Clarke
%I clar87a
%S LNCS 274 (FPCA Portland 1987), pp16-33
%K parallel, latency, bandwidth, concurrency
%C This paper explores the relationship between latency, bandwidth,
concurrency and CPU performance using both theory and concrete design analysis. The results are applied to uniprocessors, and to multiprocessors, where this architecture is shown to be particularly effective 

%T Parlog: The Language and its Applications
%A K.L. Clark
%I clar87b
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259
%K 
%C 

%T Implementing Aggregates in Parallel Functional Languages
%A T.J.W. Clarke
%I clar89
%S Univ. Cambridge Comp. Lab. Tech. Rep. 176
%K nondeterministic merge, I structures, A-threads, concurrency, referential transparency, multisets
%C 

%T The Semantics and Implementation of Aggregates or How to Express Concurrency without Destroying Determinism
%A T. Clarke
%I clar90
%S TR, Computing Lab., University of Cambridge
%K non determinism
%C 

%T Benchmarking Declarative Language Implementations
%A A.R. Clare, M.R. Sleep
%I clar89b
%S SYS-C89-09, School of Information Systems, University of East Anglia, Norwich, 1989
%K complexity
%C Six declarative language implementations and one conventional, von
Neumann language (Pascal), are tested using a non-trivial benchmark with linear, expected time complexity. The overall conclusion is that the performance of declarative language systems is beginning to match the performance of conventional, von Neumann language implementations, in terms of both absolute speed and scalability.

%T A generic Divide And Conquer kernel for the Meiko
computing surface
%A A.R. Clare
%I clar90
%S Preliminary report (Draft), School of Information
Systems, University of East Anglia, Norwich
%K 
%C 

%T Functional Programming for Rule-Based Systems
%A S. Clayman, C. Clack
%I clay91
%S Research Note RN/91/29, Department of Computer Science, University College, London, 1991
%K 
%C 

%T A Profiling Technique for Lazy, Higher-order Functional Programs
%A S. Clayman, D. Parrott, C. Clack
%I clay91b
%S University College London Research Report RN/92/24
%K 
%C This paper presents a technique for accurately profiling the time and space used by lazy, higher-order functional programs.  Using this technique we have constructed a profiler that can be used to monitor programs as they run and to build detailed trace information for post-mortem debugging.  Time profiling results are similar in nature to, but more accurate than, the UNIX imperative language profiler. The profiling technique is designed primarily for use by programmers rather than functional language implementors and the results directly reflect the lexical scoping of the source program, thus overcoming problems caused by compile-time program transformation, lazy evaluation, and higher order functions

%T Mathematical Specifications
%A J.C. Cleaveland
%I clea80
%S SIGPLAN 15,12, 1980
%K 
%C 

%T A Simple Applicative Language: Mini-ML
%A D. Clement, et al.
%I clem86
%S In acm86, pp13-27
%K 
%C 

%T Geometrization for Interactive Software Development
%A K. Clenaghan
%I clen89
%S In davi89b
%K 
%C 

%T Foundations of Actor Semantics
%A W. Clinger
%I clin81
%S MIT AI Tech. Rep. 633, 1981
%K 
%C 

%T Nondeterministic Call by Need is Neither Lazy nor by Name
%A W. Clinger
%I clin82
%S In acm82, pp 226-234 
%K call by need, call by name, laziness, nondeterminism, strictness
%C 

%T The Scheme 311 Compiler --- An Exercise in Denotational Semantics
%A W. Clinger
%I clin84
%S In acm84a, pp356-364
%K Scheme, denotational semantics, correctness
%C 

%T Implementation   Strategies  for  Continuations
%A W.D. Clinger, A.H.  Hartheimer, E.M.  Ost
%I clin88
%S In acm88, pp124-131
%K 
%C 

%T How to Read Floating Point Numbers Accurately
%A W.D. Clinger
%I clin90
%S pp92-101, SIGPLAN 25,6 --- '90 Conference on Programming Language Design and Implementation
%K IEEE floating point representation, decimal conversion, internal and external radixes, unlimited precision, overflow and underflow
%C 

%T Programming in PROLOG
%A W.F. Clocksin, C.S. Mellish
%I cloc81
%S Springer 1981
%K 
%C 

%T A Formalization of the Theory of Sets from the Point of View of Combinatory Logic
%A E.J. Cogan
%I coga55
%S Zeitschrift fr Mathematische Logik und Grundlagen der Mathematik 1, pp198-240, 1955
%K 
%C 

%T Garbage Collection of Linked Data Structures
%A J. Cohen
%I cohe81
%S Cumputing Surveys 13, pp343-367
%K 
%C 

%T Towards an Algebra of Nondeterministic Programs
%A A.T. Cohen, T.J. Myers
%I cohe82
%S In acm82
%K FP, nondeterminism
%C 

%T Eliminating Redundant Recursive Calls
%A N.H. Cohen
%I cohe83
%S TOPLAS 5, 1983
%K 
%C 

%T PARALISP Simulator (Reference Manual)
%A S. Cohen, R. Rosner, A. Zidon
%I cohe83b
%S Research Report 83-2, CS, Hebrew University, Jerusalem, Israel
%K 
%C 

%T Formes: an Object and Time Oriented System for Music Composition and Synthesis
%A P. Cointe, X. Rodet
%I coin84
%S In acm84a, pp85-95
%K 
%C 

%T Higher Order Functions for Parallel Evaluation
%A Murray Cole
%I cole88
%S Proc. Glasgow Wkshp. on Functional Programming, pp8-20, 1988
%K 
%C 

%T A `Skeletal' Approach to the Exploitation of Parallel Computation
%A M.I. Cole
%I cole88b
%S CONPAR 88, vol C, pp100-107, Manchester, BCS
%K para-functional programming
%C 

%T  Algorithmic Skeletons: Structured Management of Parallel Computation
%A M. Cole
%I cole89
%S Research Monographs in Parallel
and Distributed Computing, Pitman/MIT-Press
%K 
%C 

%T Towards Fully Local Multicomputer Implementations of Functional Programs
%A Murray Cole
%I cole90
%S University of Glasgow, report CSC 90/R7
%K MIMD, parallelism, architecture, locality, graph reduction, Caliban, GRRR, laziness, eagerness
%C 

%T Prolog and Infinite Trees
%A A. Colmerauer
%I colm82
%S In Logic Programming Eds. K.L. Clark, S.A. Tarnlund, Academic Press, 1982
%K 
%C 

%T Parallel Interpretation of Logic Programs
%A J.S. Conery, D.F. Kibler
%I cone81
%S In acm81, pp163-170
%K 
%C 

%T An Object Addressing Mechanism for Statically Typed Languages with Multiple Inheritance
%A R.C.H. Connor, A. Dearle, R. Morrison, A.L. Brown
%I conn89
%S OOPSLA '89 Proceedings, pp279-285
%K field selection, address maps, indirect addrssing, implicit subtyping
%C 

%T Binding Time Analysis for Higher Order Untyped Functional Languages
%A C. Consel
%I cons90
%S In acm90, pp264-272
%K partial evaluation, abstract interpretation
%C 

%T Type Theory as a Foundation for Computer Science
%A R.L. Constable
%I cons91
%S LNCS 526, pp226-243
%K 
%C 

%T For a Better Support of Static Data Flow
%A C. Consel, O. Danvy
%I cons91
%S In acm91, pp 496-519
%K 
%C 

%T MaRS, a Combinator Graph Reduction Multiprocessor
%A A. Contessa, et al.
%I cont89
%S PARLE '89, LNCS 365/366, pp 176-192
%K 
%C 

%T Adding Threads to Standard ML
%A E.C. Cooper, J.G. Morrisett
%I coop90
%S School of Computer Science, Carnegie Mellon, University, Pittsburgh, PA, Report CMU-CS-90-186, 1990
%K parallelism
%C 

%T Improving the Performance of SML Garbage Collection using Application-Specific Virtual Memory Management
%A E. Cooper, S. Nettles, I. Subramanian
%I coop92
%S In acm92, pp43-52
%K 
%C 

%T An Extended Polymorphic Type System for Applicative Languages
%A M. Coppo
%I copp80a
%S In LNCS 88
%K conjunction types, intersection types, polymorphism, syntax and semantics of types, type assignment
%C 

%T Principal Type Schemes and Lambda Calculus Semantics
%A M. Coppo, M. Dezani-Ciacagglini, B. Venneri
%I copp80b
%S In hind80
%K principal type schemes, omega normal forms, principal basis, model of lambda calculus
%C 

%T On the Semantics of Polymorphism
%A M. Coppo
%I copp83
%S Acta Inf. 20, pp159-170
%K 
%C 

%T Completeness of Type Assignment in Continuous Lambda Models
%A M. Coppo
%I copp84
%S Theoretical Computer Science 29,3, 1984
%K type schemes, type inference, approximate normal forms
%C 

%T Constructions: A Higher Order Proof System for Mechanising mathematics
%A T. Coquand, G. Huet
%I coqu85
%S INRIA Tech. Rep. 401, May 1985
%K 
%C 

%T A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction
%A T. Coquand, G.P. Huet
%I coqu86
%S Journal of Symbolic Computation 3,1, 1986
%K typed lambda calculus, Curry Howard isomorhism, higher order intuitionistic logic, computer aided proof checking
%C 

%T Sur l'Analogie entre les Propositions et les Types
%A T. Coquand
%I coqu86b
%S In cous85a, LNCS 242, pp71-84
%K automath, logic, natural deduction

%C Le but de ce papier est d'analyser l'analogie entre les propositions
(de la logique), et les types (d'un langage de programmation). Cette
analogie a texploite de mani\(`ere systmatique pour le projet Automath.

%T A Rehabilitation of Robinson's Unification Algorithm
%A J. Corbin, M. Bidoit
%I corb83
%S IFIP 83, North Holland, pp909-914
%K substitutions, graphs, complexity analysis
%C 

%T Type-dependent Parameter Inference
%A G.V. Cormack, A.K. Wright
%I corm90
%S pp127-136, SIGPLAN 25,6 --- '90 Conference on Programming Language Design and Implementation
%K polymorphism, overloading
%C 

%T A Parallel Implementation of SASL
%A J. Corovessis
%I corr82
%S Ph.D. Thesis, Dept. Comp. Sci., Univ. St.Andrews, Scotland, 1982
%K SASL, parallelism, simulation, scheduling strategies, measurement
%C 

%T Fundamental Properties of Infinite Trees
%A B. Courcelle
%I cour83
%S Theoretical Computer Science 25:1 pp95-169
%K 
%C Infinite types

%T Static Determination of Dynamic Properties of Programs
%A P. Cousot, R. Cousot
%I cous76
%S Proc. 2nd Internat. Symp. on Programming, 1976
%K 
%C 

%T Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction of Approximation of Fixed Points
%A P. Cousot, R. Cousot
%I cous77
%S Proc. 4th POPL, Los Angeles, 1977
%K abstract interpretation, static semantics, consistency, correctness, fixpoint approximation, symbolic evaluation
%C 

%T Systematic Design of Program Analysis Frameworks
%A P. Cousot, R. Cousot
%I cous79
%S Proc. 6th POPL, pp269-282
%K 
%C 

%T Combinators and Functional Programming Languages
%A G. Cousineau, P-L. Curien, B. Robinet, (Eds)
%I cous85a
%S Spring School of the LITP VAl d'Ajol, France, 1985, LNCS 242
%K 
%C 

%T The Categorical Abstract Machine
%A G. Cousineau, P-L. Curien, M. Mauny
%I cous85b
%S FPCA'85, Nancy, LNCS 201, pp50-64, also Science of Computer Programming 8, 173-202, also Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K combinators, rewrite rules, equations, CAM machine, architecture
%C This paper describes a very simple machine where categorical terms can be considered as code acting on a graph of values. The only saving mechanism is a stack containing pointers on code or on the graph. Abstractions are handled using closures.

%T Cobinateurs Catgoiques et Implmentation des Langages Fonctionnels
%A G. Cousineau, P-L. Curien, M. Mauny, A. Surez
%I cous85c
%S In cous85a, LNCS 242, pp85-103
%K 
%C L'approche dbouche sur une machine de type Von Neumann dont les termes forms de combinateurs catgoriques sont en quelque sorte le code.

%T On the Galois Connection and Widening/Narrowing Approaches in Abstract Interpretation
%A P. Cousot
%I cous92
%S Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K 
%C 

%T A Proposed Notation for a Functional Programming System
%A R.M. Cowan
%I cowa78
%S Burroughs Corp. Interactive Research Center, Makapuu Point, Waimanalo, Hawaii, 1978
%K 
%C 

%T Type Checking in Polymorphic Languages
%A A.J. Cowling
%I cowl86
%S Computer Journal, 29, 6, pp538-544, 1986
%K 
%C 

%T Compiling Functional Languages
%A S. Cox, H. Glaser, M. Reeve
%I cox88
%S Aspens 88, [john88a], pp145-156
%K 
%C 

%T Implementing Functional Languages on the Transputer
%A S. Cox, H. Glaser, M. Reeve
%I cox89
%S In davi89b, also Technical Report CSTR 89-4
Department of Electronics and Computer Science, University of Southampton, 1989
%K tuki code, laziness, parallelism
%C The aim of the work presented here is to develop a method for implementing lazy, curried functional languages for conventional architectures, giving performance comparable with imperative languages and supporting interlanguage working.

%T An Implementation of Static Functional Process Networks
%A S. Cox, S.-Y. Huang, P.H.J. Kelly, J. Liu, F. Taylor
%I cox92
%S LNCS ??, PARLE92
%K Caliban, parallelism
%C 

%T An Abstract Machine for the Normalization of l-terms
%A P. Crgut
%I creg90
%S In acm90, pp333-340
%K Krivine machine
%C 

%T An Optimizing ML to C Compiler
%A R. Cridlig
%I crid92
%S ACM SIGPLAN Workshop on ML and its Applications,
San Francisco, pp28-36
%K 
%C 

%T An Introduction to ALICE: a Multiprocessor Graph Reduction Machine
%A M. Cripps, T. Field, M. Reeve
%I crip87
%S In eise87
%K 
%C 

%T The Functional Power of Parameter Passage Mechanisms
%A A. Critcher
%I crit79
%S Proc. 6th POPL, 1979
%K 
%C 

%T Fine-grain Parallelism with Minimal Hardware Support: A Compiler-Controlled Threaded Abstract Machine
%A D.E. Culler, A. Sah, K.E. Schauser
%I cull91
%S SIGPLAN 26, 4, pp164-175
%K 
%C 

%T Another New Scheme for Writing Functional Operating Systems
%A J. Cupitt
%I cupi88
%S UKC Computing Laboratory Report No. 52, University of Kent, Canterbury, 1988
%K streams, Miranda, continuations
%C 

%T A Brief Walk Through KAOS
%A J. Cupitt
%I cupi89
%S UKC Computing Laboratory Report No. 58, University of Kent, Canterbury, 1989
%K streams, Miranda, continuations, operating systems
%C This report presenta an overview of the implementation of KAOS, a small multi-user, message passing operating system written by the author entirely in Miranda.

%T The Design and Implementation of an Operating System in a Functional Language
%A J. Cupitt
%I cupi90
%S Computing Laboratory, University of Kent
Canterbury, Kent, 1990, PhD Thesis.
%K KAOS, Miranda
%C 

%T Typed Categorical Combinatory Logic
%A P-L. Curien
%I curi85
%S In LNCS 185,1985
%K typed lambda calculus, cartesian closed categories, categorical combinators, categorical abstract machine
%C The subject of the paper is the connection between the typed l-calculus and the cartesian closed categories. Three languages and their theories are shown to be equivalent: typed lc-calculus, the free cartesian closed category $CCC sub K$ and the typed categorical combinatory logic $CCL sub K$ introduced by the author.

%T Categorical Combinators, Sequential Algorithms and Functional Programming
%A P.-L. Curien
%I curi86
%S Research Notes in Theoretical Computer Science, John Wiley, New York, 1986
%K 
%C 

%T Categorical Combinators
%A P.-L. Curien
%I curi86b
%S Information and Control, 69, 1-3, pp189-254, 1986
%K 
%C The author's main aim is to present the connection between l-calculus and cartesian closed categories both in an untyped and purely syntactic setting.


%T Grundlagen der Kombinatorischen Logik
%A H.B. Curry
%I curr30
%S American Journal of Mathematics, 52, 1930, pp509-536, pp789-834

%K 
%C 

%T The Paradox of Kleene and Rosser
%A H.B. Curry
%I curr41
%S Transactions of the American Mathematical Society, 50, 1941, pp454-516
%K 
%C 

%T The Inconsistency of Certain Formal Logics
%A H.B. Curry
%I curr42
%S Journal of Symbolic Logic, 7, 1942, pp115-117
%K 
%C 

%T Combinatory Logic, Vol. I
%A H.B. Curry, R. Feys, W. Craig
%I curr58
%S North Holland, 1958.
%K 
%C  Craig? Bohm says So --- bohm82. So does meir84 and macl90

%T Foundations of Mathematical Logic
%A H.B. Curry
%I curr63
%S McGraw-Hill, 1963
%K 
%C 

%T Combinatory Logic 1
%A H.B. Curry
%I curr68
%S In Contemporary Philosophy, R. Klibansky, Florence, pp295-307, 1968
%K 
%C 

%T Recent Advances in Combinatory logic
%A H.B. Curry
%I curr68b
%S Bulletin de la SocitMathmatique de Belgique, 20, 1968, pp288-298
%K 
%C 

%T Modified Functionality in Combinatory Logic
%A H.B. Curry
%I curr69
%S Dialectica, 23, 1969
%K 
%C 

%T Combinatory Logic, Vol. II
%A H.B. Curry, J.R. Hindley, J.P. Seldin
%I curr72
%S North Holland 1972
%K 
%C 

%T Flex Firmware
%A I.F. Currie, et al.
%I curr81
%S RSRE Report 81009, 1981
%K hardware, microcode, machine architecture, block structured languages, retention, stack and heap based languages
%C 

%T In Praise of Procedures
%A I.F. Currie
%I curr82
%S RSRE Memorandum 3499, 1982
%K first class citizenship for procedures, abstractions, encapsulations, packages, concurrency, security, implementation, binding
%C 

%T A Module System for Scheme
%A P. Curtis, J. Rauen
%I curt90
%S In acm90, 13-19
%K 
%C 

%T Simula -- an ALGOL-based Simulation Language
%A O.-J. Dahl, K. Nygaars
%I dahl66
%S CACM 9, 1966
%K 
%C 

%T Structured Programming
%A O.-J. Dahl, E.W. Dijkstra, C.A.R. Hoare
%I dahl72
%S Academic Press, 1972
%K 
%C 

%T Principal Type Schemes for Functional Programs
%A L.M.M. Damas, R. Milner
%I dama82
%S Proc. 9th ACM POPL Symp., pp207-212, Albuquerque, 1982
%K ML, polymorphism, principal type schemes, unification, type assignment algorithm, completeness
%C 

%T Type Assignment in Programming Languages
%A L.M.M. Damas
%I dama85
%S Ph.D. Thesis, Report CST--33--85, Dept. Comp. Sci., Edinburgh Univ., 1985
%K types, inference, polymorphism, overloading, non-applicative typing
%C 

%T Parallel Programming with Algorithmic Motifs
%A M. Danelutto, S. Pelagatti, M. Vanneschi
%I dane91
%S Hewlett-Packard Pisa Science Center Report HPL-PSC-91-16
%K skeletons
%C 

%T DOT: A Distributed Operating System Model of a Tree-Structured Multiprocessor
%A S. Danforth
%I danf83
%S Ph.D. Thesis, Univ. North Carolina, Chapel Hill, 1983
%K 
%C 

%T Arctic: A Functional Language for Real-Time Control
%A R.B. Dannenberg
%I dann84
%S In acm84a, pp96-103
%K real-time, asynchronous events
%C 

%T On Some Functional Aspects of Control
%A O. Danvy
%I danv88
%S Aspens 88, [john88a], pp445-450
%K 
%C 

%T Intensions and Extensions in a Reflective Tower
%A O. Danvy, K. Malmkjr
%I danv88
%S In acm88, pp327-341
%K 
%C 

%T Semantics-Directed Compilation of Non-Linear Patterns
%A O. Danvy
%I danv90
%S Indiana University CS Dept. TR 303
%K 
%C 

%T Abstracting Control
%A O. Danvy, A. Filinski
%I danv90b
%S In acm90, 151-160, revised version in Math. Struct. in Comp. Sci., 2, pp361-391
%K continuations, nondeterministic programming, semantics
%C Revised Version is called "Representing Control: A Study of the CPS transformation"

%T Back to Direct Style II: First-Class Continuations
%A O. Danvy, J.L. Lawall
%I danv92
%S In acm92, pp299-310
%K 
%C 

%T A System which Automatically Improves Programs
%A J. Darlington, R.M. Burstall
%I darl76
%S Acta Informatica 6, 1976, pp41-60
%K transformation, efficiency, recursion removal, elimination of common subexpressions, combining loops, compile time garbage collection
%C 

%T Program Transformation and Synthesis: Present Capabilities
%A J. Darlington
%I darl77
%S Research Report No. 77/43, Dept. of Computing and Control, Imperial College of Science and Technology, London (also appears as Report No. 48, Dept. of Artificial Intelligence, U. of Edinburgh)
%K NPL, list comprehension
%C 

%T An Abstract Scheme for a Multiprocessor Implementation of Applicative Languages
%A J. Darlington
%I darl80
%S Technical Report Series 156, P.C. Treleaven, p43-46, 1980, University of Newcastle-upon-Tyne, Proceedings of the Joint SRC/University of Newcastle-upon-Tyne Workshop on VLSI: Machine Architecture and Very High Level Languages

%K 
%C 

%T Alice, a Multiprocessor Reduction Machine for the Parallel Evaluation of Applicative Languages
%A J. Darlington, M. Reeve
%I darl81a
%S In acm81 pp65-76 --- also in turn82c
%K hardware, parallelism, VLSI, ALICE, reduction, packets, agents, lazy evaluation, eager evaluation
%C 

%T The Structured Description of Algorithm Derivations
%A J. Darlington
%I darl81b
%S In ``Algorithmic Languages'' ed. de Bakker, van Vliet, 1981 --- also in turn82c
%K algorithms, HOPE, transformation, methodology, synthesis, tactics, paradigm algorithms, fold, unfold, invited paper
%C 

%T Functional Programming and its Applications
%A John Darlington, Peter Henderson, Dave A. Turner, Eds.
%I darl82
%S Cambridge University Press, 1982
%K general
%C 

%T Program Transformation
%A J. Darlington
%I darl82b
%S In darl82, pp193-215
%K transformation, folding, unfolding, instantiation, abstract data types, recursion equation languages, HOPE, NPL
%C 

%T The Synthesis of Implementations for Abstract Data Types --- A Program Transformation Tactic
%A J. Darlington
%I darl83a
%S In ``Computer Program Synthesis Methodologies'', Ed. A.W.Biermann, G.Guiho, Reidel, 1983
%K abstract data types, recursion equation languages, HOPE, NPL
%C 

%T Unifying Logic and Functional Languages
%A J. Darlington
%I darl83b
%S Imperial College, 1983 and in ``Functional and Logic Programming'' ed. Degroot, Lindstrom, Prentice Hall, 1986
%K unification, logic programming, logical variables, absolute set abstraction, relations, set abstraction, substitution, evaluation strategy, imbedded variables, higher order, compilation, transformation, implementation
%C 

%T The Unification of Functional and Logic Languages
%A J. Darlington, A.J. Field, H. Pull
%I darl85
%S Imperial College, Research Report No. 85/3,
1985 - also in groo86, pp37-70
%K logic programming, HOPE, relational notation, non-ground objects, determinism, substitution, unification, types, evaluation strategies, higher order capabilities, compilation, interpretation, transformation, implementation
%C 

%T Program Transformation
%A J. Darlington
%I darl85b
%S Byte 10, 8, pp201-218, 1985
%K transformation, folding, unfolding, instantiation, abstraction, abstract data types, recursion equation languages, HOPE, NPL, correctness, completeness
%C 

%T Controlling the Behaviour of Functional Language Systems
%A John Darlington, L. While
%I darl87
%S LNCS 274, FPCA 1987 pp278-300
%K real time, trs, term rewriting
%C A methodology is presented that allows temporal constraints to be imposed on the behaviour of term-rewriting systems and in particular allows the evaluation order of pure functional programs to be constrained.


%T Software Development in Declarative Languages
%A J. Darlington
%I darl87b
%S In eise87, pp71-85
%K 
%C 

%T Narrowing and Unification in Functional Programming - an Evaluation Mechanism for Absolute Set Abstraction
%A J. Darlington, Y. Guo
%I darl88
%S Imperial College Tech. Rep.
%K 
%C 

%T An Introduction to the Flagship Programming Environment
%A J. Darlington et al.
%I darl88b
%S CONPAR 88, vol A, pp 75-86, Manchester, BCs
%K program transformation
%C 

%T The Unification of Functional and Logic Languages - Towards Constraint Functional Programming
%A J. Darlington, Y-K. Guo
%I darl89a
%S Proc. IEEE TENCON '89, Bombay -- also Imperial College report
%K 
%C 

%T A Functional Programming Environment Supporting Execution, Partial Execution and Transformation
%A J. Darlington,P. Harrison, H. Khoshnevisan, L. McLoughlin, N. Perry, H. Pull, M. Reeve, K. Sephton, L. While, S. Wright
%I darl89b
%S PARLE '89, LNCS 365/366
%K ALICE, hope, hope plus, parallelism
%C The functional language Hope+ is described, and an extension to the language is introduced that allows the use of logical variables. Then each of the transformation technologies that has been developed is described.

%T Programming Parallel Computer Systems using Functional Languages and Program Transformation
%A J. Darlington, M. Reeve, S. Wright
%I darl89c
%S In "Parallel Computing 89", Elsevier Science Publishers (North Holland), 1990
%K 
%C This paper provides an overview of one program development methodology developed at Imperial College, and presents a case study that illustrates its operation and quantifies its benefits using results of experiments carried out on the ALICE parallel machine.


%T Constraint Equation Deduction
%A J. Darlington, Y-K. Guo
%I darl90
%S LNCS 516, Conditional and Typed Rewriting Systems
%K 
%C 

%T Structured Parallel Functional Programming

%A J. Darlington, A. Field, P. Harrison, D. Harper, G. Jouret, P. Kelly, K. Sephton, D. Sharp

%I darl91
%S in glas91, pp31-52
%K 
%C 

%T A Study of the use of Abstraction in Program Specification and Verification
%A J.A. Darringer, M.S. Laventhal
%I darr78
%S IBM Watson Research Center, report RC7184
%K 
%C 

%T The Architecture and System Method of DDM-1: A Recursively Structured Data Driven Machine
%A A.L. Davis
%I davi78
%S Proc. 5th Annual Symp. on Computer Architecture, IEEE, ACM
%K 
%C 

%T Variable Access in Languages in which Procedures are First Class Citizens
%A Antony J.T. Davie
%I davi79
%S St.Andrews University Dept. Comp. Sci. Report CS/79/2, 1979
%K retention, implementation, heap based languages, block structured languages, display mechanism, IDEA, Euler, closures
%C 

%T Recursive Descent Compiling
%A A.J.T. Davie, R. Morrison
%I davi81
%S Ellis Horwood Ltd. 1981
%K 
%C 

%T Data Flow Program Graphs
%A A.L. Davis, R.M. Keller
%I davi82
%S Computer, 1982, 15, 2, pp26-41
%K dataflow, graphical, tokens 
%C 

%T Conditional Declarations and Pattern Matching
%A Antony J.T. Davie
%I davi85
%S In ``Persistence and Data Types'' --- Papers for the Appin Workshop, Ed. M. Atkinson, P.~Buneman & R. Morrison, Persistent Programming Research Report 16, Universities of St.Andrews and Glasgow, 1985
%K pattern matching, conditional declarations, ZF notation
%C 

%T A Persistent Toolset for an Applicative Environment
%A A. Davie
%I davi88
%S Aspens 88, [john88a], pp477-486 also St.Andrews University Department of Computational Science Report Staple/St.A/88/5
%K 
%C The STAPLE Esprit Project is building a set of tools to provide an
applicative prototyping facility stored in a persistent database. This paper describes the organisation of the toolset, the tools themselves and reasons that a persistent object management system is an appropriate vehicle with which to implement such a toolset.


%T CASE - A Lazy Version of an SECD Machine with a Flat Environment
%A A.J.T. Davie, D.J. McNally
%I davi89a
%S Proc. IEEE TENCON '89, Bombay, also University of St.Andrews Department of Computational Science Report St.A/88/2
%K graph reduction, SECD machine, environments, variable lookup, laziness, operational semantics, measurement
%C This document describes a variation of Landin's classical SECD machine but its environment is organised in a novel efficient way based on a method given in a report by Davie. It has features allowing the execution of code to reflect a lazy semantics.


%T Functional Programming, Glasgow 1989

%A K. Davis, J. Hughes, Eds
%I davi89b
%S Springer Verlag 0-387-19609-9, 1989
%K general
%C workshop, Fraserburgh August 1989
British Computer Society Workshops in Computing Series; ISBN 3-540-19609-9??


%T Backwards Strictness Analysis: Proved and Improved
%A K. Davis, P. Wadler
%I davi89c
%S In davi89b, Functional Programming, Glasgow 1989
%K projections
%C 

%T Declarative Systems
%A G. David, R.T. Boute, B.D. Shriver, Eds.
%I davi90
%S Proc. IFIP TC 10/WG 10.1 Workshop on Concepts and Characteristics of Declarative Systems, Budapest, 1988
%K general, opeartional semantics, distributed concurrent systems, specification theory, fixpoints in infinite domains, laziness, non-computational objects, data diffusion machine, data coherency protocols, data parallelism, parallel graph reduction, SDP, distributed logic programming, combining functional and logic programming, Common Abstract Machine, data dependency analysis of prolog programs, abstract interpretation, Ruby, hardware algorithms, logic
%C 

%T Statically Typed Applicative Persistent Language Environment (STAPLE) Reference Manual
%A A.J.T. Davie, D.J. McNally
%I davi90b
%S Research Report CS/90/14, Department of Mathematical and Computational Sciences, University of, St. Andrews,1990
%K 
%C 

%T Strictness Analysis in 4D
%A K. Davis, P. Wadler
%I davi91
%S In peyt91b, pp23-43
%K backwards analysis
%C 

%T A Note on the Choice of Domains for Projection-Based Program Analysis
%A K. Davis
%I davi91b
%S 1991 Glasgow Workshop on Funct. Prog., Portree, Springer-Verlag
%K 
%C 

%T An Introduction to Functional Programming Systems using Haskell
%A A. Davie
%I davi92
%S CUP, Cambridge Computer Science Texts 27, ISBN 0 521 25830 8 (hard) & 0 521 27724 8(paperback), 1992
%K 
%C An introduction to fp for undergraduates and postgraduates. Programming, implementation, correctness and theory are all covered.

%T Analysing Functions by Projection-based Backward Abstraction
%A K. Davis
%I davi92c
%S 1992 Glasgow Workshop on Funct. Prog., Ayr, Springer Verlag
%K 
%C 

%T Analysing Functions by Projection-Based Backward Abstraction
%A K. Davis
%I davi93
%S Glasgow University fp group research report
%K 
%C 

%T Higher-order Binding-time Analysis
%A K. Davis
%I davi93b
%S ACM PEPM '93
%K 
%C 

%T Improved Effectiveness from a Real Time LISP Garbage Collector
%A Jeffrey L. Dawson
%I daws82
%S In acm82
%K garbage collection, real time, compaction, storage management
%C 

%T Parallel Garbage Collection for Graph Machines
%A A. Deb
%I deb86
%S In LNCS 279
%K 
%C 

%T Least Fixed Points Revisited
%A J.W. de Bakker
%I deba75
%S LNCS 37, pp27-61
%K 
%C 

%T Algorithmic Languages
%A J.W. de Bakker, H. van Vliet, Eds.
%I deba81
%S North Holland, 1981
%K languages, festschrift for van Wijngaarden, general
%C 

%T Languages for Parallel Architectures - Design, Semantics, Implementation Models
%A J.W. de Bakker, Ed.
%I deba89
%S Wiley, 1989
%K 
%C 

%T Lambda Calculus Notation with Nameless Dummies: A Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem
%A N.G. De Bruijn
%I debr72
%S Indag Math. 34, pp 381-392
%K 
%C 

%T Optimizing Almost-Tail-Recursive Prolog Programs
%A Saumya K. Debray
%I debr85
%S FPCA'85, Nancy, LNCS 201, pp204-219
%K logic programming, transformation, tail recursion
%C This paper illustrates how problems of the transformation from top-down specification to bottom-up implementation, namely nondeterminism and the order in which variables get bound, can be handled in certain cases, and the transformation mechanized, using algebraic properties of operators. 

%T Task Granularity Analysis in Logic Programs
%A S.K. Debray, N-W. Lin, M. Hermenegildo
%I debr90
%S SIGPLAN 25, 6, pp174-188
%K 
%C 

%T On the Operational Semantics of Distributed Concurrent Systems
%A P. Degano, R. Nicola, U. Montanari
%I dega90
%S in 
%K concurrency, CCS, rewriting rules, labelled rewriting system, temperal ordering
%C 

%T Logic Programming: Functions, Relations and Equations
%A D. DeGroot, G. Lindstrom
%I degr86
%S Prentice Hall, 1986
%K 
%C 
This is a duplicate entry for groo86

%T Proceedings of the ACM ISCA '89 Workshop on Architectural Support for Delarative Programming
%A D. DeGroot and P. Biswas, Eds.
%I degr89
%S Eilat, Israel
%K 
%C 

%T An Illustration of a Methodology for the Construction of Efficient Systolic Architectures
%A J-M. Delosme, I.C.F. Ipsen
%I delo85
%S Proc. 2nd Internat. Symp. on VLSI Technology, Systems and Applications, ITRI, NSC pp 268-273
%K 
%C 

%T Data Types as Values: Polymorphism, Type-Checking, Encapsulation
%A A.J. Demers, J.E. Donahue, G. Skinner
%I deme78
%S Proc. 5th POPL, Tucson, 1978
%K 
%C 

%T Revised Report on the Programming Language Russel
%A A.J. Demers, J.E. Donahue
%I deme79
%S TR79--389, Dept. Comp. Sci., Cornell Univ., 1979
%K 
%C 

%T Data Types Parameters and Type Checking
%A A.J. Demers, J.E. Donahue
%I deme80
%S Proc. 7th POPL,Las Vegas, 1980
%K Russell, static type checking, signatures
%C parcftp.xerox.com:pub/russell/russell.tar.Z contains a (barely maintained) compiler, a fair amount of documentation, and pointers to other papers.


%T Making Variables Abstract: An Equational Theory for Russell
%A A.J. Demers, J.E. Donahue
%I deme83
%S Proc. 10th POPL,Austin, 1983
%K state, equations, language principles, environments, assignment, aliasing
%C parcftp.xerox.com:pub/russell/russell.tar.Z contains a (barely maintained) compiler, a fair amount of documentation, and pointers to other papers.


%T Data Types are Values
%A A. Demers, J. Donahue
%I deme85
%S TOPLAS 7 pp426-445
%K 
%C 

%T First Version of a Data Flow Procedure Language
%A Jack B. Dennis
%I denn74a
%S Colloque sur la Programmation, Ed. B. Robinet, Springer Verlag 1974
%K 
%C 

%T A Preliminary Architecture for a Basic Dataflow Computer
%A Jack B. Dennis, D.P. Misunas
%I denn74b
%S Proc. 2nd Annual Symp on Computer Architecture. ACM, IEEE pp126-132
%K 
%C 

%T The Varieties of Data-Flow Computers
%A Jack B. Dennis
%I denn79a
%S Proc. 1st Int. Conf. on Distributed Computer Systems, 1979
%K 
%C 

%T A Highly Parallel Processor Using a Data Flow Machine Language
%A Jack B. Dennis
%I denn79b
%S MIT Lab. for Computer Science, MIT, CSG Memo. 134--1, 1979
%K 
%C 

%T Data should not Change --- A Model for a Computer System
%A Jack B. Dennis
%I denn81
%S In acm81  ?? not in proceedings
%K 
%C 

%T The MIT Data-Flow Engineering Model
%A Jack B. Dennis, et al.
%I denn83
%S IFIP '83 --- Proc. 9th World Computer Congress, Paris, Ed. R.E.A.~Mason, ISBN 0--444--86729--5, Elsevier, North Holland, 1983
%K hardware, data flow, packet communication network, routing network, arrays, fault diagnosis
%C 

%T VIM: An Experimental Multi-User System Supporting Functional Programming
%A Jack B. Dennis, J. Stoy, B. Guharoy
%I denn84
%S Proc. Internat. Workshop on High Level Computer Architecture, Los Angeles, 1984
%K 
%C 

%T Modeling the Weather with a Data Flow Supercomputer
%A J.B. Dennis, G.R.Gao, K.Todd
%I denn84b
%S IEEE Transactions on Computers, July 1984
%K 
%C 

%T Garbage Collection on the IRM

%A M. Derbyshire
%I derb87
%S Report Number 6, Ref. no. FS/MU/MHD/004-87
University of Manchester, Department of Computer Science, 1987
%K parallelism, flagship
%C This report specifies a mark-scan garbage collection algorithm for the IRM.

%T Programming-in-the-Large versus Programming-in-the-Small
%A F. DeRemer, H. Kron
%I dere76
%S IEEE Trans SE-2 (June) 80-86
%K 
%C 

%T Orderings for Term-Rewriting Systems
%A N. Dershowitz
%I ders82
%S Theoretical Computer Science 17,3, 1982
%K termination, simplification orderings, Boolean logic
%C 

%T Computing with Rewrite Systems
%A N. Dershowitz
%I ders83
%S Tech. Rep. Aerospace no. ATR83 (8478)--1, The Aerospace Corporation El Segundo California 90245, 1983 - also Information and Control 65:122-157, 1985
%K 
%C 

%T Equations as Programming Language
%A N. Dershowitz
%I ders84
%S IEEE Proc. 4th Jerusalem Conference Information Technology (JCIT), 1984
%K term rewriting systems, directed equations, Knuth-Bendix completion procedure, correctness
%C 

%T Equational Programming
%A N. Dershowitz, D.A. Plaisted
%I ders85a
%S To appear in ``Machine Intelligence 11'' ed. D. Michie, et al., 1985
%K conditional equations, directed equations, logic-applicative programming, conditional rewrite rules, conditional narrowing
%C 

%T Logic Programming cum Applicative Programming
%A N. Dershowitz, D.A. Plaisted
%I ders85b
%S IEEE Proc. Symp. on Logic Programming, Boston, 1985
%K conditional equations, directed equations, rewriting, logic cum applicative programming, conditional narrowing
%C 

%T Simulating Multiprocessor Architectures for Compiled Graph-Reduction
%A J.M. Deschner
%I desc89
%S In davi89b
%K 
%C 

%T Parallel Graph Reduction
%A B.D.T. Dessau
%I dess90
%S Department of Computer Science, University of Warwick, 1990Coventry
%K 
%C Originally an undergraduate dissertation.

%T An Efficient, Incremental, Automatic Garbage Collector
%A L.P. Deutch, D.G. Bobrow
%I deut76
%S CACM 19,9, 1976
%K storage management, garbage collection, LISP, on the fly, incremental
%C 

%T A Functional Program for the Fast Fourier Transform
%A F.-J. de Vries
%I devr88
%S SIGPLAN, 23, 1, pp67-74, 1988
%K Miranda
%C 

%T Unique Normal Forms for Combinatory logic with Parallel Conditional
%A R. de Vrijer
%I devr90
%S ITLI Prepublication CT-90-09, Institute for Language, Logica and Information, University of Amsterdam, NL, 1990
%K 
%C 

%T Complexity of Lambda-Term Reductions
%A M. Dezani-Ciancaglini, S. Ronchi Della Rocca, L. Saitta
%I deza79
%S RAIRO Informatique Thoretique, 13, 1979, pp257-287

%K 
%C 

%T On Proving Termination of "Loop Program" Rewriting Systems
%A A.J.J. Dick, M. Thomas
%I dick88
%S Proc. Glasgow 1988 Workshop, hall89, pp21-38
%K 
%C 

%T A Polymorphic Type System with Subtypes for Prolog
%A R. Dietrich, F. Hagl
%I diet88
%S LNCS 300, pp79-93, 2nd European Symp. on Programming, Nancy, March 1988
%K logic programming, dataflow, inheritance, type checking, type inference
%C 

%T Exploiting Non-Determinism through Laziness in Guarded Functional Languages
%A R. Dietrich, H.C.R. Lock
%I diet91
%S LNCF 494, pp201-216
%K guarded functional programming, logic programming, horn clauses, SLD resolution, pattern matching, goal seeking, stream comprehensions
%C 

%T Go To Statement Considered Harmful
%A E.W. Dijkstra
%I dijk68
%S CACM, 11, 1968, pp147-148
%K 
%C 

%T A Discipline of Programming
%A E.W. Dijkstra
%I dijk76
%S Prentice-Hall, 1976
%K 
%C 

%T On the Fly Garbage Collection: An Exercise in Cooperation
%A E.W. Dijkstra, L. Lamport, A.J. Martin, C.S. Scholten, E.F.M. Steffens
%I dijk78a
%S CACM 21,11, 1978, also EWD520, 1975
%K garbage collection, multiprocessing, cooperating sequential processes, minimised mutual exclusion, correctness
%C 

%T A Mild Variant of Combinatory Logic
%A E.W. Dijkstra
%I dijk80a
%S Document EWD 735
%K 
%C 

%T On the Productivity of Recursive Definitions
%A E.W. Dijkstra
%I dijk80b
%S Document EWD 749
%K 
%C 

%T A Somewhat Open Letter to D.A. Turner
%A E.W. Dijkstra
%I dijk80c
%S Document EWD 759
%K 
%C 

%T D.A. Turner's Reply
%A E.W. Dijkstra
%I dijk80d
%S Document EWD 770
%K 
%C 

%T Hamming's Exercise in SASL
%A E.W. Dijkstra
%I dijk81a
%S Document EWD 792
%K 
%C 

%T Canonical String Reduction
%A E.W. Dijkstra
%I dijk81b
%S Document EWD 808
%K 
%C 

%T About the Correctness of a Few SASL Programs
%A E.W. Dijkstra
%I dijk82a
%S Document EWD 825
%K 
%C 

%T A Very Simple Exercise in SASL
%A E.W. Dijkstra
%I dijk82b
%S Document EWD 827
%K 
%C 

%T Compiling Functional Languages
%A A. Diller
%I dill88
%S Addison-Wesley, London, 1988, ISBN 0 471 92027 4
%K 
%C 

%T Extended Unification Algorithms for the Integration of Functional Programming into Logic Programming
%A M. Dincbas, P. van Henternryck
%I dinc87
%S J. Logic Programming 4:197-227, 1987
%K 
%C 

%T Definition of the Semantics of Programming Language Constructs in Terms of Lambda-Calculus: I
%A V.N. Domrachev, Yu.V. Kapitanova, L.G. Samoilenko
%I domr81
%S Kibernetika, 5, pp19-23, 1981
%K 
%C 

%T Exception Handling in Functional Programming Languages
%A C.B. Dornan, K. Hammond
%I dorn89
%S SYS-C89-10, School of Information Systems, University of East Anglia, Norwich, 1989
%K lambda sigma model
%C This paper discusses the incorporation of exception handling facilities into pure functional programming languages. A new model of exception-handling based on the error value approach, the \(*c-model, is introduced.


%T An Algebraic Semantics of Backus' Functional Programming Language with Infinite Data Objects
%A W. Dosch, B. Mller
%I dosc83
%S In LNCS ??
%K 
%C 

%T Busy and Lazy FP with Infinite Objects
%A W. Dosch, B. Mller
%I dosc84
%S In acm84a, pp282-292
%K FP, laziness, eagerness, busy evaluation, non-strict evaluation, Sigma-Algebras, Term-Algebras, rewriting systems, FP style, infinite objects
%C 

%T Correct Computation Rules for Recursive Languages
%A P.J. Downey, R. Sethi
%I down76
%S SIAM Journal of Computing 5, 1976
%K 
%C 

%T A Compositional Analysis of Evaluation-Order and Its Application
%A M. Draghigescu, S. Purushothaman
%I drag90
%S In acm90, pp242-250
%K strictness analysis
%C 

%T A Concept for Functional Programming and Distributed Data Processing in a Local Area Network and its Implementation
%A T.T. Drashansky
%I dras90
%S SIGPLAN, 25, 7, pp11-18, 1990
%K 
%C 

%T Proposal for HOPE Reference Manual
%A S. Drosopoulou
%I dros86
%S Imperial College Functional Programming Research report IC/FPR/LANG/2.5.1/8
%K HOPE
%C 

%T Computation on Arbitrary Algebras
%A A. Dubinsky
%I dubi75
%S LNCS 37, pp319-341
%K 
%C 

%T Bibliography on Data Types
%A D.M. Dungan
%I dung79
%S SIGPLAN 14,11, 1979
%K bibliography, specific languages, abstractions, theoretical foundations
%C 

%T Lower Bounds on the Complexity of 1-time Only Branching Programs
%A P.E. Dunne
%I dunn84
%S Theory of Computation Report 66, Department of Computer Science, University of Warwick
Coventry, 1984
%K 
%C 

%T Univalent Functions
%A P.L. Duren
%I dure83
%S ISBN 0--387--90795--5 Springer, 1983
%K 
%C 

%T The Go-Faster Computer
%A T. Durham
%I durh84a
%S Computing the Magazine (London) Nov. 15, 1984
%K 
%C 

%T Asserting Assertional Style
%A T. Durham
%I durh84b
%S Computing 8, 1984
%K 
%C 

%T An Admired Combination
%A T. Durham
%I durh84c
%S Computing the Magazine (London) May 10, 1984
%K Miranda, combinators, reduction, lazy evaluation, variable free programming
%C 

%T German Temporal Prepositions from an English Perspective
%A M. Durrell, D.S. Bre
%I durr91
%S Technical Report UMCS-AI-91-12-3, Department of Computer Science, University of Manchester, 1991
%K 
%C 

%T Synchronising the I/O Behaviour of Functional Programs with Feedback
%A A. Dwelly
%I dwel87
%S Information Processing Letters 28, pp45-51
%K lazy, interleaving
%C 

%T Functions and Dynamic User Interfaces
%A A. Dwelly
%I dwel89
%S FPCA, Imperial College, 1989, pp371-381
%K menus, graphics, windows, dialogue, combinators

%C Sometimes called "Dialogue Combinators and Dynamic ..."

%T On the Sequential Nature of Unification
%A C. Dwork, P. Kanellakis, J.C. Mitchell
%I dwor84
%S J. Logic Programming 1, pp35-50
%K 
%C 

%T Program Verification in a Logical Theory of Constructions
%A Peter Dybjer
%I dybj85
%S FPCA'85, Nancy, LNCS 201, pp334-349
%K logic, correctness
%C The logical theory of constructions is a simple theory which
combines functional programs and intuitionistic predicate calculus. Here it is proposed that it is a practical alternative to other constructive programming logics.


%T Inverse Image Analysis Generalizes Strictness Analysis
%A P. Dybjer
%I dybj88
%S Aspens 88, [john88a], pp109-128
%K 
%C 

%T Parsers and Partial Evaluation: An Experiment
%A H. Dybkjr
%I dybk85
%S DIKU student report 85-7-15, University of Copenhagen
%K 
%C 

%T C-Scheme
%A R.K. Dybvig
%I dybv83
%S MS Thesis, CS Technical Report 149, Indiana University, Bloomington
%K 
%C 

%T Expansion-Passing Style: Beyond Conventional Macros
%A R.K. Dybvig, D.P. Friedman, C.T. Haynes
%I dybv86
%S In acm86, pp143-150
%K 
%C 

%T Three  Implementation  Models  for  Scheme
%A R.K. Dybvig
%I dybv87
%S Ph.D. Thesis, CS Tech. Rep. 87-011, University of North Carolina at Chapel Hill
%K 
%C He presents a heap based Scheme compiler and then develops a crippled stack-based Scheme compiler which doesn't support first-class functions, call/cc or tail-call eliminiation.  He then shows how to add them all back resulting in a compiler that is similar to the one used in his Chez Scheme system (a commercial Scheme system).

%T A Variable-Arity Procedural Interface
%A R.R. Dybvig, R. Hieb
%I dybv88
%S In acm88, pp106-115
%K 
%C 

%T A New Approach to Procedures with Variable Arity
%A R.K. Dybvig, R. Hieb
%I dybv90
%S Indiana Univ. CS TR301
%K 
%C 

%T Speedup Versus Efficiency in Parallel Systems
%A D.L. Eager, J. Zahorjan, E.D. Lazowska
%I eage86a
%S Tech Rep. 86-08-01, Univ. Sasketchewan
%K 
%C 

%T Adaptave Load Sharing in Homogeneous Distributed Systems
%A D.L. Eager, J. Zahorjan, E.D. Lazowska
%I eage86b
%S IEEE Trans. Soft. Engin. SE-12, pp662-675, 1986
%K 
%C 

%T Speedup Versus Efficiency in Parallel Systems
%A D.L. Eager, J. Zahorjan, E.D. Lazowska
%I eage89
%S IEEE Trans. Comput 38(3), pp408-23, 1989
%K 
%C 

%T Specification of Reduction Strategies in Term Rewriting Systems
%A M.C.J.D. van Eekelen, M.J. Plasmeijer
%I eeke86
%S In LNCS 279, pp215-239
%K TRS
%C Three formal methods for specifying reduction strategies in TRS's
are presented.

%T Concurrent Clean (version 0.6/0.7)
%A M.C.J.D. van Eekelen, E. Ncker, M.J. Plasmeijer, S. Smetsers
%I eeke90
%S Tech. Rep. University of Nijmegen
%K 
%C 

%T Logic Enhancement: A Method for Extending Logic Programming Languages
%A P.R. Eggert, D. Schorre
%I egge82
%S In acm82
%K logic programming, PROLOG, extensible languages, equations, macros, modules, inverse functions
%C 

%T Typed Meaning in Scott's l-Calculus Models
%A H. Egli
%I egli75
%S LNCS 37, pp220-239
%K 
%C 

%T Derivation of Communicating Processes from Equational Systems
%A M.C. Eglin, J. Julliand
%I egli90
%S Report CRIN 90-R-151, Centre de Recherche en Informatique de Nancy
Vandoeuvre-les-Nancy
1990

%K 
%C 

%T Inconsistencies of Pure LISP
%A A. Eick, E. Fehr
%I eick83
%S LNCS 145, pp101-110, 1983
%K 
%C 

%T Declarative Languages: An Overview
%A S. Eisenbach, C. Sadler
%I eise85
%S Byte 10,8, 1985, pp181-200
%K survey, history, glossary
%C 

%T Functional Programming - Languages, Tools and Architectures
%A S. Eisenbach
%I eise87
%S Ellis Horwood, ISBN 0-85312-973-8, 1987
%K general
%C This book on functional programming reflects current research being undertaken by the Declarative Language Architecture Section at Imperial College, and shows how functional programming languages can result in concise and formally-correct programs which can easily exploit the parallelism of multi-processor machines.


%T SIMPLE:  Part I, An Exercise in Future Scientific Programming
%A K. Ekanadham, Arvind
%I ekan87
%S Technical report CSG Memo 273, Computation Structures Group, MIT  Simultaneously published as IBM/T.J. Watson Research Center, Report 12686
%K 
%C 

%T A Perspective on Id
%A K. Ekanadham
%I ekan91
%S In szym91, pp197-254
%K 
%C 

%T Teaching Recursion Using Fractals in Prolog
%A B.S. Elenbogen, M.R. O'Kennon
%I elen88
%S SIGCSE 20, pp263-266
%K turtle graphics, Koch Snowflake
%C 

%T Algebras and Combinators
%A E. Engeler
%I enge79
%S Eidgenssische Technische Hochschule, Institut fr Informatik, Zrich, 1979
%K 
%C 

%T mFP: An Envbironment for the Multi-level Spec., Analysis, and Synthesis of Hardware Algorithms
%A M. Ercegovac, M. Schlag, D. Patel
%I erce85
%S FPCA'85, Nancy, LNCS 201, pp238-255
%K hardware, vlsi
%C The goal of this research effort is to provide designers with an
environment in which they can rapidly explore alternative designs for their algorithms throughout the synthesis process.


%T Plexus II - A Data Flow System
%A L. Erkio, J. Heimonen, P. Hietala, R. Kurki-Suonio
%I erki81
%S Symposium on Functional Languages and Computer Architecture, Laboratory for Programming Methodology, Chalmers University of Technology
Gteborg, 1981, pp184-229
%K 
%C 

%T On the Partial Computation Principle
%A Andrei P. Ershov
%I ersh77
%S Information Processing Letters 6,2, 1977
%K compilation, interpreters, optimisation
%C 

%T The Transformation Machine: Theme and Variations
%A Andrei P. Ershov
%I ersh??
%S ??
%K 
%C 

%T PAL - a language for Teaching Programming Linguistics
%A A. Evans
%I evan68
%S Proc. 23rd National Computing Conference, 1968
%K PAL, languages, teaching
%C 

%T Ponder and its Type System
%A Jon Fairbairn
%I fair82
%S University of Cambridge Tech. Rep. 31, 1982(3?) --- and Polymorphism --- The ML/LCF/Hope Newsletter I,2, 1983
%K 
%C 

%T A New Type-Checker for a Functional Language
%A Jon Fairbairn
%I fair85a
%S Science of Computer Programming, 6 - Also In ``Persistence and Data Types'' --- Papers for the Appin Workshop, Ed. M. Atkinson, P. Buneman & R. Morrison, Persistent Programming Research Report 16, Universities of St. Andrews and Glasgow, 1985
%K Ponder, types, polymorphism, type checking, abstract types
%C 

%T Removing Redundant Laziness from Supercombinators
%A Jon Fairbairn
%I fair85b
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K PONDER, super combinators, strictness detection, redundant laziness, folding, compile time reduction, optimization
%C 

%T Design and Implementation of a Simple Typed Language Based on the Lambda Calculus
%A Jon Fairbairn
%I fair85c
%S Tech. Rep. 75, Computer Lab., Cambridge Univ., 1985 (Ph. D. Thesis)
%K 
%C 

%T Code Generation Techniques for Functional Languages
%A Jon Fairbairn, Stuart Wray
%I fair86b
%S In acm86, pp94-104
%K 
%C 

%T A Simple Abstract Machine to Execute Supercombinators
%A Jon Fairbairn
%I fair86b
%S In LNCS 279
%K abstract machine, supercombinators, operational semantics, laziness, architecture
%C The Original TIM Paper?

%T Tim: A Simple, Lazy Abstract Machine to Execute Supercombinators
%A Jon Fairbairn, S. Wray
%I fair87
%S LNCS 274, FPCA 1987, pp34-46 - also University of Glasgow Dept. Comp. Sci. report CSC/87/R6, 1987
%K TIM, combinator reduction, supercombinators, architecture, lazy evaluation, normal order reduction, compilation, optimisations, strictness analysis, hardware
%C This paper is a description of the three instruction machine Tim. Tim
usually executes programs faster than the G-Machine style of abstract
machine while being at least as easy to implement as an S-K combinator reducer.


%T Making Form Follow Function: An Exercise in Functional Programming Style
%A J. Fairbairn
%I fair87b
%S Software 17, 6, 1987, pp379-386
%K infix operators

%C The combined use of user-defined infix operators and higher-order
functions allows the programmer to invent new control structures
tailored to a particular problem area.

%T A Simple Abstract Machine to Execute Supercombinators
%A J. Fairbairn
%I fair87c
%S LNCS 279, pp49-52
%K 
%C This paper gives a brief description of an abstract machine into which supercombinators may be compiled. The description comprises a presentation of the instruction set of the machine, followed by the operational semantics of the normal order version, the algorithm to convert combinators to instructions and an outline of how the machine may be altered to perform lazy evaluation.


%T A Correctness Proof for Combinator Reduction with Cycles
%A W.M. Farmer, J.D. Ramsdell, R.J. Watro
%I farm90
%S TOPLAS, 12, 1, pp123-134, 1990
%K 
%C Turner popularized a technique of Wadsworth in which a cyclic graph rewrite rule is used to implement reduction of the fixed point combinator Y. The theoretical foundations of this approach are examined.


%T Context Approximation for Functional Languages
%A J. Farrell
%I farr92
%S Ph.D. Thesis, University of Queensland
%K backward analysis, strictness analysis, abstract interpretation
%C 

%T Graph Reduction
%A Joe H. Fasel, R.M. Keller
%I fase86
%S LNCS 279, Proceedings of a Workshop at Santa F, New Mexico, Springer-Verlag, 1986
%K conference, models, architecture, resource control, performance monitoring, measurement, simulation, arrays, logic programming
%C 

%T A Call-by-Need Implementation of Syntax Directed Functional Programming
%A H. Fassbender, H. Vogler
%I fass90
%S Informatik-Bericht Nr. 90-22, RWTH Aachen, Fachgruppe Informatik, Aachen, 1990
%K 
%C To appear in Formal Aspects of Computing.

%T The pLucid Programming Manual
%A A.A. Faustini, S.G. Matthews, A.Ag. Yaghi
%I faus83
%S Department of Computer Science, Arizona State University, Tempe, AZ
%K dataflow
%C 

%T Design of a Text Formatter
%A M.S. Feather
%I feat79
%S Dept. AI, Univ. Edinburgh, 1979
%K 
%C 

%T A System for Developing Programs by Transformation
%A M.S. Feather
%I feat79b
%S Ph.D. Thesis U. of Edinburgh, 1979
%K 
%C 

%T Program Specification Applied to a Text Formatter
%A M.S. Feather
%I feat82
%S IEEE Transactions on SE--8,5, 1982
%K 
%C 

%T A System for Assisting Program Transformation
%A M.S. Feather
%I feat82b
%S TOPLAS 4,1, pp1-20
%K program development
%C 

%T A Survey and Classification of some Program Transformation Approaches and Techniques
%A M.S. Feather
%I feat87
%S In 'Program Specification and Transformation' L.G.L.T. Meertens (Ed.), Proc. IFIP TC2/WG2.1 Working Conf., North Holland
%K 
%C 

%T Deux Approches a'  L'implantation  du  Language
      Scheme
%A M. Feeley
%I feel86
%S M.Sc. Thesis, Dpartement  d'Informatique  et de Rcherche Oprationelle, University of Montreal
%K 
%C 

%T A Parallel Virtual  Machine for  Efficient  Scheme  Compilation
%A M.Feeley, J.S. Miller
%I feel90
%S In acm90, 119-130
%K Gambit, scheme, PVM, portability
%C 

%T The "Simplest Functional Programming Language" is neither Simple nor Functional
%A E. Fehr
%I fehr83
%S SIGPLAN, 18, 4, 1983, pp55-57
%K 
%C 

%T Expressive Power of Typed and Type-Free Programming Languages
%A E. Fehr
%I fehr84
%S Theoretical Computer Science 33, 2/3, 1984
%K static typing, dynamic typing, models of lambda calculus, lambda schemes, initial algebras
%C 

%T Functional Specifications of a Text Editor
%A Gary Feldman
%I feld82
%S In acm82
%K editors, FP, methodology, specification, pattern matching
%C 

%T A Closer Look at Export and Import Statements
%A M. Felleisen, D.P. Friedman
%I fell85
%S Indiana University Dept. Comp. Sci. Technical Report 184, 1985
%K syntactic extensions, import, export, modular programming, SCHEME
%C 

%T Control Operators, the SECD-Machine and the Lambda-Calculus
%A M. Felleisen, D.P. Friedman
%I fell86a
%S Indiana University Dept. Comp. Sci. Technical Report 197, 1986
%K control operators, J, extended lambda calculus, Church Rosser subcalculus, diamond property, order of evaluation, CEK machine, CC machine
%C 

%T Reasoning with Continuations
%A M. Felleisen, et al.
%I fell86b
%S Indiana University Dept. Comp. Sci. Technical Report 191, 1986
%K continuations, jump operators, abort or stop operator, soundness, Church Rosser property, incompleteness, consistency, standardization, programming with continuations
%C 

%T A Reduction Semantics for Imperative Higher Order Languages
%A M. Felleisen, D.P. Friedman
%I fell87
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259
%K 
%C 

%T Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps
%A M. Felleisen
%I fell88
%S In acm88, pp52-62
%K 
%C 

%T l-v-CS: An Extended l-Calculus for Scheme
%A M. Felleisen
%I fell88b
%S In acm88, pp72-85
%K 
%C 

%T On the Expressive Power of Programming Languages
%A M. Felleisen
%I fell91
%S Science of Computer Programming, 17, pp35-75, also prelim. version in LNCS 432, pp134-151
%K 
%C 

%T Encoding a Dependent-Type l-Calculus in a Logic Programming Language
%A A. Felty, D. Miller
%I felt90
%S Rapport de Recherche No. 1259
INRIA, Sophia-Antipolis, 1990
%K lambda LF hereditary harrop formula
%C 

%T Livermore Loops in Sisal
%A J. Feo
%I feo87
%S LLNL Tech Report UCID-21159
%K 
%C 

%T An Iterative Powerdomain Construction
%A A. Ferguson, R.J.M. Hughes
%I ferg89
%S In davi89b
%K abstract interpretation
%C 

%T Dictionary of Symbols in Mathematical Logic
%A R. Feys, F.B. Fitch
%I feys69
%S North Holland, 1969
%K 
%C 

%T The Compilation of FP/M Programs into Conventional Machine Code
%A A.J. Field
%I fiel85
%S Department of Computer Science, Imperial College
London, 1985
%K 
%C 

%T Functional Programming
%A A.J. Field, P.G. Harrison
%I fiel88
%S Addison Wesley, ISBN 0-201-19249-7
%K HOPE, general, optimisation, graph reduction
%C An excellent book. Subject is introduced using HOPE language. Gives a good treatment on graph reduction and optimization

%T Incremental Reduction in the Lambda Calculus
%A J. Field, T. Teitelbaum
%I fiel90
%S In acm90, pp307-322
%K 
%C 

%T A Prolog Interpreter Working with Infinite Terms
%A M. Filgueiras
%I filg84
%S In ``Implementations of PROLOG'' Ed. J.A. Campbell, ISBN 0--85312--675--5, Ellis Horwood, 1984
%K Prolog, infinite data structures, reentrant structures, unification, output
%C 

%T Starship Version 0.2 Reference Manual
%A M.A. Firth, C. Runciman
%I firt90
%S Dept. CS, Univ. of York
%K transformation support
%C 

%T A Fold/Unfold System for a Non-Strict Language
%A M.A. Firth
%I firt90
%S DPhil thesis, YCST 90/09, CS, University of York
%K 
%C 

%T Efficiency of Equivalence Algorithms
%A M.J. Fischer
%I fisc72a
%S In ``Complexity of Computer Computations'', Plenum Press, 1972
%K 
%C 

%T Lambda Calculus Schemata
%A M.J. Fischer
%I fisc72b
%S In Proc. ACM Conf. on Proving Assertions about Programs --- SIGPLAN ??, 1972
%K 
%C 

%T Combinatory Logic and Negative Numbers
%A F.B. Fitch
%I fitc74
%S The Logical Way of Doing Things, K. Lambert, Yale University Press, New Haven, CT, pp265-277, 1974
%K 
%C 

%T A Pure and Really Simple Functional Algebraic Language
%A J.P. Fitch, J.A. Padget
%I fitc84
%S In LNCS 174
%K symbolic computation, symbolic algebra, LISP, eager evaluation, lazy evaluation, normal order reduction, ASLISP, REDUCE, Parsifal
%C 

%T Structuring FP-Style Functional Programs
%A A.C. Fleck
%I flec86
%S Computer Languages, 11, 2, pp55-63, 1986
%K 
%C 

%T A Case Study Comparison of Four Declarative Programming Languages
%A A.C. Fleck
%I flec87
%S Dept. of CS, University of Iowa, Tech. Rep. 87-05, 1987
%K Miranda, FP, Equations, Prolog, expressive power, performance, Murskii's Algebra, qualitative comparison,readability, Pascal
%C 

%T Assigning Meanings to Programs
%A R.W. Floyd
%I floy67
%S Proc. Amer. Math. Soc. Symposia in Applied Mathematics 19, 1967
%K semantics, flowcharts, preconditions, postconditions, axioms, verification, validation, proof of correctness, termination
%C 

%T The Paradigms of Programming
%A R.W. Floyd
%I floy79
%S CACM 22,8, 1979
%K 
%C 

%T Law and order in algorithmics
%A M.M. Fokkinga
%I fokk92
%S Ph.D. Thesis, Twente University, 1992
%K 
%C 

%T Manchester Dataflow Machine: Benchmark Test Evaluation Report
%A J. Foley

%I fole89
%S Technical Report UMCS-89-11-1, Department of Computer Science, University of Manchester, 1989
%K 
%C 

%T The Expressiveness of Simple and Second Order Type Structures
%A S. Fortune, D. Leivant, M. O'Donnell
%I fort85
%S JACM 30, 1 pp151-185
%K 
%C 

%T Parallel Programming with Algorithmic Motifs
%A I. Foster, R. Stevens
%I fost90
%S Argonne National Laboratory Preprint MCS-P124-0190
%K skeletons
%C 

%T Productive Parallel Programming: The PCN Approach
%A I. Foster, R. Olson, S. Tuecke
%I fost92
%S Preprint version of article in Scientific Programming, Vol. 1, pp.51-66
%K 
%C Try "ftp info.mcs.anl.gov" and cd to /pub/pcn.  Pcn (Program Composition Notation) is an excellent functional parallel language.

%T Compilation of Functional Languages by Program Transformation
%A P. Fradet, D. Le Mtayer
%I frad91
%S TOPLAS 13,1, pp21-51 - also Rapport de Recherche No. 1040, INRIA, Rocquencourt, 1989, Publication Interne No. 465.

%K 
%C In this paper the authors describe the compilation process in terms of program transformations in the functional framework. The original function expression is transformed into a functional term which can be seen as a traditional machine code. The two main steps are the compilation of the computation rule by the introduction of continuation functions and the compilation of the environment management using combinators.


%T Specification of Data Structures for FP Programs
%A G.A. Frank
%I fran82
%S In acm82, pp221-228
%K 
%C 

%T Library Utility and Graph Plotter for the FLAB Functional Language Implementation System
%A D.J. Francis
%I fran88
%S Functional Language Implementation Project Document 20. Univs. Warwick/Birmingham, CS Dept.
%K 
%C Originally an undergraduate dissertation.

%T What is an Efficient Implementation of the l-Calculus?
%A G.S. Frandsen, C. Sturtivant
%I fran91
%S LNCS 523, pp289-312, also DAIMI-344, Computer Science Department, Aarhus University, Aarhus, 1991
%K 
%C Flawed.

%T On the Meaning of Names in Programming Systems
%A A.G. Fraser
%I fras71
%S CACM 14,6, 1971
%K file, operating system, languages, names, context, scope, binding, abstraction, directory, name space, environment
%C 

%T The Systematic Reduction of VDM Specification
%A A.P. French, G.P. McKeown, V.J. Rayward-Smith
%I fren90
%S SYS-C90-02, School of Information Systems,, University of East Anglia, Norwich, 1990

%K 
%C 

%T Handling Function Definitions Through Innermost Superposition and Rewriting
%A L. Fribourg
%I frib85
%S In LNCS 202
%K SLOG, logic interpreter, superposition, eager evaluation, negative knowledge, equational clauses
%C 

%T CONS Should not Evaluate its Arguments
%A D.P. Friedman, D.S. Wise
%I frie76a
%S In `Automata, Languages and Programming' Eds. Michaelson & Milner, Edinburgh Univ. Press, 257-284
%K 
%C 

%T Recursive Programming Through Table Lookup
%A D.P. Friedman, D.S. Wise, M. Wand
%I frie76b
%S ACM Symposium on Symbolic and Algebraic Computation New York, 1976
%K tables, laziness, memo functions, suspended evaluation, generation, streams, infinite lists, dynamic own
%C 

%T Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures
%A D.P. Friedman, D.S. Wise
%I frie76c
%S Information Processing Letters 5,6, 1976
%K suspended evaluation, reference counts, lazy evaluation, LISP, suspensions, garbage collection, demand driven
%C 

%T The Impact of Applicative Multiprogramming on Multiprocessing
%A D.P. Friedman, D.S. Wise
%I frie76d
%S Proceedings of the 1976 International Conference on Parallel Processing, P.H. Enslow, 1976, pp263-272

%K 
%C 

%T Aspects of Applicative Programming for File Systems
%A D.P. Friedman, D. Wise
%I frie77
%S SIGPLAN 12,3, 1977 - and Technical Report 56, Computer Science Department, Indiana University, Bloomington, IN, 1977
%K 
%C 

%T Aspects of Applicative Programming for Parallel Processing
%A D.P. Friedman, D.S. Wise
%I frie78a
%S IEEE Transactions on Computing C--27,4, 289-296
%K compiling, combinations, FP style, LISP, multiprocessing, recursion, suspensions, laziness, combinators
%C 

%T Functional Combination
%A D.P. Friedman
%I frie78b
%S Computer Languages 3,1, 1978, pp31-35
%K multi valued functions, combination
%C 

%T Unbounded Computational Structures
%A D.P. Friedman, D.S. Wise
%I frie78c
%S Software 8, 1978
%K infinite data structures, coroutines, suspended evaluation, lazy evaluation, protection, sieve of Eratosthenes, prime numbers, streams functions, call by need, sorting
%C 

%T A Note on Conditional Expressions
%A D.P. Friedman, D.S. Wise
%I frie78d
%S CACM 21,11, 1978, pp931-933
%K parallel evaluation, suspended cons, lazy evaluation, conditionals, infinite data structures, streams, ambiguity operator
%C 

%T Unwinding Stylized Recursions into Iterations
%A D.P. Friedman, D.S. Wise
%I frie78e
%S Indiana University Dept. Comp. Sci. Technical Report 19, 1978
%K 
%C 

%T Applicative Programming
%A D.P. Friedman
%I frie79
%S Proceedings of the 1979 National Computer, Conference, New York, AFIPS Press, Montvale, NJ, pp89-91, 1980
%K 
%C 

%T Reference Counting can Manage the Circular Environments of Mutual Recursion
%A D.P. Friedman, D.S. Wise
%I frie79a
%S Information Processing Letters 8,1, 1979, pp41-45
%K garbage collection, Y combinator, storage management, threads, closures, funarg problem, lexical scoping, ISWIM, LISP, reference counts, mutual recursion, knot tieing, circular environments
%C 

%T An Approach to Fair Applicative Multiprogramming
%A D.P. Friedman, D. Wise
%I frie79b
%S In LNCS 70, pp203-225
%K ordered sequences, unordered multisets, frons, fairness, stinging, implementation, floaters, EUREKA
%C 

%T Applicative Multiprogramming
%A D.P. Friedman, D. Wise
%I frie79c
%S Tech. Rep. 72, Indiana University CS Dept.
%K ordered sequences, unordered multisets, frons, fairness, stinging, implementation, floaters, EUREKA distributed computing
%C 

%T A Constructor for Applicative Multiprogramming
%A D.P. Friedman, D.S. Wise
%I frie79d
%S Indiana University Dept. Comp. Sci. Technical Report 80, 1979
%K 
%C 

%T An Indeterminate Constructor for Applicative Programming
%A D.P. Friedman, D.S. Wise
%I frie80
%S Proc. 7th POPL,Las Vegas, 1980
%K parallelism, sequences, multisets, nondeterminism, constructors, anihilators
%C 

%T Lambda-Normal Forms in an Intensional Logic for English
%A J. Friedman, D. Warren
%I frie80b
%S Studia Logica, 39, pp311-324, 1980

%K 
%C 

%T Reification: Reflection without Metaphysics
%A D.P. Friedman, M. Wand
%I frie84a
%S In acm84a, pp348-355
%K reification, reflection, interpretation, environment
%C 

%T Programming with Continuations
%A D.P. Friedman, et al.
%I frie84b
%S NATO ASI Series F8, 1984
%K continuations, jumps, labels, meta circular interpreters, devils and angels problem, backtracking, control objects
%C 

%T The Scheme 84 Reference Manual
%A D.P. Friedman, et al.
%I frie85a
%S Indiana University Dept. Comp. Sci. Technical Report 153, 1985
%K SCHEME, LISP, lexical scoping, tail recursion, teaching, parallel processing, engine, fluid identifiers, reference manual
%C 

%T Constraining Control
%A D.P. Friedman, C.T. Haynes
%I frie85b
%S Indiana University Dept. Comp. Sci. Technical Report 170 , 1985
%K continuations, escapes, labels, control abstraction, extensible languages, control structures
%C 

%T Essentials of  Programming Languages
%A D.P. Friedman, M. Wand, C.T. Haynes
%I frie92
%S MIT Press and McGraw Hill
%K 
%C continuation passing style is discussed among other things.

%T Constructing Natural Language Interpreters in a Lazy Functional Language
%A R. Frost, J. Launchbury
%I fros89
%S Computer Journal, Special Issue on Lazy Functional Programming 32(2), pp108-121
%K 
%C The authors describe a method by which language parsers and interpreters may be implemented in a lazy functional programming language. The visual appearance of such interpreters mimics the BNF description of the grammar of the language being interpreted.

%T Role of Logic Programming in the FGCS Project
%A K. Fuchi, K. Furukawa
%I fuch91
%S LNCS 526, pp311-325
%K 
%C 

%T Type Inference with Subtypes
%A Y-C. Fuh, P. Mishra
%I fuh88
%S LNCS 300, pp94-114, 2nd European Symp. on Programming, Nancy, March 1988
%K principal types, syntactic completeness, coercions, type checking, polymorphism, soundness, consistency
%C 

%T Design and Implementation of Functional Language with Subtypes
%A Y-C. Fuh
%I fuh89
%S PhD Thesis, SUNY at Stony Brook, 1989
%K 
%C 

%T A Multithreaded Processor Architecture for Parallel Symbolic Computation
%A T. Fujita
%I fuji87
%S Report MIT/LCS/TM-338, Laboratory for Computer Science, MIT, Cambridge, MA, 1987
%K 
%C This paper describes the Multilisp Architecture for Symbolic Applications (MASA), which is a multithreaded processor architecture for parallel symbolic computation with various features intended for effective Multilisp program execution.

%T Modelling the Combination of Functional and Logic Programming Languages
%A U. Furbach, S. Hlldobler
%I furb86
%S Journal of Symbolic Computation 2, 1986
%K logic programming, Horn clause logic, FHCL, functional closure, implementation, extended unification, correctness, functional closure, completeness, invertibility
%C 

%T Towards Functional Programming in Prolog
%A A.L. Furtado
%I furt88
%S SIGPLAN, 23, 3, pp43-51, 1988

%K 
%C 

%T Iteration for Applicative Languages
%A A.L. Furtado, P.A.S. Velosa
%I furt88b
%S SIGPLAN, 23, 12, pp86-94, 1988

%K 
%C 

%T A Hierarchical Structuring Method for Functional Software Systems
%A K. Futatsugi, K. Okada
%I futa82
%S Sixth Intern. Conf. on SE, Tokyo, IEEE Press, 1982
%K 
%C 

%T Principles of OBJ2
%A K. Futatsugi, et al.
%I futa85
%S Proc. 12th POPL, 1985
%K OBJ2, equational logic, generic modules, parameterised modules, subsorts, implementation techniques, encapsulation, parametric polymorphism, inheritance, theories, views, modularity, abstract data types, error handling, interpreter generator, rewrite rule engine, algebraic semantics
%C 

%T Performance of LISP Systems
%A R.P. Gabriel, L M. Masinter
%I gabr82
%S In acm82

%K performance, benchmarking, implementation, efficiency
%C 

%T Queue-based Multi-processing Lisp
%A R.P. Gabriel, J. McCarthy
%I gabr84
%S In acm84a, pp25-45
%K 
%C 

%T A Simplifier for Untyped Lambda Expressions
%A L. Galbiati, C. Talcott

%I galb90
%S Report No. STAN-CS-90-1337, Department of Computer Science, Stanford University, CA, 1990
%K 
%C 

%T Specification of Distributed Processes
%A R.M. Gallimore, D. Coleman
%I gall82
%S In LNCS 134
%K KWIC index, specification, process networks, program development, refinement, concurrent systems, bags, streams
%C 

%T Proceedings of the Workshop on Programs as Data Objects, Copenhagen 1985
%A Ed. H. Ganzinger, Neil D. Jones
%I ganz85a
%S LNCS 217, Springer-Verlag, Copenhagen 1985
%K strictness analysis, rewriting, operational semantics, code generation, abstract interpretation, data flow analysis, Martin-lf type theory, partial evaluation, program transformation
%C 

%T Modular First-Order Specifications of Operational Semantics
%A H. Ganzinger
%I ganz85b
%S In LNCS 217
%K operational semantics, partial evaluation, binding, PROLOG
%C 

%T L10: Un Lenguaje Estrictamente Funcional
%A M.I. Garcia Clemente, J.A. Maas Argemi

%I garc85
%S FIM/22.1/ARQ/85/, Departmento de Estructuras de Computadores, Facultad de Informatica, Universidad Politecnica, Madrid, 1985
%K 
%C 

%T Specification of Compilers as Abstract Data Type Representations
%A M.-C. Gaudel
%I gaud80
%S In LNCS 94
%K compiler specification, correctness, verification, compiler generators, abstract data types
%C 

%T Multiprocessor Systems Programming in a High-Level Data-Flow Language
%A J.L. Gaudiot, L.T. Lee
%I gaud87
%S LNCS 258, pp134-151
%K dataflow transputer sisal
%C A complete programming environment which translates a complex data-flow program graph into occam has been developed and is presented in this paper.

%T SIGNAL: A Declarative Language for Synchronous Programming of Real-Time Systems
%A T. Gautier, P. Le Guernic, L. Besnard
%I gaut87
%S LNCS 274, FPCA Portland, 1987, pp257-277
%K 
%C An applicative language, SIGNAL, is presented, designed to program
real-time systems. The language is based on a synchronous notion of time. It is assumed the execution of operations have a zero logical time duration; then, the sequence of communication events determines entirely atemporal reference. SIGNAL is  a data-flow language.

%T An Interpreter for SLIPS - An Applicative Language Based on Lambda Calculus
%A V. Gehlot, Y.N. Srikant
%I gehl86
%S Computer Languages, 11, 1, pp1-13, 1986
%K 
%C An applicative language based on LAMBDA-Calculus is presented. The language, SLIPS (Small Language for Instruction PurposeS) is described using the LAMBDA-Calculus as a metalanguage.


%T A FORTRAN-Compiled List Processing Language
%A H. Gelernter, J.R. Hansen, C.L. Gerberich
%I gele60
%S JACM 7,2, pp87-101
%K 
%C 

%T Generative Communication in Linda
%A D. Gelernter
%I gele85
%S TOPLAS, 7,1, pp80-112
%K 
%C 

%T Development and Analysis of Scientific Applications Programs on a 1204-processor Hypercube
%A R.E. Genner, J.L. Gustafson, R.E. Montry
%I genn88
%S SAND 88-0317, Sandian National Labs., Albuquerque, 1988
%K parallelism
%C 

%T A Scheme for Implementing Functional Values on a Stack Machine
%A M.P. Georgeff
%I geor82
%S In acm82
%K partial application, environment management
%C 

%T Transformations and Reduction Strategies for Typed Lambda
%A M.P. Georgeff
%I geor84
%S TOPLAS 6,4, pp603-631
%K evaluation strategies, efficiency, implementation, reflexive types, strong typing, SECD machine, stack machine
%C 

%T Multiple Representations of Abstract Data Types
%A K.M. George, D.D. Fisher, G.E. Hedrick
%I geor88
%S Report OSU-CIS-TR-88-08, Oklahoma State Univ., Dept. of Computing and Info. Sciences

%K views
%C 

%T An Abstract Machine for Parallel Graph Reduction
%A L. George
%I geor89a
%S in acm89, pp214-229
%K shared memory
%C An abstract machine for parallel graph reduction on a shared memory
multiprocessor is described. This is intended primarily for normal order evaluation of functional programs.

%T Expansions in the Algebra of FP
%A K.M. George, G.E. Hedrick
%I geor89b
%S Report OSU-CIS-TR-89-07, Oklahoma State Univ., Dept. of Computing and Info. Sciences

%K 
%C 

%T Modular Proof of Strong Normalization for the Calculus of Constructions
%A H. Geuvers, M.-J. Nederhof
%I geuv91
%S JFP, 1, 2, pp155-189, 1991

%K 
%C 

%T A Simple and Efficient Implementation Approach for Single Assignment Languages
%A K. Gharachorloo, V. Sarkar, J.L. Hennessy
%I ghar88
%S In acm88, pp259-268
%K 
%C 

%T A Class Abstraction for a Hierarchical Type System
%A G. Ghelli
%I ghel90
%S LNCS 470, pp56-71
%K subtypes, classes, multiple inheritance, first class types
%C 

%T FACILE: A Symmetric Integration of Concurrent and Functional Programming
%A A. Giacalone, P. Mishra, S. Prasad
%I giac89
%S International Journal of Parallel Programming, 18, 2, 1989, pp121-160, also LNCS 352, pp184-209
%K 
%C 

%T Effectively Given Domains and Lambda-Calculus Models
%A P. Giannini, G. Longo
%I gian84
%S Information and Control 62,1, 1984
%K neighbourhood systems, Rice-Shapiro theorem, lambda calculus models, graph computability, inverse limit construction
%C 

%T Algebras for Tree Algorithms
%A J. Gibbons
%I gibb91
%S D. Phil thesis, Oxford University, available as technical monograph PRG-94, Oxford University Programming Research group
%K accumulations on trees
%C My thesis ("Algebras for Tree Algorithms", PRG, Oxford, 1991, available as technical monograph PRG-94) is about accumulations on trees, a particular kind of higher-order operation on trees. I've just written one and a half papers on implementing these accumulations efficiently on PRAM machines. David Skillicorn believes that the data-parallel
style induced by higher-order operators makes a good
architecture-independent parallel programming language.

%T Integrating Functional and Imperative Programming
%A D.K. Gifford, J.M. Lucassen
%I giff86
%S In acm86, pp28-38
%K 
%C 

%T An LCF Axiomatization of Lazy Lists
%A ??. Giles
%I gile78
%S CSR--31--78, Dept. Comp. Sci., Edinburgh Univ., 1978
%K 
%C 

%T Continuation-Based Parallel Implementation of Functional Languages
%A J.-F. Giorgi, D. Le Mtayer
%I gior90
%S In acm90 209-217, revised version in Math. Struct. in Comp. Sci., 2, pp393-414
%K 
%C Revised version is called "Continuation-based compilation of functional languages for parallel machines"

%T Une Extension de l'Interprtation de Gdel a l'Analyse, et son Application a ...
%A J-Y. Girard
%I gira71
%S Proc 2nd Scandinavian Logic Symp. ed. J.E. Fenstad pp63-92, North Holland 1971
%K 
%C 

%T Linear Logic
%A J-Y. Girard
%I gira87
%S Theoretical CS 50, pp1-102
%K 
%C 

%T Schema Recognition for Program Transformations
%A J.S. Givler, R.B. Kieburtz
%I givl84
%S In acm84a, pp74-84
%K FP, pattern matching, reduction systems
%C 

%T Principles of Functional Programming
%A Hugh Glaser, Chris L. Hankin, David Till
%I glas84
%S ISBN 0137091486 and 013709163X Prentice-Hall, 1984
%K general, SUGAR, lambda-calculus, interpretation, SECD machine, SK reduction, semantics, LISP
%C 

%T Another Implementation Technique for Applicative Languages
%A H. Glaser, S. Haynes
%I glas86
%S ESOP 86, LNCS 213, 1986, pp70-81
%K data flow, TUKI, supercombinator reduction, laziness
%C This paper presents a particularly simple data flow model which is
similar to supercombinator reduction, supporting higher order functions, garbage collection and a form of lazy evaluation in a clear and natural manner.

%T Lazy Garbage Collection
%A H.W. Glaser, P. Thompson
%I glas87
%S Software 17, 1, pp1-4, 1987
%K 
%C 

%T An Analysis of Reference Count Garbage Collection Schemes for Declarative Languages
%A H. Glaser, M. Reeve, S. Wright
%I glas89
%S Internal Report, Department of Computing, Imperial College, London, 1989
%K real time distributed systems
%C This paper considers different methods of implementing reference count garbage collection and presents a new scheme, the Lazy/Weighted method. It gives a comparison of the methods based on efficiency, real-time operation and applicability for both centralised and distributed systems and then uses the data gathered from experiments with the ALICE parallel machine to quantify the comparison. The results show that the Lazy/Weighted method is the
most promising.


%T A Pragmatic Approach to the Analysis and Compilation of Lazy Functional Languages
%A H. Glaser, P. Hartel, J. Wild
%I glas90
%S plas90 - also Technical report CSTR 90-10, Department of Electronics and Computer Science, University of Southampton, Southampton, 1990

%K FAST, Caliban, flow graphs, measurement
%C 

%T Proceedings of the Workshop on the Parallel Implementation of Functional Languages
%A H. Glaser, P. Hartel
%I glas91
%S Department of Electronics and Computer Science, University of Southampton, Technical Report CSTR 91-07
%K 
%C 

%T DACTL0: A Computational Model and an Associated Compiler Target Language
%A J.R.W. Glauert, et al.
%I glau85
%S School of Information Systems, University of East Anglia technical report, 1985
%K Declarative Alvey Compiler Target Language, rewrite rules, sharing, copying, state changes, syntax, pattern matching, operational semantics, modules
%C 

%T DACTL: A Computational Model and Compiler Target Language Based on Graph Reduction
%A J.R.W. Glauert, J.R. Kennaway, M.R. Sleep
%I glau87
%S ICL Technical Journal, May 1987 - also SYS-C87-03
School of Information Systems, University of East Anglia, Norwich, 1987
%K 
%C The development of this model is being undertaken by an Alvey-sponsored project at the University of East Anglia (UEA) at Norwich entitled dactl (Declarative Alvey Compiler target Language). Collaborative partners in the Alvey project are ICL, Imperial College, and Manchester University.


%T Specification of Core Dactl 1
%A J.R.W. Glauert, J.R. Kennaway, M.R. Sleep, N.P. Holt, M.J. Reeve, I. Watson

%I glau87b
%S SYS-C87-09, School of Information Systems, University of East Anglia, Norwich, 1987
%K 
%C The Declarative Alvey Compiler Target Language (Dactl) project is a collaborative research project funded by the Alvey programme involving ICL, UEA, Imperial College and Manchester University. The object of the work is to investigate fundamental models of computation which are well matched to the requirements of declarative programming languages and are suited to parallel implementation techniques. Notations developed for such models of computation may be found useful for describing and communicating
language and implementation ideas and can form the basis of a practical compiler intermediate code.


%T Implementing Pattern-Matching Functional Languages Using DACTL
%A J. Glauert, K. Hammond
%I glau88
%S Aspens 88, [john88a], pp487-514
%K 
%C 

%T Extensions to Core Dactl1
%A J.R.W. Glauert, K. Hammond, J.R. Kennaway, M.R. Sleep, G.W. Somner, N. Holt, M. Reeve, I. Watson

%I glau88b
%S SYS-C88-01, School of Information Systems, University of East Anglia, Norwich, 1988
%K 
%C 

%T DACTL: Some Introductory Papers
%A J.R.W. Glauert, K. Hammond, J.R. Kennaway, G.A. Papadopoulos, M.R. Sleep
%I glau88c
%S SYS-C88-08, School of Information Systems, University of East Anglia, Norwich, 1988
%K tutorial
%C 

%T A Parallel Implementation of GHC Based on Graph Reduction
%A J.R.W. Glauert, G.A. Papadopoulos
%I glau88d
%S SYS-C88-10, School of Information Systems, University of East Anglia, Norwich, 1988
%K guarded horn clauses
%C A parallel implementation of Guarded Horn Clauses (GHC) using graph rewriting techniques is described. GHC programs are mapped to rewriting rules in Dactl.

%T Final Specification of Dactl
%A J.R.W. Glauert, J.R. Kennaway, M.R. Sleep, G.W. Somner
%I glau88e
%S SYS-C88-11, School of Information Systems, University of East Anglia, Norwich, 1988
%K 
%C This document described the Dactl language of graph rewriting, and
represents the final definitional deliverable of the Alvey Dactl project.

%T Compiling Functional Languages Based on Graph Rewriting
%A J. Glauert
%I glau90
%S plas90
%K term graph rewriting, SemaGraph, Dactl, transformation
%C 

%T OC-FP, An Applicative Language Combination with Occam and the Algebra of Processes
%A R. Glck, C. Demuth
%I gluc87
%S Microprocessing and Microprogramming, 21, pp549-558, 1987
%K 
%C A functional language based on the FP-model is presented. The language combines occam processes and is used as a command level language for occam systems. It is well suited as a graphical language for concurrent programming.

%T ber eine bisher noch nicht bentzte Erweiterung des finiten Standpunktes
%A K. Gdel
%I gde58
%S Dialectica 12,1958 --- English Translation in J. Philos. Logic 9, 1980
%K 
%C 

%T An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types
%A J.A. Goguen, et al.
%I gogu78
%S In 'Current Trends in Programming Methodology' ed. R, Yeh, Prentice Hall 1978
Also in IBM Research Rep. RC--6478, Yorktown Heights, 1978
%K 
%C 

%T An Introduction to OBJ:A Language for Writing and Testing Formal Algebraic Program Specification
%A J.A. Goguen, J.J. Tardo
%I gogu79
%S  IEEE Transactions on SE5, 1979
%K 
%C 

%T Rapid Prototyping in the OBJ Executable Specification Language
%A J.A. Goguen
%I gogu82
%S Proc. Rapid Prototyping Workshop, Columbia, Maryland, 1982, also in SIGSE 7,5, 1983
%K 
%C 

%T Parametrized Programming
%A J.A. Goguen
%I gogu83
%S Proc. Workshop on Reusability in Programming ed. A. Perlis, 1983
%K 
%C 

%T Programming with Parameterized Abstract Objects in OBJ
%A J.A. Goguen, et al.
%I gogu83b
%S In ``Theory and Practice of Software Technology'' ed. D. Ferrari, et al., North Holland, 1983
%K 
%C 

%T Some Fundamental Algebraic Tools for the Semantics of Computation (I) & (II)
%A J.A. Goguen, R.M. Burstall
%I gogu84
%S Theoretical Computer Science, 31, 1984, pp175-209 & pp263-295
%K 
%C 

%T Merged Views, Closed Worlds and Ordered Sets: Some Novel Database Features in OBJ
%A J.A. Goguen
%I gogu85
%S Proc. 1982 Workshop on Database Semantics and Interfaces, Univ. Pennsylvania, 1985
%K 
%C 

%T One, None, A Hundred Thousand Specification Languages
%A J.A. Goguen
%I gogu86a
%S IFIP '86, Dublin 1986
%K specification languages, wide spectrum programming, logical programming languages, survey, overview, institutions, initial models
%C 

%T Concurrent Term Rewriting as a Model of Computation
%A J. Goguen, C. Kirchner, J. Meseguer
%I gogu86b
%S In LNCS 279
%K 
%C A new model of computation, concurrent term rewriting, is proposed as a bridge between a class of easily programmed ultra high level languages and advances massively concurrent architectures.

%T OBJ as a Theorem Prover
%A J.A. Goguen
%I gogu88
%S Report SRI-CSL-88-4R (Revised), Computer Science Laboratory, SRI International, Menlo Park, CA, 1988
%K 
%C This paper states, justifies, and illustrates some new techniques for using an equational logic based programming language like OBJ as a theorem prover. These techniques avoid the complexities of both higher order logic and, Knuth-Bendix completion.


%T Higher-Order Functions Considered Unnecessary for Higher-Order Programming
%A J.A. Goguen
%I gogu88b
%S ?
%K 
%C I have just finished a paper which some of you might find amusing; the abstract is appended below.  If you want a hardcopy, just send me a msg with your hardcopy address.

It is often claimed that the essence of functional programming is the use of functions as values, i.e., of higher order functions, and many interesting examples have been given showing the power of this approach.  Unfortunately, the logic of higher order functions is difficult, and in particular, higher order unification is undecidable.  Moreover (and closely related), higher order expressions are notoriously difficult for humans to read and write
correctly.  This paper shows that typical higher order programming examples can be captured with just first order functions, by the systematic use of parameterized modules, in a style that we call *parameterized programming*. This has the advantages that correctness proofs can be done entirely within first order logic, and interpreters and compilers can be simpler and more efficient.  A more subtle, but still important, point is that higher order logic does not mix well with *order sorted logic*.  However, subsorts are very useful in functional programming, since they support the clean and rigorous treatment of partially defined functions, exceptions, overloading, multiple representation, and coercion.  Although higher order logic cannot always be avoided in specification and verification, it *should* be avoided wherever possible, for the same reasons as in programming.  Some examples are given, including a hardware verification example, and an appendix justifies a perhaps
surprising technique for proving equations with second quantifiers using only first order reduction.

%T The Rewrite Rule Machine
%A J. Goguen, S. Leinwand, J. Meseguer, T. Winkler
%I gogu89
%S Technical Monograph PRG-76, Oxford University Computing Laboratory, 1989
%K OBJ, RRM, logic, relational, OOP, object oriented
%C 

%T The Rewrite Rule Machine Project
%A J. Goguen, J. Meseguer, S. Leinwand, T. Winkler, H. Aida
%I gogu89b
%S Report SRI-CSL-89-6, SRI International, Menlo Park, CA, 1989
%K rrm graph reduction parallel
%C This paper summarises the RRM architecture, model of computation, and programming techniques, including features of the model of computation that extend ordinary graph rewriting to permit efficient implementation of object-oriented programming.

%T Higher-Order Functions Considered Unnecessary for Higher-Order Programming
%A J.A. Goguen
%I gogu90
%S in turn90a, Research Topics in Functional Programming, pp309-351
%K 
%C 

%T Stream Processing

%A A. Goldberg
%I gold84
%S In acm84a, pp53-62
%K streams, optimization, loop fusion, database operations, RAPTS, SETL, complexity, iteration
%C 

%T Serial Combinators: Optimal Grains of Parallelism
%A B. Goldberg, P. Hudak
%I gold85
%S FPCA'85, Nancy, LNCS 201, pp382-399
%K 
%C 

%T Alfalfa: Distributed Graph Reduction on a Hypercube Multiprocessor
%A B. Goldberg, P. Hudak
%I gold86
%S In LNCS 279, pp94-113, also Also Technical Report, Yale University (1986)
%K serial combinators intel ipsc
%C Alfalfa is an implementation of a functional language on the Intel iPSC multiprocessor. It is based on a heterogeneous abstract machine consisting of both graph reduction and stack oriented execution.

%T Detecting Sharing of Partial Applications in Functional Languages
%A B. Goldberg
%I gold87
%S LNCS 274, FPCA Portland, 1987, pp408-425
%K 
%C A method is presented for detecting sharing of partial function
applications in higher order functional programs. A non-standard semantics is defined for a lazy, higher-order functional language such taht the meaning of a program is information about the sharing that occurred during its execution.

%T Buckwheat: Graph Reduction on a Shared Memory Multiprocessor
%A B. Goldberg
%I gold88a
%S In acm88, pp40-51
%K 
%C 

%T Multiprocessor Execution of Functional Programs
%A B. Goldberg
%I gold88b
%S Internat. J. of Parallel Processing, 17(5):pp425-473, also Ph.D. Thesis, Yale University. Tech. Rep. YALEU/DCS/RR-618
%K 
%C 

%T Implementing Functional Programs on a Hypercube Multiprocessor
%A B. Goldberg, Paul R. Hudak
%I gold88c
%S Proc. 3rd Conf on Hypercube Concurrent Computers and Applications, ACM 1988
%K 
%C 

%T Qlisp: Experience and New Directions
%A R. Goldman, R.P. Gabriel
%I gold88d
%S SIGPLAN, 23, 9, pp111-123, 1988
%K 
%C 

%T Preliminary Results with the Initial Implementation of Qlisp
%A R. Goldman, R.P. Gabriel
%I gold88e
%S In acm88, pp143-152
%K 
%C 

%T Polymorphic Type Reconstruction for Garbage Collection without Tags

%A B. Goldberg, M.Gloger
%I gold92
%S In acm92, pp53-65
%K 
%C 

%T Varqa: a Functional Query Language based on an Algebraic Approach and Conventional Mathematical Notation
%A F. Golshani
%I gols82
%S Theory of Computation Report 43, Department of Computer Science, University of Warwick, Coventry, 1982
%K 
%C 

%T Higher Order Partial Evaluation -- HOPE for the Lambda Calculus
%A C.K. Gomard

%I goma89
%S DIKU, University of Copenhagen, Copenhagen, DK
%K 
%C 

%T Partial Type Inference for Untyped Functional Programs
%A C.K Gomard
%I goma90
%S In acm90, pp282-287
%K 
%C 

%T A Partial Evaluator for the Untyped Lambda Calculus
%A C.K. Gomard, N.D. Jones
%I goma91
%S J. Functional Programming, 1(1), pp21-69
%K residual program, binding time information, self application, well-annotatedness, partial evaluation, Futamura projections, two-level lambda calculus, two-level syntax, two-level semantics, mix, type inference, code duplication, self-interpreters, reflexion, semantics directed compiler generator, performance, efficiency, Tiny
%C 

%T Path Analysis for Lazy Data Structures
%A C.K. Gomard, P. Sestoft
%I goma92
%S Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K 
%C 

%T A Simplification of Combinatory Logic
%A N.D. Goodman
%I good72
%S Journal of Symbolic Logic, 37, 2, pp225-246
%K 
%C 

%T Models of pure LISP
%A M.J.C. Gordon
%I gord73
%S Ph. D. Thesis, Dept. AI, Edinburgh University, 1973
%K 
%C 

%T Towards a Semantic Theory of Dynamic Binding
%A M.J.C. Gordon
%I gord75
%S Rep. STAN--CS--75--507, Dept. Comp. Sci., Stanford Univ., 1975
%K 
%C 

%T Edinburgh LCF, a Mechanical Logic of Computation
%A M.J.C. Gordon, R. Milner, C. Wadsworth
%I gord77
%S CSR--11--77(In 2 parts), Dept. Comp. Sci., Edinburgh Univ., 1977, also in LNCS 78, 1979
%K LCF, interaction, formal proofs, ML, PPLAMBDA, proof strategies, polymorphism, goal directed seeking, inference, induction, goal directed programming, mechanised proofs, theories
%C 

%T A Metalanguage for Interactive Proof in LCF
%A M.J.C. Gordon, R. Milner, L. Morris, M. Newey, C. Wadsworth
%I gord78
%S Proc. 5th POPL, Tucson, 1978, pp119-130
%K ML
%C 

%T The Denotational Description of Programming Languages
%A M.J.C. Gordon
%I gord79a
%S Springer, 1979
%K denotational semantics, TINY, sets and domains, standard semantics, SMALL, escapes, jumps
%C 

%T A Note on the Semantics of Explicitly Quantified Polymorphic Types
%A M.J.C. Gordon
%I gord79b
%S Manuscript, 1979 (Referred to in macq82)
%K 
%C 

%T Locations as First Class Objects in ML
%A M.J.C. Gordon
%I gord79c
%S Unpublished, 1979 (Referenced in dama85)
%K 
%C 

%T Representing a Logic in the LCF Metalanguage
%A M.J.C. Gordon
%I gord82
%S In neel82, pp163-185
%K 
%C 

%T Programming Language Theory and its Implementation
%A M. Gordon
%I gord88
%S Prentice Hall ISBN 0-13-730417-X
%K 
%C 

%T PFL+: A Kernel Scheme for Functional I/O
%A A. Gordon
%I gord89
%S TR 160, Computer Lab., University of Cambridge
%K 
%C 

%T Functional Programming and Input/Output
%A A. Gordon
%I gord93
%S Ph.D. Thesis Cambridge University, available as TR 285 from the Computer Lab., Cambridge, England
%K monads, verification, operational semantics, mu-nu-ML, applicative bisimulation, LCF, H, streams, continuations
%C 

%T An operational semantics for I/O in a lazy functional language
%A A.D. Gordon
%I gord93b
%S To appear in the proceedings of FPCA'93, Copenhagen, June
%K 
%C 

%T A View of Dataflow
%A K.P. Gostelow, R.E. Thomas
%I gost79
%S AFIPS Nat. Computer Conference 48, pp629-636, 1979
%K unfolding interpreter, multiprocessing, implementation
%C 

%T Performance of a Simulated Dataflow Computer
%A K.P. Gostelow, R.E. Thomas
%I gost80
%S IEEE Transactions on Computers, 29, 1980, pp905-919
%K 
%C 

%T Functional Programming Systems Revisited
%A A.K. Goswami, L. Patnaik
%I gosw84
%S In LNCS 181
%K 
%C 

%T Symposium on Functional Languages and Computer Architecture
%A ??
%I goth81
%S Gothenburg, Sweden 1981
%K 
%C 

%T Characteristics of a Functional Programming Language
%A C. Gram, E.I. Organick
%I gram80a
%S Technical Report UUCS--80--103, Dept. Comp. Sci., University of Utah, 1980
%K 
%C 

%T An Easy Functional Programming Language
%A C. Gram, E.I. Organick
%I gram80b
%S Symposium on Functional Languages and Computer Architecture, Laboratory, for Programming Methodology, Chalmers University of Technology, Gteborg, pp232-270, 1980
%K 
%C 

%T Semantics and Algebra of an Easy Functional Programming Language
%A C. Gram, E.I. Organick
%I gram80c
%S Technical Report Draft, Dept. Comp. Sci., University of Utah, 1980, also Symposium on Functional Languages and Computer Architecture, Laboratory for Programming Methodology, Chalmers University of Technology, Gteborg, pp272-289, 1980

%K 
%C 

%T A Haskell Implementation of a Generalised Envelope Method for Sparse Matrix Factorisation
%A P.W. Grant, J.A. Sharp, M.F. Webster, X. Zhang
%I gran92
%S Proc. ATABLE-92, pp247-260, Montreal
%K 
%C 

%T Analysis of an Assembly Process for Implementing a Finite Element Algorithm
%A P.W. Grant, J.A. Sharp, M.F. Webster, X. Zhang
%I gran92b
%S Tech. Rep. FLARE/S/12, Dept. CS, University of Wales, Swansea
%K 
%C 

%T Some Issues in a Functional Implementation of a Finite Element Algorithm
%A P.W. Grant, J.A. Sharp, M.F. Webster, X. Zhang
%I gran93
%S In acm93, pp12-17
%K difference equations, Jacobi iteration, Taylor-Galerkin/\pressure correction algorithm, FLARE, quadtrees, Choleski Matrix factors, measurement, profiling
%C 

%T Functional Programming for a Computational Fluid Dynamics Problem
%A P.W. Grant, J.A. Sharp, M.F. Webster, X. Zhang
%I gran93b
%S Proc. Computational Mechanics in UK, pp75-79, Swansea, UK, Assoc for. Computational Mechanics in Engineering (UK)
%K 
%C 

%T The Functional Data Model Related to the CODASYL Model
%A P.M.D. Gray
%I gray84
%S In ``Databases --- role and Structure'' Eds. P.M. Stocker, et al., CUP, 1984
%K 
%C 

%T Combining Functional and Logic Programming in Expert Database Systems
%A P.M.D. Gray
%I gray90
%S CS Dept. Univ. Aberdeen report AUCS/TR8906
To appear in "Expert Database Systems" Ed. K.G. Jeffrey, Academic Press, 1990
%K Functional Data Model, FDM, Daplex, navigation, SQL, object based systems, frame based systems, prolog, logic programming, ZF set expressions
%C 

%T The LISP Machine
%A R. Greenblatt
%I gree79
%S Working Paper 79, MIT AI Lab., Cambridge, Mass., 1979
%K 
%C 

%T Prose and CONS --- Multics Emacs: A Commercial Text-Processing System in LISP
%A Bernard S. Greenberg
%I gree80
%S In acm80
%K Text Processing
%C 

%T A Fully Lazy Higher Order Purely Functional Language with Reduction Semantics
%A K.J. Greene
%I gree85
%S CASE Center Tech. Rep. 8503, Syracuse Univ.
%K 
%C 

%T An Investigation into Architectures for a Parallel Packet Reduction Machine
%A M.I. Greenberg
%I gree89
%S Technical Report UMCS-89-1, Department of Computer Science, University of Manchester, 1989, PhD Thesis.
%K 
%C The research described in this thesis examines the machine structures and the organisation needed for efficient packet reduction. Two main areas are covered, the architecture of the reduction processor, and the network to interconnect the processors.

%T Bagof/3 to ZF Expression: An Example Prolog Application Manually Translated to Miranda
%A P. Greenfield
%I gree90
%S SIGPLAN 25, 7, pp59-62, 1990
%K logic
%C 

%T Manual LISP 510: Description et Utilisation
%A P. Greussay
%I greu72
%S Report NTP 2, Institut d'Intelligence Artificielle, Universitde Paris VIII, 1972
%K 
%C 

%T Contribution  la Dfinition Interprtative et 
l'Implmentation des Lambda-Langages
%A P. Greussay
%I greu77
%S Thse de Doctorat d'Etat., Universitde Paris VII, 1977
%K 
%C 

%T Natural Constructions in Functional Programming
%A A. Grimley
%I grim88
%S UKC Computing Laboratory Report No. 53, University of Kent, Canterbury, 1988
%K Miranda category theory
%C Examples are given showing how the systematic use of appropriate polymorphic types and canonically-associated higher-order functions constitutes a mathematical toolkit for the modelling of a wide variety of problems.

%T Inductive Types in Functional Programming
%A A. Grimley
%I grim90
%S Computing Laboratory, University of Kent, Canterbury, 1990, PhD Thesis
%K 
%C 

%T Implementation of the String Parser of English
Natural Language Processing
%A R. Grishman
%I gris73
%S Courant Computer Science Symposium 8., R. Rustin, pp89-109, Algorithmics Press Inc., New York, NY, 1973
%K 
%C 

%T Efficient Expression Evaluation in Sparse Minor Expansion, Using Hashing and Deferred Evaluation
%A Martin L. Griss
%I gris77
%S Hawaii International Conf. on System Sciences, IEEE, New York, 1977
%K 
%C 

%T Solving Common Programming Problems with an Applicative Programming Language
%A T.M. Grismer
%I gris81
%S Indiana University Dept. Comp. Sci. Technical Report 109, 1981
%K 
%C 

%T PSL: A Portable LISP System
%A Martin L. Griss, et al.
%I gris82
%S In acm82
%K LISP, portability, PSL, bootstrapping
%C 

%T Expression Evaluation in the ICON Programming Language
%A R.E. Griswold
%I gris84
%S In acm84a, pp177-183
%K 
%C 

%T A Multiprocessor Model For Parallel Evaluation of Applicative Programs
%A D.H. Grit, R.L. Page
%I grit80
%S J. Digit. Syst 4,2, 1980, pp135-151
%K 
%C 

%T Deleting Irrelevant Tasks in an Expression-Oriented Multi-Processor System
%A D.H. Grit, R.L. Page
%I grit81a
%S TOPLAS 3,1, 1981
%K multiprocessor, garbage collection, data driven computation, data flow, evaluation strategies, full substitution, speculative evaluation
%C 

%T Eager Beaver Evaluation on the R-ary N-cube
%A D.H. GRIT, R.L. PAGE
%I grit81b
%S Dept. Comp. Sci., Colorado State Univ., 1981
%K 
%C 

%T Logic Programming - Functions, Relations and Equations
%A D. DeGroot, G. Lindstrom
%I groo86
%S PH, 1986
%K conference, logic programming, unification of logic and functional languages, HASL, binding, QUTE, FUNLOG, LEAF, APPLOG
%C 
This is a duplicate entry for degr86

%T Mapping a Single Assignment Language onto the Warp Systolic Array
%A T. Gross, A. Sussman
%I gros87
%S LNCS 274, kahn87b, pp347-363
%K sisal dataflow
%C This paper discusses issues that arise in mapping SISAL programs onto the Warp array, a linear systolic array in use at CMU. A Warp machine with ten cells can deliver up to 100 million floating point operations per second.

%T Inference-based Overloading Resolution for ADA
%A F. Grosch, G. Snelting
%I gros90
%S LNCS 456 pp30-44, Proc. 2nd Conf. Prog. Lang. Impl. and Logic Prog., 1990
%K 
%C 

%T An Abstract Interpretation for ML Equality Types
%A C.A. Gunter, E.L. Gunter, D.B. MacQueen
%I gunt91
%S LNCS 526, pp112-130
%K 
%C 

%T A Classification Scheme for Declarative Programming Languages - Syntax, Semantics, and Operational Models
%A Y-K. Guo, H.C.R. Lock
%I guo90
%S GMD-Studien Nr. 182, August 1990
%K 
%C Referenced in diet91

%T A Data Driven System for High Speed Parallel Computing
%A J.R. Gurd, I. Watson
%I gurd80
%S Computer Design 19,6, 7,1980
%K 
%C 

%T A Multilayered Data Flow Computer Architecture
%A J. Gurd, I. Watson, J.R.W. Glauert
%I gurd80b
%S Technical Report (Draft), Department of Computer Science, University of Manchester, 1980
%K 
%C 

%T Preliminary Evaluation of a Prototype Dataflow Computer
%A J.R. Gurd, I. Watson
%I gurd83
%S IFIP '83 --- Proc. 9th World Computer Congress, Paris, Ed. R.E.A.~Mason, ISBN 0--444--86729--5, Elsevier, North Holland, 1983
%K data flow, hardware, tagged token model, butterfly code, parallelism, benchmark, measurement
%C 

%T The Manchester Prototype Dataflow Computer
%A J.R. Gurd, C.C. Kirkham, I. Watson
%I gurd85
%S CACM 28,1, pp34-52
%K 
%C 

%T PROLOG compared with LISP
%A Claudio Gutierrez
%I guti82
%S In acm82
%K PROLOG, LISP, measurement, benchmarking
%C 

%T Abstract Data Type and the Development of Data Structures
%A John V. Guttag
%I gutt77
%S CACM 20, 6, pp396-404 1977
%K 
%C 

%T Abstract Data Type and Software Validation
%A John V. Guttag, E. Horowitz, D.R. Musser
%I gutt78
%S CACM 21, 1978
%K abstract data types, correctness, types, data structures, stack example, algebraic axiomatics, induction, equality, reduction, verification
%C 

%T Notes on Data Abstraction
%A John V. Guttag
%I gutt80
%S IEEE Trans Soft. Eng. SE-6, 1 pp13-23, 1980
%K 
%C 

%T Functional Programming with Data Abstraction and Strong Typing
%A John V. Guttag, J. Horning, J. Williams
%I gutt81
%S In acm81, pp11-24 
%K FP style, typing, abstraction, algebraic specification, abstract data types
%C 

%T Notes on Using Types and Type Abstraction in Functional Programming
%A John V. Guttag
%I gutt82
%S In darl82, pp103-128
%K divide and conquer, types, abstraction, algebraic specification, FP
%C 

%T MAIDAY: An Environment for Guided Programming with a Definitional Language
%A J. Guyard, J.P. Jacquot
%I guya84
%S Conf. Genie Logiciel, Orlando, 1984
%K 
%C 

%T Single-Threaded Polymorphic Lambda Calculus
%A J.C. Guzman, P. Hudak
%I guzm90
%S Proc. 5th Annual IEEE Symp. on Logic in CS
%K 
%C 

%T Proving Properties of Shared Data Structures: Application to Functional Programming
%A J. Hagelstein
%I hage82
%S Proc. ACM Conference, Dallas, 1982
%K sharing, pointers, proving, correctness, verification, validation, graphs, trees, symbolic execution, state, store
%C 

%T A Proof Description Language and its Reduction System
%A M. Hagiya
%I hagi83
%S Publ. Res. Inst. Math. Sci 19,1, 1983
%K 
%C 

%T A Categorical Programming Language
%A Tatsuya Hagino
%I hagi87
%S Ph.D. Thesis, CS University of Edinburgh
%K 
%C 

%T 2nd workshop on array structures (ATABLE)
%A G. Hains, L.M.R. Mullin
%I hain92
%S Publication 841, Dept. d'informatique et de rcherche oprationelle, Univ. de Montral
%K 
%C scientific computing in functional languages

%T The Data-Parallel Categorical Abstract Machine
%A G. Hains, C. Foisy
%I hain93
%S PARLE '93 to appear
%K 
%C available by anonymous ftp at ftp.qucis.queensu.ca in
directory pub/hains/textes

%T Parallel Functional Programming with Arrays
%A G. Hains, L.M.R. Mullin
%I hain93b
%S CJ to appear
%K 
%C available by anonymous ftp at ftp.qucis.queensu.ca in
directory pub/hains/textes


%T The Synchronous Data Flow Programming Language LUSTRE
%A N. Halbwachs, P. Caspi, P. Raymond, D. Pilaud
%I halb91
%S Proceedings of the IEEE, Vol. 79, No. 9, 1305--1319
%K 
%C 

%T Abstraction in Numerical Methods
%A M. Halfant, G.J. Sussman
%I half88
%S In acm88, pp1-7
%K 
%C 

%T Relational Algebras, Logic and Functional Programming
%A P.A.V. Hall
%I hall84
%S SIGMOD 14,2, 1984
%K 
%C 

%T ACM SIGPLAN 85 Symp. on Language Issues in Programming Environments
%A Cordelia V. Hall, John O'Donnell
%I hall85
%S Proc. ACM SIGPLAN 85 Symp. on Language Issues in Programming Environments, SIGPLAN 20, 7 pp60-68, 1985
%K 
%C 

%T Compiling Strictness into Streams
%A C.V. Hall, D. Wise
%I hall87
%S Proc. POPL 87, pp 132-143
%K 
%C 

%T Finding Rational Fixed Points in Infinite Domains
%A C. Hall
%I hall88
%S Proc. Glasgow 1988 Workshop, hall89, pp57-67
%K 
%C 

%T Proceedings of the 1988 Glasgow Workshop on Functional Programming

%A C. Hall, J. Hughes, J.T. O'Donnell, Eds.
%I hall89
%S Glasgow Univ. CS. Research Rep. 89/R4, Fe. 1989
%K 
%C 

%T Using Lazy Evaluation to Find Fixpoints in Infinite Domains
%A C. Hall
%I hall90
%S in 
%K abstract interpretation, forward analysis, backward analysis
%C 

%T An Algorithmic and Semantic Approach to Debugging
%A C. Hall, K. Hammond, J. O'Donnell
%I hall90b
%S In peyt91b
%K 
%C 

%T The Glasgow Haskell Compiler: A Retrospective
%A C. Hall, K. Hammond, W. Partain, S.l. Peyton Jones, P. Wadler
%I hall92
%S In laun92
%K 
%C 

%T Type Classes in Haskell
%A C. Hall, K. Hammond, S.L. Peyton Jones, P. Wadler
%I hall93
%S Glasgow University FP group research document
%K overloading, inference, ad hoc polymorphism, static analysis
%C 

%T Denotational Semantics and Rewrite Rules for FP
%A J.Y. Halpern, et al.
%I halp85
%S Proc. 12th POPL, 1985
%K rewrite rules, completeness, soundness, reduction, operational semantics, denotational semantics
%C 

%T Completeness of Rewrite Rules and Rewrite Strategies for FP
%A J.Y. Halpern, J.H. Williams, E.L. Wimmers
%I halp90
%S JACM 37,1, pp86-143, 1990
%K 
%C 

%T Implementation of Multilisp: Lisp on a Multiprocessor
%A R.H. Halstead
%I hals84
%S In acm84a, pp9-17
%K 
%C 

%T Compile-Time Garbage Collection by Necessity Analysis
%A G.W. Hamilton, S.B. Jones
%I hami90
%S In peyt91b, pp66-70
%K 
%C 

%T Brief Notes on the Implementation of a User Environment for the, Lambda-Calculus reducer LSKI
%A K. Hammond
%I hamm83
%S Internal Note, School of Computing Studies and Accountancy, University of East Anglia, Norwich, 1983
%K 
%C 

%T The KRC Manual and Tutorial
%A Kevin Hammond
%I hamm84
%S CSA/16/1984 DSAG-3, Univ. E. Anglia, 1984
%K 
%C 

%T Compiling ML to Dactl: Early Experience
%A K. Hammond
%I hamm86
%S SYS-C86-04, School of Information Systems, University of East Anglia, Norwich, 1986
%K 
%C The implementation of a translator from a lazy subset of Standard ML to DACTL0 is described. Standard ML is a language designed by Milner and others, based on the ML used for Edinburgh LCF, and proposed to standardise the many ML dialects created since then. Compared with the earlier versions of ML, Standard ML has several advantages, notable HOPE-style
pattern matching and flexible syntax. DACTL0 is a term-rewrite based language described as a common intermediate language between many high-level computer languages and machine codes, parallel and sequential. Due to its origins, the computational model evinced by DACTL0 is significantly different from that of conventional languages.

%T FX-87 Performance Measurements: Dataflow Implementation
%A R.T. Hammel, D.K. Gifford
%I hamm88
%S Technical Report MIT/LCS/TR-421, Laboratory for Computer Science, MIT, Cambridge, MA, 1988
%K 
%C 

%T Implementing Functional Languages for Parallel Machines
%A K. Hammond
%I hamm88b
%S School of Information Systems, University of East Anglia, Norwich, 1988, PhD Thesis. - see also hamm91b
%K sml dactl xsml psml
%C Commencing with the Standard ML Language, dialects XSML and PSML are defined, which permit parallel evaluation of functional programs. XSML is SML with a novel method for handling exceptions; PSML is as side-effect free version of XSML. A formal semantics for PSML and a translation from this language to DACTL are presented.

%T Exception Handling in a Parallel Functional Language: PSML
%A Kevin Hammond
%I hamm89
%S Proc. IEEE TENCON '89, Bombay
%K 
%C 

%T A Proposal for an Implementation of Full Dactl on a Meiko Transputer Rack
%A K. Hammond
%I hamm89
%S SYS-C89-02, School of Information Systems, University of East Anglia, Norwich, 1989
%K 
%C The design of an abstract instruction set for Dactl is described.

%T Implementing Haskell Type Classes
%A K. Hammond, S. Blott
%I hamm89b
%S In davi89b
%K overloading, dictionaries, type inference, ad hoc polymorphism, instance declarations, non-flat domains, ambiguity, derived instances, validity of contexts, default types, measurement
%C 

%T Implementaing Pattern-Matching Functional Languages using Dactl
%A K. Hammond, J.R.W. Glauert
%I hamm89c
%S SYS-C89-08, School of Information Systems, University of East Anglia, Norwich,1989
%K flagship standard ml sml parallel
%C 

%T Error Handling in the Parallel Implementation of a Lazy Functional Language
%A K. Hammond
%I hamm89d
%S SYS-C89-01, School of Information Systems, University of East Anglia, Norwich, 1989
%K 
%C 

%T Some Early Experiments on the GRIP Parallel Reducer
%A K. Hammond, S. Peyton Jones
%I hamm90
%S plas90
%K spineless tagless G-machine, graph reduction, system management, sparking strategies, measurements, experiments, timings
%C 

%T Definitional List Comprehensions
%A K. Hammond
%I hamm90b
%S Research Report CSC/90/R3, Department of Computing Science, University of Glasgow, Glasgow, 1990
%K 
%C This paper introduces a simple extension to the usual notation which provides an elegant way of including local definitions in list comprehensions.

%T A Natural Dynamic Semantics for Haskell
%A K. Hammond, C. Hall
%I hamm91
%S Glasgow University
%K 
%C 

%T Parallel SML: a Functional Language and its Implementation in Dactl
%A K. Hammond
%I hamm91b
%S Pitman, London, 1991, ISBN 0-273-08831-9.

%K 
%C Publication of hamm88b

%T Imperative: Be Imperative
%A K. Hammond, P.L. Wadler, D. Brady
%I hamm91c
%S DOC, University of Glasgow
%K 
%C 

%T Polymorphic Typechecking
%A P. Hancock
%I hanc87
%S In peyt87, Implementation of Functional Programming Languages by Simon Peyton Jones
%K 
%C 

%T COBWEB --- A Combinator Reduction Architecture
%A Chris L. Hankin, P.E. Osmon, M.J. Shute
%I hank85
%S In LNCS 201, FPCA, Nancy 1985
%K combinators, hardware, architecture, parallelism, cobweb, laziness
%C 

%T A Safe Approach to Parallel Combinator Reduction
%A C.L. Hankin, G.L. Burn, S.L. Peyton Jones
%I hank86
%S ESOP 86, LNCS 213, pp99-109, Also Theoretical Computer Science, 56:17-36, 1988
%K Combinators, Strictness Analysis, Parallel reduction, director strings, abstract interpretation, parallel or
%C Extended Abstract - Theoretical Computer Science Paper is fuller

%T Applicative Languages and Data Flow
%A C. Hankin, D. Till, H. Glaser
%I hank87
%S In eise87, pp128-140
%K 
%C 

%T A Safe Approach to Parallel Combinator Reduction
%A C. Hankin, G. Burn, S.L. Peyton Jones
%I hank88
%S Theoretical Computer Science, 56, 1, p17-35, 1988, also LNCS 213, pp99-110
%K strictness analysis
%C The authors present the results of two pieces of work which, when combined, allow one to take a program text in a functional language and produce a parallel implementation of that program. They present techniques for discovering sources of parallelism in a program at compile time and then show how this parallelism is naturally mapped into a parallel combinator set that is defined.

%T Abstract Interpretation of term Graph Rewriting Systems
%A C. Hankin
%I hank90
%S In peyt91b, pp54-65
%K 
%C 

%T Deriving Mixed Evaluation from Standard Evaluation
for a Simple Functional Language
%A J. Hannan, D. Miller
%I hann89
%S LNCS 375, pp239-255
%K 
%C 

%T From Operational Semantics to Abstract Machines: Preliminary Results
%A J. Hannan, D. Miller
%I hann90
%S In acm90, pp323-332, revised version in Math. Struct. in Comp. Sci., 2, pp415-459
%K 
%C Revised version omits "preliminary results" from title

%T Compact List Representation: Definition, Garbage Collection, and System Implementation
%A W.J. Hansen
%I hans69
%S CACM 12, 9, 1969
%K data representation, space efficiency, plexes, structures, records, cdr coding, implementation, compact lists, garbage collection, relocation
%C 

%T On the Design of a Functional Formatting Language: FFL
%A B.S. Hansen
%I hans89
%S Report ID-TR: 1989-53, Department of Computer Science, Technical University of Denmark, Lyngby, 1989
%K text fp type checking document processing
%C An experimental formatting language called FFL is the central topic. FFP is a purely functional language in the style of FP and the applicative part of APL. Sequences, characters, and so-called boxes constitute the data types and among the built-in primitives are functions for aligning/spacing, breaking, etc.

%T Efficient Stack Allocation for  Tail-Recursive
      Languages
%A C. Hanson
%I hans90
%S In acm90, 106-118
%K 
%C 

%T On the Interaction of Lazy Evaluation and Backtracking
%A W. Hans, R. Loogen, S. Winkler
%I hans92
%S LNCS 631, pp 355-369, Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K 
%C 

%T A Functional and Logic Language with Polymorphic Types
%A M. Hanus
%I hanu90
%S LNCS 429
%K 
%C 

%T Efficient Implementation of Narrowing and Rewriting
%A M. Hanus
%I hanu91
%S Springer LNAI 567, pp344-365
%K logic combined with functional, ALF
%C Recently, there has been done some work on the efficient implementation of functional logic languages. These implementations are based on extensions of implementation techniques for functional or logic languages like graph reduction machines or WAM. Among others, we have implemented the language ALF (Algebraic Logic Functional language) by an extension of the WAM. A short description of this implementation can be found in the following paper (it contains also references to other implementations):


%T Improving Control of Logic Programs Using Functional Logic Languages
%A M. Hanus
%I hanu92
%S LNCS 631, pp1-23, Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K ALF
%C Functional logic languages are superior to pure logic languages from an operational point of view: they perform more deterministic computations because of the presence of functions, i.e., the search space is smaller. You can find more details of this aspect in the paper

%T An Alternative View of Polymorphism
%A D.M. Harland, M.W. Szyplewski, J.B. Wainwright
%I harl85
%S SIGPLAN, 20, 1985, 10, pp23-35
%K 
%C 

%T Modules and Persistence in Standard ML
%A R. Harper
%I harp85a
%S In ``Persistence and Data Types'' --- Papers for the Appin Workshop, Ed. M.~Atkinson, P.~Buneman & R.~Morrison, Persistent Programming Research Report 16, Universities of St.Andrews and Glasgow, 1985
%K ML, types, persistence, abstract types, signature
%C 

%T Standard ML Input/Output
%A R. Harper
%I harp85b
%S Polymorphism --- The ML/LCF/Hope Newsletter II,2, 1985
%K input, output, character streams, basic primitives
%C 

%T Standard ML
%A R. Harper, D. MacQueen, R. Milner
%I harp86a
%S Report ECS-LFCS-86-2, CS Dept. Edinburgh, 1986 - also CSR-209-86.
%K ML
%C Part 1: The Standard ML Core Language (Revised)
Part 2: Standard ML I/O,
Part 3: Modules for Standard ML.


%T Introduction to Standard ML
%A R. Harper, K. Mitchell
%I harp86b
%S LFCS Report Series  ECS-LFCS-86-14, Laboratory for Foundations of Computer Science, CS University of Edinburgh
%K general, ML
%C Revised 1989 by Nick Rothwell and Kevin Mitchell
This ia available for anon ftp(free!) from:
princeton.edu:/pub/ml/incoming/harper-notes/main.dvi.  This dvi unfortunately doesn't include Milner's definition: for that you have to haul over the works, go into main.tex and uncomment "\include{report}.

%T The Definition of Standard ML, Version 2
%A R. Harper, R. Milner, M. Tofte
%I harp88
%S Tech. Rep. ECS-LFCS-88-62, Lab. for the Foundations of Computer Science, Edinburgh Univ., 1988, Also CSR-274-88
%K 
%C 

%T Functional Programming Using FP
%A P.G. Harrison, H. Khoshnevisan
%I harr85
%S Byte 10,8, 1985
%K FP, introduction, algebra
%C 

%T The Parallel Graph Reduction Machine, Alice
%A P.G. Harrison, M.J. Reeve
%I harr86
%S In LNCS 279
%K 
%C The architecture for Alice is highly parallel in nature, with a
collection of processing agents performing redex reductions concurrently and asynchronously on the one hand, and the packets that represent the nodes in a function expression graph being distributed over several memory segments on the other.

%T RUTH: A Functional Language for Real-Time Programming
%A D. Harrison
%I harr87
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259
%K timestamps real time
%C This paper introduces the real-time programming language RUTH which is a functional language based on the lazy language LispKit LISP.

%T An Introduction to FP and the FP Style of Programming
%A P. Harrison, H. Khoshnevisan
%I harr87b
%S In eise87, pp44-56
%K 
%C 

%T A Functional Algebra and its Application to Program Transformation
%A P. Harrison, H. Khoshnevisan
%I harr87c
%S In eise87, pp86-93
%K 
%C 

%T Functional Inversion
%A P.G. Harrison
%I harr87d
%S Proc. Workshop on partial evaluation and Mixed computation, North Holland
%K 
%C 

%T Algebraic Transformation Techniques for Functional Languages
%A P.G. Harrison, H. Khoshnevisan
%I harr88
%S Computer Journal, 31, 3, 1988, pp229-242
%K 
%C 

%T A Transformational Approach to Parallel Algorithms
%A P.G. Harrison
%I harr90
%S Technical Report, Department of Computing, Imperial College, London, 1990
%K 
%C 

%T The Gamma Model as a Functional Programming Tool
%A R. Harrison, H. Glaser
%I harr90
%S Technical Report CSTR 90-8, Department of Electronics and Computer Science, University of Southampton, 1990
%K 
%C In this paper the way is investigated in which the Gamma model, proposed by Banatre and Le Mtayer might be supported in a functional language.


%T On the synthesis of function inverses
%A P.G. Harrison, H. Koshnevisan
%I harr92
%S Acta Informatica, 29, pp211-239, also Imperial College report
%K 
%C 

%T The Use of Functional Languages in Teaching Computer Science
%A R. Harrison
%I harr93
%S JFP 3,1, pp67-75
%K instruction
%C 

%T Parallel Graph Reduction for divide-and-conquer applications Part I
%A P.H. Hartel, W.G. Vree
%I hart87
%S PRM Project Internal Report
D-15, Department of Computer Systems, University of Amsterdam
%K 
%C 

%T Performance Analysis of Storage Management in Combinator Graph Reduction
%A P.H. Hartel
%I hart88
%S Ph.D. Thesis, Univ. of Southampton, 1988
%K parallel graph reduction machine design, architecture
%C 

%T Statistics on Graph Reduction of SASL Programs
%A P.H. Hartel, A.H. Veen
%I hart88b
%S Software 18, 3, pp239-253, 1988
%K combinators
%C The execution has been studied of four small and four medium-sized SASL
programs, when interpreted by a variant of Turner's combinator-reducer. Size, structure and composition of the combinator graph has been analysed at frequent intervals during the reduction process. The most interesting results are summarised and discussed.

%T Parallel Graph Reduction for Divide-and-conquer Applications: Part II - Program Performance
%A P.H. Hartel, W.G. Vree
%I hart88c
%S PRM Project Internal Report D-20, Department of Computer Systems, University of Amsterdam, 1988
%K 
%C 

%T Performance Analysis of Storage Management in Combinator Graph Reduction
%A P.H. Hartel
%I hart88d
%S PhD Thesis, Department of Computer Systems, University of Amsterdam, 1988
%K 
%C 

%T Compilation of Functional Languages using Flow Graph Analysis
%A P. Hartel, H. Glaser, J. Wild
%I hart91
%S 
%K Technical Report CSTR 91-03, Department of Electronics and Computer Science, University of Southampton, 1991
%C 

%T Performance of Lazy Combinator Graph Reduction
%A P.H. Hartel
%I hart91
%S Software 21, 3, pp299-329, 1991,Also Report D-27, Fakulteit Wiskunde en Informatika, Universiteit van
Amsterdam (1989).

%K benchmarks optimisation supercombinators
%C 

%T On the Benefits of Different Analyses in the Compilation of a Lazy, Functional Language
%A P. Hartel, H. Glaser, J. Wild
%I hart91b
%S In glas91, pp123-146
%K 
%C 

%T Arrays in a Lazy Functional Language - a case study: the Fast Fourier Transform
%A P. Hartel, W.G. Vree
%I hart92
%S Tech. Rep. Amsterdam University dept of Comp. Systems -- also ATABLE-92 workshop, Montreal
%K Miranda, FFT
%C The array plays a prominent role in imperative programming languages because the data structure bears a close resemblance to the mathematical notion of a vector and because array operations can be implemented efficiently. Not all lazy functional languages offer arrays as a primitive data structure because laziness makes it difficult to implement arrays efficiently. We study 8 different versions of the Fast Fourier Transform, with and without arrays, to assess the importance of arrays in a lazy functional language.
An efficient implementation of arrays contributes significantly to the performance of functional languages in certain areas. However, a clear distinction should be made between array construction and array subscription.  In the FFT example we could not gain efficiency by using array construction, other than for storing precomputed data like the input. Using array subscription improves performance

%T Benchmarking Implementations of Lazy Functional Languages
%A P. Hartel, K.G. Langendoon
%I hart92b
%S CS, University of Amsterdam, TR CS-92-20
%K FAST, measurement, Clean, Miranda, Glasgow Haskell, Chalmers Haskell, Yale Haskell, LML
%C 

%T Hope+ Comments
%A S. Hayes
%I haye86
%S Imperial College Technical Memo IC/FPR/LANG/2.5.1/10
%K 
%C 

%T Specifications are Not (Necessarily) Executable
%A I.J. Hayes, C.B. Jones
%I haye89
%S Technical Report UMCS-89-12-1, Department of Computer Science, University of Manchester, 1989
%K semantics
%C 

%T A Theory of Data Type Representation Independence
%A C.T. Haynes
%I hayn84a
%S In LNCS 173
%K types, semantic specification, TypeL, representation independence
%C 

%T Continuations and Coroutines
%A C.T. Haynes, D.P. Friedman, M. Wand
%I hayn84b
%S In acm84a, pp293-298
%K Continuations, coroutines, scheme 84
%C 

%T Engines Build Process Abstractions
%A C.T. Haynes, D.P. Friedman
%I hayn84c
%S In acm84a, pp18-24
%K 
%C 

%T Abstracting Timed Preemption with Engines
%A C.T. Haynes, D.P. Friedman
%I hayn87
%S Computer Languages 12,2 pp109-121
%K 
%C 

%T Standard LISP
%A A.C. Hearn
%I hear69
%S Technical Report AIM-90, Artificial Intelligence Project, Stanford University
%K 
%C 

%T A Functional Language for the Specification of Complex Tree Transformations
%A R. Heckmann
%I heck88
%S LNCS 300, pp175-190, 2nd European Symp. on Programming, Nancy, March 1988
%K tree transformations, term rewriting, patterns
%C 

%T An Implementation of an Applicative File System
%A B.C. Heck, D.S. Wise
%I heck92
%S INRIA/IRISA/SIGPLAN Internat. Workshop on Memory Management, St. Malo
%K persistence, scheme, reference counting heap, mark sweep garbage collection, hardware
%C 

%T The Efficiency of the Equation Interpreter compared with the UNH Prolog Interpreter
%A J. Heering, P. Klint
%I heer86
%S SIGPLAN 21,2 1986
%K Rewriting, equations, algebraic specification, prototyping, interpreter, logic programming, prolog, performance evaluation
%C 

%T Efficient Lazy Data-Structures on a Dataflow Machine
%A S.K. Heller
%I hell89
%S Report MIT/LCS/TR-438, Laboratory for Computer Science, MIT, Cambridge, MA, 1989
%K parallel, data flow
%C An extension, lazy data-structures, is proposed to the dataflow language Id, to support a combination of eager and lazy evaluation. The semantics of lazy data-structures is described, as well as an efficient implementation on the Tagged-Token Dataflow Architecture and the Monsoon Explicit Token Store Machine.

%T A Lazy Evaluator
%A Peter Henderson, J.H. Morris
%I hend76
%S Proc. 3rd POPL, Atlanta, pp95-103
%K laziness, pure LISP, correctness, infinite data structures, streams, interpreter, soundness
%C 

%T Functional Programming: Application and Implementation
%A Peter Henderson
%I hend80
%S Prentice-Hall, 1980
%K general, programming, representation, interpretation, architecture, SECD machine, backtracking, lazy evaluation, delayed evaluation, parallelism, higher order functions, LISPKIT
%C 

%T Purely Functional Operating Systems
%A Peter Henderson
%I hend82a
%S In darl82, pp177-192
%K operating systems, streams, sequences, databases, interleaving, editors
%C 

%T Functional Geometry
%A Peter Henderson
%I hend82b
%S In acm82, pp179-187
%K graphics, pictures, Escher
%C 

%T The LISPKIT Manual (2 Vols.)
%A Peter Henderson, et al.
%I hend83
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--32, 1983
%K LISPKIT, independent compilation, LISP, structure editor, library manager, loader, prettyprinter
%C 

%T Shells of Functional Operating Systems
%A Peter Henderson, Simon B. Jones
%I hend84a
%S University of Stirling, Dept. Comp. Sci.  Report FPN--4, and in ``Distributed Computer Systems'' ed. D.A. Duce, Peter Peregrinus, 1984
%K interaction with user, operating systems, shells, synchronisation by lazy evaluation, sequences, streams, interaction with databases
%C 

%T Specifications and Programs
%A Peter Henderson
%I hend84b
%S University of Stirling, Dept. Comp. Sci.  Report FPN--5, 1984
%K 
%C 

%T Process Combinators
%A Peter Henderson
%I hend84c
%S University of Stirling, Dept. Comp. Sci.  Report FPN--7, 1984
%K 
%C 

%T Communicating Functional Programs
%A Peter Henderson
%I hend84d
%S University of Stirling, Dept. Comp. Sci.  Report FPN--8, 1984
%K CSP, networks of communicating processes, transformation to recursion equations, interaction, termination
%C 

%T me too --- A Language for Software Specification and Model Building --- Preliminary Report
%A Peter Henderson
%I hend84e
%S University of Stirling, Dept. Comp. Sci.  Report , 1984
%K me too, sets, specification, enumeration, first order, relations, finite functions, sequences
%C 

%T Functional Programming, Formal Specification, and Rapid Prototyping
%A P. Henderson
%I hend86
%S IEEE Transactions on SE-12, 2, pp241-250, 1986

%K software description validation
%C 

%T Type Inference and Semi-Unification
%A F. Henglein
%I heng88
%S In acm88, pp184-197
%K typed logic programming languages
%C 

%T Efficient Type Inference for Higher-Order Binding-Time Analysis
%A F. Henglein
%I heng91
%S In acm91, pp448-472
%K 
%C 

%T Global Tagging Optimization by Type Inference
%A F. Henglein
%I heng92
%S In acm92, pp205-215
%K scheme, static and dynamic typing
%C Can typecheck LISP where possible and otherwise inserts a minimum number of tag-checks on dynamic types.

%T Parameter Passing Mechanisms and Nondeterminism
%A M.C.B. Hennessy, E.A. Ashcroft
%I henn77
%S Ninth ACM Symp. on the Theory of Computing, Boulder, 1977
%K 
%C 

%T Full Abstraction for a Simple Parallel Programming Language
%A M.C.B. Hennessy, G.D. Plotkin
%I henn79
%S In LNCS 74
%K nondeterministic domains, operational semantics, denotational semantics, full abstraction
%C 

%T A Mathematical Semantics for a Nondeterministic Typed Lambda-calculus
%A M.C.B. Hennessy, E.A. Ashcroft
%I henn80
%S Theoretical Computer Science 11, 1980
%K choice, operational semantics, nondeterministic domains, mathematical semantics, full abstraction, denotational semantics
%C 

%T WCL: Delivering Efficient Common Lisp Applications under Unix
%A W. Hennessey
%I henn92
%S In acm92, pp260-269
%K 
%C 

%T Elements of Functional Languages
%A M.C. Henson
%I hens87
%S Blackwell Scientific Publications
Oxford, 1987, ISBN 0-632-01506-3.
%K krc Miranda combinatory logic lambda calculus implementation
%C An introduction to the principles behind functional languages, this book explores a wide variety of topics, which are central to software science, from a functional perspective.

%T Lazy Compilation of Term Rewriting Systems
%A M. Hermann
%I herm89
%S Report CRIN 89-R-079, Centre de Recherche en Informatique de Nancy, Vandoeuvre-les-Nancy, 1989
%K trs
%C 

%T The Architecture of Fifth Generation Inference Computers
%A L.O. Hertzberger
%I hert84
%S Future Generation Computing Systems 1,1, 1984
%K personal sequential inference machine, kernel language zero, logic programming, parallel inference machines, multiprocessing, dataflow, functional
%C 

%T A Coarse Grain Parallel Architecture for Functional Languages
%A L.O. Hertzberger, W,G. Vree
%I hert89
%S PARLE '89, LNCS 365/366, pp 269-285
%K 
%C 

%T Viewing Control Structures as Patterns of Passing Messages
%A Carl E. Hewitt
%I hewi77
%S AI Journal, 8,3, 1977
%K 
%C 

%T Actors and Continuous Functionals
%A Carl E. Hewitt, Henry G. Baker, Jr.
%I hewi78
%S In ``Formal Descriptions of Programming Concepts'' Ed. E.J. Neuhold, ISBN 0 444 85107 0, North Holland, 1978
%K communicating parallel processes, histories, actors, events, messengers, activation ordering, arrival ordering, locality, combined ordering, goal directed, continuation ordering, synchronisation
%C 

%T Performance Studies of the Monsoon Dataflow Processor
%A J. Hicks, D. Chiou, B.S. Ang, Arvind
%I hick92
%S Technical report CSG Memo 345-2, Computation Structures Group, MIT Lab. for Computer Science
%K 
%C 

%T Representing Control in the Presence of First-Class Continuations
%A R. Hieb, R.K. Dybvig, C. Bruggeman
%I hieb90
%S pp 66-77, SIGPLAN 25,6 - '90 Conference on Programming Language Design and Implementation
%K stack allocation, heap allocation, frame linkage costs, garbage collection, locality of reference, activation records, stack overflow
%C 

%T On the Average Size of Turner's Translation to Combinator Programs
%A T. Hikita
%I hiki84
%S Journal of Information Processing
7, 3, pp164-169
%K space complexity
%C 

%T The Connection Machine
%A W.D. Hillis
%I hill85
%S MIT Press
Cambridge, MA, 1985
%K LISP parallel xector cmlisp
%C 

%T Simulating Digital Circuits in Miranda
%A S.A. Hill
%I hill86
%S Report No. 42, Computing Laboratory, University of Kent, Canterbury, 1986, Revision 1, 1987.
%K 
%C In this paper the author presents a technique for the simulation of
digital circuitry in Miranda. Previous work in this area has been based on FP. He shows that lazy evaluation is one of the corner stones of this technique.

%T Data Parallel Algorithms
%A W.D. Hillis, G.L. Steele, Jr.
%I hill86b
%S CACM, 29, 12
pp1170-1183, 1986
%K 
%C 

%T Functional Programming Techniques
%A S.A. Hill
%I hill89
%S Computing Laboratory, University of Kent
Canterbury, Kent, 1989, PhD Thesis.
%K 
%C 

%T Data Parallel Haskell:  Mixing old and new glue
%A J.M.D. Hill
%I hill93
%S Technical Report, CS, Queen Mary & Westfied College
%K 
%C The technical report ``Data Parallel Haskell:  Mixing old and new glue'' (QMW611) is available for anonymous ftp on redstar.dcs.qmw.ac.uk  (192.135.231.4) in the directory cpc/jon_hill/dpGlue.ps.Z
John Hughes[6] argues that the ability to decompose a problem into parts,
depends upon the ability to `glue' those parts together.  A func tional
programming language such as Haskell[5] provides the user with two powerful
kinds of glue: higher order functions and lazy evaluation.  Although many data
parallel extensions to functional languages exist - Connection Machine Lisp[10],
Paralation Lisp[9], Parallel EuLisp[8], and Tuple[12], they all lack the special
glue of a lazy language.  This paper describes two data parallel extensions to
the lazy functional language Haskell: pods and pod comprehensions. These enable
parallel algorithms to be expressed by decomposing a problem into smaller
sequential parts, which are then glued together in parallel. We contrast an
implementation of a text searching algorithm and an LL(1) parser[4], and show
that the parallelism within both can be expressed in terms of the same higher
order parallel map and scan functions. In the first example, we decompose the
problem into a sub-string algorithm, and a parallel line joining algorithm. We
glue these two sub problems together by using lazy evaluation and pod
comprehensions - the old and new glue seem to work well.
%T The Principal Type-Scheme of an Object in Combinatory Logic
%A J.R. Hindley
%I hind69a
%S Trans. Amer. Math. Soc. 146 pp29-60, 1969
%K polymorphism, algorithm for type assignment, combinators, effective methods, principal type schemes, unification
%C 

%T An Abstract Form of the Church-Rosser Theorem, Parts I and II
%A J.R. Hindley
%I hind69b
%S Journal of Symbolic Logic 14 and 19
%K 
%C 

%T Introduction to Combinatory Logic
%A J.R. Hindley, B. Lercher, J.P. Seldin
%I hind72
%S London Math. Soc. Lecture Note Series 7, Cambridge University Press, 1972
%K lambda conversion, combinators, recursive functions, undecidability, extensional equality, strong reduction, types, logic, Church Rosser theorem
%C 

%T Combinatory Reductions and Lambda Reductions Compared
%A J.R. Hindley
%I hind77
%S Zeitschrift fr Mathematische Logik und Grundlagen der Mathematik 23, pp169-180, 1977
%K 
%C 

%T Standard and Normal Reductions
%A J.R. Hindley
%I hind78
%S Transactions of the American Mathematical Society
241, 1978, pp253-271
%K 
%C 

%T To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism
%A J.R. Hindley, J.P. Seldin, Eds.
%I hind80
%S Academic Press, 1980, ISBN 0-12-349050-2
%K lambda calculus, combinators, foundations, philosophy, syntax, semantics, types
%C This should really be Seldin and Hindley see seld80b

%T LISP/APL Merger Supports Functional Programming Concepts
%A H.J. Hindin
%I hind84
%S Computer Design 23,4, 1984
%K 
%C 

%T Combinators and Lambda Calculus, A Short Outline
%A J.R. Hindley
%I hind85
%S In cous85a, LNCS 242, pp104-122
%K 
%C This article introduces the basic ideas of combinatory logic and
lambda-calculus. Typed and untyped systems are covered.

%T An Introduction to Combinators and the Lambda-Calculus
%A J.R. Hindley, J.P. Seldin
%I hind86
%S Cambridge University Press, London Mathematical Society Student Texts 1, 1986
%K combinators, lambda-calculus, semantics, types
%C Unsuitable for undergraduates, except possible the most able.

%T SASLOG: Lazy Evaluation Meets Backtracking
%A K. Hinkelmann, K. Noekel, R. Rehbold
%I hink88
%S SEKI Report SR-88-01, Fachbereich Informatik, Universitt Kaiserslautern
Kaiserslautern, 1988
%K sasl prolog logic combinators graph reduction
%C A combined functional/logic programming language SASLOG is described which contains Turner's SASL, a fully lazy, higher-order functional language, and pure Prolog as subsets. Integration is symmetric, i.e. functional terms can appear in the logic part of the program and vice-versa. Exploiting the natural correspondence between backtracking and lazy streams yields an elegant solution to the problem of transferring alternative variable bindings to the calling functional part of the program.

%T SASLOG: Eine funktional-logische Sprachintegration mit Lazy Evaulation und semantischer Unifikation
%A K. Hinkelmann
%I hink88b
%S SEKI Working Paper SWP-88-06, Fachbereich Informatik, Universitt Kaiserslautern
Kaiserslautern, 1988
%K sasl prolog unification
%C SASLOG is a combined functional/logic programming language which contains SASL, a fully-lazy, higher-order functional language and the logic language Prolog. The integration is symmetric allowing functional terms to appear in the logic part and Prolog goals in the functional part.

%T Complexity of the Combinator Reduction Machine
%A S. Hirokawa
%I hiro85
%S Theoretical Computer Science
41, 2/3, pp289-303, 1985
%K abstraction 
%C 

%T A Simple Abstract Interpreter for a Higher-order Logic Programming Language
%A A.H.B. Hoa
%I hoa92
%S Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K 
%C 

%T An Axiomatic Basis for Computer Programming
%A C.A.R. Hoare
%I hoar69
%S CACM 12,10, 1969
%K axiomatic semantics, correctness, verification, validation, theory of proofs of programs, formal definition of languages
%C 

%T Notes on Data Structuring
%A C.A.R. Hoare
%I hoar72
%S In dahl72
%K 
%C 

%T Proofs of Correctness of Data Representations
%A C.A.R. Hoare
%I hoar72
%S Acta Informatica, 1, 1972, pp271-281
%K 
%C 

%T Hints on Programming Language Design
%A C.A.R. Hoare
%I hoar73
%S Stanford Univ. Tech Report STAN-CS-73-403
%K 
%C 

%T Communicating Sequential Processes
%A C.A.R. Hoare
%I hoar78
%S CACM 21(8) pp666-677, 1978
%K 
%C 

%T Communicating Sequential Processes
%A C.A.R. Hoare
%I hoar85
%S Prentice Hall 1985
%K 
%C 

%T Mathematical Logic and Programming Languages
%A C.A.R. Hoare, J.C. Shepherdson (Eds.)
%I hoar85b
%S Prentice Hall 1985
%K 
%C 

%T Preliminary Report on the Language TWENTEL
%A G.F. van der Hoeven
%I hoev84
%S Technische Hogeschool Twente Memo. No. INF-84-5
%K general, TWENTEL, language
%C 

%T Ad Hoc Combinators
%A G.F. van der Hoeven
%I hoev85
%S Dept. Comp. Sci., Twente Univ. of Technology, Enschede, The Netherlands
%K combinators, reduction, optimal free expressions, graph reduction
%C 

%T Programming with Equations
%A C.M. Hoffmann, M.J. O'Donnell
%I hoff82a
%S TOPLAS 4,1 1982
%K equations, term rewriting, interpreters, abstract data types, implementation, reduction strategies, sequential tree insertion
%C 

%T Pattern Matching in Trees
%A C.M. Hoffmann, M.J. O'Donnell
%I hoff82b
%S JACM 29, 1982
%K incremental pattern matching, subtree rplacement systems, interpreter generation, theorem proving, unification, matching automata
%C 

%T Implementation of an Interpreter for Abstract Equations
%A C.M. Hoffmann, M.J. O'Donnell
%I hoff84
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K laziness, pattern matching
%C 

%T Automatic Parallelization of Lazy Functional Programs
%A G. Hogen, A. Kindler, R. Loogen
%I hoge91
%S Informatik-Bericht Nr. 91-20, RWTH Aachen, Lehrstuhl fr Informatik II, Aachen, 1991
%K strictness analysis letpar graph reduction
%C 

%T The SCHEME 79 Chip
%A J. Holloway, G. Steel, G.J. Sussman, A. Bell
%I holl80
%S In acm80
%K hardware, SCHEME, direct interpretation, automatic storage management, interrupt routines, microcode, VLSI design, design methodology
%C 

%T PFL: A Functional Language for Parallel Programming
%A S. Holmstrm
%I holm83a
%S Proc. Joint SERC/Chalmers Workshop on Declarative Programming, Univ. College London, 1983
%K 
%C 

%T A Simple and Efficient Way to Handle Large Datastructures in Applicative Languages
%A S. Holmstrm
%I holm83b
%S Proc. Joint SERC/Chalmers Workshop on Declarative Programming, Univ. College London, 1983
%K 
%C 

%T Polymorphic Type Systems --- A Proof-Theoretic Approach
%A S. Holmstrm
%I holm83c
%S Programming Methodology Group Memo PMG--6, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1983
%K Exp, types, type checking, optimisation
%C 

%T A Flexible Type System
%A S. Holmstrm
%I holm83d
%S Programming Methodology Group Memo PMG--8, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1983
%K monomorphism, polymorphism, type recursive definitions
%C 

%T Polymorphic Type Schemes and Concurrent Computation in Functional Languages
%A S. Holmstrm
%I holm83e
%S Ph.D. Thesis, Chalmers TH, S--412 96 Gteborg, 1983
%K 
%C 

%T Linear Functional Programming

%A S. Holmstrm
%I holm88
%S Aspens 88, [john88a], pp13-32
%K 
%C 

%T Improving Full Laziness
%A C.K. Holst
%I hols91
%S In peyt91b, pp71-82
%K 
%C 

%T Towards Binding-Time Improvement for Free
%A C.K. Holst, J. Hughes
%I hols91b
%S In peyt91b, pp83-100
%K 
%C 

%T A Loop-Detecting Interpreter for Lazy Programs
%A C.K. Holst, J. Hughes
%I hols91c
%S Draft Proceedings, 4th Glasgow Workshop on Functional Programming, Skye, pp199-209
%K partial evaluation
%C 

%T Handwriting Cogen to Avoid Problems with Static Typing
%A C.K. Holst, J. Hughes
%I hols91d
%S Draft Proceedings, 4th Glasgow Workshop on Functional Programming, Skye, pp199-209
%K 
%C 

%T Finiteness Analysis
%A C.K. Holst
%I hols91e
%S In acm91, pp473-495
%K 
%C 

%T Functional Programming with Miranda
%A I. Holyer
%I holy91
%S Pitman, ISBN 0-273-03453-7
%K 
%C 

%T The Heap/Substitution Concept --- An Implementation of Functional Operations on Data Structures for a Reduction Machine
%A F. Hommes
%I homm82
%S SIGARCH 10,3, 1982
%K 
%C 

%T A Symmetric Set of Efficient List Operations
%A R.R. Hoogerwoord
%I hoog92
%S JFP 2,4, functional pearls pp505-513
%K 
%C 

%T The Design of Functional Programs: a Calculational Approach
%A R. Hoogerwoord
%I hoog93?
%S PhD dissertation  Technical University of Eindhoven
%K 
%C 

%T Understanding Russell: A First Attempt
%A J.G. Hook
%I hook84
%S In LNCS 173
%K Russell, abstraction, signature, many sorted algebra, type inference
%C parcftp.xerox.com:pub/russell/russell.tar.Z contains a (barely maintained) compiler, a fair amount of documentation, and pointers to other papers.


%T Operational and Axiomatic Semantics of PCF
%A B.T. Howard, J.C. Mitchell
%I howa90
%S In acm90, pp298-306
%K 
%C 

%T Typed Functional Programming
%A W.T. Huang, D.C. You
%I huan86
%S SIGPLAN 21, 2, pp22-26, 1986
%K 
%C 

%T Functional Programming in Graphs
%A W.-T. Huang
%I huan87
%S Journal of the Chinese Institute of Engineers
10, 1, pp87-97, 1987
%K 
%C This paper suggests an FP style of programming in which programmers deal with graphs as primary representations in programming, editing and executing programs.

%T Pilot Implementation of Abstract, Declarative Process Placement
%A S.-Y. Huang, P. Kelly, J. Liu
%I huan91
%S In glas91, pp197-214
%K 
%C 

%T Object and Task Reclamation in Distributed Applicative Processing Systems
%A Paul R. Hudak
%I huda82a
%S Ph. D. Thesis, Univ. Utah, Salt Lake City, 1982
%K 
%C 

%T Garbage Collection and Task Deletion in Distributed Applicative Processing Systems
%A Paul R. Hudak, Robert M. Keller
%I huda82b
%S In acm82
%K storage management, garbage collection, real time, parallelism, on-the-fly, distributed systems
%C 

%T Distributed task and Memory Management
%A P. Hudak
%I huda83
%S In Symp. on Principles of Distributed Computing (ed. N.A. Lynch et al.), pp277-289, ACM 1983
%K 
%C 

%T Experiments in Diffused Combinator Reduction
%A Paul R. Hudak, B. Goldberg
%I huda84a
%S In acm84a, pp167-176
%K combinators, graph reduction, parallelism, DAPS, ALFL
%C A general strategy for automatically decomposing and dynamically
distributing a functional program is discussed, suitable for parallel execution on multiprocessor architectures with no shared memory.

%T ALFL Reference Manual and Programmer's Guide
%A Paul R. Hudak
%I huda84b
%S Yale University Technical Report YALEU/DCS/TR--322, 1984
%K ALFL, language, bags, types, pattern matching, I/O
%C 2nd edition

%T A Combinator-Based Compiler for a Functional Language
%A Paul R. Hudak, D. Kranz
%I huda84c
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K combinators, laziness, efficiency, optimisation, ALFL, simplification, implementation, code generation, uncurrying, strictness analysis, self modifying thunks, escape analysis
%C 

%T Distributed Applicative Processing Systems: Project Goals, Motivation and Status Report
%A Paul R. Hudak
%I huda84d
%S Yale University Technical Report YALEU/DCS/TR--317, 1984
%K 
%C 

%T Serial Combinators: "Optimal" Grains of Parallelism
%A Paul R. Hudak, B. Goldberg
%I huda85a
%S In LNCS 201, FPCA Nancy 1985
%K combinators, serial combinators, concurrency, parallelism, graph reduction, distributed computing
%C A method is described for translating a high-level functional language into combinators suitable for execution on multiprocessors with no shared memory.

%T Distributed Execution of Functional Programs Using Serial Combinators
%A Paul R. Hudak, B. Goldberg
%I huda85b
%S Yale University Technical Report YALEU/DCS/TR--, 1985 --- also IEEE Transactions on Computing C--34,10, October 1985, pp881-891
%K Combinators, distributed computing, graph reduction, parallelism, multiprocessing, load balancing, complexity
%C 

%T A Set-Theoretic Characterization of Function Strictness in the Lambda Calculus
%A Paul R. Hudak
%I huda85c
%S Yale University Technical Report YALEU/DCS/TR--391, 1985 --- Also Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K strictness analysis, abstract interpretation, denotational semantics, set theoretic characterisation, higher order functions
%C It is shown that the most obvious strategy for computing the least
fixpoint of the functional characterizing strictness is NP-complete, but that in practice the complexity seems to be tractable.

%T Para-functional Programming
%A Paul R. Hudak, L. Smith
%I huda85d
%S Yale University Technical Report YALEU/DCS/TR--390, 1985
%K ALFL, Paralfl, concurrency, parallelism, annotations, networks, formal semantics, execution trees
%C 

%T The Aggregate Update Problem in Functional Programming Systems
%A Paul R. Hudak, A. Bloss
%I huda85e
%S Proc. 12th ACM Symp. POPL, 1985
%K arrays, aggregates, contiguous data structures, avoiding copying, updating, static inference, conflict sets, optimisation, reference counting, vectors
%C Aggregate problem with reference to arrays. compile time analyses discussed in detail

%T Arrays, Non-determinism, Side Effects and Parallelism
%A Paul R. Hudak
%I huda86a
%S In LNCS 279, 1986, pp312-327
%K 
%C Incremental, functional updates to arrays, executed in a non-deterministic manner, are shown to achieve the same effect (in both efficiency and functionality) as parallel assignment to imperative arrays.

%T Denotational Semantics of a Parafunctional Programming Language
%A Paul R. Hudak
%I huda86b
%S Int. J. Parallel Program 15, 2 pp103-152, also YALEU/DCS/TR-484, Yale University, Department of Computer Science
New Haven, CT
%K 
%C 

%T Para-functional Programming: A Paradigm for Programming Multiprocessor Systems
%A P. Hudak, L. Smith
%I huda86d
%S 12th POPL, pp243-254, also IEEE Computer, 8
pp60-70, 1986
%K optimisation parallel ParAlfl annotations
%C The discussion is on Para-functional programming which is a method for programming parallel machine using functional style by treating parallel machine as autonomous. Some examples are discussed

%T Higher-Order Strictness Analysis for Untyped Lambda Calculus
%A P. Hudak, J. Young
%I huda86e
%S 12th POPL, pp97-109 - also Yale Technical report
%K optimisation parallel Alfl
%C 

%T A Semantic Model of Reference Counting and its Abstraction
%A P. Hudak
%I huda86f
%S In acm86, pp351-363 and abra87
%K 
%C 

%T Collecting Interpretations of Expressions (Preliminary Version)
%A P. Hudak
%I huda86g
%S YALEU/DCS/RR-497, Yale University, Department of Computer Science, New Haven, CT, 1986
%K semantics dataflow
%C 

%T Para-Functional Languages for Parallel Distributed Computing
%A P. Hudak
%I huda86h
%S To appear in Proceedings COMPCON 1987
%K 
%C 

%T Pomset Interpretations of Parallel Functional Programs
%A P. Hudak, S. Anderson
%I huda87
%S FPCA 1987, LNCS 274 pp234-256
%K semantics operational partially ordered multiset
%C A new framework is presented, based on the notion of partially ordered multiset (or pomset), which is able to provide not only a precise operational semantics of parallel functional program evaluation, but also a handle through which to control such behavior.

%T Haskell Solutions to the Language Session Problems at the 1988 Salishan High-speed Computing Conf.
%A P. Hudak, S. Anderson
%I huda88a
%S Tech Rep. YALEU/DCS/RR-627, Dept. CS, Yale Univ.
%K 
%C 

%T On the Expressiveness of Purely Functional I/O systems
%A P. Hudak, R. Sundaresh
%I huda88b
%S Tech Rep. YALEU/DCS/RR-665, Dept. CS, Yale Univ.
%K Haskell, referentially transparent I/O, lazy stream I/O, continuation I/O, systems model, non-determinism, survey, file I/O, channel I/O, Actors, UNITY, CSP, CCS, Linda
%C Previous proposals for I/O have used either the notion of lazy streams or continuations to model interaction with the external world. The authors discuss and generalize these models and introduce a third, which they call the systems model, to perform I/O.

%T Draft Report on the Functional Programming Language Haskell
%A P. Hudak, P. Wadler
%I huda88c
%S Tech Rep. YALEU/DCS/RR-656, Dept. CS, Yale Univ. Also Glasgow Univ. report.
%K 
%C A Draft --- see YALEU/DCS/RR777 for Version 1.0
mclo89 mentions RR-666. Mistake?

%T Graphinators and the Duality of SIMD and MIMD
%A P. Hudak, E. Mohr
%I huda88d
%S In acm88, pp224-234
%K combinator reduction, parallelism, mutators
%C 

%T Exploring para-functional programming:
Separating the what from the how
%A P. Hudak
%I huda88d
%S IEEE Software. Vol. 5, No. 1, pp.54-61
%K 
%C 

%T Conception, Evolution, and Application of Functional Programming Languages
%A Paul R. Hudak
%I huda89a
%S Computing Surveys 21 No 3, pp359-411
%K General, data-flow languages, non-procedural languages, very high-level languages, lambda calculus, data abstraction, higher order functions,
lazy evaluation, referential transparency, types,
equational resoning, history, evolution, Church Rosser theorems, Fixpoint Theorem, Church's thesis, LISP, Iswim, APL, FP, ML, SASL, KRC, Miranda, Haskell, Non-strict semantics, pattern matching, formal semantics, overloading, input/output, arrays, views, parallelism, caching, memo functions, memoization, nondeterminism, polymorphic type inference, myths
%C A general survey. An excellent paper on functional prog,  its history and issues of future FP paradigm. Introduces Haskell language


%T Report on the Programming Language Haskell, A Non-Strict Purely Functional Language
%A P. Hudak, P. Wadler, et al., Eds.
%I huda90
%S Tech Rep. YALEU/DCS/RR-777, Dept. CS, Yale Univ. Also Glasgow Univ. report CSC/89/R5.
 To be published in SIGPLAN
%K 
%C Version 1.0

%T Report on the Programming Language Haskell, A Non-Strict Purely Functional Language, Version 1.1
%A P. Hudak, P. Wadler, et al., Eds.
%I huda91
%S Yale University, August 1991
%K layout, expressions, pattern matching, declarations, bindings, types, classes, instances, overloading, ad hoc polymorphism, algebraic datatypes, monomorphism restriction, modules, arrays, stream I/O, continuation I/O, synchronisation, derived instances
%C Version 1.1

%T Para-Functional Programming in Haskell
%A P. Hudak
%I huda91b
%S In szym91, pp159-196
%K 
%C 

%T Report on the Programming Language Haskell, A Non-Strict Purely Functional Language, Version 1.2
%A P. Hudak, P. Wadler, et al., Eds.
%I huda92
%S SIGPLAN 27,5, also Glasgow & Yale Universities, August 1992
%K layout, expressions, pattern matching, declarations, bindings, types, classes, instances, overloading, ad hoc polymorphism, algebraic datatypes, monomorphism restriction, modules, arrays, stream I/O, continuation I/O, synchronisation, derived instances
%C Version 1.2

%T A Gentle Introduction to Haskell
%A P. Hudak, J.H. Fasel
%I huda92b
%S SIGPLAN 27,5 ppT1-T53
%K general tutorial
%C 

%T Continuation-based Mutable Abstract Datatypes, or How to have your State and Munge it too
%A P. Hudak
%I huda92c
%S DOCS, Yale University, YALEU/DCS/RR-914
%K 
%C Available via anonymous ftp from nebula.cs.yale.edu (128.36.13.1) in the file pub/yale-fp/papers/madt.ps.

%T State in Functional Programming: An Annotated Bibliography
%A P. Hudak, D. Rabin, eds.
%I huda93
%S 
%K 
%C Now available by anonymous ftp from: nebula.cs.yale.edu, pub/yale-fp/papers/state-bib.<format>.<compression> where
  <format> ::= ps | dvi
  <compression> :: = z | Z

z is GNU gzip; Z is compress.
This is a preliminary version. If you think something is missing, mistakenly present, or mischaracterized please send a constructive comment to one of the editors.


%T A Language-Independent Garbage Collector Toolkit
%A Hudson, Moss, Diwan, Weight
%I huds91
%S COINS tech report 91-47
%K 
%C allocation

%T Dynamic Program Parallelization
%A L. Huelsbergen, J.R. Larus
%I huel92
%S In acm92, pp311-323
%K 
%C 

%T Unification in the Typed Lambda Calculus
%A G.P. Huet
%I huet75a
%S LNCS 37, pp192-212
%K unification, types, lambda calculus, undecidability
%C 

%T A Unification Algorithm for Typed Lambda-Calculus
%A G.P. Huet
%I huet75b
%S Theoretical Computer Science 1, 1975
%K semi decision algorithm, typed omega-order lambda-calculus, correctness, normal form, unification
%C 

%T Call-by-Need Computations in Non-Ambiguous Linear Term Rewriting Systems
%A G.P. Huet, J.J. Lvy
%I huet79
%S Tech. Rep. 359, INRIA, Rocquencourt Le Chesnay, France, 1979
%K term rewriting systems, rewrite rules, simplifications, recursive schemes, abstract interpreters, operational semantics, meta compilers, call by name, equational theories, formula manipulation, abstract data types, tree pattern matching, trie structures, sequentiality, lazy interpreters, call by need
%C 

%T Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
%A G.P. Huet
%I huet80a
%S JACM 27,4, 1980
%K Church Rosser theorems, abstract confluence properties, reduction, induction, simplification systems, extension of Rosen and Knuth Bendix, term rewriting systems
%C 

%T Equations and Rewrite Rules: A survey
%A G.P. Huet, D.C. Oppen
%I huet80b
%S In 'Formal Language Theory - Perspectives and Open Problems', Academic Press, pp349-405
%K bibliography, sorted algebras, rewrite rules, initial algebras, word problems, unification, term rewriting, superposition, termination, well founded mapping, increasing interpretation, simplification ordering, recursive path ordering, homeomorphic interpretation, Knuth Bendix algorithm, canonical forms, completion algorithm, complexity, seperable equational theories, meta-unification, equality propagation
%C 

%T Cartesian Closed Categories and Lambda-Calculus
%A G. Huet
%I huet85
%S In cous85a, LNCS 242, pp123-135
%K 
%C The purpose of these notes is to propose an equational framework for the formalization, and ultimately in the mechanization, of categorical reasoning.

%T Formal Structures for Computation and Deduction
%A G.P. Huet
%I huet86
%S a calculus, constructive type theory
%K proof theory, general, foundations, sequent calculus, equational logic, canonical rewriting, natural deduction, combinators, types, polymorphism, correspondence between propositions and types, ML, logic programming, horn clauses, schemas, resolution, principal type theorem, constructive methods, term rewriting, word problem, Knuth Bendix, normalisation, category theory, intuitionistic logic, lambda calculus, constructive type theory
%C 

%T Logical Foundations of Functional Programming
%A G. Huet, (Ed.)
%I huet90
%S Addison Wesley, 0 201 17234 8, 1990
%K 
%C 

%T Super-Combinators: A New Implementation Method for Applicative Languages
%A R.J.M. Hughes
%I hugh82a
%S In acm82, pp1-11
%K graph reduction, super combinators, efficiency, full laziness, maximal free expressions
%C 

%T Graph-Reduction with Super-Combinators

%A R.J.M. Hughes
%I hugh82b
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--28, 1982
%K graph reduction, super combinators, efficiency, full laziness, maximal free expressions, program transformation, optimisation, cafs
%C 

%T Reference Counting with Circular Structures in Virtual Memory Applicative Systems
%A R.J.M. Hughes
%I hugh82c
%S Oxford Univ. Prog. Research Group, 1982
%K reference counting, garbage collection, storage management, virtual memory, graph reduction, LISP, parallel architectures, multiprocessors, circular lists, self reference
%C 

%T The Design and Implementation of Programming Languages
%A  R.J.M. Hughes
%I hugh83
%S Ph.D. Thesis published as Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--40, 1983
%K general, super combinators, laziness, efficiency, languages, order of evaluation, parallelism, garbage collection, graph reduction, implementation
%C 

%T Developing Functional Programs from Formal Specifications
%A R.J.M. Hughes
%I hugh84a
%S Chalmers Report, 1984
%K specifications, regular expression matcher, Z, algorithm development, representation, prototyping, optimisation, memo functions
%C 

%T Parallel Functional Programs use Less Space
%A R.J.M. Hughes
%I hugh84b
%S Oxford Univ. Prog. Research Group, 1984
%K 
%C 

%T A Novel Representation of Lists and its Application to the Function `reverse'
%A R.J.M. Hughes
%I hugh84c
%S Programming Methodology Group Memo PMG--38, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1984 --- Also Information Processing Letters 22, 1986
%K transformation, representation, lists as functions, KRC
%C 

%T From Formal Specification to Functional Program: A Regular Expression Matcher
%A R.J.M. Hughes
%I hugh84d
%S Programming Methodology Group Memo PMG--39, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1984
%K Now superseded by 
%C 

%T Lazy Memo-Functions
%A R.J.M. Hughes
%I hugh85a
%S FPCA'85, Nancy, LNCS 201, pp129-146, also Programming Methodology Group Memo PMG--42, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg --- Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K laziness, memo functions, caching
%C In this paper the author introduces a slight variant on the old idea of a memo-function. Lazy memo-functions can be implemented more efficiently than ordinary memo-functions.

%T A Distributed Garbage Collector Algorithm
%A  R.J.M. Hughes
%I hugh85b
%S FPCA'85, Nancy, LNCS 201, pp256-272
%K garbage collection, parallelism, architecture, distributed systems
%C Each processor is able to garbage collect its local memory independently of the rest of the system, and each local garbage collection contributes a little to global garbage collection.

%T Parallel Functional Languages Use Less Space
%A R.J.M. Hughes
%I hugh85c
%S Chalmers Report, 1985
%K parallelism, efficiency, complexity, lazy evaluation, scheduling, explicit parallel construct, synchronising, quicksort in linear space, inverse nondeterministic merge, semantics
%C 

%T Strictness Detection in Non-flat Domains
%A R.J.M. Hughes
%I hugh85d
%S In LNCS 217 - also Chalmers Report
%K strictness analysis, lazy closures, non-flat domains
%C 

%T An Efficient Implementation of Purely Functional Arrays
%A R.J.M. Hughes
%I hugh85e
%S Chalmers Report, 1985
%K arrays, implementation, contiguous storage, cdr coding
%C 

%T Analysing Strictness by Abstract Interpretation of Continuations
%A R.J.M. Hughes
%I hugh86a
%S To appear in ``Abstract Interpretation'' eds. Abramsky & Hankin, 1986??
%K lazy evaluation, continuation semantics, strictness analysis, contexts, abstraction function
%C 

%T A Simple Implementation of Concurrent Graph reduction
%A R.J.M. Hughes
%I hugh86b
%S Dept. Comp. Sci., Univ. of Glasgow, 1986
%K concurrency, parallelism, graph reduction, measurement, efficiency
%C 

%T Backwards Analysis of Functional Programs
%A R.J.M. Hughes
%I hugh87a
%S Dept. Comp. Sci. report CSC/87/R3, Univ. of Glasgow, 1987, also in bjor88
%K strictness analysis, conversion to call by value, abstract interpretation, forward analysis, higher order languages, propagating contexts, context functions, abstractions of context domains, call by need, call by name, life time of data, data structures, lazy lists, polymorhism
%C A framework for backwards analysis of functional programs
is introduced. It is shown that backwards analysis can be
extended to derive information about data structures and higher
order functions in typed languages.

%T Managing Reduction Graphs with Reference Counts
%A R.J.M. Hughes
%I hugh87b
%S CSC/87/R2, Dept. Comp. Sci., Univ. of Glasgow, 1987
%K garbage collection, space allocation, reference counts, cyclic structures, graph reduction, incremental storage management, imperative programs
%C The author presents a variant of reference counting which can be used to manage the heap in graph reduction implementations of functional languages. Unlike most reference counting algorithms, it exploits the special properties of functional languages to recover cyclic data structures.

%T Analysing Strictness by Abstract Interpretation of Continuations
%A R.J.M. Hughes
%I hugh87c
%S In abra87 
%K 
%C 

%T Implementing Functional Databases
%A R.M.J. Hughes, G. Argo, J. Fairbairn, P. Trinder, J. Launchbury
%I hugh87d
%S Research Report CSC/87/R15, Department of Computing Science, University of Glasgow, 1987
%K 
%C 

%T Abstract Interpretation of First Order Polymorphic Functions
%A John Hughes
%I hugh88
%S Aspens 88, [john88a], pp89-108, also Proc. Glasgow 1988 Workshop, hall89, pp68-88
%K 
%C 

%T Why Functional Programming Matters
%A R.J.M. Hughes
%I hugh89a
%S Comp. J. 32, 2, pp98-107, April 1989; also in turn90a, Research Topics in Functional Programming
Also in Programming Methodology Group Memo PMG-40 (Tech Rep. 16), Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1984
%K general, tutorial, examples, AI, pruning, alpha-beta search, numerical analysis, Newton-Raphson, differentiation, integration, productivity, modular programming
%C In this paper the author shows that two features of functional languages in particular, higher-order functions and lazy evaluation, can contribute greatly to modularity.

%T Projections for Polymorphic Strictness Analysis
%A R.J.M. Hughes
%I hugh89b
%S LNCS 389, also University of Glasgow Research Report CSC/90/R33
%K 
%C John Launchbury a co-author?

In this paper both analyses are examined in a common framework, and their
equivalence is demonstrated.

%T Expressing and Reasoning About Non-Deterministic Functional Programs
%A R.J.M. Hughes, J. O'Donnell
%I hugh89c
%S In davi89b, pp308-328
%K 
%C 

%T Compile-time Analysis of Functional Programs
%A J. Hughes
%I hugh90
%S in turn90a, Research Topics in Functional Programming, pp117-153
%K 
%C 

%T Towards Relating Forwards and Backwards Analyses
%A J. Hughes, J. Launchbury
%I hugh91
%S In peyt91b, pp101-113
%K 
%C 

%T Static Analysis of Store Use in Functional Programs
%A S.P. Hughes
%I hugh91b
%S Ph.D. Thesis, University of London
%K 
%C 

%T Applicative Updating and Provisional Computation in Functional Programming
%A F.E. Hunt
%I hunt83
%S Ph.D. Thesis, Univ. Utah, Salt Lake City, 1983
%K 
%C 

%T Frontiers and Open Sets in Abstract Interpretation
%A S. Hunt
%I hunt89
%S FPCA89, Imperial College, London, 1989, pp1-13
%K 
%C In this paper a new approach is presented to the frontiers problem based on the insight that frontiers represent open and closed subsets of a function's argument domain.

%T Fixed Points and Frontiers: A New Perspective
%A S. Hunt, C. Hankin
%I hunt91
%S J. Functional Programming, 1(1), pp91-120
%K abstract interpretation, strictness analysis, compile time analysis, complexity
%C In this article is presented a new approach to the frontiers algorithm based on the insight that frontiers represent upper and lower subsets of a function's argument domain. This insight leads to a new formulation of the frontiers algorithm for higher-order functions.

%T PERs Generalise Projections for Strictness Analysis
%A S. Hunt
%I hunt91b
%S In peyt91b, pp114-125
%K 
%C 

%T Abstract Interpretation of Functional Languages: From Theory to Practice
%A L.S. Hunt
%I hunt91c
%S Ph.D. Thesis, CS, Imperial College, London
%K 
%C 

%T Binding Time Analysis: A New {PER}spective
%A S. Hunt
%I hunt91d
%S SIGPLAN 26, 9, Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation
%K 
%C 

%T Preliminary Arrangements of Arguments in Lazy Evaluation
%A L. Husheng, M. Takeichi
%I hush91
%S New Generation Computing, 9, pp135-147
%K 
%C 

%T Parsing Using Combinators
%A G. Hutton
%I hutt90
%S In davi89b, pp353-370
%K 
%C 

%T Functional Programming with Relations
%A G. Hutton
%I hutt91
%S In peyt91b, pp126-140
%K 
%C 

%T Higher-Order Functions for Parsing
%A G. Hutton
%I hutt92
%S JFP 2,3, pp323-343  also published as a Chalmers technical report.
%K combinators for parsing, BNF notation, lexical, syntax, offside, errors, combining, glue
%C 
See also hutt90

%T A Survey of Some Useful Partial Order Relations on Terms of the Lambda Calculus
%A J.M.E. Hyland
%I hyla75
%S In LNCS 37, pp83-95
%K 
%C 

%T Functional Programming with Streams
%A T. Ida, J. Tanaka
%I ida83
%S IFIP '83 --- Proc. 9th World Computer Congress, Paris, Ed. R.E.A. Mason, ISBN 0--444--86729--5, Elsevier, North Holland, 1983
%K streams, laziness, FP style, implementation
%C 

%T Functional Programming with Streams --- Part II
%A T. Ida, J. Tanaka
%I ida84
%S New Generation Computing 2, pp261-275, 1984
%K streams, implementation, generation, transformation, reduction, sequences, FP
%C The purpose of the paper is twofold: to further develop the concept of a stream, and to present an implementation aspect of stream programming.

%T Comparison of Closure Reduction and Combinatory Reduction Schemes
%A T. Ida, A. Konagaya
%I ida84b
%S ??
%K 
%C 

%T A Turncoat Gives his Reasons
%A D. Ince
%I ince86
%S Datalink Magazine, Feb. 10 London, 1986
%K Backus, von Neumann bottleneck, popular exposition, correctness, reasoning about programs, specification
%C 

%T Writing Interactive and File Processing Functional Programs: A Method and Implementation
%A E. Ireland
%I irel89
%S Master's Thesis, Victoria University of Wellington
%K 
%C 

%T The Lazy Functional Abstract Machine
%A E. Ireland
%I irel92
%S 15th Australian Computer Science Conference, Hobart, Tasmania, Jan.
%K LFAM, debugging, implementation, generational garbage collection, lazy, strictness, variable access
%C 

%T A Simple Optimiser for FP-like Languages
%A N.Islam, et al.
%I isla81
%S In acm81
%K optimisation, transformation, animation, FP style, reduction, matrix multiplication, type checking, graphics
%C 

%T Program Transformation in Functional Languages
%A N.Islam
%I isla82a
%S Ph. D. Thesis, Univ. Delaware, Newark DE, 1982
%K 
%C 

%T From Equations to Functions: Techniques for Generating FP Definitions
%A N. Islam, T.J. Myers
%I isla82b
%S CIS Tech. Rep., U. of Del., 5/82, 1982
%K 
%C 

%T Involving Coroutines in Interaction between Functional and Conventional Language
%A M. Ivanovic, Z. Budimac
%I ivan90
%S SIGPLAN25, 11
1990
%K LISP, modula-2
%C 

%T A Condition for Identifying Two Elements of Whatever Model of Combinatory Logic
%A G. Jacopini
%I jaco75
%S LNCS 37, pp213-219
%K 
%C 

%T Dialogue-Software for the Optimization of Cutting Processes
%A H.-J. Jacobs, et al.
%I jaco83
%S Proc. 5th Internat. IFIP/IFAC Conf. on Programming Research and Operational Logistics in Advanced Manufacturing Technology, Leningrad, North Holland, 1983
%K 
%C 

%T Language of Functional Schemata for Parallel Processing
%A A. Jafri
%I jafr81
%S Proc. 1st Conf. on Foundations of Software Technology and Theoretical Computer Science, Bangalore, 1982. Springer??
%K 
%C 

%T A Fully Abstract Semantics for a Functional Language with Logic Variables
%A R. Jagadeesan, P. Panangaden, K.K. Pingali
%I jaga89
%S Proceedings of the Fourth IEEE Symposium on Logic in Computer Science, Asilomar, CA
%K Id, I-structures
%C 

%T Abstract Semantics for a Higher order Functional Language with Logic Variables
%A R. Jagadeesan, K.K. Pingali
%I jaga91
%S Dept. of Computer Science, Cornell University, Ithaca, New York, TR91-1220
%K Id, I-structures
%C 

%T Investigations into Abstraction and Concurrency
%A R. Jagadeesan
%I jaga92
%S Dept. of Computer Science, Cornell University,  Ithaca, New York,TR 91-1231
%K 
%C 

%T A Foundation for an Efficient Multi-Threaded Scheme System
%A S. Jagannathan, J. Philbin
%I jaga92
%S In acm92, pp345-357
%K 
%C 

%T Set Construtors, Finite Sets, and Logical Semantics
%A D. Jana, B. Jayaraman
%I jana92
%S SUNY-Buffalo TR
%K 
%C 

%T ML with Extended Pattern Matching and Subtypes
%A L. Jatagaonkar, J.C. Mitchell
%I jata88
%S In acm88, pp198-211
%K 
%C 

%T Resource Expressions for Applicative Languages
%A B. Jayaraman, Robert M. Keller
%I jaya82
%S Proc. Internat. Conf. on Parallel Processing, BelAir, Michigan, 1982
%K 
%C 

%T Equations, Sets and Reduction Semantics for Functional and Logic Programming
%A B. Jayaraman, F.S. K. Silberman
%I jaya86
%S In acm86, pp320-331
%K 
%C 

%T Parallel Execution of an Equational Language
%A B. Jayaraman, G. Gupta
%I jaya86a
%S In LNCS 279
%K 
%C 

%T Functional Programming with Sets
%A B. Jayaraman, D.A. Plaisted
%I jaya87
%S LNCS 274, pp194-210
%K 
%C The authors present a novel language (SEL) based on sets and equations, where sets are treated as sets, consistent with their semantics.

%T Parallel Execution of an Equational Language
%A B. Jayaraman, G. Gupta
%I jaya87b
%S In LNCS 279, pp370-381
%K 
%C 

%T Subset-logic Programming: Application and Implementation
%A B.Jayaraman, A. Nair
%I jaya88
%S Proc. 5th Intl. Conf. on Logic Prog., pp. 843-858, MIT Press
%K 
%C 

%T Programming with Equations, Subsets and Relations
%A B.Jayaraman, D.A. Plaisted
%I jaya89
%S Proc. N. Amer. Conf.  on Logic Programming,  pp. 1051-1068,  MIT Press
%K 
%C 

%T Implementation of Subset-Equational Programs
%A B. Jayaraman
%I jaya92
%S Journal of Logic Programming, vol. 12, pp. 299-324
%K 
%C 

%T Abstract Interpretation vs. Type Inference: A Topological Perspective
%A T. Jensen
%I jens91
%S In peyt91b, pp141-145
%K 
%C 

%T gw-Calculus Semantics of Functional Programming 
%A M.-D. Jiang, J.-F. Liu
%I jian90
%S Chinese Science Bulletin
35, 9, pp773-776, 1990
%K metacom position rule
%C 

%T Towards a provably correct hardware implementation of Occam
%A H. Jifeng, I. Page, J.P. Bowen
%I jife93
%S LNCS 683, pp214-225
%K 
%C 

%T Some Techniques for the Efficient Compilation of Lazy Narrowing into Prolog
%A J.A. Jimenez-Martin, J. Mario, J.J. Moreno-Navarro
%I jime92
%S Proceedings of LOPSTR'92, Manchester 1992, Springer-Verlag, Workshops in Computer Science
%K 
%C 

%T DSI Program Description
%A S.D. Johnson
%I john81a
%S Indiana University Dept. Comp. Sci. Technical Report 120
%K 
%C 

%T Code Generation for Lazy Evaluation
%A Thomas Johnsson
%I john81b
%S Programming Methodology Group Memo PMG--22, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1981
%K 
%C 

%T Detecting when Call-by-Value Can be Used Instead of Call-by-Need
%A Thomas Johnsson
%I john81c
%S Programming Methodology Group Memo PMG--14, Institutionen for Informationsbehandling, Chalmers Tekniska Hogskola, Goteborg, 1981
%K 
%C 

%T The G-Machine: An Abstract Machine for Graph Reduction
%A Thomas Johnsson
%I john83
%S Proc. Joint SERC/Chalmers Workshop on Declarative Programming, Univ. College London, 1983
%K 
%C 

%T Efficient Compilation of Lazy Evaluation
%A Thomas Johnsson
%I john84a
%S Proc. SIGPLAN '84 Symposium on Compiler Construction, ACM, Montreal 1984, SIGPLAN 19, 6, pp58-69
%K laziness, implementation, graph reduction, user combinators, G-machine architecture
%C 

%T Applicative Programming and Digital Design
%A S.D. Johnson
%I john84b
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K synchronous systems, digital design, DAISY, circuit design, design language
%C 

%T Lambda Lifting: Transforming Programs to Recursive Equations
%A Thomas Johnsson
%I john85
%S FPCA'85, Nancy, LNCS 201, pp190-203 --- Also Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K combinators, rewrite rules, implementation
%C Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combinator) definitions which will be used as rewrite rules.

%T Target Code Generation from G-Machine Code
%A Thomas Johnsson
%I john86
%S In LNCS 279
%K G-machine, code generation, graph reduction, LML, laziness, peep hole optimisation, implementation, compilers, attribute grammars
%C The G-machine as a stack machine for von-Neumann-like execution of lazy functional languages, using graph reduction. This paper describes how target code generation from G-machine code is performed in a compiler for Lazy ML.

%T Attribute Grammars as a Functional Programming Paradigm
%A T. Johnsson
%I john87b
%S LNCS 274, pp154-173
%K efficiency, laziness
%C Firstly, it is shown how attributes in an attribute grammar can be simply and efficiently evaluated using a lazy functional language. Secondly, a methodology is described where efficient functional programs can be developed where conventional solutions yield less efficient solutions.

%T Compiling Lazy Functional Languages

%A T. Johnsson
%I john87c
%S PhD. Thesis, CS, Chalmers University of Technology
%K 
%C 

%T Aspens Workshop on Implementation of Functional Languages, Gteborg 1988
%A T. Johnsson, et al.
%I john88a
%S Programming Methodology Group Report 53, University of Gteborg and Chalmers University of Technology, 1988
%K general, conference, reduction, sharing, parallelism, architecture, strictness analysis,
linear logic, single threading, lenience, fixed points, abstract interpretation, structural operational semantics, inverse image analysis, partial evaluation, input/output, guards, transformation, control, programming environments, G-TIM, spineless tagless G-machine, hardware, TIM, specification, virtual machines, abstract machines, taxonomy, thunks, Flagship, data flow, D-machine, <n,G> machine, DSI model, concurrency, Hope+

%C The second Aspenas workshop organised by Chalmers

%T Daisy Programming Manual
%A S.D. Johnson
%I john88b
%S Tech. Rep. Indiana Univ. CS
%K 
%C 

%T How Daisy is Lazy
%A S.D. Johnson
%I john89
%S Indiana Univ. CS TR286
%K 
%C 

%T Analysing Heap Contents in a Graph Reduction Intermediate Language
%A T. Johnsson
%I john90
%S In peyt91b pp146-171, also Research Report CSC/90/R21, Department of Computer Science, University of Glasgow, 1990
%K 
%C 

%T Trap Architectures for Lisp Systems
%A D. Johnson
%I john90
%S In acm90, 79-86
%K 
%C 

%T A Review of the FPCA '91 Proceedings
%A T. Johnsson
%I john92
%S JFP 2,2, pp227-231
%K 
%C 

%T Flow Analysis of Lambda Expressions
%A Neil D. Jones
%I jone81
%S DAIMI PB--128, Dept. Comp. Sci., Aarhus Univ., Aarhus, Denmark, 1981
%K 
%C 

%T A Fixed-Program Machine for Combinator Expression Evaluation
%A Neil D. Jones, S.S. Muchnick
%I jone82a
%S In acm82, pp11-19
%K combinators, architecture, laziness, normal order evaluation
%C 

%T A Flexible Approach to Interprocedural Flow Analysis and Programs with Recursive Data Structures
%A Neil D. Jones, S.S. Muchnick
%I jone82b
%S Proc. 9th POPL, Albuquerque, 1982
%K data flow analysis, recursive data structures, abstract interpretation
%C 

%T Abstract Machine Support for Purely Functional Operating Systems
%A Simon B. Jones
%I jone83
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--34, August 1983 also Stirling University CS Report 15
%K operating systems, lazy evaluation, stream processing, interactive input/output, I/O, SECD machine, multi stream machine input, LISPKIT, hardware, delayed evaluation, nondeterminism, pseudo parallelism, device control
%C The development of an abstract machine to support a purely functional systems programming language.

%T A Range of Operating Systems written in a Purely Functional Style
%A Simon B. Jones
%I jone84
%S University of Stirling, Dept. Comp. Sci.  Report TR.16, 1984 --- also Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--42
%K interactive lazy evaluation, networks of processes, peripheral hardware, distributed systems, streams, modularisation, sharing of resources, non deterministic choice
%C 

%T An Experiment in Partial Evaluation: The Generation of a Compiler Generator
%A Neil D. Jones, et al.
%I jone85
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K partial evaluation, lazy evaluation, interpreters, compilers, compiler compilers, folding, reflexivity, residual programs, efficiency, autoprojection, measurement
%C 

%T Dataflow [Analysis?] of Applicative Programs Using Minimal Function Graphs
%A Neil D. Jones, A. Mycroft
%I jone86
%S Proc. 13th POPL,  pp296-306
%K partial evaluation
%C The following problem is addressed: What is the natural analog for functional programs of Cousot's collecting semantics? An answer is given using the minimal set of (argument, result) pairs
sufficient to compute on a given input set, and a framework for static program analysis including `constant propagation' is developed.

%T MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation
%A N.D. Jones, P. Sestoft, H.Sndergaard
%I jone87
%S List and Symbolic Computation 2,1, 1989 -- also LNCS 298, Proc 3rd Workshop on Math. Foundations of Programming Language Semantics
%K partial evaluation, MIX, mixwell, call unfolding, binding time analysis, call graph analysis, annotation, function specialisation, performance
%C 

%T Investigation of performance achievable with highly concurrent interpretation of functional programs
%A S.B. Jones, ed.
%I jone87
%S ESPRIT 302, final report
%K 
%C 

%T A Semantics-Based Framework for the Abstract Interpretation of Prolog
%A N.D. Jones, H. Sndergaard
%I jone87b
%S In abra87, pp123-142
%K 
%C A method resembling minimal function graphs is given for the static analysis of Prolog programs. It is based on the use of varying interpretations of a common core semantics for Prolog.

%T Flow Analysis of Lazy Higher-Order Functional Programs
%A N.D. Jones
%I jone87c
%S In abra87, pp103-122
%K partial evaluation
%C A method is presented for static analysis of programs manipulating tree-structured data. An algorithm is given that constructs from a program in term rewriting system form a tree grammar safely approximating the program's variable bindings and intermediate results.

%T Optimisation of Storage Management in Functional Languages by Static Analysis of Programs
%A S.B. Jones, D. Le Metayer
%I jone88a
%S Proc. Glasgow 1988 Workshop, hall89, pp87-100
%K 
%C 

%T The Continued Implementation of a Functional Language Compiler
%A S.J.H. Jones
%I jone88b
%S Functional Language Implementation Project Document 19. Univs. Warwick/Birmingham, CS Dept.
%K 
%C 

%T FLAB - The Continued Implementation of a Functional Language Compiler
%A S.J.H. Jones
%I jone88c
%S Department of Computer Science, University of Birmingham, 1988
%K 
%C Originally an undergraduate dissertation.

%T Functional Programming and Operating Systems
%A Simon B. Jones
%I jone89a
%S Computer J 32, 2, pp162-174 1989
%K file stores, resources, lazy evaluation, stream processing, networks, processes, periferal devices, interactive programs, process networks, operating systems
%C The authors show how the lazy evaluation of functional programs, in particular lazily evaluated infinite lists, or streams, can be exploited to write interactive programs.

%T Compile-Time Garbage Collection by Sharing Analysis
%A Simon B. Jones, D. Le Mtayer
%I jone89b
%S FPCA, Imperial College 1989, pp54-74
%K 
%C This paper describes an analysis technique to reduce the cost in processing time of the storage management operations implied by a program (possibly to zero).

%T A New Method for Strictness Analysis on Non-Flat Domains
%A Simon B. Jones, D. Le Mtayer
%I jone89c
%S In davi89b, pp1-11
%K 
%C 

%T Deriving the Fast Fourier Algorithm by Calculation
%A G. Jones
%I jone89d
%S In davi89b, pp80-102
%K 
%C 

%T Is Compile Time Garbage Collection Worth The Effort?
%A S.B. Jones, M. White
%I jone91
%S In peyt91b, pp172-176
%K 
%C 

%T Tail Recursion without Space Leaks
%A R. Jones
%I jone92
%S JFP 2,1, pp73-79
%K 
%C 

%T Computing with Lattices: An Application of Type Classes
%A M.P. Jones
%I jone92b
%S JFP 2,4, pp475-503
%K 
%C 

%T Partial Evaluation and Automatic Program Generation
%A N.D. Jones, C.K. Gomard, P. Sestoft
%I jone93
%S Prentice Hall, ISBN 0-13-020249-5
%K 
%C The preface and table of contents can be obtained via anonymous ftp from ftp.diku.dk (Internet 130.225.96.221) pub/diku/dists/jones-book/about-book, or by sending an email request to sestoft@id.dth.dk.

Partial Evaluation in a Nutshell
Let p be a program which takes two inputs d1 and d2.  Ordinarily, 
p (d1,d2) would be evaluated in one step:
Evaluate p with input (d1, d2), to produce the result res.
However, it may also be evaluated in two steps:
(1) Partially evaluate p with input d1, to get a new program r.
(2) Evaluate r with input d2, to produce the result res.
The program r is a specialized version of p (for the particular value d1 of the first input), and is called a *residual program*.  The process of producing r in step 1 is called *partial evaluation*, or *program specialization*. The benefit of partial evaluation is speed of execution: the specialized program r is often much faster than the general program p.
The book describes principles, techniques, and applications of partia evaluation, as well as several partial evaluation systems (for Scheme, Prolog, and C) constructed by other researchers.

%T Functional System Specification
%A S. Joosten
%I joos86a
%S Dept. Comp. Sci., Univ. Twente, Netherlands, Technical Memo INF-86-20, 1986
%K executable descriptions of systems, system modelling, sequences, clock, bakery, RS Flipflop, state
%C 

%T Functional Programming as a Tool in Courseware Development: A Case
%A S. Joosten
%I joos86b
%S Dept. Comp. Sci., Univ. Twente, Netherlands, Technical Memo INF-86-5, 1986
%K regular expressions, finite automata, courseware development, rapid prototyping, applications
%C 

%T Hiddenline: An Exercise in Functional Specification
%A S. Joosten
%I joos87
%S University of Twente, Department of informatics memorandum
%K 
%C 

%T Teaching Functional Programming to First-Year Students
%A S. Joosten, Klaas van den Berg, G. van der Hoeven
%I joos93
%S JFP 3,1, pp49-65
%K instruction, motivation, understanding types
%C 

%T Generating a Pattern Matching Compiler by Partial Evaluation
%A J. Jrgensen
%I jorg91
%S In peyt91b, pp177-195
%K 
%C 

%T Efficient Implementations of Narrowing (Extended Abstract)
%A A. Josephson, N. Dershowitz
%I jose86
%S Dept. Comp. Sci., Univ. Illinois, 1986
%K lazy narrowing, eager rewriting, RITE, enumerative nondeterminism, reduction, demons, conditional rewriting
%C 

%T Functional Programming with Side-Effects
%A M.B. Josephs
%I jose86b
%S PhD Thesis, Technical Monograph PRG-55
Oxford University Computing Laboratory, 1986
%K 
%C 

%T Program Synthesis from Examples of Behavior
%A J-P. Jouannaud, Y. Kodratoff
%I joua83
%S In ``Computer Program Synthesis Methodologies'' by A.W. Biermann, G. Guiho, Reidel, 1983
%K synthesis of programs, Summers methodology, computational traces, detection of recurrence relations, LISP, lethal success, program transformation, polynomial schemes
%C 

%T 1985 Functional Programming and Computer Architecture Conference
%A J-P. Jouannaud (Ed.)
%I joua85
%S Nancy, LNCS 201, Springer Verlag, 1985
%K general
%C 

%T A Foundation for Declarative Data-Parallelism
%A G. Jourets
%I jour91
%S In glas91, pp311-330
%K 
%C 

%T Compiling functional languages for SIMD architectures
%A G.K. Jouret
%I jour91
%S 3rd IEEE Symposium on Parallel and Distributed Languages
%K 
%C 

%T Algebraic Reconstruction of Types and Effects
%A P. Jouvelot, D. Gifford
%I jouv91
%S 18th POPL, Orlando
%K 
%C 

%T On the Efficient Implementation of Combinators as an Object Code for Functional Programs
%A M.S. Joy
%I joy85a
%S Ph.D. Thesis, Univ. East Anglia, 1985
%K 
%C 

%T Efficient Combinator Code
%A M.S. Joy, V.J. Rayward-Smith, F.W. Burton
%I joy85b
%S Computer Languages 10,3/4, 1985
%K combinators, complexity, optimisation, NP-Completeness
%C 

%T Parallel Evaluation of Functional Languages - a Bibliography
%A M.S. Joy
%I joy87a
%S Functional Language Implementation Project Document 8. Univs. Warwick/Birmingham, CS Dept.
%K 
%C Revised 1990.

%T A History of the Design of FLIC
%A M.S. Joy
%I joy87b
%S Functional Language Implementation Project Document 5. Univs. Warwick/Birmingham, CS Dept.
%K 
%C 

%T A Standard for a Graph Representation for Functional Programs
%A M.S. Joy, T.H. Axford
%I joy87c
%S Functional Language Implementation Project Document 3. Univs. Warwick/Birmingham, CS Dept.
%K 
%C 

%T Description of FLIP Software
%A M.S. Joy
%I joy87d
%S Functional Language Implementation Project Document 2. Univs. Warwick/Birmingham, CS Dept.
%K 
%C Revised 1990. The software written for use in the Functional Language Implementation Project (FLIP) is described. this includes a graph reduction machine for the language FLIC, a translator from SASL to FLIC, a FLIC prettyprinter and software for manipulating GCODE.

%T A Functional Language Implementation Project
%A M.S. Joy
%I joy87e
%S Functional Language Implementation Project Document 1. Univs. Warwick/Birmingham, CS Dept.
%K flip description one
%C Revised 1989 and 1990. A description is presented of an experimental functional programming system designed for the investigation of medium-grain parallel graph reduction. The system uses the language FLIC as an intermediate code between the high-level source and the graphs. Standard representations of the graphs have been investigated, and compilers from high-level languages to FLIC are proposed.

%T FunProgs Manual
%A M.S. Joy
%I joy87f
%S Functional Language Implementation Project Document 13. Univs. Warwick/Birmingham, CS Dept.
%K library programs
%C 

%T The Design of a Common Functional Language
%A M.S. Joy
%I joy87g
%S Functional Language Implementation Project Document 17. Univs. Warwick/Birmingham, CS Dept.
%K Haskell, Language Design by Committee, cfl
%C 

%T A Standard for a Graph Representation for Functional Programs
%A M.S. Joy, T.H. Axford
%I joy88
%S SIGPLAN 23, 1, pp75-82, 1988, University of Birmingham Department of Computer Science Internal Report CSR-87-1 and University of Warwick Department of Computer Science Research Report 95 (1987).
%K 
%C 

%T FP Language Manual
%A M.S. Joy
%I joy88
%S University of Warwick
Coventry, 1988
%K 
%C Revised 1990

%T The Translation of High-Level Functional Languages to FLIC
%A M.S. Joy
%I joy89
%S RR142. Univ. Warwick, CS Dept.
%K sasl fp benchmarks efficiency
%C In this paper the author examines some aspects of the translation of high-level functional languages to FLIC, with specific reference to two translators - one from FP, one from SASL.

%T FP Language Manual
%A M.S. Joy
%I joy90a
%S Functional Language Implementation Project Document 7. Univs. Warwick/Birmingham, CS Dept.
%K 
%C 

%T Parallel Evaluation of Functional Programs - A Bibliography
%A M.S. Joy
%I joy90b
%S Functional Language Implementation Project Document 18. Univs. Warwick/Birmingham, CS Dept.
%K 
%C 

%T fairly large database of references
%A M.S. Joy, et al
%I joy91
%S Network
%K 
%C In connection with the functional language research at Warwick, we now have a fairly large database of references. This is available via anonymous FTP (login: anonymous, password: your e-mail address) at the following site:
clover.csv.warwick.ac.uk
137.205.192.6
The database can be found in the directory pub/doc/joy, and is
in refer(1) format.
Please let me, msj@dcs.warwick.ac.uk (Mike Joy), know of any significant errors or omissions. The database will be updated every couple of months.

%T GCODE: A Revised Standard Graphical Representation for Functional Programs
%A M.S. Joy, T.H. Axford
%I joy91
%S SIGPLAN 26, 1, pp133-139, 1991, Also Research Report 159, Department of Computer Science, University of Warwick, Coventry (1990) and Research Report CSR-90-9, School of Computer
Science, University of Birmingham (1990).
%K 
%C 

%T Parallel Combinator Reduction: Some Performance Bounds
%A M.S. Joy, T.H. Axford
%I joy92
%S Research Report 210
Department of Computer Science, University of Warwick, Coventry, 1992
%K graph benchmarks
%C 

%T A Functional Language for Parallel Programming
%A J. Julliand
%I jull89
%S Report CRIN 89-R-001, Centre de Recherche en Informatique de Nancy, Vandoeuvre-les-Nancy, 1989
%K apl
%C AP2L is an asynchronous functional parallel programming language to express communicating processes. An informal presentation is given of the language illustrated by examples.

%T Asynchronous Functional Parallel Programs
%A J. Julliand, G-R. Perrin
%I jull90
%S LNCS 468, also Report CRIN 90-R-021, Centre de Recherche en Informatique de Nancy, Vandoeuvre-les-Nancy, 1990
%K Communications, natural semantics
%C 

%T AP2L: An Asynchronous Functional Parallel Programming Language
%A J. Julliand
%I jull90b
%S Report CRIN 90-R-150, Centre de Recherche en Informatique de Nancy, Vandoeuvre-les-Nancy, 1989
%K apl, semantics
%C 

%T Parametric Overloading in Polymorphic Programming Languages
%A S. Kaes
%I kaes88
%S Proc. 2nd European Symp. on Programming, LNCS 300, pp131-144
%K type deduction, soundness, ad hoc polymorphism, type inference
%C 

%T Type Inference in the Presence of Overloading, Subtyping and Recursive Types
%A S. Kaes
%I kaes92
%S In acm92, pp193-204
%K constrained types, canonical principal types
%C 

%T The Semantics of a Simple Language for Parallel Programming
%A G. Kahn
%I kahn74
%S IFIP '74
%K 
%C 

%T Semantics of Data Types
%A G. Kahn, D.B. MacQueen, G.D. Plotkin, Eds.
%I kahn84
%S rised specifications
%K conference, PEBBLE, multiple inheritance, RUSSELL, abstract semantic algebra, recursive domain equations, second order polymorphic lambda calculus, polymorphism, constructive logic, horn clauses as signatures, structural induction, LCF, executable specification, static semantics, cartesian closed categories, type inference, type containment, intersection types, abstract data types, errors, parametrised specifications
%C 

%T Natural Semantics
%A G. Kahn
%I kahn87a
%S In LNCS 247
%K semantics, rules, sequents, conditions, judgements, abstract syntax, use clauses, types, MINI-ML, dynamic semantics, machine state, transition rules, categorical abstract machine, CAM
%C 

%T Functional Programming Languages and Computer Architecture, 1987
%A G. Kahn, Ed.
%I kahn87b
%S LNCS 274, Springer Verlag, 1987
%K 
%C 

%T Functional Specifications, Mixed Computation and Systematic Construction of Algorithms
%A V.A. Kaimin
%I kaim85
%S In Mixed Computation, A.P. Ershov, Novosibirsk, USSR, 1985
%K partial evaluation
%C An approach to systematic construction of structured algorithms based on functional specifications is presented. A functional semantics of structured algorithms and a definition of functional specification based on mixed computation is given.

%T Implementation of an FP-Shell
%A Y.H. Kamath, M.M. Matthews
%I kama87
%S IEEE Transactions on SE-13, 5, pp532-539, 1987
%K unix
%C 

%T Final Data Types and their Specification
%A S. Kamin
%I kami83
%S TOPLAS 5,1, pp97-121, 1983
%K 
%C 

%T Programming Languages: An Interpreter-based Approach
%A S. Kamin
%I kami90
%S Addison Wesley
%K 
%C Kamin may only be the author of a paper in this val.

%T Conditional Rewrite Rules
%A S. Kaplan
%I kapl84
%S Theoretical Computer Science 33, 1984
%K term rewriting, algebraic conditional theories
%C 

%T An Investigation of Combinator Reduction on Multiprocessor Architectures
%A R.J. Karia
%I kari87
%S ESPRIT Project 415 Report
Westfield College, London, 1987, PhD Thesis.
%K survey cobweb realm grip parallel
%C A study of the the range of proposed implementations and architectures for functional languages has been done. The transformation of lambda-expressions into corresponding variable-free ones comprising combinators is described. Cobweb and REALM are described.

%T Towards a Parallel Architecture for Functional Languages
%A R.J. Karia
%I kari87b
%S In LNCS 272, pp270-285
%K 
%C This report gives a summary of work that has been done within Subproject B during the past 18 months in designing a parallel architecture for functional languages.

%T An Outline of the SKY Reduction Machine
%A Kent Karlsson
%I karl81a
%S In acm81 ?? (It's not in the Portsmouth Conference)
%K graph reduction combinatory logic
%C 

%T Nebula: A Functional Operating System
%A Kent Karlsson
%I karl81b
%S Programming Methodology Group Memo LPM11, Laboratory for Programming Methodology, Chalmers University of Technology, Gteborg, 1981
%K 
%C 

%T Notes from: The Aspenas Symp. on Functional Languages and Computer Architecture
%A Kent Karlsson, K. Petersson
%I karl82
%S SIGPLAN 17,11, 1982
%K correctness, transformation, specification, types, reflexivity, constructive type theory, logic programnming, discussion sessions, constructive set theory, implementation issues, experiences with functional programming
%C 

%T Presentation on Strictness Analysis
%A Kent Karlsson
%I karl85
%S Workshop on Abstract Interpretation, Univ. of Kent, August 1985
%K 
%C 

%T Uniting Graph Reduction and Data Flow
%A Kent Karlsson
%I karl88
%S Aspens 88, [john88a], pp373-400
%K 
%C 

%T Fast Parallel Implementation of Lazy Languages - The EQUALS Experience
%A O. Kaser, C.R. Ramakrishnan, I.V. Ramakrishnan, R.C. Sekar
%I kase92
%S In acm92, pp335-344
%K 
%C 

%T Graph Algorithms in a lazy functional programming language
%A Y. Kashiwagi, D.S. Wise
%I kash91
%S Proc. 4th Int. Symp. on Lucid and Intensional Programming, 35-46, also Technical report no 330
CS Indiana University, Bloomington
%K 
%C 

%T Treatment of Big Values in an Applicative Language HFP
%A T. Katayama
%I kata83
%S In LNCS 147
%K HFP, updating, call by update, equations, implementation, large data structures, attribute grammars, transformation
%C 

%T Type Inference and Type Checking for Functional Programming Languages --- A reduced Computation Approach
%A T. Katayama
%I kata84
%S In acm84a, pp263-273
%K type checking, type inference, interpretation, FP
%C 

%T Continuing Into the Future: On the Interaction of Futures and First-Class Continuations
%A M. Katz, D. Weise
%I katz90
%S In acm90, 176-184
%K 
%C 

%T A Direct Construction of a SASL Domain
%A M. Kaufmann
%I kauf84
%S Burroughs Austin Research Center Report ARC 84--14, 1984
%K domain construction, approximation relation, SASL, semantics
%C 

%T Syntax, Semantics and a Formal Logic for SASL
%A M. Kaufmann, D. Surber
%I kauf85
%S Burroughs Austin Research Center Report ARC 85--03, 1985
%K SASL, syntax, denotational semantics, formal definition, logic, directed completeness, correctness, example proofs, induction
%C 

%T A Sound Theorem Prover for a Higher-Order Functional Language
%A M. Kaufmann
%I kauf86
%S Burroughs Austin Research Center Report ARC 86--01, 1986
%K 
%C 

%T Computer Software
%A A. Kay
%I kay85
%S Scientific American 251,3, 1985
%K 
%C 

%T The Flagship Declarative System
%A J.A. Keane
%I kean90
%S Technical Report UMCS-90-2-1, Department of Computer Science, University of Manchester, 1990
%K parallel, hope
%C 

%T Distributed Binding Mechanisms in the Flagship System
%A J.A. Keane
%I kean90b
%S Technical Report UMCS-90-8-2, Department of Computer Science, University of Manchester, 1990
%K parallel packets
%C 

%T Par2Cleaner. A Partial Evaluator for Functional Programming Languages Based on Graph Rewriting
%A A. Keijsers
%I keij90
%S Katholieke Universiteit
Nijmegen, NL, 1990
%K 
%C 

%T A loosely-coupled applicative multi-processing system
%A Robert M. Keller, et al.
%I kell79
%S AFIPS National Computer Conference, 48, pp613-622, 1979
%K parallel machines, AMPS, hardware, communication network, locality, information flow
%C 

%T Presentation on the Language FGL
%A Robert M. Keller
%I kell80a
%S Workshop on Applicative Languages and Parallel Computation, MIT 1980
%K 
%C 

%T Hierarchical Analysis of a Distributed Evaluator
%A Robert M. Keller, G. Lindstrom
%I kell80b
%S Proc. Internat. Conf. on Parallel Processing, IEEE, New York, 1980
%K 
%C 

%T Semantics and Applications of Function Graphs
%A Robert M. Keller
%I kell80c
%S Technical Report UUCS-80-112, Dept. Comp. Sci., University of Utah, 1980
%K 
%C 

%T FGL (Functional Graph Language) Programmers' Guide
%A Robert M. Keller, et al.
%I kell80d
%S Technical Report AMPS--1, Dept. Comp. Sci., University of Utah, 1980
%K 
%C 

%T Divide and CONCer: Data Structures in Applicative Multiprogramming Systems
%A R.M. Keller
%I kell80e
%S In acm80
%K 
%C 

%T Applicative Caching: Programmer Control of Object Sharing and Lifetime in Distributed Implementations of Applicative Languages
%A Robert M. Keller, M.R. Sleep
%I kell81a
%S In acm81
%K sharing, caching functionals, implementation, memo functions
%C 

%T S-K Machine Measurements
%A W. Kelley
%I kell81b
%S Burroughs Austin Research Center Report ??, 1981
%K 
%C 

%T Applications of Feedback in Functional Programming
%A Robert M. Keller, G. Lindstrom
%I kell81c
%S In acm81, pp123-130
%K feedback loops, stream processing, complex evaluation orders, computational aggressiveness, FGL, DYNAMO, population growth, attribute grammar parsing, synchronisation, bounded buffer problem
%C 

%T FEL (Functional Equation Language) Programmer's Guide
%A Robert M. Keller
%I kell82a
%S Technical Report AMPS TR 7, Dept. Comp. Sci., University of Utah, 1982(3?)
%K 
%C 

%T The Rediflow Simulator
%A R.M. Keller, F.C.H. Lin, P.R. Badovinatz
%I kell82b
%S Dept. CS, U. of Utah, 1982
%K 
%C 

%T Rediflow: A Multiprocessing Architecture Combining Reduction and Dataflow
%A Robert M. Keller, G. Lindstrom, E. Organick
%I kell83
%S in ``PAW 83: Visuals used at the Parallel Architecture Workshop'', Office of Basic Energy Sciences, Univ. Colorado, 1983
%K 
%C 

%T Simulated Performance of a Reduction Based Multiprocessor
%A Robert M. Keller, F.C.H. Lin
%I kell84
%S IEEE Computer, 17,7 pp70-82, July 1984
%K parallel AMPS rediflow dataflow
%C Multiprocessor systrems present unique concurrency problems. Rediflow combines disciplined von Neumann processes with a hybrid reduction and dataflow model in an effective packet-switching network.

%T Approaching Distributed Database Implementations through Functional Programming Concepts
%A Robert M. Keller, G. Lindstrom
%I kell85a
%S Technical Report UUCS--82--103, Dept. Comp. Sci., University of Utah  and Proc. 5th Internat. Conf. on Distributed Computing Systems, Denver, IEEE, New York, 1985
%K 
%C 

%T Distributed Graph Reduction from First Principles
%A Robert M. Keller
%I kell85b
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K graph reduction, partial evaluation, concurrency, efficiency, efficient copying
%C Similar Title in Systems Research, 2, 4, pp285-295, 1985.
The author describes the use and distributed implementation of a
functional language based on the graph reduction concept. Attention is given to the issue of implementing higher-order functions and concurrent evaluation. Prospects for optimization of this implementation are pointed out.

%T Rediflow Project Publications
%A Robert M. Keller, G. Lindstrom
%I kell85c
%S University of Utah, Dept. Comp. Sci., 1985
%K Bibliography, rediflow, data flow, reduction, AMPS, applicative multiprocessing, FEL, FGL
%C 

%T Rediflow Architecture Prospectus
%A R.M. Keller
%I kell85d
%S Technical Report No. UUCS-85-105, Department of Computer Science, University of Utah, Salt Lake City, UT, 1985
%K hardware parallel graph reduction
%C Rediflow is intended as a multi-function (symbolic and numeric)
multiprocessor, demonstrating techniques for achieving speedup of Lisp-coded problems through the use of advanced programming concepts, high-speed communication, and dynamic load-distribution, in a manner suitable for scaling to upwards of 10,000 processors.

%T Applicative Caching
%A R.M. Keller, M.R. Sleep
%I kell86
%S TOPLAS, 8, 1
1986, pp88-108
%K 
%C 

%T Overview of Rediflow II Development
%A R.M. Keller, J.W. Slater, K.T. Likes
%I kell86b
%S In LNCS 279, pp203-214
%K 
%C The authors emphasize recent work on hardware design to support graph reduction, communication, and load balancing, as well as indicating an evaluation model oriented toward larger grain computation than in their previously-reported work.

%T Functional Programming for Loosely Coupled Multiprocessors
%A P. Kelly
%I kell89
%S Pitman, 1989, also MIT press ISBN 0-273-08804-1
ISBN 0-262-61057-4 pbk
%K Caliban, parallel
%C 

%T Expressions as Processes
%A J.R. Kennaway, M.R. Sleep
%I kenn82a
%S In acm82, pp21-28
%K parallelism, process ntes, combinator graphs, experiment trees, LNET, CCS notation, message passing
%C 

%T Director Strings as Combinators
%A J.R. Kennaway, M.R. Sleep
%I kenn82b
%S Univ. of East Anglia, 1982
%K 
%C 

%T The Complexity of a Translation of Lambda-Calculus to Combinators
%A J.R. Kennaway
%I kenn82c
%S Report CS/82/023/E, Dept. Comp. Sci., Univ. East Anglia, 1982
%K 
%C 

%T Parallel Implementation of Functional Languages
%A J.R. Kennaway, M.R. Sleep
%I kenn82d
%S Proc. Internat. Conf. on Parallel Processing, 1982, IEEE, pp168-170
%K LNET
%C 

%T A New Combinator Set
%A J.R. Kennaway
%I kenn82e
%S A New Combinator Set
University of East Anglia
Norwich, Unpublished Note
%K 
%C 

%T Applicative Objects as Processes
%A J.R. Kennaway, M.R. Sleep
%I kenn82f
%S Proceedings of the 3rd International Conference on Distributed Computer Systems, Miaimi, FA
%K LNET graph reduction
%C 

%T Novel Architectures for Declarative Languages
%A J.R. Kennaway, M.R. Sleep
%I kenn83
%S Software and Microsystems, 2, 3, pp59-70
%K 
%C 

%T Efficiency of Counting Director Strings
%A J.R. Kennaway, M.R. Sleep
%I kenn84a
%S Report CSA/16/1984, Dept. Comp. Sci., Univ. East Anglia, 1984 and Aspens, 1985
%K combinator graph reduction, compact representation, complexity, optimization
%C 

%T An Outline of some Results of Staples on Optimal Reduction Orders in Replacement Systems
%A J.R. Kennaway
%I kenn84b
%S CSA/19/1984, School of Computing Studies, Univ. of East Anglia, 1984
%K graph reduction subtree replacement systems combinatory logic
%C 

%T Towards a successor to von Neumann
%A J.R. Kennaway, M.R. Sleep
%I kenn84c
%S In Distributed Computing, F.B. Chambers et al. (Eds), Academic Press, London 1984, pp. 125-138
%K 
%C 

%T Implementing Term Rewrite Languages in Dactl1
%A J.R. Kennaway
%I kenn86b
%S LNCS 299, pp102-
%K trs dactl
%C The author defines a translation of a functional language into Dactl, describes the problems encountered and their solution, and outlines a proof that the translation is correct

%T Variable Abstraction in O(n log n) Space
%A J.R. Kennaway, M.R. Sleep
%I kenn87a
%S Information Processing Letters 24, 5, 1987, pp343-349
%K combinators, abstraction, complexity, director strings
%C 

%T On Graph Rewritings
%A J.R. Kennaway
%I kenn87b
%S Theoretical Computer Science 52, pp37-58, also SYS-C87-05, School of Information Systems, University of East Anglia, Norwich, 1987
%K pushouts categories trs
%C 

%T Sequential Evaluation Strategies for Parallel-or and Related Reduction Systems
%A J.R. Kennaway
%I kenn87c
%S SYS-C87-07, School of Information Systems, University of East Anglia, Norwich, 1987
%K ARS TRS CRS
%C 

%T Director Strings as Combinators
%A J.R. Kennaway, M.R. Sleep
%I kenn88
%S TOPLAS 10, 4, 1988, pp602-626, Also University of East Anglia Report SYS-C87-06
%K 
%C 

%T The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems
%A J.R. Kennaway
%I kenn89
%S SYS-C89-07
School of Information Systems, University of East Anglia, Norwich, 1989
%K 
%C A rule is defined, called specificity, for computation in ambiguous term rewrite systems. This rule (really a meta-rule) stipulates that a term rewrite rule of the system can only be used to reduce a term which matches it, if that term can never match any other rule of the system which is more specific than the given rule.

%T Graph Rewriting in some Categories of Partial Morphisms
%A J.R. Kennaway
%I kenn90
%S SYS-C90-04
School of Information Systems, University of East Anglia, Norwich, 1990
%K 
%C 

%T A Reduction Strategy for Efficient Parallel Evaluation of Functional Programs Using Program Analysis
%A W.H. Kersjes
%I kers84a
%S RWTH Aachen, 1984
%K 
%C 

%T Implementing Concurrent Clean on Transputers (Abstract)
%A M. Kesseler
%I kess91
%S In glas91, pp217-218
%K 
%C 

%T Evaluation Annotations for Hope+
%A J.M. Kewley, K. Glynn
%I kewl90
%S In davi89b, pp21-23
%K hope plus
%C 

%T Efficient Method Dispach in PCL
%A G. Kiczales, L. Rodriguez
%I kicz90
%S In acm90 99-105
%K 
%C 

%T Transformations of FP Program Schemes
%A R.B. Kieburtz, J. Schultis
%I kieb81
%S In acm81, pp41-48
%K variables confusing, schemata, correctness, algebras of programming
%C 

%T A Proposal for Interactive Debugging of ML Programs
%A R.B. Kieburtz
%I kieb85a
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K debugging, ML, tracing, exception handling
%C 

%T The G-Machine: A Fast, Graph-Reduction Evaluator
%A R.B. Kieburtz
%I kieb85b
%S FPCA'85, Nancy, LNCS 201, pp400-413
%K G-machine, graph reduction, architecture, hardware
%C The G-Machine is an abstract architecture for evaluating functional-language programs by programmed graph reduction.
A hardware implementation of Thomas Johnsson's G-machine.

%T The Design of APPLE --- A Language for Modular Programs
%A R.B. Kieburtz
%I kieb85c
%S Computer Languages 10,1, pp1-22, 1985
%K abstract data types, polymorphism, types, modularity, classes, imperative parts, recursive data types, streams, powersets, bounded iteration, map functions, interactive programming environment
%C 

%T A Studied Laziness --- Strictness Analysis with Structured Data Types
%A R.B. Kieburtz, M. Napierala
%I kieb85d
%S Extended Abstract --- Univ. Oregon Graduate Centre, 1985
%K 
%C 

%T When Chasing Your Tail Saves Time
%A R.B. Kieburtz
%I kieb85e
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K knot tying, recursive loops, Y, fixpoint implementation, graph rewriting
%C 

%T Abstract Interpretations over Infinite Domains Cannot Terminate Uniformly
%A R.B. Kieburtz
%I kieb86a
%S Unpublished, Dept. Comp. Sci., Oregon Graduate Centre
%K 
%C 

%T Performance Measurement of a G-Machine Implementation
%A R.B. Kieburtz
%I kieb86b
%S In LNCS 279, pp275-296
%K 
%C 

%T A RISC Architecture for Symbolic Computation
%A R.B. Kieburtz
%I kieb87
%S SIGPLAN 22, 10, 146-156, 1987 also ACM Computer Architecture News 15(5) and ACM Operating
Systems Review 21(4)
%K hardware
%C This paper explores an implementation of the G-machine as a high-performance RISC architecture. Complex instructions can be represented by RISC code without experiencing a large expansion of code volume. The instruction pipeline is discussed in some detail.

%T Optimizing the Evaluation of Suspensions
%A R. Kieburtz, B. Agapiev
%I kieb88
%S Aspens 88, [john88a], pp267-282
%K 
%C 

%T FEL + Set Abstraction = Database Query Language
%A J. Kim
%I kim83
%S M.S. Thesis, Univ. of Utah, 1983
%K 
%C 

%T Programming in LISP
%A M. King, P. Hayes
%I king76
%S In ``Computational Semantics'' Ed. E. Charniak, Y. Wilks, North Holland, 1976
%K 
%C 

%T The HDG-Machine: A Highly Distributed Graph Reducer for a Transputer Network
%A H. Kingdon, D.R. Lester, G.L. Burn
%I king89
%S Computer Journal 34, 4, pp290-301, also Technical Report 123, GEC Hirst Research Centre, March 1989
%K concurrency, parallelism
%C The authors present an implementation of parallel graph reduction on a transputer network which has a number of novel features. The parallel reduction model is based on evaluation transformers, which specify when parallel tasks may be spawned and how much evaluation can be done to the expressions which are spawned.

%T The Efficiency and Generalisation of Various Abstract Machines
%A I. King
%I king90
%S plas90
%K G Machine, TIM, CAM, Three Instruction Machine, Categrical Abstract Machine, measurement
%C 

%T Combining Monads
%A D. King, P Wadler
%I king92
%S Draft Proceedings of1992 Glasgow FP Workshop, to be published by Springer
%K 
%C available by FTP from Glasgow:
ftp.dcs.glasgow.ac.uk  (130.209.240.50)
directory: pub/glasgow-fp/papers

%T An Experiment using Term Rewriting Techniques for Concurrency
%A C. Kirkwood
%I kirk91
%S In peyt91b, pp196-200
%K RRL ERIL LOTOS
%C 

%T Monitoring Semantics: A Formal Framework for Specifying, Implementing and Reasoning about Execution Monitors
%A A. Kishon, P. Hudak, C. Consel
%I kish91
%S SIPLAN 26, pp338-352, 1991
Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto
%K 
%C 

%T Theory and Art of Semantics-Directed Program Execution Monitoring
%A A.S. Kishon
%I kish92
%S Ph.D. Thesis, Yale University
%K execution monitors, measurement, statistics, profiling, tracing, debugging, monitoring semantics
%C 

%T  Lambda-definability and Recursiveness
%A S.C. Kleene
%I klee36
%S Duke Math. J. 2,1936
%K 
%C 

%T Introduction to Metamathematics
%A S.C. Kleene
%I klee52
%S van Nostrand, 1952, 1964
%K 
%C 

%T Applying the Idea of Mixed Computations to
Construction of an Object-Oriented Functional Programming Language
%A A.V. Klimov
%I klim83
%S Semiooticheskie Aspecty Formalicii Intellectualnoj Deyatelnosti, Moscow 1983, pp67-70
%K 
%C 

%T The Object-Functional Model of Computation
%A A. Klimov
%I klim88
%S Semiotic Aspects of Formalization of Intellectual Activities, Moscow, 1988 pp49-53
%K partial evaluation
%C 

%T Dynamic Specialization in Extended Functional Language with Monotone Objects
%A A. Klimov
%I klim91
%S SIGPLAN 26, 9, Proceedings of Conference on Partial Evaluation and Semantics-Based Program Manipulation, New Haven, CT, pp199-210
%K partial evaluation
%C 

%T On Solvability by lI-Terms
%A J.W. Klop
%I klop75
%S LNCS 37, pp342-345
%K 
%C 

%T Combinatory Reduction Systems
%A J.W. Klop
%I klop80
%S Ph.D. Thesis, Mathematische Centrum, Amsterdam, 1980
%K reduction, combinators, Church-Rosser Theorem
%C 

%T The Architecture of a Reduction Language Machine Hardware Model
%A W.E. Kluge
%I klug79
%S ISF-report 79.03, Gesellschaft fr Mathematik und Datenverarbeitung, Bonn, 1979
%K GMD
%C 

%T Petri Net Models for the Evaluation of Applicative Programs Based on Lambda-Expressions
%A W.E. Kluge, H. Schluetter
%I klug83a
%S IEEE Transactions on SE-9,4, 1983
%K 
%C 

%T Cooperating Reduction Machines
%A W.E. Kluge
%I klug83b
%S IEEE Transactions on Computing C--32,11, 1983
%K 
%C 

%T An Architecture for Mostly Functional Languages
%A T. Knight
%I knig86
%S In acm86, pp105-112
%K 
%C 

%T Decomposing Functional Programs for Parallel Computation
%A D.L. Knox, G.S. Wolffe
%I knox89
%S Proc. IEEE TENCON '89, Bombay
%K 
%C 

%T Simple Word Problems in Universal Algebras
%A D.E. Knuth, P. Bendix
%I knut70
%S In 'Computational Problems in Abstract Algebra' ed. J. Leech, pp263-297
, Pergammon, 1970
%K 
%C 

%T Function-based Computing and Parallelism: A Review
%A P.M. Kogge
%I kogg85
%S Parallel Computing 2, 1985
%K parallel processing, lazy evaluation, survey, curried functions, normal order, syntactic sugar, parallelism, demand driven evaluation, super vector operations, map, higher order functions, problems
%C 

%T Daisy 1.0 Reference Manual
%A A.T. Kohlstaedt
%I kohl81
%S Indiana University Dept. Comp. Sci. Technical Report 119
%K 
%C 

%T Hygenic Macro Expansion
%A E. Kohlbecker, D.P. Friedman, M. Felleisen
%I kohl86
%S In acm86, pp151-161
%K 
%C 

%T Partial Evaluation as a Means for Inferencing Data Structures in an Applicative Language
%A H.J. Komorovski
%I komo82
%S Proc. 9th POPL, Albuquerque, 1982, pp255-267
%K partial evaluation, PROLOG, pruning, forward propagation, opening, implementation
%C 

%T Interactive Programs in a Functional Language: a Functional Implementation of an Editor
%A P.W.M. Koopman
%I koop87
%S Software 17, 9, 1987, pp609-622
%K SASL ed edit
%C A text editor (ed) is described, written in SASL.

%T A Fresh Look at Combinator Graph Reduction (or, having a tigre by the tail)
%A P.J. Koopman, Jr., P. Lee
%I koop89
%S SIGPLAN 24(7), pp110-119
%K tigre benchmark measurement
%C 

%T Abstract Machine Specification in Functional Languages
%A P.W.M. Koopman, M.C.J.D. van Eekelen, M.J. Plasmeijer
%I koop90
%S In plas90, also Technical Report no. 90-21
1990, Department of Informatics, University of Nijmegen
%K operational semantics, Mac-1, ABC machine, assembler, clean
%C This paper presents a layered machine description method. A functional language is used as description formalism. At the bottom layer of the specification the machine components are described by an abstract data type. The top layer describes the machine instructions by specifying their effect on the machine components.

%T Functional Descriptions of Neural Networks
%A P.W.M. Koopman, L.M.W.J. Rutten, M.C.J.D. van Eekelen, M.J. Plasmeijer
%I koop90b
%S Technical Report no. 90-10, 1990, Department of Informatics, University of Nijmegen
%K Miranda
%C 

%T Predicate Logic as a Programming Language
%A R. Kowalski
%I kowa74
%S Proc. IFIP '74, North Holland, 1974
%K 
%C 

%T Logic for Problem Solving
%A R. Kowalski
%I kowa79a
%S North Holland, 1979
%K 
%C 

%T Algorithm = Logic + Control
%A R. Kowalski
%I kowa79b
%S CACM 22,7, 1979
%K 
%C 

%T Models of the Lambda Calculus
%A C.P.J. Koymans
%I koym82
%S Inf. Control 52,3, 1982
%K 
%C 

%T ORBIT: An Optimizing Compiler for Scheme
%A D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin, N. Adams
%I kran86
%S SIGPLAN 21, 7, pp219-233, ACM, New York, NY, 1986, also Ph.D. Thesis, Tech Rep. 632, CS, Yale
%K 
%C 

%T Mul-T: A High-Performance Parallel Lisp
%A D.A. Kranz, R.H. Halstead, Jr., E. Mohr
%I kran89
%S SIGPLAN 24, 7, pp81-90, 1989

%K 
%C 

%T Een Gedeeltelijke Implementatie van de Zeer Hoge Programmeertaal Twentel
%A H.J. Kroeze
%I kroe84
%S Dept. Comp. Sci., Univ. Twente, Netherlands, 1984
%K 
%C An English Language Version is available

%T Some Reduction Strategies for Algebraic Term Rewriting
%A W. Kuchlin
%I kuch82
%S SIGSAM 16,4, 1982
%K 
%C 

%T Distributed Applicative Arrays
%A H. Kuchen, G. Geiler
%I kuch90
%S plas90
%K vectors, data structures, tree structures, sequences, tables, sets, quad trees, measurement
%C 

%T Graph-Based Implementation of a Functional Logic Language
%A H. Kuchen, R. Loogen, J.J. Moreno-Navarro, M. Rodriguez-Artalejo
%I kuch90b
%S In LNCS 432, pp271-290
%K eager strict occam
%C 

%T Graph-Based Implementation of Functional Logic Language
%A H. Kuchen, et al.
%I kuch90b
%S LNCS 432
%K 
%C 

%T Shared Memory Implementation of a Functional Language (Abstract)
%A H. Kuchen
%I kuch91
%S In glas91, pp225-226
%K 
%C 

%T Dependence Graphs and Compiler Optimizations
%A D.J. Kuck, et al.
%I kuck81
%S 8th POPL, pp207-218, 1981
%K 
%C 

%T Strictness Analysis: A New Perspective Based on Type Inference
%A T-M. Kuo, P. Mishra
%I kuo89
%S FPCA, Imperial College, 1989, pp260-272
%K 
%C 

%T From Lambda-Calculus to Cartesian Closed Categories
%A J. Lambek
%I lamb80
%S In hind80, pp376-402
%K 
%C 

%T Deductive Systems and Categories III: Cartesian Closed Categories,
%A J. Lambek
%I lamb81
%S Intuitionist Propositional Calculus, and Combinatory Logic Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274., pp57-82, 1981
%K 
%C 

%T Cartesian Closed Categories and Typed Lambda-Calculi
%A J. Lambeck
%I lamb85
%S In cous85a, LNCS 242, pp136-175
%K 
%C 

%T Using Miranda as a First Programming Language
%A T. Lambert, P. Lindsay, K. Robinson
%I lamb93
%S JFP 3, pp5-34
%K teaching, turtle graphics, dragon curve
%C 

%T Report on the Programming Language Euclid
%A B. Lampson, J.J. Horning, R. London, J.G. Mitchell, G.K. Popek
%I lamp81
%S Technical Report, Computer Systems Research Group, University of Toronto
%K 
%C 

%T Practical Use of a Polymorphic Applicative Language
%A B.W. Lampson, E.E. Schmidt
%I lamp83
%S Proc. 10th POPL,Austin, 1983
%K modularity, type checking, Cedar, parametrised interfaces, SML, bindings, scope, B-trees
%C 

%T A Unified System of Parametrization for Programming Languages
%A J. Lamping
%I lamp88
%S In acm88, pp316-326
%K abstraction
%C 

%T An Algorithm for Optimal Lambda Calculus Reduction
%A J. Lamping
%I lamp90
%S POPL 90, ACM
%K graph rewriting
%C Gives an algorithm to implement an optimal lambda calculus reduction based on Levy's definition. The author gives a set of graph rewriting rules to reduce the lambda expression using graph techniques

%T The Mechanical Evaluation of Expressions
%A P.J. Landin
%I land64
%S Computer J 6,4, 1964, pp308-320
%K SECD machine, applicative structure and expressions, evaluation, implementation
%C 

%T A Correspondence between ALGOL 68 and Church's Lambda-Notation Part I
%A P.J. Landin
%I land65a
%S CACM 8,2, 1965, pp89-101
%K semantics, ALGOL60, imperative applicative expressions, abstract syntax, jumps, sharing machine, stream functions
%C 

%T A Correspondence between ALGOL 68 and Church's Lambda-Notation Part II
%A P.J. Landin
%I land65b
%S CACM 8,3, 1965, pp158-165
%K abstract syntax, semantics of ALGOL60, semantic function
%C 

%T The Next 700 Programming Languages
%A P.J. Landin
%I land66a
%S CACM 9, pp157-166, 1966
%K ISWIM, abstraction, abstract syntax, reduction, program equivalence, application and denotation, eliminating sequencing
%C 

%T A Lambda Calculus Approach
%A P.J. Landin
%I land66b
%S In ``Advances in Programming and Non-Numerical Computation'' Ed. L. Fox, Pergamon, 1966, pp 97-141
%K SECD machine, applicative structure and expressions, evaluation, implementation
%C 

%T A Formal Description of Algol 60
%A P.J. Landin
%I land71
%S In stee71
%K 
%C 

%T Grammars for FFP
%A J.E. Lang
%I lang88
%S SIGPLAN 23, 10, pp186-190, 1988

%K 
%C 

%T WYBERT: Parallel Reduction on Shared Memory
%A K. Langendoen
%I lang91
%S In glas91, pp219-224
%K 
%C 

%T Graph Reduction on Shared Memory Multiprocessors
%A K. Langendoen
%I lang93
%S Ph. D. Thesis, University of Amsterdam, ISBN 90-800769-5-3
%K 
%C 

%T Restructuring Lisp Programs for Concurrent Execution
%A J.R. Larus, P.N. Hilfinger
%I laru88
%S SIGPLAN 23, 9, pp100-110, 1988
%K curare parallel
%C 

%T From LP to LP: Programming with Constraints
%A J-L. Lassez
%I lass91
%S LNCS 526, pp420-446
%K 
%C LP1=Logic Programming
LP2=Lazy Programming

%T Polymorphic Type Inference and Abstract Data Types
%A K. Lafer
%I lauf92
%S Ph.D. Thesis, New York University, New York
%K 
%C 

%T An Extension of ML with First-Class Abstract Types

%A K. Lufer, M. Odersky
%I lauf92b
%S Workshop on ML and its Applications, June 1992
%K 
%C We present an extension of ML with existential types. Existential
types are useful to model abstract types and heterogeneous data
structures.  We show that the extended type system has principal type schemes and admits type reconstruction. We further show soundness of the type system with respect a standard type semantics based on weak ideals.

%T Strictness Analysis Aids Inductive Proofs
%A J. Launchbury
%I laun88
%S Proc. Glasgow 1988 Workshop, hall89, pp101-107
%K 
%C 

%T Dependent Sums Express Separation of Binding Times
%A J. Launchbury
%I laun89
%S In davi89b, pp238-253
%K partial evaluation, domain projections, cofibration, projection factorisation, domain dependent products
%C 

%T Projection Factorisations in Partial Evaluation
%A J. Launchbury
%I laun90
%S CUP Distinguished Dissertations in Computer Science Vol. 1, 1991, ISBN 0 521 41497 0, also Research Report CSC/90/R2, Department of Computing Science, University of Glasgow, 1990
%K 
%C PhD Thesis

%T Strictness Analysis Aids Inductive Proof
%A J. Launchbury
%I laun90b
%S Information Processing Letters
35, pp155-159, 1990
%K 
%C 

%T Strictness and Binding-Time Analyses: Two for the Price of One
%A J. Launchbury
%I laun90c
%S Research Report CSC/90/R35, Department of Computer Science, University of Glasgow, 1990
%K 
%C In this paper both analyses are examined in a common framework, and their equivalence is demonstrated.

%T A Strongly-Typed Self-Applicable Partial Evaluator
%A J. Launchbury
%I laun91
%S In acm91, pp145-164
%K 
%C 

%T Functional Programming Glasgow 1992
%A J. Launchbury, P.M. Sansom, eds.
%I laun92
%S Springer Verlag, Workshop, Ayr
%K 
%C 

%T Lazy Pattern Matching in the ML Language
%A A. Laville
%I lavi87
%S Rapport de Recherche No. 664
INRIA, Rocquencourt, 1987
%K lml
%C This report deals with functions defined by patterns in a lazy ML system. Such a definition leads to the question of finding a lazy pattern matching algorithm. The author introduces the new notion of a minimally extended pattern, from which he derives a procedure to decide whether such an algorithm may be associated with an ordered list of patterns.

%T Comparison of Priority Rules in Pattern Matching and Term Rewriting
%A A. Laville
%I lavi91
%S Journal of Symbolic Computation 11, pp321-347
%K 
%C it is shown that the so called specificity (HOPE) and textual (cf ML) rules for disambiguating pattern matching have the same expressive power. That is, any rule can simulate the other.

%T The Programming Language Landscape
%A H. Ledgard, M. Marcotty
%I ledg81
%S Science Research Associates, 1981
%K 
%C 

%T On the Use of LISP in Implementing Denotational Semantics
%A P. Lee, U. Pleban
%I lee86
%S In acm86, pp233-248
%K 
%C 

%T Topics in Advanced Language Implementation

%A P. Lee, Ed.
%I lee91
%S MIT Press, ISBN 0-262-12151-4
%K 
%C 

%T A functional LR-parser
%A R. Leermakers, L. Augusteijn, F. Aretz
%I leer92
%S Theoretical Computer Science 104, pp313-323
%K 
%C 

%T The Functional Treatment of Parsing
%A Rene Leermakers
%I leer93
%S Kluwer
%K 
%C The book will be published by Kluwer, in July. More
information can be obtained by anonymous ftp at internet address
"world.std.com" of the file "Kluwer/books/functional_parsing

%T Extending Functional Programming towards Relations
%A R. Legrand
%I legr88
%S LNCS 300, pp206-220, 2nd European Symp. on Programming, Nancy, March 1988
%K 
%C 

%T Structural Semantics for Polymorphic Data Types
%A D. Leivant
%I leiv83b
%S Proc. 10th POPL,Austin, 1983
%K polymorphism, type abstraction, Reynolds-Girard system
%C 

%T Discrete Polymorphism
%A D. Leivant
%I leiv90
%S In acm90, pp288-297
%K intersection types, ad hoc types
%C 

%T Mechanisms for Efficient Multiprocessor Combinator Reduction
%A M. Lemaitre, et al.
%I lema86
%S In acm86, pp113-121
%K 
%C 

%T Analysis of Functional Programs by Program Transformation
%A D. Le Mtayer
%I lema88
%S 2nd France-Japan AI and CS Symp., North Holland, 1988
%K 
%C 

%T A Protocol for Distributed Reference Counting
%A C-W. Lermen, D. Maurer
%I lerm86
%S In acm86, pp343-350
%K 
%C 

%T Efficient data representation in polymorphic
languages
%A X. Leroy
%I lero90
%S PLILP'90 proceedings, Springer-Verlag 1990
%K 
%C garbage collection and allocation

%T Computer Experiments with the REVE Term Rewriting System Generator
%A P. Lescanne
%I lesc83
%S Proc. 10th POPL,Austin, 1983
%K equational theories, term rewriting systems, abstract data types, termination, word problem, induction, theorem proving, program verification
%C 

%T The G-machine as a Representation of Stack Semantics
%A D. Lester
%I lest87
%S LNCS 274, pp46-59
%K 
%C This paper outlines a proof that an implementation similar to Johnsson's is correct with respect to a stack semantics for a simple lazy functional programming language.

%T A Transformational Development of an Optimizing G-Machine Compiler
%A D. Lester
%I lest88a
%S Aspens 88, [john88a], pp157-186
%K 
%C 

%T Combinator Graph Reduction: A Congruence
%A D. Lester
%I lest88b
%S Aspens 88, [john88a], pp187-216 also Technical Monograph PRG-73, Oxford University Computing Laboratory 1989, ISBN 0-902928-55-4; D. Phil Thesis.
%K 
%C This thesis may be read as a formal mathematical proof the the G-machine is correct with respect to a denotational semantic specification of a simple language. A simple lazy functional language is defined both denotationally and operationally; both are defined to handle erroneous results. The operational semantics models graph reduction, and is based on reduction to weak head normal form. The two semantic definitions are shown to be congruent.

%T Stacklessness: Compiling Recursion for a Distributed Architecture
%A D. Lester
%I lest89a
%S FPCA, Imperial College, 1989, pp116-128
%K 
%C 

%T An Efficient Distributed Garbage Collector Algorithm
%A D. Lester
%I lest89b
%S PARLE '89, LNCS 365/366
%K 
%C 

%T An Executable Specification of the HDG-Machine
%A D.R. Lester, G.L. Burn
%I lest89c
%S Proc. Workshop on Massive Parallelism : Hardware,
Programming and Applications, Italy, 9-15 October 1989, alsoGEC Hirst Research Centre, Nov. 1989
%K 
%C 

%T FP Systems in Edinburgh LCF
%A J. Leszczylowski
%I lesz81
%S LNCS 107
%K 
%C 

%T Foundations of a Functional Approach to Knowledge Representation
%A H.J. Leveque
%I leve84
%S Artificial Intelligence 23,2, 1984
%K 
%C 

%T An Algebraic Interpretation of the lbK-Calculus and a labellel l-Calculus
%A J.-J. Lvy
%I levy75
%S In LNCS 37, pp147-165
%K 
%C 

%T Reductions Correctes et Optimales dans le Lambda-Calcul
%A J.-J. Lvy
%I levy77
%S PhD Thesis.
Universit de Paris, 1977
%K 
%C 

%T Optimal Reduction in the Lambda-Calculus
%A J.J. Levy
%I levy80
%S In hind80, ``Essays on Combinatory Logic'', pp159-191
%K reduction strategies, sharing, closures, reduction permutation, duplication of redexes, complete reductions, optimal reductions
%C Discusses a family relation whose redexes if reduced as an unit step (in parallel) gives optimal reduction

%T Type Checking, Separate Compilation and Reusability
%A Michael R. Levy
%I levy84
%S Proc. SIGPLAN '84 Symposium on Compiler Construction, ACM, Montreal 1984
%K implementation, types, reusability, separate compilation
%C 

%T A New List Compaction Method
%A K. Li, Paul R. Hudak
%I li85
%S Software16, 2, pp145-163, 1986, also Yale University Technical Report YALEU/DCS/TR--362, 1985
%K cdr coding, compaction, encoding, garbage collection
%C A new list compaction method is presented that performs well during both sequential and 'parallel' list generation. The method is essentially a generalisation of cdr-coding, in which lists are represented explicitly as linked vectors rather than implicitly as compacted memory.

%T FPL: Functional plus Logic Programming - An Integration of the FP and Prolog Languages
%A N. Lichtenstein, S. Kaplan
%I lich90
%S In LNCS 516 also M. Sc. Thesis Bar-Ilan Univ., Ramat-Gan, Israel
%K 
%C 

%T A Real-Time Garbage Collector Based on the Lifetimes of Objects
%A H. Lieberman, C. Hewitt
%I lieb83
%S CACM, 26(6), pp419-429
%K 
%C 

%T Steps towards better Debugging Tools for LISP
%A H. Lieberman
%I lieb84
%S In acm84a, pp247-255
%K 
%C 

%T A Real Time Garbage Collector that Can Recover Temporary Storage Quickly
%A H. Lieberman, Carl E. Hewitt
%I lieb??
%S MIT AI Memo 569
%K 
%C 

%T Executable Specification using Miranda: An Example
%A F. Lin, F.E. Hunt
%I lin89
%S Proceedings of International Computer Symposium 1988
%K 
%C This paper describes the authors' design experience with FP interpreters using declarative languages, and look at Miranda as a design language.

%T Stream-Based Execution of Logic Programs
%A G. Lindstrom, P. Panangaden
%I lind84
%S Proceedings of the International Symposium on Logic Programming, Atlantic City, NJ, pp168-176, IEEE Computer Society Press, 1984, ISBN 0-8186-0522-7.
%K parallel FEL parlog
%C The authors report a new execution model for Horn clause logic programs, combining (i) stream-based analog of backtracking, (ii) OR-parallelism, (iii) applicative formulation, (iv) concurrent processing and (v) instantiation via composition of subject records.

%T Functional Programming and the Logical Variable
%A G. Lindstrom
%I lind85
%S Proc. 12th POPL, 1985
%K loigical variables, unification, FGL, graph reduction, demand sensitivity, correctness
%C 

%T Static Evaluation of Functional Programs
%A G. Lindstrom
%I lind86a
%S Proc. SIGPLAN '86 Symp. on Compiler Construction, Palo Alto, SIGPLAN 21,7, 1986
%K lazy evaluation, infinite objects, abstract interpretation, demand patterns, function reversal, basic blocks, efficient compilation, strictness analysis, G machine, Prolog
%C 

%T Implementing Logical Variables on a Graph Reduction Architecture
%A G. Lindstrom
%I lind86b
%S In LNCS 279, pp382-400
%K 
%C Logical variables offer a semantic meeting ground between functional and logic programming languages. That is, if functional languages are extended to do parameter passage by unification, much of the power of AND-parallel logic programming is obtained.

%T Our LIPS are Sealed: Interfacing Functional and Logic Programming Systems
%A G. Lindstrom, J. Maluszynski, T. Ogi
%I lind92
%S Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K 
%C 

%T The Complexity of a Translation of l-calculus to Categorical Combinators
%A R.D. Lins
%I lins85
%S Computing Laboratory Report No. 27
University of Kent, Canterbury, Kent, 1985
%K 
%C Revision 1 - August 1987.

%T A New Formula for the Execution of Categorical Combinators
%A R.D. Lins
%I lins85b
%S Report No. 33, Computing Laboratory, University of Kent, Canterbury, 1985, revision 1
%K 
%C Categorical Combinators form a formal system similar to Curry's
Combinatory Logic. It was developed by Curien inspired by the equivalence of the theories of typed l-calculus and Cartesian Closed Categories. In this paper the author shows how to "execute" Categorical Combinators in an efficient way using a rewrite system.

%T A Graph reduction Machine for Execution of Categorical Combinators
%A R.D. Lins
%I lins86
%S Report No. 36, Computing Laboratory, University of Kent, Canterbury, 1986, Revision 2.
%K 
%C Categorical Combinators form a formal system similar to Curry's
Combinatory Logic. It was developed by Curien inspired by the equivalence of the theories of typed l-calculus and Cartesian Closed Categories. In this paper the author discusses how to tailor a graph reduction machine for their use.

%T Categorical Multi-Combinators
%A R.D. Lins
%I lins87
%S LNCS 274 (FPCA Portland 1987), pp60-79
%K 
%C Categorical combinators form a formal system similar to Curry's
combinatory logic. In this paper is introduced a new set of categorical combinators which is more efficient than the previous ones, in terms of compilation and execution complexity.

%T On the Efficiency of Categorical Combinators as a Rewriting System
%A R.D. Lins
%I lins87b
%S Software 17, 8, 1987, pp547-559, also Report No. 34, Computing Laboratory, University of Kent (1985).
%K 
%C Categorical Combinators form a formal system similar to Curry's
Combinatory Logic. It was developed by Curien inspired by the equivalence of the theories of typed l-calculus and Cartesian Closed Categories. In this paper the author analyses two different rewriting systems.

%T Cyclic reference Counting with Local Mark-Scan
%A R.D. Lins
%I lins89
%S Report No. 65(75?), Computing Laboratory, University of Kent, Canterbury, 1989
%K graph reduction
%C to appear in Information Processing Letters??

%T Implementing SASL using Categorical Multi-Combinators
%A R.D. Lins, S.J. Thompson
%I lins90
%S Software, 20, 11, pp1137-1165
%K combinator numticombinator functional abstraction algorithm
%C The core of the system of Categorical Multi-Combinators consists of only two rewriting laws with a very low pattern-matching complexity.

%T Abstraction Mechanisms in CLU
%A B. Liskov, A. Snyder
%I lisk77
%S CACM 20,3, 1977
%K 
%C 

%T CLU Reference Manual
%A B. Liskov, et al.
%I lisk79
%S Massachussets Institute of Technology Laboratory of Computer Science Technical Report MIT/LCS/TR--225
%K 
%C 

%T Detecting Static Algorithms by Partial Evaluation
%A B. Lisper
%I lisp91
%S SIGPLAN 26/9, [pepm91]
%K 
%C 

%T Fractals with Turtle Graphics: A CS2 Programming Exercise for Introducing Recursion
%A I.B. Liss, T.C. MacMillan
%I liss87
%S SIGCSE 19,1, pp141-146
%K 
%C 

%T Absolute Set Abstraction and Its Evaluation
%A F. Liu
%I liu90
%S plas90
%K integration of functional and logic programming, nondeterminism, logical variables, evaluation strategy
%C 

%T Guarded Term ML - A Functional Logic Programming Language
%A H. Lock
%I lock88
%S Aspens 88, [john88a], pp129-144
%K 
%C 

%T An Amalgamation of Functional and Logic Programming Languages
%A H.C.R. Lock
%I lock89
%S GMD-report 408, GMD Forschungsstelle an der Univ. Karlsruhe, Sept 89
%K 
%C 

%T The Implementation of Functional Logic Programming Languages
%A H.C.R. Lock
%I lock90
%S PHOENIX report GMD/Phoenix/13/1, GMD Research Lab. Karlsruhe, 1990
%K 
%C 

%T Neural Programming: An Extension of Functional Programming
%A K.F. Loe, C.L. Tai
%I loe90
%S Technical Report No. TR12/90, Department of Information Systems and Computer Science,, National University of Singapore, 1990
%K lisp flisp
%C 

%T Correctness of a Compiler for a LISP subset
%A R.L. London
%I lond??
%S SIGPLAN 7,1, 19??
%K 
%C 

%T Generating Parsers in Miranda
%A M. Longley
%I long87
%S UKC Computing Laboratory Report No. 49
University of Kent, Canterbury, 1987
%K 
%C This system makes use of the UNIX facilities YACC and AWK to generate tables to drive a parser in Miranda.

%T A Miranda Implementation of Paul Gardiner's Logic of 'B'
%A M. Longley
%I long88
%S UKC Computing Laboratory Report No. 50
University of Kent, Canterbury, 1988
%K 
%C The aim of the 'B' system, written by J.R. Abrial, and the logic
presented by Paul Gardiner, is to enable the easy use of a natural
deduction style in theorem proving. The author presents an implementation, in Miranda, of the core of a theorem-prover based on this logic.

%T Distributed Implementation of Programmed Graph Reduction
%A R. Loogen, H. Kuchen, K. Indermark
%I loog88
%S Aspens 88, [john88a], pp341-372, also in PARLE '89, LNCS 365/366, pp. 136-157
%K 
%C 

%T Stack Controlled Implementation of Narrowing
%A R. Loogen
%I loog90
%S plas90
%K unification, backtracking, BABEL
%C 

%T From Reduction Machines to Narrowing Machines
%A R. Loogen
%I loog91
%S TAPSOFT '91
%K unification, integration of functional and logic machines, BABEL, backtracking, operational semantics, compilation, higher order functions, lazy narrowing, guards, implementation
%C 

%T A Miranda to FLIC Translator
%A A.M. Lord
%I lord87
%S Functional Language Implementation Project Document 9. Univs. Warwick/Birmingham, CS Dept.
%K 
%C A description of software for translating David Turner's lazy evaluation functional language Miranda to FLIC. This was originally a third-year undergraduate project.

%T Types and Effects: Towards the Integration of Functional and Imperative Programming
%A J.M. Lucassen
%I luca87
%S Technical Report MIT/LCS/TR-408, Laboratory for Computer Science, MIT, Cambridge, MA, 1987, PhD Thesis
%K polymorphism
%C 

%T Polymorphic Effect Systems
%A J.M. Lucassen, D.K. Gifford
%I luca88
%S Proc. 15th POPL pp47-57
%K 
%C 

%T Applicative Graphics using Abstract Data Types
%A P. Lucas, S.N. Zilles
%I luca88b
%S Research Report RJ 6198 (61188)
IBM Research Division, Yorktown Heights, NY, 1988
%K 
%C 

%T Church-Rosser Theorem fr Lambda-Kalkle mit Unendlichen Langen Termen
%A W. Maass
%I maas75
%S ISILC Proof Theory Symposium, Kiel 1975, Lecture Notes in Mathematics 500., pp257-263
%K 
%C 

%T Observations on the Differences between Formulas and Sentences and their Application to Programming Language Design
%A B.J. MacLennan
%I macl79
%S SIGPLAN 14,7, 1979
%K 
%C 

%T Introduction to Relational Programming
%A B.J. MacLennan
%I macl81
%S In acm81, pp213-220, 1981
%K 
%C 

%T A Simple, Natural Notation for Applicative Languages
%A B.J. MacLennan
%I macl82a
%S SIGPLAN 17,10, 1982
%K notation, natural language
%C 

%T Values and Objects in Programming Languages
%A B.J. MacLennan
%I macl82b
%S SIGPLAN 17,12, 1982
%K value oriented programming, object oriented programming, simulation, state, store
%C 

%T A View of Object-Oriented Programming
%A B.J. MacLennan
%I macl83a
%S NPS52--83--001, Naval Postgraduate School, Monterey, 1983
%K 
%C 

%T Abstraction in the Intel iAPX-432 Prototype Systems Implementation Language
%A B.J. MacLennan
%I macl83b
%S SIGPLAN 18,12, pp 86-95, 1983
%K 
%C 

%T Overview of Relational Programming
%A B.J. MacLennan
%I macl83c
%S SIGPLAN 18,3, pp 36-45, 1983

%K 
%C 

%T A Simple Proof of a Generalised Church-Rosser Theorem
%A B.J. MacLennan
%I macl84a
%S Naval Postgrad. School CS Tech. Rep. NPS52-84-007
%K 
%C 

%T Computable Real Analysis
%A B.J. MacLennan
%I macl84b
%S Naval Postgrad. School CS Tech. Rep. NPS52-84-024
%K 
%C 

%T A Simple Software Environment Based on Objects and Relations
%A B.J. MacLennan
%I macl85
%S Proc. SIGPLAN 85 Symp on Language Issues in Programming Language Environments
%K 
%C 

%T Functional Programming - Practice and Theory
%A B.J. MacLennan
%I macl89
%S Addison Wesley, 1989, ISBN 0-201-13744-5.
%K general
%C 

%T The Python Compiler for CMU Common Lisp
%A R.A. MacLachlan
%I macl92
%S In acm92, pp235-246
%K 
%C 

%T Structure and Parametrization in a Typed Functional Language
%A David MacQueen
%I macq81
%S In Symposium on Functional Languages and Computer Architecture', Gothenburg, Sweden 1981
%K 
%C 

%T A Semantic Model of Types for Applicative Languages
%A D.B. MacQueen, R. Sethi
%I macq82
%S In acm82
%K types, polymorphism, type constructors, type rules
%C 

%T Modules for Standard ML
%A David MacQueen
%I macq84a
%S In acm84a, pp198-207 --- also Polymorphism I,3 (Draft) and Polymorphism II,2, 1985 (final)
%K ml, modules, environment management, signatures, types, inheritance, sharing
%C 

%T An Ideal Model for Recursive Polymorphic Types
%A D.B. MacQueen, G. Plotkin, R. Sethi
%I macq84b
%S Proc. 11thPOPL, Salt Lake City, Jan. 1984 also Information and Control 71 1/2, 95-130
%K self application, type inference, polymorphism, recursive types, circular unification, mu operator, existential quantification, universal quantification, complete partial orders, CPOs, ideals, denotationsal semantics, soundness
%C 

%T Report on the Standard ML Meeting
%A D.B. MacQueen
%I macq85
%S Polymorphism --- The ML/LCF/Hope Newsletter II,1, 1985
%K Standard ML, modules, instances, sharing, signatures, inheritance, input, output, streams, core language, exceptions
%C 

%T An Implementation of Standard ML Modules
%A D. MacQueen
%I macq88
%S In acm88, pp212-223
%K dependent types, signatures
%C 

%T A Higher-Order Type System for Functional Programming
%A D. MacQueen
%I macq90
%S in turn90a, Research Topics in Functional Programming, pp353-367
%K 
%C 

%T A Network of Microprocessors to execute reduction machines, Part I
%A G.A. Mago
%I mago79a
%S Int. J. of Computer and Information Sciences 8,5, 1979, pp349-385
%K 
%C 

%T A Network of Microprocessors to execute reduction machines, Part II
%A G.A. Mago
%I mago79b
%S Int. J. of Computer and Information Sciences 8,6, 1979, pp435-471
%K 
%C 

%T A Cellular Computer Architecture for Functional Programming
%A G. Mago
%I mago80
%S 20th IEEE Computer Society Annual Conference, COMPCON, 1980
%K 
%C 

%T A Reduction Machine and its Efficiency of Program Execution
%A G.A. Mago
%I mago80b
%S Technical Report Series 156, Computing Laboratory, University of Newcastle-upon-Tyne, Proceedings of the Joint SRC/University of Newcastle-upon-Tyne, Workshop on VLSI: Machine Architecture and Very High Level Languages, pp47-51, 1980
%K 
%C 

%T Copying Operands Versus Copying Results: A Solution to the Problem of Large Operands in FFPs
%A G.A. Mago
%I mago81
%S In acm81
%K FFP, copying sharing, cellular computer, string reduction, matrix manipulation
%C 

%T Data Sharing in an FFP Machine
%A G. Mago
%I mago82
%S In acm82
%K FP, FFP, sharing, unification
%C 

%T Controlling Parallelism in Functional Programs using Complexity Information
%A P. Maheshwari
%I mahe90
%S PhD thesis, Department of Computer Science,
University of Manchester, Manchester, October 1990
%K 
%C 

%T Functional Behaviour of Nondeterministic and Concurrent Programs
%A M. Main, D.B. Benson
%I main84
%S Information and Control 62,2/3, 1984
%K 
%C 

%T Deciding ML typability is complete for deterministic exponential time
%A H. Mairson
%I mair90
%S 17th POPL pp382-401, 1990
%K 
%C 

%T Quantifier Elimination and Parametric Polymorphism in Programming Languages
%A H.G. Mairson
%I mair92
%S JFP 2,2, pp213-226
%K 
%C 

%T Domain Generating Functions for Solving Constraint Satisfaction Problems
%A F. Major, G. Lapalme, R. Cedergren
%I majo91
%S JFP, 1, 2, pp213-227, 1991
%K 
%C 

%T TABLOG: The Deductive-Tableau Programming Language
%A Y. Malach, Z. Manna
%I mala84
%S In acm84a, pp323-330
%K logic-functional programming, functions, relations, backtracking
%C 

%T Algebraic Data Types and Program Transformation
%A G.R. Malcolm
%I malc90
%S Ph.D. Thesis, Rijksuniversiteit Groningen
%K 
%C 

%T Predicate Transformer Semantics
%A E.G. Manes
%I mane92
%S CUP, Cambridge Tracts in Theoretical Computer Science Vol. 33, ISBN 0 521 42036 9
%K 
%C 

%T Inductive Methods for Proving Properties of Programs
%A Z. Manna, S. Ness, J. Vuillemin
%I mann73
%S CACM 16,8, 1973
%K 
%C 

%T An Algorithm for Data Replication
%A T. Mann, A. Hisgen, G. Swart
%I mann89
%S Digital Equipment Corporation Report 46, 1989
%K distributed systems, replication, caching
%C Safety by replicating remote services

%T The Object-Oriented Functional Data Language
%A M.V. Mannino, I.J. Choi, D.S. Batory
%I mann90
%S IEEE Transactions on SE
16, 11, pp1258-1272, 1990
%K 
%C 

%T Compiling Lazy Pattern Matching
%A L. Maranget
%I mara92
%S In acm92, pp21-31
%K overlapping patterns

%C 

%T Data Structures for Parallel Execution of Functional Languages
%A G. Marino, G. Succi
%I mari89
%S PARLE '89, LNCS 365/366
%K 
%C 

%T Optimization of Functional Programs
%A S.C. Marks
%I mark82
%S Ph. D. Thesis, Rice Univ., Houston, 1982
%K 
%C 

%T Action Semantics of ML and Amber
%A J. Mark
%I mark86
%S Rep. DAIMI IR-66, Computer Science Dept, Aarhus University, 1988
%K 
%C 

%T A Intuitionistic Theory of Types: Predicative Part
%A Per Martin-Lf
%I mart75
%S Logic Colloqu. 73, ed. H.E. Rose, J.C. Shepherdson, North Holland, 1975
%K 
%C 

%T Typed Functional Programming Systems
%A J.J. Martin
%I mart81
%S Technical Report CS 81007-R, Department of Computer Science, Virginia Polytechnic Institute, 1981
%K 
%C 

%T Constructive Logic and Computer Programming
%A Per Martin-Lf
%I mart82
%S In ``Logic, Methodology and Philosophy of Science VI'' Ed. L.J. Cohen, et al., North Holland, 1982
%K 
%C 

%T Finding Fixed Points in Finite Languages
%A C. Martin, C. Hankin
%I mart87
%S LNCS 274, FPCA Portland, 1987, pp426-445
%K fixpoint frontiers algorithm abstract interpretation
%C In this paper the authors extend Peyton Jones' and Clack's "frontiers algorithm"  for finding the fixpoints of recursive functions in the abstract value space, and show how it can be applied to higher-order functions over arbitrary finite lattices.

%T Bounded Quantifiers have Interval Models
%A S. Martini
%I mart88
%S In acm88, pp164-173
%K inheritance, Fun, higher order polymorphism
%C 

%T Equivalence in Functional Languages with Effects
%A I. Mason, C. Talcott
%I maso91
%S JFP 1, 3, pp287-327, 1991
%K 
%C 

%T Introduction to Poly

%A D.C.J. Matthews
%I matt83
%S Polymorphism --- The ML/LCF/Hope Newsletter I,2, 1983 --- and University of Cambridge Computer Lab. Tech. Rep. No 29
%K POLY, Russell, parametric polymorphism
%C 

%T Poly Manual
%A D.C.J. Matthews
%I matt85
%S SIGPLAN 1985, 20, 9, pp52-7
%K 
%C 

%T Metric Domains for Completeness
%A S.G. Matthews
%I matt86
%S Research Report 76, Department of Computer Science, University of Warwick, Coventry, 1986
%K functional semantics categories tarski
%C Completeness is a semantic non-operational notion of program correctness suggested by W.W. Wadge. Program verification can be simplified using completeness. This report proves the validity of this approach 

%T Static and Dynamic Type Checking
%A D.C.J. Matthews
%I matt90
%S Advances in Database Programming Languages, Edited by F. Bancilhon & P. Buneman, ACM Press, Frontier Series, 1990 being the Proceedings of Workshop held at Roscoff, France, 1987
%K 
%C 

%T A Distributed Concurrent Implementation of Standard ML
%A D. Matthews
%I matt91
%S Report ECS-LFCS-91-174, Laboratory for Foundations of Computer Science, Edinburgh University, also EurOpen Autumn 1991 Conference
1991
%K 
%C 

%T A Formalization of Floating Point Numeric Base Conversion
%A D.W. Matula
%I matu70
%S IEEE Trans. Comp. C-19(8):681-692, August 1970
%K Haskell arithmetic
%C 

%T PROGRAPH: A Preliminary Report
%A S. Matwin, T. Pietrzykowski
%I matw85
%S Computer Languages
10, 2, 1985, pp91-126
%K graph FGL
%C 

%T Implementing Functional Languages in the Categorical Abstract Machine
%A M. Mauny, A. Suarez
%I maun86
%S In acm86, pp266-278
%K 
%C 

%T Parsers and Printers as Stream Destructors and Constructors Embedded in Functional Languages
%A M. Mauny
%I maun89
%S FPCA, Imperial College, 1989, pp360-370
%K 
%C 

%T Parsers in ML
%A M. Mauny, D. de Rauglaudre
%I maun92
%S In acm92, pp76-85
%K operational semantics, streams pattern matching LL(1), recursive descent
%C 

%T An Overview of FCL: A Functional Language for Data Flow Computing
%A P.M. Maurer
%I maur81
%S Tech. Rep. 81--3, Dept. Comp. Sci., Iowa State Univ., Ames, 1981
%K 
%C 

%T FCL: A Purely Functional Language for Data Flow Programming
%A P.M. Maurer
%I maur82
%S Ph. D. Thesis, Iowa State Univ., Ames, 1982
%K 
%C 

%T The Use of Combinators in Translating a Purely Functional Language to Low-Level Data-Flow Graphs
%A P.M. Maurer, A.E. Oldehoeft
%I maur83
%S Computer Languages 8,1, 1983, pp27-45
%K 
%C 

%T Strictness Computation Using Special Lambda-Expressions
%A Dieter Maurer
%I maur85
%S In LNCS 217
%K higher order functions, ned expressions, strictness analysis
%C 

%T Relavanzanalyse. Eine Kombination von Striktheits- und Datenflussanalyse zur effizienten Auswertung funktionaler Programme
%A D. Maurer
%I maur87
%S Diss. thesis, Saarbrcken, 1987
%K 
%C 

%T Eine Abstrakte Maschine zur Implementierung Funktionaler Programmiersprachen
%A D. Maurer, R. Wilhelm
%I maur88
%S Tech. Rep. SFB 124 TP-C1 (Univ. des Saarlandes?)
%K 
%C 

%T System Software on the Flagship Parallel Graph Reduction Machine
%A K.R. Mayes, J.A. Keane, S. Holdsworth
%I maye91
%S Technical Report UMCS-91-11-1, Department of Computer Science, University of Manchester, 1991
%K 
%C 

%T Data Types as Functions
%A B.H.Mayoh
%I mayo78
%S In LNCS 64
%K parametric types, polymorphism, abstract types
%C 

%T Transputer-Based Experiments with the Zapp Architecture
%A D. McBurney, M.R. Sleep
%I mcbu87
%S LNCS 258, pp242-259, also Report SYS-C86-10, University of East Anglia (1986)
%K occam bakker
%C The authors report experiments with a parallel architecture called ZAPP simulated on several connected INMOS transputers.

%T Experiments with a Virtual Tree Machine using Transputers
%A D.L. McBurney, M.R. Sleep
%I mcbu89
%S School of Information Systems, University of East Anglia, 1989, IEEE 0073-1129/89/0000/0355.
%K zapp parallel
%C A number of experiments with a virtual process tree architecture called ZAPP are described. Most of the experiments involve the parallel execution of simple process trees grown by rewrite rules which recursively decompose a large grain of work into smaller grains. Some experiments extend the model by supporting limited notions of global communication in the process tree.

%T Concurrent Clean on ZAPP
%A D.L. McBurney, M.R. Sleep
%I mcbu90
%S plas90
%K load balancing, offloading, graph copying, granularity, divide and conquer, annotations, defer nodes, pre-emptive scheduling, spawning, throttling, performance
%C 

%T Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
%A J. McCarthy
%I mcca60a
%S CACM 3,4,pp184-195 1960
%K LISP
%C 

%T LISP 1 Programmer's Manual
%A J. McCarthy, et al.
%I mcca60b
%S Cambridge March 1960
%K 
%C 

%T A Basis for a Mathematical Theory of Computation
%A J. McCarthy
%I mcca61
%S Western JCC, 1961 -- also In Computer Programming and Formal Systems, braf63
%K recursion induction, computable functions, structural induction, conditionals, correctness, proof, verification, validation
%C 

%T LISP 1.5 Programmer's Manual
%A J. McCarthy, P.W. Abrahams, D.J. Edwards, T.P. Hart, M.E. Levin
%I mcca62a
%S MIT Press, 1962
%K LISP, interpreters
%C 

%T Computer Programs for Checking Mathematical Proofs
%A J. McCarthy
%I mcca62b
%S Amer.Math. Soc. Proc. Symp. in Pure Math., 5, 1962
%K 
%C 

%T Towards a Mathematical Science of Computation
%A J. McCarthy
%I mcca62c
%S IFIP '62
%K science of computation, fundamentals, abstract syntax, operational semantics, limitations
%C 

%T The History of LISP
%A J. McCarthy
%I mcca77
%S Proc. SIGPLAN History of Programming Languages Conference, 1978, SIGPLAN 13,8 pp217-223
%K general, LISP, history, car. cdr, cons, implementation, FUNARG problem
%C 

%T LISP --- Notes on its Past and Future
%A J. McCarthy
%I mcca80
%S In acm80
%K history, LISP, languages
%C 

%T The Correctness of a Modified SECD Machine
%A C.L. McCowan
%I mcco70
%S Proceedings of the Second ACM Symposium on the Theory of Computing, pp149-157, 1970
%K 
%C 

%T An Investigation of a Programming Language with a Polymorphic Type Structure
%A N.J. McCracken
%I mccr79
%S Ph. D., Syracuse Univ., 1979
%K 
%C 

%T The Typechecking of Programs with Implicit Type Structure
%A N. McCracken
%I mccr84
%S InLNCS 173
%K types, type checking, polymorphism, conjunction types
%C 

%T The CONNIVER Reference Manual
%A Drew V. McDermott, G.J. Sussman
%I mcde74
%S AI Memo 295a, MIT AI Lab., 1974
%K 
%C 

%T An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped Lisp
%A Drew McDermott
%I mcde80
%S In acm80, pp154-162
%K 
%C 

%T fsh - A Functional UNIX Command Interpreter
%A C.S. McDonald
%I mcdo87
%S Software 17, 10
1987, pp685-700
%K 
%C 

%T Denotational Semantics of a Command Interpreter and their Implementation in Standard ML
%A C. McDonald, L. Allison
%I mcdo89
%S Comp. J
32, 5, 422-431, pp1989
%K 
%C 

%T Data Flow Computing --- Software Development
%A J.R. McGraw
%I mcgr80
%S IEEE Transactions on Computing C--29,12, 1980
%K 
%C 

%T The VAL Language: Description and Analysis
%A J.R. McGraw
%I mcgr82
%S TOPLAS 4,1, pp44-82, 1982
%K dataflow, implicit concurrency, multiprocessing, multiprogramming, VAL, arrays, sequencing, language design
%C 

%T SISAL: Streams and Iteration in a Single-Assignment Language
%A J.R. McGraw, S. Skedzcelewski, S. Allan, D. Grit, R. Oldehoeft, J.R.W. Glauert, I. Dobes, P. Hohensee
%I mcgr83
%S Language Ref. Manual Version 1.1, Lawrence Livermore Nat. Lab., Univ. Calif. at Davis, 1983
%K 
%C Sisal is a functional language runs under unix environment. It is available by anonymous ftp from sisal.llnl.gov

%T Squinting at Power Series
%A M.D. McIlroy
%I mcil90
%S Software 20(7), pp661-683
%K streams
%C 

%T Using a Transputer Network to solve Branch-and-Bound Problems
%A G.P. McKeown, V.J. Rayward-Smith, S.A. Rush, H.J. Turpin
%I mcke90
%S SYS-C90-02, School of Information Systems, University of East Anglia, 1990
%K parallel
%C 

%T Branch-and-Bound as a Higher Order Function
%A G.P. McKeown,  V.J. Rayward Smith, H.J. Turpin
%I mcke90b
%S University of East Anglia School of Information Systems Internal Report SYS-C90-03
%K skeletons
%C 

%T Ruth: A Runtime System for Hope
%A L. McLoughlin, S. Eisenbach
%I mclo87
%S In eise87, pp156-168
%K dataflow
%C 

%T Imperative Effects from a Pure Functional Language
%A L. McLoughlin, E.S. Hayes
%I mclo89
%S In davi89b, pp157-169
%K 
%C 

%T Implementation in the STAPLE Project
%A D.J. McNally
%I mcna87
%S Report Staple/St.A/87/2
Department of CS, University of St. Andrews,1987
%K 
%C 

%T A Scheme for Compiling Lazy Functional Languages
%A D. McNally, A. Davie, A. Dearle
%I mcna88
%S Aspens 88, [john88a], pp463-476
%K 
%C 

%T Code Generating Functional Language Modules for a Persistent Object Store
%A D.J. McNally
%I mcna89
%S Report Staple/St.A/89/2
Department of CS, University of St. Andrews,1989
%K 
%C This paper describes an outline of a scheme for compiling modules
written in a functional language into persistent objects within the
framework of an integrated persistent functional programming environment.

%T Persistent Functional Programming
%A D. McNally, A. Davie, S. Joosten
%I mcna90
%S Proc. 4th Internat. Conf. on Persistent Databases, Martha's Vinyard, Sept. 1990
%K persistence, lazy evaluation, CASE machine
%C 

%T Two Models for Integrating Persistence and Lazy Functional Languages 
%A D.J. McNally, A.J.T. Davie
%I mcna91
%S SIGPLAN 26, No. 5, May 1991 and University of St.Andrews Dept. M&CS research report CS/91/1 
%K staple
%C 

%T Staple: A Functional Language with Orthogonal Persistence
%A D.J. McNally, A.J.T. Davie
%I mcna92
%S St.Andrews University CS
%K 
%C 

%T The Importance of Lazy Evaluation in Search
%A N.F. McPhee
%I mcph91
%S Technical Report TR-91-06, Department of CS, The University of Texas at Austin
%K Miranda
%C 

%T Incremental Polymorphic Type Checking in B
%A L. Meertens
%I meer83
%S Proc. 10th POPL,Austin, 1983
%K strong typing, incremental type checking, editing, unification, polymorphism
%C 

%T Constructing a Calculus of Programs
%A L. Meertens
%I meer89
%S LNCS 375, pp66-90
%K 
%C 

%T Paramorphisms
%A L.G.L.T. Meertens
%I meer91
%S Formal Aspects of Computing, to appear
%K 
%C 

%T A Taxonomy of Function Evaluating Machines
%A E. Meijer
%I meij88
%S Aspens 88, [john88a], pp235-266
%K 
%C Generalised Expression Evaluation

%T Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
%A E. Meijer, M.M. Fokkinga, R. Paterson
%I meij91
%S FPCA91, also contained in meij92
%K 
%C 

%T Calculating Compilers
%A E. Meijer
%I meij92
%S Ph.D. Thesis, Katholieke Universiteit Nijmegen
%K 
%C contains meij91

%T Sorting Algorithms Implemented in a Functional Programming System
%A S.L. Meira
%I meir82
%S University of Kent Computing Lab. report 14, 1982
%K sorting, KRC, examples, proving correctness, efficiency, complexity, treesort bubblesort quicksort mergesort insertsort
%C 

%T The Kent Recursive Calculator (KRC): Syntax and Semantics
%A S. Meira
%I meir83a
%S Unpublished --- University of Kent at Canterbury
%K 
%C 

%T Abstract Interpretation Methods for Optimisation of Combinatoric Code
%A S.L. Meira
%I meir83b
%S University of Kent Computing Lab. report, 1983
%K 
%C 

%T Optimised Combinatoric Code for Applicative Language Implementation
%A S. Meira
%I meir84
%S In LNCS 167
%K combinators, implementation, optimisation, KRC, normal order graph reduction, SASL, call value need
%C 

%T On the Efficiency of Applicative Algorithms
%A S. Meira
%I meir85
%S Ph.D. Thesis, Computer Lab., Univ. of Kent at Canterbury, 1985
%K 
%C 

%T A Linear Applicative Solution for the Set Union Problem
%A S.L. Meira
%I meir85b
%S Computing Laboratory Report No. 28, University of Kent at Canterbry
%K 
%C 

%T Strict Combinators
%A S.L. Meira
%I meir87
%S Information Processing Letters
24, 4, pp255-258, 1987
%K Ri
%C 

%T Combinator Equations
%A D. Meredith
%I mere75
%S Studia Logica
34, 1975, pp367-385
%K 
%C 

%T What is a Model of the Lambda Calculus?
%A A.R. Meyer
%I meye81
%S Inf. Control 52,1, 1982
%K untyped lambda calculus, combinatory algebra, lambda theories, environment models, substitution, model construction
%C 

%T Continuations May be Unreasonable: Preliminary Report
%A A.R. Meyer, J.G. Riecke
%I meye88
%S In acm88, pp63-71
%K 
%C 

%T 'Memo' Functions and Machine Learning
%A D. Michie
%I mich68
%S Nature 218, pp19-22
%K 
%C 

%T Interpreters from Functions and Grammars
%A G. Michaelson
%I mich86a
%S Computer Languages 11,2, 1986
%K denotational semantics, language design, implementation, grammar rules, interpreters, context sensitive parsing, SIS, parsing
%C 

%T Parallel Graph Reduction on a Supercomputer: A Status Report
%A R. Michelsen, et al.
%I mich86b
%S In LNCS 279, pp114-118
%K 
%C The authors describe an ongoing effort to develop a parallel graph
reduction run-time system hosted on a multiprocessor supercomputer. This run-time system is presently augmented by the functional language compiler of the ALFALFA system.

%T An Introdunction to Functional Programming through Lambda Calculus
%A G. Michaelson
%I mich89
%S Addison-Wesley, 1989, ISBN 0-201-17812-5.
%K general textbook
%C 

%T Functional Data Structures as Updatable Objects
%A J. Milewski
%I mile90
%S IEEE Transactions on SE
16, 12, pp1427-1432, 1990
%K 
%C 

%T The G-Line: A Distributed Processor for Graph Reduction
%A R. Milikowski, W.G. Vree
%I mili91
%S In glas91, pp265-282
%K 
%C 

%T An Extension to ML to Handle Bound Variables in Data Structures:
%A D. Miller
%I mill90
%S Preliminary Report, MS-CIS-90-59, Department of Computer and Information Science, University of Pennsylvania
%K 
%C 

%T A Language for PRAM Programming
%A Q. Miller
%I mill90b
%S PUMA Task 6.3: Deliverable Report, Programming Research Group, Oxford University, 1990
%K 
%C 

%T Models of LCF
%A R. Milner
%I miln73
%S Memorandum AIM-186, Report CS-332, Stanford Artificial Intelligence Laboratory, Stanford University, 1973
%K 
%C 

%T The Formal Semantics of Computer Languages and their Implementation
%A R. Milne
%I miln75a
%S Ph.D. Thesis, Prog. Res. Group, Univ. of Oxford, 1975
%K 
%C 

%T A Logic of Computable Functions with Reflexive and Polymorphic Types
%A R. Milner, et al.
%I miln75b
%S Univ. Edinburgh, Dept. Comp. Sci., LCF Report 1, 1975
%K polymorphism, LCF, ML, reasoning about programs, PP, type inference, well typing
%C 

%T A Theory of Programming Language Semantics
%A R. Milne, C. Strachey
%I miln76
%S Chapman and Hall, 1976
%K 
%C 

%T Fully Abstract Models of Typed Lambda-Calculus
%A R. Milner
%I miln77
%S Theoretical Computer Science
4, pp1-22, 1977
%K 
%C 

%T A Theory of Type Polymorphism in Programming
%A R. Milner
%I miln78
%S J. Computer and System Sciences 17,3, pp348-375, 1978
%K type polymorphism, type inference, semantic soundness, well typing, syntactic soundness, ML, generic types, EXP
%C 

%T LCF: A Way of Doing Proofs with a Machine
%A R. Milner
%I miln79
%S In LNCS 74, pp146-159
%K 
%C 

%T A Calculus of Communicating Systems
%A R. Milner
%I miln80
%S In LNCS 81
%K ccs
%C 

%T Four Combinators for Concurrency
%A R. Milner
%I miln82
%S In `Principles of Distributed Computing' --- ACM SIGACT-SIGOPS Symposium, Ottawa, 1982
%K 
%C 

%T How ML Evolved
%A R. Milner
%I miln83a
%S Polymorphism --- The ML/LCF/Hope Newsletter I,1, 1983
%K ML, history, LCF, goal directed proof, tactics, theorems
%C 

%T Standard ML Proposal
%A R. Milner
%I miln83b
%S Polymorphism --- The ML/LCF/Hope Newsletter I,3, 1983
%K ML, standard, language, general, design principles, evaluation, bindings, references, equality, exceptions, type checking
%C 

%T A Proposal for Standard ML
%A R. Milner
%I miln84
%S In acm84a, pp184-197, also Internal Report CSR-157-83, University of Edinburgh
%K ml, language, types, polymorphism
%C 

%T The Standard ML Core Language
%A R. Milner
%I miln85a
%S Polymorphism --- The ML/LCF/Hope Newsletter 2,2, 1985
%K standard ML core, evaluation, bindings, references, equality, exceptions, type checking, modules
%C 

%T The Dynamical Operational Semantics of Standard ML 
%A R. Milner
%I miln85b
%S CS Dept, Edinburgh University
%K 
%C 

%T Changes to the Standard ML Core Language
%A R. Milner
%I miln87
%S Report ECS-LFCS-87-33, University of Edinburgh, also CSR-240-87
%K manual description
%C 

%T The Definition of Standard ML
%A Robin Milner, Mads Tofte, Robert Harper
%I miln90
%S MIT, 1990.
ISBN: 0-262-63132-6
%K 
%C 

%T Commentary on Standard ML
%A Robin Milner, Mads Tofte
%I miln91
%S MIT, 1991
ISBN: 0-262-63137-7
%K 
%C companion to the definition (miln90).  It explains some of the design choices and some delicate parts of the Definition.  It also presents some properties of the language, with the associated proofs.

%T Functions as Processes
%A R. Milner
%I miln92
%S Mathematical Structures in Computer Science 2,2, 119-141
%K 
%C 

%T Specification to Prototype --- A Comparison of Two Formal Methods of Software Design
%A Cydney Minkowitz
%I mink85
%S University of Stirling, Dept. Comp. Sci.  Report TR.18, 1985
%K 
%C 

%T An Applicative Computing Language
%A J.P. Minne
%I minn83
%S Ph.D. Thesis, Univ. Calif., Irvine, 1983
%K FP, FFP, CFFP, closed applicative languages, histories of computation, streams, interprocess communication
%C 

%T Computation: Finite and Infinite Machines
%A M.L. Minsky
%I mins67
%S Prentice-Hall, 1967
%K 
%C 

%T Static Inference of Properties of Functional Programs
%A P. Mishra, Robert M. Keller
%I mish84
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K abstract interpretation, non-flat domains, streams, minor signatures, relevant clauses, standard interpretations, correctness, concurrency
%C 

%T Declaration-Free Type Checking
%A P. Mishra, U.S. Reddy
%I mish85a
%S Proc. 12th POPL, 1985
%K polymorphic type inference, abstract data types, union, regular trees, containment polymorphism, inheritance, effective algorithms, type inequalities, instantiations
%C 

%T Strictness and Polymorphic Type Inference
%A P. Mishra, et al.
%I mish85b
%S Unpublished, Dept. Comp. Sci., SUNY, Stony Brook, 1985
%K 
%C 

%T Coercion and Type Inference
%A J.C. Mitchell
%I mitc83
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K type inference, coercion, polymorphism, subtypes, inheritance
%C 

%T Type Inference and Type Containment
%A J. Mitchell
%I mitc84
%S In LNCS 173
%K type inference, GR, type containment, principal type schemes
%C 

%T Abstract Types have Existential Type
%A J.C. Mitchell, G.D. Plotkin
%I mitc85
%S Proc. 12th POPL, 1985
%K existential types, abstract data types, binding, SOL, polymorphism, data algebras, intuitive semantics, natural deduction
%C 

%T A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions
%A J.C. Mitchell
%I mitc86
%S In acm86, pp308-319
%K 
%C 

%T Implementations of Process Synchronisation and their Analysis
%A K. Mitchell
%I mitc86
%S Department of Computer Science, University of Edinburgh, 1986, PhD Thesis.
%K parallel
%C 

%T The essence of ML
%A J. Mitchell, R. Harper
%I mitc88
%S 15th POPL, pp28-46, 1988
%K 
%C 

%T Type Inference with Simple Subtypes
%A J.C. Mitchell
%I mitc91
%S JFP 1,3 pp245-285
%K automatic coercion, subranges, inheritance, add hoc polymorphism, overloading
%C 

%T On abstraction and the expressive power of programming languages
%A J.C. Mitchell
%I mitc91b
%S LNCS 526, pp290-310
%K 
%C 

%T Functional Programming is not Self-modifying Code
%A R.P. Mody
%I mody92
%S SIGPLAN 27,11, pp13-14
%K first class, civil rights, meta programming, reification, reflexion, static and dynamic scope
%C 

%T Binding Time Analysis for Higher Order Polymorphically Typed Languages
%A T.. Mogensen
%I moge88
%S In Proc. Glasgow 1988 Workshop, hall89, pp108-123
%K 
%C 

%T Separating Binding Times in Language Specifications
%A T.. Mogensen
%I moge89
%S FPCA89, Imperial College, London, 1989, pp14-25
%K 
%C This paper presents a method for automatic binding time analysis of specifications given as first order recursion equations to obtain descriptions of mixed binding times, and a method that automatically transforms a specification with mixed binding times into an equivalent specification with strongly separated binding times.

%T Efficient Self-Interpretation in Lambda Calculus
%A T.. Mogensen
%I moge92
%S JFP 2,3, pp345-364
%K reflexion, self-reducer, measurement, benchmarks
%C 

%T The Partial Lambda-Calculus
%A E. Moggi
%I mogg88
%S Internal Report CST-53-88, University of Edinburgh, Department of CS, 1988, PhD Thesis; also ECS-LFCS-88-63.
%K 
%C 

%T Computational Lambda Calculus and Monads
%A E. Moggi
%I mogg89
%S IEEE symposium on Logic in Computer Science, California, IEEE
%K 
%C A longer version is available as a technical report from Edinburgh University

%T A Category-theoretic Account of Program Modules
%A E. Moggi
%I mogg91
%S Mathematical Structures in Computer Science 1,1, 103-139
%K dependent types, ML extension, HML, dependent kinds
%C Explanation based on programming languages as indexed categories. Illustrates how ML can be extended to support higher order modules

%T Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
%A E. Mohr, D.A. Kranz, R.H. Halstead
%I mohr90
%S In acm90, 185-197
%K 
%C 

%T Unendliche Objekte und Geflechte
%A B. Mller
%I mll82
%S Technical Univ. Munich, Dissertation TUM--I8213, 1982
%K 
%C 

%T An Algebraic Semantics for Busy (Data Driven) and Lazy (Demand-Driven) Evaluation and its Application to a Functional Language
%A B. Mller
%I mll83
%S In LNCS 154
%K laziness, eagerness, busy evaluation, demand-driven evaluation, data driven evaluation, continuous algebras, operative algebras, algebraic specification
%C 

%T On the Algebraic Specification of Infinite Objects --- Ordered and Continuous Models of Algebraic Types
%A B. Mller
%I mll84
%S Technical Univ. Munich, 1984
%K 
%C 

%T Proceedings of the IFIP TC2 Working Conference on Constructing Programs from Specifications
%A B. Mller, Ed.
%I moll91
%S North Holland, 1991
%K 
%C 

%T Functional Programming for Business Students
%A P. Molyneux
%I moly93
%S JFP 3,1, pp35-48
%K Miranda, introductory teaching, critical path analysis
%C 

%T An Abstract Machine for Fast Parallel Matching of Linear Patterns
%A U. Montanari, J. Goguen
%I mont87
%S Report SRI-CSL-87-3, Computer Science Laboratory, SRI International, Menlo Park, CA, 1987
%K rewrite rules
%C This paper presents an abstract machine for the fast matching of linear patterns, defines programs for it, proves their correctness, and considers their optimization.

%T Maclisp Reference Manual
%A D. Moon
%I moon74
%S Revision 0, Proj. MAC, MIT, AI Lab., Cambridge, Mass., 1974, MIT Press
%K 
%C 

%T Lisp Machine Manual
%A D. Moon, D. Weinreb
%I moon81
%S Technical Report, MIT Artificial Intelligence Laboratory
%K 
%C 

%T Garbage Collection in a Large LISP System
%A D. Moon
%I moon84
%S In acm84a, pp235-246
%K LISP, garbage collection, incremental copying, virtual memory, demand pageing, mutator, hardware, performance
%C 

%T An Applicative Compiler for a Parallel Machine
%A I.W. Moor
%I moor82
%S SIGPLAN 17,6 1982
%K HOPE, ALICE, CTL, laziness, HOPE in HOPE, type checking, implementation
%C 

%T Realistic Functional Programming
%A I. Moor
%I moor87
%S In eise87, pp94-108
%K hope
%C 

%T BABEL: A Functional and Logic Programming Language based on Constructor Discipline and Narrowing
%A J.J. Moreno-Navarro, M. Rodriguez-Artalejo
%I more88
%S LNCS 343
%K 
%C 

%T Lazy Narrowing on a Graph Machine
%A J.J. Moreno-Navarro
%I more90
%S LNCS 463, pp298-317
%K 
%C  This paper addresses the nontermination problem and proposes a transformation scheme to a normal form -Uniform Babel programs. The authors identify the source of the non-termination problem ---there is only a finite number of rules matching a redex but a (possibly) infinite number of outcomes--- and propose a program transformation that implements backtracking in the proper order: try different reductions of arguments first, then try the different rules for each reduction. There is a _implementation_ of the lazy abstract machine (lBAM).

%T Logic Programming with Functions and Predicates: The language BABEL
%A J.J. Moreno-Navarro, M. Rodriguez-Artalejo
%I more92
%S J. Logic Programming 12(3), 1992 pp191-223, also  Tech. Rep. DIA/89/3, Universidad Complutense, Madrid 1989
%K PROLOG, first order, narrowing, rewriting, SLD resolution, operational semantics, declarative semantics
%C 

%T Efficient Lazy Narrowing using Demandedness Information
%A J.J. Moreno-Navarro et al.
%I more93
%S LNCS 714, pp167-183
%K 
%C 

%T Lambda-Calculus Models of Programming Language
%A J.H. Morris
%I morr68
%S Ph.D. Thesis, MAC-TR-57, MIT, 1968
%K 
%C 

%T Another Recursion Induction Principle
%A ?? Morris
%I morr71
%S CACM ??,1971
%K 
%C 

%T Subgoal Induction
%A J.H. Morris, Jr., B. Wegbreit
%I morr77
%S CACM 20,4, 1977
%K verification, correctness, computation induction, inductive assertions, structural induction, proof rules, completeness
%C 

%T A Time and Space Efficient Compaction Algorithm
%A F. Lockwood Morris
%I morr78a
%S CACM 21, 1978
%K garbage collection, compaction, space management, storage reclamation
%C 

%T Poplar Language Manual
%A J.H. Morris, E. Schmidt
%I morr78b
%S Xerox PARC internal memo., 1978
%K 
%C 

%T A Time- and Space-Efficient Garbage Compaction Algorithm
%A F.L. Morris
%I morr78c
%S CACM. 21,8, 1978
%K garbage collection, compacting, storage reclamation, storage allocation, record structures, relocation
%C 

%T Experience with an Applicative String Processing Language
%A J.H. Morris, E. Schmidt, P. Wadler
%I morr80a
%S Proc. 7th POPL,Las Vegas, 1980, pp32-44
%K POPLAR, laziness, pattern matching, garbage collection
%C 

%T Computing Cyclic Liststructure
%A F.L. Morris
%I morr80b
%S School of Info. and CS, Report 2-80, Syracuse Univ.
%K 
%C 

%T Real Programming in Functional Languages
%A James H. Morris
%I morr82
%S In darl82, pp129-176
%K efficiency, Poplar, text processing, pattern matching, FP style, Euclid, Pascal
%C 

%T Programming by Expression Refinement: A Series of Examples
%A J.M. Morris
%I morr90
%S Structured Computing 11, pp189-197
%K 
%C 

%T Running your continuation threads in parallel
%A J.G. Morrisett
%I morr91
%S Proceedings of the Third International Workshop on Standard ML, Pittsburgh, PA
%K 
%C 

%T Procs and Locks:  A portable multiprocessing platform for Standard ML of New Jersey
%A J.G. Morrisett, A. Tolmach
%I morr93
%S POPL 1993, San Diego, also CMU-CS-92-155, CS Carnegie Mellon University
%K 
%C 

%T Abstract Recursion as a Foundation for the Theory of Algorithms
%A Y.N. Moschovakis
%I mosc84
%S Dept. Math., Univ. Calif., Los Angeles, 1984
%K 
%C 

%T The Function of FUNCTION in LISP
%A Joel Moses
%I mose70
%S AI Memo 199, MIT AI Lab. 1970, Also SIGSAM 15, pp13-27, 1970
%K LISP, environments, closures, static versus dynamic binding, deep versus shallow binding
%C 

%T The Semantics of Semantic Equations
%A P.D. Mosses
%I moss75
%S In LNCS 28
%K mathematical semantics, MSL, semantic equations, LAMBDA, formal notation for denotational semantics
%C 

%T A Semantic Algebra for Binding Constructs
%A P. Mosses
%I moss81
%S In LNCS 107
%K semantic algebra, denotational semantics, declarations, bindings, abstract data types
%C 

%T How to Define a Language using PROLOG
%A Chris D.S. Moss
%I moss82
%S In acm82
%K metamorphosis Grammars, PROLOG, relational semantics, generation of compilers, logic programming
%C 

%T A Basic Abstract Semantic Algebra
%A P. Mosses
%I moss84
%S In LNCS 173 
%K abstract semnatic algebras, denotational semantics, meaning, correctness, FUN
%C 

%T An Algebraic Model for Divide-and-Conquer and its Parallelism
%A Z.G. Mou, P. Hudak
%I mou88
%S Journal of Supercomputing
2, pp257-278, 1988
%K fp complexity
%C 

%T A Semantic Comparison of Lisp and Scheme
%A S.S. Muchnick, U.F. Pleban
%I much80
%S In acm80, pp56-65
%K 
%C 

%T CAMEL: An Extension of the Categorical Abstract Machine to Compile Functional/Logic Programs
%A A. Mck
%I muck92
%S Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K 
%C 

%T A Mathematics of Arrays
%A L.R. Mullin
%I mull88
%S Ph.D. Thesis, Computer and Information Science and CASE Center, Syracuse Univ.
%K 
%C 

%T Extended Abstracts of the 1st German Workshop Term Rewriting: Theory and Applications
%A J. Mller, H. Ganzinger (Eds.)
%I mull89
%S SEKI Report SR-89-02, Fachbereich Informatik, Universitt Kaiserslautern, 1989
%K 
%C 

%T Abstract Interpretation in Weak Powerdomains
%A R. Muller, Y. Zhou
%I mull92
%S In acm92, pp119-126
%K 
%C 

%T Type Refinement in Ruby
%A D. Murphy
%I murp91
%S In peyt91b, pp201-217
%K 
%C 

%T GM-C: A Graph Multi-Combinator Machine
%A M.A. Musicante, R.D. Lins
%I musi91
%S Microprocessors and Microprogramming
31, 1991, 81-84
%K categorical benchmarks
%C 

%T The Theory and Practice of Transforming Call-by-need into Call-by-value
%A A. Mycroft
%I mycr80
%S In LNCS83, Proc. Int. Symp. Programming, 1980
%K abstract interpretation, strictness analysis, efficiency
%C 

%T Call-by-Need = Call-by-Value + Conditional
%A A. Mycroft
%I mycr81a
%S Report CSR--78--81, Dept. Comp. Sci., Univ. of Edinburgh, 1981
%K 
%C 

%T Abstract Interpretation and Optimising Transformations for Applicative Programs
%A Alan Mycroft
%I mycr81b
%S Doctoral Dissertation, Dept. Comp. Sci., University of Edinburgh, 1981 also CST-15-81
%K 
%C 

%T Strong Abstract Interpretation Using Power Domains
%A A. Mycroft, F. Nielson
%I mycr83
%S In LNCS 154
%K abstract interpretation, power domain, call-by-name, call-by-value
%C 

%T Polymorphic Type Schemes and Recursive Definitions
%A A. Mycroft
%I mycr84a
%S In LNCS 167
%K polymorphism, types, Milner type system extension, type assignment, type inference
%C 

%T A Polymorphic Type System for Prolog
%A A. Mycroft
%I mycr84b
%S Artificial Intelligence 23, 1984
%K 
%C 

%T A Relational Framework for Abstract Interpretation
%A Alan Mycroft,Neil D. Jones
%I mycr85
%S In LNCS 217
%K abstract interpretation, Hindley/Milner type system
%C 

%T Infinite Structures in Programming Languages
%A T.J. Myers
%I myer80
%S Ph.D. Thesis, Univ. Pennsylvania, 1980
%K 
%C 

%T AVL DAGs
%A E.W. Myers
%I myer82
%S TR 82--9, Dept. Comp. Sci., Univ. of Arizona, Tucson, 1982
%K 
%C 

%T Lisp Machines Displayed at AI Conference
%A W. Myers
%I myer82
%S Computer, 15, 11, pp79-82, 1982
%K hardware
%C A useful survey of then available machines

%T An Applicative Random-Access Stack
%A E.W. Myers
%I myer83a
%S Information Processing Letters 17,5
%K 
%C 

%T Through a Glass Darkly: Observations on Referential Translucency
%A T. Myers, A.T. Cohen
%I myer83b
%S In Parallel and Large Scale Computers: Performance, Architecture, Applications Proc. 10th IMACS World Congress on Systems Simulation and Scientific Computation, Montreal, Eds. M. Ruschitzka, et al., North Holland, 1982
%K 
%C 

%T Efficient Applicative Data Types
%A E.W. Myers
%I myer84a
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K efficiency, types, AVL dags, history trees, editor
%C 

%T Models and Transformations for Nondeterministic Extensions of Functional Programming
%A T.J. Myers, A.T. Cohen
%I myer84b
%S In LNCS 181
%K 
%C 

%T Programming with SML
%A C. Myers, C. Clack, E. Poon
%I myer92
%S Prentice Hall
%K textbook
%C 

%T A Representation of Lambda Terms Suitable for Operations on their Intensions
%A G. Nadathur, D.S. Wilson
%I nada90
%S In acm90, pp341-348
%K de Bruijn, delayed substitution
%C 

%T An Interactive Supporting System for Functional Recursive Programming
%A M. Nagata, T. Akiyama, Y. Fujikake
%I naga80
%S In IFIP '80, North Holland 1980
%K 
%C 

%T An Approach to Construction of Functional Programs
%A M. Nagata
%I naga82
%S Journal of Information Processing 5,4, 1982, pp231-238
%K 
%C 

%T Tachyon Common Lisp: An Efficient and Portable Implementation of CLtL2
%A A. Nagasaka, Y. Shintani, T. Ito
%I naga92
%S In acm92, pp270-277
%K 
%C 

%T Adding equations to NU-Prolog
%A L. Naish
%I nais91
%S LNCS 528, pp15-26, also Technical Report 91/2, Department of Computer Science, University of Melbourne
%K 
%C The paper describes an extension of NU-Prolog with lazy function
definitions (which are transformed into Prolog).

%T Infinite Normal Forms for the l-Calculus
%A R. Nakajima
%I naka75
%S In LNCS 37, pp62-82
%K 
%C 

%T Tools and Notions for Program Construction
%A D. Nel, Ed.
%I neel82
%S Cambridge University Press, 1982
%K 
%C 

%T Functional Programming Analysis
%A E. Nelson
%I nels81
%S J. Syst. Softw. 2,3, 1981
%K 
%C 

%T A Precise Relationship between the Deductive Power of Forward and Backward Strictness Analysis
%A M. Neuberger, P. Mishra
%I neub92
%S In acm92, pp127-138
%K 
%C 

%T Mathematical Structures for Software Engineering
%A B. De Neumann, D. Simpson, G. Slater, Eds
%I neum91
%S Clarendon Press, Oxford
%K 
%C 

%T Classification of Programming Languages
%A H. Ni
%I ni89
%S Internal Report, Department of Computer Science, Technical University of Denmark, Lyngby, DK, 1989
%K 
%C Draft version.
In this paper a classification is given of programming languages into functional, logic, imperative and parallel paradigms. The classification is based on a taxonomy of semantic domains used in denotational semantics of languages. It is shown that languages in different paradigms will have different kinds of semantic domains, and hence these different kinds of domain characterize kinds of programming paradigms.

%T A Denotational Framework for Data Flow Analysis
%A F. Nielson
%I niel82
%S Acta Informatica 18,3, 1982
%K 
%C 

%T Abstract Interpretation of Denotational Definitions (A Survey)
%A F. Nielson
%I niel86
%S LNCS 210, pp1-20
%K parallel
%C Abstract interpretation is a framework for describing data flow analyses and proving their correctness. The main idea is to study a denotational metalanguage with two kinds of types: one kind describes compile-time entities, the other run-time entities.

%T Transformations on Higher Order Functions
%A H.R. Nielson, F. Nilson
%I niel89
%S FPCA, Imperial College, 1989, pp129-143
%K 
%C see also niel91c

%T Program Division for a Polymorphically Typed Functional Language
%A De Niel, A., E. Bevers, De Vlaminck, K.
%I niel90
%S Report CW 11, Department of CS, KU Leuven, Belgium, 1990
%K 
%C 

%T Functional Completeness of the Mixed l-Calculus and Combinatory Logic
%A H.R. Nielson, F. Nielson
%I niel90b
%S Theoretical Computer Science
70, 1, pp99-126, 1990
%K binding
%C To obtain efficient implementations it is important to distinguish between early and late binding times, i.e. to distinguish between compile-time and run-time computations. A two-level version of the l-calculus is introduced where this distinction is made in an explicit way.

%T Context Information for Lazy Code Generation
%A H.R. Nielson, F. Nielson
%I niel90c
%S In acm90, pp251-263
%K strictness analysis
%C 

%T Program Bifurcation for a Polymorphically Typed Functional Language
%A De Niel, A., E. Bevers, De Vlaminck, K.
%I niel91
%S SIGPLAN 26, 9, 1991
%K partial evaluation
%C 

%T Partial Evaluation of Polymorphically Typed
Functional Languages: The Representation Problem
%A De Niel, A., E. Bevers, De Vlaminck, K.
%I niel91b
%S Analyse Statique en Programmation Equationelle Fonctionelle et Logique, Bordeaux, October 1991
1991, M. Billaud and others, pp90-97, IRISA, Rennes, France
%K 
%C 

%T Using Transformations in the Implementation of Higher-Order Functions
%A H.R. Nielson, F. Nielson
%I niel91c
%S JFP 1, 4, pp459-494
%K categorical combinators partial evaluation
%C 

%T Finiteness Conditions for Fixed Point Iteration
%A F. Nielson, H.R. Nielson
%I niel92
%S In acm92, pp96-108
%K static analysis, abstract interpretation, data flow analysis
%C 

%T The tensor product in Wadler's analysis of lists
%A H.R. Nielson, F. Nielson
%I niel92b
%S LNCS 582
%K 
%C 

%T Functional Databases, Functional Languages
%A Rishiyur S. Nikhil
%I nikh85a
%S In ``Persistence and Data Types'' --- Papers for the Appin Workshop, Ed. M.~Atkinson, P.~Buneman & R.~Morrison, Persistent Programming Research Report 16, Universities of St.Andrews and Glasgow, 1985
%K functional databases, database languages
%C 

%T Practical Polymorphism
%A Rishiyur S. Nikhil
%I nikh85b
%S FPCA'85, Nancy, LNCS 201, pp319-333
%K types, polymorphism, interaction, FQL
%C Straightforward addition of a polymorphic type system to languages with interactive environments can inhibit seriously the top-down, incremental programming style characteristically employed with them. Problems are described, and an integrated solution presented as prototyped in FQL.

%T Id Nouveau
%A Rishiyur S. Nikhil
%I nikh86
%S Computation Structures Group Memo 265, Lab. for Comp. Sci., MIT 1986
%K 
%C 

%T Semantics of Update in a Functional Database Programming Language
%A Rishiyur S. Nikhil
%I nikh87
%S Computation Structures Group Memo 276, Lab. Of CS, MIT, also Advances in Database Programming Languages, Edited by F. Bancilhon & P. Buneman, ACM Press, Frontier Series, 1990 being the Proceedings of Workshop held at Roscoff, France, 1987
%K 
%C 

%T Id-Nouveau (version 88.0) Reference Manual
%A R.S. Nikhil
%I nikh88
%S MIT Lab. for Computer Science, Technical Rep. March 1988
%K 
%C 

%T Functional Databases, Functional Languages
%A Rishiyur S. Nikhil
%I nikh88b
%S In Data Types and Persistence, edited by M.P. Atkinson, P. Buneman, R. Morrison, Springer-Verlag
%K 
%C 

%T The Parallel Programming Language Id and its Compilation for Parallel Machines
%A R. Nikhil
%I nikh90
%S MIT Lab. for Comp.Sci. Computation Structures Group Memo 313, July 30, 1990
%K P-RISC, message passing, optimization, data driven, fine grained parallelism, MIMD, FORTRAN
%C 

%T Id (version 90.0) Reference Manual
%A R. Nikhil
%I nikh90b
%S MIT research repoprt
%K 
%C 

%T Notes on the Origin of the Term ``List Comprehension''
%A R. Nikhil
%I nikh91
%S comp.lang.functional news group
%K 
%C revised January 1992, August 1992

%T *T: A Killer Micro for a Brave New World
%A R.S. Nikhil, G.M. Papadopoulos, Arvind
%I nikh91b
%S MIT Computation Structures Group Memo 325
%K parallelism, start, single thread, dataflow, frames, architecture, scheduling, data access, latency, message passing, Id, M88110, virtual memory, synchronisation
%C 

%T Knowledge Base Property Combinator Logic
%A J.F. Nilsson
%I nils88
%S Report ID-TR: 1988-50, 1988, Department of CS, Technical University of Denmark, Lyngby
%K higher order intensional leibniz
%C A higher-order logic geared to the exploration of properties and
relationships in a logical knowledge base is presented. The language, called LEIBNIZ, derived from Quine's predicate functors for first order logic, is distinguished by the absence of variables.

%T Type Classes and Overloading Resolution via Order-Sorted Unification
%A T. Nipkow, G. Snelting
%I nipk91
%S In acm91
%K type inference, ad hoc polymorphism, multiple inheritance, order sorted algebra, correctness, principal types
%C 

%T Type Checking Type Classes
%A T. Nipkow, C. Prehofer
%I nipk93
%S POPL '93
%K overloading, type classes, Haskell, inference, unification
%C We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement. This leads to simple type inference systems and algorithms which closely resemble those for ML. In particular we present a new unification algorithm which is an extension of syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm.

%T Strictness Analysis based on Abstract Reduction of Term Graph Rewrite Systems
%A E. Nocker
%I nock88
%S Aspens 88, [john88a], pp451-462
%K 
%C 

%T Strictness Analysis Using Abstract Reduction
%A E. Nocker
%I nock90
%S plas90
%K concurrent Clean, abstract domains, abstract reduction, pattern matching, rewriting, path analysis, evaluation transformers, annoptations for parallelism
%C 

%T Partially Strict Data Types
%A E. Nocker, S. Smetsers
%I nock90b
%S plas90
%K abstract ABC machine, coercions, recursive data types, measurement, fast Fourier transform
%C 

%T The Parallel ABC Machine
%A E. Ncker, M.J. Plasmeijer, S. Smetsers
%I nock91
%S In glas91, pp351-382
%K 
%C 

%T SASL: Implementierung einer Reduktionsmaschine und Steureung und Orginisation eines Beweissystems fr eine LogiK
%A K. Nkel
%I noke85
%S Diplomarbeit, Aachen, 1985
%K 
%C 

%T Remarks on SASL and the Verification of Functional Programming Languages
%A K. Nkel, R. Rehbold, M.M. Richter
%I noke87
%S In Computation Theory and Logic, LNCS 270, pp265-276
%K proof, SASL, Boyer-Moore prover
%C 

%T Les modles Informatiques des l-calculs
%A L. Nolin
%I noli75
%S In LNCS 37, pp166-176
%K 
%C 

%T Programming in Constructive Set Theory: Some Examples
%A B. Nordstrm
%I nord81
%S In acm81, pp141-154
%K 
%C 

%T Types and Specifications
%A B. Nordstrm, K. Petersson
%I nord83
%S IFIP '83 --- Proc. 9th World Computer Congress, Paris, Ed. R.E.A.~Mason, ISBN 0--444--86729--5, Elsevier, North Holland, 1983
%K type, inheritance, correctness, specifications, inference, dependent types, small types, type checking, propositions, Martin-Lf type schemes
%C 

%T Description of a Simple Programming Language
%A B. Nordstrm
%I nord83b
%S Programming Methodology Group, Informationsbehandling, Gteborg, 1983
%K 
%C 

%T Terminating General recursion
%A B. Nordstrm
%I nord88
%S Programming Methodology Group, Informationsbehandling, Gteborg, 1988, Report 46
%K martin lof type theory
%C This paper describes a way to allow a general recursion operator in type theory (extended with propositions).

%T A Storage Reclamation Scheme for an Applicative Multiprocessor System
%A A.K. Nori
%I nori79
%S Masters Thesis, Univ. Utah, 1979
%K 
%C 

%T Pure Programming
%A A.C. Norman
%I norm80
%S SEAS Anniversary Meeting, Hamburg, 1979
%K 
%C 

%T Faster Combinator Reduction using Stock Hardware
%A A.C. Norman
%I norm88
%S In acm88, pp235-243
%K 
%C 

%T Concurrent Garbage Collection on Stock Hardware
%A S.C. North, J.H. Reppy
%I nort87
%S LNCS 274, FPCA Portland, 1987, pp113-133
%K 
%C This paper describes the design and implementation of a memory
management system for Pegasus, a system that supports the implementation of programming environments and other interactive applications on single-user workstations.

%T An Implementation of Sets and Maps as Miranda Abstract Data Types
%A N.D. North
%I nort90
%S Report DITC 162/90
National Physical Laboratory, 1990
%K 
%C 

%T Paradigms of AI Programming
%A P. Norvig
%I norv92
%S Morgan Kaufmann
%K 
%C does automatic memoisation among other things

%T The BC-Chain Method for Representing Combinators in Linear Space
%A K. Noshita, T. Hikita
%I nosh85
%S New Generation Computing 3, 1985
%K Combinators, BC chains, normal order reduction, space complexity, linear space
%C 

%T Translation of Turner Combinators in O(n log n) Space
%A K. Noshita
%I nosh85b
%S Information Processing Letters
20 ,1985, 71-74
%K space complexity
%C 

%T Abstract Implementations and their Correctness Proofs
%A C.F. Nourani
%I nour83
%S JACM 30,2, 1983
%K verification, synthesis, equations, specifications, initial algebras, correctness, enrichment
%C 

%T Flow Analysis in Combinator Implementation of Functional Programming Languages
%A H.-G., W.R. Oberhauser
%I ober84
%S Tech. Rep. 04/1984; FB 10 --- Informatik, Univ. des Saarlandes, Saarbrucken, 1984
%K bracket abstraction
%C 

%T On the Correspondence of Lambda Style Reduction and Combinator Style Reduction
%A H-G. Oberhauser
%I ober86a
%S In LNCS 279, pp1-25
%K unifying model, tree transformation, SKI combinators
%C A fuller version with proofs is in report SFB 124-C1, 02/1986, Universitt des Saarlandes. A unifying model for lambda style reduction and combinator style reduction is presented. Both reduction types are described as tree transforming mechanisms thus avoiding as many of the usual implementation details as possible. It will be shown that there is a very strong correspondence between the two reduction mechanisms. This correspondence offers a basis for a fair comparison of the complexities of both mechanisms.

%T A Fully Lazy Lambda Style Graph Reducer
%A H-G. Oberhauser
%I ober86b
%S SFB 124-C1, O6/1986, Universitt des Saarlandes, 1986
%K 
%C A new graph reduction mechanism for l-expressions is introduced. It is based on the l-style reduces l-red and the combinator style reducer c-red as described in [Obe86]. Depending on the presence or absence of sharing it behaves like c-red or l-red respectively. Like c-red it guarantees full lazyness which is not obtained by l-red. Like l-red it transports arguments using an environment like structure whenever possible thus avoiding the tediously fine granularity of reducton steps performed by c-red. As a consequence, c-red's quadratic growth in code size is avoided.

%T Functional Interpretation of Lambda Terms
%A A. Obtulowicz, A. Wiweger
%I obtu81
%S In `Mathematical Logic in Computer Science' Colloqu. --- Colloquia Mathematica Societatis Janos Bolyai, 26, North Holland, 1981
%K 
%C 

%T Call-by-name, Assignment, and the Lambda Calculus
%A M. Odersky, D. Rabin, P. Hudak
%I oder93
%S POPL 20, Charleston, S. Carolina, pp43-57, also yale report YALEU/DCS/RR-929
%K 
%C available by anonymous ftp from
nebula.cs.yale.edu:pub/haskell/papers/popl93.whatever
Defines an extension of the call-by-name lambda calculus with additional constructs and reduction rules that represent mutable variables and assignments.  The extended calculus has neither a concept of an explicit store nor a concept of evaluation order; nevertheless, it is shown that programs in the calculus can be implemented using a single-threaded store.  Furthermore, the new calculus preserves the Church-Rosser property and is a conservative extension of classical lambda calculus with respect to operational equivalence; that is, all algebraic laws of the functional subset are preserved.

%T The Unexpurgated Call-by-name, Assignment, and the Lambda-Calculus, Revised Report
%A M. Odersky, D. Rabin
%I oder93b
%S Yale Research Report, YALEU/DCS/RR-930
%K 
%C Elaboration of oder93
available by anonymous ftp from
nebula.cs.yale.edu:pub/yale-fp/reports/RR-930.whatever
This is more up-to-date than the conference version. It's OK to
skip the details of the proofs, which go on for pages but don't really
tell you very much.
The state bibliography is in pub/yale-fp/papers/state-bib.whatever.

%T Reduction Strategies in Subtree Replacement Systems
%A M.J. O'Donnell
%I odon76
%S PhD Thesis.
Cornell University, 1976
%K 
%C 

%T Subtree Replacement Systems: A Unifying Theory for Recursive Equations
%A M. O'Donnell
%I odon77a
%S In Proc. 9th annual ACM symp. on Theory of Computing, Boulder, 1977
%K 
%C 

%T Computing in Systems Described by Equations
%A M.J. O'Donnell
%I odon77b
%S In LNCS 58
%K mathematical foundations, equations, subtree replacement systems, correctness, termination, efficiency, confluence, Church Rosser, reduction, LISP, Lucid
%C 

%T An Architecture that Efficiently Updates Associative Aggregates in Applicative Programming Languages
%A John T. O'Donnell
%I odon85a
%S FPCA'85, Nancy, LNCS 201, pp164-189
%K architecture, Associative Aggregate Machine
%C This paper solves the aggregate update problem with a two-level architecture: a microprogram maintains "associative-aggregate" data structures", and a hardware memory design implements powerful insertion, deletion and searching operations required by the microprogram.

%T Equational Logic as a Programming Language
%A M.J. O'Donnell
%I odon85b
%S MIT Press, ISBN 0--262--15028--X, 1985
%K equational programming, general, parallel or, SKD combinators
%C A good discussion on {SKD} combinators to implement parallel-or execution

%T Dialogues: A Basis for Constructing Programming Environments
%A John T. O'Donnell
%I odon85c
%S Proc ACM SIGPLAN 85 Symp on Language Issues in Programming Environments, SIGPLAN 20,7 pp17-27
%K 
%C 

%T Hardware Description with Recursion Equations
%A John O'Donnell
%I odon86
%S Indiana Univ. CS Dept., Tech. Rep. 212, 1986
%K 
%C 

%T A VLSI implementation of an architecture for applicative programming
%A J.T. O'Donnell, T. Bridges, S.W. Kitchell
%I odon87
%S International
Conference on Frontiers in Computing, Amsterdam, December 1987
%K 
%C 

%T A Method for Data-Parallel Graph Reduction
%A John T. O'Donnell
%I odon88a
%S Aspens 88, [john88a], pp413-426
%K 
%C 

%T Functional Microprogramming for a Data Parallel Architecture
%A J.T. O'Donnell
%I odon88b
%S Proc. Glasgow 1988 Wkshp. (hall89), pp124-145
%K 
%C 

%T Debugging in Applicative Languages
%A J.T. O'Donnell, C.V. Hall
%I odon88c
%S Lisp and Symbolic Computation 1,2
%K 
%C 

%T Type Inference in a Database Programming Language
%A A. Ohori, P. Buneman
%I ohor88
%S In acm88, pp174-183
%K inheritance, structures, records, subtypes, machiavelli
%C 

%T A Simple Semantics for ML Polymorphism
%A A. Ohori
%I ohor89a
%S FPCA, Imperial College, 1989, pp281-292, also MS-CIS-89-21 Department of Computer and Information Science, University of Pennsylvania
Philadelphia, PA, 1989 Logic and Computation Report 05.

%K 
%C 

%T Database Programming in Machiavelli - A Polymorphic Language with Static Type Inference
%A A. Ohori, P. Buneman, V. Breazu-Tannen
%I ohor89b
%S Proc. SIGMOD, May 1989 & CS Dept., Univ. Pennsylvania, 1989
%K multiple inheritance, type inference, relational databases, object-oriented databases, records, structures, sets, class structures
%C 

%T Representing Object Identity in a Pure Functional Language
%A A. Ohori
%I ohor90
%S LNCS 470, pp41-55, also Advances in Database Programming Languages, Edited by F. Bancilhon & P. Buneman, ACM Press, Frontier Series, 1990 being the Proceedings of Workshop held at Roscoff, France, 1987
%K 
%C 

%T Orderings and Types in Databases
%A A. Ohori
%I ohor90b
%S LNCS 470
%K 
%C 

%T PROLOG Compared with LISP?
%A R.A. O'Keefe
%I okee83
%S SIGPLAN 18,5, 1983
%K 
%C 

%T TAO: A Fast Interpreter-Centered Lisp System on Lisp Machine ELIS
%A H.G. Okuno, et al.
%I okun84
%S 1984 LISP and FP Conf., Austin, pp140-149
%K 
%C 

%T Applicative Parallelism on a Shared-Memory Multiprocessor
%A R.R. Oldehoeft, D.C. Cann
%I olde88
%S IEEE Software
5, 1, pp62-70, 1988
%K sisal benchmarks dataflow measurement
%C 

%T The SISAL 2.0 Reference Manual
%A R.R. Oldehoeft, D.C. Cann, J.T. Feo, A.P.W. Bohm
%I olde91
%S Tech. Rep. UCRL-MA-109098, Lawrence Livermore National Lab.
%K 
%C 

%T Parallel Programming in a Functional Language
%A J. Olszewski
%I olsz91
%S School of Computer Science and Engineering, University of New South Wales, Report 9101
%K 
%C This article presents functional programming as a model of parallel programming, suitable for a variety of hardware architectures, including data flow machines, systolic arrays, and networks of computing  facilities that communicate one with another. It shows that a lazy functional language with functions of higher orders may be an  appropriate tool for parallel programming. Programs written in such a language, apart from obvious - sequential - interpretation, may also, without any change of their meanings, be interpreted as parallel evaluations of the functions involved. Examples of programs for data flow machines, systolic arrays, and networks of communicating computing facilities are given in Miranda.

%T Communicating Processes in a Pure Functional Language
%A J. Olszewski
%I olsz92
%S Australian Computer Science Communications
14, 1, pp615-629, 1992
%K parallel
%C The paper presents a purely functional programming model in which communicating processes and their combinations may be defined and  implemented. The model corresponds to Hoare's theory of communicating sequential processes.

%T On a Connection Between Procedural and Applicative Languages
%A W. Olthoff
%I olth85
%S SEKI-85-05, Fachbereich Informatik, Universitt Kaiserslautern, 1985
%K 
%C Touches on proof techniques, correctness, abstract data types and denotational semantics!


%T On Function Languages and Parallel Computers
%A A.R. Omondi
%I omon91
%S Future Generation Computer Systems 6,4 355-372
%K non-determinism, term rewriting, survey, hardware design, architecture
%C 

%T Fully Abstract Models of the Lazy Lambda Calculus
%A C-H.L. Ong
%I ong88a
%S 29th Annual Symp. on Foundations of Computer Science, pp368-376, White Plains, NY, October 1988, IEEE
%K 
%C 

%T The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming
%A C-H.L. Ong
%I ong88b
%S PhD Thesis, University of London
%K 
%C 

%T Selectively Delayed Evaluation Through Program Transformation
%A K. Ono
%I ono82
%S Journal of Information Processing 5,4, 1982
%K 
%C 

%T A Userfriendly and Modular SASL Implementation
%A H. Oolman
%I oolm85
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K SASL, implentation, debugging, tracing, compiled code, error messages
%C 

%T Nested Set Languages for Functional Databases
%A L. Orman
%I orma84
%S Information Systems 9,3/4, 1984
%K 
%C 

%T Speculative Computation in Multilisp: An Overview
%A R.B. Osborne
%I osbo90
%S In acm90, 198-208
%K 
%C 

%T Parallel Functional Computation on STARDUST 
%A G. Ostheimer
%I osth91
%S In glas91, pp393-407
%K 
%C 

%T Sample
%A A.N Other
%I othe93
%S 
%K 
%C 

%T GRADE HARDWARE, a Low Cost System for use with Graph Reduction
%A R. Pack
%I pack89
%S Report YCS126
Department of CS, University of York, 1989
%K mc68000
%C A design of a 16 bit processor based single board computer, and a link board of upto eight serial lines is given with the aim of its particular application to a multiprocessor environment for graph reduction

%T Closurize and Concentrate
%A J. Padget, J.P. Fitch
%I padg85
%S Proc. 12th POPL, 1985
%K binding, shallow binding, deep binding, measurement, multiple environments, contexts, static binding, dynamic binding, garbage collection, closures
%C 

%T Desiderata for the Standardization of LISP
%A J. Padget, et al.
%I padg86
%S In acm86, pp54-66
%K 
%C 

%T Formal Specification of Programming Languages
%A F.G. Pagan
%I paga81
%S Prentice-Hall, 1981
%K 
%C 

%T A Graphical FP Language
%A F.G. Pagan
%I paga87
%S SIGPLAN 22, 3, pp21-39
%K 
%C 

%T Program Structure Charts for Applicative Languages
%A F.G. Pagan
%I paga87b
%S IEEE Transactions on Software Engineering
13, 4, pp490-492, 1987
%K 
%C 

%T If-then-else as a Concurrency Inhibitor in Eager-Beaver Evaluation of Recursive Programs
%A R.L. Page, M.G. Conant, D.H. Grit
%I page81
%S In acm81, pp179-186
%K 
%C 

%T Compiling Occam into field-programmable gate arrays
%A I. Page, W. Luk
%I page91
%S In Oxford Workshop on Field Programmable Logic and Applications, pp271-283, Moore, W. and Luk, W. eds., Abingdon EE\&CS Books
%K 
%C A paper on compiling Occam directly into hardware using a compiler written in Standard ML (specifically targetted to Field Programmable Gate Arrays - FPGAs)
See also jife93

%T Experience with a Large Scientific Application in a Functional Language
%A R.L. Page, B.D. Moe
%I page93
%S FPCA 93, pp3-11
%K fluid flow, numerical application, differential equations, Miranda, specification, performance, Amoco
%C 

%T Integrating Destructive Assignment and Lazy Evaluation in the Multiparadigm Language G-2
%A J. Placer
%I palc92
%S SIGPLAN 27, 2, pp65-74
%K streams, filters, single assignment, blocks, selection, logic, database
%C 

%T Logic Programming Implementation of Functional Programming Languages
%A A. Pan
%I pan89
%S Proc. IEEE TENCON '89, Bombay
%K 
%C 

%T Monsoon: An Explicit Token-Store Architecture
%A G.M. Papadopoulos, D.E. Culler
%I papa90
%S Proc. 17th Annual IEEE Symp. on Computer Architecture
%K dataflow
%C 

%T The Y-Combinator in Scott's Lambda-Calculus Models
%A D.M.R. Park
%I park76
%S Theory of Computation Report 13
University of Warwick, 1976
%K 
%C 

%T On the Semantics of Fair Parallelism
%A D.M.R. Park
%I park79
%S Theory of Computation Report 31, Department of Computer Science, University of Warwick
%K 
%C 

%T Presentation on Semantics of Fair Merge
%A D. Park
%I park80
%S Workshop on Applicative Languages and Parallel Computation, MIT, 1980
%K 
%C 

%T A Common Graphical Form
%A D. Parrott, C. Clack
%I parr91
%S Research Note RN/91/27, Department of Computer Science, University College, London, 1991
%K gcode cgf
%C 

%T Applicative Languages and Graphical Data Structures
%A M.S. Parsons
%I pars87
%S Ph.D. Thesis, University of Kent at Canterbury
%K graphical
%C The applicative language Miranda is used to define and manipulate
graphical data structures.

%T Transformational Program Development in a Particular Domain
%A H. Partsch
%I part86
%S Science of Computer Programming, Vol. 7, No. 2
%K 
%C 

%T Specification and transformation of programs: a
formal approach to software development
%A H.A. Partsch
%I part90
%S Texts and monographs in computer science, Springer, Berlin, ISBN 3-540-52356-1
%K 
%C 

%T Normal-Order Reduction Using Scan Primitives
%A W.D. Partain
%I part91
%S In peyt91b, pp218-226
%K tree
%C 

%T Dynamic Aspects of Distributed Graph Reduction
%A A. Partridge
%I part91
%S PhD Thesis, University of Tasmania
%K 
%C 

%T microFP: An Environment for the Multi-level Specification, Analysis, and Synthesis of Hardware Algorithms
%A D. Patel, M. Schlag, M. Ercegovac
%I pate85
%S In LNCS 201, FPCA, Nancy 1985
%K muFP, hardware, circuit design, VLSI
%C 

%T An Initial Specification of Data Structures and Functions in the St. Andrews Haskell Compiler
%A N.R. Paterson, A.J.T. Davie
%I pate92
%S St. Andrews University Department of Mathematical and Computational Sciences Research Report, CS/92/8
%K 
%C 

%T DFL: A Data Flow Language
%A L.M. Patnaik, P. Bhattacharya, R. Ganesh
%I patn84
%S Computer Languages
9, 2, pp97-106, 1984
%K 
%C 

%T A Parallel Implementation of a Functional Language
%A C. Paulsen
%I paul83a
%S Dept. Comp. Sci., Inst. of Math., Univ. of Aarhus, 1983
%K 
%C 

%T A Higher-Order Implementation of Rewriting
%A L. Paulson
%I paul83b
%S Science of Computer Programming 3,2, 1983
%K rewrite rules, LCF proof assistant, pattern matching, inferences, automatic theorem provers, higher order functions, term conversions, formula conversions, tactics
%C 

%T Annotated Bibliography on LCF
%A L. Paulson
%I paul85
%S Polymorphism --- The ML/LCF/Hope Newsletter  II,1, 1985
%K bibliography, LCF, ML, PPLAMBDA, machine assisted proof, correctness, logic
%C 

%T ML for the Working Programmer
%A L. Paulson
%I paul91
%S Cambridge University Press 1991
ISBN: 0-521-39022-2     0-521-42225-6 (pbk.)
%K 
%C includes an introduction to the modules system.  It includes examples of writing interpreters for the lambda calculus and of a tactical theorem prover.

2nd printing with corrections, 1992

%T Symposium on Partial Evaluation and Semantics-Based Program Manipulation
%A ACM
%I pepm91
%S SIGPLAN 26/9
%K 
%C 

%T Lazy I/O is not the answer
%A H. Perkins
%I perk81
%S SIGPLAN 16, 4, pp81-88
%K 
%C 

%T Scoping, Inheritance, and Frames
%A M.W. Perlin
%I perl90
%S Carnegie Mellon Report, CMU-CS-90-114
%K 
%C 

%T Fpm2
%A N. Perry
%I perr88
%S Aspens 88, [john88a], pp427-444
%K 
%C 

%T Hope+
%A N. Perry
%I perr88b
%S IC/FPR/LANG/2.5.1/7, Department of Computing, Imperial College
London, 1988
%K flagship
%C 

%T The Implementation of Practical Functional Programming Languages
%A N. Perry
%I perr91
%S Ph.D. Thesis
%K 
%C 

%T Towards a Concurrent Object/Process Oriented Functional Language
%A N. Perry
%I perr92
%S Australian Computer Science Communications 14, 1,  (= Proceedings of ACSC'15)
%K 
%C Covers the addition of coroutines, remote function calls, "objects" and concurrent execution into a FL.

%T Non Strict FPM - A High Performance Functional
	Abstract Machine
%A N. Perry
%I perr92b
%S Australian Computer Science Communications 14, 1,  (= Proceedings of ACSC'15)
%K 
%C A non-strict version of the abstract machine described in thesis and used for Hope+C. Includes a new simple "usage" analysis algorithm for strictness optimisations.

%T ?
%A N. Perry
%I perr92c
%S Australian Computer Science Communications 14, 1,  (= Proceedings of ACSC'15)
%K 
%C ASCS'15 paper covering the type system decscribed in the thesis.

%T A Switching Software Architecture Prototype Using Real Time Declarative Language
%A M. Persson, K. Odling, D. Eriksson
%I pers92
%S International Switching Symposium, Yokohama 25 - 30 October 1992
%K 
%C the authors show how they used Erlang to program a prototype PABX (Private Automatic Branch Exchange) and show that the Erlang programs were both much shorter than the programs written in their conventional languages and that they required about a tenth of the effort to produce

%T Untagged Data in Tagged Environments
%A J. Peterson
%I pete89
%S FPCA, Imperial College, 1989, pp89-99
%K 
%C The inefficiency of tag bits can be alleviated by avoiding unnecessary conversions between tagged and untagged representations. An algorithm which determines the optimal representation of an object at each program point is presented.

%T Implementing Type Classes
%A J. Peterson, M. Jones
%I pete93
%S Proc 4th Conference on Programming Language Design and Implementation, Albuquerque, SIGPLAN 28, 7, pp227-236
%K 
%C 

%T Improving Memory Utilisation in Transorming Recursive Programs
%A A. Pettorossi
%I pett78
%S In LNCS ??, 1978 (Math Found Comp. Sci. ed. Winkowski)
%K 
%C 

%T Towards a Theory of Parallelism and Communications for Increasing Efficiency in Applicative Languages
%A A. Pettorossi
%I pett80
%S In LNCS 1
%K programming methodology, concurrent computing agents, communications, compulsory communications, optional communications, efficiency, Fibonacci function, program transformations, minimal extension strategy, program annotations, helpful communications
%C 

%T An Approach to Communications and Parallelism in Applicative Languages
%A A. Pettorossi
%I pett81
%S In LNCS 107, pp432-446
%K efficiency, communications, concurrent computing agents, annotations, parallelism, Fibonacci series, promises, transformation
%C 

%T Deriving Very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique
%A A. Pettorossi, R.M. Burstall
%I pett82a
%S Acta Informatica 18, 1982
%K program transformation, recurrence relations, Fibonacci function, stepwise refinement, Eureka
%C 

%T Communicating Agents for Applicative Concurrent Processes
%A A. Pettorossi, A. Skowron
%I pett82b
%S In LNCS 137
%K communicating agents, message passing, concurrency, parallelism, HOPE, HOPE-C
%C 

%T Complete Modal Theories for Verifying Communicating Agents' Behaviour in Recursive Equations Programs
%A A. Pettorossi, A. Skowron
%I pett83
%S Report CSR--128--83, Dept. Comp. Sci., Univ. of Edinburgh, 1983
%K 
%C 

%T A Powerful Strategy for Deriving Efficient Programs by Transformation
%A A. Pettorossi
%I pett84a
%S In acm84a, pp273-281
%K recursive equation specifications
%C 

%T Methodologies for Transformations and Memoing in Applicative Languages
%A A. Pettorossi
%I pett84b
%S Ph. D. Thesis, Edinburgh University Report CST-29-84, 1984
%K memo functions, operational semantics, L, static semantics, dynamic semantics
%C 

%T Combinatory Programming
%A G.W. Petznik
%I petz70
%S PhD Thesis, University of Wisconsin
%K 
%C 

%T An Investigation of the Relative Efficiencies of Combinators and Lambda Expressions
%A Simon L. Peyton Jones
%I peyt82
%S In acm82, also M.Sc Theis University of Cambridge 1980
%K combinators, efficiency, benchmarking, optimisations
%C 

%T Notes on Functional Programming
%A S.L. Peyton Jones
%I peyt82b
%S University College
London
%K 
%C 

%T The B Epidemic, and its Treatment
%A S.L. Peyton Jones
%I peyt82c
%S Department of Computer Science, University College, London
%K combinators abstraction
%C 

%T Directions on Functional Programming Research
%A Simon L. Peyton Jones
%I peyt84a
%S INDRA Note 1575, Dept. Comp. Sci., University College, London,1984
%K general, polymorphism, typing, modules, abstract data types, transformation, correctness, evaluation strategies, parallelism, graph reduction, complexity, implementation, hardware, garbage collection, strictness analysis, bibliography
%C 

%T Arbitrary Precision Arithmetic Using Continued Fractions
%A Simon L. Peyton Jones
%I peyt84b
%S INDRA Note 1530, Dept. Comp. Sci., University College, London,1984
%K continued fractions, approximation, laziness, numerical applications, precision, arithmetic package
%C 

%T Yacc in SASL --- An Exercise in Functional Programming
%A Simon L. Peyton Jones
%I peyt85a
%S Software 15,8, 1985, pp807-820
%K parsing, YACC, SASL, style, programming, debugging, data types, abstraction, measurement, systems programming
%C 

%T GRIP --- A Parallel Graph Reduction Machine
%A Simon L. Peyton Jones
%I peyt85b
%S Internal Note 1665, Dept. Comp. Sci., University College, London,1985 --- Also in Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K GRIP, reduction, hardware, architecture, intelligent memory units
%C 

%T An Introduction to Fully-Lazy Supercombinators
%A Simon Peyton Jones
%I peyt85c
%S In cous85a, LNCS 242, pp176-208
%K graph reduction, parallel machines, free variables, CAFs, maximal free expressions
%C The purpose of this paper is to provide an accessible introduction to the techniques of supercombinators and full laziness.

%T A Brief Overview of GRIP, A Parallel Graph Reduction Machine
%A S.L. Peyton Jones, C. Clack, J. Salkild
%I peyt85d
%S Internal Note
University College, London
%K 
%C 

%T Generating Parallelism from Strictness Analysis
%A S.L. Peyton Jones
%I peyt85e
%S Internal Note 1679, Department of Computer Science, University College, London, 1985
%K 
%C The author investigates the use of strictness analysis to determine at compile time which parts of program evaluation can be carried out simultaneously. He gives a practical explanation of this technique and presents measurements of the actual parallelism produced.

%T  FLIC --- A Functional Language Intermediate Code
%A Simon L. Peyton Jones, M.S. Joy
%I peyt86a
%S SIGPLAN 23,8, 30-48 (1988), also University College, Dept. Comp. Sci., Internal Note 2048, 1986, also in peyt87b, also research note 148, Dept. of CS Univ. of Warwick, 1989, Univ. of Glasgow Dept. of CS internal note 1989
%K FLIC, Intermediate language, UNCOL, extended lambda calculus, type analysis, laziness, formal specification
%C 
REVISED 1990
FLIC is a Functional Language Intermediate Code, intended to provide a common intermediate language between diverse implementations of functional languages, including parallel ones. This paper gives a formal definition of FLIC's syntax and semantics, in the hope that its existence may encourage greater exchange of programs and benchmarks between research groups.

%T Using Futurebus in a Fifth Generation Computer
%A Simon L. Peyton Jones
%I peyt86b
%S Microprocessors and Microsystems, 10, 2, pp69-76 1986
%K hardware, GRIP, Futurebus, parallel architecture, graph reduction, Intelligent Memory Units, communications, bus, distributed networks, packet switching, synchronisation, cache consistency
%C 

%T Functional Programming Languages as a Software Engineering Tool
%A Simon L. Peyton Jones
%I peyt86c
%S In ``Software Engineering --- The Critical Decade'' ed. Ince, Peter Peregrinus, 1986 and in LNCS ??, 1987 and peyt87b
%K general, introduction, polymorphism, pattern matching, lazy evaluation, unification, abstraction, abstract data types, formal methods, transformation, abstract interpretation, parallelism, shortcomings, input output, nondeterminism, bibliography
%C 

%T Parsing Distfix Operators
%A S.L. Peyton Jones
%I peyt86d
%S CACM 29, 2, pp118-122
%K yacc lex
%C The advantages of user-defined distfix operators - a syntactic
convenience that enhances the readability of programs - can be
obtained as an extension of almost any programming language without requiring dynamic changes to the parser.

%T The Implementation of Programming Languages
%A S.L. Peyton Jones
%I peyt87a
%S Prentice-Hall, 1987
%K 
%C An excellent book. More emphasis on  implementation and not a programming book. A very good reference for compiler writing using graph reduction

%T Reduction Methods in Programming System Design and Implementation
%A Simon L. Peyton Jones, J.A. Robinson
%I peyt87b
%S Annual Open Lecture Course, Dept. Comp. Sci., St.Andrews University report CS/87/1
%K graph reduction, SUPER, parallelism, GRIP, Connection Machine, unification
%C 

%T GRIP --- A High Performance Architecture for Parallel Graph Reduction
%A Simon L. Peyton Jones, et al.
%I peyt87c
%S LNCS 274 (FPCA Portland 1987), pp98-112  --- also in peyt87b
%K architecture, hardware, firmware, supercombinator graph reduction, intelligent memory unit
%C GRIP is a high-performance parallel machine designed to execute functional programs using supercombinator graph reduction. It uses a high-bandwidth bus to provide access to a large, distributed shared memory, using intelligent memory units and packet-switching protocols.

%T GRIP - a Parallel Processor for Functional Languages
%A S.L. Peyton Jones
%I peyt87d
%S Electronics and Power
pp633-636
%K 
%C GRIP is a high-performance parallel processor, designed to execute functional languages using graph reduction. Substantial computational power is provided by 80 M68020 microprocessors and 20 microprogrammable intelligent memory units, while low-latency communication is provided by a high-bandwidth bus.

%T Converting Streams to Continuations and Vice-versa
%A S.L. Peyton Jiones
%I peyt88
%S Haskell mailing list
%K 
%C This is in AJTD's mailbox "functional"

%T The Spineless Tagless G-Machine
%A Simon Peyton Jones
%I peyt89a
%S FPCA, Imperial College, 184-201, also in [john88a] and [hall89]
%K 
%C The Spineless Tagless G-machine is an abstract machine based on graph reduction, designed as a target for compilers for non-strict functional languages.

A new version, peyt91c, is available by ftp from glasgow

%T High Performance Parallel Graph Reduction
%A S.L. Peyton Jones
%I peyt89b
%S In LNCS 365, pp193-206, Proc. PARLE '89 Parallel Architectures and Languages Europe, June 1989, Odijk E. et al (Eds), Springer Verlag
%K 
%C 

%T Parallel Implementation of Functional Programming Languages
%A S.L. Peyton Jones
%I peyt89c
%S The Computer Journal vol 32, no 2 (April 89), pp. 175-186
%K 
%C This paper is devoted to a discussion of the suitability of functional
programming languages for programming parallel machines.

%T A Futurebus Interface from Off-the-shelf Parts
%A S.L. Peyton Jones, M. Hardie
%I peyt90
%S Glasgow University functional programming group research report
%K 
%C 

%T A Modular Fully-Lazy Lambda Lifter in Haskell
%A S.L. Peyton Jones, D. Lester
%I peyt91
%S Software, 21(5), pp479-506, also Research Report CSC/90/R17, Department of CS, University of Glasgow
%K transformation
%C The authors show that full laziness can be regarded as a completely
separate process to lambda-lifting, thus making it easy to use different lambda lifters following a full laziness transformation, or to use the full-laziness transformation in compilers which do not require lambda lifting.

%T Functional Programming, Glasgow 1990
%A S.L. Peyton Jones, G. Hutton, C.K. Holst, Eds.
%I peyt91b
%S Springer Verlag, London, 1991, ISBN 3 540 19667 6
%K 
%C 

%T The Spineless Tagless G-Machine: A Second Attempt
%A S.L. Peyton Jones
%I peyt91c
%S In glas91, pp147-192
%K 
%C 

%T Unboxed Values as First Class Citizens
%A S.L. Peyton Jones, J. Launchbury
%I peyt91d
%S LNCS 523, pp636-666, FPCA
%K 
%C 

%T A Simplified Treatment of Type Class Overloading
%A S.L. Peyton Jones, P. Wadler, K. Hammond
%I peyt91e
%S Glasgow University CS report
%K ad hoc polymorphism, lattices, judgements, environments, generic operations
%C 

%T A Static Semantics for Haskell
%A S.L. Peyton Jones, P. Wadler
%I peyt91f
%S Glasgow University CS Report
%K overloading, judgements, environments, dependency analysis, kernel language, dictionaries, classes, types, declarations, instances, pattern matching
%C 

%T Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-machine
%A S.L. Peyton Jones
%I peyt92
%S JFP 2,2 pp127-202
%K 
%C 

%T Implementing Functional Languages  A Tutorial
%A S.L. Peyton Jones, D. Lester
%I peyt92b
%S Prentice Hall, ISBN 0-13-721952-0
%K 
%C 

%T UK Research in Functional Programming
%A S.L. Peyton Jones
%I peyt92c
%S SERC Bulletin 4,11, pp24-25
%K overview, resume
%C 

%T The Glasgow Haskell Compiler: A Technical Overview
%A S.L. Peyton Jones, C. Hall, K. Hammond, W. Partain
%I peyt92d
%S Proc. UK Joint Framework for Information Technology (JFIT) Technical Conference, Keele, 1993
%K 
%C also available from ftp.dcs.glasgow.ac.uk

%T Imperative Functional Programming
%A S.L. Peyton Jones, P. Wadler
%I peyt93
%S POPL '93
%K monads, input, output, I/O, mixed language working, array updates
%C We present a new (model, based on monads, for performing input/output in a non-strict, purely functional language. It is comp osable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language working and in-place array updates.

%T On the Adequacy of Dependence-Based Representations for Programs with Heaps
%A P. Pfeiffer, R.P. Selke
%I pfei91
%S LNCS 526, pp365-386
%K 
%C 

%T Partial Polymorphic Type Inference and Higher Order Unification
%A F. Pfenning
%I pfen88
%S In acm88, pp153-163
%K 
%C 

%T Metacircularity in the Polymorphic l-calculus
%A F. Pfenning, P. Lee
%I pfen89
%S Report CMU-CS-89-207, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
%K 
%C 

%T A Decision Procedure for the Subtype Relation on Intersection Types and Bounded Variables

%A B. C. Pierce
%I pier89
%S Carnegie Mellon Report, CMU-CS-89-169
%K 
%C 

%T Programming with Intersection Types and Bounded Polymorphism
%A B.C. Pierce
%I pier91
%S Ph.D. Thesis, Report CMU-CS-91-205, Carnegie Mellon University
%K 
%C 

%T Efficient Demand-Driven Evaluation. Part 1
%A K. Pingali, Arvind
%I ping85
%S TOPLAS 7,2, 1985, pp311-333
%K data driven evaluation, data flow, demand driven evaluation, demand propagation, lazy evaluation, program transformation, streams, L
%C 

%T Efficient Demand-Driven Evaluation. Part 2
%A K. Pingali, Arvind
%I ping86
%S TOPLAS 8,1, 1986, pp109-139
%K Data-driven evaluation, dataflow, lazy evaluation, transformations, streams
%C 

%T Lazy Evaluation and the Logic Variable
%A K.K. Pingali
%I ping90
%S in turn90a, Research Topics in Functional Programming, pp171-198
%K 
%C 

%T Abstract Machines in Miranda
%A J.A. Piotrowski
%I piot89
%S SIGCSE 21, 3, pp44-47
%K 
%C 

%T A Functional Model of a Simplified Sequential Machine
%A J.A. Piotrowski
%I piot90
%S Information Processing Letters
35, pp161-166
%K Miranda
%C 

%T The Revised MacLisp manual
%A K. Pitman
%I pitm83
%S Technical Report 295
MIT Laboratory for Computer Science
%K LISP
%C 

%T Demand-Driven Arithmetic
%A C.P. Pixley
%I pixl82
%S Burroughs Austin Research Center Report ARC 82--18
%K arithmetic, laziness, infinite data structures, exact representation of real numbers, referential transparency, rounding, taking limits
%C 

%T An Applicative Query language for a Binary Relational Model
%A C. Pixley, M. Scheevel
%I pixl83
%S Burroughs Austin Research Center Report , 1983
%K query languages, surrogates, sets, binary relations, SASL, binary relational database
%C 

%T An Architecture for Fast Data Movement in the FFP Machine
%A David A. Plaisted
%I plai85
%S FPCA'85, Nancy, LNCS 201, pp147-163
%K architecture, FP, FFP, storage management, parallelism, complexity, perfect shuffle
%C 

%T Implementation of Functional Languages on Parallel Architectures
%A M.J. Plasmeijer, Ed.
%I plas90
%S Proc. 2nd Internat. Workshop on Implementation of Functional Languages on Parallel Architectures, Dept. of Informatics, Faculty of Mathematics and Informatics, Univ. Nijmegen
%K general
%C 

%T Concurrent Programming in a Functional Language
%A M.J. Plasmeijer, M.C.J.D. van Eekelen
%I plas90b
%S plas90
%K parallelism, granularity, lazy communication, interleaved processes
%C 

%T The Reduction Language OREL/2
%A E. Pless, H. Schltter
%I ples91
%S Technical Report
Institute for Foundations of Information Technology, GMD, Sankt Augustin
%K 
%C 

%T Call-by-name, Call-by-value, and the lambda-Calculus
%A G.D. Plotkin
%I plot75
%S Theoretical Computer Science, 1, pp125-159
%K 
%C An excellent account of the observational equivalence theories for call-by-value and call-by-name languages.The paper explains in much more detail the relationship between the semantics of a language (the evaluator), the equational theory (beta_value for call-by-value languages and beta for call-by-name languages), and the observational equivalence theories. [comment by Amr Sabry, sabry@cs.rice.edu ]

%T A Powerdomain Construction
%A G.D. Plotkin
%I plot76
%S SIAM J. of Computing 5, 3, 1976
%K 
%C 

%T LCF Considered as a Programming Language
%A Gordon Plotkin
%I plot77
%S Theoretical Computer Science 5(3):223-256
%K 
%C 

%T A Structural Approach to Operational Semantics
%A G.D. Plotkin
%I plot81
%S Internal Report DAIMI FN--19, Dept. Comp. Sci., Aarhus University, 1981
%K 
%C 

%T Combinatoren en Lambdaformen
%A W.L. van der Poel
%I poel75
%S Verhandelingen Nederlandsche Akademie van Wetenschappen, Afdeeling Natuurkunde, 84, 10, pp172-179
%K combinatory logic lambda calculus
%C 

%T New Arithmetical Operators in the Theory of Combinators: I,II,III
%A W.L. van der Poel, C.E. Schaap, G. van der Mey
%I poel80
%S Indagationes Mathematicae
42, pp271-328
%K 
%C 

%T Are Applicative Languages Inefficient?
%A C.G. Ponder, P.C. McGeer, A.P.-C. Ng
%I pond88
%S SIGPLAN 23, 6, pp135-139
%K 
%C Here are seven problems which have been resistant to efficient reformulation in applicative languages.

%T Cache Memories in a Functional Programming Environment
%A E.K.Y. Poon, Simon L. Peyton Jones
%I poon85
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985, also Internal note 1680, CS, University College London
%K cache memory, architecture, hardware, measurement, simulation
%C Cache memories have been well studied for conventional programming environments. Functional programs give rise to a very different pattern of memory access, with far less spatial locality. This work measures the performance of a conventional cache under these conditions. Reasonable hit ratios (>90%) were found to be achievable.

%T Proposed Data Structures for QL/8n
%A S.W. Postma
%I post85
%S SIGPLAN 20, 9, pp77-85
%K lisp quadlisp trees forests
%C 

%T On the Coupling of Logic and Functional Database Languages
%A A. Poulovassilis, C. Small
%I poul90
%S Research Note RN/90/74, Department of Computer Science, University College London
%K 
%C Recent database research has addressed the design and implementation of deductive database languages which have generally been based either on the logic or the functional programming paradigm. The authors compare and contrast the expressiveness of each approach, and propose their coupling to obtain a new language called F+L which allows either paradigm to be used where it is most suited.

%T The Implementation of FDL, a Functional Database Language
%A A. Poulovassilis
%I poul90b
%S Comp. J 35, 2, 1992 also Research Note RN/90/69, Department of Computer Science, University College London
%K persistent
%C FDL improves upon previous languages with a functional data model by allowing any computable function to be defined and stored and by supporting arbitrarily nested data types which are all persistent. All functions are updated incrementally by the insertion and deletion of individual equations and an integrity sub-system verifies updates against the declared semantic integrity constraints.

%T Programming in Reduction Languages
%A M. Pozefsky
%I poze77
%S Ph.D. Thesis, Univ. N. Carolina, Chapel Hill, 1977
%K 
%C 

%T Operational and Algebraic Semantics of Facile: 
A Symmetric Integration of  Concurrent and Functional Programming
%A S. Prasad, A. Giacalone, P. Mishra
%I pras90
%S LNCS 443, pp765-780
%K 
%C 

%T Towards A Symmetric Integration of Concurrent and Functional Programming
%A S. Prasad
%I pras91
%S Ph.D. Thesis, SUNY at Stony Brook
%K 
%C 

%T A Mathematician's View of LISP
%A V.R. Pratt
%I prat79
%S Byte 4,8, 1979
%K 
%C 

%T Explicit Parallelism in LISP-like languages
%A Gianfranco Prini
%I prin80
%S In acm80
%K parallelism, concurrency, call by need, PARLAM, streams
%C 

%T HOPE+ Language Requirements
%A S. Prior
%I prio86
%S ICL Flagship Document FLAG/DD/204.001, 1986
%K HOPE+, vectors, records, subtypes, abstract data types, laziness, unification, absolute set abstraction, exceptions, modules, separate compilation, input/output, character code standards
%C 

%T Compiling Pattern Matching by Term Decomposition
%A L. Puel, A. Surez
%I puel90
%S DEC Paris Research Lab., Report 4, also in acm90, pp273-281
%K 
%C 

%T An Improved Replacement Strategy for Function Caching
%A W. Pugh
%I pugh88
%S In acm88, pp269-276
%K memo functions
%C 

%T An Open Ended Data Representation Model for EU_LISP
%A C. Queinnec, P. Cointe
%I quei88
%S In acm88, pp298-308
%K type system for lisp, classes, reflective architecture
%C 

%T Mark DURING Sweep rather than Mark THEN Sweep
%A C. Queinnec, B. Beaudoing, J-P. Queille
%I quei89
%S PARLE '89, LNCS 365/366
%K parallel garbage collection, on the fly garbage collection
%C 

%T A Concept for a Parallel G-machine
%A M. Raber, et al.
%I rabe87
%S Universitt des Saarlandes, tech. report 06/1987
%K 
%C 

%T Compiled Graph Reduction on a Processor Network
%A M. Raber, et al.
%I rabe90
%S plas90
%K parallel G-machine, communication, work distribution
%C 

%T Using Complexity Functions to Control Parallelism in Functional Programs
%A F.A. Rabhi, G.A. Manson
%I rabh90
%S Research Report CS-90-1, Department of Computer Science, University of Sheffield
%K graph reduction optimisation
%C Although evaluating a functional program in parallel is simple in theory, few practical implementations have been realised, the main problems being the excess in parallelism generated during the execution of a program. This paper discusses the problem and suggests a method based on static analysis combined with a run-time mechanism to control the exploitation of parallelism. Experiments conducted on a network of transputers are described and preliminary results are discussed.

%T Experimenting with Divide-and-Conquer
algorithms on a parallel graph reduction machine
%A F.A. Rabhi, G.A. Manson
%I rabh90b
%S In Applications of transputers 2, D.A. Pritchard and J. Scott (Eds), IOS Press, Amsterdam, 1990, pp 514-522
%K 
%C 

%T Divide-and-Conquer and Parallel Graph Reduction
%A F.A. Rabhi
%I rabh91
%S Journal of Parallel and Distributed Computing
17, pp189-205
%K transputer
%C 

%T Experiments with a Transputer-Based Parallel Graph Reduction Machine
%A F.A. Rabhi
%I rabh91b
%S Concurrency - Practice and Experience
3, 4, pp413-422, J. Wiley & Sons.
%K 
%C 

%T Run-time control of the granularity in functional programs
%A F.A. Rabhi
%I rabh92
%S proceedings of the European Workshop on Parallel Computing, Barcelona, March 1992, W. Joosen and E. Milgrom (Eds), IOS Press, 1992
%K 
%C 

%T A Parallel Structure for Static Iterative Transformation Algorithms
%A F.A. Rabhi
%I rabh92b
%S In Parallel Processing : CONPAR 92 - VAPP V, L.
Bouge et al. (Eds.), LNCS 634, Springer Verlag, pp. 755-760
%K 
%C 

%T Lazy Evaluation and Non-Determinism make Backus' FP-Systems more Practical
%A A. Radensky
%I rade87
%S SIGPLAN 22, 4, pp33-40
%K files
%C 

%T Optimization Techniques for the Compilation of Lazy Functional Languages
%A M.M. Ramaer
%I rama91
%S Doctoral Thesis, University of Twente
%K destructive updates, strictness analysis, deforestation, backward analysis, higher order functions, annotation, program transformation, proof of termination
%C 

%T Distributed versus Parallel Computing
%A A. Ramsay
%I rams86
%S Artificial Intelligence Review
1, pp11-25
%K dataflow
%C The author looks at three ways in which parallel machines may be used: for general purpose computing, for algorithms not well suited to von Neumann machines, and for exploring forms of computation which cannot reasonably be dealt with by von Neumann machines.

%T The CURRY Chip
%A J.D. Ramsdell
%I rams86
%S In acm86, pp122-131
%K 
%C 

%T The Alonzo Functional Programming Language
%A J.D. Ramsdell
%I rams89
%S SIGPLAN 24, 9
pp152-157
%K weakly typed, untyped
%C Alonzo is a programming language for specifying an output stream of characters as a function of a given input stream of characters. It is a non-strict language based on the untyped lambda-calculus, and it has been enriched by adding syntax for local bindings and mutual recursion. Primitive data and their operators have been included along with strict vectors.

%T Concurrent Programming in ML
%A N. Ramsey
%I rams90
%S Technical Report CS-TR-262-90, Department of Computer Science, Princeton University
%K parallel
%C 

%T The Global Storage Needs of a Subcomputation
%A J-C. Raoult, R.Sethi
%I raou84
%S 11th POPL, pp148-157, 1984
%K 
%C 

%T Denotational Semantics as a Specification of Code Generators
%A M.R. Raskovsky
%I rask82
%S Proc. SIGPLAN 1982 Symp. on Compiler Construction, 1982
%K 
%C 

%T The Overtyped Lambda-Calculus
%A P. Raulefs
%I raul75
%S Interner Bericht 2, Universitt Karlsruhe, Institut fr Informatik I, Karlsruhe
%K 
%C 

%T A Reduction Architecture for the Optimal Scheduling of Binary Trees
%A K. Ravikanth, P.S. Sastry, K.R. Ramakrishnan, Y.V. Venkatesh
%I ravi88
%S Future Generation Computer Systems 4, 225-233
%K 
%C 

%T Load Balancing Strategies for the Implementation of Parallel Programs
%A V.J. Rayward-Smith, F.W. Burton, R.M. Fujimoto, G.J. Janacek
%I rayw90
%S SYS-C90-01, School of Information Systems, University of East Anglia
%K 
%C 

%T Elements of Functional Programming
%A C. Reade
%I read89
%S Addison Wesley, 1989, ISBN: 0-201-12915-9
%K general, textbook, ML
%C includes an introduction to the modules system.  It also includes sections on denotational semantics, l calculus and implementation techniques.


%T LAMBDIX: Un Interprete LISP a Liaison Lexicale et Evaluation Paresseuse
%A C. Recanati
%I reca86
%S Doctoral Thesis, University of Paris-Sud, 1986
%K LAMBDIX, LISP, static binding, reflexivity, interpreters, lexical binding, laziness, lazy evaluation, implementation
%C 

%T Programming with Sequences
%A U.S. Reddy
%I redd82
%S ACM Southwest Regional Conf., 1982
%K 
%C 

%T Transformation of Logic Programs into Functional Programs
%A U.S. Reddy
%I redd84
%S Proc IEEE Internat. Symp. on Logic Programming, IEEE Computer Soc. Press, 1984, pp187-197
%K 
%C In this paper is presented a framework for transforming logic programs into functional programs based on the concept of a mode.

%T On the Relationship between Logic and Functional Languages
%A U.S. Reddy
%I redd85
%S In groo86
%K 
%C 

%T Narrowing as the Operational Semantics of Functional Languages
%A U.S. Reddy
%I redd85b
%S IEEE Symp. on Logic Programming, IEEE Computer Soc. Press, July 1985, pp138-151
%K 
%C 

%T Functional Logic Languages Part I
%A U.S. Reddy
%I redd86
%S In LNCS 279, pp401-425
%K 
%C The author presents a small formal language based on lambda calculus with existential quantification and set abstraction, and defines its denotational and narrowing semantics.

%T Objects as Closures: Abstract Semantics of Object Oriented Languages
%A U.S. Reddy
%I redd88
%S In acm88, pp289-297
%K classes, instantiation, inheritance
%C 

%T Towards Practical Functional Programming
%A H. Redelmeier
%I rede84
%S Tech. Rep. CSRG--158, Computer Systems Research Inst., Univ. Toronto, 1984
%K 
%C 

%T T: A Dialect of LISP or, Lambda: The Ultimate Software Tool
%A J.A. Rees, N.I. Adams
%I rees82
%S In acm82, pp114-122
%K scheme, LISP, static binding
%C 

%T Revised Report on the Algorithmic Language Scheme
%A J. Rees, W. Clinger
%I rees86
%S SIGPLAN 21,12, pp37-43, 1986
%K 
%C 

%T An Introduction to the ALICE Compiler Target Language
%A M. Reeve
%I reev82
%S Research report DOC 82/xx, Department of Computing, Imperial College of Science and Technology
%K 
%C This paper presents the compiler target language developed for ALICE, a general purpose parallel computer system. It shows how the language constructs relate both to aspects of the system's operation and to a high level language typical of those used to program ALICE.

%T How to Make a Lazy Functional Language Exceptional
%A A.C. Reeves, et al.
%I reev89a
%S Proc. IEEE TENCON '89, Bombay
%K 
%C 

%T Sketching a Constructive Definition of 'mix'
%A A.C. Reeves, C. Rattray
%I reev89b
%S In davi89b, pp118-132
%K 
%C 

%T Gerald: An Exceptional Lazy Functional Programming Language
%A A.C. Reeves, D.A. Harrison, A.F. Sinclair, P. Williamson
%I reev89c
%S In davi89b, pp371-390
%K 
%C 

%T SASL: Implementierung eines Abstraktionsalgorithmus und Beweisalgorithmen fr eine Logik
%A R. Rehbold
%I rehb85
%S Diplomarbeit, Aachen 1985
%K 
%C 

%T Designing Data Structures
%A A. Reid
%I reid89
%S In davi89b, pp170-181
%K Miranda
%C 

%T Associons: A Program Notation with Tuples instead of Variables
%A M. Rem
%I rem81
%S TOPLAS 3,3, pp251-262, 1981
%K 
%C 

%T Type Inference for Records in a Natural Extension of ML
%A D. Rmy
%I remy90
%S MS-CIS-90-73, Department of Computer and Information Science, University of Pennsylvania
%K 
%C An extension of ML is described with records where inheritance is given by ML generic polymorphism.

%T Projective ML
%A D. Rmy
%I remy92
%S In acm92, pp66-75
%K 
%C 

%T Synchronous Operations as First-Class Values
%A J.H. Reppy
%I repp88
%S SIGPLAN 23, 6, pp250-259
%K parallel
%C 23, 7?

%T First-class Synchronous Operations in Standard ML
%A J.H. Reppy
%I repp89
%S Department of Computer Science, Cornell University
Ithaca, NY, Technical Report TR 89-1068
%K parallel
%C 

%T Concurrent Programming with Events - The Concurrent ML Manual
%A J.H. Reppy
%I repp90
%S Department of Computer Science, Cornell University
Ithaca, NY
%K parallel
%C 

%T CML: A Higher-order Concurrent Language
%A J.H. Reppy
%I repp91
%S SIGPLAN 26, 6, pp294-305
%K parallel
%C 

%T An Operational Semantics of First-class Synchronous Operations
%A J.H. Reppy
%I repp91b
%S Department of Computer Science, Cornell University
Ithaca, NY, Technical Report TR 91-1232
%K parallel
%C 

%T Higher-order Concurrency
%A J.H. Reppy
%I repp92
%S CS, Cornell, Tech. Report 92-1285
%K 
%C 

%T NARROWER: A New Algorithm for Unification and its Application to Logic Programming
%A P. Rety, et al.
%I rety85
%S In LNCS 202
%K unification, equation rewriting, equation solving, logic programming
%C 

%T Axioms for the Theory of Lambda-Conversion
%A G. Revesz
%I reve85
%S SIAM Journal on Computing
14, 2, pp373-382
%K 
%C 

%T Lambda-Calculus, Combinators, and Functional Programming
%A G. Revesz
%I reve88
%S Cambridge University Press, 1988, ISBN 0-521-34589-8; Cambridge Tracts in Theoretical Computer Science, vol. 4.
%K 
%C 

%T Parallel Graph-Reduction with a Shared Memory Multiprocessor System
%A G. Revesz
%I reve89
%S ??
%K 
%C The author considers a tightly coupled multiprocessor system where each processor has direct access to a shared memory.

%T Automatic Computation of Data Set Definitions
%A J.C. Reynolds
%I reyn68
%S IFIP '68
%K LISP, constructors, structures, records, recursive data equations, recursive domains
%C 

%T GEDANKEN: A Simple Typeless Language which Permits Functional Data Structures and Coroutines
%A J.C. Reynolds
%I reyn69
%S ANL-7621, Argonne National Lab., 1969
%K 
%C 

%T GEDANKEN --- A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept
%A J.C. Reynolds
%I reyn70
%S CACM 13,5, 1970, pp308-319
%K GEDANKEN, higher order functions, reference, assignment, coroutines, quasi parallel processing, nondeterminism, ontology diagrams, labels as values
%C 

%T Definitional Interpreters for Higher-Order Programming Languages
%A J.C. Reynolds
%I reyn72
%S Proc. ACM Nat. Conf., pp717-740
%K higher order functions, labels as values, interpreters, order of evaluation, reflexivity, language definition, closures, continuations, references, call by value, call by name
%C 

%T Towards a Theory of Type Structure
%A J.C. Reynolds
%I reyn74a
%S In LNCS 19
%K 
%C 

%T On the Relation between Direct and Continuation Semantics
%A J.C. Reynolds
%I reyn74b
%S In Proc. 2nd Colloqu. on Automata, Languages and Programming, Ed. J. Loeckx, Gaarbrucken, 1974 (Springer ??)
%K 
%C 

%T The Essence of Algol
%A J.C. Reynolds
%I reyn81
%S In deba81, pp345-372
%K 
%C 

%T Syntactic Control of Interference, part II
%A J.C. Reynolds
%I reyn81
%S Internat. Colloq. on Automata, Languages & Programming
%K 
%C 

%T Types, Abstraction and Parametric Poymorphism
%A J.C. Reynolds
%I reyn83
%S IFIP '83 --- Proc. 9th World Computer Congress, Paris, Ed. R.E.A.~Mason, ISBN 0--444--86729--5, Elsevier, North Holland, 1983
%K types, abstraction theorem, parametric polymorphism, higher order functions, relations, user defined types
%C 

%T Polymorphism is not Set-Theoretic
%A J.C. Reynolds
%I reyn84
%S In LNCS 173
%K polymorphism, types
%C 

%T Three Approaches to Type Structure
%A J.C. Reynolds
%I reyn85
%S In LNCS 185
%K Milner's type deduction system, polymorphism, types, subtypes, generic operators, second-order typed lambda-calculus, sums, products, records, lists, inference rules, explicit typing, polymorphic let, minimal typing, universal type, explicit polymorhism, type definitions, higher order polymorhism, existential types
%C 

%T On Functors Expressible in the Polymorphic Typed Lambda Calculus
%A J.C. Reynolds, G.D. Plotkin
%I reyn90
%S Technical Report CMU-CS-90-147, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
%K category
%C 

%T The Coherence of Languages with Intersection Types
%A J.C. Reynolds
%I reyn91
%S LNCS 526, pp675-700
%K 
%C 

%T A Bibliography of Lambda-Calculi, Combinatory Logics and Related Topics
%A A. Rezus
%I rezu82
%S Mathematisch Centrum, Amsterdam, 1982
%K 
%C 

%T Management of Graph Storage in a Cellular S-K Machine
%A H. Richards
%I rich80
%S Burroughs Austin Research Center Report ARC 80--09, 1980
%K implementation, storage management, architecture, hardware, survey, garbage collection, combinator machine, distributed processing, Omni, VLSI Cellular Architecture,SASL, graph manipulation, evaluation strategies, reference counting, concurrent mark-scan
%C 

%T The Pragmatics of SASL Programming Applications
%A H. Richards
%I rich82
%S Burroughs Austin Research Center Report ARC 82--15, 1982
%K pragmatics, OMNI, applicative versus imperative, concurrency, abstraction, expressive power, intermediate output, input output, files, update, efficiency, storage demands, streams, evaluation startegies, lazy evaluation, higher order functions
%C 

%T An Overview of ARC SASL
%A H. Richards
%I rich84a
%S SIGPLAN 19,10, 1984, pp40-45
%K SASL, introduction
%C 

%T Programming in SASL
%A H. Richards
%I rich84b
%S Burroughs Austin Research Center Report ARC 84--21, 1984
%K general, SASL, programming, reference manual
%C 

%T A Simple Calendar Program in SASL
%A H. Richards
%I rich84c
%S Burroughs Austin Research Center Report , 1984
%K calendar example, application
%C 

%T A Small but Realistic Experiment in SASL Programming
%A H. Richards
%I rich84d
%S Burroughs Austin Research Center Report , 1984
%K SASL, formatting, prototyping, specification, coroutines
%C 

%T Some SASL Exercises
%A H. Richards
%I rich84e
%S Burroughs Corp., Austin Research Center, 1984
%K Fibonacci numbers, sorting, Towers of Hanoi, tabulation, permutations, prime numbers by Sieve of Eratosthenes, tautologies, eight queens problem, powersets, perfect numbers, the Hamming problem, pi, knight's tour, longest upsequence, digits of e
%C 

%T An Applicative Programming Language Bibliography
%A H. Richards
%I rich85a
%S Burroughs Austin Research Center Report , 1985
%K general, bibliography
%C 

%T An Overview of the Burroughs NORMA
%A H. Richards, Jr.
%I rich85b
%S Burroughs Austin Research Center Report , 1985 and Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K hardware, NORMA, SK graph reduction, multiprocessor machine, architecture, normal order reduction
%C This paper is intended as a brief summary of the principal technical attributes of NORMA, the Burroughs Normal Order Reduction MAchine. The purpose of Norma, which has been designed by Mark Scheevel, Gary Logsdon and their fellow workers at Burroughs's Austin Research Center, is to provide fast execution of programs written in SASL, one of the better-known applicative programming notations. It is hoped that the availability of such a machine will hasten the adoption of applicative programming both within Burroughs and in the computing community at large.

%T A Denotational Approach to the Semantics of Polymorphic Languages

%A J.G. Riecke
%I riek86
%S BA Hons Thesis, Department of CS, Williams College, 1986
%K 
%C 

%T Fully Abstract Translations between Functional Languages
%A J.G. Riecke
%I riek91
%S POPL 18, pp245-254
%K 
%C 

%T A FLAB/MLL Compiler
%A S.P. Riley
%I rile87
%S Functional Language Implementation Project Document 11. Univs. Warwick/Birmingham, CS Dept.
%K 
%C 

%T Mengentheoretische Modelle des Lambda-Kalkls
%A M. von Rimscha
%I rims80
%S Archiv fr Mathematische Logik und Grundlagenforschung 20, pp65-73
%K 
%C 

%T Using types as search keys in function libraries
%A M. Rittri
%I ritt89
%S FPCA, Imperial College, 1989, pp174-183, also J. Functional Programming 1(1), pp71-89
%K argument order, persistence, equivalence relation on types, cartesian closed categories, type operators, curry, uncurry, CCC-isomorphism, term rewriting, unification, free tyope variables, polymorphism
%C A method is proposed to search for an identifier by using its type as a key. This can be seen as an approximation of using the specification as a key

%T The Implementation of Procedurally Reflective Languages
%A J. des Rivires, B.C. Smith
%I rivi84
%S In acm84a, pp331-347
%K 
%C 

%T Hope+ on Flagship
%A I.B. Robertson
%I robe89
%S In davi89b, pp296-307
%K measurement, nfib, nqueens, benchmarks, tak, triangle, debit credit
%C 

%T A Machine-Oriented Logic Based on the Resolution Principle
%A J.A. Robinson
%I robi65
%S JACM 12,1, 1965
%K resolution, unification, automated theorem proving, Herbrand procedure, substitution, first order logic, inference, search principles
%C 

%T Programmation sans Variables ou la Logique Combinatoire  la Backus
%A B.J. Robinet
%I robi80
%S Report 80-6, Institut de Programmation, LITP, UniversitPierre et Marie Curie, Paris
%K 
%C 

%T LOGLISP: Motivation, Design and Implementation
%A J.A. Robinson, E.E. Sibert
%I robi82
%S In clar82, pp299-313
%K prolog, lisp
%C 

%T Logic Programming --- Past, Present and Future
%A J.A. Robinson
%I robi83a
%S New Generation Computing 1, 1983
%K 
%C 

%T A Proposal to Develop a ``Fifth Generation'' Programming System Based on Logic Programming, Fumctional Programming and a Highly Parallel Reduction Machine
%A J.A. Robinson
%I robi83b
%S Logic Programming Research Center, School of Computer and Information Science, Syracuse Univ., New York 13210, USA, 1983
%K LISP machine, LOGLISP, personal workstation, CADR, LAMBDA, SUPER, logic programming, reduction machine, parallelism, transformation, higher order functions, lazy evaluation
%C 

%T New Generation Knowledge Processing: Syracuse University Parallel Expression Reduction
%A J.A. Robinson
%I robi84a
%S Logic Programming Research Center, School of Computer and Information Science, Syracuse Univ., New York 13210, USA, 1984
%K SUPER, LOGLISP, parallelism, lazy normal form, set abstraction, relational definitions, binding, unification, decomposition, instantiation, higher order unification, RED2, SUM, reduction
%C 

%T Syracuse University Parallel Expression Reduction --- First Annual Report
%A J.A. Robinson
%I robi84b
%S Syracuse Univ., 1984
%K 
%C 

%T LOGLISP in Retrospect
%A J.A. Robinson
%I robi85a
%S Logic Programming Research Center, School of Computer and Information Science, Syracuse Univ., New York 13210, USA, 1985
%K LOGLISP, set abstraction, reduction, unification, relational programming
%C 

%T Beyond LOGLISP: Combining Functional and Relational Programming in a Reduction Setting
%A J.A. Robinson
%I robi85b
%S Logic Programming Research Center, School of Computer and Information Science, Syracuse Univ., New York 13210, USA, 1985
%K LOGLISP, reduction, relational programming, logic programming, quantification
%C 

%T The Future of Logic Programming
%A J.A. Robinson
%I robi86
%S IFIP '86, Paris, 1986
%K logic programming, completeness, efficiency, sets, relationship to functional programming, higher order logic, equation based reduction
%C 

%T Some Ideas on Parallel Functional Programming
%A P. Roe
%I roe89
%S In davi89b, pp338-352
%K 
%C 

%T Calculating Lenient Programs' Performance
%A P. Roe
%I roe91
%S In peyt91b, pp227-236
%K 
%C 

%T Parallel Programming Using Functional Languages
%A P. Roe
%I roe91b
%S PhD thesis, CSC 91/R3, Department of Computer Science, University of Glasgow
%K 
%C 

%T The Elements of Mathematical Logic
%A P.C. Rosenbloom
%I rose50
%S Dover, 1950
%K 
%C 

%T Tree Manipulating Systems and Church Rosser Theorems
%A B.K. Rosen
%I rose73
%S JACM ??, 1973
%K 
%C 

%T Automatic Complexity Analysis
%A M. Rosendahl
%I rose89
%S FPCA, Imperial College 1989, pp144-156
%K abstract interpretation time bounds
%C A system is described to derive time bound functions automatically
using abstract interpretation.

%T Integrating the Scheme and C Languages
%A J.R. Rose, H. Muller
%I rose92
%S In acm92, pp247-259
%K 
%C 

%T Strictness Analysis for Attribute Grammars
%A M. Rosendahl
%I rose92b
%S Proc. 4th Internat. Symp. of Programming Language Implementation and Logic Programming, Leuven, Belgium
%K 
%C 

%T Highlights in the History of the Lambda-Calculus
%A J.B. Rosser
%I ross82
%S In acm82, pp216-225
%K history
%C 

%T Implementation of a Domain Algebra and a Functional Syntax for a Relational Database System
%A T. Van Rossum
%I ross83
%S Ph.D. Thesis, School of Comp. Sci., McGill Univ., Tech. Rep. SOCS--83--18, 1983
%K relational databases, relation as a primitive type, interactive relational expression interpreter
%C 

%T HOL Formalisation of RUBY
%A L. Rossen
%I ross89
%S Report ID-TR: 1989-61, CS, Technical University of Denmark, Lyngby
%K higher order logica proof hardware description
%C In this report we look at the possibilities for formalisation and implementation of the language, into the HOL (Higher Order Logic) proof system.

%T The Generation of Concurrent Code for Declarative Languages
%A N.J. Rothwell

%I roth87
%S Report CST-44-87, CS Edinburgh, also LFCS-87-37; PhD Thesis
%K logic hybrid concurrent prolog
%C This thesis presents an approach to the implementation of declarative languages on a simple, general purpose concurrent architecture. The safe exploitation of the available concurrency is managed by a relatively sophisticated code generation techniques to transform programs into an intermediate concurrent machine code.

%T Expressing Mathematical Subroutines Constructively
%A G. Roylance
%I royl88
%S In acm88, pp8-13
%K 
%C 

%T Liar, an Algol-like Compiler for Scheme
%A G.J. Rozas
%I roza84
%S S.B. Thesis, Department  of  Electrical  Engineering andCS, MIT
%K 
%C 

%T Taming the Y operator
%A G.J. Rozas
%I roza92
%S In acm92, pp226-234
%K Liar, scheme, code generation, optimization, lambda drifting
%C 

%T Miranda System Manual
%A Research Software Ltd.
%I rsl87
%S Canterbury
1987
%K turner
%C The current version of this is 1989

%T Distributed Copying Garbage Collection
%A M. Rudalics
%I ruda86
%S In acm86, pp364-
%K 
%C 

%T Nondeterminism and Unification in LogScheme: Integrating Logic and Functional Programming
%A E. Ruf, D. Weise
%I ruf89
%S FPCA, Imperial College, 1989, pp327-339
%K 
%C 

%T Control of Parallelism in the Manchester Dataflow Machine
%A C.A. Ruggiero, J. Sargeant
%I rugg87
%S LNCS 274 (FPCA Portland 1987), pp1-15
%K data flow throttle survey
%C This paper reviews software mechanisms for parallelism control, which rely on merely planting extra code to control execution order. Such methods are found to be inadequate, so a functional architectural mechanism known as a throttle is considered necessary.

%T Retrieving Re-usable Software Components by Polymorphic Type
%A Colin Runciman, Ian Toyn
%I runc89a
%S FPCA, Imperial College, 1989, pp166-173, also in JFP 1,2, pp191-211
%K 
%C 

%T Transformation in a Non-Strict Language: An Approach to Instantiation
%A C. Runciman, M. Firth, N. Jagger
%I runc89b
%S In davi89b, pp133-141
%K 
%C 

%T What about the Natural Numbers?
%A C. Runciman
%I runc89c
%S Computer Languages, 14,3, pp181-191
%K Peano axioms, construction, natural subtraction, natural division
%C 

%T Problems and Proposals for Time and Space Profiling of Functional Programs
%A C. Runciman, D. Wakeling
%I runc90
%S In peyt91b, pp237-245
%K 
%C 

%T Transformation in a non-strict language: An approach to Instantiation
%A C. Runciman, M. Firth, N. Jagger
%I runc90b
%S Proc. Glasgow Workshop on Functional Programming, Springer Verlag, pp133-141
%K 
%C 

%T Retrieving Reusable Software Components by Polymorphic Type
%A C. Runciman, I. Toyn
%I runc91
%S JFP 1,2, pp191-211
%K 
%C 

%T Heap Profiling of Lazy Functional Programs
%A C. Runciman, D. Wakeling
%I runc92
%S Technical Report Number 172, CS York
%K 
%C We describe the design, implementation and use of a new kind of profiling tool that yields valuable information about the memory use of lazy functional programs. The tool has two parts: a modified functional language implementation which generates profiling information during the execution of programs, and a separate program which converts this information to graphical form. With the aid of profile graphs, one can make alterations to a functional program which dramatically reduce its space consumption. We demonstrate this in the case of a genuine example - the first to which the tool has been applied - for which the results are strikingly successful.

%T Heap Profiling of a Lazy Functional Compiler
%A C. Runciman & D. Wakeling
%I runc92
%S In laun92
%K 
%C 

%T An Incremental, Exploratory and Transformational Environment for Lazy Functional Programming
%A C. Runciman, I. Toyn, M. Firth
%I runc93
%S JFP 3,1, pp93-115
%K Glide, Starship, amicable pairs, search sets, library flocks, evaluation snapshots, specialisation, case analysis, tabulation, proving laws, induction, correctness
%C 

%T Experiments in Optimizing FP
%A B.G. Ryder, J.S. Prendergrast
%I ryde88
%S IEEE Transactions on Software Engineering
14, 4, pp444-454
%K coupling
%C FPOPT, a globally optimizing compiler for FP, was built to study the efficiency of compiling a functional programming language by translating it into an intermediate language and then optimizing that intermediate language. This paper describes the FPOPT system.

%T Une Extension de la Thorie des Types in Lambda-calcul
%A P. Sall
%I saal78
%S In LNCS 62
%K type deduction, lambda calculus
%C 

%T Reasoning about Programs in Continuation-Passing Style
%A A. Sabry, M. Felleisen
%I sabr92
%S In acm92, pp288-298
%K 
%C 

%T The Evaluation of Functional Programs on a Hierarchical Multicomputer
%A P. Sadayappan
%I sada83
%S Ph.D. Thesis, State Univ. of New York, Stony Brook, 1983
%K 
%C 

%T Why Functional Programming
%A C. Sadler, S. Eisenbach
%I sadl88
%S In eise87, pp9-17
%K 
%C 

%T Recursion is more Efficient than Iteration
%A E. Saint-James
%I sain84
%S In acm84a, pp228-234
%K recursion, transformation, iteration, LISP, tail-recursion
%C 

%T Concurrent Applicative Implementations of Nondeterministic Algorithms
%A R. Salter
%I salt83
%S Computer Languages 8,2, 1983
%K 
%C 

%T Pulling it Together
%A J. Samson
%I sams86
%S Datalink Magazine, May 26th, 1986
%K software engineering, software crisis, specification languages, user defined types, Miranda
%C 

%T Types in Combinatory Logic
%A L.E. Sanchis
%I sanc64
%S Notre Dame Journal of Formal Logic
5, pp161-180
%K 
%C 

%T Functionals Defined by Recursion
%A L.E. Sanchis
%I sanc67
%S Notre Dame Journal of Formal Logic
8, pp161-174
%K 
%C 

%T Reflexive Domains

%A L.E. Sanchis
%I sanc80
%S In hind80, pp339-361
%K 
%C 

%T Complexity Analysis for Lazy Higher-Order Languages
%A D. Sands
%I sand89
%S In davi89b, pp56-79
%K cost closures
%C 

%T From Z Specifications to Functional Implementations
%A P. Sanders, M. Johnson, R. Tinker
%I sand89b
%S British Telecom Technology Journal
7, 4, pp47-63
%K 
%C This paper gives an overview of research that uses functional programming technology to verify that implementations of software systems are correct with respect to their formal specifications.

%T Calculi for Time Analysis of Functional Programs
%A D. Sands
%I sand90
%S Ph.D. Thesis, Imperial College
%K 
%C 

%T Time Analysis, Cost Equivalence and Program Refinement
%A D. Sands
%I sand91
%S LNCS 560, pp25-39
%K 
%C 

%T An Evaluation of Functional programming for the Commercial Environment
%A P. Sanders
%I sand91b
%S In neum91, pp 275-291
%K maintenance, development, prototyping
%C 

%T LZW Text Compression in Haskell
%A P. Sanders, C. Runciman
%I sand92
%S In laun92
%K measurement, complexity
%C 

%T Experiments in Haskell  A Network Simulation Algorithm
%A P. Sanders
%I sand93
%S FLARE Research document, Systems Research Division, British Telecom Labs., Martlesham Heath, Ipswich IP5 7RE
%K 
%C 

%T Semantics, Implementation and Pragmatics of Clear, A Program Specification Language
%A D.T. Sannella
%I sann82
%S Ph.D. Thesis, Dept. Comp. Sci., Univ. Edinburgh, Report CST--17--82, 1982
%K specification language, CLEAR, Hope, set theoretic semantics, implementation, category theoretic semantics, LCF, theories and proving
%C 

%T A Kernel Language for Algebraic Specification and Implementation
%A D. Sannella, M. Wirsing
%I sann83
%S In LNCS 158
%K algebraic specification, ASL, signatures, term algebras, W-equivalence, semantics, parameterised specification, implementation
%C 

%T Program Specification and Development in Standard ML
%A D. Sannella, A. Tarlecki
%I sann85
%S Proc. 12th POPL, 1985
%K specification, extended ML, modules, behavioural equivalence, program development, algebra, signatures
%C 

%T Formal Specification of ML Programs
%A D.T. Sannella
%I sann86
%S Report ECS-LFCS-86-15
CS, University of Edinburgh
%K 
%C 

%T Formal program development in Extended ML for the working programmer
%A D. Sannella
%I sann89
%S LFCS Report Series  ECS-LFCS-89-102, Laboratory for Foundations of Computer Science, CS, University of Edinburgh
%K 
%C Introduces Extended ML, a language for writing (non-executable) specifications of Standard ML programs and for formally developing Standard ML programs from such specifications.


%T Toward Formal Development of ML Programs: Foundations and Methodology
%A D. Sannella, A. Tarlecki
%I sann89b
%S Report ECS-LFCS-89-71
CS, University of Edinburgh
%K sml semantics category theory
%C A formal methodology is presented for the systematic evolution of
modular Standard ML programs from specifications by means of verified refinement steps, in the framework of the Extended ML specification language.

%T Dual-Mode Garbage Collection
%A P. Sansom
%I sans91
%S In glas91, pp283-310
%K 
%C 

%T Profiling Lazy Functional Languages
%A P.M. Sansom, S.L. Peyton Jones
%I sans92
%S Glasgow University CS Dept. Working Paper
%K complexity measurement space behaviour time behaviour identifying bottlenecks spineless tagless G-machine
%C 

%T Generational Garbage Collection for Haskell
%A P.M. Sansom, S.L. Peyton Jones
%I sans93
%S FPCA '93
%K 
%C 

%T Load Balancing, Locality and Parallelism Control in
Fine-grain Parallel machines
%A J. Sargeant
%I sarg87
%S Report UMCS-86-11-5, Department of Computer Science, University of Manchester, January 1987
%K 
%C 

%T Some Experiments in Controlling the Dynamic Behaviour of Parallel Functional Programs
%A J. Sargeant, I. Watson
%I sarg91
%S In glas91, pp103-122
%K 
%C 

%T Partitioning Parallel Programs for Macro-Dataflow
%A V. Sarkar, J. Hennessey
%I sark86
%S In acm86, pp202-211
%K 
%C 

%T Partitioning and scheduling parallel programs for
multiprocessing
%A V. Sarkar
%I sark89
%S Research Monographs in Parallel and Distributed
Computing, Pitman 1989
%K 
%C 

%T PTRAN - The IBM Parallel Translation System
%A V. Sarkar
%I sark91
%S In szym91, pp309-392
%K 
%C 

%T Implementing Functional Languages on a Combinator-Based Reduction Machine
%A S.M. Sarwar, S.J. Hahn, J.A. Davis
%I sarw88
%S SIGPLAN 23,4, pp65-69
%K turner
%C The goal is to find the most heavily used combinators using Turner's method of graph reduction for a wide range of programming styles. The study shows that there are families and strings of combinators that are used frequently.

%T QUTE: A Functional Language Based on Unification
%A M. Sato, T. Sakurai
%I sato84
%S In Proc. Internat. Conf. on Fifth Generation Computing Systems, 1984, in groo86
%K parallel evaluation, unification binding, formal semantics, environments, communicatiuon, shared variables, higher order functions
%C 

%T Sequentially and Parallelly Computable Functionals
%A V.Yu. Sazonov
%I sazo75
%S LNCS 37, pp312-319
%K 
%C 

%T A Denotational Semantics of CLU
%A Scheifler
%I sche78
%S MITLCS, TR-201
%K 
%C 

%T Expression Procedures and Program Derivation
%A W.L. Scherlis
%I sche80
%S Ph.D. Thesis, Stanford Univ., Dept. Comp. Sci. Report STAN--CS--80--818, 1980
%K 
%C 

%T NORMA: A Graph Reduction Processor
%A M. Scheevel
%I sche86
%S 1986 LISP Conf.
%K 
%C 

%T Using Functional Languages for Process Specifications
%A J. Schepers
%I sche91
%S In glas91, pp89-102
%K 
%C 

%T Conception et Implementation d'un Dialecte Paresseux de Lisp
%A T. Scheix
%I schi91
%S Ph.D. Thesis, L'Universit Paul Sabatier de Toulouse
%K 
%C 

%T The Planar Topology of Functional Programs
%A M. Schlag
%I schl87
%S LNCS 274, FPCA Portland, 1987, pp174-193
%K vlsi design integrated circuit
%C The use of the applicative language (FP) in VLSI design has been
advocated ... In this paper, the level of geometric detail implied by the functional programming style is formalized.

%T Compiler Generation from Lambda Calculus Definitions of Programming Languages
%A D.A. Schmidt
%I schm80
%S Ph. D. Thesis, Kansas State Univ., Manhattan, KS, 1981
%K 
%C 

%T A System Architecture for Concurrent Evaluation of Applicative Program Expressions
%A C. Schmittgen, W. Kluge
%I schm83a
%S SIGARCH Newsletter 11,3, 1983
%K 
%C 

%T Detecting Global Variables in Denotational Specifications
%A D.A. Schmidt
%I schm83b
%S Tech. Rep., Edinburgh Univ., 1983, also TOPLAS 7, pp299-310, 1985
%K 
%C 

%T A System-Supported Workload Balancing Scheme for Cooperating Reduction Machines
%A C. Schmittgen, A. Gerdts, J. Haumann, W. Kluge, M. Woitass
%I schm85
%S Arbeitspapier der GMD 157
GMD, Sankt Augustin
%K 
%C 

%T Denotational Semantics
%A D.A. Schmidt
%I schm86
%S Allyn & Bacon, 0-205-08974-7, 1986
%K 
%C 

%T l-Calculus
%A C. Schmittgen, W. Kluge, R. Zimmer
%I schm89
%S In degr89
%K 
%C 

%T A Formal Definition of SASL for Verification Proofs
%A E.A. Schneider
%I schn84
%S Burroughs Austin Research Center Report ARC 84--04, 1984
%K ARC SASL, formal definition, denotational semantics
%C 

%T Principles of FP2: Term Algebras for Specification of Parallel Machines
%A P. Schnoebelen, P. Jorrand
%I schn89
%S In debak89
%K 
%C In FP2 ("Functional and Parallel Programming"), term rewrite rules are used to specify abstract data types and parallel processes. FP2 process specifications can be combined hierarchically, by means of operators of a process algebra, and then syntactically flattened into elementary specifications. The use of rewrite rules has several advantages, including a clean declarative semantics and a simple rewrite based interpreter, both for functions and for processes. FP2 process specifications lend themselves to formal analysis by means of a "symbolic model checking" procedure for properties expressed in a CTL-like temporal logic.

%T ber die Bausteine der Mathematischen Logik
%A M. Schnfinkel
%I sch24
%S Math. Ann. 92, 1924 pp305-316 - English Translation - ``On the Building Blocks of Mathematical Logic'' in ``From Frege to Gdel'', Ed. J. van Heijenoort, Harvard Univ. Press, 1967
%K 
%C 

%T An Efficient Machine Independent Procedure for Garbage Collection in Various List Structures
%A H. Schorr, W. Waite
%I scho67
%S CACM 10,8, pp501-506
%K garbage collection, pointer reversal, storage management
%C A method for returning registers to the free list is an essential part of any list processing system. Past solutions of the recovery problem are reviewed and compared. A new algorithm is presented which offers significant advantages of speed and storage utilization.

%T Autonet: a High-speed, Self-configuring Local Area Network Using Point-to-point Links
%A M.D. Schroeder, et al.
%I schr90
%S Digital Research Center Report 59, Palo Alto 1990
%K 
%C 

%T A Model of the Acquisition of Rule Knowledge with Visual Helps - The Operational Knowledge for a Functional, Visual Programming Language
%A O. Schroder
%I schr90b
%S LNCS 438, pp142-157
%K 
%C 

%T Parallel Functional Programming: An Annotated Bibliography
%A W. Schreiner
%I schr93
%S University of Linz
%K 
%C Cites and comments more than 350 publications on the parallel functional programming research of the last 15 years

%T The Complexity of Higher-Order Programs
%A J. Schultis
%I schu85
%S Technical Report CU-CS-288-85, CS, University of Colorado
%K semantics
%C 

%T Verifying the Safe Use of Destructive Operations in Applicative Programs
%A J. Schwarz
%I schw78
%S In 3me Colloque Internat. sur la Programmation, Dunod, Paris, 1978
%K 
%C 

%T Using Annotations to Make Recursion Equations Behave
%A J. Schwarz
%I schw82
%S IEEE Transactions on SE--8,1, pp21-33
%K 
%C 

%T Treat --- An Applicative Code Generator
%A J.S. Schwarz, D. Rubine
%I schw84
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K TREAT, PCC, ADA, code generation
%C 

%T An upper bound for reduction
sequences in typed l-calculus
%A H. Schwichtenberg
%I schw91
%S Arch. Math. Logic 30, pp405-408
%K 
%C 

%T The Lattice of Flow Diagrams
%A D. Scott
%I scot70a
%S In Symp. on the Semantics of Algorithmic Languages, Ed. E. Engeler, Springer 1971 and Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--3, 1970
%K lattices, syntax, semantics, algebra of diagrams, loops and infinite diagrams, equivalence
%C 

%T Outline of a Mathematical Theory of Computation
%A D. Scott
%I scot70b
%S Proc. 4th Annual Princeton Conf. on Information Sciences and Systems, 1970
%K 
%C 

%T Towards a Mathematical Semantics for Computer Languages
%A D.S. Scott, C. Strachey
%I scot71a
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG-6, 1971 - Also in Proc. Symp. on Computers and Automata ed. J. Fox, Polytechnic Inst. of Brooklyn Press, New York
%K mathematical semantics, denotational semantics, recursion, environments, higher order functions, fixed points, lattices, states, commands, identifiers
%C 

%T Continuous Lattices
%A D. Scott
%I scot71b
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG-7, 1971, also In LNCS 274, pp97-136
%K lattices, semantics, continuous functions, lattice embedding, function spaces
%C 

%T Mathematical Concepts in Programming Language Semantics
%A D. Scott
%I scot72
%S Proceedings of the Spring Joint Computer Conference, AFIPS Conference Proceedings 40, pp225-234
%K 
%C 

%T Lattice-Theoretic Models for Various Type-Free Calculi
%A D. Scott
%I scot73
%S Logic, Methodology and Philosophy of Science IV, Ed. P. Suppes, et al., North Holland, 1973
%K 
%C 

%T Some Philosophical Issues Concerning Theories of Combinators
%A D. Scott
%I scot75
%S LNCS 37, pp346-366
%K 
%C 

%T Combinators and Classes

%A D. Scott
%I scot75b
%S LNCS 37, pp1-26
%K 
%C 

%T Data Types as Lattices
%A D. Scott
%I scot76
%S SIAM Journal of Computing 5,3, pp522-587
%K 
%C 

%T Lectures on a Mathematical Theory of Computation
%A D. Scott
%I scot81
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG-19
%K 
%C 

%T Domains for Denotational Semantics
%A D.S. Scott
%I scot82
%S LNCS 140 pp577-613
%K 
%C 

%T On the Parallel Complexity of Functional Programs
%A H. Seidl
%I seid88
%S In john88 -- Proc. Workshop on Implementation of Lazy Functional Languages, Aspens, 1988
%K parallelism, complexity, graph reduction schemes, parallel random access machine (PRAM), parallel sorting
%C 

%T Probabilistic Load Balancing for Parallel Graph Reduction
%A H. Seidl, R. Wilhelm
%I seid89
%S Proc. IEEE TENCON '89, Bombay pp879-884, also plas90
%K graph rewriting, parallelism, probablistic implementation, PRAM, hypercube, underemployment, fine grain
%C 

%T The Cosmic Cube
%A C.L. Seitz
%I seit85
%S CACM 28,1, 1985
%K 
%C 

%T Parallel Execution of Equational Programs
%A R.C. Sekar, S. Pawagi, I.V. Ramakrishnan
%I seka89
%S Proc. IEEE TENCON '89, Bombay
%K 
%C 

%T Recent Advances in Curry's Program
%A J.P. Seldin
%I seld76
%S Rendiconti del Seminario Matematico Universita' e Politecnico Torino, 35, pp77-88
%K 
%C 

%T Curry's Program
%A J.P. Seldin
%I seld80
%S In hind80, pp3-33
%K 
%C 

%T To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism
%A J.P. Seldin, J.R. Hindley, Eds.
%I seld80b
%S Academic Press, 1980, ISBN 0-12-349050-2
%K lambda calculus, combinators, foundations, philosophy, syntax, semantics, types
%C 

%T The Structure of a Self-Applicable Partial Evaluator
%A P. Sestoft
%I sest85
%S In LNCS 217
%K Mix, compiler generator, interpreters, partial evaluation, abstract interpretation
%C 

%T Replacing Function Parameters by Global Variables
%A P. Sestoft
%I sest89
%S FPCA89, Imperial College, London, 1989, pp39-53
%K path semantics definition use grammar
%C The main contribution of this work is to introduce the concepts of definition-use path, path semantics, interference, and definition-use grammar.

%T Circular Expressions: Elimination of Static Environments
%A R. Sethi
%I seth82
%S Science of Computer Programming 1, 1982
%K 
%C 

%T Unambiguous Syntax for ML
%A R. Sethi
%I seth83a
%S Polymorphism --- The ML/LCF/Hope Newsletter 1,1, 1983
%K ML, yacc
%C 

%T Control Flow Aspects of Semantics Directed Computing
%A R. Sethi
%I seth83b
%S TOPLAS 5,4, 1983
%K 
%C 

%T Programming Languages: Concepts and Constructs
%A R. Sethi
%I seth89
%S Addison Wesley, ISBN 0 201 10365 6
%K 
%C 

%T On the Interpretation of Combinators with Weak Reduction
%A L.V. Shabunin
%I shab83
%S Journal of Symbolic Logic 48,3, 1983
%K 
%C 

%T Data Types as Objects
%A A. Shamir, W.W. Wadge
%I sham77
%S In LNCS 52
%K types, polymorphism, recursive type definitions, semantics, parameterised data types
%C 

%T Some Thoughts on Data Flow Architectures
%A J.A. Sharp
%I shar80a
%S Computer Architecture News 8,4, 1980
%K 
%C 

%T Data Oriented Program Design
%A J.A. Sharp
%I shar80b
%S SIGPLAN 15,9, 1980
%K 
%C 

%T Syntactic aspects of the non-deterministic lambda calculus
%A K. Sharmma
%I shar84
%S Master's thesis. Washington State University, September 1984.  Tech Rpt CS-84-127, Comp Sci Dept.
%K 
%C 

%T Functional Language Transformation for Parallel Computer Architectures
%A D.W.N. Sharp
%I shar90
%S PhD Thesis, Imoperial College
%K 
%C 

%T A Synthesis of a Dynamic Message-Passing Algorithm for Quicksort
%A D. Sharp, P. Harrison, J. Darlington
%I shar91
%S In glas91, pp53-74, also Department of Computer Science, Imperial College Technical Report 91-19
%K skeletons
%C 

%T An Exercise in the Synthesis of Parallel Functional Programs for Message Passing Architectures
%A D.W.N. Sharp, A.J. Field, H. Khoshnevisan
%I shar92
%S In "Parallel Computing: From Theory to Sound Practice". Proceedings of EWPC92, ed. W. Joosen and E. Milgrom, IOS Press, pp452-463
%K skeletons
%C 

%T Functional Geometry and Integrated Circuit Layout
%A Mary Sheeran
%I shee81
%S M.Sc. dissertation, Oxford University Programming Research Group, 1981
%K 
%C 

%T microFP, an Algebraic VLSI Design Language
%A Mary Sheeran
%I shee83
%S D. Phil. Thesis, Oxford University, 1983
%K 
%C 

%T muFP, a Language for VLSI Design
%A Mary Sheeran
%I shee84
%S In acm84a, pp104-112
%K muFP, VLSI, hardware design
%C 

%T Designing Regular Array Architectures using Higher Order Functions
%A Mary Sheeran
%I shee85
%S FPCA'85, Nancy, LNCS 201, pp220-237
%K hardware, VLSI, muFP, transformation, circuit design
%C In this paper the author shows how techniques from functional programming can be used in the design of regular arrays.

%T Design and Verification of Regular Synchronous Circuits
%A M. Sheeran
%I shee86
%S IEE Proceedings, 133, Pt. E, No. 5, Sept. 1986, pp295-304
%K 
%C 

%T Retiming and Slowdown in Regular Array Design
%A M. Sheeran
%I shee88
%S Proc. Glasgow 1988 Wkshp. (hall89), pp161-186
%K 
%C 

%T Relations + Higher Order Functions = Hardware Descriptions
%A M. Sheeran, G. Jones
%I shee89
%S Proc. CompEuro 89, Hamburg, May 1987, pp 303-306
%K 
%C 

%T Describing Butterfly Networks in Ruby
%A M. Sheeran
%I shee89b
%S In davi89b, pp182-105??
%K 
%C 

%T Ruby - A Language of Relations and Higher-Order Functions
%A M. Sheeran
%I shee90
%S Proc. 3rd Banff workshop on Hardware Verification, Ed. G. Birtwistle, Springer Verlag, 1990
%K 
%C 

%T Static Dependent Types for First Class Modules
%A M.A. Sheldon, D.K. Gifford
%I shel90
%S In acm90, 20-29
%K 
%C 

%T Implementing Multi-Sensor Systems in a Functional Language
%A E. Shilcrat, P. Panangaden, T. Henderson
%I shil84
%S UUCS-84-001 CS, University of Utah, Salt Lake City

%K fault tolerance demand driven evaluation eager logical data abstraction rediflow fel
%C 

%T The Functional Data Model and the Data Language DAPLEX
%A D. Shipman
%I ship79
%S In Proc. SIGMOD Int. Conf. on Management of Data, Boston, 1979, also ACM Transactions on Database Systems 6, pp140-173

%K databases, DAPLEX, data models, data definition, query languages, subtypes, supertypes, inheritance, data manipulation, updating, derived data, entities
%C 

%T Data-Flow Analysis and Type Recovery in Scheme
%A O. Shivers
%I shiv90
%S Report CMU-CS-90-115
School of CS, Carnegie Mellon University
%K lisp dataflow data flow flow analysis
%C 

%T Type Checking in Exp: An Algebraic Approach
%A J. Shultis
%I shul82
%S CS/E--82--03, Oregon Graduate Center, 1982
%K 
%C 

%T A Functional Shell
%A J. Shultis
%I shul83
%S Proc. ACM SIGPLAN '83 Symp. on Programming Language Issues in Software Systems, 1983
%K 
%C 

%T COBWEB: A Combinator Reduction Architecture
%A M.J. Shute, P.E. Osmon, C.L. Hankin
%I shut85
%S FPCA'85, Nancy, LNCS 201, pp99-112
%K 
%C This paper describes the first machine in a family called COBWEB. The common denominator of the family is that all of the machines are targetted to supporting functional languages and all execute some form of combinator code.

%T Set Abstraction in Functional and Logic Programming
%A F.S.K. Silbermann, B. Jayaraman
%I silb89
%S FPCA, Imperial College, 1989, pp313-326
%K angelic demonic powerdomains
%C 

%T A Domain-theoretic Approach to Functional and Logic Programming
%A F.S.K. Silbermann, B. Jayaraman
%I silb92
%S JFP 2,3, pp273-321
%K set abstraction, ZF notation, combining/integrating Horn logic and functional programming
%C This describes the language PowerFuL (POWERdomains for FUnctional and Logic programming).  This language does not rely on difficult-to-implement features like higher-order unification or general narrowing, yet eliminates inelegant first-order restrictions.

%T Sets as a Basic Data Type in a Functional Language
%A M.J. Simcox
%I simc91
%S CS, Warwick
%K sasl
%C A description of the examination and implementation of sets in SASL. This was originally a third-year undergraduate project.

%T Solid Modelling in Haskell
%A D.C. Sinclair
%I sinc91
%S In peyt91b, pp246-263
%K 
%C 

%T Implementation of a Non-Standard Interpretation System
%A S. Singh
%I sing89
%S In davi89b, pp206-224
%K 
%C 

%T Differentiating Strictness
%A S. Singh
%I sing91
%S In peyt91b, pp264-267
%K 
%C 

%T Calculating Properties of Programs by Valuations on Specific Models
%A M. Sintzoff
%I sint72
%S Proc. ACM Conf on Proving Assertions about Programs, SIGPLAN 7,1 and SIGACT 14 pp203-207, 1972
%K 
%C 

%T Reasoning with Continuations II: Full Abstraction for Models of Control
%A D. Sitaram, M. Felleisen
%I sita90
%S In acm90, 161-175
%K 
%C 

%T Data Flow Graph Optimization in IF1
%A S.K. Skedzielewski, M.L. Welcome
%I sked85
%S In LLNCS 201, FPCA Nancy 1985
%K dataflow, optimisation
%C 

%T A Simple Method to Remove Reference Counting in Applicative Programs
%A S.K. Skedzielewski, R.J. Simpson
%I sked88
%S Report UCRL-100156, Lawrence Livermore National Laboratory, University of California, Davis, CA
%K 
%C The efficient compilation of applicative languages that contain data
structures such as arrays and records may require that the compiler uses a dynamic memory allocator for structured objects. If so, the overhead of reference counting is considerable, if a compiler simply add code for reference counting to each operation that references an object. This paper discusses the use of data dependence information to statically remove reference counting operations.

%T Sisal
%A S.K. Skedzielewski
%I sked91
%S In szym91, pp105-158
%K 
%C Sisal is a functional language runs under unix environment. It is available by anonymous ftp from sisal.llnl.gov

%T Parallel Parsing on the Connection Machine
%A D.B. Skillicorn, D.T. Barnard
%I skil88
%S Technical Report TR 88-209, Department of Computing and Information Science, Queen's University, Kingston, Ontario
%K 
%C It is shown that languages generated by LL(1) grammars can be parsed in logarithmic time on the Connection Machine, but that languages generated by LR grammars cannot

%T Architecture-Independent Parallel Computation
%A D.B. Skillicorn
%I skil90
%S Computer 23, 12, pp38--51
%K skeletons
%C 

%T Deriving Parallel Programs from Specifications Using Cost Information
%A D.B. Skillicorn
%I skil91
%S Department of Computing and Information Science, Queen's University, Kingston  TR 91-316
%K skeletons
%C 

%T A Cost Calculus for Parallel Functional Programming
%A D.B. Skillicorn, W. Cai
%I skil92
%S Department of Computing and Information Science, Queen's University, Kingston TR 92-329
%K skeletons
%C 

%T Applicative Languages, Dataflow and Pure Combinatory Code
%A R. Sleep
%I slee80a
%S Proc. `Compton 80' (IEEE) San Fransisco, pp112-115
%K sasl
%C 

%T Instruction Sets for Dataflow Architectures
%A M.R. Sleep
%I slee80b
%S Report CS/80/017/E, School of Computer Studies and Accountancy, Univ. of East Anglia, 1980
%K 
%C 

%T Towards a Zero-Assignment Parallel Processor
%A M.R. Sleep, F.W. Burton
%I slee81
%S 2nd International Conference on Distributed Computer Systems, Paris, IEEE
%K 
%C 

%T A Short Note Concerning Lazy Reduction Rules and APPEND
%A R. Sleep, S. Holmstrom
%I slee82
%S Software 12,11, 1982
%K laziness, append complexity, reduction rules, redundant information, laws
%C 

%T Guaranteeing Safe Destructive Updates through a Type System with Uniqueness Information for Graphs
%A J.E.W. Smetsers, et al
%I smet91
%S Report No.93-04, June 1993. Research Institute for Declarative Systems, Department of Informatics, Faculty of Mathematics and Informatics, University of Nijmegen
%K 
%C 

%T The Identification of Propositions and Types in Martin-Lf's Type-Theory, A Programming Example
%A J. Smith
%I smit83
%S In LNCS 158
%K constructive type theory, intuitionistic type theory, primitive recursion, course of values recursion
%C 

%T Logic Programming on an FFP Machine
%A B. Smith
%I smit84a
%S Symp. on Logic Programming pp177-186, Atlantic City, IEEE Computer Society Press, ISBN 0-8186-0522-7.

%K parallel
%C This paper describes a style of logic programming interpreter for the parallel computer being developed by Mago at UNC.

%T Reflection and Semantics in LISP
%A B.C. Smith
%I smit84b
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K reflexivity, self reference, LISP, procedural reflection, semantics
%C 

%T The Apparent Link Between Typability and Computational Complexity in l-Calculus
%A S. Smith
%I smit87
%S undergrad. thesis, Mathematics Department, Princeton University, 1987
%K 
%C 

%T An introduction to Scheme
%A J.D. Smith
%I smit88
%S Prentice Hall, ISBN 0 13 496712 7, 40.65
%K 
%C 

%T Overloading and Bounded Polymorphism
%A G.S. Smith
%I smit89
%S TR 89-1054, DCS, Cornell University, Nov. 1989
%K 
%C 

%T Using Applicative Techniques to Design Distributed Systems
%A S.W. Smoliar
%I smol79
%S Proc. IEEE Conf. on Specifications of Reliable Software, New York, pp150-161
%K 
%C 

%T Making Control and Data Flow in Logic Programs Explicit
%A G. Smolka
%I smol84
%S In acm84a, pp311-322
%K 
%C 

%T Lazy Debugging of Lazy Functional Programs
%A R.M. Snyder
%I snyd90
%S New Generation Computing 8, pp139-161
%K 
%C 

%T Implementing the G-Machine
%A P.G. Soares, R.D. Lins
%I soar89
%S Report No. 66
Computing Laboratory, University of kent
%K compilation
%C The performance is analysed in time and space of the original G-Machine and each optimisation step. These optimisation techniques can be adapted to other lazy functional machines.

%T Applicative High Order Programming: The Standard ML perspective
%A S. Sokolowski
%I soko91
%S Chapman & Hall 1991, 19.95
ISBN: 0-412-39240-2     0-442-30838-8 (USA)
%K 
%C 

%T Type Definitions with Parameters
%A M. Solomon
%I solo78
%S Proc. 5th POPL, Tucson, 1978
%K parametric types, type equivalence, regular types, context free types
%C 

%T A Primitive Autoprojector for a Simple Applicative Language
%A H. Sndergaard
%I sond84
%S Report 84-2-4, DIKU, University of Copenhagen
%K 
%C This report is about work towards that presented in [Jone85].
An analysis of the problems involved in partial evaluation is carried out, a one-phase self-applicable partial evaluator is presented, and the results are critically reviewed. Problems to be solved by future work are outlined.

%T Nondeterminism in Functional languages
%A H. Sndergaard, P. Sestoft
%I sond88
%S Tech. Rep. 88/18, Dept. Comp. Sci. Univ. Melbourne, 1988
%K 
%C The introduction of a nondeterministic operator in even a very simple functional programming language gives rise to a plethora of semantic questions. These questions are not only concerned with the choice operator itself. A surprisingly large number of different parameter passing mechanisms are made possible by the introduction of bounded nondeterminism. The diversity of semantic possibilities is examined systematically using denotational definitions based on mathematical structures called powerdomains. This results in an improved understanding of the different kinds of nondeterminism and the properties of different kinds of nondeterministic languages.

%T Referential Transparency, Definiteness and Unfoldability

%A H. Sndergaard
%I sond90
%S Acta Informatica, 27, pp505-517
%K nondeterminism, determinism
%C 

%T Non-Determinism in Functional Languages
%A H. Sndergaard, P. Sestoft
%I sond92
%S Computer J., 35,5, pp514-523 also Technical Report 88/18, CS, University of Melbourne
%K 
%C To appear

%T Entwurf und Test eines Schaltkreises fr das Pattern-Matching
%A U. Sparmann
%I spar86
%S Report 12/1986, Fachbereich 10, Universitt des Saarlandes, Saarbrcken
%K 
%C 

%T The Simplest Functional Programming Language
%A D. Spector
%I spec83
%S SIGPLAN 18,1, pp42-46
%K 
%C 

%T Imperative versus Functional
%A R. Stansifer
%I stan90
%S SIGPLAN 25, 4, pp69-72
%K benchmarking, measurement
%C The author reports the results of running some bench marks comparing functional programming languages with imperative languages. Familiar bench marks were run in the languages ML, T, C and Pascal.

%T ML Primer
%A R. Stansifer
%I stan92
%S Prentice Hall
%K 
%C 

%T Combinator Realizability of a Constructive Morse Set Theory
%A J. Staples
%I stap74
%S Journal of Symbolic Logic
39, pp226-234
%K 
%C 

%T Church-Rosser Theorems for Replacement Systems
%A J. Staples
%I stap75
%S LN in Mathematics 450, pp291-307
%K 
%C 

%T A Class of Replacement Systems with Simple Optimality Theory
%A J. Staples
%I stap77
%S Bulletin of the Australian Mathematical Society
17, pp335-350
%K 
%C 

%T Optimal Reduction in Replacement Systems
%A J. Staples
%I stap77b
%S Bulletin of the Australian Mathematical Society
16, pp341-349
%K 
%C 

%T A Graph-Like Lambda-Calculus for which Leftmost-Outermost Reduction is Optimal
%A J. Staples
%I stap79
%S LNCS 73, pp440-455
%K 
%C 

%T A Lambda Calculus with Nave Substitution
%A J. Staples
%I stap79b
%S Journal of the Australian Mathematical Society
28, pp269-282
%K 
%C 

%T Computation on Graph-Like Expressions
%A J. Staples
%I stap80a
%S Theoretical Computer Science 10, 2, pp171-185
%K sharing, subcommutativity, optimal evaluation, expression graphs
%C 

%T Optimal Evaluation of Graph-Like Expressions
%A J. Staples
%I stap80b
%S Theoretical Computer Science 10,3, pp297-310
%K sharing, subcommutativity, optimal evaluation, expression graphs, node stability, optimal algorithm
%C 

%T Speeding up Subtree Replacement Systems
%A J. Staples
%I stap80c
%S Theoretical Computer Science 11,1, pp39-47
%K sharing, subcommutativity, optimal evaluation, expression graphs, composition of coverings
%C 

%T A New Technique for Analysing Parameter Passing Applied to the Lambda Calculus
%A J. Staples
%I stap81a
%S Proc. 4th Australian Computer Conf., St.Lucia, 1981
%K 
%C 

%T Efficient Combinatory Reduction
%A J. Staples
%I stap81b
%S Z. Math. Logik Grundl. Math. 27,5, pp391-402
%K 
%C 

%T Unification of Quantified Terms
%A J. Staples, P.J. Robinson
%I stap86
%S In LNCS 279, pp426-450
%K 
%C This paper describes and proves correct a unification algorithm for quantified terms.

%T Delaying Unification Algorithms for Lambda Calculi
%A J. Staples
%I stap86b
%S Technical Report No. 75, CS, University of Queensland, St. Lucia
%K 
%C Huet proposed delaying some unifications of typed lambda terms, as part of a higher order resolution method. This paper abstracts that idea from the resolution context. Unification delays are formalised independently of any context, by defining a lambda calculus where a unification constraint forms an integral part of each term. This calculus is shown to support an unusually simple unification theory, where most general unifiers trivially always exist. Attention shifts from the existence of unifiers to the simplification of expressions for most general unifiers. The approach is convenient for discussing the unification of untyped lambda terms and has promise for managing the discussion of schematic unification of term schemes.

%T LISP, Lore, and Logic: An Algebraic View of LISP Programming, Foundations, and Applications
%A R. Stark
%I star90
%S Springer-Verlag
%K 
%C 

%T Formal Language Description Languages for Computer Programming
%A T.B. Steel, Jr.
%I stee71
%S North Holland, 1971
%K 
%C 

%T Scheme: An Interpreter for the Extended Lambda Calculus
%A G.L. Steele, G.J. Sussman
%I stee75
%S Memo 349
MIT Artificial Intelligence Laboratory
%K 
%C 

%T LAMBDA: The Ultimate Imperative
%A G.L. Steele, Jr.
%I stee76a
%S AI TR 353, MIT AI Lab
%K recursion, iteration, SCHEME, goto, assignment, continuations, escape mechanisms, fluid variables, call by name, call by need, call by reference
%C 

%T LAMBDA: The Ultimate Declarative
%A G.L. Steele, Jr.
%I stee76b
%S AI TR 379, MIT AI Lab
%K SCHEME, environments, optimization, types, control structures, binding, identification, scoping, function invocation, continuations, actors
%C 

%T Debunking the `Expensive Procedure Call' Myth or Procedure Call Implementations Considered Harmful or, LAMBDA: The Ultimate GOTO
%A G.L. Steele, Jr.
%I stee77a
%S AI TR 443, MIT AI Lab - also ACM Conference proceedings 1977 pp153-162
%K tail recursion, LISP, optimisation
%C 

%T RABBIT: A Compiler for SCHEME (A Study in Compiler Optimization)
%A G.L. Steele, Jr.
%I stee77b
%S AI TR 474, MIT AI Lab
%K 
%C The author has developed a compiler for the lexically-scoped dialect of LISP known as SCHEME.

%T Macaroni is Better than Spaghetti
%A G.L. Steele
%I stee77c
%S SIGPLAN 12,8 pp60-66
%K multiple environments, cactus stack, static scoping, dynamic scoping, funarg problem, frames, coroutines
%C 

%T The Revised Report on SCHEME, a dialect of LISP
%A G.L. Steele, G.J. Sussman
%I stee78a
%S MIT Tech. Rep. AI 452, Jan. 1978
%K LISP, SCHEME, static scoping
%C 

%T The Art of the Interpreter, or the Modularity Complex
%A G.L. Steele, G.J. Sussman
%I stee78b
%S MIT Tech. Rep. AI 453
%K LISP, SCHEME
%C 

%T Compiler Optimization based on viewing LAMBDA as rename plus GOTO
%A G.L. Steele, Jr.
%I stee79
%S In Artificial Intelligence: an MIT Perspective, 2, MIT press, 1979. Another ref. gives: in AI: An MIT Perspective, Patrick Henry Winston and Richard  Henry  Brown  (ed.),  MIT  Press, Cambridge, Mass., 1980
%K 
%C 

%T Definition of Functionals
%A J. Steensgard-Madsen
%I stee79
%S Symposium on Functional Languages and Computer Architecture, Laboratory for Programming Methodology, Chalmers University of Technology, Gteborg
%K 
%C 

%T Design of a LISP Based Microprocessor
%A G.L. Steele, G.J. Sussman
%I stee80
%S CACM 23,11, pp628-645
%K 
%C 

%T The Dream of a Lifetime: a Lazy Variable Extent Mechanism
%A G.L. Steele, G.J. Sussman
%I stee80b
%S In acm80, pp163-172
%K 
%C 

%T An Overview of Common LISP
%A Guy L. Steele Jr.
%I stee82a
%S In acm82, pp98-107
%K LISP, general, static binding, lexical scoping, survey
%C 

%T ORBIT: An Applicative View of Object Oriented Programming
%A L. Steels
%I stee82b
%S In ``Integrated Interactive Computing Systems'' --- Proc. European ECICS 82 Conf., Stresa, 1982, Eds. P. Degano, E. Sandwall, ISBN 0--444--86595--0, Elsevier, 1983
%K 
%C 

%T Common LISP: The Language
%A Guy L. Steele Jr.
%I stee84
%S Digital Press, Burlington Mass., 1984
%K 
%C 

%T LISP on a Reduced-Instruction-Set-Processor
%A P. Steenkiste, J. Hennessy
%I stee86a
%S In acm86, pp192-201
%K 
%C 

%T Connection Machine LISP: Fine Grained Parallel Symbolic Programming
%A G.L. Steele, W.D. Hillis
%I stee86b
%S In acm86, pp279-297
%K 
%C 

%T Parameter Splitting in a Higher Order Functional Language
%A B. Steensgaard, M. Marquard
%I stee90
%S ??
%K 
%C Taken from Joy's bibliography

%T How to Print Floating-Point Numbers Accurately
%A G. L. Steele, J.L. White
%I stee90
%S pp112-123, SIGPLAN 25,6 - '90 Conference on Programming Language Design and Implementation
%K decimal conversion
%C 

%T DIALISP - A LISP Machine
%A G. Stefan, et al.
%I stef84
%S 1984 LISP and FP Conf., Austin, pp123-128
%K 
%C 

%T Relfun/X: An Experimental Prolog Implementation of Relfun
%A W. Stein, M. Sintek
%I stei91
%S Document D-91-01
DFKI, Kaiserslautern
%K 
%C 

%T A Note on Leftmost-Innermost Term Reduction
%A M.E. Stickel
%I stic83
%S SIGSAM 17,3/4, 1983
%K 
%C 

%T LISP based Symbolic Math Systems
%A D.R. Stoutemyer
%I stou79
%S Byte 4,8, 1979
%K 
%C 

%T Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
%A J.E. Stoy
%I stoy77
%S MIT Press, Cambridge, Massachusetts, 1977
%K 
%C 

%T The Congruence of Two Programming Languyage Definitions
%A J.E. Stoy
%I stoy81
%S Theoretical Computer Science 13,2, 1981
%K 
%C 

%T Some Mathematical Aspects of Functional Programming
%A Joseph Stoy
%I stoy82
%S In darl82, p217-252
%K semantics, fixed points, self application, infinitary objects, neighbourhood systems, interpreters, correctness
%C 

%T The SKIM II Microprogrammer's Guide
%A W.R. Stoye
%I stoy83
%S Cambridge University Computer Lab. Technical Note, 1983
%K 
%C 

%T A New Scheme for Writing Functional Operating Systems
%A W.R. Stoye
%I stoy84a
%S Cambridge University Comp. Lab. Tech. Rep. 56
%K 
%C 

%T Some Practical Methods for Rapid Combinator Reduction
%A W.R. Stoye, T.J.W. Clarke, A.C. Norman
%I stoy84b
%S In acm84a, pp159-166
%K SKIM II, recursion elimination, transformation, reference counts, reduction, combinators, equality, microcode
%C 

%T Early LISP History (1956 -- 1959)
%A H. Stoyan
%I stoy84c
%S In acm84a, pp299-310
%K 
%C 

%T The Implementation of Functional Languages Using Custom Hardware
%A W.R. Stoye
%I stoy85a
%S Ph.D. Thesis, Tech. Rep. 81, Computer Lab., Univ. Cambridge, 1985
%K SKIM combinators optimisation microcode director
strings Miranda ponder
%C 

%T Director Strings in SKIM
%A W.R. Stoye
%I stoy85b
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K director strings, optimization, combinator graph reduction, SKIM, reference counts, D combinator
%C 

%T A New Scheme for Writing Functional Operating Systems
%A W. Stoye
%I stoy85c
%S Technical Report No. 56
University of Cambridge Computer Laboratory
%K nondeterminism parallel skim sasl
%C A scheme is described for writing nondeterministic programs in a functional language. The scheme is based on message passing between a number of expressions being evaluated in parallel.

%T Message-based functional operating systems
%A W. Stoye
%I stoy86
%S Science of Computer Programming 6(3), pp291-311
%K 
%C 

%T Towards a Formal Semantics
%A C. Strachey
%I stra66
%S In stee71
%K 
%C 

%T CPL Reference Manual
%A C. Strachey
%I stra66
%S Technical Report
Programming Research Group, Oxford University
%K 
%C 

%T Fundamental Concepts in Programming Languages
%A C. Strachey
%I stra67
%S NATO Summer School in Programming, Copenhagen, 1967
%K assignment, functions, routines, values, general, languages, first class citizenship for functions, higher order functions, types, polymorphism, compound data structures
%C 

%T The Varieties of Programming Language
%A C. Strachey
%I stra73
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--10, 1973
%K types, taxonomy of languages, domain structures
%C 

%T Continuations: A Mathematical Semantics Which Can Deal With Full Jumps
%A C. Strachey, C. Wadsworth
%I stra74
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--11, 1974
%K 
%C 

%T Maintaining the Illusion of a Functional Language in the Presence of Side Effects
%A H.E. Sturgis
%I stur88
%S Report CSL-88-2
Xerox Corporation, PARC, Palo Alto, CA
%K 
%C 

%T Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logic Programs
%A P.A. Subrahmanyam, J.-H. You
%I subr84
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K logic programming, semantic unification, infinite data structures
%C 

%T Conceptual Basis and Evaluation Strategies for Integrating Functional and Logic Programming
%A P.A. Subrahmanyam, J.-H. You
%I subr84b
%S In Proceedings of the International Symposium on Logic Programming, Atlantic City, NJ, pp144-153, IEEE Computer Society Press, ISBN 0-8186-0522-7.
%K funlog semantic unification lazy evaluation parallel
%C Sequential and parallel evaluation strategies are described. The notion of semantic unification is discussed and its implementation sketched.

%T FUNLOG: A Computational Model Integrating Logic Programming and Functional Programming
%A P.A. Subrahmanyam, J.-H. You
%I subr86
%S In degr86 -- "Logic Programming: Functions, Relations and Equations" DeGroot, D. & Lindstrom, G. (eds), Prentice Hall 1986
%K pattern driven reduction, reduction by need, semantic unification, E-unification, interpreter, parallel execution startegies
%C 

%T Specification of a Display Editor
%A B.A. Sufrin
%I sufr81
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--21, 1981
%K 
%C 

%T Reading Formal Specifications
%A B.A. Sufrin
%I sufr83
%S Oxford University Computing Laboratory, Programming Research Group, Monograph PRG--24, 1983
%K 
%C 

%T A Methodology for LISP Program Construction from Examples
%A P.D. Summers
%I summ76
%S 3rd POPL, pp68-75
%K 
%C 

%T SCHEME: An Interpreter for Extended Lambda Calculus
%A Gerald Jay Sussman, G.L. Steele, Jr.
%I suss75
%S MIT AI Lab. Memo 349
%K 
%C 

%T Scheme-79 - Lisp on a Chip
%A G.J. Sussman, J. Holloway, G.L. Steele, A. Bell
%I suss81
%S IEEE Computer 14,7, pp10-21
%K 
%C 

%T LISP, Programming and Implementation
%A Gerald Jay Sussman
%I suss82
%S In darl82, pp29-71
%K general, LISP, interpreters
%C 

%T Two Varieties of GCODE
%A P.A. Sutton
%I sutt87
%S Functional Language Implementation Project Document 12. Univs. Warwick/Birmingham, CS Dept.
%K 
%C 

%T Analysis of Pointer `Rotation'
%A N. Suzuki
%I suzu82
%S CACM 25,5, 1982
%K pointer rotation, marking, copying of lists, sliding
%C 

%T An Implementation of Portable Standard Lisp on the BBN Butterfly
%A M. Swanson, R.R. Kessler, G. Lindstrom
%I swan88
%S In acm88, pp132-142
%K 
%C 

%T Assignments for Applicative Languages
%A V. Swarup, U.S. Reddy, E. Ireland
%I swar91
%S [acm91], pp192-214
%K 
%C 

%T Techniques for Applicative Multiprogramming
%A R. Sykes
%I syke83
%S Dept. Computing, Imperial College, 1983
%K 
%C 

%T Parallelism Control and Synchronization in a Single Assignment Language
%A J.C. Syre
%I syre76
%S Proceedings of the Fourth Annual Computer Science Conference, Anaheim, CA
%K 
%C 

%T Parallel Functional Languages and Compilers
%A B.K. Szymanski, Ed.
%I szym91
%S Addison-Wesley, ISBN 0-201-52243-8, 1991
%K 
%C 

%T EPL - Parallel Programming with Recurrent Equations
%A B.K. Szymanski
%I szym91b
%S In szym91, pp51-104
%K 
%C 

%T Extended Projection - A New Method to Extract Efficient Programs from Constructive Proofs
%A Y. Takayama
%I taka89
%S FPCA, Imperial College, 1989, pp299-312
%K 
%C 

%T Extended Projection - A New method to Extract Efficient Programs from Constructive Proofs
%A Y. Takayama
%I taka89
%S In acm89, pp299-312
%K 
%C 

%T Generalised Partial Computation for a Lazy Functional Language
%A A. Takano
%I taka91
%S SIGPLAN 26 9, [pepm91], pp1-11
%K optimization, theorem proving, algebraic properties, transformation
%C 

%T An Alternative Scheme for Evaluating Combinator Expressions
%A I. Takeuchi??
%I take84
%S Journal of Information Processing, 7,4, 1984
%K 
%C 

%T A List Processing Language TAO with Multiple Programming Paradigms
%A I. Takeuchi, et al.
%I take86
%S New Generation Computing, 4, 1986
%K multiple programming paradigms, object oriented programming, logic programming, TAO, ELIS, macros, LISP, fast variable access, message passing, unification, choice, backtracking, concurrency
%C 

%T Polymorphic Type, Region and Effect Inference
%A J-P. Talpin, P. Jouvelot
%I talp92
%S JFP 2,3, pp245-271
%K imperative, reference values, side effects, limiting interference
%C 

%T Optimized Concurrent Execution of an Applicative Language
%A J. Tanaka
%I tana84
%S Ph.D. Thesis, Univ. of Utah, Salt Lake City, 1984
%K 
%C 

%T Monitoring Tools for Parallel Systems
%A H.W.H. Tang
%I tang87
%S MSc Thesis, Technical Report UMCS-87-12-3
CS, University of Manchester
%K 
%C 

%T Fundamentals of Computing for Software Engineers
%A M.M. Tanik, E.S. Chan
%I tani91
%S Van Nostrand Reinhold
New York, NY, ISBN 0-442-00525-3.
%K logic recursive functions computability lambda calculus nondeterminism distributed processing parallel textbook
%C 

%T No Assembly Required: Compiling Standard ML to C
%A D. Tarditi, A. Acharya, P. Lee
%I tard90
%S Tech Rep. CMU-CS-90-187, School of CS, Carnegie Mellon University, Pittsburg, PA 15213
%K 
%C ML is compiled to C from its continuation-passing, closure-passing form generated by the SML/NJ compiler. Registers are implemented with global variables. Function calls and tail-recursion are via an apply-like procedure: a function calling another function actually returns the address to its caller, the apply function, which then does the call. This keeps the stack at a limited depth. Benchmarks and  optimizations are discussed.

%T Depth First Search and Linear Graph Algorithms
%A R.E. Tarjan
%I tarj72
%S SIAM Journal of Computing 1,2, 1972
%K 
%C 

%T Efficiency of a Good but not Linear Set Union Algorithm
%A R.E. Tarjan
%I tarj75
%S JACM 22,2, 1975
%K 
%C 

%T DIALOG: A Theorem-Proving Environment Designed to Unify Functional and Logic Programming
%A M. Tarver
%I tarv89
%S Report ECS-LFCS-89-80, CS Edinburgh, also CSR-288-89
%K 
%C 

%T A System for Representing the Evaluation of Lazy Functions
%A J. Taylor
%I tayl91
%S Tech. Rep. 522, CS, Quenn Mary and Westfield College, London University
%K 
%C 

%T INTERLISP Reference Manual
%A W. Teitelman
%I teit74
%S Xerox PARC
Palo Alto, CA
%K 
%C Revised 1974,75, 78

%T Mathematical Semantics and Design of Programming Languages
%A R.D. Tennant
%I tenn73
%S Ph.D. Thesis, Dept. Comp. Sci., Univ. Toronto, 1973
%K denotational semantics, language design, pattern matching, QUEST, SNOBOL4
%C 

%T The Denotational Semantics of Programming Languages
%A R.D. Tennant
%I tenn76
%S CACM 19,8, pp437-453
%K bibliography, denotational semantics, languages, imperative, environment, store, continuation, higher order functions, first class functions, recursion, LOOP, GEDANKEN
%C 

%T Principles of Programming Languages
%A R.D. Tennant
%I tenn81
%S Prentice-Hall, 1981
%K 
%C 

%T Functor-Category Semantics of Programming Languages and Logics
%A R.D. Tennent
%I tenn86
%S Report ECS-LFCS-86-3
CS Edinburgh
%K 
%C A category-theoretic technique for denotational-semantic description of programming languages has recently been developed by J.C. Reynolds and F.J. Oles. This paper is an introduction to the Reynolds-Oles technique and its applications.

%T Performance Evaluation of a Heterogeneous Multi-Ring Dataflow Machine
%A Y.M. Teo
%I teo87
%S MSC Thesis, Technical Report UMCS-87-12-2, CS, University of Manchester
%K parallel
%C A heterogeneous dataflow machine, consisting of a processing element ring and two structure store rings, has been built at the University of Manchester. This thesis describes a performance evaluation study of the proposed Heterogeneous Multi-ring Manchester Dataflow Machine, consisting of multiple processing element rings, multiple structure store rings and a global allocator ring.

%T HARE:  An  Optimizing  Portable  Compiler  for
      Scheme
%A D. Teodosiu
%I teod91
%S SIGPLAN 26,1
%K 
%C 

%T Algebraic Types in Lazily Evaluated Applicative Languages
%A S.R. Thatte
%I that82
%S Ph. D. Thesis, Univ. Pittsburgh, Pittsburgh, 1982
%K 
%C 

%T Towards a Semantic Theory for Equational Programming Lasnguages
%A S.R. Thatte
%I that86
%S In acm86, pp332-342, also internal report Department of Electrical Engineering and CS, University of Michigan, Ann Arbor, MI
%K denotational rewrite rules lazy evaluation
%C 

%T Coercive Type Isomorphism
%A S.R. Thatte
%I that91
%S In acm91
%K equivalent types, views, type inference, principal types, unitary unification, typing judgements
%C 

%T Laws in Miranda
%A S. Thompson
%I thom85
%S University of Kent at Canterbury Computing Lab. Report 35, 1985 --- also 1986 LISP and FP Conf., MIT, pp1-12
%K Miranda, laws, non free data types, memo functions, simplification, term rewriting systems, invariance
%C 

%T Writing Interactive Programs in Miranda
%A S. Thompson
%I thom86a
%S University of Kent at Canterbury Computing Lab. Report 40, 1986
%K Miranda, interactive programs, input output, streams, synchronisation, combinators, lazy evaluation
%C 

%T Proving Properties of Functions Defined on Lawful Types
%A S. Thompson
%I thom86b
%S University of Kent at Canterbury Computing Lab. Report 37, 1986
%K Miranda, Laws, Non free algebraic types, lawful types, congruences, equivalence relations, Principle of Induction, cardinality
%C 

%T Graph Reduction Using Occam
%A N.H. Thomas
%I thom89
%S Functional Language Implementation Project Document 22. Univs. Warwick/Birmingham, CS Dept.
%K 
%C Originally an undergraduate dissertation.
This dissertation examines methods of graph reduction, especially those involving combinator techniques. It describes a projest written in the language Occam, using modified recursive algorithms as a basis for a parallel implementation.

%T Lawful Functions and Program Verification in Miranda
%A S. Thompson
%I thom90a
%S Science of Computer Programming 13(2-3), pp181-218
%K Miranda, Laws, Non free algebraic types, lawful types, congruences, equivalence relations, Principle of Induction, verification, faithful functions, views, preservation
%C 

%T Interactive Functional Programs: A Method and Formal Semantics
%A S. Thompson
%I thom90b
%S in turn90a, Research Topics in Functional Programming, pp 249-285
%K 
%C 

%T Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts
%A M. Thomas, P. Watson
%I thom91
%S In peyt91b, pp268-273
%K 
%C 

%T Comparative Review of bail90b, bird88b, holy91, paul91, read89, soko91, wiks87
%A S. Thomson
%I thom92
%S Computing Reviews, 33,5 229-232
%K 
%C 

%T A Flexible Architectural Study Methodology
%A S. Tighe, K. Zink, R. Brice, W. Alexander
%I tigh86
%S In LNCS 279, pp297-311
%K emulation simulation
%C An efficient emulation/simulation system for evaluating architectures and scheduling strategies for reduction systems is described.

%T Introduction to the Functional Language "Ponder"
%A M. Tillotson
%I till85
%S Univ. Cambridge Comp. Lab. tech. Rep. 65
%K 
%C 

%T Parallel Execution of Sequential Scheme with ParaTran
%A P. Tinker, M. Katz
%I tink88
%S In acm88, pp28-39
%K 
%C 

%T Four Lectures on Standard ML
%A Mads Tofte
%I toft89
%S LFCS Report Series  ECS-LFCS-89-73, Laboratory for Foundations of Computer Science, CS, University of Edinburgh
%K 
%C includes an introduction to Standard ML and 3 lectures on the modules system. Some programs from the text are available from the LFCS (see the Introduction).

%T Type Inference for Polymorphic References
%A M. Tofte
%I toft90
%S Information & Computation 89
%K 
%C referenced in peyt93

%T Debugging Standard ML without Reverse Engineering
%A A.P. Tolmach, A.W. Appel
%I tolm90
%S In acm90, 1-12
%K 
%C 

%T Debuggable Concurrency Extensions for Standard ML
%A A.P. Tolmach, A.W. Appel
%I tolm91
%S SIGPLAN 26,12, also Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, pp120-131, also CS Princeton Tech. Rep. CS-TR-352-91
%K 
%C 

%T The Circular Synchronous Computer and its Relation to Functional Programming
%A D. Tomescu, C. Baleanu
%I tome82
%S Microprocessing and Microprogramming 10,5, 1982
%K 
%C 

%T Functional Programs for Generating Permutations
%A R.W. Topor
%I topo82
%S Comp. J. 25, 2, 257-263
%K 
%C 

%T Visualizing Evaluation in Applicative Languages
%A David S. Touretzky, Peter Lee
%I tour89
%S Carnegie Mellon report CMU-CS-89-198-R
%K LISP, Scheme, tracing execution, scoping, contour model, macros
%C A technique is presented for visualizing evaluation in applicative languages that helps to graphically explain a number of basic concepts, including lexical vs. dynamic scoping, closures, the nature of EVAL/APPLY duality, local and special variables, and macro expansion.

%T Flagship Hardware and Implementation
%A P. Townsend
%I town87
%S ICL Technical Journal, 5, May 1987, pp. 575-594
%K 
%C 

%T Adapting Combinator and SECD Machines to Display Snapshots of Functional Computations
%A I. Toyn, C. Runciman
%I toyn86
%S New Generation Computing, 4, pp339-363
%K debugging, eager evaluation, lazy evaluation, snapshots, combinator reduction, SECD machine, annotations, tracing, exceptions, pattern matching, lazy networks
%C The authors discuss a new debugging tool. Its implementation involves changing the reduction rules of the machine. The new reduction rules are applied to an interrupted computation to give a snapshot of that computation in source-level terms.


%T Performance Polymorphism
%A I. Toyn, A. Dix, C. Runciman
%I toyn87
%S LNCS 274, FPCA Portland, 1987, pp325-346
%K 
%C This paper presents a new typechecking algorithm which performs
fine-grained re-typechecking based on analysis of individual type constraints.

%T Exploratory Environments for Functional Programming
%A I. Toyn
%I toyn87b
%S PhD Thesis, Report YCST 87/02, CS, University of York
%K 
%C 

%T An Abstract Architecture for Parallel Graph Reduction
%A K.R. Traub
%I trau84
%S B.S. Thesis, MIT, 1984
%K 
%C 

%T A Compiler for the MIT Tagged Token Dataflow Architecture
%A K.R. Traub
%I trau86
%S Master's Thesis, Tech. Rep. TR-370, MIT Lab. for Comp. Sci.
%K 
%C 

%T Sequential Implementation of Lenient Programming Languages
%A K.R. Traub
%I trau88
%S PhD Thesis, MIT, also TR-417, MIT Lab. for CS
%K 
%C 

%T Compilation as Partitioning: A New approach to Compiling Non-Strict Functional Languages
%A K.R. Traub
%I trau89
%S FPCA, Imperial College 1989, pp75-88. Also in [john88a]
%K 
%C A view is presented of functional language compilation that takes
partitioning a function into sequential threads as the first order of business.

%T Implementation of Non-Strict Functional Programming Languages
%A K.R. Traub
%I trau91
%S Pitman, Research Monographs in Parallel and Distributed Computing,  London, ISBN 0-273-08827-0.
%K compilers, parallelism, lenience

%C Books in print has this as "Functional Implementation of Lenient Programming Languages"

%T Global Analysis for Partitioning Non-Strict Programs into Sequential Threads
%A K.R. Traub, D.E. Culler, K.E. Schauser
%I trau92
%S In acm92, pp324-334
%K 
%C 

%T Concurrent Computing System Design at Newcastle
%A P.C. Treleaven, et al.
%I trel79a
%S Proc. ONERA Workshop on Data Driven Languages and Machines, Toulouse, 1979
%K 
%C 

%T Exploiting Concurrency in Computing Systems
%A P.C. Treleaven
%I trel79b
%S Computer 12,1, 1979
%K 
%C 

%T Proceedings SRC Sponsored Workshop on VLSI, Machine Architecture and Very High Level Languages
%A P.C. Treleaven, Ed.
%I trel80
%S University of Newcastle-upon-Tyne Technical Report 156, 1980
%K 
%C 

%T Computer Architecture for Functional Programming
%A P.C. Treleaven
%I trel82
%S In darl82, pp281-306
%K 
%C 

%T Data-driven and Demand-driven Computer Architectures
%A P.C. Treleaven, et al.
%I trel82b
%S Computing Surveys 14,1, pp93-143
%K dataflow, demand driven architecture, data driven, classification, reduction, survey, hardware, bibliography
%C 

%T List Comprehensions and the Relational Calculus
%A P. Trinder, P. Wadler
%I trin88
%S Proc. Glasgow 1988 Wkshp. (hall89), pp187-202
%K 
%C 

%T Translating the Relational Calculus into Programming Languages
%A P. Trinder, P. Wadler
%I trin89
%S Research Report CSC/89/R2, CS, University of Glasgow
%K 
%C 

%T Improving List Comprehension Database Queries
%A Phil Trinder, Phil Wadler
%I trin89a
%S Proc. IEEE TENCON '89, Bombay pp186-192, also Research Report CSC/90/R4, CS, Glasgow
%K 
%C In this paper is described the improvement of queries expresses as list comprehensions in a lazy functional language.

%T Referentially Transparent Database Languages
%A Phil Trinder
%I trin89b
%S In davi89b, pp142-156
%K 
%C 

%T A Functional Database
%A P. Trinder
%I trin89c
%S D. Phil. Thesis, Oxford University, also Research Report CSC/90/R10, CS, Glasgow

%K 
%C 

%T Implementing a Parallel Functional Database
%A P. Trinder
%I trin90
%S Research Report CSC/90/R13, CS, Glasgow
%K 
%C This paper investigates the feasibility of using a pure functional language to implement data storage and manipulation on parallel declarative machines.

%T Current Functional Languages don't Manipulate Files Well
%A P. Trinder, K. Hammond, D. McNally
%I trin92
%S Glasgow/st.Andrews Universities research reports
%K persistence, referential transparency, I/O, Input, Output, Read, Write, responses, requests, streams, incremental I/O, state, types, sharing, databases 
%C 

%T Concurrent Data Manipulation in a Pure Functional Language
%A P. Trinder
%I trind91
%S In peyt91b, pp274-286
%K 
%C 

%T Hope Handbook
%A M. Tsang, L. McLoughlin
%I tsan87
%S Forward Intelligence Unit, British Telecom, 1987
%K 
%C 

%T An FP-based Design Methodology for Problem-Oriented Languages
%A P. Tsanakas, N. Alexandridis, G. Papakonstantinou
%I tsan89
%S Comp. J. 32, 5, pp453-460
%K 
%C A methodology based on functional programming for the systematic synthesis of problem-oriented architectures is presented.

%T FAC: A Functional APL Language
%A H.-C. Tu, A.J. Perlis
%I tu86
%S IEEE Software, 3, 1, pp36-45
%K 
%C 

%T Interactive Modular Programming in Scheme
%A S-H.S. Tung
%I tung92
%S In acm92, pp86-95
%K 
%C 

%T Experiments with a Supercompiler
%A Valentin F. Turchin, et al.
%I turc82
%S In acm82, pp47-55
%K REFAL, parallelism, laziness, partial evaluation, evaluation strategies, formal language definition, problem solving, theorem proving, induction
%C A dozen simple examples show how the supercompiler created at the City College of New York is working. The examples include partial evaluation, program specialization, problem solving, and theorem proving.

%T On Computable Numbers, with an application to the Entscheidungsproblem
%A A.M. Turing
%I turi36
%S Proc. London Math Soc. Series 2, 42, pp230-265, 1936
%K 
%C Corrections in Vol 43 pp 544-546

%T Computability and Lambda-Definability
%A A.M. Turing
%I turi37
%S Journal of Symbolic Logic 2, pp153-163
%K 
%C 

%T An Implementation of SASL
%A D.A. Turner
%I turn75
%S St.Andrews University Dept. Comp. Sci. report TR/75/4, 1975
%K SASL, implementation, SECD machine
%C 

%T SASL Language Manual
%A D.A. Turner
%I turn76
%S St.Andrews University Dept. Comp. Sci. Report CS/75/1, also University of Kent
%K SASL, languages, general, equations
%C Revised 1979, 83, 89, 90

%T A New Implementation Technique for Applicative Languages
%A D.A. Turner
%I turn79a
%S Software 9, pp31-49
%K combinators, bracket abstraction, normal order, graph reduction, lazy evaluation, susbstitution machine, SASL, programming without variables, SK reduction, measurement
%C 

%T Another Algorithm for Bracket Abstraction
%A D.A. Turner
%I turn79c
%S Journal of Symbolic Logic 44,2, pp67-70
%K bracket abstraction, combinators, combinatorial explosion
%C 

%T Proving the Correctness of Programs which use Infinite Data Structures
%A D.A. Turner
%I turn79d
%S Computer Lab., Univ. of Kent at Canterbury, 1979
%K 
%C 

%T Program Proving and Applicative Languages
%A D.A. Turner
%I turn80a
%S Report for Burroughs Corp., Austin, 1980
%K correctness, inductive assertions, structural induction, recursion induction, partial object induction
%C 

%T Some Notes on the SASL Compiler in SASL
%A D.A. Turner
%I turn80b
%S Report for Burroughs Corp., Austin, 1980
%K 
%C 

%T Implementing Applicative Languages
%A D.A. Turner
%I turn80c
%S In Technical Report Series 156, Proceedings of the Joint SRC/University of Newcastle-upon-Tyne
Workshop on VLSI: Machine Architecture and Very High Level Languages, Ed. P.C. Treleaven, pp79-80
%K 
%C 

%T The Semantic Elegance of Applicative Languages
%A D.A. Turner
%I turn81a
%S In acm81, pp85-92 - also in turn82c
%K KRC, programming, general, examples, paraffins, memoisation, filter promotion, optimisation
%C 

%T Aspects of the Implementation of Programming Languages (The Compilation of an Applicative Language to Combinatory Logic)
%A D.A. Turner
%I turn81b
%S D. Phil. Thesis, Oxford University, 1981
%K SASL, combinators, reduction machine
%C 

%T The Future of Applicative Programming
%A D.A. Turner
%I turn81c
%S LNCS 123, pp334-348 --- also in turn82c
%K general, recursion equations, KRC, programming examples, ZF expressions
%C 

%T Recursion Equations as a Programming Language
%A D.A. Turner
%I turn82a
%S In darl82, pp1-28
%K equations, languages, KRC, general, ZF notation, laziness
%C 

%T Functional Programming and Proofs of Program Correctness
%A D.A. Turner
%I turn82b
%S In ``Tools and Notions for Program Construction'', Ed. Neel, Cambridge Univ. Press, 1982, pp187-209 - also in turn82c
%K KRC, verification
%C 

%T Applicative Programming --- An Emerging Technology
%A D.A. Turner, J. Darlington
%I turn82c
%S Annual Open Lecture Course, Dept. Comp. Sci., Univ. St.Andrews, 1982
%K general
%C 

%T Prospects for Non-Procedural and Data-Flow Languages
%A D.A. Turner
%I turn82d
%S Mini-Micro Software
7, 3, pp8-15
%K 
%C 

%T The Future of Programming Languages
%A D.A. Turner
%I turn83
%S INFOTECH State of the Art Report on Software Engineering Developments, pp129-135
%K 
%C 

%T Functional Programs as Executable Specifications
%A D.A. Turner
%I turn84a
%S Phil. Trans. Roy. Soc. 312 Series A, pp363-388, also in ``Mathematical Logic and Programming Languages'' ed. C.A.R. Hoare, Prentice Hall, 1985, pp29-54
%K Miranda ML LCF correctness proof verification
polymorphism typing
%C 

%T Combinator Reduction Machines
%A D.A. Turner
%I turn84b
%S Proc. Internat. Workshop on High-Level Computer Architecture, Los Angeles, 1984
%K graph reduction KRC abstraction algorithms
%C 

%T Miranda: A Non-Strict Functional Language with Polymorphic Types
%A D.A. Turner
%I turn85a
%S In LNCS. 201, FPCA Nancy pp1-16
%K general, types, laziness, equations, ZF-notation, languages, polymorphism
%C 

%T On Overview of Miranda
%A D.A. Turner
%I turn86
%S SIGPLAN 21,12, pp158-166; also in turn90a, Research Topics in Functional Programming, pp1-16
%K 
%C 

%T Functional Programming and Communicating Processes
%A D. Turner
%I turn87
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259, Vol. 2 pp54-74
%K streams, KAOS, sorting office, global interconnection, type security, synchronisation, hyperstrictness, process creation
%C This paper reports some of the initial results of a research paper at the University of Kent for the construction of an operating system written entirely in a functional language.

%T Research Topics in Functional Programming
%A D. Turner
%I turn90a
%S Addison Wesley, ISBN 0-201-17236-4
%K Miranda, general, exact arithmetic, lazy lambda calculus, compile time analysis, databases, lazy evaluation, logical variables, operating systems, FL, interaction, program derivation, higher order functions unnecessary, higher order type systems
%C 

%T An Approach to Functional Operating Systems
%A D. Turner
%I turn90b
%S in turn90a, Research Topics in Functional Programming, pp199-218
%K 
%C 

%T Constructive Foundations for Functional Languages
%A R. Turner
%I turn91
%S McGraw-Hill
Maidenhead, ISBN 0-07-707411-4
%K semantics lambda calculus types type theory
%C 

%T A Functional Parser Generator
%A G.O. Uddeborg
%I udde88
%S Report 43, Programming Methodology Group Department of Computer Science, Chalmers University of Technology and University of Gteborg
%K yacc
%C 

%T Generation Scavenging: A Non-Disruptive High Performance Storage Reclamation Algorithm
%A D. Ungar
%I unga84
%S SIGPLAN 19(5), pp157-167
%K 
%C 

%T An Adaptative Tenuring Policy for Generation Scavengers
%A D. Ungar, F. Jackson
%I unga92
%S TOPLAS 14,1, pp1-27
%K 
%C 

%T Sofware Development with Executable Functional Specifications
%A J.E. Urban
%I urba82
%S Sixth Intern. Conf. on SE, Tokyo, IEEE Press, 1982
%K 
%C 

%T A Constructive Specification Theory
%A L. Ury, T. Gergely
%I ury90
%S in 
%K abstract specification, category theory, Z
%C 

%T A Survey of Proposed Architectures for the Execution of Functional Languages
%A S.R. Vegdahl
%I vegd84
%S IEEE Transactions on Computing C--33, pp1050-1071
%K 
%C 

%T Reflections on Parallel Functional Languages
%A J. Vrancken
%I vran90
%S plas90
%K feasibility study, survey, hardware, GRIP, Alfalfa, Buckwheat, Flagship, PAM, MaRS, APERM, Clean, MIMD
%C 

%T The Grain Size of Parallel Computations in a Functional Program
%A W.G. Vree
%I vree87
%S Conference on Parallel Processing and Applications
pp363-370, Eds. E. Chiricozzi, A. d'Amico, L'Aquila, Italy, Elsevier Science Publishing
%K 
%C 

%T Experiments with Coarse-Grain Parallel Graph Reduction
%A W.G. Vree
%I vree89
%S Future Generation Computer Systems 4, 299-306
%K 
%C 

%T Communication Lifting: Fixed Point Computation for Parallelism
%A W.G. Vree, P.H. Hartel
%I vree92
%S University of Amsterdam CS tech rep. CS-92-07
%K streams, program transformation, synchronous process network, FAST
%C 

%T Big Trees in a l-Calculus with l-Expressions as Types
%A R. de Vrijer
%I vrij75
%S LNCS 37, pp252-271
%K 
%C 

%T Correct and Optimal Implementations of Recursion in a Simple Programming Language
%A J. Vuillemin
%I vuil74
%S J. Comp. and Syst. Sci. 9, 1974
%K 
%C 

%T Exact Real Computer Arithmetic with Continued Fractions
%A J. Vuillemin
%I vuil88
%S In acm88, pp14-27
%K 
%C 

%T Programming Constructs for Nonprocedural Languages
%A W.W. Wadge
%I wadg78
%S Theory of Computation Report 23, CS, University of Warwick, Coventry
%K dataflow
%C 

%T Away from the Operational View of Computer Science
%A W.W. Wadge
%I wadg78b
%S Theory of Computation Report 26, CS, University of Warwick, Coventry
%K dataflow
%C 

%T An Extensive Treatment of Dataflow Deadlock
%A W.W. Wadge
%I wadg79
%S Theory of Computation Report 28, CS, University of Warwick, Coventry
%K lucid cycle sum test
%C 

%T Structured Lucid
%A W.W. Wadge, E.A. Ashcroft
%I wadg80
%S Theory of Computation Report 33, CS, University of Warwick, Coventry
%K dataflow
%C 

%T Why Lucid
%A W.W. Wadge, E.A. Ashcroft
%I wadg83
%S Distributed Computing Project Report 3, CS, University of Warwick, Coventry
%K dataflow
%C 

%T Viscid, A Vi-like Screen Editor Written in Lucid
%A W.W. Wadge
%I wadg85
%S CS, University of Victoria, BC, Canada, Report DCS-40-IR
%K 
%C 

%T Analysis of an Algorithm for Real-Time Garbage Collection
%A P.L. Wadler
%I wadl76
%S CACM 19,9, 1976
%K 
%C 

%T Applicative Style Programming, Program Transformation and List Operators
%A P.L. Wadler
%I wadl81
%S In acm81, pp25-32
%K high level operators, map, reduce, generate, upto, folding, unfolding, lazy evaluation, formal differentiation
%C 

%T Listlessness is Better Than laziness: Lazy Evaluation and Garbage Collection at Compile Time
%A P.L. Wadler
%I wadl84
%S In acm84a, pp45-52
%K laziness, pipes, transformation, architecture, bounded evaluation
%C 

%T Views: A Way for Elegant Definitions and Efficient Representations to Coexist
%A P.L. Wadler
%I wadl85a
%S Oxford Univ. Programming Research Group, 1985 --- also Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K Views, abstract types, representation, efficiency
%C 

%T Strictness Analysis on Non-Flat Domains by Abstract Interpretation over Finite Domains
%A P.L. Wadler
%I wadl85b
%S  Prog. Research Group, Oxford, 1985
%K strictness analysis, abstract interpretation
%C 

%T How to Replace Failure by a List of Successes - A Method for Exception Handling, Backtracking and Pattern matching in Lazy Functional Languages
%A P.L. Wadler
%I wadl85c
%S FPCA'85, Nancy, LNCS 201, pp113-128
%K exceptions, backtracking, pattern matching, laziness
%C This paper presents a method whereby some programs, that use features such as exception handling, backtracking and pattern matching, can be rewritten in a functional language with lazy evaluation, without the use of any special features.

%T An Introduction to Orwell (Draft)
%A Philip Wadler
%I wadl85d
%S Internal Report, Oxford Programming Research Group 1985
%K languages, general, integrated systems, Orwell, equations, ZF notation
%C 

%T A Splitting Headache - and its Cure
%A P.L. Wadler
%I wadl85e
%S Oxford Univ. Programming Research Group, 1985
%K 
%C 

%T Listlessness is Better Than Laziness II: Composing Listless Functions
%A Philip Wadler
%I wadl86a
%S In LNCS 217
%K transformation, laziness, composition, graph reduction, algebra
%C 

%T A New Array Operation
%A P. Wadler
%I wadl86b
%S In LNCS 279, pp328-335
%K 
%C 

%T Efficient Compilation of Pattern Matching
%A P.L. Wadler
%I wadl87a
%S Chapter in peyt87
%K pattern matching, optimisation, MIRANDA, uniform definitions
%C 

%T A Critique of Abelson and Sussman -or- Why Calculating is Better than Scheming
%A P.L. Wadler
%I wadl87b
%S SIGPLAN 22,3, 1987
%K SCHEME, MIRANDA, patterns, correctness, data types, proving, mobiles, abstract data types, reflexivity, program manipulation, free data types, lazy evaluation, streams, special forms
%C 

%T Views: A way for pattern matching to cohabit with data abstraction
%A P.L. Wadler
%I wadl87c
%S Symp. on Principles of Programming Languages, Munich, 1987
%K 
%C 

%T Contexts Made Simple
%A P.L. Wadler, R.J.M. Hughes
%I wadl87d
%S Dept. Comp. Sci., Glasgow University, 1987
%K context analysis, strictness analysis, projections, head and tail strictness, absence, finite domains, normalising contexts
%C 

%T The OL Manual (Draft)
%A P. Wadler, Q. Miller, M. Raskovsky
%I wadl87e
%S Unpublished, CS, Glasgow
%K tutorial
%C OL is the Oxford Language for functional programming. The OL system includes a text editor, and allows one to create and execute OL programs. This document provides an introduction to OL and the OL system.

%T Fixing Some Space Leaks with a Garbage Collector
%A P.L. Wadler
%I wadl87f
%S Software 17,9, 1987
%K space leaks, garbage collection, lazy evaluation, complexity
%C 

%T Projections for Strictness Analysis
%A P. Wadler, R.J.M. Hughes
%I wadl87g
%S LNCS 274, FPCA Portland, 1987, pp385-407 - also Report 35, Programming Methodology Group, Dept. Comp. Sci., Chalmers University and University of Gteborg, Sweden
%K contexts non flat domains
%C Contexts have been proposed as a means of performing strictness analysis on non-flat domains. Roughly speaking, a context describes how much a sub-expression will be evaluated by the surrounding program. This paper shows how contexts can be represented using the notion of projection from domain theory.

%T Strictness on Non-flat domains (by Abstract Interpretation over Finite Domains)
%A P.L. Wadler
%I wadl87h
%S In abra87
%K 
%C 

%T The Concatenate Vanishes
%A P. Wadler
%I wadl87i
%S Network Mail
%K transformation, efficiency
%C This note presents a trivial transformation that can eliminate many calls of the concatenate (or "append") operator from a program.  The transformation is suitable for incorporation in a compiler, and improves the asymptotic time complexity of some programs from quadratic to linear.  There is a simple model that characterises the transformation's benefits.

%T How to make Ad Hoc Polymorphism less Ad Hoc
%A P. Wadler, S. Blott
%I wadl88a
%S Aspens 88, [john88a], pp33-52 and Proc. Glasgow 1988 Wkshp. (hall89), pp203-  Also in 16th POPL, pp60-76, Austin '89?
%K 
%C 

%T Strictness Analysis aids Time Analysis
%A P. Wadler
%I wadl88b
%S 15th POPL
%K complexity, measurement, profiling
%C 

%T Theorems for Free!
%A P. Wadler
%I wadl89
%S FPCA, Imperial College, 1989, pp347-359
%K proof, polymorphism, parametricity, polymorphic equality, lambda calculus, semantics, fixpoints, category theory
%C 

%T An Introduction to Orwell 6.00
%A P. Wadler
%I wadl90
%S Programming Research Group, Oxford University Computing Laboratory
%K 
%C 

%T Comprehending Monads
%A P. Wadler
%I wadl90b
%S In acm90, 61-78, later version in Math. Struct. in Comp. Sci. 2, pp461-493
%K category theory, state, exceptions, parsing, continuations, list comprehensions, destructive array update, purity
%C 

%T Linear Types can Change the World
%A P.J. Wadler
%I wadl90c
%S In broy90
%K 
%C 

%T The Essence of Functional Programming
%A P. Wadler
%I wadl92
%S In 19th POPL 92, pp1-14
%K 
%C referenced in peyt93

%T Semantics and Pragmatics of the Lambda Calculus
%A C.P. Wadsworth
%I wads71
%S Oxford University D.Phil. Thesis, 1971
%K normal forms, termination, consistency, graph reduction, call by need, laziness
%C 

%T The Relation between Computational and Denotational Properties for Scott's D-infinity-Models of the Lambda Calculus
%A C. Wadsworth
%I wads75
%S SIAM Journal of Computing 5(6?), pp488-521
%K 
%C 

%T Some Unusual Lambda-Calculus Numeral Systems
%A C.P. Wadsworth
%I wads80
%S In seld80b, pp215-229
%K 
%C 

%T Functorial Hierarchies of Functional Languages
%A E.G. Wagner
%I wagn83
%S In ``Formal Description of Programming Concepts II'' ed. D. Bjrner, North Holland, 0--444--86619--1, 1983

%K FP, algebra, unwinding operators
%C 

%T Deriving Parallel Computations from Functional Specifications
%A R.L. Wainwright
%I wain87
%S Internat. J. Parallel Processing 16, 3, pp243-260
%K 
%C 

%T A Study of Sparse Matrix Representations for Solving Linear Systems in a Functional Language
%A R.L. Wainwright, M.E. Sexton
%I wain92
%S JFP 2,1, pp61-72
%K 
%C 

%T Linearity and Laziness
%A D. Wakeling
%I wake90
%S Ph.D. Thesis, University of York
%K 
%C 

%T Heap profiling of lazy functional programs
%A Wakeling, C. Runciman
%I wake92
%S Report YCS-92-172, University of York
%K 
%C 

%T A Functional Programming Language Compiler for Massively Parallel Computers
%A C. Walinski, D. Banerjee
%I wali
%S In acm90, 131-138
%K 
%C 

%T Compiling Lambda-Expressions Using Continuations and Factorisations
%A M. Wand, D.P. Friedman
%I wand78
%S Computer Languages 3,4, pp241-263
%K 
%C 

%T Continuation-Based Program Transformation Strategies
%A M. Wand
%I wand78b
%S JACM 27,1, pp174-180
%K 
%C 

%T SCHEME Version 3.1 Reference Manual
%A Mitchell Wand
%I wand80a
%S Indiana University Dept. Comp. Sci. Technical Report 93, 1980
%K 
%C 

%T Induction, Recursion and Programming
%A Mitchell Wand
%I wand80b
%S North Holland, 1980
%K 
%C 

%T Deriving Target Code as a Representation of Continuation Semantics
%A Mitchell Wand
%I wand80c
%S Indiana University Dept. Comp. Sci. Technical Report 94, 1980
%K 
%C 

%T Continuation-Based Program Transformation Strategies
%A M. Wand
%I wand80d
%S JACM 27,1, 1980
%K generalisation, program manipulation, optimisation, subgoal induction, nonlinear recursion
%C 

%T Continuation-Based Multiprocessing
%A Mitchell Wand
%I wand80e
%S In acm80, pp19-28
%K multiprocessing, exclusion, protection, process saving, CATCH operator
%C 

%T Semantics Directed Machine Architecture
%A Mitchell Wand
%I wand82
%S Proc. 9th POPL, Albuquerque, 1982
%K denotational semantics, compiler production, combinators, eliminating lambda abstraction, correctness
%C 

%T Deriving Target Code as a Representation of Continuation Semantics
%A M. Wand
%I wand82b
%S TOPLAS 4,3, pp496-517
%K 
%C 

%T Loops in Combinator-Based Compilers
%A Mitchell Wand
%I wand83a
%S Proc. 10th POPL,Austin, 1983 - also Information & Control 57,2-3, pp148-164
%K code generation, denotational semantics, logic, combinators, recursion, transformation, tieing knots
%C 

%T A Types-as-Sets Semantics for Milner-Style Polymorphism
%A Mitchell Wand
%I wand83b
%S Proc. 11th POPL, Salt Lake City, Jan. 1984
%K polymorphism, types, semantics, reflexive types, infinite types, opaque types, privacy, abstract data types
%C 

%T A Semantic Prototyping System
%A Mitchell Wand
%I wand84a
%S Proc. SIGPLAN '84 Symposium on Compiler Construction, ACM, Montreal 1984
%K LISP, Scheme, semantics, prototyping, parsing
%C 

%T What is LISP
%A Mitchell Wand
%I wand84b
%S Scientific American, 91,1, 1984
%K 
%C 

%T From Interpreter to Compiler
%A Mitchell Wand
%I wand85
%S In LNCS 217
%K transformation, Scheme, abstract machine architecture, semantics, optimization
%C 

%T The Mystery of the Tower Revealed: A Non-Reflexive Description of The Reflexive Tower
%A M. Wand, D.P. Friedman
%I wand86
%S In acm86, pp298-307 and Indiana University Dept. Comp. Sci. Technical Report 196, 1986
%K reflection, reflexivity, meta circular interpreters, towers, currying, denotations, reification, continuations, metacontinuations
%C 

%T Finding the Source of Type Errors
%A M. Wand
%I wand86b
%S 13th POPL
%K 
%C Typically an error is reported only when the checker can proceed no further, even tho' the actual error may have occurred much earlier. Describes an algorithm which explains the source of type errors by keeping track of the reasons why the checker made certain deductions. greg@cs.heriot-watt.ac.uk has done some work on this.

%T On the Complexity of Type Inference with Coercion
%A M. Wand, P. O'Keefe
%I wand89
%S FPCA, Imperial College, 1989, pp293-298
%K 
%C 

%T Proving the Correctness of Storage Representations
%A M. Wand, D.P. Oliva
%I wand92
%S In acm92, pp151-160
%K 
%C 

%T Essentials of Programming Languages
%A M. Wand
%I wand93
%S ? Date ?
%K 
%C Chapter 11 has a functional parser

%T Analysis of Recursive Types in Lisp-like Languages
%A E. Wang, P.N. Hilfinger
%I wang92
%S In acm92, pp216-225
%K 
%C 

%T Functional Domains of Applicative Languages
%A S.A. Ward
%I ward74
%S Ph.D. Thesis, Project MAC TR--136, MIT, 1974
%K 
%C 

%T PROLOG --- The Language and its Implementation Compared with LISP
%A D. Warren
%I warr77
%S SIGPLAN 12,8, 1977
%K 
%C 

%T An Improved Prolog Implementation which Optimizes Tail-Recursion
%A D. Warren
%I warr80
%S Dept. of AI Research Report 141, University of Edinburgh, 1980
%K 
%C 

%T An Abstract Prolog Instruction Set
%A D.H.D. Warren
%I warr83
%S Tech. Note 309, SRI International, Menlo Park, Calif., Oct. 1983
%K 
%C 

%T A Tutorial Introduction to Using IDL
%A W.B. Warren, J. Kickenson, R. Snodgrass
%I warr87
%S SIGPLAN 22,5
%K 
%C 

%T Automatic Transformation of Series Expressions into Loops
%A R.C. Waters
%I wate91
%S TOPLAS 13,1 pp52-98
%K sequences, vectors, streams, series
%C 

%T A Prototype Dataflow Computer with Token Labelling
%A I. Watson, J.R. Gurd
%I wats79
%S Proc. Nat. Comp. Conf. 48, 1979
%K 
%C 

%T A Model of Computation for the Parallel Evaluation of Functional Languages Based on a Canonical Representation of Variables
%A P. Watson, I. Watson, V. Woods
%I wats86a
%S Dept. Comp. Sci., Univ. Manchester Report PMP/MU/PW/000001
%K graph reduction, laziness, parallelism, persistence, canonical lambda calculus, HOPE, renaming, packet based model, preventing re-evaluation, lazy substitution
%C 

%T Graph Reduction in a Parallel Virtual Memory Environment
%A I. Watson, P. Watson
%I wats86b
%S In LNCS 279, pp265-274
%K 
%C This paper examines the area of memory organization and the mechanisms which are required to ensure thet the full benefits of this implementation strategy are maintained whilst achieving an efficient physical structure. The major areas of interest are the maintenance of locality and the use of storage management techniques which minimize communication.

%T Evaluating Functional Programs on the FLAGSHIP Machine
%A I. Watson, P. Watson
%I wats87a
%S LNCS 274 (FPCA Portland 1987), pp80-97
%K super combinator parallel
%C The physical architecture of the machine consists of a set of closely
coupled processor/store pairs communicating over a high performance communications network. A functional program to be evaluated is compiled into a Super-Combinator expression graph which is then simplified by graph reduction.

%T Flagship Computational Models and Machine Architecture
%A I. Watson, J. Sargeant, P. Watson, V. Woods
%I wats87b
%S ICL Technical Journal, May 1987
%K 
%C 

%T An Efficient Garbage Collection Scheme for Parallel Computer Architectures
%A P. Watson, I. Watson
%I wats87c
%S Parallel Architectures and Languages Europe (PARLE), LNCS 259, pp432-443
%K 
%C This paper examines the problems of garbage collection on parallel machines, and proposes a new scheme which has been implemented on the Flagship parallel machine architecture. It is efficient because it requires no synchronisation.

%T The Flagship Parallel Machine
%A I. Watson, et al.
%I wats89
%S CONPAR 88, pp125-133, Ed. C.R. Jesshope & K.D. Reinartz
%K 
%C 

%T An Action Semantics of Standard ML
%A D.A. Watt
%I watt87
%S LNCS 298, pp572-598
%K ML, action semantics, operational description, readability
%C 

%T Programming Languages Concepts and Paradigms
%A D.A. Watt
%I watt90
%S Prentice Hall
%K 
%C 

%T Parallel Imperative Programs from Functional Prototypes
%A K. Waugh
%I waug91
%S In glas91, pp75-88
%K 
%C 

%T On the Orthogonality of Assignments and Procedures in Algol
%A S. Weeks, M. Felleisen
%I week93
%S POPL 20, pp57-70, also tech. report from Rice University, CS 92-193
%K 
%C I think the ftp
address is titan.cs.rice.edu

%T A Parallel Lisp Simulator
%A J.S. Weening
%I ween88
%S Report No. STAN-CS-88-1206, CS, Stanford University
%K shared memory common csim
%C CSIM is a simulator for parallel Lisp, based on a continuation passing interpreter. It models a shared-memory multiprocessor executing programs written in Common Lisp, extended with several primitives for creating and controlling processes. This paper describes the structure of the simulator, measures its performance, and gives an example of its use with a parellel Lisp program.

%T Programming Languages, Information Structures and Machine Organisation
%A P. Wegner
%I wegn71
%S McGraw-Hill, 1971 (Check Date)
%K 
%C 

%T Programming Languages --- The First 25 Years
%A P. Wegner
%I wegn76
%S IEEE Transactions on Computing C--25,12, 1976
%K 
%C 

%T Demand-Driven Interpretation of FP Programs on a Data-Flow Multiprocessor
%A Y.-H. Wei, J.-L. Gaudiot
%I wei88
%S IEEE Transactions on Computers
37, 8, pp946-966
%K dfp lazy evaluation parallel
%C 

%T LISP Machine Manual
%A D. Weinreb, D. Moon
%I wein81
%S MIT AI Lab., 1981
%K 
%C 

%T Architectural Improvements for Data Driven VLSI Processing Arrays
%A S. Weiss, I. Spillinger, G.M. Silberman
%I weis89
%S FPCA, Imperial College, 1989, pp243-259
%K hardware connectivity
%C 

%T Automatic Online Partial Evaluation
%A D. Weise, R. Conybeare, E. Ruf, S. Seligman
%I weis91
%S In acm91, pp165-191
%K 
%C 

%T The Funarg Problem Explained
%A J. Weizenbaum
%I weiz68
%S Tutorial Paper, MIT project MAC, 1968
%K LISP, dynamic and static binding and scoping, closures
%C 

%T The Minimal Continuous Semantics of the Lambda Calculus
%A P.H. Welch
%I welc74
%S Ph.D. Thesis, Univ. of Warwick, 1974
%K 
%C 

%T Some Notes on the Martin-Lf/Tait Proof of the Church Rosser Theorem as rediscovered by Park
%A P.H. Welch
%I welc75
%S Univ. Kent Computing Lab. 1975
%K 
%C 

%T Continuous Semantics and Inside-Out Reductions
%A P.H. Welch
%I welc75
%S LNCS 37, pp122-146
%K 
%C 

%T Program Transformation (an Easier Way of Proof)
%A P.H. Welch
%I welc79
%S Univ. Kent Computing Lab. 1979
%K 
%C 

%T Strong Typing and Functional Programming (Benefits, Design and Implementation)
%A P.H. Welch, M.P. Ellis
%I welc83
%S Univ. Kent Computing Lab. 1983
%K 
%C 

%T A Technique for High-Performance Data Compression

%A Terry A. Welch
%I welc84
%S IEEE Computer, June 1984, pp8-19
%K packing, compacting, compressing
%C 

%T Dataflow Graph Optimization in IF1
%A M.L. Welcome, S.K. Skedzielewski
%I welc85
%S FPCA'85, Nancy, LNCS 201, pp17-34
%K sisal
%C This paper describes work that has been done on optimizers for SISAL programs that have been translated into IF1 data flow graphs. It shows that conventional optimization algorithms can be easily and efficiently implemented for data flow graphs.

%T Error Data Values in the Data-Flow Language VAL
%A C.S. Wetherell
%I weth82
%S TOPLAS 4,2, 1982
%K VAL, error monitoring, error data values
%C 

%T Reconfigurable, Retargetable Bignums: A Case Study in Efficient, Portable Lisp System Building
%A J.L. White
%I whit86
%S In acm86, pp174-191
%K 
%C 

%T The Design of an Instruction Set for Common Lisp
%A S. Wholey, S.E. Fahlman
%I whol84
%S 1984 LISP and FP Conf, Austin, pp150-158
%K 
%C 

%T Functional Programming Using Standard ML
%A Ake Wikstrom
%I wiks87
%S Prentice Hall 1987
ISBN: 0-13-331661-0
%K sml textbook
%C Aimed at people learning to program. It doesn't cover the modules system


%T Processing ASN.1 Specifications in a Declarative Language
%A C. Wikstrm
%I wiks92
%S Software Engineering for Telecommunication Switching Systems, March 30 - April 1, 1992 Florence
%K Erlang
%C 

%T Formal Representations for Recursively Defined Functional Programs
%A J.H. Williams
%I will81
%S In LNCS 107, pp460-470
%K FP style, FFP, metacomposition, recursive equations
%C 

%T Notes on the FP Style of Functional Programming
%A J.H. Williams
%I will82a
%S In darl82, pp73-101
%K FP, FFP, algebra
%C 

%T On the Development of the Algebra of Functional Programs
%A J.H. Williams
%I will82b
%S TOPLAS 4, 1982
%K transformation, FP style, algebraic equations, algebraic transformation, expansion theorems, equational reasoning
%C 

%T Sacrificing Simplicity for Convenience: where do you draw the line?
%A J.H. Williams, E.L. Wimmers
%I will88
%S IBM Almaden Research Center, 1988, also 15th POPL, San Diego, 1988
%K FL, I/O, side effects
%C 

%T Caching Considerations for Generational Garbage Collection
%A P.R. Wilson, M.S. Lam, T.G. Moher
%I wils92
%S In acm92, pp32-42
%K allocation compaction coroutines associativity measurement performance
%C 

%T Uniprocessor Garbage Collection Techniques
%A P.R. Wilson
%I wils92b
%S In bekk92, pp1-42
%K survey, tutorial, storage reclamation, mark sweep, reference counting, cycles, compaction, copying, semispaces, incremental tracing, tricolor marking, incremental copying, treadmill, generational garbage collection, bibliography
%C Surveys garbage collection techniques. 
      Includes an excellent bibliography. Available by anonymous ftp from cs.utexas.edu:pub/garbage/gcsurvey.ps. The BibTeX format of the bibliography is also available in this  directory, along with several other papers.

%T Category Theory and Models for Parallel Computation
%A G. Winskel
%I wins86
%S Technical Report 85
University of Cambridge Computer Laboratory

%K 
%C 

%T On Hierarchies of Abstract Data Types
%A M. Wirsing, et al.
%I wirs83
%S Acta Informatica 20,1, 1983
%K 
%C 

%T Program Development by Stepwise Refinement
%A N. Wirth
%I wirt71
%S CACM 14, 1971
%K 
%C 

%T Compact Layouts of Banyan/FFT Networks
%A David S. Wise
%I wise81
%S In ``VLSI Systems and Computations'', Computer Science Press, Rockville, Maryland, 1981
%K 
%C 

%T Interpreters for Functional Programming
%A David S. Wise
%I wise82a
%S In darl82
%K interpreters, LISP, streams, laziness, call by need, storage management, garbage collection, implementation
%C 

%T A Parallel PROLOG: The Construction of a Data Driven Model
%A Michael A. Wise
%I wise82b
%S In acm82
%K PROLOG, parallelism, data flow, logic programming
%C 

%T The Applicative Style of Programming
%A D.S. Wise
%I wise85a
%S Abacus 2, 2, 1985
%K general, tutorial, introduction, recursion, correctness, streams, logic programming, quicksort, FP, APL
%C 

%T Design for a Multiprocessing Heap with On-board Reference Counting
%A David S. Wise
%I wise85b
%S FPCA'85, Nancy, LNCS 201, pp289-304
%K garbage collection, hardware, storage allocation
%C A project to design a pair of memory chips with a modicum of intelligence on board is described.

%T Matrix Algebra and Applicative Programming
%A D.S. Wise
%I wise87
%S LNCS 274, FPCA Portland, 1987, pp134-153
%K arrays aggregate update parallel
%C A key question is how arrays should be represented in order to admit good implementations of well-known efficient algorithms, and whether functional architecture sheds any new light on these or other situations. It relates directly to the "aggregate update" problem.

%T Parallel Sorting on a Recirculating Systolic Sorter
%A F.S. Wong, M.R. Ito
%I wong84
%S Computer Journal 27,3, 1984
%K 
%C 

%T Notes on Programming Linguistics
%A J.M. Wozencraft, A. Evans, Jr.
%I woze70
%S Dept. of Electrical Engineering, MIT, 1970
%K PAL, history, language definition, application, abstraction, evaluation, blackboard evaluation, Gedanken, interpreters, assignment, sharing, jumps, labels
%C 

%T A New Strictness Detection Algorithm
%A S.C. Wray
%I wray85
%S Aspens Workshop on Implementation of Functional Languages, Gteborg 1985
%K strictness analysis, lazy evaluation, types, annotations, termination
%C 

%T Programming Techniques for Functional Languages
%A S.C. Wray
%I wray86
%S Univ. Cambridge Computer Lab. Tech. Rep. 92
%K 
%C 

%T Non-strict Languages - Programming and Implementation
%A S.C. Wray, J. Fairbairn
%I wray89
%S Computer Journal, Special Issue on Lazy Functional Programming, 32(2), pp142-151
%K lazy
%C Non-strict evaluation improves the expressive power of functional languages at the expense of an apparent loss of efficiency. In this paper the authors give examples of this expressive power, taking as an example an interactive functional program and describing the programming techniques depending on non-strict evaluation which improved its design.

%T A New Technique for Strictness Analysis
%A D.A. Wright
%I wrig91
%S TAPSOFT '91, LNCS494
%K type inference, reduction, arrow expressions, algorithm, complexity
%C 

%T Global Variables Considered Harmful
%A W. Wulf, M. Shaw
%I wulf73
%S SIGPLAN 8,2, pp28-34
%K 
%C 

%T Parallel-Programming Transformation using a Metalanguage
%A J.A. Yang, Y. Choo
%I yang91
%S SIGPLAN 26, 7
%K 
%C 

%T Type Assignment in the Lambda-Calculus: Syntax and Semantics
%A C.B. Yelles
%I yell79
%S Ph.D. Thesis, Univ. of Wales, 1979
%K 
%C 

%T A Rewriting System for Categorical Combinators with Multiple Arguments
%A H. Yokouchi, T. Hikita
%I yoko90
%S SIAM Journal on Computers
19, pp78-87
%K 
%C 

%T A Functional and Modular Architecture for Scientific Computing
%A M.F. Young
%I youn85
%S FPCA'85, Nancy, LNCS 201, pp305-319
%K multiprocessor, FLO, hardware, architecture, streams, scientific computing
%C The system architecture is a modular, heterogeneous multiprocessor which supports the parallel evaluation of "Flo", a stream oriented functional language.


%T Finding Fixpoints in Function Spaces
%A J. Young, P. Hudak
%I youn86
%S Yale Univ. Dept. CS Report YALE/DCS/RR-505
%K strictness analysis semantics functional frontier analysis
%C 

%T The Theory and Practice of Semantics and Program Analysis for Higher Order Functional Programming Languages
%A J.H. Young
%I youn89
%S Ph.D. Thesis, YALEU/DCS/RR-669
%K 
%C 

%T Separate Compilation of Type-Parameterised Modules
%A T. Yuasa
%I yuas82
%S Journal of Information Processing 5,3, 1982
%K 
%C 

%T Contextual Rewriting
%A H. Zhang, J-L. Remy
%I zhan85
%S In LNCS 202
%K rewriting, contextual rewriting, case analysis, contextual normal form, confluence
%C 

%T A Data Flow Approach to the Evaluation of FP Programs
%A Z. Zhang, K.M. George, G.E. Hedrick
%I zhan89
%S Report OSU-CIS-TR-89-06, Oklahoma State Univ., Dept. of Computing and Info. Sciences

%K 
%C 

%T A Model with Nondeterministic Computation
%A M.V. Zilli
%I zill75
%S LNCS 37, pp287-296
%K 
%C 

%T Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form
%A M.V. Zilli
%I zill78
%S LNCS 62, pp477-493
%K 
%C 

%T Reduction Graphs in the Lambda Calculus
%A M.V. Zilli
%I zill84
%S Theoretical Computer Science 29,3, 1984
%K cyclic equivalence, spectra, condensed reduction graphs, significance of a reduction, cofinal reductions, linear reduction graphs
%C 

%T Reflections on the Church-Rosser Property, and "Real" Applications in Functional Systems
%A R. Zimmer
%I zimm91
%S In glas91, pp331-349, also Technical Report
GMD-F1P, Sankt Augustin
%K 
%C 

%T Cooperating Reduction Machines with Heap-Support
%A R. Zimmer
%I zimm91b
%S Technical Report
GMD, Sankt Augustin
%K 
%C 

%T A Heap-Supported Multiprocessor Reduction System
%A R. Zimmer
%I zimm91c
%S Technical Report
GMD, Sankt Augustin
%K 
%C 

%T Zur Pragmatik eines operationalisierten l-Kalkls als Basis fr interaktive Reduktionssysteme
%A R.M. Zimmer
%I zimm91d
%S R. Oldenbourg Verlag
Mnchen, Bericht der GMD Nr. 192.
%K 
%C 

%T Comparing Mark-and-sweep and Stop-and-copy Garbage Collection
%A B. Zorn
%I zorn90
%S In acm90, 87-98
%K measurement
%C 

