Sciweavers

127 search results - page 10 / 26
» Algebraic Characterization of Logically Defined Tree Languag...
Sort
View
EACL
2006
ACL Anthology
13 years 9 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
Stuart M. Shieber
FASE
2008
Springer
13 years 9 months ago
An Algebraic Semantics for MOF
Abstract. Model-driven development is a field within software engineering in which software artifacts are represented as models in order to improve productivity, quality, and cost ...
Artur Boronat, José Meseguer
FAC
2008
92views more  FAC 2008»
13 years 7 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 4 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...