Информатика и вычислительная техника
  • формат pdf
  • размер 315.49 КБ
  • добавлен 09 марта 2011 г.
Peyton-Jones S., Bolingbroke M. Supercompilation by Evaluation
Peyton-Jones S. , Bolingbroke M. Supercompilation by Evaluation // Second Inteational Workshop on Metacomputation in Russia (META-2010), July 1-5, 2010, Pereslavl-Zalessky.

My student Max Bolingbroke and I have been studying supercompilation, with a view to making GHC into a supercompiler. In this talk I'll describe various approaches that we have explored, and focus on the one we are pursuing right now. A well-known practical challenge in supercompilation is over-specialisation and code explosion. I will present some ideas we have developed to tackle this problem.

Краткое содержание:

Overview
Supercompilation by example
The basic supercompiler
Extending to recursive let
Results
Related Work
Further Work
Conclusions
Acknowledgments
References
Похожие разделы
Смотрите также

Curien P.-L. Categorical Combinators, Sequential Algorithms, and Functional Programmimg

  • формат djvu
  • размер 2.14 МБ
  • добавлен 12 октября 2011 г.
Издательство Birkh?user, 1993, -424 pp. The goal of this monograph is to give a concrete approach to the semantics of sequential programming languages, with application to the design and implementation of programming languages. Just as machines do not manipulate numbers, but representations of numbers, we do not present sets and functions, but concrete representations of these sets and functions. The motivation behind our constructions is to ens...

Launchbury J., Peyton-Jones S.L. Lazy Functional State Threads

Статья
  • формат pdf
  • размер 291.25 КБ
  • добавлен 09 марта 2011 г.
John Launchbury and Simon L. Peyton Jones, Lazy Functional State Threads // In Programming Languages Design and Implementation. - ACM Press, 1993. - pp. 24-35. Краткое содержание: Introduction Overview Array references Input/output Formal semantics Implementation Other useful combinators Related work Acknowledgements References Appendix

Okasaki Chris. Purely Functional Data Structures

  • формат pdf
  • размер 614.14 КБ
  • добавлен 24 сентября 2010 г.
When a C programmer needs an efficient data structure for a particular problem, he or she can often simply look one up in any of a number of good textbooks or handbooks. Unfortunately, programmers in functional languages such as Standard ML or Haskell do not have this luxury. Although some data structures designed for imperative languages such as C can be quite easily adapted to a functional setting, most cannot, usually because they depend in cr...