Algebra of Programming in Agda: Dependent Types for Relational Program Derivation

<p>Relational program derivation is the technique of stepwise refining a relational specification to a program by algebraic rules. The program thus obtained is correct by construction. Meanwhile, dependent type theory is rich enough to express various correctness properties to be verified by t...

詳細記述

書誌詳細
主要な著者: Mu, S, Ko, H, Jansson, P
フォーマット: Journal article
出版事項: 2009

類似資料