 | 2012 |
| 14 |  | Makoto Hamana:
Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in Haskell.
FLOPS 2012: 136-150 |
| 2011 |
| 13 |  | Makoto Hamana:
Polymorphic Abstract Syntax via Grothendieck Construction.
FOSSACS 2011: 381-395 |
| 2010 |
| 12 |  | Makoto Hamana:
Initial Algebra Semantics for Cyclic Sharing Tree Structures
Logical Methods in Computer Science 6(3): (2010) |
| 2009 |
| 11 |  | Makoto Hamana:
Initial Algebra Semantics for Cyclic Sharing Structures.
TLCA 2009: 127-141 |
| 10 |  | Makoto Hamana:
Semantic Labelling for Proving Termination of Combinatory Reduction Systems.
WFLP 2009: 62-78 |
| 2007 |
| 9 |  | Kazutaka Matsuda,
Zhenjiang Hu,
Keisuke Nakano,
Makoto Hamana,
Masato Takeichi:
Bidirectionalization transformation based on automatic derivation of view complement functions.
ICFP 2007: 47-58 |
| 8 |  | Makoto Hamana:
Higher-order semantic labelling for inductive datatype systems.
PPDP 2007: 97-108 |
| 2006 |
| 7 |  | Makoto Hamana:
An initial algebra approach to term rewriting systems with variable binders.
Higher-Order and Symbolic Computation 19(2-3): 231-262 (2006) |
| 6 |  | Neil Ghani,
Tarmo Uustalu,
Makoto Hamana:
Explicit substitutions and higher-order syntax.
Higher-Order and Symbolic Computation 19(2-3): 263-282 (2006) |
| 2005 |
| 5 |  | Makoto Hamana:
Universal Algebra for Termination of Higher-Order Rewriting.
RTA 2005: 135-149 |
| 2004 |
| 4 |  | Makoto Hamana:
Free S-Monoids: A Higher-Order Syntax with Metavariables.
APLAS 2004: 348-363 |
| 2003 |
| 3 |  | Makoto Hamana:
Term rewriting with variable binding: an initial algebra approach.
PPDP 2003: 148-159 |
| 2001 |
| 2 |  | Makoto Hamana:
A Logic Programming Language Based on Binding Algebras.
TACS 2001: 243-262 |
| 1997 |
| 1 |  | Makoto Hamana:
Equivalence of the Quotient Term Model and the Least Complete Herbrand Model for a Functional Logic Language.
Journal of Functional and Logic Programming 1997(1): (1997) |