ALTERNATIVE FORMS OF PROPOSITIONAL CALCULUS FOR A GIVEN DEDUCTION THEOREMBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 613-619; BIBL. 6 REF.Article

QUELQUES ALGORITHMES DE PERMUTATIONS.VIENNOT G.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 275-293; BIBL. 1 P. 1/2; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

COMBINATIONAL NETWORK DESIGN FOR PNEUMATIC MPL CIRCUITS I. BASIC ELEMENTSPARRISH J.1983; HYDRAULICS AND PNEUMATICS; ISSN 0018-814X; USA; DA. 1983; VOL. 36; NO 2; PP. 44-48; 4 P.; BIBL. 1 REF.Article

SOME PHILOSOPHICAL ASPECTS OF COMBINATORY LOGICCURRY HB.1980; STUD. LOGIC FOUND. MATH.; NLD; DA. 1980; VOL. 101; PP. 85-101; BIBL. 3 P.Conference Paper

A CONSTRUCTIVE GENERALIZATION OF THE BOREL-CANTELLI LEMMA WITH APPLICATION TO THE COMPLEXITY OF INFINITE STRINGSDE MILLO RA; LIPTON RJ.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 2; PP. 95-104; BIBL. 7 REF.Article

CHARACTERIZATION OF NORMAL FORMS POSSESSING INVERSE IN THE LAMBDA -BETA -ETA -CALCULUS.DEZANI CIANCAGLINI M.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 3; PP. 323-337; BIBL. 3 REF.Article

REDUCIBILITIES IN TWO MODELS FOR COMBINATORY LOGICSANCHIS LE.1979; J. SYMBOL. LOGIC; USA; DA. 1979; VOL. 44; NO 2; PP. 221-234; BIBL. 13 REF.Article

A CONSISTENT COMBINATORY LOGIC WITH AN INVERSE TO EQUALITYFITCH FB.1980; J. SYMB. LOGIC; ISSN 0022-4812; USA; DA. 1980; VOL. 45; NO 3; PP. 529-543; BIBL. 16 REF.Article

LAMBDA -ELIMINATION IN ILLATIVE COMBINATORY LOGICBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 628-630; BIBL. 4 REF.Article

LOGIQUE COMBINATOIRE.LAGASSE J; COURVOISIER M; RICHARD JP et al.1976; PARIS; DUNOD; DA. 1976; PP. (80P.); BIBL. 6 REF.; ISBN 2040001476; 3EME ED. (DUNOD UNIV.)Book

PROBABILISTIC APPROACH TO MULTIPLEXER LOGIC CIRCUIT DESIGNEKTARE AB; MITAL DP.1980; ELECTRON. LETTERS; GBR; DA. 1980; VOL. 16; NO 18; PP. 686-687; BIBL. 7 REF.Article

SIGNIFICANCE AND ILLATIVE COMBINATORY LOGICSBUNDER RW.1980; NOTRE DAME J. FORM. LOGIC; USA; DA. 1980; VOL. 21; NO 2; PP. 380-384; BIBL. 7 REF.Article

ON THE EQUIVALENCE OF SYSTEMS OF RULES AND SYSTEMS OF AXIOMS IN ILLATIVE COMBINATORY LOGICBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 603-608; BIBL. 9 REF.Article

TYPES ET FONCTIONNALITEROBINET B.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 303-325; BIBL. 3 P.Conference Paper

SUR QUELQUES EQUIVALENCES DE MACCARTHYGEORGIEVA NV.1979; C.R. ACAD. BULG. SCI.; BGR; DA. 1979; VOL. 32; NO 6; PP. 721-724; BIBL. 2 REF.Article

A GLOBAL REPRESENTATION OF THE RECURSIVE FUNCTIONS IN THE LAMBDA -CALCULUS.BARENDREGT H.1977; THEOR. COMPUT. SCI.; NETHERL.; DA. 1977; VOL. 3; NO 2; PP. 225-242; BIBL. 16 REF.Article

AN ALGEBRAIC INTERPRETATION OF THE LAMBDA BETA K-CALCULUS: AND AN APPLICATION OF A LABELLED LAMBDA -CALCULUS.LEVY JJ.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 1; PP. 97-114; BIBL. 17 REF.Article

CHURCH-ROSSER STRATEGIES IN THE LAMBDA CALCULUSBERGSTRA J; KLOP JW.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 27-38; BIBL. 3 REF.Article

THE DISCRIMINATION THEOREM HOLDS FOR COMBINATORY WEAK REDUCTIONHINDLEY R.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 3; PP. 393-394; BIBL. 2 REF.Article

AN INTUITIONISTIC COMBINATORY THEORY NOT CLOSED UNDER THE RULE OF CHOICE.BEL M.1977; PROC. KKL. NEDERL. AKAD. WETENSCH., A; NETHERL.; DA. 1977; VOL. 39; NO 2; PP. 69-72; BIBL. 7 REF.Article

LOGIQUE SEQUENTIELLE.LAGASSE J; COURVOISIER M; RICHARD JP et al.1976; PARIS; DUNOD; DA. 1976; PP. 88 P.; BIBL. 12 REF.; ISBN 2040001492; 3EME ED. (DUNOD UNIV.)Book

SCOTT'S MODELS AND ILLATIVE COMBINATORY LOGICBUNDER MW.1979; NOTRE DAME J. FORM. LOGIC; USA; DA. 1979; VOL. 20; NO 3; PP. 609-612; BIBL. 10 REF.Article

INTERNAL FRAGMENTATION IN A CLAN OF BUDDY SYSTEMS.RUSSELL DL.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 607-621; BIBL. 11 REF.Article

LOWER BOUNDS FOR THE SIZE OF EXPRESSIONS FOR CERTAIN FUNCTIONS IN D-ARY LOGIC.VILFAN B.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 2; PP. 249-269; BIBL. 17 REF.Article

A THEORY OF COMPUTATION WITH AND IDENTITY DISCRIMINATOR.LONGO G; VENTURINI ZIPLI M.1976; IN: AUTOM. LONG. PROGRAM. INT. COLLOQ.3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 147-167; BIBL. 1 P.Conference Paper