Syntax and Models of a non-Associative Composition of Programs and Proofs

Guillaume Munch-Maccagnoni 1, 2
2 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : The thesis is a contribution to the understanding of the nature, role, and mechanisms of polarisation in programming languages, proof theory and categorical models. Polarisation corresponds to the idea that we can relax the associativity of composition, as we show by relating duploids, our direct model of polarisation, to adjunctions. As a consequence, polarisation underlies many models of computation, which we further show by decomposing continuation-passing-style models of delimited control in three fundamental steps. It also explains constructiveness-related phenomena in proof theory, which we illustrate by providing a formulae-as-types interpretation for polarisation in general and for an involutive negation in particular. The cornerstone of our approach is an interactive term-based representation of proofs and programs (L calculi) which exposes the structure of polarities. It is based on the correspondence between abstract machines and sequent calculi, and it aims at synthesising various trends: the modelling of control, evaluation order and effects in programming languages, the quest for a relationship between categorical duality and continuations, and the interactive notion of construction in proof theory. We give a gentle introduction to our approach which only assumes elementary knowledge of simply-typed λ calculus and rewriting.
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00918642
Contributor : Guillaume Munch-Maccagnoni <>
Submitted on : Friday, December 13, 2013 - 8:13:14 PM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM

Identifiers

  • HAL Id : tel-00918642, version 1

Collections

Citation

Guillaume Munch-Maccagnoni. Syntax and Models of a non-Associative Composition of Programs and Proofs. Logic in Computer Science [cs.LO]. Université Paris-Diderot - Paris VII, 2013. English. ⟨tel-00918642⟩

Share

Metrics

Record views

554

Files downloads

390