summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
4288468)
Signed-off-by: Jim Pryor <profjim@jimpryor.net>
Recall our definitions of true and false.
Recall our definitions of true and false.
-> `true` defined to be `\t \f. t`
-> `false` defined to be `\t \f. f`
+> **true** defined to be `\t \f. t`
+> **false** defined to be `\t \f. f`
In Racket, these can be defined like this:
In Racket, these can be defined like this:
Recall our definitions of ordered pairs.
Recall our definitions of ordered pairs.
-> the pair (x,y) is defined as `\f. f x y`
+> the pair **(**x**,**y**)** is defined as `\f. f x y`
To extract the first element of a pair p, you write:
To extract the first element of a pair p, you write: