Pages that link to "Item:Q3183545"
From MaRDI portal
The following pages link to Certification of Termination Proofs Using CeTA (Q3183545):
Displayed 7 items.
- CeTA (Q18676) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- Animating the Formalised Semantics of a Java-Like Language (Q3088008) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- A Decision Procedure for Regular Expression Equivalence in Type Theory (Q3100207) (← links)
- Generalized and Formalized Uncurrying (Q3172898) (← links)