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
This report deals with strictness types, a way of recording whether a function needs its argumen...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
AbstractFilter domains (Coppo et al.,1984) can be seen as abstract domains for the interpretation of...
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...
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 consider a functional language with recursively delined types and a weak form of po...
In this paper we consider a functional language with recursively defined types and a weak form of p...
In this paper we consider a functional language with recursively defined types and a weak form of p...
AbstractFilter domains (Coppo et al.,1984) can be seen as abstract domains for the interpretation of...
In this paper we define the functional language POLYREC with polymorphic and recursive types, and d...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
This report deals with strictness types, a way of recording whether a function needs its argumen...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
AbstractFilter domains (Coppo et al.,1984) can be seen as abstract domains for the interpretation of...
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...
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 consider a functional language with recursively delined types and a weak form of po...
In this paper we consider a functional language with recursively defined types and a weak form of p...
In this paper we consider a functional language with recursively defined types and a weak form of p...
AbstractFilter domains (Coppo et al.,1984) can be seen as abstract domains for the interpretation of...
In this paper we define the functional language POLYREC with polymorphic and recursive types, and d...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
This report deals with strictness types, a way of recording whether a function needs its argumen...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
AbstractFilter domains (Coppo et al.,1984) can be seen as abstract domains for the interpretation of...
DOI
Add to ORKG