Live briefing
Everything about Refinement type
Types constrained by a predicate
In type theory, a refinement type is a type endowed with a predicate which is assumed to hold for any element of the refined type. Refinement types can express preconditions when used as function arguments or postconditions when used as return types: for instance, the type of a function which accepts natural numbers and returns natural numbers greater than 5 may be written as. Refinement types are thus related to behavioral subtyping. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Refinement typeA 5-minute orientation
- Skim a recent paper: Doping-induced grain refinement contributes to enhanced thermoelectric performance of n-type PbSe at room temperatureInfluential work since 2022
- Pick up a classic book: The Sugar GirlsThe most-reprinted book on the subject
- Read the landmark paper: Refinement of the crystal structure of SiC type 6HCited 165 times
- Go sideways: Liquid HaskellA closely related topic
- Go sideways: Session typeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Refinement of the crystal structure of SiC type 6H
Refinement of the 3R γ-indium monoselenide structure type
Structure refinement of skutterudite-type cobalt triantimonide, CoSb3
Structure Refinement of YB62and YB56of the YB66-Type Structure
Program synthesis by type-guided abstraction refinement
An anisotropic h-type mesh-refinement strategy
ICE-Based Refinement Type Discovery for Higher-Order Functional Programs
Single-crystal structure refinement of spinel-type CuCr2Se4
🆕 Influential since 2022
Doping-induced grain refinement contributes to enhanced thermoelectric performance of n-type PbSe at room temperature
Pseudo‐Nanostructuring and Grain Refinement Enhance the Near‐Room‐Temperature Thermoelectric Performance in n‐type PbSe
Data refinement for enhanced ionic conductivity prediction in garnet-type solid-state electrolytes
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers
Refinement Mappings Related to Hermite-Hadamard Type Inequalities for GA-Convex Function
📚 Books worth reading
The Sugar GirlsNuala Calvi · 2012
The new sugar busters!H. Leighton Steward, Morrison Md Bethea · 2002
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Liquid Haskell Liquid Haskell is a program verifier for the programming language Haskell which allows specifying correctness properties by using refinement types. Properties…
- Session type In type theory, session types are used to ensure correctness in concurrent programs. They guarantee that messages sent and received between concurrent…
- SIGPLAN SIGPLAN is the Association for Computing Machinery's Special Interest Group (SIG) on programming languages. This SIG explores programming language concepts…
- Refinement (computing) Refinement is a generic term of computer science that encompasses various approaches for producing correct computer programs and simplifying existing programs…
- Haskell Haskell (/ˈhæskəl/) is a general-purpose, statically typed, purely functional programming language with type inference and lazy evaluation. Haskell pioneered…
- Generalized algebraic data type In functional programming, a generalized algebraic data type (GADT, also first-class phantom type, guarded recursive datatype, or equality-qualified type)…
- Type class In computer science, a type class is a type system construct that supports ad hoc polymorphism in a programming language. This is achieved by adding constraints…
- F* (programming language) F* (pronounced F star) is a high-level, multi-paradigm, functional and object-oriented programming language inspired by the languages ML, Caml, and OCaml…