## Strictness and Totality Analysis with Conjunction (1995)

Venue: | In TAPSOFT'95, LNCS 915 |

Citations: | 7 - 1 self |

### BibTeX

@INPROCEEDINGS{Solberg95strictnessand,

author = {Kirsten Lackner Solberg},

title = {Strictness and Totality Analysis with Conjunction},

booktitle = {In TAPSOFT'95, LNCS 915},

year = {1995},

pages = {501--515},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

We extend the strictness and totality analysis of [12] by allowing conjunction at all levels rather than at the top-level. We prove the strictness and totality analysis correct with respect to a denotational semantics and finally construct an algorithm for inferring the strictness and totality properties. 1 Introduction Strictness analysis has proved useful in the implementation of lazy functional languages like Miranda, Lazy ML and Haskell: when a function is strict it is safe to evaluate its argument before performing the function call. Totality analysis has not been adopted so widely: if the argument to a function is known to terminate then it is safe to evaluate it before performing the function call [9]. In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. [10, 3]), projection analysis (e.g. [14]) and inference based methods (e.g. [2, 6, 7, 8, 15]). Totality analysis has received much less attention and has pri...

### Citations

159 |
A non-strict functional language with polymorphic types
- Miranda
- 1985
(Show Context)
Citation Context ...tution on terms e[e 2 /x] is defined as usual. 2.2 The Semantics The reason for choosing a lazy semantics is to capture the semantics of "reallife " lazy functional programming languages lik=-=e Miranda [13]-=- in contrast to most other papers on strictness analysis ([3, 5]). The semantics in [12] is a naturalstyle operational semantics where the terms are evaluated to weak head normal form (abbreviated WHN... |

96 | Projections for Strictness Analysis
- Wadler, Hughes
- 1987
(Show Context)
Citation Context ... before performing the function call [9]. In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. [10, 3]), projection analysis (e.g. =-=[14]-=-) and inference based methods (e.g. [2, 6, 7, 8, 15]). Totality analysis has received much less attention and has primarily been specified using abstract interpretation [10, 1]. It can be regarded as ... |

92 |
Abstract Interpretation and Optimising Transformations for Applicative Programs
- MYCROFT
- 1981
(Show Context)
Citation Context ...inate then it is safe to evaluate it before performing the function call [9]. In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. =-=[10, 3]-=-), projection analysis (e.g. [14]) and inference based methods (e.g. [2, 6, 7, 8, 15]). Totality analysis has received much less attention and has primarily been specified using abstract interpretatio... |

76 |
The theory and practice of transforming call-by-need into call-by-value
- Mycroft
- 1980
(Show Context)
Citation Context ... performing the function call. Totality analysis has not been adopted so widely: if the argument to a function is known to terminate then it is safe to evaluate it before performing the function call =-=[9]-=-. In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. [10, 3]), projection analysis (e.g. [14]) and inference based methods (e.g. ... |

70 |
S.: Strictness analysis for higher-order functions
- Burn, Hankin, et al.
- 1986
(Show Context)
Citation Context ...inate then it is safe to evaluate it before performing the function call [9]. In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. =-=[10, 3]-=-), projection analysis (e.g. [14]) and inference based methods (e.g. [2, 6, 7, 8, 15]). Totality analysis has received much less attention and has primarily been specified using abstract interpretatio... |

57 |
Strictness Analysis: a New Perspective Based on Type Inference
- Kuo, Mishra
- 1989
(Show Context)
Citation Context .... In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. [10, 3]), projection analysis (e.g. [14]) and inference based methods (e.g. =-=[2, 6, 7, 8, 15]-=-). Totality analysis has received much less attention and has primarily been specified using abstract interpretation [10, 1]. It can be regarded as an approximation to time complexity analysis; most l... |

53 |
Abstract interpretation, logical relations and Kan extensions
- Abramsky
- 1990
(Show Context)
Citation Context ... projection analysis (e.g. [14]) and inference based methods (e.g. [2, 6, 7, 8, 15]). Totality analysis has received much less attention and has primarily been specified using abstract interpretation =-=[10, 1]-=-. It can be regarded as an approximation to time complexity analysis; most literature performing such developments consider eager languages but [11] considers lazy languages. The paper [12] presents a... |

47 | Complexity analysis for a lazy higher-order language
- Sands
- 1990
(Show Context)
Citation Context ...ily been specified using abstract interpretation [10, 1]. It can be regarded as an approximation to time complexity analysis; most literature performing such developments consider eager languages but =-=[11]-=- considers lazy languages. The paper [12] presents an inference system for performing strictness and totality analysis. The inference system is an extension of the usual type system in that we introdu... |

44 | Strictness Analysis in Logical Form
- Jensen
- 1991
(Show Context)
Citation Context .... In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. [10, 3]), projection analysis (e.g. [14]) and inference based methods (e.g. =-=[2, 6, 7, 8, 15]-=-). Totality analysis has received much less attention and has primarily been specified using abstract interpretation [10, 1]. It can be regarded as an approximation to time complexity analysis; most l... |

26 | Deriving Algorithms from Type Inference Systems: Application to Strictness Analysis
- Hankin, MÃ©tayer
- 1994
(Show Context)
Citation Context ...construct an algorithm for strictness and totality property inference --- for both the un-restricted and restricted [12] case --- is to follow the most general type approach by Hankin and Le M'etayer =-=[4]-=-. For a given environment 10 and term the algorithm will find all the strictness and totality properties that can be inferred for the term. Often we are only interested in knowing if a term possesses ... |

21 |
A new technique for strictness analysis
- Wright
- 1991
(Show Context)
Citation Context .... In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. [10, 3]), projection analysis (e.g. [14]) and inference based methods (e.g. =-=[2, 6, 7, 8, 15]-=-). Totality analysis has received much less attention and has primarily been specified using abstract interpretation [10, 1]. It can be regarded as an approximation to time complexity analysis; most l... |

19 |
Disjunctive strictness analysis
- Jensen
- 1992
(Show Context)
Citation Context |

11 | Strictness and totality analysis
- Nielson, Solberg, et al.
- 1994
(Show Context)
Citation Context ...is with Conjunction Kirsten Lackner Solberg Computer Science Department Aarhus University, Denmark e-mail: kls@daimi.aau.dk February 1, 1995 Abstract We extend the strictness and totality analysis of =-=[12]-=- by allowing conjunction at all levels rather than at the top-level. We prove the strictness and totality analysis correct with respect to a denotational semantics and finally construct an algorithm f... |

10 | A type-based framework for program analysis
- Hankin, Metayer
- 1994
(Show Context)
Citation Context ...cs The reason for choosing a lazy semantics is to capture the semantics of "reallife " lazy functional programming languages like Miranda [13] in contrast to most other papers on strictness =-=analysis ([3, 5]-=-). The semantics in [12] is a naturalstyle operational semantics where the terms are evaluated to weak head normal form (abbreviated WHNF), i.e. to constants or lambda-abstractions. Here we will defin... |

10 |
Reduction Types and Intensionality in the Lambda-Calculus
- Wright
- 1992
(Show Context)
Citation Context ...d to iterate n \Gamma q times more to get the property / oe n for the fixpoint. Example 1 We can infer ` fix x Int .x Int : b Int which is more precise than the informations? Int obtained by [15]; in =-=[16]-=- it can be done. In the systems of [2, 6, 7, 16] one can infer the property ? Int for the term fix x Int .7 whereas we can infer the more precise property n Int . In this system (as well as those of [... |

4 |
Strictness Analysis of Functional Programs
- Benton
- 1993
(Show Context)
Citation Context |