研究者業績

桜井 貴文

Takafumi SAKURAI

基本情報

所属
千葉大学 大学院理学研究院数学・情報数理学研究部門 教授
学位
博士(情報学)(2002年3月 京都大学)

J-GLOBAL ID
202001006770737880
researchmap会員ID
B000382613

論文

 7
  • Kentaro Kikuchi, Takafumi Sakurai
    Programming Languages and Systems 120-139 2014年  査読有り
  • Masahiko Sato, Randy Pollack, Helmut Schwichtenberg, Takafumi Sakurai
    Indagationes Mathematicae 24(4) 1073-1104 2013年11月  査読有り
  • Masahiko SATO, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi
    Frontiers of Computer Science in China 2(1) 12-21 2008年3月  査読有り
  • Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi
    Computer Science Logic 484-497 2003年  査読有り
  • TAKAFUMI SAKURAI
    International Journal of Foundations of Computer Science 12(02) 213-244 2001年4月  査読有り
    It is observed that the proof of strong normalizability of typed terms of typed λ-calculus looks like the process of the model construction. The observation is clarified by the works of Hyland and Ong [8], Altenkirch [2], Stefanova and Geuvers [15], and so on. The model of Hyland and Ong is based on PL-category [14] and the model of Altenkirch or Stefanova and Geuvers is a non-categorical model that is specially designed for this purpose. In this paper, we will construct yet another categorical model for the second order λ-calculus — a non-extensional PL-category. To demonstrate the significance of the non-extensional model, we will give a model in which we can carry out the proof of the uniqueness of the β-normal form. The non-extensionality comes from the use of semi-adjoint for interpretation of abstraction and application (uncurry).
  • Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama
    Functional and Logic Programming 359-374 2001年  査読有り
  • Masahiko Sato, Takafumi Sakurai, Rod Burstall
    Lecture Notes in Computer Science 340-354 1999年  査読有り

共同研究・競争的資金等の研究課題

 20