Exception analysis for non-strict languages

DOI10.1145/581478.581488MaRDI QIDQ2949196zbMATH OpenOpenAlexWikidataFDO

Authors Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard

Publication date 7 October 2015

Published in Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/581478.581488

zbMATH Keywords

Boolean constraintseffect systemsexceptionsnon-strict functional programming languagestype inference

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 2087563
• An axiomatic treatment of exception handling in an expression-oriented language
• A specification logic for exceptions and beyond
• A Hoare-like verification system for a language with an exception handling mechanism
• Static analysis for syntax objects
• scientific article; zbMATH DE number 17827
• Strictness analysis and denotational abstract interpretation

Cited in

(6)

• A cost-effective estimation of uncaught exceptions in Standard ML programs
• An abstract interpretation for estimating uncaught exceptions in Standard ML programs
• scientific article; zbMATH DE number 1497772 (Why is no real title available?)
• Eliminating Spurious Error Messages Using Exceptions, Polymorphism, and Higher-Order Functions
• Mathematics of Program Construction
• A functional theory of exceptions

Describes a project that uses

Uses Software

• Haskell
• OCaml
• GHC

This page was built for publication: Exception analysis for non-strict languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949196)