主 催: NII 先端ソフトウェア工学国際研究センター（GRACEセンター）
日 時：2008年9月11日（木）10:00-12:00
場 所：国立情報学研究所(NII) 20階セミナー室 (地図)
参加費：無料
お問い合わせ先：吉岡信和 (Nobukazu _AT_ nii.ac.jp）_AT_を@に書き換えてください。
プログラム：
−Open Semantics for the Digital Economy
Professor Jim Davies
(University of Oxford)
−Unfolding Abstract Datatypes
Jeremy Gibbons
(University of Oxford)
▼プログラム
Title:Open Semantics for the Digital Economy
Speaker:Professor Jim Davies (University of Oxford)
Abstract:In the digital economy, any meanings that we might articulate or desire in the real world will be constrained or even overridden in practice by the meanings encoded in the behaviour and use of information systems. Inadequate consideration of meaning leaves us with systems that do not re.ect our requirements, leading to a lack of trust and poor interoperability. Moreover, in an evolving context, it is not enough for developers to work with representations of state and functionality that record .xed, implicit assumptions about the meaning and role of data from the perspective of multiple stake-holders.
Rather, information systems design, development, and operation will need to be based upon representations of meaning and intention, in which the assumptions are explicit, and open to introspection and change during the lifetime of the system. In this seminar, we will discuss how this can be achieved through the use of semantic frameworks – terminologies, metadata registries, models, and standards – and an open, distributed approach to the definition and maintenance of meaning.
Biography:Jim Davies is Professor of Software Engineering, and the Director of the Software Engineering Programme, at the University of Oxford. His research interests are in semantic frameworks for electronic governance, in formal techniques, and in model-driven development. He is leading the software development activity on the UK CancerGrid project.
Title: Unfolding Abstract Datatypes
Speaker:Jeremy Gibbons (University of Oxford)
Abstract: Datatypes – with public interfaces hiding private implementations – represent a form of codata rather than ordinary data, and hence proof methods for corecursive programs are the appropriate techniques to use for reasoning with them. In particular, we show that the universal properties of unfold operators are perfectly suited for the task. We illustrate with the solution to a problem in the recent literature.
Biography:Dr Jeremy Gibbons is Reader in Software Engineering at the University of Oxford, where he is Deputy Director of the Software Engineering Programme. His research interests are in programming languages and methods, and particularly in functional and object-oriented programming and in approaches to generic programming.
※プログラムは予告なく変更される場合もありますのでご了承ください。
