Bootstrap knowledge of LLMs ASAP. With a bias/focus to GPT.
Avoid being a link dump. Try to provide only valuable well tuned information.
Neural network links before starting with transformers.
-- To run: | |
-- cabal repl -b pretty-simple | |
-- | |
-- Colorizing and pretty-printing ghci output | |
-- requires: pretty-simple | |
:set -interactive-print=Text.Pretty.Simple.pPrint | |
-- green bold lambdas and multiline mode | |
:set prompt "\ESC[1;32mλ: \ESC[m" | |
:set prompt-cont "\ESC[1;32mλ| \ESC[m" |
{-# LANGUAGE GADTs #-} -- Soft dependent types | |
{-# LANGUAGE PolyKinds #-} -- Allow general specification of Refl | |
{-# LANGUAGE RankNTypes #-} -- Explicit quantification and inline type context | |
{-# LANGUAGE DataKinds #-} -- Lift data constructors to Kind level | |
{-# LANGUAGE TypeFamilies #-} -- Equational reasoning about types | |
{-# LANGUAGE TypeOperators #-} -- Allow types such as :~: | |
-- Starting the interactive shell: | |
-- | |
-- ghci -XDataKinds -XTypeOperators -Wall -Werror Script.hs |
DELIMITER | | |
CREATE FUNCTION uuid_from_bin(b BINARY(16)) | |
RETURNS CHAR(36) DETERMINISTIC | |
BEGIN | |
DECLARE hex CHAR(32); | |
SET hex = HEX(b); | |
RETURN CONCAT(LEFT(hex, 8), '-', MID(hex, 9,4), '-', MID(hex, 13,4), '-', MID(hex, 17,4), '-', RIGHT(hex, 12)); | |
END | |
| |
#Newbie programmer | |
def factorial(x): | |
if x == 0: | |
return 1 | |
else: | |
return x * factorial(x - 1) | |
print factorial(6) | |
#First year programmer, studied Pascal |