外山・酒井研輪講 紹介論文一覧 (1996年)

• 12/11(水),19(木) 紹介者: 松野
  H.Hoffmann and J.O'Donnel,
  Pattern Matching in Trees,
  JACM 29, pp.68-95, 1982.
• 11/13(水) 紹介者: 中野
  H.Zantema,
  Termination of term rewriting: interpretation and type elimination,
  Journal of Symbolic Computation 17, pp.23-50, 1994.
• 11/6(水) 紹介者: 岩見
  Jean-Pierre Jouannaud and Albert Rubio,
  A recursive path ordering for higher-order terms in η-long β-normal form,
  Lecture Notes in Computer Science 1103, pp.108-122, 1996.
• 10/23(水) 紹介者: 草刈
  Bernhard Gramlich,
  Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems,
  Fundamenta Informaticae, 24, pp.3-23, 1995.
  Special issue on term rewriting systems, ed. D. A. Plaisted.
• 10/16(水) 紹介者: 長谷
  M.Dauchet, T.Heuillard, P.Lescanne, and S.Tison,
  Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems,
  Information and Computation 88, pp.187-201, 1990.
• 7/5,12(金) 紹介者: 関
  Berthold Hoffmann,
  Term Rewriting with Sharing and Memoi"zation,
  Proceedings of International Conference on Algebraic and Logic Programming (ALP'92), Lecture Notes in Computer Science 632, pp.128-142, 1992.
• 6/21,28(金) 紹介者: 松野
  A.Middeldorp and E.Hamoen,
  Completeness Results for Basic Narrowing,
  Applicable Algebra in Engineering, Communication and Computing 5, pp.213-253, 1994.
• 6/14(金) 紹介者: 長谷
  Dauchet M. and Tison S.,
  The Theory of Ground Rewrite Systems is Decidable,
  Proceedings of the 5th IEEE symposium on Logic in Computer Science, pp.242-248, 1990.
• 5/31(金) 紹介者: 草刈
  Nachum Dershowitz, Stephane Kaplan, David A. Plaisted,
  Rewrite, rewrite, rewrite, rewrite, rewrite,・・・,*
  Theoretical Computer Science 83, pp.71-96, 1991.
• 5/24(金) 紹介者: 岩見
  M.C.F.Ferreira and H.Zantema,
  Dummy Elimination: making termination easier,
  Technical Report UU-CS-1994-47 in Utrecht University.
• 5/17(金) 紹介者: 中野
  Albert Rubio , Robert Nieuwenhuis,
  A precedence-based total AC-compatible ordering,
  Lecture Notes in Computer Science 690, 1993.
• 4/30(火) 紹介者: 井手
  F.WARREN BRUTON and ROBERT D.CAMERON,
  Pattern matching with abstract data types,
  Journal of Functional Programming, 1993.
• 4/23(火) 紹介者: 関
  I. Durand
  Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems,
  Journal of Symbolic Computation 18, pp.319-352, 1994.
• 4/16(火) 紹介者: 阿部
  Henrik Nilsson and Peter Fritzson,
  Algorithmic debugging for lazy functional languages
  Journal of Functional Programming 4(3), pp.337-369.
• 4/8(月) 紹介者: 杉山
  ALAIN LAVILLE,
  Comparison of Priority Rules in Pttern Matching and Term Rewriting,
  Journal of Symbolic Computer 11, pp.321-347, 1991.
• 4/4(木) 紹介者: 松野
  Jean Claude RAOULT,
  On Graph Rewritings,
  Theoretical Computer Science 32, pp.1-24, 1984.

webmaster