Types as graphs

Continuations in type logical grammar

Christian Barker, Chung Chieh Shan

    Research output: Contribution to journalArticle

    Abstract

    Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing.

    Original languageEnglish (US)
    Pages (from-to)331-370
    Number of pages40
    JournalJournal of Logic, Language and Information
    Volume15
    Issue number4
    DOIs
    StatePublished - Nov 2006

    Fingerprint

    programming language
    quantification
    Computer programming languages
    grammar
    evaluation
    language
    Programming Languages
    Quantification
    Continuation
    Type-logical Grammar
    Graph
    Polarity
    Multimodal Analysis
    Wh-questions
    Weak Crossover
    In Situ
    Superiority
    Logic
    Evaluation
    Licensing

    Keywords

    • Binding
    • Continuations
    • Delimited continuations
    • Evaluation order
    • Polarity licensing
    • Quantification
    • Resource sensitivity
    • Staging
    • Superiority
    • Type-logical grammar

    ASJC Scopus subject areas

    • Computer Science (miscellaneous)
    • Philosophy
    • Linguistics and Language

    Cite this

    Types as graphs : Continuations in type logical grammar. / Barker, Christian; Shan, Chung Chieh.

    In: Journal of Logic, Language and Information, Vol. 15, No. 4, 11.2006, p. 331-370.

    Research output: Contribution to journalArticle

    Barker, Christian ; Shan, Chung Chieh. / Types as graphs : Continuations in type logical grammar. In: Journal of Logic, Language and Information. 2006 ; Vol. 15, No. 4. pp. 331-370.
    @article{07bf7b34ecac4586a165393182b57618,
    title = "Types as graphs: Continuations in type logical grammar",
    abstract = "Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing.",
    keywords = "Binding, Continuations, Delimited continuations, Evaluation order, Polarity licensing, Quantification, Resource sensitivity, Staging, Superiority, Type-logical grammar",
    author = "Christian Barker and Shan, {Chung Chieh}",
    year = "2006",
    month = "11",
    doi = "10.1007/s10849-006-0541-6",
    language = "English (US)",
    volume = "15",
    pages = "331--370",
    journal = "Journal of Logic, Language and Information",
    issn = "0925-8531",
    publisher = "Springer Netherlands",
    number = "4",

    }

    TY - JOUR

    T1 - Types as graphs

    T2 - Continuations in type logical grammar

    AU - Barker, Christian

    AU - Shan, Chung Chieh

    PY - 2006/11

    Y1 - 2006/11

    N2 - Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing.

    AB - Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing.

    KW - Binding

    KW - Continuations

    KW - Delimited continuations

    KW - Evaluation order

    KW - Polarity licensing

    KW - Quantification

    KW - Resource sensitivity

    KW - Staging

    KW - Superiority

    KW - Type-logical grammar

    UR - http://www.scopus.com/inward/record.url?scp=33751510942&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33751510942&partnerID=8YFLogxK

    U2 - 10.1007/s10849-006-0541-6

    DO - 10.1007/s10849-006-0541-6

    M3 - Article

    VL - 15

    SP - 331

    EP - 370

    JO - Journal of Logic, Language and Information

    JF - Journal of Logic, Language and Information

    SN - 0925-8531

    IS - 4

    ER -