Fastidious Elegance
Projects Store Contact/Social
Sep 21, 2017 1 min read co-dfns

Co-dfns 2017 Report

A great deal of work has gone into this year to improve and expand the capabilities of Co-dfns. The following presentation describes these updates in brief.

Co-dfns 2017 Presentation at Dyalog '17

You can find the video recording of this presentation at Dyalog TV.

Published by:

Aaron W. Hsu
Share Tweet

You might also like...

Mar
21
Thesis Correction: Sec. 3.7, Guard Lifting

Thesis Correction: Sec. 3.7, Guard Lifting

I was thankfully informed by Douglas Mennella that the before and after diagrams for section 3.7 of my thesis
Mar 21, 2023
1 min read
Mar
11
2023 APL Problem Solving Competition

2023 APL Problem Solving Competition

The 2023 APL Problem Solving Competition is now open! Solve problems in APL for the chance to win cash prizes
Mar 11, 2023
1 min read
Jan
22
Speaking at FnConf '22: DSLs, Architecture, & Structural Design in APL, 3 ways

Speaking at FnConf '22: DSLs, Architecture, & Structural Design in APL, 3 ways

I'll be sharing some thoughts about three different styles of system construction, the use of DSLs, and methods of looking
Jan 22, 2022
Jul
16
Source Code Readability, Elegance, and Complexity

Source Code Readability, Elegance, and Complexity

I was recently discussing my thoughts on this article: https://mathspp.com/blog/pydonts/does-elegance-matter And I thought I would
Jul 16, 2021
7 min read
Dec
20
Co-dfns support for very large arrays!

Co-dfns support for very large arrays!

Previously, Co-dfns could only support ranks <= 4. Now, the architecture supports arbitrarily large array sizes, though this is only partially
Dec 20, 2020
1 min read
Fastidious Elegance © 2023
Archives • Credits • Published with Ghost