Simula 67 had two notations for assignment, namely, := for value assignment of basic types and :- for reference assignment of user-defined types.
deviantART’s CSS isn’t loading properly for some people is because one of your CSS files has f*** in a stylesheet comment
Type constructor plus lifting function (fmap)
[[Fn+1 Fn] [Fn Fn-1]] = [[1 1][1 0]]^n
the language has been designed to be easy to analyze and can be parsed without a symbol table. This makes it much easier to build tools such as debuggers, dependency analyzers, automated documentation extractors, IDE plug-ins, and so on. C and its descendants are notoriously difficult in this regard.
There are two reasons for having no warnings. First, if it’s worth complaining about, it’s worth fixing in the code. (And if it’s not worth fixing, it’s not worth mentioning.) Second, having the compiler generate warnings encourages the implementation to warn about weak cases that can make compilation noisy, masking real errors that should be fixed.
If you convert a recursive function to fixed-point with a Y-combinator, you can then add memoization to the combinator.
At it’s core, the lambda calculus contains only: variable references, single-argument anonymous functions and function calls.
Categorical input can be turned into numeric input as before and categorical output can be modeled as multiple binary output.
The strength of SVM is it can handle large number of dimensions. With the kernel function, it can handle non-linear relationship as well.