Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Termination of abstract reduction systems

Simple item page
dc.contributor.authorDawson, Jeremy
dc.contributor.authorGore, Rajeev
dc.date.accessioned2015-12-10T22:31:26Z
dc.date.issued2009
dc.date.updated2016-02-24T11:44:13Z
dc.description.abstractWe present a general theorem capturing conditions required for the termination of abstract reduction systems. We show that our theorem generalises another similar general theorem about termination of such systems. We apply our theorem to give interesting
dc.identifier.issn0129-0541
dc.identifier.urihttp://hdl.handle.net/1885/55525
dc.publisherWorld Scientific Publishing Company
dc.sourceInternational Journal of Foundations of Computer Science
dc.subjectKeywords: Rewriting; Strong normalisation; Termination; Well-founded ordering
dc.titleTermination of abstract reduction systems
dc.typeJournal article
local.bibliographicCitation.issue1
local.bibliographicCitation.lastpage82
local.bibliographicCitation.startpage57
local.contributor.affiliationDawson, Jeremy, College of Engineering and Computer Science, ANU
local.contributor.affiliationGore, Rajeev, College of Engineering and Computer Science, ANU
local.contributor.authoruidDawson, Jeremy, u8413080
local.contributor.authoruidGore, Rajeev, u9409448
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor010107 - Mathematical Logic, Set Theory, Lattices and Universal Algebra
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.ariespublicationu8803936xPUB331
local.identifier.citationvolume20
local.identifier.doi10.1142/S0129054109006450
local.identifier.scopusID2-s2.0-65249184352
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Dawson_Termination_of_abstract_2009.pdf
Size:
196.63 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS