Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7966682> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- Q7966682 subject Q6468017.
- Q7966682 abstract "In computer programming, Walther recursion (named after Christoph Walther) is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs. It allows a more natural style of expressing computation than simply using primitive recursive functions.Since the halting problem cannot be solved in general, there need to be still programs that will terminate, but which Walther recursion cannot prove to terminate. Walther recursion may be used in total functional languages in order to allow a more liberal style of showing primitive recursion.".
- Q7966682 wikiPageExternalLink 31163520.pdf.
- Q7966682 wikiPageExternalLink On-proving-termination-AIJ-71-1_1994-2.pdf.
- Q7966682 wikiPageExternalLink walther.ps.
- Q7966682 wikiPageExternalLink 978-3-540-61511-8.
- Q7966682 wikiPageWikiLink Q1570472.
- Q7966682 wikiPageWikiLink Q17146827.
- Q7966682 wikiPageWikiLink Q2518389.
- Q7966682 wikiPageWikiLink Q4801030.
- Q7966682 wikiPageWikiLink Q49108.
- Q7966682 wikiPageWikiLink Q4927494.
- Q7966682 wikiPageWikiLink Q5283898.
- Q7966682 wikiPageWikiLink Q622849.
- Q7966682 wikiPageWikiLink Q6468017.
- Q7966682 wikiPageWikiLink Q7702793.
- Q7966682 comment "In computer programming, Walther recursion (named after Christoph Walther) is a method of analysing recursive functions that can determine if the function is definitely terminating, given finite inputs. It allows a more natural style of expressing computation than simply using primitive recursive functions.Since the halting problem cannot be solved in general, there need to be still programs that will terminate, but which Walther recursion cannot prove to terminate.".
- Q7966682 label "Walther recursion".