Sciweavers

121 search results - page 24 / 25
» Lazy abstraction
Sort
View
ICFP
1999
ACM
13 years 11 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
ICFP
2007
ACM
13 years 11 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
POPL
1995
ACM
13 years 11 months ago
Monad Transformers and Modular Interpreters
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
Sheng Liang, Paul Hudak, Mark P. Jones
IIWAS
2008
13 years 9 months ago
Application framework with demand-driven mashup for selective browsing
Abstract: We are developing a new mashup framework for creating flexible applications in which users can selectively browse through mashup items. The framework provides GUI compone...
Sohei Ikeda, Takakazu Nagamine, Tomio Kamada
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
Yacc is dead
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
Matthew Might, David Darais