Chitil, Olaf (2006) Promoting Non-Strict Programming. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006.
In a non-strict functional programming language functions that yield the same result for all total arguments can still differ for partial arguments, that is, they differ in their strictness. Here a Haskell library is presented that enables the programmer to easily check whether a given function is least-strict; if it is not least-strict, then the tool suggests how to make it less strict.
|Item Type:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||Haskell, least strict, StrictCheck|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:03|
|Last Modified:||06 Sep 2011 01:32|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14426 (The current URI for this page, for reference purposes)|
- Depositors only (login required):