Higher-order supercompilation

Бесплатный доступ

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.

Supercompilation, program analysis, functional programming

Короткий адрес: https://sciup.org/14335882

IDR: 14335882

Статья научная