code stringlengths 5 1.03M | repo_name stringlengths 5 90 | path stringlengths 4 158 | license stringclasses 15
values | size int64 5 1.03M | n_ast_errors int64 0 53.9k | ast_max_depth int64 2 4.17k | n_whitespaces int64 0 365k | n_ast_nodes int64 3 317k | n_ast_terminals int64 1 171k | n_ast_nonterminals int64 1 146k | loc int64 -1 37.3k | cycloplexity int64 -1 1.31k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
circle(2)
| three/codeworld | codeworld-compiler/test/testcase/test_nakedExpression/source.hs | apache-2.0 | 10 | 0 | 5 | 1 | 10 | 4 | 6 | -1 | -1 |
-- |
-- Module : Criterion.IO.Printf
-- Copyright : (c) 2009-2014 Bryan O'Sullivan
--
-- License : BSD-style
-- Maintainer : bos@serpentine.com
-- Stability : experimental
-- Portability : GHC
--
-- Input and output actions.
{-# LANGUAGE FlexibleInstances, Rank2Types, TypeSynonymInstances #-}
module Crit... | paulolieuthier/criterion | Criterion/IO/Printf.hs | bsd-2-clause | 3,349 | 0 | 13 | 733 | 768 | 426 | 342 | 52 | 1 |
undefined = undefined
filter :: (a -> Bool) -> [a] -> [a]
filter p [] = []
filter p (x:xs) = if p x then filter p xs else x:filter p xs
map :: (a -> b) -> [a] -> [b]
map f [] = []
map f (x:xs) = f x : map f xs
not :: Bool -> Bool
not = undefined
toUpper :: Char -> Char
toUpper = undefined
test xs = let xform f = m... | themattchan/tandoori | input/let-poly-restrict2.hs | bsd-3-clause | 368 | 2 | 9 | 102 | 256 | 120 | 136 | 13 | 2 |
import Data.Char (ord, chr, isUpper, isAlpha)
caesar, uncaesar :: Int -> String -> String
caesar = (<$>) . tr
uncaesar = caesar . negate
tr :: Int -> Char -> Char
tr offset c
| isAlpha c = chr $ intAlpha + mod ((ord c - intAlpha) + offset) 26
| otherwise = c
where
intAlpha =
ord
(if isUppe... | OpenGenus/cosmos | code/cryptography/src/caesar_cipher/caesar_cipher.hs | gpl-3.0 | 511 | 5 | 12 | 151 | 226 | 112 | 114 | 17 | 2 |
{-# OPTIONS_JHC -fno-prelude -fm4 -funboxed-values -funboxed-tuples -fffi #-}
module Foreign.Storable(Storable(..)) where
import Jhc.Addr
import Jhc.Basics
import Jhc.IO
import Jhc.Int
m4_include(Foreign/Storable.m4)
class Storable a where
sizeOf :: a -> Int
alignment :: a -> Int
peekElemOff :: Ptr a -> ... | hvr/jhc | lib/jhc/Foreign/Storable.hs | mit | 1,198 | 3 | 20 | 265 | 529 | 279 | 250 | -1 | -1 |
{-# LANGUAGE PolyKinds, TypeFamilies, TypeFamilyDependencies,
ScopedTypeVariables, TypeOperators, GADTs,
DataKinds #-}
module T15141 where
import Data.Type.Equality
import Data.Proxy
type family F a = r | r -> a where
F () = Bool
data Wumpus where
Unify :: k1 ~ F k2 => k1 -> k2 -> Wump... | sdiehl/ghc | testsuite/tests/typecheck/should_compile/T15141.hs | bsd-3-clause | 909 | 0 | 12 | 219 | 137 | 78 | 59 | 14 | 1 |
module Foreign (x) where
x = "test"
| urbanslug/ghc | testsuite/tests/cabal/pkg02/Foreign.hs | bsd-3-clause | 36 | 0 | 4 | 7 | 14 | 9 | 5 | 2 | 1 |
{-# LANGUAGE ForeignFunctionInterface #-}
{-# LANGUAGE CPP #-}
module Text.XML.Pugi.Foreign.XPath.Node where
#if !MIN_VERSION_base(4,8,0)
import Control.Applicative
#endif
import Control.Exception
import Foreign.ForeignPtr
import Foreign.Ptr
import Foreign.C
import Foreign.Marshal
import Text.XML.Pugi.Foreign.Types... | philopon/pugixml-hs | Text/XML/Pugi/Foreign/XPath/Node.hs | mit | 1,672 | 0 | 16 | 319 | 641 | 323 | 318 | 37 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
import Control.Monad.IO.Class ( liftIO )
import Data.Aeson ( Object )
import Data.Monoid
import qualified Data.ByteString as BS
import qualified Data.ByteString.Char8 as C8
import Servant
import Servant.GitHub.Webhook
import Networ... | tsani/servant-github-webhook | test/dynamickey/Main.hs | mit | 1,046 | 0 | 18 | 195 | 349 | 193 | 156 | 35 | 1 |
import qualified System.Random as R
main = do
putStrLn "Hola Cuarenta"
| stackbuilders/cuarenta | Main.hs | mit | 74 | 0 | 7 | 14 | 20 | 11 | 9 | 3 | 1 |
module Main where
import Data.Numbers.Primes (isPrime, primes)
sumPrimesMod :: Int -> Bool
sumPrimesMod n = isPrime (sum (take n primes) `mod` n)
main :: IO ()
main = do
let ns = filter sumPrimesMod [1 .. 367]
print ns
print $ length ns
| genos/online_problems | prog_praxis/day280/src/Main.hs | mit | 246 | 0 | 11 | 52 | 109 | 57 | 52 | 9 | 1 |
module JSParser
( jsProgramParser
, jsValueParser
, jsExpressionParser
, jsStatementParser
, parseMaybe
, parseTest
, parseString
) where
import Control.Monad (void)
import Data.List (splitAt)
import Debug.Trace
import JSEntity
import JSEr... | li-zhirui/JSAnalyzer | JSParser.hs | mit | 28,004 | 0 | 14 | 6,538 | 4,179 | 2,316 | 1,863 | 318 | 7 |
module PlayerSpec (spec) where
import Player
import Game
import Board
import Test.Hspec
main :: IO ()
main = hspec spec
players = ( Player {playerType="human", playerSymbol=x}
, Player {playerType="computer", playerSymbol=o}
)
spec :: Spec
spec = do
describe "Player Tests" $ do
it "Should ... | basilpocklington/haskell-TTT | test/PlayerSpec.hs | mit | 2,058 | 0 | 17 | 468 | 607 | 305 | 302 | 46 | 1 |
module GameCom where
import Base
import Memory
import ROM
import qualified CPU
import qualified PPU
import qualified APU
step :: MachineState -> (Bool, MachineState)
step s0 = do
let s1 = CPU.step s0
let (r, s2) = PPU.step s1
let s3
| PPU.vBlankResult r = CPU.nmi s2
| PPU.scanline... | rkoeninger/GameCom | src/lib/GameCom.hs | mit | 417 | 0 | 14 | 127 | 150 | 76 | 74 | 16 | 1 |
module Language.HLisp.Prelude (hlispPrelude) where
import Data.Either
import qualified Data.Map.Strict as M
import Language.HLisp.Expr
import Language.HLisp.Parse
import Language.HLisp.Eval
import Language.HLisp.Prim
hlispPrelude :: LispEnv a
hlispPrelude =
let pstr = [("random", "[fun [lo hi] [__PRIM__random lo h... | rolph-recto/HLisp | src/Language/HLisp/Prelude.hs | mit | 2,743 | 0 | 20 | 838 | 431 | 264 | 167 | 43 | 1 |
{-# LANGUAGE TemplateHaskell #-}
import Test.Tasty.TH
{-
prop_foo
-}
main = $(defaultMainGenerator)
| expipiplus1/tasty-bug | Main.hs | mit | 102 | 0 | 6 | 14 | 18 | 11 | 7 | 3 | 1 |
module Test.Metamorph
( morphing
, morphingPure
, morphingGen
, morphingIO
, Metamorph
, Newtype(..)
, module Test.Metamorph.Pretty
, GenIO
, runGenIO
-- * Generics
, TraceOf
, Traceable(..)
, GTraceOf
, genericTrace
, weights
, weights'
, uniform
, genericPrettyWith
, (:%:)
) wh... | Lysxia/metamorph | src/Test/Metamorph.hs | mit | 440 | 0 | 5 | 93 | 101 | 69 | 32 | 23 | 0 |
{- CIS 194 HW 10
due Monday, 1 April
-}
module AParser where
import Control.Applicative
import Data.Char
-- A parser for a value of type a is a function which takes a String
-- represnting the input to be parsed, and succeeds or fails; if it
-- succeeds, it returns the parsed value along with... | bachase/cis194 | hw10/AParser.hs | mit | 2,952 | 0 | 12 | 739 | 740 | 400 | 340 | 40 | 2 |
{-# htermination (lexDigits :: (List Char) -> (List (Tup2 (List Char) (List Char)))) #-}
import qualified Prelude
data MyBool = MyTrue | MyFalse
data List a = Cons a (List a) | Nil
data Tup2 a b = Tup2 a b ;
data Char = Char MyInt ;
data MyInt = Pos Nat | Neg Nat ;
data Nat = Succ Nat | Zero ;
data Ordering... | ComputationWithBoundedResources/ara-inference | doc/tpdb_trs/Haskell/basic_haskell/lexDigits_1.hs | mit | 4,282 | 0 | 125 | 950 | 2,430 | 1,265 | 1,165 | 88 | 1 |
module Main where
import System.ReadEditor
main :: IO ()
main = do
putStrLn ">>> Opening editor for you to write me some content"
content <- readEditor
putStrLn ">>> You wrote:"
putStr content
| yamadapc/haskell-read-editor | examples/Example.hs | mit | 221 | 0 | 7 | 60 | 49 | 23 | 26 | 8 | 1 |
{-# LANGUAGE NamedFieldPuns #-}
{-# LANGUAGE RecordWildCards #-}
module Tutte
(
ForceAlgo(..)
, tutte
, Tutte
) where
import Control.Arrow ((***))
import qualified Data.Set as S
import qualified Data.Map.Strict as M
import Graph (vertices, Graph, Vertex, findBestCycle, neighbors)
type Set = S.Set
type Ma... | j-rock/tutte-your-stuff | src/Tutte.hs | mit | 2,061 | 0 | 13 | 596 | 741 | 399 | 342 | 52 | 2 |
--
-- Copyright (c) 2013 Bonelli Nicola <bonelli@antifork.org>
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--... | YelaSeamless/cgrep | src/CGrep/Lang.hs | gpl-2.0 | 5,198 | 0 | 16 | 1,554 | 1,891 | 1,053 | 838 | 79 | 2 |
{-# LANGUAGE TypeFamilies, OverloadedStrings #-}
import Data.Word (Word8)
import qualified Data.ByteString as S
import Data.ByteString.Char8 () -- get an orphan IsString instance?? wth does that mean?
class SafeHead a where
type Content a
safeHead :: a -> Maybe (Content a)
instance SafeHead [a] where
type Con... | softwaremechanic/Miscellaneous | Haskell/yesod_book/type_family.hs | gpl-2.0 | 721 | 0 | 10 | 154 | 253 | 132 | 121 | 22 | 1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE BangPatterns #-}
import Control.Monad
import Control.Concurrent
import qualified Data.ByteString.Char8 as BS
import qualified Sound.OSC as OSC
import qualifie... | kejace/comonome | sender.hs | gpl-2.0 | 1,384 | 0 | 18 | 321 | 410 | 221 | 189 | 31 | 1 |
-- Copyright (c) 2011, Diego Souza
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of condit... | dgvncsz0f/tiktok | src/main/TikTok/Plugins/Invite.hs | gpl-3.0 | 2,320 | 0 | 12 | 508 | 246 | 144 | 102 | 17 | 1 |
{-
This source file is a part of the noisefunge programming environment.
Copyright (C) 2015 Rev. Johnny Healey <rev.null@gmail.com>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation... | wolfspyre/noisefunge | src/Language/NoiseFunge/Server.hs | gpl-3.0 | 8,501 | 0 | 29 | 3,123 | 2,543 | 1,281 | 1,262 | 177 | 7 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-cloudprivatecatalogproducer/gen/Network/Google/Resource/CloudPrivateCatalogProducer/Operations/Cancel.hs | mpl-2.0 | 6,185 | 0 | 16 | 1,328 | 792 | 468 | 324 | 112 | 1 |
-- This Source Code Form is subject to the terms of the Mozilla Public
-- License, v. 2.0. If a copy of the MPL was not distributed with this
-- file, You can obtain one at http://mozilla.org/MPL/2.0/.
module Database.CQL.IO.Timeouts
( TimeoutManager
, create
, destroy
, Action
, Milliseconds (..)
... | twittner/cql-io | src/Database/CQL/IO/Timeouts.hs | mpl-2.0 | 2,091 | 0 | 16 | 608 | 714 | 361 | 353 | 66 | 4 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-compute/gen/Network/Google/Resource/Compute/PacketMirrorings/List.hs | mpl-2.0 | 7,619 | 0 | 20 | 1,668 | 833 | 497 | 336 | 120 | 1 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE OverloadedStrings #-}
--------------------------------------------------------------------------------
-- See end of this file for licence information.
--------------------------------------------------------------------------------
-- |
-- Module : RDFRulesetTest
-- Copyrigh... | DougBurke/swish | tests/RDFRulesetTest.hs | lgpl-2.1 | 12,733 | 0 | 13 | 2,600 | 2,869 | 1,674 | 1,195 | 221 | 1 |
import Test.QuickCheck
examples = [('@', "seckcoder@gmail.com"), ("/", "/usr/include")]
| seckcoder/lang-learn | haskell/quickcheck.hs | unlicense | 94 | 0 | 6 | 14 | 29 | 18 | 11 | 2 | 1 |
{-# LANGUAGE GADTs #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE TypeSynonymInstances #-}
{-# LANGUAGE EmptyDataDecls #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE FlexibleInstances #-}
module Generics.MultiRec.G... | alanz/ghc-multirec | src/Generics/MultiRec/GHC/GHCTHUseAlt2.hs | unlicense | 11,204 | 0 | 8 | 3,752 | 134 | 90 | 44 | 32 | 0 |
module GreetIfCool1 where
greetIfCool :: String -> IO ()
greetIfCool coolness =
if cool then putStrLn "Cool" else putStrLn "not cool"
where cool = coolness == "downright frosty yo"
| thewoolleyman/haskellbook | 04/09/maor/greetIfCool1.hs | unlicense | 192 | 0 | 7 | 40 | 51 | 27 | 24 | 5 | 2 |
{-# LANGUAGE CPP #-}
-- | A representation of Haskell source code.
--
-- Unlike haskell-src-exts, our goal is not to reconstruct detailed semantics,
-- but to preserve original line numbers (if applicable).
module Data.HaskellSource where
import Prelude hiding (fail)
#if MIN_VERSION_base(4,12,0)
import Control.Monad... | gelisam/hawk | src/Data/HaskellSource.hs | apache-2.0 | 4,027 | 0 | 13 | 1,196 | 776 | 419 | 357 | 63 | 4 |
<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE helpset PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp HelpSet Version 2.0//EN" "http://java.sun.com/products/javahelp/helpset_2_0.dtd">
<helpset version="2.0" xml:lang="ru-RU">
<title>Front-End Scanner | ZAP Extension</title>
<maps>
<homeID>top</homeID>
<m... | secdec/zap-extensions | addOns/frontendscanner/src/main/javahelp/org/zaproxy/zap/extension/frontendscanner/resources/help_ru_RU/helpset_ru_RU.hs | apache-2.0 | 978 | 78 | 67 | 159 | 417 | 211 | 206 | -1 | -1 |
{-# LANGUAGE DeriveDataTypeable, ExistentialQuantification, GeneralizedNewtypeDeriving #-}
{-# LANGUAGE BangPatterns #-}
-- Internal file. Lots of types. Lots of coupling.
module Database.VCache.Types
( Address, isVRefAddr, isPVarAddr
, VRef(..), Cache(..), CacheMode(..)
, VREph(..), VREphMap, addVREph, ta... | dmbarbour/haskell-vcache | hsrc_lib/Database/VCache/Types.hs | bsd-2-clause | 24,112 | 0 | 19 | 5,504 | 3,928 | 2,291 | 1,637 | -1 | -1 |
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE BangPatterns #-}
module Search.Stats
(
MTFCounter, TFCounter(TFCounter)
, newMTFCounter, countTermFrequencies
, tfFreeze, tfSize
) where
import qualified Data.Vector.Unboxed.Mutable as MVU
import qualified Data.Vector.Unb... | jdimond/diplomarbeit | lib/Search/Stats.hs | bsd-3-clause | 2,664 | 3 | 19 | 846 | 841 | 431 | 410 | 74 | 3 |
{-# LANGUAGE CPP #-}
#if !defined(TESTING) && __GLASGOW_HASKELL__ >= 703
{-# LANGUAGE Safe #-}
#endif
#include "containers.h"
-----------------------------------------------------------------------------
-- |
-- Module : Data.Set
-- Copyright : (c) Daan Leijen 2002
-- License : BSD-style
-- Maintainer ... | shockkolate/containers | Data/Set.hs | bsd-3-clause | 3,962 | 0 | 5 | 1,513 | 282 | 213 | 69 | 58 | 0 |
{-# LANGUAGE OverloadedStrings, PackageImports #-}
import Control.Applicative
import Control.Monad
import "monads-tf" Control.Monad.Trans
import Data.HandleLike
import System.Environment
import Network
import Network.PeyoTLS.ReadFile
import Network.PeyoTLS.Client
import "crypto-random" Crypto.Random
import qualified ... | YoshikuniJujo/peyotls | peyotls/examples/eccClient.hs | bsd-3-clause | 1,255 | 18 | 14 | 178 | 374 | 200 | 174 | 36 | 2 |
module Main where
import Criterion.Main
infixl 9 !?
_ !? n | n < 0 = Nothing
[] !? _ = Nothing
(x:_) !? 0 = Just x
(_:xs) !? n = xs !? (n - 1)
myList :: [Int]
myList = [1..9999]
main :: IO ()
main = defaultMain
[ bench "index list 9999"
$ whnf (myList !!) 9998
, bench "index list maybe ind... | nicklawls/haskellbook | src/Bench.hs | bsd-3-clause | 364 | 0 | 9 | 112 | 172 | 89 | 83 | 15 | 1 |
module Main (main) where
import Control.Monad
import System.Console.GetOpt
import System.Environment
import System.Exit
import System.IO
import Language.Hudson.PrettyPrinter
data Options = Options { optVerbose :: Bool
, optInput :: IO String
, optOutput :: String... | jschaf/hudson-dev | src/hudsonpp.hs | bsd-3-clause | 2,465 | 0 | 16 | 910 | 632 | 333 | 299 | 63 | 4 |
{-# LANGUAGE Rank2Types #-}
module YaLedger.Types.Output
(ASCII (..),
CSV (..),
OutputFormat (..),
defaultOutputFormat
) where
import YaLedger.Output.Tables
import YaLedger.Output.ASCII
import YaLedger.Output.CSV
import YaLedger.Output.HTML
data OutputFormat =
OASCII ASCII
| OCSV CSV
| O... | portnov/yaledger | YaLedger/Types/Output.hs | bsd-3-clause | 425 | 0 | 6 | 80 | 101 | 64 | 37 | 17 | 1 |
{-# LANGUAGE PolyKinds, DataKinds, TemplateHaskell, TypeFamilies,
GADTs, TypeOperators, RankNTypes, FlexibleContexts, UndecidableInstances,
FlexibleInstances, ScopedTypeVariables, MultiParamTypeClasses,
OverlappingInstances, KindSignatures #-}
module Oxymoron.Scene.Uniform where
import Data.Singletons
impor... | jfischoff/oxymoron | src/Oxymoron/Scene/Uniform.hs | bsd-3-clause | 947 | 0 | 8 | 151 | 82 | 53 | 29 | 10 | 0 |
{-#LANGUAGE PatternGuards #-}
module Twilio.Types.AuthToken
( -- * Authentication Token
AuthToken
, getAuthToken
, parseAuthToken
) where
import Control.Monad
import Data.Aeson
import Data.Char
import Data.Text (Text)
import qualified Data.Text as T
-- | Your authentication token is used to make authenti... | seagreen/twilio-haskell | src/Twilio/Types/AuthToken.hs | bsd-3-clause | 990 | 0 | 12 | 180 | 236 | 129 | 107 | 27 | 1 |
-----------------------------------------------------------------------------
-- |
-- Module : Turbinado.Server.StandardResponse
-- Copyright : (c) Alson Kemp 2008, Andreas Farre, Niklas Broberg, 2004
-- License : BSD-style (see the file LICENSE)
--
-- Maintainer : Alson Kemp (Alson@AlsonKemp.com)
-- S... | abuiles/turbinado-blog | Turbinado/Server/StandardResponse.hs | bsd-3-clause | 3,842 | 4 | 16 | 1,080 | 912 | 475 | 437 | 65 | 1 |
-- |
-- Module: $Header$
-- Description: Experiment to make help messages easier to create.
-- Copyright: (c) 2019-2020 Peter Trško
-- License: BSD3
--
-- Maintainer: peter.trsko@gmail.com
-- Stability: experimental
-- Portability: GHC specific language extensions.
--
-- Experiment to make help messages e... | trskop/command-wrapper | command-wrapper-core/src/CommandWrapper/Core/Help/Message.hs | bsd-3-clause | 11,748 | 0 | 17 | 2,830 | 2,575 | 1,436 | 1,139 | -1 | -1 |
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}
module Control.Yield.Cont where
import Control.Monad.Trans.Cont
import Control.Monad.Trans.Class
import Control.Monad (liftM)
infix 2 `provide`
infix 1 `using`
newtype Producing o i m a
= Producing { using :: forall r. (o -> ContT r m i) -> ContT r... | DanBurton/yield | Control/Yield/Cont.hs | bsd-3-clause | 1,690 | 0 | 15 | 398 | 709 | 378 | 331 | 39 | 2 |
module LG.Identify (identifyNodes) where
import LG.Base
import LG.Term
import LG.Graph
import LG.Base
import LG.Term
import qualified Data.Map as Map
import qualified Data.Set as Set
-- A (simple) identification contains two references to a node: one will be the
-- premise of the axiom link; the other the conclusion.
... | jgonggrijp/net-prove | src/LG/Identify.hs | bsd-3-clause | 14,424 | 1 | 16 | 3,129 | 3,129 | 1,696 | 1,433 | 142 | 15 |
-----------------------------------------------------------------------------
-- | Module : Data.These
--
-- The 'These' type and associated operations. Now enhanced with @Control.Lens@ magic!
module Data.These (
These(..)
-- * Functions to get rid of 'The... | andrewthad/these | Data/These.hs | bsd-3-clause | 9,194 | 0 | 11 | 2,883 | 3,391 | 1,752 | 1,639 | 161 | 1 |
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE TypeSynonymInstances #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
module Pos.Explorer.Web.Transform
( ExplorerProd
, runExplorerProd
, liftToExplorerProd
, explorerSe... | input-output-hk/pos-haskell-prototype | explorer/src/Pos/Explorer/Web/Transform.hs | mit | 4,482 | 0 | 12 | 1,028 | 867 | 487 | 380 | -1 | -1 |
module RewriteLBNF where
-- Haskell module generated by the BNF converter
import AbsLBNF
transGrammar :: Grammar -> Grammar
transGrammar x = case x of
Grammar defs -> Grammar $ defs >>= transDef
transDef :: Def -> [Def]
transDef x = case x of
Rule label cat items -> [x, Internal (transLabel label) cat (addPo... | juodaspaulius/clafer-old-customBNFC | src/Language/Clafer/Front/lbnf/RewriteLBNF.hs | mit | 667 | 0 | 11 | 150 | 256 | 131 | 125 | 18 | 2 |
{- |
Module : $Header$
Copyright : (c) Felix Gabriel Mance
License : GPLv2 or higher, see LICENSE.txt
Maintainer : f.mance@jacobs-university.de
Stability : provisional
Portability : portable
RDF syntax parser
-}
module RDF.Parse where
import Common.Parsec
import Common.Lexer
import Common.AnnoPa... | keithodulaigh/Hets | RDF/Parse.hs | gpl-2.0 | 5,396 | 0 | 14 | 1,135 | 1,553 | 764 | 789 | 138 | 1 |
{-|
A simple 'Amount' is some quantity of money, shares, or anything else.
It has a (possibly null) 'CommoditySymbol' and a numeric quantity:
@
$1
£-50
EUR 3.44
GOOG 500
1.5h
90 apples
0
@
It may also have an assigned 'Price', representing this amount's per-unit
or total cost in a different commodity. I... | ony/hledger | hledger-lib/Hledger/Data/Amount.hs | gpl-3.0 | 27,731 | 0 | 18 | 5,442 | 6,116 | 3,284 | 2,832 | 385 | 4 |
{-# LANGUAGE CPP, MagicHash #-}
{-# OPTIONS_GHC -funbox-strict-fields #-}
--
-- (c) The University of Glasgow 2002-2006
--
-- | ByteCodeInstrs: Bytecode instruction definitions
module ETA.Interactive.ByteCodeInstr (
BCInstr(..), ProtoBCO(..), bciStackUse, BreakInfo (..)
) where
#include "HsVersions.h"
imp... | pparkkin/eta | compiler/ETA/Interactive/ByteCodeInstr.hs | bsd-3-clause | 13,902 | 0 | 22 | 4,314 | 3,504 | 1,767 | 1,737 | 260 | 1 |
-----------------------------------------------------------------------------
-- |
-- Module : Distribution.License
-- Copyright : Isaac Jones 2003-2005
--
-- Maintainer : Isaac Jones <ijones@syntaxpolice.org>
-- Stability : alpha
-- Portability : portable
--
-- The License datatype. For more informati... | alekar/hugs | packages/Cabal/Distribution/License.hs | bsd-3-clause | 3,334 | 2 | 6 | 665 | 89 | 67 | 22 | 10 | 0 |
-- |
-- Module : Data.Array.Accelerate.CUDA.Array.Sugar
-- Copyright : [2008..2014] Manuel M T Chakravarty, Gabriele Keller
-- [2009..2014] Trevor L. McDonell
-- License : BSD3
--
-- Maintainer : Trevor L. McDonell <tmcdonell@cse.unsw.edu.au>
-- Stability : experimental
-- Portability : non-... | AccelerateHS/accelerate-cuda | Data/Array/Accelerate/CUDA/Array/Sugar.hs | bsd-3-clause | 1,284 | 0 | 10 | 245 | 257 | 152 | 105 | 19 | 1 |
--------------------------------------------------------------------------------
-- | Various IRC utilities
{-# LANGUAGE OverloadedStrings #-}
module NumberSix.Util.Irc
( mode
, meAction
, kick
) where
--------------------------------------------------------------------------------
import Co... | itkovian/number-six | src/NumberSix/Util/Irc.hs | bsd-3-clause | 1,357 | 0 | 11 | 264 | 217 | 122 | 95 | 23 | 1 |
module Expression (
-- * Expressions
Expr, Predicate, Args, Ways,
-- ** Construction and modification
expr, exprIO, arg, remove,
-- ** Predicates
(?), stage, stage0, stage1, stage2, notStage0, package, notPackage,
packageOneOf, libraryPackage, builder, way, input, inputs, output, outputs,... | sdiehl/ghc | hadrian/src/Expression.hs | bsd-3-clause | 3,230 | 0 | 13 | 759 | 735 | 413 | 322 | 66 | 1 |
{-# LANGUAGE CPP #-}
module UU.Parsing.Merge((<||>), pMerged, list_of) where
import UU.Parsing
-- ==== merging
-- e.g. chars_digs = cat3 `pMerged` (list_of pDig <||> list_of pL <||> list_of pU)
-- parsing "12abCD1aV" now returns "121abaCDV", so the sequence of
-- recognised elements is stored in three lists, wh... | guillep19/uulib | src/UU/Parsing/Merge.hs | bsd-3-clause | 919 | 0 | 12 | 226 | 471 | 271 | 200 | 16 | 1 |
module Client
( getServerStatus
, stopServer
, serverCommand
) where
import Control.Exception (tryJust)
import Control.Monad (guard)
import Network (PortID(UnixSocket), connectTo)
import System.Exit (exitFailure, exitWith)
import System.IO (Handle, hClose, hFlush, hGetLine, hPutStrLn, stderr)
import Sy... | ranjitjhala/hdevtools | src/Client.hs | mit | 2,209 | 0 | 15 | 543 | 705 | 343 | 362 | 61 | 5 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE OverloadedStrings #-}
module Lazyfoo.Lesson10 (main) where
import Control.Monad
import Foreign.C.Types
import Linear
import Linear.Affine
import SDL (($=))
import qualified SDL
import Paths_sdl2 (getDataFileName)
#if !MIN_VERSION_base(4,8,0)
import Control.Applicative
#endif
screen... | bj4rtmar/sdl2 | examples/lazyfoo/Lesson10.hs | bsd-3-clause | 2,513 | 0 | 21 | 550 | 731 | 352 | 379 | 67 | 2 |
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeFamilies #-}
module Main where
import Data.Functor.Misc
import Control.Monad.Primitive
import Control.Monad.IO.Class
import Data.Dependent.Sum
import Control.Concurrent.STM
import Control.Applicative
impo... | k0001/reflex | bench/Main.hs | bsd-3-clause | 4,291 | 0 | 15 | 800 | 1,509 | 788 | 721 | 94 | 1 |
{-# LANGUAGE TemplateHaskell, TypeFamilies #-}
module T10306 where
import Language.Haskell.TH
import GHC.TypeLits
-- Attempting to reify a built-in type family like (+) previously
-- caused a crash, because it has no equations
$(do x <- reify ''(+)
case x of
FamilyI (ClosedTypeFamilyD _ _ _ _ []) _ -> re... | siddhanathan/ghc | testsuite/tests/th/T10306.hs | bsd-3-clause | 397 | 0 | 15 | 120 | 91 | 47 | 44 | 8 | 0 |
module M (f) where
f :: Int -> Int
f i = go [ 1, 0 ]
where
go :: [Int] -> Int
go [] = undefined
go [1] = undefined
go (x:xs) | x == i = 2
| otherwise = go xs
| urbanslug/ghc | testsuite/tests/codeGen/should_compile/T9303.hs | bsd-3-clause | 213 | 0 | 10 | 99 | 107 | 56 | 51 | 8 | 3 |
{-# htermination (lookup :: Tup0 -> (List (Tup2 Tup0 a)) -> Maybe a) #-}
import qualified Prelude
data MyBool = MyTrue | MyFalse
data List a = Cons a (List a) | Nil
data Tup0 = Tup0 ;
data Tup2 a b = Tup2 a b ;
data Maybe a = Nothing | Just a ;
esEsTup0 :: Tup0 -> Tup0 -> MyBool
esEsTup0 Tup0 Tup0 = MyT... | ComputationWithBoundedResources/ara-inference | doc/tpdb_trs/Haskell/basic_haskell/lookup_1.hs | mit | 726 | 0 | 9 | 179 | 324 | 170 | 154 | 18 | 1 |
module LynCrypt.Util where
slice a b xs = (take (b'-a'+1)) $ (drop a' xs)
where a' = fromIntegral a :: Int
b' = fromIntegral b :: Int
| Sintrastes/LynCrypt | src/LynCrypt/Util.hs | mit | 149 | 0 | 10 | 42 | 71 | 38 | 33 | 4 | 1 |
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE MultiParamTypeClasses #-}
module Nunavut.Activator (
propA,
backpropA,
unsafeBackpropA,
activatorFunc,
activatorDeriv,
softmax,
logistic,
tanhActivator,
relu,
linear,
Activator
) where
import Control.Lens ((%=), (^.), _... | markcwhitfield/nunavut | src/Nunavut/Activator.hs | mit | 4,419 | 0 | 13 | 1,676 | 1,029 | 564 | 465 | -1 | -1 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE OverloadedStrings #-}
module Web.Cookie
( -- * Server to client
-- ** Data type
SetCookie
, setCookieName
, setCookieValue
, setCookiePath
, setCookieExpires
, setCookieMaxAge
, setCookieDomain
, setCookieHttpOnly
, setCookieSecure
, ... | snoyberg/cookie | Web/Cookie.hs | mit | 10,553 | 0 | 13 | 2,355 | 2,146 | 1,196 | 950 | 208 | 10 |
{-# LANGUAGE QuasiQuotes, ViewPatterns #-}
module Y2017.M12.D11.Solution where
import Control.Arrow (first)
import Control.Monad (void)
import Control.Monad.State
import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as B
import Database.PostgreSQL.Simple
import Database.PostgreSQL.Simple.S... | geophf/1HaskellADay | exercises/HAD/Y2017/M12/D11/Solution.hs | mit | 3,197 | 1 | 16 | 561 | 443 | 250 | 193 | 33 | 1 |
type Persona = (Nombre, Edad, Sexo, Caracteristicas, [Enfermedad], [Deporte], [Ocupacion])
type Nombre = [Char]
type Edad = Int
type Sexo = Char
type Caracteristicas = (Peso, Altura, Contextura)
type Altura = Double
type Peso = Double
type Contextura = [Char]
type Enfermedad = [Char]
type Deporte = [Char]
type Ocupacio... | matiasm15/Haskell | TP Nutricionista.hs | mit | 4,692 | 0 | 12 | 834 | 1,743 | 999 | 744 | 67 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Nauva.Catalog.Types
( Page(..)
, Leaf(..)
, Directory(..)
, onlyLeaves
) where
import Data.Text (Text)
import Data.Monoid
import Nauva.Internal.Types
data Page
= PLeaf !Leaf
| PDirectory !Directory
dat... | wereHamster/nauva | pkg/hs/nauva-catalog/src/Nauva/Catalog/Types.hs | mit | 835 | 0 | 10 | 236 | 210 | 119 | 91 | 38 | 2 |
{-|
Module : FRP.AST
Description : Abstract Syntax Tree
This module implements the AST of FRP programs
-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE NamedFieldPuns #-}
module FRP.AST (
Name
, Labe... | adamschoenemann/simple-frp | src/FRP/AST.hs | mit | 16,352 | 0 | 19 | 4,819 | 5,458 | 2,787 | 2,671 | -1 | -1 |
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANG... | plow-technologies/Vinyl | Data/Vinyl/Lens.hs | mit | 4,274 | 0 | 14 | 1,119 | 1,111 | 604 | 507 | -1 | -1 |
{-# OPTIONS_GHC -F -pgmF hspec-discover #-}
--module Main where
--
--import Test.Hspec
--
--main :: IO ()
--main = hspec $ do
-- describe "trivial" $ do
-- it "should be true" $ do
-- True `shouldBe` True
| parsonsmatt/QuickLift | test/Spec.hs | mit | 215 | 0 | 2 | 48 | 12 | 11 | 1 | 1 | 0 |
module TigerColor
(
color
, Allocation
)
where
import TigerInterference
import TigerTemp
import TigerRegisters
import qualified TigerGraph as Gr
import qualified Data.Map as Map
import Data.List
import Data.Maybe
type Allocation = Map.Map Temp Register
reducelist :: [Maybe a] -> [a]
reducelist xs = reduc... | hengchu/tiger-haskell | src/tigercolor.hs | mit | 2,037 | 0 | 16 | 593 | 710 | 359 | 351 | 48 | 3 |
{-# LANGUAGE DoAndIfThenElse #-}
{-|
Copyright (c) 2014 Maciej Bendkowski
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation th... | maciej-bendkowski/LCCLUtils | src/ParserUtils.hs | mit | 3,534 | 0 | 12 | 1,218 | 767 | 399 | 368 | 52 | 2 |
module E14 where
type MyType = Integer
definition :: MyType
definition = definitionOne * definitionTwo
where
definitionOne :: MyType
definitionTwo :. MyType -- German keyboard.
definitionOne = 1
definitionTwo = 1
{-
... | pascal-knodel/haskell-craft | Examples/· Errors/E14.hs | mit | 610 | 0 | 8 | 273 | 51 | 30 | 21 | -1 | -1 |
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TemplateHaskell #-}
module Phb.Types.Project where
import BasePrelude hiding (index)
import Prelude ()
import Control.Lens
import Data.Text (Text)
import Data.Time
import Database.Persist (Entity, Key)
import Ph... | benkolera/phb | hs/Phb/Types/Project.hs | mit | 1,551 | 0 | 11 | 312 | 354 | 206 | 148 | 43 | 1 |
doSomething a
|a==0 =putStrLn "hello"
|otherwise = putStrLn "bye"
| sushantmahajan/programs | haskell/test.hs | cc0-1.0 | 74 | 1 | 8 | 17 | 32 | 14 | 18 | 3 | 1 |
{-# LANGUAGE TemplateHaskell #-}
module PL.Struktur where
import PL.Signatur
import PL.Util
import Autolib.TES.Identifier
import Autolib.FiniteMap
import Autolib.Size
import Autolib.Set
import Autolib.Reader
import Autolib.ToDoc
import Autolib.Reporter
import Data.Typeable
data Predicate u = Predicate { unPredicate... | florianpilz/autotool | src/PL/Struktur.hs | gpl-2.0 | 4,897 | 170 | 13 | 1,437 | 1,728 | 922 | 806 | 121 | 2 |
{-# LANGUAGE TemplateHaskell #-}
module Persistence.Schema.MappingOrigin where
import Data.List (isPrefixOf)
import Database.Persist.TH
data MappingOrigin = SeeTarget
| SeeSource
| TEST
| DGLinkVerif
| DGImpliesLink
| DGLin... | spechub/Hets | Persistence/Schema/MappingOrigin.hs | gpl-2.0 | 4,161 | 0 | 12 | 970 | 1,184 | 626 | 558 | 73 | 0 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE NoImplicitPrelude #-}
-- TODO: Less dependencies. I wonder if there's a tool that can tell me about unused imports
module Data.Stdf.Parser
( parseFile
, parse
)
where
import Data.Binary.Get hiding (Fail)
import qualified Data.ByteString.Lazy.Char8 as BL
impor... | gitfoxi/Stdf | Data/Stdf/Parser.hs | gpl-2.0 | 26,028 | 1 | 42 | 8,395 | 7,210 | 3,653 | 3,557 | 611 | 14 |
{- |
Module : $Header$
Description : Symbols of propositional logic
Copyright : (c) Dominik Luecke, Uni Bremen 2007
License : GPLv2 or higher, see LICENSE.txt
Maintainer : luecke@informatik.uni-bremen.de
Stability : experimental
Portability : portable
Definition of symbols for propositional logic... | nevrenato/Hets_Fork | Temporal/Symbol.hs | gpl-2.0 | 2,387 | 0 | 11 | 593 | 466 | 268 | 198 | 43 | 1 |
{-# LANGUAGE CPP #-}
module Infernu.Util (checkFiles, annotatedSource, checkSource) where
import Control.Monad (forM, when)
import Data.Maybe (catMaybes)
import Data.List (intercalate)
import qualified Data.Set as Set
imp... | sinelaw/infernu | src/Infernu/Util.hs | gpl-2.0 | 4,054 | 0 | 21 | 1,274 | 1,218 | 669 | 549 | 61 | 3 |
-- Main.hs -- The entry point for the babel sequence generator
-- Copyright (C) 2017 Quytelda Kahja <quytelda@tamalin.org>
--
-- This file is part of babel.
-- babel is free software: you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foun... | quytelda/babel | src/Main.hs | gpl-3.0 | 4,264 | 0 | 18 | 1,207 | 969 | 531 | 438 | 85 | 2 |
import ClassA
data A = A | B
instance A Int where
id2 x = x
| Helium4Haskell/helium | test/classesQualified/DataClassName.hs | gpl-3.0 | 64 | 0 | 6 | 20 | 30 | 16 | 14 | 4 | 0 |
{-# LANGUAGE FlexibleContexts, TypeOperators #-}
module Mudblood.Contrib.MG
( module Mudblood.Contrib.MG.Profile
, module Mudblood.Contrib.MG.State
, module Mudblood.Contrib.MG.Mapper
, module Mudblood.Contrib.MG.GMCP
, module Mudblood.Contrib.MG.Combat
, module Mudblood.Contrib.MG.Guilds
... | talanis85/mudblood | src/Mudblood/Contrib/MG.hs | gpl-3.0 | 722 | 0 | 5 | 94 | 157 | 113 | 44 | 19 | 0 |
{-# LANGUAGE ScopedTypeVariables, GADTs #-}
module Utils where
import Data.Set (Set(..))
import qualified Data.Set as Set
import Control.Monad.Trans
import Data.Traversable as Traversable
import Control.Monad
import qualified Data.Generics as Generics
import Data.Proxy
import Data.Typeable hiding (typeOf)
import Cont... | hpacheco/jasminv | src/Utils.hs | gpl-3.0 | 3,029 | 0 | 10 | 620 | 1,727 | 937 | 790 | 75 | 2 |
{-# LANGUAGE BangPatterns, TypeSynonymInstances #-}
module Main where
import Prelude hiding (init, Left, Right)
import Types
import CPUDefs
import PPUDefs
import CPU
import PPU
import Loader
import PPUHelpers (ppuDecodeAction, getPPUActions)
import CPUHelpers
import Data.Array.ST
import Control.Monad.Reader
import ... | tobsan/yane | Enterprise.hs | gpl-3.0 | 6,146 | 0 | 24 | 1,961 | 1,828 | 973 | 855 | 119 | 2 |
module Numeric (showInt, showOct, showHex, showDouble, show, showTime) where {
-- A partial implementation of the Haskell "Numeric" library module.
-- With the addition of the functions show and time;
showInt, showOct, showHex :: Int -> (String -> String);
showInt = showIntAtBase 10 intToDigit; ... | ckaestne/CIDE | CIDE_Language_Haskell/test/fromviral/Numeric.hs | gpl-3.0 | 2,195 | 3 | 16 | 696 | 578 | 334 | 244 | -1 | -1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-androidmanagement/gen/Network/Google/Resource/AndroidManagement/Enterprises/Devices/Operations/Get.hs | mpl-2.0 | 5,233 | 0 | 15 | 1,115 | 700 | 411 | 289 | 103 | 1 |
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
-- |
-- Module : Network.Google.CloudTasks.Types.Sum
-- Copyright : (c) 2015-2016 Bren... | brendanhay/gogol | gogol-cloudtasks/gen/Network/Google/CloudTasks/Types/Sum.hs | mpl-2.0 | 17,298 | 0 | 11 | 3,885 | 1,955 | 1,085 | 870 | 227 | 0 |
import Data.List
primes = 2 : filter ((==1) . length . primeFactors) [3,5..]
primeFactors :: Int -> [Int]
primeFactors n = factor n primes
where
factor n (p:ps)
| p*p > n = [n]
| n `mod` p == 0 = p : factor (n `div` p) (p:ps)
| otherwise = factor n ps
test n x y = length (... | jdavidberger/project-euler | prob47.hs | lgpl-3.0 | 678 | 3 | 13 | 234 | 407 | 205 | 202 | 18 | 1 |
module SSync.JSVector.Internal where
import Control.Applicative (Applicative(..))
newtype VectorMonad a = VectorMonad { runVectorMonad :: IO a }
instance Monad VectorMonad where
return = VectorMonad . return
(VectorMonad a) >>= b = VectorMonad $ a >>= runVectorMonad . b
instance Applicative VectorMonad where
... | socrata-platform/ssync | src/main/haskell/SSync/JSVector/Internal.hs | apache-2.0 | 495 | 0 | 8 | 86 | 169 | 90 | 79 | 11 | 0 |
{-# LANGUAGE TypeFamilies #-}
module Entity where
class Entity e where
type EKey e
type EValue e
getKey :: e -> EKey e
getValue :: e -> EValue e
| sisioh/haskell-dddbase | src/Entity.hs | apache-2.0 | 156 | 0 | 8 | 40 | 46 | 26 | 20 | 7 | 0 |
-- |
-- Module : $Header$
-- Copyright : (c) 2013-2015 Galois, Inc.
-- License : BSD3
-- Maintainer : cryptol@galois.com
-- Stability : provisional
-- Portability : portable
module Cryptol.ModuleSystem.NamingEnv where
import Cryptol.ModuleSystem.Interface
import Cryptol.Parser.AST
import Cryptol.P... | ntc2/cryptol | src/Cryptol/ModuleSystem/NamingEnv.hs | bsd-3-clause | 9,318 | 0 | 19 | 2,611 | 2,676 | 1,371 | 1,305 | 172 | 6 |
{-# LANGUAGE OverloadedStrings #-}
module Twitter
( TwKeys
, twKeys
, post
) where
import Control.Monad.IO.Class (liftIO)
import Data.ByteString
import qualified Data.ByteString.Lazy as L
import qualified Data.ByteString.Char8 as BC
import Data.Conduit
import qualified Data.Conduit.Binary as CB
import ... | yunomu/nicodicbot | src/Twitter.hs | bsd-3-clause | 1,731 | 0 | 10 | 356 | 468 | 256 | 212 | 44 | 1 |
-- CIS 194, Spring 2015
--
-- Test cases for HW 01
-- ghcid --command="stack repl"
module HW01Tests where
import HW01
import Testing
-- Exercise 1 -----------------------------------------
testLastDigit :: (Integer, Integer) -> Bool
testLastDigit (n, d) = lastDigit n == d
testDropLastDigit :: (Integer, Integer) -... | eatobin/cis194 | lesson1/src/HW01Tests.hs | bsd-3-clause | 2,471 | 0 | 10 | 604 | 940 | 583 | 357 | 44 | 1 |
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE LambdaCase #-}
-- | This module c... | rolph-recto/liquid-fixpoint | src/Language/Fixpoint/Smt/Interface.hs | bsd-3-clause | 14,715 | 0 | 17 | 4,027 | 4,034 | 2,055 | 1,979 | 278 | 11 |
{-# LANGUAGE CPP, MagicHash #-}
-----------------------------------------------------------------------------
-- |
-- Module : Data.Binary.Builder
-- Copyright : Lennart Kolmodin, Ross Paterson
-- License : BSD3-style (see LICENSE)
--
-- Maintainer : Lennart Kolmodin <kolmodin@dtek.chalmers.se>
-- Stabili... | beni55/binary | src/Data/Binary/Builder.hs | bsd-3-clause | 12,396 | 0 | 15 | 2,850 | 2,653 | 1,488 | 1,165 | 157 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.