Makoto Hamana

34 papers A* 1A 1B 4C 2Misc 4Journal 14Unranked 8
YearRankTypeTitle / Venue / Authors
2026 — conf
ReCheck: Automated Contextual Improvement Verifier for Functional Calculi across User-Defined Operational Semantics.
TACAS (2)
Makoto Hamana, Kento Emoto
2024 — conf
Foundations of Haskell's Rewrite Rules Based on Higher-Kinded Polymorphic Rewrite Systems.
SCSS
Makoto Hamana
2024 Misc conf
Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement.
FLOPS
Koko Muroya, Makoto Hamana
2022 J jnl
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding.
Math. Struct. Comput. Sci.
Makoto Hamana
2022 J jnl
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers.
Log. Methods Comput. Sci.
Makoto Hamana
2020 J jnl
Polymorphic computation systems: Theory and practice of confluence with call-by-value.
Sci. Comput. Program.
Makoto Hamana, Tatsuya Abe, Kentaro Kikuchi
2020 Misc conf
Theory and Practice of Second-Order Rewriting: Foundation, Evolution, and SOL.
FLOPS
Makoto Hamana
2019 J jnl
How to prove decidability of equational theories with second-order computation analyser SOL.
J. Funct. Program.
Makoto Hamana
2019 J jnl
Modular Termination Checking Theorems for Second-Order Computation.
CoRR
Makoto Hamana
2018 B conf
Confluence Competition 2018.
FSCD
Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl
2018 Misc conf
Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation.
FLOPS
Makoto Hamana
2018 J jnl
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics.
Math. Struct. Comput. Sci.
Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada
2017 J jnl
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories.
CoRR
Makoto Hamana
2017 J jnl
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories.
Log. Methods Comput. Sci.
Makoto Hamana
2017 J jnl
How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation.
Proc. ACM Program. Lang.
Makoto Hamana
2016 B conf
Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories.
FSCD
Makoto Hamana
2015 — conf
Iteration Algebras for UnQL Graphs and Completeness for Bisimulation.
FICS
Makoto Hamana
2015 J jnl
The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics.
CoRR
Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada
2013 A* conf
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic.
LICS
Marcelo P. Fiore, Makoto Hamana
2012 Misc conf
Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in Haskell.
FLOPS
Makoto Hamana
2011 — conf
A foundation for GADTs and inductive families: dependent polynomial functor approach.
WGP@ICFP
Makoto Hamana, Marcelo P. Fiore
2011 B conf
Polymorphic Abstract Syntax via Grothendieck Construction.
FoSSaCS
Makoto Hamana
2010 J jnl
Initial Algebra Semantics for Cyclic Sharing Tree Structures
Log. Methods Comput. Sci.
Makoto Hamana
2009 — conf
Initial Algebra Semantics for Cyclic Sharing Structures.
TLCA
Makoto Hamana
2009 — conf
Semantic Labelling for Proving Termination of Combinatory Reduction Systems.
WFLP
Makoto Hamana
2007 A conf
Bidirectionalization transformation based on automatic derivation of view complement functions.
ICFP
Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Makoto Hamana, Masato Takeichi
2007 C conf
Higher-order semantic labelling for inductive datatype systems.
PPDP
Makoto Hamana
2006 J jnl
An initial algebra approach to term rewriting systems with variable binders.
High. Order Symb. Comput.
Makoto Hamana
2006 J jnl
Explicit substitutions and higher-order syntax.
High. Order Symb. Comput.
Neil Ghani, Tarmo Uustalu, Makoto Hamana
2005 — conf
Universal Algebra for Termination of Higher-Order Rewriting.
RTA
Makoto Hamana
2004 B conf
Free S-Monoids: A Higher-Order Syntax with Metavariables.
APLAS
Makoto Hamana
2003 C conf
Term rewriting with variable binding: an initial algebra approach.
PPDP
Makoto Hamana
2001 — conf
A Logic Programming Language Based on Binding Algebras.
TACS
Makoto Hamana
1997 J jnl
Equivalence of the Quotient Term Model and the Least Complete Herbrand Model for a Functional Logic Language.
J. Funct. Log. Program.
Makoto Hamana