Conversion to tail recursion in term rewriting (Q2436518): 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.1016/j.jlap.2013.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109683171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program Inversion for Tail Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992669 / 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: Continuation-Based Program Transformation Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated termination proofs for logic programs by term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The narrowing-driven approach to functional logic program specialization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast narrowing-driven partial evaluation for inductively sequential programs / rank
 
Normal rank

Latest revision as of 09:08, 7 July 2024

scientific article
Language Label Description Also known as
English
Conversion to tail recursion in term rewriting
scientific article

    Statements

    Identifiers