| 
|
Topic: list processing
topics >
computer science >
programming >
attribute-value pairs as information
Topic:
block machines
Topic:
data type as constructors, selectors, and predicates
Topic:
data types are not needed
Topic:
interpreter
Topic:
lists
Topic:
no need for variables
Topic:
object transformation language
Topic:
open systems
Topic:
primitive functions
Topic:
procedures as data
Topic:
recursive data structures
Topic:
symbolic manipulation of formulas
Topic:
universal data type
Subtopic: list algorithms
QuoteRef: sammJE_1969 ;;383 list processing generally for symbol manipulation i.e. logical sequential QuoteRef: mccaJ_1960 ;;Recursive functions of symbolic expressions and their computation by machines
Subtopic: efficient list processing
Quote: empirical test of online list accessing; move-to-front, frequency-count, and move-to-recent-item(0) were best [»bachR1_1997] Quote: use a local variable for the head of a list; simplifies manipulation of dynamic data structures [»qiuZ9_1997]
Subtopic: source-rich environment
Quote: Common Lisp is a well-defined, flexible, rich, and eminently useful language [»tichWF11_1987] Quote: a good Common Lisp compiler is as efficient as FORTRAN for numeric programs [»tichWF11_1987] Quote: no drivers needed for unit testing with interactive interpreters; just type a call to the function [»tichWF11_1987] Quote: the Common Lisp reader is also useful for lexical analysis and parsing of input; somewhat programmable [»tichWF11_1987]
Subtopic: unevaluated elements
Quote: a source-full environment, like Lisp, includes access to all functions; yet usually no access to operating system, compiler, or applications [»weisM11_1987] Quote: DocumentExaminer includes entire Lisp manual [»conkJ9_1987] Quote: every definition in Common Lisp includes on-line documentation strings; allows user to query a symbol without searching text [»tichWF11_1987]
Subtopic: executable data
Quote: data objects in Boxer are unevaluated; like quote in Lisp but not stripped on evaluation [»diseAA_1986]
Subtopic: persistent lists
Quote: with Lisp can write new node types for NoteCards or action nodes which execute when accessed [»conkJ9_1987]
Subtopic: examples
Quote: the Integrated Data Store moves list processing to disk with circular chains of links from master records; maybe basis for information algebra [»bachCW_1964]
QuoteRef: hoarCA10_1973 ;;8 function car (1:list):list; car := cases of (atom (id)-> error [ cons (left, right) -> left);
Topic: attribute-value pairs as information (57 items)
Topic: block machines (8 items)
Topic: data type as constructors, selectors, and predicates (20 items)
Topic: data types are not needed (8 items)
Topic: interpreter (59 items)
Topic: lists (8 items)
Topic: no need for variables (13 items)
Topic: object transformation language (10 items)
Topic: open systems (33 items)
Topic: primitive functions (34 items)
Topic: procedures as data (22 items)
Topic: recursive data structures (18 items)
Topic: symbolic manipulation of formulas (12 items)
Topic: universal data type
(18 items)