fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf

Site Breadcrumb

Verkauf durch Sack Fachmedien

Hughes

Functional Programming Languages and Computer Architecture

5th ACM Conference. Cambridge, MA, USA, August 26-30, 1991 Proceedings

Medium: Buch
ISBN: 978-3-540-54396-1
Verlag: Springer Berlin Heidelberg
Erscheinungstermin: 07.08.1991
In den Warenkorb
Lieferfrist: bis zu 10 Tage
Auf die Merkliste Drucken
Leseprobe
Überschrift

Beschreibung

Kostenloser Versand

nach Deutschland, Österreich und in die Schweiz

Bequem zahlen

Rechnung, Kreditkarte, PayPal oder Bankeinzug

Wir sind gerne für Sie da

0800 000-1378 (Inland)
service@fachmedien.de
<<Kontaktformular>>

Fragen

Fragen Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua
Anwtorten

Anwtorten At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet

This book offers a comprehensive view of the best and the
latest work in functional programming. It is the proceedings
of a major international conference and contains 30 papers
selected from 126 submitted. A number of themes emerge. One
is a growing interest in types: powerful type systems or
type checkers supporting overloading, coercion, dynamic
types, and incremental inference; linear types to optimize
storage, and polymorphic types to optimize semantic
analysis. The hot topic of partial evaluation is well
represented: techniques for higher-order binding-time
analysis, assuring termination of partial evaluation, and
improving the residual programs a partial evaluator
generates. The thorny problem of manipulating state in
functional languages is addressed: one paper even argues
that parallel programs with side-effects can be "more
declarative" than purely functional ones. Theoretical work
covers a new model of types based on projections,
parametricity, a connection between strictness analysis and
logic, and a discussion of efficient implementations of the
lambda-calculus. The connection with computer architecture
and a variety of other topics are also addressed.

Produkteigenschaften

  • Artikelnummer: 9783540543961
  • Medium: Buch
  • ISBN: 978-3-540-54396-1
  • Verlag: Springer Berlin Heidelberg
  • Erscheinungstermin: 07.08.1991
  • Sprache(n): Englisch
  • Auflage: 1991
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert
  • Gewicht: 1013 g
  • Seiten: 672
  • Format (B x H x T): 155 x 235 x 37 mm
  • Ausgabetyp: Kein, Unbekannt

Themen

Autoren/Hrsg.

Herausgeber

Type classes and overloading resolution via order-sorted unification.- On the complexity of ML typability with overloading.- Coercive type isomorphism.- Compiler-controlled multithreading for lenient parallel languages.- Multi-thread code generation for dataflow architectures from non-strict programs.- GAML: A parallel implementation of lazy ML.- Functional programming with bananas, lenses, envelopes and barbed wire.- A strongly-typed self-applicable partial evaluator.- Automatic online partial evaluation.- Assignments for applicative languages.- Linearity and laziness.- Syntactic detection of single-threading using continuations.- A projection model of types.- What is an efficient implementation of the ?-calculus?.- Outline of a proof theory of parametricity.- Reasoning about simple and exhaustive demand in higher-order lazy languages.- Strictness analysis in logical form.- A note on abstract interpretation of polymorphic functions.- Incremental polymorphism.- Dynamics in ML.- Implementing regular tree expressions.- Efficient type inference for higher-order binding-time analysis.- Finiteness analysis.- For a better support of static data flow.- An architectural technique for cache-level garbage collection.- M-structures: Extending a parallel, non-strict, functional language with state.- List comprehensions in agna, a parallel persistent object system.- Generating efficient code for lazy functional languages.- Making abstract machines less abstract.- Unboxed values as first class citizens in a non-strict functional language.