Inference rules for proving the equivalence of recursive procedures (Q938300): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-008-0075-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039222548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formalised computer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal arithmetic: Algorithms and mechanization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for reasoning about equality / rank
 
Normal rank

Latest revision as of 13:52, 28 June 2024

scientific article
Language Label Description Also known as
English
Inference rules for proving the equivalence of recursive procedures
scientific article

    Statements

    Inference rules for proving the equivalence of recursive procedures (English)
    0 references
    0 references
    0 references
    19 August 2008
    0 references
    Hoare's rule for recursive procedures
    0 references
    proof rules
    0 references

    Identifiers