School of Computing

Promoting non-strict programming

Olaf Chitil

In Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006, pages 182-196, Budapest, Hungary, September 2006. Eotvos Lorand University.

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.

Download publication 106 kbytes (PDF)

Bibtex Record

@inproceedings{2477,
author = {Olaf Chitil},
title = {Promoting Non-Strict Programming},
month = {September},
year = {2006},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2477},
    publication_type = {inproceedings},
    submission_id = {9027_1170271632},
    ISBN = {963 463 876 7},
    booktitle = {Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006},
    address = {Budapest, Hungary},
    publisher = {Eotvos Lorand University},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014