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 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

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

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

AN ENVIRONMENT FOR MULTIPLE-VALUED RECURSIVE PROCEDURES.FRIEDMAN DP; WISE DS.1977; IN: PROGRAMMATION. INT. SYMP. PROGRAM. 2. PROC.; PARIS; 1976; PARIS; DUNOD; DA. 1977; PP. 182-200; BIBL. 1 P. 1/2Conference Paper

IF-THEN-ELSE A CONCURRENCY INHIBITOR IN EAGER BEAVER EVALUATION OF RECURSIVE PROGRAMSPAGE RL; CONANT MG; GRIT DH et al.1981; CONFERENCE ON FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE/1981/PORTSMOUTH NH; USA; NEW YORK: ACM; DA. 1981; PP. 179-186; BIBL. 20 REF.Conference Paper

A POOR MAN'S REALIZATION OF RECURSIVE STRUCTURED FORTRANSASSA M.1981; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1981; VOL. 16; NO 5; PP. 43-53; BIBL. 6 REF.Article

ASSEMBLERPROGRAMMIERUNG REKURSIVER PROZEDUREN FUER MIKRORECHNER = PROGRAMMATION EN ASSEMBLEUR DE PROCEDURES RECURSIVES POUR DES MICROORDINATEURSMETTLER R.1980; NOUV. TECH.; CHE; DA. 1980; VOL. 22; NO 3; PP. 29-33Article

A FAMILY OF RULES FOR RECURSION REMOVAL.PARTSCH H; PEPPER P.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 6; PP. 174-177; BIBL. 5 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