-
Notifications
You must be signed in to change notification settings - Fork 11
PFPL Errata
Leo Zovic edited this page Nov 26, 2016
·
15 revisions
If typographic (or other) errors are found in the PFPL, post them here.
- the X_s in "family of disjoint finite sets X_s" (p.5) is not italicized.
- the first sentences in the 1st and 3rd paragraphs of 1.1 (p.4) are basically the same, and similarly for the first sentences of the 1st and 4th paragraphs of 1.2.
- Delete the apostrophe in "it's fresh counterpart", p.8.
- In the proof of Lemma 2.1, p. 17, P(a nat) should be P(a) (the formalism has changed since the 1st edition).
- Inconsistent notation for the judgement of equality of natural numbers between the first table in chapter 2.1, the definition of
is
in chapter 2, and rule 5.4(a). Also, something else seems wrong sinceis
expresses structural equality on naturals and the presence of+
rules out the possibility of equality. Isn1 + n2 is n nat
a different (3-place) judgement that hasn't been defined before? - First paragraph of 5.3: add a comma after "The judgement e val".
- Second paragraph of 5.4: script X should be x-> (otherwise no fresh vars available?)
- p. 68: 'eevaluation' ...
- First line of 9.5: delete extra "Gödel".
- Add a '.' to the end of theorem 9.3.
- Definition of
e'
in terms ofiter
(first equation in 10.3): concrete and abstract syntax are mixed.
- Section 11.2: 'When I = {l_1, l_2, ..., l_n}' should be 'When I = {i_1, ..., i_n}'. 'the class l_i' should be 'the class i_j'.
- Section 11.3.3, last paragraph: "... all possible Unicode (...) of characters ... " -> "... all possible Unicode (...) characters ..."
- Exercise 12.3: 'constructive propositional forms a Heyting algebra' is missing the word 'logic'.
- Exercise 13.1 assumes the reader has already completed exercise 30.2! Also, 'inhabited your solution' should be 'inhabited in your solution'.
- Page 291 fourth line: unbound sigma should be unbound mu
- Page 289: "variables is intolerable" => "variables are intolerable"
- Appendix A:
psi(v)
should bepsi(u)
in the function definition
- Page 413 (section 43.5) line 4:
c2 : k
(pronounced "c2 has type kappa") should bec2 :: k
(pronounced "c2 has kind kappa")