Why functional programming matters
The Computer Journal - Special issue on Lazy functional programming
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
Smallcheck and lazy smallcheck: automatic exhaustive testing for small values
Proceedings of the first ACM SIGPLAN symposium on Haskell
Push-pull functional reactive programming
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Overlapping rules and logic variables in functional logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Minimally strict polymorphic functions
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
| Hi-index | 0.00 |
We present a light-weight tool called Sloth which assists programmers in identifying unnecessarily strict first order functions. Sloth reports counterexamples in form of a partial value, the corresponding result of the tested function and a recommended result. We present examples where the hints reported by Sloth can be used to improve a function with respect to memory behaviour, non-termination, and performance in the context of functional-logic programming. Furthermore we give an example-driven introduction into the basics of the implementation of Sloth. To improve the results in comparison to an existing approach we use additional constraints to assure that Sloth's suggestions are implementable without employing parallelism.