refinement types
[/rɪˈfaɪnmənt taɪps/]
nounpl: refinement types
tipos de refinamento
1. In programming and type theory, a type system extension that allows programmers to specify precise constraints on values beyond basic type information, enabling more accurate compile-time verification of program correctness.
Refinement types allow us to express that a function accepts only positive integers, not just any integer.
Tipos de refinamento nos permitem expressar que uma função aceita apenas inteiros positivos, não apenas qualquer inteiro.
2. A formal verification technique that combines dependent types with logical predicates to enhance type safety and reduce runtime errors.
The compiler uses refinement types to prove that the array access is always within bounds.
O compilador usa tipos de refinamento para provar que o acesso ao array está sempre dentro dos limites.
This is specialized technical terminology primarily used in academic computer science, programming language design, and formal methods communities. It has limited use outside these professional contexts and is rarely encountered in general English or Portuguese discourse. The term reflects the growing sophistication of type systems in modern functional programming languages like Haskell, Scala, and Liquid Haskell.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →