In the pursuit of this goal, we intend to take full advantage of concurrent constraint programming techniques made possible by Oz and to investigate novel constraint-based formulations of parsing. A programming model consists of a small number of orthogonal constructs for the modelling of programming abstractions. The starting point for the NEP project is the gamma calculus and the concurrent programming language Oz built on top of it. The gamma calculus is an inherently concurrent programming model which builds on concepts from the pi calculus and from concurrent constraint programming. The gamma calculus subsumes functional computation and allows one to express a variety of programming abstractions.
Emphasis is put on the combination of logics and constraint systems.
Topics are the combination of logics and constraints of particular interest, the investigation of new symbolic constraints and their combination, and new theorem proving techniques which take advantage of constraints. The aim of this project is to find a schedule for tasks to be sent on a data bus. Tasks may be periodic or aperiodic. The schedule must fit into a given time window, which is repeated with a given frequency on the data bus. The goal of this project is to build a parallel implementation of Oz, which makes concurrent activities of an Oz program executing in parallel.