Topic: foreach and for all statements
Topic: events
Topic: boolean values, binary numbers, and bit strings
Topic: function call
Group: memory management
Topic: pattern matching
Topic: string transformation languages
Topic: initialization of data
Topic: type conversion
Topic: safe use of pointers
Topic: index sequence for array access
Topic: sub-sequences
Topic: symbol table
Topic: string operations
Topic: attribute-value pairs as information
Topic: quantified repetition
Topic: text editing
Topic: structure transformation languages
Topic: failure returning functions and expressions
Topic: range checking
Topic: task scheduling
Topic: primitive data type as memory
Topic: strings
Topic: interactive response time
Topic: notations for brackets
Topic: conditional statement
Topic: builtin functions
Topic: virtual memory
Topic: goto statement
Topic: dynamic code modification
Topic: in-line machine code
Topic: case statement
Topic: pattern brackets
Topic: notation for declarations
Group: program control
Topic: asynchronous processing
Topic: event controlled processing
Group: input/output
Topic: execution with program stubs
Topic: prompted input
Topic: scrolling a window
Topic: declaration through use
Topic: program construction by walk-through
Topic: procedures as data
Topic: conditional expression
Topic: for loop
Topic: macro syntax definition
Topic: compile-time execution
Topic: running programs in a workspace or environment
Topic: pattern specification
Topic: list processing
Topic: function syntax definition
Topic: evaluate operator
Topic: operator precedence
Topic: output formatting
Topic: string and list concatenation
Topic: notation for operations
ThesaHelp: references sa-sz
Topic: comments
Topic: defensive programming
Topic: pronoun reference
Topic: default value
Topic: program blocks for control
Topic: save-restore
Topic: token
Topic: pattern components
Topic: simple loop
Topic: symbolic manipulation of formulas
Topic: function definition
Topic: page formatting
Topic: actor machines
Topic: no need for variables
Topic: trees
Topic: command language
Topic: debugger
Topic: abstract data type
Group: type declaration
Topic: sections of a program
Topic: business application language
Topic: file
Topic: programming with data
Topic: temporary data objects
Topic: notations for object access
Topic: macros
| |
Reference
Sammet, J.E.,
Programming Languages--history and fundamentals, Englewood Cliffs, New Jersey, Prentice Hall, 1969.
Google
Quotations
77 ;;Quote: an operation needs to be done while a command (e.g., 'ADD a TO b') must be done
| QuoteRef: sammJE_1969 ;;99 rational arithmetic eg 1/3 + 1/3 = 2/3
| QuoteRef: sammJE_1969 ;;128 scientific problems lots of computation while data processing has lots of i/o
| QuoteRef: sammJE_1969 ;;131 Laning and Ziesler '54: loops by v=1(.2)2(1)5 is 1,1.2,1.4,1.6,1.8,2, 3,4,5
| Subtopic: Neliac
QuoteRef: sammJE_1969 ;;201 triplets of two operators with operand in between (Neliac)
| QuoteRef: sammJE_1969 ;;202 parts of words eg c(15-20) is word c bits 15-20
| QuoteRef: sammJE_1969 ;;202 a|bc means variable abc is local
| QuoteRef: sammJE_1969 ;;204 i/o mode by carrots i.e. {device numeric output | Subtopic: Joss
QuoteRef: sammJE_1969 ;;221 postconditionals and range tests by a<b<c
| QuoteRef: sammJE_1969 ;;223 function to convert booleans to 1 or O
| QuoteRef: sammJE_1969 ;;226 sum i=1(1)10: i*2 == i**2, also prod for
| QuoteRef: sammJE_1969 ;;226 first i=1(1)10: i>4 =5 (first value satisfying condition
| 228 ;;Quote: Quicktran debugger can log modified variables, execution of a region, and subroutine calls
| Subtopic: Map
QuoteRef: sammJE_1969 ;;241 definition of functions by equation or data (table) also high and low bounds on argument (domain)
| QuoteRef: sammJE_1969 ;;242 lots of math computations eg least squares, differentiation, plotting
| QuoteRef: sammJE_1969 ;;244 user talked through command if it is incomplete
| Subtopic: Colasl
QuoteRef: sammJE_1969 ;;268 material typed in red for comments
| QuoteRef: sammJE_1969 ;;269 anything not syntactical defined is a comment
| QuoteRef: sammJE_1969 ;;269 parametric variable for compile time evaluation eg g .doubleEquals. i+5
| QuoteRef: sammJE_1969 ;;269 goto at beginning of sentence deferred till end of sentence reached
| QuoteRef: sammJE_1969 ;;270 implied increment for for loops eg (i=0.1.....5)
| Subtopic: Cobol
QuoteRef: sammJE_1969 ;;361 if a=b move x to y; otherwise if greater, move...is otherwise if a b
| 364 ;;Quote: Cobol's data division provides physical and logical descriptions of files
| 375 ;;Quote: Cobol makes clear distinctions between actions, data, and environment
| QuoteRef: sammJE_1969 ;;383 list processing generally for symbol manipulation i.e. logical sequential
| Subtopic: L^6
QuoteRef: sammJE_1969 ;;401 subroutine call with specific fail exit eg (fail label, do, name) then in routine have FAIL and DONE
| QuoteRef: sammJE_1969 ;;404 save and restore push-down operations used a lot
| QuoteRef: sammJE_1969 ;;416 lisp: can operate on itself since internal form of data and program are the same
| Subtopic: Comit
QuoteRef: sammJE_1969 ;;422 program of rewrite rules executed if pattern found: label pattern-specifier = pattern replacement // routing goto (null field by *)
| QuoteRef: sammJE_1969 ;;423 no variables, have a workspace and several shelves
| QuoteRef: sammJE_1969 ;;424 strings of concatenated constituents e.g., t+h+i+s. or this+is+data+.
| QuoteRef: sammJE_1969 ;;425 goto's: labeled, next rule (*), skip a rule (**), repeat (/), call with pushdown (routine name + label pushed), pushdown inserted under top element (routine ++ label), return by popping (+)
| QuoteRef: sammJE_1969 ;;425 rules with labeled subrules (indented with blanks) with control determined by dispatcher
| QuoteRef: sammJE_1969 ;;426 replacement string built by sequence arguments (e.g. 1 for first pattern constitute)
| QuoteRef: sammJE_1969 ;;426 patterns by $n for n arbitrary constitutes ($0 for null, $ any number literal. not literal ($-literal). matching another constitute (eg 2)
| QuoteRef: sammJE_1969 ;;426 left side refers to substring to be replaced and constitutes not mentioned are deleted.
| QuoteRef: sammJE_1969 ;;comit pattern matching: literal, all ,length, classified
| QuoteRef: sammJE_1969 ;;427 Comit uses routing for non-replacement operations; e.g., shelving, I/O, free storage
| QuoteRef: sammJE_1969 ;;427 expand and compression functions on constitutes e.g. The+dog becomes under * $1+$1=//*e1 2* T+h+e+d+o+g and reversed by * $3+$=//*k1,*k2*
| 428 ;;Quote: Comit qualifies constituents with a number and a list of attribute/value_list's
| QuoteRef: sammJE_1969 ;;428 numeric subscripts in pattern specification-- equals (.n), equals subscript of another constitute (.*j), greater than (.Gn or.G.*j , less than, and none (-.) eg c/.g25,.l35 tests the numeric range
| QuoteRef: sammJE_1969 ;;428 eg define noise words by compiler text replacement with ""
| QuoteRef: sammJE_1969 ;;429 can test for logical subscripts (unordered)
| QuoteRef: sammJE_1969 ;;430 dispatcher by logical subscripts changed by routing (by merging or from workspace by *Dj where jth constituent subscripts merged
| 432 ;;Quote: Comit uses shelves for temporaries which act as queues
| QuoteRef: sammJE_1969 ;;432 change all B to C by *$+b=1+c//*Q23 1 2 / (repeats till fails) *$0=//*A23 1*
| QuoteRef: sammJE_1969 ;;432 Storage by tests on memory eg, >*n continue routing if storage greater than numeric subscript of constitute n
| QuoteRef: sammJE_1969 ;;433 tests return null values eg n=.1t(n,"50")n+"1"/s(comp) bumps n and transfers to comp if n 1t 50
| QuoteRef: sammJE_1969 ;;434 -label indicates following sub-rules form a table with one literal constituent on left side. allows sorted indexed table
| Subtopic: Snobol
QuoteRef: sammJE_1969 ;;440 size(a) function call while size (a) is concatenation of size and (a)
| QuoteRef: sammJE_1969 ;;441 indirection eg $route is same as value of route
| QuoteRef: sammJE_1969 ;;441 arithmetic higher precedence than concatenation eg "3"+"2" "5" is "65"
| QuoteRef: sammJE_1969 ;;443 snobol has named string reference while comit has only workspace
| Subtopic: Trac
QuoteRef: sammJE_1969 ;;452 TRAC #(cl, n, z) calls string n from current location to next segment gap. if n is empty has value of z
| QuoteRef: sammJE_1969 ;;453 example #(ds, n, ##(c1,n)#(da)) calls n into working area, deletes all forms (da) then defines form n as original without segment gaps.
| QuoteRef: sammJE_1969 ;;453 Trac has several different kinds of calls for selecting substrings of a form.
| Subtopic: Ambit
QuoteRef: sammJE_1969 ;;454 string match must include a pointer e.g., (a / p .triangle. b)=c -> a .triangle. = (b*c) transforms string and moves pointer p.
| QuoteRef: sammJE_1969 ;;454 AMBIT for math symbol manipulation
| QuoteRef: sammJE_1969 ;;456 matched parens to show tree structure %!!
| QuoteRef: sammJE_1969 ;;456 in pattern specification same name refers to same element in class
| Subtopic: Treet
QuoteRef: sammJE_1969 ;;459 nil (empty list) is false while all other lists are true so no need logical data type
| QuoteRef: sammJE_1969 ;;459 if pred then the pred is assigned to P and can be reused
| QuoteRef: sammJE_1969 ;;460 loop control by While loop-while-true statement
| QuoteRef: sammJE_1969 ;;461 block by do (statement list)
| QuoteRef: sammJE_1969 ;;461 avoids unmatched parens by allowing ** only between functions
| Subtopic: Formac
QuoteRef: sammJE_1969 ;;476 general problem with formula language is easy to outgrow available memory
| QuoteRef: sammJE_1969 ;;479 variables containing algebraic expressions with rational and floating point constants eg let y=a+b*c results in an expression
| Subtopic: Mathlab
QuoteRef: sammJE_1969 ;;498 uses 'name' or 'function' to indicate evaluation
| Subtopic: Magic paper
QuoteRef: sammJE_1969 ;;513 scroll mechanism so can look back at previous work on display screen
| Subtopic: Symbolic mathematical laboratory
QuoteRef: sammJE_1969 ;;516 a i.j (c.de) is function reference A??(c,d,e) [Symbolic mathematical library]
| Subtopic: Jovial
QuoteRef: sammJE_1969 ;;532 access to one machine accumulator through assign A=var. and assign va
| Subtopic: PL/1
550 ;;Quote: in PL/1, structures and arrays can be intermixed, e.g., a. b(10)
| QuoteRef: sammJE_1969 ;;553 "prologue" for initializing storage and variables
| QuoteRef: sammJE_1969 ;;555 pointer data can only have equality tested no other operations allowed
| QuoteRef: sammJE_1969 ;;563 event option on task creation signals end of task
| QuoteRef: sammJE_1969 ;;566 Declare p pointer, alpha float based (p) means reference to alpha is reference to real number pointed to by p
| QuoteRef: sammJE_1969 ;;567 i/o is either stream (.wrs) or record (.wrl) oriented
| QuoteRef: sammJE_1969 ;;570 asynchronous i/o via an event option
| QuoteRef: sammJE_1969 ;;571 Display string-to-console reply variable-to-receive reply event event-name-to-signal-completion
| QuoteRef: sammJE_1969 ;;574 Wait (for event list true) (wait for n events to be true)
| QuoteRef: sammJE_1969 ;;575 contextual declaration eg get file (master) data declares mast as type file
| QuoteRef: sammJE_1969 ;;576 "secondary" data does not require efficient storage
| QuoteRef: sammJE_1969 ;;578 initialization of an entity by a procedure
| 579 ;;Quote: compile time macros that provide a full programming language, e.g., variables, labels, conditionals, repetition
| Subtopic: Formula Algol
QuoteRef: sammJE_1969 ;;584 Formula Algol: id of type form or symbol has description list of attributes and value eg r <- /[color: blue green] [processed: true]
| QuoteRef: sammJE_1969 ;;584 symbol variables have stacks associated with them
| QuoteRef: sammJE_1969 ;;587 f==P if form f represented by pattern P, f>>P if P represents a subexpression of the form f
| QuoteRef: sammJE_1969 ;;587 a:f >>t:p replaces t with first matching subexpression and A with form f with t subexpression e.g., 2*t/5
| Subtopic: Ices
QuoteRef: sammJE_1969 ;;618 provides a command definition lang. to build up special purpose command languages
| Subtopic: Animated Movie Language and Bugsys
QuoteRef: sammJE_1969 ;;644 scanners which sit on surface and move about with ability to test and change surface and relative positioning
| Subtopic: Graf
QuoteRef: sammJE_1969 ;;674 display variables of list of commands to generate a display, built from primitive commands by concatenation
| Subtopic: Cps
QuoteRef: sammJE_1969 ;;689 autosave parameters option-- back's up user's work periodically auto@
| Subtopic: Ctss
QuoteRef: sammJE_1969 ;;690 types Wait on console while executing commands %type wait then digits to indicate progress
|
Related Topics
Topic: foreach and for all statements (16 items)
Topic: events (44 items)
Topic: boolean values, binary numbers, and bit strings (44 items)
Topic: function call (28 items)
Group: memory management (11 topics, 346 quotes)
Topic: pattern matching (42 items)
Topic: string transformation languages (17 items)
Topic: initialization of data (42 items)
Topic: type conversion (33 items)
Topic: safe use of pointers (102 items)
Topic: index sequence for array access (16 items)
Topic: sub-sequences (13 items)
Topic: symbol table (4 items)
Topic: string operations (20 items)
Topic: attribute-value pairs as information (53 items)
Topic: quantified repetition (11 items)
Topic: text editing (34 items)
Topic: structure transformation languages (7 items)
Topic: failure returning functions and expressions (24 items)
Topic: range checking (20 items)
Topic: task scheduling (49 items)
Topic: primitive data type as memory (29 items)
Topic: strings (13 items)
Topic: interactive response time (32 items)
Topic: notations for brackets (9 items)
Topic: conditional statement (8 items)
Topic: builtin functions (6 items)
Topic: virtual memory (32 items)
Topic: goto statement (25 items)
Topic: dynamic code modification (15 items)
Topic: in-line machine code (5 items)
Topic: case statement (25 items)
Topic: pattern brackets (15 items)
Topic: notation for declarations (20 items)
Group: program control (27 topics, 547 quotes)
Topic: asynchronous processing (30 items)
Topic: event controlled processing (46 items)
Group: input/output (4 topics, 74 quotes)
Topic: execution with program stubs (5 items)
Topic: prompted input (5 items)
Topic: scrolling a window (9 items)
Topic: declaration through use (4 items)
Topic: program construction by walk-through (26 items)
Topic: procedures as data (22 items)
Topic: conditional expression (11 items)
Topic: for loop (18 items)
Topic: macro syntax definition (10 items)
Topic: compile-time execution (17 items)
Topic: running programs in a workspace or environment (14 items)
Topic: pattern specification (15 items)
Topic: list processing (15 items)
Topic: function syntax definition (17 items)
Topic: evaluate operator (7 items)
Topic: operator precedence (13 items)
Topic: output formatting (11 items)
Topic: string and list concatenation (9 items)
Topic: notation for operations (18 items)
ThesaHelp: references sa-sz (237 items)
Topic: comments (23 items)
Topic: defensive programming (22 items)
Topic: pronoun reference (23 items)
Topic: default value (8 items)
Topic: program blocks for control (20 items)
Topic: save-restore (4 items)
Topic: token (8 items)
Topic: pattern components (15 items)
Topic: simple loop (15 items)
Topic: symbolic manipulation of formulas (12 items)
Topic: function definition (25 items)
Topic: page formatting (16 items)
Topic: actor machines (2 items)
Topic: no need for variables (13 items)
Topic: trees (21 items)
Topic: command language (23 items)
Topic: debugger (37 items)
Topic: abstract data type (64 items)
Group: type declaration (5 topics, 107 quotes)
Topic: sections of a program (9 items)
Topic: business application language (11 items)
Topic: file (22 items)
Topic: programming with data (16 items)
Topic: temporary data objects (6 items)
Topic: notations for object access (7 items)
Topic: macros (22 items)
|