Wellfounded recursion with copatterns: a unified approach to termination and productivity

  title={Wellfounded recursion with copatterns: a unified approach to termination and productivity},
  author={Andreas Abel and Brigitte Pientka},
In this paper, we study strong normalization of a core language based on System F-omega which supports programming with finite and infinite structures. Building on our prior work, finite data such as finite lists and trees are defined via constructors and manipulated via pattern matching, while infinite data such as streams and infinite trees is defined by observations and synthesized via copattern matching. In this work, we take a type-based approach to strong normalization by tracking size… CONTINUE READING
Highly Cited
This paper has 72 citations. REVIEW CITATIONS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

Proofs and Types, volume 7 of Cambridge Tracts in TCS

  • J.-Y. Girard, Y. Lafont, P. Taylor
  • 1989
Highly Influential
4 Excerpts

Wellfounded recursion with copatterns : A unified approach to termination and productivity

  • A. Abel, B. Pientka, D. Thibodeau, A. Setzer.
  • 2013
Highly Influential
5 Excerpts

Towards a Practical Programming Language Based on Dependent Type Theory

  • U. Norell
  • PhD thesis,
  • 2007
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…