Classical Proofs as Parallel Programs

Federico Aschieri
(TU Wien)
Agata Ciabattoni
(TU Wien)
Francesco Antonio Genco
(TU Wien)

We introduce a first proofs-as-parallel-programs correspondence for classical logic. We define a parallel and more powerful extension of the simply typed lambda calculus corresponding to an analytic natural deduction based on the excluded middle law. The resulting functional language features a natural higher-order communication mechanism between processes, which also supports broadcasting. The normalization procedure makes use of reductions that implement novel techniques for handling and transmitting process closures.

In Andrea Orlandini and Martin Zimmermann: Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2018), Saarbrücken, Germany, 26-28th September 2018, Electronic Proceedings in Theoretical Computer Science 277, pp. 43–57.
Published: 7th September 2018.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: