Start / Iowa Type Theory Commute / Indexed types and curry howard for first order quantifiers

Iowa Type Theory Commute

Indexed types and Curry-Howard for first-order quantifiers

9 min • 3 januari 2020

I follow up on some comments I made about Curry-Howard for first-order quantifiers in the previous episode.  Sheard's Omega language also mentioned (see links on <a href = "http://web.cecs.pdx.edu/~sheard/">his web page</a>).  First-order quantifications turn into indexed types where the indices are not program expressions but come from another syntactic domain.

Senaste avsnitt

Correction: the Correct Author of the Proof from Last Episode, and an AI flop

12 maj | 7 min

Krivine's Proof of FD, Using Intersection Types

5 maj | 22 min

A Measure-Based Proof of Finite Developments

16 april | 23 min

Introduction to the Finite Developments Theorem

27 mars | 16 min

Nominal Isabelle/HOL

31 januari | 16 min
Vad är en podd?

En liten tjänst av I'm With Friends. Finns även på engelska.

Podcastbild

00:00 -00:00
00:00 -00:00