364 research outputs found
Geometry of language
Girard (1987) introduced proof nets as a syntax of linear proofs which
eliminates inessential rule ordering manifested by sequent calculus.
Proof nets adapted to the Lambek calculus (Roorda 1991) fulfill a role
in categorial grammar analogous to that of phrase structure trees in
CFG so that categorial proof nets have a central part to play in
computational syntax and semantics; in particular they allow a
reinterpretation of the "problem" of spurious ambiguity as an
opportunity for parallelism. This article aims to make three
contributions: i) provide a tutorial overview of categorial proof
nets, ii) apply and provide motivation for proof nets by showing how
a partial execution eschews the need for semantic evaluation in
language processing, and iii) analyse the intrinsic geometry of
partially commutative proof nets for the kinds of discontinuity
attested in language, offering proof nets for the in situ binder
type-constructor Q(., ., .) of Moortgat (1991/6).Postprint (published version
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems
A Formal Verification Environment for Use in the Certification of Safety-Related C Programs
In this thesis the design of an environment for the formal verification of functional properties of safety-related software written in the programming language C is described. The focus lies on the verification of (primarily) geometric computations. We give an overview of the applicable regulations for safety-related software systems. We define a combination of higher-order logic as formalised in the theorem prover Isabelle and a specification language syntactically based on C expressions. The language retains the mathematical character of higher-level specifications in code specifications. A memory model for C is formalised which is appropriate to model low-level memory operations while keeping the entailed verification overhead in tolerable bounds. Finally, a Hoare style proof calculus is devised so that correctness proofs can be performed in one integrated framework. The applicability of the approach is demonstrated by describing its use in an industrial project
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems
Graph Theory and Universal Grammar
Tese arquivada ao abrigo da Portaria nÂș 227/2017 de 25 de Julho-Registo de Grau EstrangeiroIn the last few years, Noam Chomsky (1994; 1995; 2000; 2001) has gone quite far in
the direction of simplifying syntax, including eliminating X-bar theory and the levels
of D-structure and S-structure entirely, as well as reducing movement rules to a
combination of the more primitive operations of Copy and Merge. What remain in
the Minimalist Program are the operations Merge and Agree and the levels of LF
(Logical Form) and PF (Phonological form).
My doctoral thesis attempts to offer an economical theory of syntactic structure
from a graph-theoretic point of view (cf. Diestel, 2005), with special emphases on the
elimination of category and projection labels and the Inclusiveness Condition
(Chomsky 1994). The major influences for the development of such a theory have
been Chris Collinsâ (2002) seminal paper âEliminating labelsâ, John Bowers (2001)
unpublished manuscript âSyntactic Relationsâ and the Cartographic Paradigm (see
Belletti, Cinque and Rizziâs volumes on OUP for a starting point regarding this
paradigm).
A syntactic structure will be regarded here as a graph consisting of the set of
lexical items, the set of relations among them and nothing more
Recommended from our members
Formalizing graphical notations
The thesis describes research into graphical notations for software engineering, with a principal interest in ways of formalizing them. The research seeks to provide a theoretical basis that will help in designing both notations and the software tools that process them.
The work starts from a survey of literature on notation, followed by a review of techniques for formal description and for computational handling of notations. The survey concentrates on collecting views of the benefits and the problems attending notation use in software development; the review covers picture description languages, grammars and tools such as generic editors and visual programming environments. The main problem of notation is found to be a lack of any coherent, rigorous description methods. The current approaches to this problem are analysed as lacking in consensus on syntax specification and also lacking a clear focus on a defined concept of notated expression.
To address these deficiencies, the thesis embarks upon an exploration of serniotic, linguistic and logical theory; this culminates in a proposed formalization of serniosis in notations, using categorial model theory as a mathematical foundation. An argument about the structure of sign systems leads to an analysis of notation into a layered system of tractable theories, spanning the gap between expressive pictorial medium and subject domain. This notion of 'tectonic' theory aims to treat both diagrams and formulae together.
The research gives details of how syntactic structure can be sketched in a mathematical sense, with examples applying to software development diagrams, offering a new solution to the problem of notation specification. Based on these methods, the thesis discusses directions for resolving the harder problems of supporting notation design, processing and computer-aided generic editing. A number of future research areas are thereby opened up. For practical trial of the ideas, the work proceeds to the development and partial implementation of a system to aid the design of notations and editors. Finally the thesis is evaluated as a contribution to theory in an area which has not attracted a standard approach
- âŠ