外山研輪講 紹介論文一覧 (2008年度)

• 2月4日(水) 紹介者：村井
  Guillem Godoy, Ashish Tiwari, and Rakesh Verma,
  On the confluence of linear shallow term rewrite systems,
  Lecture Notes In Computer Science, vol. 2607, pp.85-96, 2003
• 1月21日(水) 紹介者：磯部
  Nao Hirokawa and Georg Moser,
  Automated Complexity Analysis Based on the Dependency Pair Method,
  Lecture Notes in Computer Science, vol.5195, pp.364-379, 2008.
• 1月14日(水) 紹介者：小川
  Masako Takahashi,
  Parallel reductions in lambda-calculus,
  Information and Computation, Vol. 118(1), pp.120-127, 1995.
• 1月14日(水) 紹介者：Pham
  M. Kurihara and H. Kondo,
  Completion for multiple reduction orderings,
  Journal of automated reasoning, Vol. 23(1), pp. 25-42, 1999.
• 11月18日(火) 紹介者：道又
  Leo Bachmair and Nachum Dershowitz,
  Equational Inference, Canonical Proofs, and Proof Orderings,
  Journal of the Association of Computing Machinery, vol. 41, no. 2, pp. 236-276, 1994
• 7月9日(水) 紹介者：吉田
  Nao Hirokawa and Aart Middeldorp,
  Predictive Labeling,
  Proceedings of the 17th International Conference on Rewriting Techniques and Applications, LNCS 4098, pp. 313-327, 2006
• 7月2日(水) 紹介者：磯部
  Martin Avanzini and Georg Moser,
  Complexity Analysis by Rewriting,
  FLOPS 2008, LNCS 4989, pages 130-146, 2008.
• 6月25日(火) 紹介者：村井
  Guillem Godoy, Ashish Tiwari,
  Confluence of Shallow Right-Linear Rewrite Systems.
  CSL 2005, LNCS 3634, pages 541-556, 2005.
• 6月18日(水) 紹介者：瀬古
  Evelyne Contejean, Claude Marche, Ana Paula Tomas and Xavier Urbain,
  Mechanically Proving Termination Using Polynomial Interpretaions,
  Journal of Automated Reasoning 34, pp.325-363, 2005.
• 5月27日(火) 紹介者：青戸
  J. Giesl and D. Kapur,
  Deciding Inductive Validity of Equations,
  In Proceedings of the 19th International Conference on Automated Deduction (CADE-19),
  LNAI 2741, pages 17-31, 2003.

webmaster