Hugs

From Wikipedia, the free encyclopedia

"Hugs" the interpreter should not be confused with the physical gesture of hugging.

Hugs (Haskell User's Gofer System) (also Hugs 98) is a bytecode interpreter for the functional programming language Haskell. Hugs is the successor to Gofer, and was originally derived from Gofer version 2.30b.[1] It comes with a simple graphics library. As a complete Haskell implementation that is portable and simple to install, Hugs is often recommended for new Haskell users.

Hugs deviates from the Haskell 98 specification[2] in several minor ways.[3] For example, Hugs does not support mutually recursive modules.

The Hugs prompt accepts expressions for evaluation, but not module, type or function definitions. Hugs can load Haskell modules at start-up.[4]

  1. ^ Frequently Asked Questions about Hugs. Retrieved on 2006-08-04.
  2. ^ Simon Peyton Jones (editor) (December 2002). Haskell 98 Language and Libraries: The Revised Report. Retrieved on 2006-08-03.
  3. ^ Haskell 98 non-compliance. The Hugs 98 User's Guide. Retrieved on 2006-08-04.
  4. ^ Loading and editing Haskell module files. The Hugs 98 User's Guide. Retrieved on 2006-08-04.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.