Go was publicly announced in November 2009,[29] and version 1.0 was released in March 2012.[30][31] Go is widely used in production at Google[32] and in many other organizations and open-source projects.

In April 2018, the original logo was replaced with a stylized GO slanting right with trailing streamlines. However, the gophermascot remained the same.[35]

In August 2018, the Go principal contributors published two ″draft designs″ for new language features, Generics and Error Handling, and asked Go users to submit feedback on them.[36][37]
Lack of support for generic programming and the verbosity of error handling in Go 1.x had drawn considerable criticism.

In Go 1.1, an integer division by constant zero is not a legal program, so it is a compile-time error.

The definition of string and rune literals has been refined to exclude surrogate halves from the set of valid Unicode code points.

Loosened return requirements rules. If the compiler can prove that a function always returns before reaching the end of a function, a final terminating statement can be omitted.

The language allows the implementation to choose whether the int type and uint types are 32 or 64 bits.

On 64-bit architectures, the maximum heap size has been enlarged substantially, from a few gigabytes to several tens of gigabytes.

Addition of a race detector to the standard tool set.

1.2 - 1.2.2

2013/12/01

The language now specifies that, for safety reasons, certain uses of nil pointers are guaranteed to trigger a run-time panic.

Go 1.2 adds the ability to specify the capacity as well as the length when using a slicing operation on an existing array or slice. A slicing operation creates a new slice by describing a contiguous section of an already-created array or slice.

The runtime scheduler can now be invoked on (non-inlined) function calls.

Go 1.2 introduces a configurable limit (default 10,000) to the total number of threads a single program may have.

In Go 1.2, the minimum size of the stack when a goroutine is created has been lifted from 4KB to 8KB.

1.3 - 1.3.3

2014/06/18

There are no language changes in this release.

The Go 1.3 memory model adds a new rule concerning sending and receiving on buffered channels, to make explicit that a buffered channel can be used as a simple semaphore, using a send into the channel to acquire and a receive from the channel to release.

Go 1.3 has changed the implementation of goroutine stacks away from the old, "segmented" model to a contiguous model.

For a while now, the garbage collector has been precise when examining values in the heap; the Go 1.3 release adds equivalent precision to values on the stack.

Iterations over small maps no longer happen in a consistent order. This is due to developers abusing implementation behaviour.

1.4 - 1.4.3

2014/12/10

Range-expression without assignment

Automatic double-dereference on method calls is now disallowed in gc and gccgo. This is a backwards incompatible change but inline within the language specification.

In 1.4, much of the runtime code has been translated to Go so that the garbage collector can scan the stacks of programs in the runtime and get accurate information about what variables are active.

The language accepted by the assemblers cmd/5a, cmd/6a and cmd/8a has had several changes, mostly to make it easier to deliver type information to the runtime.

Addition of internal packages.

New subcommand go generate.

1.5 - 1.5.4

2015/08/19

Due to an oversight, the rule that allowed the element type to be elided from slice literals was not applied to map keys. This has been corrected in Go 1.5.

The compiler and runtime are now implemented in Go and assembler, without C. Now that the Go compiler and runtime are implemented in Go, a Go compiler must be available to compile the distribution from source. The compiler is now self-hosted.

The garbage collector has been re-engineered for 1.5. The "stop the world" phase of the collector will almost always be under 10 milliseconds and usually much less.

In Go 1.5, the order in which goroutines are scheduled has been changed.

1.6 - 1.6.4

2016/02/17

There are no language changes in this release.

A major change was made to cgo defining the rules for sharing Go pointers with C code, to ensure that such C code can coexist with Go's garbage collector.

The Go parser is now hand-written instead of generated.

The go vet command now diagnoses passing function or method values as arguments to Printf, such as when passing f where f() was intended.

1.7 - 1.7.6

2016/08/15

Clarification on terminating statements in the language specification. This does not change existing behaviour.

This release includes a new code generation back end for 64-bit x86 systems, based on SSA.

Packages using cgo may now include Fortran source files (in addition to C, C++, Objective C, and SWIG), although the Go bindings must still use C language APIs.

The new subcommand “gotooldistlist” prints all supported operating system/architecture pairs.

1.8 - 1.8.7

2017/02/16

When explicitly converting a value from one struct type to another, as of Go 1.8 the tags are ignored. Thus two structs that differ only in their tags may be converted from one to the other.

For 64-bit x86 systems, the following instructions have been added: VBROADCASTSD, BROADCASTSS, MOVDDUP, MOVSHDUP, MOVSLDUP, VMOVDDUP, VMOVSHDUP, and VMOVSLDUP.

Garbage collection pauses should be significantly shorter than they were in Go 1.7, usually under 100 microseconds and often as low as 10 microseconds. See the document on eliminating stop-the-world stack re-scanning for details.

The overhead of deferred function calls has been reduced by about half.

The overhead of calls from Go into C has been reduced by about half.

1.9 - 1.9.7

2017/08/24

Go now supports type aliases.

Force the intermediate rounding in floating-point arithmetic.

The Go compiler now supports compiling a package's functions in parallel, taking advantage of multiple cores.

1.10 - 1.10.7

2018/02/16

A corner case involving shifts of untyped constants has been clarified.

The grammar for method expressions has been updated to relax the syntax to allow any type expression as a receiver.

For the X86 64-bit port, the assembler now supports 359 new instructions, including the full AVX, AVX2, BMI, BMI2, F16C, FMA3, SSE2, SSE3, SSSE3, SSE4.1, and SSE4.2 extension sets. The assembler also no longer implements MOVL$0,AX as an XORL instruction, to avoid clearing the condition flags unexpectedly.

Go's syntax includes changes from C aimed at keeping code concise and readable. A combined declaration/initialization operator was introduced that allows the programmer to write i := 3 or s := "Hello, world!", without specifying the types of variables. This contrasts with C's int i = 3; and const char *s = "Hello, world!";. Semicolons still terminate statements,[a] but are implicit when the end of a line occurs.[b] Functions may return multiple values, and returning a result, err pair is the conventional way a function indicates an error to its caller in Go.[c] Go adds literal syntaxes for initializing struct parameters by name, and for initializing maps and slices. As an alternative to C's three-statement for loop, Go's range expressions allow concise iteration over arrays, slices, strings, maps, and channels.[citation needed]

Go has a number of built-in types, including numeric ones (byte, int64, float32, etc.), booleans, and character strings (string). Strings are immutable; built-in operators, and keywords (rather than functions) provide concatenation, comparison, and UTF-8 encoding/decoding.[51]Record types can be defined with the struct keyword.[52]

For each type T and each non-negative integer constant n, there is an array type denoted [n]T; arrays of differing lengths are thus of different types. Dynamic arrays are available as "slices", denoted []T for some type T. These have a length and a capacity specifying when new memory needs to be allocated to expand the array. Several slices may share their underlying memory.[53][54][55]

Pointers are available for all types, and the pointer-to-T type is denoted *T. Address-taking and indirection use the & and * operators as in C, or happen implicitly through the method call or attribute access syntax.[56] There is no pointer arithmetic,[d] except via the special unsafe.Pointer type in the standard library.[57]

For a pair of types K, V, the type map[K]V is the type of hash tables mapping type-K keys to type-V values. Hash tables are built into the language, with special syntax and built-in functions. chan T is a channel that allows sending values of type T between concurrent Go processes.[citation needed]

Aside from its support for interfaces, Go's type system is nominal: the type keyword can be used to define a new named type, which is distinct from other named types that have the same layout (in the case of a struct, the same members in the same order). Some conversions between types (e.g., between the various integer types) are pre-defined and adding a new type may define additional conversions, but conversions between named types must always be invoked explicitly.[58] For example, the type keyword can be used to define a type for IPv4 addresses, based on 32-bit unsigned integers.[citation needed]

typeipv4addruint32

With this type definition, ipv4addr(x) interprets the uint32 value x as an IP address. Simply assigning x to a variable of type ipv4addr is a type error.[citation needed]

Constant expressions may be either typed or "untyped"; they are given a type when assigned to a typed variable if the value they represent passes a compile-time check.[59]

Function types are indicated by the func keyword; they take zero or more parameters and return zero or more values, all of which are typed. The parameter and return values determine a function type; thus, func(string, int32) (int, error) is the type of functions that take a string and a 32-bit signed integer, and return a signed integer (of default width) and a value of the built-in interface type error.[citation needed]

Any named type has a method set associated with it. The IP address example above can be extended with a method for checking whether its value is a known standard.

The second are its interfaces, which provides runtime polymorphism.[63]:266 Interfaces are a class of types and provide a limited form of structural typing in the otherwise nominal type system of Go. An object which is of an interface type is also of another type, much like C++ objects being simultaneously of a base and derived class. Go interfaces were designed after protocols from the Smalltalk programming language.[64] Multiple sources use the term duck typing when describing Go interfaces.[65][66] Although the term duck typing is not precisely defined and therefore not wrong, it usually implies that type conformance is not statically checked. Since conformance to a Go interface is checked statically by the Go compiler (except when performing a type assertion), the Go authors prefer the term structural typing.[67]

The definition of an interface type lists required methods by name and type. Any object of type T for which functions exist matching all the required methods of interface type I is an object of type I as well. The definition of type T need not (and cannot) identify type I. For example,
if Shape, Squareand Circle are defined as:

Both a Square and a Circle are implicitly a Shape and can be assigned to a Shape-typed variable.[63]:263–268 In formal language, Go's interface system provides structural rather than nominal typing. Interfaces can embed other interfaces with the effect of creating a combined interface that is satisfied by exactly the types that implement the embedded interface and any methods that the newly defined interface adds.[63]:270

The Go standard library uses interfaces to provide genericity in several places, including the input/output system that is based on the concepts of Reader and Writer.[63]:282–283

Besides calling methods via interfaces, Go allows converting interface values to other types with a run-time type check. The language constructs to do so are the type assertion,[68] which checks against a single potential type, and the type switch,[69] which checks against multiple types.[citation needed]

The empty interfaceinterface{} is an important base case because it can refer to an item of any concrete type. It is similar to the Object class in Java or C# and is satisfied by any type, including built-in types like int.[63]:284 Code using the empty interface cannot simply call methods (or built-in operators) on the referred-to object, but it can store the interface{} value, try to convert it to a more useful type via a type assertion or type switch, or inspect it with Go's reflect package.[70] Because interface{} can refer to any value, it is a limited way to escape the restrictions of static typing, like void* in C but with additional run-time type checks.[citation needed]

Interface values are implemented using pointer to data and a second pointer to run-time type information.[71] Like some other types implemented using pointers in Go, interface values are nil if uninitialized.[72]

In Go's package system, each package has a path (e.g., "compress/bzip2" or "golang.org/x/net/html") and a name (e.g., bzip2 or html). References to other packages' definitions must always be prefixed with the other package's name, and only the capitalized names from other packages are accessible: io.Reader is public but bzip2.reader is not.[73] The go get command can retrieve packages stored in a remote repository [74] and developers are encouraged to develop packages inside a base path corresponding to a source repository (such as example.com/user_name/package_name) to reduce the likelihood of name collision with future additions to the standard library or other external libraries.[75]

Proposals exist to introduce a proper package management solution for Go similar to Rust's cargo system or Node's npm system.[76]

The Go language has built-in facilities, as well as library support, for writing concurrent programs. Concurrency refers not only to CPU parallelism, but also to asynchrony: letting slow operations like a database or network-read run while the program does other work, as is common in event-based servers.[77]

The primary concurrency construct is the goroutine, a type of light-weight process. A function call prefixed with the go keyword starts a function in a new goroutine. The language specification does not specify how goroutines should be implemented, but current implementations multiplex a Go process's goroutines onto a smaller set of operating system threads, similar to the scheduling performed in Erlang.[78]:10

While a standard library package featuring most of the classical concurrency control structures (mutex locks, etc.) is available,[78]:151–152 idiomatic concurrent programs instead prefer channels, which provide send messages between goroutines.[79] Optional buffers store messages in FIFO order[62]:43 and allow sending goroutines to proceed before their messages are received.[citation needed]

Channels are typed, so that a channel of type chan T can only be used to transfer messages of type T. Special syntax is used to operate on them; <-ch is an expression that causes the executing goroutine to block until a value comes in over the channel ch, while ch <- x sends the value x (possibly blocking until another goroutine receives the value). The built-in switch-like select statement can be used to implement non-blocking communication on multiple channels; see below for an example. Go has a memory model describing how goroutines must use channels or other operations to safely share data.[80]

The existence of channels sets Go apart from actor model-style concurrent languages like Erlang, where messages are addressed directly to actors (corresponding to goroutines). The actor style can be simulated in Go by maintaining a one-to-one correspondence between goroutines and channels, but the language allows multiple goroutines to share a channel or a single goroutine to send and receive on multiple channels.[78]:147

From these tools one can build concurrent constructs like worker pools, pipelines (in which, say, a file is decompressed and parsed as it downloads), background calls with timeout, "fan-out" parallel calls to a set of services, and others.[81] Channels have also found uses further from the usual notion of interprocess communication, like serving as a concurrency-safe list of recycled buffers,[82] implementing coroutines (which helped inspire the name goroutine),[83] and implementing iterators.[84]

Concurrency-related structural conventions of Go (channels and alternative channel inputs) are derived from Tony Hoare'scommunicating sequential processes model. Unlike previous concurrent programming languages such as Occam or Limbo (a language on which Go co-designer Rob Pike worked),[85] Go does not provide any built-in notion of safe or verifiable concurrency.[86] While the communicating-processes model is favored in Go, it is not the only one: all goroutines in a program share a single address space. This means that mutable objects and pointers can be shared between goroutines; see § Lack of race condition safety, below.[citation needed]

Although Go's concurrency features are not aimed primarily at parallel processing,[77] they can be used to program shared memorymulti-processor machines. Various studies have been done into the effectiveness of this approach.[87] One of these studies compared the size (in lines of code) and speed of programs written by a seasoned programmer not familiar with the language and corrections to these programs by a Go expert (from Google's development team), doing the same for Chapel, Cilk and Intel TBB. The study found that the non-expert tended to write divide-and-conquer algorithms with one go statement per recursion, while the expert wrote distribute-work-synchronize programs using one goroutine per processor. The expert's programs were usually faster, but also longer.[88]

There are no restrictions on how goroutines access shared data, making race conditions possible. Specifically, unless a program explicitly synchronizes via channels or other means, writes from one goroutine might be partly, entirely, or not at all visible to another, often with no guarantees about ordering of writes.[86] Furthermore, Go's internal data structures like interface values, slice headers, hash tables, and string headers are not immune to race conditions, so type and memory safety can be violated in multithreaded programs that modify shared instances of those types without synchronization.[89][90] Instead of language support, safe concurrent programming thus relies on conventions; for example, Chisnall recommends an idiom called "aliases xor mutable", meaning that passing a mutable value (or pointer) over a channel signals a transfer of ownership over the value to its receiver.[78]:155

Of the omitted language features, the designers explicitly argue against assertions and pointer arithmetic, while defending the choice to omit type inheritance as giving a more useful language, encouraging instead the use of interfaces to achieve dynamic dispatch[h] and composition to reuse code. Composition and delegation are in fact largely automated by struct embedding; according to researchers Schmager et al., this feature "has many of the drawbacks of inheritance: it affects the public interface of objects, it is not fine-grained (i.e, no method-level control over embedding), methods of embedded objects cannot be hidden, and it is static", making it "not obvious" whether programmers will overuse it to the extent that programmers in other languages are reputed to overuse inheritance.[61]

The designers express an openness to generic programming and note that built-in functions are in fact type-generic, but these are treated as special cases; Pike calls this a weakness that may at some point be changed.[53] The Google team built at least one compiler for an experimental Go dialect with generics, but did not release it.[96] They are also open to standardizing ways to apply code generation.[97]

Initially omitted, the exception-like panic/recover mechanism was eventually added, which the Go authors advise using for unrecoverable errors such as those that should halt an entire program or server request, or as a shortcut to propagate errors up the stack within a package (but not across package boundaries; there, error returns are the standard API).[98][99][100][101]

An ecosystem of third-party tools adds to the standard distribution, such as gocode, which enables code autocompletion in many text editors, goimports (by a Go team member), which automatically adds/removes package imports as needed, and errcheck, which detects code that might unintentionally ignore errors. Plugins exist for adding language support to several text editors. Several IDEs are available, including LiteIDE, a "simple, open source, cross-platform Go IDE",[106] and GoLand, which claims to be "capable and ergonomic."[107]

The following simple program demonstrates Go's concurrency features to implement an asynchronous program. It launches two lightweight threads ("goroutines"): one waits for the user to type some text, while the other implements a timeout. The select statement waits for either of these goroutines to send a message to the main routine, and acts on the first message to arrive (example adapted from David Chisnall book).[78]:152

packagemainimport("fmt""time")funcreadword(chchanstring){fmt.Println("Type a word, then hit Enter.")varwordstringfmt.Scanf("%s",&word)ch<-word}functimeout(tchanbool){time.Sleep(5*time.Second)t<-false}funcmain(){t:=make(chanbool)gotimeout(t)ch:=make(chanstring)goreadword(ch)select{caseword:=<-ch:fmt.Println("Received",word)case<-t:fmt.Println("Timeout.")}}

The interface system, and the deliberate omission of inheritance, were praised by Michele Simionato, who likened these characteristics to those of Standard ML, calling it "a shame that no popular language has followed [this] particular route".[136]

Go is extremely easy to dive into. There are a minimal number of fundamental language concepts and the syntax is clean and designed to be clear and unambiguous.

Go is still experimental and still a little rough around the edges.

Go was named Programming Language of the Year by the TIOBE Programming Community Index in its first year, 2009, for having a larger 12-month increase in popularity (in only 2 months, after its introduction in November) than any other language that year, and reached 13th place by January 2010,[138] surpassing established languages like Pascal. By June 2015, its ranking had dropped to below 50th in the index, placing it lower than COBOL and Fortran.[139] But as of January 2017, its ranking had surged to 13th, indicating significant growth in popularity and adoption. Go was awarded TIOBE programming language of the year 2016.

The complexity of C++ (even more complexity has been added in the new C++), and the resulting impact on productivity, is no longer justified. All the hoops that the C++ programmer had to jump through in order to use a C-compatible language make no sense anymore -- they're just a waste of time and effort. Go makes much more sense for the class of problems that C++ was originally intended to solve.

A 2011 evaluation of the language and its gc implementation in comparison to C++ (GCC), Java and Scala by a Google engineer found:

Go offers interesting language features, which also allow for a concise and standardized notation. The compilers for this language are still immature, which reflects in both performance and binary sizes.

The evaluation got a rebuttal from the Go development team. Ian Lance Taylor, who had improved the Go code for Hundt's paper, had not been aware of the intention to publish his code, and says that his version was "never intended to be an example of idiomatic or efficient Go"; Russ Cox then did optimize the Go code, as well as the C++ code, and got the Go code to run slightly faster than C++ and more than an order of magnitude faster than the code in the paper.[142]

On November 10, 2009, the day of the general release of the language, Francis McCabe, developer of the Go! programming language (note the exclamation point), requested a name change of Google's language to prevent confusion with his language, which he had spent 10 years developing.[143] McCabe raised concerns that "the 'big guy' will end up steam-rollering over" him, and this concern resonated with the more than 120 developers who commented on Google's official issues thread saying they should change the name, with some[144] even saying the issue contradicts Google's motto of: Don't be evil.[145]

On October 12, 2010, the issue was closed by Google developer Russ Cox (@rsc) with the custom status "Unfortunate" accompanied by the following comment:

"There are many computing products and services named Go. In the 11 months since our release, there has been minimal confusion of the two languages."[145]

^but "To allow complex statements to occupy a single line, a semicolon may be omitted before a closing ) or }".[49]

^“if the newline comes after a token that could end a statement, [the lexer will] insert a semicolon”.[50]

^Usually, exactly one of the result and error values has a value other than the type's zero value; sometimes both do, as when a read or write can only be partially completed, and sometimes neither, as when a read returns 0 bytes. See Semipredicate problem: Multivalued return.

^ abLanguage FAQ "Why is there no pointer arithmetic? Safety … never derive an illegal address that succeeds incorrectly … using array indices can be as efficient as … pointer arithmetic … simplify the implementation of the garbage collector…."[12]

^Language FAQ "Why does Go not have assertions? …our experience has been that programmers use them as a crutch to avoid thinking about proper error handling and reporting…."[12]

^Language FAQ "Why does Go not have variant types? … We considered [them but] they overlap in confusing ways with interfaces…. [S]ome of what variant types address is already covered, … although not as elegantly."[12] (The tag of an interface type[93] is accessed with a type assertion[94]).

^Questions "How do I get dynamic dispatch of methods?" and "Why is there no type inheritance?" in the language FAQ.[12]

^"A Tutorial for the Go Programming Language". The Go Programming Language. Google. Retrieved March 10, 2013. In Go the rule about visibility of information is simple: if a name (of a top-level type, function, method, constant or variable, or of a structure field or method) is capitalized, users of the package may see it. Otherwise, the name and hence the thing being named is visible only inside the package in which it is declared.

^"How to Write Go Code". golang.org. The packages from the standard library are given short import paths such as "fmt" and "net/http". For your own packages, you must choose a base path that is unlikely to collide with future additions to the standard library or other external libraries. If you keep your code in a source repository somewhere, then you should use the root of that source repository as your base path. For instance, if you have a Example account at example.com/user, that should be your base path