Map
Index
Random
Help
Topics
th

QuoteRef: cbb_1990

topics > all references > ThesaHelp: references c-d



ThesaHelp:
references c-d
Topic:
global declarations and variables
Topic:
managing people
Topic:
deletion of information
Topic:
threaded code
Topic:
programmable controller
Topic:
programming with forms
Topic:
data as a named set of data objects
Topic:
value as an object
Topic:
declarative vs. procedural representation
Topic:
spatial vs. temporal representation
Topic:
code optimization
Topic:
in-line code
Topic:
numerical error
Topic:
metaphysics and epistemology
Group:
systems
Topic:
natural language as a system
Topic:
number as a named set of numbers
Topic:
computational geometry
Topic:
number as a progression for counting and 1-1 relations
Topic:
alias names
Topic:
number representation
Topic:
what is a number
Topic:
computer as state machine
Group:
data
Topic:
rules
Group:
Thesa programming system
Topic:
vivid representation of programs
Topic:
number and arithmetic as part of language
Group:
goals for a programming system
Topic:
usability errors
Topic:
persistent data structure
Topic:
pidgin and creole languages
Topic:
programming with natural language
Topic:
efficiency
Topic:
symbolic representation
Topic:
limitations of formalism
Group:
naming
Topic:
primitive data type as memory
Topic:
information hiding
Topic:
information as knowledge
Topic:
object-oriented fields
Topic:
local vs. global
Topic:
synchronized processing
Group:
science
Group:
data type
Topic:
temporary data objects
Group:
conditional control
Topic:
state
Topic:
security by access rights
Topic:
physics as computation
Topic:
state machine
Topic:
keystroke shortcuts as a UserInterface
Topic:
version control
Group:
software maintenance
Topic:
machine code and assembly language
Topic:
programming language design
Topic:
tools
Topic:
software portability
Topic:
range data type
Topic:
interface between program modules
Group:
object-oriented programming
Topic:
case statement
Group:
information
Topic:
open systems
Topic:
data record
Topic:
probabilistic and randomized algorithms
Topic:
primitive data types of a language
Topic:
data type as a set of values
Topic:
object-oriented classes
Topic:
abstraction in programming
Topic:
Turing machine
Topic:
pointer machines
Group:
function
Topic:
consistency testing
Topic:
parameters as argument place holders
Group:
program representation
Topic:
frozen representation
Topic:
load-time code generation
Topic:
undefined, null, and other signal values
Topic:
Thesa data structures
Topic:
safe use of pointers
Topic:
parameter passing by value-result
Topic:
interface type
Topic:
notations for brackets
Topic:
decision table
Topic:
object and value equivalence
Topic:
abstraction in programming language
Topic:
function call
Topic:
intermediate representation of code
Topic:
object code linkers and loaders
Topic:
Thesa as a database of modules
Topic:
value as an abstraction
Topic:
using pointers in Thesa
Topic:
parameter passing by value
Topic:
parameter passing by reference
Topic:
names as rigid designators
Topic:
is a name a literal string or a symbol

Reference

Barber, C.B., "from notebooks, 1990-1999", 1990-1998. Google

personal notes

Notes

QuoteRef: cbb_1980 QuoteRef: cbb_2000

Quotations
1/4/90 ;;Quote: a data object is a named set of data objects; empty sets are references or value; non-empty are attributes
1/8/90 ;;Quote: want to distinguish functions from objects because their shapes are so different; long and stringy vs. compact and regular
2/14/90 ;;Quote: evaluate code by number of copies and memory-based arguments
5/18/90 ;;Quote: can generate code in-line for frequent use or as function calls for low-use
6/6/90 ;;Quote: perturbed inputs tracked round-off error degradation fairly closely
6/11/90 ;;Quote: system is an emergent property of language; opposite to normal view
9/24/90 ;;Quote: represent a convex hull by slabs of coplanar vertices for each face
10/12/90 ;;Quote: if numbers are abstractions for counting then numbers in different bases are different numbers
10/28/90 ;;Quote: all names of an object are equally good; should display all and allow renames of any
11/28/90 ;;Quote: a number is an ordered sequence of objects selected from 10 set-theoretic ones
11/28/90 ;;Quote: decimal notation is vivid because it mirrors the structure it is meant to denote
11/28/90 ;;Quote: can count in letter numerals, e.g., fhiza, but they are not numbers
11/28/90 ;;Quote: if we know a number in any base, multiplication and exponentiation is trivial
11/30/90 ;;Quote: a number is a unique name in a naming universe; a large enough set of names
11/30/90 ;;Quote: the vivid representation of huge numbers is a puzzle for the definition of number just as unary/set theoretic numbers are a puzzle
11/30/90+;;Quote: a data object is a number since it is part of the initial state of a computation
11/30/90 ;;Quote: a digit is a named empty set
11/30/90 ;;Quote: a number is a named set of numbers; a naming function from names to naming functions
12/1/90 ;;Quote: a name in a naming universe is a number whose set is empty
12/1/90 ;;Quote: can consistently identify number systems because rules define the names and structure of a number
12/1/90 ;;Quote: a number system is a set of numbers whose names/sets are generated by rules
7/14/91 ;;Quote: a natural language for very large numbers
11/1/91 ;;Quote: do not lose information
8/10/92 ;;Quote: naming provides a pidgin language for design and a file system for data storage
8/10/92+;;Quote: keyword search is not precise and programming languages do not communicate
8/10/92+;;Quote: natural languages fail because computers do not think and languages are poor at describing large numbers
9/14/92 ;;Note: build a system by keyword, hierarchy, naming, or natural language; e.g., Roman vs. decimal numerals
2/13/93 ;;Note: Thesa's programming language is its numeric opcodes; a machine language for high-level languages
9/12/93 ;;Note: want tight inner loops and space-efficient, low frequency code; for overall space and time efficiency
10/14/93 ;;Note: every value has a unique name; it is in certain places at certain times
10/17/93 ;;Note: a name can be a literal to use, a location to find, a value to track, or a function to execute
11/11/93 ;;Note: formalism tries to make programs tightly structured, but it just isn't so; programs are loosely structured because applications are loosely structured
6/9/94 ;;Note: there are two kinds of rules: formal rules and regularities; Turing machines and words in a natural language
6/9/94+;;Note: a vivid huge number is a rule based on a fixed set of primitives and a regularity based on naming
6/11/94 ;;Note: numbers are transition tables of Turing machines and vice versa; numbers and programs are the same
8/7/94 ;;Note: a number is what we exactly agree about; what we exactly agree about can be represented by named sets; i.e., Church's thesis
2/16/95 ;;Note: a number is a bit string while memory is at a location and has a size
8/2/95 ;;Note: information is language and hence public; not private as in object-oriented programming
8/5/95 ;;Note: classes provide a way to program with global state that is localized to its use
9/13/95 ;;Note: want a rich language for expressing program+data, i.e., bits; both programs and data are easy, it is the rich language that is hard
10/15/95 ;;Note: use inc/dec for cheap synchronization under the normal case; may be cheap enough to use everywhere
12/5/95 ;;Note: science contains many facts and a few basic concepts; the later is hard to teach
3/4/96 ;;Note: type represents what doesn't change; e.g., a boolean is 1 bit; allows temporaries of some type
4/1/96 ;;Note: a programming language should minimize conditional code; e.g., Turing machines are all conditional
4/1/96 ;;Note: a state is a location in a program, i.e., a transition; avoids a circular definition from storing the state
5/17/96 ;;Note: data type provides parameterization, property sheets, attribute-values that specialize things
7/31/96 ;;Note: the key to memory is that it has a unique address
8/10/96 ;;Note: access control and visibility tend to be either too limited or too liberal; hard to make them work
8/27/97 ;;Note: perhaps physics is math, math is computation, and computation is naming
9/27/96 ;;Note: a state variable is a radio button
10/1/96 ;;Note: nothing should happen at an upgrade; everything should work as before despite many changes
10/5/96 ;;Note: Thesa is a high-level representation of assembly language code
1/17/97 ;;Note: a tool is evaluated by its use: its fit to the task and the user
1/17/97+;;Note: the goals of a programming system are size, speed, cycle time, and understandability
1/17/97+;;Note: vivid huge numbers combine the advantages of natural language with those of assembly code
1/27/97 ;;Note: opcodes define a language; a portability layer
5/24/97 ;;Note: changing the bit-width of a data type changes "infinity" or adds overflow checking
1997-06-14 ;;Note: initial conversion of Thesa's editor to Windows
1997-06-25 ;;Note: a modern programming language is really a large language and a large API; Thesa separates the language from everything else
1997-11-15 ;;Note: object-oriented programming converts case statements into procedure calls, organized by data
1998-03-18 ;;Note: information is numbers, what everyone can agree on; the problem is a vivid language for numbers
1998-04-12 ;;Note: goal is a radical improvement in code generation using a publicly developed database
1998-04-13 ;;Note: a type is a record, including its field names
1998-04-13 ;;Note: how to capture the internal structure of a program, irregardless of space
1998-06-06 ;;Note: joggled input allows a simple implementation of geometric algorithms
1999-03-18 ;;Note: the field concept is fundamental; name (the field), memory (its memory base), definition (the offset), and type (size of field); so long at an offset
1999-03-19 ;;Note: a field has no existence independent of an object or record; type is independent
1999-04-08 ;;Note: type is either primitive, without substructure, or a memory pointer, size, offset; memory is any resource
1999-04-11 ;;Note: is type part of value?
1999-04-11 ;;Note: a value is a type ID (a name) and 0 or more fields; field names belong to the type
1999-04-14 ;;Note: a type Turing machine selects transition table by type; allows decomposition
1999-04-16 ;;Note: need 6 instructions to implement a Turing machine's Next and Previous transitions
1999-04-17 ;;Note: the primitive concept is the natural numbers, everything else is convention
1999-04-17 ;;Note: an object is a sequence of pointers to objects; an object can have a name and use names to refer to objects; an object can point to its type
1999-04-17 ;;Note: a procedure is a parameterized sequence of rules; assignment and test statements
1999-04-17 ;;Note: type may be temporarily inconsistent; at 'return', can guarantee anything about a type
1999-04-17 ;;Note: only need get, set, and test pointer
1999-04-21 ;;Note: parameters are objects with type and nothing else
1999-04-21 ;;Note: type acts like a limited state of a Turing machine; defines offsets; same type if same label
1999-04-26 ;;Note: pointer machines will work; end up with a convoluted memory structure equivalent to the textual representation; found my primitives
1999-04-30 ;;Note: a program is a frozen set of modules as identified by a call
1999-04-30 ;;Note: compiling a type determines offsets and referenced modules; cached in memory by date
1999-05-01 ;;Note: named pointers provide a strongly typed model for computing
1999-05-07 ;;Note: should access to a None object always create one?
1999-05-07 ;;Note: call by copying parameters at initiation and termination; copy as needed
1999-05-07 ;;Note: any type defines an interface; those functions that use it as a parameter
1999-05-07 ;;Note: allow [], {}, and () for grouping
1999-05-07 ;;Note: use a table for tabular definitions (e.g., case or switch)
1999-05-28 ;;Note: type lets you substitute like for like
1999-06-18 ;;Note: a call is a stylized use of rules, like a list is a stylized use of objects; allows many kinds of calls
1999-07-10 ;;Note: use compiled code as disk format; IDs expanded to text as needed
1999-12-03 ;;Note: a parameter is an object field, a reference to a pointer; value semantics is an optimization
1999-12-15 ;;Note: literals need an ID just like objects

Related Topics up

ThesaHelp: references c-d (337 items)
Topic: global declarations and variables (33 items)
Topic: managing people (64 items)
Topic: deletion of information (11 items)
Topic: threaded code (18 items)
Topic: programmable controller (9 items)
Topic: programming with forms (26 items)
Topic: data as a named set of data objects (22 items)
Topic: value as an object (29 items)
Topic: declarative vs. procedural representation (54 items)
Topic: spatial vs. temporal representation (21 items)
Topic: code optimization (54 items)
Topic: in-line code (7 items)
Topic: numerical error (19 items)
Topic: metaphysics and epistemology (99 items)
Group: systems   (17 topics, 530 quotes)
Topic: natural language as a system (43 items)
Topic: number as a named set of numbers (15 items)
Topic: computational geometry (20 items)
Topic: number as a progression for counting and 1-1 relations (22 items)
Topic: alias names (39 items)
Topic: number representation (16 items)
Topic: what is a number (55 items)
Topic: computer as state machine (20 items)
Group: data   (140 topics, 3126 quotes)
Topic: rules (43 items)
Group: Thesa programming system   (11 topics, 561 quotes)
Topic: vivid representation of programs (22 items)
Topic: number and arithmetic as part of language (30 items)
Group: goals for a programming system   (21 topics, 983 quotes)
Topic: usability errors (6 items)
Topic: persistent data structure (37 items)
Topic: pidgin and creole languages (31 items)
Topic: programming with natural language (27 items)
Topic: efficiency (96 items)
Topic: symbolic representation (26 items)
Topic: limitations of formalism (93 items)
Group: naming   (32 topics, 789 quotes)
Topic: primitive data type as memory (29 items)
Topic: information hiding (50 items)
Topic: information as knowledge (17 items)
Topic: object-oriented fields (28 items)
Topic: local vs. global (29 items)
Topic: synchronized processing (35 items)
Group: science   (45 topics, 1960 quotes)
Group: data type   (34 topics, 730 quotes)
Topic: temporary data objects (6 items)
Group: conditional control   (7 topics, 142 quotes)
Topic: state (35 items)
Topic: security by access rights (38 items)
Topic: physics as computation (31 items)
Topic: state machine (67 items)
Topic: keystroke shortcuts as a UserInterface (22 items)
Topic: version control (34 items)
Group: software maintenance   (14 topics, 368 quotes)
Topic: machine code and assembly language (49 items)
Topic: programming language design (53 items)
Topic: tools (20 items)
Topic: software portability (43 items)
Topic: range data type (17 items)
Topic: interface between program modules (55 items)
Group: object-oriented programming   (26 topics, 822 quotes)
Topic: case statement (25 items)
Group: information   (46 topics, 1160 quotes)
Topic: open systems (33 items)
Topic: data record (57 items)
Topic: probabilistic and randomized algorithms (11 items)
Topic: primitive data types of a language (31 items)
Topic: data type as a set of values (20 items)
Topic: object-oriented classes (67 items)
Topic: abstraction in programming (67 items)
Topic: Turing machine (30 items)
Topic: pointer machines (17 items)
Group: function   (12 topics, 232 quotes)
Topic: consistency testing (60 items)
Topic: parameters as argument place holders (15 items)
Group: program representation   (25 topics, 659 quotes)
Topic: frozen representation (6 items)
Topic: load-time code generation (13 items)
Topic: undefined, null, and other signal values (34 items)
Topic: Thesa data structures (59 items)
Topic: safe use of pointers (102 items)
Topic: parameter passing by value-result (10 items)
Topic: interface type (50 items)
Topic: notations for brackets (9 items)
Topic: decision table (29 items)
Topic: object and value equivalence (60 items)
Topic: abstraction in programming language (47 items)
Topic: function call (28 items)
Topic: intermediate representation of code (31 items)
Topic: object code linkers and loaders (31 items)
Topic: Thesa as a database of modules (23 items)
Topic: value as an abstraction (25 items)
Topic: using pointers in Thesa (49 items)
Topic: parameter passing by value (5 items)
Topic: parameter passing by reference (11 items)
Topic: names as rigid designators (43 items)
Topic: is a name a literal string or a symbol (23 items)

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