Makoto Hamana

According to our database, Makoto Hamana authored at least 31 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Foundations of Haskell's Rewrite Rules Based on Higher-Kinded Polymorphic Rewrite Systems.

Makoto Hamana

Proceedings of the Symbolic Computation in Software Science - 10th International Symposium, 2024

Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement.

Koko Muroya, Makoto Hamana

Proceedings of the Functional and Logic Programming - 17th International Symposium, 2024

2022

Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding.

Makoto Hamana

Math. Struct. Comput. Sci., April, 2022

Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers.

Makoto Hamana

Log. Methods Comput. Sci., 2022

2020

Polymorphic computation systems: Theory and practice of confluence with call-by-value.

Makoto Hamana, Tatsuya Abe, Kentaro Kikuchi

Sci. Comput. Program., 2020

Theory and Practice of Second-Order Rewriting: Foundation, Evolution, and SOL.

Makoto Hamana

Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

2019

How to prove decidability of equational theories with second-order computation analyser SOL.

Makoto Hamana

J. Funct. Program., 2019

Modular Termination Checking Theorems for Second-Order Computation.

Makoto Hamana

CoRR, 2019

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

Confluence Competition 2018.

Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation.

Makoto Hamana

Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

2017

How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation.

Makoto Hamana

Proc. ACM Program. Lang., 2017

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories.

Makoto Hamana

Log. Methods Comput. Sci., 2017

2016

Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories.

Makoto Hamana

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015

Iteration Algebras for UnQL Graphs and Completeness for Bisimulation.

Makoto Hamana

Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

2013

Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic.

Marcelo P. Fiore, Makoto Hamana

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in Haskell.

Makoto Hamana

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011

A foundation for GADTs and inductive families: dependent polynomial functor approach.

Makoto Hamana, Marcelo P. Fiore

Proceedings of the seventh ACM SIGPLAN workshop on Generic programming, 2011

Polymorphic Abstract Syntax via Grothendieck Construction.

Makoto Hamana

Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010

Initial Algebra Semantics for Cyclic Sharing Tree Structures

Makoto Hamana

Log. Methods Comput. Sci., 2010

2009

Semantic Labelling for Proving Termination of Combinatory Reduction Systems.

Makoto Hamana

Proceedings of the Functional and Constraint Logic Programming, 2009

Initial Algebra Semantics for Cyclic Sharing Structures.

Makoto Hamana

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

2007

Higher-order semantic labelling for inductive datatype systems.

Makoto Hamana

Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2007

Bidirectionalization transformation based on automatic derivation of view complement functions.

Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Makoto Hamana, Masato Takeichi

Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, 2007

2006

An initial algebra approach to term rewriting systems with variable binders.

Makoto Hamana

High. Order Symb. Comput., 2006

Explicit substitutions and higher-order syntax.

Neil Ghani, Tarmo Uustalu, Makoto Hamana

High. Order Symb. Comput., 2006

2005

Universal Algebra for Termination of Higher-Order Rewriting.

Makoto Hamana

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004

Free S-Monoids: A Higher-Order Syntax with Metavariables.

Makoto Hamana

Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2003

Term rewriting with variable binding: an initial algebra approach.

Makoto Hamana

Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

2001

A Logic Programming Language Based on Binding Algebras.

Makoto Hamana

Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

1997

Equivalence of the Quotient Term Model and the Least Complete Herbrand Model for a Functional Logic Language.

Makoto Hamana

J. Funct. Log. Program., 1997