Church and proofs?

[gusl]

If I am to do a project on Church and proofs, I should look at:

* Abbas Edalat

* Sungwoo Park: real number types that carry error bounds.

* computable analysis

It is well-known that inference is hard. The point of this is formalization, and possibly automating decisions of which approximations to use (compilers have the potential to be smarter than statisticians).

Thanks to simrob and Bob Harper.

Comments

[bram.livejournal.com]

I think I used to know Bob Harper.