Merging regular processes by means of fixed-point theory

Local Type Reconstruction by Means of Symbolic Fixed Point Iteration

We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typings. Although this set in general does not possess a minimal element, it can be represented compactly by means of symbolic expressions in normal form – such expressions have the property that once values for the constraint var...

Relative Fixed Point Theory

The Lefschetz fixed point theorem and its converse have many generalizations. One of these generalizations is to endomorphisms of a space relative to a fixed subspace. In this paper we define relative Lefschetz numbers and Reidemeister traces using traces in bicategories with shadows. We use the functoriality of this trace to identify different forms of these invariants and to prove a relative ...

Non-regular fixed-point logics and games

Learning Stochastic Regular Grammars by Means of a State Merging Method

Epsilon Nielsen Fixed Point Theory

Let f : X → X be a map of a compact, connected Riemannian manifold, with or without boundary. For > 0 sufficiently small, we introduce an -Nielsen number N ( f ) that is a lower bound for the number of fixed points of all self-maps of X that are -homotopic to f . We prove that there is always a map g : X → X that is -homotopic to f such that g has exactlyN ( f ) fixed points. We describe proced...