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...
Главные авторы: | Mu, S, Ko, H, Jansson, P |
---|---|
Формат: | Journal article |
Опубликовано: |
2009
|
Схожие документы
-
Algebra of Programming using Dependent Types
по: Mu, S, и др.
Опубликовано: (2008) -
MiniAgda: Integrating Sized and Dependent Types
по: Andreas Abel
Опубликовано: (2010-12-01) -
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
по: Jean-Philippe Bernardy, и др.
Опубликовано: (2016-06-01) -
Proving Non-Deterministic Computations in Agda
по: Sergio Antoy, и др.
Опубликовано: (2017-01-01) -
Trace and Stable Failures Semantics for CSP-Agda
по: Bashar Igried, и др.
Опубликовано: (2017-09-01)