キノシタ ヨシキ   Kinoshita Yoshiki
  木下 佳樹
   所属   神奈川大学  情報学部 計算機科学科
    神奈川大学大学院  理学研究科 理学専攻(情報科学領域)
   職種   教授
言語種別 日本語
発行・発表の年月 2000/04
形態種別 学術雑誌
査読 査読あり
標題 Data Refinement and algebraic structure
執筆形態 共著
掲載誌名 Acta Informatica (Springer-Verlag)
巻・号・頁 36(9 and 10),693-719頁
著者・共著者 Yoshiki Kinoshita and John A. Power
概要 We recall Hoare's formulation of data refinement in terms of upward, downward and total simulations between locally ordered functors from the structured locally ordered category generated by a programming language with an abstract data type to a semantic locally ordered category: we use a simple imperative language with a data type for stacks as leading example. We give a unified category theoretic account of the sort of structures on a category that allow upward simulation to extend from ground types and ground programs to all types and programs of the language. This answers a question of Hoare about the category theory underlying his constructions. It involves a careful study of algebraic structure on the category of small locally ordered categories, and a new definition of sketch of such structure. This is accompanied by a range of detailed examples. We extend that analysis to total simulations for modelling constructors of mixed variance such as higher order types.