Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
The technique is to specify the required program using the standard equations and then synthesise the tail-recursive program using the proofs as programs ...
Jun 8, 2005 · The technique is to specify the required program using the standard equations and then synthesise the tail-recursive program using the proofs as ...
The technique is to specify the required program using the standard equations and then synthesise the tail-recursive program using the proofs as programs ...
Citation for published version: Hesketh, J, Bundy, A & Smaill, A 1992, Using Middle-Out Reasoning to Control the Synthesis of Tail-. Recursive Programs. in ...
Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs CADE, 1992. CADE 1992 · DBLP · Scholar · DOI. Full names. Links ISxN. @ ...
People also ask
Using middle-out reasoning to control the synthesis of tail-recursive programs · Alan Smaill. Lecture Notes in Computer Science, 1992. downloadDownload free PDF
Using middle-out reasoning to control the synthesis of tail-recursive programs. In CADE-11, pages 310–324. Springer, 1992. 14. M. Hodorog and A. Craciun ...
219–239. Hesketh, J., Bundy, A., and Smaill, A.: Using middle-out reasoning to control the synthesis of tail-recursive programs, in D. Kapur (ed.), 11th ...
Dec 7, 2022 · Recursion are mainly of two types depending on whether a function calls itself from within itself or more than one function call one another mutually.
Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs. ... We describe a novel technique for the automatic synthesis of tail-recursive ...