Summary: 

Verifying Haskell Programs Using Constructive Type Theory *



Andreas Abel Marcin Benke Ana Bove John Hughes Ulf Norell

Chalmers University of Technology
{abel,marcin,bove,rjmh,ulfn}@cs.chalmers.se



Abstract type, ensuring that type correctnes*
*s is preserved at each step, and

Proof assistants based on dependent type theorysareocloselytrelatedhe proof con*
*structed is valid. In this paper, we show how Agda
to functional programming languages, and so itcisatemptingntobusee used to deve*
*lop verified Haskell programs.

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München

Collections: Computer Technologies and Information Sciences