AbstractWe consider abstract interpretation (in particular strictness analysis) for pairs and lists. We begin by reviewing the well-known fact that the best known description of a pair of elements is obtained using the tensor product rather than the cartesian product. We next present a generalisation of Wadler's strictness analysis for lists using the notion of open set. Finally, we illustrate the intimate connection between the case analysis implicit in Wadler's strictness analysis and the precision that the tensor product allows for modelling the inverse cons operation
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
Projet FORMELStrictness analysis has been investigated in order to cover in one hand higher-order st...
We can introduce singular terms for ordered pairs by means of an abstraction principle. Doing so pro...
AbstractWe consider abstract interpretation (in particular strictness analysis) for pairs and lists....
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strict...
We give upper bounds on the number of times the flxed point oper-ator needs to be unfolded for stric...
A construction for finite abstract domains is presented which is quite general, being applicable to ...
Abstract. We design the first efficient algorithms and prove new combinatorial bounds for list decod...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
A property P of a language is said to be definable by abstract interpretation if there is a monotoni...
We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey the...
Static analysis of different non-strict functional programming languages makes use of set constants ...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
This thesis describes several abstract interpretations of polymorphic functions. In all the interpre...
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this qu...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
Projet FORMELStrictness analysis has been investigated in order to cover in one hand higher-order st...
We can introduce singular terms for ordered pairs by means of an abstraction principle. Doing so pro...
AbstractWe consider abstract interpretation (in particular strictness analysis) for pairs and lists....
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strict...
We give upper bounds on the number of times the flxed point oper-ator needs to be unfolded for stric...
A construction for finite abstract domains is presented which is quite general, being applicable to ...
Abstract. We design the first efficient algorithms and prove new combinatorial bounds for list decod...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
A property P of a language is said to be definable by abstract interpretation if there is a monotoni...
We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey the...
Static analysis of different non-strict functional programming languages makes use of set constants ...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
This thesis describes several abstract interpretations of polymorphic functions. In all the interpre...
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this qu...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
Projet FORMELStrictness analysis has been investigated in order to cover in one hand higher-order st...
We can introduce singular terms for ordered pairs by means of an abstraction principle. Doing so pro...