Unfolding Abstract Datatypes

Abstract datatypes — with public interfaces hiding private implementations — represent a form of codata rather than ordinary data, and so proof methods for corecursive programs are the appropriate techniques to use for reasoning with them. In particular, we show that the universal properties of unfo...

詳細記述

書誌詳細
第一著者: Gibbons, J
フォーマット: Conference item
出版事項: 2008

類似資料