7.4.2 Definition of lambda expressions

In the context of conceptual graph-theory, a lamda expression is a conceptual graph where zero or more of the referents in the concepts in the graph have been replaced with the Greek letter , pronounced "lambda".

If more than one referent has been replaced by a , the lambdas can be numbered such that no name-clash occurs, e.g., 1, 2, 3, etc.

In practice, we will often use other symbols, such as '?x', '?y', '?z', '?a', etc, since they are easier to write on a computer keyboard.


Prev: 7.4.1 Introduction
Up: 7.4 Lambda expressions (optional)
Next: 7.4.3 Example