Tweet
Tweet

Slide 1

Slide 1 text

Incredibly Strange Programming Languages! Craig Stuntz https://speakerdeck.com/craigstuntz

Slide 2

Slide 2 text

print *,"Hello world!"

Slide 3

Slide 3 text

Console.WriteLine("Hello, World!");

Slide 4

Slide 4 text

S3 S1 S2 S3 c a t var aaa = new Regex("cat"); https://en.wikipedia.org/wiki/Van_cat#/media/File:Turkish_Van_Cat.jpg

Slide 5

Slide 5 text

S3 S1 S2 S3 c a t var aaa = new Regex("cat"); https://en.wikipedia.org/wiki/Van_cat#/media/File:Turkish_Van_Cat.jpg

Slide 6

Slide 6 text

https://upload.wikimedia.org/wikipedia/commons/0/06/Human_computers_-_Dryden.jpg

Slide 7

Slide 7 text

• Today, many languages look mostly the same • “Mainstream” languages will change • There are specific reasons why they change • Just learning about certain languages can help you learn how to write interesting code

Slide 8

Slide 8 text

No content

Slide 9

Slide 9 text

No content

Slide 10

Slide 10 text

http://jsforcats.com/

Slide 11

Slide 11 text

https://www.flickr.com/photos/lenore-m/2514975647/

Slide 12

Slide 12 text

https://commons.wikimedia.org/wiki/File:Kitchen-knife-santoku-form.jpg

Slide 13

Slide 13 text

No content

Slide 14

Slide 14 text

https://www.flickr.com/photos/40726522@N02/9385054093/

Slide 15

Slide 15 text

https://www.flickr.com/photos/40726522@N02/9385054093/

Slide 16

Slide 16 text

No content

Slide 17

Slide 17 text

No content

Slide 18

Slide 18 text

var query = from total in Enumerable.Range(0,100).Reverse() select (total > 0) ? string.Format("{0} bottles of beer on the wall\n{0} bottles of beer\nTake one down, around", total) : string.Format("{0} bottles left", total); foreach (var item in query) { Console.WriteLine(item); } http://rosettacode.org/wiki/99_Bottles_of_Beer

Slide 19

Slide 19 text

plural = 's' 99.downto(1) do |i| puts "#{i} bottle#{plural} of beer on the wall," puts "#{i} bottle#{plural} of beer" puts "Take one down, pass it around!" plural = '' if i - 1 == 1 if i > 1 puts "#{i-1} bottle#{plural} of beer on the wall!" puts else puts "No more bottles of beer on the wall!" end end http://rosettacode.org/wiki/99_Bottles_of_Beer

Slide 20

Slide 20 text

var beer = 99; while (beer > 0) { var verse = [ beer + " bottles of beer on the wall,", beer + " bottles of beer!", "Take one down, pass it around", (beer - 1) + " bottles of beer on the wall!" ].join("\n"); console.log(verse); beer--; } http://rosettacode.org/wiki/99_Bottles_of_Beer

Slide 21

Slide 21 text

"#>,_ "#Beer Song>,_ #include using namespace std; int main(){ for( int b=-1; b<99; cout $% '\n') for ( int w=0; w<3; cout $% ".\n"){ if (w==2) cout $% (( b--) ?"Take one dow" "n and pass it arou" "nd":"Go to the sto" "re and buy some mo" "re"); if (b<0) b=99 ; do{ if (w) cout $% ", "; if (b) cout $% b; else cout $% ( (w) ? 'n' : 'N') $% "o more"; cout $% " bottle" ; if (b&'1) cout $% 's' ; cout $% " of beer"; if (w&'1) cout $% " on th" "e wall" ;} while (!w++);} return 0 ; } "# "# by barrym 2011-05-01 "# no bottles were harmed in the "# making of this program!!! http://rosettacode.org/wiki/99_Bottles_of_Beer

Slide 22

Slide 22 text

def sing(b, end): print(b or 'No more','bottle'+('s' if b-1 else ''), end) for i in range(99, 0, -1): sing(i, 'of beer on the wall,') sing(i, 'of beer,') print('Take one down, pass it around,') sing(i-1, 'of beer on the wall.\n') http://rosettacode.org/wiki/99_Bottles_of_Beer

Slide 23

Slide 23 text

https://www.quora.com/Are-all-programming-languages-based-on-C

Slide 24

Slide 24 text

https://www.quora.com/Are-all-programming-languages-based-on-C

Slide 25

Slide 25 text

Lineage 1960 1970 1980 ALGOL LISP APL ML Prolog ALGOL BCPL C C++ 1990 2000 C# Java JavaScript Ruby ML OCaml F# 2010 Swift LISP Scheme Clojure APL J SASL SASL Miranda Haskell Prolog Erlang Elixir PHP

Slide 26

Slide 26 text

Lineage 1960 1970 1980 ALGOL LISP APL ML Prolog ALGOL BCPL C C++ 1990 2000 C# Java JavaScript Ruby ML OCaml F# 2010 Swift LISP Scheme Clojure APL J SASL SASL Miranda Haskell Prolog Erlang Elixir PHP

Slide 27

Slide 27 text

Lineage 1960 1970 1980 ALGOL LISP APL ML Prolog ALGOL BCPL C C++ 1990 2000 C# Java JavaScript Ruby ML OCaml F# 2010 Swift LISP Scheme Clojure APL J SASL SASL Miranda Haskell Prolog Erlang Elixir PHP

Slide 28

Slide 28 text

Lineage 1960 1970 1980 ALGOL LISP APL ML Prolog ALGOL BCPL C C++ 1990 2000 C# Java JavaScript Ruby ML OCaml F# 2010 Swift LISP Scheme Clojure APL J SASL SASL Miranda Haskell Prolog Erlang Elixir PHP

Slide 29

Slide 29 text

Lineage 1960 1970 1980 ALGOL LISP APL ML Prolog ALGOL BCPL C C++ 1990 2000 C# Java JavaScript Ruby ML OCaml F# 2010 Swift LISP Scheme Clojure APL J SASL SASL Miranda Haskell Prolog Erlang Elixir PHP

Slide 30

Slide 30 text

Mainstream Programming Paradigm Shifts 1950s “Beats machine code” (Assembler) 1960s - mid-1970s “Beats assembler” (FORTRAN, COBOL) mid-1970s - mid-1990s “The Great Leap Backwards” (C, C++) mid-1990s - today? “Safer, Web” (Java, JavaScript)

Slide 31

Slide 31 text

Change is coming • Hardware: GPU / FPGA / Quantum computing • Distributed systems • End of Moore’s Law - Storage faster than CPU • Safety and privacy

Slide 32

Slide 32 text

Is This Some Kind of Joke? HAI 1.2 CAN HAS STDIO? VISIBLE "HAI WORLD!!!1!" KTHXBYE http://lolcode.org/

Slide 33

Slide 33 text

– Harold Abelson and Gerald Jay Sussman with Julie Sussman Structure and Interpretation of Computer Programs “Establishing new languages is a powerful strategy for controlling complexity in engineering design; we can often enhance our ability to deal with a complex problem by adopting a new language that enables us to describe (and hence to think about) the problem in a different way…”

Slide 34

Slide 34 text

What’s In a Name?

Slide 35

Slide 35 text

Console.WriteLine("Hello, World!");

Slide 36

Slide 36 text

Console.WriteLine("你好世界");

Slide 37

Slide 37 text

var hello = "Hello, World!".Substring(0, 5);

Slide 38

Slide 38 text

http://www.unicode.org/reports/tr51/index.html#Emoji_ZWJ_Sequences

Slide 39

Slide 39 text

http://www.unicode.org/reports/tr51/index.html#Emoji_ZWJ_Sequences " = U+1F1E8 REGIONAL INDICATOR SYMBOL LETTER C U+1F1E6 REGIONAL INDICATOR SYMBOL LETTER A

Slide 40

Slide 40 text

بلق http://nas.sr/%D9%82%D9%84%D8%A8/

Slide 41

Slide 41 text

No content

Slide 42

Slide 42 text

No content

Slide 43

Slide 43 text

No content

Slide 44

Slide 44 text

http://nas.sr/%D9%82%D9%84%D8%A8/ “The Arabs have a rich tradition of calligraphy and poetry attached to the text of their language. Computer scientists have a strangely similar relationship with the text that they write as well, and that overlap was something I became fascinated with.” -Ramsey Nasser

Slide 45

Slide 45 text

No content

Slide 46

Slide 46 text

No content

Slide 47

Slide 47 text

No content

Slide 48

Slide 48 text

http://nas.sr/بلق/

Slide 49

Slide 49 text

Is Turing Completeness a Good Idea?

Slide 50

Slide 50 text

“You theorized a machine that could solve any problem. It didn’t just do one thing; it did everything.” (fictional) Joan Clarke to (fictional) Alan Turing The Imitation Game (2014) http://theimitationgamemovie.com/#blog/104786411214 A Misunderstanding

Slide 51

Slide 51 text

BlooP FlooP GlooP

Slide 52

Slide 52 text

No content

Slide 53

Slide 53 text

BlooP DEFINE PROCEDURE “PRIME?” [N]: BLOCK 0: BEGIN IF N = 0 THEN: QUIT BLOCK O; CELL(0) (() 2; LOOP AT MOST MINUS [N,2] TIMES: BLOCK 1: BEGIN IF REMAINDER [N,CELL(0)] = 0, THEN: QUIT BLOCK 0; CELL(0) (() CELL(0) + 1; BLOCK 1: END; OUTPUT (() YES; BLOCK 0: END.

Slide 54

Slide 54 text

FlooP MU-LOOP: BLOCK n: BEGIN . . . BLOCK n: END.

Slide 55

Slide 55 text

GlooP

Slide 56

Slide 56 text

No content

Slide 57

Slide 57 text

No content

Slide 58

Slide 58 text

Client Server Data Cyphertext Result Cyphertext Computation Data Plaintext Result Plaintext

Slide 59

Slide 59 text

No content

Slide 60

Slide 60 text

Does Order of Operation Matter?

Slide 61

Slide 61 text

https://www.flickr.com/photos/lusoldi/3018045218/

Slide 62

Slide 62 text

C# if (true *+ LaunchMissiles()) { !" do stuff

Slide 63

Slide 63 text

C# IEnumerable stuff = from i in new[] { 1, 2, 3 } select i * i; !" Line A DoStuff(); !" Line B DoStuffWithStuff(stuff); !" Line C

Slide 64

Slide 64 text

“Now I'm a pretty lazy person and am prepared to work quite hard in order to avoid work.” Martin Fowler Refactoring https://www.flickr.com/photos/adewale_oshineye/2933030620/

Slide 65

Slide 65 text

No content

Slide 66

Slide 66 text

No content

Slide 67

Slide 67 text

No content

Slide 68

Slide 68 text

No content

Slide 69

Slide 69 text

No content

Slide 70

Slide 70 text

No content

Slide 71

Slide 71 text

No content

Slide 72

Slide 72 text

f x = x + 1 g x = x + 3 composed = f . g

Slide 73

Slide 73 text

f x = x + 1 g x = x + 3 composed = f . g

Slide 74

Slide 74 text

f x = x + 1 g x = x + 3 composed = f . g

Slide 75

Slide 75 text

f x = x + 1 g x = x + 3 composed = f . g

Slide 76

Slide 76 text

No content

Slide 77

Slide 77 text

minimum :: Ord a &. [a] "→ a minimum = head . sort

Slide 78

Slide 78 text

minimum :: Ord a &. [a] "→ a minimum = head . sort minimum [3, 2, 1] = head . sort $ [3, 2, 1]

Slide 79

Slide 79 text

https://www.schoolofhaskell.com/

Slide 80

Slide 80 text

If What Order Wrong Happen Things?

Slide 81

Slide 81 text

No content

Slide 82

Slide 82 text

System A System B

Slide 83

Slide 83 text

System A System B Possible Network Partition

Slide 84

Slide 84 text

System A System B Possible Network Partition THEOREM Spec ⇒ ☐NobodyGetsEaten

Slide 85

Slide 85 text

System A System B Possible Network Partition THEOREM Spec ⇒ ☐NobodyGetsEaten

Slide 86

Slide 86 text

https://lorinhochstein.wordpress.com/2014/06/04/crossing-the-river-with-tla/

Slide 87

Slide 87 text

No content

Slide 88

Slide 88 text

No content

Slide 89

Slide 89 text

http://research.microsoft.com/en-us/um/people/lamport/tla/formal-methods-amazon.pdf

Slide 90

Slide 90 text

http://research.microsoft.com/en-us/um/people/lamport/tla/formal-methods-amazon.pdf

Slide 91

Slide 91 text

http://research.microsoft.com/en-us/um/people/lamport/tla/hyperbook.html

Slide 92

Slide 92 text

https://github.com/p-org/PSharp/

Slide 93

Slide 93 text

https://github.com/p-org/PSharp/

Slide 94

Slide 94 text

https://github.com/p-org/PSharp/

Slide 95

Slide 95 text

No content

Slide 96

Slide 96 text

No content

Slide 97

Slide 97 text

No content

Slide 98

Slide 98 text

No content

Slide 99

Slide 99 text

http://p-org.github.io/PSharp/

Slide 100

Slide 100 text

http://research.microsoft.com/pubs/260939/paper.pdf

Slide 101

Slide 101 text

Is Real Privacy Even Possible?

Slide 102

Slide 102 text

No content

Slide 103

Slide 103 text

https://github.com/jeanqasaur/jeeves/blob/master/demo/jcal/tests.py

Slide 104

Slide 104 text

https://github.com/jeanqasaur/jeeves/blob/master/demo/jcal/jcal/models.py

Slide 105

Slide 105 text

https://github.com/jeanqasaur/jeeves/blob/master/demo/jcal/jcal/models.py

Slide 106

Slide 106 text

https://github.com/jeanqasaur/jeeves/blob/master/demo/jcal/jcal/models.py

Slide 107

Slide 107 text

https://github.com/jeanqasaur/jeeves/blob/master/demo/jcal/tests.py

Slide 108

Slide 108 text

http://arxiv.org/pdf/1507.03513v5.pdf

Slide 109

Slide 109 text

http://jeeveslang.org/

Slide 110

Slide 110 text

What Is the Fundamental Data Type?

Slide 111

Slide 111 text

No content

Slide 112

Slide 112 text

C Bag of bits C# , Java Object (ref. types) Value types Lisp Atom List Haskell Algebraic data types Julia, MATLAB Vector, Matrix APL, J Array Idris Theorem

Slide 113

Slide 113 text

No content

Slide 114

Slide 114 text

No content

Slide 115

Slide 115 text

No content

Slide 116

Slide 116 text

No content

Slide 117

Slide 117 text

No content

Slide 118

Slide 118 text

No content

Slide 119

Slide 119 text

No content

Slide 120

Slide 120 text

No content

Slide 121

Slide 121 text

No content

Slide 122

Slide 122 text

No content

Slide 123

Slide 123 text

No content

Slide 124

Slide 124 text

https://www.manning.com/books/type-driven-development-with-idris

Slide 125

Slide 125 text

https://github.com/munificent/vigil

Slide 126

Slide 126 text

No content

Slide 127

Slide 127 text

No content

Slide 128

Slide 128 text

No content

Slide 129

Slide 129 text

No content

Slide 130

Slide 130 text

No content

Slide 131

Slide 131 text

No content

Slide 132

Slide 132 text

No content

Slide 133

Slide 133 text

No content

Slide 134

Slide 134 text

No content

Slide 135

Slide 135 text

No content

Slide 136

Slide 136 text

What If Future Computers Aren’t Silicon?

Slide 137

Slide 137 text

Weird Machines

Slide 138

Slide 138 text

LIQUi|〉 let circUa = CompileUa N a qs "# Compile 1 Shor step let count = circUa.GateCount() ∗ n∗2 let hits, misses = "# Get total gate count Gate.CacheStats() "# Get gate caching stats let gp = GrowPars(30, 2, false) "# Params for growing let circUa = circUa.GrowGates(k, gp ) "# Grow the circuit circUa.Dump() "# Dump circuit to file ShorRun circUa rslt n a qs "# Run Shor let m = Array.m api "# Accumulate all the ( fun i bit "→ bit <<< i ) rslt "# ..phase estim ation bits |> Array.sum "# ..m = quantum result let permG, permS, permN = k.Perms "# Get permutation stats http://stationq.github.io/Liquid/

Slide 139

Slide 139 text

No content

Slide 140

Slide 140 text

No content

Slide 141

Slide 141 text

No content

Slide 142

Slide 142 text

http://stationq.github.io/Liquid/

Slide 143

Slide 143 text

Kappa %agent: A(b,c) %agent: B(a,c) %agent: C(b,a) ## %var: ’V’ 1 %var: ’k1’ INF %var: ’k2’ 1.0E-4/’V’ %var: ’k_off’ 0.1 ## ’a.b’ A(b),B(a) "→ A(b!1),B(a!1) @ ’k2’ (’k1’) ’a.c’ A(c),C(a) "→ A(c!1),C(a!1) @ ’k2’ (’k1’) ’b.c’ B(c),C(b) "→ B(c!1),C(b!1) @ ’k2’ (’k1’) ## ’a..b’ A(b!a.B) "→ A(b) @ ’k_off’ ’a..c’ A(c!a.C) "→ A(c) @ ’k_off’ ’b..c’ B(c!b.C) "→ B(c) @ ’k_off’ ## %var: ’n’ 1000 ## %init: ’n’ A(),B(),C() %mod: [E] > 10000 do \$STOP %def: "dotSnapshots" "true"

Slide 144

Slide 144 text

No content

Slide 145

Slide 145 text

No content

Slide 146

Slide 146 text

www.kappalanguage.org

Slide 147

Slide 147 text

This Begs the Question:

Slide 148

Slide 148 text

Why Don’t We Make a Lazy, Dependently Typed, Domain-Specific, Secure, Quantum Biological, Failsafe Language in Arabic?

Slide 149

Slide 149 text

No content

Slide 150

Slide 150 text

Craig Stuntz @craigstuntz Craig.Stuntz@Improving.com http://www.craigstuntz.com http://www.meetup.com/Papers-We-Love-Columbus/ https://speakerdeck.com/craigstuntz