Skip to search formSkip to main contentSkip to account menu

The Glorious Glasgow Haskell Compilation System

Known as: GHC Haskell, Ghc compiler, The Glasgow Haskell Compiler 
The Glorious Glasgow Haskell Compilation System, more commonly known as the Glasgow Haskell Compiler or simply GHC, is an open source native code… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ARM architectureAbstract syntax treeBootstrapping (compilers)C--

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Scaling Software-Defined Network Controllers on Multicore Servers
Software defined networks (SDN) introduce centralized controllers to drastically increase network programmability. The simplicity… 
Highly Cited
2010
Highly Cited
2010
Sustaining a Confessional State: The Irish Parliament and Catholicism
The composite monarchies of eighteenth-century Europe were confessional states in which dissentients from the state religion were… 
2005
2005
The Glasgow-Liège Scale
SummaryIn 1982, we developed a new coma scale, the Glasgow-Liege Scale (GLS), which combines the Glasgow coma scale (GCS) with… 
2002
2002
Developing a high-performance web server in Concurrent Haskell
Server applications, and in particular network-based server applications, place a unique combination of demands on a programming… 
2000
2000
Evaluation of disability and handicap following injury.
Review
1996
Review
1996
Gothic Art: Glorious Visions
Part of Prentice Hall's Perspectives series of moderately priced, heavily illustrated, high-quality paperback books on specific… 
1994
1994
Execution profiling for non-strict functional languages
Profiling tools, which measure and display the dynamic space and time behaviour of programs, are essential for identifying… 
1993
1993
Update Avoidance Analysis by Abstract Interpretation
  • S. Marlow
  • Functional Programming
  • 1993
  • Corpus ID: 53750955
A requirement of lazy evaluation is that the value of any subexpression in the program is calculated no more than once. This is… 
1991
1991
Load balancing on generalized hypercube and mesh multiprocessors with LAL
A typical nearest neighbor balancing strategy, called LAL (local average load), in which the workload of a processor is averaged… 
1988
1988
A Flat GHC Implementation for Supercomputers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)