University of Amsterdam / Amsterdam University of Applied Sciences
Browse

sorry, we can't preview this file

Taniguichi.pdf (499.95 kB)

Taniguchi (2022), Unprovability of Continuation-Passing Style Transformation in Lambek Calculus

Download (499.95 kB)
Version 8 2024-06-05, 14:34
Version 7 2024-06-05, 14:25
Version 6 2023-12-18, 12:15
Version 5 2023-12-18, 12:11
Version 4 2023-12-18, 12:08
Version 3 2023-12-18, 12:07
Version 2 2022-07-25, 17:55
Version 1 2022-07-25, 13:25
conference contribution
posted on 2024-06-05, 14:34 authored by Masaya Taniguchi

Proceedings of the ESSLLI 2022 Student Session

Unprovabiliy of Continuation-Passing Style Transformation in Lambek Calculus

Masaya Taniguchi

Combinatory categorial grammar (CCG) includes combinators in addition to categorial grammar (CG), to accommodate various linguistics phenomena. For example, the type-raising rule realized by a combinator in CCG to exchange the argument--functor relation; such a rule is generalized as continuation-passing style (CPS) transformation. However, there is concern that CPS may exceedingly accept ungrammatical sentences. In this paper, we investigate the expanded grammar rules of CCG in terms of Lambek Calculus (LC), that is a formal system of CG. First, we show that Barker's CPS transformation is provable in LC but Plotkin's CPS transformation is not so. Second, we show a provable subset of Plotkin's CPS transformations . Due to the complexity of proving unprovability, we formalize the proof in Isabelle/HOL and verify it. We show that this subset is a grammatical class represented in LC, and call it type-restricted CPS transformation.

History

Retention period

2099-07-01

Usage metrics

    University of Amsterdam / Amsterdam University of Applied Sciences

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC