Sciweavers

15 search results - page 1 / 3
» icfp 1999
Sort
View
ICFP
1999
ACM
13 years 9 months ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
ICFP
1999
ACM
13 years 9 months ago
Calling Hell From Heaven and Heaven From Hell
The increasing popularity of component-based programming tools offer a big opportunity to designers of advanced programming languages, such as Haskell. If we can package our progr...
Sigbjorn Finne, Daan Leijen, Erik Meijer, Simon L....
ICFP
1999
ACM
13 years 9 months ago
Principals in Programming Languages: A Syntactic Proof Technique
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
Steve Zdancewic, Dan Grossman, J. Gregory Morriset...
ICFP
1999
ACM
13 years 9 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...