A cost-effective estimation of uncaught exceptions in Standard ML programs

DOI10.1016/S0304-3975(00)00317-0zbMath0996.68029OpenAlexW2161567720MaRDI QIDQ1605229

Kwangkeun Yi, Sukyoung Ryu

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00317-0

zbMATH Keywords

SML programs

Mathematics Subject Classification ID

Theory of programming languages (68N15) General topics in the theory of software (68N01)

Related Items (3)

What is the meaning of these constant interruptions? ⋮ Set-based access conflict analysis of concurrent workflow definition ⋮ A proof method for the correctness of modularized 0CFA

Uses Software

• ML

Cites Work

• Type inference for polymorphic references
• A theory of type polymorphism in programming
• Safety analysis versus type inference
• Unnamed Item
• Unnamed Item

This page was built for publication: A cost-effective estimation of uncaught exceptions in Standard ML programs