Map
Index
Random
Help
th

QuoteRef: scotD8_1971

topics > all references > ThesaHelp: references sa-sz



ThesaHelp:
references sa-sz
Topic:
semantics by an abstract machine
Topic:
lattice theory of types

Reference

Scott, D., Strachey, C., "Toward a mathematical semantics for computer languages", Oxford University Computing Laboratory, Programming Research Group, PRG-6, August 1971. Google

Other Reference

Stanford Computer Library #44006

Quotations
7 ;;Quote: interpretation of programming languages depends on the dynamic state of the system; more complex mathematically
20 ;;Quote: in lattice theory, the set of partial functions are ordered by approximateness
22 ;;Quote: solving partial functions for recursion is finding a fixed point; complete lattices guarantee this fixed point

Related Topics up

ThesaHelp: references sa-sz (237 items)
Topic: semantics by an abstract machine (38 items)
Topic: lattice theory of types (15 items)

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