Two guarded recursive powerdomains for applicative simulation
type: Item
instance of: scholarly article
title: Two guarded recursive powerdomains for applicative simulation
author: Rasmus Ejlers Møgelberg
author: Andrea Vezzosi
publication date: 2024-12-17T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 7959053
MaRDI profile type: Publication
cites work: Runners in Action
cites work: Countable nondeterminism and random assignment
cites work: Productive coprogramming with guarded recursion
cites work: Some Domain Theory and Denotational Semantics in Coq
cites work: First steps in synthetic guarded domain theory: step-indexing in the topos of trees
cites work: A Model of Countable Nondeterminism in Guarded Type Theory
cites work: General Recursion via Coinductive Types
cites work: Quotienting the delay monad by weak bisimilarity
cites work: Cubical Type Theory: a constructive interpretation of the univalence axiom
cites work: Q5144664
cites work: Operational semantics using the partiality monad
cites work: Q4847018
cites work: Formalized, Effective Domain Theory in Coq
cites work: Q3204055
cites work: Discrete Lawvere theories and computational effects
cites work: The General Universal Property of the Propositional Truncation
cites work: Q5141620
cites work: Denotational semantics of recursive types in synthetic guarded domain theory
cites work: Notions of computation and monads
cites work: A model of PCF in guarded type theory
cites work: Relational properties of domains
cites work: A note on logical relations between semantics and syntax
cites work: Step-indexed relational reasoning for countable nondeterminism
cites work: Homotopy Type Theory: Univalent Foundations of Mathematics
cites work: Stateful runners of effectful computations
DOI: 10.4204/EPTCS.351.13
description: scientific article; zbMATH DE number 7959053