A DomainIndependent Framework for the Analysis of the CCP Language AKL (extended abstract).pdfVIP

A DomainIndep endent Framework for the Analysis of the CCP Language AKL extended abstract Per Brand 1 and Thomas Sjoland 1 Swedish Institute of Computer Science Box S Kista Sweden Abstract A domainindep end ent framework for the analysis of the con current constraint programming language AKL is presented It is based on an abstraction of the op erational semantics of AKL Issues of syn chronisation and pruning are not treated Intro duction Analysis works for concurrent logic programming languages have o ccurred eg in all of which relating to at languages In the ESPRIT pro ject ParForce we develop ed a framework for analysis of typ e and alias in AKL programs The framework presented here is a generalisation of the one we presented in An analysis system for the concurrent constraint language AKL should mo del also concurrency and deep guards and not dep end on the se quential execution order All analysis results should b e valid also for a parallel implementation of AKL and for other constraint systems than term con straints Denitions Sequences are app ended with eg e e e is a sequence of three subse 1 2 3 quences sometimes omitted stands for an empty sequence An element is also considered as a sequence Vars is a denumerably innite set of variables fv ji g Cons is a denumer i ably innite set of term constructors fc ji g Each term constructor has an i arity Structs is the set of compound terms N t