Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-54458-7_4
+Normal rank
@@ Property / OpenAlex ID @@
+W2963145380
@@ Property / OpenAlex ID: W2963145380 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact bounds for lengths of reductions in typed <i>λ</i>-calculus
+Normal rank
@@ Property / cites work @@
+Asymptotically almost all \lambda-terms are strongly normalizing
+Normal rank
@@ Property / cites work @@
+Counting and generating lambda terms
@@ Property / cites work: Counting and generating lambda terms / rank @@
+Normal rank
@@ Property / cites work @@
+A Natural Counting of Lambda Terms
@@ Property / cites work: A Natural Counting of Lambda Terms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4738227
@@ Property / cites work: Q4738227 / rank @@
+Normal rank
@@ Property / cites work @@
+Saturation-Based Model Checking of Higher-Order Recursion Schemes.
+Normal rank
@@ Property / cites work @@
+A type-directed abstraction refinement approach to higher-order model checking
+Normal rank
@@ Property / cites work @@
+Types and higher-order recursion schemes for verification of higher-order programs
+Normal rank
@@ Property / cites work @@
+Verifying higher-order functional programs with pattern-matching algebraic data types
+Normal rank
@@ Property / cites work @@
+Q4027630
@@ Property / cites work: Q4027630 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence
+Normal rank
@@ Property / cites work @@
+Q3549563
@@ Property / cites work: Q3549563 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank