A birkhoff-like theorem for algebraic classes of interpretations of program schemes (English)
National licence
For calvin elgot
- New search for: Meseguer, José
- New search for: Meseguer, José
In:
Formalization of Programming Concepts
;
152-168
;
1981
- Article/Chapter (Book) / Electronic Resource
-
Title:A birkhoff-like theorem for algebraic classes of interpretations of program schemes
-
Subtitle:For calvin elgot
-
Contributors:Meseguer, José ( author )
-
Published in:Formalization of Programming Concepts ; 152-168Lecture Notes in Computer Science ; 107 ; 152-168
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1981-01-01
-
Size:17 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
The algebra of functional programs: Function level reasoning, linear equations, and extended definitionsBackus, John et al. | 1981
- 44
-
The VDM principles of software specification & program designBjørner, Dines et al. | 1981
- 75
-
Attribute grammars : Theory and applicationsCourcelle, B. et al. | 1981
- 96
-
Compiler generation from formal definition of programming languages : A surveyGaudel, M. C. et al. | 1981
- 115
-
Formal behavioural specification of concurrent systems without globality assumptionsLauer, P. E. / Shields, M. W. / Cotronis, J. Y. et al. | 1981
- 152
-
A birkhoff-like theorem for algebraic classes of interpretations of program schemesMeseguer, José et al. | 1981
- 169
-
Building data base management systems through formal specificationNeuhold, E. J. / Olnhoff, Th. et al. | 1981
- 210
-
Reducing types in applicative languages with structured dataAstesiano, E. / Costa, G. et al. | 1981
- 218
-
On the definition of lambda-calculus modelsBerry, G. et al. | 1981
- 231
-
About data type genericityBert, Didier / Soler, Roger et al. | 1981
- 244
-
On the algebraic extensions of abstract data typesBroy, Manfred / Wirsing, Martin et al. | 1981
- 252
-
Scenarios: A model of non-determinate computationBrock, J. Dean / Ackerman, William B. et al. | 1981
- 260
-
An operational semantics for a language with early completion data structuresDennis, Jack B. et al. | 1981
- 268
-
Le calcul des fermetures dans les lambda-langagesDurieux, Jean-Louis et al. | 1981
- 280
-
Distributed termination with interval assertionsFrancez, N. / Rodeh, M. / Sintzoff, M. et al. | 1981
- 292
-
Algebraic denotational semantics using parameterized abstract modulesGoguen, Joseph A. / Parsaye-Ghomi, Kamran et al. | 1981
- 310
-
Relational semantics of strongly communicating sequential processesGuerreiro, Pedro et al. | 1981
- 327
-
A construction of concurrent systems by means of sequential solutions and concurrency relationsJanicki, Ryszard et al. | 1981
- 335
-
The development of an interpreter by means of abstract algebraic software specificationsKlaeren, H. A. / Petzsch, H. et al. | 1981
- 347
-
A formal model of an interpreter for nonprocedural languagesLafuente, Juan M. et al. | 1981
- 356
-
Proof theoretic methodology for propositional dynamic logicLeivant, Daniel et al. | 1981
- 374
-
FP systems in edinburgh LCFLeszczyłowski, Jacek et al. | 1981
- 387
-
A proposal for operational semantics and equivalence of finite asynchronous processesMejia, Luis et al. | 1981
- 401
-
An extension to horn clause logic allowing the definition of concurrent processesMonteiro, Luis et al. | 1981
- 408
-
A semantic algebra for binding constructsMosses, Peter et al. | 1981
- 419
-
On the representation of data typesOrejas, F. et al. | 1981
- 432
-
An approach to communications and parallelism in applicative languagesPettorossi, Alberto et al. | 1981
- 447
-
Using least fixed points to characterize formal computations of non-deterministic equationsPoigné, Axel et al. | 1981
- 460
-
Formal representations for recursively defined functional programsWilliams, John H. et al. | 1981
- 471
-
Petri nets and concurrency-like relationsPrószyński, Piotr et al. | 1981