It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper we present a novel combination of setsharing with freeness and linearity information, which is characterized by an improved abstract unification operator. We provide a new ab...

This paper summarizes techniques for emulating in Fortran90 the most important object-oriented concepts of C++: classes (including abstract data types, encapsulation and function overloading), inheritance and dynamic dispatching.

In the logic based framework of knowledge representation and reasoning many operators have been defined in order to capture different kinds of change : revision, update, merging and many others. There are close links between revision, update, and merging. Merging operators can be considered as extensions of revision operators to multiple belief bases. And update operators can be considered as p...

machine The parser output is the input of the abstract machine, which outputs the expression value. For example, L{a=*(+(2,2),1) I+(a,a)} results in 8, because a+a=4+4. Some examples of these evaluations are shown below. Let expressions are evaluated using a symbol table, as shown in the examples. In the last example, given the symbol table ’a1b3a2’, (a) occurs twice in the expression. In the m...

This paper compares two scheme-based models of computation on abstract many-sorted algebras A: Feferman’s system ACP(A) of “abstract computational procedures” based on a least fixed point operator, and Tucker and Zucker’s system μPR(A) based on primitive recursion on the naturals together with a least number operator. We prove a conjecture of Feferman that (assuming A contains sorts for natural...

We give a new characterization of the solvability of an abstract Cauchy problems in terms of moment sequences, using the resolvent operator at only one point.

In this paper we develop an algebraic framework for studying semantics of nonmonotonic logics. Our approach is formulated in the language of lattices, bilattices, operators and xpoints. The goal is to describe xpoints of an operator O deened on a lattice. The key intuition is that of an approximation, a pair (x; y) of lattice elements which can be viewed as an approximation to each lattice elem...

Abstract. We introduce a numerical radius operator space (X,Wn). The conditions to be a numerical radius operator space are weaker than the Ruan’s axiom for an operator space (X,On). Let w(·) be the numerical radius norm on B(H). It is shown that if X admits a norm Wn(·) on the matrix space Mn(X) which satisfies the conditions, then there is a complete isometry, in the sense of the norms Wn(·) ...

In this paper we develop an algebraic framework for studying semantics of nonmonotonic logics. Our approach is formulated in the language of lattices, bilattices, operators and xpoints. The goal is to describe xpoints of an operator O deened on a lattice. The key intuition is that of an approximation, a pair (x; y) of lattice elements which can be viewed as an approximation to each lattice elem...

Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution opera...