5 citations found. Retrieving documents...
J. McCarthy. A formal description of a subset of ALGOL. In [Ste66], pages 1--12, 1966.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
On the Search for Tractable Ways of Reasoning about Programs - Jones (2001)   (8 citations)  (Correct)

....Semantics cannot be completely separated from program veri cation and an outline of the major issues is given in Section 4.2. McCarthy s attention was more on reasoning about recursive functions than the imperative programs which are the focus here: McC63a] describes recursion induction , [McC60] discusses the LISP language, but [McC63b] shows a link between recursive functions and Algolic Programs . This last citation also includes one of the clearest statements of goals. For example Primarily, we would like to be able to prove that given procedures solve given problems . Instead ....

....also [HdR86, Zwi88] 54 Later published in journal form as [Pnu81] 55 See also [Lam80, Lam88] 56 A useful overview is contained in [Roz85] 57 For an early view, see [Gor61] 29 mathematical functions about which it is possible to reason. One of the earliest papers was by McCarthy: McC66] describes only a tiny programming language but, together with ideas from Calvin C. Elgot (1922 80) and Peter John Landin (b1930) these provided the basis of de nitions of major programming languages. A major milestone was the 1964 IFIP Working Conference on Formal Language Description ....

[Article contains additional citation context not shown here]

J. McCarthy. A formal description of a subset of ALGOL. In


Abstract Models of Storage - Tennent, Ghica (2000)   (Correct)

....after Strachey s work in this area, organized historically. Sections 5 9 outline later work, organized around relevant conceptual issues and approaches. 2. Before Strachey The state of the art in semantic modeling of storage operations before Strachey can be seen in two papers by John McCarthy [23, 24]. Commands in simple imperative languages are modeled as transformations of state vectors which are intended to record, among other things, the current values of all program variables. Operations for accessing and updating the current value of any variable are axiomatized. 3. Strachey, ....

J. McCarthy. A formal description of a subset of Algol. In Steel [64], pages 1--7.


Black tie optional: Modelling programming language concepts - Coleman, Jefferson, Jones (2004)   (Correct)

No context found.

J. McCarthy. A formal description of a subset of ALGOL. In [Ste66], pages 1--12, 1966.


The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003)   (Correct)

No context found.

J. McCarthy. A formal description of a subset of ALGOL. In


Formal Methods - Selected Historical References - Jones, McCauley (1992)   (1 citation)  (Correct)

No context found.

J. McCarthy. A formal description of a subset of ALGOL. In [547], pages 1--12, 1966.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC