F. S. Beckman. Mathematical Foundations of Programming. Addison-Wesley Publishing Company, Inc., 1980. @ NUS Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Study of Problem Solving Activities in a Hypermedia.. - Parkes (1994) (Correct)
....in terms of the activities in the interface performed by the subjects, and the subjects expression of their understanding of the operators and the problem solution. The task domain 6 The learners are given the task of discovering the so called uvwxy theorem for infinite context free languages (Beckman, 1980; Rayward Smith, 1983) by carrying out a direct manipulation operations which essentially model the proof of the theorem. However, the learners are not given a statement of the theorem and asked to prove it (as is usually the case in mathematics and associated disciplines) but are merely told ....
....are such that the final goal is both difficult to precisely define, and it is far from clear when, or if, it has been attained. We will return to these points later. We will briefly present the uvwxy theorem, in a form based on that usually given in formal presentations of the subject (e.g. Beckman, 1980): Any sufficiently long sentence, z, of an infinite context free language, L, can be represented as five concatenated substrings u, v, w, x and y i.e. z = uvwxy, where u and or y can be empty, one (but not both) of v and x can be empty, and w cannot be empty) so that uv i wx i y is also ....
Beckman F.S. (1980) Mathematical Foundations of Programming. Reading, MA: Addison-Wesley.
A Scheme for Little Languages in Interactive Graphics - Beckman (1991) (11 citations) Self-citation (Beckman) (Correct)
No context found.
F.S. Beckman, The Mathematical Foundations of Programming, Addison-Wesley Systems Programming Series, Addison-Wesley, Reading, MA, 1982.
A Scheme for Interactive Graphics - Beckman (1990) Self-citation (Beckman) (Correct)
No context found.
F.S. Beckman, The Mathematical Foundations of Programming, Addison-Wesley Systems Programming Series, Addison-Wesley, Reading, MA, 1982.
Ensuring Termination by Typability - Deng, Sangiorgi (Correct)
No context found.
F. S. Beckman. Mathematical Foundations of Programming. Addison-Wesley Publishing Company, Inc., 1980.
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.