FIXPOINT APPROACH TO THE THEORY OF COMPUTATIONMANNA Z; VUILLEMIN J.1972; COMMUNIC. A.C.M.; U.S.A.; DA. 1972; VOL. 15; NO 7; PP. 528-536; BIBL. 28 REF.Serial Issue

COMPUTATION OF RECURSIVE PROGRAMS. THEORY VS PRACTICEMANNA Z.1972; IN: AM. FED. INF. PROCESS. SOC. SPRING JT COMPUT. CONF. ATLANTIC CITY, N.J. 1972. PROC.; MONTVALE, N.J.; AFIPS PRESS.; DA. 1972; PP. 219-223; BIBL. 10 REF.Conference Proceedings

THE CYCLIC TOWERS OF HANOIATKINSON MD.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 3; PP. 118-119; BIBL. 2 REF.Article

BOTTOM-UP COMPUTATION OF RECUROIVE PROGRAMS.BERRY G.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 133; PP. 1-59; ABS. FR.; BIBL. 1 P. 1/2Serial Issue

EFFICIENT COMPILATION OF LINEAR RECURSIVE PROGRAMS.CHANDRA AK.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 16-25; BIBL. 12 REF.Conference Paper

SOME TRANSFORMATIONS FOR DEVELOPING RECURSIVE PROGRAMS.BURSTALL RM; DARLINGTON J.sdIN: INT. CONF RELIAB. SOFTWARE. PROC.; LOS ANGELES, CALIF.; 1975; S.L.; DA. S.D.; PP. 465-472; BIBL. 10 REF.Conference Paper

APPLICATION DES PROPRIETES DES COMPOSITIONS SEQUENTIELLE ET PARALLELE DES INSTRUCTIONS A LA TRANSFORMATION DE PROGRAMMES RECURSIFS.BERLIOUX P.1977; MATH. APPL. INFORMAT., RAPP. RECH.; FR.; DA. 1977; NO 100; PP. 1-27; BIBL. 7 REF.Serial Issue

ON THE COMPLETENESS OF THE INDUCTIVE ASSERTION METHOD.DE BAKKER JW; MEERTENS LGLT.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 3; PP. 323-357; BIBL. 19 REF.Article

On context-free treesCAZANESCU, V. E.Theoretical computer science. 1985, Vol 41, Num 1, pp 33-50, issn 0304-3975Article

ON THE COMPLEXITY OF SOME PROBLEMS CONCERNING THE USE OF PROCEDURES. IWINKLMANN K.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 3; PP. 299-318; BIBL. 15 REF.Article

ATTRIBUTE GRAMMARS AND RECURSIVE PROGRAM SCHEMESCOURCELLE B; FRANCHI ZANNETTACCI P.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 163-191; BIBL. 26 REF.Article

CORRECT COMPUTATION RULES FOR RECURSIVE LANGUAGES.DOWNEY PJ; RAVI SETHI.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 378-401; BIBL. 23 REF.Article

SOME CRITICISMS REGARDING THE ARTICLE "A RECURSIVE ALGORITHM FOR THE OPTIMAL CONVERSION OF DECISION TABLES"REINWALD L.1980; ANGEW. INFORM.; ISSN 0013-5704; DEU; DA. 1980; VOL. 22; NO 9; PP. 355-356; BIBL. 2 REF.Article

CALL BY NEED COMPUTATIONS IN NON-AMBIGUOUS LINEAR TERM REWRITING SYSTEMSHUET G; LEVY JJ.1979; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1979; NO 359; 55 P.; ABS. FRE; BIBL. 31 REF.Serial Issue

CONVERTING A CLASS OF RECURSIVE PROCEDURES INTO NON-RECURSIVE ONES.ROHL JS.1977; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1977; VOL. 7; NO 2; PP. 231-238; BIBL. 2 REF.Article

TRANSLATING SOME RECURSIVE PROCEDURES INTO ITERATIVE SCHEMAS.IRLIK J.1977; IN: PROGRAMMATION. INT. SYMP. PROGRAM. 2. PROC.; PARIS; 1976; PARIS; DUNOD; DA. 1977; PP. 39-52; BIBL. 4 REF.Conference Paper

COMPUTER SOFTWARE. PROGRAM PERFORMANCE1972; IN: INF. PROCESS. PROC. IFIP CONGR. LJUBLJANA, YUGOSL., 1971; AMSTERDAM; NORTH-HOLLAND; DA. 1972; VOL. 1; PP. 314-334; BIBL. DISSEM.Conference Proceedings

AUTOMATIC PROGRAM TRANSFORMATION VIEWED AS THEOREM PROVINGCOSTA EJF.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 37-46; BIBL. 10 REF.Conference Paper

AXIOMATIC DEFINABILITY AND COMPLETENESS FOR RECURSIVE PROGRAMSMEYER AR; MITCHELL JC.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 337-346; BIBL. 12 REF.Conference Paper

SOME CONNECTIONS BETWEEN ITERATIVE PROGRAMS, RECURSIVE PROGRAMS, AND FIRST-ORDER LOGICKFOURY AJ.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 150-166; BIBL. 5 REF.Conference Paper

FORMAL COMPUTATIONS OF NON DETERMINISTIC RECURSIVE PROGRAM SCHEMESARNOLD A; NIVAT M.1980; MATH. SYST. THEORY; USA; DA. 1980; VOL. 13; NO 3; PP. 219-236; BIBL. 27 REF.Article

RECURSIVE PROGRAMMING IN BASICDERSHEM HL.1980; DIGIT. DESIGN; USA; DA. 1980; VOL. 10; NO 7; PP. 20-22Article

THEORETICAL AND EMPIRICAL STUDIES ON USING PROGRAM MUTATION TO TEST THE FUNCTIONAL CORRECTNESS OF PROGRAMSBUDD TA; DEMILLO RA; LIPTON RJ et al.1980; ANNUAL SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 7/1980/LAS VEGAS NV; USA; NEW YORK: ACM; DA. 1980; PP. 220-233; BIBL. 35 REF.Conference Paper

ON A CLASS OF RECURSIVE PROCEDURES AND EQUIVALENT ITERATIVE ONESHIKITA T.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 4; PP. 305-320; BIBL. 10 REF.Article

ALGORITHMES DE STRUCTURATION DE PROGRAMMES DE TYPE FORTRAN.DECHARTRES C.1978; ; S.L.; DA. 1978; PP. 1-136; BIBL. 2 P.; (THESE DOCT. 3E CYCLE, SPEC. MATH., MENTION INF.; PIERRE ET MARIE CURIE PARIS VI)Thesis