Pugs: A Perl 6 Implementation

Pugs
An implementation of

Perl 6
Audrey Tang

Pugs...
≝ Perl 6 Compiler
≝ Perl 6 Runtime

Pugs...
≝ Perl 6 Compiler
≝ Perl 6 Runtime
≝ Perl 6 Test Suite

Perl 6 Code

✓ 130+ Modules
✓ 160+ Examples

Perl 6 Code

✓ 130+ Modules
✓ 160+ Examples
✓ 18,000+ Unit Tests

“Official Perl 6”
✓ Defined by semantics,
not by accidents of history

“Official Perl 6”
✓ Defined by semantics,
not by accidents of history
✓ Compatibility test suite
(cf. JavaTest/TCK)

Perl, circa 1995
• use 5.000;

Perl, circa 1995
• use 5.000;
• require 'fastcwd.pl';

Perl, circa 1995
• use 5.000;
• require 'newgetopt.pl';

Perl, circa 1995
• use 5.000;
• require 'newgetopt.pl';
• require 'exceptions.pl';

Perl, circa 2005
• use v6-alpha;

Perl, circa 2005
• use v6-alpha;
• use perl5:DBI;

Perl, circa 2005
• use v6-alpha;
• use perl5:DBI;
• use perl5:Encode <encode decode>;

Perl, circa 2005
• use v6-alpha;
• use perl5:DBI;
• use perl5:Template;

Perl, circa 2005
• use v6-alpha;
• use perl5:DBI;
• use perl5:Template;
• # Implementation of "crypt"
eval "crypt()" :lang<perl5>;

Hybrid Runcore
Pugs

GHC Perl 5
Runtime Runtime

Pugs.Eval Pugs::Runtime
Pugs.Prim Pugs::Compiler
Pugs.Types Pugs::Grammar

Hybrid Runcore
Pugs
⇚ Perl 5
GHC Perl 5
Runtime Runtime


Hybrid Runcore
Pugs
⇚ Perl 5
GHC Perl 5
⇚ Haskell Runtime Runtime


Hybrid Runcore
Pugs
⇚ Perl 5
GHC Perl 5
⇚ Haskell Runtime Runtime

⇚ C (.so/.dll) Pugs.Eval
Pugs.Prim
Pugs.Types
Pugs::Runtime
Pugs::Compiler
Pugs::Grammar

Backends

Pugs

Java
Haskell Perl 5
Script

Backends
JVM? YARV?

Pugs

CLR? PyPy?

Java
Haskell Perl 5
Script

Perl 5 Backend
Tool Support
CPAN, PAUSE
Perldoc, Perl::Tidy ...

Syntax
v6.pm
Pugs::Compiler::Perl6 ...

Perl 5 Sugar
Moose, Moose::Autobox ...

Semantics
Data::Bind, Class::MOP
Pugs::Runtime, Pugs::Compiler::Rule ...

Augmentation (XS) Infrastructure
PadWalker, Devel::Caller Parse::Yapp
autobox, re::override ... Module::Compile ...

Core
perl

Perl 5 Backend
⇛ Augment P5VM Tool Support
CPAN, PAUSE

Syntax
v6.pm

Perl 5 Sugar

Semantics


Core
perl

Perl 5 Backend
CPAN, PAUSE

Syntax
v6.pm

⇛ Deploy P6 as P5 Perl 5 Sugar

Semantics


Core
perl

Perl 5 Backend
CPAN, PAUSE

Syntax
v6.pm

⇛ Deploy P6 as P5 Perl 5 Sugar

Semantics

⇛ v6.pm on CPAN

Core
perl

JavaScript Backend
⇛ Like GWT, Hop, Links...

JavaScript Backend
⇛ Passes 90% of tests

JavaScript Backend
⇛ Passes 90% of tests
⇛ Slow - Aim for JS2/Tamarin

6.283185
Self Hosting
䷀

“Frivolous Toy
interpreter”
(as seen on Slashdot)

“Frivolous
Toy interpreter”

Arrow length
15500+ commits

290+ committers

Time

Test Driven

☺Bug report ➟ Test

Test Driven

☺Smoke Server

Test Driven

☺Smoke Server
☺:todo<unspecced>

Anarchistic

☺10+ languages
☺30+ sub-projects

Anarchistic

☺10+ languages
☺30+ sub-projects
☺Aggressive recruiting

λ Camels

✆ 200+ People
✆ 20+ Regulars

λ Camels

✆ 200+ People
✆ 20+ Regulars
✆ TimToady++

Mailing Lists

✆ perl6-users

Mailing Lists

✆ perl6-users
✆ perl6-language

Mailing Lists

✆ perl6-users
✆ perl6-language
✆ perl6-compiler

Repositories
http://svn.pugscode.org/pugs/

Repositories

http://darcs.pugscode.org/pugs/

Repositories

http://darcs.pugscode.org/pugs/

SVK

Hackathons
Taipei
Vienna
Toronto

Hackathons
Taipei
Vienna
Toronto
Amsterdam

Hackathons
Taipei
Vienna
Toronto
Amsterdam
Echt

Hackathons
Taipei
Vienna
Toronto
Amsterdam
Echt
Lismore

Hackathons
Taipei
Vienna
Toronto
Amsterdam
Echt
Lismore
Mt. Arbel

Hackathons
Taipei Vienna2

Vienna
Toronto
Amsterdam
Echt
Lismore
Mt. Arbel

Hackathons
Taipei Vienna2

Vienna Tokyo
Toronto
Amsterdam
Echt
Lismore
Mt. Arbel

Hackathons
Taipei Vienna2

Vienna Tokyo
Toronto Redmond
Amsterdam
Echt
Lismore
Mt. Arbel

Hackathons
Taipei Vienna2

Vienna Tokyo
Toronto Redmond
Amsterdam Chicago
Echt
Lismore
Mt. Arbel

Hackathons
Taipei Vienna2

Vienna Tokyo
Toronto Redmond
Amsterdam Chicago
Echt Boston
Lismore
Mt. Arbel

Hackathons
Taipei Vienna2

Vienna Tokyo
Toronto Redmond
Amsterdam Chicago
Echt Boston
Lismore Portland
Mt. Arbel

Hackathons
Taipei Vienna2

Vienna Tokyo
Toronto Redmond
Amsterdam Chicago
Echt Boston
Lismore Portland
Mt. Arbel Sao Paulo

Hackathons
Taipei Vienna2

Vienna Tokyo
Toronto Redmond
Amsterdam Chicago
Echt Boston
Lismore Portland
Mt. Arbel Sao Paulo
Mountain View?

Perl 6
Reconciling the
Irreconcilable
Audrey Tang

Closures
sub make_counter {
my $start = shift;
return sub { ++$start };
}

my $from_ten = make_counter(10);
my $from_three = make_counter(3);

print $from_three->(); # 4
print $from_three->(); # 5
print $from_ten->(); # 11

Staged Evaluation
BEGIN {
print "Compile-time";
eval $generated_code;
print "Still in compiler";
}
print "Normal runtime";
eval $more_generated_code;

Runtime Typecasting

my $piece = Pawn->new;
bless $piece, Queen;

Contexts
# Scalar vs. List context
my $one = <STDIN>; # Read one line
my @all = <STDIN>; # Read all lines

# String vs. Numeric context
print "Lines: @all" if @all < 10;

Tied Variables

tie my %search => 'Tie::Google';
print $search{'Perl Pugs'}[0]{URL};
# http://www.pugscode.org/

Regular Expresisons
# DeCSS
s''$/=2048;while(<>){G=29;R=142;if((@a=unqT="C*",_)[20]&48){D=89;_=unqb24,qT,@
b=map{ord qB8,unqb8,qT,_^$a[--D]}@INC;s/...$/1$&/;Q=unqV,qb25,_;H=73;O=$b[4]<<9
|256|$b[3];Q=Q>>8^(P=(E=255)&(Q>>12^Q>>4^Q/8^Q))<<17,O=O>>8^(E&(F=(S=O>>14&7^O)
^S*8^S<<6))<<9,_=(map{U=_%16orE^=R^=110&(S=(unqT,"xbntdxbzx14d")[_/16%8]);E
^=(72,@z=(64,72,G^=12*(U-2?0:S&17)),H^=_%64?12:0,@z)[_%8]}(16..271))[_]^((D>>=8
)+=P+(~F&E))for@a[128..$#a]}print+qT,@a}';s/[D-HO-U_]/$$&/g;s/q/pack+/g;eval

CPAN

11 years
5500+ authors
11000+ modules

Services
Package Management
Rating & Discussion

Services
Package Management
Rating & Discussion
Smoke Testing

Services
Package Management
Rating & Discussion
Smoke Testing
Issue Tracking

“The Best thing
happened to Perl”

Perl 5
is not the best thing
for CPAN

• use v5;
• sub render {

• use v5;
• sub render {
• my $self = shift;

• use v5;
• sub render {
• my %opts = (x => 1, y => 1, z => 0, %{$_[0]});

• use v5;
• sub render {
• my %opts = (x => 1, y => 1, z => 0, %{$_[0]});
• for my $item ( $self->filter(@{ $self->{items} }) ) {

• use v5;
• sub render {
• my %opts = (x => 1, y => 1, z => 0, %{$_[0]});
• print $item->draw({
x => $opts{x},
y => $opts{y},
z => $opts{z},
}), "n";

• use v5;
• sub render {
• my %opts = (x => 1, y => 1, z => 0, %{$_[0]});
• print $item->draw({
x => $opts{x},
y => $opts{y},
z => $opts{z},
}), "n";
• }
}

• use v6-alpha;
• method render ($x = 1, $y = 1, $z = 0) {

• use v6-alpha;
• for @.filter(@.items) {

• use v6-alpha;
• for @.filter(@.items) {
• say .draw(:$x, :$y, :$z);
}
}

Bug-for-bug
compatibility
☣

Best Practice
takes discipline

Best Practice
should be Natural!

2003
Ponie
(late, as in the late Arthur Dent)

Static Typing
vs
Dynamic Typing

Static
(C++, OCaml...)

Efficient

Static
(C++, OCaml...)

Efficient
Robust

Static Dynamic
(C++, OCaml...) (Python, Ruby, ...)

Efficient
Robust

Static Dynamic

Efficient Productive
Robust

Static Dynamic

Efficient Productive
Robust Flexible

Gradual Typing
with Annotations
and Type Inference

• use v5;
• sub f {
• sqrt($_[0]**2 + $_[1]**2);
•}
• my $five = f( 3, 4 );

• use v6-alpha;
• sub f {
• sqrt(@_[0]**2 + @_[1]**2);
•}
• my $five = f( 3, 4 );

•sub f (Num $x, Num $y) {
• sqrt($x**2 + $y**2);
•}
•my Num $five = f( 3, 4 );

• subset Positive of Num where { $_ > 0 }


• sub f (
Positive $x, Positive $y
--> Positive where { $_ > ($x & $y) }
) {


• sub f (
) {
• sqrt($x ** 2 + $y ** 2);
}


• sub f (
) {
• sqrt($x ** 2 + $y ** 2);
}
•
my $five := f(3, 4); # inferred as Positive

Domain Speciﬁc
vs
General Purpose

DSL
(SQL, Regex, ...)

Concise

DSL
(SQL, Regex, ...)

Concise
Expressive

DSL GPL
(SQL, Regex, ...) (Lisp, C, ...)

Concise
Expressive

DSL GPL

Concise Versatile
Expressive

DSL GPL

Concise Versatile
Expressive Reusable

Macros

Compile-time evaluation

Macros

All parts are swappable

Macros

All parts are swappable
Even the lexer!

• macro circumfix:</* */> ($x)
• is parsed /.*?/
• { '' }
•
• /* This is a C-style comment */
•

• sub postfix:<!> ($x) {
• [*] 1..$x
•}
•
• say 10!; # 3628800

• macro GREETING () {
• # A late-bound macro
• q:code(:COMPILING){ "Hello, $s" };
•}
• my $s = "world";
• say GREETING; # Hello, world

Lazy Evaluation
vs
Eager Evaluation

Lazy
(Haskell, Unix pipes)

Modular

Lazy
(Haskell, Unix pipes)

Modular
Reasonable

Lazy Eager
(Haskell, Unix pipes) (everybody else)

Modular
Reasonable

Lazy Eager

Modular Direct
Reasonable

Lazy Eager

Modular Direct
Reasonable Predictable

Return-type Polymorphism
with Laziness Annotations

•# "cat"
for =<> { .say }

•# "cat", together with line numbers
for each(1..*; =<>) {
say "Line $^num: $^text";
}

•# Lists are lazy by default

• # Lists are lazy by default
• my @fib := (

• my @fib := (
• 0, 1,

• my @fib := (
• 0, 1,
• each(@fib; @fib[1..*]).map(&infix:<+>)
);

• my @fib := (
• 0, 1,
• each(@fib; @fib[1..*]).map(&infix:<+>)
);
•
say "The first ten numbers are: @fib[^10]";

•# Items are eager values. However...

• # Items are eager values. However...
• my $ignored = lazy { 10 ** (10 * 10) };

• my $ignored = lazy { 10 ** (10 * 10) };
• my $unused = lazy { say 1..$ignored };

• my $ignored = lazy { 10 ** (10 * 10) };
• my $unused = lazy { say 1..$ignored };
• say "Hello, world!";

Classes
(Java, Smalltalk, ...)

Classes

Typeful

Classes

Typeful
Disciplined

Classes Prototypes
(Java, Smalltalk, ...) (JavaScript, Lua, ...)

Typeful
Disciplined

Classes Prototypes

Typeful Adaptive
Disciplined

Classes Prototypes

Typeful Adaptive
Disciplined Convenient

• class Dog is Mammal does Companion {

•
my $.count where 0..100;

•
•
has $!brain;

•
•
has $!brain;

• has &.vocalize = &say;
has $.name is rw = "Fido";

•
•
has $!brain;


• has $.fur handles Groomable;
has $.tail handles <wag hang>;

•
•
has $!brain;


• has $.fur handles Groomable;
has $.tail handles <wag hang>;
•
method companion handles s/^owner_// { ... }
}

• my Dog $fido .= new;
•
$fido.HOW; # the meta object for Dog

•
• $fido.WHAT; # the Dog prototype object

•
• $fido.WHICH; # $fido’s Object ID

•
• $fido.WHICH; # $fido’s Object ID
• Dog.isa(Dog); $fido.isa(Dog);

• $fido.HOW.add_method(
'bark',
method () { $.vocalize('Woof!') }
);

• $fido.HOW.add_method(
'bark',
method () { $.vocalize('Woof!') }
);

• Dog.can('bark'); $fido.can('bark');

Threads
(Implicit sharing)

Intuitive

Threads
(Implicit sharing)

Intuitive
Parallelizable

Threads Processes
(Implicit sharing) (Explicit sharing)

Intuitive
Parallelizable

Threads Processes

Intuitive Deterministic
Parallelizable

Threads Processes

Intuitive Deterministic
Parallelizable Manageable

•
async {
$x.withdraw(3);

$y.deposit(3);
}

•
async {
$x.withdraw(3);
☣ Race Condition ☣
$y.deposit(3);
}

• async {
$x.lock;
$y.lock;

• async {
$x.lock;
$y.lock;
• $x.withdraw(3);
$y.deposit(3);
}

• async { • async {
$x.lock; $y.lock;
$y.lock; $x.lock;
• $x.withdraw(3); }
$y.deposit(3);
}

☣ Deadlock ☣

• async { • async {
$x.lock; $y.lock;
$y.lock; $x.lock;
• $x.withdraw(3); }
$y.deposit(3);
}

Software
Transactional
Memory

• async {
• contend {
# begin transaction
• $x.withdraw(3);
$y.deposit(3);
• } # commit or rollback
• }

•# Retry with "defer"
method withdraw ($n) {
defer if $.balance < $n;
$.balance -= $n;
}

$.balance -= $n;
}
•
# Choice with "maybe"
sub transfer ($x1, $x2, $y) {
maybe { $x1.withdraw(3) }
$y.deposit(3);
}

$.balance -= $n;
}
•
# Choice with "maybe"
sub transfer ($x1, $x2, $y) {
$y.deposit(3);
}
•
# Composable with nested "maybe"
contend {
maybe { transfer($x1, $x2, $y) }
maybe { transfer($x3, $x4, $y) }
}

SIMD
(APL, Fortran)

Simple
Scalable

SIMD MIMD
(APL, Fortran) (everybody else)

Simple
Scalable

SIMD MIMD

Simple Richer types
Scalable

SIMD MIMD

Simple Richer types
Scalable Familiar flow

•# Hyper Operator (SSE/GPU friendly)
[1, 1, 2, 3, 5] »+« [1, 2, 3, 5, 8];

• # Hyper Operator (SSE/GPU friendly)
[1, 1, 2, 3, 5] »+« [1, 2, 3, 5, 8];
• # === [2, 3, 5, 8, 13]

•# Recursive Visits
-« [[1, 2], 3];

• # Recursive Visits
-« [[1, 2], 3];
• # === [[-1, -2], -3]

•# Hyper Methods
[1, 4, 9, 16]».sqrt;

•# Hyper Methods
[1, 4, 9, 16]».sqrt;
•# === [1, 2, 3, 4]

• % time pugs -e '(1..100000)>>.sqrt'
real 9.387s
user 9.219s

• % time pugs -e '(1..100000)>>.sqrt'
real 9.387s
user 9.219s
•
% time env GHCRTS=-N2 pugs -e '(1..100000)>>.sqrt'
real 5.807s
user 6.959s

•# Junctions
sub is_prime (Int $n --> Bool) {
$n % all(2 .. $n.sqrt+1);
}

•# Junctions
$n % all(2 .. $n.sqrt+1);
}
•
sub has_twin_prime (Int $n --> Bool) {
is_prime($n & ($n ± 2));
}

•# Junctions
$n % all(2 .. $n.sqrt+1);
}
•
is_prime($n & ($n ± 2));
}
•
sub infix:<±> ($x, $y) {
($x + $y) | ($x - $y);
}

•# Junctions
$n % all(2 .. $n.sqrt+1);
}
•
is_prime($n & ($n ± 2));
}
•
sub infix:<±> ($x, $y) {
($x + $y) | ($x - $y);
}
•

My Language
vs
Your Language

Perl 6 Others
Better
Better

Perl 6 Others
Better Better
Better

Perl 6 Others
Better Better
Better Better

•use jsan:DOM;
•use perl5:DBI;
•use haskell:Numeric;
•use your_language:FavouriteModule;

JVM? YARV?

Pugs

CLR? PyPy?

Java
Haskell Perl 5
Script

When Perl 6 arrives,
every day will be like
Christmas!
❆

Pugs: A Perl 6 Implementation

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Similar to Pugs: A Perl 6 Implementation

Similar to Pugs: A Perl 6 Implementation (20)

More from Audrey Tang

More from Audrey Tang (20)

Recently uploaded

Recently uploaded (20)

Pugs: A Perl 6 Implementation