Switch to: Citations

Add references

You must login to add references.
  1. Ellipsis and higher-order unification.Mary Dalrymple, Stuart M. Shieber & Fernando C. N. Pereira - 1991 - Linguistics and Philosophy 14 (4):399 - 452.
    We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause source of the ellipsis, our analysis requires no such hidden ambiguity. Further, the analysis follows relatively directly from an abstract statement of the ellipsis interpretation problem. It predicts correctly a wide range of interactions between ellipsis and other semantic phenomena such as quantifier scope and bound anaphora. Finally, although the (...)
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • Higher order unification and the interpretation of focus.Stephen G. Pulman - 1997 - Linguistics and Philosophy 20 (1):73-115.
    Higher order unification is a way of combining information (or equivalently, solving equations) expressed as terms of a typed higher order logic. A suitably restricted form of the notion has been used as a simple and perspicuous basis for the resolution of the meaning of elliptical expressions and for the interpretation of some non-compositional types of comparative construction also involving ellipsis. This paper explores another area of application for this concept in the interpretation of sentences containing intonationally marked focus, or (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Third order matching is decidable.Gilles Dowek - 1994 - Annals of Pure and Applied Logic 69 (2-3):135-155.
    The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed [lgr]-calculus, i.e. to solve the equation a = b where a and b are simply typed [lgr]-terms and b is ground. The decidability of this problem is still open. We prove the decidability of the particular case in which the variables occuring in the problem are at most third order.
    Download  
     
    Export citation  
     
    Bookmark   3 citations