A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Among the unsolvable terms of the lambda calculus, the mute ones are those having the highest degree of undefinedness. In this paper, we define for each natural number n, an infinite and recursive set M n of mute terms, and show that it is graph-easy: for any closed term t of the lambda calculus there exists a graph model equating all the terms of M n to t. Alongside, we provide a brief survey of the notion of undefinedness in the lambda calculus.doi:10.1016/j.tcs.2015.12.024 fatcat:4ronvkej6vfw7lpptda55gql4q