Algebra of Programming Using Dependent Types

Abstract

Abstract. 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.

Algebra of programming in Agda: Dependent types for relational program derivation

“…In Section 6 we talk about accessibility, the formal machinery we use to express hylomorphisms, and present a derivation of quicksort as an example. This paper is an extension of the authors' previous work presented at Mathematics of Program Construction (Mu et al 2008a).…”

Integrating an Automated Theorem Prover into Agda

“…Fifth, functional program development methodology [3] has already been integrated into Agda [16,12]. Automating it could lift program development in dependently typed languages to a new level.…”

Calculating Parallel Programs in Coq Using List Homomorphisms

“…Moreover Coq offers a more trusted framework through its kernel. The work on polytypic programming and program transformation in Coq [17] and Agda [18] is also related. Our framework follows more closely a simple functional programming style with additional pre/post conditions or statements about the simple functional programs.…”