Testing versus proving in climate impact research
Uloženo v:
| Název: | Testing versus proving in climate impact research |
|---|---|
| Autoři: | Ionescu, Cezar, Jansson, Patrik, 1972 |
| Zdroj: | Leibniz International Proceedings in Informatics, LIPIcs. 19:41-54 |
| Témata: | dependently-typed programming, formalization, climate impact research, domain-specific languages |
| Popis: | Higher-order properties arise naturally in some areas of climate impact research. For example, "vulnerability measures", crucial in assessing the vulnerability to climate change of various regions and entities, must fulfill certain conditions which are best expressed by quantification over all increasing functions of an appropriate type. This kind of property is notoriously difficult to test. However, for the measures used in practice, it is quite easy to encode the property as a dependent type and prove it correct. Moreover, in scientific programming, one is often interested in correctness "up to implication": the program would work as expected, say, if one would use real numbers instead of floating-point values. Such counterfactuals are impossible to test, but again, they can be easily encoded as types and proven. We show examples of such situations (encoded in Agda), encountered in actual vulnerability assessments. |
| Popis souboru: | electronic |
| Přístupová URL adresa: | https://research.chalmers.se/publication/167769 http://publications.lib.chalmers.se/records/fulltext/167769/local_167769.pdf |
| Databáze: | SwePub |
Nájsť tento článok vo Web of Science | Abstrakt: | Higher-order properties arise naturally in some areas of climate impact research. For example, "vulnerability measures", crucial in assessing the vulnerability to climate change of various regions and entities, must fulfill certain conditions which are best expressed by quantification over all increasing functions of an appropriate type. This kind of property is notoriously difficult to test. However, for the measures used in practice, it is quite easy to encode the property as a dependent type and prove it correct. Moreover, in scientific programming, one is often interested in correctness "up to implication": the program would work as expected, say, if one would use real numbers instead of floating-point values. Such counterfactuals are impossible to test, but again, they can be easily encoded as types and proven. We show examples of such situations (encoded in Agda), encountered in actual vulnerability assessments. |
|---|---|
| ISBN: | 3939897493 9783939897491 |
| ISSN: | 18688969 |
| DOI: | 10.4230/LIPIcs.TYPES.2011.41 |