Sciweavers

1458 search results - page 53 / 292
» Extended Term Rewriting Systems
Sort
View
POPL
2007
ACM
15 years 10 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...
ICLP
2005
Springer
15 years 3 months ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
PODS
2010
ACM
249views Database» more  PODS 2010»
15 years 2 months ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
AAAI
2008
15 years 3 days ago
An Extended Interpreted System Model for Epistemic Logics
The interpreted system model offers a computationally grounded model, in terms of the states of computer processes, to S5 epistemic logics. This paper extends the interpreted syst...
Kaile Su, Abdul Sattar
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 10 months ago
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
Hans Zantema