Switch to: Citations

Add references

You must login to add references.
  1. Generalized Phrase Structure Grammar.G. Gazdar, E. Klein, G. Pullum & I. Sag - 1987 - Linguistics and Philosophy 10 (3):389-426.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • 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  
  • Semantic interpretation in generative grammar.Ray Jackendoff - 1972 - Cambridge, Mass.,: MIT Press.
    A study of the contribution semantics makes to the syntactic patterns of English: an intepretive theory of grammar.
    Download  
     
    Export citation  
     
    Bookmark   202 citations  
  • The interpretation of frequency adjectives.Gregory T. Stump - 1980 - Linguistics and Philosophy 4 (2):221 - 257.
    What I have attempted to show in the foregoing is that: (1) For any frequency adjective f, there is an element of meaning common to both the adverbial and the generic usage of f; this is a function f′ from propositions to truth-values such that f′(Φ)′ is true at an interval i iff Φ′ is true at subintervals of i distributed through i in a certain way. (2) In an adverbial use of f, f′ functions like the corresponding frequency adverb. (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A theory of focus interpretation.Mats Rooth - 1992 - Natural Language Semantics 1 (1):75-116.
    According to the alternative semantics for focus, the semantic reflec of intonational focus is a second semantic value, which in the case of a sentence is a set of propositions. We examine a range of semantic and pragmatic applications of the theory, and extract a unitary principle specifying how the focus semantic value interacts with semantic and pragmatic processes. A strong version of the theory has the effect of making lexical or construction-specific stipulation of a focus-related effect in association-with-focus constructions (...)
    Download  
     
    Export citation  
     
    Bookmark   281 citations  
  • Four Thousand Ships Passed through the Lock: Object-Induced Measure Functions on Events.Manfred Krifka - 1990 - Linguistics and Philosophy 13 (5):487 - 520.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Generalized Phrase Structure Grammar.Gerald Gazdar, Ewan Klein, Geoffrey Pullum & Ivan Sag - 1989 - Philosophical Review 98 (4):556-566.
    Download  
     
    Export citation  
     
    Bookmark   111 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  
  • A Logic Programming Language with Lambda-abstraction, Function Variables, and Simple Unification.Dale Miller - 1991 - LFCS, Department of Computer Science, University of Edinburgh.
    As a result of these restrictions, an implementation of L [subscript lambda] does not need to implement full higher-order unification. Instead, an extension to first-order unification that respects bound variable names and scopes is all that is required. Such unification problems are shown to be decidable and to possess most general unifiers when unifiers exist. A unification algorithm and logic programming interpreter are described and proved correct. Several examples of using L[subscript lambda] as a meta-programming language are presented.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The logical form of action sentences.Donald Davidson - 1967 - In Nicholas Rescher (ed.), The Logic of Decision and Action. University of Pittsburgh Press. pp. 81--95.
    Download  
     
    Export citation  
     
    Bookmark   499 citations  
  • Higher{Order Coloured Uni cation and Natural Language Semantics.Claire Gardent & Michael Kohlhase - unknown
    In this paper, we show that Higher{Order Coloured Uni cation { a form of uni cation developed for automated theorem proving { provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al., 1991)'s analysis called for.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Semantic Interpretation in Generative Grammar.Ray S. Jackendoff - 1975 - Foundations of Language 12 (4):561-582.
    Download  
     
    Export citation  
     
    Bookmark   209 citations