zee.town
Search
CTRL + K
zee.town
Search
CTRL + K
links
cs
5th HLF – Lecture Leslie Lamport
[1hr Talk] Intro to Large Language Models
Aaron Schlesinger&39;s Personal Site
Autolab Autograding for All
Basic memory allocators explained in 10 minutes
Better Benchmarks Through Graphs - Marc&39;s Blog
C0 VSCode Language Support - Visual Studio Marketplace
Classic HCI demos
Compiler Development Rust or OCaml
cps in hoot — wingolog
CRDTs go brrr
CS 15-122 Principles of Imperative Computation (Spring 2023)
CTAN Package annotate-equations
div style="max-width 480px;"What Is ChatGPT Doing … and Why Does It Workdiv
Document
Dynamic Programming versus Memoization
Fall2022
Guide for Lab Authors - Autolab Documentation
How fast is bit packing
Interactive Theorem Proving, Guest Lecture - Introduction to Agda, by Jeremy Siek
Introduction to Software Construction
Jepsen Datomic Pro 1.0.7075
Let futures be futures
Maybe Everything Is a Coroutine - Adam Nelson
Metastable failures in the wild
My binary vector search is better than your FP32 vectors
newca12awesome-rust-formalized-reasoning An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification
Open Data Structures
Post 1 Datalog, Chain-Forward Computation, and Relational Algebra
Quickly identifying a sequence of digits in a string of characters
References are like jumps
Review Performance Modeling and Design of Computer Systems Queueing Theory in Action
The Solid-State Register Allocator
Tree-Structured Concurrency
Vector databases (3) Not all indexes are created equal
other
Ottoneu Fantasy Baseball - rules
pl
21 ordered
[Haskell&39;23] The Evolution of Effects
A refinement type by any other name weaselhat
Aplas11
Compiling Swift generics, Part I - Development Compiler - Swift Forums
Context Sensitive Subtyping
copilot-explorer
Down and Dirty with Semantic Set-theoretic Types (a tutorial) v0.4
Elegant and performant recursion in Rust
graydon2 Some notes on Rust, mutable aliasing and formal verification
How To Prove It With Lean
Hyperproperties and why they&39;re hard
I&39;m betting on Call-by-Push-Value
Introduction - Counterexamples in Type Systems
journal.stuffwithstuff.com
Kell14in author version
Laurence Tratt Compiled and Interpreted Languages Two Ways of Saying Tomato
Linear Types One-Pager
Oxidizing OCaml Locality
Polarized Subtyping CodeArtifact
Proc macro support in rust-analyzer for nightly rustc versions
Programming with Refinement Types
Race Conditions Can Be Useful for Parallelism
Scones, Logical Relations, and Parametricity The n-Category Café
Semantic Subtyping in Luau - Roblox Blog
Semantic Subtyping in Luau
Template for CMU SCS PhD thesis (2006)
The Better Parts. Douglas Crockford. JS Fest 2018
Two little interpreters
Universal domain types
What is logical relations
What is realizability
papers
A calculus with recursive types, record concatenation and subtyping
A tale of intersection types
Call-by-push-value_ A subsuming paradigm
Contextual refinement types
Hybrid intersection types for PCF (extended version)
Intersection and union types_ Syntax and semantics
Intersection types and computational effects
Monadic intersection types, relationally
Operations on records
Polarized Subtyping
Practical refinement-type checking
Programming with union, intersection, and negation types
Refinement kinds_ type-safe programming with practical type-level computation
Semantics of types for mutable state
Sequent calculi for induction and infinite descent
Step-indexed syntactic logical relations for recursive and quantified types
Structural refinement types
The duality of classical intersection and union types
Tree automata techniques and applications
Type refinements in an open world (extended abstract)
Types are not sets
Research and Reading
resume
zee.town
Call-by-push-value_ A subsuming paradigm
authors
: Paul Blain Levy
year
: 1999
url
:
https://dl.acm.org/doi/10.5555/645894.671755
publisher
: Springer Berlin Heidelberg
year
: 1999
abstract
: