How to make a type with restrictions

by

I think the trick here is that you don’t enforce it on the type-level, you use “smart constructors”: i.e. only allow creation of such “tuples” via a function that generates such values:

module Test(MyType,x,y,z,createMyType) where

data MyType = MT { x :: Int, y :: Int, z :: Int }

createMyType :: Int -> Int -> MyType
createMyType myX myY = MT { x = myX, y = myY, z = 5 - myX - myY }

If you want to generate all possible such values, then you can write a function to do so, either with provided or specified bounds.

It may very well be possible to use type-level Church Numerals or some such so as to enforce creation of these, but it’s almost definitely too much work for what you probably want/need.

This might not be what you want (i.e. “Except of using just (x, y) since z = 5 – x – y”) but it makes more sense than trying to have some kind of enforced restriction on the type level for allowing valid values.

Types can ensure the correct “type” of value (no pun intended); to ensure validity of values you hide the constructor and only allow creation via approved functions that guarantee any invariants you require.

More Related Contents:

  1. Why not be dependently typed?
  2. Haskell \p -> not takeWhile
  3. Sum of two numbers with function in haskell
  4. What is the monomorphism restriction?
  5. How to group similar items in a list using Haskell?
  6. When is memoization automatic in GHC Haskell?
  7. How do I deal with many levels of indentation?
  8. Memoization in Haskell?
  9. Wrong IO actions order using putStr and getLine
  10. Difference between `data` and `newtype` in Haskell
  11. How do functors work in haskell?
  12. double stream feed to prevent unneeded memoization?
  13. Currying subtraction
  14. Haskell: how to evaluate a String like “1+2”
  15. Why does haskell’s bind function take a function from non-monadic to monadic
  16. Difference between Monad and Applicative in Haskell
  17. Why is lazy evaluation useful?
  18. Using Maybe type in Haskell
  19. What is a monad?
  20. Why is there “data” and “newtype” in Haskell? [duplicate]
  21. Why are side-effects modeled as monads in Haskell?
  22. haskell running out of memory with finite lists
  23. Haskell – simple constructor comparison (?) function
  24. Comparing functions in Haskell
  25. Monoidal Functor is Applicative but where is the Monoid typeclass in the definition of Applicative?
  26. How to return a pure value from a impure method
  27. How to convert Unicode Escape Sequence to Unicode String in Haskell
  28. Functional lenses
  29. How to reuse a type variable in an inner type declaration
  30. How does Haskell printf work?

Leave a Comment