Output details
11 - Computer Science and Informatics
Swansea University
Return to search
Output 0 of 0 in the submission
Output title
Copatterns: programming infinite structures by observations
Type
E - Conference contribution
Name of conference/published proceedings
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Volume number
48
Issue number
1
First page of article
27
ISSN of proceedings
0362-1340
Year of publication
2013
URL
-
Number of additional authors
3
Additional information
<11> Programming with infinitary data structures is usually based on codata types and has led in the theorem prover Coq to problems with subject reduction (evaluating programs violates type correctness) known since 1996. This article shows how to introduce infinitary data types as the dual of inductive data types (keyword "data" in functional programming), including copattern matching as the dual of pattern matching, and proves subject reduction. POPL is a top conference for research on programming languages and compilers. POPL 2013 had an acceptance rate of 43 out of 238 submissions (18%).
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Theoretical Computer Science
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
