The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505): Difference between revisions

@@ Property / cites work @@
+Q4536445
@@ Property / cites work: Q4536445 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3142167
@@ Property / cites work: Q3142167 / rank @@
+Normal rank
@@ Property / cites work @@
+CPS translations and applications: The cube and beyond
+Normal rank
@@ Property / cites work @@
+Domain-Free<i>λµ</i>-Calculus
@@ Property / cites work: Domain-Free<i>λµ</i>-Calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Typability and type checking in System F are equivalent and undecidable
+Normal rank
@@ Property / cites work @@
+Q4027630
@@ Property / cites work: Q4027630 / rank @@
+Normal rank
@@ Property / cites work @@
+Finitely stratified polymorphism
@@ Property / cites work: Finitely stratified polymorphism / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of the semi-unification problem
+Normal rank
@@ Property / cites work @@
+THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F
+Normal rank
@@ Property / cites work @@
+A type inference algorithm for a stratified polymorphic type discipline
+Normal rank
@@ Property / cites work @@
+Existential Type Systems with No Types in Terms
@@ Property / cites work: Existential Type Systems with No Types in Terms / rank @@
+Normal rank
@@ Property / cites work @@
+Existential type systems between Church and Curry style (type-free style)
+Normal rank
@@ Property / cites work @@
+The undecidability of the second order predicate unification problem
+Normal rank
@@ Property / cites work @@
+On the undecidability of second-order unification
@@ Property / cites work: On the undecidability of second-order unification / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624681
@@ Property / cites work: Q5624681 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624680
@@ Property / cites work: Q5624680 / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
+Normal rank