Results 1  10
of
12
The Tile Model
 PROOF, LANGUAGE AND INTERACTION: ESSAYS IN HONOUR OF ROBIN MILNER
, 1996
"... In this paper we introduce a model for a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting, in particular from the rewriting logic framework [Mes92], and of concurrency theory: among the ..."
Abstract

Cited by 74 (27 self)
 Add to MetaCart
In this paper we introduce a model for a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting, in particular from the rewriting logic framework [Mes92], and of concurrency theory: among the others, the structured operational semantics [Plo81], the context systems [LX90] and the structured transition systems [CM92] approaches. Our model recollects many properties of these sources: first, it provides a compositional way to describe both the states and the sequences of transitions performed by a given system, stressing their distributed nature. Second, a suitable notion of typed proof allows to take into account also those formalisms relying on the notions of synchronization and sideeffects to determine the actual behaviour of a system. Finally, an equivalence relation over sequences of transitions is defined, equipping the system under analysis with a concurrent semantics, ...
A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
"... Recently, Craig Squier introduced the notion of finite derivation type to show that some finitely presentable monoid has no presentation by means of a finite complete rewriting system. A similar result was already obtained by the same author using homology, but the new method is more direct and more ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
Recently, Craig Squier introduced the notion of finite derivation type to show that some finitely presentable monoid has no presentation by means of a finite complete rewriting system. A similar result was already obtained by the same author using homology, but the new method is more direct and more powerful. Here, we present Squier's argument with a bit of categorical machinery, making proofs shorter and easier. In addition we prove that, if a monoid has finite derivation type, then its third homology group is of finite type. An invariant for a structure is something which can be calculated in many ways, but only depends on the structure itself. Typical examples are the dimension of a vector space or the genus of a surface. Squier's finiteness condition for monoids is of this kind: It can be defined in terms of a finite presentation, but does not depend on the choice of this presentation. To begin with a simpler case, consider the following theorem, which is not hard to prove: If M is...
Interaction Systems II: The Practice of Optimal Reductions
 Theoretical Computer Science
, 1994
"... Lamping's optimal graph reduction technique for the calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems provide a nice integration of the functional paradigm with a rich class of data structures (all inductive types), and so ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
(Show Context)
Lamping's optimal graph reduction technique for the calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems provide a nice integration of the functional paradigm with a rich class of data structures (all inductive types), and some basic control flow constructs such as conditionals and (primitive or general) recursion. We describe a uniform and optimal implementation, in Lamping's style, for all these features. The paper is the natural continuation of [3], where we focused on the theoretical aspects of optimal reductions in Interaction Systems (family relation, labeling, extraction). 1 Introduction At the end of 70's, L'evy fixed the theoretical performance of what should be considered as an optimal implementation of the calculus. The optimal evaluator should always keep shared those redexes in a expression that have a common origin (e.g. that are copies of a same redex). For a long time, no implementation achieved L'...
Breaking Paths in Atomic Flows for Classic Logic
, 2010
"... This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propositional logic. It is based on the recently introduced away from much of the typical bureaucracy of proofs. We make cruci ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propositional logic. It is based on the recently introduced away from much of the typical bureaucracy of proofs. We make crucial use of the path breaker, an atomicflow construction that avoids some nasty termination problems, and that can be used in any proof system with sufficient symmetry. This paper contains an original 2dimensionaldiagram exposition of atomic flows, which helps us to connect atomic flows with other known formalisms.
Operads, clones, and distributive laws
, 2008
"... Abstract We show how nonsymmetric operads (or multicategories), symmetric operads, and clones, arise from three suitable monads on Cat, each extending to a monad on profunctors thanks to a distributivelaw. The presentation builds upon recent work by Fiore, Gambino, Hyland, and Winskel on a theory ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract We show how nonsymmetric operads (or multicategories), symmetric operads, and clones, arise from three suitable monads on Cat, each extending to a monad on profunctors thanks to a distributivelaw. The presentation builds upon recent work by Fiore, Gambino, Hyland, and Winskel on a theory of generalized species of structures,but, for the multicategory case, the general idea goes back to Burroni's Tcategories (1971). We show how other previous categorical analysesof operad (via Day's tensor products, or via analytical functor) fit with the profunctor approach.
Twisted differential nonabelian cohomology Twisted (n−1)brane nbundles and their ChernSimons (n+1)bundles with characteristic (n + 2)classes
, 2008
"... We introduce nonabelian differential cohomology classifying ∞bundles with smooth connection and their higher gerbes of sections, generalizing [138]. We construct classes of examples of these from lifts, twisted lifts and obstructions to lifts through shifted central extensions of groups by the shif ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
We introduce nonabelian differential cohomology classifying ∞bundles with smooth connection and their higher gerbes of sections, generalizing [138]. We construct classes of examples of these from lifts, twisted lifts and obstructions to lifts through shifted central extensions of groups by the shifted abelian ngroup B n−1 U(1). Notable examples are String 2bundles [9] and Fivebrane 6bundles [133]. The obstructions to lifting ordinary principal bundles to these, hence in particular the obstructions to lifting Spinstructures to Stringstructures [13] and further to Fivebranestructures [133, 52], are abelian ChernSimons 3 and 7bundles with characteristic class the first and second fractional Pontryagin class, whose abelian cocycles have been constructed explicitly by Brylinski and McLaughlin [35, 36]. We realize their construction as an abelian component of obstruction theory in nonabelian cohomology by ∞Lieintegrating the L∞algebraic data in [132]. As a result, even if the lift fails, we obtain twisted String 2 and twisted Fivebrane 6bundles classified in twisted nonabelian (differential) cohomology and generalizing the twisted bundles appearing in twisted Ktheory. We explain the GreenSchwarz mechanism in heterotic string theory in terms of twisted String 2bundles and its magnetic dual version – according to [133] – in terms of twisted Fivebrane 6bundles. We close by transgressing differential cocycles to mapping
Universal Properties of Impure Programming Languages
"... We investigate impure, callbyvalue programming languages. Our first language only has variables and letbinding. Its equational theory is a variant of Lambek’s theory of multicategories that omits the commutativity axiom. We demonstrate that type constructions for impure languages — products, sums ..."
Abstract
 Add to MetaCart
(Show Context)
We investigate impure, callbyvalue programming languages. Our first language only has variables and letbinding. Its equational theory is a variant of Lambek’s theory of multicategories that omits the commutativity axiom. We demonstrate that type constructions for impure languages — products, sums and functions — can be characterized by universal properties in the setting of ‘premulticategories’, multicategories where the commutativity law may fail. This leads us to new, universal characterizations of two earlier equational theories of impure programming languages: the premonoidal categories of Power and Robinson, and the monadbased models of Moggi. Our analysis thus puts these earlier abstract ideas on a canonical foundation, bringing them to a new, syntactic level. F.3.2 [Semantics of Pro