Sciweavers

1000 search results - page 9 / 200
» Nominal rewriting systems
Sort
View
SIGMOD
1992
ACM
160views Database» more  SIGMOD 1992»
13 years 11 months ago
Extensible/Rule Based Query Rewrite Optimization in Starburst
This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starb...
Hamid Pirahesh, Joseph M. Hellerstein, Waqar Hasan
ECOOP
2003
Springer
14 years 21 days ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...
ICICS
2001
Springer
13 years 12 months ago
A Digital Nominative Proxy Signature Scheme for Mobile Communication
Based on the development of mobile communication, the future mobile communication systems are expected to provide higher quality of multimedia services for users than today’s sys...
Hee-Un Park, Im-Yeong Lee
PPDP
2007
Springer
14 years 1 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
ENTCS
2007
121views more  ENTCS 2007»
13 years 7 months ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg