Skip to content

Instantly share code, notes, and snippets.

View bikallem's full-sized avatar
🎯
Focusing

Bikal Gurung bikallem

🎯
Focusing
57 followers · 31 following
View GitHub Profile
@bikallem
bikallem / opt_bench.ml
Last active January 30, 2024 13:54
int_of_string_opt perf
open Bechamel
open Toolkit
let opt_int0 =
Test.make ~name:"(opaque/prim/Some)" (Staged.stage @@ fun () ->
Sys.opaque_identity @@ int_of_string_opt "123")
let opt_int1 =
Test.make ~name:"(opaque/prim/None)" (Staged.stage @@ fun () ->
Sys.opaque_identity @@ int_of_string_opt "123aa")
@bikallem
bikallem / gen.ml
Last active February 10, 2022 10:34
Effects Generator
type 'a tt = Leaf | Node of 'a tt * 'a * 'a tt
let leaf = Leaf
let node l x r = Node (l, x, r)
let rec deep = function
| 0 -> Leaf
| n ->
let t = deep (n - 1) in
Node (t, n, t)
@bikallem
bikallem / lsp.log
Created December 16, 2021 14:20
[START][2021-12-16 10:13:34] LSP logging initiated
[START][2021-12-16 10:19:07] LSP logging initiated
[START][2021-12-16 10:22:07] LSP logging initiated
[START][2021-12-16 10:29:22] LSP logging initiated
[START][2021-12-16 14:02:31] LSP logging initiated
[START][2021-12-16 14:02:59] LSP logging initiated
[START][2021-12-16 14:03:42] LSP logging initiated
[START][2021-12-16 14:05:21] LSP logging initiated
[START][2021-12-16 14:09:34] LSP logging initiated
[START][2021-12-16 14:13:31] LSP logging initiated
@bikallem
bikallem / recover_type.ml
Last active May 2, 2021 17:28
experiments with gadt equality and using it to recover types from opaque gadt type
module Eq = struct
type (_, _) t = Eq : ('a, 'a) t
end
type _ tid = ..
type _ tid += Int : int tid | Float : float tid | Bool : bool tid
type _ key =
| K :
@bikallem
bikallem / gadt.ml
Created April 21, 2021 11:31
gadt list to function
module Params = struct
type _ t =
| [] : 'a t
| ( :: ) : 'a * 'b t -> ('a -> 'b) t
let c = [ "s"; 1; 2.3; true ]
let parse l =
let parse_int s =
try Some (int_of_string s) with
@bikallem
bikallem / gist:c542cef3d75cda88b47569a4db961635
Created February 13, 2020 21:20
Promise/fetch
https://github.com/nathanWilson81/reason-image-grid/blob/master/src/Utils.re
@bikallem
bikallem / gist:165e22db551f8c7d047eba4c708ea8f3
Created January 8, 2020 18:26
Fetch, decode example
https://github.com/SVdotCO/pupilfirst/blob/110b1ce95c60e246db2d0214f5d79841eec59ca7/app/javascript/coaches/dashboard/components/EvaluationForm.re#L59
@bikallem
bikallem / convert_to_reason.sh
Created December 27, 2019 15:14
#!/usr/bin/env bash
set -e
# Converts .ml to .re
ls -A *ml* | while read file; do
if [[ "$file" =~ (\.ml|\.mli)$ ]]; then
# Convert from OCaml to ReasonML
newfile=$(echo $file | sed 's/\.ml/\.re/' | python -c "print raw_input().capitalize()")
echo "Converting $file to $newfile"
@bikallem
bikallem / pcode.c
Created November 7, 2019 10:33 — forked from lpsantil/pcode.c
pcode interpreter
/*
P-code for PL/0 machine
[ref] https://en.wikipedia.org/wiki/P-code_machine
[ref] http://blackmesatech.com/2011/12/pl0/pl0.xhtml
The PL/0 virtual machine was originally specified by Nicklaus Wirth in his book
Algorithms + Data Structures = Programs; it's used as the target machine for a
PL/0 compiler.
@bikallem
bikallem / finalTagless.ml
Created October 25, 2019 09:20 — forked from lambdahands/finalTagless.ml
Final Tagless in OCaml
(*
* An OCaml implementation of final tagless, inspired from this article by Oleksandr Manzyuk:
* https://oleksandrmanzyuk.wordpress.com/2014/06/18/from-object-algebras-to-finally-tagless-interpreters-2/
*)
module FinalTagless = struct
type eval = { eval : int }
type view = { view : string }
module type ExpT = sig