←back to thread

390 points kurinikku | 1 comments | | HN request time: 0.214s | source
Show context
gugagore ◴[] No.42166709[source]
I recently came across the notion that you need inductive data types (and can't just use Church encodings) if you want to do theorem proving, like proving that `0 != 1`.

I threw up some content up here: https://intellec7.notion.site/Drinking-SICP-hatorade-and-why... , along with an unrelated criticism of SICP.

I'd like to better understand what the limitations are of "everything is just a function".

replies(3): >>42168230 #>>42169214 #>>42169475 #
1. solomonb ◴[] No.42169475[source]
Well for theorem proving you need Sigma and Pi types plus some notion of equality. Can you achieve those with Scott or Church encoding?