000 | 03074nam a22004335i 4500 | ||
---|---|---|---|
001 | 978-3-540-39677-2 | ||
003 | DE-He213 | ||
005 | 20160624101944.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1985 gw | s |||| 0|eng d | ||
020 |
_a9783540396772 _9978-3-540-39677-2 |
||
024 | 7 |
_a10.1007/3-540-15975-4 _2doi |
|
050 | 4 | _aTK7895.M5 | |
072 | 7 |
_aUYF _2bicssc |
|
072 | 7 |
_aCOM011000 _2bisacsh |
|
082 | 0 | 4 |
_a004.1 _223 |
245 | 1 | 0 |
_aFunctional Programming Languages and Computer Architecture _h[electronic resource] : _bNancy, France, September 16–19, 1985 / _cedited by Jean-Pierre Jouannaud. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
300 |
_aVIII, 416 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v201 |
|
505 | 0 | _aMiranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis — a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb — A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher order functions -- $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator. | |
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aProcessor Architectures. |
700 | 1 |
_aJouannaud, Jean-Pierre. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540159759 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v201 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-15975-4 |
942 |
_2EBK4687 _cEBK |
||
999 |
_c33981 _d33981 |