Add to ORKGIn 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
AbstractWe show the adequacy of axioms and proof rules for strict and lazy functional programs. Our ...
AbstractWe define a novel inference system for strictness and totality analysis for the simply-typed...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
In a non-strict programming language like Haskell a function only evaluates the parts of an argument...
AbstractExpression evaluation in lazy applicative languages is usually implemented by an expensive m...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
We describe a simple strictness analyser for purely-functional programs, show how its results are us...
This thesis consists of two parts. Both concern reasoning about non-strict functional programming la...
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting...
The extraction of strictness information marks an indispensable element of an efficient compilation ...
Properties of programs can be formulated using various techniques: dataflow analysis, abstract inter...
Two fundamental goals in programming are correctness and efficiency: we want our programs to produce...
The evaluation strategies of programming languages can be broadly categorised as strict or lazy. A c...
This report deals with strictness types, a way of recording whether a function needs its argumen...
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting...
AbstractWe show the adequacy of axioms and proof rules for strict and lazy functional programs. Our ...
AbstractWe define a novel inference system for strictness and totality analysis for the simply-typed...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
In a non-strict programming language like Haskell a function only evaluates the parts of an argument...
AbstractExpression evaluation in lazy applicative languages is usually implemented by an expensive m...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
We describe a simple strictness analyser for purely-functional programs, show how its results are us...
This thesis consists of two parts. Both concern reasoning about non-strict functional programming la...
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting...
The extraction of strictness information marks an indispensable element of an efficient compilation ...
Properties of programs can be formulated using various techniques: dataflow analysis, abstract inter...
Two fundamental goals in programming are correctness and efficiency: we want our programs to produce...
The evaluation strategies of programming languages can be broadly categorised as strict or lazy. A c...
This report deals with strictness types, a way of recording whether a function needs its argumen...
Traditionally developers and testers created huge numbers of explicit tests, enumerating interesting...
AbstractWe show the adequacy of axioms and proof rules for strict and lazy functional programs. Our ...
AbstractWe define a novel inference system for strictness and totality analysis for the simply-typed...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...