With respect to keeping the language small and simple (C2x charter 6c
and 11) this of course adds a feature. It allows higher-order type
rules (Forall types X, T<X> is a type) which adds to C the remaining
part of the negative fragment of natural deduction for minimal logic
[1], implications being function types and conjunctions implemented
by struct types.
[1]
https://lipn.univ-paris13.fr/~mazza/teaching/ProofTheoryNotes.pdf
Sysop: | DaiTengu |
---|---|
Location: | Appleton, WI |
Users: | 1,066 |
Nodes: | 10 (0 / 10) |
Uptime: | 173:04:39 |
Calls: | 13,708 |
Calls today: | 2 |
Files: | 186,949 |
D/L today: |
8,041 files (2,227M bytes) |
Messages: | 2,415,912 |