7.7.4 Tagged data

Page 200 of 800

Search internet

As mentioned, tagged data is implemented as maps. As an example, falsehood false

is implemented thus:

value define false as true LazyPair true end define

In turn, x LazyPair y is defined thus:

$value define x LazyPair y as \ z . If z then x else y end define$

Thus, the map

$\ z . If z then true else true$

represents falsehood false . All the tagged data structures (Booleans, pairs, exceptions, integers, and more) are defined as maps. For the details, see the base page.

Page 200 of 800

Search logiweb.eu