Getting There and Back Again
| Autor: | Danvy, Olivier |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Fundamenta Informaticae, Volume 185, Issue 2 (May 6, 2022) fi:9159 |
| Druh dokumentu: | Working Paper |
| Popis: | "There and Back Again" (TABA) is a programming pattern where the recursive calls traverse one data structure and the subsequent returns traverse another. This article presents new TABA examples, refines existing ones, and formalizes both their control flow and their data flow using the Coq Proof Assistant. Each formalization mechanizes a pen-and-paper proof, thus making it easier to "get" TABA. In addition, this article identifies and illustrates a tail-recursive variant of TABA, There and Forth Again (TAFA) that does not come back but goes forth instead with more tail calls. Comment: 69 pages (final version with complete acknowledgments) |
| Databáze: | arXiv |
| Externí odkaz: |
|