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...
Main Authors: | Mu, S, Ko, H, Jansson, P |
---|---|
格式: | Journal article |
出版: |
2009
|
相似书籍
-
Algebra of Programming using Dependent Types
由: Mu, S, et al.
出版: (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, et al.
出版: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
由: Sergio Antoy, et al.
出版: (2017-01-01) -
Trace and Stable Failures Semantics for CSP-Agda
由: Bashar Igried, et al.
出版: (2017-09-01)