Programs as partial graphs. II: Recursion (Q1168724): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(81)90068-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038144522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable Properties of Monadic Functional Schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of the inductive assertion method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programs as partial graphs. I: Flow equivalence and correctness / rank
 
Normal rank

Latest revision as of 16:45, 13 June 2024

scientific article
Language Label Description Also known as
English
Programs as partial graphs. II: Recursion
scientific article

    Statements

    Programs as partial graphs. II: Recursion (English)
    0 references
    0 references
    1981
    0 references
    0 references
    recursive flow diagram program completeness
    0 references
    correctness
    0 references
    termination
    0 references
    0 references