Induction and recursion on datatypes
| Autor: | Doornbos, H., Backhouse, R.C., Möller, B. |
|---|---|
| Přispěvatelé: | Mathematics and Computer Science |
| Jazyk: | angličtina |
| Rok vydání: | 1995 |
| Předmět: | |
| Zdroj: | Mathematics of Program Construction (Proceedings 3rd International Conference, MPC'95, Kloster Irsee, Germany, July 17-21, 1995), 242-256 STARTPAGE=242;ENDPAGE=256;TITLE=Mathematics of Program Construction (Proceedings 3rd International Conference, MPC'95, Kloster Irsee, Germany, July 17-21, 1995) Lecture Notes in Computer Science ISBN: 9783540601173 MPC |
| Popis: | A new induction principle is introduced. The principle is based on a property of relations, called reductivity, that generalises the property of admitting induction to one relative to a given datatype. The principle is used to characterise a broad class of recursive equations that have a unique solution and is also related to standard techniques for proving termination of programs. Methods based on the structure of the given datatype for constructing reductive relations are discussed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|