1 citations · 3 across the 4 of their papers we have counts for
5 papers
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers
Makoto Hamana
We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-o…
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
Makoto Hamana
Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. This paper presents an investigation of categorical, algebr…
The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics
Makoto Hamana, Kazutaka Matsuda, Kazuyuki Asada
The aim of this paper is to provide mathematical foundations of a graph transformation language, called UnCAL, using categorical semantics of type theory and fixed points. About tw…
Iteration Algebras for UnQL Graphs and Completeness for Bisimulation
Makoto Hamana
This paper shows an application of Bloom and Esik's iteration algebras to model graph data in a graph database query language. About twenty years ago, Buneman et al. developed a gr…
Initial Algebra Semantics for Cyclic Sharing Tree Structures
Makoto Hamana
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised…