Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Neal Glew"'
Publikováno v:
ICFP
Scopus-Elsevier
Scopus-Elsevier
Expressing algorithms using immutable arrays greatly simplifies the challenges of automatic SIMD vectorization, since several important classes of dependency violations cannot occur. The Haskell programming language provides libraries for programming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45937f4f355fbb54d13d6132c0b80125
https://doi.org/10.1145/2544174.2500605
https://doi.org/10.1145/2544174.2500605
Publikováno v:
Haskell
The Glasgow Haskell Compiler (GHC) is a well supported optimizing compiler for the Haskell programming language, along with its own extensions to the language and libraries. Haskell's lazy semantics imposes a runtime model which is in general difficu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e217859baa7c2d31d93c9e02db4b913
https://doi.org/10.1145/2578854.2503779
https://doi.org/10.1145/2578854.2503779
Publikováno v:
Concurrency and Computation: Practice and Experience. 17:617-637
The Open Runtime Platform (ORP) is a high-performance managed runtime environment (MRTE) that features exact generational garbage collection, fast thread synchronization, and multiple coexisting just-in-time compilers (JITs). ORP was designed for fle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::058ff97eb66cda78e90b5a125f769042
https://doi.org/10.1002/cpe.852
https://doi.org/10.1002/cpe.852
Autor:
Neal Glew, Jens Palsberg
Publikováno v:
Science of Computer Programming. 52:281-306
In a typed language such as Java, inlining of virtual methods does not always preserve typability. The best known solution to this problem is to insert type casts, which may hurt performance. This paper presents a solution that never hurts performanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99bd3bc2c1da3053b8bac0a0fe38cde3
https://doi.org/10.1016/j.scico.2004.03.009
https://doi.org/10.1016/j.scico.2004.03.009
Publikováno v:
FHPC@ICFP
In light of recent hardware advances, general-purpose computing on graphics processing units (GPGPU) is becoming increasingly commonplace, and needs novel programming models due to GPUs' radically different architecture. For the most part, existing a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c77274ba6ee4b6679c911d663cb1bb6
https://doi.org/10.1145/2636228.2636236
https://doi.org/10.1145/2636228.2636236
Autor:
Neal Glew
Publikováno v:
ICFP
Type dispatch constructs are an important feature of many programming languages. Scheme has predicates for testing the runtime type of a value. Java has a class cast expression and a try statement for switching on an exception's class. Crucial to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1512b67dafa61af815067529d2cdf08e
https://doi.org/10.1145/317765.317797
https://doi.org/10.1145/317765.317797
Publikováno v:
POPL
We motivate the design of a statically typed assembly language (TAL) and present a type-preserving translation from System F to TAL. The TAL we present is based on a conventional RISC assembly language, but its static type system provides support for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f76828ac17f8895011af1250fd93138
https://doi.org/10.1145/319301.319345
https://doi.org/10.1145/319301.319345
Publikováno v:
DTP@ICFP
Type systems are used to eliminate certain classes of errors at compile time. One of the goals of type system research is to allow more classes of errors (such as array subscript errors) to be eliminated. Dependent type systems have played a key role
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ca119649a6a935e25f7008b92988793
https://doi.org/10.1145/2502409.2502412
https://doi.org/10.1145/2502409.2502412
Publikováno v:
IFL
Papers on functional language implementations frequently set the goal of achieving performance "comparable to C", and sometimes report results comparing benchmark results to concrete C implementations of the same problem. A key pair of questions for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86eefa9b4c730bc8e8982078a0148372
https://doi.org/10.1145/2620678.2620685
https://doi.org/10.1145/2620678.2620685
Autor:
Neal Glew, Leaf Petersen
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642286513
CC
CC
Modern approaches to garbage collection (GC) require information about which variables and fields contain GC-managed pointers. Interprocedural flow analysis can be used to eliminate otherwise unnecessary heap allocated objects (unboxing), but must ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36a62576591199a74d7ed82e1dcc34d8
https://doi.org/10.1007/978-3-642-28652-0_9
https://doi.org/10.1007/978-3-642-28652-0_9
