- Advanced Functional Programming at Chalmers Insititute: http://www.cse.chalmers.se/edu/course/DIT260/lec.html
- Lock-free Datastructures in Haskell with STM: http://research.microsoft.com/en-us/um/people/simonpj/papers/stm/lock-free-flops06.pdf
- Articles on finger trees and the like: http://apfelmus.nfshost.com/articles/monoid-fingertree.html
I hereby claim:
- I am narendraj9 on github.
- I am narendraj9 (https://keybase.io/narendraj9) on keybase.
- I have a public key whose fingerprint is 71A7 1600 E6F7 6477 E369 6424 9116 6D6D B96A F7EB
To claim this, I am signing this object:
##Reactive System Design Links
#Articles and Papers
- The Reactive Manifesto: http://www.reactivemanifesto.org/
- https://en.wikipedia.org/wiki/Reactive_programming
- https://en.wikipedia.org/wiki/Functional_reactive_programming
- Design Methods for Reactive Systems book slides: http://booksite.elsevier.com/9781558607552/slides/slides.pdf
- Programming without a callstack Event Driven Architectures By G Hohpe: http://www.eaipatterns.com/docs/EDA.pdf
- On Distributed Memory Systems: http://blog.paralleluniverse.co/2012/07/10/on-distributed-memory/
- Disruptor source code, papers and articles: https://lmax-exchange.github.io/disruptor/
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;;; org-macro.el --- Macro Replacement Code for Org -*- lexical-binding: t; -*- | |
;; Copyright (C) 2013-2017 Free Software Foundation, Inc. | |
;; Author: Nicolas Goaziou <n.goaziou@gmail.com> | |
;; Keywords: outlines, hypermedia, calendar, wp | |
;; This file is part of GNU Emacs. | |
;; GNU Emacs is free software: you can redistribute it and/or modify |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(defun jump-to-comment () | |
(interactive) | |
(require 'face-remap) | |
(search-forward-regexp "^;; \\([-+[:digit:]]+\\)") | |
(let ((text-scale-mode-amount (string-to-number (match-string 1)))) | |
(text-scale-mode +1))) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;;; -- Magit blame swiper results | |
(require 'magit-blame) | |
;;; -- Magit blame swiper results | |
(require 'dash) | |
(defun magit-blame--current-committer () | |
(when (and (boundp 'magit-blame-read-only-mode) | |
magit-blame-read-only-mode) | |
(->> (overlays-at (point)) | |
(-keep (lambda (ov) | |
(when (and (= (line-beginning-position) (overlay-start ov))) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(require 'treepy) | |
(require 'parseclj) | |
(defun let-binding-point* (root s-value s-position) | |
"Return position for let binding in `ROOT' for `S-VALUE' at `S-POSITION'." | |
(let ((current-zipper (treepy-zipper (lambda (n) (assoc-default :children n)) | |
(lambda (n) (assoc-default :children n)) | |
(lambda (n children) (cons (cons :children children) n)) | |
root))) | |
(while (and (not (treepy-end-p current-zipper)) |
OlderNewer