Results 1 
2 of
2
A Unified Approach to Fully Lazy Sharing
 In POPL
, 2012
"... We give an axiomatic presentation of sharingvialabelling for weak λcalculi, that allows to formally compare many different approaches to fully lazy sharing, and obtain two important results. We prove that the known implementations of full laziness are all equivalent in terms of the number of βre ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We give an axiomatic presentation of sharingvialabelling for weak λcalculi, that allows to formally compare many different approaches to fully lazy sharing, and obtain two important results. We prove that the known implementations of full laziness are all equivalent in terms of the number of βreductions performed, although they behave differently regarding the duplication of terms. We establish a link between the optimality theories of weak λcalculi and firstorder rewriting systems by expressing fully lazy λlifting in our framework, thus emphasizing the firstorder essence of weak reduction. This technical report extends [Bal12] with comprehensive proofs. 1
A Generic ObjectCalculus Based on Addressed Term Rewriting Systems
, 2001
"... We describe the foundations of Obj +a , a framework, or generic calculus, for modeling objectcalculi. This framework is essentially a detailed formal operational semantics of object based languages, in the style of the Lambda Calculus of Objects. As a formalism for specication Obj +a is arra ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We describe the foundations of Obj +a , a framework, or generic calculus, for modeling objectcalculi. This framework is essentially a detailed formal operational semantics of object based languages, in the style of the Lambda Calculus of Objects. As a formalism for specication Obj +a is arranged in modules, permitting a natural classication of many objectbased calculi according to their features. In particular there are modules for calculi of nonmutable objects (i.e., functional objectcalculi) and for calculi of mutable objects (i.e., imperative objectcalculi). As a computational formalism Obj +a is based on rewriting rules. Classical rstorder term rewriting systems are not appropriate since we want to reect aspects of implementation practice such as sharing, cycles in data structures and mutation. Therefore we dene the notion of addressed terms, and develop the corresponding notion of addressed term rewriting. CONTENTS 2 Contents 1 Introduction 3 1.1 Ad...