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,090 |
| Nodes: | 10 (1 / 9) |
| Uptime: | 59:44:02 |
| Calls: | 13,948 |
| Calls today: | 1 |
| Files: | 187,035 |
| D/L today: |
2,694 files (773M bytes) |
| Messages: | 2,461,294 |