A characterization of lambda definable tree operations (Q918191): Difference between revisions

@@ Property / cites work @@
+The lambda calculus, its syntax and semantics
@@ Property / cites work: The lambda calculus, its syntax and semantics / rank @@
+Normal rank
@@ Property / cites work @@
+Q3703866
@@ Property / cites work: Q3703866 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5565113
@@ Property / cites work: Q5565113 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4068706
@@ Property / cites work: Q4068706 / rank @@
+Normal rank
@@ Property / cites work @@
+A unification algorithm for typed \(\overline\lambda\)-calculus
+Normal rank
@@ Property / cites work @@
+The typed lambda-calculus is not elementary recursive
+Normal rank
@@ Property / cites work @@
+On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
+Normal rank
@@ Property / cites work @@
+λ-definable functionals andβη conversion
@@ Property / cites work: λ-definable functionals andβη conversion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3708774
@@ Property / cites work: Q3708774 / rank @@
+Normal rank
@@ Property / cites work @@
+Word operation definable in the typed \(\lambda\)-calculus
+Normal rank