Papers - SAKAI, Masahiko
-
Narrowing-based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof Reviewed
"Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe"
Proc. of 12th Int'l Workshop on Functional and (Constraint) Logic Programming Vol. WFLP'03 page： 198-211 2003.6
-
Narrowing-based Effective Rewriting and its Termination for Term Rewriting Systems with Extra Variables
Vol. 1325 page： 238-243 2003.5
-
Typing Exception in an Object Oriented Calculus with Recoursive Type
Vol. 1325 page： 104-109 2003.5
-
オブジェクト指向計算モデルにおける例外処理機能の型付 Reviewed
堀江美保子、酒井正彦、坂部俊樹
コンピュータソフトウェア Vol. 20 ( 2 ) page： 54-58 2003.3
-
Descendants and Head Normalization of Higher-Order Rewrite Systems Reviewed
"Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa"
Lecture Notes in Computer Science Vol. 2441 2002.9
-
On Proving Termination of Higher-Order Rewrite Systems by Dependency Pair technique Reviewed
"Masahiko Sakai, Keiichirou Kusakari"
"Proc. of the First International Workshop on Higher-Order Rewriting (HOR'02), Copenhagen, Denmark" page： 25 2002.7
-
Generation of a TRS Implementing the Inverse of Pure Treeless Function Reviewed
"Naoki Nishida, Masahiko Sakai, Toshiki Sakabe"
Computer Software Vol. 19 ( 1 ) page： 29-33 2002.1
-
Decidability of root-needed strategy in priority term rewriting systems
"Tsuyoshi Suzuki, Masahiko Sakai, Toshiki Sakabe"
Technical Report of IEICE Vol. COMP2001-80 page： 49-55 2002.1
-
Proving Behavioral Equivalence for Weakly Complete Behavioral Specifications by Implicit Induction
"Yasushi Kano, Masahiko Sakai, Toshiki Sakabe"
Technical Report of IEICE Vol. COMP2001-79 page： 41-47 2002.1
-
Descendants and Head Normalization of Higher-Order Rewrite Systems
"Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa"
Technical Report of IEICE Vol. COMP2001-82 page： 65-72 2002.1
-
n箇所パターン照合関数のDeforestationに基づく効率化
中村敏広、酒井正彦、坂部俊樹
シンポジウム，情報基礎理論ワークショップ 2002
-
n箇所パターン照合関数のDeforestationに基づく効率化
中村敏広、酒井正彦、坂部俊樹
シンポジウム，情報基礎理論ワークショップ 2002
-
Generation of a TRS Implementing the Inverses of the Functions with Specified Arguments Fixed
"Naoki Nishida, Masahiko Sakai, Toshiki Sakabe"
Technical Report of IEICE Vol. COMP2001-67 page： 33-40 2001.12
-
Generation of Inverse Term Rewriting Systems for Pure Treeless Functions Reviewed
"Naoki Nishida, Masahiko Sakai, Toshiki Sakabe"
"Proc. of the International workshop on Rewriting in Proof and Computaion, Sendai, Japan" page： 188-198 2001.10
-
On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems Reviewed
"Masahiko Sakai, Keiichirou Kusakari"
"Proc. of the International Workshop on Rewriting in Proof and Computation (RPC'01), Sendai, Japan" page： 176-187 2001.10
-
An Extension of Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems Reviewed
"Masahiko Sakai, Yoshitsugu Watanabe, Toshiki Sakabe"
IEICE Trans. on Information and Systems Vol. E84-D ( 8 ) page： 1025-1032 2001.8
-
Generation of a Conditional TRS Implementing the Inverses of Pure Treeless Functions
"Naoki Nishida, Masahiko Sakai, Toshiki Sakabe"
Technical Report of IEICE Vol. COMP2001-14 page： 9-16 2001.6
-
Confluence of Orthogonal Metaterm Rewriting Calculus with Rules Containing rules Reviewed
"Sun Hui Hong, Masahiko Sakai, Toshiki Sakabe"
Computer Software Vol. 17 ( 6 ) page： 47-51 2000.11
-
Designing Unlimited Size Resource C-Libraries Freeing Users from GC Annoyance
"Naoki Nishida, Masahiko Sakai, Toshiki Sakabe"
Technical Report of IEICE Vol. SS2000-9 page： 25-32 2000.5
-
Confluence of Weakly Orthogonal CTRSs with Extra Variables
Ould Seyid Ahmed, Masahiko Sakai, Toshiki Sakabe
LA symposium 2000