Makoto Hamana

Assistant Professor at Department of Computer Science, Gunma University
履歴書: PDF
研究内容の紹介: 「ソフトウェアを科学する」(群馬県の新聞に掲載された記事 )

Research Interests

• General: mathematical models of programing languages
• Functional programming with dependent types, especially Haskell and Agda
• Higher-order abstract syntax and Fiore-Plotkin-Turi style semantics
• Higher-order rewriting and its categorical algebraic semantics

News

• My new paper with Marcelo Fiore is accepted by LICS'13.
• Won 2012 Yokoyama Award in Science and Technology (an award in Gunma University)
• We have published the Japanese translation of a book on Turing's original paper on computablity.
• Proceedings of Workshop on Higher-Order Rewriting (HOR'12) is available.

Papers      [List in DBLP]

• Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic,
  Twenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013), to appear.
• Makoto Hamana,
  Correct Looping Arrows from Cyclic Terms: Traced Categorical Interpretation in Haskell,
  11th International Symposium on Functional and Logic Programming (FLOPS 2012),
  Lecture Notes in Computer Science 7294, p.136-150, Springer-Verlag, 2012.
  Available: PDF, Slides of a talk at FLOPS'12. Related codes:
  • Case1: cyclic data structure
  • Case2: circuit
  • Case3: recursive function
  • Case3': recursive function with effect
• Makoto Hamana, Marcelo Fiore,
  A Foundation for GADTs and Inductive Families: Dependent Polynomial Functor Approach,
  7th ACM SIGPLAN Workshop on Generic Programming (WGP 2011), p.59-70, ACM Press, 2011.
  Available: PDF, Slides (at Shonan workshop AIM-DTP'11), Slides (at WGP'11)
• M. Hamana, Polymorphic Abstract Syntax via Grothendieck Construction,
  14th International Conference on Foundations of Software Science and Computation Structures,
  (FoSSaCS 2011),
  Lecture Notes in Computer Science 6604, p.381-395, Springer-Verlag, 2011.
  Available: PDF, Slides of a talk at FoSSaCS'11, Slides of a talk at PPL'13.
• M. Hamana, Initial Algebra Semantics for Cyclic Sharing Tree Structures,
  Logical Methods in Computer Science, Volume 6, Issue 3, 2010.
  Available: Paper in LMCS
  Related codes:
  1. Graph algorithms based on depth-first search on cyclic sharing trees in Haskell
  2. 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),
  Lecture Notes in Computer Science 5979, p.62-78, Springer-Verlag, 2010.
  Available: PDF, Slides of a talk at WFLP'09.
• 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: Slides of a talk at TLCA'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
  Available: PDF
  

Some Talks

• Representing Polymorphic Higher-Order Abstract Syntax in Agda and Presheaves
  6th Theorem Proving and Provers Meeting (TPP'10),
  25 November, 2010, Nagoya University.
• Dependent Polymorphism
  27th Conf. Japan Society for Software Science and Technology (JSSST'10),
  15 September, 2010, Tokyo. Slides.
• Another Initial Algebra Semantics of Inductive Families for Programming
  Dependently Typed Programming 2010, associated with LICS,
  10 July, 2010, Edinburgh.
• Inductive Cyclic Sharing Data Structures
  30 June, 2008. Slides.
• What is the Category for Haskell?
  CAPS, IPL, University of Tokyo, 23 October, 2007. Slides.
• Representing Cyclic Structures as Nested Datatypes,
  
  • 23th Conf. Japan Society for Software Science and Technology (JSSST'06),
    15 September, 2006,
    Takahashi Award for the best presentation and paper (第23回高橋奨励賞)
    
  • 30th Tokyo Programming Seminar, 23 May, 2006.
    Available: Slides, Haskell code

Book

• 井田哲雄, 浜名誠 (共著), 計算モデル論入門 ―チューリング機械からラムダ計算へ―,
  Information Science & Engineering F5 , A5判, 136頁, 1400円, ISBN4-7819-1135-8, サイエンス社.
  [どこから買える？]
  • サポートページ
  • 参考資料 「型付きラムダ計算の停止性」 (2007.12.13改訂)

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

Awards

• 日本ソフトウェア科学会 第12回 論文賞 (JSSST 12th best paper Award), 2008.5.29.
• 日本ソフトウェア科学会 第23回 高橋奨励賞 (JSSST 23th Takahashi Award), 2007.6.13.

Academic Activity

• An organiser of 29th TRS Meeting, 28-29th Feb. 2008, University of Tokyo.

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

• SCORE at Tsukuba University
  
• Sato's lab. at Kyoto University
• LFCS, University of Edinburgh
• IPL at University of Tokyo