Sciweavers

4716 search results - page 161 / 944
» Tangible functional programming
Sort
View
CADE
2009
Springer
16 years 2 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
97
Voted
HASKELL
2009
ACM
15 years 8 months ago
Finding the needle: stack traces for GHC
Even Haskell programs can occasionally go wrong. Programs calling head on an empty list, and incomplete patterns in function definitions can cause program crashes, reporting littl...
Tristan O. R. Allwood, Simon Peyton Jones, Susan E...
142
Voted
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 6 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
213
Voted
ICLP
2009
Springer
16 years 3 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
MPC
2004
Springer
165views Mathematics» more  MPC 2004»
15 years 7 months ago
Prototyping Generic Programming in Template Haskell
Abstract. Generic Programming deals with the construction of programs that can be applied to many dierent datatypes. This is achieved by parameterizing the generic programs by the...
Ulf Norell, Patrik Jansson