We report on an extension of Haskell with open type-level func-tions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The contribution of the paper is that we identify and characterise the key techni-cal challenge of entailment checking; and we give a novel, decid-able, sound, and complete algorithm to solve it, together with some practically-important variants. Our system is implemented in GHC, and is already in active use
Haskell has a rich type system with various complementary, interacting and overlapping features. In ...
© 2017 ACM. Functional dependencies are a popular extension to Haskell's typeclass system because t...
The use of typed intermediate languages can significantly increase the reliability of a compiler. By...
We report on an extension of Haskell with open type-level func-tions and equality constraints that u...
We report on an extension of Haskell with type(-level) functions and equality constraints. We illust...
System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of Syst...
Multi-parameter type classes, functional dependencies, and re-cently GADTs and open type families op...
Abstract Proof assistants based on dependent type theory are closely relatedto functional programmin...
Static typing is one of the most prominent techniques in the design of programming languages for mak...
This thesis explores rapid experimental development of programming languages, with particular emphas...
System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of Syst...
System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of Syst...
We propose a method for improving confidence in the correctness of Haskell programs by combining tes...
We propose a program verification method that combines random testing, model checking and interactiv...
Equational reasoning based verification address some of the limitations of classical testing. The Cu...
Haskell has a rich type system with various complementary, interacting and overlapping features. In ...
© 2017 ACM. Functional dependencies are a popular extension to Haskell's typeclass system because t...
The use of typed intermediate languages can significantly increase the reliability of a compiler. By...
We report on an extension of Haskell with open type-level func-tions and equality constraints that u...
We report on an extension of Haskell with type(-level) functions and equality constraints. We illust...
System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of Syst...
Multi-parameter type classes, functional dependencies, and re-cently GADTs and open type families op...
Abstract Proof assistants based on dependent type theory are closely relatedto functional programmin...
Static typing is one of the most prominent techniques in the design of programming languages for mak...
This thesis explores rapid experimental development of programming languages, with particular emphas...
System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of Syst...
System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of Syst...
We propose a method for improving confidence in the correctness of Haskell programs by combining tes...
We propose a program verification method that combines random testing, model checking and interactiv...
Equational reasoning based verification address some of the limitations of classical testing. The Cu...
Haskell has a rich type system with various complementary, interacting and overlapping features. In ...
© 2017 ACM. Functional dependencies are a popular extension to Haskell's typeclass system because t...
The use of typed intermediate languages can significantly increase the reliability of a compiler. By...