Structural ambiguity in Montague Grammar and categorial grammar

Glyn Morrill

doi:10.1515/tlr-2014-0017

Structural ambiguity in Montague Grammar and categorial grammar

The Linguistic Review ◽

10.1515/tlr-2014-0017 ◽

2015 ◽

Vol 32 (1) ◽

Author(s):

Glyn Morrill

Keyword(s):

Categorial Grammar ◽

Theorem Prover ◽

Montague Grammar ◽

Structural Ambiguity

AbstractWe give a type logical categorial grammar for the syntax and semantics of Montague's seminal fragment, which includes ambiguities of quantification and intensionality and their interactions, and we present the analyses assigned by a parser/theorem prover CatLog to the examples in the first half of Chapter 7 of the classic text

Download Full-text

From Generative Linguistics to Categorial Grammars: Overt Subjects in Control Infinitives

Bulletin of Symbolic Logic ◽

10.1017/bsl.2021.32 ◽

2021 ◽

Vol 27 (2) ◽

pp. 215-215

Author(s):

María Inés Corbalán

Keyword(s):

Categorial Grammar ◽

The Other ◽

Theorem Prover ◽

Generative Linguistics ◽

Fine Grained ◽

Combinatory Categorial Grammar ◽

Logical Grammar ◽

Syntactic Status ◽

Object Of Study ◽

Semantic Resources

AbstractThe present thesis lies at the interface of logic and linguistics; its object of study are control sentences with overt pronouns in Romance languages (European and Brazilian Portuguese, Italian and Spanish). This is a topic that has received considerably more attention on the part of linguists, especially in recent years, than from logicians. Perhaps for this reason, much remains to be understood about these linguistic structures and their underlying logical properties. This thesis seeks to fill the lacunas in the literature or at least take steps in this direction by way of addressing a number of issues that have so far been under-explored. To this end, we put forward two key questions, one linguistic and the other logical. These are, respectively, (1) What is the syntactic status of the surface pronoun? and (2) What are the available mechanisms to reuse semantic resources in a contraction-free logical grammar? Accordingly, the thesis is divided into two parts: generative linguistics and categorial grammar. Part I starts by reviewing the recent discussion within the generative literature on infinitive clauses with overt subjects, paying detailed attention to the main accounts in the field. Part II does the same on the logical grammar front, addressing in particular the issues of control and of anaphoric pronouns. Ultimately, the leading accounts from both camps will be found wanting. The closing chapter of each of Part I and Part II will thus put forward alternative candidates, that we contend are more successful than their predecessors. More specifically, in Part I, we offer a linguistic account along the lines of Landau’s T/Agr theory of control. In Part II, we present two alternative categorial accounts: one based on Combinatory Categorial Grammar, the other on Type-Logical Grammar. Each of these accounts offers an improved, more fine-grained perspective on control infinitives featuring overt pronominal subjects. Finally, we include an Appendix in which our type-logical proposal is implemented in a categorial parser/theorem-prover.Abstract prepared by María Inés Corbalán.E-mail: [email protected]: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331697

Download Full-text

Formal Verification of Helicopter Automatic Landing Control Algorithm in Theorem Prover Coq

10.23940/ijpe.18.09.p2.19471957 ◽

2018 ◽

Cited By ~ 1

Author(s):

Xi Chen

Keyword(s):

Formal Verification ◽

Control Algorithm ◽

Theorem Prover ◽

Automatic Landing ◽

Landing Control

Download Full-text

Evaluation Opportunities in Mechanized Theories

10.29007/7kx8 ◽

2018 ◽

Author(s):

Joe Hurd

Keyword(s):

Mathematical Theory ◽

Theorem Prover ◽

Mechanized Mathematics ◽

Reasoning Tasks

This invited talk will look at logic solvers through the application lens of constructing and processing a theory library of mechanized mathematics. In fact, constructing and processing theories are two distinct applications, and each will be considered in turn. Construction is carried out by formalizing a mathematical theory using an interactive theorem prover, and logic solvers can remove much of the drudgery by automating common reasoning tasks. At the theory library level, logic solvers can provide assistance with theory engineering tasks such as compressing theories, managing dependencies, and constructing new theories from reusable theory components.

Download Full-text

Did Montague invent "Montague Grammar"?

Histoire Épistémologie Langage ◽

10.3406/hel.1983.1164 ◽

1983 ◽

Vol 5 (2) ◽

pp. 117-137

Author(s):

William E. McMahon

Keyword(s):

Montague Grammar

Download Full-text

Isoglosses and language change: Evidence of the rise and loss of isoglosses from a comparison of early Greek and early English

Poznan Studies in Contemporary Linguistics ◽

10.1515/psicl-2020-0018 ◽

2020 ◽

Vol 56 (4) ◽

pp. 553-575

Author(s):

Nikolaos Lavidas

Keyword(s):

Language Change ◽

The Other ◽

Linguistic Features ◽

Considerable Distance ◽

Causative Constructions ◽

European Languages ◽

Other Hand ◽

Structural Ambiguity ◽

Early English ◽

Aspectual Verbs

Abstract We analyze the rise and loss of isoglosses in two Indo-European languages, early Greek and early English, which, however, show considerable distance between their structures in many other domains. We follow Keidan’s approach (2013), that has drawn the attention on the fact that the study of isoglosses (i.e., linguistic features common to two or more languages) is connected with common innovations of particular languages after the split into sub-groups of Indo-European: this type of approach aims at collecting isoglosses that appear across the branches of Indo-European. We examine the rise of the isogloss of labile verbs and the loss of the isogloss of the two classes of aspectual verbs in early Greek and early English. Our study shows that the rise of labile verbs in both languages is related to the innovative use of intransitives in causative constructions. On the other hand, the innovations in voice morphology follow different directions in Greek and English and are unrelated to the rise of labile verbs. In contrast to labile verbs, which are still predominant for causative-anticausative constructions in both languages, the two classes of aspectual verbs are lost in the later stages of Greek but are predominant even in Present-day English. Again, a “prerequisite” change for the isogloss can be easily located in a structural ambiguity that is relevant for aspectual verbs in early Greek and early English. However, another independent development, the changes in verbal complementation (the development of infinitival and participial complements) in Greek and English, determined the loss of this isogloss.

Download Full-text

CSim 2

ACM Transactions on Programming Languages and Systems ◽

10.1145/3436808 ◽

2021 ◽

Vol 43 (1) ◽

pp. 1-46

Author(s):

David Sanan ◽

Yongwang Zhao ◽

Shang-Wei Lin ◽

Liu Yang

Keyword(s):

Programming Languages ◽

Concurrent Systems ◽

Theorem Prover ◽

Compositional Techniques ◽

Machine Code ◽

Top Down ◽

Hol Theorem Prover ◽

High Level ◽

High Degree

To make feasible and scalable the verification of large and complex concurrent systems, it is necessary the use of compositional techniques even at the highest abstraction layers. When focusing on the lowest software abstraction layers, such as the implementation or the machine code, the high level of detail of those layers makes the direct verification of properties very difficult and expensive. It is therefore essential to use techniques allowing to simplify the verification on these layers. One technique to tackle this challenge is top-down verification where by means of simulation properties verified on top layers (representing abstract specifications of a system) are propagated down to the lowest layers (that are an implementation of the top layers). There is no need to say that simulation of concurrent systems implies a greater level of complexity, and having compositional techniques to check simulation between layers is also desirable when seeking for both feasibility and scalability of the refinement verification. In this article, we present CSim 2 a (compositional) rely-guarantee-based framework for the top-down verification of complex concurrent systems in the Isabelle/HOL theorem prover. CSim 2 uses CSimpl, a language with a high degree of expressiveness designed for the specification of concurrent programs. Thanks to its expressibility, CSimpl is able to model many of the features found in real world programming languages like exceptions, assertions, and procedures. CSim 2 provides a framework for the verification of rely-guarantee properties to compositionally reason on CSimpl specifications. Focusing on top-down verification, CSim 2 provides a simulation-based framework for the preservation of CSimpl rely-guarantee properties from specifications to implementations. By using the simulation framework, properties proven on the top layers (abstract specifications) are compositionally propagated down to the lowest layers (source or machine code) in each concurrent component of the system. Finally, we show the usability of CSim 2 by running a case study over two CSimpl specifications of an Arinc-653 communication service. In this case study, we prove a complex property on a specification, and we use CSim 2 to preserve the property on lower abstraction layers.

Download Full-text