Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Algebra of Programming Using Dependent Types

    Dependent type theory is rich enough to express that a program satisfies an input/output relational specification, but it could be hard to construct the proof term. On the other hand, squiggolists know very we...

    Shin-Cheng Mu, Hsiang-Shang Ko, Patrik Jansson in Mathematics of Program Construction (2008)

  2. No Access

    Chapter and Conference Paper

    Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote Data Access

    Pregel is a popular distributed computing model for dealing with large-scale graphs. However, it can be tricky to implement graph algorithms correctly and efficiently in Pregel’s vertex-centric model, especial...

    Yongzhe Zhang, Hsiang-Shang Ko, Zhenjiang Hu in Programming Languages and Systems (2017)

  3. No Access

    Chapter

    Principles and Practice of Bidirectional Programming in BiGUL

    Putback-based bidirectional programming allows the programmer to write only one backward transformation, from which the unique corresponding forward transformation is derived for free. A key distinguishing fea...

    Zhenjiang Hu, Hsiang-Shang Ko in Bidirectional Transformations (2018)

  4. Chapter and Conference Paper

    A Formal Treatment of Bidirectional Ty**

    There has been much progress in designing bidirectional type systems and associated type synthesis algorithms, but mainly on a case-by-case basis. To remedy the situation, this paper develops a general and formal

    Liang-Ting Chen, Hsiang-Shang Ko in Programming Languages and Systems (2024)