Titlebook: Implementation of Functional Languages; 10th International W Kevin Hammond,Tony Davie,Chris Clack Conference proceedings 1999 Springer-Verl

浮標(biāo)

書目名稱Implementation of Functional Languages影響因子(影響力)




書目名稱Implementation of Functional Languages影響因子(影響力)學(xué)科排名




書目名稱Implementation of Functional Languages網(wǎng)絡(luò)公開度




書目名稱Implementation of Functional Languages網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Implementation of Functional Languages被引頻次




書目名稱Implementation of Functional Languages被引頻次學(xué)科排名




書目名稱Implementation of Functional Languages年度引用




書目名稱Implementation of Functional Languages年度引用學(xué)科排名




書目名稱Implementation of Functional Languages讀者反饋




書目名稱Implementation of Functional Languages讀者反饋學(xué)科排名

NOTCH

extinguish

MAIZE

流動(dòng)性

Concurrent Monadic Interfacing,f concurrency. Its main innovation is to allow actions on state components. This is a key issue which enables ., a technique which assigns to each new thread a part of the state, a ., to act upon. Distinct concurrent threads are restricted to access disjoint substates. A purely functional prototype

CHIP

A Strategic Profiler for Glasgow Parallel Haskell,ntation, and use of a new execution time profiler (.-SP) for Glasgow Parallel Haskell (.). Parallelism is introduced in . by using .s, which provide a clean way of co-ordinating parallel threads without destroying a program’s original structure. The new profiler attributes the cost of evaluating par

表狀態(tài)

,Implementing Eden — or: Dreams Become Reality,ted an operational specification of DREAM, the distributed abstract machine for Eden. In this paper we go a step further and present the imperative code generated for Eden expressions and how this code interacts with the distributed RunTime System (RTS) for Eden. This translation is done in two step

者變

Efficient Combinator Parsers,lynomial complexity and are far too slow for realistic inputs. We show how the speed of these parsers can be improved by one order of magnitude using continuations. These continuations prevents the creation of intermediate data structures. Furthermore, by using an exclusive or-combinator instead of

PATRI

CHECK