论文信息 - Compiling Exceptions Correctly (Extended Version)

Compiling Exceptions Correctly (Extended Version)

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 verified 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 J. Wright | G. Hutton

[1] Simon L. Peyton Jones,et al. State in Haskell , 1995, LISP Symb. Comput..

[2] Simon L. Peyton Jones,et al. Asynchronous exceptions in Haskell , 2001, PLDI '01.

[3] Guy L. Steele,et al. The Java Language Specification , 1996 .

[4] Koen Claessen,et al. QuickCheck: a lightweight tool for random testing of Haskell programs , 2000, ICFP.

[5] James Gosling. The Java Language Specification - Second Edition , 2000 .

[6] Philip Wadler,et al. The essence of functional programming , 1992, POPL '92.

[7] Bjarne Stroustrup,et al. C++ Programming Language , 1986, IEEE Softw..

[8] J. Michael Spivey,et al. A Functional Theory of Exceptions , 1990, Sci. Comput. Program..

[9] James Gosling,et al. The Java Language Specification, 3rd Edition , 2005 .

[10] Peter D. Mosses,et al. Denotational semantics , 1995, LICS 1995.

[11] Samuel N. Kamin,et al. Modular Compilers and Their Correctness Proofs , 2001 .

[12] Simon L. Peyton Jones,et al. A semantics for imprecise exceptions , 1999, PLDI '99.

[13] Peyton Jones,et al. Haskell 98 language and libraries : the revised report , 2003 .

[14] Roland Carl Backhouse. Program Construction: Calculating Implementations from Specifications , 2003 .

[15] David A. Schmidt,et al. Denotationaisemantics: a methodology for language development , 1986 .