285 ;;Quote: C-- is a compiler-target language that is independent of source programming and target architecture

286 ;;Quote: exception handling by stack cutting w/o restore, table-driven stack unwinding, stack unwinding via code, and continuation-passing via code

287 ;;Quote: a C-- procedure may return a tuple of results

287 ;;Quote: a C-- procedure may tail-call another procedure; deallocates the activation record and other resources

287 ;;Quote: C-- types are words and floating-point values of various sizes; e.g., bits16, float64

287+;;Quote: C-- identifies the native data-pointer and native code-pointer types

287 ;;Quote: C-- types only for the allocation and use of machine resources; e.g., the mapping of variables to registers

287 ;;Quote: local and global C-- variables model machine registers without an address

287 ;;Quote: allocated C-- memory is referenced by immutable values of the native data-pointer type

287 ;;Quote: a C-- program is the textual description of a control-flow graph; a label names a node and a goto creates an edge to the node

287 ;;Quote: a C-- executable consists of C-- modules, a large front-end run-time library, and a small C-- run-time system for suspended computations

288 ;;Quote: model an exception handler as a C-- continuation; like a label with parameters; a non-local exit via 'cut to'

291 ;;Quote: C-- calls specify exception handling by abort, cut, unwind, or continuation within same procedure

291 ;;Quote: C-- exception handling adds explicit flow edges from the call site to a continuation or exit node

291 ;;Quote: abstract C-- defines a formal semantics that hides registers, calling convention, instruction set, spills, register shuffles, value passing registers, and the stack of activation records

295 ;;Quote: a continuation is the program counter for a branch table and a uid to detect dead continuations

298 ;;Quote: efficient implementation of Modula-3 exceptions using a stack of exception handlers