Classical Combinatory Logic

Details Classical Combinatory Logic Classical Combinatory Logic

2009-05-07

arxiv.org/abs/0905.1100v1

Computational Logic and Applications, CLA '05, Chamb\'ery : France (2005)

Mathematics

Logic

Scientific paper

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 "`a la Hilbert". We present in this paper a combinatory logic which corresponds to propositional classical logic. This system is equivalent to the system $\lambda^{Sym}_{Prop}$ of Barbanera and Berardi.

Affiliated with

Also associated with

No associations

Rating

Classical Combinatory Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classical Combinatory Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical Combinatory Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-456144