transparent gif

 

Ej inloggad.

Göteborgs universitets publikationer

Well-founded recursion with copatterns and sized types

Författare och institution:
Andreas Abel (Institutionen för data- och informationsteknik (GU)); B. Pientka (-)
Publicerad i:
Journal of Functional Programming, 26
ISSN:
0956-7968
Publikationstyp:
Artikel, refereegranskad vetenskaplig
Publiceringsår:
2016
Språk:
engelska
Fulltextlänk:
Sammanfattning (abstract):
In this paper, we study strong normalization of a core language based on System F-omega which supports programming with finite and infinite structures. Finite data such as finite lists and trees is 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. Taking a type-based approach to strong normalization, we track size information about finite and infinite data in the type. We exploit the duality of pattern and copatterns to give a unifying semantic framework which allows us to elegantly and uniformly support both well-founded induction and coinduction by rewriting. The strong normalization proof is structured around Girard's reducibility candidates. As such, our system allows for non determinism and does not rely on coverage. Since System F-omega is general enough that it can be the target of compilation for the Calculus of Constructions, this work is a significant step towards representing observation-based infinite data in proof assistants such as Coq and Agda.
Ämne (baseras på Högskoleverkets indelning av forskningsämnen):
NATURVETENSKAP ->
Data- och informationsvetenskap
Nyckelord:
rewrite systems, termination, definitions, productivity, calculus, Computer Science
Postens nummer:
237278
Posten skapad:
2016-06-03 13:32

Visa i Endnote-format

Göteborgs universitet • Tel. 031-786 0000
© Göteborgs universitet 2007