Denotational semantics of recursive types in synthetic guarded domain theory

DOI10.1145/2933575.2934516zbMath1401.68047arXiv1805.00289OpenAlexW2530147817MaRDI QIDQ4635887

Marco Paviotti, Rasmus Ejlers Møgelberg

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.00289

zbMATH Keywords

denotational semanticstype theoryrecursive typessynthetic domain theoryguarded recursion

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Denotational semantics of recursive types in synthetic guarded domain theory ⋮ Denotational semantics for guarded dependent type theory

This page was built for publication: Denotational semantics of recursive types in synthetic guarded domain theory