Combining first order algebraic rewriting systems, recursion and extensional lambda calculi (Q4632448): Difference between revisions

@@ Property / cites work @@
+Q4281490
@@ Property / cites work: Q4281490 / rank @@
+Normal rank
@@ Property / cites work @@
+Polymorphic rewriting conserves algebraic confluence
+Normal rank
@@ Property / cites work @@
+On the semantics of the universal quantifier
@@ Property / cites work: On the semantics of the universal quantifier / rank @@
+Normal rank
@@ Property / cites work @@
+A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
+Normal rank
@@ Property / cites work @@
+Simulating expansions without expansions
@@ Property / cites work: Simulating expansions without expansions / rank @@
+Normal rank
@@ Property / cites work @@
+Some lambda calculi with categorical sums and products
+Normal rank
@@ Property / cites work @@
+The virtues of eta-expansion
@@ Property / cites work: The virtues of eta-expansion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3918095
@@ Property / cites work: Q3918095 / rank @@
+Normal rank
@@ Property / cites work @@
+An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
+Normal rank
@@ Property / cites work @@
+Q4145693
@@ Property / cites work: Q4145693 / rank @@
+Normal rank