Sciweavers

111 search results - page 4 / 23
» Constructing Polymorphic Programs with Quotient Types
Sort
View
ICFP
2008
ACM
14 years 7 months ago
HMF: simple type inference for first-class polymorphism
HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism. In contrast to other proposals, HML uses regular System F types and has a simple ty...
Daan Leijen
ICFP
2005
ACM
14 years 7 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
LISP
2006
91views more  LISP 2006»
13 years 7 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier
HASKELL
2005
ACM
14 years 1 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy