Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Marker-Directed Optimization of UnCAL Graph Transformations

    Buneman et al. proposed a graph algebra called UnCAL (Unstructured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transformations. The co...

    Soichiro Hidaka, Zhenjiang Hu in Logic-Based Program Synthesis and Transfor… (2012)

  2. No Access

    Chapter

    Three Complementary Approaches to Bidirectional Programming

    This paper surveys three distinct approaches to bidirectional programming. The first approach, syntactic bidirectionalization, takes a program describing the forward transformation as input and calculates a well-...

    Nate Foster, Kazutaka Matsuda, Janis Voigtländer in Generic and Indexed Programming (2012)

  3. No Access

    Chapter and Conference Paper

    Gradual Refinement

    Pattern matching is advantageous for understanding and reasoning about function definitions, but it tends to tightly couple the interface and implementation of a datatype. Significant effort has been invested ...

    Meng Wang, Jeremy Gibbons, Kazutaka Matsuda in Mathematics of Program Construction (2010)