-
Ronald Garcia,
Jaakko Järvi,
Andrew Lumsdaine,
Jeremy G. Siek,
and Jeremiah Willcock.
A Comparative Study of Language Support for Generic Programming.
In Proceedings of the 2003 ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (OOPSLA'03),
October 2003.
@InProceedings{comparing_generic_programming03,
author = {Ronald Garcia and Jaakko J\"arvi and Andrew Lumsdaine and Jeremy G. Siek and Jeremiah Willcock},
title = {A Comparative Study of Language Support for Generic Programming},
booktitle = {Proceedings of the 2003 ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (OOPSLA'03)},
year = 2003,
month = oct,
url = "http://doi.acm.org/10.1145/949305.949317",
}
-
Jaakko Järvi,
Andrew Lumsdaine,
Jeremy G. Siek,
and Jeremiah Willcock.
An Analysis of Constrained Polymorphism for Generic Programming.
In Kei Davis and Jörg Striegnitz, editors,
Multiparadigm Programming in Object-Oriented Languages Workshop (MPOOL) at OOPSLA,
Anaheim, CA,
October 2003.
@InProceedings{constrained_polymorphism:mpool03,
author = {Jaakko J{\"a}rvi and Andrew Lumsdaine and Jeremy G. Siek and Jeremiah Willcock},
title = {An Analysis of Constrained Polymorphism for Generic Programming},
booktitle = {Multiparadigm Programming in Object-Oriented Languages Workshop (MPOOL) at OOPSLA},
year = 2003,
editor = {Kei Davis and J\"org Striegnitz},
address = {Anaheim, CA},
month = oct,
url = "http://www.osl.iu.edu/~jajarvi/publications/papers/mpool03.pdf",
}
-
David Abrahams,
Jeremy G. Siek,
and Thomas Witt.
New Iterator Concepts.
Technical report N1477=03-0060,
ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language C++,
2003.
@TechReport{abrahams03:_new_iterator_concepts,
author = {David Abrahams and Jeremy G. Siek and Thomas Witt},
title = {New Iterator Concepts},
institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language {C++}},
year = 2003,
number = {N1477=03-0060},
url = "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1477.html",
}
-
David Abrahams,
Jeremy G. Siek,
and Thomas Witt.
Iterator Facade and Adaptor.
Technical report N1476=03-0059,
ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language C++,
2003.
@TechReport{abrahams03:_iterat_facad_adapt,
author = {David Abrahams and Jeremy G. Siek and Thomas Witt},
title = {Iterator Facade and Adaptor},
institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language {C++}},
year = 2003,
url = "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1476.html",
number = {N1476=03-0059}
}
-
Daniel P. Friedman,
Abdulaziz Ghuloum,
Jeremy G. Siek,
and Lynn Winebarger.
Improving the Lazy Krivine Machine.
Technical report 581,
Indiana University,
November 2003.
Note: To appear in the journal, Higher Order and Symbolic Computation.
@TechReport{friedman03:_improve_krivine_tr,
author = {Daniel P. Friedman and Abdulaziz Ghuloum and Jeremy G. Siek and Lynn Winebarger },
title = {Improving the Lazy Krivine Machine},
institution = {Indiana University},
year = 2003,
number = 581,
month = {November},
note = {To appear in the journal, Higher Order and Symbolic Computation},
url = {http://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR581},
annote = {Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pushing update markers on the stack in a way similar to the TIM and the STG machine. When a sequence of consecutive markers appears on the stack, all but the first cause redundant updates. Improvements related to these sequences have dealt with either the consumption of the markers or the removal of the markers once they appear. Here we present an improvement that eliminates the production of marker sequences of length greater than one. This improvement results in the C machine, a more space and time efficient variant of K. We then apply the classic optimization of short-circuiting operand variable dereferences to create the call-by-need S machine. Finally, we combine the two improvements in the CS machine. On our benchmarks this machine uses half the stack space, performs one quarter as many updates, and executes between 27 0.000000aster and 17lower than our L variant of Sestoft's lazy Krivine machine. More interesting is that on one benchmark L, S, and C consume unbounded space, but CS consumes constant space. Our comparisons to Sestoft's Mark 2 machine are not exact, however, since we restrict ourselves to unpreprocessed closed lambda terms. Our variant of his machine does no environment trimming, conversion to deBruijn-style variable access, and does not provide basic constants, data type constructors, or the recursive let. (The Y combinator is used instead.)}
}
-
J. Järvi,
Bjarne Stroustrup,
Douglas Gregor,
and Jeremy G. Siek.
Decltype and Auto.
Technical report N1478=03-0061,
ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language C++,
2003.
@TechReport{jaervi03:_declt_auto,
author = {J. J\"arvi and Bjarne Stroustrup and Douglas Gregor and Jeremy G. Siek},
title = {Decltype and Auto},
institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language {C++}},
year = 2003,
number = {N1478=03-0061},
url = "http://www.osl.iu.edu/~jajarvi/publications/papers/decltype_n1478.pdf",
}
-
Todd L. Veldhuizen and Jeremy G. Siek.
Combining Optimizations, Combining Theories.
Technical report 582,
Indiana University,
May 2003.
@TechReport{veldhuizen03:_comb_opt_thy,
author = {Todd L. Veldhuizen and Jeremy G. Siek},
title = {Combining Optimizations, Combining Theories},
institution = {Indiana University},
year = 2003,
number = 582,
month = {May},
url = {http://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR582},
annote = {We consider the problem of how best to combine optimizations in imperative compilers. It is known that combined optimizations (or ``super-analyses'') can be strictly better than iterating separate improvement passes. We propose an explanation of why this is so by drawing connections between program analysis and the algebraic and coalgebraic views of programs and processes. We argue that ``optimistic'' analyses decide coinductively-defined relations and are based on bisimilarity. We relate combining program improvements to the problem of deciding combinations of theories. Iterating program improvements is similar to the Nelson-Oppen method of deciding combined theories: in Nelson-Oppen decision procedures communicate equalities, and iterated improvement passes implicitly communicate equalities via term replacements. To decide combined theories of bisimilarity, some ``co-Nelson-Oppen'' procedure is needed that propagates \emph{inequalities} amongst decision procedures. Hence, iterating optimistic analyses fails to be effective because inequalities cannot be communicated by semantics-preserving rewrites. Superanalysis is conjectured to overcome this failing by behaving like a ``co-Nelson-Oppen'' decision procedure.}
}