Displaying similar documents to “Domain-Free λµ-Calculus”

Some results on complexity of μ-calculus evaluation in the black-box model

Paweł Parys (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We consider -calculus formulas in a normal form: after a prefix of fixed-point quantifiers follows a quantifier-free expression. We are interested in the problem of evaluating (model checking) such formulas in a powerset lattice. We assume that the quantifier-free part of the expression can be any monotone function given by a black-box – we may only ask for its value for given arguments. As a first result we prove that when the lattice is fixed, the problem becomes polynomial (the assumption...

A test-set for -power-free binary morphisms

F. Wlazinski (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

A morphism is -power-free if and only if is -power-free whenever is a -power-free word. A morphism is -power-free up to if and only if is -power-free whenever is a -power-free word of length at most . Given an integer ≥ 2, we prove that a binary morphism is -power-free if and only if it is -power-free up to . This bound becomes linear for primitive morphisms: a binary primitive morphism is -power-free if and only if it is -power-free up to ...

Equations on partial words

Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

It is well-known that some of the most basic properties of words, like the commutativity () and the conjugacy (), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution. For instance, the equation has only periodic solutions in a free monoid, that is, if holds with integers , then there exists a word such that are powers of . This result, which received a lot of attention, was first proved by Lyndon...

Dimension reduction for functionals on solenoidal vector fields

Stefan Krömer (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We study integral functionals constrained to divergence-free vector fields in on a thin domain, under standard -growth and coercivity assumptions, 1    ∞. We prove that as the thickness of the domain goes to zero, the Gamma-limit with respect to weak convergence in is always given by the associated functional with convexified energy density wherever it is finite. Remarkably, this happens despite the fact that relaxation of nonconvex functionals subject...

Encoding FIX in Object Calculi

Roy L. Crole (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that the type theory introduced by Crole and Pitts [3] can be encoded in variants of Abadi and Cardelli's object calculi. More precisely, we show that the type theory presented with judgements of both equality and operational reduction can be translated into object calculi, and the translation proved sound. The translations we give can be seen as using object calculi as a metalanguge within which can be represented; an analogy can be drawn with Martin Löf's Theory of Arities...

On an algorithm to decide whether a free group is a free factor of another

Pedro V. Silva, Pascal Weil (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

We revisit the problem of deciding whether a finitely generated subgroup is a free factor of a given free group . Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of and exponential in the rank of . We show that the latter dependency can be made exponential in the rank difference rank - rank, which often makes a significant change.

Denotational aspects of untyped normalization by evaluation

Andrzej Filinski, Henning Korsholm Rohde (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that the standard normalization-by-evaluation construction for the simply-typed -calculus has a natural counterpart for the untyped -calculus, with the central type-indexed logical relation replaced by a “recursively defined” , in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal forms,...

Dimension reduction for functionals on solenoidal vector fields

Stefan Krömer (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We study integral functionals constrained to divergence-free vector fields in on a thin domain, under standard -growth and coercivity assumptions, 1    ∞. We prove that as the thickness of the domain goes to zero, the Gamma-limit with respect to weak convergence in is always given by the associated functional with convexified energy density wherever it is finite. Remarkably, this happens despite the fact that relaxation of nonconvex functionals subject...

Topologies, Continuity and Bisimulations

J. M. Davoren (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

The notion of a is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular significance in work on the formal analysis and verification of , where system properties are expressible by formulas of the modal -calculus or weaker temporal logics. Our purpose here is to give an analysis of the concept of bisimulation, starting with the observation that the zig-zag conditions are suggestive of some form of continuity. We give a topological...