Generalising Tree Traversals and Tree Transformations to DAGs: Exploiting Sharing without the Pain

DMCA

Generalising Tree Traversals and Tree Transformations to DAGs: Exploiting Sharing without the Pain (2015)

Cached

Download Links

by Patrick Bahr , Emil Axelsson

Citations

569	Semantics of Context-Free Languages, - Knuth - 1968
360	Compilers: principles, techniques, and tools - Aho, Sethi, et al. - 1986
328	Functional programming with bananas, lenses, envelopes and barbed wire - Meijer, Fokkinga, et al. - 1991
249	Toposes, Triples and Theories - Barr, Wells - 1985
135	UnQL: a Query Language and Algebra for Semistructured Data based on Structural Recursion - Buneman, Fernandez, et al.
134	Macro tree transducers - Engelfriet, Vogler - 1985
114	Variations on the common subexpression problem - Downey, Sethi, et al. - 1980
97	Using circular programs to eliminate multiple traversals of data - Bird - 1984
94	Patriciapractical algorithm to retrieve information coded in alphanumeric - Morrison - 1968
92	Implicit parameters: Dynamic scoping with static types - Lewis, Launchbury, et al. - 2000
85	Bottom-up and top-down tree transformations - A comparison. - Engelfriet - 1975
85	Syntax-Directed Semantics: Formal Models Based on Tree Transducers, - Fulop, Vogler - 1998
83	Higher order attribute grammars - Swierstra, Vogt - 1991
72	Lightweight modular staging: a pragmatic approach to runtime code generation and compiled dsls. - Rompf, Odersky - 2012
62	The smallest grammar problem - Charikar, Lehman, et al.
51	Categories of containers - Abbott, Altenkirch, et al. - 2003
50	Efficient memory representation of XML document trees - Busatto, Lohrey, et al.
45	Composing dataflow analyses and transformations - Lerner, Grove, et al. - 2002
42	Parametric higher-order abstract syntax for mechanized semantics. - Chlipala - 2008
38	Foundations for structured programming with GADTs - Johann, Ghani - 2008
33	Semantics of context-free languages: Correction - Knuth - 1971
32	Feldspar: A domain specific language for digital signal processing algorithms. - Axelsson, Claessen, et al. - 2010
32	Generic programming with fixed points for mutually recursive datatypes - Yakushev, Holdermans, et al.
29	Type-safe observable sharing in Haskell - Gill - 2009
25	Generic downwards accumulations. - Gibbons - 2000
25	A generalized theory of bit vector data flow analysis - Khedker, Dhamdhere - 1994
20	The complexity of tree automata and XPath on grammarcompressed trees - Lohrey, Maneth - 2005
17	XML compression techniques: a survey and comparison, - Sakr - 2009
16	Tree transducers and tree compressions. - Maneth, Busatto - 2004
12	Closure properties and decision problems of dag automata - Anantharaman, Narendran, et al. - 2005
12	Functional Incremental Attribute Evaluation. In - Saraiva, Swierstra, et al. - 2000
11	Functional programming with structured graphs - Oliveira, Cook - 2012
8	Closed type families with overlapping equations - Eisenberg, Vytiniotis, et al. - 2014
8	Abstract syntax graphs for domain specific languages - Oliveira, Löh - 2013
7	Modular tree automata - Bahr - 2012
6	Understanding idiomatic traversals backwards and forwards. - Bird, Gibbons, et al. - 2013
6	Categorical views on computations on trees (extended abstract - Hasuo, Jacobs, et al. - 2007
6	Functional programs as compressed data. - Kobayashi, Matsuda, et al. - 2012
6	Attribute grammars fly first-class - Viera, Swierstra, et al. - 2009
5	Functional Programming Enabling Flexible Hardware Design at Low Levels of Abstraction - Axelsson - 2008
5	Programming macro tree transducers - Bahr, Day - 2013
4	Tree compression with top trees. - Bille, Gørtz, et al. - 2013
4	Transductions of dags and trees - Kamimura, Slutzki - 1982
4	Abstract interpretation using attribute grammars - Rosendahl - 1990
3	Proving correctness of compilers using structured graphs - Bahr - 2014
3	Dagger: A toolkit for automata on directed acyclic graphs - Quernheim, Knight - 2012
2	Running tree automata on trees and/or dags - Fila, Anantharaman - 2006
2	Abstract interpretation of functional programs using an attribute grammar system - Fokker, Swierstra - 2009
2	Recognition of directed acyclic graphs by spanning tree automata - Fujiyoshi
2	Structural recursion for querying ordered graphs - Hidaka, Asada, et al. - 2013
2	Inference with Attribute Grammars - Middelkoop - 2012
2	Problem #70: Design a notion of automata for graphs, 2005. URL http://rtaloop.mancoosi.univ-paris-diderot. fr/problems/70.html. The RTA list of open problems - Raoult
1	Associated source code repository. https://github.com/emilaxelsson/ag-graph - Bahr, Axelsson
1	Automata on DAG representations of finite trees. Research report, Max-Planck-Institut für Informatik - Charatonik - 1999