45 search results - page 6 / 9 » jfp 2006 |
JFP
2002
13 years 10 months ago
2002
Higher-order languages, such as Haskell, encourage the proto build abstractions by composing functions. A good compiler must inline many of these calls to recover an e ciently exe...
39
Voted
JFP
2002
13 years 10 months ago
2002
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
JFP
2002
13 years 10 months ago
2002
We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML...
JFP
2010
13 years 9 months ago
2010
Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Languages that meet all criteria include Haske...
JFP
2006
13 years 10 months ago
2006
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...