Haskell

Known as: Homotopy Haskell, Haskell language, Cayenne programming language 
Haskell /ˈhæskəl/ is a standardized, general-purpose purely functional programming language, with non-strict semantics and strong static typing. It… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1952-2017
05010015019522016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
SMT-based checking of refinement types for call-by-value languages is a well-studied subject. Unfortunately, the classical… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Static type systems strive to be richly expressive while still being simple enough for programmers to use. We describe an… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present Cloud Haskell, a domain-specific language for developing programs for a distributed computing environment. Implemented… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
4 Generic Haskell is an extension of Haskell that supports the construction of generic programs. This article describes the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Quick Check is a tool which aids the Haskell programmer in formulating and testing properties of programs. Properties are… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Lava is a tool to assist circuit designers in specifying, designing, verifying and implementing hardware. It is a collection of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Some applications are most easily expressed in a programming language that supports concurrency, notably interactive and… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This article defines a set of type inference rules for resolving overloading introduced by type classes, as used in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
SUCC X = X+i add x y = x+y are really shor thand for: succ = \x -> x+l add = \ x y -> x+y We will have more to say about such… (More)
  • figure 1
  • figure 2
Is this relevant?