Skip to content

Instantly share code, notes, and snippets.

View robstewart57's full-sized avatar

Rob Stewart robstewart57

View GitHub Profile
@robstewart57
robstewart57 / EffBench.hs
Created May 18, 2018 10:36
Applicative/Monad pure compilation issues
ffBench.hs:34:25:
Could not deduce (Applicative m) arising from a use of ‘pure’
from the context (Monad m)
bound by a type expected by the context:
Monad m => m s -> (s -> m ()) -> m b
at EffBench.hs:(33,20)-(34,34)
Possible fix:
add (Applicative m) to the context of
a type expected by the context:
Monad m => m s -> (s -> m ()) -> m b
ones : List Nat -> List Nat
ones = map (const 1)
f : (input:List Nat) -> (sum (ones input) = length input)
f input = case input of
[] => Refl
(x::xs) => ?hole
@robstewart57
robstewart57 / keras-1.2.2-mnist-weights.txt
Created May 14, 2019 18:04
Mnist output with Keras 1.2.2 and 2.2.4
Using Theano backend.
('X_train shape:', (60000, 1, 28, 28))
(60000, 'train samples')
(10000, 'test samples')
____________________________________________________________________________________________________
Layer (type) Output Shape Param # Connected to
====================================================================================================
convolution2d_1 (Convolution2D) (None, 32, 26, 26) 320 convolution2d_input_1[0][0]
____________________________________________________________________________________________________
activation_1 (Activation) (None, 32, 26, 26) 0 convolution2d_1[0][0]
@robstewart57
robstewart57 / RDF graph isomorphism in haskell
Created July 23, 2020 23:07
A Haskell function that computes if two RDF graph structures are identical. Uses functions from the rdf4h library and the Automorphism.isIsomorphic function from the hgal library
-- | Compares the structure of two graphs and returns 'True' if their
-- graph structures are identical. This does not consider the nature
-- of each node in the graph, i.e. the URI text of 'UNode' nodes,
-- the generated index of a blank node, or the values in literal
-- nodes. Unsafe because it assumes IRI resolution will succeed, may
-- throw an 'IRIResolutionException` exception.
isGraphIsomorphic :: (Rdf a, Rdf b) => RDF a -> RDF b -> Bool
isGraphIsomorphic g1 g2 = Automorphism.isIsomorphic g1' g2'
where
g1' = rdfGraphToDataGraph g1