Quote: in modern type theory, types are values in a suitable semantic domain; type constructors are maps from this domain into itself

Quotation Skeleton

Lambdaman: There is a simple linear-time algorithm for … Wright: Name equivalence is a flagrant violation of … Lambdaman: Referential transparency is widely recognized as a … constructors are maps from this domain into itself. … Jo: I think the referential transparency point should … appear in the same program. But if types … ask about the identity of types from different … [p. 222] Jo: Essentially the same problem arises with … [p. 223] Jo: … One Modula-2+ programmer [using name equivalence] added a type declaration … pickle reading code in a distant module. …   Google-1   Google-2

Copyright clearance needed for quotation.

Additional Titles

Quote: with name equivalence, a type only has meaning in a particular program; causes problems for distributed systems and persistent data; simple changes can undo pickled representations

Quote: with structural equivalence, types are referentially transparent

Related Topics

Group: data type   (34 topics, 723 quotes)
Topic: restricted and extended types (34 items)
Topic: structural equivalence vs. name equivalence of data types (30 items)
Topic: type algebras, typed lambda calculus, and type-complete languages (28 items)
Topic: object serialization (13 items)
Topic: sending an object across a network (11 items)