In almost all languages arguments to functions are to be given explicitly in the program text. There are however a few interesting exceptions to this rule. In Haskell functions take arguments which are either passed explicitly or implicitly. An instance of the latter is the class system in Haskell where dictionaries are passed as evidence for class predicates. However, the construction as well as the passing of these dictionaries is invisible to the programmer. Unfortunately the approach taken here is that the language is a bit autistic in the sense that the programmer cannot provide any help if the built-in proof mechanism fails. In this paper we propose, in the context of Haskell, a mechanism that allows the programmer to explicitly pass ...
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting...
Implicit parameters are used pervasively in Scala and are also present in a number of other programm...
AbstractPlover is an automated property-verifier for Haskell programs that has been under developmen...
This paper introduces a language extension, called implicit parameters, for Hindley-Milner-typed pr...
This thesis contains a description of an implementation of an extended subset of the programming lan...
Although the functional programming language Haskell has a powerful type class system, users frequen...
Haskell is an influential functional programming language with an advanced type system that is capab...
Strong type systems can be used to increase the reliability and performance of programs. In combinat...
Session types are a well-established approach to ensuring protocol conformance and the absence of co...
Ideally complexity is managed by composing a system out of quite a few, more or less independent, an...
Strong type systems can be used to increase the reliability and performance of programs. In combinat...
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphis...
Abstract. We present a typed calculus IL (“intermediate language”) which supports the embedding of M...
The structured approach to argumentation has seen a surge of models, introducing a multitude of ways...
AbstractWe describe an algorithm for abstract interpretation of an intermediate language in a Haskel...
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting...
Implicit parameters are used pervasively in Scala and are also present in a number of other programm...
AbstractPlover is an automated property-verifier for Haskell programs that has been under developmen...
This paper introduces a language extension, called implicit parameters, for Hindley-Milner-typed pr...
This thesis contains a description of an implementation of an extended subset of the programming lan...
Although the functional programming language Haskell has a powerful type class system, users frequen...
Haskell is an influential functional programming language with an advanced type system that is capab...
Strong type systems can be used to increase the reliability and performance of programs. In combinat...
Session types are a well-established approach to ensuring protocol conformance and the absence of co...
Ideally complexity is managed by composing a system out of quite a few, more or less independent, an...
Strong type systems can be used to increase the reliability and performance of programs. In combinat...
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphis...
Abstract. We present a typed calculus IL (“intermediate language”) which supports the embedding of M...
The structured approach to argumentation has seen a surge of models, introducing a multitude of ways...
AbstractWe describe an algorithm for abstract interpretation of an intermediate language in a Haskel...
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting...
Implicit parameters are used pervasively in Scala and are also present in a number of other programm...
AbstractPlover is an automated property-verifier for Haskell programs that has been under developmen...