4
votes
Accepted
Is Linear Evaluation Parametric?
Here's an Agda formalization of the non-linear version of your argument, and my comment above:
...
3
votes
Efficient algorithm/ implementation to compute Transitive Closure of a Rule with respect to a Relationship
I give here an answer for a very specific subcase.
We let $x \in A_1 \times \dots \times A_k$ be written $(x^1,\dots,x^k)$.
When the rule $\sigma$ acts on each $A_i$ independently, in the same way, ...
2
votes
Accepted
Why Reflexive Graphs for Parametricity?
In the months since I asked this question, I think I have found a sensible answer.
Often, the type of relations considered do not compose. For instance, if your notion of a relation $R : D \to E$ ...
1
vote
What is the relation of parametricity and function extensionality?
Indeed there is a similarity in these two definitions.
Function extensionality that you showed is just a condition that specifies when two functions are equal.
If we talk about logical relations then ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
logical-relations × 12parametricity × 7
pl.programming-languages × 6
lo.logic × 3
type-theory × 3
ct.category-theory × 3
reference-request × 2
type-systems × 2
denotational-semantics × 2
graph-algorithms × 1
automata-theory × 1
sat × 1
lambda-calculus × 1
functional-programming × 1
typed-lambda-calculus × 1
dfa × 1
combinatory-logic × 1
nfa × 1
transitive-closure × 1