Automated higher-order complexity analysis (Q1827392): Difference between revisions

@@ Property / cites work @@
+Proofs as programs
@@ Property / cites work: Proofs as programs / rank @@
+Normal rank
@@ Property / cites work @@
+Higher type recursion, ramification and polynomial time
+Normal rank
@@ Property / cites work @@
+Computational complexity via programming languages: Constant factors do matter
+Normal rank
@@ Property / cites work @@
+Automated complexity analysis of Nuprl extracted programs
+Normal rank
@@ Property / cites work @@
+Q3794177
@@ Property / cites work: Q3794177 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on complexity measures for inductive classes in constructive type theory
+Normal rank
@@ Property / cites work @@
+Q4133141
@@ Property / cites work: Q4133141 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimality and inefficiency
@@ Property / cites work: Optimality and inefficiency / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850553
@@ Property / cites work: Q4850553 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4726219
@@ Property / cites work: Q4726219 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038672
@@ Property / cites work: Q4038672 / rank @@
+Normal rank
@@ Property / cites work @@
+A Naïve Time Analysis and its Theory of Cost Equivalence
+Normal rank
@@ Property / cites work @@
+Intensional interpretations of functionals of finite type I
+Normal rank
@@ Property / cites work @@
+Mechanical program analysis
@@ Property / cites work: Mechanical program analysis / rank @@
+Normal rank