Map
Index
Random
Help
th

QuoteRef: wulfWA12_1971

topics > all references > ThesaHelp: references t-z



Topic:
function call
Topic:
extensible languages
Topic:
expression language
Topic:
primitive data type as memory
Topic:
pointers to data
Topic:
in-line machine code
Topic:
termination of control unit
Topic:
language extension via macros
ThesaHelp:
ACM references m-z
ThesaHelp:
references t-z
Topic:
for loop
Topic:
binding names to variables or expressions
Topic:
compiler
Topic:
multi-tasking
Topic:
function definition
Topic:
data type as constructors, selectors, and predicates
Topic:
variable as function that accesses an object's value
Topic:
primitive data types for Thesa

Reference

Wulf, W.A., Russel, D.B., Habermann, A.N., "Bliss: a language for systems programming", Communications of the ACM, 14, 12, pp. 780-790, Decmeber 1971. Google

Quotations
QuoteRef: wulfWA12_1971 ;;782 Bliss requires no run-time support
QuoteRef: wulfWA12_1971 ;;782 all operations are not effected by type of operands is just as bits
QuoteRef: wulfWA12_1971 ;;782 has register declarations
QuoteRef: wulfWA12_1971 ;;782 id's as literal addresses. .X is contents of x. ..X makes sense but not adr (adr (x))
QuoteRef: wulfWA12_1971 ;;783 Literals by BIND y2= y+2
QuoteRef: wulfWA12_1971 ;;783 expression language (no valueless statements)
QuoteRef: wulfWA12_1971 ;;784 in do loops all expressions only evaluated at entrance (control expressions
QuoteRef: wulfWA12_1971 ;;785 function names are expressions eg (CASE .x of set p1, p2, p3 tes) (.z)
QuoteRef: wulfWA12_1971 ;;785 no parameter by z()
QuoteRef: wulfWA12_1971 ;;785 Tasks and co-routines created by CREATE function(args) AT stack-loc Length stack-size THEN termination-statement value is task name executed by exchj (routine-name, value of other routines exchj)
QuoteRef: wulfWA12_1971 ;;786 can exit any unit and return the value of that unit e.g., exitblock exp. or exitloop exp or return exp. of functions
QuoteRef: wulfWA12_1971 ;;786 in Bliss, can change a structure when its use changes
787 ;;Quote: example of defining a structure by specifying the accessing algorithms; uses paraphrase extension


Related Topics up

Topic: function call (28 items)
Topic: extensible languages (69 items)
Topic: expression language (13 items)
Topic: primitive data type as memory (29 items)
Topic: pointers to data (55 items)
Topic: in-line machine code (5 items)
Topic: termination of control unit (22 items)
Topic: language extension via macros (23 items)
ThesaHelp: ACM references m-z (280 items)
ThesaHelp: references t-z (309 items)
Topic: for loop (18 items)
Topic: binding names to variables or expressions (10 items)
Topic: compiler (18 items)
Topic: multi-tasking (22 items)
Topic: function definition (25 items)
Topic: data type as constructors, selectors, and predicates (20 items)
Topic: variable as function that accesses an object's value (21 items)
Topic: primitive data types for Thesa (82 items)

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