A functional theory of exceptions
From MaRDI portal
Publication:913477
DOI10.1016/0167-6423(90)90056-JzbMath0699.68022OpenAlexW1985220128WikidataQ59447202 ScholiaQ59447202MaRDI QIDQ913477
Publication date: 1990
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(90)90056-j
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items
Unnamed Item ⋮ Unifying Theories of Programming with Monads ⋮ Comprehending monads ⋮ A system of constructor classes: overloading and implicit higher-order polymorphism ⋮ Contributions to a computational theory of policy advice and avoidability ⋮ Typed generic traversal with term rewriting strategies ⋮ On extensibility of proof checkers ⋮ A new framework for declarative programming ⋮ Structured handling of scoped effects ⋮ A System F with Call-by-Name Exceptions ⋮ Fault-tolerant functional reactive programming (extended version) ⋮ Calculating correct compilers ⋮ Sparse matrix representations in a functional language ⋮ What is the meaning of these constant interruptions? ⋮ The worker/wrapper transformation ⋮ Exits in the refinement calculus
