Type Theory Forall - Intervew With Shriram Krishnamurthi

It's really good. He grew up in Bangalore in the eighties. See Two Great Talks on Programming Languages.

23:11 He has said before, in public, that his favourite syntax is raw-parenthetical. See https://pyret.org/. They call it a scripting language, but it's actually self-hosted. I am not aware of many script languages that facilitate the writing of their own implementation. See lang/src/arr/compiler/desugar.arr for an example.

1:22:22 He makes an interesting point about models and soundness proofs. See Moshe Vardi talking about LTLf.  I am still amazed that people accept these undecidability results (where consistency is modelled by soundness in a representation) as if they say something about limits of human reason. See Intensional and Extensional Semantics in Programming Languages and Type Theory.

Krishnamurthi has a scribble document instead of a blog: https://parentheticallyspeaking.org/.

They did a good interview with Philip Wadler a few months ago:

Compare the endings of these two interviews 1:42:32 and 2:31:51.

Subscribe to Type Theory Forall.

Comments

Post a Comment

Popular posts from this blog

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more

HTML in Blog Posts

Just testing stuff: SVG You can click on the blue circle: MathML There is not much you can do with this. See Mathematical Markup Language 1.01 Specification   7.1.5 Mixing and Linking MathML and HTML . It's the big problem  of how you compose languages.   a x 2 + b x + c = 0 You can click on the discriminant: x = − b ± b 2 − 4 ⁢ a ⁢ c 2 ⁢ a 2D Canvas Sound  Beep! WebGPU Next level Parser expression grammar compiler:  https://peggyjs.org/online.html Devine Lu Linvega's unxtal assembler/debugger:  https://wiki.xxi...
Read more