default search action
Makoto Hamana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Koko Muroya
, Makoto Hamana
Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement. FLOPS 2024: 31-61 - [c18]Makoto Hamana:
Foundations of Haskell's Rewrite Rules Based on Higher-Kinded Polymorphic Rewrite Systems. SCSS 2024: 79-95 - 2022
- [j11]Makoto Hamana
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers. Log. Methods Comput. Sci. 18(2) (2022) - [j10]Makoto Hamana
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding. Math. Struct. Comput. Sci. 32(4): 542-573 (2022) - 2020
- [j9]Makoto Hamana
Polymorphic computation systems: Theory and practice of confluence with call-by-value. Sci. Comput. Program. 187: 102322 (2020) - [c17]Makoto Hamana:
Theory and Practice of Second-Order Rewriting: Foundation, Evolution, and SOL. FLOPS 2020: 3-9
2010 – 2019
- 2019
- [j8]Makoto Hamana
How to prove decidability of equational theories with second-order computation analyser SOL. J. Funct. Program. 29: e20 (2019) - [i3]Makoto Hamana:
Modular Termination Checking Theorems for Second-Order Computation. CoRR abs/1912.03434 (2019) - 2018
- [j7]Makoto Hamana
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics. Math. Struct. Comput. Sci. 28(2): 287-337 (2018) - [c16]Makoto Hamana:
Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation. FLOPS 2018: 99-115 - [c15]Takahito Aoto, Makoto Hamana, Nao Hirokawa
Confluence Competition 2018. FSCD 2018: 32:1-32:5 - 2017
- [j6]Makoto Hamana:
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories. Log. Methods Comput. Sci. 13(4) (2017) - [j5]Makoto Hamana:
How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation. Proc. ACM Program. Lang. 1(ICFP): 22:1-22:28 (2017) - [i2]Makoto Hamana:
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories. CoRR abs/1705.06430 (2017) - 2016
- [c14]Makoto Hamana:
Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories. FSCD 2016: 21:1-21:18 - 2015
- [c13]Makoto Hamana:
Iteration Algebras for UnQL Graphs and Completeness for Bisimulation. FICS 2015: 75-89 - [i1]Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada:
The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics. CoRR abs/1511.08851 (2015) - 2013
- [c12]Marcelo P. Fiore, Makoto Hamana:
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic. LICS 2013: 520-529 - 2012
- [c11]Makoto Hamana:
Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in Haskell. FLOPS 2012: 136-150 - 2011
- [c10]Makoto Hamana:
Polymorphic Abstract Syntax via Grothendieck Construction. FoSSaCS 2011: 381-395 - [c9]Makoto Hamana, Marcelo P. Fiore:
A foundation for GADTs and inductive families: dependent polynomial functor approach. WGP@ICFP 2011: 59-70 - 2010
- [j4]Makoto Hamana:
Initial Algebra Semantics for Cyclic Sharing Tree Structures. Log. Methods Comput. Sci. 6(3) (2010)
2000 – 2009
- 2009
- [c8]Makoto Hamana:
Initial Algebra Semantics for Cyclic Sharing Structures. TLCA 2009: 127-141 - [c7]Makoto Hamana:
Semantic Labelling for Proving Termination of Combinatory Reduction Systems. WFLP 2009: 62-78 - 2007
- [c6]Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano
Bidirectionalization transformation based on automatic derivation of view complement functions. ICFP 2007: 47-58 - [c5]Makoto Hamana:
Higher-order semantic labelling for inductive datatype systems. PPDP 2007: 97-108 - 2006
- [j3]Makoto Hamana:
An initial algebra approach to term rewriting systems with variable binders. High. Order Symb. Comput. 19(2-3): 231-262 (2006) - [j2]Neil Ghani, Tarmo Uustalu
Explicit substitutions and higher-order syntax. High. Order Symb. Comput. 19(2-3): 263-282 (2006) - 2005
- [c4]Makoto Hamana:
Universal Algebra for Termination of Higher-Order Rewriting. RTA 2005: 135-149 - 2004
- [c3]Makoto Hamana:
Free S-Monoids: A Higher-Order Syntax with Metavariables. APLAS 2004: 348-363 - 2003
- [c2]Makoto Hamana:
Term rewriting with variable binding: an initial algebra approach. PPDP 2003: 148-159 - 2001
- [c1]Makoto Hamana:
A Logic Programming Language Based on Binding Algebras. TACS 2001: 243-262
1990 – 1999
- 1997
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: