On Proving Termination of Simply-Typed Term Rewriting Systems Based on Strong Computability - I-Scover metadata
ARTICLE

On Proving Termination of Simply-Typed Term Rewriting Systems Based on Strong Computability

Metadata details

now loading...

Related ARTICLE(s)

now loading...

Related metadata

now loading...

Search by external websites

now loading...

Login 日本語