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...
Príomhchruthaitheoirí: | Mu, S, Ko, H, Jansson, P |
---|---|
Formáid: | Journal article |
Foilsithe / Cruthaithe: |
2009
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Algebra of Programming using Dependent Types
de réir: Mu, S, et al.
Foilsithe / Cruthaithe: (2008) -
MiniAgda: Integrating Sized and Dependent Types
de réir: Andreas Abel
Foilsithe / Cruthaithe: (2010-12-01) -
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
de réir: Jean-Philippe Bernardy, et al.
Foilsithe / Cruthaithe: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
de réir: Sergio Antoy, et al.
Foilsithe / Cruthaithe: (2017-01-01) -
Trace and Stable Failures Semantics for CSP-Agda
de réir: Bashar Igried, et al.
Foilsithe / Cruthaithe: (2017-09-01)