Formalization of programming concepts : international colloquium, Peniscola, Spain, April 19-25, 1981 : proceedings
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | , |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
107 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Formalization of programming concepts, international colloquium, Peniscola, Spain, April 19-25, 1981, proceedings, edited by J. Díaz and I. Ramos, Berlin, Springer-Verlag, 1981, 1 vol. (VII-478 p.), Lecture notes in computer science, 0-387-10699-5 • Formalization of Programming Concepts, Texte imprimé, 9783662195109 |
Inhoudsopgave:
- 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.