Strictness, totality, and non-standard-type inference

In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness results for both the strictness and the totality-type entailment relations. We also study the interactions between strictness and totality analyses, showing that the information obtainable by a system that combines the two analyses, even though more re

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Mario Coppo, Ferruccio Damiani, Paola Giannini
• Keywords: Non-standard-type Inference Systems, TCS 2002, Theoretical Computer Science, Totality Analyses, Totality-type Entailment Relations