Step-Indexed Relational Reasoning for Countable Nondeterminism

DOI10.2168/LMCS-9(4:4)2013zbMath1274.68047OpenAlexW2761554012MaRDI QIDQ2851672

Aleš Bizjak, Jan Schwinghammer, Lars Birkedal

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

countable choicelambda calculusprogram equivalence

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (4)

Program equivalence in an untyped, call-by-value functional language with uncurried functions ⋮ A Higher-Order Logic for Concurrent Termination-Preserving Refinement ⋮ Transfinite Step-Indexing: Decoupling Concrete and Logical Steps ⋮ Unnamed Item

This page was built for publication: Step-Indexed Relational Reasoning for Countable Nondeterminism