Functions as proofs as processes

Abstract : This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the π-calculus closely related to linear logic. Decompositions of intuitionistic and classical logics into this system provide type-preserving translations of the λ- and λμ-calculus, both for call-by-name and call-by-value evaluation strategies. Previously known encodings of the \lam-calculus are shown to correspond to particular cases of this logical embedding. The realisability interpretation of types in the π-calculus provides systematic soundness arguments for these translations and allows for the definition of type-safe extensions of functional calculi.
Type de document :
Rapport
2007
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00609866
Contributeur : Emmanuel Beffara <>
Soumis le : mercredi 20 juillet 2011 - 12:46:02
Dernière modification le : vendredi 16 septembre 2016 - 15:15:38
Document(s) archivé(s) le : vendredi 21 octobre 2011 - 02:21:49

Fichiers

fpp.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00609866, version 1
  • ARXIV : 1107.4160

Collections

Citation

Emmanuel Beffara. Functions as proofs as processes. 2007. 〈hal-00609866〉

Partager

Métriques

Consultations de
la notice

160

Téléchargements du document

42