Nov 12, 2009 · We present a sequence of theory transformations that can be used to bridge the gap between expressive membership equational programs and such ...
We present a sequence of theory transformations that can be used to bridge the gap between expressive equational programs and termination tools, prove the ...
Proving termination of equational programs having such expressive features is important but nontrivial, because some of those features may not be supported by ...
Apr 26, 2008 · We present a sequence of theory transformations that can be used to bridge the gap between expressive membership equational programs and such ...
We present a sequence of theory transformations that can be used to bridge the gap between expressive membership equational programs and such termination tools, ...
Operational Termination of Membership Equational Programs
www.sciencedirect.com › article › pii › pdf
Our main goal is automating termination proofs for programs in rewriting-based languages with features such as: (i) expressive type structures, ...
PDF | Reasoning about the termination of equational programs in sophisticated equational languages such as Elan, Maude, OBJ, CafeOBJ, Haskell, and so.
Our main goal is automating termination proofs for programs in rewriting-based languages with features such as: (i) expressive type structures, ...
Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, ...
Our main goal is automating termination proofs for programs in rewriting-based languages with features such as: (i) expressive type structures, ...