Finite automata are the basis of many veriication methods and tools for process algebras. It is however undecidable in most process algebras whether the semantics of a given term is nite. We give suucient niteness conditions derived from the analysis of the operational rules of the algebra operators. From these rules we also generate the functions that compute automata from terms of the algebra...

We investigate a 4D analog of 2D WZW theory. The theory turns out to have surprising niteness properties and an innnite-dimensional current algebra symmetry. Some correlation functions are determined by this symmetry. One way to deene the theory systematically proceeds by the quantization of moduli spaces of holomorphic vector bundles over algebraic surfaces. We outline how one can deene vertex...

Every \practical" programming language supplies the programmer with at least one nonstrict construct, such as the ALGOL60 arithmeticìf-then-else' and the LISP`cond'. Many programming languages also enable the user to deene nonstrict functions. In some languages, this is accomplished through the lazy evaluation of procedure parameters, as realized, for example, by the call-by-name devices of ALG...

A partial deduction strategy for logic programs usually uses an abstraction operation to guarantee the niteness of the set of atoms for which partial deductions are produced. Finding an abstraction operation which guarantees niteness and does not loose relevant information is a diicult problem. In earlier work Gallagher and Bruynooghe proposed to base the abstraction operation on characteristic...

We consider the theory of database queries on a relational data model that includes a set of xed relations used to model arithmetic comparisons and operations. We describe how to extend several natural query languages such as rst-order logic, Datalog, and stratiied Datalog to apply to databases in this model, and show that their relative expressive power is the same as it is for the standard re...