ESOP 86 : European Symposium on Programming Saarbrücken, Federal Republic of Germany March 17 19, 1986 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
213 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • ESOP 86, European Symposium on Programming, Saarbrücken, Federal Republic of Germany, March 17-19, 1986, proceedings, edited by B. Robinet and R. Wilhelm, Berlin, Springer-Verlag, 1986, 1 vol. (374 p.), Lecture notes in computer science, 0-387-16442-1 • ESOP 86, Texte imprimé, 9783662164037 |
Obsah:
- Compiler generation from relational semantics
- Correctness of code generation from a two-level meta-language
- A general approach to the optimization of function calls
- Lifetime analysis for procedure parameters
- Another implementation technique for applicative languages
- Graal : A Functional Programming system with uncurryfied combinators and its reduction machine
- A safe approach to parallel combinator reduction (extended abstract)
- Reducing recursion to iteration by algebraic extension
- Design and implementation of a generic, logic and functional programming language
- Pragmatic aspects of two-level denotational meta-languages
- An experiment in practical semantics
- The choice of programming primitives for SETL-like programming languages
- Algebraic semantics of exception handling
- Data refinement refined resume
- Proving entailment between conceptual state specifications
- Automatic parallelization of fortran programs in the presence of procedure calls
- Parallelization by semantic detection of reductions
- Denotational semantics of nets with nondeterminism
- specification of a tool for viewing program text
- A classical implementation for Prolog-II
- Programs as collections of communicating Prolog units
- An and-parallel execution model of logic programs
- Compiling Extended Concurrent Prolog -single queue compilation-
- A very intelligent backtracking method for Logic Programs
- An application of abstract interpretation of logic programs: Occur check reduction
- Experiences with the RAP system a specification interpreter combining term rewriting and resolution
- Rewriting with a nondeterministic choice operator : From algebra to proofs.