Asynchronous Exceptions as an Effect

Authors:
William L. Harrison;Gerard Allwein;Andy Gill;Adam Procter
Affiliations:
Dept. of Computer Science, University of Missouri, Columbia, U.S.A;Naval Research Laboratory, Washington, U.S.A DC 20375;Galois, Inc., Beaverton, U.S.A OR 97005;Dept. of Computer Science, University of Missouri, Columbia, U.S.A
Venue:
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Year:
2008

Citing 23
Cited 1

Denotational semantics: a methodology for language development

Denotational semantics: a methodology for language development
Notions of computation and monads

Information and Computation
The essence of functional programming

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Imperative functional programming

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic Lego

Semantic Lego
A semantics for imprecise exceptions

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
QuickCheck: a lightweight tool for random testing of Haskell programs

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Asynchronous exceptions in Haskell

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Mathematical Theory of Program Correctness

Mathematical Theory of Program Correctness
A Typed Interrupt Calculus

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Metacomputation-Based Compiler Architecture

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Modular monadic semantics and compilation

Modular monadic semantics and compilation
Stack size analysis for interrupt-driven programs

Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
My recollections of operating system design

ACM SIGOPS Operating Systems Review
A principled approach to operating system construction in Haskell

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Modelling deterministic concurrent I/O

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Terms with unbounded demonic and angelic nondeterminacy

Science of Computer Programming
Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Beauty in the beast

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
What is the meaning of these constant interruptions?

Journal of Functional Programming
Achieving information flow security through monadic control of effects

Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
The essence of multitasking

AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology

Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software

DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Asynchronous interrupts abound in computing systems, yet they remain a thorny concept for both programming and verification practice. The ubiquity of interrupts underscores the importance of developing programming models to aid the development and verification of interrupt-driven programs. The research reported here recognizes asynchronous interrupts as a computational effect and encapsulates them as a building block in modular monadic semantics. The resulting modular semantic model can serve as both a guide for functional programming with interrupts and as a formal basis for reasoning about interrupt-driven computation as well.