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

• 12月22日(水) 紹介者: 瀬古
  Bernd Lochner
  Things to know when implementing LPO,
  IJCAR 2004, Empirically Successful First Order Reasoning.
• 12月16日(金) 紹介者: 嶌津
  Dieter Hutter,
  Coloring Terms to Control Equational Reasoning,
  Journal of Automated Reasonig 18: 399-442, 1997.
• 12月7日(水) 紹介者： 小滝
  W.Chin,
  Towards an automated tupling strategy,
  In Proceedings of 3rd ACM Symposium on Partial Evaluation and
  Semantic-Based Program Manipulation, ACM Press, pp.119-132, 1993.
• 11月30日(水) 紹介者： 平田
  F. van Raamsdonk and P. Severi,
  On normalisation,
  Technical Report CS-R9545, CWI, 1995.
• 11月16日(水) 紹介者: 千葉
  Jeremy Gibbons,
  The Third Homomorphism Theorem,
  Journal of Functional Programming 6(4): 657-665 (1996).
• 11月9日(水) 紹介者: 外山
  H. Hosoya and B. C. Pierce,
  Regular expression pattern matching for XML,
  Journal of Functional Programming, Volume 13 (6) (2003) 961-1004.
• 11月2日(水) 紹介者: 徳橋
  G. Feuillade and T. Genet,
  Reachability in Conditional Term Rewriting Systems,
  In Proc. of FTP'03, Workshop on First Order Theorem Proving, volume 86, No 1. 2003
• 10月26日(水) 紹介者: 青戸
  Ireland, A. and Bundy, A.
  Productive Use of Failure in Inductive Proof.
  J. of Automated Reasoning, Vol.16, No.1-2, pp.79-111, 1996.
• 10月19日(水) 紹介者: 外山
  Durand, I. and Middeldorp, A.,
  Decidable call-by-need computations in term rewriting,
  Information and Computation 196 (2005) 95-126.
• 10月13日(木) 紹介者: 青戸
  Femke van Raamsdonk,
  On Termination of Higher-Order Rewriting,
  Proc. of RTA'01, LNCS 2051, 2001, pp. 261--275.
• 10月5日(水) 紹介者: 菊池
  Gerard Boudol,
  On Strong Normalization in the Intersection Type Discipline,
  In Proceedings of TLCA'03, LNCS 2701, pp.60-74, 2003.
• 9月21日(水) 紹介者: 千葉
  Nao Hirokawa and Aart Middeldorp,
  Automating the Dependency Pair Method,
  Information and Computation 199(1,2), pp. 172-199, 2005.
• 6月29日(水) 紹介者: 後藤
  Shinya Kawanaka, H.Hosya,
  XMLの為の双方向変換言語,
  The 7th JSSST Workshop on Programming and Programming Languages(PPL2005).
• 6月15日(水) 紹介者: 駒木
  H.Comon,
  Completion of Rewrite Systems with Membership Constraints Part II: Constraint Solving,
  Journal of Symbolic Computation, 25(4), pp.421-453, 1998.
• 6月8日(水) 紹介者: 徳橋
  Thomas Genet,
  Decidable approximations of sets of descendants and sets of normal forms,
  In Proceedings 9th Conference on Rewriting Techniques and Applications, LNCS 1379, Springer-Verlag, pp.151-165, 1998.
• 6/1(水) 紹介者: 菊池
  S. Ghilezan, V. Kuncak, and S. Likavec,
  Reducibility method for termination properties of typed lambda terms,
  In Proceedings of 5th International Workshop on Termination (WST'01) (2001) 14-16.
• 5/25(水) 紹介者: 青戸
  F. Javier Thayer F{\'a}brega, Jonathan C. Herzog,
  Joshua D. Guttman, Strand Spaces: Proving Security Protocols Correct,
  Journal of Computer Security, Vol.7, pp.191-230, 1999
• 5/18(水) 紹介者: 外山
  G. Godoy, A. Tiwari, R. M. Verma,
  Characterizing confluence by rewrite closure and right ground term rewrite systems,
  Appl. Algebra Eng. Commun. Comput. 15 (2004) 13-36.
• 5/11(水) 紹介者: 千葉
  A. Geser, D. Hofbauer, J. Waldmann, and H. Zantama,
  On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems,
  In Proceedings of 16th International Conference on Rewriting Techniques and Applications RTA-05, Nara (Japan),
  Lecture Notes in Computer Science 3467, pp. 353--367, 2005.

webmaster