Sciweavers

2394 search results - page 40 / 479
» Implementing Mobile Haskell
Sort
View
GPCE
2003
Springer
14 years 2 months ago
Concept-Controlled Polymorphism
Concepts—sets of abstractions related by common requirements— have a central role in generic programming. This paper proposes a general framework for using concepts to control ...
Jaakko Järvi, Jeremiah Willcock, Andrew Lumsd...
GI
2009
Springer
14 years 1 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
CADE
2000
Springer
14 years 1 months ago
System Description: ARA - An Automatic Theorem Prover for Relation Algebras
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
Carsten Sinz
GCSE
1999
Springer
14 years 1 months ago
Aspect-Oriented Compilers
Aspect-orientedprogramming provides theprogrammer with means to cross-cut conventional program structures, in particular the class hierarchies of object-oriented programming. This ...
Oege de Moor, Simon L. Peyton Jones, Eric Van Wyk
PEPM
1994
ACM
14 years 29 days ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones