<commit_before>------------------------------------------------------------------------------
-- |
-- Module      : Main
-- Copyright   : (c) <NAME> 2009-2013
-- License     : See the file LICENSE.
--
-- Maintainer  : <NAME> <<EMAIL>>
-- Stability   : experimental
--
-- apia: A program for proving first-order theorems written in the
-- dependently typed language Agda using first-order automatic theorem
-- provers.
------------------------------------------------------------------------------

{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE UnicodeSyntax #-}

module Main ( main )
where

------------------------------------------------------------------------------
-- Haskell imports

import Control.Monad        ( unless )
import Control.Monad.Error  ( MonadError(catchError, throwError) )
import Control.Monad.Reader ( MonadReader(ask) )
import Control.Monad.Trans  ( MonadIO(liftIO) )

import qualified Data.HashMap.Strict as HashMap ( unions )

import System.Exit ( exitFailure, exitSuccess )
import System.IO   ( hPrint, stderr )

------------------------------------------------------------------------------
-- Agda library imports

import Agda.TypeChecking.Monad.Base
  ( Definitions
  , Interface(iPragmaOptions, iSignature)
  , Signature(sigDefinitions)
  )

import Agda.Utils.Impossible ( catchImpossible )

------------------------------------------------------------------------------
-- Local imports
<commit_msg>Added doc.<commit_after>------------------------------------------------------------------------------
-- |
-- Module      : Main
-- Copyright   : (c) <NAME> 2009-2013
-- License     : See the file LICENSE.
--
-- Maintainer  : <NAME> <<EMAIL>>
-- Stability   : experimental
--
-- apia: A program for proving first-order theorems written in the
-- dependently typed language Agda using first-order automatic theorem
-- provers.
------------------------------------------------------------------------------

{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE UnicodeSyntax #-}

module Main
  ( main  -- Required by Haddock.
  )
where

------------------------------------------------------------------------------
-- Haskell imports

import Control.Monad        ( unless )
import Control.Monad.Error  ( MonadError(catchError, throwError) )
import Control.Monad.Reader ( MonadReader(ask) )
import Control.Monad.Trans  ( MonadIO(liftIO) )

import qualified Data.HashMap.Strict as HashMap ( unions )

import System.Exit ( exitFailure, exitSuccess )
import System.IO   ( hPrint, stderr )

------------------------------------------------------------------------------
-- Agda library imports

import Agda.TypeChecking.Monad.Base
  ( Definitions
  , Interface(iPragmaOptions, iSignature)
  , Signature(sigDefinitions)
  )

import Agda.Utils.Impossible ( catchImpossible )

------------------------------------------------------------------------------
-- Local imports

{'fraction_non_alphanumeric': 0.35127674258109043, 'fraction_numerical': 0.005521048999309869, 'mean_word_length': 1.2989690721649485, 'pattern_counts': {'":': 0, '<': 11, '<?xml version=': 0, '>': 11, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3247444', 'n_tokens_mistral': 708, 'n_tokens_neox': 671, 'n_words': 178}