Category Archives: Combinatory Logic

Propositions As Types : 1

Re: Richard J. Lipton One of my favorite tricks — it seems almost too tricky to be true — is the Propositions As Types Analogy. And I seem to see hints that the 2-part analogy can be extended to a … Continue reading

Posted in Combinator Calculus, Combinatory Logic, Computation, Computer Science, Formal Language Theory, Graph Theory, Lambda Calculus, Logic, Logical Graphs, Mathematics, Programming Languages, Propositions As Types Analogy, Type Theory | Tagged , , , , , , , , , , , , | Leave a comment