HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information

# 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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [25 references]

https://hal.inria.fr/hal-01183333
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 10:18:09 AM
Last modification on : Thursday, October 7, 2021 - 10:53:59 AM
Long-term archiving on: : Friday, November 13, 2015 - 11:35:39 AM

### File

dmAF0107.pdf
Publisher files allowed on an open archive

### Citation

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

Record views