Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental specializer dealing with programs written in a higher-order functional language. The design decisions behind the algorithm are illustrated through a series of examples. Of particular interest are the decisions related to generalization and homeomorphic embedding of expressions with bound variables.Note: Research direction:Programming, parallel computing, multimediaRussia
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popular...
A hyperproperty is a set of sets of finite or infinite traces over some fixed alphabet and can be se...
Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program ...
Abstract: The paper describes the internal structure of HOSC, an experimental supercompile...
Abstract: The paper presents the proof of correctness of an experimental supercompiler HOS...
Abstract: There are considered a number of issues related to supercompilation: (1) the use...
Program specialization can divide a computation into several computation stages. The program generat...
We propose a simple extension to Popplestone and Plotkin's concept of Least General Generalizat...
IEEE World Congress on Computational Intelligence, Congress on Evolutionary Computation, Barcelona, ...
The paper presents two examples of non-traditional using of pro-gram specialization by Turchin’s sup...
Recently well-quasi orders in general, and homeomorphic embedding in par-ticular, have gained popula...
We present a proof-of-concept prototype of a (constructive variant of an) HOL interactive theorem pr...
AbstractWe lay out the design of HasCasl, a higher order extension of the algebraic specification la...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
We demonstrate how the framework of higher-order logic programming ...
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popular...
A hyperproperty is a set of sets of finite or infinite traces over some fixed alphabet and can be se...
Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program ...
Abstract: The paper describes the internal structure of HOSC, an experimental supercompile...
Abstract: The paper presents the proof of correctness of an experimental supercompiler HOS...
Abstract: There are considered a number of issues related to supercompilation: (1) the use...
Program specialization can divide a computation into several computation stages. The program generat...
We propose a simple extension to Popplestone and Plotkin's concept of Least General Generalizat...
IEEE World Congress on Computational Intelligence, Congress on Evolutionary Computation, Barcelona, ...
The paper presents two examples of non-traditional using of pro-gram specialization by Turchin’s sup...
Recently well-quasi orders in general, and homeomorphic embedding in par-ticular, have gained popula...
We present a proof-of-concept prototype of a (constructive variant of an) HOL interactive theorem pr...
AbstractWe lay out the design of HasCasl, a higher order extension of the algebraic specification la...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
We demonstrate how the framework of higher-order logic programming ...
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popular...
A hyperproperty is a set of sets of finite or infinite traces over some fixed alphabet and can be se...
Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program ...