Name
Abstract | ||
|---|---|---|
We present a constructive description of the automatic program synthesis method used in the PRIZ programming system. We give a justification of the method by proving the completeness of its inference rules for the class of constructive theories, and we present rules for transforming any intuitionistic propositional formula into a form suitable for these inference rules. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1016/0167-6423(83)90016-3 | SCIENCE OF COMPUTER PROGRAMMING |
Field | DocType | Volume |
Programming language,Program synthesis,Constructive,Computer science,Rule of inference,Completeness (statistics),Propositional formula | Journal | 2 |
Issue | ISSN | Citations |
3 | 0167-6423 | 33 |
PageRank | References | Authors |
8.06 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grigori Mints | 1 | 235 | 72.76 |
| E. Tyugu | 2 | 54 | 21.41 |