Makoto Hamana

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 14

Top Topics

Algebraic Operations

Equational Theories

Top Venues

Math. Struct. Comput. Sci.

Publications

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