Munehiro Iwami

: iwami_m [at] iwate-pu [.] ac [.] jp

Research Interests: Term rewriting system, Functional and logic programming language, Automated deduction, Programming education
Ph.D.Thesis "Termination of higher-order rewrite systems," Japan Advanced Institute of Science and Technology (JAIST), 1999.
Refereed Papers M. Iwami, M. Sakai and Y. Toyama, "An improved recursive decomposition ordering for higher-order rewrite systems," IEICE Transactions on Information and Systems, Vol.E81-D, No.9, pp.988-996, 1998. M. Iwami and Y. Toyama, "Simplification ordering for higher-order rewrite systems," IPSJ Transactions on Programming, Vol.40, No.SIG 4 (PRO 3), pp.1-10, 1999. M. Iwami, "Persistence of termination for non-overlapping term rewriting systems," Proc. of 1st International Forum on Information and Computer Technology, Shizuoka University, Japan, pp.198-202, 2003. M. Iwami, "Persistence of termination of term rewriting systems with ordered sorts," Proc. of 5th JSSST Workshop on Programming and Programming Languages, Shizuoka, Japan, pp.47-56, 2003. M. Iwami, "Persistence of termination for locally confluent overlay term rewriting systems," Proc. of IASTED International Conference on Artificial Intelligence and Applications as part of the 22nd IASTED International Multi-Conference on APPLIED INFORMATICS, Innsbruck, Austria, ACTA Press, pp.529-534, 2004. M. Iwami, "An improved recursive decomposition ordering for term rewriting systems revisited," Advances in Logic Based Intelligent Systems, Frontiers in Artificial Intelligence and its Applications, vol. 132, (Proc. of 5th Congress on Logic Applied to Technology, University of Hyogo, Japan), IOS Press, pp.18-25, 2005. M. Iwami, "Confluence of left-linear and K-development closed term rewriting systems," IEICE Transactions on Information and Systems, Vol.J90-D, No.10, pp.2932-2935，2007, (in Japanese). M. Iwami, "Acyclicity of combinator L," Forum on Information Technology 2007 (FIT 2007), Information Technology Letters, Vol.6, pp.25-26, 2007, (in Japanese). M. Iwami, "On the acyclic and related properties of combinators," IPSJ Transactions on Programming, Vol.2, No. 2, pp.97-104, 2009, (in Japanese). M. Iwami and T. Aoto, "A procedure for disproving strong head normalization of infinitary term rewriting systems," Proc. of 12th JSSST Workshop on Programming and Programming Languages, Kagawa, Japan, pp.261-273, 2010 (in Japanese). M. Iwami and T. Aoto, "Disproving strong head normalization and general productivity automatically in infinitary term rewriting systems," Computer Software, Vol.29, No.1, pp.211-239, 2012 (in Japanese). T. Aoto and M. Iwami, "Termination of Rule-Based Calculi for Uniform Semi-Unification", Proc. of the 7th International Conference on Language and Automata Theory and Applications, LATA 2013, Bilbao, Spain, LNCS 7810, pp.56-67, Springer-Verlag, 2013. [doi:10.1007/978-3-642-37064-9_7] M. Iwami, "Uniform Semi-Unification and Anchored Semi-Unification", Informal Proc. of 29th International Workshop on Unification, Warsaw, Poland, p.25, 2015. M. Iwami, "On the Unification of Rational Terms," Computer Software, Vol.35, No.4, pp.151-163，2018 (in Japanese). M. Ishizuka, T. Aoto and M. Iwami, "Commutative Rational Term Rewriting", Proc. of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021, LNCS 12638, Milan, Italy, pp.200-212, Springer Nature Switzerland AG, 2021. [doi:10.1007/978-3-030-68195-1_15] M. Iwami, "Non-\omega-Strong Head Normalization, Non-Ground Loop and Acyclic of Several Combinators," IPSJ Transactions on Programming, Vol.16, No.3, pp.14-27, 2023, (in Japanese). K. Nakano and M. Iwami, "Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata", Proc. of the 28th International Conference on Implementation and Application of Automata, CIAA 2024, LNCS 15015, Akita, Japan, pp.261–275, Springer Nature Switzerland AG, 2024. [doi:10.1007/978-3-031-71112-1_19] M. Iwami and K. Nakano, "Disproving Termination of O-like Combinators by Tree Automata", Non-SRC Poster, APLAS 2024, extended abstract，4 pages, 2024, Kyoto, Japan. [Audience Award]
Unefereed Papers M. Iwami, M. Sakai and Y. Toyama, "Termination of higher-order rewrite systems," Proc. the Joint Conf. of Hokuriku Chapters of Institutes of Electrical Engineers, Japan, E-28, pp.314, 1995 (in Japanese). M. Iwami, M. Sakai and Y. Toyama, "On the termination of higher order rewrite systems," Technical Report of IEICE, COMP95-85, pp.113-122, 1996 (in Japanese). M. Iwami, M. Sakai and Y. Toyama, "Termination of higher-order rewrite systems," Proc. LA Symp., Summer, pp.55-60, 1996 (in Japanese). M. Iwami, M. Sakai and Y. Toyama, "An improved recursive decomposition ordering for higher-order rewrite systems," Technical Report of IEICE, COMP96-73, pp.17-24, 1997. M. Iwami and Y. Toyama, "On the persistency of termination of term rewriting systems with ordered sorts,'' Proc. 14th Conf. on Japan Society for Software Science and Technology, pp.357-360, 1997 (in Japanese). M. Iwami and Y. Toyama, ``Simplification ordering for higher-order rewrite systems,'' Research Report, IS-RR-98-0024F, School of Information Science, JAIST, 1998. M. Iwami and Y. Toyama, "Simplification ordering and higher-order recursive path ordering," LA Symp., Summer, pp.11-1-11-6, 1999. M. Iwami, "Persistence of termination for locally confluent overlay term rewriting systems," LA Symp., Summer, pp.23-1-23-8, 2003. M. Iwami, "Persistence of termination for non-overlapping term rewriting systems", RIMS, No. 1366, pp. 91-99, 2004. M. Iwami, "Persistence of termination for overlay term rewriting systems", RIMS, No. 1375, pp. 240-246, 2004. M. Iwami, "An improved recursive decomposition ordering for term rewriting systems revisited," RIMS, No. 1426, pp.126--132, 2005. T. Aoto and M. Iwami, "Uniform Semi-Unification," RIMS, No. 1915, pp.161-165, 2014. K. Nakano and M. Iwami, "Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (full version)", arXiv:2406.14305v1, 20 pages, full version of CIAA 2024, 2024.
Workshops, Meetings 59th TRS meeting, September 27-29, 2023, New Welcity IZUMO Logic, Algebraic system, Language and Related Areas in Computer Science, February 16-18, 2022, Online 55th TRS meeting, September 28-30, 2021, Online Logic, Language, Algebraic system and Related Areas in Computer Science, February 17-19, 2021, Online 47th TRS meeting, September 25-27, 2017, Matsue New Urban Hotel 36th TRS meeting, February 27-29, 2012, Shimane University 24th TRS meeting, April 2-4, 2004, Shimane University, Japan
Profile B.S., Tokai University, 1994. M.S., Japan Advanced Institute of Science and Technology (JAIST) , 1996. Ph.D., Japan Advanced Institute of Science and Technology (JAIST) , 1999. Research Associate, Shimane University, 1999-2007. Assistant Professor, Shimane University, 2007-2008. Associate Professor, Shimane University, 2008-2024. Associate Professor, Iwate Prefectural University, 2024-.
Links Researchers in Rewriting TRS Meeting Rewriting Researchers Forum Logic for Information Science (Toyama laboratory), Research Institute of Electrical Communication, Tohoku University Kurt Godel Society ACIS ACM AISB EATCS IASTED IEEE IFIP ISAI

Back

Last modified: Nov, 29, 2024.
Munehiro Iwami