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

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

THE MC CARTHY'S RECURSION INDUCTION PRINCIPLE: "OLDY" BUT "GOODY"KOTT L.1982; CALCOLO; ISSN 0008-0624; ITA; DA. 1982; VOL. 19; NO 1; PP. 59-69; BIBL. 10 REF.Article

OPERATIONAL AND SEMANTIC EQUIVALENCE RECURSIVE PROGRAMSRAOULT JC; VUILLEMIN J.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 772-796; BIBL. 25 REF.Article

CALCUL DES PROGRAMMES RECURSIFSRACHANSKI V.1979; DOKL. AKAD. NAUK UKR. SSR, SER. A; ISSN 0201-8446; UKR; DA. 1979; NO 10; PP. 853-855; ABS. ENG; BIBL. 2 REF.Article

COMPUTATION OF RECURSIVE PROGRAMSRACANSKY V.1978; SCRIPTA FAC. SCI. NAT. UNIV. PURKYN. BRUN.; CSK; DA. 1978; VOL. 8; NO 10; PP. 59-62; BIBL. 3 REF.Article

POINTS RECURRING: THE HISTORY OF A RAILWAY PROBLEMSTONE RG.1982; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 9; PP. 88-94; BIBL. 5 REF.Article

UNFOLD/FOLD PROGRAM TRANSFORMATIONS = TRANSFORMATIONS DE PROGRAMME PAR PLIAGE/DEPLIAGEKOTT LAURENT.1982; ; FRA; DA. 1982; INRIA/RR-155; 28 P.; 30 CM; ABS. FRE; BIBL. 25 REF.;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 155]Report

MODIFIED PETRI NETS AS FLOWCHARTS FOR RECURSIVE PROGRAMSWENDT S.1980; SOFTWARE-PRACT. EXPER.; GBR; DA. 1980; VOL. 10; NO 11; PP. 935-942; BIBL. 2 REF.Article

A SYSTEM FOR PROVING EQUIVALENCES OF RECURSIVE PROGRAMSKOTT L.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 63-69; BIBL. 17 REF.Conference Paper

ON THE SPACE COMPLEXITY OF RECURSIVE ALGORITHMSGURARI EM; IBARRA OH.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 5; PP. 267-271; BIBL. 5 REF.Article

A DEDUCTIVE APPROACH TO PROGRAM SYNTHESISMANNA Z; WALDINGER R.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.1.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 542-551; BIBL. 11 REF.Conference Paper

THE OPTIMAL APPROACH TO RECURSIVE PROGRAMS.MANNA Z; SHAMIR A.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 11; PP. 824-831; BIBL. 5 REF.Article

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

COMPLETENESS WITH FINITE SYSTEMS OF INTERMEDIATE ASSERTIONS FOR RECURSIVE PROGRAM SCHEMESAPT KR; MEERTENS LGTL.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 665-671; BIBL. 8 REF.Article

METRIC INTERPRETATIONS OF INFINITE TREES AND SEMANTICS OF NON DETERMINISTIC RECURSIVE PROGRAMSARNOLD A; NIVAT M.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 2; PP. 181-205; BIBL. 17 REF.Article

AN AUTOMATIC THEOREM PROVER GENERATING A PROOF IN NATURAL LANGUAGENAKANISHI M; NAGATA M; UEDA K et al.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 2; PP. 636-638; BIBL. 5 REF.Conference Paper

LANGUAGE FACILITIES FOR PROGRAMMABLE BACKTRACKING.GRISWOLD RE; HANSON DR.1977; SIGPLAN NOT.; U.S.A.; DA. 1977; VOL. 12; NO 8; PP. 94-99; BIBL. 12 REF.; (SYMP. ARTIF. INTELL. PROGRAM. LANG. PROC.; ROCHESTER; N.Y.; 1977)Conference Paper

MINIMAL AND OPTIMAL COMPUTATIONS OF RECURSIVE PROGRAMS.BERRY G; LEVY JJ.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 225; PP. 1-13; ABS. ANGL.; BIBL. 18 REF.Serial Issue

A METHOD OF IMPLEMENTING PROCEDURE ENTRY AND EXIT IN BLOCK STRUCTURED HIGH LEVEL LANGUAGE.MORRISON R.1977; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1977; VOL. 7; NO 4; PP. 537-539; BIBL. 5 REF.Article

A NOTE ON THE NONRECURSIVE TRAVERSAL OF BINARY TREES.SOULE S.1977; COMPUTER J.; G.B.; DA. 1977; VOL. 20; NO 4; PP. 350-352; BIBL. 6 REF.Article