Abstract Control Structures And The Semantics Of Quantifiers

@inproceedings{Cushing1983AbstractCS,
  title={Abstract Control Structures And The Semantics Of Quantifiers},
  author={S. Cushing},
  booktitle={EACL},
  year={1983}
}
  • S. Cushing
  • Published in EACL 1983
  • Computer Science
  • Intuitively, a quantifier is any word or phrase that expresses a meaning that answers one of the questions "How many?" or "How much?" Typical English examples include all, no, many, few, some but not many, all but at most a very few, wherever, whoever, whoever there is, and also, it can be arguesd, only (Keenan, 1971), also (Cushing, 1978b), and the (Chomsky, 1977), In this paper we review an empirically motivated analysis of such meanings (Cushing, 1976; 1982a) and draw out its computational… CONTINUE READING
    3 Citations

    Figures from this paper.

    Some Quantifiers Require Two-Predicate Scopes
    • S. Cushing
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1987
    • 1
    A PROLOG Implementation of Government-Binding Theory
    • 15
    • PDF

    References

    SHOWING 1-10 OF 30 REFERENCES
    TOWARDS A THEORY FOR ABSTRACT DATA TYPES
    • 48
    And/Or Programs: A New Approach to Structured Programming
    • 42
    • PDF
    The relationship between design and verification
    • 18
    Formal semantics and logic
    • 137
    • PDF
    The future of programming
    • 60
    The functional life cycle model and its automation: USE.IT
    • 27
    Automation
    • 238
    Higher Order Software—A Methodology for Defining Software
    • 112