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 |
---|---|
Format: | Journal article |
Udgivet: |
2009
|
Lignende værker
-
Algebra of Programming using Dependent Types
af: Mu, S, et al.
Udgivet: (2008) -
MiniAgda: Integrating Sized and Dependent Types
af: Andreas Abel
Udgivet: (2010-12-01) -
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
af: Jean-Philippe Bernardy, et al.
Udgivet: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
af: Sergio Antoy, et al.
Udgivet: (2017-01-01) -
Formalizing Constructive Quantifier Elimination in Agda
af: Jeremy Pope
Udgivet: (2018-07-01)