Results 1 
6 of
6
An Algebraic Presentation of Term Graphs, via GSMonoidal Categories
 Applied Categorical Structures
, 1999
"... . We present a categorical characterisation of term graphs (i.e., finite, directed acyclic graphs labeled over a signature) that parallels the wellknown characterisation of terms as arrows of the algebraic theory of a given signature (i.e., the free Cartesian category generated by it). In particula ..."
Abstract

Cited by 38 (25 self)
 Add to MetaCart
. We present a categorical characterisation of term graphs (i.e., finite, directed acyclic graphs labeled over a signature) that parallels the wellknown characterisation of terms as arrows of the algebraic theory of a given signature (i.e., the free Cartesian category generated by it). In particular, we show that term graphs over a signature \Sigma are onetoone with the arrows of the free gsmonoidal category generated by \Sigma. Such a category satisfies all the axioms for Cartesian categories but for the naturality of two transformations (the discharger ! and the duplicator r), providing in this way an abstract and clear relationship between terms and term graphs. In particular, the absence of the naturality of r and ! has a precise interpretation in terms of explicit sharing and of loss of implicit garbage collection, respectively. Keywords: algebraic theories, directed acyclic graphs, gsmonoidal categories, symmetric monoidal categories, term graphs. Mathematical Subject Clas...
Normal Forms for Partitions and Relations
 Recent Trends in Algebraic Development Techniques, volume 1589 of Lect. Notes in Comp. Science
, 1999
"... Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, treelike presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, b ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, treelike presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, but an exhaustive comparison between them is difficult because their presentations can be quite dissimilar. This work is a first step towards a unified view, which is able to recast all those formalisms into a more general one, where they can be easily compared. We introduce a general schema for describing a characteristic normal form for many algebraic formalisms, and show that those normal forms can be thought of as arrows of suitable concrete monoidal categories.
A Functorial Semantics for MultiAlgebras and Partial Algebras, With Applications to Syntax
, 2000
"... Multialgebras allow for the modeling of nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a functorial presentation of various categories of multialgebras and partial algebras, analogous to the classica ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Multialgebras allow for the modeling of nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a functorial presentation of various categories of multialgebras and partial algebras, analogous to the classical presentation of algebras over a signature as cartesian functors from the algebraic theory over to Set. We introduce two dierent notions of theory over a signature, both having a structure weaker than cartesian, and we consider functors from them to Rel or Pfn, the categories of sets and relations or partial functions, respectively. Next we discuss how the functorial presentation provides guidelines for the choice of syntactical notions for a class of algebras, and as an application we argue that the natural generalization of usual terms are \conditioned terms" for partial algebras, and \term graphs" for multialgebras. Contents 1 Introduction 2 2 A short recap on multialgebras 4 3...
Term Graph Syntax for MultiAlgebras
, 2000
"... Multialgebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. Starting from a functorial presentation of multialgebras based on gsmonoidal theories, we argue that speci cations for multialgebras ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Multialgebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. Starting from a functorial presentation of multialgebras based on gsmonoidal theories, we argue that speci cations for multialgebras should be based on the notion of term graphs instead of on standard terms. We consider the simplest case of (term graph) equational specification, showing that it enjoys an unrestricted form of substitutivity. We discuss the expressive power of equational specification for multialgebras, and we sketch possible extensions of the calculus.
Declarative Assembler
, 2004
"... Abstract. As part of a larger project, we have built a declarative assembly language. This language enables us to specify multiple code paths to compute particular quantities, giving the instruction scheduler more flexibility in balancing execution resources for superscalar execution. The instructio ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. As part of a larger project, we have built a declarative assembly language. This language enables us to specify multiple code paths to compute particular quantities, giving the instruction scheduler more flexibility in balancing execution resources for superscalar execution. The instruction scheduler is also innovative in that it includes aggressive pipelining, and exhaustive (but lazy) search for optimal instruction schedules. We present some examples where our approach has produced very promising results. 1
Appligraph: Applications of Graph Transformation  Fourth Annual Progress Report
, 2001
"... This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and devel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and development of systems, languages, and tools and to improve the awareness of its industrial relevance