Cantitate/Preț
Produs

Functional Programming, Glasgow 1990: Proceedings of the 1990 Glasgow Workshop on Functional Programming 13–15 August 1990, Ullapool, Scotland: Workshops in Computing

Editat de Simon L. Peyton Jones, Graham Hutton, Carsten Kehler Holst
en Limba Engleză Paperback – 30 apr 1991

Din seria Workshops in Computing

Preț: 32181 lei

Preț vechi: 40226 lei
-20%

Puncte Express: 483

Carte tipărită la comandă

Livrare economică 27 iulie-10 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9783540196679
ISBN-10: 3540196676
Pagini: 296
Ilustrații: VIII, 287 p. 3 illus.
Greutate: 0.48 kg
Ediția:1st Edition.
Editura: SPRINGER LONDON
Colecția Springer
Seria Workshops in Computing

Locul publicării:London, United Kingdom

Public țintă

Research

Cuprins

Lifetime Analysis.- Compiling Laziness by Partial Evaluation.- Strictness Analysis in 4D.- An Algorithmic and Semantic Approach to Debugging.- Abstract Interpretation of Term Graph Rewriting Systems.- Compile-Time Garbage Collection by Necessity Analysis.- Improving Full Laziness.- Towards Binding-Time Improvement for Free.- Towards Relating Forwards and Backwards Analyses.- PERs Generalise Projections for Strictness Analysis.- Functional Programming with Relations.- Abstract Interpretation vs. Type Inference: A Topological Perspective.- Analysing Heap Contents in a Graph Reduction Intermediate Language.- Is Compile Time Garbage Collection Worth the Effort?.- Generating a Pattern Matching Compiler by Partial Evaluation.- An Experiment using Term Rewriting Techniques for Concurrency.- Type Refinement in Ruby.- Normal-Order Reduction Using Scan Primitives.- Calculating Lenient Programs’ Performance.- Problems and Proposals for Time and Space Profiling of Functional Programs.- Solid Modelling in HASKELL.- Differentiating Strictness.- Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts.- Concurrent Data Manipulation in a Pure Functional Language.