Philip Wadler. Theorems for free. In Proc. Functional Programming Languages and Computer Architecture, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
From Control Effects to Typed Continuation Passing - Thielecke (2003) (1 citation) (Correct)
....hypothesis, since it is not even clear what naturality in ## is supposed to mean in a type like ( A from Example 3.5. What we need is some more general notion of being wellbehaved in ## that specializes to naturality whenever the e#ect can be masked. Relational parametricity [24, 28] provides such a notion. The property we are aiming for is, in essence, one of its basic instances, the Reynolds isomorphism = A (where # is not free in A) 4.1 Some basics on parametricity We recall some of the basics of parametricity [24] to prove what Wadler calls theorems for free ....
....28] provides such a notion. The property we are aiming for is, in essence, one of its basic instances, the Reynolds isomorphism = A (where # is not free in A) 4. 1 Some basics on parametricity We recall some of the basics of parametricity [24] to prove what Wadler calls theorems for free [28]: equational properties that follow from the type of an expression. We follow Pitts [23] in working directly on the syntax. We write R : A A # if R is a relation between A and A # . Let R1 : A A # and R2 : B B # be relations. Then we #R2 : A #B) # # ) by (F, F # ) R1#R2 i# ....
[Article contains additional citation context not shown here]
Philip Wadler. Theorems for free! In 4'th International Conference on Functional Programming and Computer Architecture (FPCA'89), pages 347--359. ACM, 1989.
Shortcut Fusion for Accumulating Parameters Zip-like Functions - Svenningsson (2002) (4 citations) (Correct)
....see that g must be polymorphic in its result type and the only way that it can produce it is to use its arguments. Using this type we can ensure that g is sufficiently polymorphic. Initially, work on model theory for polymorphic lambda calculus was used to argue for the correctness of the rule [Wad89]. Recently, a proof based on operational techniques has been given [Joh01] In order for the rule to apply the programmer needs to define his her functions using foldr and build. Only then will the rule apply. This has turned out not to be a big burden since many functions in the standard ....
Philip Wadler. Theorems for free! In 4'th International Conference on Functional Programming and Computer Architecture, London, September 1989.
Polytypic Values Possess Polykinded Types - Hinze (2001) (38 citations) (Correct)
....[26] allow the definition of functions that behave uniformly over all types. However, even polymorphic type systems are sometimes less flexible that one would wish. For instance, it is not possible to define a polymorphic equality function that works for all types the parametricity theorem [35] implies that a function of type . A Preprint submitted to Elsevier Science 30 August 2001 must necessarily be constant. As a consequence, the programmer is forced to program a separate equality function for each type from scratch. Polytypic programming [3,2] addresses this problem. ....
Philip Wadler. Theorems for free! In The Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89), London, UK, pages 347--359. Addison-Wesley Publishing Company, September 1989. 37
On Modular Transformation of Structural Content - Chuang, Lin (2003) (Correct)
....[ g) up t 4. NATURALTRANSFORMATIONSBETWEEN CONTENT MODELS We re introduce the notion of natural transformation, a concept from category theory, and recast it in the context of XML document transformation. Natural transformations have been used to model polymorphic functions, see, e.g. [24]. Certain polymorphic functions, like the map function for the list data type, are also known to be expressible as both a fold function and as an unfold function. Here we make an explicit connection between the above two observations, showing that a natural transformation between two inductive ....
Philip Wadler. Theorems for free. In Functional Programming Languages and Computer Architecture, pages 347--359, September 1989.
From Control Effects to Typed Continuation Passing - Thielecke (2003) (1 citation) (Correct)
....hypothesis, since it is not even clear what naturality in o:p is supposed to mean in a type like ( A o: A o: from Example 3.5. What we need is some more general notion of being wellbehaved in op that specializes to naturality whenever the effect can be masked. Relational parametricity [24, 28] pro vides such a notion. The property we are aiming for is, in essence, one of its basic instances, the Reynolds isomorphism (Vo: A o: o: A (where o: is not free in A) 4.1 Some basics on parametricity We recall some of the basics of parametricity [24] to prove what Wadler calls ....
....such a notion. The property we are aiming for is, in essence, one of its basic instances, the Reynolds isomorphism (Vo: A o: o: A (where o: is not free in A) 4. 1 Some basics on parametricity We recall some of the basics of parametricity [24] to prove what Wadler calls theorems for free [28]: equational prop erties that follow from the type of an expression. We follow Pitts [23] in working directly on the syntax. We write R: A A if R is a relation between A and A . Let R: A A and R2: B B be relations. Then we define a relation 2: A U) A U ) by (F, F ) E R R2 ....
[Article contains additional citation context not shown here]
Philip Wadlet. Theorems for free! In J'th International Conference on Functional Programming and Computer Architecture (FPCA'89), pages 347 359. ACM, 1989.
Program Logic and Program Analysis - Honda, Yoshida, Berger (Correct)
No context found.
Philip Wadler. Theorems for free. In Proc. Functional Programming Languages and Computer Architecture, 1989.
Scalable Certification for Typed Assembly Language - Grossman, Morrisett (2000) (4 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 347-359, London, United Kingdom, September 1989.
Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993) (4 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In Functional Programming Languages and Computer Architecture, pages 347--359. ACM, 1989.
A Lightweight Implementation of Generics and Dynamics - Cheney, Hinze (2002) (13 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In The Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89), London, UK, pages 347--359. Addison-Wesley Publishing Company, September 1989.
Precise and Expressive Mode Systems for Typed Logic Programming.. - Overton (2003) (Correct)
No context found.
Philip Wadler. Theorems for free! In Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 347--359. ACM Press, 1989.
Relating Cryptography and Polymorphism - Benjamin Pierce Eijiro (2000) (Correct)
No context found.
Philip Wadler. Theorems for free! In Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 347--359. ACM, 1989.
Safe Programming at the C Level of Abstraction - Grossman (2003) (Correct)
No context found.
Philip Wadler. Theorems for free! In 4th International Conference on Functional Programming Languages and Computer Architecture, pages 347--359, London, England, September 1989. ACM Press.
Scalable Certification for Typed Assembly Language - Grossman, Morrisett (2000) (4 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 347-359, London, United Kingdom, September 1989.
Logical Relations for Encryption - Eijiro Sumii University (2001) (16 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 347--359. ACM, 1989.
Monad Comprehensions: A Versatile Representation for Queries - Grust (2003) (Correct)
No context found.
23 Philip Wadler. Theorems for Free! In Proc. of the 4th Int'l Conference on Functional Programming and Computer Architecture (FPCA), London, England, September 1989.
Generic Haskell: Practice and Theory - Hinze, Jeuring (2003) (2 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In The Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89), London, UK, pages 347--359. Addison-Wesley Publishing Company, September 1989.
Higher-Order Intensional Type Analysis in Type-Erasure Semantics - Weirich (2003) (3 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In FPCA89: Conference on Functional Programming Languages and Computer Architecture, London, September 1989.
Generic Haskell: Practice and Theory - Hinze, Jeuring (2003) (3 citations) (Correct)
No context found.
Philip Wadler. Theorems for free! In The Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89), London, UK, pages 347--359. Addison-Wesley Publishing Company, September 1989.
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