Karl Crary. A simple proof technique for certain parametricity results. In Fourth ACM International Conference on Functional Programming, pages 82-89, Paris, France, September 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... Cardelli, and Curien have taken a syntactic approach to parametricity by formalizing the logical relations arguments used in such proofs [1] More recently, Crary has proposed the use of singleton types as a means of proving parametricity results without resorting to the construction of models [4]. Pierce and Sangiorgi [15] have studied parametricity in a polymorphic variant of the calculus; they too are concerned with multiple views of the same value and point out some interesting interactions between abstraction and aliasing. None of the above work (except Leroy and Rouaix s) explicitly ....

Karl Crary. A simple proof technique for certain parametricity results. Technical Report CMU-CS-98-185, Carnegie Mellon University, December 1998.

....in the logic are used to represent binding. It is currently an open problem to find a tractable way to do this that also allows structural induction over abstract syntax. We will investigate using a logic like IOC for this. We will exploit the idea of parametricity and will adapt ideas from, e.g. [4]. Reflection. Reflecting the logic of a theorem prover in itself has appealing applications to automated reasoning. Some of these are outlined in [1] where we describe a useful reflection of Nuprl in itself. This idea has been picked up numerous times in the past, but little has been done beyond ....

Karl Crary. A simple proof technique for certain parametricity results. In 1999 International Conference on Functional Programming, 1999.

.... Cardelli, and Curien have taken a syntactic approach to parametricity by formalizing the logical relations arguments used in such proofs [1] More recently, Crary has proposed the use of singleton types as a means of proving parametricity results without resorting to the construction of models [4]. Pierce and Sangiori [16] prove parametricity results for a polymorphic pi calculus in an operational setting. Rather than add principals to the term language, they use external substitutions to reason about bisimilarity of polymorphic processes in which there are both abstract and concrete ....

Karl Crary. A simple proof technique for certain parametricity results. In Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming, Paris, France, September 1999. This volume.

.... Cardelli, and Curien have taken a syntactic approach to parametricity by formalizing the logical relations arguments used in such proofs [1] More recently, Crary has proposed the use of singleton types as a means of proving parametricity results without resorting to the construction of models [4]. None of the above work (except Leroy and Rouaix s) explicitly involves the notion of principal. Our syntactic separation of agents is similar to Nielson and Nielson s Two Level # calculus [12] There they are concerned with binding time analysis, so the two principals code is inherently not ....

Karl Crary. A simple proof technique for certain parametricity results. Technical Report CMU-CS98 -185, Carnegie Mellon University, December 1998.

No context found.

Karl Crary. A simple proof technique for certain parametricity results. Technical Report CMUCS -98-185, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, December 1998.

....given return address, the stack must have the same shape as on input except without the return address. Indeed, we can assert a much stronger property since sum is type checked holding # abstract: The input stack corresponding to # will remain unmodified throughout the lifetime of the procedure [4]. Hence, a caller is ensured that sum will not read or modify its local data (or that of its caller, etc. Returning to our example, mov eax,ecx at the beginning of sum would now become, mov eax, esp 4] so as to load the integer argument from the stack into eax. The final jmp would be replaced ....

Karl Crary. A simple proof technique for certain parametricity results. Technical Report CMU-CS98 -185, Carnegie Mellon University, December 1998.

....to the given return address, the stack must have the same shape as on input except without the return address. Indeed, a much stronger property holds since sum is type checked holding # abstract: The input stack corresponding to # will remain unmodified throughout the lifetime of the procedure [4]. Hence, a caller is assured that sum will not read or modify the caller s local data (or that of its caller, etc. Returning to our example, mov eax,ecx at the beginning of sum would now become, mov eax, esp 4] so as to load the integer argument from the stack into eax. The final jmp would be ....

Karl Crary. A simple proof technique for certain parametricity results. Technical Report CMUCS -98-185, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, December 1998.

....given return address, the stack must have the same shape as on input except without the return address. Indeed, we can assert a much stronger property since sum is type checked holding ae abstract: The input stack corresponding to ae will remain unmodified throughout the lifetime of the procedure [4]. Hence, a caller is ensured that sum will not read or modify its local data (or that of its caller, etc. Returning to our example, mov eax,ecx at the beginning of sum would now become, mov eax, esp 4] so as to load the integer argument from the stack into eax. The final jmp would be replaced ....

Karl Crary. A simple proof technique for certain parametricity results. Technical Report CMU-CS98 -185, Carnegie Mellon University, December 1998.

No context found.

Karl Crary. A simple proof technique for certain parametricity results. In Fourth ACM International Conference on Functional Programming, pages 82-89, Paris, France, September 1999.

No context found.

Karl Crary. A simple proof technique for certain parametricity results. In Fourth ACM International Conference on Functional Programming, pages 82-89, Paris, France, September 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC