Left termination turned into termination

DOI10.1016/0304-3975(94)90059-0zbMath0795.68041OpenAlexW2121449568MaRDI QIDQ1318730

Kees Doets

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://pure.uva.nl/ws/files/2906656/192_2611y.pdf

zbMATH Keywords

program transformationterminationlogic programstotal recursive functions

Mathematics Subject Classification ID

Logic programming (68N17) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

A slight strengthening of a theorem of Blair and Kunen

Cites Work

• Canonical logic programs
• Strong termination of logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Left termination turned into termination