27 search results - page 2 / 6 » Family Polymorphism |
FOSSACS
2009
Springer
14 years 11 days ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
CP
2010
Springer
13 years 4 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
JACM
2007
13 years 5 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
HICSS
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— Framework design is a multifaceted endeavor undertaken to promote reuse of software within a family of related applications. Traditional approaches involve either the e...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...