Add to ORKGProjet FORMELStrictness analysis has been investigated in order to cover in one hand higher-order strictness analysis, on the other hand strictness analysis on non-flat domains. This paper presents a general method extending higher-order strictness analysis in order to subsume non-flat domains. The method uses the notion of strictness pairs and the notion of projection from domain theory. It allows to deal with the "n-th" strictness of a component of any kind of data structure
Higher Order Demand Propagation as proposed in [Pa98] provides a non-standard denotational semantics...
Amtoft has formulated an “on-line ” constraint normalization method for solving a strict-ness infere...
This report deals with strictness types, a way of recording whether a function needs its argument(s)...
A construction for finite abstract domains is presented which is quite general, being applicable to ...
We extend an existing first-order typing system for strictness analysis to the fully higher-order ca...
Contains fulltext : 149047.pdf (author's version ) (Open Access
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algor...
This paper newly proposes HOMomorphic Transformer (HOMT) in order to formalize relations among stric...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
This report deals with strictness types, a way of recording whether a function needs its argumen...
Abstract. In this report a new backward strictness analysis for functional languages is presented. I...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
Higher Order Demand Propagation as proposed in [Pa98] provides a non-standard denotational semantics...
We describe a simple strictness analyser for purely-functional programs, show how its results are us...
Higher Order Demand Propagation as proposed in [Pa98] provides a non-standard denotational semantics...
Amtoft has formulated an “on-line ” constraint normalization method for solving a strict-ness infere...
This report deals with strictness types, a way of recording whether a function needs its argument(s)...
A construction for finite abstract domains is presented which is quite general, being applicable to ...
We extend an existing first-order typing system for strictness analysis to the fully higher-order ca...
Contains fulltext : 149047.pdf (author's version ) (Open Access
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algor...
This paper newly proposes HOMomorphic Transformer (HOMT) in order to formalize relations among stric...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
This report deals with strictness types, a way of recording whether a function needs its argumen...
Abstract. In this report a new backward strictness analysis for functional languages is presented. I...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
Higher Order Demand Propagation as proposed in [Pa98] provides a non-standard denotational semantics...
We describe a simple strictness analyser for purely-functional programs, show how its results are us...
Higher Order Demand Propagation as proposed in [Pa98] provides a non-standard denotational semantics...
Amtoft has formulated an “on-line ” constraint normalization method for solving a strict-ness infere...
This report deals with strictness types, a way of recording whether a function needs its argument(s)...