| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465624003316 |
|
|
Titolo |
ESOP '90 [[electronic resource] ] : 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings / / edited by Neil Jones |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1990.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (IX, 440 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 432 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Programming languages (Electronic computers) |
Computer logic |
Mathematical logic |
Software engineering |
Programming Techniques |
Programming Languages, Compilers, Interpreters |
Logics and Meanings of Programs |
Mathematical Logic and Formal Languages |
Software Engineering |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
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: - Program development: specification, methodology, tools, environments; - Programming language concepts: types, data abstraction, parallelism, real-time; - Language implementation techniques: compilers, interpreters, abstract machine design, optimization; - Programs as data objects: abstract interpretation, program transformation, partial evaluation; - Programming styles: imperative, functional, predicative, object-oriented. |
|
|
|
|
|
|
|
| |