Sciweavers

894 search results - page 15 / 179
» Typed Contracts for Functional Programming
Sort
View
121
Voted
ICFP
2001
ACM
16 years 2 months ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil
121
Voted
HASKELL
2008
ACM
15 years 3 months ago
Language and program design for functional dependencies
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
Mark P. Jones, Iavor S. Diatchki
212
Voted
POPL
2002
ACM
16 years 2 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
95
Voted
TPHOL
2007
IEEE
15 years 9 months ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner
241
Voted
POPL
2009
ACM
16 years 3 months ago
Flexible types: robust type inference for first-class polymorphism
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...
Daan Leijen