adept

module Main where

import Control.Applicative
import System.Environment
import Control.Monad
import qualified Data.ByteString.Lazy as BSL

import Data.Bits
import Data.Binary.Get
import Data.Binary.Bits.Get as Bits

adept

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

const int infinity = 2147483647;

struct edge_t {
    int v1;
    int v2;
    int cost;

adept

First transaction will parse, second will not:
```
cat every-month.journal                                                                                                                                ~/devel/haskell/darcs-get/hledger/examples
~ aug to sep
    assets
    expenses    $1

~ Aug to Sep
    assets

adept

year-test.journal:
```
2015/02/01 first half
    expenses  $1
    assets

2015/07/01 second half
    expenses  $2
    assets

adept

{-# LANGUAGE DeriveDataTypeable #-}

-- | Decimal numbers are represented as @m*10^(-e)@ where
-- @m@ and @e@ are integers.  The exponent @e@ is an unsigned Word8.  Hence
-- the smallest value that can be represented is @10^-255@.
-- 
-- Unary arithmetic results have the exponent of the argument.  
-- Addition and subtraction results have an exponent equal to the 
-- maximum of the exponents of the arguments. Other operators have
-- exponents sufficient to show the exact result, up to a limit of

adept

[127] adept@dimail> ./Shake all                                                                                                                                                   ~/devel/haskell/darcs-get/hledger
stack ghc tools/pandoc-drop-web-blocks
[1 of 1] Compiling Main             ( tools/pandoc-drop-web-blocks.hs, tools/pandoc-drop-web-blocks.o )

tools/pandoc-drop-web-blocks.hs:4:1: error:
    Could not find module ‘Text.Pandoc.Builder’
    Use -v to see a list of the files searched for.
  |
4 | import Text.Pandoc.Builder
  | ^^^^^^^^^^^^^^^^^^^^^^^^^^

adept

{-
            Lecture 1 on cubicaltt (Cubical Type Theory)
--------------------------------------------------------------------------
                        Anders Mörtberg

This is the first lecture in a series of hands-on lectures about
cubicaltt given at Inria Sophia Antipolis.

To try the system clone the github repository and follow the
compilation instructions at:

adept

module andsym where

Path (A : U) (a b : A) : U = PathP (<_> A) a b

data bool = true | false

and (x:bool) : bool -> bool = split
  true -> x
  false -> false

adept

module eveneven where

Path (A : U) (a b : A) : U = PathP (<_> A) a b

data bool = true | false

data nat = zero
         | suc (n : nat)

add (m : nat) : nat -> nat = split

adept

2019-01-01 init
  equity:opening balances
  assets:bank   $100