Publication date
December 1981
DOI Publisher
Published by Elsevier Ltd. ISSN
0898-1221Abstract
AbstractDerivation of a new sorting technique by application of formal program transformation to high level specification of the sorting task is presented
AbstractDerivation of a new sorting technique by application of formal program transformation to high level specification of the sorting task is presented
AbstractWe consider a recursive sorting algorithm in which, in each invocation, a new variable and a...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
What is a sorting function—not a sorting function for a given ordering relation, but a sorting funct...
AbstractDerivation of a new sorting technique by application of formal program transformation to hig...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
This paper treats Knuth and Szwarcfiter’s topological sorting program, presented in their paper “A s...
Starting from a general specification of the sorting of a sequence, and through successive transform...
Program synthesis for critical applications has become a viable alternative to program verification....
Using the deductive synthesis framework developed by Manna and Waldinger we have derived a wide vari...
In computer science and mathematics we can formulate a procedure for sorting unordered array or a f...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
In this article I investigate the properties of unification in sort theories. The usual notion of a ...
The paper presents a new framework for canonically associating an algorithm with a set of rewrite sy...
I would like to thank my colleages at the Max-Planck-Institut for many helpful com-ments on this pap...
The objective of this paper is to review the folklore knowledge seen in research work devoted on syn...
AbstractWe consider a recursive sorting algorithm in which, in each invocation, a new variable and a...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
What is a sorting function—not a sorting function for a given ordering relation, but a sorting funct...
AbstractDerivation of a new sorting technique by application of formal program transformation to hig...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
This paper treats Knuth and Szwarcfiter’s topological sorting program, presented in their paper “A s...
Starting from a general specification of the sorting of a sequence, and through successive transform...
Program synthesis for critical applications has become a viable alternative to program verification....
Using the deductive synthesis framework developed by Manna and Waldinger we have derived a wide vari...
In computer science and mathematics we can formulate a procedure for sorting unordered array or a f...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
In this article I investigate the properties of unification in sort theories. The usual notion of a ...
The paper presents a new framework for canonically associating an algorithm with a set of rewrite sy...
I would like to thank my colleages at the Max-Planck-Institut for many helpful com-ments on this pap...
The objective of this paper is to review the folklore knowledge seen in research work devoted on syn...
AbstractWe consider a recursive sorting algorithm in which, in each invocation, a new variable and a...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
What is a sorting function—not a sorting function for a given ordering relation, but a sorting funct...
Add to ORKG