From programming-by-example to proving-by-example (Q5096230): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-54415-1_56
+Normal rank
@@ Property / OpenAlex ID @@
+W1515777799
@@ Property / OpenAlex ID: W1515777799 / rank @@
+Normal rank
@@ Property / cites work @@
+Higher-order unification with dependent function types
+Normal rank
@@ Property / cites work @@
+Synthesis of rewrite programs by higher-order and semantic unification
+Normal rank
@@ Property / cites work @@
+A unification algorithm for typed \(\overline\lambda\)-calculus
+Normal rank
@@ Property / cites work @@
+Proving and applying program transformations expressed with second-order patterns
+Normal rank
@@ Property / cites work @@
+A class of functions synthesized from a finite number of examples and a lisp program scheme
+Normal rank
@@ Property / cites work @@
+Higher-order unification revisited: Complete sets of transformations
+Normal rank
@@ Property / cites work @@
+A Methodology for LISP Program Construction from Examples
+Normal rank
@@ Property / cites work @@
+Explanation-based generalisation \(=\) partial evaluation
+Normal rank
@@ Property / cites work @@
+Programming by example and proving by example using higher-order unification
+Normal rank