Skip to main navigation Skip to search Skip to main content

Proving Termination of Recursive Programs by Matching Against Simplified Program Versions and Construction of Specialized Libraries in Theorema

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Original languageEnglish
Title of host publicationProceedings of 9-th International Workshop on Termination
Editors D. Hofbauer and A. Serebrenik
Place of PublicationParis, France
Pages48-52
Number of pages4
Publication statusPublished - 2007

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

Cite this