Classical Combinatory Logic

Abstract : Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written in a system "à la Hilbert''. We present in this paper a combinatory logic which corresponds to propositional classical logic. This system is equivalent to the system $λ ^{Sym}_{Prop}$ of Barbanera and Berardi.
Type de document :
Communication dans un congrès
David, René and Gardy, Danièle and Lescanne, Pierre and Zaionc, Marek. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AF, Computational Logic and Applications (CLA '05), pp.87-96, 2005, DMTCS Proceedings
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01183333
Contributeur : Coordination Episciences Iam <>
Soumis le : mercredi 12 août 2015 - 10:18:09
Dernière modification le : jeudi 11 janvier 2018 - 06:12:26
Document(s) archivé(s) le : vendredi 13 novembre 2015 - 11:35:39

Fichier

dmAF0107.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01183333, version 1

Collections

LAMA | UGA

Citation

Karim Nour. Classical Combinatory Logic. David, René and Gardy, Danièle and Lescanne, Pierre and Zaionc, Marek. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AF, Computational Logic and Applications (CLA '05), pp.87-96, 2005, DMTCS Proceedings. 〈hal-01183333〉

Partager

Métriques

Consultations de la notice

128

Téléchargements de fichiers

653