Heimdell

{-# LANGUAGE TemplateHaskell #-}

import Data.Lens.Template

import qualified Data.Map as Map
import           Data.Map   (Map)

import System.Random

import StatefulLens

Heimdell

*.out
*.a

Heimdell

#pragma once

#include <cmath>

#include <iostream>

using namespace std;

static constexpr int pow(int x, int n) {

Heimdell

module Behaviour where

import Prelude hiding (id, (.), head, tail, zip, unzip, map, repeat, cycle)

import Control.Applicative
import Control.Arrow
import Control.Category

import Data.Stream

Heimdell

{-# LANGUAGE Arrows, TypeOperators #-}

import Prelude hiding (id, (.))
import SF

-- this is the timer - returns length of the tick
ticks :: () :-> Double
ticks = constant 1

-- Modelling the physics. 

Heimdell

{-# LANGUAGE 
        TemplateHaskell, 
        Arrows 
  #-}

module Thing where

import Prelude hiding (id, (.))

import Control.Arrow

Heimdell

{-# LANGUAGE RankNTypes #-}

type List a = 
    forall b. 
        (a -> b -> b) -> (b -> b)

nil :: List a
nil _ a = a

infixr 5 ><

Heimdell

module AST where

data AST
    = [Name] :=> AST
    |  Name  :?  AST
    | App  [AST]
    | Atom  String
    | Const Integer
    | Force AST

Heimdell

:- use_module(library(lists)).

construct(Fields, Record)
    :- Record =.. [record | Fields]
    .

% synonym
%
make --> construct.
build --> destruct.

Heimdell

import Control.Applicative

import Control.Monad.Reader
import Control.Monad.State
import Control.Monad.Error

import Text.Printf

data Step