INITIAL AND FINAL ALGEBRA SEMANTICS FOR DATA TYPE SPECIFICATIONS: TWO CHARACTERIZATION THEOREMSBERGSTRA JA; TUCKER JV.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 366-387; BIBL. 26 REF.Article

TREE CONSTRUCTIONS OF FREE CONTINUOUS ALGEBRASADAMEK J; NELSON E; REITERMAN J et al.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 114-146; BIBL. 29 REF.Article

SOME OBSERVATIONS ON COMPOSITIONAL SEMANTICSJANSSEN TMV; VAN EMDEBOAS P.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 137-149; BIBL. 25 REF.Conference Paper

ALGEBRAIC SEMANTICS AND PROGRAM LOGICS: ALGORITHMIC LOGIC FOR PROGRAM TREESENJALBERT P.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 132-147; BIBL. 17 REF.Conference Paper

FIXED-POINT SEMANTICS FOR ALGEBRAIC (TREE) GRAMMARSNIWINSKI D.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 384-396; BIBL. 5 REF.Conference Paper

PARTIAL ABSTRACT TYPESBROY M; WIRSING M.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 1; PP. 47-64; BIBL. 41 REF.Article

A HOMORPHISM THEOREM FOR DATA BASE MAPPINGSSPYRATOS M.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 3; PP. 91-96; BIBL. 8 REF.Article

ACCESSIBILITY OF VALUES AS A DETERMINANT OF RELATIVE COMPLEXITY IN ALGEBRASLYNCH NA.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 101-113; BIBL. 5 REF.Article

APPROXIMATION OF INFINITARY OBJECTSCOMYN G; DAUCHET M.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 116-127; BIBL. 19 REF.Conference Paper

THE REPRESENTATION THEOREM FOR ALGORITHMIC ALGEBRASMIRKOWSKA G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 300-310; BIBL. 10 REF.Conference Paper

PARAMETER PASSING COMMUTES WITH IMPLEMENTATION OF PARAMETERIZED DATA TYPESEHRIG H; KREOWSKI HJ.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 197-211; BIBL. 2 P.Conference Paper

REFINEMENTS OF GENERIC SPECIFICIATIONS WITH ALGEBRAIC TOOLS = RAFFINEMENTS DE SPECIFICATIONS GENERIQUES AU MOYEN D'OUTILS ALGEBRIQUESBERT DIDIER.1982; ; FRA; GRENOBLE: I.M.A.G.; DA. 1982; IMAG/RR-335; 20 P.; 30 CM; ABS. FRE; BIBL. 13 REF.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-335]Report

THE SRDL SPECIFICATION EXPERIMENTKLAEREN HA.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 134; PP. 282-293; BIBL. 4 REF.Conference Paper

ALGEBRAIC SEMANTICS OF RECURSIVE FLOWCHART SCHEMESSCHMECK H.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 489-501; BIBL. 2 P.Conference Paper

AN ALGEBRAIC DESCRIPTION OF SYSTEM BEHAVIOURSWINKOWSKI J.1982; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 3; PP. 315-340; BIBL. 11 REF.Article

BASES FOR CHAIN-COMPLETE POSETS.MARKOWSKY G; ROSEN BK.1976; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1976; VOL. 20; NO 2; PP. 138-147; BIBL. 19 REF.Article

CONTINUOUS DATA TYPESLEVY MR; MAIBAUM TSE.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 201-216; BIBL. 17 REF.Article

UNE SEMANTIQUE ALGEBRIQUE DE PASCAL ET APPLICATION A LA SPECIFICATION D'UN COMPILATEUR PASCAL-P-CODE = A PASCAL ALGEBRAIC SEMANTICS AND ITS APPLICATION TO THE SPECIFICATION OF PASCAL P-CODE COMPILERDESPEYROUX SAVONITTO JOELLE.1982; ; FRA; 78150-LE CHESNAY: IMPR. INST. NATL. RECH. INFORM. AUTOM.; DA. 1982; 321 P.; 30 CM; BIBL. 5 P.; ISBN 2-7261-0309-X; TH. 3E CYCLE: INFORM./PARIS 11/1982Thesis

INDUCTIVE DOMAINS AND ALGEBRAIC SEMANTICS OF CF LANGUAGECOMER SD.1982; COMPUT. LINGUIST. COMPUT. LANG.; ISSN 0324-2048; HUN; DA. 1982; VOL. 15; PP. 43-43; BIBL. 3 REF.Article

RECURSIVE DEFINITIONS OF OPERATIONS IN UNIVERSAL ALGEBRASKLAEREN HA.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 134; PP. 268-281; BIBL. 6 REF.Conference Paper

A SIMPLE TRANSFER LEMMA FOR ALGEBRAIC SPECIFICATIONSBERGSTRA JA; MEYER JJC.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 2; PP. 80-85; BIBL. 6 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

INITIAL AND TERMINAL ALGEBRA SEMANTICS OF PARAMETERIZED ABSTRACT DATA TYPE SPECIFICATIONS WITH INEQUALITIESHORNUNG G; RAULEFS P.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 224-237; BIBL. 15 REF.Conference Paper

SYSTEMES DE DEDUCTION POUR LES ARBRES ET LES SCHEMAS DE PROGRAMMES. IENJALBERT P.1980; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1980; VOL. 14; NO 3; PP. 247-278; ABS. ENG; BIBL. 26 REF.Article

Ntyft/ntyxt rules reduce to Ntree rulesFOKKINK, W; VAN GLABBEEK, R.Information and computation (Print). 1996, Vol 126, Num 1, pp 1-10, issn 0890-5401Article