A Generalized Modality for Recursion-Reference-Cited by-同舟云学术

A Generalized Modality for Recursion

Published:2018-07-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Guatto Adrien¹

Affiliation:

1. University of Bamberg

Funder

Deutsche Forschungsgemeinschaft

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3209108.3209148

Reference31 articles.

1. Nada Amin and Tiark Rompf. 2017. Type Soundness Proofs with Definitional Interpreters. Principles of Programming Languages (POPL'17). 10.1145/3009837.3009866 Nada Amin and Tiark Rompf. 2017. Type Soundness Proofs with Definitional Interpreters. Principles of Programming Languages (POPL'17). 10.1145/3009837.3009866

2. Robert Atkey. 2006. Substructural Simple Type Theories for Separation and In-place Update. Ph.D. Dissertation. University of Edinburgh. Robert Atkey. 2006. Substructural Simple Type Theories for Separation and In-place Update. Ph.D. Dissertation. University of Edinburgh.

3. Productive coprogramming with guarded recursion

4. Patrick Bahr Hans Bugge Grathwohl and Rasmus Ejlers Møgelberg. 2017. The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion. In Logic in Computer Science (LICS'17). Springer. Patrick Bahr Hans Bugge Grathwohl and Rasmus Ejlers Møgelberg. 2017. The Clocks Are Ticking: No More Delays! Reduction Semantics for Type Theory with Guarded Recursion. In Logic in Computer Science (LICS'17). Springer.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Calculus for the Specification, Design, and Verification of Distributed Concurrent Systems;Formal Aspects of Computing;2024-09-05

2. Deciding Equations in the Time Warp Algebra;Logical Methods in Computer Science;2024-01-26

3. Productivity Verification for Functional Programs by Reduction to Termination Verification;Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11

4. Specification and verification of concurrent systems by causality and realizability;Theoretical Computer Science;2023-09

5. A totally predictable outcome: an investigation of traversals of infinite structures;Proceedings of the 15th ACM SIGPLAN International Haskell Symposium;2022-09-06