Loops under Strategies (Q3636816)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Loops under Strategies	scientific article

Statements

scholarly article

0 references

Loops under Strategies (English)

0 references

0 references

Christian Sternagel

0 references

Rewriting Techniques and Applications

0 references

publication date

30 June 2009

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-02348-4_2

0 references

Term Rewriting and All That

0 references

Transformation techniques for context-sensitive rewrite systems

0 references

Frontiers of Combining Systems

0 references

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages

0 references

On Proving Uniform Termination and Restricted Termination of Rewriting Systems

0 references

0 references

0 references

Loop detection in term rewriting using the eliminating unfoldings

0 references

A Transformational Approach to Prove Outermost Termination Automatically

0 references

From Outermost Termination to Innermost Termination

0 references

Deciding Innermost Loops

0 references

Termination of string rewriting proved automatically

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-02348-4_2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3636816

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3636816&oldid=35115211"