About:

Unfortunately, the provided metadata does not contain a summary about the author. Additional information from the website content would be needed to provide a summary.

Website:

Specializations:

Incoming Links:

Outgoing Links:

Alex Kladov
Subscribe to RSS:
The post is about logic and its concepts, especially about the meaning of the mysterious Par and computational interpretations of classical logic. It explains the concept of par, disjunctive syllogism, continuations, and Wadler's ...
The post is a reflection on the experience of being a guest on the Type Theory Forall podcast. The author expresses gratitude for the opportunity and discusses their journey of self-teaching type theory and programming language th...
This post is the second in a series on Logic, focusing on linear logic. It explains the limitations of intuitionistic logic and classical logic, and introduces linear logic as a solution. Linear logic is a system that removes the ...
The post is the first in a series on Logic, focusing on sequents and Sequent Calculus. It explains Gentzen's notation for reasoning, introduces the Sequent Calculus, and discusses Natural Deduction and Intuitionistic Logic. The po...
The text introduces a new programming language called Cricket, which is a small, lazy, gradually typed, object-oriented, and functional language. It explains the features of Cricket, such as laziness, type checking, object-oriente...
...
The text is a detailed explanation of category theory, its concepts, and its applications in various fields. It covers the definition of a category, functors, natural transformations, and their applications in programming.

0The Type of Sprintf

2024-05-14

The post discusses the idea of giving a type to the sprintf function via dependent types. It explains how dependent types allow the creation of functions like sprintf in languages with compile-time types. The author provides a det...
The author discusses the importance of simplicity in programming languages, focusing on five key ideas: readiness-at-hand, iteration speed, one-way-of-doing-things, first-order reasoning, and simple static type systems. The post h...
The author discusses the implementation of SaberVM and a lambda calculus compiler targeting SaberVM. They explain the typechecking process for SaberVM's type system, comparing it to Web Assembly's type system and detailing the adv...
The text is a long post mapping out the author's experience of programming language papers, with recommendations for programming language developers to start exploring. It covers topics such as static and dynamic analysis, depende...
The post discusses the announcement of SaberVM, a system that uses a combination of features to express a lot in a safe way, particularly focusing on its memory safety scheme. It explains the concept of capability-based memory saf...
The post announces the Saber Virtual Machine, a compiler backend for functional languages, with a focus on safety, expressivity, portability, and reliability. It explains the main systems of SaberVM, regions and exceptions, and th...
The post explores the application of modal logic to computer science, focusing on type-theoretic interpretations of crashing and security. It discusses the concepts of possibility and necessity in modal logic, and their applicatio...
Implicit products are a type theory idea that deserves more attention. They are used in the Cedille proof assistant and are a possibly-infinite intersection of all the possible 'return types.' They are a better interpretation of t...
The post explains the intuition behind dependent types and their relationship with proofs, using a C-like syntax. It discusses the correspondence between logic and type systems, dependent types, and dependent function types. It al...

0My First Blog Post

2023-11-16

...