Bindings as bounded natural functors
- Submitting institution
-
The University of Sheffield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 7443
- Type
- D - Journal article
- DOI
-
10.1145/3290335
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- 22
- First page
- -
- Volume
- 3
- Issue
- POPL
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
F - Security of Advanced Systems
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper solves an open and challenging problem. It is the culmination of a line of work on (co)datatypes and (co)recursion in Higher-Order Logic by Popescu and collaborators, which was published in CORE A*/A formal methods conferences (including ESOP doi.org/10.1007%2F978-3-662-54434-1_5, ICFP doi.org/10.1145/2858949.2784732, IJCAR doi.org/10.1007%2F978-3-319-08587-6_4 and LICS https://ieeexplore.ieee.org/document/6280479, https://ieeexplore.ieee.org/document/8005071) and jointly collected 300 GS citations. This line of work was presented in an invited paper (FroCoS 2017 doi.org/10.1007/978-3-319-66167-4_1) and an invited special session talk (CALCO/MFPS 2019). The results are implemented in the Isabelle proof assistant, as part of its widely used datatype package (https://isabelle.in.tum.de/documentation.html).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -