Sciweavers

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

18

SFP
2004

favoriteEmaildiscussreport

131views Programming Languages» more SFP 2004»

Calculating an exceptional machine

13 years 6 months ago

Calculating an exceptional machine

Download www.cs.nott.ac.uk

: In previous work we showed how to verify a compiler for a small language with exceptions. In this article we show how to calculate, as opposed to an abstract machine for this language. The key step is the use of Reynold's defunctionalization, an old program transformation technique that has recently been rejuvenated by the work of Danvy et al.

Graham Hutton, Joel Wright

Real-time Traffic

Danvy Et Al | Program Transformation Technique | Programming Languages | SFP 2004 | Small Language |

claim paper

Related Content

» Covering Numbers for Support Vector Machines

» Calculation of Local Iron Loss in Electrical Machines Using Finite Elements Method

» FailureAware Construction and Reconfiguration of Distributed Virtual Machines for High Ava...

» Machine and acoustical condition dependency analyses for fast acoustic likelihood calculat...

» Temporal Exception Prediction for Loops in Resource Constrained Concurrent Workflows

» Fast time series classification using numerosity reduction

» Distribution of irreducible polynomials of small degrees over finite fields

» An MG1 queue with Markovdependent exceptional service times

» Statistical tests to compare motif count exceptionalities

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SFP
Authors	Graham Hutton, Joel Wright

Comments (0)