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