Constructive Foundations for Featherweight Java

Authors:
Thomas Studer
Affiliations:
-
Venue:
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Year:
2001

Citing 23
Cited 1

A static type system for message passing

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Logics for termination and correctness of functional programs, II. logic of strength PRA

Proof theory
A calculus for overloaded functions with subtyping

Information and Computation
Object-oriented programming: a unified foundation

Object-oriented programming: a unified foundation
Javalight is type-safe—definitely

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A little Java, a few patterns

A little Java, a few patterns
Reasoning about Java classes: preliminary report

Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Is the Java type system sound?

Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
Featherweight Java: a minimal core calculus for Java and GJ

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Comparing object encodings

Information and Computation
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom

Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
The Java Language Specification

The Java Language Specification
A Programmer's Reduction Semantics for Classes and Mixins

Formal Syntax and Semantics of Java
Dynamic Denotational Semantics of Java

Formal Syntax and Semantics of Java
Proving Java Type Soundness

Formal Syntax and Semantics of Java
An Event-Based Structural Operational Semantics of Multi-Threaded Java

Formal Syntax and Semantics of Java
A Semantics for Lambda&-early: A Calculus with Overloading and Early Binding

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Jam - A Smooth Extension of Java with Mixins

ECOOP '00 Proceedings of the 14th European Conference on Object-Oriented Programming
The KeY Approach: Integrating Object Oriented Design and Formal Verification

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Call-by-Value, Call-by-Name and the Logic of Values

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Induction in the Elementary Theory of Types and Names

CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages

Journal of Functional Programming

Semantic Types and Approximation for Featherweight Java

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 proof-theoretically 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.