Future Programming Languages

The Future ofProgramming Languages

Alcides FonsecaTambém lança búziose cura mau olhado.

Monday, November 14, 11

Disclaimer

These opinions are my own and may not reflect future events.


Roadmap


RoadmapWhy is language X successful?



Systems



Systems

Java.Next



Systems

Java.Next

Browser



Systems

Java.Next

Browser

Parallel



Systems

Java.Next

Browser

Parallel

DSL



Systems

Java.Next

Browser

Parallel

DSL

Esoteric


Why is language X successful?



• Portability (C, Java, Python, ...)




• Abstraction and Simplicity (Java, Python)





• Killer app/framework (Ruby)






• Batteries Included (Python, Matlab)







• Tooling (VB, Java)







• Tooling (VB, Java)

• Company Support (VB, C#, ABAP)


Systems


Rust


Rust


Rust

•No null


Rust

•No null•Closures


Rust

•No null•Closures•Blocks


Rust

•No null•Closures•Blocks•Generics w/ Type Inference


Rust

•No null•Closures•Blocks•Generics w/ Type Inference•Crates


Rust



Rust



Plaid


Plaid


Plaid

•Lambdas


Plaid

•Lambdas•Closures


Plaid

•Lambdas•Closures•Access Permissions


Plaid


• immutable, unique, full


Plaid


• immutable, unique, full•Pattern Matching


Plaid


• immutable, unique, full•Pattern Matching


Rust vs Plaid


Rust vs Plaid

Research-level


Rust vs Plaid

Research-levelCompany-supported


Rust vs Plaid


C/LLVM


Rust vs Plaid


JVMC/LLVM


Rust vs Plaid


JVMC/LLVM

Verbose on permissions


Rust vs Plaid


JVMC/LLVM

Verbose on permissionsLimited on permissions


Rust vs Plaid


JVMC/LLVM


Crates


Rust vs Plaid


JVMC/LLVM


Rust vs C

Crates


Java.next()


ATM


ATM

• JRuby


ATM

• JRuby

• Mirah (Duby)


ATM

• JRuby

• Mirah (Duby)

• Gosu


ATM

• JRuby

• Mirah (Duby)

• Gosu

• Scala


Kotlin

By Jetbrains


Kotlin• Reified Generics

By Jetbrains



• NullablesBy Jetbrains



• Nullables

• Type Inference

By Jetbrains



• Nullables

• Type Inference

• Pattern Matching

By Jetbrains



• Nullables

• Type Inference


• Extension Functions

By Jetbrains



• Nullables

• Type Inference



Only with support from other IDEs

By Jetbrains


XtendBy Eclipse


Xtend



• Multi dispatch (visitor)

By Eclipse


Xtend




By Eclipse


Xtend




By Eclipse


Xtend




By Eclipse


Xtend




Only with a great framework

By Eclipse


CeylonBy Redhat


Ceylon

• Syntax similar to Java

By Redhat


Ceylon


• Tree-like DSLs

By Redhat


Ceylon


• Tree-like DSLs

• Better macro/annotations

By Redhat


Ceylon


• Tree-like DSLs


By Redhat


Ceylon


• Tree-like DSLs


No chance

By Redhat


Java.next conclusions



• Java.next needs good tooling




• There are too many choices





• They are all similar






Java 8






Java 8 Scala for niches


Browser


Harmony


Harmony


Harmony


Harmony


DartBy Google


DartBy Google


Dart vs Harmony


Dart vs Harmony

• Tooling


Dart vs Harmony

• Tooling

• Other browsers


Dart vs Harmony

• Tooling

• Other browsers

• Complex projects


Dart vs Harmony

• Tooling

• Other browsers


• Fast operations


Dart vs Harmony

• Tooling

• Other browsers


• Fast operations

Language heterogeneity


Parallel languages


Fortress


Fortress


Fortress

Wrong development approach


Parasailfor Phil in Philosopher_Index concurrent loop const Left_Fork := Phil; const Right_Fork := Phil mod Num_Phils + 1;

while True loop // Until overall timer terminates procedure Display(Context.IO.Standard_Output, "Philosopher " | Phil | " is thinking\n"); Delay(Clock, Next(Context.Random)); // Think then Pick_Up_Fork(Forks[Left_Fork], #is_left_fork); || Pick_Up_Fork(Forks[Right_Fork], #is_right_fork); then Display(Context.IO.Standard_Output, "Philosopher " | Phil | " is eating\n"); Delay(Clock, Next(Context.Random)); // Eat then Put_Down_Fork(Forks[Left_Fork]); || Put_Down_Fork(Forks[Right_Fork]); end loop; end loop; end procedure Dinner_Party;


Parasailfor Phil in Philosopher_Index concurrent loop const Left_Fork := Phil; const Right_Fork := Phil mod Num_Phils + 1;

while True loop // Until overall timer terminates procedure Display(Context.IO.Standard_Output, "Philosopher " | Phil | " is thinking\n"); Delay(Clock, Next(Context.Random)); // Think then Pick_Up_Fork(Forks[Left_Fork], #is_left_fork); || Pick_Up_Fork(Forks[Right_Fork], #is_right_fork); then Display(Context.IO.Standard_Output, "Philosopher " | Phil | " is eating\n"); Delay(Clock, Next(Context.Random)); // Eat then Put_Down_Fork(Forks[Left_Fork]); || Put_Down_Fork(Forks[Right_Fork]); end loop; end loop; end procedure Dinner_Party; Syntax + Tooling


Æminiumval (immutable Integer >> immutable Integer) -> immutable Integer fib = fn (immutable Integer >> immutable Integer n) => { match (n <= 2) { case True { 1; } case False { fib(n - 1) + fib(n - 2); } } };

outside/inside RW R

-

R

RW

unique unique

full immutable

share pure


Æminiumval (immutable Integer >> immutable Integer) -> immutable Integer fib = fn (immutable Integer >> immutable Integer n) => { match (n <= 2) { case True { 1; } case False { fib(n - 1) + fib(n - 2); } } };

outside/inside RW R

-

R

RW

unique unique

full immutable

share pureHard to write


DSLs


Opabroadcast(author) = do Network.broadcast({~author text=Dom.get_value(#entry)}, room) Dom.clear_value(#entry)

start() = author = Random.string(8) <div id=#header><div id=#logo></></> <div id=#conversation onready={_ -> Network.add_callback(user_update, room)}></> <div id=#footer> <input id=#entry onnewline={_ -> broadcast(author)} /> <div class="button" onclick={_ -> broadcast(author)}>Post</> </>

server = Server.one_page_bundle("Chat", [@static_resource_directory("resources")], ["resources/css.css"], start)


Opabroadcast(author) = do Network.broadcast({~author text=Dom.get_value(#entry)}, room) Dom.clear_value(#entry)

start() = author = Random.string(8) <div id=#header><div id=#logo></></> <div id=#conversation onready={_ -> Network.add_callback(user_update, room)}></> <div id=#footer> <input id=#entry onnewline={_ -> broadcast(author)} /> <div class="button" onclick={_ -> broadcast(author)}>Post</> </>

server = Server.one_page_bundle("Chat", [@static_resource_directory("resources")], ["resources/css.css"], start)

Hard to separate concerns


Frink(6 years + 9 months)



tw[v0, alpha, h0 = 1 meter, hw = 10 feet, g=gravity] := { vy0 = v0 sin[alpha] radical = (2 g (h0 - hw) + vy0^2)

if (radical < 0 mph^2) return["No solution"]

radical = radical^(1/2)

return [(vy0 - radical)/g, (vy0 + radical)/g]}



tw[v0, alpha, h0 = 1 meter, hw = 10 feet, g=gravity] := { vy0 = v0 sin[alpha] radical = (2 g (h0 - hw) + vy0^2)

if (radical < 0 mph^2) return["No solution"]

radical = radical^(1/2)

return [(vy0 - radical)/g, (vy0 + radical)/g]}

Best calculator ever!


Magpie


Magpie

• Dynamic language (Similar to Mirah)


Magpie


• Multi-methods


Magpie


• Multi-methods

• Syntax extensions


Magpie


• Multi-methods

• Syntax extensions

Too dynamic


OMeta


OMeta

Great for DSLs


Esoteric


Wheeler


Wheeler


Wheeler


Wheeler

?!?!


Clay


Clay

Winner


C will not dieanytime soon.


Thank you

Alcides Fonsecahttp://alcidesfonseca.com


http://alcidesfonseca.com

http://alcidesfonseca.com

Future Programming Languages

Technology

redhat syntax

full pattern

llvm jvm limited

end procedure

true loop

immutable

immutable

end loop