Haskell is fascinating, but getting started can be a bit rough – especially if you are on Windows. Here are some necessary steps to get you over these initial stumbling blocks when running the Haskell Platform (2012.4 or 2014.2) on Windows. It is quite obvioius that a lot of the users of Haskell are on other platforms, and as a Windows-user you quickly run into some problems not experienced on oth
By Maxwell Hansen #lang racket (let ((the-dance last) (never rest)) (unless the-dance (is-a? 'funeral '()))) (defun the-end-of-programming () (let ((Penderall (author-of (the function most-general)))) (the function most-general) (not (neededp (any-other))) (equalp (the function most-general) (every possible-program in under 10 forms)) (let ((us (funcall (the function most-general))))))) (define (l
The Itch It started innocuously enough. It started with a tweet: Since some of you have asked, I love these wallpapers: simoncpage.co.uk/blog/— Craig Hockenberry (@chockenberry) February 14, 2013 I followed the link and Simon’s art made an immediate impression on me. In an instant, I knew how I might go about riffing on his designs. A long time ago, there was an app called NodeBox (and before that
One of the first things I do every morning is check the Twitter chatter about my website (@SecurityTube) . I was pleasantly surprised to see this: @whd Seems you stole h@x0r code from the internet... orig: goo.gl/VzY3QWHD: i49.tinypic.com/2vnrkw8.png#fail #lol #WhiteHouseDown — EvE Skunk (@eveskunk) April 6, 2013 I've embedded the image from the tweet: Source: http://oi49.tinypic.com/2vnrkw8.jpg I
Finally we see the agreement with our expectations. Iterative deepening now needs only 2MB (down from 56MB in the first try) to compute the first 100 Pythagorean triples. We may now try bigger searches. We have seen that lazy evaluation is a trade-off, which may be hurtful in some cases, in particular, in search problems over huge data structures, where it is often beneficial to recompute the resu
PREPRINT - DO NOT DISTRIBUTE Optimizing SYB Is Easy! Michael D. Adams Department of Computer Science, Portland State University http://michaeldadams.org/ Andrew Farmer Information and Telecommunication Technology Center, University of Kansas afarmer@ittc.ku.edu José Pedro Magalhães Department of Computer Science, University of Oxford jpm@cs.ox.ac.uk Abstract The most widely used generic-programmi
Hierarchy in Generic Programming Libraries José Pedro Magalhães1 and Andres Löh2 1 jpm@cs.ox.ac.uk. Department of Computer Science, University of Oxford 2 andres@well-typed.com. Well-Typed LLP Abstract. Generic programming (GP) is a form of abstraction in programming languages that serves to reduce code duplication by exploiting the regular struc- ture of algebraic datatypes. Several different
Slides from PyCon 2013! http://pycon.github.com/2013-slides/ has slides for: * Auth Is Hard, Let's Ride Bikes by Chris McDonough * Blame it on Caesar! by Lennart Regebro * Naming Ducks by Brandon Rhodes * Things to make writing tests easier by Chris Withers Problems? Contact [email protected] / @wolever
2022-06-25 IT Development 1892 Southern Street, New York 09:00AM-07:00PM Register Target audience: Marketing, advertising and PR specialists of development companies, product and project managers responsible for developing and bringing new services and information systems to market.Entrepreneurs who create promising it services and programs.Marketing managers of companies that have considered or a
はじめに ちょっと、高次元特徴空間での2つの文字列の像の内積である文字列カーネルで遊んでみる。 文字列カーネルを類似度として使いたい。遊びなので、数式はちゃんと追ってない、、、 文字列カーネル 文字列に対するカーネル カーネルKは、入力空間Xから特徴空間Fへの写像φについて、x,y∈Xに対してK(x,y)=<φ(x),φ(y)>を満たす関数のこと 2つの文字列の距離的なものを考えるのに、共通する部分列や部分文字列を考えたもの いろんな考え方ができるので、いろんなものが存在する 部分列と部分文字列の違い 部分列(Subsequence) 記号列に対して、「並び」だけを保持した部分的な記号列 「abcde」に対して、「abd」や「be」や「bcde」など 長さがkの部分列は「k-merの部分列」という 部分文字列(Substring) 記号列に対して、「隣接性」と「並び」を保持した部分的な記号
Conor McBride and Ross Paterson. in Journal of Functional Programming 18:1 (2008), pages 1-13. Abstract In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. Indeed, it is the ubiquity of this programming pattern that drew us to the abstraction. We retrace our steps in this pape
Simon Thompson ISBN 0-201-41667-0, Addison-Wesley, 1991. This is now out of print. I had hoped to prepare a revised version before making it available online, but sadly this hasn't happened. So, you can get the original version, warts and all, from CafePress or free from here. Any errata will be gratefully received and added to the list below. Preface (html) Contents and Introduction (PostScript)
This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. The book is intended to be a source of practical labwork material, to help make functional-language implementations `come alive’, by helping the reader to develop, modify and experiment with some non-trivial compilers. The unusual aspect of the book is that it is mea
README.md PLAYSCRIPT What is PlayScript? PlayScript is an open source Adobe ActionScript compatible compiler and Flash compatible runtime that runs in the Mono .NET environment, targeting mobile devices through the Xamarin Studio MonoTouch and Mono for Android platforms. With a combination of Adobe FlashBuilder for Web and Xamarin Studio for mobile complex large scale cross-mobile-web projects can
I am pleased to announce that Mini-issue 24 of The Monad Reader is now available. It is a “mini-issue” because it consists of one article: “Predicates, Trees and GADTs” by Benjamin Hodgson. Feel free to browse the source files. You can check out the entire repository using Git: git clone https://github.com/ezyang/tmr-issue24.git If you’d like to write something for The Monad Reader, please get in
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く