Sciweavers

15 search results - page 3 / 3
» Haskell Type Constraints Unleashed
Sort
View
OOPSLA
2004
Springer
15 years 3 months ago
Modular generics
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
Jeremy G. Siek
ICFP
2003
ACM
15 years 9 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...
PPDP
2010
Springer
14 years 8 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
OOPSLA
2005
Springer
15 years 3 months ago
Generalized algebraic data types and object-oriented programming
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
Andrew Kennedy, Claudio V. Russo
FLOPS
2010
Springer
15 years 2 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann