We present a new system of intersection types for a composition-free calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical intersection types system, which characterized head normalization and weak normalization, but was not...

We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.

We present a formal method of functional program develop ment based on step by step transformation In their most abstract form speci cations are essentially predicates that relate the result of the speci ed program to the free variables of that pro gram In their most concrete form speci cations are simply programs in a functional programming language Development from abstract speci cations to p...

We address the problem of complementing higher-order patterns without repetitions of free variables. Diierently from the rst-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a nite set of patterns. We therefore generalize the simply-typed-calculus to include an internal notion of strict function so that we can directly express that a term must de...

We investigate parameter synthesis in the context of temporalepistemic logic. We introduce CTLPK, a parametric extension to the branching time temporal-epistemic logic CTLK with free variables representing groups of agents. We give algorithms for automatically synthesising the groups of agents that make a given parametric formula satisfied. We discuss an implementation of the technique on top o...

?2. Definitions. The language of the A-calculus has an alphabet containing denumerably many variables a, b, c, . . . (which have a standard listing e1, e2,. . improper symbols A, ( , ) and a single predicate symbol = for equality. Terms are defined inductively by the following: (1) A variable is a term. (2) If M and N are terms, so is (MN); it is called a combination. (3) If M is a term and x i...

In this paper, we present a further liberalization of the-rule in free variable semantic tableaux. It is eeective in that (1) it is both a natural and intuitive liberalization, and (2) can reduce the proof size non elementarily as compared to previous versions of the-rule.

Systems of set constraints are a natural formalism for many problems in program analysis. Set constraints are also a generalization of tree automata. We present an algorithm for solving systems of set constraints built from free variables, constructors, and the set operations of intersection, union, and complement. Furthermore, we show that all solutions of such systems can be nitely represented.

We present a new method to represent variable bindings in the Warren Abstract Machine WAM so that ages of variable bindings can be easily found using this new representation The age of a variable bound to a ground term will be the youngest choice point such that backtracking to that choice point can make that variable an unbound variable again In other words the age of a variable bound to a gro...

A particular case of a chattering-free variable structure control (VSC) — the equivalent t-suboptimal control — was recently presented for a mechatronic system with one degree of freedom [1]. In this paper, the same principle reducing the drawbacks of conventional VSC design has been applied to the trajectory tracking control of a non-redundant rigid 3-segment leg dynamics. The efficacy and rob...