#Oleg thinks undelimited #continuations in #Scheme were a mistake!
on 02023-07-09@ccshan talks about how he and #Oleg invented #probabilistic-programming.
on 02016-05-02“How OCaml type checker works -- or what polymorphism and garbage collection have in common” aka “Efficient and insightful generalization” — #Oleg on how “There is more to #Hindley-Milner type inference than the Algorithm W” #paper #toread
on 02016-04-29#Oleg and Chung-Chieh Shan on “interpreting types as abstract values”. #Hindley-Milner #paper #pdf #toread. #ccshan
on 02016-04-29#Oleg and Chung-Chieh Shan came up with a new way of describing #Hindley-Milner type checking: as abstract interpretation with non-standard semantics, I think. #ccshan
on 02016-04-26#Oleg and Chung-Chieh Shan have built a #probabilistic-programming system as an embedded DSL in #OCaml, called "HANSEI". Holy shit, they did it in 2008. That’s at least five years ahead of the trend.
on 02015-09-18#PDF #paper "Rethinking Prolog", by #Oleg Kiselyov and Yukiyoshi Kameyama. Mentions #parser combinators “that use committed choice (maximal munch) and can still be run forwards and backward” that can’t be written in classical #Prolog. Based on #Hansei, a probabilistic programming system embedded in OCaml.
on 02015-09-18