Sciweavers


Publication
135views
14 years 10 months ago
Arity Raiser and its Use in Program Specialization
Experiments on generating compilers by specializing specializers with respect to interpreters have shown that the compilers thus obtained have a natural structure only if the speci...
Sergei A. Romanenko

Publication
103views
14 years 10 months ago
How to Use Vectors for Representing Ground Expressions in the Implementations of the Language Refal
Most implementations of the language Refal represent ground expressions by doubly-linked lists, which results in low-cost concatenation. On the other hand, that representation nece...
Sergei M. Abramov, Sergei A. Romanenko

Publication
108views
14 years 10 months ago
A Compiler Generator Produced by a Self-Applicable Specializer Can Have a Surprisingly Natural and Understandable Structure
This paper describes the structure of, and the ideas behind, a self-applicable specializer of programs, as well as the principles of operation of a compiler generator that has been...
Sergei A. Romanenko
ERSHOV
2009
Springer
15 years 3 months ago
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
One of the applications of supercompilation is proving properties of programs.We focus in this paper on a speci c task: proving term equivalence for a higher-order lazy functiona...
Ilya Klyuchnikov, Sergei A. Romanenko