DeepAI AI Chat
Log In Sign Up

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

04/15/2022
by   Nikolai Kudasov, et al.
JSC Innopolis
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/26/2021

EOLANG and phi-calculus

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

A prototype-based approach to object reclassification

We investigate, in the context of functional prototype-based lan- guages...
09/15/2022

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...
01/10/2013

Toward General Analysis of Recursive Probability Models

There is increasing interest within the research community in the design...
04/21/2022

Decomposition Without Regret

Programming languages are embracing both functional and object-oriented ...
08/17/2017

Towards Algorithmic Typing for DOT

The Dependent Object Types (DOT) calculus formalizes key features of Sca...
08/05/2018

On the Distributability of Mobile Ambients (Technical Report)

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