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...
Główni autorzy: | Mu, S, Ko, H, Jansson, P |
---|---|
Format: | Journal article |
Wydane: |
2009
|
Podobne zapisy
-
Algebra of Programming using Dependent Types
od: Mu, S, i wsp.
Wydane: (2008) -
MiniAgda: Integrating Sized and Dependent Types
od: Andreas Abel
Wydane: (2010-12-01) -
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
od: Jean-Philippe Bernardy, i wsp.
Wydane: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
od: Sergio Antoy, i wsp.
Wydane: (2017-01-01) -
Formalizing Constructive Quantifier Elimination in Agda
od: Jeremy Pope
Wydane: (2018-07-01)