A Lambda-Free Higher-Order Recursive Path Order (Q2988386): Difference between revisions

@@ Property / describes a project that uses @@
+Archive Formal Proofs
@@ Property / describes a project that uses: Archive Formal Proofs / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2613299215
@@ Property / OpenAlex ID: W2613299215 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4447246
@@ Property / cites work: Q4447246 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Term Rewriting and All That
@@ Property / cites work: Term Rewriting and All That / rank @@
+Normal rank
@@ Property / cites work @@
+Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
+Normal rank
@@ Property / cites work @@
+A Lambda-Free Higher-Order Recursive Path Order
@@ Property / cites work: A Lambda-Free Higher-Order Recursive Path Order / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723890
@@ Property / cites work: Q2723890 / rank @@
+Normal rank
@@ Property / cites work @@
+The computability path ordering
@@ Property / cites work: The computability path ordering / rank @@
+Normal rank
@@ Property / cites work @@
+CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
+Normal rank
@@ Property / cites work @@
+The recursive path and polynomial ordering for first-order and higher-order terms
+Normal rank
@@ Property / cites work @@
+Paramodulation with non-monotonic orderings and simplification
+Normal rank
@@ Property / cites work @@
+SAT solving for termination proofs with recursive path orders and dependency pairs
+Normal rank
@@ Property / cites work @@
+Q5389068
@@ Property / cites work: Q5389068 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving termination with multiset orderings
@@ Property / cites work: Proving termination with multiset orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Aided Verification
@@ Property / cites work: Computer Aided Verification / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness in the theory of types
@@ Property / cites work: Completeness in the theory of types / rank @@
+Normal rank
@@ Property / cites work @@
+Uncurrying for termination and complexity
@@ Property / cites work: Uncurrying for termination and complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Polymorphic higher-order recursive path orderings
@@ Property / cites work: Polymorphic higher-order recursive path orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing curried and uncurried rewriting
@@ Property / cites work: Comparing curried and uncurried rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+A Higher-Order Iterative Path Ordering
@@ Property / cites work: A Higher-Order Iterative Path Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247081
@@ Property / cites work: Q4247081 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2751359
@@ Property / cites work: Q2751359 / rank @@
+Normal rank
@@ Property / cites work @@
+Isabelle/HOL. A proof assistant for higher-order logic
+Normal rank
@@ Property / cites work @@
+Generalized and Formalized Uncurrying
@@ Property / cites work: Generalized and Formalized Uncurrying / rank @@
+Normal rank
@@ Property / cites work @@
+Certification of Termination Proofs Using CeTA
@@ Property / cites work: Certification of Termination Proofs Using CeTA / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting Techniques and Applications
@@ Property / cites work: Rewriting Techniques and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+A new implementation technique for applicative languages
+Normal rank
@@ Property / cites work @@
+Q2778888
@@ Property / cites work: Q2778888 / rank @@
+Normal rank