Résumé
This paper presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a non-standard type system, using rows to approximate both the flow of escaping exceptions (a la effect systems) and the flow of result values (a la control-flow analyses). The resulting analysis is efficient and precise; in particular, arguments carried by exceptions are accurately handled.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 276-290 |
| Nombre de pages | 15 |
| journal | Conference Record of the Annual ACM Symposium on Principles of Programming Languages |
| Les DOIs | |
| état | Publié - 1 janv. 1999 |
| Modification externe | Oui |
| Evénement | The 1999 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, POPL'99 - San Antonio, TX, USA Durée: 20 janv. 1999 → 22 janv. 1999 |
Empreinte digitale
Examiner les sujets de recherche de « Type-based analysis of uncaught exceptions ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver