Reducing Programs to Objects

Bugayenko, Yegor

doi:10.48550/arxiv.2112.11988

Cited by 4 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…EO language is an object-oriented programming language that relies on decoration instead of inheritance to work with object hierarchies. In [9], Bugayenko showed approaches to encode advanced features of mainstream object-oriented languages in EO. In this subsection, we revisit Bugayenko's ideas [9] regarding encoding mechanisms of code reuse in class-based and prototype-based constructs in terms of -calculus.…”

Section: Modelling Object-oriented Languagesmentioning

confidence: 99%

See 1 more Smart Citation

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

Kudasov¹,

Sim²

2022

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Modelling Object-oriented Languagesmentioning

confidence: 99%

“…In [9], Bugayenko showed approaches to encode advanced features of mainstream object-oriented languages in EO. In this subsection, we revisit Bugayenko's ideas [9] regarding encoding mechanisms of code reuse in class-based and prototype-based constructs in terms of -calculus.…”

Section: Modelling Object-oriented Languagesmentioning

confidence: 99%

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

Kudasov¹,

Sim²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…То есть, наряду с формированием объектов EO, необходимо иметь возможность моделировать поведение памяти языка C как набора байт, а также восстанавливать из байт памяти объекты, над которыми можно осуществлять обработку данных в EO. Ряд подходов, позволяющих использовать в EO не объектно-ориентированные конструкции, были предложены в работе [9].…”

Section: Introductionunclassified

Transformation of C Programming Language Memory Model into Object-Oriented Representation of EO Language

Legalov

Bugayenko

Chuykin

et al. 2022

Model. anal. inf. sist.

View full text Add to dashboard Cite

The paper analyzes the possibilities of transforming C programming language constructs into objects of EO programming language. The key challenge of the method is the transpilation from a system programming language into a language of a higher level of abstraction, which doesn’t allow direct manipulations with computer memory. Almost all application and domain-oriented programming languages disable such direct access to memory. Operations that need to be supported in this case include the use of dereferenced pointers, the imposition of data of different types in the same memory area, and different interpretation of the same data which is located in the same memory address space. A decision was made to create additional EO-objects that directly simulate the interaction with computer memory as in C language. These objects encapsulate unreliable data operations which use pointers. An abstract memory object was proposed for simulating the capabilities of C language to provide interaction with computer memory. The memory object is essentially an array of bytes. It is possible to write into memory and read from memory at a given index. The number of bytes read or written depends on which object is being used. The transformation of various C language constructs into EO code is considered at the level of the compilation unit. To study the variants and analyze the results a transpiler was developed that provides necessary transformations. It is implemented on the basis of Clang, which forms an abstract syntax tree. This tree is processed using LibTooling and LibASTMatchers libraries. As a result of compiling a C program, code in EO language is generated. The considered approach turns out to be appropriate for solving different problems. One of such problems is static code analysis. Such solutions make it possible to isolate low-level code fragments into separate program objects, focusing on their study and possible transformations into more reliable code.

show abstract

An Algorithm for Partial Elimination of Jumps in an Object-Oriented Dataflow Language

Bugayenko,

Lipanin

2023

Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence

View full text Add to dashboard Cite

Reducing Programs to Objects

Cited by 4 publications

References 0 publications

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

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

Transformation of C Programming Language Memory Model into Object-Oriented Representation of EO Language

An Algorithm for Partial Elimination of Jumps in an Object-Oriented Dataflow Language

Contact Info

Product

Resources

About