On normalization by evaluation for object calculi

Authors:
J. Schwinghammer
Affiliations:
Programming Systems Lab, Saarland University, Saarbrücken, Germany
Venue:
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Year:
2007

Citing 13
Cited 0

A Theory of Objects

A Theory of Objects
Normalization and Partial Evaluation

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A Delegation-based Object Calculus with Subtying

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Reduction-free normalisation for a polymorphic system

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intuitionistic model constructions and normalization proofs

Mathematical Structures in Computer Science
Semantics and logic of object calculi

Theoretical Computer Science - Logic, semantics and theory of programming
Operational aspects of untyped Normalisation by Evaluation

Mathematical Structures in Computer Science
Alpha-structural recursion and induction

Journal of the ACM (JACM)
On a monadic semantics for freshness

Theoretical Computer Science - Applied semantics: Selected topics
Characterizing convergent terms in object calculi via intersection types

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Relational reasoning in a nominal semantics for storage

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Reducibility and ⊤⊤-lifting for computation types

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a procedure for computing normal forms of terms in Abadi and Cardelli's functional object calculus. Even when equipped with simple types, terms of this calculus are not terminating in general, and we draw on recent ideas about the normalization by evaluation paradigm for the untyped lambda calculus. Technically, we work in the framework of Shinwell and Pitts' FM-domain theory, which leads to a normalization procedure for the object calculus that is directly implementable in a language like Fresh O'Caml.