Circular Proofs as Session-Typed Processes: A Local Validity Condition release_gna25tzm55cxrhrrh557r7nrr4

by Farzaneh Derakhshan, Frank Pfenning

Released as a article .

2019  

Abstract

Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus. More recently, a correspondence between intuitionistic linear logic and the session-typed pi-calculus has been discovered. In this paper, we establish an extension of the latter correspondence for a fragment of substructural logic with least and greatest fixed points. We describe the computational interpretation of the resulting infinitary proof system as session-typed processes, and provide an effectively decidable local criterion to recognize mutually recursive processes corresponding to valid circular proofs as introduced by Fortier and Santocanale. We show that our algorithm imposes a stricter requirement than Fortier and Santocanale's guard condition, but is local and compositional and therefore more suitable as the basis for a programming language.
In text/plain format

Archived Files and Locations

application/pdf  386.3 kB
file_7gjbmn6zmzbdzilsoifbic7mvi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-08-06
Version   v1
Language   en ?
arXiv  1908.01909v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 88363e50-296a-4877-851d-9d17fa558f74
API URL: JSON