Map
Index
Random
Help
th

QuoteRef: wileDS11_1973

topics > all references > ThesaHelp: references t-z



Topic:
boolean values, binary numbers, and bit strings
Topic:
curried functions
Topic:
index sequence for array access
Topic:
higher-order functions and combinators
Topic:
data type by lexical constraints
Topic:
primitive data types of a language
Group:
sequence operations
Topic:
data type by name or tags
Topic:
termination of control unit
ThesaHelp:
references t-z
Topic:
no need for replacement
Topic:
conditional expression
Topic:
programming with data
Topic:
operator precedence
Topic:
if-then-else test chain
Topic:
sequence reduction
Topic:
simple loop
Topic:
accessing a sequence
Topic:
notation for constants
Topic:
Thesa data structures
Topic:
recursive data structures
Topic:
infinite sequences
Topic:
words defined by words
Topic:
generic operations and polymorphism
Topic:
co-sequence operations
Topic:
sequence generators
Topic:
co-routines
Topic:
undefined, null, and other signal values
Topic:
exception handling by unique value
Topic:
numerical error
Topic:
abstraction in programming
Topic:
programming with a database of modules
Topic:
identifying program modules
Topic:
localized understanding
Topic:
reusable programming
Group:
sequences

Reference

Wile, D.S., "A generative, nested sequential basis for general purpose programming language", Carnegie-Mellon, November 1973. Google

Other Reference

NTIS AD773 839

Quotations
13 ;;Quote: can data structures be like programs with a hierarchical, nested sequential, static structure
16 ;;Quote: the boundedness of a sequence generator could be a property of its use; i.e., the sequence could be infinite
QuoteRef: wileDS11_1973 ;;27 x id:: x x rid v:: v identity and nullify operators
QuoteRef: wileDS11_1973 ;;27 uses key word "none" to resolve ambiguity in two consecutive unary operator definitions, and indicate pre fix operator
28 ;;Quote: reusing a name in its definition refers to its previous definition
28 ;;Quote: generic selection only if operation is defined for those operands; otherwise forces generic selection on all callers
QuoteRef: wileDS11_1973 ;;29 basic types (indicated by letter) signed integer, character, sequence, empty (nil) and string (sequence of characters)
QuoteRef: wileDS11_1973 ;;29 has unique negative integer indicator '~'
30 ;;Quote: partially instantiate an operator by specifying some of its operands
QuoteRef: wileDS11_1973 ;;30 'a relation b' returns nil if false otherwise a
QuoteRef: wileDS11_1973 ;;32 program and data are the same, both sequences
QuoteRef: wileDS11_1973 ;;32 operator to get last one <1.2.3>val = 3
QuoteRef: wileDS11_1973 ;;33 gen operator removes a sub-sequence e.g., <1> conc<2;<3;4>;5> = < <1>gen <2;<3;4>;5>gen? = <1;2;<3;4>;5> and == s
QuoteRef: wileDS11_1973 ;;34 then and else like LISP i.e., x else y == y when x is empty else x
QuoteRef: wileDS11_1973 ;;34 x then y == y when x is non-empty else nil (this can be derived
QuoteRef: wileDS11_1973 ;;35 x excludes y == y when x is empty else nil
QuoteRef: wileDS11_1973 ;;35 or::else, and::then, not x:: x excludes true [renaming e.g., x else Y = if x nil then y else x]
QuoteRef: wileDS11_1973 ;;35 repetition by Kleene star * i.e., x*== terminated implicitly or by escape operator
QuoteRef: wileDS11_1973 ;;35 x alternate y:: gen*; == <gen; gen; ...>==
QuoteRef: wileDS11_1973 ;;36 eg u rat v:: u conc (v gen*) == ==<u/gen; gen> == eg "3.7" rat "23" is "3.7232323..." sequence could terminate on precision requirements of
QuoteRef: wileDS11_1973 ;;36 else exit sequence (exs) terminates sequence when argument is empty otherwise its value is its argument (do while)
QuoteRef: wileDS11_1973 ;;37 then exit sequence (txs) terminates sequence and includes argument in result when arg is non-empty. otherwise returns nil (do until).
38 ;;Quote: the coapply operator relates a sequence of arguments with a sequence of functions
QuoteRef: wileDS11_1973 ;;39 s controls q:: s. (rid *).q == .q == == i.e., limits length of sequence q
40 ;;Quote: use element-at-a-time processing for coapply operations since termination may be unknown
QuoteRef: wileDS11_1973 ;;40 accumulate operator / y/s== like APL reduction or evaluate program on one register machine
QuoteRef: wileDS11_1973 ;;41 positive integers are 0/(+1*); ==<1;2;3;4;5...>
42 ;;Quote: a sequence expression is also a generator that produces elements when 'pulsed'; car and cdr are forms of pulsing a list
QuoteRef: wileDS11_1973 ;;42 s while f:: s.(f exs *)
47 ;;Quote: co-sequencing allows for infinite computational objects since only processing one element at a time
48 ;;Quote: in arithmetic can use +-infinity as NIL; so uninitialized variables produce NIL results
QuoteRef: wileDS11_1973 ;;48 i max j:: i ge j else j in Algol would be if i ge j then i else j
QuoteRef: wileDS11_1973 ;;49 relations return their monadic argument when true e.g., 1<2 == 1 (<2) = 1 and (i le)b le j is a range check
50 ;;Quote: it is better to split up functions into smaller pieces which may be useful for other purposes; abstraction
90 ;;Quote: co-routines are independently described structures, each of which exist in some state
QuoteRef: wileDS11_1973 ;;114 note no assignment operator
114 ;;Quote: emphasize the sequences of accesses to data structures along with the programs that perform the access
115 ;;Quote: it is good to specify sequences independently of how they are used


Related Topics up

Topic: boolean values, binary numbers, and bit strings (44 items)
Topic: curried functions (14 items)
Topic: index sequence for array access (16 items)
Topic: higher-order functions and combinators (19 items)
Topic: data type by lexical constraints (15 items)
Topic: primitive data types of a language (31 items)
Group: sequence operations   (7 topics, 85 quotes)
Topic: data type by name or tags (29 items)
Topic: termination of control unit (22 items)
ThesaHelp: references t-z (309 items)
Topic: no need for replacement (4 items)
Topic: conditional expression (11 items)
Topic: programming with data (16 items)
Topic: operator precedence (13 items)
Topic: if-then-else test chain (18 items)
Topic: sequence reduction (10 items)
Topic: simple loop (15 items)
Topic: accessing a sequence (9 items)
Topic: notation for constants (14 items)
Topic: Thesa data structures (59 items)
Topic: recursive data structures (18 items)
Topic: infinite sequences (7 items)
Topic: words defined by words (24 items)
Topic: generic operations and polymorphism (65 items)
Topic: co-sequence operations (8 items)
Topic: sequence generators (16 items)
Topic: co-routines (13 items)
Topic: undefined, null, and other signal values (33 items)
Topic: exception handling by unique value (8 items)
Topic: numerical error (19 items)
Topic: abstraction in programming (67 items)
Topic: programming with a database of modules (94 items)
Topic: identifying program modules (26 items)
Topic: localized understanding (43 items)
Topic: reusable programming (77 items)
Group: sequences   (7 topics, 96 quotes)

Collected barberCB 1980
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.