AbstractIn this paper we consider a functional language with recursively defined types and a weak form of polymorphism. For this language a strictness analysis is developed, based on abstract interpretation in a category of complete algebraic lattices
We extend an existing first-order typing system for strictness analysis to the fully higher-order ca...
This thesis describes an implementation of abstract interpretation and its application to strictness...
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algor...
In this paper we consider a functional language with recursively delined types and a weak form of po...
In this paper we consider a functional language with recursively delined types and a weak form of po...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
In this paper we define the functional language POLYREC with polymorphic and recursive types, and d...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
AbstractFilter domains (Coppo et al.,1984) can be seen as abstract domains for the interpretation of...
AbstractWe consider a type system where types are labeled, regular trees. Equipped with a type order...
AbstractThe method of logical relations assigns a relational interpretation to types that expresses ...
AbstractIn this paper, we first introduce a notion of polymorphic abstract interpretation that forma...
The method of logical relations assigns a relational interpretation to types that expresses operatio...
This paper newly proposes HOMomorphic Transformer (HOMT) in order to formalize relations among stric...
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...
This thesis describes an implementation of abstract interpretation and its application to strictness...
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algor...
In this paper we consider a functional language with recursively delined types and a weak form of po...
In this paper we consider a functional language with recursively delined types and a weak form of po...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
In this paper we define the functional language POLYREC with polymorphic and recursive types, and d...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
AbstractFilter domains (Coppo et al.,1984) can be seen as abstract domains for the interpretation of...
AbstractWe consider a type system where types are labeled, regular trees. Equipped with a type order...
AbstractThe method of logical relations assigns a relational interpretation to types that expresses ...
AbstractIn this paper, we first introduce a notion of polymorphic abstract interpretation that forma...
The method of logical relations assigns a relational interpretation to types that expresses operatio...
This paper newly proposes HOMomorphic Transformer (HOMT) in order to formalize relations among stric...
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...
This thesis describes an implementation of abstract interpretation and its application to strictness...
This paper shows how to implement sensible polymorphic strictness analysis using the Frontiers algor...
DOI
Add to ORKG