PPT Slide

Transaction Mapping

Transactions are typed.

Transaction mapping is the familiar compiler problem of

type coercion.

Transaction type definitions and type coercions transformations

are stored.

Type coercions may be in-lined compiled, linked at load time,

linked at initialization time, invoked at runtime or

compiled at runtime by a dynamic compiler.

Example: A transaction of type vector-matrix multiply is mapped

to a sequence of instructions.