“1. A compiler for real-time tensor processing (arbitrary DSP, ML). In something like LISP or Haskell, the goal is to compile lambda calculus for fast/reliable execution—as such, you can express a program in a fully general language that can represent any computation and execute it without explicitly modeling the lower levels of the machine. I'm building a…”
Programs as Diagrams: From Categorical Computability to Computable Categories
This is a draft of the textbook/monograph that presents computability theory using string diagrams. The introductory chapters have been taught as graduate and undergraduate courses and evolved through 8 years of lecture notes. The later chapters contain new ideas and results about categorical computability and some first steps into computable category theory. The underlying categorical view of computation is based on monoidal categories with program evaluators, called *monoidal computers*. This categorical structure can be viewed as a single-instruction diagrammatic programming language called Run, whose only instruction is called RUN. This version: improved text, moved the final chapter to the next volume. (The final version will continue lots of exercises and workouts, but already this version has severely degraded graphics to meet the size bounds.)
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及- Programs as Diagrams: From Categorical Computability to Computable Categories ↗deltasepsilon · 2023-11-06 · 1 分