Programming Languages and Systems - ESOP '96: 6th European Symposium on Programming, Linköping, Sweden, April, 22 - 24, 1996. Proceedings: Lecture Notes in Computer Science, cartea 1058
Editat de Hanne R. Nielsonen Limba Engleză Paperback – 3 apr 1996
The 23 revised full papers included were selected from a total of 63 submissions; also included are invited papers by Cliff B. Jones and by Simon L. Peyton Jones. The book is devoted to fundamental issues in the specification, analysis, and implementation of programming languages and systems; the emphasis is on research issues bridging the gap between theory and practice. Among the topics addressed are software specification and verification, programming paradigms, program semantics, advanced type systems, program analysis, program transformation, and implementation techniques.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 325.94 lei
Preț vechi: 407.42 lei
-20% Nou
Puncte Express: 489
Preț estimativ în valută:
62.38€ • 65.81$ • 51.99£
62.38€ • 65.81$ • 51.99£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540610557
ISBN-10: 3540610553
Pagini: 424
Ilustrații: X, 410 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540610553
Pagini: 424
Ilustrații: X, 410 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Some practical problems and their influence on semantics.- Compiling Haskell by program transformation: A report from the trenches.- Narrowing-driven partial evaluation of functional logic programs.- A multiple-valued logical semantics for Prolog.- Removing value encoding using alternative values in partial evaluation of strongly-typed languages.- A complete transformational toolkit for compilers.- Global analysis of standard Prolog programs.- Static detection of pointer errors: An axiomatisation and a checking algorithm.- Compositional optimization of disjunctive abstract interpretations.- A rewriting logic for declarative programming.- Durations for truly-concurrent transitions.- Flow analysis in the Geometry of Interaction.- Parametricity and unboxing with unpointed types.- Modular denotational semantics for compiler construction.- Compositional semantics of non-deterministic synchronous languages.- Checking system properties via integer programming.- Efficient minimization up to location equivalence.- A new approach to compiling adaptive programs.- Mode and termination checking for higher-order logic programs.- Linear time hierarchies for a functional language machine model.- Integer constraints to stop deforestation.- Towards an ML-style polymorphic type system for C.- Assumption/commitment rules for dataflow networks — with an emphasis on completeness.- Towards an expressive language for PDE solvers.- Rewrite systems with abstraction and ?-rule: Types, approximants and normalization.