Text that causes trouble with Code Formatter extension for Chrome (https://chromewebstore.google.com/detail/code-formatter-json-css-j/bhimnoepicmcjfkbmhckamllnibadfal)

biblio.txt

%A John McCarthy
%D 1960
%J CACM
%K LISP applicative-programming lambda-calculus recursion
%L McCa60
%N 4
%P 184-95
%T Recursive Functions of Symbolic Expressions and their Computation by Machine, Part I
%V 3

%A Leslie M. Goldschlager
%D 1981
%J Software \(em Practice and Experience
%K recursion
%L Gold81
%P 745-51
%T Recursion in Small Storage
%V 11



%A W. B. Croft
%D 1982
%J Information Technology: Research and Development
%K IR database
%L Crof82
%P 73-96
%T An Overview of Information Systems
%V 1




%A Victor H. Yngve
%D October 1960
%J Proceedings of the American Philosophical Society
%K linguistics depth-hypothesis
%L Yngv60
%N 5
%P 444-66
%T A Model and an Hypothesis for Language Structure
%V 104


%A Martin L. Griss
%A Anthony C. Hearn
%D 1981
%J Software \(em Practice and Experience
%K LISP compilers portability optimization
%L Gris81
%P 541-605
%T A Portable LISP Compiler
%V 11

%A Dana S. Scott
%D September 1977
%J CACM
%K logic lambda-calculus denotational-semantics
%L Scot77
%N 9
%P 634-641
%T Logic and Programming Languages
%V 20
%X 1976 ACM Turing Award Lecture.




%A N. Solntseff
%D 1972
%J Information Processing Letters
%K extensibility
%L Soln72
%P 91-6
%T A Classification of Extensible Programming Languages

%A A. Sloman
%A S. Hardy
%A J. Gibson
%D 1983
%J Information Technology: Research and Development
%K Pop2 PROLOG LISP programming-environments
%L Slom83
%P 109-22
%T POPLOG: A Multilanguage Program Development Environment
%V 2

%A Joe Celko
%D Spring 1984
%J Abacus
%K towers-of-Hanoi
%L Celk84
%N 3
%P 54-7
%T Mutants of Hanoi
%V 1

%A C. G. Bell
%A A. Kotok
%A T. N. Hastings
%A R. Hill
%D January 1978
%J CACM
%K PDP-10 architecture
%L Bell78
%N 1
%P 44-61
%T The Evolution of the DECsystem 10
%V 21
%X Contains PDP-10 instruction set chart.

%A W. A. Wulf
%A D. B. Russel
%A A. N. Habermann
%D December 1971
%J CACM
%K BLISS PDP-10 SILs
%L Wulf71
%N 12
%P 780-90
%T BLISS: A Language for Systems Programming
%V 14

%A Ben Wegbreit
%D May 1974
%J CACM
%K EL1 data-types extensibility
%L Wegb74
%N 5
%P 251-64
%T The Treatment of Data Types in EL1
%V 17

%A F. N. Teskey
%D 1983
%J Journal of Information Science
%K IR free-text
%L Tesk83
%P 165-72
%T Implementing the basic functions of free text information
retrieval using binary relationaships
%V 6

%A Shirley A. Perry
%A Peter Willett
%D 1983
%J Journal of Information Science
%K IR inverted-files
%L Perr83
%P 59-66
%T A review of the use of inverted files for best match
searching in information retrieval systems
%V 6

%A Phyllis A. Richmond
%D 1982
%J Studien zur Klassifikation
%K classification syndetic-structure
%L Rich82
%P 149-56
%T Classification in Syndetic Structures
%V 11

%A James R. Bell
%D June 1973
%J CACM
%K interpreters threaded-code
%L Bell73
%N 6
%P 370-2
%T Threaded Code
%V 16

%A Robert B. K. Dewar
%D June 1975
%J CACM
%K threaded-code interpreters Snobol4
%L Dewa75
%N 6
%P 330-1
%T Indirect Threaded Code
%V 18

%A D. R. McGregor
%A J. R. Malone
%D 1982
%J Information Technology: Research and Development
%K IR database semantic-nets
%L McGr82
%P 55-72
%T The Fact Database: A System Using Generic Associative Networks
%V 1

%A M. F. Porter
%D 1982
%J Information Technology: Research and Development
%K catalogs
%L Port82
%P 113-29
%T GOS: A Package for Making Catalogues
%V 1

%A Alfred V. Aho
%A Margaret J. Corasick
%D June 1975
%J CACM
%K IR string-searching FSA
%L Aho75
%N 6
%P 333-40
%T Efficient String Matching An Aid to Bibliographic Search
%V 18

%A J. Nevil Brownlee
%D July 1977
%J CACM
%K Snobol4 ALGOL-60 pattern-matching string-processing
%L Brow77
%N 7
%P 527-9
%T An Algol-Based Implementation of SNOBOL4 Patterns
%V 20

%A W. H. Burge
%D September 1972
%J IBM Journal of Research and Development
%K combinatorics applicative-programming
%L Burg72
%P 450-61
%T Combinatory Programming and Combinatorial Analysis

%A W. H. Burge
%D January 1975
%J IBM Journal of Research and Development
%K co-routines streams applicative-programming
%L Burg75
%P 12-25
%T Stream Processing Functions

%A John Backus
%D August 1978
%J CACM
%K applicative-programming program-correctness
%L Back78
%N 8
%P 613-41
%T Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
%V 21
%X 1977 ACM Turing Award Lecture.

%A C. J. van\0Rijsbergen
%D June 1977
%J Journal of Documentation
%K IR term-dependence term-weighting
%L Rijs77
%N 2
%P 106-19
%T A Theoretical Basis for the Use of Co-occurrence Data in Information Retrieval
%V 33

%A Abraham Bookstein
%D 1983
%J JASIS
%K IR decision-theory relevence-feedback
%L Book83
%N 5
%P 331-42
%T Information Retrieval: A Sequential Learning Process
%V 34

%A Bruce H. Barnes
%D December 1972
%J Computing Surveys
%K FSA
%L Barn72
%N 4
%P 221-39
%T A Programmer's View of Automata
%V 4

%A Robert S. Boyer
%A J. Strother Moore
%D October 1977
%J CACM
%K string-searching FSA
%L Boye77
%N 10
%P 762-72
%T A Fast String Searching Algorithm
%V 20

%A John Guttag
%D June 1977
%J CACM
%K abstract-data-types
%L Gutt77
%N 6
%P 396-404
%T Abstract Data Types and the Development of Data Structures
%V 20

%A Paul Klint
%D October 1979
%J CACM
%K compilers errors
%L Klin79
%N 10
%P 557-9
%T Line Numbers Made Cheap
%V 22

%A R. J. W. Housden
%D 1975
%J Computer Journal
%K string-processing
%L Hous75
%N 2
%P 150-6
%T On String Concepts and their Implementation
%V 18

%A D. A. Turner
%D June 1979
%J The Journal of Symbolic Logic
%K combinatory-logic
%L Turn79
%N 2
%P 267-70
%T Another Algorithm for Bracket Abstraction
%V 44

%A Hamish I. E. Gunn
%A Ronald Morrison
%D July  20, 1979
%J Information Processing Letters
%K constants
%L Gunn79
%N 1
%P 1-4
%T On the Implementation of Constants
%V 9

%A E. A. Ashcroft
%A W. W. Wadge
%D July 1977
%J CACM
%K Lucid applicative-programming
%L Ashc77
%N 7
%P 519-26
%T Lucid, a Nonprocedural Language with Iteration
%V 20

%A Ronald Morrison
%D 1982
%J Sigplan Notices
%K string-processing data-types
%L Morr82
%N 3
%P 46-52
%T The String as a Simple Data Type
%V 17

%A D. A. Turner
%D August 1977
%J Information Processing Letters 
%T Efficient Compilation of Lazy Evaluation
%V 19

%A Abraham Bookstein
%D March 1973
%J CACM
%K IR string-searching
%L Book73
%N 3
%P 180-1
%T On Harrison's Substring Testing Technique
%V 16
%X Harr71

%A Malcolm C. Harrison
%D December 1971
%J CACM
%K IR string-searching
%L Harr71
%N 12
%P 777-9
%T Implementation of the Substring Test by Hashing
%V 14
%X Book73

%A Mitchell Wand
%D January 1983
%J Proceedings of the 10th ACM POPL Symposium, Austin, TX
%K compilers combinatory-logic applicative-programming
%L Wand83
%P 190-6
%T Loops in Combinator-Based Compilers

%A J. R. Parker
%D July  26, 1984
%J Information Processing Letters
%K data-representations
%L Park84
%P 17-9
%T On Converting Character Strings to Integers
%V 19

%A John C. Reynolds
%D May 1970
%J CACM
%K Gedanken coroutine applicative-programming
%L Reyn70
%N 5
%P 308-19
%T GEDANKEN--A Simple Typeless Language Based on the
Principle of Completeness and the Reference Concept
%V 13

%A David M. Harland
%D 1984
%J Computer Journal
%K data-types type-equivalence polymorphism
%L Harl84
%N 1
%P 47-56
%T User-Defined Types in a Polymorphic Language
%V 27

%A P. G. Harrison
%D 1982
%J Computer Journal
%K applicative-programming memory-management
%L Harr82
%N 2
%P 264-71
%T Efficient Storage Management for Functional Languages
%V 25

%A [Aleph-null]
%D 1972
%J Software--Practice and Experience
%K games Darwin
%L Alep72
%O Computer Recreations
%P 93-6
%T Darwin
%V 2

%A Eugene W. Myers
%D December  15, 1983
%J Information Processing Letters
%K applicative-programming stacks
%L Myer83
%P 241-8
%T An Applicative Random-Access Stack
%V 17

%A Mark Rain
%D 1973
%J Software \(em Practice and Experience
%K debugging humor
%L Rain73
%P 61-3
%T Two Unusual Methods for Debugging System Software
%V 3

%A J. E. Stoy
%A C. Strachey
%D 1972
%J Computer Journal
%K OS6 operating-systems BCPL
%L Stoy72
%N 2
%P 117-24
%T OS6--An Experimental Operating System for a Small Computer. Part 1: General Principles and Structure
%V 15

%A J. E. Stoy
%A C. Strachey
%D 1972
%J Computer Journal
%K OS6 operating-systems BCPL streams
%L Stoy72b
%N 3
%P 195-203
%T OS6--An Experimental Operating System for a Small Computer. Part 2: Input/Output and Filing System
%V 15

%A [Anonymous]
%D 1974
%J Software \(em Practice and Experience
%K humor debugging
%L Anon74
%O Editorial
%P 307
%T The Two Cultures
%V 4

%A Edward J. Gauss
%D November 1982
%J CACM
%K debugging humor Alaska wolves
%L Gaus82
%N 11
%O Pracniques
%P 780
%T The "Wolf Fence" Algorithm for Debugging
%V 25

%A Ted Tenny
%D February 1983
%J CACM
%K wolves foxes coyotes Cheshire-cats humor debugging
%L Tenn83
%N 2
%O Letter to the editor
%T On Animals Around the "Wolf Fence"
%V 26

%A Jan V. Garwick
%D September 1968
%J CACM
%K GPL data-types
%L Garw68
%N 9
%P 634-8
%T GPL, a Truly General Purpose Language
%V 11

%A James C. Tiernan
%D December 1970
%J CACM
%K graphs circuits search'
%L Tier70
%N 12
%P 722-6
%T An Efficient Search Algorithm to Find the Elementary Circuits of a Graph
%V 13

%A W. M. Waite
%D July 1970
%J CACM
%K Stage2 bootstrapping portability macro-processing
%L Wait70
%N 7
%P 415-21
%T The Mobile Programming System: STAGE2
%V 13

%A M. Richards
%D 1971
%J Software \(em Practice and Experience
%K BCPL portability bootstrapping abstract-machine
%L Rich71
%P 135-46
%T The Portability of the BCPL Compiler
%V 1

%A Lloyd Allison
%D 1983
%J Software \(em Practice and Experience
%K syntax-editors program-editors structure-editors
%L Alli83
%P 453-65
%T Syntax Directed Program Editing
%V 13

%A David R. Hanson
%D 1983
%J Software \(em Practice and Experience
%K code-optimization
%L Hans83
%P 745-63
%T Simple Code Optimizations
%V 13

%A Ian Sommerville
%D 1982
%J Software \(em Practice and Experience
%K pattern-matching S-algol
%L Somm82
%P 517-30
%T A Pattern Matching System
%V 12

%A Mark Manning
%D September 1983
%J Dr. Dobb's Journal
%K Forth sorting
%L Mann83
%N 83
%P 104-7
%T The Forth Sort
%X The algorithms are unreadable.

%A Ed Post
%D July 1983
%J Datamation
%K Pascal Teco humor
%L Post83
%P 263-5
%T Real Programmers Don't Use Pascal

%A R. A. Sammut
%A C. A. Sammut
%D May 1983
%J Australian Computer Journal
%K Prolog AI logic-programming
%L Samm83
%N 2
%P 42-51
%T PROLOG: A Tutorial Introduction
%V 15

%A James F. Gimpel
%D October 1974
%J SIGPLAN Notices
%K SNOBOL4 Sitbol
%L Gimp74
%P 11-9
%T Some Highlights of the SITBOL Language Extensions to SNOBOL4

%A Edward Wischmeyer
%D September 1983
%J Dr. Dobb's Journal
%K Forth
%L Wisc83
%N 83
%P 94-9
%T Some Forth Coding Standards

%A Henry Laxen
%D 1983
%J FORTH Dimensions
%K Forth multi-tasking
%L Laxe83
%N 4;5
%P 26-8;37-8
%T Multi-Tasking, Parts I and II
%V V

%A Michael C. McCord
%D January/March 1980
%J American Journal of Computational Linguistics
%K parsing natural-language grammars
%L McCo80
%N 1
%P 31-43
%T Slot Grammars
%V 6

%A Phyllis A. Richmond
%D January/March 1983
%J Library Resources and Technical Services
%K classification Smalltalk
%L Rich83
%P 88-93
%T Futuristic Aspects of Subject Access
%X A thoroughly ridiculous article.

%A Jon Bentley
%D May 1984
%J CACM
%K space-efficiency
%L Bent84
%N 5
%O Programming Pearls
%P 416-21
%T Squeezing Space
%V 27

%A Daniel G. Bobrow
%A Ben Wegbreit
%D October 1973
%J CACM
%K stacks coroutines dendrarchy
%L Bobr73
%N 10
%P 591-603
%T A Model and Stack Implementation of Multiple Environments
%V 16

%A Jon Bentley
%D April 1984
%J CACM
%K sorting
%L Bent84b
%N 4
%O Programming Pearls
%P 287-91
%T How to Sort
%V 27

%A Donald E. Knuth
%D April 1984
%J CACM
%K humor complexity
%L Knut84b
%N 4
%P 344-6
%T The Complexity of Songs
%V 27

%A Guy L. Steele,\0Jr.
%D April 1984
%J CACM
%K humor communication-protocols
%L Stee84
%N 4
%P 347-8
%T The Telnet Song "Control-Uparrow Q"
%V 27
%X Sheet music, voice with guitar chords.

%A Preet J. Nedginn
%A Trebor L. Bworn
%D April 1984
%J CACM
%K humor footnotes
%L Nedg84
%N 4
%P 351
%T CLOG: An Ada Package for Automatic Footnote Generation in Unix
%V 27

%A R. Lawrence Clark
%D April 1984
%J CACM
%K goto come-from control-structures humor
%L Clar84
%N 4
%P 349-50
%T A Linguistic Contribution to GOTO-less Programming
%V 27

%A Peter Brown
%D April 1984
%J CACM
%K humor Fortran Algol PL/I
%L Brow84
%N 4
%P 352-5
%T Languages: Three Interviews
%V 27
%X Comprising "Taking a Stroll Down Babel Street",
"The Faded Majesty of Lady Algol", and "Having Everything Under One Roof".

%A J. B. Cadwallader-Cohen
%A W. W. Zysiczk
%A R. B. Donnelly
%D April 1984
%J CACM
%K humor AI cognition
%L Cadw84
%N 4
%P 356-7
%T The Chaostron: An Important Advance in Learning Machines
%V 27

%A Douglas Comer
%D June 1979
%J Computing Surveys
%K B-trees file-organization
%L Come79
%N 2
%P 121-37
%T The Ubiquitous B-Tree
%V 11

%A G. Salton
%D March 1966
%J CACM
%K IR
%L Salt66
%N 3
%P 204-10
%T Data Manipulation and Programming Problems in Automatic Information Retrieval
%V 9

%A Bella Hass Weinberg
%D 1974
%J Information Storage and Retrieval
%K IR bibliographic-coupling classification
%L Wein74
%P 189-96
%T Bibliographic Coupling: A Review
%V 10

%A Steve Olson
%D January/February 1984
%J Science 84
%K Dijkstra
%L Olso84
%P 75-80
%T Sage of Software

%A Charles Antony Richard Hoare
%D February 1981
%J CACM
%K programming-languages, history Turing-award
%L Hoar81
%N 2
%P 75-83
%T The Emperor's Old Clothes
%V 24
%X The 1980 ACM Turing Award Lecture.

%A Richard L. Wexelblat
%D 1981
%J Software \(em Practice and Experience
%K teaching-programming
%L Wexe81
%P 733-40
%T The Consequences of One's Firt Programming Language
%V 11

%A Malcolm C. Harrison
%D 1970
%J Proceedings of the Spring Joint Computer Conference
%K BALM list-processing
%L Harr70
%P 507-11
%T BALM--An Extendable List-processing Language

%A Gordon E. Anderson
%A Kenneth C. Shumate
%D August 1982
%J Computer
%K comparative-study of programming languages
%L Ande82
%P 29-36
%T Selecting a Programming Language, Compiler, and Support Environment: Method and Example

%A Stuart E. Madnick
%D July 1967
%J CACM
%K string-processing data-representations
%L Madn67
%N 7
%P 420-4
%T String Processing Techniques
%V 10

%A David R. Hanson
%D 1976
%J Software \(em Practice and Experience
%K Snobol4
%L Hans76
%P 245-54
%T Variable Associations in SNOBOL4
%V 6

%A Charles M. Geschke
%A James H. Morris,\0Jr.
%A Edwin H. Satterthwaite
%D August 1977
%J CACM
%K Mesa data-types modules
%L Gesc77
%N 8
%P 540-53
%T Early Experience with Mesa
%V 20

%A John C. Pierce
%D 1978
%J Information Processing & Management
%K APL indexing
%L Pier78
%P 85-91
%T Back-of-Book Subject Indexing with APL Automated Indexing for Those Without Computer Background
%V 14

%A R. A. Brooker
%D 1982
%J Computer Journal
%K BCPL database
%L Broo82
%N 4
%P 448-64
%T A 'Database' Subsystem for BCPL
%V 25

%A D. J. Dodds
%D June 1982
%J CACM
%K hashing spelling
%L Dodd82
%N 6
%O Pracniques
%P 368-70
%T Reducing Dictionary Size by Using a Hashing Technique
%V 25

%A Richard I. Cowderoy
%A Peter J. L. Wallis
%D 1982
%J Software \(em Practice and Experience
%K BCPL Z80 portability bootstrapping
%L Cowd82
%P 235-9
%T The Transfer of a BCPL Compiler to the Z80 Microcomputer
%V 12

%A M. Richards
%B Machine Oriented Higher Level Languages
%D 1974
%E v. d. Poel & Maarssen
%I North Holland
%K BCPL bootstrapping portability abstract-machine
%L Rich74
%P 265-71
%T Bootstrapping the BCPL Compiler Using Intcode

%A Abraham Bookstein
%D June 1983
%J Journal of Documentation
%K IR probability
%L Book83b
%N 2
%P 63-72
%T Outline of a General Probabilistic Retrieval Model
%V 39

%A J. J. Pollock
%D December 1982
%J Journal of Documentation
%K spelling
%L Poll82
%N 4
%O Documentation Note
%P 282-91
%T Spelling Error Detection and Correction by Computer Some Notes and a Bibliography
%V 38

%A Calvin N. Mooers
%D March 1966
%J CACM
%K TRAC macro-processing string-processing
%L Mooe66
%N 3
%P 215-9
%T TRAC, A Procedure-Describing Language for the Reactive Typewriter
%V 9

%A Calvin N. Mooers
%B Symbol Manipulation Languages, Techniques
%D 1968
%I North Holland
%K TRAC macro-processing string-processing
%L Mooe68
%P 178-90
%T How Some Fundamental Problems are Treated in the Design of the TRAC Language

%A Calvin N. Mooers
%A L. P. Deutsch
%B Proceedings of the ACM 20th National Conference
%D 1965
%K TRAC macro-processing string-processing
%L Mooe65
%P 229-46
%T TRAC, A Text Handling Language


%L Land66
%A P. J. Landin
%T The Next 700 Programming Languages
%J CACM
%V 9
%P 157-66
%N 3
%D March 1966
%K ISWIM; applicative programming

%L Rich84
%A H. Richards
%T An Overview of ARC Sasl
%J SIGPLAN Notices
%V 19
%N 10
%P 405
%D October 1984
%K applicative programming

%L Orma84
%A Levent Orman
%T Nested Set Languages for Functional Databases
%J Information Systems
%V 9
%P 241-9
%N 3/4
%D 1984

%L Rade84
%A A. A. Radensky
%T Functional Programming in the Style of Logical Programming
%J Doklady Bolgarskoi Akademii Nauk
%V 37
%N 6
%P 741-4
%D 1984
%K applicative programming

%L Fins80
%A Craig A. Finseth
%T Theory and Practice of Text Editors, or, A Cookbook for an Emacs
%I MIT Laboratory for Computer Science
%C Cambridge, Mass.
%D June 1980
%O BS thesis.
%K text editing

%L Yngv84
%A Victor H. Yngve
%T Concepts of System in Science and in Linguistics
%J Eleventh LACUS Forum
%D 1984

%L Port82a
%A M. F. Porter
%T Implementing a  Probabilistic Information Retrieval System
%J Information Technology: Research and Development
%V 1
%P 131-56
%D 1982
%K CUPID; GOS

%L Cisn84
%A Gerardo Cisneros
%A Harold V. McIntosh
%T REC--A Regular Expression Compiler
%D 1984
%K Markov algorithms

%L Macl83
%A B. J. MacLennan
%T Overview of Relational Programming
%J SIGPLAN Notices
%V 18
%P 36-45
%N 3
%D March 1983
%K applicative programming

%L Floy67
%A Robert W. Floyd
%T Nondeterministic Algorithms
%J Journal of the ACM
%V 14
%N 4
%P 636-44
%D October 1967
%K combinatorics; backtracking; eight queens problem

%L Chai75
%A Gregory J. Chaitin
%T Randomness and Mathematical Proof
%J Scientific American
%V 232
%N 5
%P 47-52
%D 1975
%K nondeterminism; induction

%L Hons83
%A U. Honschopp
%A W.-M. Lippe
%A F. Simon
%T Compiling Functional Languages for von Neumann Machines
%J SIGPLAN Notices
%D June 1983
%V 18
%N 6
%P 22-7
%S applicative programming

%L Shul83
%A Jon Shultis
%T A Functional Shell
%J SIGPLAN Notices
%D June 1983
%V 18
%N 6
%P 202-11
%S applicative programming, operating systems

%L Hend80
%A Peter Henderson
%T Functional Programming: Application and Implementation
%C Englewood Cliffs, NJ
%I Prentice/Hall
%D 1980
%K applicative programming, Lisp

%L Darl82
%A J. Darlington
%A P. Henderson
%A D. A. Turner
%T Functional Programming and its Applications: An Advanced Course
%C Cambridge
%I Cambridge University Press
%D 1982
%K applicative programming, KRC, Lisp, FP

%L Burg75a
%# QA76.6.B92
%A William H. Burge
%T Recursive Programming Techniques
%I Addison-Wesley
%C Reading, MA
%D 1975
%K applicative programming, ISWIM, parsing, sorting, lambda calculus,
data structures
%X Really a book on programming languages and data structures. Burge develops
an incredibly concise style of programming using his variant of ISWIM.

%L Curr77
%A Haskell B. Curry
%T Foundations of Mathematical Logic
%C New York
%I Dover
%D 1977
%K logic, combinatory logic

%L Ghez82
%A Carlo Ghezzi
%A Mehdi Jazayeri
%T Programming Language Concepts
%C New York
%I Wiley
%D 1982

%L Rich79
%A Martin Richards
%A Colin Whitby-Strevens
%T BCPL\(emThe Language and its Compiler
%C Cambridge
%I The University Press
%D 1979

%L Stee84a
%A Guy L. Steele,\0Jr.
%T Common Lisp
%C [n.p.]
%I Digital Press
%D 1984

%L Dijk76
%A Edsger W. Dijkstra
%T A Discipline of Programming
%C Englewood Cliffs, N. J.
%I Prentice-Hall
%D 1976
%K GCL; semantics; program prooving

%L Kern78a
%A Brian W. Kernighan
%A Dennis M. Ritchie
%T The C Programming Language
%C Englewood Cliffs, N. J.
%I Prentice-Hall
%D 1978

%L Rijs79
%A C. J. van\0Rijsbergen
%T Information Retrieval, Second Edition
%C London
%I Butterworths
%D 1979

%L Abel85
%A Harold Abelson
%A Gerald Jay Sussman
%A Julie Sussman
%T Structure and Interpretation of Computer Programs
%C Cambridge, Mass.
%I MIT Press
%D 1985
%K Scheme

%L Maur68
%A W. D. Maurer
%T An Improved Hash Code for Scatter Storage
%J CACM
%D January, 1968
%V 11
%N 1
%P 35-7
%S searching

%L Morr68
%A Robert Morris
%T Scatter Storage Techniques
%J CACM
%D January, 1968
%V 11
%N 1
%P 38-44
%S searching

%L Bell70
%A James R. Bell
%T The Quadratic Quotient Method: a Hash Code Eliminating Secondary
Clustering
%J CACM
%D February, 1970
%V 13
%N 2
%P 107-9
%S searching

%L Macl73
%A B. J. MacLennan
%T FEN \(em An Axiomatic Basis for Program Semantics
%J CACM
%D August, 1973
%V 16
%N 8
%P 468-74
%S lambda-calculus; program prooving

%L Gris83b
%A Ralph E. Griswold
%A Madge T. Griswold
%T The Icon Programming Language
%C Englewood Cliffs, New Jersey
%I Prentice-Hall
%D 1983
%K coroutines

%L Harl84a
%A D. M. Harland
%T Polymorphic Programming Languages
%C Chichester
%I Ellis Horwood
%D 1984

%L Ashc76
%A E. A. Ashcroft
%A W. W. Wadge
%T Lucid \(em A Formal System for Writing and Proving Programs
%J SIAM Journal on Computing
%D September 1976
%V 5
%N 3
%P 336-54
%S program proving; formal semantics; formal systems

%L Codd70
%A E. F. Codd
%T A Relational Model of Data for Large Shared Data Banks
%J CACM
%D June, 1970
%V 13
%N 6
%P 377-87
%S database

%L Cook84
%A D. J. Cooke
%A H. E. Bez
%T Computer Mathematics
%C Cambridge, England
%I Cambridge University Press
%D 1984

%L Sten71
%A S"oren Stenlund
%T Introduction to Combinatory Logic
%C Uppsala
%I Uppsala Universitet
%D 1971

%L Stan71
%A Gerald B. Standley
%T New Methods in Symbolic Logic
%C Boston
%I Houghton Mifflin
%D 1971
%K class logic

%L Hail84
%A Theodore Hailperin
%T Probability Logic
%J Notre Dame Journal of Formal Logic
%D July 1984
%V 25
%N 3
%P 198-212

%L Reed84
%A Alan Reed
%T Anatomy of a Text Analysis Package
%J Computer Languages
%D 1984
%V 9
%N 2
%P 89-96
%S literary; text processing; set theory; inverted file

%L Maur83
%A Peter M. Maurer
%A Arthur E. Oldehoeft
%T The Use of Combinators in Translating a Purely Functional Language
to Low-level Data-flow Graphs
%J Computer Languages
%D 1983
%V 8
%N 1
%P 27-45
%S applicative programming; parallel processing

%L Stan54
%A Gerald B. Standley
%T Ideographic Computation in the Propositional Calculus
%J Journal of Symbolic Logic
%D 1954
%V 19
%N 3
%P 169-71
%S propositional logic; logic diagrams

%L Parr54
%A William Tuthill Parry
%T A New Symbolism for the Propositional Calculus
%J Journal of Symbolic Logic
%D September 1954
%V 19
%N 3
%P 161-68
%S logic notation; trapezoid

%L Bent85
%A Jon Bentley
%T A Spelling Checker
%J Communications of the ACM
%D May 1985
%V 28
%N 5
%P 456-62

%L Earl70
%A Jay Earley
%A Howard Sturgis
%T A Formalism for Translator Interactions
%J Communications of the ACM
%D October 1970
%V 13
%N 10
%P 607-17
%S compiler; bootstrapping

%L Karl80
%A Hans Karlgren
%A Donald E. Walker
%T The Polytext System \(em A New Design for a Text Retrieval System
%D May 1980
%O Unpublished report.

%L Grun84
%A Dick Grune
%T How to Produce All Sentences from a Two-level Grammar
%J Information Processing Letters
%D 12 November 1984
%V 19
%P 181-5
%S van Wijngaarden grammars; VW-grammars

%L Heck78
%A Paul Heckel
%T A Technique for Isolating Differences Between Files
%J Communications of the ACM
%D April 1978
%V 21
%N 4
%P 264-8
%S file comparison

%L Blai85
%A David C. Blair
%A M. E. Maron
%T An Evaluation of Retrieval Effectiveness for a Full-Text Document
Retrieval System
%J Communications of the ACM
%D March 1985
%V 28
%N 3
%P 289-99
%S information retrieval

%L Land64
%A P. J. Landin
%T The Mechanical Evaluation of Expressions
%J Computer Journal
%D 1964
%V 6
%N 4
%P 308-20
%S functional programming; applicative programming; lambda
calculus

%L Aiel81
%A Luigia Aiello
%T An Efficient Interpreter for the Lambda-Calculus
%J Journal of Computer and System Sciences
%D 1981
%V 23
%P 383-424
%S functional programming; applicative programming

%L Gris85
%A Ralph E. Griswold
%T Rebus \(em A SNOBOL4/Icon Hybrid
%J SIGPLAN Notices
%D February 1985
%V 20
%N 2
%P 7-16
%S Snobol4; Icon; Rebus

%L Burt84
%A F. Warren Burton
%T Annotations to Control Parallelism and Reduction Order in the
Distributed Evaluation of Functional Programs
%J ACM Transactions on Programming Languages and Systems
%D April 1984
%V 6
%N 2
%P 159-74
%S lambda calculus

%L Land65a
%A P. J. Landin
%T A Correspondence Between ALGOL 60 and Church's Lambda-Notation: Part I
%J Communications of the ACM
%D February 1965
%V 8
%N 2
%P 89-101
%S lambda calculus; functional programming; applicative programming

%L Coll60
%A George E. Collins
%T A Method for Overlapping and Erasure of Lists
%J Communications of the ACM
%D December 1960
%V 3
%N 12
%P 655-7
%S garbage collection

%L Subr84
%A P. A. Subrahmanyam
%A J.-H. You
%T On Embedding Functions in Logic
%J Information Processing Letters
%D 26 July 1984
%V 19
%P 41-46
%S lazy evaluation

%L Wise75
%A David S. Wise
%A Daniel P. Friedman
%A Stuart C. Shapiro
%A Mitchell Wand
%T Boolean-Valued Loops
%J BIT
%D 1975
%V 15
%P 431-51
%S control structures

%L Wise77
%A David S. Wise
%A Daniel P. Friedman
%T The One-Bit Reference Count
%J BIT
%D 1977
%V 17
%P 351-9
%S garbage collection

%L Nosh85
%A Kohei Noshita
%T Translation of Turner Combinators in O(n log n) Space
%J Information Processing Letters
%D 15 February 1985
%V 20
%P 71-4
%S lambda calculus; functional programming; applicative programming

%L Turn83
%A D. A. Turner
%T SASL Language Manual
%C [n.p.]
%I [privately published]
%D 1983
%K functional programming; applicative programming

%L Solo82
%A Daniel Solow
%T How to Read and Do Proofs : An Introduction to Mathematical Thought Process
%C New York
%I John Wiley & Sons
%D 1982
%K induction; predicate logic

%L Stee80
%A Guy Steele
%T Compiler Optimization Based on Viewing LAMBDA as RENAME Plus
GOTO
%E P. Winston
%B AI: An MIT Perspective, Vol. 2
%C Cambridge, MA
%I MIT Press
%D 1980
%K lisp

%L Wand80
%A Mitchell Wand
%T Continuation-Based Program Transformation Strategies
%J Journal of the ACM
%D January 1980
%V 27
%N 1

%L Shar85
%A John A. Sharp
%T Data Flow Computing
%I John Wiley & Sons, Inc.
%D 1985
%X Appears to have a slight English bias. Very little about SISAL,
some VAL.

%L Wadg85
%A William W. Wadge
%A Edward A. Ashcroft
%T Lucid, the Data Flow Programming Language
%I Academic Press
%D 1985

%L Hill85
%A W. Daniel Hillis
%T The Connection Machine
%I MIT Press
%D 1985
%X A collection of papers on the ideals of this architecture.

%L Pott85
%A J. L. Potter, ed.
%T The Massively Parallel Processor
%I MIT Press
%C Cambridge, MA
%D 1985

%L Wacl85
%A Keith Waclena
%T Assembly Language and Instruction Set for S-K Reduction Machine
%C Chicago
%I unpublished document
%D 1985
%K combinatory logic

%L Lesk75
%K CSTR
%R Comp. Sci. Tech. Rep. No. 39
%I Bell Laboratories
%C Murray Hill, New Jersey
%A M. E. Lesk
%T Lex \(em A Lexical Analyzer Generator
%D October 1975



%L Abda76
%A S. Kamal Abdali
%T An Abstraction Algorithm for Combinatory Logic
%J The Journal of Symbolic Logic
%D March 1976
%V 41
%N 1
%P 222-4

%L Yngv75
%A Victor H. Yngve
%T Depth and the Historical Change of the English Genitive
%J Journal of English Linguistics
%D 1975
%V 9
%P 47-57
%S depth hypothesis

%L Peyt85
%A Simon L. Peyton\0Jones
%T Yacc in Sasl -- an Exercise in Functional Programming
%J Software \(em Practice and Experience
%D August 1985
%V 15
%N 8
%P 807-20
%S applicative programming

%L Gold85
%A John Golden
%A Charles H. Moore
%A Leo Brodie
%T Fast Processor Chip Takes its Instructions Directly from Forth
%J Electronic Design
%D March 21, 1985
%P 127-38
%S instruction set

%L Brod85
%A Leo Brodie
%T A Threaded-Code Microprocessor Bursts Forth
%J Dr. Dobb's Journal
%D October, 1985
%P 42-50
%S instruction set

%L Morr73
%A James H. Morris,\0Jr
%T Protection in Programming Languages
%J Communications of the ACM
%D January, 1973
%V 16
%N 1
%P 15-21
%S types; access control; seals; trademarks; Gedanken; applicative programming

%L Leav72
%A B. M. Leavenworth
%T Programming Without the GOTO
%J Proceedings of the ACM National Conference
%D August, 1972
%P 782-6
%S computability; combinatory logic; lambda calculus; Post
productions; Markov algorithms

%L Reyn72
%A John C. Reynolds
%T Definitional Interpreters for Higher-Order Programming Languages
%J Proceedings colluque international sur la programmation
%C Paris
%I Dunod
%D 1976
%K applicative programming

%A R. Barbuti
%A A. Martelli
%L Barb80
%T Static Type Checking for Languages with Parametric Types and
Polymorphic Procedures
%E B. Robinet
%B Actes du 4e colloque international sur la programmation
%I Springer-Verlag
%D 1980
%K denotational sematics

%A Silvio Lemos Meira
%L Meir84
%T Optimized Combinatoric Code for Applicative Language Implementation
%E M. Paul and B. Robinet
%B International Symposium on Programming; 6th Colloquium
%C Toulouse
%I Springer-Verlag
%D 1984
%K KRC

%A Robert Sedgewick
%L Sedg83
%T Algorithms
%C Reading, MA
%I Addison-Wesley
%D 1983
%K data structures; sorting; searching

%A Alfred V. Aho
%A John E. Hopcroft
%A Jeffrey D. Ullman
%L Aho83
%T Data Structures and Algorithms
%C Reading, MA
%I Addison-Wesley
%D 1983
%K sorting; searching

%L Berk74
%A K. J. Berkling
%T Reduction Languages for Reduction Machines
%J Computer Architecture News
%D December, 1974
%V 3
%N 4
%P 133-40
%S applicative programming; architecture; parallel processing
%O Proceedings of the 2nd Annual Symposium on Computer Architecture

%L Homm82
%A F. Hommes
%T The Heap/Substitution Concept \(em An Implementation of Functional
Operations on Data Structures for a Reduction Machine
%J SIGARCH Newsletter
%D April, 1982
%V 10
%N 3
%P 248-56
%S applicative programming; parallel processing
%O Proceedings of the 9th Annual Symposium on Computer Architecture

%L Falo85
%A Christos Faloutsos
%T Access Methods for Text
%J Computing Surveys
%D March, 1985
%V 17
%N 1
%P 49-74
%S information retrieval; signature files; approximate string
matching; compression; specialized hardware

%L Trau85
%A Kenneth R. Traub
%T An Abstract Parallel Graph Reduction Machine
%J SIGARCH Newsletter
%D June, 1985
%V 13
%N 3
%P 333-41
%S applicative programming
%O Proceedings of the 12th Annual Symposium on Computer Architecture
%# QA76.9.A73S9a v.12 1985

%L Know65
%A K. C. Knowlton
%T A Fast Storage Allocator
%J Communications of the ACM
%D October, 196 Communications of the ACM
%D April, 1960
%V 3
%N 4
%P 195-204
%S IPL

%L Cort82
%# QA76.6.C6650 1982
%A Cortesi, D.
%T Inside CP/M
%K eckhart charged; operating systems
%C New York
%I Holt, Rinehart and Winston
%D 1982

%L Horo83
%# WECK-506
%A Horowitz, E.
%T Programming Languages: A Grand Tour
%K eckhart
%C Rockville, Md.
%I Computer Science Press
%D 1983

%L Jone85
%A Simon L. Peyton\0Jones
%A Chris Clack
%A Jon Salkild
%T A Brief Overview of GRIP: A Parallel Graph Reduction Machine
%J PARSYM Digest
%D December 2, 1985
%V 1
%N 41

%L Mose71
%A Joel Moses
%T Algebraic Simplification: A Guide for the Perplexed
%J Communications of the ACM
%D August 1971
%V 14
%N 8
%P 527-37

%L Tane84
%A Andrew S. Tanenbaum
%T Structured Computer Organization, Second Edition
%C Englewood Cliffs, NJ
%I Prentice-Hall
%D 1984
%K architecture; virtual machines; multilevel machines; representation

%L Wegn68
%A Peter Wegner
%T Programming Languages, Information Structures, and Machine Organization
%C New York
%I McGraw-Hill
%D 1968
%K computer architecture

%L Atki85
%A Malcolm P. Atkinson
%A Ronald Morrison
%T Procedures as Persistent Data Objects
%J ACM Transactions on Programming Languages
%D October 1985
%V 7
%N 4
%P 539-59
%S abstract data types

%L Zade65
%A L. A. Zadeh
%T Fuzzy Sets
%J Information and Control
%D 1965
%V 8
%P 338-53

%L Levy83
%A Leon S. Levy
%T A Walk Through AWK
%J SIGPLAN Notices
%D December 1983
%V 18
%N 12
%P 69-85
%S string processing

%L Lesk78
%A M. E. Lesk
%T Typing Documents on the Unix System: Using the -ms Macros with
Troff and Nroff
%C Murray Hill, NJ
%I Bell Laboratories
%D November 13, 1978

%L Kern78
%A Brian W. Kernighan
%T A TROFF Tutorial
%C Murray Hill, NJ
%I Bell Laboratories
%D August 4, 1978
%K typesetting; text formatting

%L Lesk
%A M. E. Lesk
%T Some Applications of Inverted Indexes on the UNIX System
%C Murray Hill, NJ
%I Bell Laboratories
%D [n.d.]
%K refer; bibliographic databases

%L Morr
%A Robert Morris
%A Lorinda Cherry
%T DC \(em An Interactive Desk Calculator
%C Murray Hill, NJ
%I Bell Laboratories
%D [n.d.]
%K BC; arbitrary / infinite precision arithmetic

%L Ossa
%A Joseph F. Ossanna
%T NROFF / TROFF User's Manual
%C Murray Hill, NJ
%I Bell Laboratories
%D [n.d.]
%K typesetting; text formatting

%L Kern84
%A Brian W. Kernighan
%A Rob Pike
%T The UNIX Programming Environment
%C Englewood Cliffs, NJ
%I Prentice-Hall
%D 1984
%K C

%L Atki83
%A M. P. Atkinson
%A P. J. Bailey
%A K. J. Chisholm
%A P. W. Cockshott
%A R. Morrison
%T An Approach to Persistent Programming
%J Computer Journal
%D 1983
%V 26
%N 4
%P 360-5
%S S-algol; PS-algol; language design

%L Gris83
%A R. E. Griswold
%A Michael Novak
%T Programmer-Defined Control Operations
%J Computer Journal
%D 1983
%V 26
%N 2
%P 175-83
%S Icon; coroutines; control structures; generators; co-expressions

%L Cham83
%A John M. Chambers
%A William S. Cleveland
%A Beat Kleiner
%A Paul A. Tukey
%T Graphical Methods for Data Analysis
%C Belmont, CA
%I Wadsworth International Group
%D 1983
%K statistics; S

%L Thom74
%A Silvanus P. Thompson
%T Calculus Made Easy
%C London
%I Macmillan
%D 1910; 1974
%K differential calculus; integral calculus

%L Rast84
%A Leonard Rastrigin
%T This Chancy, Chancy, Chancy World
%C Moscow
%I Mir Publishers
%D 1984
%K cybernetics; random search; information science

%L Rown84
%A Derek Rowntree
%T Probability Without Tears
%C New York
%I Scribners
%D 1984

%L Barr71
%A D. W. Barron
%T Programming in Wonderland
%J Computer Bulletin
%D April 1971
%V 15
%P 153
%S debugging; error handling; humor

%L Lind72
%A C. H. Lindsey
%T ALGOL 68 with fewer tears
%J Computer Journal
%V 15
%N 2
%D May 1972
%P 176-88
%X This paper has been successfully compiled by an Algol 68
compiler.

%L Foxl85
%A Eric Foxley
%T Unix for Super-Users
%I Addison-Wesley
%C Wokingham, England
%D 1985

%L Berk71a
%A H. Berkling
%T A Computing Machine Based on Tree Structures
%J IEEE Transactions on Computers
%V 20
%N 4
%D April, 1971
%P 404-418
%K applicative programming; functional programming
%O Not owned.

%L Rice65
%A H. Gordon Rice
%T Recursion and Iteration
%J Communications of the ACM
%V 8
%N 2
%D February, 1965
%P 114-115

%L Turn81
%A David Turner
%T The Future of Applicative Programming
%B Trends in Information Processing Systems
%E A. J. W. Duijvestijn and P. C. Lockemann
%I Springer-Verlag
%C Berlin
%D 1981
%P 334-348
%K functional programming; Zermelo-Frankel abstraction; VLSI;
Pengala's algorithm for fast exponentiation
%O Proceedings of the 3rd Conference of the European Cooperation in
Informatics, Munich, October 20-22, 1981

%L Popp68
%A R. J. Popplestone
%T The Design Philosophy of POP-2
%J Machine Intelligence
%V 2
%D 1968
%P 393-402
%K language design; orthogonality

%L Stee77?
%A Guy Lewis Steele\0Jr.
%T Debunking the `Expensive Procedure Call' Myth, or, Procedure
Call Implementations Considered Harmful, or LAMBDA: The Ultimate
GOTO
%D 1977?
%P 153-162
%K compiler optimization

%L Glas83
%A Harvey Glass
%T Forth as the Kernel of a Functional Programming System
%D 1983
%K applicative programming
%B Proceedings 1983 Rochester Forth Applications Conference

%L Glas83b
%A Harvey Glass
%T Forth and Functional Programming Systems
%B Proceedings 1983 FORML Conference
%I FORML
%C Palo Alto, CA
%D 1983
%K applicative programming

%L Dixo83
%A R. D. Dixon
%A W. M. Edmindson
%A R. D. Franklin
%A J. L. Sloan
%T Extensions of FORTH for Functional Programming
%B Proceedings 1983 Rochester Forth Applications Conference
%I Institute for Applied Forth Research
%D 1984
%K applicative programming

%L Glas84
%A Harvey Glass
%T A Critical Evaluation of Threaded Interpretive Systems
%B Proceedings 1984 FORML Conference
%I Forth Interest Group
%K Forth

%L Rich69
%A Martin Richards
%T BCPL: A Tool for Compiler Writing and System Programming
%B Proceedings 1969 Spring Joint Computer Conference
%D 1969
%P 557-566

%L Kowa83
%A Robert Kowalski
%T Logic Programming
%B Information Processing 83
%E R. E. A. Mason
%I North-Holland
%D 1983
%P 133-145
%K Prolog; Horn clauses

%L Scho24
%A M. Sch\o'o\(um'nfinkel
%a schonfinkel schoenfinkel
%T Uber die Bausteine der mathematischen Logik
%J Mathematische Annalen
%V 92
%D 1924
%P 305-316
%K mathematical logic; higher-order functions; currying

%L Dunl85
%A Michael R. Dunlavey
%T A Progress Report on D, a Compiled Language Featuring
Continuations
%J SIGPLAN Notices
%V 20
%N 5
%D May 1985
%P 8-15
%K coroutines; object oriented programming

%L Arvi??
%A Arvind
%A J. Dean Brock
%T Streams and Managers
%K applicative programming; functional programming

%L Turn85
%A D. A. Turner
%T Functional Programs as Executable Specifications
%B Mathematical Logic and Programming Languages
%E C. A. R. Hoare and J. C. Shepherdson
%I Prentice/Hall
%C Englewood Cliffs, NJ
%D 1985
%P 29-54
%K applicative programming; Miranda


%L Cohe67
%A P. J. Cohen
%A R. Hersh
%T Non-Cantorian Set Theory
%J Scientific American
%D December 1967
%P 217

%L Berk71b
%A H. Berkling
%T A Computing Machine Based on Tree Structures
%J IEEE Transactions on Computers
%V 20
%N 4
%D April 1971
%P 404-18

%L Hild76
%A J. Hilden
%T Elimination of Recursive Calls Using a Small Table of `Randomly'
Selected Function Values
%J BIT
%V 16
%N 1
%D 1976
%P 60-73
%K memo functions

%L Kell86
%A Robert M. Keller
%A M. Ronan
%T Applicative Caching
%J ACM Transactions on Programming Languages and Systems
%V 8
%N 1
%D January 1986
%P 88-108

%L Dai86
%A Ke-Chang Dai
%T EDISON-80, a Language for Modular Programming of Parallel
Processes
%J Information Processing Letters
%V 22
%N 2
%D 18 January 1986
%P 61-72

%L Foo86
%A N. Y. Foo
%T Dewey Indexing of Prolog Traces
%J Computer Journal
%V 29
%N 1
%D February 1986
%P 17-19

%L Brow86
%A P. J. Brown
%T Interactive Documentation
%J Software \(em Practice and Experience
%V 16
%N 3
%D March 1986
%P 291-299
%K hypertext

%L Cisn86
%A Gerardo Cisneros
%A Harold V. McIntosh
%T Introduction to the Programming Language Convert
%J SIGPLAN Notices
%V 21
%N 4
%D April, 1986
%P 48-57
%K REC; regular expressions; pattern matching

%L Mart85
%A Johannes J. Martin
%T Generation of Efficient Single Processor Code for Typed
Functional Programming Languages
%I Virginia Tech Computer Science Department
%C Blacksburg, VA
%D 1985
%R TR 85-13
%K applicative programming; combinators
%X The code generator described is based on the \fIevaluation\fP
rather than the \fItranslation\fP of expressions. A compiler
that uses this concept has been implemented for a combinator
based, typed, FP-style language with higher order functionals.
Some advantages include modular structure for code generator,
production of excellent code for functional programming
languages, and ease of verification of translations to stack
machine programs.

%L Hugh86
%A R. John Muir Hughes
%T A Novel Representation for Lists and its Application to the
Function `Reverse'
%J Information Processing Letters
%V 22
%D 3 March 1986
%P 141-144
%K functional programming; applicative programming; program
transformation
%X A representation of lists as first-class functions is proposed.
Lists represented in this way can be appended together in
constant time, and can be converted back into ordinary lists in
time proportional to their length.

%L Slee86
%A M. R. Sleep
%A S. Holmstrom
%T A Short Note Concerning Lazy Reduction Rules for Append
%J Software \(em Practice and Experience
%V 12
%D 1982
%P 1082-1084
%K functional programming; applicative programming; SASL

%L Stal85
%A Richard M. Stallman
%T The GNU Manifesto
%D 1985
%K Unix; public domain; free software; copyright; licensing

%L Book86
%A Abraham Bookstein
%A Scott Deerwester
%A Robert Morrissey
%A Keith Waclena
%A Donald Ziff
%T A System for Integrated Bibliographic and Full-text Retrieval in
a Distributed Computing Environment
%B Computers and the Humanities: Today's Research, Tomorrow's
Teaching
%I University of Toronto
%C Toronto
%D March, 1986
%P 285-291
%K TIRA; ARTFL; TLG

%L Gard
%A Martin Gardner
%T Of Sprouts and Brussels Sprouts, Games with a Topological Flavor
%J Scientific American
%P 112-115

%L Dend86
%A Jacques Dendien
%T Un Systeme de Gestion de Base de Donnes Textuelles
%B Computers and the Humanities: Today's Research, Tomorrow's
Teaching
%I University of Toronto
%C Toronto
%D March, 1986
%P 252-266
%K text representation; text formalism; information retrieval; IR
%O In French.

%F Xerox 1984
%A [Xerox\0Printing\0Systems\0Group]
%T Character Code Standard
%I Xerox Corporation
%C Stamford, Conn.
%D April 1984
%R XSIS 058404
%K character set; diacritics

%L Celk84a
%A Joe Celko
%T What Day is It, Exactly?
%J Computer Language
%V 1
%N 4
%D December 1984
%P 47-50
%K Julian dates; calendar; leap year; time

%L Reec85
%A Peter Reece
%T APT: Automatic and Programmable Trees
%J Computer Language
%V 2
%N 4
%D April 1985
%P 43-55
%K extensible languages; threaded code

%L Kaga85
%A Claude A. R. Kagan
%A Karl Nicholas
%T List and String Processing with SAM76
%J Computer Language
%V 2
%N 11
%D November 1985
%P 69-74
%K macro processing; text processing

%L Vygo79
%A M. Vygodsky
%T Mathematical Handbook: Elementary Mathematics
%D 1979
%I Mir Publishers
%C Moscow
%K arithmetic; algebra; geometry; trigonometry; functions; graphs


%L PM8237.W45
%A J. C. Wells
%T The E. U. P. Concise Esperanto and English Dictionary
%D 1969
%I The English Universities Press
%C London

%L Guzm66
%A Adolfo Guzman
%A Harold V. McIntosh
%T Convert
%J Communications of the ACM
%V 9
%N 8
%D August 1966
%P 604-615
%K Lisp; pattern matching

%L Wise85
%A David S. Wise
%T The Applicative Style of Programming
%J Abacus
%V 2
%N 2
%D Winter 1985
%P 20-32
%K functional programming; streams

%L Taka82
%A Tadao Takaoka
%T Introduction of History to Variables
%J Software \(em Practice and Experience
%V 12
%D 1982
%P 595-597

%L Welc83
%A P. H. Welch
%T Parallel Assignment Revisited
%J Software \(em Practice and Experience
%V 13
%D 1983
%P 1175-1180
%K side-effects; paradigm

%L Floy79
%A Robert W. Floyd
%T The Paradigms of Programming
%J Communications of the ACM
%V 22
%N 8
%D August 1979
%P 455-460
%O 1978 ACM Turing Award Lecture.

%L Holm
%A W. N. Holmes
%T Is APL a Programming Language
%J Computer Journal
%V 21
%N 2
%P 128-131

%L Hans
%A D. R. Hanson
%T Filters in SL5
%J Computer Journal
%V 21
%N 2
%P 134-143

%L Cisn70
%A Gerardo Cisneros
%T A FORTRAN Coded Regular Expression Compiler for the
IBM 1130 Computing System
%J Acta Mexicana de Ciencia y Tecnologia
%V IV
%N 1
%D 1970
%P 30-81
%K REC

%L Glas85
%A Harvey Glass
%T Threaded Interpretive Systems and Functional Programming
Environments
%J SIGPLAN Notices
%V 20
%N 4
%D April 1985
%P 24-32
%K FORTH; applicative programming

%L Grei72
%A Irene Gloria Greif
%T Induction in Proofs about Programs
%D February 1972
%R MAC TR-93
%I Project MAC
%C Cambridge, MA
%K recursion

%L Hare78
%A David Harel
%T Characterizing Second Order Logic with First Order Quantifiers
%D February 1978
%R MIT/LCS/TM-95
%I MIT Laboratory for Computer Science
%C Cambridge, MA
%K Henkin prefix; partially ordered quantifiers

%L Rive76
%A Ronald L. Rivest
%T Optimal Arrangement of Keys in a Hash Table
%D July 1976
%R MIT/LCS/TM-73
%I MIT Laboratory for Computer Science
%C Cambridge, MA
%K searching; collision resolution

%L Kahn77
%A Gilles Kahn
%A David B. MacQueen
%T Coroutines and Networks of Parallel Processes
%B Information Processing 77
%E B. Gilchrist
%D 1977
%P 993-998
%I North-Holland
%K call by need; parallel computation; dynamic data structures

%L Flec82
%A A. C. Fleck
%T Verifying Abstract Data Types with SNOBOL4
%J Software \(em Practice and Experience
%V 12
%N 7
%D July 1982
%P 627-640

%L Wyk86
%A Christopher J. van\0Wyk
%T AWK as Glue for Programs
%J Software \(em Practice and Experience
%V 16
%N 4
%D April 1986
%P 369-388
%K Ideal; language preprocessors

%L Morr86
%A R. Morrison
%A A. L. Brown
%A P. J. Bailey
%A A. J. T. Davie
%A A. Dearle
%T A Persistent Graphics Facility for the ICL Perq
%J Software \(em Practice and Experience
%V 16
%N 4
%D April 1986
%P 351-367
%K PS-Algol

%L Baue82
%# QA76.6.B395130 1982
%A Friedrich L. Bauer
%A Hans W:ossner
%T Algorithmic Language and Program Development
%D 1982
%I Springer-Verlag
%C Berlin

%L Barr85
%A Rosalind Barrett
%A Allan Ramsay
%A Aaron Sloman
%T POP-11: A Practical Language for Artificial Intelligence
%D 1985
%I Ellis Horwood
%C Chichester, England
%# QA336.B370 1985

%L Weav49
%A Warren Weaver
%T The Mathematics of Communication
%J Scientific American
%V 181
%N 1
%D July 1949
%P 11-15
%K entropy; information science

%L Trig86
%A Randall H. Trigg
%A Mark Weiser
%T TEXTNET: A Network-Based Approach to Text Handling
%J ACM Transactions on Office Information Systems
%V 4
%N 1
%D January 1986
%P 1-23
%K hypertext; semantic nets

%L Pao86
%A Miranda Lee Pao
%A Laurie McCreery
%T Bibliometric Application of Markov Chains
%J Information Processing and Management
%V 22
%N 1
%D 1986
%P 7-17
%K stochastic processes

%L Gris83a
%A Ralph E. Griswold
%T Implementing SNOBOL4 Pattern Matching in Icon
%J Computer Languages
%V 8
%N 2
%D 1983
%P 77-92

%L Salt83
%A Richard Salter
%T Concurrent Applicative Implementations of Nondeterministic Algorithms
%J Computer Languages
%V 8
%N 2
%D 1983
%P 61-68

%L Baue81
%# QA9.58.A430
%A F. L. Bauer
%T Algorithms and Algebra
%B Algorithms in Modern Mathematics and Computer Science
%E A. P. Ershov and D. E. Knuth
%V 122
%S Lecture Notes in Computer Science
%D 1981
%P 421-429
%I Springer-Verlag
%C Berlin

%L Baue81a
%# QA76.6.S3
%A F. L. Bauer\0\fIet\0al\fP
%T Programming in a Wide Spectrum Language: A Collection of
Examples
%J Science of Computer Programming
%V 1
%D 1981
%P 73-114

%L Burs69
%A R. M. Burstall
%T Proving Properties of Programs by Structural Induction
%J Computer Journal
%V 12
%N 1
%D 1969
%P 41-48

%L Earl71
%A J. Early
%T Towards an Understanding of Data Structures
%J Communications of the ACM
%V 14
%N 10
%D 1971
%P 617-627

%L Frie78a
%A D. P. Friedman
%A D. S. Wise
%T Unbounded Computational Structures
%J Software \(em Practice and Experience
%V 8
%D 1978
%P 407-416

%L Gogu78
%# QA76.6.C870
%A J. A. Goguen
%A J. W. Thatcher
%A E. G. Wagner
%T An Initial Algebra Approach to the Specification, Correctness,
and Implementation of Abstract Data Types
%B Current Trends in Programming Methodology
%E R. T. Yeh
%V 4
%D 1978
%P 80-149
%I Prentice-Hall
%C Englewood Cliffs, NJ

%L Grie78
%A D. Gries
%T The Multiple Assignment Statement
%J IEEE Transactions on Software Engineering
%V 4
%D 1978
%P 89-93

%L Laut80
%A A. Laut
%T Safe Procedural Implementations of Algebraic Types
%J Information Processing Letters
%V 11
%D 1980
%P 147-151

%L Mago79
%# QA76.5.A1I61
%A G. A. Mago\*'
%T A Network of Microprocessors to Execute Reduction Languages
%J International Journal of Computer and Information Sciences
%V 8
%D 1979
%P 349-358, 435-471

%L Mark60
%A A. A. Markov
%T Theory of Algorithms
%J Proc. Steklov Inst. Math.
%V II, Ser. 15
%D 1960
%P 1-14
%O In English.

%L Morr71
%A J. H. Morris,\0Jr.
%T Another Recursion Induction Principle
%J Communications of the ACM
%V 14
%D 1971
%P 351-354

%L Baue79
%A F. L. Bauer
%T Detailization and Lazy Evaluation, Infinite Objects, and
Pointer Representation
%B Program Construction
%S Lecture Notes in Computer Science
%V 69
%D 1979
%I Springer-Verlag
%C Berlin


%L Joua85
%T Functional Programming Languages and Computer Architecture
%S Lecture Notes in Computer Science
%V 201
%D 1985
%I Springer-Verlag
%C Berlin
%E Jean-Pierre Jouannaud
%K applicative programming

%L Jung
%A Robert S. Jung
%A Joseph T. Kalash
%T Kanji U\s-2NIX\s+2: Yunikkusu wa Nihongo o Hanasemasu
(U\s-2NIX\s+2 Speaks Japanese)
%P 209-222
%K character sets

%L Turn85a
%A D. A. Turner
%T Miranda: A Non-strict Functional Language with Polymorphic Types
%B Functional Programming Languages and Computer Architecture
%E Jean-Pierre Jouannaud
%S Lecture Notes in Computer Science
%V 201
%D 1985
%I Springer-Verlag
%C Berlin
%K applicative programming

%L Wadl85
%A Philip Wadler
%T How to Replace Failure by a List of Successes
%B Functional Programming Languages and Computer Architecture
%E Jean-Pierre Jouannaud
%S Lecture Notes in Computer Science
%V 201
%D 1985
%I Springer-Verlag
%C Berlin
%K applicative programming; backtracking; exception handling; lazy
evaluation

%L Hugh85
%A John Hughes
%T Lazy Memo-functions
%B Functional Programming Languages and Computer Architecture
%E Jean-Pierre Jouannaud
%S Lecture Notes in Computer Science
%V 201
%D 1985
%I Springer-Verlag
%C Berlin
%K applicative programming; lazy evaluation

%L John85
%A Thomas Johnsson
%T Lambda Lifting: Transforming Programs to Recursive Equations
%B Functional Programming Languages and Computer Architecture
%E Jean-Pierre Jouannaud
%S Lecture Notes in Computer Science
%V 201
%D 1985
%I Springer-Verlag
%C Berlin
%K applicative programming

%L Brow85
%A D. R. Brownbridge
%T Cyclic Reference Counting for Combinator Machines
%B Functional Programming Languages and Computer Architecture
%E Jean-Pierre Jouannaud
%S Lecture Notes in Computer Science
%V 201
%D 1985
%I Springer-Verlag
%C Berlin
%K applicative programming; garbage collection

%L Nikh85
%A Rishiyur S. Nikhil
%T Practical Polymorphism
%B Functional Programming Languages and Computer Architecture
%E Jean-Pierre Jouannaud
%S Lecture Notes in Computer Science
%V 201
%D 1985
%I Springer-Verlag
%C Berlin
%K applicative programming; type checking


%L Turn84
%A S. J. Turner
%T W-Grammars for Logic Programming
%B Implementations of Prolog
%E J. A. Campbell
%D 1984
%P 352-368
%I Ellis Horwood
%C Chichester, England
%K WLOG; 2-level grammars; two-level grammars; van Wijngaarden grammars

%L Wacl
%A Keith Waclena
%T A Parser for the Metasyntax of the Logic Programming
Language WLOG
%D [n.d.]
%C Chicago
%K WLOG; van Wijngaarden grammars; 2-level grammars; two-level
grammars; backtracking; applicative programming; functional programming

%L Wads71
%A C. P. Wadsworth
%T Semantics and Pragmatics of the Lambda Calculus
%D 1971
%I Oxford University
%O Ph. D. Thesis
%K call by need
%X Introduced the notion of call by need.

%L Bird84
%A R. S. Bird
%T Using Circular Programs to Eliminate Multiple Traversals
of Data
%J Acta Informatica
%V 21
%D 1984
%P 239-250

%L Bird77a
%A R. S. Bird
%T Notes on Recursion Elimination
%J Communications of the ACM
%V 20
%N 6
%D June 1977

%L Burs68
%A R. M. Burstall
%T Semantics of Assignment
%B Machine Intelligence 2
%E Ella Dale and Donald Michie
%D 1968
%P 3-20
%I Oliver and Boyd
%C Edinburgh
%K ISWIM; applicative programming; functional programming;
lambda calculus

%L Thim86
%A H. Thimbleby
%T Experiences of `Literate Programming' using Cweb
(A Variant of Knuth's Web)
%J Computer Journal
%V 29
%N 3
%D 1986
%P 201-211
%K Web; pretty printing

%L Gehl86
%A Vijay Gehlot
%A Y. N. Srikant
%T An Interpreter for SLIPS \(em an Applicative Language Based
on Lambda-Calculus
%J Computer Languages
%V 11
%N 1
%D 1986
%P 1-13
%K functional programming; call by need

%L Fran85
%A Ole Immanuel Franksen
%T The Nature of Data \(em From Measurements to Systems
%J BIT
%V 25
%N 1
%D 1985
%P 24-50

%L Clou55
%A Benn E. Clouser
%A Herman Skolnik
%T A Procedure for the Identification of Languages
%J Journal of Chemical Education
%V 32
%D 1955
%P 118-122
%K systems of writing; scripts; alphabets

%L Hoar75
%A C. A. R. Hoare
%T Recursive Data Structures
%J International Journal of Computer and Information Sciences
%V 4
%D 1975
%P 105-132
%K BNF-based notation

%L Chur41
%A Alonzo Church
%T The Calculi of Lambda-Conversion
%S Annals of Mathematics Studies
%V 6
%D 1941
%I The University Press
%C Princeton
%K lambda calculus; mathematical logic

%L McIn68
%A Harold V. McIntosh
%T A CONVERT Compiler of REC for the PDP-8
%J Acta Mexicana de Ciencia y Tecnologia
%V II
%N 1
%D 1968
%P 33-43
%K regular expressions; pattern matching

%L Darl81
%A John Darlington
%T The Structured Description of Algorithm Derivations
%B Algorithmic Languages
%E J. W. de Bakker and J. C. van Vliet
%D 1981
%P 221-250
%I North-Holland
%C Amsterdam
%O Proceedings of the International Symposium on Algorithmic Languages.
%K Hope; applicative programming; functional programming; fold/unfold system

%L Burs77
%A R. M. Burstall
%A J. Darlington
%T A Transformation System for Developing Recursive Programs
%J Journal of the ACM
%D 1977
%P 44-67
%K fold/unfold system

%L Darl81a
%A J. Darlington
%T An Experimental Program Transformation and Synthesis System
%J Artificial Intelligence Journal
%V 16
%D 1981
%P 1-46
%K fold/unfold system

%L AMS61
%E Roman Jakobson
%T Structure of Language and its Mathematical Aspects
%S Proceedings of Symposia in Applied Mathematics
%V XII
%D 1961
%I American Mathematical Society
%C Providence, RI
%O Sponsored by American Mathematical Society, Association
for Symbolic Logic, Linguistic Society of America.

%L Curr61
%A Haskell B. Curry
%T Some Logical Aspects of Grammatical Structure
%B Structure of Language and its Mathematical Aspects
%E Roman Jakobson
%S Proceedings of Symposia in Applied Mathematics
%V XII
%P 56-68
%D 1961
%I American Mathematical Society
%C Providence, RI
%K combinatory logic

%L Chao61
%A Yuen\0Ren\0Chao
%T Graphic and Phonetic Aspects of Linguistic and Mathematical
Symbols
%B Structure of Language and its Mathematical Aspects
%E Roman Jakobson
%S Proceedings of Symposia in Applied Mathematics
%V XII
%P 69-82
%D 1961
%I American Mathematical Society
%C Providence, RI
%K systems of writing

%L Eden61
%A Murray Eden
%T On the Formalization of Handwriting
%B Structure of Language and its Mathematical Aspects
%E Roman Jakobson
%S Proceedings of Symposia in Applied Mathematics
%V XII
%P 83-88
%D 1961
%I American Mathematical Society
%C Providence, RI
%K systems of writing

%L Yngv61
%A Victor H. Yngve
%T The Depth Hypothesis
%B Structure of Language and its Mathematical Aspects
%E Roman Jakobson
%S Proceedings of Symposia in Applied Mathematics
%V XII
%P 130-138
%D 1961
%I American Mathematical Society
%C Providence, RI


%L Hend82
%A Peter Henderson
%T Purely Functional Operating Systems
%B Functional Programming and Its Applications
%E J. Darlington, P. Henderson, and D. A. Turner
%D 1982
%P 177-192
%I Cambridge University Press
%C Cambridge, England
%K applicative programming; streams

%L Turn82
%A D. A. Turner
%T Recursion Equations as a Programming Language
%B Functional Programming and Its Applications
%E J. Darlington, P. Henderson, and D. A. Turner
%D 1982
%P 1-28
%I Cambridge University Press
%C Cambridge, England
%K applicative programming; software crisis

%L Will82
%A John H. Williams
%T Notes on the FP Style of Functional Programming
%B Functional Programming and Its Applications
%E J. Darlington, P. Henderson, and D. A. Turner
%D 1982
%P 73-102
%I Cambridge University Press
%C Cambridge, England
%K applicative programming

%L Darl82a
%A John Darlington
%T Program Transformation
%B Functional Programming and Its Applications
%E J. Darlington, P. Henderson, and D. A. Turner
%D 1982
%P 193-216
%I Cambridge University Press
%C Cambridge, England
%K applicative programming; fold/unfold system

%L Wise82
%A David S. Wise
%T Interpreters for Functional Programming
%B Functional Programming and Its Applications
%E J. Darlington, P. Henderson, and D. A. Turner
%D 1982
%P 253-280
%I Cambridge University Press
%C Cambridge, England
%K applicative programming; implementation; garbage collection


%L Frie80
%A Daniel P. Friedman
%A David S. Wise
%T An Indeterminate Constructor for Applicative Programming
%B Conference Record of the 7th Annual ACM Symposium on Principles of
Programming Languages
%D 1980
%P 245-250
%I Association for Computing Machinery
%K frons; nondeterminism; functional programming

%L Morr73a
%A James H. Morris,\0Jr
%T Types are not Sets
%B Conference Record of the 1st Annual ACM Symposium on Principles of
Programming Languages
%D 1980
%P 120-124
%I Association for Computing Machinery

%L Morr80
%A James H. Morris
%T Experience with an Applicative String Processing Language
%B Conference Record of the 7th Annual ACM Symposium on Principles of
Programming Languages
%D 1980
%P 32-46
%I Association for Computing Machinery
%K Poplar; pattern matching

%L Chom59
%A Noam Chomsky
%T On Certain Formal Properties of Grammars
%J Information and Control
%V 2
%N 2
%D 1959
%P 137-167
%K Chomsky hierarchy; Chomsky's stratification

%L Wolb78
%A John R. Wolberg
%A Marshall Rafal
%T CONVERT \(em A Language for Program and Data File Conversions
%J Software \(em Practice and Experience
%V 8
%D 1978
%P 187-198
%K pattern matching

%L Wolb79
%A John R. Wolberg
%A Marshall Rafal
%T Using Convert to Transform Source Code
%J Software \(em Practice and Experience
%V 9
%D 1979
%P 881-890
%K reformatting; standardization

%L Hans80
%A David R. Hanson
%T Code Improvement via Lazy Evaluation
%J Information Processing Letters
%V 11
%N 4,5
%D 12 December 1980
%P 163-167
%K peephole optimization

%L Sale79
%A Arthur Sale
%T Miniscules and Majuscules
%J Software \(em Practice and Experience
%V 9
%D 1979
%P 915-919
%K upper case; lower case; style

%L Bara80
%A David R. Barach
%A David M. Fram
%T NPP: An Easy to Implement Preprocessor for Text Formatting
%J Software \(em Practice and Experience
%V 10
%D 1980
%P 335-346
%K nroff; troff; runoff

%L Vauc80
%A Jean G. Vaucher
%T Pretty-Printing of Trees
%J Software \(em Practice and Experience
%V 10
%D 1980
%P 553-561

%L Rich79a
%A Martin Richards
%T A Compact Function for Regular Expression Pattern Matching
%J Software \(em Practice and Experience
%V 9
%D 1979
%P 527-534
%K BCPL

%L Gunn81
%A Hamish I. E. Gunn
%A David M. Harland
%T Degrees of Constancy in Programming Languages
%J Information Processing Letters
%V 13
%N 1
%D 27 October 1981
%P 35-38
%K dynamic constants; tagged architectures

%L Gunn82
%A Hamish I. E. Gunn
%T Compile Time Type Checking of Structure Field Accessing
%J Information Processing Letters
%V 14
%N 1
%D 27 March 1982
%P 22-25
%K records; pointers

%L Paga86
%A Frank C. Pagan
%T On the Feasability of Teaching Backus-type Functional
Programming (FP) as a First Language.
%J SIGCSE Bulletin
%V 18
%N 3
%D September, 1986
%P 31-35
%K applicative programming

%L Peck74
%A J. E. L. Peck
%T Two-level Grammars in Action
%D 1974
%I North-Holland
%T Information Processing 74
%K van Wijngaarden grammars; 2-level grammars; vw-grammars
%C Amsterdam
%X A review of the elements of two-level grammars, some simple illustrative
examples and typical applications in the definition of ALGOL 68, especially
its predicates and its mode equivalencing mechanism.

%L Lesk85
%A Michael E. Lesk
%T GRAB \(em Inverted Indexes with Low Storage Overhead
%D August 19, 1985
%I Bell Communications Research
%C Morristown, NJ

%L Nils84
%A M. Nilsson
%T The World's Shortest Prolog Interpreter?
%B Implementations of Prolog
%E J. A. Campbell
%D 1984
%P 87-92
%I Ellis Horwood
%C Chichester, England
%K Lisp; Maclisp; unification
%X Contains the source to a 1-page prolog interpreter written in Maclisp.

%L Pate78
%A M. S. Paterson
%T Linear Unification
%J Journal of Computer and System Sciences
%V 16
%D 1978
%P 158-167

%L Ritc
%A Dennis M. Ritchie
%T On the Security of UNIX
%I Bell Laboratories
%C Murray Hill, NJ

%L Stro86
%A Bjarne Stroustrup
%T The C++ Programming Language
%D 1986
%I Addison-Wesley
%C Reading, MA
%K classes; data abstraction

%L Port80
%A M. F. Porter
%T An Algorithm for Suffix Stripping
%J Program
%V 14
%N 3
%D July 1980
%P 130-137
%K BCPL; conflation

%L Cowl86
%A A. J. Cowling
%T Type Checking in Polymorphic Languages
%J Computer Journal
%V 29
%N 6
%D December, 1986
%P 538-544
%K Harland; polymorphism

%L Kieb86
%A Richard B. Kieburtz
%T When Chasing Your Tail Saves Time
%J Information Processing Letters
%V 23
%D 3 December 1986
%P 321-324
%K graph reduction; combinators; applicative programming;
functional programming; fixpoints; tail recursion

%L Stoj86
%A Jordan Stojanovski
%T A Note on Implementing Prolog in Lisp
%J Information Processing Letters
%V 23
%D 24 November 1986
%P 261-264
%K interpreters; last call optimization

%L Hayn86
%A Christopher T. Haynes
%A Daniel P. Friedman
%A Mitchell Wand
%T Obtaining Coroutines with Continuations
%J Computer Languages
%V 11
%N 3/4
%D 1986
%P 143-153
%K control; scheme

%L Bail86
%A Paul A. Bailes
%T Static Checking of Variable Handling in Dijkstra's
Guarded Commands Language
%J Computer Languages
%V 11
%N 3/4
%D 1986
%P 123-142

%L Walk86
%A A. N. Walker
%T The Ilem Project: Pascal to Algol in Easy Stages.
I: Outward Bound
%J Software \(em Practice and Experience
%V 16
%N 12
%D December 1986
%P 1097-1107
%K transduction; algol 68

%L Geha86
%A Narain Gehani
%T Unix Document Formatting and Typesetting
%J IEEE Software
%D September 1986
%P 15-24
%K troff; nroff; macros; eqn; tbl; pic; word processing

%L Uspe83
%A V. A. Uspensky
%T Post's Machine
%t R. Alavina
%S Little Mathematics Library
%D 1983
%I Mir Publishers
%C Moscow
%K Post productions; computability; algorithms

%L Khur84
%A Yakov Khurgin
%T Did You Say Mathematics?
%t George Yankovsky
%D 1984
%I Mir Publishers
%C Moscow
%K topology; graphs; induction; probability; information theory

%L Lewi82
%A Gabriel Dawson Lewis
%T Notes on English Grammar for Students of Esperanto
%D 1982
%I British Esperanto Association
%C London

%L Cross72
%A J. N. Crossley
%A C. J. Ash
%A C. J. Brickhill
%A J. C. Stillwell
%A N. H. Williams
%T What is Mathematical Logic?
%D 1972
%I Oxford University Press
%C London
%K predicate calculus; model theory; Turing machine; recursive
functions; Goedel's incompleteness theorem; set theory

%L Duff62
%A Charles Duff
%A Dmitri Makaroff
%T Russian for Beginners
%D 1962
%I Barnes and Noble
%C New York
%K cyrillic alphabet

%L Blai85
%A Gordon S. Blair
%A Jon R. Malone
%A John A. Mariani
%T A Critique of Unix
%J Software \(em Practice and Experience
%V 15
%N 12
%D December 1985
%P 1125-1139
%K version 7; operating systems

%L Cast87
%A M. Castan
%A M.-H. Durand
%A M. Lemait\*^re
%T A Set of Combinators for Abstraction in Linear Space
%J Information Processing Letters
%V 24
%D 13 February 1987
%P 183-188
%I North-Holland
%K applicative programming; complexity; reduction machine

%L Hans85
%A David R. Hanson
%T Compact Recursive-descent Parsing of Expressions
%J Software \(em Practice and Experience
%V 15
%N 12
%D Decmeber 1985
%P 1205-1212
%K precedence; compilers

%L Stee76
%A Guy Lewis Steele,\0Jr.
%A Gerald Jay Sussman
%T Lambda: The Ultimate Imperative
%N 353
%D March 10, 1976
%I MIT Artificial Intelligence Lab
%K scheme; lambda calculus; continuations

%L Parl67
%A D. S. Parlett
%T A Short Dictionary of Languages
%D 1967
%I The English Universities Press
%S The Teach Yourself Books
%C London

%L Stee76a
%A Guy Lewis Steele\0Jr.
%T Lambda: The Ultimate Declarative
%R AI Memo 379
%D November, 1976
%I MIT Artificial Intelligence Lab
%C Cambridge, MA
%K lambda calculus; scheme; continuations; renaming; actors; plasma

%L Rick85
%A V. Frederick Rickey
%T Mathematics of the Gregorian Calendar
%J The Mathematical Intelligencer
%V 7
%N 1
%D 1985
%P 53-56
%K julian; date

%L Meir87
%A Silvio Romero de Lemos Meira
%T Strict Combinators
%J Information Processing Letters
%V 24
%N 4
%D 2 March 1987
%P 255-258
%K Turner combinators; strictness; BC-chains; Miranda
%X The idea of strict combinators is presented, and its use in the implementation
of purely functional programming languages is discussed.  Eaxamples are given
and the effect of the proposed implementation of such combinators on performance
is also discussed.

%L Besk86
%A N. M. Beskin
%T Fascinating Fractions
%S Little Mathematics Library
%D 1986
%I Mir
%C Moscow
%K continued fractions

%L Koch87
%A Martin Kochanski
%T A Survey of Data Insecurity Packages
%J Cryptologia
%V XI
%N 1
%D January 1987
%P 1-15
%K encryption; decryption; cryptography; cryptology; IBM PC

%L Keen76
%A Raymond Keene
%A David Levy
%T An Opening Repertoire for the Attacking Player
%D 1976
%I B. T. Batsford, Ltd
%C London
%O Autographed By Ray Keene.
%K chess; orap; max lange; scotch gambit; two knights defence; petroff;
Philidor's; Latvian gambit; Greco Counter-Gambit; Queen's Pawn; Sicilian;

%L Hort79
%A Vlastimil Hort
%A Edmar Mednis
%T The Modern Defence
%D 1979
%I R. H. M. Press
%C Great Neck, N. Y.
%K chess; Pirc; Robatsch; Gurgenidze System

%L Feel87
%A Marc Feeley
%A Guy Lapalme
%T Using Closures for Code Generation
%J Computer Languages
%V 12
%N 1
%D 1987
%P 47-66
%K compiling; interpretation; lisp; scheme

%L Fell86
%A M. Felleisen
%A D. P. Friedman
%T A Closer Look at Export and Import Statements
%J Computer Languages
%V 11
%D 1986
%P 29-37

%L Hara78
%A A. Haraldsson
%T A Partial Evaluator, and its Use for Compiling Iterative
Statements in Lisp
%B Conference Record of the Sixth Annual ACM Symposium on Principles of
Programming Languages
%D 1978
%P 195-202
%C Tucson, AZ

%L Camp85
%A Douglas Campbell
%A Chris Grevstad
%T A Tutorial for Make
%B 1985 ACM Annual Conference
%D 14-16 October 1985
%P 374-380
%C Denver, CO

%L Akma86
%A V. Akman
%T Writing Self-replicating Code
%J The Computer Journal
%V 29
%N 6
%D 1986
%P 573-574
%K lisp

%L Oppe80
%A D. C. Oppen
%T Prettyprinting
%J ACM Transactions on Programmin Languages and Systems
%V 2
%D 1980
%P 465-483
%K pretty printing

%L Cloc87
%A William Clocksin
%T A Prolog Primer
%J Byte
%V 12
%N 9
%D August 1987
%P 147-158

%L Szpa87
%A Stan Szpakowicz
%T Logic Grammars
%J Byte
%V 12
%N 9
%D August 1987
%P 185-195
%K Prolog

%L Brai87
%A Barron Brainerd
%T Textual Analysis and Synthesis by Computer
%J Abacus
%V 4
%N 2
%D 1987
%P 8-18
%K ARTFL; TLF; concordance; literary

%L Oppe80
%A Derek C. Oppen
%T Prettyprinting
%J ACM Transactions on Programming Languages and Systems
%V 2
%N 4
%D October, 1980
%P 465-483
%K formatting; paragraphing

%L Witt87
%A Ian H. Witten
%T Computer (In)security: Infiltrating Open Systems
%J Abacus
%V 4
%N 4
%D Summer 1987
%P 7-25
%K insecurity

%L Frie86
%A Daniel P. Friedman
%A Matthias Felleisen
%T The Little Lisper, Second Edition
%D 1986
%I Science Research Associates
%C Chicago
%K Scheme; Y-combinator

%L Aho88
%A Alfred V. Aho
%A Ravi Sethi
%T Maintaining Cross References in Manuscripts
%J Software\(emPractice and Experience
%V 18
%N 1
%D January 1988
%P 1-13
%K troff; awk; sed; grep; scribe

%L Tho68
%A Ken Thompson
%T Regular Expression Search Algorithm
%J CACM
%V 11
%N 6
%D 1968

%A Bonnie J. Fladung
%T The XLISP Primer
%C Englewood Cliffs, NJ
%I PRHALL
%D 1987

%A Brian M. Fagan
%T The Great Journey
%C London
%I Thames and Hudson
%D 1987

%A James Gleick
%T Chaos: Making a New Science
%C New York
%I Viking
%D 1987

%A Roland Huntford
%T Shackleton
%C New York
%I Fawcett-Columbine
%D 1985

%A Matthias Felleisen
%T Reflections on Landin's J-operator: A Partly Historical Note
%J Computer Languages
%V 12
%N 3/4
%P 197-207
%D 1987

%A Paul A. Bailes
%T G: A Functional Language with Generic Abstract Datatypes
%J Computer Languages
%V 12
%N 2
%P 69-94
%D 1987

%A Marvin L. Bittenger
%T Logic, Proofs and Sets: Second Edition
%C Reading, MA
%I Addison-Wesley
%C Reading, MA
%D 1980

%A R. E. Griswold
%A J. F. Poage
%A I. P. Polonsky
%T The SNOBOL4 Programming Language: Second Edition
%C Englewood Cliffs, NJ
%I PRHALL
%D 1971

%A Alfred V. Aho
%A Jeffrey D. Ullman
%T Principles of Compiler Design
%I Addison-Wesley
%D 1977
%K dragon

%A J. T. Schwartz
%T Programming with Sets: An Introduction to SETL
%C Berlin
%I Springer-Verlag
%D 1986

%A Gary Marc Levin
%T An Introduction to ISETL
%I Clarkson University
%D 1988

%A James F. Gimpel
%T Algorithms in SNOBOL4
%C New York
%I WILEY
%D 1976

%A Arch D. Robinson
%T Illinois Functional Programming: A Tutorial
%J Byte
%V 12
%N 2
%P 115-125
%D FEB 1987

%A Arch D. Robinson
%T Illinois FP User's Manual
%R Professional Workstation Research Group Technical Report #7
%I DCS University of Illinois at Urbana-Champaign
%C Urbana, IL
%D 1987

%A C. E. Burton
%T RSA: A Public Key Cryptography System, Part II
%J Dr. Dobbs's Journal
%N 90
%D April 1984
%P 32-59
%O Includes source.

%A Reeds
%A Weinberger
%T File System Security and the Unix Crypt Command
%J AT&T Bell Laborities Technical Journal
%D October 1984

%A Narain Gehani
%T Document Formatting and Typesetting on the UNIX System: Second Edition
%C Summit, N.J.
%I Silicon Press
%D 1987

%L Prat87
%A Stephen Prata
%A Donald Martin
%T UNIX System V Bible: Commands and Utilities
%D 1987
%I Howard W. Sams
%C Indianapolis
%O $24.95
%X Recommended text. A set of section I man pages, each typically with
more examples.

%L Bols85
%A Morris I. Bolsky
%T The Unix System User's Handbook
%D 1985
%I Prentice-Hall
%C Englewood Cliffs, NJ
%O $16.95
%X Spiral bound with place holder flap.  Minimal selection of man pages; wastes
substantial space on ed(1); less bulky than Prata and Martin.

%L Wait87
%A Mitchell Waite
%A Stephen Prata
%A Donald Martin
%T UNIX System V Primer: Revised Edition
%D 1987
%I Howard W. Sams
%C Indianapolis
%O $22.95
%X A decent tutorial introduction to using Unix.

%L Doug87
%A Dale Dougherty
%A Tim O'Reilly
%T Unix Text Processing
%D 1987
%I Hayden
%C Indianapolis
%O $26.95
%X Good proportion of coverage of formatting relative to text editing.

%F AT&T Information Systems 1986
%A AT&T\0Information\0Systems
%T The UNIX System User's Manual
%D 1986
%I Prentice-Hall
%C Englewood Cliffs, NJ
%i 0-13-938242-9 025

%L Boyc87
%A Judith I. Boyce
%A Bert R. Boyce
%T A Serial Holdings List Using UNIX Refer
%J Special Libraries
%V 78
%N 1
%D Winter 1987
%P 37-40

%A Rod Manis
%A Marc H. Meyer
%T The Unix Shell Programming Language
%D 1986
%I Howard Sams
%C Indianapolis, Ind.
%O $24.94

%A N. Wirth
%T From Modula to Oberon
%D 23 February 1983
%R BIX oberon/long.messages #11

%A Taiichi Yuasa
%A Masami Hagiya
%T Kyoto Common Lisp Report
%I Kyoto University Research Institute for Mathematical Sciences
%D 1985

%E Chuck Forsberg
%T XMODEM/YMODEM Protocol Reference
%D 1987
%I Omen Technology

%A Chuck Forsberg
%T The ZMODEM Inter Application File Transfer Protocol
%D 1987
%I Omen Technology

%A Marc J. Rochkind
%T Advanced Unix Programming
%I PRHALL
%D 1985

%A Alfred V. Aho
%A Brian W. Kernighan
%A Peter J. Weinberger
%D 1988
%T The AWK Programming Language
%I Addison-Wesley
%C Reading, MA

%A S. H. Gould
%T Russian for the Mathematician
%C Berlin
%I Springer-Verlag
%D 1972

%A Andr\o'e\(aa' Gide
%a andre
%T Voyage au Congo suivi Le retour du Tchad
%I Gallimard
%D 1928

%A Robert Wilensky
%T Common LISPcraft
%I W. W. Norton
%C New York
%D 1986

%A Pieter W. M. Koopman
%T Interactive Programs in a Functional Language: A Functional
Implementation of an Editor
%J SP&E
%V 17
%N 9
%P 609-622
%D September 1987

%A John D. McGregor
%T Object-Oriented Programming with SCOOPS
%J Computer Language
%D July 1987

%A R. D. Tennent
%T Quantification in Algol-like Languages
%J IPL
%V 25
%D 6 May 1987
%P 133-137
%X A general notation is proposed which may be used to replace many
specialized constructions in programming languages and logics,
including variable declaration blocks and quantified formulas.

%A Philip Wadler
%T Fixing Some Space Leaks with a Gargbage Collector
%J SP&E
%V 17
%N 9
%P 595-608
%D September 1987
%K functional applicative languages; lazy evaluation
%X Some functional programs may use more space than would be expected.
A modification to the garbage collector is suggested which solves this
problem in some cases.  Related work is discussed.

%A Thomas W. Christopher
%T Reference Count Garbage Collection
%J SP&E
%V 14
%N 6
%P 503-507
%D June 1984
%K list processing

%A Johan G. F. Belinfante
%T S/K/ID: Combinators in Forth
%J Journal of Forth Application and Research
%V 4
%N 4

%A H. W. Glaser
%A P. Thompson
%T Lazy Garbage Collection
%J SP&E
%V 17
%N 1
%P 1-4
%D January 1987
%K list processing; functional applicative languages

%A Bjarne Stroustrup
%T What is ``Object-Oriented Programming''?

%A Jonathan Rees
%A William Clinger
%T Revised\s-2\u3\d\s+2 Report on the Algorithmic Language Scheme
%J SIGPLAN
%V 21
%N 12
%P 37-79
%D December 1986

%A Keith Waclena
%T Microcomputer Software Available on Cerberus
%C Chicago
%I University of Chicago Graduate Library School
%D 1988

%A Timothy A. Budd
%T A Little Smalltalk
%I Addison-Wesley
%C Reading, MA
%D 1987

%A Howard J. Wilcox
%T The Role of Mathematics in Atonal Music
%J The UMAP Journal
%V 8
%N 1
%P 83-89

%A Linda L. Deneen
%T Secret Encryption with Public Keys
%J The UMAP Journal
%V 8
%N 1
%P 83-89

%A Yogeesh H. Kamath
%A Manton M. Matthews
%D May 1987
%T Implementation of an FP-Shell
%J IEEETSE
%V SE-13
%N 5
%P 532-539
%K applicative; fp; shell

%A Hai-Chen Tu
%A Alan J. Perlis
%D January 1986
%T FAC: A Functional APL Language
%J IEEE Software
%P 36-45
%K applicative

%A Kay-Ulrich Felgentreu
%A Wolfram-M. Lippe
%A Friedemann H. Simon
%D June 1987
%T Optimizing Static Scope Lisp by Repetitive Interpretation of
Recursive Function Calls
%J IEEETSE
%V SE-13
%N 6
%P 628-635

%A F. Warren Burton
%A Dieter Maurer
%A Hans-Georg Oberhauser
%A Reinhard Wilhelm
%D June 1987
%T A Space-Efficient Optimization of Call-by-Need
%J IEEETSE
%V SE-13
%N 6
%P 636-642
%K functional applicative language; strictness; lazy evaluation

%A D. L. Souvaine
%A C. J. Van\0Wyk
%a van wyk
%D May 1987
%T How Hard Can It Be to Draw a Pie Chart
%R LCSR-TR-90
%I DCS Rutgers University

%E Guy L. Steele\0Jr.
%E Raphael Finkel
%E Donald Woods
%E Mark Crispin
%T [MIT/SAIL Jargon File]
%D 22 July 1981

%A A. Bookshelf
%A D. Swinson
%T A Formal Model of Text Rot and its Applications in Library Science Education
%J A Library Qvarterly
%V 18
%N 21
%D 1 April 1987
%P 123-119

%A Scott Baden
%D [n.d.]
%T Berkeley FP User's Manual, Rev. 4.1

%A Edsger W. Dijkstra
%D 1968
%T Co-Operating Sequential Processes
%B Programming Langauges
%E F. Genuys
%I ACADEMIC

%A Jon L. Bentley
%A Brian W. Kernighan
%D August 1986
%T GRAP \(em A Language for Typesetting Graphs
%J CACM
%V 29
%N 8
%P 782-792

%A E. Tufte
%D 1982
%T The Visual Display of Quantitative Information
%I Graphics Press
%C Cheshire, CT

%A R. G. Dromey
%D 1982
%T How to Solve it by Computer
%I PRHALL

%A Pieter H. Hartel
%A Arthur H. Veen
%D March 1988
%T Statistics on Graph Reduction of SASL Programs
%J SP&E
%V 18
%N 3
%P 239-253
%K combinators; functional; applicative

%A Jon L. Bentley
%D 1986
%T Programming Pearls
%I Addison-Wesley
%C Reading, MA


%A Jon L. Bentley
%D 1988
%T More Programming Pearls
%I Addison-Wesley
%C Reading, MA


%A L. L. Odette
%D 1987
%T Compiling Prolog to Forth
%J Journal of Forth Application and Research
%V 4
%N 4
%P 487-533

%A British\0Standards\0Institution
%D March 1988
%T Prolog Syntax
%K BSI
%O Contains \fIAn S-Expression Syntax for Prolog\fP.

%A David Hooper
%A Kenneth Whyld
%D 1984
%T The Oxford Companion to Chess
%C Oxford
%I The University Press

%A May Theilgaard Watts
%D 1963
%T Master Tree Finder
%C [Berkeley, CA]
%I Nature Study Guild

%A Walter F. Tichy
%D July 1985
%T RCS\(emA System for Version Control
%J SP&E
%V 15
%N 7
%P 637-654
%K SCCS


%A Zoltan Somogyi
%T Cake: a fifth generation version of make
%J Australian Unix system User Group Newsletter
%K auugn
%V 7
%N 6
%D April 1987
%P 22-31

%A D. E. Knuth
%A J. H. Morris
%A V. R. Pratt
%D 1974
%T Fast Pattern Matching in Strings
%R Res. Rep.  CS-74-440
%I Computer Science Department, Stanford University
%C Stanford, CA

%A M. Atkinson
%A P. Buneman
%A R. Morrison
%D 1988
%T Binding and Type Checking in Database Programming Languages
%J Computer Journal
%V 31
%N 2
%P 99-109

%A J. R. Ullmann
%D 1988
%T Fast Implementation of Relational Operations Via Inverse Projections
%J Computer Journal
%V 31
%N 2
%P 147-154

%A F. B. Bastani
%A S. S. Iyengar
%A I-Ling\0Yen
%D 1988
%T Concurrent Maintenance of Data Structures in a Distributed Environment
%J Computer Journal
%V 31
%N 2
%P 165-174

%A D. S. Moffat
%A P. M. D. Gray
%D 1988
%T Perlog: A Prolog with Persistence and Modules
%J Computer Journal
%V 31
%N 2
%P 110-115

%A Norman Susskind
%D 1984
%T The French Correction
%C New Haven
%I Yale University Press

%A Harold Abelson
%A Andrea A. diSessa
%D 1981
%T Turtle Geometry
%C Cambridge, Massachusetts
%I The MIT Press

%A Daniel P. Friedman
%A David S. Wise
%D 1976
%T An Environment for Multiple-Valued Recursive Procedures
%B Programmation: Actes du 2\u\s-2e\s+2\d colloque international
sur la programation.
%E B. Robinet
%C Paris
%P 182-200

%A Ed Dubinsky
%D 1987
%T Using the ISETL Programming Language in Teaching Mathematics
%B Informatics and the Teaching of Mathematics
%E D. C. Johnson
%E F. Lovis
%I Elsevier Science Publications (North-Holland)

%A Alexei L. Semenov
%D 1987
%T From Mathematics to Informatics and Back Again: Markov & Goedel
%B Informatics and the Teaching of Mathematics
%E D. C. Johnson
%E F. Lovis
%I Elsevier Science Publications (North-Holland)

%A Ralph E. Griswold
%A Janalee O'Bagy
%D 1988
%T Seque: A Programming Language for Manipulating Sequences
%J Computer Languages
%V 13
%N 1
%P 13-22
%K streams; infinite data objects; generators; goal directed evaluation

%A R. Morrison
%A M. P. Atkinson
%A A. L. Brown
%A A. Dearle
%D 1988
%T Bindings in Persistent Programming Languages
%J SIGPLAN Notices
%V 23
%N 4

%A Karen E. Smith
%D March 1988
%T Hypertext \(em Linking to the Future
%J Online

%A Carl Franklin
%D March 1988
%T An Annotated Hypertext Bibliography
%J Online

%A Eric Shipton
%D 1973
%T Tierra del Fuego: the Fatal Lodestone
%C London
%I Charles Knight & Co.

%A Simon L. Peyton\0Jones
%a peyton jones
%D 1987
%T The Implementation of Functional Programming Languages
%C Englewood Cliffs, N. J.
%I Prentice/Hall International

%A Bernard Wasserstein
%D 1988
%T The Secret Lives of Trebitsch Lincoln
%I Yale University Press

%A Haskell B. Curry
%A R. Feys
%D 1958
%T Combinatory Logic
%V 1
%I North-Holland
%K lambda calculus

%A Lawrence E. Hughes
%T A Practical Guide to RS-232 Interfacing

%A Frank da\0Cruz
%D 1984
%T Kermit Protocol Manual: Fifth Edition
%I Columbia University Center for Computing Activities
%C New York

%A Richard Stallman
%D October 1986
%T Gnu Emacs: Fifth Edition, Emacs Version 18, for Unix Users

%A D. W. Smith
%A J. R. Mashey
%D October 1977
%T PWB/MM Programmer's Workbench Memorandum Macros

%A Ernest Vincent Wright
%D 1939
%T Gadsby: A Story of Over 50,000 Words Without Using the Letter ``E''
%C Los Angeles
%I Wetzel Publishing Company
%K bizarro
%X Available from University Microfilms International

%A Gyorgy E. Revesz
%T Lambda-calculus, combinators, and functional programming
%C Cambridge [Cambridgeshire] ; New York
%P Cambridge  University Press
%D 1988
%P 181
%S Cambridge tracts in theoretical computer science
%i 0-521-34589-8
%# QA9.5.R480 1988 Eck      
             
%A David Harel
%D 1987
%T Algorithmics
%I Addison-Wesley
%C Reading, MA


%A Anthony J. Field
%A Peter G. Harrison
%D 1988
%T Functional Programming
%I Addison-Wesley
%C Reading, MA
%K Hope

%A Aard van\0Wijngaarden
%D 1966
%T Recursive Definition of Syntax and Semantics
%B Formal Language Description Languages for Computer Programming
%I North-Holland
%C Amsterdam
%P 13-24
%K continuations 
%X Possibly the first description of compilation by continuation passing. 

%A Antoni Diller
%D 1988
%T Compiling Functional Languages
%I Wiley
%C Chichester

%A Michael Eisenberg
%D 1988
%T Programming in Scheme
%E Harold Abelson
%I The Scientific Press
%C Redwood City, CA

%A Kevin Lang
%A Barak Pearlmutter
%D 1989
%T The Oaklisp Language Manual
%I Carnegie Melon University, School of Computer Science
%C Pittsburgh, PA

%A Ozan Yigit
%D 1988
%T Readings in Scheme
%J LISP Pointers
%V 2
%N 1
%P 56-61
%K bibliography

%A Richard P. Gabriel
%D 1988
%T The Why of Y
%J LISP Pointers
%V 2
%N 2
%P 15-25

%A Kevin J. Lang
%A Barak Pearlmutter
%D 1986
%T Oaklisp: an Object-Oriented Scheme with First Class Types
%J OOPSLA '86
%E Norman Meyerowitz
%C Portland, Oregon
%P 30-37

%A John Darlington
%D August 1985
%T Program Transformation
%J Byte
%V 10
%N 8
%P 201
%K fold/unfold system

%A Lloyd Allison
%D February 1989
%T Circular Programs and Self Referential Structures
%J SP&E
%V 19
%N 2
%P 99-109
%K functional programming; applicative programming; lazy evaluation; recursion


%A J. Hughes
%T Why Functional Programming Matters
%D 1989
%J The Computer Journal
%V 32
%N 2
%P 98-107

%A Lev Tarasov
%T The World is Built on Probability
%t Michael Burov
%D 1988
%I Mir
%C Moscow
%K random variables; cybernetics; entropy

%A Dick Grune
%D 13 February 1987
%T How to Compare the Incomparable
%J Information Processing Letters
%V 24
%P 177-181
%K compiler construction; model; decision-making

%A Michal A. Jenkins
%A Janice I. Glasgow
%A Carl D. McCrosky
%D January 1986
%T Programming Styles in Nial
%J IEEE Software
%P 46-55

%A Gregory J. Chaitin
%D July 1988
%T Randomness in Arithmetic
%J Scientific American
%P 80-85

%A Paul Klint
%D 1981
%T Interpretation Techniques
%J Software\(emPractice and Experience
%V 11
%P 963-973

%A Scott Deerwester
%D June 1987
%T The Engineering Information System: A Guided Tour
%J Information Technology and Libraries
%P 126-132

%A Gary F. Simons
%D 1988
%T The Computational Complexity of Writing Systems
%J The Fifteenth LACUS Forum
%I Linguistic Association of Canada and the United States
%C Lake Bluff, IL
%K orthography; regular expression; finite state machine

%A Eugene H. Spafford
%D 8 December 1988
%T The Internet Worm Program: An Analysis
%I Department of Computer Sciences, Purdue University
%C West Lafayette, IN
%R Purdue Technical Report CSD-TR-823

%A Daniel Nachbar
%T SPIFF\(emA Program for Making Controlled Approximiate Comparisons of Files
%I Software Engineering Research Group, Bell Communications Research
%C Morristown, NJ
%K diff

%A R. S. Bird
%D 1989
%T Algebraic Identities for Program Calculation
%J The Computer Journal
%V 32
%N 2
%P 122-126
%K program transformation; functional programming; applicative programming

%A F. W. Burton
%D 1988
%T Nondeterminism with Referential Transparency in Functional Programming Languages
%J The Computer Journal
%V 31
%N 3
%P 243-247
%K applicative programming

%A Ganesh C. Gopalakrishnan
%A Mandayam K. Srivas
%D 25 January 1988
%T Implementing Functional Programs Using Mutable Abstract Data Types
%J Information Processing Letters
%V 26
%P 277-286
%K applicative programming; syntactic condition

%A Shmuel T. Klein
%a Tomi
%A Abraham Bookstein
%A Scott Deerwester
%D [1989]
%T How to Put Your Full Text Retrieval System on CD-ROM; Compression Considerations
%I Graduate Library School, University of Chicago
%C Chicago
%K TIRA

%A A. Bookstein
%A R. Morrissey
%A Scott C. Deerwester
%A Keith Waclena
%A Donald A. Ziff
%D Dec 1989
%T Statistical Guides for Literary Analysis: A Test
%R TR 89-06
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.bookstein morrissey statistical guides qu\&emada.]
%F guide

%A A. Bookstein
%A R. Morrissey
%A S. Deerwester
%A K. Waclena
%A D. Ziff
%D December 1990
%T Statistical Guides for Literary Analysis: A Test
%B Computational Lexicology and Lexicography:
Special Issue Dedicated to Bernard Quemada; Part I
%P 65-80
%E A. Zampolli
%K A. Zampolli (promoter)
%E L. Cignoni
%E C. Peters
%I Giardini Editori E Stampatori; Istituto di linguistica computazionale of
the Italian National Research Council
%C Pisa
%O \fILinguistica Computazionale\fR, Vol. VI.
%K probabilistic retrieval; information retrieval; Bayesian statistical methods;
ARTFL; TLF; TIRA

%A R. S. Bird
%A John Hughes
%D 15 January 1987
%T The Alpha-Beta Algorithm: An Exercise in Program Transformation 
%J Information Processing Letters
%V 24
%P 53-57
%K pruning

%A Mark Olson
%D 1989
%T Talking Back: The INRAC Language Compiler
%J Computers and the Humanities
%V 23
%P 161-167
%K racter; natural language generation

%A Philip J. Koopman,\0Jr.
%A Peter Lee
%D July 1989
%T A Fresh Look at Combinator Graph Reduction (Or, Having a TIGRE by the Tail)
%J SIGPLAN Notices
%V 24
%N 7
%P 110-119
%K functional programming; applicative programming; threaded code

%A L. Augustsson
%A T. Johnsson
%D 1989
%T The Chalmers Lazy-ML Compiler
%J The Computer Journal
%V 32
%N 2
%P 127-141
%K functional programming; applicative programming; lazy ml

%A Timothy A. Budd
%D 27 June 1989
%T Functional Programming in an Object Oriented Language
%I Department of Computer Science, Oregon State University
%C Corvallis, Oregon

%A Lennart Augustsson
%A Thomas Johnsson
%D June 16, 1989
%T Lazy ML User's Manual
%I [Chalmers University]

%A S. B. Jones
%A A. F. Sinclair
%D 1989
%T Functional Programming and Operating Systems
%J The Computer Journal
%V 32
%N 2

%A S. C. Wray
%A J. Fairbairn
%D 1989
%T Non-strict Languages\(emProgramming and Implementation
%J The Computer Journal
%V 32
%N 2

%A Andrew W. Appel
%D 1989
%T Runtime Tags Aren't Necessary
%J Lisp and Symbolic Computation
%V 2
%P 153-162

%A Klaus E. Grue
%D 1989
%T Arrays in Purely Functional Programming Languages
%J Lisp and Symbolic Computation
%V 2
%P 105-113

%A Jon Fairbairn
%D June 1987
%T Making Form Follow Function: An Exercise in Functional Programming Style
%J Software\(emPractice and Experience
%V 17
%N 6
%P 379-386

%A R. D. Lins
%D August 1987
%T On the Efficiency of Categorical Combinators as a Rewriting System
%J Software\(emPractice and Experience
%V 17
%N 8
%P 547-559

%A Andrew W. Appel
%D 1989
%T Simple Generational Garbage Collection and Fast Allocation
%J Software\(emPractice and Experience
%V 19
%N 2
%P 171-183
%K copying compactifying gc

%A Fer-Jan de Vries
%T A Functional Program for the Fast Fourier Transform

%A Jon Fairbairn
%A Stuart Wray
%D 1987
%T Tim: A Simple Lazy Abstract Machine to Execute Supercombinators
%B Functional Programming Languages and Computer Architecture
%E Gilles Kahn
%S Lecture Notes in Computer Science
%N 274
%I Springer-Verlag
%C Berlin
%P 34-45

%A David S. Wise
%D 1987
%T Matrix Algebra and Applicative Programming
%B Functional Programming Languages and Computer Architecture
%E Gilles Kahn
%S Lecture Notes in Computer Science
%N 274
%I Springer-Verlag
%C Berlin
%P 134-153

%A Paul Hudak
%A Adrienne Bloss
%T The Aggregate Update Problem in Functional Programming Systems
%B Conference Record of the Twelfth Annual ACM Symposium on
Principles of Programming Languages
%I Association for Computing Machinery
%C [New York]
%P 300-314

%A Gary Lindstrom
%D 1985
%T Functional Programming and the Logical Variable
%B Conference Record of the Twelfth Annual ACM Symposium on
Principles of Programming Languages
%I Association for Computing Machinery
%C [New York]
%P 266-280

%A Andrew W. Appel
%D 1987
%T Garbage Collection Can Be Faster than Stack Allocation
%J Information Processing Letters
%V 25
%P 275-279

%A Simon L. Peyton Jones
%D February 1986
%T Parsing Distfix Operators
%J Communications of the ACM
%V 29
%N 2
%P 118-122
%K yacc; sasl

%A A. B. Hartley
%D 1958
%T Unexploded Bomb: A History of Bomb Displosal
%I Cassel
%C London
%# W251246

%A Donald Michie
%D 6 April 1968
%T ``Memo'' Functions and Machine Learning
%J Nature
%V 218
%P 19-22
%X The original description of memo functions.

%A David R. Hanson
%D 1981
%T Is Block Structure Necessary?
%J Software\(emPractice and Experience
%V 11
%P 853-866
%K Y; modules; nested procedures

%A Bharat Bhargava
%A John Riedl
%D June 1989
%T The Raid Distributed Database System
%J IEEE Transactions on Software Engineering
%V 15
%N 6
%P 726-736

%A R. D. Tennent
%D 1981
%T Principles of Programming Languages
%I Prentice/Hall
%C Englewood Cliffs, NJ

%A Mike Joy
%A Tom Axford
%T A Standard for a Graph Representation for Functional Programs
%K FLIC?; combinator assembly language

%A Kenneth E. Iverson
%D August 1980
%T Notation as a Tool of Thought
%J CACM
%V 23
%N 8
%P 444-465
%K APL
%O 1979 ACM Turing Award Lecture.

%A Ravi Sethi
%D 1989
%T Programming Languages: Concepts and Constructs
%I Addison-Wesley
%C Reading, MA

%A G. M. Birtwhistle
%A O.-J. Dahl
%A B. Myhrhaug
%A K. Nygaard
%D 1973
%T Simula Begin
%I Studentlitteratur
%C Lund, Sweden

%A C. S. Wetherell
%D April 1982
%T Error Data Values in the Data-Flow Language VAL
%J ACM Transactions on Programming Languages and Systems
%V 4
%N 2
%P 226-238

%A D. M. Harland
%D 1986
%T Concurrency and Programming Languages
%C Chichester
%I Ellis Horwood

%A Kurt G\o'o\(um'del
%a Kurt Goedel
%D 1931
%T Uber formal unentscheidbare S\o'a\(um'tze der Principia
Mathematica und verwandter Systeme, I
%J Monatshefte f\o'u\(um'r Mathematik und Physik
%V 38
%P 173-198
%K incompleteness theorem

%A Raymond M. Smullyan
%D 1987
%T Forever Undecided: A Puzzle Guide to G\o'o\(um'del
%C New York
%I Knopf
%K goedel godel incompleteness theorem

%A Harry J. Gensler
%D 1984
%T G\o'o\(um'del's Theorem Simplified
%C Lanham, MD
%I University Press of America
%K goedel godel incompleteness theorem

%A Richard Bird
%A Phillip Wadler
%D 1988
%T Introduction to Functional Programming
%C New York
%I Prentice Hall

%A R. C. Holt
%A J. R. Cordy
%A D. B. Wortman
%D April 1982
%T An Introduction to S/SL: Syntax/Semantic Language
%J ACM Transactions on Programming Languages and Systems
%V 4
%N 2
%P 149-178

%A Timothy A. Budd
%D August 1988
%T A New Approach to Vector Code Generation for Applicative Languages
%R Technical Report 88-60-18
%I Computer Science Department, Oregon State University
%C Corvalis, Oregon

%A Timothy A. Budd
%D June 1988
%T Composition and Compilation in Functional Programming Languages
%R Technical Report 88-60-14
%I Computer Science Department, Oregon State University
%C Corvalis, Oregon

%A Timothy A. Budd
%T A Parallel Intermediate Representation based on Lambda Expressions 
%I Computer Science Department, Oregon State University
%C Corvalis, Oregon

%A Michael Berry
%A Roland Pesch
%D 1988
%T Style and Literacy in APL
%J APL88
%O Special issue of the \fIAPL Quote Quad\fP.

%A Paul Chapman
%D 1988
%T I-APL: A Portable ISO APL in under 25K
%J APL88
%O Special issue of the \fIAPL Quote Quad\fP.

%A V. A. Uspensky
%D 1987
%T G\o'o\(um'del's Incompleteness Theorem
%t Neal Koblitz
%S Little Mathematics Library
%I Mir
%C Moscow
%K goedel godel

%A Ernest Nagel
%A James R. Newman
%D 1958
%T G\o'o\(um'del's Proof
%I New York University Press
%C [New York]
%K goedel godel

%D 1976
%T Revised Report on the Algorithmic Language Algol 68
%E A. van Wijngaarden
%E B.J. Mailloux
%E J. E. L. Peck
%E C. H. A. Koster
%E M. Sintzoff
%E C. H. Lindsey
%E L. G. L. T. Meertens
%E R. G. Fisker
%I Springer-Verlag
%C Berlin

%A Richard M. Stallman
%D 1984
%T EMACS: The Extensible, Customizable, Self-Documenting Display Editor
%B Interactive Programming Environments
%E David R. Barstow
%E Howard E. Shrobe
%E Erik Sandewall
%I McGraw-Hill
%C New York
%P 300-325

%A Steven R. Lay
%D 1986
%T Analysis: An Introduction to Proof
%I Prentice Hall
%C Englewood Cliffs, NJ

%A Simon Thompson
%D 1989
%T Functional Programming: Executable Specifications and Program
Transformations
%J Proceedings SIGSOFT Something or Other
%P 287-290

%A Tom Van Vleck
%D July 1989
%T Three Questions About Each Bug You Find
%J ACM SIGSOFT Software Engineering Notes
%V 14
%N 5
%P 62-63

%A Tim Budd
%D [n.d.\&]
%T Little Smalltalk Users Manual\(emVersion Three
%I Oregon State University Department of Computer Science
%C Corvalis, OR

%A Andrew S. Tanenbaum
%A Robert van Renesse
%A Hans van Staveren
%A Sape J. Mullender
%T A Retrospective and Evaluation of the Amoeba Distributed
Operating System

%A John Roye
%D 1989
%T Flexible Exception Handling in Forth-83
%J Journal of Forth Application and Research
%V 5
%N 2
%P 305-310

%A James F. Ball
%D 1989
%T Standalone Applications
%J Forth Dimensions
%V X
%N 4
%P 15-17,37
%K F83; forth

%A John R. Hayes
%D 1989
%T Local \&Variables: Another Technique
%J Forth Dimensions
%V X1
%N 1
%P 18-22
%K forth

%A Andrew Straw
%A Fred Mellender
%A Steve Riegel
%D August 1989
%T Object Management in a Persistant Smalltalk System
%J Software\(emPractice and Experience
%V 19
%N 8
%P 719-737
%K persistance; databases

%A Colin Runciman
%D 1989
%T What About the \fINatural\fP Numbers?
%J Computer Languages
%V 14
%N 3
%P 181-191
%K structural correspondence; functional programming; lazy evaluation

%A Peter Buneman
%A Robert E. Frankel
%A Rishiyur Nikhil
%D June 1982
%T An Implementation Technique for Database Query Languages
%J ACM Transactions on Database Systems
%V 7
%N 2
%P 164-186
%K applicative programming; functional programming

%A Scott Guthery
%D December 1989
%T Are the Emperor's New Clothes Object Oriented?
%J Dr. Dobb's Journal
%V 14
%N 12
%P 80-86

%A A. Mycroft
%D 1981
%T Abstract Interpretation and Optimising Transformations for Applicative Programs
%I University of Edinburgh
%C Edinburgh
%O Ph. D. thesis.

%D 1987
%T Abstract Interpretation of Declarative Languages
%E Samson Abramsky
%E Chris Hankin
%I Ellis Horwood
%C Chichester

%A Thomas Johnsson
%D 1984
%T Efficient Compilation of Lazy Evaluation
%J Proceedings of the ACM Conference on Compiler Construction
%C Montreal
%P 58-69

%A Dick Pountain
%D 1986
%T Object Oriented Extensions to Forth
%J The Journal of Forth Application and Research
%V 3
%N 3
%P 51-73
%X Includes source code.

%A Peter M. Kogge
%D March 1982
%T An Architectural Trail to Threaded-Code Systems
%J Computer
%P 22-32
%K forth dtc itc

%A Dewey Val Schorre
%D 1980
%T Adding Modules to Forth
%J Proceedings of the 1980 FORML Conference
%P 71

%A Dick Pountain
%D 1987
%T Object-Oriented Forth: Implementation of Data Structures
%I Academic Press
%C London

%A Leo Brodie
%D 1984
%T Thinking Forth: A Language and Philosophy for Solving Problems
%I Prentice-Hall
%C Englewood Cliffs, N.J.

%A Christopher J. Matheus
%D 1986
%T The Internals of FORPS: A FORth-based Production System
%J The Journal of Forth Application and Research
%V 4
%N 1
%P 7-27

%A Thomas Almy
%D 1986
%T Compiling Forth for Performance
%J The Journal of Forth Application and Research
%V 4
%N 1
%P 379-388

%A Edward B. Rawson
%D 1986
%T State Sequence Handlers
%J The Journal of Forth Application and Research
%V 3
%N 4
%P 45-64

%A Clifton Guy
%A Terry Rayburn
%D 1986
%T Exception Handling in FORTH
%J The Journal of Forth Application and Research
%V 3
%N 4
%P 37-44

%A Valentin F. Turchin
%D July 1986
%T The Concept of a Supercompiler
%J ACM Transactions on Programming Languages and Systems
%V 8
%N 3
%P 292-325
%K program transformation; lazy evaluation; Refal; Prolog

%A Forth\0Standards\0Team
%D 1983
%T Forth-83 Standard
%I Mountain View Press
%C Mountain View, CA

%A Kenneth Kunen
%T Logic for Logic Programmers 
%D October 1989
%R TR 884
%I COMPUTER SCIENCES DEPARTMENT, UNIVERSITY OF WISCONSIN
%C MADISON, WI
%X The goal of logic programming is that the program, or database,
can be understood by logic alone, independently of any execution model.
Attempts to realize this goal have made it
clear that the logic involved must go beyond ordinary first-order logic.
This survey will explore several topics of current interest
in the logical meaning of logic programs, with particular attention paid to:
(1) The meaning of negation; this still remains problematical,
although many partial results are known.  (2) The meaning
of recursions; these imply a least fixed-point computation in
deductive databases, and something else in Prolog.  (3) The meaning of
the Prolog builtin predicates, such as the
evaluation of numeric terms.  (4) The semantic meaning
of the order in which a stream of answers is returned.
%Y For copies, send requests to:
Technical Report Librarian
Computer Sciences Department
University of Wisconsin
1210 W. Dayton Street
Madison, WI 53706 USA

%A Wil Baden
%D 1984
%T Nonce Defining Words
%J FORML Confernece Proceedings
%I Forth Interest Group
%C San Jose, CA
%P 77-80
%K :DOES>

%A Wil Baden
%D 1985
%T Interpretive Logic
%J FORML Confernece Proceedings
%I Forth Interest Group
%C San Jose, CA
%P 95-101

%A Kim Harris
%D 1985 
%T Using the Structure-Tool Program to Automatically Construct 
Structure Charts of Forth Programs
%J FORML Conference Proceedings 
%I Forth Interest Group
%C San Jose, CA
%P 239-256

%A Lawrence Blair
%D 1988
%T Ring of Fire
%I Bantam Books
%C New York
%K indonesia
%# GN635.I65.B650 1988 Gen

%A Alfred Russel Wallace
%D 1986
%T The Malay Archipelago: The Land of the Orang-utan,
and the Bird of Paradise
%I Oxford University Press
%C Singapore
%K indonesia
%X Available from Dover.
%# DS601.W180 1986 Gen

%A Bruce Pandolfini
%D 1988
%T Pandolfini's Endgame Course
%S Fireside Chess Library
%I Simon & Schuster
%C New York
%# GV1450.7.P450 1988 Harp

%A Aleksei Stepanovich Suetin
%D 1988
%T Plan Like a Grandmaster
%t Ken Neat
%I Batsford
%C London
%# GV1450.S920 1988 Harp

%A Paul H. J. Kelly
%D 1989
%T Functional Programming for Loosely-Coupled Multiprocessors
%I MIT Press
%C Cambridge, Mass.
%S Research monographs in parallel and distributed computing
%# QA76.6.K4490 1989 Eck

%A Arvind
%A Rishiyur S. Nikhil
%A Keshav K. Pingali
%D October 1989
%T I-Structures: Data Structures for Parallel Computing
%J ACM Transactions on Programming Languages and Systems
%V 11
%N 4
%P 598-632

%A Lee C. F. Sallows
%D 1990
%T A Curious New Result in Switching Theory
%J The Mathematical Intelligencer
%V 12
%N 1
%P 21-32

%A William Pugh
%D 1989
%T Skip Lists: A Probabilistic Alternative to Balanced Trees
%B Algorithms and Data Structures
%E F. Dehne
%E J.-R. Sack
%E N. Santoro
%S Lecture Notes in Computer Science
%N 382
%I Springer-Verlag
%C Berlin
%P 437-449
%# QA76.9.D35.A440 1989

%A N. G. de\0Bruijn
%a de bruijn
%D 1972
%T Lambda Calculus Notation with Nameless Dummies, a
Tool for Automatic Formula Manipulation, with Application
to the Church-Rosser Theorem. 
%J Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen
%V 75
%N 5
%I North-Holland
%C Amsterdam
%P 381-392

%A P. J. Landin
%D 1966
%T An Abstract Machine for Designers of Computing Languages
%J Proceedings of the IFIP Congress 65
%V 2
%I Spartan Books
%C Washington
%P 438-439
%K Defines the SECD machine.

%A Michael J. C. Gordon
%A Robin Milner
%A Christopher P. Wadsworth
%D 1979
%T Edinburgh LCF: A Mechanized Logic for Computation
%I Springer Verlag
%C New York

%A D. P. Friedman
%A D. S. Wise
%D 1976
%T CONS Should Not Evaluate its Arguments
%J Proceedings 3rd International Colloquium on Automata
Languages and Programming
%I Edinburgh University Press
%C Edinburgh
%P 257-284
%X The first description of lazy evaluation with Henderson and Morris 1976

%A P. Henderson
%A J. M. Morris
%D 1976
%T A Lazy Evaluator
%J Proceedings 3rd Symposium on Principles of Programming Languages
%I Association for Computing Machinery
%C Atlanta, GA
%P 95-103
%X The first description of lazy evaluation with Friedman and Wise 1976

%A Daniel P. Friedman
%A David S. Wise
%D December 1976
%T Output Driven Interpretation of Recursive Programs, or
Writing Creates and Destroys Data Structures
%J Information Processing Letters
%V 5
%N 6
%K lazy evaluation reference counts

%A Raymond Smullyan
%D 1985
%T To Mock a Mockingbird
%I Knopf
%C New York
%K puzzle; combinatory logic

%A David A. Turner
%D 1979
%T A New Implementation Technique for Applicative Languages
%J Software\(emPractice and Experience
%V 9
%P 31-49

%A Chris S. McDonald
%D October 1987
%T fsh\(emA Functional UNIX Command Interpreter
%J Software\(emPractice and Experience
%V 17
%N 10
%P 685-700
%K fsh

%A A. C. Fleck
%D January 1990
%T A Case Study Comparison of Four Declarative Programming Languages
%J Software\(emPractice and Experience
%V 20
%N 1
%P 49-65

%A David J. Nordstrom
%D 1990
%T Threading Lisp
%J SIGPLAN Notices
%V 25
%N 2
%P 17-24
%K threaded code; forth

%A Steven Pemberton
%D January 1987
%T An Alternative Simple Language and Environment for PCs
%J IEEE Software
%V 4
%N 1
%P 56-64
%K [email protected] (1990); abc

%A Leo Geurts
%A Lambert Meertens
%A Steven Pemberton
%D 1989
%T The ABC Programmer's Handbook
%I Prentice-Hall
%C Englewood Cliffs, NJ

%A Bruce J. MacLennan
%D 1990
%T Functional Programming: Practice and Theory
%I Addison-Wesley
%C Reading, MA

%A Donald A. Ziff
%A Scott C. Deerwester
%A Keith Waclena
%D February 22 1990
%T Using a Functional Language for Textual Information Retrieval: 
Design and Implementation
%R T\&R 90-1
%C Chicago
%I University of Chicago Center for Information and Language Studies

%A Daniel P. Friedman
%A David S. Wise
%D March 1976
%T Aspects of Applicative Programming for File Systems
%J Proceedings of the ACM Conference on Language Design for
Reliable Software
%C Raleigh, NC
%P 41-55
%K functional programming

%A Chris McDonald
%A Trevor I. Dix
%D October 1988
%T Support for Graphs of Processes in a Command Interpreter
%J Software\(emPractice and Experience
%V 18
%N 10
%P 1011-1016

%A Cordelia V. Hall
%A John T. O'Donnell
%D July 1985
%T Debugging in a Side Effect Free Programming Environment
%J SIGPLAN Notices
%V 20
%N 7
%P 60-68

%A John T. O'Donnell
%D July 1985
%T Dialogues: A Basis for Constructing Programming Environments
%J SIGPLAN Notices
%V 20
%N 7
%P 19-27

%A Wayne Throop
%D 18 November 1989
%T Dataflow Shell
%G comp.lang.visual

%A John K. Ousterhout
%D Winter 1990
%T Tcl: An Embedded Command Language
%J USENIX Proceedings
%P 133-146
%X [email protected]

%A Stephen A. Uhler
%D Winter 1990
%T MTX\(emA Shell that Permits Dynamic Rearrangement of Process
Connections and Windows
%J USENIX Proceedings
%P 275-284
%K mtx
%X [email protected]

%A L. Augustsson
%D September 1985
%T Small, A Small Interactive Functional System
%R 28
%I Department of Computer Sciences, Chalmers University of Technology
%C G\o'o\(um'teborg, Sweden
%K goteborg 

%A Jean-Claude Raoult
%A Ravi Sethi
%D July 1983
%T Properties of a Notation for Combining Functions
%J Journal of the ACM
%V 30
%N 3
%P 595-611
%K pipes; combinators; continuations; semantics

%A Frederic B. Fitch
%D 1958
%T Representation of Sequential Circuits in Combinatory Logic
%J Philosophy of Science
%V 25
%P 263-279

%A Daniel P. Friedman
%A David S. Wise
%D 1978
%T Functional Combination
%J Computer Languages
%V 3
%P 31-35

%A L. A. Stabile
%D September 1980
%T FP and its Uses as a Command Language
%J Proceedings of the IEEE Fall COMPCON 80
%C Washington, DC
%P 301-306

%A F. Warren Burton
%D 26 April 1989
%T A Note on Higher-Order Functions versus Logical Variables
%J Information Procesing Letters
%V 31
%P 91-95
%K unification

%A B. Edupuganty
%A B. R. Bryant
%D 1989
%T Two-level Grammar as a Functional Programming Language
%J The Computer Journal
%V 32
%N 1
%P 36-44
%K w-grammar; van Wijngaarden; 2-level grammar

%A Narain Gehani
%D 1977
%T Units of Measure as a Data Attribute
%J Computer Languages
%V 2
%P 93-111
%K dimensional analysis

%A A. van\0Wijngaarden
%a van wijngaarden
%D 1982
%T Languageless Programming
%B The Relationship Between Numerical Computation and Programming Languages
%E J. K. Reid
%I North-Holland
%C Amsterdam
%K w-grammar; 2-level grammar; two-level grammar

%A Christine L. Borgman
%D 1985
%T The User's Mental Model of an Information Retrieval System
%J Proceedings of the 1985-ACM Conference on Research and Development
in Information Retrieval
%C Montreal
%P 268-273
%I Association for Computing Machinery

%A Abraham Bookstein
%D 1985
%T Probability and Fuzzy-Set Applications to Information Retrieval
%J Annual Review of Information Science and Technology (ARIST)
%V 20
%P 117-151

%A Brian Kantor
%A Phil Lapsley
%D February 1986
%T Network News Transfer Protocol: A Proposed Standard for the Stream-Based
Transmission of News
%R Request for Comment 977
%I Network Working Group
%K nntp

%A Kurt N\o'o\(sl'rmark
%a Kurt Normark
%D January 1990
%T Simulation of Object-oriented Concepts and Mechanisms in Scheme
%R R 90-01
%I Institute for Electronic Systems, Department of Mathematics and
Computer Science, University of Aalborg
%C Aalborg, Denmark
%K [email protected] (1990)

%A R. Morrison
%A M. P. Atkinson
%A A. L. Brown
%A A. Dearle
%D 22 February 1990
%T On the Classification of Binding Mechanisms
%J Information Processing Letters
%V 34
%P 51-55
%K persistence; static; dynamic

%A Alejandro D. Mart\o'i\(aa'nez
%a martinez
%A Rosita Wachenchauzer
%A Rafael D. Lins
%D 22 February 1990
%T Cyclic Reference Counting with Local Mark-Scan
%J Information Processing Letters
%V 34
%P 31-35
%K functional programming; garbage collection

%A Alberto Pettorossi
%D 1989
%T Derivation of Programs Which Traverse their Input Data Only Once
%B Advanced Programming Methodologies
%E G. Coulouris
%E A. Salwicki
%I Academic Press
%P 165-184
%K functional programming; transformational programming; circular programs;
lambda hoisting; lambda lifting

%A Clifford W. Ashley
%T The Ashley Book of Knots
%I Doubleday
%C New York
%D 1944
%i 0-385-04025-3

%A Masato Takeichi
%D 1987
%T Partial Parameterization Eliminates Multiple Traversals of Data Structures
%J Acta Informatica
%V 24
%P 57-77
%K functional programming; lambda hoisting; transformational programming

%A Prateek Mishra
%D 6 April 1990
%T LSML: Lazy Standard ML Programmer's Guide
%I Department of Computer Science, The State University of New York
at Stony Brook
%C Stony Brook, NY
%K [email protected]

%A Brian Berliner
%D Winter 1990
%T CVS II: Parallelizing Software Development
%J USENIX Proceedings
%C Washington, DC
%K [email protected]; rcs

%A Richard Stallman
%A Roland McGrath
%D April 1989
%T GNU Make: A Program for Directing Recompilation
%I Free Software Foundation
%C Cambridge, MA

%A Gary Perlman
%D 1986
%T The |STAT Handbook: Data Analysis Programs on Unix and MSDOS
%I [privately published]
%C [n.p.]

%A Rod Manis
%T RDB: Relational Data Base Management System for UNIX
%J CommUNIXations
%N 12
%D April/May 1983
%P 56-58
%# 337

%A Rod Manis
%A Evan Schaffer
%A Robert J\o'o/'rgensen
%a jorgensen
%D 1988
%T Unix Relational Database Management: Application Development
in the Unix Environment
%I Prentice Hall
%C Englewood Cliffs, NJ
%K /rdb

%A R. J. Popplestone
%D 25 April 1990
%T O Language Designer, Remember the Poor User!
%J FP Mailing List
%N <[email protected]>
%K memo functions; functional programming; pop-2; pop-11

%A Paul Hudak
%A Benjamin Goldberg
%D October 1985
%T Distributed Execution of Functional Programs Using Serial Combinators
%J IEEE Transactions on Computers
%V C-34
%N 10
%P 881-891
%K super combinators; parallel; graph reduction; load balancing

%A E. R. Gansner
%A S. C. North
%A K. P. Vo
%D November 1988
%T DAG\(emA Program that Draws Directed Graphs
%J Software\(emPractice and Experience
%V 18
%N 1
%P 1047-1062
%K DAG; troff pre-processor; pic; postscript

%A Hugh Glaser
%A Sean Hayes
%D 1986
%T Another Implementation Technique for Applicative Languages
%B ESOP 86
%S Lecture Notes in Computer Science
%E B. Robinet
%A R. Wilhelm
%N 213
%I Springer-Verlag
%C Berlin
%K functional programming
%P 70-81

%A Kris K. Abe
%A Daniel M. Berry
%D January 1989
%T indx and findphrases, A System for Generating Indexes for Ditroff Documents
%J Software\(emPractice and Experience
%V 19
%N 1
%P 1-34

%A Philip Wadler
%D 1988
%T Deforestation: Transforming Programs to Eliminate Trees
%B ESOP 88
%E H. Ganzinger
%S Lecture Notes in Computer Science
%N 30
%I Springer-Verlag
%C Berlin
%P 344-358
%K functional programming; listless

%A Mark Zimmerman
%D March 1990
%T Notes on Free Text Information Retrieval
%K indxr; brwsr; indexing

%E Paul Hudak
%E Philip Wadler
%T Report on the Programming Language Haskell, A Non-strict
Purely Functional Language (Version 1.0)
%I Yale University, Department of Computer Science
%D April 1990
%R YALEU/DCS/RR777

%A Mark R. Brown
%A Greg Nelson
%D 1989
%T IO Streams: Abstract Types, Real Programs
%R 53
%I Digital Systems Research Center (DECSRL)
%C Palo Alto, CA
%K modula-3

%A Robin Popplestone
%D 26 March 1990
%T Re Constructors and Free Algebras
%J FP Mailing List
%N <[email protected]>
%K functional programming; unfree algebras; data types

%A K. Hammond
%D 3 May 1990
%T Definitional List Comprehensions
%I Department of Computing, Glasgow University
%C Glasgow
%K Haskell

%A Luca Cardelli
%A James Donahue
%A Lucille Glassman
%A Mick Jordan
%A Bill Kalsow
%A Greg Nelson
%D 1989
%T Modula-3 Report (revised)
%R 52
%I Digital Systems Research Center
%C Palo Alto, CA

%A Frederic Brenton Fitch
%D 1952
%T Symbolic Logic: An Introduction
%I The Ronald Press
%C New York
%K subordinate proof; propositional logic; predicate calculus;
modal logic; combinatory logic

%T PostScript Language Tutorial and Cookbook
%Q Adobe Systems Inc.
%I Addison-Wesley
%C Reading, MA
%D 1985

%T PostScript Language Reference Manual
%Q Adobe Systems Inc.
%I Addison-Wesley
%C Reading, MA
%D 1985

%A Oliver Jones
%D 1988
%T Introduction to the X Window System
%I Prentice Hall
%C Englewood Cliffs, NJ

%A R. G. Loeliger
%D 1981
%T Threaded Interpretive Languages
%I Byte Books
%C Peterborough, NH
%K forth; z80; threaded code

%A C. H. Ting
%D 1984
%T Inside F83
%I Offete Enterprises
%C [San Mateo, CA]
%K forth; threaded code
%X Detailed annotation of every line of the source to the IBM PC
implementation of Laxen and Perry's F83.

%A Donald R. Woods
%A James M. Lyon
%D 1973
%T The INTERCAL Programming Language Reference Manual
%K intercal-72

%A Paul Hudak
%A David Kranz
%D 1983
%T A Combinator-based Compiler for a Functional Language
%J Conference Record of the 11th Annual ACM Symposium on Principles
of Programming Languages
%I Association for Computing Machinery
%C New York
%P 122-132
%K POPL; turner combinators; ski; graph reduction

%A Leslie Lamport
%D 1983
%T Reasoning about Nonatomic Operations
%J Conference Record of the 10th Annual ACM Symposium on Principles
of Programming Languages
%I Association for Computing Machinery
%C New York
%P 28-37
%K POPL

%A P. Geoffrey Lowney
%D 1981
%T Carrier Arrays: An Idiom-Preserving Extension to APL
%J Conference Record of the 8th Annual ACM Symposium on Principles
of Programming Languages
%I Association for Computing Machinery
%C New York
%P 1-13
%K POPL

%A John D. Ramsdell
%D September 1989
%T The Alonzo Functional Programming Language
%J SIGPLAN Notices
%V 24
%N 9
%P 152-157
%K lambda calculus

%A Mark Rain
%D May 1989
%T Portable IPC on Vanilla Unix
%J SIGPLAN Notices
%V 24
%N 5
%P 47-56
%X Source code available from the author.

%A Antonio L. Furtado
%A Paolo A. S. Veloso
%D December 1988
%T Iteration for Applicative Languages
%J SIGPLAN Notices
%V 23
%N 12
%P 86-94
%K while; prolog; exponentiation

%A Simon L. Peyton\0Jones
%a peyton jones
%D August 1988
%T FLIC\(emA Functional Language Intermediate Code
%J SIGPLAN Notices
%V 23
%N 8
%P 30-48
%K FLIC

%A Chris Reade
%D 1989?
%T Elements of Functional Programming
%I Addison-Wesley
%C Reading, MA

%A David Watts
%D 1990?
%T Programming Language Concepts and Paradigms
%I Prentice-Hall
%C Englewood Cliffs, NJ
%X To be purchased.

%A Alan Holub
%D 1990?
%T Compiler Design In C [?]
%I Prentice-Hall
%C Englewood Cliffs, NJ
%X To be purchased.

%A Samuel Kamin
%D 1989?
%T Languages: An Interpreter-based Approach
%I Addison-Wesley
%C Reading, PA
%i 0-201-06824-9

%A H. P. Luhn
%D April 1958
%T The Automatic Creation of Literature Abstracts
%J IBM Journal of Research and Development
%V 2
%N 2
%P 159-165

%A H. P Edmundson
%A R. E. Wyllys
%D May 1961
%T Automatic Abstracting and Indexing \(em Survey and Recommendations
%J CACM
%V 4
%N 5
%P 226-234

%A H. P. Edmundson
%D April 1964
%T Problems in Automatic Abstracting
%J CACM
%V 7
%N 4
%P 259-263

%A J. E. Rush
%A R. Salvador
%A A. Zamora
%D August 1964
%T Automatic Abstracting and Indexing \(em Production of Indicative Abstracts
by Application of Contextual Inference and Syntactic Coherence Criteria
%J JASIS
%V 22
%N 4
%P 260-274

%A Julie Beth Lovins
%D 1968
%T Development of a Stemming Algorithm
%J Mechanical Translation and Computational Linguistics
%V 11
%N 1-2
%P 11-31
%K conflation

%A Chris D. Paice
%D 1990
%T Constructing Literature Abstracts by Computer
%J Information Processing & Management
%V 26
%N 1
%P 171-186
%K automatic extracting

%A Vaughan R. Pratt
%D October 1973
%T Top Down Operator Precedence
%J ACM Symposium on Principles of Programming Languages
%I ACM
%C Boston
%P 41-51
%K parsing

%A Martha Evans
%D 1989
%T Computer-Readable Dictionaries
%B Annual Review of Information Science and Technology
%E Martha E. Williams
%V 24
%I Elsevier Science Publishers
%C Amsterdam
%P 85-117
%X Has extensive bibliography.

%A Abraham Bookstein
%D 1985
%T Probability and Fuzzy-Set Applications to Information Retrieval
%B Annual Review of Information Science and Technology
%E Martha E. Williams
%V 20
%I Knowledge Industry Publications
%C White Plains, NY
%P 117-151

%A Gerard Salton
%A Chris Buckley
%A Maria Smith
%D 1990
%T On the Application of Syntactic Methodologies in Automatic Text Analysis
%J Information Processing & Management
%V 26
%N 1
%P 73-92
%X Concludes that syntactic and statistical approaches to e.g. using
phrases for retrieval yield the same results, while the statistical approach
is more economical.

%A Ian A. Macleod
%D 1990
%T Storage and Retrieval of Structured Documents
%J Information Processing & Management
%V 26
%N 2
%P 197-208
%K SGML

%A Harold V. McIntosh
%A Gerardo Cisneros
%D July 1990
%T The Programming Language REC and Convert
%J SIGPLAN Notices
%V 25
%N 7
%P 81-94

%A Tsvetan T. Drashansky
%D July 1990
%T A Concept for Functional Programming and Distributed Data Processing in a
Local Area Network and Its Implementation
%J SIGPLAN Notices
%V 25
%N 7
%P 11-18

%A Peter S. Langston
%D June 1990
%T Unix Music Tools at Bellcore
%J Software \(em Practice and Experience
%V 20
%N S1
%P S1/47-S1-61
%K little languages; algorithmic composition; Unix philosophy

%A David L. Presotto
%A Dennis M. Ritchie
%D June 1990
%T Interprocess Communication in the Ninth Edition Unix System
%J Software \(em Practice and Experience
%V 20
%N S1
%P S1/3-S1/17
%K streams; pipes

%A Simon L. Peyton\0Jones
%a peyton jones
%D [8 June 1990]
%T A Note on Processor Architecture for Lazy Graph Reduction
%G comp.lang.functional
%N <[email protected]>
%K functional programming

%A Scott C. Deerwester
%A Donald A. Ziff
%A Keith Waclena
%D September 1990
%E A. M. Tjoa
%E R. Wagner
%C Vienna
%I Springer Verlag
%T An Architecture for Full Text Retrieval Systems
%B DEXA 90: Database and Expert Systems Applications
%P 22-29

%A Keith Waclena
%D 1990
%T Guide to CILS Computing Facilities
%R TR 90-?
%I University of Chicago Center for Information and Languages Studies

%A Keith Waclena
%T Microcomputer Software Available From CILS
%C Chicago
%R TR 90-?
%I University of Chicago Center for Information and Languages Studies
%D 1990

%A Brad J. Cox
%D 1986
%T Object-Oriented Programming: An Evolutionary Approach
%I Addison-Wesley
%C Reading, MA
%K Objective-C

%A Michael J. A. Berry
%D August 1990
%T Adverbial Programming
%J SIGPLAN Notices
%V 25
%N 8
%P 103-105
%K apl; functionals?

%A S. C. Johnson
%D January 1979
%T YACC: Yet Another Compiler-Compiler
%B Unix Programmer's Manual; 7th Edition
%I Bell Laboratories
%C Murray Hill, N.J.

%A Richard A. Becker
%A John M. Chambers
%D 1984
%T S: An Interactive Environment for Data Analysis and Graphics
%I Wadsworth
%C Belmont, CA
%K statistics; unix

%A William Tuthill
%D November 1981
%T Hum \(em A Concordance and Text Analysis Package
%I Comparative Literature Department, University of California Berkeley
%C Berkeley, CA

%A A. Bookstein
%A S. T. Klein
%D 1990
%T A New Enumeration Method for Subsets
%R TR 90-09
%I University of Chicago Center for Information and Languages Studies
%C Chicago
%K bitmaps; combinatorics; binomial coefficients

%A Pamela Samuelson
%D February 1990
%T Legally Speaking: Interface Specifications, Compatibilty, and Intellectual Property Law
%J Communications of the ACM
%V 33
%N 2
%P 111-114
%K software patents; copyright

%D 1990
%T Research Topics in Functional Programming
%E David A. Turner
%I Addison-Wesley
%C Reading, MA

%A Brian W. Kernighan
%D July/August 1989
%T The Unix System Document Preparation Tools: A Retrospective
%J AT&T Technical Journal
%V 68
%N 4
%P 5-20
%K troff; eqn; tbl; pic; grap; little languages

%A Jon L. Bentley
%D July/August 1989
%T Little Language for Pictures in Awk
%J AT&T Technical Jouurnal
%V 68
%N 4
%P 21-32
%K pic

%A Debra Ansen
%D July/August 1989
%T Document Architecture Standards Evolution
%J AT&T Technical Jouurnal
%V 68
%N 4
%P 33-44
%K Office Document Architecture; document structure

%A Sharon L. Murrel
%A Thaddeus J. Kowalski
%D July/August 1989
%T Monk: A High-Level Text Compiler
%J AT&T Technical Jouurnal
%V 68
%N 4
%P 45-60
%K troff

%A Lorinda L. Cherry
%A Robert K. Waldstein
%D July/August 1989
%T Electronic Access to Full Document Text and Images through Linus
%J AT&T Technical Jouurnal
%V 68
%N 4
%P 72-90

%A Richard A. Becker
%A John M. Chambers
%A A. R. Wilks 
%D 1988
%T The New S Language
%I Wadsworth & Brooks/Cole
%C Pacific Grove, CA

%A Brian W. Kernighan
%A C. J. Van\0Wyk
%a van wyk
%D 1989
%T Page Makeup by Postprocessing Text Formatter Output
%J Computing Systems
%V 2
%N 2
%P 103-132
%K troff

%A Jon L. Bentley
%A Brian W. Kernighan
%D April 1988
%T Tools for Printing Indexes
%J Electronic Publishing
%V 1
%N 1
%P 3-17

%A Jon L. Bentley
%A Lynn W. Jelinski
%A Brian W. Kernighan
%D 1987
%T CHEM \(em A Program for Phototypesetting Chemical Structure Diagrams
%J Computers and Chemistry
%V 11
%N 4
%P 281-297
%K pic
%# QD39.3.E46C76 Sci

%A W. D. Penniman
%A D. T. Hawkins
%A E. Mount
%D Winter 1987/1988
%T The Library Network at AT&T
%J Science & Technology Libraries
%V 8
%N 2
%P 3-24

%A R. K. Waldstein
%D 1988
%T SLIMMER \(em A Unix System based Information Retrieval System
%J Reference Services Review
%V 16
%N 1-2
%P 69-76
%# Z1035.1.R33 Gen

%A Y. Choueka
%D 1980
%T Full Text System and Research in the Humanities
%J Computers and the Humanities
%V XIV
%P 153-169

%A Donna Harman
%D 1986
%T An Experimental Study of Factors in Document Ranking
%E Fausto Rabitti
%J Proceedings of the 1986 ACM Conference on Research and Development
in Information Retrieval
%I ACM
%C New York
%P 186-193
%K weighting

%A Richard Naugle
%D July 1986
%T APL Compilation and Interpretation by Translating to F83VEC
%J APL Quote Quad
%V 16
%N 4
%P 164-171
%K forth; f83

%A Wil Baden
%D 1990
%T CRC Polynomials Made Plain
%J 1989 FORMAL Conference Proceedings
%I Forth Interest Group
%C San Jose, CA
%P 104-112
%K checksum

%A John J. Wavrik
%D 1990
%T User-Defined Systems for Pure Mathematics
%J 1989 FORMAL Conference Proceedings
%I Forth Interest Group
%C San Jose, CA
%P 97-103

%A David M. Harland
%A Hamish I. E. Gunn
%D ????
%T Another Look at Enumerated Types
%J SIGPLAN Notices
%P 62-71

%A K. E. Iverson
%A E. E. McDonnell
%D 1989
%T Phrasal Forms
%J APL Quote Quad
%P 197-199
%K combinators
%O Proceedings APL'89

%A Kenneth E. Iverson
%D September 1988
%T A Commentary on APL Development
%J APL Quote Quad
%V 19
%N 1
%P 3-8
%K dictionary apl; box; mix; nub

%A B. J. MacLennan
%D December 1982
%T Values and Objects in Programming Languages
%J SIGPLAN Notices
%V 17
%N 12
%P 70-79
%K object oriented programming; functional programming

%A Nachum Dershowitz
%A Edward M. Rheingold
%D September 1990
%T Calendrical Calculations
%J Software \(em Practice and Experience
%V 20
%N 9
%P 899-928
%K dates; holidays; gregorian calendar; hebrew calendar;
islamic calendar; julian calendar; ISO calendar

%A John J. Wavrik
%D 1990
%T Handling Multiple Data Types in Forth
%J Journal of Forth Application and Research
%V 6
%N 1
%P 65-76

%A Kenneth E. Iverson
%D September 1987
%T A Dictionary of APL
%J APL Quote Quad
%V 18
%N 1
%P 5-40

%A Mads Tofte
%D March 1989
%T Four Lectures on Standard ML
%R ECS-LFCS-89-73
%I LFCS, Department of Computer Science, University of Edinburgh
%C Edinburgh
%K modules

%A Urs H\o'o\(um'lzle
%a Hoelzle Holzle
%A Bay-Wei Chang
%A Craig Chambers
%A David Ungar
%D July 1990
%T The SELF Manual
%I Center for Integrated Systems, Computer Systems Laboratory, Stanford University
%C Standford, CA
%K object-oriented

%A R. J. Orgass
%A F. B. Fitch
%D 1969
%T A Theory of Computing Machines
%J Studium Generale
%V 22
%P 83-104

%A R. J. Orgass
%A F. B. Fitch
%D 1969
%T A Theory of Programming Languages
%J Studium Generale
%V 22
%P 113-136

%A A. Piperno
%D 1987
%T A Compositive Abstraction Algorithm for Combinatory Logic
%B TAPSOFT '87
%E H. Ehrig
%E R. Kowalski
%E G. Levi
%E U. Montanari
%V 250
%I Springer-Verlag
%C Berlin
%P 39-51
%S Lecture Notes in Computer Science

%A Kenneth E. Iverson
%D 1990
%T The ISI Dictionary of J
%I ISI
%C Toronto
%K apl

%A Kenneth E. Iverson
%D September 1989
%T Tangible Math: ISI J Version
%I ISI
%C Toronto
%K apl; notation

%A Philip Wadler
%D 1986
%T Listlessness is Better than Laziness II: Composing Listless Functions
%B Programs as Data Objects
%E H. Ganzinger
%E N. D. Jones
%S Lecture Notes in Computer Science
%V 217
%I Springer-Verlag
%C Berlin
%P 282-305
%K program transformation

%A Valentin F. Turchin
%D 1986
%T Program Transformation by Supercompilation
%B Programs as Data Objects
%E H. Ganzinger
%E N. D. Jones
%S Lecture Notes in Computer Science
%V 217
%I Springer-Verlag
%C Berlin
%P 257-281
%K refal; supercompiler

%A H. Boehm
%A A. Demers
%A J. Donahue
%D [n.d.]
%T A Programmer's Introduction to Russell
%P [n.p.]

%A Karl Menger
%D 1955
%T Calculus: A Modern Approach
%C Boston
%I Ginn and Company

%A Scott Deerwester
%A Keith Waclena
%T Interactive Little Languages
%J IEEE Software
%O To appear.

%A Philip John Koopman,\0Jr.
%a Koopman
%D 1990
%T An Architecture for Combinator Graph Reduction
%I Academic Press
%C Boston
%K tigre; functional programming; threaded code

%A James W. Stamos
%A David K. Gifford
%D October 1990
%T Remote Evaluation
%J ACM Transactions on Programming Languages and Systems
%V 12
%N 4
%P 537-565
%K remote procedure call

%A R. S. Bird
%D 1986
%T An Introduction to the Theory of Lists
%I Oxford University Computing Laboratory
%R Technical Monograph PRG-56

%A Philip Wadler
%D June 1990
%T Comprehending Monads
%J ACM Conference on Lisp and Functional Programming
%C Nice
%P 61-78
%K category theory; list comprehensions

%A Henry G. Baker
%D June 1990
%T Unify and Conquer (Garbage, Updating, Aliasing, ...) in Functional
Languages
%J ACM Conference on Lisp and Functional Programming
%C Nice
%P 218-226
%K garbage collection; storage use inference

%A L. Allison
%D October 1990
%T Continuations Implement Generators and Streams
%J The Computer Journal
%V 33
%N 5
%P 460-465
%K functional programming; backtracking

%A T. H. Axford
%D October 1990
%T Reference Counting of Cyclic Graphs for Functional Programs
%J The Computer Journal
%V 33
%N 5
%P 466-470
%K garbage collection

%A Roger K. W. Hui
%A Kenneth E. Iverson
%A E. E. McDonnell
%A Arthur T. Whitney
%D July 1990
%T APL\e?
%J APL Quote Quad
%V 20
%N 4
%P 192-200
%K J

%A Kenneth E. Iverson
%D March 1990
%T Classificaton and Sets
%J APL Quote Quad
%V 20
%N 3
%P 1-4
%K Dictionary APL

%A Rafael D. Lins
%A Simon J. Thompson
%D November 1990
%T Implementing SASL Using Categorical Multi-Combinators
%J Software \(em Practice and Experience
%V 20
%N 11
%P 1137-1165

%A J. Eliot B. Moss
%D April 1990
%T Design of the Mneme Persistent Object Store
%J ACM Transactions on Information Systems
%V 8
%N 2
%P 103-139

%A Philip Wadler
%D 1984
%T Listlessness is Better than Laziness
%J ACM Conference on Lisp and Functional Programming
%P 45
%K transformations

%A Timothy A. Budd
%D January 1991
%T Blending Imperative and Relational Programming
%J IEEE Software
%P 58-65

%A Andrew W. Appel
%D 1990
%T A Runtime System
%J Lisp and Symbolic Computation
%V 3
%P 343-380
%K functional programming; Standard ML

%A James Donahue
%A Alan Demers
%D July 1985
%T Data Types are Values
%J ACM Transactions on Programming Languages and Systems
%V 7
%N 3
%P 426-445
%K Russell; polymorphism

%A R. Balter
%T Architecture and Implementation of Guide, an Object-Oriented
Distributed System
%I Unit\o'e\(aa' Mixte Bull-IMAG
%C Gi\o'e\(ga'res, France

%A Steven Anderson
%A Paul Hudak
%D June 20-22, 1990
%T Compilation of Haskell Array Comprehensions for Scientific Computing
%J Proceedings of the ACM SIGPLAN Conference on Programming Language
Design and Implementation
%C White Plains, NY
%P 137-149

%A G. V. Cormack
%A A. K. Wright
%D June 20-22, 1990
%T Type-dependent Parameter Inference
%J Proceedings of the ACM SIGPLAN Conference on Programming Language
Design and Implementation
%C White Plains, NY
%P 127-136

%A H. Sondergaard
%A P. Sestoft
%T Referential transparency, definiteness and unfoldability
%J Acta Informatica
%V 27
%P 505-517
%D 1990
%K functional, nondeterminism, determinism
%X `` A nice paper on referential transparency and F.P.''
Lloyd Allison in comp.lang.functional <[email protected]>.

%A D. Scott Brandt
%T Unix and Libraries
%C Westport, CT
%I Meckler
%D 1991
%# Z678.93.U73B730 1991 Gen.

%E Anderson, James
%T Pop-11 Comes of Age
%I Ellis Horwood
%D 1989
%O A collection of papers on the history of dialects of Pop, the
features and benefits of the language, and some applications using
Pop-11.

%A Larry Wall
%A Randal L. Schwartz
%D 1991
%T Programming Perl
%I O'Reilly and Associates
%S A Nutshell Handbook

%A Donald A. Ziff
%A Keith Waclena
%A Stephen P Spackman
%D 1992
%T Using a Lazy Functional Language for Textual Information Retrieval
%C Chicago
%R T\&R 92-02
%I University of Chicago Center for Information and Languages Studies

%A D. Crocker
%D 1982
%T Standard for the Format of ARPA Internet Text Messages
%I Network Information Center
%R RFC-822

%A John B. Smith
%A Stephen F. Weiss
%A Gordon J. Ferguson
%D [n.d.]
%T MICROARRAS: An Advanced Full-Text Retrieval and Analysis System
%I University of North Carolina Department of Comuter Science
%C Chapel Hill, N. C.

%A C. M. Goldstein
%D 1989
%T Online Reference Works and Full Text Retrieval
%J National Online Meeting Proceedings
%C Medford, N. J.

%A S. Gauch
%A J.B. Smith
%T An expert system for searching in full-text
%J Information Processing and Management
%V 25
%N 3
%D 1989
%P 253-63
%K Microarras

%A Oliver Laumann
%D [n.d.]
%T Reference Manual for the Elk Extension Language Interpreter
%I Technical University of Berlin Communications and Operating
Systems Research Group

%A Donald A. Ziff
%A Keith Waclena
%D 1991
%T The ``Alfonzo'' Language
%C Chicago
%R TR 91-01
%I University of Chicago Center for Information and Languages Studies

%A Scott C. Deerwester
%A Keith Waclena
%A Michelle LaMar
%D January 1992
%T A Textual Object Management System
%R TR 92-01
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.deerwester waclena lamar textual object management system co\&penhagen.]
%F toms

%A Scott C. Deerwester
%A Keith Waclena
%A Michelle LaMar
%D June 1992
%T A Textual Object Management System
%B Proceedings of ACM SIGIR '92
%O Also available as CILS technical report T\&R 92-01.
%C Copenhagen
%I Royal School of Librarianship

%A Gerald J. Holzmann
%D 1988
%T Beyond Photography: The Digital Darkroom
%I Prentice-Hall
%C Englewood Cliffs, N.J.
%i 0-13-074410-7
%K popi

%A Donald A. Ziff
%A Keith Waclena
%A Stephen P. Spackman
%D 1991
%T CAL: Combinator Assembly Language
%R T\&R 91-02
%C Chicago
%I University of Chicago Center for Information and Language Studies

%A Gerald J. Holzmann
%D 1987
%T Pico \(em A Picture Editor
%J AT&T Technical Journal
%V 66
%N 2
%P 2-13

%A National Information Standards Organization (Z39)
%D 1987
%T Codes for the Representation of Languages for
Information Interchange
%R ANSI Z39.53-1987
%I American National Standards Institute
%C New York

%A Margo Seltzer
%A Michael Olson
%D Winter 1992
%T LIBTP: Portable, Modular Transactions for UNIX
%J Proceedings of the USENIX Conference
%I USENIX Association
%C San Francisco
%P 9-25
%K database; transaction processing

%A Jerry Peek
%D 1992
%T MH & xmh: E-mail for Users and Programmers; Third Edition
%I O'Reilly and Associates, Inc.
%C Sebastopol, CA

%A Hal Stern
%D 1991
%T Managing NFS and NIS
%I O'Reilly and Associates, Inc.
%C Sebastopol, CA

%A Abraham Bookstein
%A James A. Storer
%D 1992
%T Data Compression
%J Information Processing and Management
%V 28
%N 6
%P 675-680
%X Nice summary of data compression issues.

%A Abraham Bookstein
%A Shmuel T. Klein
%a tomi
%D 1992
%T Models of Bitmap Generation: A Systematic Approach to Bitmap Compression
%J Information Processing and Management
%V 28
%N 6
%P 735-748

%A Abraham Bookstein
%A Shmuel T. Klein
%a tomi
%A D. A. Ziff
%a donald max
%D 1992
%T A Systematic Approach to Compressing a Full-Text Retrieval System
%J Information Processing and Management
%V 28
%N 6
%P 795-806

%A Forbes J. Burkowski
%D 1992
%T An Algebra for Hierarchically Organized Text-Dominated Databases
%J Information Processing and Management
%V 28
%N 3
%P 333-348

%A Paul R. Wilson
%T Uniprocessor Garbage Collection Techniques
%D September 1992
%J Proceedings International Workshop on Memory Management
%S Lecture Notes in Computer Science
%I Springer-Verlag
%C St. Malo

%A Tom Duff
%D [n.d.]
%T rc\(emA Shell for Plan 9 and UNIX Systems
%B Unix Research System, 10th Edition, vol 2.
%I Saunders College Publishing

%A Jon Bentley
%A Brian Kernighan
%A C. J. Van\0Wyk
%a van wyk
%D February 1991
%T An Elementary C Cost Model
%J Unix Review
%V 9
%N 2
%P 38-48
%K benchmark; timing; speed; efficiency

%A Simon L. Peyton Jones
%A Philip Wadler
%D January 1993
%T Imperative Functional Programming
%J Proceedings of the Symposium on Principles of Programming Languages
%I Association for Computing Machinery
%K POPL; Haskell
%O To appear.

%A Philip Wadler
%D January 1992
%T The Essence of Functional Programming
%J Proceedings of the 19th Annual Symposium on Principles
of Programming Languages
%I Association for Computing Machinery
%C Santa Fe, New Mexico
%K POPL; Haskell

%A Ed Krol
%D 1992
%T The Whole Internet: User's Guide and Catalog
%I O'Reilly and Associates
%C Sebastopol, CA
%S A Nutshell Handbook

%A Andrew Oram
%A Steve Talbott
%D 1991
%T Managing Projects with make
%I O'Reilly and Associates
%C Sebastopol, CA
%S A Nutshell Handbook

%A Brian W. Kernighan
%A Dennis M. Ritchie
%T The C Programming Language; Second Edition
%C Englewood Cliffs, N. J.
%I Prentice Hall
%D 1988
%K ANSI C

%A Linda Lamb
%D 1990
%T Learning the vi Editor
%I O'Reilly and Associates
%C Sebastopol, CA
%S A Nutshell Handbook

%A Morris I. Bolsky
%A David G. Korn
%D 1989
%T The Korn Shell: Command and Programming Language
%C Englewood Cliffs, N. J.
%I Prentice Hall

%A Gail Anderson
%A Paul Anderson
%D 1986
%T The Unix C Shell Field Guide
%C Englewood Cliffs, N. J.
%I Prentice-Hall

%A Lowell Jay Arthur
%D 1990
%T Unix Shell Programming; Second Edition
%I Wiley
%C New York

%A Bil Lewis
%A Dan LaLiberte
%A The GNU Manual Group
%D 1993
%T The GNU Emacs Lisp Reference Manual
%I Free Software Foundation
%C Cambridge, MA

%A Michael A. Schoonover
%A John S. Bowie
%A William R. Arnold
%D 1992
%T GNU Emacs: Unix Text Editing and Programming
%S Hewlett-Packard Press Series
%I Addison-Wesley
%C Reading, MA

%A Rob Pike
%D 1987
%T The Text Editor sam
%J Software\(em\&Practice and Experience
%V 17
%N 11
%P 813-845
%K structural regular expressions; plan 9; 8.5

%A Ren\'e\(aa' Seindal
%a rene
%D 1992
%T GNU M4: A Macro Processor
%I Free Software Foundation
%C Cambridge, MA

%A Ellis S. Cohen
%A Edward T. Smith
%A Lee A. Iverson
%D May 1986
%T Constraint-Based Tiled Windows
%J IEEE Computer Graphics and Applications
%P 35-45
%K window manager; rtl; crtl

%A John R. Levine
%A Tony Mason
%A Doug Brown
%D 1990
%T Lex & Yacc
%I O'Reilly and Associates
%C Sebastopol, CA
%S A Nutshell Handbook
%K flex; bison

%A S. T. Klein
%D June 1989
%T Combinatorial Representation of Generalized Fibonacci Numbers
%R TR 89-01
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.klein combinatorial fibonacci qu\&arterly.]
%F comb

%A Don R. Swanson
%D December 1989
%T Medical Literature as a Source of New Knowledge
%R TR 89-04
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.swanson medical literature knowledge bull\&etin.]

%A Don R. Swanson
%D December 1989
%T Medical literature as a potential source of new knowledge
%R TR 89-08
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.swanson medical potential bulle\&tin.]

%A Don R. Swanson
%D January 1990
%T Medical literature as a potential source of new knowledge
%J Bulletin of the Medical Library Association
%N 1
%V 78

%A A. Bookstein
%A S. T. Klein
%D December 1989
%T Compression, Information Theory and Grammars:
A Unified Approach
%R TR 89-05
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.bookstein klein grammars office information sy\&stems.]

%A A. Bookstein
%A S. T. Klein
%D January 1990
%T Compression, Information Theory and Grammars:
A Unified Approach
%J ACM Transactions on Office Information Systems

%A Don R. Swanson
%D December 1989
%T Somatomedin C and Arginine: 
Implicit Connections Between Mutually Isolated Literatures
%R TR 89-07
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.swanson somatomedin perspectives bi\&ology.]

%A Don R. Swanson
%D Winter 1990
%T Somatomedin C and Arginine:
Implicit Connections Between Mutually Isolated Literatures
%J Perspectives in Biology and Medicine
%N 2
%V 33

%A A. Bookstein
%A S. T. Klein
%D February 23 1990
%T Using Bitmaps for Medium Sized Information Retrieval Systems
%R TR 90-02
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.bookstein klein bitmaps medium processing manag\&ement.]
%F tr90-02

%A A. Bookstein
%A S. T. Klein
%D 1990
%T Using Bitmaps for Medium Sized Information Retrieval Systems
%J Information Processing and Management
%V 26
%N 4
%P 525-533

%A Don R. Swanson
%D February 1990
%T Integrative Mechanisms in the Growth of Knowledge
%R TR 90-05
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.swanson integrative information processing managem\&ent.]

%A Don R. Swanson
%D 1990
%T Integrative Mechanisms in the Growth of Knowledge
%J Information Processing and Management
%N 1
%V 26

%A Don R. Swanson
%D March 1990
%T The Absence of Co-Citation as a Clue to Undiscovered Causal Connections
%R TR 90-06
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.swanson absence clue scholarly bibliomet\&rics.]

%A Don R. Swanson
%D 1990
%T The Absence of Co-Citation as a Clue to Undiscovered Causal Connections
%J Scholarly Communication and Bibliometrics

%A A. Bookstein
%T Informetric Distributions, Part I: Unified Overview
%J JASIS
%V 41
%N 5
%D July 1990
%P 368-375

%A A. Bookstein
%T Informetric Distributions, Part II: Resilience to Ambiguity
%J JASIS
%V 41
%N 5
%D July 1990
%P 376-388

%A A. Bookstein
%A S. T. Klein
%D 1991
%T Compression of Correlated Bit-Vectors
%J Information Systems
%V 16
%N 4
%P 387-400.

%A A. Bookstein
%A S. T. Klein
%D February 23 1990
%T Information Retrieval Tools for Literary Analysis
%R TR 90-04
%I CILS\(emUniversity of Chicago
%C Chicago
%F tr90-04
%b [.bookstein klein 1990 information retrieval tools DE\&XA.]

%A A. Bookstein
%A S. T. Klein
%D September 1990
%T Information Retrieval Tools for Literary Analysis
%E A. M. Tjoa
%E R. Wagner
%B Database and Expert Systems Applications:
Proceedings of the DEXA 90 Conference
%C Vienna
%I Springer Verlag
%P 1-7

%A A. Bookstein
%A I. K. Ravichandra Rao
%A M. D. Patil
%D March 1992
%T Can Random Fluctuation be Exploited in Data Compression
%R TR 92-03
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.bookstein rao patil raita 1993 can random fluctuations exploited data compres\&sion.]
%F chance

%A A. Bookstein
%A S. T. Klein
%A T. Raita
%A I. K. R. Rao
%A M. D. Patil
%D 1993
%T Can Random Fluctuations be Exploited in Data Compression
%E J. A. Storer
%E M. Cohn
%B Proceedings of the 3rd International Conference on Data
Compression, DCC 93, Snowbird, Utah
%C Los Alamitos, CA
%I IEEE Computer Society Press
%P 70-78

%A Alistair Moffat
%A Justin Zobel
%D 17 May 1993
%T Supporting Random Access in Files of Variable Length Records
%J Information Processing Letters
%V 46
%P 71-77
%K file structures; compression

%A Don Libes
%D May 1993
%T Kibitz -- Connecting Multiple Interactive Programs Together
%J Software -- Practice and Experience
%V 23
%N 5
%P 465-475
%K expect; tcl

%A Jeffrey H. Kingston
%D 1993
%T Document Formatting with Lout; Second Edition
%I The University
%C Sydney
%K typesetting; typesetter; postscript

%A Grace Todino
%A John Strang
%D 1987
%T Learning the Unix Operating System 
%I O'Reilly & Associates
%C Sebastopol, CA
%S A Nutshell Handbook

%A Theodor Holm Nelson
%D 1987
%T Literary machines : the report on, and of, Project Xanadu
concerning word processing, electronic publishing,
hypertext, thinkertoys, tomorrow's intellectual revolution,
and certain other topics including knowledge, education and
freedom
%I Theodor H. Nelson
%C Swarthmore, Pa.
%K hypertext

%A P. J. Plauger
%D 1992
%T The Standard C Library
%I Prentice-Hall
%C Englewood Cliffs, N. J.

%A D. R. Morrison
%T PATRICIA - Practical Algorithm To Retrieve Information Coded
In Alphanumeric
%J JACM
%V 15
%N 4
%P 514-534
%D 1968
%K patricia tree trees trie tries

%A A. J. Cole
%D 1981
%T Macro processors; 2nd ed.
%I Cambridge University Press
%C New York

%A Debra Cameron
%A Bill Rosenblatt
%D 1991
%T Learning GNU Emacs
%I O'Reilly and Associates
%C Sebastopol, CA
%O Covers v18.

%A Richard P. Gabriel
%D [n.d.]
%T Lisp: Good News: Bad News: How to Win Big

%A Paul Graham
%D 1994
%T On Lisp: Advanced Techniques for Common Lisp
%I Prentice Hall
%C Englewood Cliffs, N. J.
%K macros

%A Hal Abelson
%A Matthew Halfant
%A Jacob Katzenelson
%A Gerald Jay Sussman
%D 1988
%T The Lisp Experience
%J Annual Review of Computer Science
%V 3
%P 167-195

%A John C. Reynolds
%D 1993
%T The Discoveries of Continuations
%J Lisp and Symbolic Computation
%V 6
%P 233-248
%K van wijngaarden

%A Richard Reti
%A H. Golombek
%D 1974
%T Reti's Best Games of Chess
%I Dover
%C New York
%K chess

%A Eugene Znosko-Borovsky
%D 1974
%T How to Play Chess Endings
%I Dover
%C New York
%K chess

%A M. M. Botvinnik
%D 1960
%T One Hundred Selected Games
%t Stephen Garry
%I Dover
%C New York
%K chess

%A Gary Kasparov
%A Raymond Keene
%A Jonathan Tisdall
%A Eric Schiller
%D 1982; 1986
%T Batsford Chess Openings
%I B. T. Batsford
%C London
%K chess

%A David Bronstein
%D 1979
%T Zurich International Chess Tournament, 1953
%t Jim Marfia
%I Dover
%C New York
%K chess

%A Ludek Pachman
%D 1976
%T Complete Chess Strategy
%I B. T. Batsford
%C London
%K chess
%O In three volumes.

%A Larry Evans
%D 1972
%T New Ideas in Chess; revised ed.
%I Cornerstone Library; Simon and Schuster
%C New York
%K chess

%A J. du Mont
%D 1978
%T The Basis of Combination in Chess
%I Dover
%C New York
%K chess

%A Alexander Alekhine
%D 1925
%T The Book of the New York International Chess Tournament 1924
%E Hermann Helms
%I Dover
%C New York
%K chess

%A Michael Stean
%D 1978
%T Simple Chess
%I Faber and Faber
%C London
%K chess

%A Ken Smith
%D [n.d.]
%T Making Chess Endings Easy to Study
%I Chess Digest
%C Dallas, TX
%K chess

%A Baranov [Soviet master]
%D [n.d.]
%T Storming the Royal Fortress
%I Chess Digest
%C Dallas, TX
%K chess

%A Mike Fox
%A Richard James
%D 1987
%T The Complete Chess Addict
%I Faber and Faber
%C London
%K chess

%A Richard Reti
%D 1960
%T Modern Ideas in Chess
%I Dover
%C New York
%K chess

%A S. Tartakower
%A J. du Mont
%D 1975
%T 500 Master Games of Chess
%I Dover
%C New York
%K chess

%A S. G. Tartakower
%D 1985
%T My Best Games of Chess 1905-1954
%I Dover
%C New York
%K chess

%A Irving Chernev
%D 1957
%T Logical Chess: Move by Move
%I Simon and Schuster
%C New York
%K chess

%A Fred Reinfeld
%D 1947
%T How To Force Checkmate
%I Dover
%C New York
%K chess

%A Jeremy Silman
%D 1988
%T Essential Chess Endings Explained Move by Move
%I Chess Digest
%C Dallas, TX
%K chess

%A Aron Nimzovich
%D 1948
%T Hypermodern Chess: As Developed in the Games of its Greatest
Exponent, Aron Nimzovich
%E Fred Reinfeld
%I Dover
%C New York
%K chess

%A A. Bookstein
%D June 1989
%T Robustness Properties of the Bibliometric Distributions
%R TR 89-02
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.bookstein informetric distributions ja\&sis.]
%F bibliometrics

%A A. Bookstein
%A S. T. Klein
%D February 23 1990
%T Construction of Optimal Graphs for Bit-Vector Compression
%R TR 90-03
%I CILS\(emUniversity of Chicago
%C Chicago
%b [.bookstein klein compression correlated bit vec\&tors.]
%F tr90-03

%A A. Bookstein
%A S. T. Klein
%A T. Raita
%D April 1992
%T Compression of Concordances Subject to Clustering
%R TR 92-04
%I CILS\(emUniversity of Chicago
%C Chicago

%A Don R. Swanson
%D January 1992
%T Chromosomes and Mendelism Before 1890:
Complementary but Disjoint Literatures
%R TR 92-05
%I CILS\(emUniversity of Chicago
%C Chicago

%A Don R. Swanson
%A Susan T. Dumais
%T Comparison of Latent Semantic Indexing with Boolean Word Searching
in a Small Collection of Medical Abstracts
%R TR 92-06
%I CILS\(emUniversity of Chicago
%C Chicago

%A Donald A. Ziff
%A Stephen P. Spackman
%A Keith Waclena
%D July 1995
%T Funser: a Functional Server for Textual Information Retrieval
%J The Journal of Functional Programming
%V 5
%N 3
%P 317-343
%K lazy functional programming; ARTFL; CILS; alfonzo; aboieront

%A E. W. Dijkstra
%D March 1968
%T Go To Statement Considered Harmful
%J Communications of the ACM
%V 11
%N 3
%P 147-148
%K goto

%A A. J. T. Davie
%A R. Morrison
%D 1981
%T Recursive Descent Compiling
%I E. Horwood
%C Chichester, West Sussex
%K s-algol; parsing

%A Lyn Macdonald
%T 1915, the death of innocence
%C New York
%I Henry Holt
%D 1995
%K history/wwi

%A C. L. A. Clarke
%A G. V. Cormack
%A F. J. Burkowski
%D 1995
%T An Algebra for Structured Text Search and a Framework
for its Implementation
%J The Computer Journal
%V 38
%N 1
%P 43-56

%A Geoffrey Jenkins
%D 1962
%T The Disappearing Island
%I Viking Press
%C New York
%O Also published by Avon.  Alternate title: A Grue of Ice.

%A Jo A. Lawless
%A Molly M. Miller
%D 1991
%T Understanding CLOS: The Common Lisp Object System
%I Digital Press
%C [n.p.]

%A Gerardo Cisneros
%D May 1994
%T Configurable REC
%J SIGPLAN Notices
%V 29
%N 5
%P 7-16

%A Samuel R. Delany
%D 1988
%T The Motion of Light in Water: Sex and Science Fiction Writing in the
East Village, 1957-1965
%I Arbor House
%C New York

%A Jack Woehr
%D 1992
%T Forth: The New Model
%I M&T Books
%C San Mateo, CA
%d 005.13'3--dc20
%K ANS Forth; ANSI

%D July-September 1991
%T Revised^4 Report on the Algorithmic Language Scheme
%E W. Clinger
%E J. Rees
%J ACM Lisp Pointers
%V IV
%K R4RS
%O Also published as MIT AI Memo 848b.

%A Xavier Leroy
%A Pierre Weis
%T Manuel de Référence du langage Caml
%I InterEditions
%i 2-7296-0492-8
%K Manuel de reference du langage Caml; CAML
%O In French.

%A DeLynn C. Colvert
%D 1980
%T Play Winning Cribbage
%I Starr Studios
%C Missoula, MT

%D 1991
%E Greg Nelson
%T System Programming with Modula-3
%I Prentice Hall
%C Englewood Cliffs, N. J.
%O ISBN 0-13-590464-1

%A Paul Graham
%D 1996
%T ANSI Common Lisp
%I Prentice-Hall
%C Englewood Cliffs, N. J.
%O isbn 0 13 370875 6

%A E. Tufte
%D 1990
%T Envisioning Information
%I Graphics Press
%C Cheshire, CT

%A E. Tufte
%D 1997
%T Visual explanations: images and quantities, evidence and narrative
%I Graphics Press
%C Cheshire, CT

%A John W. Tukey
%T Exploratory data analysis
%I Addison-Wesley
%C Reading, MA
%D 1977
%K EDA