Unary PCF is decidable (Q1274980): Difference between revisions

@@ Property / cites work @@
+Polymorphic rewriting conserves algebraic confluence
+Normal rank
@@ Property / cites work @@
+The variable containment problem
@@ Property / cites work: The variable containment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finitary PCF is not decidable
@@ Property / cites work: Finitary PCF is not decidable / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of all minimal models
@@ Property / cites work: Decidability of all minimal models / rank @@
+Normal rank
@@ Property / cites work @@
+LCF considered as a programming language
@@ Property / cites work: LCF considered as a programming language / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of behavioural equivalence in unary PCF
+Normal rank
@@ Property / cites work @@
+Logical relations and the typed λ-calculus
@@ Property / cites work: Logical relations and the typed λ-calculus / rank @@
+Normal rank