/explore
|
You are here 
|
loup-vaillant.fr | ||
| | | | |
dr-knz.net
|
|
| | | | | This post follows up on OCaml for Haskellers from Edward Z. Yang (2010) and my own Haskell for OCaml programmers from earlier this year. Note The latest version of this document can be found online at https://dr-knz.net/rust-for-functional-programmers.html. Alternate formats: Source, PDF. Prologue Rust for C programmers ... | |
| | | | |
www.baturin.org
|
|
| | | | | [AI summary] This blog post tutorial explains advanced OCaml programming concepts including parametric polymorphism, higher-order functions like combinators and composition, and algebraic data types with pattern matching. | |
| | | | |
abstractexpr.com
|
|
| | | | | Structures allow us to combine several variables to create a new data type. Some other languages support the same concept but call it "records". If you come from object-oriented programming you can think about them as classes without methods. Declaration A structure is declared by the keyword struct followed by the name of the new... | |
| | | | |
qchu.wordpress.com
|
|
| | | In this post we'll describe the representation theory of theadditive group scheme$latex \mathbb{G}_a$ over a field $latex k$. The answer turns out to depend dramatically on whether or not $latex k$ has characteristic zero. Preliminaries over an arbitrary ring (All rings and algebras are commutative unless otherwise stated.) The additive group scheme $latex \mathbb{G}_a$ over... | ||
