Work

A typed parallel λ-calculus via 1-depth intermediate proofs

Year: 2019

Type: preprint

Abstract: We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The resulting calculus, we call it $λ_{\parallel}$, is a strongly normalizing parallel extension of the simply typed $λ$-calculus. Although simple, the $λ_{\parallel}$ reduction rules can model arbitrary process network topologies, and encode interesting parallel programs ranging from numeric computation to algorithms on graphs.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1902.03882

Authors: Aschieri, Federico, Ciabattoni, Agata, Genco, Francesco A.

Institutions: Centre National de la Recherche Scientifique, TU Wien, Institut d'Histoire et de Philosophie des Sciences et des Techniques

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Agence Nationale de la Recherche, Austrian Science Fund

Awards: G4656594441, On the Computational Interpretation of Intermediate Logics, G6183060058, Insights from Bernard Bolzano

OpenAlex ID: W4288594261

Cites:

Cited by:

Related to: 10