Open Access. Powered by Scholars. Published by Universities.®

Programming Languages and Compilers Commons™

Open Access. Powered by Scholars. Published by Universities.®

Chapman University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 31 - 39 of 39

Full-Text Articles in Programming Languages and Compilers

Anomaly-Free Component Adaptation With Class Overriding, Atanas Radenski Jan 2004

Anomaly-Free Component Adaptation With Class Overriding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Software components can be implemented and distributed as collections of classes, then adapted to the needs of specific applications by means of subclassing. Unfortunately, subclassing in collections of related classes may require re-implementation of otherwise valid classes just because they utilize outdated parent classes, a phenomenon that is referred to as the subclassing anomaly. The subclassing anomaly is a serious problem since it can void the benefits of component-based programming altogether. We propose a code adaptation language mechanism called class overriding that is intended to overcome the subclassing anomaly. Class overriding does not create new and isolated derived classes as …

Go to article

The Subclassing Anomaly In Compiler Evolution, Atanas Radenski Jan 2003

The Subclassing Anomaly In Compiler Evolution, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Subclassing in collections of related classes may require re-implementation of otherwise valid classes just because they utilize outdated parent classes, a phenomenon that is referred to as the subclassing anomaly. The subclassing anomaly is a serious problem since it can void the benefits of code reuse altogether. This paper offers an analysis of the subclassing anomaly in an evolving object-oriented compiler. The paper also outlines a solution for the subclassing anomaly that is based on alternative code reuse mechanism, named class overriding.

Go to article

Derivation Of Secure Parallel Applications By Means Of Module Embedding, Atanas Radenski Jan 2000

Derivation Of Secure Parallel Applications By Means Of Module Embedding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

An enhancement to modular languages called module embedding facilitates the development and utilization of secure generic parallel algorithms.

Go to article

Object-Oriented Programming And Parallelism, Atanas Radenski Jan 1998

Object-Oriented Programming And Parallelism, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Initially, object-orientation and parallelism originated and developed as separate and relatively independent areas. During the last decade, however, more and more researchers were attracted by the benefits from a potential marriage of the two powerful paradigms. Numerous research projects and an increasing number of practical applications were aimed at different forms of amalgamation of parallelism with object-orientation. It has been realized that parallelism is a inherently needed enhancement for the traditional object-oriented programming (OOP) paradigm, and that object orientation can add significant flexibility to the parallel programming paradigm.

Go to article

Module Embedding, Atanas Radenski Dec 1997

Module Embedding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

This paper proposes a code reuse mechanism called module embedding that enables the building of new modules from existing ones through inheritance, overriding of procedures, and overriding of types; the paper also describes an implementation scheme for this mechanism. Module embedding is beneficial when modules and classes are used in combination and need to be extended together, or when modules are more appropriate medium than classes.

Go to article

Is Oberon As Simple As Possible?, Atanas Radenski Jan 1994

Is Oberon As Simple As Possible?, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

The design of the programming language Oberon was led by the quote by Albert Einstein: 'make it as simple as possible, but not simpler'. The objective of this paper is to analyze some design solutions and propose alternatives which could both simplify and strengthen the language without making it simpler than possible. The paper introduces one general concept, the module type, which can be used to represent records, modules, and eventually procedures. Type extension is redefined in terms of component nesting and incomplete designators. As a result, type extension supports multiple inheritance.

Go to article

Introducing Objects And Parallelism To An Imperative Programming Language, Atanas Radenski Jan 1994

Introducing Objects And Parallelism To An Imperative Programming Language, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

The problem of enhancing objects with parallelism has been in the focus of numerous research projects in the recent years, but a satisfactory and commonly accepted solution has not appeared yet. A major problematic point seems to be providing inheritance for parallel objects. The general objective of this paper is to contribute to a better understanding of the language design issues in the area of parallel object-oriented programming (OOP) and, in particular, to design a framework for parallel OOP with multiple inheritance. What makes our proposed framework different from the other parallel OOP languages is its easy to use and …

Go to article

Lazy Evaluation And Nondeterminism Make Backus' Fp-Systems More Practical, Atanas Radenski Jan 1987

Lazy Evaluation And Nondeterminism Make Backus' Fp-Systems More Practical, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Backus' FP-systems are made more practical by introducing into them lazy evaluation and nondeterminism. This is done in the framework of a concrete programming language called FP*. From the one hand, this language is almost as mathematical as FP-systems are. From the other hand, it gives the possibility to manage secondary memory and to develop such applications as, for instance, interactive and distributed file systems. Experimental versions of a compiler and an interpreter for the FP* language are implemented.

Go to article

On Some Dependencies Between Functional Forms In Functional Programming Systems, Atanas Radenski Jan 1981

On Some Dependencies Between Functional Forms In Functional Programming Systems, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

In the present paper, some dependencies between functional forms in functional programming systems are demonstrated. It is shown that any functional form can be expressed by using only the forms composition, condition and construction.

Go to article

First Prev