Sciweavers

233 search results - page 41 / 47
» Computational Lambda-Calculus and Monads
Sort
View
PODS
1999
ACM
89views Database» more  PODS 1999»
13 years 11 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Streaming Tree Transducers
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
Rajeev Alur, Loris D'Antoni
MST
2011
207views Hardware» more  MST 2011»
13 years 2 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
MFCS
1998
Springer
13 years 11 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
On CSP and the Algebraic Theory of Effects
We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors and effect deconstructors; it also provides a link wit...
Rob J. van Glabbeek, Gordon D. Plotkin