Higher Order Demand Propagation as proposed in [Pa98] provides a non-standard denotational semantics for a realistic functional language. This semantics can be used to deduce generalised strictness information for higher order polymorphic functions. This report provides the formal proof for the correctness of this strictness information with respect to the non-strict standard semantics
We generalise the termination method of higher-order polynomial interpretations to a setting with im...
Three languages with polymorphic type disciplines are discussed, namely the λ-calculus with Milner'...
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...
Abstract. In this report a new backward strictness analysis for functional languages is presented. I...
We extend an existing first-order typing system for strictness analysis to the fully higher-order ca...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
Parametric polymorphism constrains the behavior of pure functional pro-grams in a way that allows th...
The addition of logic variables to functional languages gives the programmer novel and powerful too...
AbstractIn this paper we present two non-standard-type inference systems for conjunctive strictness ...
AbstractThis paper gives a proposal for how order-sorted algebraic specification languages can be ex...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
We generalise the termination method of higher-order polynomial interpretations to a setting with im...
Three languages with polymorphic type disciplines are discussed, namely the λ-calculus with Milner'...
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...
Abstract. In this report a new backward strictness analysis for functional languages is presented. I...
We extend an existing first-order typing system for strictness analysis to the fully higher-order ca...
AbstractIn this paper we consider a functional language with recursively defined types and a weak fo...
AbstractAbstract interpretation is a compile-time technique which is used to gain information about ...
Parametric polymorphism constrains the behavior of pure functional pro-grams in a way that allows th...
The addition of logic variables to functional languages gives the programmer novel and powerful too...
AbstractIn this paper we present two non-standard-type inference systems for conjunctive strictness ...
AbstractThis paper gives a proposal for how order-sorted algebraic specification languages can be ex...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
Higher-order abstract syntax is a simple technique for implementing languages with functional progra...
We generalise the termination method of higher-order polynomial interpretations to a setting with im...
Three languages with polymorphic type disciplines are discussed, namely the λ-calculus with Milner'...
this paper, that results from this kind of analysis are, in a sense, polymorphic. This confirms an e...
DOI
Add to ORKG