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

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

Frage

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?

Keine korrekte Lösung

Lizenziert unter: CC-BY-SA mit Zuschreibung
Nicht verbunden mit cs.stackexchange
scroll top