A frontend written inC++, called gofrontend,[18] originally aGCC frontend, providing gccgo, a GCC-based Go compiler;[19] later extended to also supportLLVM, providing an LLVM-based Go compiler called gollvm.[20]
Go was publicly announced in November 2009,[28] and version 1.0 was released in March 2012.[29][30] Go is widely used in production at Google[31] and in many other organizations and open-source projects.
In retrospect the Go authors judged Go to be successful due to the overall engineering work around the language, including the runtime support for the language's concurrency feature.
Although the design of most languages concentrates on innovations in syntax, semantics, or typing, Go is focused on the software development process itself. ... The principal unusual property of the language itself—concurrency—addressed problems that arose with the proliferation of multicore CPUs in the 2010s. But more significant was the early work that established fundamentals for packaging, dependencies, build, test, deployment, and other workaday tasks of the software development world, aspectsthat are not usually foremost in language design.[32]
Thegophermascot was introduced in 2009 for theopen source launch of the language.Renée French, who had designed the rabbit mascot forPlan 9, adapted the gopher from an earlierWFMU T-shirt design.[33]
In November 2016, the Go and Go Mono fonts were released by type designersCharles Bigelow andKris Holmes specifically for use by the Go project. Go is ahumanist sans-serif resemblingLucida Grande, and Go Mono ismonospaced. Both fonts adhere to theWGL4 character set and were designed to be legible with a largex-height and distinctletterforms. Both Go and Go Mono adhere to theDIN 1450 standard by having a slashed zero, lowercasel with a tail, and an uppercaseI with serifs.[34][35]
In April 2018, the original logo was redesigned by brand designer Adam Smith. The new logo is a modern, stylized GO slanting right with trailing streamlines. The gopher mascot remained the same.[36]
The lack of support forgeneric programming in initial versions of Go drew considerable criticism.[37] The designers expressed an openness to generic programming and noted that built-in functionswere in fact type-generic, but are treated as special cases; Pike called this a weakness that might be changed at some point.[38] The Google team built at least one compiler for an experimental Go dialect with generics, but did not release it.[39]
In August 2018, the Go principal contributors published draft designs for generic programming anderror handling and asked users to submit feedback.[40][41] However, the error handling proposal was eventually abandoned.[42]
In June 2020, a new draft design document[43] was published that would add the necessary syntax to Go for declaring generic functions and types. A code translation tool,go2go, was provided to allow users to try the new syntax, along with a generics-enabled version of the online Go Playground.[44]
Generics were finally added to Go in version 1.18 on March 15, 2022.[45]
Go 1 guarantees compatibility[46] for the language specification and major parts of the standard library. All versions up through the current Go 1.24 release[47] have maintained this promise.
Go uses ago1.[major].[patch] versioning format, such asgo1.24.0 and each major Go release is supported until there are two newer major releases. Unlike most software, Go calls the second number in a version the major, i.e., ingo1.24.0 the24 is the major version.[48] This is because Go plans to never reach 2.0, prioritizing backwards compatibility over potential breaking changes.[49]
Go's syntax includes changes fromC aimed at keeping code concise and readable. A combined declaration/initialization operator was introduced that allows the programmer to writei:=3 ors:="Hello, world!",without specifying the types of variables used. This contrasts with C'sinti=3; andconstchars[]="Hello, world!"; (though sinceC23 type inference has been supported usingauto, likeC++). Go also removes the requirement to use parentheses in if statement conditions.
Semicolons still terminate statements;[a] but are implicit when the end of a line occurs.[b]
Methods may return multiple values, and returning aresult,err pair is the conventional way a method indicates an error to its caller in Go.[c] Go adds literal syntaxes for initializing struct parameters by name and for initializingmaps andslices. As an alternative to C's three-statementfor loop, Go'srange expressions allow concise iteration over arrays, slices, strings, maps, and channels.[58]
Go has a number of built-in types, including numeric ones (byte,int64,float32, etc.),Booleans, and byte strings (string). Strings are immutable; built-in operators and keywords (rather than functions) provide concatenation, comparison, andUTF-8 encoding/decoding.[60]Record types can be defined with thestruct keyword.[61]
Note thatbyte is an alias foruint8 andrune is an alias forint32.
For each typeT and each non-negative integer constantn, there is anarray type denoted[n]T; arrays of differing lengths are thus of different types.Dynamic arrays are available as "slices", denoted[]T for some typeT (compare to other languages like C/C++ andJava, where instead the arrays are denotedT[]) These have a length and acapacity specifying when new memory needs to be allocated to expand the array. Several slices may share their underlying memory.[38][63][64]
Pointers are available for all types, and the pointer-to-T type is denoted*T (similar toRust; compare to other languages like C/C++ andC#, where pointers are denotedT*). Address-taking and indirection use the& and* operators, as in C, or happen implicitly through the method call or attribute access syntax.[65][66] There is no pointer arithmetic,[d] except via the specialunsafe.Pointer type in the standard library.[67]
For a pair of typesK,V, the typemap[K]V is the type mapping type-K keys to type-V values, which can be thought of as equivalent toMap<K, V> in other languages. The Go Programming Language specification does not give any performance guarantees or implementation requirements for map types, though it is usually implemented as ahash table (equivalent toHashMap<K, V> in other languages). Hash tables are built into the language, with special syntax and built-in functions.chan T is achannel that allows sending values of typeT betweenconcurrent Go processes.[68]
Aside from its support forinterfaces, Go's type system isnominal: thetype keyword can be used to define a newnamed type, which is distinct from other named types that have the same layout (in the case of astruct, 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.[69] For example, thetype keyword can be used to define a type forIPv4 addresses, based on 32-bit unsigned integers as follows:
typeipv4addruint32
With this type definition,ipv4addr(x) interprets theuint32 valuex as an IP address. Simply assigningx to a variable of typeipv4addr is a type error.[70]
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.[71]
Function types are indicated by thefunc keyword; they take zero or moreparameters andreturn 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 astring and a 32-bit signed integer, and return a signed integer (of default width) and a value of the built-in interface typeerror.[72]
Any named type has amethod set associated with it. The IP address example above can be extended with a method for checking whether its value is a known standard:
// ZeroBroadcast reports whether addr is 255.255.255.255.func(addripv4addr)ZeroBroadcast()bool{returnaddr==0xFFFFFFFF}
Due to nominal typing, this method definition adds a method toipv4addr, but not onuint32. While methods have special definition and call syntax, there is no distinct method type.[73]
The first isembedding, which can be viewed as an automated form ofcomposition.[74]
The second are itsinterfaces, which providesruntime polymorphism.[75]: 266 Interfaces are a class of types and provide a limited form ofstructural typing in the otherwise nominal type system of Go. An object which is of an interface type is also of another type, much likeC++ objects being simultaneously of a base and derived class. The design of Go interfaces was inspired byprotocols from the Smalltalk programming language.[76] Multiple sources use the termduck typing when describing Go interfaces.[77][78] Although the term duck typing is not precisely defined and therefore not wrong, it usually implies that type conformance is not statically checked. Because conformance to a Go interface is checked statically by the Go compiler (except when performing a type assertion), the Go authors prefer the termstructural typing.[79]
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, ifShape,Squareand Circle are defined as
import"math"typeShapeinterface{Area()float64}// Note: no "implements" declarationtypeSquarestruct{sidefloat64}func(sqSquare)Area()float64{returnsq.side*sq.side}// No "implements" declaration here eithertypeCirclestruct{radiusfloat64}func(cCircle)Area()float64{returnmath.Pi*math.Pow(c.radius,2)}
then both aSquare and aCircle are implicitly aShape and can be assigned to aShape-typed variable.[75]: 263–268 In formal language, Go's interface system providesstructural rather thannominal 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.[75]: 270
The Go standard library uses interfaces to provide genericity in several places, including the input/output system that is based on the concepts ofReader andWriter.[75]: 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 thetype assertion,[80] which checks against a single potential type:
varshpShape=Square{5}square,ok:=shp.(Square)// Asserts Square type on shp, should workifok{fmt.Printf("%#v\n",square)}else{fmt.Println("Can't print shape as Square")}
and thetype switch,[81] which checks against multiple types:[citation needed]
func(sqSquare)Diagonal()float64{returnsq.side*math.Sqrt2}func(cCircle)Diameter()float64{return2*c.radius}funcLongestContainedLine(shpShape)float64{switchv:=shp.(type){caseSquare:returnv.Diagonal()// Or, with type assertion, shp.(Square).Diagonal()caseCircle:returnv.Diameter()// Or, with type assertion, shp.(Circle).Diameter()default:return0// In practice, this should be handled with errors}}
Theempty interfaceinterface{} is an important base case because it can refer to an item ofany concrete type. It is similar to theObject class inJava orC# orvoid* inC orAny inC++ andRust and is satisfied by any type, including built-in types likeint.[75]: 284 Code using the empty interface cannot simply call methods (or built-in operators) on the referred-to object, but it can store theinterface{} value, try to convert it to a more useful type via a type assertion or type switch, or inspect it with Go'sreflect package.[82] Becauseinterface{} can refer to any value, it is a limited way to escape the restrictions of static typing, likevoid* in C but with additional run-time type checks.[citation needed]
Theinterface{} type can be used to model structured data of any arbitrary schema in Go, such asJSON orYAML data, by representing it as amap[string]interface{} (map of string to empty interface). This recursively describes data in the form of a dictionary with string keys and values of any type.[83]
Interface values are implemented using pointer to data and a second pointer to run-time type information.[84] Like some other types implemented using pointers in Go, interface values arenil if uninitialized.[85]
Since version 1.18, Go supports generic code using parameterized types.[86]
Functions and types now have the ability to be generic using type parameters. These type parameters are specified within square brackets, right after the function or type name.[87] The compiler transforms the generic function or type into non-generic by substitutingtype arguments for the type parameters provided, either explicitly by the user or type inference by the compiler.[88] This transformation process is referred to as type instantiation.[89]
Interfaces now can define a set of types (known as type set) using| (Union) operator, as well as a set of methods. These changes were made to support type constraints in generics code. For a generic function or type, a constraint can be thought of as the type of the type argument: a meta-type. This new~T syntax will be the first use of~ as a token in Go.~T means the set of all types whose underlying type isT.[90]
typeNumberinterface{~int|~float64|~float32|~int32|~int64}funcAdd[TNumber](nums...T)T{varsumTfor_,v:=rangenums{sum+=v}returnsum}funcmain(){add:=Add[int]// Type instantiationprintln(add(1,2,3,4,5))// 15res:=Add(1.1,2.2,3.3,4.4,5.5)// Type Inferenceprintln(res)// +1.650000e+001}
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 orhtml). By default other packages' definitions mustalways be prefixed with the other package's name. However the name used can be changed from the package name, and if imported as_, then no package prefix is required. Only thecapitalized names from other packages are accessible:io.Reader is public butbzip2.reader is not.[93] Thego get command can retrieve packages stored in a remote repository[94] 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.[95]
DotGo 2015 - Matt Aimonetti - Applied concurrency in Go
The Go language has built-in facilities, as well as library support, for writingconcurrent programs. The runtime isasynchronous: program execution that performs, for example, a network read will be suspended until data is available to process, allowing other parts of the program to perform other work. This is built into the runtime and does not require any changes in program code. The go runtime also automatically schedules concurrent operations (goroutines) across multiple CPUs; this can achieve parallelism for a properly written program.[96]
The primary concurrency construct is thegoroutine, a type ofgreen thread.[97]: 280–281 A function call prefixed with thego 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 ofoperating-system threads, similar to the scheduling performed inErlang andHaskell's GHC runtime implementation.[98]: 10
While a standard library package featuring most of the classicalconcurrency control structures (mutex locks, etc.) is available,[98]: 151–152 idiomatic concurrent programs instead preferchannels, whichsend messages between goroutines.[99] Optional buffers store messages inFIFO order[100]: 43 and allow sending goroutines to proceed before their messages are received.[97]: 233
Channels are typed, so that a channel of typechan T can only be used to transfer messages of typeT. 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 channelch, whilech <- x sends the valuex (possibly blocking until another goroutine receives the value). The built-inswitch-likeselect statement can be used to implement non-blocking communication on multiple channels; seebelow for an example. Go has a memory model describing how goroutines must use channels or other operations to safely share data.[101]
The existence of channels does not by itself set Go apart fromactor model-style concurrent languages like Erlang, where messages are addressed directly to actors (corresponding to goroutines). In the actor model, channels are themselves actors, therefore addressing a channel just means to address an actor. 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.[98]: 147
From these tools one can build concurrent constructs likeworker 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.[102] Channels have also found uses further from the usual notion of interprocess communication, like serving as a concurrency-safe list of recycled buffers,[103] implementingcoroutines (which helped inspire the namegoroutine),[104] and implementingiterators.[105]
Concurrency-related structural conventions of Go (channels and alternative channel inputs) are derived fromTony Hoare'scommunicating sequential processes model. Unlike previous concurrent programming languages such asOccam orLimbo (a language on which Go co-designer Rob Pike worked),[106] Go does not provide any built-in notion of safe or verifiable concurrency.[107] 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 data race safety, below.
Although Go's concurrency features are not aimed primarily atparallel processing,[96] they can be used to programshared-memorymulti-processor machines. Various studies have been done into the effectiveness of this approach.[108] One of these studies compared the size (inlines 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 forChapel,Cilk andIntel TBB. The study found that the non-expert tended to writedivide-and-conquer algorithms with onego statement per recursion, while the expert wrote distribute-work-synchronize programs using one goroutine per processor core. The expert's programs were usually faster, but also longer.[109]
Go's approach to concurrency can be summarized as "don't communicate by sharing memory; share memory by communicating".[110] There are no restrictions on how goroutines access shared data, makingdata races 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.[107] Furthermore, Go'sinternal data structures like interface values, slice headers, hash tables, and string headers are not immune to data races, so type and memory safety can be violated in multithreaded programs that modify shared instances of those types without synchronization.[111][112] Instead of language support, safe concurrent programming thus relies on conventions; for example, Chisnall recommends an idiom called "aliasesxor mutable", meaning that passing a mutable value (or pointer) over a channel signals a transfer of ownership over the value to its receiver.[98]: 155 The gc toolchain has an optional data race detector that can check for unsynchronized access to shared memory during runtime since version 1.1,[113] additionally a best-effort race detector is also included by default since version 1.6 of the gc runtime for access to themap data type.[114]
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 ofinterfaces to achievedynamic dispatch[h] andcomposition to reuse code. Composition anddelegation are in fact largely automated bystruct embedding; according to researchers Schmageret 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.[74]
Exception handling was initially omitted in Go due to lack of a "design that gives value proportionate to the complexity".[120] An exception-likepanic/recover mechanism that avoids the usualtry-catch control structure was proposed[121] and released in the March 30, 2010 snapshot.[122] The Go authors advise using it 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.[123][124] Across package boundaries, Go includes a canonical error type, and multi-value returns using this type are the standard idiom.[4]
The Go authors put substantial effort into influencing the style of Go programs:
Indentation, spacing, and other surface-level details of code are automatically standardized by thegofmt tool. It uses tabs for indentation and blanks for alignment. Alignment assumes that an editor is using a fixed-width font.[125]golint does additional style checks automatically, but has been deprecated and archived by the Go maintainers.[126]
Tools and libraries distributed with Go suggest standard approaches to things like API documentation (godoc),[127] testing (go test), building (go build), package management (go get), and so on.
Go enforces rules that are recommendations in other languages, for example banning cyclic dependencies, unused variables[128] or imports,[129] and implicit type conversions.
Theomission of certain features (for example, functional-programming shortcuts likemap and Java-styletry/finally blocks) tends to encourage a particular explicit, concrete, and imperative programming style.
On day one the Go team published a collection of Go idioms,[127] and later also collected code review comments,[130] talks,[131] and official blog posts[132] to teach Go style and coding philosophy.
An ecosystem of third-party tools adds to the standard distribution, such asgocode, which enables code autocompletion in many text editors,goimports, which automatically adds/removes package imports as needed, anderrcheck, which detects code that might unintentionally ignore errors.
The following simple program demonstrates Go'sconcurrency 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. Theselect 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's book).[98]: 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 ofStandard ML, calling it "a shame that no popular language has followed [this] particular route".[143]
Go is extremely easy to dive into. There are a minimal number of fundamental language concepts and thesyntax is clean and designed to be clear and unambiguous.Gois still experimental and still a little rough around the edges.
Go was named Programming Language of the Year by theTIOBE 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,[145] surpassing established languages likePascal. By June 2015, its ranking had dropped to below 50th in the index, placing it lower thanCOBOL andFortran.[146] But as of January 2017, its ranking had surged to 13th, indicating significant growth in popularity and adoption. Go was again awarded TIOBE Programming Language of the Year in 2016.[147]
The complexity ofC++ (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 itsgc implementation in comparison to C++ (GCC), Java andScala 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 optimized the Go code, as well as the C++ code, and got the Go code to run almost as fast as the C++ version and more than an order of magnitude faster than the code in the paper.[150]
Go does not allow an opening brace to appear on its own line, which forces all Go programmers to use the same brace style.[153]
Go has been criticized for focusing on simplicity of implementation rather than correctness and flexibility; as an example, the language usesPOSIX file semantics on all platforms, and therefore provides incorrect information on platforms such asWindows (which do not follow the aforementioned standard).[154][155]
A study showed that it is as easy to make concurrency bugs with message passing as with shared memory, sometimes even more.[156]
On November 10, 2009, the day of the general release of the language, Francis McCabe, developer of theGo! 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.[157] 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[158] even saying the issue contradicts Google's motto of:Don't be evil.[159]
On October 12, 2010, the filed public issue ticket 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."[159]
^But "To allow complex statements to occupy a single line, a semicolon may be omitted before a closing ) or }".[56]
^"if the newline comes after a token that could end a statement, [the lexer will] insert a semicolon".[57]
^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. SeeSemipredicate 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...."[4]
^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...."[4]
^Language FAQ "Why are there no untagged unions...? [they] would violate Go's memory safety guarantees."[4]
^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."[4] (The tag of an interface type[117] is accessed with a type assertion[118]).
^Questions "How do I get dynamic dispatch of methods?" and "Why is there no type inheritance?" in the language FAQ.[4]
This article incorporates material from theofficial Go tutorial, which is licensed under the Creative Commons Attribution 3.0 license.
^"Codewalk: First-Class Functions in Go".Go supports first class functions, higher-order functions, user-defined function types, function literals, closures, and multiple return values. This rich feature set supports a functional programming style in a strongly typed language.
^"Is Go an object-oriented language?". RetrievedApril 13, 2019.Although Go has types and methods and allows an object-oriented style of programming, there is no type hierarchy.
^abSchmager, Frank; Cameron, Nicholas; Noble, James (2010).GoHotDraw: evaluating the Go programming language with design patterns. Evaluation and Usability of Programming Languages and Tools. ACM.
^abcdeBalbaert, Ivo (2012).The Way to Go: A Thorough Introduction to the Go Programming Language. iUniverse.
^"Effective Go".golang.org. The Go Authors. RetrievedMay 13, 2014.
^"Go Wiki: Iota - The Go Programming Language".go.dev. RetrievedMay 15, 2025.Go's iota identifier is used in const declarations to simplify definitions of incrementing numbers. Because it can be used in expressions, it provides a generality beyond that of simple enumerations
^"A Tutorial for the Go Programming Language".The Go Programming Language. RetrievedMarch 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".The Go Programming Language.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 an Example account at example.com/user, that should be your base path
^abDonovan, Alan A. A.; Kernighan, Brian W. (2016).The Go programming language. Addison-Wesley professional computing series. New York, Munich: Addison-Wesley.ISBN978-0-13-419044-0.
^Tang, Peiyi (2010).Multi-core parallel programming in Go(PDF). Proc. First International Conference on Advanced Computing and Communications. Archived fromthe original(PDF) on September 9, 2016. RetrievedMay 14, 2015.
^Tu, Tengfei (2019)."Understanding Real-World Concurrency Bugs in Go"(PDF).For example, around 58% of blocking bugs are caused by message passing. In addition to the violation of Go's channel usage rules (e.g., waiting on a channel that no one sends data to or close), many concurrency bugs are caused by the mixed usage of message passing and other new semantics and new libraries in Go, which can easily be overlooked but hard to detect
