26,595 research outputs found
A Theory of Explicit Substitutions with Safe and Full Composition
Many different systems with explicit substitutions have been proposed to
implement a large class of higher-order languages. Motivations and challenges
that guided the development of such calculi in functional frameworks are
surveyed in the first part of this paper. Then, very simple technology in named
variable-style notation is used to establish a theory of explicit substitutions
for the lambda-calculus which enjoys a whole set of useful properties such as
full composition, simulation of one-step beta-reduction, preservation of
beta-strong normalisation, strong normalisation of typed terms and confluence
on metaterms. Normalisation of related calculi is also discussed.Comment: 29 pages Special Issue: Selected Papers of the Conference
"International Colloquium on Automata, Languages and Programming 2008" edited
by Giuseppe Castagna and Igor Walukiewic
On Role Logic
We present role logic, a notation for describing properties of relational
structures in shape analysis, databases, and knowledge bases. We construct role
logic using the ideas of de Bruijn's notation for lambda calculus, an encoding
of first-order logic in lambda calculus, and a simple rule for implicit
arguments of unary and binary predicates. The unrestricted version of role
logic has the expressive power of first-order logic with transitive closure.
Using a syntactic restriction on role logic formulas, we identify a natural
fragment RL^2 of role logic. We show that the RL^2 fragment has the same
expressive power as two-variable logic with counting C^2 and is therefore
decidable. We present a translation of an imperative language into the
decidable fragment RL^2, which allows compositional verification of programs
that manipulate relational structures. In addition, we show how RL^2 encodes
boolean shape analysis constraints and an expressive description logic.Comment: 20 pages. Our later SAS 2004 result builds on this wor
Filtered screens and augmented Teichm\"uller space
We study a new bordification of the decorated Teichm\"uller space for a
multiply punctured surface F by a space of filtered screens on the surface that
arises from a natural elaboration of earlier work of McShane-Penner. We
identify necessary and sufficient conditions for paths in this space of
filtered screens to yield short curves having vanishing length in the
underlying surface F. As a result, an appropriate quotient of this space of
filtered screens on F yields a decorated augmented Teichm\"uller space which is
shown to admit a CW decomposition that naturally projects to the augmented
Teichm\"uller space by forgetting decorations and whose strata are indexed by a
new object termed partially oriented stratum graphs.Comment: Final version to appear in Geometriae Dedicat
- …