A metalanguage for guarded iteration

DOI10.1016/J.TCS.2021.04.005OpenAlexW2883648552MaRDI QIDQ5918344

Sergei S. Goncharov, Lutz Schröder, Christoph Rauch

Publication date: 22 July 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational monadsmetalanguagecomputational adequacyguarded iteration

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to extensive and distributive categories
• Categorical logic and type theory
• Modelling environments in call-by-value programming languages.
• Combining a monad and a comonad
• Guarded traced categories
• Iteration and labelled iteration
• Complete Elgot monads and coalgebraic resumptions
• Completely iterative algebras and completely iterative monads
• Types for proofs and programs. International Workshop TYPES '94, Båstad, Sweden, June 6-10, 1994. Selected papers
• Exceptional syntax
• The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types
• Unifying Guarded and Unguarded Iteration
• First steps in synthetic guarded domain theory: step-indexing in the topos of trees
• A very modal model of a modern, major, general type system
• A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
• Introduction to distributive categories
• Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion
• A Hoare logic for the coinductive trace-based big-step semantics of While
• Intensionality, Definability and Computation
• Intensional interpretations of functionals of finite type I
• A metalanguage for guarded iteration

This page was built for publication: A metalanguage for guarded iteration