The deenition of a class C of functions is syntactic if membership to C can be decided from the construction of its elements. Syntactic characterizations of PTIMEF, of PSPACEF, of the polynomial hierarchy PH, and of its subclasses p n are presented. They are obtained by progressive restrictions of recursion in Lisp, and may be regarded as predicative according to a foundational point raised by ...

In the past few years Tcl has found widespread interest as a extensible scripting language. Numerous Tcl interfaces for a variety of C libraries have been created. While most of these language bindings have been created by hand, others have made use of dedicated code generators designed for the specific library. In this paper we present a tool for the automatic generation of Tcl language bindin...

This paper seeks to establish within a formal framework how Coloured Petri Nets can be enhanced to produce Object Petri Nets. It does so by defining a number of intermediate Petri Net formalisms and identifying the features introduced at each step of the development. Object Petri Nets support a complete integration of object-oriented concepts into Petri Nets, including inheritance and the assoc...

This paper establishes a strong completeness property of compositional program logics for pure and imperative higher-order functions introduced in [2, 15–18]. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former’s behaviour up to the standard observational semantics. This formula is inductively calculable from the program t...

In this article we introduce a comprehensive set of algebraic laws for rool, a language similar to sequential Java but with a copy semantics. We present a few laws of commands, but focus on the objectoriented features of the language. We show that this set of laws is complete in the sense that it is sufficient to reduce an arbitrary rool program to a normal form expressed in a restricted subset...

This paper investigates the precision of three linearcomplexity type analyses for Java software: Class Hierarchy Analysis (CHA), Rapid Type Analysis (RTA) and Variable Type Analysis (VTA). Precision is measured relative to class targets. Class targets results are useful in the context of the receiver-classes criterion, which is an object-oriented testing strategy that aims to exercise every pos...

Engineering knowledge is characterized by variant and alternative designs for each problem. To alleviate reuse these variants should be captured as classes in the schema. This results in a class hierarchy bloated by many intersection classes, if 'standard' object models are used. This paper proposes a mechanism, called 'aspects', which uses a restricted form of multiple instantiation to avoid i...

In this paper we call for the revival of the study of topological representations in computer vision. Topology allows us to express the connectivity relationships which exist between different primitives in images and in scenes. Although topology was once of significant interest in vision, it has recently become over-shadowed by geometric considerations. We believe that it has a very important ...

In her article "Redefinitions of India and Individuality in Adiga's The White Tiger" Kathleen Waller discusses Indian individualism as being supported by a democratic and secular society, but also stymied by traditions and socioeconomic realities which keep most of its people living in poverty. In The White Tiger, Adiga challenges Indian culture to create a society in which individuals are trul...

A multilingual phonetic representation and analysis system for different speech databases is presented. The need for such a system is first justified and then one is proposed based on the Worldbet phonetic alphabet. A phonetic class hierarchy is developed and a description of the hierarchical structural representation follows. Database access is based on the latter and is accomplished by defini...