Jay Foad

DYNA26: 27 April 2026. More info

Home / Blog / Blogs by Jay Foad

The author

former CTO

About

Jay is a software developer and programming language implementor. He worked at Dyalog Ltd. from April 2010 to May 2019 on the implementation of Dyalog APL, and was appointed CTO in January 2016. Foad’s contributions include a bytecode compiler for Dyalog APL and improvements in the language design and implementation. More about Jay

Share this page

Goodbye from Jay Foad

At the end of May 2019 I am leaving Dyalog, so it seems like a good time to reflect on my time here and what I’ve learned from APL and the APL community. When I joined Dyalog in 2010 I knew nothing about APL, so there was a really steep learning curve as I got … Read

May 2019
in Community, CTO, Team Dyalog

A message from the CTO

Hello! Further to Morten’s kind words of introduction, I’d like to take this opportunity to introduce myself as the new CTO of Dyalog Ltd. About me I’m a newcomer to APL. When I started working for Dyalog in 2010 I had only seen the Game of Life video, an intriguing but baffling glimpse into a … Read

Feb 2016
in CTO, Team Dyalog

Solving the 2014 APL Problem Solving Competition – Cryptography Problem 3

This post is the continuation of the series where we examine some of the problems selected for the 2014 APL Problem Solving Competition. In this post we’ll conclude looking at the cryptography problems from Phase II that we started looking at in a previous blog post and continued in a further blog post. Cryptography Problem … Read

Solving the 2014 APL Problem Solving Competition – Cryptography Problem 2

This post is the continuation of the series where we examine some of the problems selected for the 2014 APL Problem Solving Competition. In this post we’ll continue looking at the cryptography problems from Phase II that we started looking at in a previous blog post. Cryptography Problem 2 – Book Cipher Variation Task 1 … Read

Solving the 2014 APL Problem Solving Competition – Cryptography Problem 1

This post is a continuation of the series where we examine some of the problems selected for the 2014 APL Problem Solving Competition. I’ll start by looking at the cryptography problems from Phase II. Cryptography Problem 1 – Vigenère Cipher The cipher is described using a large table of letters, but you don’t need to … Read

Three-and-a-bit

The most obvious expression for computing π in APL is ○1. But what if you can’t remember how ○ works, or your O key is broken, or you feel like taking the road less travelled? With thanks to Wikipedia’s excellent list of Approximations of π, here are some short sweet APL expressions for three-and-a-bit: 3 ⍝ very short … Read