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
|
類似資料
-
Algebra of Programming using Dependent Types
著者:: Mu, S, 等
出版事項: (2008) -
MiniAgda: Integrating Sized and Dependent Types
著者:: Andreas Abel
出版事項: (2010-12-01) -
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
著者:: Jean-Philippe Bernardy, 等
出版事項: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
著者:: Sergio Antoy, 等
出版事項: (2017-01-01) -
Trace and Stable Failures Semantics for CSP-Agda
著者:: Bashar Igried, 等
出版事項: (2017-09-01)