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

• 7/13(月) 紹介者: 長谷
  Takashi Nagaya, Masahiko Sakai, and Yosihito Toyama,
  Index reduction of overlapping strongly sequential systems,
  IEICE Transaction of Information and System E81-D(5), pp.419-426, 1998.
• 7/1(水) 紹介者: 鈴木
  Maria Alpuente, Moreno Falaschi, and Ferdinando Manzo,
  Analyses of unsatisfiability for equational logic programming,
  Journal of Logic Programming 22(3), pp.223-254, 1995.
• 6/17(水) 紹介者: 成島
  Roland Olsson,
  Inductive functional programing using incremental program tranceformation,
  Artificial Intelligence 74, pp.55-81, 1995.
• 6/11(木) 紹介者: 木村
  Shang-Ching Chou, Xiao-Shan Gao, and Jing-Zhong Zhang,
  Automated Production of Traditional Proofs for Theorems in Euclidean Geometry,
  Proceedings of Eighth IEEE Symposium on Logic in Computer Science, pp.48-56, 1993.
• 6/3(水) 紹介者: 村島
  David Sands,
  Proving the correctness of recursion-based automatic program transformations,
  Theoretical Computer Science 167, pp.193-233, 1996.
• 5/27(水) 紹介者: 安藤
  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.
• 5/20(水) 紹介者: 吉政
  Francoise Bellegarde,
  Automating Synthesis by Completion,
  Journees Francophones des Languages Applicatifs, pp.177-203, 1995.
• 5/13(水) 紹介者: 中村
  Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema,
  Transforming Termination by Self-Labelling,
  Lecture Notes in Artificial Intelligence 1104, pp.373-387, 1996.
• 5/7(木) 紹介者: 小池
  A. Ireland and A. Bundy,
  Productive Use of Failure in Inductive Proof,
  Journal of Automated Reasoning 16, pp.79-111, 1996.
• 4/22(水) 紹介者: 岩見
  H. Xi,
  Towards Automated Termination Proofs Through "Freezing",
  Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), Tsukuba,
  Lecture Notes in Computer Science 1379, pp.271-285, 1998.
• 4/22(水) 紹介者: 草刈
  O. Danvy and K. H. Rose,
  Higher-order Rewriting and Partial Evaluation,
  Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), Tsukuba,
  Lecture Notes in Computer Science 1379, pp.286-301, 1998.
• 4/22(水) 紹介者: 長谷
  Florent Jacquemard, Christoph Meyer, Christoph Weidenbach,
  Unification in Extensions of Shallow Equational Theories,
  Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), Tsukuba,
  Lecture Notes in Computer Science 1379, pp.76-90, 1998.
• 4/15(水) 紹介者: 岩見
  T. Arts and J. Giesl,
  Modularity of Termination Using Dependency Pairs,
  Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), Tsukuba,
  Lecture Notes in Computer Science 1379, pp.226-240, 1998.
• 4/15(水) 紹介者: 草刈
  C. March\acute{e} and X. Urbain,
  Termination of Associative-Commutative Rewriting by Dependency Pairs,
  Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), Tsukuba,
  Lecture Notes in Computer Science 1379, pp.241-255, 1998.
• 4/15(水) 紹介者: 長谷
  T. Genet,
  Decidable Approximations of Sets of Descendants and Sets of Normal Forms,
  Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), Tsukuba,
  Lecture Notes in Computer Science 1379, pp.151-165, 1998.
• 3/12(木) 紹介者: 木村
  Shang-Ching Chou,
  An Introduction to Wu's Method for Mechanical Theorem Proving in Geometry,
  Journal of Automated Reasoning 4, pp.237-267, 1988.
• 3/10(火) 紹介者: 成島
  Gianna Cioni, Attilio Colagrossi, Alfonso Miola,
  A Sequent Calculus for Automated Reasoning in Symbolic Computation Systems,
  Journal of Symbolic Computation 19, pp.175-199, 1995.
• 3/3(火) 紹介者: 吉政
  Zena M.Ariola, Matthias Felleisen,
  The call-by-need lambda calculus,
  Journal of Functional Programming 7, pp.265-301, 1997.
• 2/26(木) 紹介者: 安藤
  Deepak Kapur, Paliath Narendran, and Friedrich Otto,
  On Ground-Confluence of Term Rewriting Systems,
  Information and Computation 86, pp.14-31, 1990.
• 2/25(水) 紹介者: 中村
  M.C.F.Ferreira, H.Zantema,
  Total Termination of Term Rewriting,
  Applicable Algebra in Engineering, Communication and Computing 7, pp.133-162, 1996.
• 2/12(木) 紹介者: 村島
  A.P.Ershov,
  Mixed Computation: Potential Applications and Problems for Study,
  Theoretical Computer Science 18, pp.41-67, 1982.
• 1/21(水) 紹介者: 長谷
  Ralf Treinen,
  The First-Order Theory of One-Step Rewriting is Undecidable,
  Lecture Notes in Computer Science 1103, pp.276-286.

webmaster