第12章 章节12.1 练习12.1.1 题目: Where do we fail if we attempt to prove normalization by a straightforward induction on the size of a well-typed term? 解答: 在处理使用求值规则E-APPABS的情况会出问题,
第11章 章节11.2 练习11.2.1 题目: Is there a way of constructing a sequence of terms t1,t2,…, in the simply typed lambda-calculus with only the base type Unit, such that, for each n, the term tn as size at most O(n) but requires at least
第9章 章节9.2 练习9.2.1 题目: The pure simply typed lambda-calculus with no base types is actually degenerate, in the sense that it has no well-typed terms at all. Why? 解答: 去掉基础类型后,类型T的语法只剩下: \[ \text{T} ::=