Papers - NISHIDA Naoki
-
Narrowing-based Effective Rewriting and its Termination for Term Rewriting Systems with Extra Variables
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
IEICE Technical Report COMP2003-68 Vol. 102 ( 593 ) page： 45-52 2003.1
-
A Narrowing-based Reduction of Term Rewriting Systems with Extra Variables
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
Record of 2002 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers page： 292 2002.9
-
A Computation Model of Term Rewriting Systems with Extra Variables
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
Proceedings of the 19th Conference of Japan Society for Software Science and Technology (JSSST) ( 6F-3 ) page： 1-5 2002.9
-
Generation of a TRS Implementing the Inverses of Pure Treeless Functions Reviewed
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
Computer Software Vol. 19 ( 1 ) page： 29-33 2002.1
-
Generation of a TRS Implementing the Inverses of the Functions with Specified Arguments Fixed
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
IEICE Technical Report COMP2001-67 Vol. 101 ( 488 ) page： 33-40 2001.12
-
Generation of Inverse Term Rewriting Systems for Pure Treeless Functions Reviewed
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
Proceedings of the International Workshop on Rewriting in Proof and Computation (RPC'01) page： 188-198 2001.10
-
Generation of a TRS Implementing the Inverses of Pure Treeless Functions
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
Proceedings of the 18th Conference of Japan Society for Software Science and Technology (JSSST) ( 6C-3 ) page： 1-5 2001.9
-
Generation of a Conditional TRS Implements the Inverses of Pure Treeless Functions
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
IEICE Technical Report COMP2001-14 Vol. 101 ( 133 ) page： 9-16 2001.6
-
Designing Unlimited Size Resource C-Libraries Freeing Users from GC Annoyance
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
IEICE Technical Report SS2000-9 Vol. 100 ( 64 ) page： 25-32 2000.5