Strong Type Constraints for Scala
(github.com/Iltotore)
Iron is a lightweight library for refined types in Scala 3.
Iron is a lightweight library for refined types in Scala 3.
An epic treatise on error models for systems programming languages
(typesanitizer.com)
In research papers on programming languages, there is often a focus on sophisticated type system features to rule out certain classes of errors, whereas error handling itself receives relatively little attention, despite its importance.
In research papers on programming languages, there is often a focus on sophisticated type system features to rule out certain classes of errors, whereas error handling itself receives relatively little attention, despite its importance.
Refined: Simple Refinement Types for Rust
(jordankaye.dev)
An alpha library for refinement types with rich support for serde
An alpha library for refinement types with rich support for serde
Open and closed universes (2021)
(sunshowers.io)
Type systems are tools for modeling some aspect of reality. Some types need to represent one of several different choices.
Type systems are tools for modeling some aspect of reality. Some types need to represent one of several different choices.
An effect system proposal for C2y
(open-std.org)
In this discussion proposal we suggest that C would be improved by extending the core type system into a type and effect system, that forces functions and blocks to declare which classes of effects will result from their evaluation.
In this discussion proposal we suggest that C would be improved by extending the core type system into a type and effect system, that forces functions and blocks to declare which classes of effects will result from their evaluation.
What would it take to add refinement types to Rust?
(yoric.github.io)
A few years ago, on a whim, I wrote YAIOUOM. YAOIOUM was a static analyzer for Rust that checked that the code was using units of measures correctly, e.g. a distance in meters is not a distance in centimeters, dividing meters by seconds gave you a value in m / s (aka m * s^-1).
A few years ago, on a whim, I wrote YAIOUOM. YAOIOUM was a static analyzer for Rust that checked that the code was using units of measures correctly, e.g. a distance in meters is not a distance in centimeters, dividing meters by seconds gave you a value in m / s (aka m * s^-1).
What would it take to add refinement types to Rust?
(yoric.github.io)
A few years ago, on a whim, I wrote YAIOUOM. YAOIOUM was a static analyzer for Rust that checked that the code was using units of measures correctly, e.g. a distance in meters is not a distance in centimeters, dividing meters by seconds gave you a value in m / s (aka m * s^-1).
A few years ago, on a whim, I wrote YAIOUOM. YAOIOUM was a static analyzer for Rust that checked that the code was using units of measures correctly, e.g. a distance in meters is not a distance in centimeters, dividing meters by seconds gave you a value in m / s (aka m * s^-1).
Nominal for Storing, Structural for Manipulating
(bearblog.dev)
Something that comes up sometimes in programming languages is the difference between nominal and structural type systems.
Something that comes up sometimes in programming languages is the difference between nominal and structural type systems.
Adding row polymorphism to Damas-Hindley-Milner
(bernsteinbear.com)
Damas-Hindley-Milner (HM) is a type system for Standard ML and the ML-family languages.
Damas-Hindley-Milner (HM) is a type system for Standard ML and the ML-family languages.
Damas-Hindley-Milner inference two ways
(bernsteinbear.com)
Damas-Hindley-Milner (HM) is a type system for the lambda calculus (later adapted for Standard ML and the ML-family languages) with parametric polymorphism, aka generic functions. It sits at a sweet spot in PL design: the type system is quite expressive, and there are well known type inference algorithms that require absolutely no annotations from the programmer.
Damas-Hindley-Milner (HM) is a type system for the lambda calculus (later adapted for Standard ML and the ML-family languages) with parametric polymorphism, aka generic functions. It sits at a sweet spot in PL design: the type system is quite expressive, and there are well known type inference algorithms that require absolutely no annotations from the programmer.
A dictionary of single-letter variable names
(jackkelly.name)
Haskell’s expressive type system means that type signatures can carry a lot of information. Haskell’s polymorphism means that you sometime write a function that works across an enormous range of types, and are often left wondering “what do I actually call my variables?”. It is often the case that there’s nothing to say beyond “this variable is a Functor”, or “this variable is a monadic action”, and so a single-letter variable name is appropriate.
Haskell’s expressive type system means that type signatures can carry a lot of information. Haskell’s polymorphism means that you sometime write a function that works across an enormous range of types, and are often left wondering “what do I actually call my variables?”. It is often the case that there’s nothing to say beyond “this variable is a Functor”, or “this variable is a monadic action”, and so a single-letter variable name is appropriate.