User loginNavigation 
Curry Howard and more powerful type systemsThe ongoing thread On the (Alleged) Value of Proof for Assurance has sparked a discussion about applying the Curry Howard Isomorphism to more than intuitionistic logic and the simply typed LC. All these attempts are rather handwavey to me, but the discussion revolves around Isabelle and Coq, neither of which do I know. Neelk has made it pretty clear that CH does not apply to Isabelle, but it has gotten me wondering. * Is there a rigorous way to apply CH to a more powerful type system than the simply typed LC? * Is it nonsensical to try and apply it? * Does the ability to typecheck nonterminating expressions have an impact? Similarly, do existential types? (I'm thinking FOmega) * Are there any articles/books that do apply it to more powerful type systems which are accessible to someone without a PhD? By Brandon Niemczyk at 20100323 01:43  LtU Forum  previous forum topic  next forum topic  other blogs  4274 reads

Browse archives
Active forum topics 
Recent comments
1 day 16 hours ago
2 days 15 hours ago
3 days 17 hours ago
5 days 14 hours ago
1 week 10 hours ago
1 week 11 hours ago
1 week 12 hours ago
1 week 19 hours ago
2 weeks 3 days ago
2 weeks 6 days ago