Classical Combinatory Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Classical Combinatory Logic

Karim Nour
  • Function : Author
  • PersonId : 859979


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.
Fichier principal
Vignette du fichier
dmAF0107.pdf (175.94 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01183333 , version 1 (12-08-2015)



Karim Nour. Classical Combinatory Logic. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. pp.87-96, ⟨10.46298/dmtcs.3469⟩. ⟨hal-01183333⟩
214 View
1220 Download



Gmail Facebook Twitter LinkedIn More