Please use this identifier to cite or link to this item:
|Title:||Translation and optimization for a core calculus with exceptions||Authors:||David, C.
|Issue Date:||2009||Citation:||David, C.,Gherghina, C.,Chin, W.N. (2009). Translation and optimization for a core calculus with exceptions. Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation, PEPM'09 : 41-50. ScholarBank@NUS Repository. https://doi.org/10.1145/1480945.1480952||Abstract:||A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies to omit some of the fancy features. For instance, exception handling is an important aspect of programming languages that is instrumental for building robustsoftware with good error handling capability. However, exceptions are often omitted during the initial formulation on program analysis and optimization. Moreover, when considering the traditional approach of converting programs from high level languages to machine code, the target code is meant for the machine, being too cryptic(or low level) for program analysis. Our goal is to design an intermediate,minimal but expressive, core calculus which can be easily analysed and manipulated, and to show that this calculus can handle major language features by translating a significant imperative source language into it. The translation to the core calculus enables us to easily analys and optimize the code, while not sacrificing the flexibility and rich characteristic of the source language. © 2009 ACM.||Source Title:||Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation, PEPM'09||URI:||http://scholarbank.nus.edu.sg/handle/10635/41260||ISBN:||9781605583273||DOI:||10.1145/1480945.1480952|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2019
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.