Re: more detailed explanation about forall in Haskell

[Lars Lundgren]

On Thu, 11 May 2000, Jan Brosius wrote:

> Marcin Kowalczyk wrote at Wed, May 10, 2000 7:54 PM :
> 
> > Types can be treated as logical formulas, according to the Curry-Howard
> > isomorphism.
> 
> Sorry, never heard of in logic. But perhaps you can explain.
> 

M H Sørensen and P Urzyczyn.
Lectures on the Curry-Howard Isomorphism. 
Available as DIKU Rapport 98/14, 1998. 

Keywords: The Curry-Howard isomorphism, Logic, Lambda-Calculus 

http://www.diku.dk/research-groups/topps/bibliography/1998.html#D-368

/Lars L