| package cats | |
| package data | |
| import scala.annotation.tailrec | |
| sealed abstract class Continuation[O, +I] { | |
| def map[I2](fn: I => I2): Continuation[O, I2] = | |
| Continuation.Mapped(this, fn) | |
| def flatMap[I2](fn: I => Continuation[O, I2]): Continuation[O, I2] = |
Copyright © 2016-2018 Fantasyland Institute of Learning. All rights reserved.
A function is a mapping from one set, called a domain, to another set, called the codomain. A function associates every element in the domain with exactly one element in the codomain. In Scala, both domain and codomain are types.
val square : Int => Int = x => x * x
| # | |
| # Ethereum and eth-dev-tools: Debian 8 | |
| # | |
| # rev 9 | |
| # | |
| # started midsummer 2016-06-21 Andreas Krueger | |
| # https://github.com/drandreaskrueger | |
| # https://twitter.com/drandreaskruger | |
| # please contact me with improvements, thanks. | |
| # |
| """ | |
| Minimal character-level Vanilla RNN model. Written by Andrej Karpathy (@karpathy) | |
| BSD License | |
| """ | |
| import numpy as np | |
| # data I/O | |
| data = open('input.txt', 'r').read() # should be simple plain text file | |
| chars = list(set(data)) | |
| data_size, vocab_size = len(data), len(chars) |
| # Source: http://www.sysmic.org/dotclear/index.php?post/2010/03/24/Convert-keys-betweens-GnuPG%2C-OpenSsh-and-OpenSSL | |
| # OpenSSH private keys are directly understable by OpenSSL. You can test for example: | |
| openssl rsa -in ~/.ssh/id_rsa -text | |
| openssl dsa -in ~/.ssh/id_dsa -text | |
| # So, you can directly use it to create a certification request: | |
| openssl req -new -key ~/.ssh/id_dsa -out myid.csr | |
| # You can also use your ssh key to create a sef-signed certificate: |
| object Example { | |
| // Data types | |
| sealed trait Base { | |
| sealed trait Token | |
| } | |
| sealed trait PlainText extends Base { | |
| case class PlainText(text: String) extends Token |
| /* | |
| * Allows to set arbitrary speed for the serial device on Linux. | |
| * stty allows to set only predefined values: 9600, 19200, 38400, 57600, 115200, 230400, 460800. | |
| */ | |
| #include <stdio.h> | |
| #include <fcntl.h> | |
| #include <errno.h> | |
| #include <asm/termios.h> | |
| int main(int argc, char* argv[]) { |
We've already looked at two different indexed monads in our tour so far, so let's go for a third whose regular counterpart isn't as well known: the privilege monad.
The regular privilege monad allows you to express constraints on which operations a given component is allowed to perform. This lets the developers of seperate interacting components be statically assured that other components can't access their private state, and it gives you a compile-time guarantee that any code that doesn't have appropriate permissions cannot do things that would require those permissions. Unfortunately, you cannot easily, and sometimes cannot at all, build code in the privilege monad that gains or loses permissions as the code runs; in other words, you cannot (in general) raise or lower your own privilege level, not even when it really should be a
The indexed state monad is not the only indexed monad out there; it's not even the only useful one. In this tutorial, we will explore another indexed monad, this time one that encapsulates the full power of delimited continuations: the indexed continuation monad.
The relationship between the indexed and regular state monads holds true as well for the indexed and regular continuation monads, but while the indexed state monad allows us to keep a state while changing its type in a type-safe way, the indexed continuation monad allows us to manipulate delimited continuations while the return type of the continuation block changes arbitrarily. This, unlike the regular continuation monad, allows us the full power of delimited continuations in a dynamic language like Scheme while still remaining completely statically typed.