Paper Info
Title
Degrees of translatability and canonical forms in program schemas: Part I
Abstract
We define a measure of the generality of the control structure of a program schema. This imposes a partial ordering on program schemas, and leads to a concept of the “difficulty” of a programming problem. In this sense there exists a “hardest” flowchart program, recursive program etc. Some earlier proofs can also be simplified and/or clarified by this approach.
Year
DOI
Venue
1974
10.1145/800119.803879
STOC
Keywords
Field
DocType
control structure,programming problem,program schema,recursive program etc.,flowchart program,canonical form,earlier proof,partial order
Discrete mathematics,Existential quantification,Computer science,Canonical form,Mathematical proof,Flowchart,Schema (psychology),Partially ordered set,Generality,Recursion
Conference
Citations 
PageRank 
References 
4
7.43
6
Authors
1
Name
Order
Citations
PageRank
Ashok K. Chandra131161215.02