Top>
輪講の記録>
紹介論文一覧 (2003年度)
外山研輪講 紹介論文一覧 (2003年度)
- 12/10(水) 紹介者: 童子
Zena M. Ariola, Jan Willem Klop,
Equational Term Graph Rewriting,
Fundamenta Informaticae Vol. 26 Nrs.3,4 (1996) pp.207-240.
- 12/10(水) 紹介者: 板垣
Irene Durand,
Bounded,Strongly Sequential and Forward-Branching
Term Rewriting Systems,
Journal Symbolic Computation Vol. 18 (1994) pp.319-352.
- 12/3(水) 紹介者: 駒木
Yves Metivier,
About The Rewriting Systems,
Produced By The Knuth-Bendix Completion Algorithm,
Information Processing Letters 16 (1983) pp. 31-34.
- 12/3(水) 紹介者: 柴崎
Uday S. Reddy,
Term Rewriting Induction,
LNAI 449 (1990) pp.162-177.
- 11/18(火), 11/27(木) 紹介者: 落合
Cristina Brralleras, Albert Rubio,
Proving Termination of AC-rewriting without Extended Rules.
(Cristina Brralleras, Albert Rubio,
Monotonic AC-Compatible Semantic Path Ordering,
RTA 2003, LNCS 2706, pp. 279-295, 2003.
のlong version).
- 11/5(水) 紹介者: 坂本
Olivier Danvy,
Higher-Order Rewriting and Partial Evaluation,
Technical Report BRICS RS-97-46, University of Aarhus,
December 1997.
- 10/29(水) 紹介者: 千葉
Michael Hanus, Christian Prehofer,
Higher-Order Narrowing with Definitional Trees,
Journal of Functional Programming, Vol. 9, No. 1, pp. 33-75,
1999.
- 7/23(水), 7/30(水) 紹介者: 坂本
J.Y. Marion,
Analysing the implicit complexity of programs,
Information and Computation 183, pp.2-18, 2003.
- 7/9(水) 紹介者: 落合
Thomas Arts, Jurgen Giesl,
Termionation of term rewriting using dependency pairs,
Theoretical Computer Science 236 (2000) 133-178.
- 6/25(水) 紹介者: 青戸
Giesl, J. and Zantema, H.,
Liveness in rewriting.
In Proceedings of the 14th International Conference
on Rewriting Techniques and Applications, LNCS 2706,
pp.321-336, 2003.
- 5/28(水) 紹介者: 秋谷
A. Lazrek, P. Lescanne and J-J. Thiel,
Tools for Proving Inductive Equalities,
Relative Completeness,and w-Completeness,
Information and Computation 84, pp. 47-70, 1990.
- 5/14(水) 紹介者: 千葉
Daniel J. Dougherty,
Higher-order unification via combinators,
Theoretical Computer Science, 114 (1993), pp. 273-298.
[外山研究室]
[電気通信研究所]
[東北大学]
ご意見お問い合わせは
webmaster
まで.