Sciweavers

1000 search results - page 172 / 200
» Nominal rewriting systems
Sort
View
LCPC
1992
Springer
14 years 22 days ago
A Calculus of Gamma Programs
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...
Chris Hankin, Daniel Le Métayer, David Sand...
HIPEAC
2010
Springer
13 years 10 months ago
Computer Generation of Efficient Software Viterbi Decoders
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
Frédéric de Mesmay, Srinivas Chellap...
ER
2008
Springer
140views Database» more  ER 2008»
13 years 10 months ago
Managing the History of Metadata in Support for DB Archiving and Schema Evolution
Modern information systems, and web information systems in particular, are faced with frequent database schema changes, which generate the necessity to manage them and preserve the...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
ESWS
2008
Springer
13 years 10 months ago
Numeric reasoning in the Semantic Web
Abstract. The Semantic Web is an effort by the W3C to enable integration and sharing of information across different applications and organizations using annotations by means of on...
Chimène Fankam, Stéphane Jean, Guy P...
IJSI
2008
109views more  IJSI 2008»
13 years 8 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama