Sciweavers

27 search results - page 4 / 6
» On rewrite constraints and context unification
Sort
View
RTA
1995
Springer
13 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
CIKM
2005
Springer
14 years 1 months ago
Access control for XML: a dynamic query rewriting approach
We introduce the notion of views as a mechanism for securing and providing access control in the context of XML. Research in XML has explored several efficient querying mechanism...
Sriram Mohan, Arijit Sengupta, Yuqing Wu
COGSCI
2004
92views more  COGSCI 2004»
13 years 7 months ago
Varieties of crossing dependencies: structure dependence and mild context sensitivity
Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on contex...
Edward P. Stabler Jr.
CADE
2006
Springer
14 years 7 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
COORDINATION
2008
Springer
13 years 9 months ago
How to Infer Finite Session Types in a Calculus of Services and Sessions
Abstract. The notion of session is fundamental in service oriented applications, as it separates interactions between different instances of the same service, and it groups togethe...
Leonardo Gaetano Mezzina