Denotational semantics of recursive types in synthetic guarded domain theory-Reference-Cited by-同舟云学术

Denotational semantics of recursive types in synthetic guarded domain theory

Published:2016-07-05 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Møgelberg Rasmus Ejlers¹,Paviotti Marco¹

Affiliation:

1. IT University of Copenhagen, Denmark

Funder

Natur og Univers, Det Frie Forskningsråd

Publisher

ACM

Link

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

Reference23 articles.

1. A very modal model of a modern, major, general type system

2. Productive coprogramming with guarded recursion

3. Some Domain Theory and Denotational Semantics in Coq

4. N. Benton L. Birkedal A. Kennedy and C. Varming. Formalizing domains ultrametric spaces and semantics of programming languages. 2010. N. Benton L. Birkedal A. Kennedy and C. Varming. Formalizing domains ultrametric spaces and semantics of programming languages. 2010.

5. Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes

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

1. A Metalanguage for Cost-Aware Denotational Semantics;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

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

3. Two Guarded Recursive Powerdomains for Applicative Simulation;Electronic Proceedings in Theoretical Computer Science;2021-12-29

4. Denotational semantics for guarded dependent type theory;Mathematical Structures in Computer Science;2020-04

5. Bisimulation as path type for guarded recursive types;Proceedings of the ACM on Programming Languages;2019-01-02