Jiří Zlatuška

Stepping Stones to an Information Society

The information revolution is radically transforming lots of patterns along which society and enterprises have traditionally worked. These changes do not bring just minor technological improvements, but indeed a fundamental transformation of the industry-based society into an information-based one. The changes are most visible and documented within the business world, but the synergy between technological and social shifts does not stop there. In this paper we try to identify and summarize key trends and challenges which this development puts before us.

Linear Logic Semantics for Concurrent Prolog

This paper develops a proof-theoretic semantics based on linear logic for Concurrent Prolog. Several fragments of linear logic are used in order to provide for a suitable translation of Concurrent Prolog clauses, with the committed-choice concurrency features captured by the properties of linear logic provability rather than by some additional mechanism and without the need of using the interleaving approach for defining concurrent behaviour. Linear logic operations from different fragments arise naturally from the need for specific features of the translation. It is demonstrated that the relationship between a logic programming language, such as Prolog, and a committed-choice concurrent logic one, such as Concurrent Prolog, can be understood as a change of the underlying logic inference, rather than by resorting to extra-logical machinery.

Modelling inheritance in a strongly typed functional model

When dealing with data models for information systems, distinctions of various kinds can be made among them based on particular criteria of classification. There seems to be a rather general consensus that the object-oriented data models fall within the class of procedural (non-declarative) data models. This is primarily due to the fact that the essential features of OO data models have been derived from the background of OO programming, while declarative models have been indentified with formalisms based on first-order predicate logic.