Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures (Q5170162): Difference between revisions

Latest revision as of 18:29, 8 July 2024

scientific article; zbMATH DE number 6319514

Language	Label	Description	Also known as
English	Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures	scientific article; zbMATH DE number 6319514

Statements

instance of

scholarly article

0 references

title

Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures (English)

0 references

0 references

0 references

Electronic Notes in Theoretical Computer Science

0 references

publication date

22 July 2014

0 references

zbMATH Keywords

conditional term rewriting

0 references

operational termination

0 references

semantic data structures

0 references

describes a project that uses

Maude

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.entcs.2009.03.036

0 references

cites work

Completion-time optimization of rewrite-time goal solving

0 references

On the Implementation of Construction Functions for Non-free Concrete Data Types

0 references

All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.

0 references

Proving operational termination of membership equational programs

0 references

Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

0 references

Dependency Pairs for Rewriting with Non-free Constructors

0 references

Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures

0 references

Q2778873

0 references

Operational termination of conditional term rewriting systems

0 references

Normalized rewriting: An alternative to rewriting modulo a set of equations

0 references

Q2783416

0 references

Complete Sets of Reductions for Some Equational Theories

0 references

Identifiers

zbMATH Open document ID

1294.68096

0 references

DOI

10.1016/j.entcs.2009.03.036

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5170162

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.entcs.2009.03.036
+Normal rank
@@ Property / OpenAlex ID @@
+W2016262003
@@ Property / OpenAlex ID: W2016262003 / rank @@
+Normal rank
@@ Property / cites work @@
+Completion-time optimization of rewrite-time goal solving
+Normal rank
@@ Property / cites work @@
+On the Implementation of Construction Functions for Non-free Concrete Data Types
+Normal rank
@@ Property / cites work @@
+All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
+Normal rank
@@ Property / cites work @@
+Proving operational termination of membership equational programs
+Normal rank
@@ Property / cites work @@
+Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
+Normal rank
@@ Property / cites work @@
+Dependency Pairs for Rewriting with Non-free Constructors
+Normal rank
@@ Property / cites work @@
+Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
+Normal rank
@@ Property / cites work @@
+Q2778873
@@ Property / cites work: Q2778873 / rank @@
+Normal rank
@@ Property / cites work @@
+Operational termination of conditional term rewriting systems
+Normal rank
@@ Property / cites work @@
+Normalized rewriting: An alternative to rewriting modulo a set of equations
+Normal rank
@@ Property / cites work @@
+Q2783416
@@ Property / cites work: Q2783416 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete Sets of Reductions for Some Equational Theories
+Normal rank