Recently in Grants Category

We are looking for new members to join the Grant Committee.

We have a few members who are ready to retire, and so we have a few positions to consider filling.

Grant Proposals Mar/Apr 2019

The Grants Committee has received the following grant proposal for the March/April 2019 round.

Before the Committee members vote on any proposal, we like to solicit feedback from the Perl community.

Review the proposals at their individual links and please comment there by March 22nd, 2019. The Committee members will start the voting process following that and the conclusion will be announced shortly after.

The Grants Committee has received the following grant proposal for the March/April 2019 round. Before the Committee members vote, we would like to solicit feedback from the Perl community on the proposal.

Review the proposal below and please comment here by March 22nd, 2019. The Committee members will start the voting process following that.

A Complete (Interactive) Perl 6 Course with Exercises

  • Name

    Andrew Shitov

  • Amount Requested

    USD $9,996

Task: Create a complete course of the Perl 6 programming language.

Abstract

I want to create a complete course with exercises covering all aspects of Perl 6. It will be aimed at everyone who is familiar with programming. The goal is to make a course that you can use in self-studying or use as a platform in the class.

Brrt (Bart Wiegmans) reports that February was busy and short, but that he did some research on other implementations of register allocation that he can apply to MoarVM JIT.

He notes the following conundrum that he has been thinking about. Maybe a reader can advise:

I've also encountered a limitation in the optimization of the IR, which I'm trying to resolve. The issue is this, if I have a bunch of code like:

  int x = 3, y;
  if (table[x] > 0) {
      y = x * 3;
  } else {
     y = x * 6;
  }

Then under the current IR and compiler, with the new optimizer we may be able to make the reference to x in table[x]. Because the assignment to x isn't strictly ordered, this means that it is moved (implicitly) to the next use, which is:

  int x, y;
  if (table[x] > 0) {
      x = 3;
      y  = x * 3;
  } else {
      y = x * 6;
  }

And that obviously doesn't work, since x is uninitialized in the else branch. So in order to do effective optimizations, we need to be able to resolve this case correctly, either by copying the definition of 'x', or by moving the definition to an earlier point in the program.

MAJ

Timo has written a new blog post with the latest updates.

Selection_150.png

Read more at: Always Wear Safety Equipment When Inline Scalaring!

The Grants Committee is accepting grant proposals all the time. We evaluate them every two months and another evaluation period is upon us.

Grants: November 2018 votes

No Comments

The Grants Committee has concluded the voting of the November 2018 round.

There was one proposal this round, which was approved and funded. While we would normally have concluded this process sooner, there were delays related to the skipped January/February round, my apologies to all those impacted.

About TPF

The Perl Foundation - supporting the Perl community since 2000. Find out more at www.perlfoundation.org.

About this Archive

This page is an archive of recent entries in the Grants category.

Conferences is the previous category.

GSoC is the next category.

Find recent content on the main index or look in the archives to find all content.

Pages

OpenID accepted here Learn more about OpenID
Powered by Movable Type 6.2.2