DMCA
Strictness logic and polymorphic invariance (1992)
Cached
Download Links
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. Logical Found. Comp. Sci |
| Citations: | 16 - 2 self |
BibTeX
@INPROCEEDINGS{Benton92strictnesslogic,
author = {P. N. Benton},
title = {Strictness logic and polymorphic invariance},
booktitle = {In Proc. Logical Found. Comp. Sci},
year = {1992},
pages = {33--44}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets of domains. The axiomatisation of the lattice of strictness properties is shown to be sound and complete, and we then give a program logic for assigning properties to terms. This places work on strictness analysis via type inference on a firm theoretical foundation. We then use proof theoretic techniques to show how the derivable strictness properties of different instances of polymorphically typed terms are related. 1
Keyphrases
polymorphic invariance strictness logic proof theoretic technique different instance logic arises typed lambda term strictness analysis certain closed subset derivable strictness property inclusion order higher-order strictness property firm theoretical foundation strictness property type inference program logic
