Proving the correctness of recursion-based automatic program transformations (Q671683): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Transformation System for Developing Recursive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite trees in normal form and recursive equations having a unique solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic theory of sequential control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial evaluation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the correctness of recursion-based automatic program transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concept of a supercompiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992424 / rank
 
Normal rank

Latest revision as of 10:00, 27 May 2024

scientific article
Language Label Description Also known as
English
Proving the correctness of recursion-based automatic program transformations
scientific article

    Statements

    Identifiers