Paterson, Michael S. Program schemata. In Michie, D., editor, Machine Intelligence 3, chapter 2, Edinburgh University Press (1968) 18--31. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Lambda-Calculus Schemata - Fischer (1993) (71 citations) (Correct)
....This precludes many of the encoding tricks that lead to the Turing tar pit, and schemata of various kinds can and do di#er in expressive power when defined in this way. Program schemata (also called program schemes) were introduced by Ianov [15] and subsequently studied by many others (see [6, 17, 26, 27, 32]) Recursive program schemes, which allow the recursive definition of functions, were also studied [14, 28, 36] The lambda calculus schemata of this paper are natural extensions of recursive schemes, obtained through the addition of full lambda abstraction. Good surveys of the state of ....
Paterson, Michael S. Program schemata. In Michie, D., editor, Machine Intelligence 3, chapter 2, Edinburgh University Press (1968) 18--31.
Formal Methods - Selected Historical References - Jones, McCauley (1992) (1 citation) (Correct)
No context found.
M. S. Paterson. Program schemata. In D. Michie, editor, Machine Intelligence, 3, pages 19--31. Edinburgh University Press, 1968.
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