SOME APPLICATIONS OF TOPOLOGY TO PROGRAM SEMANTICSROHIT PARIKH.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 2; PP. 111-131; BIBL. 19 REF.Article

THE SATISFIABILITY PROBLEMS FOR SOME CLASSES OF EXTENDED HORN SETS IN THE PROPOSITIONAL LOGICYAMASAKI S; DOSHITA S.1982; TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS AND COMMUNICATION ENGINEERS OF JAPAN. SECTION E; ISSN 0387-236X; JPN; DA. 1982; VOL. 65; NO 7; PP. 390-396; BIBL. 9 REF.Article

A CRITIQUE OF THE FOUNDATIONS OF HOARE-STYLE PROGRAMMING LOGICSO'DONNELL MJ.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 349-374; BIBL. 22 REF.Conference Paper

NONSTANDARD DYNAMIC LOGICNEMETI I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 311-348; BIBL. 23 REF.Conference Paper

IN-SCOTT-STARCHY STYLE DENOTATIONAL SEMANTICS, PARALLELISM IMPLIES NONDETERMINISMBENSON DB.1982; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 3; PP. 265-275; BIBL. 16 REF.Article

SOME APPLICATIONS OF TOPOLOGY TO PROGRAM SEMANTICSPARIKH R.1981; LECT NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 375-386; BIBL. 10 REF.Conference Paper

RELATIONAL SEMANTICS OF STRONGLY COMMUNICATING SEQUENTIAL PROCESSESGUERREIRO P.1980; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1980; NO 200; 19 P.; ABS. FRE; BIBL. 2 P.Serial Issue

COMPACTNESS IN MODELS OF PROPOSITIONAL DYNAMIC LOGICBERMAN F.1982; COMPUT. LINGUIST. COMPUT. LANG.; ISSN 0324-2048; HUN; DA. 1982; VOL. 15; PP. 7-19; BIBL. 6 REF.Article

LOCALITY IN MODULAR SYSTEMSBACK RJR; MANNILA H.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 1-13; BIBL. 7 REF.Conference Paper

PROGRAMMING LANGUAGES AND LOGICS OF PROGRAMSRADEV SR.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 253-257; BIBL. 9 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

CONTRIBUTIONS TO THE THEORY OF LOGIC PROGRAMMINGAPT KR; VAN EMDEN MH.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 3; PP. 841-862; BIBL. 19 REF.Article

PREUVE DE PROGRAMMES DANS UN LANGAGE SANS ASSIGNATION - LUCID = PROOF OF PROGRAMS IN A NON-ASSIGNED LANGUAGE - LUCIDRICHIER JEAN LUC.1982; ; FRA; DA. 1982; 96 P.-PL.; 30 CM; BIBL. 2 P.; TH. 3E CYCLE: SCI./PARIS 6/1982/82-30Thesis

A LOGIC FOR EXPRESSIONS WITH SIDE-EFFECTSBOEHM HJ.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. 268-280; BIBL. 10 REF.Conference Paper

ANOTHER CHARACTERIZATION OF WEAKEST PRECONDITIONSGUERREIRO P.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 164-177; BIBL. 10 REF.Conference Paper

CRITICAL REMARKS ON MASE MODEL OF CONCURRENCYSALWICKI A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 397-405; BIBL. 20 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

A COOK'S TOUR COUNTABLE NONDETERMINISMAPT KR; PLOTKIN GD.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 479-494; BIBL. 17 REF.Conference Paper

PROPOSITIONAL LOGICS OF PROGRAMS: SYSTEMS, MODELS, AND COMPLEXITYROHIT PARIKH.1980; ANNUAL SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 7/1980/LAS VEGAS NV; USA; NEW YORK: ACM; DA. 1980; PP. 186-192; BIBL. 12 REF.Conference Paper

ON EFFECTIVE COMPUTATIONS OF NON-DETERMINISTIC SCHEMESPOIGNE A.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 313-336; BIBL. 16 REF.Conference Paper

A REDUCTION SPECIFICATION FOR DTLHUGHES JW; POWELL MS.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 134; PP. 255-267; BIBL. 8 REF.Conference Paper

CIRCULAR EXPRESSIONS: ELIMINATION OF STATIC ENVIRONMENTSSETHI R.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 378-392; BIBL. 2 P.Conference Paper

SYSTEMATIC DETECTION OF EXCEPTION OCCURRENCESBEST E; CRISTIAN F.1981; SCI. COMPUT. PROGRAM.; NLD; DA. 1981; VOL. 1; NO 1-2; PP. 115-144; BIBL. 14 REF.Article

L'EXISTENCE D'ESPACES INFORMATIQUESLE BERRE F; NOLIN L.1981; C.R. SEANCES ACAD. SCI., SER. 1; FRA; DA. 1981; VOL. 292; NO 9; PP. 499-502; ABS. ENG; BIBL. 5 REF.Article

ALGEBRAICALLY SPECIFIED PROGRAMMING SYSTEMS AND HOARE'S LOGICBERGSTRA JA; TUCKER JV.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 348-362; BIBL. 30 REF.Conference Paper