Conversion to tail recursion in term rewriting (Q2436518): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jlap.2013.07.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2109683171
@@ Property / OpenAlex ID: W2109683171 / rank @@
+Normal rank
@@ Property / cites work @@
+Program Inversion for Tail Recursive Functions
@@ Property / cites work: Program Inversion for Tail Recursive Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992669
@@ Property / cites work: Q3992669 / rank @@
+Normal rank
@@ Property / cites work @@
+Call-by-name, call-by-value and the \(\lambda\)-calculus
+Normal rank
@@ Property / cites work @@
+Continuation-Based Program Transformation Strategies
+Normal rank
@@ Property / cites work @@
+Q2783416
@@ Property / cites work: Q2783416 / rank @@
+Normal rank
@@ Property / cites work @@
+Automated termination proofs for logic programs by term rewriting
+Normal rank
@@ Property / cites work @@
+The narrowing-driven approach to functional logic program specialization
+Normal rank
@@ Property / cites work @@
+Fast narrowing-driven partial evaluation for inductively sequential programs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2436518