DeepAI AI Chat
Log In Sign Up

Formalizing φ-calculus: a purely object-oriented calculus of decorated objects

by   Nikolai Kudasov, et al.
JSC Innopolis

Many calculi exist for modelling various features of object-oriented languages. Many of them are based on λ-calculus and focus either on statically typed class-based languages or dynamic prototype-based languages. We formalize untyped calculus of decorated objects, informally presented by Bugayenko, which is defined in terms of objects and relies on decoration as a primary mechanism of object extension. It is not based on λ-calculus, yet with only four basic syntactic constructions is just as complete. We prove the calculus is confluent (i.e. possesses Church-Rosser property), and introduce an abstract machine for call-by-name evaluation. Finally, we provide a sound translation to λ-calculus with records.


page 1

page 2

page 3

page 4


EOLANG and phi-calculus

Object-oriented programming (OOP) is one of the most popular paradigms u...

A prototype-based approach to object reclassification

We investigate, in the context of functional prototype-based lan- guages...

A case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning

Many programming languages in the OO tradition now support pattern match...

Toward General Analysis of Recursive Probability Models

There is increasing interest within the research community in the design...

Decomposition Without Regret

Programming languages are embracing both functional and object-oriented ...

Towards Algorithmic Typing for DOT

The Dependent Object Types (DOT) calculus formalizes key features of Sca...

On the Distributability of Mobile Ambients (Technical Report)

Modern society is dependent on distributed software systems and to verif...