| E91-1009 | formalism with the technical means of | lambda-abstraction | . ( 10 ) indicates how representations |
| P93-1012 | way through some device such as | lambda-abstraction | . If P is the predicate , R the |
| P93-1012 | result from the application of the | lambda-abstraction | scheme to the two predicates |
| E91-1035 | meaning of the resuit is given by | lambda-abstraction | over the meaning of the discharged |
| C82-1049 | objects ( that handle a form of | lambda-abstraction | ) , etc. . Small & Rieger |
| E91-1009 | instantiated DRSes can be given using | lambda-abstraction | over predicative DRSes ( The |
| W94-0332 | constituency , complex parameters , | lambda-abstractions | , and different kinds of constraints |
| P87-1025 | complete definitions of constants via | lambda-abstraction | is allowed it is only as a technical |
| P97-1021 | logical language that combines | lambda-abstraction | with connectives and quantifiers |
| E97-1021 | logical language that combines | lambda-abstraction | with connectives and quantifiers |
| J92-1009 | under which compositionality , | lambda-abstraction | , generalized quantifiers , and |
| C88-1018 | syntactic constituents ; typically , | lambda-abstraction | is required to construct the |
| J91-2006 | at an index is made explicit by | lambda-abstraction | over the index and applying that |
| E91-1035 | type . The relationship between | lambda-abstraction | and function application is given |
| E91-1035 | by interpreting / I and \ I as | lambda-abstraction | , giving the term in ( 13 ) : |
