Teep seestem
Jump to navigation
Jump to search
In programmin leids, a teep seestem is a set o rules that assign a property cried teep tae various constructs a computer program conseests o, such as variables, expressions, functions or modules.[1]
References[eedit | eedit soorce]
- ↑ Pierce 2002, p. 1: "A type system is a tractable syntactic method for proving the absence of certain program behaviors by classifying phrases according to the kinds of values they compute."
Citit soorces
- Pierce, Benjamin C. (2002). Types and Programming Languages. MIT Press. ISBN 978-0-262-16209-8.CS1 maint: ref=harv (link)