Functional programming languages and computer architecture : 5th ACM conference, Cambridge, MA, USA, August 26-30, 1991 : proceedings
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...
Enregistré dans:
| 企業作者: | |
|---|---|
| 其他作者: | |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
523 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Functional programming languages and computer architecture, 5th ACM conference, Cambridge, MA, USA, August 26-30, 1991, proceedings, J. Hughes, ed, Berlin, Springer-Verlag, 1991, 1 vol. (VIII-666 p.), Lecture notes in computer science, 3-540-54396-1 • Functional Programming Languages and Computer Architecture, Texte imprimé, 9783662187067 |
書本目錄:
- 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.