A lambda calculus for gödel---dummett logic capturing waitfreedom

Authors:
Yoichi Hirai
Affiliations:
JSPS, The University of Tokyo, Japan
Venue:
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Year:
2012

Citing 14
Cited 0

Extended impossibility results for asynchronous complete networks

Information Processing Letters
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Computational interpretations of linear logic

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Immediate atomic snapshots and fast renaming

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Wait-free k-set agreement is impossible: the topology of public knowledge

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The method of hypersequents in the proof theory of propositional non-classical logics

Logic: from foundations to applications
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
The Join Calculus: A Language for Distributed Mobile Programming

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)

Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
From Axioms to Analytic Rules in Nonclassical Logics

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
An intuitionistic epistemic logic for sequential consistency on shared memory

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 non-abortfullness, 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.