We present two case studies in formal reasoning about untyped λ-calculus in Coq, using both first-order and higher-order abstract syntax. In the first case, we prove the equivalence of three definitions of α-equivalence; in the second, we focus on properties of substitution. In both cases, we deal with contexts, which are rendered by means of higher-order terms (functions) in the metalanguage. ...

Consider the much-discussed case of the distracted driver, who is alleged to successfully navigate his car for miles despite being completely oblivious to his visual states. Perhaps he is deeply engrossed in the music playing over the radio or in philosophical reflection, and as a result he goes about unaware of the scene unfolding before him on the road. That the distracted driver has visual e...

Both syntax-phonology and syntax-semantics interfaces in Higher Order Grammar (HOG) are expressed as axiomatic theories in higher-order logic (HOL), i.e. a language is defined entirely in terms of provability in the single logical system. An important implication of this elegant architecture is that the meaning of a valid expression turns out to be represented not by a single, nor even by a few...