As computer programming has become more complex, management has become more concerned about its own ability to exercise appropriate control over the programmer. This paper describes an implementation of procedures, li...
详细信息
The value of token reinforcement in the instatement and shaping of fluency was examined in an intensive treatment program for adult stutterers. Experiment 1 examined the effect of removing the tangible back-up reinfor...
详细信息
The value of token reinforcement in the instatement and shaping of fluency was examined in an intensive treatment program for adult stutterers. Experiment 1 examined the effect of removing the tangible back-up reinforcers for the token system and found that clients' performance in the program was equally good with or without these back-up reinforcers, suggesting that a strict token economy may not be crucial to rapid progress through treatment. Experiment 2 compared contingent and noncontingent taken reinforcement, while controlling for some variables that may have confounded the results of earlier research, and found no difference in clients' performance. Experiment 3 examined the effect of the entire removal of token reinforcement. Performance was found to be no worse under a "no tokens" system than under a system of tokens with back-up reinforcers. It is argued that in a highly structured treatment program where many other reinforcers are operating, token reinforcement may be largely redundant. Clinical and theoretical implications of the findings are discussed.
作者：
J.M. FabaI.B.M. S.A.E.
Castellana 4 Madrid - 1 E.T.S. Ingenieros Industriales Departamento Matemáticas Castellana 84 Madrid 6 Spain
The purpose of the “Interactive System to Help Program Design” is to help the program design in two ways: ◦ Defining the data structure of files which are going to be processed by a program (data driven program). As...
详细信息
The purpose of the “Interactive System to Help Program Design” is to help the program design in two ways: ◦ Defining the data structure of files which are going to be processed by a program (data driven program). As a matter of fact: it is necessary to consolidate the different files when the program processes several ones. The consolidated data structure is defined in terms of regular algebra; it is to say: using concatenation, iteration, union, intersection and complementary of data structures. Really is a formalisation and generalisation of the known Jackson method for program design. ◦ Defining a program as a collection of states, it is to say using an automaton to represent its functions and how going from one to other. The system has been programmed using APL, taking advantage of all the possibilities of such interactive system. It generates a root segment in structured APL (in Dijkstra sense) which can process either the data structure, detecting all kind of erroneous inputs, or the automaton used to define the program.
作者：
TRIANCE, JMComputation Department
University of Manchester Institute of Science and Technology Sackville Street Manchester M60 1QD
The problems of writing structured programs in COBOL as defined by the Current Standard and by CODASYL are examined. Four versions of structured COBOL supported by preprocessors are presented and some criteria for jud...
详细信息
The problems of writing structured programs in COBOL as defined by the Current Standard and by CODASYL are examined. Four versions of structured COBOL supported by preprocessors are presented and some criteria for judging preprocessor are proposed.
This paper discusses axiomatic and functional models of the semantics of structured programming. The models are presented together with their respective methodologies for proving program correctness and for deriving c...
详细信息
This paper discusses axiomatic and functional models of the semantics of structured programming. The models are presented together with their respective methodologies for proving program correctness and for deriving correct programs. Examples using these methodologies are given. Finally, the models are compared and contrasted.
A simple tree-like programming/specification language is presented. The central idea is the dividing of conventional programming constructs into the two classes of and and or subgoaling, the subgoal tree itself consti...
详细信息
Regular Expression Compiler (REC) is a programming language of extremely simple structure. It is a goto-less language which has very appealing transfer of control operations. It is a generalized language which can be ...
详细信息
ISBN:
(纸本)9780897910149
Regular Expression Compiler (REC) is a programming language of extremely simple structure. It is a goto-less language which has very appealing transfer of control operations. It is a generalized language which can be implemented for special purpose applications by a proper choice of operators and predicates. This paper describes REC language and one of its "symbol manipulation" implementations, REC/SM. The language has been enormously successful from the users satisfaction point of view. And like BLISS, it has once again proved that the well-publicized inconvenience of programming without a goto is a myth.
Certain graph theoretic problems dealing with the testing of structured programs are treated. A structured digraph is a digraph that represents a structured program. A labelling procedure which characterizes structure...
详细信息
Certain graph theoretic problems dealing with the testing of structured programs are treated. A structured digraph is a digraph that represents a structured program. A labelling procedure which characterizes structured digraphs is described. An efficient algorithm for finding a minimum path cover for the vertices of digraphs that belong to an important family of structured digraphs is given. To model interactions among code segments the notions of `required pairs" and `must pairs" are introduced and the corresponding constrained path cover problems are shown to be NP-complete even for acyclic structured digraphs.
暂无评论