Java and other system programming languages are not ideal for software agent development on the Internet. We have found it very challenging to produce reliable yet lightweight agent systems. Even basic agents often require colossal amounts of highly complex code. We are addressing this issue by new agent scripting language and an associated execution environment. Taken together, these two devel...

This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context dependence, dynamic binding and subtype polymorphism, late (dynamic) composition, and avoidance of inheritance in favor of object composition — that several authors have defended to be central to black-box object-oriente...

We present a lightweight approach to meta-programming in the functional programming language Haskell. In this approach, meta-programs are constructed with the help of generalised (possibly monadic) folds over the system of datatypes that represents the abstract syntax of the objectlanguage. Such folds are obtained by (1) reusing, refining, and combining basic fold algebras, and (2) feeding the ...

As processing and time requirements of computer systems increase over borders of single processor architectures, it is becoming more and more attractive to use distributed computing with additional real-time capabilities. In several cases, traditional programming languages have become insufficient to build distributed systems easily, especially when real-time issues and basic software quality f...

Imperative programming languages (such as Java) are the most widespread programming languages recently. Besides being quite easy to get familiar with them, they are also perfectly suitable for business software development. Although the productivity of imperative languages is much acclaimed, some problems are much easier to solve in a logical language. The paper introduces a Java language exten...

We explain how programs specified in a sequential programming language can be translated automatically into a digital circuit. The possibility to specify which parts of a program are to be compiled into instruction sequences for a conventional processor, and which ones are to be translated into customized circuits has gained relevance with the advent of large programmable gate arrays (FPGA). Th...

Highly distributed networks have now become a common infrastructure for a new kind of wide-area distributed applications whose key design principle is network awareness, namely the ability to deal with dynamic changes of the network environment. Network-aware computing has called for new programming languages that exploit the mobility paradigm as the basic interaction mechanism. In this paper w...

What will a definitive programming language look like? By definitive language I mean a programming language that gives good solutions at its level of abstraction, allowing computer science researchers to move on and work at higher levels. Given the evolution of computer science as a field with a rising level of abstraction, it is my belief that a small set of definitive languages will eventuall...

C++ was designed to be a systems programming language and has been used for embedded systems programming and other resource-constrained types of programming since the earliest days. This paper will briefly discuss how C++'s basic model of computation and data supports time and space performance, hardware access, and predictability. If that was all we wanted, we could write assembler or C, so I ...

We introduce reference structures { a basic mathematical model of a data organization capable to store and utilize information about its addresses. A propositional labeled modal language is used as a speciication and programming language for reference structures; the satissability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given form...