Commit efa1d1fc authored by Pietro Abate's avatar Pietro Abate
Browse files

[r2005-07-24 16:20:53 by beppe] Empty log message

Original author: beppe
Date: 2005-07-24 16:20:53+00:00
parent 986e8c7d
......@@ -14,6 +14,34 @@
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/mini.html">
<title>Minimizing Tree Automata for Unranked Trees</title>
<author>Wim Martens</author>
<author>Joachim Niehren</author>
<comment>10th International Symposium on Database Programming Languages. Submitted.</comment>
<abstract><p>Automata for unranked trees form a foundation for XML schemas,
querying and pattern languages. We study the problem of efficiently
minimizing such automata. We start with the unranked tree automata
(UTAs) that are standard in database theory, assuming bottom-up
determinism and that horizontal recursion is represented by
deterministic finite automata. We show that minimal
UTAs in that class are not unique and that minimization
is NP-hard. We then study more recent automata classes that do allow for
polynomial time minimization. Among those, we show that bottom-up
deterministic stepwise tree automata yield the most succinct
representations.
</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/paper_info.php?label=n-ary-query">
......@@ -27,12 +55,41 @@
<author>Sophie Tison</author>
<comment>Submitted to a conference.. 19th International Workshop on Unification.</comment>
<comment>A previous version has been presented at the 19th International Workshop on Unification.</comment>
<abstract><p>N-ary queries in trees select sets of n-tuples of nodes. We propose and investigate representation formalisms for n-ary queries by tree automata, both for ranked and unranked trees. We show that existential run-based queries capture MSO in the \nary case as well as universal run-based queries. We then investigate queries by unambiguous tree automata that are relevant for query induction. We characterize queries by unambiguous automata by a natural fragment of MSO, show how to decide whether regular queries are definable in that fragment, and how to answer them efficiently in linear time. </p></abstract>
</paper>
</li>
<li>
<paper file="https://www.ps.uni-sb.de/Papers/abstracts/lambdafut.html">
<title>A Concurrent Lambda Calculus with Futures</title>
<author>Joachim Niehren </author>
<author> Jan Schwinghammer </author>
<author> Gert Smolka</author>
<comment>5th International Workshop on Frontiers in Combining Systems.</comment>
<abstract><p>
We introduce a new concurrent lambda calculus with futures,
lambda(fut), to model the operational semantics of Alice, a
concurrent extension of ML. lambda(fut) is a minimalist
extension of the call-by-value lambda-calculus that yields
the full expressiveness to define, combine, and implement
a variety of standard concurrency constructs such as channels,
semaphores, and ports. We present a linear type system for
lambda(fut) by which the safety of such definitions
and their combinations can be proved:
Well-typed implementations cannot be corrupted in any well-typed context.
</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/wellnested-cu.bib">
......@@ -131,30 +188,26 @@ for (complete) deterministic models are equivalent.</p></abstract>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/mini.html">
<title>Minimizing Tree Automata for Unranked Trees</title>
<paper file=" http://www.ps.uni-sb.de/Papers/abstracts/clls-cu.html">
<author>Wim Martens</author>
<title>Describing Lambda Terms in Context Unification</title>
<author>Joachim Niehren</author>
<comment>Submitted.</comment>
<author>Mateu Villaret</author>
<abstract><p>Automata for unranked trees form a foundation for XML schemas,
querying and pattern languages. We study the problem of efficiently
minimizing such automata. We start with the unranked tree automata
(UTAs) that are standard in database theory, assuming bottom-up
determinism and that horizontal recursion is represented by
deterministic finite automata. We show that minimal
UTAs in that class are not unique and that minimization
is NP-hard. We then study more recent automata classes that do allow for
polynomial time minimization. Among those, we show that bottom-up
deterministic stepwise tree automata yield the most succinct
representations.
</p></abstract>
<comment>5th International Conference on Logical Aspects in Computational Linguistics.</comment>
<abstract><p>The constraint language for lambda structures (CLLS) is
a description language for lambda terms. CLLS provides
parallelism constraints to talk about the tree structure
of lambda terms, and lambda binding constraints to specify
variable binding.
Parallelism constraints alone have
the same expressiveness as context unification. In this paper,
we show that lambda binding constraints can also be expressed
in context unification when permitting tree
regular constraints. </p></abstract>
</paper>
</li>
......@@ -202,30 +255,6 @@ Wand in 1993.</p></abstract>
</paper>
</li>
<li>
<paper file=" http://www.ps.uni-sb.de/Papers/abstracts/clls-cu.html">
<title>Describing Lambda Terms in Context Unification</title>
<author>Joachim Niehren</author>
<author>Mateu Villaret</author>
<comment>5th International Conference on Logical Aspects in Computational Linguistics.</comment>
<abstract><p>The constraint language for lambda structures (CLLS) is
a description language for lambda terms. CLLS provides
parallelism constraints to talk about the tree structure
of lambda terms, and lambda binding constraints to specify
variable binding.
Parallelism constraints alone have
the same expressiveness as context unification. In this paper,
we show that lambda binding constraints can also be expressed
in context unification when permitting tree
regular constraints. </p></abstract>
</paper>
</li>
<li>
<paper file="http://www.lifl.fr/~boneva/papers/rta2005.pdf">
......@@ -241,35 +270,6 @@ regular constraints. </p></abstract>
</paper>
</li>
<li>
<paper file="https://www.ps.uni-sb.de/Papers/abstracts/lambdafut.html">
<title>A Concurrent Lambda Calculus with Futures</title>
<author>Joachim Niehren </author>
<author> Jan Schwinghammer </author>
<author> Gert Smolka</author>
<comment>5th International Workshop on Frontiers in Combining Systems.</comment>
<abstract><p>
We introduce a new concurrent lambda calculus with futures,
lambda(fut), to model the operational semantics of Alice, a
concurrent extension of ML. lambda(fut) is a minimalist
extension of the call-by-value lambda-calculus that yields
the full expressiveness to define, combine, and implement
a variety of standard concurrency constructs such as channels,
semaphores, and ports. We present a linear type system for
lambda(fut) by which the safety of such definitions
and their combinations can be proved:
Well-typed implementations cannot be corrupted in any well-typed context.
</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/sub-journal.html">
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment