Automated termination proofs for haskell by term rewriting.
Jürgen GieslMatthias RaffelsieperPeter Schneider-KampStephan SwiderskiRené ThiemannPublished in: ACM Trans. Program. Lang. Syst. (2011)
Keyphrases
- term rewriting
- theorem prover
- theorem proving
- rewrite systems
- knuth bendix
- first order logic
- operational semantics
- inference rules
- programming language
- computer algebra
- automated theorem provers
- semi automated
- machine learning
- functional programming
- plagiarism detection
- natural deduction
- proof planning
- functional language
- training data
- artificial intelligence