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 3-part analogy, as follows.

\text{proof hint : proof : proposition ~::~ untyped term : typed term : type}

See my working notes on Propositions As Types for more information.

This entry was 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 and tagged , , , , , , , , , , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s