Propositions as Types

sq_propositions_as_types3For almost 100 years, there have been linkages forged between certain notions of logic and of computation. As more associations have been discovered, the bonds between the two have grown stronger and richer.

  • Propositions in logic can be considered equivalent to types in programming languages.
  • Proofs of propositions in logic can be considered equivalent to programs of given type in computation.
  • The simplification of proofs of propositions in logic can be considered equivalent to the evaluation of programs of types in computation.

The separate work of various logicians and computer scientists (and their precursors) can be paired:

  • Gerhard Gertzen’s work on proofs in intuitionistic natural deduction and Alonzo Church’s work on the simply typed lambda calculus.
  • J. Roger Hindley and Robin Milner’s work on type systems for combinatory logic and programming languages, respectively.
  • J. Y. Girard and John Reynold’s work on the second order lambda calculus and parametric polymorphic programs, respectively.
  • Haskell Curry’s and W. A. Howard’s work on the overall correspondence between these notions of proofs as programs or positions as types.

Logic and computation are the sequential chains of efficient causation and actions. Propositions and types are the abstract grids of formal causation and structures. Proofs and programs are the normative cycles of final causation and functions. Simplification and evaluation are the reductive solids of material causation and parts.

References:

Philip Wadler / Propositions as Types, in Communications of the ACM, Vol. 58 No. 12 (Dec 2015) Pages 75-85.

http://cacm.acm.org/magazines/2015/12/194626-propositions-as-types/fulltext

Preprint at

http://homepages.inf.ed.ac.uk/wadler/papers/propositions-as-types/propositions-as-types.pdf

Also see:

http://www.drdobbs.com/old-ideas-form-the-basis-of-advancements/184404384

https://en.wikipedia.org/wiki/Hindley%E2%80%93Milner_type_system

https://en.wikipedia.org/wiki/System_F

https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence

[*9.92-9.94]

<>

 

Advertisements

3 Responses to “Propositions as Types”

  1. Four Bindings | Equivalent eXchange Says:

    […] a previous post I mentioned chains, grids, cycles, and blocks, and associated them with the Four Causes and my […]

  2. Invention and Discovery | Equivalent eXchange Says:

    […] are the differences between invention and discovery? Ever since my post Propositions as Types I’ve been trying to determine what they are. Some say that mathematics and logic are completely […]

  3. #HoTT : Propositions as types | Autrement qu'être Mathesis uni∜ersalis Problema Universale Heidegger/Husserl être/conscience : plan vital-ontologique vs plan spirituel d'immanence CLAVIS UNIVERSALIS HENOSOPHIA PANSOPHIA ενοσοφια μα Says:

    […] https://equivalentexchange.wordpress.com/2016/02/14/propositions-as-types/ […]

Leave a Reply

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

WordPress.com Logo

You are commenting using your WordPress.com 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


%d bloggers like this: