| http://dbpedia.org/ontology/abstract
|
In rewriting, a reduction strategy or rewriting strategy is a relation specifying a rewrite for each object or term, compatible with a given reduction relation. Some authors use the term to refer to an evaluation strategy.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://www.itu.dk/people/sestoft/lamreduce/index.html +
, https://arxiv.org/abs/1701.04240v1 +
|
| http://dbpedia.org/ontology/wikiPageID
|
40712456
|
| http://dbpedia.org/ontology/wikiPageLength
|
21368
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1121168605
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Partial_function +
, http://dbpedia.org/resource/In-order_traversal +
, http://dbpedia.org/resource/Domain-specific_language +
, http://dbpedia.org/resource/Reduction_semantics +
, http://dbpedia.org/resource/Lambda_calculus +
, http://dbpedia.org/resource/Binary_relation +
, http://dbpedia.org/resource/Thunk +
, http://dbpedia.org/resource/Abstract_rewriting_system +
, http://dbpedia.org/resource/Rewriting +
, http://dbpedia.org/resource/Pre-order_traversal +
, http://dbpedia.org/resource/Evaluation_strategy +
, http://dbpedia.org/resource/Redex +
, http://dbpedia.org/resource/Lazy_evaluation +
, http://dbpedia.org/resource/Category:Rewriting_systems +
, http://dbpedia.org/resource/Barendregt_convention +
, http://dbpedia.org/resource/Reduction_system +
, http://dbpedia.org/resource/Interaction_nets +
, http://dbpedia.org/resource/Term_rewriting_system +
, http://dbpedia.org/resource/Transitive_closure +
, http://dbpedia.org/resource/Category:Lambda_calculus +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Efn +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Rp +
, http://dbpedia.org/resource/Template:Notelist +
, http://dbpedia.org/resource/Template:Main +
, http://dbpedia.org/resource/Template:Mono +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Lambda_calculus +
, http://dbpedia.org/resource/Category:Rewriting_systems +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Reduction_strategy?oldid=1121168605&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Reduction_strategy +
|
| owl:sameAs |
http://dbpedia.org/resource/Reduction_strategy +
, http://www.wikidata.org/entity/Q15947151 +
, https://global.dbpedia.org/id/bN1G +
|
| rdfs:comment |
In rewriting, a reduction strategy or rewriting strategy is a relation specifying a rewrite for each object or term, compatible with a given reduction relation. Some authors use the term to refer to an evaluation strategy.
|
| rdfs:label |
Reduction strategy
|
