Makoto Hamana - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2022

Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect HandlersMakoto Hamana. lmcs, 18(2), 2022. [doi]

Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable bindingMakoto Hamana. mscs, 32(4):542-573, April 2022. [doi]

2020

Theory and Practice of Second-Order Rewriting: Foundation, Evolution, and SOLMakoto Hamana. FLOPS 2020: 3-9 [doi]

Polymorphic computation systems: Theory and practice of confluence with call-by-valueMakoto Hamana, Tatsuya Abe 0001, Kentaro Kikuchi. SCP, 187:102322, 2020. [doi]

2019

How to prove decidability of equational theories with second-order computation analyser SOLMakoto Hamana. JFP, 29, 2019. [doi]

2018

2017

How to prove your calculus is decidable: practical applications of second-order algebraic theories and computationMakoto Hamana. PACMPL, 1(ICFP), 2017. [doi]

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic TheoriesMakoto Hamana. lmcs, 13(4), 2017. [doi]

2016

Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic TheoriesMakoto Hamana. RTA 2016: [doi]

2013

Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational LogicMarcelo P. Fiore, Makoto Hamana. lics 2013: 520-529 [doi]

2012

Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in HaskellMakoto Hamana. FLOPS 2012: 136-150 [doi]

2011

Polymorphic Abstract Syntax via Grothendieck ConstructionMakoto Hamana. fossacs 2011: 381-395 [doi]

A foundation for GADTs and inductive families: dependent polynomial functor approachMakoto Hamana, Marcelo P. Fiore. ICFP 2011: 59-70 [doi]

2009

Initial Algebra Semantics for Cyclic Sharing StructuresMakoto Hamana. tlca 2009: 127-141 [doi]

Semantic Labelling for Proving Termination of Combinatory Reduction SystemsMakoto Hamana. wflp 2010: 62-78 [doi]

2007

Higher-order semantic labelling for inductive datatype systemsMakoto Hamana. ppdp 2007: 97-108 [doi]

Bidirectionalization transformation based on automatic derivation of view complement functionsKazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Makoto Hamana, Masato Takeichi. ICFP 2007: 47-58 [doi]

2006

Explicit substitutions and higher-order syntaxNeil Ghani, Tarmo Uustalu, Makoto Hamana. lisp, 19(2-3):263-282, 2006. [doi]

An initial algebra approach to term rewriting systems with variable bindersMakoto Hamana. lisp, 19(2-3):231-262, 2006. [doi]

2005

Universal Algebra for Termination of Higher-Order RewritingMakoto Hamana. RTA 2005: 135-149 [doi]

2004

Free S-Monoids: A Higher-Order Syntax with MetavariablesMakoto Hamana. aplas 2004: 348-363 [doi]

2003

Term rewriting with variable binding: an initial algebra approachMakoto Hamana. ppdp 2003: 148-159 [doi]

2001

A Logic Programming Language Based on Binding AlgebrasMakoto Hamana. tacs 2001: 243-262 [doi]

1997

Equivalence of the Quotient Term Model and the Least Complete Herbrand Model for a Functional Logic LanguageMakoto Hamana. jflp, 1997(1), 1997.

Sign in or sign up to see more results.

runs on WebDSL