Type inference, Haskell and dependent types
This thesis studies questions of type inference, unification and elaboration for languages that combine dependent type theory and functional programming. Languages such as modern Haskell have very expressive type systems, allowing the programmer a great deal of freedom. These require advanced type i...
Main Author: | Gundry, Adam Michael |
---|---|
Published: |
University of Strathclyde
2013
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.605927 |
Similar Items
-
Session Type Inference in Haskell
by: Keigo Imai, et al.
Published: (2011-10-01) -
Static contract checking for Haskell
by: Xu, Na
Published: (2009) -
Data-driven refactorings for Haskell
by: Adams, Stephen
Published: (2017) -
Profiling optimised Haskell : causal analysis and implementation
by: Wortmann, Peter Moritz
Published: (2014) -
Architecture aware parallel programming in Glasgow parallel Haskell (GPH)
by: Aswad, Mustafa K. H.
Published: (2012)