7 citations · 8 across the 4 of their papers we have counts for
4 papers
On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions
Naoki Nishida, Yuya Maeda
The grammar representation of a narrowing tree for a syntactically deterministic conditional term rewriting system and a pair of terms is a regular tree grammar that generates expr…
On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems
Yoshiaki Kanazawa, Naoki Nishida
In this paper, we show a new approach to transformations of an imperative program with function calls and global variables into a logically constrained term rewriting system. The r…
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
Ryota Nakayama, Naoki Nishida, Masahiko Sakai
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is a sound structure-preserving transformation for we…
Towards Reversible Computation in Erlang
Naoki Nishida, Adrián Palacios, Germán Vidal
In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programmin…