## International Symposium on Theoretical Programming |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The logic of can | 17 |

Copying in commutation operator schemata | 29 |

On synthesizing programs given by examples | 56 |

Copyright | |

7 other sections not shown

### Other editions - View all

International Symposium on Theoretical Programming A. Ershov,V.A. Nepomniaschy No preview available - 2014 |

### Common terms and phrases

admits induction algorithm allow application arbitrary arcs asynchronous axiom base basic body called complete computation connected consider consists construction contains continuous copying corresponding data flow decidable defined definition denote described designated determined edges effective elaboration elements entry equal equivalent example execution exists expression extension false Figure finite formal formula function give given graph initial input input nodes interpretation introduced language logical loop machine means memory metasystem mode natural nodes Note notions objects obtained occurs operator optimization output pair parallel partial particular path performed possible predicate problem procedure programming language proof properties prove R-schema recursive relation respect result rule satisfying schema schemata semantic sequence similar simple statement structure subschema symbol terminal Theorem theory transformations true units universal variables vertex weakly yielded