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...
Prif Awduron: | Mu, S, Ko, H, Jansson, P |
---|---|
Fformat: | Journal article |
Cyhoeddwyd: |
2009
|
Eitemau Tebyg
-
Algebra of Programming using Dependent Types
gan: Mu, S, et al.
Cyhoeddwyd: (2008) -
MiniAgda: Integrating Sized and Dependent Types
gan: Andreas Abel
Cyhoeddwyd: (2010-12-01) -
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
gan: Jean-Philippe Bernardy, et al.
Cyhoeddwyd: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
gan: Sergio Antoy, et al.
Cyhoeddwyd: (2017-01-01) -
Trace and Stable Failures Semantics for CSP-Agda
gan: Bashar Igried, et al.
Cyhoeddwyd: (2017-09-01)