Filters








267 Hits in 3.2 sec

A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language [chapter]

Kazunori Ueda
2002 Lecture Notes in Computer Science  
This paper discusses the construction of a meta-interpreter of Flat GHC, one of the simplest and earliest concurrent constraint languages.  ...  It also describes how the interpreter, given the treecode of a program, is partially evaluated to the original program by the unfold/fold transformation system for Flat GHC.  ...  Acknowledgment Comments from anonymous referees were useful in improving the presentation of the paper.  ... 
doi:10.1007/3-540-45628-7_7 fatcat:l6catykusrdt3k6uxhac46uhpa

Visual haskell

Krasimir Angelov, Simon Marlow
2005 Proceedings of the 2005 ACM SIGPLAN workshop on Haskell - Haskell '05  
Visual Haskell has driven developments in other Haskell-related projects: Cabal, the Concurrent FFI extension, and an API to allow programmatic access to GHC itself.  ...  Visual Haskell supports the full GHC language, and can be used to develop real Haskell applications (including the code of the plugin itself).  ...  We would like to thank the Cabal designers and developers: Isaac Jones, Ross Paterson, Simon Peyton Jones, and Malcolm Wallace, for accommodating the requirements of Visual Haskell in their design.  ... 
doi:10.1145/1088348.1088350 dblp:conf/haskell/AngelovM05 fatcat:begwahhmfze3dexabhbtoj6fum

Priming the Pipeline: Addressing Gender-Based Barriers in Computing

Telle Whitney, Denise Gammal, Barbara Gee, Jody Mahoney, Caroline Simard
2013 Computer  
for matrix multiplication.  ...  , managers, and organization leaders can implement to bring about change in the workplace.  ... 
doi:10.1109/mc.2013.40 fatcat:kp7pcdugcjcezdxuzs5hb4hf34

Page 7314 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
Taki, A distributed imple- mentation of flat GHC on the multi-PSI (pp. 257-275); Takashi Chikayama and Yasunori Kimura, Multiple reference manage- ment in flat GHC (pp. 276-293); Melissa Lam and Steve  ...  90m:68006 68 Katz and Shlomo Moran, Impossibility results in the presence of multiple faulty processes (preliminary version) (pp. 109-120); F. Bonomi, P. J. Fleming [Philip Joseph Fleming] and P.  ... 

High temperature and pressure electrochemical test station

C. Chatzichristodoulou, F. Allebrod, M. Mogensen
2013 Review of Scientific Instruments  
Koch in the construction of the high temperature and pressure electrochemical test station. We also wish to thank Dr. S. H. Jensen for useful discussions.  ...  The cell testing took place in the multiple button cells holder illustrated in Figure 2.  ...  Any leakage within the GHC will be detected by a CO gas sensor (G-02 in Figure 1 ) placed in the GHC. CO leaking outside the GHC will be detected by gas sensors in the laboratory.  ... 
doi:10.1063/1.4807094 pmid:23742566 fatcat:is67aksvvrbhvbrho36qresn5m

The HERMIT in the stream

Andrew Farmer, Christian Hoener zu Siederdissen, Andy Gill
2014 Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation - PEPM '14  
In this paper, we develop a custom optimization plugin which implements the proposed concatM ap transformation, and study the effectiveness of the transformation in practice.  ...  Stream Fusion, a popular deforestation technique in the Haskell community, cannot fuse the concatM ap combinator.  ...  The second author was funded, in part, by the Austrian Fonds zur Förderung der wissenschaftlichen Forschung (FWF) SFB F43, and would like to thank Peter F.  ... 
doi:10.1145/2543728.2543736 dblp:conf/pepm/FarmerSG14 fatcat:gszdciszpzcpzfk3xqp4uddhqi

Implementing a High-Level Distributed-Memory Parallel Haskell in Haskell [chapter]

Patrick Maier, Phil Trinder
2012 Lecture Notes in Computer Science  
To provide maintainability the implementation is modular and layered and, crucially, coded in vanilla Concurrent Haskell.  ...  ., an operating system process running HdpH, within the GHC RTS, possibly on multiple cores.  ...  Implementation Design For maintainability HdpH is implemented in a layered fashion with coordination aspects such as communication, global reference management, spark management, scheduling, etc. realised  ... 
doi:10.1007/978-3-642-34407-7_3 fatcat:e5amugh5tze6bfvzvnktuvkuwe

The Intel labs Haskell research compiler

Hai Liu, Neal Glew, Leaf Petersen, Todd A. Anderson
2013 Proceedings of the 2013 ACM SIGPLAN symposium on Haskell - Haskell '13  
In this paper, we describe our Haskell compiler stack, its implementation and optimization approach, and present benchmark results comparing it to GHC. • An experiment to reuse GHC as a Haskell frontend  ...  Haskell's lazy semantics imposes a runtime model which is in general difficult to implement efficiently.  ...  Accurate garbage collection imposes certain requirements on programs, needing information about which variables and object fields contain GC-managed references.  ... 
doi:10.1145/2503778.2503779 dblp:conf/haskell/LiuGPA13 fatcat:ri6z6z6j4zfv7depadske6rke4

Translating land cover/land use classifications to habitat taxonomies for landscape monitoring: a Mediterranean assessment

Valeria Tomaselli, Panayotis Dimopoulos, Carmela Marangi, Athanasios S. Kallimanis, Maria Adamo, Cristina Tarantino, Maria Panitsa, Massimo Terzi, Giuseppe Veronico, Francesco Lovergine, Harini Nagendra, Richard Lucas (+3 others)
2013 Landscape Ecology  
Periodic monitoring of biodiversity changes at a landscape scale constitutes a key issue for conservation managers.  ...  Yet, these are not as clearly relatable to biodiversity in comparison to habitat classifications, and provide less scope for monitoring.  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s)  ... 
doi:10.1007/s10980-013-9863-3 fatcat:i33onfp45veapdr4uhuqzhr2vy

Efficient parallel stencil convolution in Haskell

Ben Lippmeier, Gabriele Keller
2012 SIGPLAN notices  
Combined with careful management of the interaction between GHC and its back-end code generator LLVM, we achieve performance comparable to the standard OpenCV library.  ...  We present a declarative approach to writing such convolutions in Haskell that is both efficient at runtime and implicitly parallel.  ...  This work was supported in part by the Australian Research Council under grant number LP0989507.  ... 
doi:10.1145/2096148.2034684 fatcat:zegqgfinhbhsjbehu3kkfh3b34

Efficient parallel stencil convolution in Haskell

Ben Lippmeier, Gabriele Keller
2011 Proceedings of the 4th ACM symposium on Haskell - Haskell '11  
Combined with careful management of the interaction between GHC and its back-end code generator LLVM, we achieve performance comparable to the standard OpenCV library.  ...  We present a declarative approach to writing such convolutions in Haskell that is both efficient at runtime and implicitly parallel.  ...  This work was supported in part by the Australian Research Council under grant number LP0989507.  ... 
doi:10.1145/2034675.2034684 dblp:conf/haskell/LippmeierK11 fatcat:isvr7myqpjfdlbib3mcah7anf4

Functional array fusion

Manuel M. T. Chakravarty, Gabriele Keller
2001 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01  
This paper introduces a new approach to optimising array algorithms in functional languages.  ...  We are specifically aiming at an efficient implementation of irregular array algorithms that are hard to implement in conventional array languages such as Fortran.  ...  The list-based program is slower, as GHC manages to eliminate only one out of the two intermediate structures with its current Prelude definitions.  ... 
doi:10.1145/507635.507661 dblp:conf/icfp/ChakravartyK01 fatcat:df7uhqxetzbq7arhrau5iooz4q

Functional array fusion

Manuel M. T. Chakravarty, Gabriele Keller
2001 SIGPLAN notices  
This paper introduces a new approach to optimising array algorithms in functional languages.  ...  We are specifically aiming at an efficient implementation of irregular array algorithms that are hard to implement in conventional array languages such as Fortran.  ...  The list-based program is slower, as GHC manages to eliminate only one out of the two intermediate structures with its current Prelude definitions.  ... 
doi:10.1145/507669.507661 fatcat:g3kjii6hnvh6bclpjlq7vgwvsu

Functional array fusion

Manuel M. T. Chakravarty, Gabriele Keller
2001 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01  
This paper introduces a new approach to optimising array algorithms in functional languages.  ...  We are specifically aiming at an efficient implementation of irregular array algorithms that are hard to implement in conventional array languages such as Fortran.  ...  The list-based program is slower, as GHC manages to eliminate only one out of the two intermediate structures with its current Prelude definitions.  ... 
doi:10.1145/507660.507661 fatcat:ml3grn24njan7alyy5z7m7p67y

Sequent calculus as a compiler intermediate language

Paul Downen, Luke Maurer, Zena M. Ariola, Simon Peyton Jones
2016 SIGPLAN notices  
But in the world of logic it has a lesser-known twin, born at the same time, called the sequent calculus. Perhaps that would be a good intermediate language, too?  ...  We don't have to choose between flat and higher-order, however.  ...  without getting in the way of what GHC already does well.  ... 
doi:10.1145/3022670.2951931 fatcat:ygxjj7itwzeddmgxx7rjrzt5ke
« Previous Showing results 1 — 15 out of 267 results