This HTML5 document contains 49 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9http://portal.acm.org/
n23https://global.dbpedia.org/id/
n11https://web.archive.org/web/20060516192924/http:/www.dsic.upv.es/users/elp/berlanga/slucas/entcsV64/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n8https://web.archive.org/web/20070327185702/http:/www.babelfish.nl/
n24https://www.sciencedirect.com/science/article/pii/
freebasehttp://rdf.freebase.com/ns/
n12http://www.logic.at/staff/gramlich/papers/
n14http://cl-informatik.uibk.ac.at/users/ami/research/publications/journals/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n21http://www.dsic.upv.es/users/elp/berlanga/slucas/entcsV64/
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
n22http://hal.inria.fr/docs/00/10/78/74/PDF/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Arm_(disambiguation)
dbo:wikiPageWikiLink
dbr:Abstract_rewriting_machine
dbo:wikiPageDisambiguates
dbr:Abstract_rewriting_machine
Subject Item
dbr:Abstract_Rewriting_Machine
dbo:wikiPageWikiLink
dbr:Abstract_rewriting_machine
dbo:wikiPageRedirects
dbr:Abstract_rewriting_machine
Subject Item
dbr:Abstract_rewriting_machine
rdf:type
yago:Whole100003553 yago:Machine103699975 yago:WikicatVirtualMachines yago:PhysicalEntity100001930 yago:Artifact100021939 yago:Device103183080 yago:Instrumentality103575240 yago:Object100002684
rdfs:label
Abstract rewriting machine
rdfs:comment
The Abstract Rewriting Machine (ARM) is a virtual machine which implements term rewriting for minimal term rewriting systems. Minimal term rewriting systems are term rewriting systems in which each rule takes on one of six forms: ContinuationReturnMatchAddDeleteIdent Each of these six forms is mapped (in ARM) to one or a few processor instructions on most contemporary micro processors. Accordingly, minimal term rewriting is achieved at tens to hundreds of clock cycles per reduction step—millions of reduction steps per second.
dcterms:subject
dbc:Virtual_machines dbc:Term-rewriting_programming_languages
dbo:wikiPageID
6451048
dbo:wikiPageRevisionID
1088524464
dbo:wikiPageWikiLink
dbr:Journal_of_Functional_Programming dbr:Virtual_machine dbc:Virtual_machines dbr:Proceedings_8th_International_Workshop_on_Computing_with_Terms_and_Graphs dbr:Handbook_of_the_History_of_Logic dbr:Term_rewriting dbr:Left-linear dbc:Term-rewriting_programming_languages dbr:Electronic_Notes_in_Theoretical_Computer_Science dbr:Term_rewriting_system
dbo:wikiPageExternalLink
n8:epicarm.html n9:citation.cfm%3Fid=291903&dl=GUIDE&coll=&CFID=15151515&CFTOKEN=6184618 n9:citation.cfm%3Fid=345102&dl=ACM&coll=ACM&CFID=15151515&CFTOKEN=6184618 n11:entcsV64.pdf n12:wrs07-techrep.pdf n14:04jfp.pdf%7C n21:entcsV64.pdf n22:A01-R-139.pdf%7C n24:B978044451624450006X
owl:sameAs
freebase:m.0g5w1c yago-res:Abstract_rewriting_machine n23:4LDXL wikidata:Q4669955
dbp:wikiPageUsesTemplate
dbt:Cite_journal
dbo:abstract
The Abstract Rewriting Machine (ARM) is a virtual machine which implements term rewriting for minimal term rewriting systems. Minimal term rewriting systems are term rewriting systems in which each rule takes on one of six forms: ContinuationReturnMatchAddDeleteIdent Each of these six forms is mapped (in ARM) to one or a few processor instructions on most contemporary micro processors. Accordingly, minimal term rewriting is achieved at tens to hundreds of clock cycles per reduction step—millions of reduction steps per second. ARM implements general term rewriting, in that every single-sorted unconditional left-linear term rewriting system can be transformed (compiled) into a minimal term rewriting system that gives rise to the same normal form relation. An overview with references to this compilation process for innermost rewriting, as well as a detailed overview of ARM, can be found in "Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems". A description for lazy (non-innermost) rewriting can be found in "Lazy rewriting on eager machinery". A documented implementation of ARM (with the term rewriting language Epic) is available here. Note that site and software are no longer being actively maintained.
prov:wasDerivedFrom
wikipedia-en:Abstract_rewriting_machine?oldid=1088524464&ns=0
dbo:wikiPageLength
4578
foaf:isPrimaryTopicOf
wikipedia-en:Abstract_rewriting_machine
Subject Item
dbr:Minimal_term_rewriting_systems
dbo:wikiPageWikiLink
dbr:Abstract_rewriting_machine
dbo:wikiPageRedirects
dbr:Abstract_rewriting_machine
Subject Item
wikipedia-en:Abstract_rewriting_machine
foaf:primaryTopic
dbr:Abstract_rewriting_machine