We present a purely syntactic version of the Parametricity Theorem, showing that it is simply an example of formal theorem proving in second order minimal logic ...
Nov 21, 2024 · We present a purely syntactic version of the Parametricity Theorem, showing that it is simply an example of formal theorem proving in second ...
We present a purely syntactic version of the Parametricity Theorem, showing that it is simply an example of formal theorem proving in second order minimal logic ...
Outline of a proof theory of parametricity · Contents. Proceedings of the 5th ACM conference on Functional programming languages and computer architecture.
We present a purely syntactic version of the Parametricity Theorem, showing that it is simply an example of formal theorem proving in second order minimal logic ...
People also ask
What do you mean by proof theory?
What is the proof theory of Hilbert?
What is the categorical proof theory?
Is a theory a proof?
[PDF] A Simple Proof Technique for Certain Parametricity Results*
www.cs.cornell.edu › papers › param
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's ...
May 24, 2015 · Basically you would have to enumerate all proofs that treat f abstractly, and are normal for the theory of functor laws seen as a rewriting ...
Missing: Outline | Show results with:Outline
#parametricity · #proving · Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Mar 9, 2021 · This question asks for an informal explanation of why all polymorphic functions between functors are natural transformations.
Traditionally parametricity is formulated with proof- irrelevant relations but programming in Type Theory requires an exten- sion to proof-relevant relations.
Missing: Outline | Show results with:Outline