English
Related papers

Related papers: Incoherent coherences

200 papers

Safety constraints are crucial to the development of mission-critical systems. The practice of developing software for systems of this type requires reliable methods for identifying and analysing project artefacts. This paper proposes a…

Logic in Computer Science · Computer Science 2020-05-15 Grygoriy Zholtkevych , Maksym Labzhaniia

In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…

Category Theory · Mathematics 2011-01-10 D. Borisov , Yu. I. Manin

Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…

Logic in Computer Science · Computer Science 2015-07-01 Filippo Bonchi , Fabio Zanasi

We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called…

Logic in Computer Science · Computer Science 2014-05-15 Sana Stojanovic , Julien Narboux , Marc Bezem , Predrag Janicic

In this note the long standing problem of the definition of a Poisson bracket in the framework of a multisymplectic formulation of classical field theory is solved. The new bracket operation can be applied to forms of arbitary degree.…

Mathematical Physics · Physics 2015-06-26 Michael Forger , Cornelius Paufler , Hartmann Römer

Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums,where the harmonic sums and their…

Mathematical Physics · Physics 2009-11-11 S. Moch , P. Uwer

Sign Language (SL) linguistic is dependent on the expensive task of annotating. Some automation is already available for low-level information (eg. body part tracking) and the lexical level has shown significant progresses. The syntactic…

Computation and Language · Computer Science 2014-06-26 Rémi Dubot , Christophe Collet

Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing the resulting…

Artificial Intelligence · Computer Science 2021-08-09 Pedro Cabalar , Jorge Fandinno , Torsten Schaub , Philipp Wanko

Categorical semantics of type theories are often characterized as structure-preserving functors. This is because in category theory both the syntax and the domain of interpretation are uniformly treated as structured categories, so that we…

Programming Languages · Computer Science 2024-02-14 Shin-ya Katsumata , Xavier Rival , Jérémy Dubut

In this article, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies…

Quantum Physics · Physics 2022-08-23 Robert Lin

We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…

Logic · Mathematics 2022-12-23 Taichi Uemura

There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations…

Logic in Computer Science · Computer Science 2013-07-30 Daniel Gebler , Eugen-Ioan Goriac , Mohammad Reza Mousavi

Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…

Functional Analysis · Mathematics 2007-05-23 Antoine Delcroix , Maximilian F. Hasler , Stevan Pilipović , Vincent Valmorin

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

Combinatorics · Mathematics 2011-04-01 Kari Ragnarsson , Bridget Eileen Tenner

There is an apparent similarity between the descriptions of small-step operational semantics of imperative programs and the semantics of finite automata, so defining an abstraction mapping from semantics to automata and proving a simulation…

Programming Languages · Computer Science 2014-09-30 Nadezhda Baklanova , Wilmer Ricciotti , Jan-Georg Smaus , Martin Strecker

The design and implementation of precise static analyzers for significant fragments of modern imperative languages like C, C++, Java and Python is a challenging problem. In this paper, we consider a core imperative language that has several…

Programming Languages · Computer Science 2007-06-28 Roberto Bagnara , Patricia M. Hill , Andrea Pescetti , Enea Zaffanella

Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compatibility between clients and servers that ensures that every…

Programming Languages · Computer Science 2011-01-26 Maria Grazia Buscemi , Hernán Melgratti

Collaborative work on unstructured or semi-structured documents, such as in literature corpora or source code, often involves agreed upon templates containing metadata. These templates are not consistent across users and over time.…

Digital Libraries · Computer Science 2016-08-24 Owen Kaser , Daniel Lemire

We study equations over boolean algebras with distinguished elements. We prove the criteria, when a boolean algebra is equationally Noetherian, weakly equationally Noetherian, $\mathbf{q}_\omega$-compact or $\mathbf{u}_\omega$-compact. Also…

Rings and Algebras · Mathematics 2013-05-30 Artem N. Shevlyakov

We define several versions of the cohomology ring of an associative algebra. These ring structures unify some well known operations from homological algebra and differential geometry. They have some formal resemblance with the quantum…

Quantum Algebra · Mathematics 2007-05-23 Pyszard Nest , Boris Tsygan