Classical Proofs as Parallel Programs

Francesco A. Genco
Francesco A. Genco

GandALF, pp. 43-57, 2018.

Cited by: 2|Bibtex|Views0|Links
EI

Abstract:

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...More

Code:

Data:

Your rating :
0

 

Tags
Comments