15 search results - page 1 / 3 » A duality between proof systems for cyclic term graphs |
MSCS
2007
13 years 4 months ago
2007
ENTCS
2007
13 years 4 months ago
2007
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
CAV
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
ICFP
2000
ACM
13 years 9 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...