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...
Egile Nagusiak: | Mu, S, Ko, H, Jansson, P |
---|---|
Formatua: | Journal article |
Argitaratua: |
2009
|
Antzeko izenburuak
-
Algebra of Programming using Dependent Types
nork: Mu, S, et al.
Argitaratua: (2008) -
MiniAgda: Integrating Sized and Dependent Types
nork: Andreas Abel
Argitaratua: (2010-12-01) -
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
nork: Jean-Philippe Bernardy, et al.
Argitaratua: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
nork: Sergio Antoy, et al.
Argitaratua: (2017-01-01) -
Formalizing Constructive Quantifier Elimination in Agda
nork: Jeremy Pope
Argitaratua: (2018-07-01)