Unnesting of copatterns

DOI10.1007/978-3-319-08918-8_3MaRDI QIDQ5170805zbMATH OpenOpenAlexFDO

Authors Anton Setzer, Andreas Abel, Brigitte Pientka, David Thibodeau

Publication date 24 July 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa19413

zbMATH Keywords

pattern matchingconservative extensioncoalgebrasstrong normalisationweak normalisationalgebraic data typescodatacopattern matchingARSabstract reduction system

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Recommendations

• Copatterns, programming infinite structures by observations
• Wellfounded recursion with copatterns: a unified approach to termination and productivity
• Well-founded recursion with copatterns and sized types
• Indexed codata types
• Map fusion for nested datatypes in intensional type theory

Cited in

(6)

• Indexed codata types
• Wellfounded recursion with copatterns: a unified approach to termination and productivity
• Defining trace semantics for CSP-Agda
• Copatterns, programming infinite structures by observations
• Well-founded recursion with copatterns and sized types
• Elaborating dependent (co)pattern matching: no pattern left behind

This page was built for publication: Unnesting of copatterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170805)