A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
A Lambda Calculus for Gödel–Dummett Logic Capturing Waitfreedom
[chapter]
2012
Lecture Notes in Computer Science
We propose a typed lambda calculus based on Avron's hypersequent calculus for Gödel-Dummett logic. This calculus turns out to model waitfree computation. Besides strong normalization and nonabortfullness, we give soundness and completeness of the calculus against the typed version of waitfree protocols. The calculus is not only proof theoretically interesting, but also valuable as a basis for distributed programming languages.
doi:10.1007/978-3-642-29822-6_14
fatcat:bmt6blzkmnbx7bdsf45laba7cu