Structural recursion for querying ordered graphs

No abstract is available for this paper.

• Publication year

  2013

• Venue

  ACM SIGPLAN International Conference on Functional Programming

• Publication date

  2013-09-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/2500365.2500608
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Foundations of Programming Languages

  2015cited by this paper
• A parameterized graph transformation calculus for finite graphs with monadic branches

  2013influential reference
• Functional programming with structured graphs

  2012cited by this paper
• Parameterized Graph Transformation Languages with Monads

  2012cited by this paper
• Permutations in Coinductive Graph Representation

  2012cited by this paper
• The Removal of Weighted ε-Transitions

  2012influential reference
• Marker-Directed Optimization of UnCAL Graph Transformations

  2011cited by this paper
• From Coalgebraic to Monoidal Traces

  2010cited by this paper
• Bidirectionalizing graph transformations

  2010cited by this paper
• Initial Algebra Semantics for Cyclic Sharing Structures

  2009cited by this paper
• Structural Recursion as a Query Language on Lists and Ordered Trees

  2009cited by this paper
• KM3: A DSL for Metamodel Specification

  2006influential reference
• Fundamentals of Algebraic Graph Transformation

  2006cited by this paper
• Program Optimizations and Transformations in Calculation Form

  2005cited by this paper
• A logic you can count on

  2004influential reference
• The Uniformity Principle on Traced Monoidal Categories

  2003cited by this paper
• UnQL: a query language and algebra for semistructured data based on structural recursion

  2000influential reference
• Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (dated 1997).

  1999cited by this paper
• Efficient graph algorithms using lazy monolithic arrays

  1998cited by this paper
• Tupling calculation eliminates multiple data traversals

  1997cited by this paper
• Functional programming with graphs

  1997cited by this paper
• Foundations of programming languages

  1996cited by this paper
• Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space)

  1996cited by this paper
• Structuring depth-first search algorithms in Haskell

  1995cited by this paper
• Revisiting catamorphisms over datatypes with embedded functions

  1995cited by this paper
• Shortcut deforestation in calculational form

  1995cited by this paper
• An Initial-Algebra Approach to Directed Acyclic Graphs

  1995cited by this paper
• Querying Nested Collections

  1994cited by this paper
• A short cut to deforestation

  1993cited by this paper
• Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

  1992cited by this paper
• Structural Recursion as a Query Language

  1992cited by this paper
• Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

  1991influential reference
• Type reconstruction in finite-rank fragments of the polymorphic lambda -calculus

  1990cited by this paper
• Manipulation Multilinked Data Structures in a Pure Functional Language

  1990cited by this paper
• Regular Trees and the Free Iterative Theory

  1979cited by this paper

• Intentionally Fusing Direct Manipulations into SVG Programs

  2025cites this paper
• Enabling direct manipulation of plain-text output for template programs

  2025cites this paper
• BIT: A template-based approach to incremental and bidirectional model-to-text transformation

  2024cites this paper
• Fregel: a functional domain-specific language for vertex-centric large-scale graph processing

  2022cites this paper
• A functional reformulation of UnCAL graph-transformations: or, graph transformation as graph reduction

  2017cites this paper
• Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain

  2017cites this paper
• Lazy graph processing in Haskell

  2016cites this paper
• Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing

  2016cites this paper
• "Bidirectionalization for free" for monomorphic transformations

  2015cites this paper
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

  2015cites this paper
• Dependent Inductive and Coinductive Types are Fibrational Dialgebras

  2015cites this paper
• Iteration Algebras for UnQL Graphs and Completeness for Bisimulation

  2015cites this paper
• Bidirectional Transformation on Ordered Graphs

  2015cites this paper
• Graph Transformation as Graph Reduction FUnCAL: A Functional Reformulation of Graph-Transformation Language UnCAL

  2015cites this paper
• A parameterized graph transformation calculus for finite graphs with monadic branches

  2013influential citation
• Engineering Adaptive Software Systems (EASSy) (NII Shonan Meeting 2013-7)

  2013cites this paper
• Bidirectionizing Model Transformation Languages through Partial Translation (cid:3)

  year unknowncites this paper