Pet3ris

arrowmania

A copy and improvement (with appropriate Unicode characters inserted) of a deleted Project Fortress (programming language) wiki entry describing conventions for converting unicode arrows to valid ASCII operators.

The document was originally created by members of the Project Fortress community, I am only copying it here as it might be of interest for other programmers.

Pet3ris

(ns app.main
  (:require [clj-http.client :as client]))

(:body (client/post "http://api.pgconsulting.se/Lgf/HcpList.aspx"
                    {:query-string
"__EVENTTARGET=pagerTop%24ctl01%24ctl01&__VIEWSTATE=%2FwEPDwUJMjUxNzIwMTU4ZBgDBQtwYWdlckJvdHRvbQ8UKwAEZGQCZALLBGQFCWx2UGxheWVycw8UKwAOZGRkZAUIUGxheWVySWRkZDwrAGQAAssEZGRkZgJkZAUIcGFnZXJUb3APFCsABGRkAmQCywRkqC8J3cgNWv4zyxO8CIdJjnTs5bnf8y3HEJ584oWXkuM%3D&__EVENTVALIDATION=%2FwEWHQKl4aiPCAK1rL%2FwCQKlw5WeBQK6w5WeBQK7w5WeBQK8td%2BsDwKqrNeNDAKqrJPMCwLHzJCiBALHzNSQCgLHzOjrAgLHzKzaCALHzMC1AQLHzJDKCwLHzKSlBALwzIqDBQLvzIqDBQLuzIqDBQLyzIqDBQL1zIqDBQL0zIqDBQLzzIqDBQLZ%2FrmpAQKIw%2BDpAgKjrP7%2BDAKqupPpDwLFo7H%2BCQLZlpyUBwL0%2F7mpAVQBXtWtanOjitkIqvhLDBWDDcdkqHZ6BIpx%2F%2BNSj96e"
}))

Pet3ris

import re

content = open('./Desktop/meetup list.htm', 'r').read()

members = re.findall('<tr id="mem.*?</tr>', content, re.DOTALL)

people = []

count = 0
for member in members:

Pet3ris

;                    Quick miniKanren-like code 
;
; written at the meeting of a Functional Programming Group
; (Toukyou/Shibuya, Apr 29, 2006), as a quick illustration of logic
; programming.  The code is really quite trivial and unsophisticated:
; it was written without any preparation whatsoever. The present file
; adds comments and makes minor adjustments.
;
; $Id: sokuza-kanren.scm,v 1.1 2006/05/10 23:12:41 oleg Exp oleg $

Pet3ris

(ns fsm
  (:refer-clojure :exclude [==])
  (:use [clojure.core.logic]))

;; Encoding a Finite State Machine and recognizing strings in its language in Clojure core.logic

;; We will encode the following FSM:
;;
;;  (ok) --+---b---> (fail) 
;;   ^     |

Pet3ris

(ns fsmparse
  (:refer-clojure :exclude [==])
  (:use [clojure.core.logic]))

;; We will encode a state machine that accepts lists containing '(w h y) as a sublist
;; Moreover, instead of a recognizer, we will implement a parser, that returns a list
;; of visited states in order
;;
;;     +----#-----+----#-----+            +--?--+
;;     v          |          |            v     |

Pet3ris

(ns fst
  (:refer-clojure :exclude [==])
  (:use [clojure.core.logic]))

;; A finite state transducer is essentially a translator between
;; two tapes of symbols. It is normally a translator from an input
;; tape to an output tape, but since we are using core.logic,
;; we hope to relax this restriction :).

;; The main idea is that every transition accepts two symbols

Pet3ris

import Data.Monoid

chain :: (Ord a) => [a] -> [a] -> Ordering
chain xs = mconcat . (zipWith compare xs)

chain [1, 2, 3] [1, 2, -1]
-- GT

chain [1, 2, 3] [1, 2, 3]
-- EQ

Pet3ris

Miles Sabin implemented a nice selection sort example in Scala's type system. See:

http://www.chuusai.com/2012/01/27/type-level-sorting-in-shapeless/

To get a better understanding how that works I ported the algorithm to Prolog.

selectleast([H|T], TM, [H|TRem]):-
    selectleast(T, TM, TRem), TM < H.

selectleast([H|T], H, T).

Pet3ris

% Two dices are thrown and the results added up.
% We sample when the sum is conditioned on the first dice landing on 2.

output(S) :-
  randvar(a, dice(X), X),
  dice(Y),
  S is X + Y.

dice(X) :-
  X is random(6) + 1.