Conference item
Recursion and sequentiality in categories of sheaves
- Abstract:
- We present a fully abstract model of a call-by-value language with higher-order functions, recursion and natural numbers, as an exponential ideal in a topos. Our model is inspired by the fully abstract models of O'Hearn, Riecke and Sandholm, and Marz and Streicher. In contrast with semantics based on cpo’s, we treat recursion as just one feature in a model built by combining a choice of modular components.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, 762.9KB, Terms of use)
-
- Publisher copy:
- 10.4230/LIPIcs.FSCD.2021.25
Authors
- Publisher:
- Schloss Dagstuhl - Leibniz-Zentrum für Informatik
- Host title:
- 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021)
- Pages:
- 25:1-25:22
- Series:
- Leibniz International Proceedings in Informatics
- Series number:
- 195
- Place of publication:
- Germany
- Publication date:
- 2021-07-06
- Acceptance date:
- 2021-04-19
- Event title:
- 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021)
- Event location:
- Online (Buenos Aires, Argentina)
- Event website:
- https://fscd2021.dc.uba.ar/
- Event start date:
- 2021-07-17
- Event end date:
- 2021-07-24
- DOI:
- ISSN:
-
1868-8969
- ISBN:
- 9783959771917
- Language:
-
English
- Keywords:
- Pubs id:
-
1174255
- Local pid:
-
pubs:1174255
- Deposit date:
-
2021-05-05
Terms of use
- Copyright holder:
- Matache et al.
- Copyright date:
- 2021
- Rights statement:
- © Cristina Matache, Sean Moss, and Sam Staton; licensed under Creative Commons License CC-BY 4.0.
- Notes:
- This paper was presented at the 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021), 17-24 July 2021, Online (Buenos Aires, Argentina).
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record