1.5 Implementing Lambda Calculus

Our decision to perform semantic construction with the aid of an abstract "glue" language (namely, -calculus) has pleasant consequences for grammar writing, so we would like to make the key combinatorial mechanisms (functional application and -conversion), available as black boxes to the grammar writer. From a grammar engineering perspective, this is a sensible thing to do: when writing fragments we should be free to concentrate on linguistic issues.

In this section we build the required black boxes. With such a black boxes available, we will be able to use a small DCG for semantic construction. We will decorate it with extremely natural semantic construction code and start building representations.



Aljoscha Burchardt, Alexander Koller and Stephan Walter
Version 1.2.5 (20030212)