Sciweavers

5415 search results - page 158 / 1083
» The Implementation of Functional Programming Languages
Sort
View
IPL
2007
78views more  IPL 2007»
13 years 10 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
RIA
2007
123views more  RIA 2007»
13 years 10 months ago
Continuations pour la programmation de comportement d'agent
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
Denis Jouvin
HASKELL
2005
ACM
14 years 4 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
PEPM
2010
ACM
14 years 7 months ago
Clone detection and elimination for Haskell
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
Christopher Brown, Simon Thompson
ICDE
2008
IEEE
176views Database» more  ICDE 2008»
15 years 10 hour ago
Automatic Result Verification for the Functional Testing of a Query Language
Functional testing of a query language is a challenging task in practice. In order to reveal errors in the query processing functionality, it is necessary to verify the actual res...
Carsten Binnig, Donald Kossmann, Eric Lo, Angel Sa...