A convenient category for higher-order probability theory
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2013
- Type
- E - Conference contribution
- DOI
-
10.1109/LICS.2017.8005137
- Title of conference / published proceedings
- Proceedings - Symposium on Logic in Computer Science
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- 1043-6871
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2017
- 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)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper was invited for a plenary presentation at the ACM STOC 2018 Best of Theory session, which "highlight[s] some of the best theoretical work in the past two years from other conferences or journals�, and is for �theoretical papers that have made breakthrough advances, opened up new questions or areas, made unexpected connections, or had significant impact on practice or other sciences". The work is the basis for a formal framework for program verification developed by Sato et al. in POPL 2019 (https://doi.org/10.1145/3290351).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -