Step-indexed relational reasoning for countable nondeterminism

DOI10.2168/LMCS-9(4:4)2013MaRDI QIDQ2851672zbMATH OpenOpenAlexFDO

Authors Aleš Bizjak, Lars Birkedal, Jan Schwinghammer

Publication date 16 October 2013

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-9(4:4)2013

zbMATH Keywords

lambda calculuscountable choiceprogram equivalence

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Step-indexed relational reasoning for countable nondeterminism
• Step-indexed logical relations for probability
• A model of countable nondeterminism in guarded type theory
• Countable nondeterminism and random assignment
• scientific article; zbMATH DE number 1231604

Cited in

(8)

• Step-indexed logical relations for probability
• Step-indexed relational reasoning for countable nondeterminism
• A higher-order logic for concurrent termination-preserving refinement
• Transfinite step-indexing: decoupling concrete and logical steps
• Program equivalence in an untyped, call-by-value functional language with uncurried functions
• scientific article; zbMATH DE number 7407781 (Why is no real title available?)
• Two guarded recursive powerdomains for applicative simulation
• A model of countable nondeterminism in guarded type theory

This page was built for publication: Step-indexed relational reasoning for countable nondeterminism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851672)