Conservativity of embeddings in the lambda-Pi calculus modulo rewriting (long version) - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Conservativity of embeddings in the lambda-Pi calculus modulo rewriting (long version)

Résumé

The lambda-Pi calculus can be extended with rewrite rules to embed any other functional pure type system. The normalization and conserva-tivity properties of the embedding is an open problem. In this paper, we show that the embedding is conservative. We define an inverse translation into a pure type system completion and show that the completion is con-servative using the reducibility method. This result further justifies the use of the lambda-Pi calculus modulo rewriting as a logical framework.
Fichier principal
Vignette du fichier
conservativity-embeddings.pdf (452.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01084165 , version 1 (18-11-2014)
hal-01084165 , version 2 (20-04-2015)
hal-01084165 , version 3 (20-04-2015)

Licence

Paternité

Identifiants

  • HAL Id : hal-01084165 , version 1

Citer

Ali Assaf. Conservativity of embeddings in the lambda-Pi calculus modulo rewriting (long version). 2013. ⟨hal-01084165v1⟩
342 Consultations
170 Téléchargements

Partager

Gmail Facebook X LinkedIn More