Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

MPC
2004
Springer

favoriteEmaildiscussreport

161views Mathematics» more MPC 2004»

Compiling Exceptions Correctly

13 years 10 months ago

Compiling Exceptions Correctly

Download www.cs.nott.ac.uk

Exceptions are an important feature of modern programming languages, but their compilation has traditionally been viewed as an advanced topic. In this article we show that the basic method of compiling exceptions using stack unwinding can be explained and veriﬁed both simply and precisely, using elementary functional programming techniques. In particular, we develop a compiler for a small language with exceptions, together with a proof of its correctness.

Graham Hutton, Joel Wright

Real-time Traffic

Elementary Functional Programming | Important Feature | Mathematics | Modern Programming Languages | MPC 2004 |

claim paper

Related Content

» What is the meaning of these constant interruptions

» More Advice on Proving a Compiler Correct Improve a Correct Compiler

» DRFX a simple and efficient memory model for concurrent programming languages

» A Verified Compiler for an Impure Functional Language

» Efficient exception handling in Java bytecodetoC aheadoftime compiler for embedded systems

» Improving Program Correctness with Atomic Exception Handling

» Practical Exception Specifications

» Defeasible Logic on an Embedded Microcontroller

» Combining Knowledge Compilation and Search for Conformant Probabilistic Planning

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	MPC
Authors	Graham Hutton, Joel Wright

Comments (0)