Investigating Minimally Strict Functions in Functional Programming

Christiansen, Jan

In a non-strict programming language like Haskell a function only evaluates the parts of an argument that are necessary to calculate the result of an application. However, it is possible to define a function that is unnecessarily strict. That is, the function evaluates some part of its argument although this part is not needed to calculate the demanded part of the result. This thesis investigates the influence of unnecessary strictness on the memory behavior of a function and presents approaches for identifying and optimizing unnecessarily strict functions.

Zitieren

Zitierform:

Christiansen, Jan: Investigating Minimally Strict Functions in Functional Programming. 2012.

Zitierform konnte nicht geladen werden. Standard Zitierform wird angezeigt.

Rechte

Nutzung und Vervielfältigung:Keine Creative Commons Lizenz - Es gilt das deutsche Urhebergesetz (UrhG)Bitte beachten Sie, dass einzelne Bestandteile der Publikation anderweitigen Lizenz- bzw. urheberrechtlichen Bedingungen unterliegen können.

Export