Strictness, totality, and non-standard-type inference
Theoretical Computer Science, ISSN: 0304-3975, Vol: 272, Issue: 1, Page: 69-112
2002
- 13Citations
- 7Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
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.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0304397500003480; http://dx.doi.org/10.1016/s0304-3975(00)00348-0; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=0037028520&origin=inward; http://linkinghub.elsevier.com/retrieve/pii/S0304397500003480; http://api.elsevier.com/content/article/PII:S0304397500003480?httpAccept=text/xml; http://api.elsevier.com/content/article/PII:S0304397500003480?httpAccept=text/plain; https://linkinghub.elsevier.com/retrieve/pii/S0304397500003480; https://api.elsevier.com/content/article/PII:S0304397500003480?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0304397500003480?httpAccept=text/plain; http://dx.doi.org/10.1016/s0304-3975%2800%2900348-0; https://dx.doi.org/10.1016/s0304-3975%2800%2900348-0
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know