Chitil, Olaf (2006) Promoting Non-Strict Programming. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006. . pp. 512-516. Eotvos Lorand University, Budapest, Hungary ISBN 963-463-876-7. (KAR id:14426)
|
PDF
Language: English |
|
|
Download this file (PDF/133kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
Abstract
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, |
| Institutional Unit: | Schools > School of Computing |
| Former Institutional Unit: |
Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
|
| Depositing User: | Olaf Chitil |
| Date Deposited: | 24 Nov 2008 18:03 UTC |
| Last Modified: | 20 May 2025 10:05 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/14426 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Chitil, Olaf.
| Creator's ORCID: |
 https://orcid.org/0000-0001-7986-9929
|
|---|---|
| CReDIT Contributor Roles: |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Total Views
Total Views
