Sciweavers

351 search results - page 30 / 71
» Algebra and Geometry of Rewriting
Sort
View
FAC
2008
92views more  FAC 2008»
13 years 10 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
DBPL
1995
Springer
144views Database» more  DBPL 1995»
14 years 1 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
CCCG
2006
13 years 11 months ago
Bounded-Curvature Path Normalization
We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.
Jonathan Backer, David G. Kirkpatrick
CADE
2004
Springer
14 years 10 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu
DNA
2009
Springer
158views Bioinformatics» more  DNA 2009»
14 years 4 months ago
Design of a Biomolecular Device That Executes Process Algebra
Process algebras are widely used for defining the formal semantics of concurrent communicating processes. In process algebra, concurrent processes can be specified to execute di...
Urmi Majumder, John H. Reif