Items where Author, Editor or other role is "Paviotti, Marco"
Number of items: 10.
C
Castro-Perez, David, Paviotti, Marco, Vollmer, Michael (2024) Mechanising Recursion Schemes with Magic-Free Coq Extraction. In: Mechanising Recursion Schemes with Magic-Free Coq Extraction. . (In press) (doi:10.4230/LIPIcs.CVIT.2016.23) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:105615) |
M
Møgelberg, Rasmus, Paviotti, Marco (2019) Denotational semantics of recursive types in synthetic guarded domain theory. Mathematical Structures in Computer Science, 29 (3). pp. 465-510. ISSN 0960-1295. (doi:10.1017/S0960129518000087) (KAR id:69685) |
Marco, Paviotti, Jesper, Bengtson (2018) Formally verifying Exceptions for Low-level code with Separation Logic. Journal of Logical and Algebraic Methods in Programming, 94 . pp. 1-14. ISSN 2352-2208. (doi:10.1016/j.jlamp.2017.09.004) (KAR id:67658) |
Møgelberg, Rasmus, Paviotti, Marco (2016) Denotational semantics of recursive types in synthetic guarded domain theory. In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS Logic in Computer Science . pp. 317-326. ACM, New York, USA ISBN 978-1-4503-4391-6. (doi:10.1145/2933575.2934516) (KAR id:65016) |
Miculan, Marino, Paviotti, Marco (2012) Synthesis of distributed mobile programs using monadic types in Coq. In: Proceedings of 3rd International Conference on Interactive Theorem Proving. . pp. 183-200. Springer (doi:10.1007/978-3-642-32347-8_13) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:65009) |
P
Paviotti, Marco and Wu, Nicolas (2023) Full Abstraction for Free. [Preprint] (Submitted) (doi:10.48550/arXiv.2303.09358) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:105614) |
Paviotti, Marco, Cooksey, Simon, Paradis, Anouk, Wright, Daniel, Owens, Scott, Batty, Mark (2020) Modular Relaxed Dependencies in Weak Memory Concurrency. In: Lecture Notes in Computer Science. Programming Languages and System: 29th European Symposium on Programming, ESOP 2020 Held as Part of the European Joint Conferences on Theory and Practice of Software. 12075. pp. 599-625. Springer ISBN 978-3-030-44913-1. (doi:10.1007/978-3-030-44914-8_22) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:81430) |
Paviotti, Marco (2016) Denotational semantics in Synthetic Guarded Domain Theory. ITU-DS, 126 . IT-Universitetet i København, Copenhagen, Denmark, 143 pp. ISBN 978-87-7949-345-2. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:99279) |
Paviotti, Marco, Møgelberg, Rasmus, Birkedal, Lars (2015) A Model of PCF in Guarded Type Theory. In: Electronic Notes in Theoretical Computer Science. 319. pp. 333-349. Elsevier (doi:10.1016/j.entcs.2015.12.020) (KAR id:65015) |
Y
Yang, Zhixuan, Paviotti, Marco, Wu, Nicholas, van den Berg, Birthe, Schrijvers, Tom (2022) Structured Handling of Scoped Effects. In: Sergey, Ilya, ed. Lecture Notes in Computer Science. 13240. pp. 462-491. Springer ISBN 978-3-030-99335-1. (doi:10.1007/978-3-030-99336-8\_17) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:99278) |