Infinitary Howe's method

MaRDI QIDQ2863895zbMATH OpenFDO

Authors Paul Blain Levy

Publication date 4 December 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066106004713?np=y

zbMATH Keywords

applicative bisimulationcall-by-valuecoinductiveHowe's methodinfinitary syntaxnondeterminism

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• Howe's method for contextual semantics
• Effectful applicative bisimilarity: monads, relators, and Howe's method
• Proving congruence of bisimulation in functional programming languages
• A case study in programming coinductive proofs: Howe's method
• A hybrid encoding of Howe's method for establishing congruence of bisimilarity

Cited in

(11)

• Brook Taylor and the method of increments
• On bisimilarity in lambda calculi with continuous probabilistic choice
• Exploratory functions on nondeterministic strategies, up to lower bisimilarity
• A hybrid encoding of Howe's method for establishing congruence of bisimilarity
• Effectful applicative bisimilarity: monads, relators, and Howe's method
• A case study in programming coinductive proofs: Howe's method
• Amb Breaks Well-Pointedness, Ground Amb Doesn't
• Howe's method for contextual semantics
• Howe's method for higher-order languages
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Choice trees: representing and reasoning about nondeterministic, recursive, and impure programs in Rocq

This page was built for publication: Infinitary Howe's method

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