Post #1506853
2025-03-07 14:22 UTC
@cbaberle @chrisamaphone Nicely written! I've not seen anyone explore the ordered case before.
There's also Linear Plotkin-Abadi logic ( https://arxiv.org/abs/cs/0611004 ) that axiomatises parametricity reasoning for a linear type system. Their motivation was to use linear types as an abstract domain theory though.
I did a short example of linear types + logical relations to prove that linear functions from lists to lists are always permutations: https://github.com/bobatkey/sorting-types/blob/master/agda/Linear.agda . The original idea for this was from @pigworker
The was later (briefly) written up in a more general form for any semiring-graded system by @mudri and me: https://bentnib.org/context-constrained.pdf and also in a slightly different way by Bernardy and Abel: https://dl.acm.org/doi/10.1145/3408972
Replies (1)
-
@chrisamaphone@hci.social 2025-03-07 16:03
@cbaberle @mudri @bentnib @pigworker thanks - appreciate the pointers! I’ve been trying to get my head around graded systems lately & what relationship they have to resource semantics, so maybe this will help when i get a chance to study it more closely…