Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FORMAL SEMANTICS")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1810

  • Page / 73

Export

Selection :

  • and

THE EQUIVALENCE OF TWO SEMANTIC DEFINITIONS: A CASE STUDY IN LCFCOHN A.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 267-285; BIBL. 6 REF.Article

COMPLETENESS OF MANY-SORTED EQUATIONAL LOGICGOGUEN JA; MESEGUER J.1982; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 1; PP. 9-17; BIBL. 2 P.Article

DESCRIPTION AND COMPOSITION OF COMMUNICATING PROCESSES. PROBLEMS OF ANALYSIS AND CORRECTNESS = DESCRIPTION ET COMPOSITION DE PROCESSUS COMMUNICANTS. PROBLEMES D'ANALYSE ET D'EXACTITUDEJORRAND PHILIPPE.1982; ; FRA; DA. 1982; IMAG-RR/290; 24 P.; 30 CM; ABS. FRE; BIBL. 1 P.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-290]Report

DISTRIBUTED GRAPH ALGORITHM: KNOT DETECTIONMISRA J; CHANDY KM.1982; ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS; ISSN 0164-0925; USA; DA. 1982; VOL. 4; NO 4; PP. 678-686; BIBL. 4 REF.Article

NAMING SUBPROGRAMS WITH CLARITYBOOCH G.1982; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 1; PP. 18-22Article

A CONTINUOUS SEMANTICS FOR UNBOUNDED NONDETERMINISMBACK RJR.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 187-210; BIBL. 17 REF.Article

ON GENERALIZED ITERATIVE ALGEBRAIC THEORIESESIK Z.1982; COMPUT. LINGUIST. COMPUT. LANG.; ISSN 0324-2048; HUN; DA. 1982; VOL. 15; PP. 95-110; BIBL. 2 REF.Article

THE EVALUATION OF EXPRESSIONS IN ICONGRISWOLD RE.1982; ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS; ISSN 0164-0925; USA; DA. 1982; VOL. 4; NO 4; PP. 563-584; BIBL. 17 REF.Article

ON ALGORITHMIC LOGIC WITH PARTIAL OPERATIONSPETERMANN U.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 213-223; BIBL. 7 REF.Conference Paper

DATA TYPE SPECIFICATION: PARAMETERIZATION AND THE POWER OF SPECIFICATION TECHNIQUESTHATCHER JW; WAGNER EG; WRIGHT JB et al.1982; ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS; ISSN 0164-0925; USA; DA. 1982; VOL. 4; NO 4; PP. 711-732; BIBL. 26 REF.Article

ON THE COMPOSITION OF PROCESSESPRATT VR.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. 213-223; BIBL. 20 REF.Conference Paper

A WEAKER PRECONDITION FOR LOOPSBOOM HJ.1982; ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS; ISSN 0164-0925; USA; DA. 1982; VOL. 4; NO 4; PP. 668-677; BIBL. 6 REF.Article

TUTORIAL ON PROGRAMMING LANGUAGE RESEARCHROWE AL.1980; WORKSHOP ON DATA ABSTRACTION, DATABASES AND CONCEPTUAL MODELLING/1980/PINGREE PARK CO; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1980; PP. 36-39Conference Paper

PARAMETRIZED DATA TYPES DO NOT NEED HIGHLY CONSTRAINED PARAMETERSARBIB MA; MANES EG.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 2; PP. 139-158; BIBL. 15 REF.Article

AN EFFECTIVE RETRACT CALCULUSJOSKO B.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 184-194; BIBL. 6 REF.Conference Paper

LE SYSTEME LUCID: UNE INTRODUCTION TRES INFORMELLE.LOECKX J.sdIN: JOURN. ET. SCHEMAS PROGRAMME SEMANTIQUE LANG. PROGRAMMATION; MOLINES EN QUEYRAS; 1976; S.L.; DA. S.D.; PP. 1-15; BIBL. 3 REF.Conference Paper

FORMAL SEMANTICS AND ABSTRACT PROPERTIES OF STRING PATTERN OPERATIONS AND EXTENDED FORMAL LANGUAGE DESCRIPTION MECHANISMSFLECK AC; LIMAYE RS.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 166-188; BIBL. 28 REF.Article

DENOTATIONAL SEMANTICS OF PARALLEL PROGRAMMING LANGUAGESBREZANY P.1983; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1983; VOL. 19; NO 3; PP. 248-262; BIBL. 8 REF.Article

FILTRATION THEOREM FOR DYNAMIC ALGEBRAS WITH TESTS AND INVERSE OPERATORSVAKARELOV D.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 314-324; BIBL. 11 REF.Conference Paper

ON AXIOMATISATION OF PROCESS LOGICVALIEV MK.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 304-313; BIBL. 18 REF.Conference Paper

COMPLETION SEMANTICS AND INTERPRETER GENERATIONHENSON MC; TURNER R.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. 242-254; BIBL. 14 REF.Conference Paper

CURRY'S TYPE-RULES ARE COMPLETE WITH RESPECT TO THE F-SEMANTICS TOOHINDLEY R.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 127-133; BIBL. 2 REF.Article

ON RATIONAL DEFINITIONS IN COMPLETE ALGEBRAS WITHOUT RANKINDERMARK K.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 3; PP. 281-313; BIBL. 17 REF.Article

THE COMPLETNESS THEOREM FOR TYPING LAMBDA -TERMSHINDLEY R.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 1-17; BIBL. 19 REF.Article

LES RAISONS DES CHOIX DANS LA DEFINITION FORMELLE DU LANGAGE ADA = REASONS FOR CHOICES IN THE FORMAL DEFINITION OF THE ADA LANGUAGEDONZEAU GOUGE VERONIQUE.1982; ; FRA; DA. 1982; 153 P.; 1982; BIBL. 45 REF.; TH.: SCI. MATH./PARIS 7/1982Thesis

  • Page / 73