Sciweavers

1000 search results - page 13 / 200
» Nominal rewriting systems
Sort
View
CAV
2012
Springer
270views Hardware» more  CAV 2012»
13 years 8 months ago
Automated Termination Proofs for Java Programs with Cyclic Data
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...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...
AI
2007
Springer
16 years 5 days ago
Rethinking the Semantics of Complex Nominals
Complex Nominals (CNs) have simple syntactic structure that conceals non-trivial semantic characteristics. While speakers of natural languages combine noun(s)/adjective(s) with a h...
Nabil Abdullah, Richard A. Frost
CORR
2006
Springer
117views Education» more  CORR 2006»
15 years 6 months ago
A comparison between two logical formalisms for rewriting
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino
ENTCS
2002
111views more  ENTCS 2002»
15 years 5 months ago
Comparing Meseguer's Rewriting Logic with the Logic CRWL
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino Tarjuelo
ICALP
2009
Springer
16 years 6 months ago
On Constructor Rewrite Systems and the Lambda-Calculus
Ugo Dal Lago, Simone Martini