Sciweavers

1320 search results - page 123 / 264
» Efficient Implementation of a Linear Logic Programming Langu...
Sort
View
142
Voted
LISP
2008
96views more  LISP 2008»
15 years 3 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
118
Voted
CASES
2008
ACM
15 years 5 months ago
Optimus: efficient realization of streaming applications on FPGAs
In this paper, we introduce Optimus: an optimizing synthesis compiler for streaming applications. Optimus compiles programs written in a high level streaming language to either so...
Amir Hormati, Manjunath Kudlur, Scott A. Mahlke, D...
104
Voted
ICFP
2003
ACM
16 years 3 months ago
Polish parsers, step by step
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...
R. John M. Hughes, S. Doaitse Swierstra
115
Voted
PPDP
2010
Springer
15 years 2 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
123
Voted
ICFP
2010
ACM
15 years 4 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones