相关论文: Incoherent coherences

Coherent spaces spanned by a finite number of coherent states, are introduced. Their coherence properties are studied, using the Dirac contour representation. It is shown that the corresponding projectors resolve the identity, and that they…

Axiom pinpointing refers to the task of finding the specific axioms in an ontology which are responsible for a consequence to follow. This task has been studied, under different names, in many research areas, leading to a reformulation and…

The coalgebra approach to the construction of classical integrable systems from Poisson coalgebras is reviewed, and the essential role played by symplectic realizations in this framework is emphasized. Many examples of Hamiltonians with…

In this letter we make a brief review of some basic properties (the matrix elements, the trace, the Glauber formula) of coherent operators and study the corresponding ones for generalized coherent operators based on Lie algebra su(1,1). We…

The basic ingredients of the `consistent histories' approach to a generalized quantum theory are `histories'and decoherence functionals. The main aim of this program is to find and to study the behaviour of consistent sets associated with a…

This technical report presents a general framework for parsing a variety of grammar formalisms. We develop a grammar formalism, called an Abstract Grammar, which is general enough to represent grammars at many levels of the hierarchy,…

We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.

We introduce a conceptual framework that associates syntax and semantics with vertical and horizontal directions in principal bundles and related constructions. This notion of geometry corresponds to a mechanism for performing goal-directed…

A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…

CPEG is an extended parsing expression grammar with regex-like capture annotation. Two annotations (capture and left-folding) allow a flexible construction of syntax trees from arbitrary parsing patterns. More importantly, CPEG is designed…

We revisit the behavioral approach to systems theory and make explicit the abstract pattern that governs it. Our end goal is to use that pattern to understand interaction-related phenomena that emerge when systems interact. Rather than…

Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…

We implement in the formal language of homotopy type theory a new set of axioms called cohesion. Then we indicate how the resulting cohesive homotopy type theory naturally serves as a formal foundation for central concepts in quantum gauge…

A coverage type generalizes refinement types found in many functional languages with support for must-style underapproximate reasoning. Property-based testing frameworks are one particularly useful domain where such capabilities are useful…

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has…

This paper is concerned with the axiomatic basis of structures within Hypercompositional Algebra. It is proven that the axioms employed in the definition of numerous hypercompositional structures lack independence. Accordingly, novel…

A general framework for obtaining certain types of contracted and centrally extended algebras is presented. The whole process relies on the existence of quadratic algebras, which appear in the context of boundary integrable models.

Formalizing syntactic proofs of properties of logics, programming languages, security protocols, and other formal systems is a significant challenge, in large part because of the obligation to handle name-binding correctly. We present an…

In this paper we provide a survey on the framework of abstract non-interference. In particular, we describe a general formalization of abstract non-interference by means of three dimensions (observation, protection and semantics) that can…

Axioms are presented which encapsulate the properties satisfied by categories of games which form the basis of results on full abstraction for PCF and other programming languages, and on full completeness for various logics and type…