CoRecursive: Coding Stories – Détails, épisodes et analyse

What do you do when your code breaks and the only fix is to dig into the runtime below?

Matt Godbolt lives for that. Tile-based renderers, color-coded scanlines, zero-copy NICs—each story is a clue that leads past the abstraction to the real machine. He shares the rule that guides him: master your layer, learn the one below, and know the outline of the layer under that.

 Matt Godbolt's journey proves the real breakthroughs are hideen behind the abstrations where you are comfortable and familiar.

• Episode Page
• Support The Show
• Subscribe To The Podcast
• Join The Newsletter

What if a software bug drained your savings, ruined your reputation, and nobody believed it wasn't your fault?

 Scott Darlington took over a village post office, hoping to give his family a steady life. But the software system kept showing cash shortfalls he couldn't explain. Each time, the Post Office told him the numbers were right and made him pay the difference out of his own pocket.

 Eventually it became too much and actions Scott took to protect himself lead to his arrest and public shaming. 

 How do you build trust in systems when the people behind them refuse to admit they're broken?

What if leaving your dream job was the way to discover your true self? 

  Jon de la Motte failed his first Stripe interview, but he didn't give up. It was his dream job, a company that connected with his father's work in finance with his software ambitions.

  At Stripe, Jon faced challenges. He joined a risky JavaScript infrastructure team and struggled to find his footing. Eventually he found his way, built a great team and then it all started to fall apart again.

  Discover how Jon's journey reshaped his life and what it means to balance personal and professional priorities.

• Episode Page
• Support The Show
• Subscribe To The Podcast
• Join The Newsletter

Tech Talks are in-depth technical discussions.

At Strange loop 2017, a wandered into a talk where I saw some code that deeply surprised me. The code could have been python if you squinted, passing dictionaries around, no type annotations anywhere.

Yet key look up in the dictionary was validated at compile time. It was a compile time error to access elements that didn't exist. Also the dictionary was heterogeneous, the elements had different types, and it was all inferred and validated at compile time.

What I was seeing was Dependent types in Haskell. In today's interview Stephanie Weirich explains her efforts to add dependent types to haskell and how that example worked.

Shows Notes:

• Dependent Types in Haskell Talk
• https://www.cis.upenn.edu/~sweirich/
• https://github.com/sweirich
• @fancytypes
• Dependent Types Regex

Tech Talks are in-depth technical discussions.

I don't know a lot about micro services.  Like how to design them and what the various caveats and anti-patterns are.  I'm currently working on a project that involves decomposing a monolithic application into separate parts, integrated together using Kafka and http.  

Today I talk to coauthor of upcoming book, Reactive Systems Architecture : Designing and Implementing an Entire Distributed System.  If you want to learn some of the hows and whys of building a distributed system, I think you'll really enjoy this interview.  The insights from this conversation are already helping me.

• Contact
  • Jan Machacek is the CTO at Cake Solutions.
• Videos
  • long lived micro services 
  • Book - Reactive System Architecture

Tech Talks are in-depth technical discussions. 

Rust, the programming language, seems to be really trendy these days.  Trendy to me means shows up a lot on hacker news.  Rust is really interesting language though, and I think the growing popularity is deserved.  

Today I talk with Jim Blandy, one of the authors of Programming Rust.  We talk about what problems rust is trying to solve, the unique language features and type system of rust. It includes both algebraic data types, type classes, and generics.  There is even a proposal somewhere for adding HKT.  We also touch on why it is so hard to secure code. Jim works on Firefox and his insights into the difficulty of writing secure code are super interesting.

Show notes

• Rust
• Programming Rust Book
• MESI protocol
•  Constraint-based Verification of Parameterized Cache Coherence Protocols Formal Methods in System Design
• Rust Validation  - 
• 3d game demo - (not sure where this is, post in comments if you find it)
• integer overflow 

Tech Talks are in-depth technical discussions.

Today's interview is with Steven Proctor, the host of the functional geekery podcast.  We talk about distributed programming in general and specifically how erlang supports distributed computing.  We also talk about things he's learned about functional programming and applying FP principles to various non FP contexts.  

Contact Proctor:

• Functional Geekery Podcast
• @stevenproctor
• @fngeekery

Tech Talks are in-depth technical discussions.

Purescript is a functional programming language that compiles to javascript.  It is a strict haskell dialect that can run anywhere that javascript does.

Justin Woo is a self described Purescript evangelist and enthusiast. We talk about purescript vs elm and working with expressive type systems.  Justin also had some great metaphors about phantom types and masking tape as well as avacados and testing.  

Contact Justin:

• twitter
• github
• website

Show notes:

• Purescript
• purescript training videos

My team at Tenable is hiring.  We are a distributed team of scala developers working on static analysis of docker containers (among other things).

We are a team of smart people, working fairly autonomously on interesting problems.  We are one of many teams working on interesting problems at Tenable.  I think its a great place to work.

I am in Peterborough, in Canada, and our team has people working in the US, Ireland and the UK as well.

Here is the job posting: 

https://www.linkedin.com/jobs/view/586241797/

Tell them Adam sent you, or you can email me directly at work abell at tenable.com or use this link to apply.

Tech Talks are in-depth technical discussions.

Today's interview is with John A De Goes. We talk about performance problems with monad transformer on the jvm, various flavours of IO monads and reasoning about polymorphic type signatures.  On the lighter side of things, we discuss how to write technical articles well, flame wars and Zee vs Zed pronunciation.

Show Notes:

• John's Website and Twitter
• Descriptive Variable Names: A Code Smell
• Data Structures Are Antithetical to Functional Programming
• A Modern Architecture for FP

Tech Talks are in-depth technical discussions.

In simple terms, a total function is a function that produces a well defined output for all possible inputs.  A total program is a program composed of only total functions.  

A non-total, or partial function, would be a function that can fail given certain inputs.  Such as taking the head of a list, which can fail if giving an empty list and is therefore non-total.

Total programming can be done in any language, however many languages make this easier.  Some, going so far as to require proof of totality.

In this interview Andre Videla discusses how the swift program language encourages programming in a total style.  He also discusses his love of Idris, proof assistants and how his research into haskell, idris and dependant types have made him a better swift programmer.

Links:

Total Programming In Swift