| Bidirectionalization transformation based on automatic derivation of view complement functions K Matsuda, Z Hu, K Nakano, M Hamana, M Takeichi ACM SIGPLAN Notices 42 (9), 47-58, 2007 | 168 | 2007 |
| Free Σ-monoids: A higher-order syntax with metavariables M Hamana Asian Symposium on Programming Languages and Systems, 348-363, 2004 | 59 | 2004 |
| Representing cyclic structures as nested datatypes N Ghani, M Hamana, T Uustalu, V Vene Proc. of 7th Symp. on Trends in Functional Programming, TFP 2006, 2006 | 39 | 2006 |
| Universal algebra for termination of higher-order rewriting M Hamana International Conference on Rewriting Techniques and Applications, 135-149, 2005 | 33 | 2005 |
| Explicit substitutions and higher-order syntax N Ghani, T Uustalu Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about …, 2003 | 31 | 2003 |
| Higher-order semantic labelling for inductive datatype systems M Hamana Proceedings of the 9th ACM SIGPLAN International Conference on Principles …, 2007 | 30 | 2007 |
| A foundation for GADTs and inductive families: dependent polynomial functor approach M Hamana, M Fiore Proceedings of the seventh ACM SIGPLAN workshop on Generic programming, 59-70, 2011 | 29 | 2011 |
| Initial algebra semantics for cyclic sharing tree structures M Hamana Logical Methods in Computer Science 6, 2010 | 28 | 2010 |
| Term rewriting with variable binding: An initial algebra approach M Hamana Proceedings of the 5th ACM SIGPLAN international conference on Principles …, 2003 | 28 | 2003 |
| Multiversal polymorphic algebraic theories: syntax, semantics, translations, and equational logic M Fiore, M Hamana 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 520-529, 2013 | 23 | 2013 |
| How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation M Hamana Proceedings of the ACM on Programming Languages 1 (ICFP), 1-28, 2017 | 22 | 2017 |
| Term rewriting with sequences M Hamana Proc. of the First Int. Theorema Workshop. Technical report 97, 20, 1997 | 22 | 1997 |
| Polymorphic abstract syntax via Grothendieck construction M Hamana Foundations of Software Science and Computational Structures: 14th …, 2011 | 18 | 2011 |
| A logic programming language based on binding algebras M Hamana Theoretical Aspects of Computer Software: 4th International Symposium, TACS …, 2001 | 17 | 2001 |
| How to prove decidability of equational theories with second-order computation analyser SOL M Hamana Journal of Functional Programming 29, e20, 2019 | 12 | 2019 |
| Polymorphic rewrite rules: Confluence, type inference, and instance validation M Hamana International Symposium on Functional and Logic Programming, 99-115, 2018 | 12 | 2018 |
| Semantic labelling for proving termination of combinatory reduction systems M Hamana International Workshop on Functional and Constraint Logic Programming, 62-78, 2009 | 10 | 2009 |
| Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories M Hamana 1st International Conference on Formal Structures for Computation and …, 2016 | 9 | 2016 |
| Bidirectionalizing programs with duplication through complementary function derivation K Matsuda, Z Hu, K Nakano, M Hamana, M Takeichi Computer Software 26 (2), 56-75, 2009 | 9 | 2009 |
| An initial algebra approach to term rewriting systems with variable binders M Hamana Higher-order and symbolic computation 19, 231-262, 2006 | 9 | 2006 |
Kazutaka MatsudaTohoku UniversityPatvirtintas el. paštas ecei.tohoku.ac.jp
