ESOP '90 : 3rd European Symposium on Programming Copenhagen, Denmark, May 15 18, 1990 : proceedings
This volume presents the proceedings of a conference on programming and programming languages. It contains original research contributions addressing fundamental issues and important developments in the design, specification and implementation of programming languages and systems. Topics include: -...
保存先:
| 共著者: | , |
|---|---|
| その他の著者: | |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
432 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
held jointly with the Fifteenth CAAP Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • ESOP '90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, proceedings, Berlin, Springer-Verlag, 1990, 1 vol. (IX-435 p.), Lecture notes in computer science, 0-387-52592-0 • ESOP '90, Texte imprimé, 9783662215104 |
目次:
- Types in lambda calculi and programming languages
- Symbolic finite differencing - Part I
- Implementation of an interpreter for a parallel language in centaur
- Automatic autoprojection of higher order recursive equations
- From interpreting to compiling binding times
- Implementing finite-domain constraint logic programming on top of a PROLOG-system with delay-mechanism
- Type inference for action semantics
- On the expressive power of programming languages
- Higher order escape analysis: Optimizing stack allocation in functional program implementations
- Development of concurrent systems by incremental transformation
- Set domains
- Resolution and Type Theory
- A syntactic theory of transparent parameterization
- A backwards analysis for compile-time garbage collection
- Techniques for improving grammar Flow Analysis
- The specificity rule for lazy pattern-matching in ambiguous term rewrite systems
- Graph-based implementation of a functional logic language
- Eureka definitions for free! or Disagreement points for fold/unfold transformations
- Synthesis of eureka predicates for developing logic programs
- Algebraic properties of program integration
- Arity raiser and its use in program specialization
- Complexity analysis for a lazy higher-order language
- On the weak adequacy of branching-time temporal logic
- The value flow graph: A program representation for optimal program transformations
- Type inference and implicit scaling
- Towards the theory of programming in constructive logic.