Programming Languages and Systems - ESOP '94
Editat de Donald Sannellaen Limba Engleză Paperback – 23 mar 1994
Preț: 334.04 lei
Preț vechi: 417.55 lei
-20%
Puncte Express: 501
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 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: 9783540578802
ISBN-10: 3540578803
Pagini: 532
Ilustrații: IX, 523 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.8 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540578803
Pagini: 532
Ilustrații: IX, 523 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.8 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A theory of primitive objects.- Pi-nets: A graphical form of ?-calculus.- Local type reconstruction by means of symbolic fixed point iteration.- An asynchronous process algebra with multiple clocks.- Foundational issues in implementing constraint logic programming systems.- Programming with behaviors in an ML framework — The syntax and semantics of LCS.- Characterizing behavioural semantics and abstractor semantics.- Extending pruning techniques to polymorphic second order ?-calculus.- ?-definition of function(al)s by normal forms.- Simulation of SOS definitions with term rewriting systems.- Strategies in modular system design by interface rewriting.- Symbolic model checking and constraint logic programming: A cross-fertilization.- A logical denotational semantics for constraint logic programming.- Compilation of head and strong reduction.- Suffix trees in the functioned programming paradigm.- Type classes in Haskell.- Lazy type inference for the strictness analysis of lists.- Lazy unification with simplification.- Polymorphic binding-time analysis.- Shapely types and shape polymorphism.- Bottom-up grammar analysis — A functional formulation.- First-class polymorphism for ML.- Dimension types.- A synergistic analysis for sharing and groundness which traces linearity.- A ?-calculus specification of prolog.- A logical framework for evolution of specifications.- A semantics for higher-order functors.- The PCKS-machine: An abstract machine for sound evaluation of parallel functional programs with first-class continuations.- A tiny constraint functional logic language and its continuation semantics.- Fully abstract translations and parametric polymorphism.- Broadcasting with priority.- Towards unifying partial evaluation, deforestation, supercompilation, and GPC.-Algebraic proofs of properties of objects.