12774 search results - page 165 / 2555 » A Framework for Proof Systems |
149
click to vote
ENTCS
2008
15 years 4 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
134
click to vote
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
117
click to vote
AUTOMATICA
2007
15 years 4 months ago
2007
We discuss notions of detectability for stochastic linear control systems of Itˆo type. A natural concept of detectability requires a non-zero output, if the state process is uns...
124
click to vote
FUIN
2010
15 years 3 months ago
2010
In this paper we will provide a detailed proof of the solvability of the halting and reachability problem for binary 2-tag systems. We will furthermore prove that an important sub...
169
click to vote
ESSLLI
2009
Springer
15 years 2 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...