【初音ミク】二人のロボットダンス【オリジナル】
ミクさん！お誕生日！おめでとう！ございます！それと次回からまた歌を歌ってください。ｗ→（め∇め）Music：モデ (mylist/7326788) (＠modeeisennui)Illust：nona (http://www.pixiv.net/member.php?id=2054213) (@nonalactone)Mix：よこすけこの曲はフルアルバム「modee is ennui」に収録されています。https://modeeisennui.booth.pm/items/822696sm26663950←前 次→sm27217635※広告出してくださった皆様、ありがとうございますm(_ _)m
Scalable Bayesian Optimization Using Deep Neural Networks
Bayesian optimization is an effective methodology for the global optimization of functions with expensive evaluations. It relies on querying a distribution over functions defined by a relatively cheap surrogate model. An accurate model for this distribution over functions is critical to the effectiveness of the approach, and is typically fit using Gaussian processes (GPs). However, since GPs scale
Character-Aware Neural Language Models
We describe a simple neural language model that relies only on character-level inputs. Predictions are still made at the word-level. Our model employs a convolutional neural network (CNN) and a highway network over characters, whose output is given to a long short-term memory (LSTM) recurrent neural network language model (RNN-LM). On the English Penn Treebank the model is on par with the existing
MonadFix example: compiling regular expressions
{-# LANGUAGE RecursiveDo, BangPatterns #-} import Control.Applicative import Data.Function (fix) import Data.IntMap as IntMap import Control.Monad.Fix (mfix) import Control.Monad.Trans.State import Control.Monad.Trans.Class (lift) import Text.Read (readMaybe) MonadFix is an odd beast; many Haskell programmers will never use it in their careers. It is indeed very rarely that one needs MonadFix; and
Hole-Driven Development in Haskell by Raichoo at EnthusiastiCon
Original talk title: “There is a hole in the program, dear Liza, dear Liza - “Hole-Driven Development in Haskell” Working with Haskell is more like playing Lego said Raichoo and tries to narrow down a complicated topic passionately in this talk. About Source Code Berlin: Berlin has become a magnet for new ideas. Source Code Berlin looks into creativity and innovation in fields related to open s
An Optimizing Compiler for a Purely Functional Web-Application Language
An Optimizing Compiler for a Purely Functional Web-Application Language Adam Chlipala. An Optimizing Compiler for a Purely Functional Web-Application Language. Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (ICFP'15). August 2015. Paper as PDF High-level scripting languages have become tremendously popular for development of dynamic Web applications. Many pr
State of the Haskell ecosystem - August 2015
Note: This went out as a RFC draft a few weeks ago, which is now a live wiki. See the Conclusions section at the end for more details. In this post I will describe the current state of the Haskell ecosystem to the best of my knowledge and its suitability for various programming domains and tasks. The purpose of this post is to discuss both the good and the bad by advertising where Haskell shines w
Designing a GC in Rust - In Pursuit of Laziness
For a while I’ve been working on a garbage collector for Rust with Nika Layzell. I thought this would be a good time to talk of our design and progress so far. Motivation “Wait”, you ask, “why does Rust need a garbage collector”? Rust is supposed to work without a GC, that’s one of its main selling points! True. Rust does work pretty well without a GC. It’s managed to do without one so far, and we
Breakout in Assembly
Technical details follow, and while I've tried my best to make it interesting and accessible I know that some of you just want to play the game. Here is a link to do just that. Consolite (coming from "console lite") is the name I've given to my recent project of making a tiny hobbyist game console and associated toolchain. My end goal is to write a custom microprocessor and video controller that I
Parser Combinator Experiments in Rust - Part 2: Error handling · m4rw3r
1: Uses the exact same parser-code as the Attoparsec benchmark. The difference of not having to allocate any Vec<u8> instances is quite huge which can clearly be seen in the performance of Combine-pre vs Combine-beta. In addition to this Combine-pre has much better support for parsing &[u8] which reduces the noise in the parser greatly. The above test is still using the code from the previous blog
Power Assert を Rust で作ってみた - gifnksmの雑多なメモ
素敵な表示をしてくれるassertionライブラリ、Power Assert を Rust でも実現してみました！！！ Assertion failure 時にこんな感じに分かりやすくメッセージ出力してくれます。使い方は GitHub参照ください。 $ cargo run --example test[master] Compiling power-assert v0.1.0 (file:///home/nksm/repos/gifnksm/power-assert-rs) Running `target/debug/examples/test` power_assert!(bar.val == bar.foo.val) | | | | | | | 3 | | | 2 | | | Foo { val: 2 } | | Bar { val: 3, foo: Foo { val: 2 } }
Eco - A tool for Rust ecosystems · Piston
Eco is a new tool to help out with breaking changes in Rust ecosystems. It reads from a JSON format where you list a bunch of Cargo.toml urls, and the outputs another JSON file with the dependency graph and versions. The dependency graph can then be given as input to another algorithm that runs an analysis and outputs a JSON file with the update actions in recommended order for the entire ecosyste
Moving from Multiparameter Type Classes and Functional Dependencies to Type Families in Haskell
In my first post on the bitx-bitcoin library I mentioned how I solved one particular problem with the help of MultiParamTypeClasses and FunctionalDependencies. Well, as it just so turns out, apparently that wasn’t necessarily the best way to do it. Recap: What was I trying to solve Imagine the following polymorphic function: foo :: (A a, B b) => a -> b foo = ... That is, a is an instance of the ty
A Haskell Time Library Tutorial
The time library is a common source of confusion for new Haskell users, I've noticed. With no disrespect to the authors intended, I feel like the existing tutorials don't do a very good job of conveying the essence of the library so I'm going to give it a shot myself. Cheat Sheet Here's a cheat sheet with the important functions I mention in this tutorial. There are others, but some of them I acti
New in-depth guide to stack - FP Complete
The stack build tool is a cross-platform program for developing Haskell projects. It is aimed at Haskellers both new and experienced. I recently put together an in-depth guide to using stack for Haskell development. EDIT The content below is now significantly outdated. We strongly recommend reading the guide on the Stack website. The official home for this document is in the stack repository. Belo
Applicatives in Math vs Code
Matt DeLand contrasts the mathematical and software ways of thinking about applicative functors. Coding in Haskell and reasoning in category theory are two routes that lead to the same concept, and Matt shows how someone in either discipline would arrive at applicatives. He provides examples of applicative functors and – interestingly – a counterexample. Summary Haskell as category theory The cate
GitHub のアレコレを補完する github-complete.vim をつくりました - はやくプログラムになりたい
GitHub のユーザ名やリポジトリ名，絵文字，リンクURLを GitHub API を使って補完する github-complete.vim をつくりました． https://github.com/rhysd/github-complete.vim Vim では Markdown 編集中のオムニ補完は HTML のものになっていて使わないので，どうせなら GitHub のアレコレが補完できれば便利だなと思ってつくってみました． 5カ月前ぐらいに8割方できていたんですが，最後のリンク URL 補完を完成させずに放置してしまっていたので，yokohama.vim #6 で完成させました．使えるのは下記の5種類の補完です． 絵文字補完 ユーザ名補完 リポジトリ名補完 issue 番号補完 リンクURL補完 markdown および gitcommit ファイルタイプでのオムニ補完として実装され
Recursive types and folds | F# for fun and profit
In this series, we’ll look at recursive types and how to use them, and on the way, we’ll look at catamorphisms, tail recursion, the difference between left and right folds, and more. 1. Introduction to recursive types Don't fear the catamorphism... 2. Catamorphism examples Applying the rules to other domains 3. Introducing Folds Threading state through a recursive data structure 4. Understanding F
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Horváth Balázs
森の最奥にて
The Haxe Ludum Dare 33 Roundup | Haxe.io
Wrangling Generators for Subobjects | The n-Category Café
GitHub - kaishengtai/neuralart: An implementation of the paper 'A Neural Algorithm of Artistic Style'.
Ulam's Spiral in J
Michael Bernstein on Propositions as Types | Papers We Love
Procedural Dungeon Generation #2 · Issue #7 · a327ex/blog
Calculus on Computational Graphs: Backpropagation -- colah's blog
Idris 0.9.19 released | Idris
Episode 5: Bob Constable on CTT and Nuprl
http://www.cs.ox.ac.uk/projects/utgp/school/andres.pdf
Getting Rating A from the SSL Server Test
GitHub - Vinatorul/minesweeper-rs: Simple minesweeper in Rust
Volumes | United Nations Educational, Scientific and Cultural Organization