1746 search results - page 153 / 350 » A Constructive Semantics for ALC |
139
Voted
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
160
Voted
RTA
2007
Springer
15 years 10 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
137
click to vote
PPDP
2009
Springer
15 years 9 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
255
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
148
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...