PlumX Metrics
Embed PlumX Metrics

Strictness, totality, and non-standard-type inference

Theoretical Computer Science, ISSN: 0304-3975, Vol: 272, Issue: 1, Page: 69-112
2002
  • 13
    Citations
  • 0
    Usage
  • 7
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    13
    • Citation Indexes
      13
  • Captures
    7

Article Description

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 refined than the information given by the two separate systems, cannot be effectively used. A main feature of our approach is that all the results are proved by relying directly on the operational semantics of the programming language considered. This leads to a rather direct presentation which involves relatively little mathematical overhead.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know