Why Church-encoded types aren't sufficient to express inductive proofs?

cs.stackexchange https://cs.stackexchange.com/questions/68808

문제

I've heard some claims that the calculus of constructions without inductive types isn't powerful enough to express proofs by induction. Is that correct? If so, why isn't the Church-encoding sufficient for that?

올바른 솔루션이 없습니다

라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 cs.stackexchange
scroll top