Algebra of Programming Using Dependent Types

  • Shin-Cheng Mu
  • Hsiang-Shang Ko
  • Patrik Jansson
Conference paper

DOI: 10.1007/978-3-540-70594-9_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5133)
Cite this paper as:
Mu SC., Ko HS., Jansson P. (2008) Algebra of Programming Using Dependent Types. In: Audebaud P., Paulin-Mohring C. (eds) Mathematics of Program Construction. MPC 2008. Lecture Notes in Computer Science, vol 5133. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Shin-Cheng Mu
    • 1
  • Hsiang-Shang Ko
    • 2
  • Patrik Jansson
    • 3
  1. 1.Institute of Information ScienceAcademia SinicaTaiwan
  2. 2.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaiwan
  3. 3.Department of Computer Science and EngineeringChalmers University of Technology & University of GothenburgSweden

Personalised recommendations