- Full text PDF available (33)
- This year (1)
- Last 5 years (11)
- Last 10 years (30)
Journals and Conferences
Many software applications today need to handle data from different data models; typically objects from the host programming language along with the relational and XML data models. The ROX impedance… (More)
ions need somewhat more work. _-^ οέ[(λχ.Ε)1 unfold _-^ о LAMBDA χ έ[Ε1 abutting calculation TAKE χ έ[Ε 3 о : extract έ ΐ ( λ χ σ . Ε ) σ Ί ο : (CONST c η ) ν | Ν unfold CONST c^' η evaluate с… (More)
Domain-specific embedded languages (DSELs) expressed in higher-order, typed (HOT) languages provide a composable framework for domain-specific abstractions. Such a framework is of greater utility… (More)
In functional programming, intermediate data structures are often used to “glue” together small programs. Deforestation is a program transformation to remove these intermediate data structures… (More)
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of functors, these… (More)
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop shopping , the paper combines material from three areas into a single source. The three areas are… (More)
This paper introduces a language feature, called implicit parameters, that provides dynamically scoped variables within a statically-typed Hindley-Milner framework. Implicit parameters are lexically… (More)
Big data is about more than size, and LINQ is more than up to the task.
This paper argues that we should seek the golden middle way between dynamically and statically typed languages.
The expressiveness of higher-order, typed languages such as Haskell or ML makes them an attractive medium in which to write software components. Hitherto , however, their use has been limited by the… (More)