Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01183333
Contributor : Coordination Episciences Iam <>
Submitted on : Wednesday, August 12, 2015 - 10:18:09 AM
Last modification on : Friday, November 6, 2020 - 3:35:03 AM
Long-term archiving on: : Friday, November 13, 2015 - 11:35:39 AM

File

dmAF0107.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01183333, version 1

Collections

Citation

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

Share

Metrics

Record views

272

Files downloads

1514