Variables and Types in Zig
Zig is a systems programming language with a static, strong type system that prefers being explicit over being clever. Every binding is either const (immutable) or var (mutable), every numeric …
Zig is a systems programming language with a static, strong type system that prefers being explicit over being clever. Every binding is either const (immutable) or var (mutable), every numeric …
Vale is a statically typed systems language with full type inference, single ownership, and generational references for memory safety. That combination shapes how variables work: by default, every …
Read more →V is a statically typed, strongly typed language that leans heavily on type inference. You rarely need to write type names, yet every value still has a fixed compile-time type. V also takes a strong …
Read more →TypeScript is a typed superset of JavaScript, and its type system is where the language earns its keep. While JavaScript will happily let you assign any value to any variable and worry about it later, …
Read more →Tcl’s approach to variables is unlike almost any other mainstream language. Rooted in the design philosophy that everything is a string, Tcl has no type declarations, no type keywords, and no …
Read more →Swift’s type system is one of its defining features: static and strong, yet flexible enough that you rarely need to write types explicitly. The compiler infers types from context, catches …
Read more →Standard ML takes a different approach to “variables” than most imperative languages. In SML, what other languages call variables are more accurately called value bindings — names bound to …
Read more →SNOBOL4 has one of the most permissive type systems of any classic language. There are no type declarations, no var or let keywords, and no fixed types attached to names — a variable simply becomes …
In Smalltalk, every value is an object — integers, floats, booleans, even nil and true. There are no primitive types, no special cases. This purity makes Smalltalk’s type system remarkably …
Scheme is a dynamically typed language, meaning types are attached to values rather than to variable names. There are no type declarations — you bind a name to a value with define, and Scheme tracks …
Showing 1–10 of 69 posts (page 1 of 7)