Type Soundness for Path Polymorphism

@article{Viso2015TypeSF,
  title={Type Soundness for Path Polymorphism},
  author={Andr{\'e}s Viso and Eduardo Bonelli and Mauricio Ayala-Rinc{\'o}n},
  journal={ArXiv},
  year={2015},
  volume={abs/1601.03271}
}
  • Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
  • Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures. Its essence is captured by patterns of the form $x\,y$ which decompose a compound data structure into its parts. Typing these kinds of patterns is challenging since the type of a compound should determine the type of its components. We propose a static type system (i.e. no run-time analysis) for a pattern calculus that captures this feature. Our solution combines… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    Typed path polymorphism

    VIEW 2 EXCERPTS
    CITES BACKGROUND