Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	April 1981
Genre:	EDV / Informatik
	Betriebssystem (EDV) / datastructure / EDV / Theorie / Software-Entw. / Software Engineering / Enzyklopädie / formaleSprache / formalspecification / Informatik / Logic / Operating System / Programmierung(EDV) / Programming / programminglanguage / Semantics mehr...
ISBN:	9783540106999
EAN-Code:	9783540106999
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D 27 mm
Gewicht:	739 gr
Seiten:	492
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

The algebra of functional programs: Function level reasoning, linear equations, and extended definitions.- The VDM principles of software specification & program design.- Attribute grammars : Theory and applications.- Compiler generation from formal definition of programming languages : A survey.- Formal behavioural specification of concurrent systems without globality assumptions.- A birkhoff-like theorem for algebraic classes of interpretations of program schemes.- Building data base management systems through formal specification.- Reducing types in applicative languages with structured data.- On the definition of lambda-calculus models.- About data type genericity.- On the algebraic extensions of abstract data types.- Scenarios: A model of non-determinate computation.- An operational semantics for a language with early completion data structures.- Le calcul des fermetures dans les lambda-langages.- Distributed termination with interval assertions.- Algebraic denotational semantics using parameterized abstract modules.- Relational semantics of strongly communicating sequential processes.- A construction of concurrent systems by means of sequential solutions and concurrency relations.- The development of an interpreter by means of abstract algebraic software specifications.- A formal model of an interpreter for nonprocedural languages.- Proof theoretic methodology for propositional dynamic logic.- FP systems in edinburgh LCF.- A proposal for operational semantics and equivalence of finite asynchronous processes.- An extension to horn clause logic allowing the definition of concurrent processes.- A semantic algebra for binding constructs.- On the representation of data types.- An approach to communications and parallelism in applicative languages.- Using least fixed points to characterize formal computations of non-deterministic equations.- Formal representations for recursively defined functional programs.- Petri nets and concurrency-like relations.