Makoto Hamana

Professor at Department of Computer Science and Networks, Kyushu Institute of Technology
[履歴書(jp) / CV(english)] (@Research map) [JGLOBAL] [DBLP] [Google Scholar]

Research Interests

News

Papers      [List in DBLP]

  1. ReCheck: Automated Contextual Improvement Verifier for Functional Calculi across User-Defined Operational Semantics ,
    (with Kento Emoto), 32nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2026), Lecture Notes in Computer Science 16506, pp. 215-234, Springer, 2026.
    Available: PDF, Paper in Springer, Poster, Talk movie at TACAS 2026.
  2. Foundations of Haskell's Rewrite Rules based on Higher-Kinded Polymorphic Rewrite Systems,
    10th International Symposium on Symbolic Computation in Software Science (SCSS 2024), Lecture Notes in Computer Science 14991, pp. 79-95, Springer, 2024.
  3. Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement,
    (with Koko Muroya), 17th International Symposium on Functional and Logic Programming (FLOPS 2024),
    Available: PDF. Long version
  4. Complete Algebraic Semantics for Second-Order Rewriting Systems based on Abstract Syntax with Variable Binding,
    Mathematical Structures in Computer Science, Cambridge University Press, 2022.
    Available: PDF, Paper in MSCS site,
  5. Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers,
    Logical Methods in Computer Science, Vol. 18, Issue 2, No.8, June 14, 2022.
    Available: Paper in LMCS
  6. Polymorphic computation systems: Theory and practice of confluence with call-by-value
    (with Tatsuya Abe and Kentaro Kikuchi), Science of Computer Programming, Elsevier, Volume 187, 15 February 2020, 102322.
    Available: PDF, Paper in ScienceDirect.
  7. How to prove decidability of equational theories with second-order computation analyser SOL
    Journal of Functional Programming, Cambridge University Press, Vol. 29, e20, 2019.
    Available: PDF, Paper in CambridgeCore.
  8. Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation,
    14th International Symposium on Functional and Logic Programming (FLOPS 2018),
    Lecture Notes in Computer Science 10818, pp.99-115, Springer, 2018. Best Paper Award.
    Available: PDF(Author's version), Slides of my talk.
  9. The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics,
    (with Kazutaka Matsuda and Kazuyuki Asada), Mathematical Structures in Computer Science, Volume 28, Issue 2, pp.287-337, Cambridge University Press, doi:10.1017/S096012951600027X, 2018.
    Available: Paper in MSCS site.
  10. Confluence Competition 2018,
    (with T. Aoto, N. Hirokawa, A. Middeldorp J. Nagele, N. Nishida, K. Shintani, and H. Zankl), 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), the Leibniz International Proceedings in Informatics (LIPIcs), Vol . 108, pp. 32:1-32:5, 2018.
    Available: Paper in DROPS
  11. How to Prove Your Calculus is Decidable: Practical Applications of Second-order Algebraic Theories and Computation,
    Proceedings of the ACM on Programming Languages, Volume 1, Issue ICFP, September 2017, Article No. 22, pp.1-28, ACM Press, 2017.
    Available: Paper in the ACM Digital Library, Slides of my talk. Recorded live streaming of my talk at ICFP'17 (in Oxford University Podcasts).
    Implementation: PolySOL (web interface)
  12. A Functional Implementation of Function-as-Constructor Higher-Order Unification ,
    International Workshop on Unification (UNIF'17), a part of FSCD'17, Oxford, 2017.
    Available: PDF, Slides of a talk at UNIF'17.
  13. Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories,
    Logical Methods in Computer Science, Vol. 13, Issue 4, No.8, pp.1-38, 2017.
    Available: Paper in LMCS
  14. Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories,
    The 1st International Conference on Formal Structures for Computation and Deduction (FSCD'16),
    the Leibniz International Proceedings in Informatics (LIPIcs), Vol . 52, pp.21:1-21:18, 2016.
    Available: PDF, Slides of a talk at FSCD'16.
  15. Iteration Algebras for UnQL Graphs and Completeness for Bisimulation,
    The 10th International Workshop on Fixed Points in Computer Science (FICS'15), Electronic Proceedings in Theoretical Computer Science 191, pp.75-89, 2015.
    Available: PDF.
  16. Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic,
    (with Marcelo Fiore)
    Twenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, (LICS 2013) pp.520-529, IEEE Computer Society, 2013.
    Available: PDF, Slides of a talk at LICS'13.
  17. Correct Looping Arrows from Cyclic Terms: Traced Categorical Interpretation in Haskell,
    11th International Symposium on Functional and Logic Programming (FLOPS 2012),
    Lecture Notes in Computer Science 7294, pp.136-150, Springer, 2012.
    Available: PDF, Slides of a talk at FLOPS'12. Related codes:
  18. A Foundation for GADTs and Inductive Families: Dependent Polynomial Functor Approach,
    (with Marcelo Fiore)
    7th ACM SIGPLAN Workshop on Generic Programming (WGP 2011), pp.59-70, ACM Press, 2011.
    Available: PDF, Slides (at Shonan workshop AIM-DTP'11), Slides (at WGP'11)
  19. Polymorphic Abstract Syntax via Grothendieck Construction,
    14th International Conference on Foundations of Software Science and Computation Structures, (FoSSaCS 2011),
    Lecture Notes in Computer Science 6604, pp.381-395, Springer-Verlag, 2011.
    Available: PDF, Slides of a talk at FoSSaCS'11, Slides of a talk at PPL'13.
  20. Initial Algebra Semantics for Cyclic Sharing Tree Structures,
    Logical Methods in Computer Science, Volume 6, Issue 3, No.15, 2010.
    Available: Paper in LMCS
    Related codes:
    1. Graph algorithms based on depth-first search on cyclic sharing trees in Haskell
    2. A dependent type defintion of cyclic sharing trees in Agda
  21. Semantic Labelling for Proving Termination of Combinatory Reduction Systems,
    18th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2009),
    Lecture Notes in Computer Science 5979, pp.62-78, Springer-Verlag, 2010.
    Available: PDF, Slides of a talk at WFLP'09.
  22. Initial Algebra Semantics for Cyclic Sharing Structures,
    Ninth International Conference on Typed Lambda Calculi and Applications (TLCA 2009),
    Lecture Notes in Computer Science 5608, pp.127-141, Springer-Verlag, 2009.
    Available: Slides of a talk at TLCA'09.
  23. 補関数の生成による複製機能付きプログラムの自動双方向化 ,
    (with 松田 一孝, 胡 振江, 中野 圭介, 武市 正人)
    コンピュータソフトウェア, Vol. 26, No. 2, pp. 56-75, 2009.
    Available: Paper in J-STAGE
  24. Bidirectionalization Transformation based on Automatic Derivation of View Complement Functions,
    (with Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Masato Takeichi)
    12th ACM SIGPLAN International Conference on Functional Programming (ICFP 2007),
    ACM Press, pp.47-58, 2007.
    Available: Paper in the ACM Digital Library, PDF.
  25. Higher-Order Semantic Labelling for Inductive Datatype Systems,
    Ninth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming
    (PPDP 2007), ACM Press, pp.97-108, 2007.
    Available: Paper in the ACM Digital Library, PDF, Slides of a talk at PPDP'07.
  26. An Initial Algebra Approach to Term Rewriting Systems with Variable Binders,
    Higher-Order and Symbolic Computation, Springer Science+Business Media,
    Volume 19, Issue 2/3, pp. 231-262, 2006.
    Available: Paper at Springer Link
  27. Explicit Substitutions and Higher-Order Syntax,
    (with Neil Ghani, Tarmo Uustalu)
    Higher-Order and Symbolic Computation, Springer Science+Business Media,
    Volume 19, Issue 2/3, pp. 263-282, 2006.
    Available: Paper at Springer Link
  28. Representing Cyclic Structures as Nested Datatypes,
    (with N. Ghani, T. Uustalu, V. Vene)
    Proceedings of 7th Symposium on Trends in Functional Programming (TFP 2006),
    pp. 173-188, University of Nottingham, April 2006.
    Available: PDF
  29. 高階書換え系の停止性のための代数モデル (第12回日本ソフトウェア科学会論文賞),
    コンピュータソフトウェア, Vol. 23, No. 2, pp. 142-156, 岩波書店, 2006.
    Available: Paper in J-STAGE
  30. Σモノイド─メタ変数と明示的環境を持つ高階構文,
    コンピュータソフトウェア, Vol. 22, No. 3, pp. 201-207, 岩波書店, 2005.
    Available: Paper in J-STAGE
  31. Universal Algebra for Termination of Higher-Order Rewriting,
    16th International Conference on Rewriting Techniques and Applications (RTA'05),
    Lecture Notes in Computer Science 3467, Springer, pp. 135-149, 2005.
    Available: PDF, Slides of a talk at RTA'05
  32. Free Σ-monoids: A Higher-Order Syntax with Metavariables,
    The Second Asian Symposium on Programming Languages and Systems (APLAS 2004),
    Lecture Notes in Computer Science 3202, Springer, pp. 348-363, 2004.
    Available: PDF
  33. Term Rewriting with Variable Binding: An Initial Algebra Approach,
    Fifth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming
    (PPDP 2003), ACM Press, pp.148-159, 2003.
    Available: Paper in the ACM Digital Library, DVI, PS
  34. A Logic Programming Language based on Binding Algebras,
    International Symposium on Theoretical Aspects of Computer Software (TACS 2001),
    Lecture Notes in Computer Science 2215, Springer, pp. 243-262, 2001.
    Abstract: English
  35. Semantics for Interactive Higher-order Functional-logic Programming,
    Doctoral Thesis, University of Tsukuba, 1998.
    Abstract: English
    Available: PDF, PS
  36. Equivalence of the Quotient Term Model and the Least Complete Herbrand Model for a Functional-Logic Language,
    Journal of Functional and Logic Programming, Vol. 1997, No. 1, 1997.
    Abstract: Japanese
    Available: Journal page
  37. Algebraic Semantics for Higher-Order Functional-Logic Programming,
    Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming (FLOPS'96), World Scientific, Singapore, pp. 194-209, 1996.
    Abstract: English, Japanese
    Available: DVI, PS, PDF
  38. 項書換え系としての論理プログラム.
    (with 鈴木大郎)
    コンピュータソフトウェア, Vol. 14, No. 6, pp. 29-43, 岩波書店, 1997.
    Available: Paper in J-STAGE
  39. M. Hamana, Semantics of a Functional-Logic Programming Language,
    Master Thesis, University of Tsukuba, 1995.
  40. 作用型項書換え系に基づく関数論理型言語の設計と実装 (A Design and Implementation of a Functional-Logic Language Based on Applicative Term Rewriting Systems),
    (with T. Nishioka, K. Nakahara, A. Middeldorp and T.Ida)
    情報処理学会論文誌 (Transactions of Information Processing Society of Japan), Vol. 36, No. 8, 1897-1905, in Japanese, pp. 1897-1905, 1995.
    Abstract: Japanese
    Available: PDF

    Some Talks

  • Dependent Polymorphism
    27th Conf. Japan Society for Software Science and Technology (JSSST'10),
    15 September, 2010, Tokyo. Slides.
  • Another Initial Algebra Semantics of Inductive Families for Programming
    Dependently Typed Programming 2010, associated with LICS,
    10 July, 2010, Edinburgh.
  • Inductive Cyclic Sharing Data Structures
    30 June, 2008. Slides.
  • What is the Category for Haskell?
    CAPS, IPL, University of Tokyo, 23 October, 2007. Slides.
  • Representing Cyclic Structures as Nested Datatypes,

    Book

    Miscellaneous

    • M. Hamana. Simple beta0-Unification for Terms with Context Holes, UNIF 2002, July 2002, Paper, Slides.
    • M. Hamana. Interactive Functional-logic Programming by Conditional Term Rewriting Systems,
      Proceedings of JSSST Workshop on Programming and Programming Languages (PPL'99), 1999.
      Available: DVI, PS
    • M. Hamana, Term rewriting with sequences,
      Proceedings of the First International Theorema Workshop, Report Series No. 97-20. RISC-Linz, Johannes Kepler University, 1997.
      Available: DVI, PS

    Address

    Kyushu Institute of Technology, 680-4 Kawazu, Iizuka, Fukuoka 820-8502, JAPAN
    E-mail: hamana ## csn.kyutech.ac.jp (replace ## with @)
    WWW: solweb.mydns.jp/hamana/

    Links to the places I have worked/stayed