@inproceedings{81da560dec95424cac10409f9777f285,
title = "On strictness and totality",
abstract = "In this paper we present a revised and extended version of the strictness and totality type assignment system introduced by Solberg, Nielson and Nielson in the Static Analysis Symposium {\textquoteright}94. Our main result is that (w.r.t. the possibility of replacing safely a lazy application by a strict one) the strictness and totality information given by this system is equivalent to the information given by two separate systems: one for strictness, and one for totality. This result is interesting from both a theoretical (understanding of the relations between strictness and totality) and a practical (more efficient checking and inference algorithms) point of view. Moreover we prove that both the system for strictness and the system for totality have a sound and complete inclusion relation between types w.r.t. the semantics induced by the term model of a language including a convergence to weak head normal form test at higher types.",
author = "Mario Coppo and Ferruccio Damiani and Paola Giannini",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 3rd International Symposium on Theoretical Aspects of Computer Software, TACS 1997 ; Conference date: 23-09-1997 Through 26-09-1997",
year = "1997",
doi = "10.1007/BFb0014550",
language = "English",
isbn = "354063388X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "138--164",
editor = "Mart{\'i}n Abadi and Takayasu Ito",
booktitle = "Theoretical Aspects of Computer Software - 3rd International Symposium, TACS 1997, Proceedings",
address = "Germany",
}