Step-indexed relational reasoning for countable nondeterminism

DOI10.2168/LMCS-9(4:4)2013zbMATH Open1274.68047OpenAlexW2761554012MaRDI QIDQ2851672FDOQ2851672

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

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

zbMATH Keywords

lambda calculuscountable choiceprogram equivalence

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (6)

• Step-indexed relational reasoning for countable nondeterminism
• Transfinite Step-Indexing: Decoupling Concrete and Logical Steps
• A Higher-Order Logic for Concurrent Termination-Preserving Refinement
• Title not available (Why is that?)
• Program equivalence in an untyped, call-by-value functional language with uncurried functions
• Two guarded recursive powerdomains for applicative simulation

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)