Inferring program specifications in polynomial-time (Q5030195): Difference between revisions

@@ Property / author @@
-Robert L. Givan
@@ Property / author: Robert L. Givan / rank @@
-Normal rank
@@ Property / author @@
+Robert L. Givan
@@ Property / author: Robert L. Givan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61739-6_43
+Normal rank
@@ Property / OpenAlex ID @@
+W1583988319
@@ Property / OpenAlex ID: W1583988319 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385530
@@ Property / cites work: Q4385530 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4068054
@@ Property / cites work: Q4068054 / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of type polymorphism in programming
@@ Property / cites work: A theory of type polymorphism in programming / rank @@
+Normal rank
@@ Property / cites work @@
+Taxonomic syntax for first order inference
@@ Property / cites work: Taxonomic syntax for first order inference / rank @@
+Normal rank
@@ Property / cites work @@
+Walther recursion
@@ Property / cites work: Walther recursion / rank @@
+Normal rank
@@ Property / cites work @@
+On equations for regular languages, finite automata, and sequential networks
+Normal rank
@@ Property / cites work @@
+Optimal representations of polymorphic types with subtyping
+Normal rank