Sciweavers

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

17

DAGSTUHL
2001

favoriteEmaildiscussreport

135views Software Engineering» more DAGSTUHL 2001»

Constructive Foundations for Featherweight Java

13 years 6 months ago

Constructive Foundations for Featherweight Java

Download www.iam.unibe.ch

In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli and Longo in a predicative theory of types and names. Although this theory is prooftheoretically weak, it allows to prove many properties of programs written in Featherweight Java. This underpins Feferman's thesis that impredicative assumptions are not needed for computational practice.

Thomas Studer

Real-time Traffic

DAGSTUHL 2001 | DAGSTUHL 2007 | Featherweight Java | Object Model | Recursion-theoretic Denotational Semantics |

claim paper

Related Content

» Safe Commits for Transactional Featherweight Java

» Typepreserving compilation of Featherweight Java

» Implementing software product lines using traits

» Union types for objectoriented programming

» Metaprogramming with Traits

» Extending Java for Package based Access Control

» Principal typings for Javalike languages

» Trace effects and object orientation

» Component nextgen a sound and expressive component framework for java

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	DAGSTUHL
Authors	Thomas Studer

Comments (0)