Add to ORKGAbstract: There are considered a number of issues related to supercompilation: (1) the use of the homeomorphic embedding relation for ensuring termination of supercompilation, (2) the peculiarities of supercompilation for the languages with call-by-name and call-by-value parameter passing, and (3) the advantages and drawbacks of supercompilation and partial evaluation.Note: Research direction:Programming, parallel computing, multimedi
The paper presents two examples of non-traditional using of pro-gram specialization by Turchin’s sup...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...
This paper presents a termination technique for positive supercompilation, based on notions from ter...
Previous deforestation and supercompilation algorithms may introduce accidental termination when app...
A termination preserving supercompiler for a call-by-value language sometimes fails to remove interm...
Previous deforestation and supercompilation algorithms may introduce accidental termination when app...
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...
Abstract: An introduction to supercompilation, a program analysis and transformation techn...
Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental...
Abstract: The paper presents a number of improvements to the method of two-level supercomp...
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...
Abstract: This paper presents a reformulation of the notion of multi-result supercompilati...
A supercompiler is a program which can perform a deep transformation of programs using a principle w...
The paper presents two examples of non-traditional using of pro-gram specialization by Turchin’s sup...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...
This paper presents a termination technique for positive supercompilation, based on notions from ter...
Previous deforestation and supercompilation algorithms may introduce accidental termination when app...
A termination preserving supercompiler for a call-by-value language sometimes fails to remove interm...
Previous deforestation and supercompilation algorithms may introduce accidental termination when app...
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...
Abstract: An introduction to supercompilation, a program analysis and transformation techn...
Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental...
Abstract: The paper presents a number of improvements to the method of two-level supercomp...
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...
Abstract: This paper presents a reformulation of the notion of multi-result supercompilati...
A supercompiler is a program which can perform a deep transformation of programs using a principle w...
The paper presents two examples of non-traditional using of pro-gram specialization by Turchin’s sup...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...
This paper presents a termination technique for positive supercompilation, based on notions from ter...