COMPLETION AS A DERIVED RULE OF INFERENCE

Simple item page
dc.contributor.authorSlind, Konradeng
dc.date.accessioned2008-05-20T23:28:59Z
dc.date.available2008-05-20T23:28:59Z
dc.date.computerscience1999-05-27eng
dc.date.issued1990-10-01eng
dc.description.abstractA simple first step in the investigation of term rewriting systems in higher order logic is to just insert the first order completion algorithm unchanged into the more complicated logic. This paper presents the details of how this is done in Mike Gordon's HOL system, an implementation of Church's Simple Type Theory. We present completion as a derived rule of inference, not (as usual) as an ad hoc procedure. The completion rule presented here is easily adaptable to other natural deduction logics with equality.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1990-409-33eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31293
dc.identifier.urihttp://hdl.handle.net/1880/46524
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleCOMPLETION AS A DERIVED RULE OF INFERENCEeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1990-409-33.pdf
Size:
1015.96 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications