Add to ORKGWe give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler's method for analysing lists. Limitations of the method are indicated
A property P of a language is said to be definable by abstract interpretation if there is a monotoni...
This report deals with strictness types, a way of recording whether a function needs its argumen...
Static analysis of different non-strict functional programming languages makes use of set constants ...
We give upper bounds on the number of times the flxed point oper-ator needs to be unfolded for stric...
AbstractExpression evaluation in lazy applicative languages is usually implemented by an expensive m...
In the context of abstract interpretation for languages without higher-order features we study the n...
A construction for finite abstract domains is presented which is quite general, being applicable to ...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
In the context of abstract interpretation for languages without higher-order features we study the n...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
This paper proves correctness of Nöcker's method of strictness analysis, implemented in the Clean co...
. We show that compiler optimisations based on strictness analysis can be expressed formally in the ...
AbstractWe consider abstract interpretation (in particular strictness analysis) for pairs and lists....
AbstractMuch of the earlier development of abstract interpretation, and its application to imperativ...
A property P of a language is said to be definable by abstract interpretation if there is a monotoni...
This report deals with strictness types, a way of recording whether a function needs its argumen...
Static analysis of different non-strict functional programming languages makes use of set constants ...
We give upper bounds on the number of times the flxed point oper-ator needs to be unfolded for stric...
AbstractExpression evaluation in lazy applicative languages is usually implemented by an expensive m...
In the context of abstract interpretation for languages without higher-order features we study the n...
A construction for finite abstract domains is presented which is quite general, being applicable to ...
A substantial amount of work has been devoted to the proof of correctness of various program analyse...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
In the context of abstract interpretation for languages without higher-order features we study the n...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
This paper proves correctness of Nöcker's method of strictness analysis, implemented in the Clean co...
. We show that compiler optimisations based on strictness analysis can be expressed formally in the ...
AbstractWe consider abstract interpretation (in particular strictness analysis) for pairs and lists....
AbstractMuch of the earlier development of abstract interpretation, and its application to imperativ...
A property P of a language is said to be definable by abstract interpretation if there is a monotoni...
This report deals with strictness types, a way of recording whether a function needs its argumen...
Static analysis of different non-strict functional programming languages makes use of set constants ...