Equivalence of the Quotient Term Model and the Least Complete Herbrand Model for a Functional Logic Language. - Makoto Hamana (J. Funct. Log. Program., 1997)

A Logic Programming Language Based on Binding Algebras. - Makoto Hamana (TACS, 2001)

Term rewriting with variable binding: an initial algebra approach. - Makoto Hamana (PPDP, 2003)

Free S-Monoids: A Higher-Order Syntax with Metavariables. - Makoto Hamana (APLAS, 2004)

Universal Algebra for Termination of Higher-Order Rewriting. - Makoto Hamana (RTA, 2005)

Explicit substitutions and higher-order syntax. - Neil Ghani; Tarmo Uustalu; Makoto Hamana (High. Order Symb. Comput., 2006)

An initial algebra approach to term rewriting systems with variable binders. - Makoto Hamana (High. Order Symb. Comput., 2006)

Bidirectionalization transformation based on automatic derivation of view complement functions. - Kazutaka Matsuda; Zhenjiang Hu; Keisuke Nakano 001; Makoto Hamana; Masato Takeichi (ICFP, 2007)

Higher-order semantic labelling for inductive datatype systems. - Makoto Hamana (PPDP, 2007)

Initial Algebra Semantics for Cyclic Sharing Structures. - Makoto Hamana (TLCA, 2009)

Semantic Labelling for Proving Termination of Combinatory Reduction Systems. - Makoto Hamana (WFLP, 2009)

Initial Algebra Semantics for Cyclic Sharing Tree Structures - Makoto Hamana (Log. Methods Comput. Sci., 2010)

Polymorphic Abstract Syntax via Grothendieck Construction. - Makoto Hamana (FoSSaCS, 2011)

A foundation for GADTs and inductive families: dependent polynomial functor approach. - Makoto Hamana; Marcelo P. Fiore (WGP@ICFP, 2011)

Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in Haskell. - Makoto Hamana (FLOPS, 2012)

Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic. - Marcelo P. Fiore; Makoto Hamana (LICS, 2013)

Iteration Algebras for UnQL Graphs and Completeness for Bisimulation. - Makoto Hamana (FICS, 2015)

Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories. - Makoto Hamana (FSCD, 2016)

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories. - Makoto Hamana (Log. Methods Comput. Sci., 2017)

How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation. - Makoto Hamana (Proc. ACM Program. Lang., 2017)

Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation. - Makoto Hamana (FLOPS, 2018)

Confluence Competition 2018. - Takahito Aoto 001; Makoto Hamana; Nao Hirokawa; Aart Middeldorp; Julian Nagele; Naoki Nishida 001; Kiraku Shintani; Harald Zankl (FSCD, 2018)

The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics. - Makoto Hamana; Kazutaka Matsuda; Kazuyuki Asada (Math. Struct. Comput. Sci., 2018)

Modular Termination Checking Theorems for Second-Order Computation. - Makoto Hamana (CoRR, 2019)

How to prove decidability of equational theories with second-order computation analyser SOL. - Makoto Hamana (J. Funct. Program., 2019)

Theory and Practice of Second-Order Rewriting: Foundation, Evolution, and SOL. - Makoto Hamana (FLOPS, 2020)

Polymorphic computation systems: Theory and practice of confluence with call-by-value. - Makoto Hamana; Tatsuya Abe 001; Kentaro Kikuchi (Sci. Comput. Program., 2020)

Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers. - Makoto Hamana (Log. Methods Comput. Sci., 2022)

Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding. - Makoto Hamana (Math. Struct. Comput. Sci., 2022)

Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement. - Koko Muroya; Makoto Hamana (FLOPS, 2024)

Foundations of Haskell's Rewrite Rules Based on Higher-Kinded Polymorphic Rewrite Systems. - Makoto Hamana (SCSS, 2024)