Extensible Web を支える低レベル API 群 - Block Rockin’ Codes
Intro 最近 Extensible Web の話がたまに出るようになりましたが、なんというかレイヤの高い概念(ポエム)的な話が多い気がしてます。 もう少し具体的な API とか、「それコード書く上で何が変わるの？」って話があまりないので、今日はそこにフォーカスして、 Extensible Web 的な流れの中で整理された API の話をします。 しかし、実際には API が 「Extensible Web という理念で生まれたかどうか」は自明ではないので、 今標準化されている低レベルな API を拾い、それを整理するというエントリだと思ってもらと良いかもしれません。 あまり知られてない API もあると思うので、これを期に「これがあれば、今までできなかったアレが、標準化や実装を待たなくても、できるようになるな」と思ったら是非書いてみると良いと思います。 実際はそれこそが Extensi
論理学の考え方でつくられた、LLプログラミング言語 obake - Qiita
論理学の考え方で、 関数型プログラミング言語の定義＆実装の仕方の例に触発されて、 深夜アニメを見ながら OCamlでつくられた、 脱関数型プログラミング言語 obake (おばけ)を紹介します。 関数型言語とかは前世紀に置いていって、21世紀は論理学を基にした新しいプログラミングパラダイムで脱関数型言語しましょう！ break world 「Hello, world!」を書こうと思ったのですが、あまりに難しいので最初はすぐ停止するプログラムです。プログラムは「命令」からできていて、命令は２つの要素、「値」と「計算」の組み合わせです。 「命令」 = 「値」 + 「計算」 breakは組み込み「計算」になります。これだけでは「命令」にはならないので、プログラム起動時に自動的に「現実世界」という「値」が設定されて、「命令」が作られます。値を組み合わせることによって
Big Sky :: IDE としての Vim
この文章は、http://yannesposito.com/Scratch/en/blog/Vim-as-IDE/ で掲載されている「Vim as IDE」の翻訳文です。 文内の全てはの筆者による物であり、訳文の内容については私による物となります。意訳が若干入っています。間違い等あればご連絡下さい。 Vim as IDE tl;dr: 如何に Vim を効率の良い IDE として使いこなすか Learn Vim Progressively (訳者注: 日本語訳)では Vim が如何にテキスト編集に優れ、かつファイルを操縦できる偉大なテキストエディタであるかについて示した。この短い記事では、私が如何にして Vim を IDE として使っているかについて見る事が出来るだろう。そう、主に幾つかの素晴らしいプラグインを使う事により。 1. Vim Plugin Manager Vim のプラグイン
Nim · How I Start.
Nim is a young and exciting imperative programming language that is nearing its 1.0 release. My main motivation for using Nim is its performance / productivity ratio and the joy of programming in Nim. In this guide I’m going to show you how I start a Nim project. For this purpose we will write a small interpreter for the brainfuck language. While Nim is a practical language with many interesting f
60fps on the mobile web — Flipboard Engineering
Flipboard launched during the dawn of the smartphone and tablet as a mobile-first experience, allowing us to rethink content layout principles from the web for a more elegant user experience on a variety of touchscreen form factors. Now we’re coming full circle and bringing Flipboard to the web. Much of what we do at Flipboard has value independent of what device it’s consumed on: curating the bes
prelude710 · Wiki · Glasgow Haskell Compiler / GHC · GitLab
The Glorious Glasgow Haskell Compiler.
An algorithm to extract looping GIFs from videos - __del__( self )
Yet another big problem of the Internet era tackled by Mathematics. Looping GIFs are a very popular form of art on the Web, with two dedicated forums on Reddit (r/perfectloops and r/cinemagraphs) and countless Tumblr pages. Finding and extracting well-looping segments from a movie requires much attention and patience, and will likely leave you like this in front of your computer: To make things ea
Monads: From Web 2.0 to Hardware Drivers
Monads are often considered to be a stumbling block for learning Haskell. Somehow they are thought of as scary and hard to understand. They are however nothing more than a design pattern, and a rather simple one at that. Monads give us a standardized way to glue a particular kind of computations together, passing the result of each computation to the next. As such they are useful well beyond funct
Compiling Julia for NVIDIA GPUs · maleadt
Compiling Julia for NVIDIA GPUs Jan 15, 2015 #julia For the few last months, I have been working on CUDA support for the Julia language. It is now possible to write kernels in Julia and without much hassle execute them on a NVIDIA GPU, but there are still many limitations. Note from 2018: Much has happened since 2015, and as a result this blog post has become pretty stale. Check-out CUDAnative.jl
Refactoring with Equational Reasoning
Summary: Haskell is great for refactoring, thanks to being able to reason about and transform programs with confidence. I think one of Haskell's strengths as a practical language is that it's easy to refactor, and more importantly, easy to refactor safety. Programs in the real world often accumulate technical debt - code that is shaped more by its history than its current purpose. Refactoring is o
Nibbler
Conway’s game of Life may be mathematically interesting, but it is not what most people would consider a real game. So let’s take a look at another product of the 70’s, the arcade game Snake. This post walks through a complete, compile time implementation of a Snake game using C++ template metaprogramming. We’ll start by implementing a basic list and grid, before moving on to encode the game rules
Text Understanding from Scratch
This article demontrates that we can apply deep learning to text understanding from character-level inputs all the way up to abstract text concepts, using temporal convolutional networks (ConvNets). We apply ConvNets to various large-scale datasets, including ontology classification, sentiment analysis, and text categorization. We show that temporal ConvNets can achieve astonishing performance wit
Repl Electric - Composer, Performance artist
>Performances Writing computer code live to an audience to create music and visuals. >Music >Live Upcoming Live performances: Previous performances: Uk, Bristol, (Red Lion) - 1st March 2019 Sweden, Stockholm (KTH Royal Institute of Technology) - MTF 3rd-9th Sept 2018 Uk, Bath, Bath Digital Festival 23rd-27th Oct 2018 Uk, Cheltenham, Festival of Science, 5th-10th June 2018 Hungary, Budapest, A66 /
Filling Haskell's Type Holes Like It's Agda
Kirstin Rhys gives a live coding demo of interactively building Haskell functions by filling type holes. This allows her to write abstract things which would be quite a challenge for the unaided mind. Interactive type holes are used in provers like Agda and Idris and are now supported by GHC 7.8. Summary First a demo in Agda to show how that system feels Building the filter function as a warm-up N
statusfailed - The Obfuscated Fibonacci; or, a Curious Connection in Computation
I want to share with you a implementation of the fibonacci sequence in Haskell: The remainder of this post is an explanation of this code (and some neat extras). If you want to treat it as a puzzle and figure out why it works, you should treat the rest of this post as a spoiler. Let’s start at the beginning. The Beginning First, a word of warning: This blog post has no practical use whatsoever. It
A Brief Overview of Deep Learning
(This is a guest post by Ilya Sutskever on the intuition behind deep learning as well as some very useful practical advice. Many thanks to Ilya for such a heroic effort!) Deep Learning is really popular these days. Big and small companies are getting into it and making money off it. It’s hot. There is some substance to the hype, too: large deep neural networks achieve the best results on speech re
Syntex: Syntax Extensions for Rust 1.0 - Chasing Rabbits
I use and love syntax extensions, and I’m planning on using them to simplify down how one interacts with a system like serde. Unfortunately though, to write them you need to use Rust’s libsyntax, which is not going to be exposed in Rust 1.0 because we’re not ready to stablize it’s API. That would really hamper future development of the compiler. It would be so nice though, writing this for every t
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
https://qiita.com/minpou/items/a0426cfadf8507cc0c0c
Quantitative Economics with Julia
Typed embedding of STLC into Haskell (5 February 2015)
Elasticsearch: The Definitive Guide [2.x] | Elastic![Elasticsearch: The Definitive Guide [2.x] | Elastic](https://cdn-ak-scissors.b.st-hatena.com/image/square/cbbc87b803e58787f8346841e5b65698d408f3c5/height=288;version=1;width=512/https%3A%2F%2Fwww.elastic.co%2Fstatic%2Fimages%2Felastic-logo-200.png){kind=logo}
DmitriyP
http://www.cl.cam.ac.uk/~ms705/pub/papers/2015-osr-raft.pdf
Reddit - Dive into anything
CS231n Convolutional Neural Networks for Visual Recognition
Effectful, Recursive, Real-World Autos: Intro to Machine/Auto Part 3
Reddit - Dive into anything
http://page.mi.fu-berlin.de/kashif/algorithm/2014/10/17/morris-algorithm.html
Compose Conference 2015
Welcome to nginx!
Duck Typing in Piston · Piston