Makoto Hamana
Assistant Professor at Department of Computer Science,
Gunma University
Curriculum Vitae: PDF
研究内容の紹介:
「ソフトウェアを科学する」(群馬県の新聞に掲載された記事 )
-
Research Interests
- Mathematically structured programming by
dependent types
- Functional programming, especially
Haskell and
Agda
- Higher-order abstract syntax and Fiore-Plotkin-Turi style semantics
- Higher-order rewriting and its categorical algebraic semantics
-
Awards
Papers
[List in DBLP]
- M. Hamana, Initial Algebra Semantics for Cyclic Sharing Structures,
Ninth International Conference on Typed Lambda Calculi and Applications
(TLCA 2009),
Lecture Notes in Computer Science 5608, p.127-141,
Springer-Verlag, 2009.
Available: PDF,
Slides of a talk at TLCA'09.
Related codes:
- Graph algorithms based on depth-first search
on cyclic sharing trees in Haskell
- A dependent type defintion of
cyclic sharing trees in Agda
- M. Hamana, Semantic Labelling for Proving Termination of Combinatory Reduction Systems,
18th International Workshop on Functional and
(Constraint) Logic Programming
(WFLP 2009),
to appear in Lecture Notes in Computer Science,
Springer-Verlag.
Available:
PDF,
Slides of a talk at WFLP'09.
- Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Makoto Hamana, Masato Takeichi,
Bidirectionalization Transformation based on Automatic Derivation of View Complement Functions,
12th ACM SIGPLAN International Conference on Functional Programming (ICFP 2007),
ACM Press, p.47-58, 2007.
Available: Paper in the ACM Digital Library,
PDF.
- M. Hamana, Higher-Order Semantic Labelling for Inductive Datatype Systems,
Ninth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming
(PPDP 2007),
ACM Press, p.97-108, 2007.
Available: Paper in the ACM Digital Library,
PDF,
Slides of a talk at PPDP'07.
- M. Hamana, An Initial Algebra Approach to Term Rewriting Systems with Variable Binders,
Higher-Order and Symbolic Computation, Springer Science+Business Media,
Volume 19, Issue 2/3, p. 231-262, 2006.
- Neil Ghani, Tarmo Uustalu, Makoto Hamana,
Explicit Substitutions and Higher-Order Syntax,
Higher-Order and Symbolic Computation, Springer Science+Business Media,
Volume 19, Issue 2/3, p. 263-282, 2006.
- N. Ghani, M. Hamana, T. Uustalu, V. Vene.
Representing Cyclic Structures as Nested Datatypes,
Proceedings of 7th Symposium on Trends in Functional Programming
(TFP 2006),
p. 173-188, University of Nottingham, April 2006.
Available: PDF
- 浜名誠, 高階書換え系の停止性のための代数モデル
(第12回日本ソフトウェア科学会論文賞),
コンピュータソフトウェア, Vol. 23, No. 2, p. 142-156, 岩波書店,
2006.
Available: Paper in J-STAGE
- 浜名誠, Σモノイド─メタ変数と明示的環境を持つ高階構文,
コンピュータソフトウェア, Vol. 22, No. 3, p. 201-207, 岩波書店,
2005.
Available: Paper in J-STAGE
- M. Hamana,
Universal Algebra for Termination of Higher-Order Rewriting,
16th International Conference on Rewriting Techniques and Applications
(RTA'05),
Lecture Notes in Computer Science 3467, Springer, p. 135-149, 2005.
Available: PDF,
Slides of a talk at RTA'05
- M. Hamana, Free Σ-monoids: A Higher-Order Syntax with Metavariables,
The Second Asian Symposium on Programming Languages and Systems (APLAS 2004),
Lecture Notes in Computer Science 3202, Springer, p. 348-363, 2004.
Available: PDF
- M. Hamana, Term Rewriting with Variable Binding: An Initial Algebra Approach,
Fifth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming
(PPDP 2003), ACM Press, p.148-159, 2003.
Available: Paper in the ACM Digital Library, DVI, PS
- M. Hamana, A Logic Programming Language based on Binding Algebras,
International Symposium on Theoretical Aspects of Computer Software (TACS 2001),
Lecture Notes in Computer Science 2215, Springer, p. 243-262,
2001.
Abstract: English
Available: PDF
- M. Hamana, Semantics for Interactive Higher-order Functional-logic Programming,
Doctoral Thesis, University of Tsukuba, 1998.
Abstract: English
Available: DVI, PS
- M. Hamana, Equivalence of the Quotient Term Model and the Least Complete Herbrand Model for a Functional-Logic Language,
Journal of Functional and Logic Programming, Vol. 1997, No. 1, 1997.
Abstract: Japanese
Available: Journal page
- M. Hamana, Algebraic Semantics for Higher-Order Functional-Logic Programming,
Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming, World Scientific, Singapore, p. 194-209, 1996.
Abstract: English, Japanese
Available: DVI, PS, PDF
-
鈴木大郎, 浜名誠.
項書換え系としての論理プログラム.
コンピュータソフトウェア, Vol. 14, No. 6, p. 29-43, 岩波書店, 1997.
- M. Hamana, Semantics of a Functional-Logic Programming Language,
Master Thesis, University of Tsukuba, 1995.
- M. Hamana, T. Nishioka, K. Nakahara, A. Middeldorp and T.Ida, 作用型項書換え系に基づく関数論理型言語の設計と実装 (A Design and Implementation of a Functional-Logic Language Based on Applicative Term Rewriting Systems),
情報処理学会論文誌 (Transactions of Information Processing Society of Japan), Vol. 36, No. 8, 1897-1905, in Japanese, p. 1897-1905, 1995.
Abstract: Japanese
-
Book
Talks
-
Inductive Cyclic Sharing Data Structures
30 June, 2008. Slides.
-
Term Syntax for Cyclic Sharing Structures
29th TRS Meeting, 28 February, 2008.
-
関数型プログラマのためのモナド理論
CAPS, IPL, University of Tokyo, 6, 20 November, 4 December, 2007.
-
Representing a Cyclic Sharing Structure as a GADT
IPL seminar, University of Tokyo, 30 October, 2007.
-
What is the Category for Haskell?
CAPS, IPL, University of Tokyo, 23 October, 2007.
Slides.
-
Termination of λx by
Higher-Order Semantic Labelling,
27th TRS Meeting, 25 September, 2006.
-
Representing Cyclic Structures as Nested Datatypes,
-
Higher-Order Semantic Labelling,
26th TRS Meeting, Sakunami, Sendai, 9 February, 2006.
-
明示的代入と高階抽象構文の代数モデル,
第6回「代数学と計算」研究集会, 11月18日, 2005.
Available: Slides
Miscellaneous
- M. Hamana. Simple beta0-Unification for Terms with Context Holes, UNIF 2002, July 2002, Paper, Slides.
- M. Hamana. Interactive Functional-logic Programming by Conditional Term Rewriting Systems,
Proceedings of JSSST Workshop on Programming and Programming Languages (PPL'99), 1999.
Available: DVI, PS
- M. Hamana, Term rewriting with sequences,
Proceedings of the First International Theorema Workshop, Report Series No. 97-20. RISC-Linz, Johannes Kepler University, 1997.
Available: DVI, PS
-
Haskell Programs
- A translation from our inductive cyclic lists to "real" cyclic lists
- A term syntax for a counter circut by ArrowLoop
- Tarjan's algorithm for computing strong connected components
- Graph algorithms based on depth-first search
Academic Activity
Address
Department of Computer Science, Faculty of Engineering,
Gunma University
1-5-1 Tenjincho Kiryu, Gunma 376-8515,
JAPAN
E-mail: hamana ## cs.gunma-u.ac.jp (replace ## with @)
WWW: www.cs.gunma-u.ac.jp/~hamana/
Links to the places I have worked/stayed