Termination and reduction checking for higher-order logic programs

DOI10.1007/3-540-45744-5_32MaRDI QIDQ4539625zbMATH OpenFDO

Authors Brigitte Pientka

Publication date 10 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2083/20830401

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Verifying termination and reduction properties about higher-order logic programs
• TERMINATION OF ABSTRACT REDUCTION SYSTEMS
• Automated termination proofs for logic programs by term rewriting
• Adapting functional programs to higher order logic
• Termination proofs for logic programs

Cited in

(4)

• Normalization for the simply-typed lambda-calculus in Twelf
• scientific article; zbMATH DE number 3978439 (Why is no real title available?)
• Termination checking with types
• Verifying termination and reduction properties about higher-order logic programs

Describes a project that uses

Uses Software

• Nuprl
• Twelf

This page was built for publication: Termination and reduction checking for higher-order logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539625)