Algebra of Programming using Dependent Types
Artikel i vetenskaplig tidskrift, 2008

Dependent type theory is rich enough to express that a program satisfies an input/output relational specification, but it could be hard to construct the proof term. On the other hand, squiggolists know very well how to show that one relation is included in another by algebraic reasoning. We demonstrate how to encode functional and relational derivations in a dependently typed programming language. A program is coupled with an algebraic derivation from a specification, whose correctness is guaranteed by the type system.

Program Verification

Relational algebra

Program Calculation

Mathematics of Program Construction

Författare

Shin-Cheng Mu

Ko Hsiang-Shang

Patrik Jansson

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 5133/2008 268-283

Ämneskategorier

Programvaruteknik

Datavetenskap (datalogi)