|
Program Systems: Theory and Applications, 2010, Volume 1, Issue 3, Pages 37–71
(Mi ps10)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Foundations of Programming
Higher-order supercompilation
I. G. Klyuchnikov Keldysh Institute of Applied Mathematics
Abstract:
The paper describes the internal structure of HOSC, an experimental supercompiler dealing with programs written in a higher-order functional language (a subset of Haskell). A detailed and formal account is given of the concepts and algorithms the supercompiler is based upon. Particular attention is paid to the problems related to generalization and homeomorphic embedding of expressions with bound variables.
Key words and phrases:
supercompilation, program analysis, functional programming.
Received: 07.09.2010 Accepted: 16.09.2010
Citation:
I. G. Klyuchnikov, “Higher-order supercompilation”, Program Systems: Theory and Applications, 1:3 (2010), 37–71
Linking options:
https://www.mathnet.ru/eng/ps10 https://www.mathnet.ru/eng/ps/v1/i3/p37
|
|