Category:LNCS 107

From BibNetWiki

Lecture Notes in Computer Science, Volume 107

Articles in category "LNCS 107"

There are 33 articles in this category.

A A Birkhoff-like theorem for algebraic classes of interpretations of program schemes A construction of concurrent systems by means of sequential solutions and concurrency relations A formal model of an interpreter for nonprocedural languages A proof theoretic methodology for propositional dynamic logic A proposal for operational semantics and equivalence of finite asynchronous processes A semantic algebra for binding constructs About data type genericity Algebraic denotational semantics using parameterized abstract modules An approach to communications and parallelism in applicative languages An extension to Horn clause logic allowing the definition of concurrent processes An operational semantics for a language with early completion data structures

A cont. Attribute grammars: Theory and applications B Building data base management systems through formal specification C Compiler generation from formal definition of programming languages. A survey D Distributed termination with interval assertions F FP systems in Edinburgh LCF Formal behavioural specification of concurrent systems without globality assumptions Formal representations for recursively defined functional programs Formalization of programming concepts: international colloquium, Peniscola, Spain, April 19-25, 1981: proceedings L Le calcul des fermetures dans les lambda-langages O On the algebraic extensions of abstract data types On the definition of Lambda-Calculus models On the representation of data types

P Petri nets and concurrency-like relations Proceedings of the 17th Symposium of Research Institute of Electrical Communication on Graph Theory and Algorithms R Reducing types in applicative languages with structured data Relational semantics of strongly communicating sequential processes S Scenarios: A model of non-determinate computation T The VDM principles of software specification and program design The algebra of functional programs: Function level reasoning, linear ecuations and extended definitions The algebra of functional programs: functional level reasoning linear equations and extended definitions The development of an inteipreter by means of abstract algebraic software specifications U Using last fixed points to characterize formal computations of non-deterministic equations