Sciweavers

687 search results - page 9 / 138
» Feature (De)composition in Functional Programming
Sort
View
PPDP
2010
Springer
13 years 6 months ago
Functional derivation of a virtual machine for delimited continuations
This paper connects the definitional interpreter for the λ-calculus extended with delimited continuation constructs, shift and reset, with a compiler and a low-level virtual mac...
Kenichi Asai, Arisa Kitani
LCPC
2005
Springer
14 years 1 months ago
Testing Speculative Work in a Lazy/Eager Parallel Functional Language
Eden is a parallel extension of the functional language Haskell. Eden inherits from Haskell its laziness, which allows it to avoid unnecessary computations. However, in order to en...
Alberto de la Encina, Ismael Rodríguez, Fer...
ICFP
2007
ACM
14 years 7 months ago
Functional pearl: the great escape or, how to jump the border without getting caught
Filinski showed that callcc and a single mutable reference cell are sufficient to express the delimited control operators shift and reset. However, this implementation interacts p...
David Herman
PADL
2000
Springer
13 years 11 months ago
A Functional Logic Programming Approach to Graphical User Interfaces
We show how the features of modern integrated functional logic programming languages can be exploited to implement graphical user interfaces (GUIs) in a high-level declarative styl...
Michael Hanus
HASKELL
2005
ACM
14 years 1 months ago
TypeCase: a design pattern for type-indexed functions
A type-indexed function is a function that is defined for each member of some family of types. Haskell’s type class mechanism provides collections of open type-indexed function...
Bruno C. D. S. Oliveira, Jeremy Gibbons