A Model of Countable Nondeterminism in Guarded Type Theory

DOI10.1007/978-3-319-08918-8_8zbMath1416.68033OpenAlexW2245432137MaRDI QIDQ5170811

Aleš Bizjak, Marino Miculan, Lars Birkedal

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08918-8_8

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Categorical logic, topoi (03G30)

Related Items

Unnamed Item, Lewis meets Brouwer: constructive strict implication, The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types, A model of PCF in guarded type theory, Denotational semantics of recursive types in synthetic guarded domain theory, Denotational semantics for guarded dependent type theory, Unnamed Item, Unnamed Item