Software Engineering using Typed Functional Programming
Licentiatavhandling, 2009

This thesis makes three distinct contributions to software engineering, using typed functional programming. First, we present a schema to reduce polymorphic properties to an equivalent monomorphic property, for the purpose of testing. Our proof uses parametricity and properties of initial algebras. Second, we compare haskell type classes with their counterpart in C++. We contribute to an improved understanding of language support for generic programming, and hope to facilitate discussion between maintsream and functional programming language communities. Third, we present a parsing library for incremental analysis of source code. This is an example of a non-trivial application of the principles of typed functional programming and lazy evaluation.

functional programming types polymorphism type-classes

Chalmers university of Technology, lecture hall HA4 (hörsalvägen 4)
Opponent: Ross Paterson


Jean-Philippe Bernardy

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

A comparison of C++ concepts and Haskell type classes

ACM SIGPLAN Workshop on Generic Programming 2008. Victoria, Canada, 20th September 2008,; (2008)p. 37-48

Paper i proceeding

Yi - An Editor in Haskell for Haskell

ACM SIGPLAN 2008 Haskell Symposium Victoria, British Columbia, Canada Thursday, 25th September, 2008,; (2008)p. 61-62

Konferensbidrag (offentliggjort, men ej förlagsutgivet)



Datavetenskap (datalogi)

Technical report L - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 62L

Chalmers university of Technology, lecture hall HA4 (hörsalvägen 4)

Opponent: Ross Paterson