Am 18.03.21 um 22:18 schrieb Jefferson Carpenter:
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
You probably want tohave a lok at the WG14 proposals by Jens Gustedt.
It is a series of N papers building on each other. If all are accepted,
that would give you these features (via C++-style auto and lambda).
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)