First of all I want to thank the organizers of this seminar for inviting me to review the history and the present state of the work on supercompilation and metasystem transitions I believe that these two notions should be of pri mary importance for the seminar because they indicate the lines of further development and generalization of the two key notions most familiar to the participants supercompilation is a development and generalization of par tial evaluation while metasystem transition is the same for selfapplication For myself however the order of appearance of these keywords was oppo site I started from the general concept of metasystem transition MST for short and my consequent work in computer science has been an applicati...
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation...
omputational philosophy is the use of mechanized computational techniques to unearth philosophical i...
The implementation and semantics of dependent type theories can be studied in a syntax-independent w...
This paper gives a gentle introduction to Turchin's supercompilation and its applications in me...
Turchin's supercompilation is a program transformation technique for functional languages. A su...
It has previously been shown by Turchin in the context of supercompilation how metasystem transition...
A supercompiler is a program which can perform a deep transformation of programs using a principle w...
Abstract: An introduction to supercompilation, a program analysis and transformation techn...
We consider the principle “a new model is a model of an existing one ” as the main scheme for derivi...
In recent ten years the metasynthesis methods or synthesis and integration has attracted a lot of at...
Abstract: There are considered a number of issues related to supercompilation: (1) the use...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
Metabiology is a mathematical theory mainly based on algorithmic information theory and allows us to...
The studies of complex systems have been recognized as one of the greatest challenges for current an...
Abstract: The paper explains the principles of multi-result supercompilation. We introduce...
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation...
omputational philosophy is the use of mechanized computational techniques to unearth philosophical i...
The implementation and semantics of dependent type theories can be studied in a syntax-independent w...
This paper gives a gentle introduction to Turchin's supercompilation and its applications in me...
Turchin's supercompilation is a program transformation technique for functional languages. A su...
It has previously been shown by Turchin in the context of supercompilation how metasystem transition...
A supercompiler is a program which can perform a deep transformation of programs using a principle w...
Abstract: An introduction to supercompilation, a program analysis and transformation techn...
We consider the principle “a new model is a model of an existing one ” as the main scheme for derivi...
In recent ten years the metasynthesis methods or synthesis and integration has attracted a lot of at...
Abstract: There are considered a number of issues related to supercompilation: (1) the use...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
Metabiology is a mathematical theory mainly based on algorithmic information theory and allows us to...
The studies of complex systems have been recognized as one of the greatest challenges for current an...
Abstract: The paper explains the principles of multi-result supercompilation. We introduce...
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation...
omputational philosophy is the use of mechanized computational techniques to unearth philosophical i...
The implementation and semantics of dependent type theories can be studied in a syntax-independent w...