• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2011 Fiscal Year Final Research Report

Dependable Data Structures by Dependent Types

Research Project

  • PDF
Project/Area Number 22700004
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionGunma University

Principal Investigator

HAMANA Makoto  群馬大学, 大学院・工学研究科, 助教 (90334135)

Project Period (FY) 2010 – 2011
Keywordsデータ構造 / 情報基礎 / 自動定理証明 / 関数プログラム
Research Abstract

Dependent types are data types which ensure more precise properties of data thanordinary data types. Using dependent types, we develop a theory and applications ofdependable data structures, aiming to establish foundations of reliable computer softwares.

  • Research Products

    (15 results)

All 2012 2011 2010 Other

All Journal Article (5 results) (of which Peer Reviewed: 5 results) Presentation (8 results) Book (1 results) Remarks (1 results)

  • [Journal Article] Correct Looping Arrows from Cyclic Terms: Traced Categorical Interpretation in Haskell. Functional and Logic Programming, Lecture Notes in Computer Science2012

    • Author(s)
      M. Hamana
    • Journal Title

      Springe-Verlagr

      Volume: 7294 Pages: 136-150

    • Peer Reviewed
  • [Journal Article] A Foundation for GADTs and Inductive Families: Dependent Polynomial Functor Approach, Proc. of 7th ACM SIGPLAN International Workshop on Generic Porgramming2011

    • Author(s)
      Makoto Hamana, and Marcelo Fiore.
    • Journal Title

      ACM Press

      Pages: 59-70

    • Peer Reviewed
  • [Journal Article] Polymorphic Abstract Syntax via Grothendieck Construction. Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science2011

    • Author(s)
      M. Hamana
    • Journal Title

      Springer-Verlag

      Volume: 6604 Pages: 381-395

    • Peer Reviewed
  • [Journal Article] Initial Algebra Semantics for Cyclic Sharing Tree Structures.2010

    • Author(s)
      M. Hamana
    • Journal Title

      Logical Methods in Computer Science

      Volume: Volume 6, Issue(3:15) Pages: 1-23

    • Peer Reviewed
  • [Journal Article] Semantic Labelling for Proving Termination of Combinatory Reduction Systems, Functional and Constraint Logic Programming, Lecture Notes in Computer Science2010

    • Author(s)
      M. Hamana
    • Journal Title

      Springer-Verlag

      Volume: 5979 Pages: 62-78

    • Peer Reviewed
  • [Presentation] Constructing Correct Looping Arrows from Cyclic Terms: Traced Categorical Interpretation in Haskell2012

    • Organizer
      Symposium on Symbolic Computation and Software Science
    • Place of Presentation
      筑波大学
    • Year and Date
      2012-06-03
  • [Presentation] Correct Looping Arrows from Cyclic Terms:Traced Categorica l Interpretation in Haskell2012

    • Organizer
      11th International Symposium on Functional and Logic Programming (FLOPS'12)
    • Place of Presentation
      神戸大学
    • Year and Date
      2012-05-23
  • [Presentation] Constructing Correct Looping Arrows from Cyclic Terms: Traced Categorical Interpretation in Haskell2012

    • Organizer
      14th JSSST Workshop on Programming and Programming Languages(PPL'12)
    • Place of Presentation
      南紀白浜
    • Year and Date
      2012-03-08
  • [Presentation] A Foundation for GADTs and Inductive Families: Dependent Polynomial Functor Approach2011

    • Organizer
      ACM SIGPLAN International Workshop on Generic Porgramming (WGP'11)
    • Place of Presentation
      National Institute of Informatics
    • Year and Date
      20110000
  • [Presentation] Polymorphic Abstract Syntax via Grothendieck Construction2011

    • Organizer
      14th International Conference on Foundations of Software Science and Computation Structures
    • Place of Presentation
      Saarbruecken
    • Year and Date
      20110000
  • [Presentation] Dependent Polynomial Functors for Inductive Families2011

    • Organizer
      Shonan Meeting on Dependently Typed Programming and Agda Implementors
    • Place of Presentation
      湘南国際村
    • Year and Date
      2011-09-14
  • [Presentation] Dependent Polymorphism2010

    • Organizer
      日本ソフトウェア科学会第27回大会
    • Year and Date
      20100900
  • [Presentation] Representing Polymorphic Higher-Order Abstract Syntax in Agda and Presheaves2010

    • Organizer
      6th Theorem Proving and Provers eeting (TPP'10)
    • Place of Presentation
      名古屋大学
    • Year and Date
      2010-11-25
  • [Book] チューリングを読む-コンピュータサイエンスの金字塔を楽しもう2012

    • Author(s)
      チャールズ・ペゾルド (著), 井田哲雄, 鈴木大郎, 奥居哲, 浜名誠, 山田俊行 (訳)
    • Total Pages
      612
    • Publisher
      日経BP社
  • [Remarks]

    • URL

      http://www.cs.gunma-u.ac.jp/~hamana/

URL: 

Published: 2014-08-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi