2022/04/15 by Nikolai Kudasov, Kudasov, Nikolai, Violetta Sim +1
Computer Science · #Advanced Database Systems and Queries #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Programming Languages (cs.PL)
paper · pdf · doi:10.48550/arxiv.2204.07454
openalex publication_date 2022/04/15 · openalex created_date 2022/04/26 · openalex updated_date 2026/07/28
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.