CS 6520 Homework 23
Exercise 23.1
Draw a diagram for the domain of boolean pairs:
The elements include every possible pair of elements from the
Bool
domain.
The order relation is defined as (b
1
, b
2
) < (b'
1
, b'
2
) when b
1
< b'
1
and b
2
< b'
2
.
Exercise 23.2
Show how to compute the least fixpoint of
f
.
n
.
if
n
=
0
then
n
else
n
+
f
(
n
-
1)
Exercise 23.3
Show how to compute the least fixpoint of
f
.
n
.
if
n
=
0
then
7
else
f
(
n
)
Last update: Thursday, April 12th, 2001
mflatt@cs.utah.edu