pldb/PLDB huggingface dataset:
g-expressions (pl, appeared 2012)
Also known as: gexp
Origin: https://guix.gnu.org/en/contact/
Country: Various

The GNU Guix project invented G-Expressions to make it easier to "stage" data or code, in the form of S-Expressions, for later manipulation or evaluation. They are similar to S-Expressions, hence the name, but they provide useful code staging features beyond what can be easily accomplished with just "quasiquote" and "unquote". A high-level object (such as a Guix package) can be included in a G-Expression; the transitive dependencies of that high-level object will then be automatically carried along with the G-Expression. When the G-Expression is converted to an S-Expression and stored on disk for later manipulation or evaluation, the high-level object will be automatically "lowered" to an appropriate representation (such as the package's output path) via a "compiler". Compared to direct manipulation of S-Expressions, G-Expressions can provide a simpler and more intuitive way to stage data or code.



(define build-exp
  #~(begin
      (mkdir #$output)
      (chdir #$output)
      (symlink (string-append #$coreutils "/bin/ls")
               "list-files")))
Galaksija BASIC (pl, appeared 1983)
Origin: Microsoft
Country: United States


Galaksija BASIC was the BASIC interpreter of the Galaksija build-it-yourself home computer from Yugoslavia. While being partially based on code taken from TRS-80 Level 1 BASIC, which the creator believed to have been a Microsoft BASIC, the extensive modifications of Galaksija BASIC—such as to include rudimentary array support, video generation code (as the CPU itself did it in absence of dedicated video circuitry) and generally improvements to the programming language—is said to have left not much more than flow-control and floating point code remaining from the original. The core implementation of the interpreter was fully contained in the 4 KiB ROM "A" or "1". The computer's original mainboard had a reserved slot for an extension ROM "B" or "2" that added more commands and features such as a built-in Zilog Z80 assembler.
Gambas (pl, appeared 1999)
Creators: Benoît Minisini
Origin: https://lists.gambas-basic.org/listinfo
Country: France


Gambas is the name of an object-oriented dialect of the BASIC programming language, as well as the integrated development environment that accompanies it. Designed to run on Linux and other Unix-like computer operating systems, its name is a recursive acronym for Gambas Almost Means Basic. Gambas is also the word for prawns in the Spanish,  French, and Portuguese languages, from which the project's logos are derived.
Game Maker Language (pl, appeared 1999)
Origin: YoYo Games Ltd
Country: Scotland, United Kingdom

The language historically tries to accommodate different programming backgrounds and styles - BASIC/Lua style "and" / "or" keywords can be used interchangeably with C-style "&&" / "||" operators; parentheses around conditions in if-statements and loops can be omitted; semicolons are largely optional[26] (insertion happens at the end of statement; compile error is raised in case of ambiguity). The language's default mode of operation on native platforms is via a stack machine; it can also be source-to-source compiled to C++ via LLVM for higher performance.[27] On HTML5, GML is source-to-source compiled to JavaScript with optimizations and minification applied in non-debug builds.
Game Oriented Assembly Lisp (pl, appeared 1993)
Creators: Andy Gavin
Origin: Naughty Dog, LLC
Country: United States


Game Oriented Assembly Lisp (or GOAL) is a video game programming language developed by Andy Gavin and the Jak and Daxter team at Naughty Dog. It was written using Allegro Common Lisp and used in the development of the entire Jak and Daxter series of games. Syntactically GOAL resembles Scheme, though with many idiosyncratic features such as classes, inheritance, and virtual functions. GOAL encourages an imperative programming style: programs tend to consist of a sequence of events to be executed rather than the functional programming style of functions to be evaluated recursively. This is a diversion from Scheme, which allows such side-effects but does not encourage imperative style. GOAL does not run in an interpreter, but instead is compiled directly into PlayStation 2 machine code for execution. It offers limited facilities for garbage collection, relying extensively on runtime support. It offers dynamic memory allocation primitives designed to make it well-suited to running in constant memory on a video game console. GOAL has extensive support for inlined assembly code using a special rlet form, allowing programmers to freely mix assembly and higher-level constructs within the same function. The GOAL compiler is implemented in Allegro Common Lisp. It supports a long term compiling listener session which gives the compiler knowledge about the state of the compiled and therefore running program, including the symbol table. This, in addition to dynamic linking, allows a function to be edited, recompiled, uploaded, and inserted into a running game without having to restart. The process is similar to the "edit and continue" feature offered by some C++ compilers, but allows the programmer to replace arbitrary amounts of code (even up to entire object files), and does not interrupt the running game with the debugger. This feature was used to implement code as well as level streaming in the Jak and Daxter games. GOAL's first use was for the Jak and Daxter: The Precursor Legacy game. The predecessor language, Game Oriented Object Lisp (GOOL), was also developed by Andy Gavin for the Crash Bandicoot game. Since Naughty Dog no longer employs GOAL's primary development and maintenance engineer and they were under pressure from their new parent company (Sony) to share technology between studios, Naughty Dog transitioned away from Lisp. However, they have since resumed using it for scripting on some PlayStation 3 games, including The Last of Us.
GAME (pl, appeared 1977)
Origin: University of Toronto
Country: Canada


A game is a structured form of play, usually undertaken for enjoyment and sometimes used as an educational tool. Games are distinct from work, which is usually carried out for remuneration, and from art, which is more often an expression of aesthetic or ideological elements. However, the distinction is not clear-cut, and many games are also considered to be work (such as professional players of spectator sports or games) or art (such as jigsaw puzzles or games involving an artistic layout such as Mahjong, solitaire, or some video games). Games are sometimes played purely for entertainment, sometimes for achievement or reward as well. They can be played alone, in teams, or online; by amateurs or by professionals. The players may have an audience of non-players, such as when people are entertained by watching a chess championship. On the other hand, players in a game may constitute their own audience as they take their turn to play. Often, part of the entertainment for children playing a game is deciding who is part of their audience and who is a player. Key components of games are goals, rules, challenge, and interaction. Games generally involve mental or physical stimulation, and often both. Many games help develop practical skills, serve as a form of exercise, or otherwise perform an educational, simulational, or psychological role. Attested as early as 2600 BC, games are a universal part of human experience and present in all cultures. The Royal Game of Ur, Senet, and Mancala are some of the oldest known games.
GAMS (pl, appeared 1988)
Origin: GAMS Development Corp
Country: United States
Website: https://www.gams.com/products/introduction/

The General Algebraic Modeling System (GAMS) is a high-level modeling system for mathematical programming and optimization. It consists of a language compiler and a stable of integrated high-performance solvers. GAMS is tailored for complex, large scale modeling applications, and allows you to build large maintainable models that can be adapted quickly to new situations. GAMS is specifically designed for modeling linear, nonlinear and mixed integer optimization problems.



Sets
       i   canning plants   / Seattle, San-Diego /
       j   markets          / New-York, Chicago, Topeka / ;
Parameters
       a(i)  capacity of plant i in cases
         /    Seattle     350
              San-Diego   600  /
       b(j)  demand at market j in cases
         /    New-York    325
              Chicago     300
              Topeka      275  / ;
Table  d(i,j)  distance in thousands of miles
                  New-York       Chicago      Topeka
    Seattle          2.5           1.7          1.8
    San-Diego        2.5           1.8          1.4  ;
Scalar f  freight in dollars per case per thousand miles  /90/ ;
Parameter
       c(i,j)  transport cost in thousands of dollars per case ;
c(i,j) = f * d(i,j) / 1000 ;
Variables
     x(i,j)  shipment quantities in cases
     z       total transportation costs in thousands of dollars ;
Positive variables x ;
Equations
     cost        define objective function
     supply(i)   observe supply limit at plant i
     demand(j)   satisfy demand at market j ;
cost ..        z  =e=  sum((i,j), c(i,j)*x(i,j)) ;
supply(i) ..   sum(j, x(i,j))  =l=  a(i) ;
demand(j) ..   sum(i, x(i,j))  =g=  b(j) ;
Model transport /all/ ;
Solve transport using LP minimizing z ;
GAP (pl, appeared 1986)
Stands for: Groups, Algorithms and Programming
Creators: gap
Origin: RWTH Aachen University
Country: Germany
Website: http://www.gap-system.org/


GAP (Groups, Algorithms and Programming) is a computer algebra system for computational discrete algebra with particular emphasis on computational group theory.

GitHub description: Main development repository for GAP - Groups, Algorithms, Programming, a System for Computational Discrete Algebra
GARP (pl, appeared 1988)
Origin: University of Illinois
Columbia University
Country: United States


The term or acronym GARP can refer to:  Generic Attribute Registration Protocol, a communications protocol Genetic Algorithm for Rule Set Production, to determine ecological niches Global Atmospheric Research Programme, 1967-1982 Gratuitous Address Resolution ProtocolOr it could refer to the following fictional works or characters:  Monkey D. Garp, a character in the Japanese anime One Piece The World According to Garp, a 1978 novel by John Irving The World According to Garp (film), a 1982 film based on Irving's novel
GNU Assembler (compiler, appeared 1986)
Origin: GNU Project


The GNU Assembler, commonly known as gas or simply as, its executable name, is the assembler used by the GNU Project. It is the default back-end of GCC. It is used to assemble the GNU operating system and the Linux kernel, and various other software. It is a part of the GNU Binutils package. The GAS executable is named as, the standard name for a Unix assembler. GAS is cross-platform, and both runs on and assembles for a number of different computer architectures. Released under the GNU General Public License v3, GAS is free software.
Gauche Scheme implementation (pl, appeared 1998)
Origin: https://sourceforge.net/p/gauche/mailman/gauche-devel/
Country: United States
Website: http://practical-scheme.net/gauche/


Gauche is an R7RS Scheme implementation.  It is designed for scripting in a production environment.  It is intended to allow programmers and system administrators to write scripts in support of daily operations. Quick startup, built-in system interface, native multilingual support are some of its key design goals. Gauche is free software under the BSD License.  It is primarily developed by Shiro Kawai.
Google Data Protcol (protocol, appeared 2007)
Origin: Google
Country: United States

The GData Protocol is a REST-inspired technology for reading, writing, and modifying information on the web. It supports two primary modes of access, AtomPub and JSON.

GData (Google Data Protocol) provides a simple protocol for reading and writing data on the Internet, designed by Google. GData combines common XML-based syndication formats (Atom and RSS) with a feed-publishing system based on the Atom Publishing Protocol, plus some extensions for handling queries. It relies on XML or JSON as a data format. Google provides GData client libraries for Java, JavaScript, .NET, PHP, Python, and Objective-C.
GNU Data Language (idl, appeared 2004)
Stands for: GNU Data Language
Creators: Marc Schellens
Origin: https://github.com/gnudatalanguage/gdl/issues
Country: Various
Website: http://gnudatalanguage.sourceforge.net/


The GNU Data Language (GDL) is a free alternative to IDL (Interactive Data Language). Together with its library routines, GDL is developed to serve as a tool for data analysis and visualization in such disciplines as astronomy, geosciences, and medical imaging. GDL is licensed under the GPL. Other open-source numerical data analysis tools similar to GDL include GNU Octave, NCAR Command Language (NCL), Perl Data Language (PDL), R, Scilab, SciPy, and Yorick. GDL as a language is dynamically-typed, vectorized, and has object-oriented programming capabilities. GDL library routines handle numerical calculations (e.g. FFT), data visualisation, signal/image processing, interaction with host OS, and data input/output. GDL supports several data formats, such as NetCDF, HDF (v4 & v5), GRIB, PNG, TIFF, and DICOM. Graphical output is handled by X11, PostScript, SVG, or z-buffer terminals, the last one allowing output graphics (plots) to be saved in raster graphics formats. GDL features integrated debugging facilities, such as breakpoints. GDL has a Python bridge (Python code can be called from GDL; GDL can be compiled as a Python module). GDL uses Eigen (C++ library) numerical library (similar to Intel MKL) to have excellent computing performance on multi-cores processors, with better benchmark than IDL on large matrix operations. Packaged versions of GDL are available for several Linux and BSD flavours as well as Mac OS X. The source code compiles on Microsoft Windows (since GDL 0.9.3) and other UNIX systems, including Solaris. GDL is not an official GNU package.
GDScript (pl, appeared 2008)
Origin: https://github.com/godotengine
Country: Various
Website: http://docs.godotengine.org/en/3.0/getting_started/scripting/gdscript/gdscript_basics.html

GDScript is a high level, dynamically typed programming language used to create content. It uses a syntax similar to Python (blocks are indent-based and many keywords are similar). Its goal is to be optimized for and tightly integrated with Godot Engine, allowing great flexibility for content creation and integration.



# A file is a class!

# Inheritance

extends BaseClass

# Member Variables

var a = 5
var s = "Hello"
var arr = [1, 2, 3]
var dict = {"key": "value", 2:3}

# Constants

const ANSWER = 42
const THE_NAME = "Charly"
Geany (editor, appeared 2005)
Creators: Enrico Tröger
Origin: https://github.com/geany
Country: Various
Website: https://geany.org/


Geany (IPA:ʒeːniː) is a lightweight GUI text editor using Scintilla and GTK, including basic IDE features. It is designed to have short load times, with limited dependency on separate packages or external libraries on Linux. It has been ported to a wide range of operating systems, such as BSD, Linux, macOS, Solaris and Windows. The Windows port lacks an embedded terminal window; also missing from the Windows version are the external development tools present under Unix, unless installed separately by the user. Among the supported programming languages and markup languages are C, C++, C#, Java, JavaScript, PHP, HTML, LaTeX, CSS, Python, Perl, Ruby, Pascal, Haskell, Erlang, Vala and many others.In contrast to traditional Unix-based editors like Emacs or Vim, Geany more closely resembles programming editors common on Microsoft Windows such as Notepad++, which also uses Scintilla.It is free software licensed under the terms of the GNU GPL version 2 or later. In 2012, the version number was increased to 1.22 from 0.21 to reflect the maturity of the product, as requested by many users.
Generic Expression Language (textMarkup, appeared 2008)
Stands for: Generic Expression Language
Origin: University of Texas at Austin
Country: United States

Generic Expression Language (Gel) is a rich generic syntax that embodies many of the common syntactic conventions for operators, grouping and lists in widely-used languages. Prefix/infix operators are disambiguated by white-space, so that documents which violate common white-space conventions will not necessarily parse correctly with Gel. With some character replacements and adjusting for mismatch in operator precedence, Gel can extract meaningful structure from typical files in many languages, including Java, CSS, Smalltalk, and ANTLR grammars. This evaluation shows the expressive power of Gel, not that Gel can be used as a parser for existing languages. Gel is intended to serve as a generic language for creating composable domainspecific languages.
Gellish (textMarkup, appeared 2005)
Origin: Shell Internationale Petroleum
Shell Global Solutions International
International Standardization Organization
Country: United Kingdom and Switzerland


Gellish is a formal language that is natural language independent, although its concepts have 'names' and definitions in various natural languages. Any natural language variant, such as Gellish Formal English is a controlled natural language. Information and knowledge can be expressed in such a way that it is computer-interpretable, as well as system-independent and natural language independent. Each natural language variant is a structured subset of that natural language and is suitable for information modeling and knowledge representation in that particular language. All expressions, concepts and individual things are represented in Gellish by (numeric) unique identifiers (Gellish UID's). This enables software to translate expressions from one formal natural language to any other formal natural language. Gellish is a universal and extendable conceptual data modeling language. Because it includes domain-specific terminology and definitions, it is also a semantic data modelling language and the Gellish modeling methodology is a member of the family of semantic modeling methodologies. Gellish started out as an engineering modeling language ("Generic Engineering Language", hence the name, "Gellish") and was subsequently developed into a language with general applications.
Gello Expression Language (pl, appeared 2001)
Origin: American National Standards Institute
Country: United States


The GELLO Expression Language was started in 2001 and introduced in 2002; in 2005, GELLO was adopted as an international standard by Health Level Seven International and ANSI for a decision support language. GELLO Release 2 was completed and approved by ANSI in June 2010. The GELLO specifications have been developed in coordination with the HL7 Clinical Decision Support TC (CDSTC)GELLO is a class-based object-oriented programming language and a relative of the Object Constraint Language (OCL). OCL is a well-developed constraint language that makes it attractive for use as an expression language. The intention was for GELLO to evolve as a standard query and expression language for decision support.GELLO creates the potential for many decision support options, as the full array of atomic patient data is greatly accessible to complement better, safer clinical decision making by health professionals. Furthermore, this enables specialist clinicians to customize their current systems and create flexible purpose built decision support systems.Standardization of GELLO it has made this language compatible with the HL7 version 3.0 Reference Information Model (RIM). GELLO uses an abstract "virtual medical record" (vMR) so that the same GELLO code can run on multiple systems accessing data stored in different formats. The vMR is a simplified view of the HL7 RIM.The current focus of the HL7 CDS WG is to build on the Clinical Quality Language (CQL)
General-purpose macro processor (grammarLanguage, appeared 1995)
Origin: https://sourceforge.net/p/gema/mailman/
Country: Various
Website: http://gema.sourceforge.net/new/index.shtml


A general-purpose macro processor or general purpose preprocessor is a macro processor that is not tied to or integrated with a particular language or piece of software. A macro processor is a program that copies a stream of text from one place to another, making a systematic set of replacements as it does so. Macro processors are often embedded in other programs, such as assemblers and compilers. Sometimes they are standalone programs that can be used to process any kind of text. Macro processors have been used for language expansion (defining new language constructs that can be expressed in terms of existing language components), for systematic text replacements that require decision making, and for text reformatting (e.g. conditional extraction of material from an HTML file).


gema -match -p 'Title\:*\n=$0@end' foo
Generic Haskell (pl, appeared 2000)
Origin: Uppsala University
Utrecht University
University of Oxford
Country: Sweden and Netherlands and United Kingdom

Since datatypes often change and new datatypes are introduced, we have developed Generic HASKELL which supports generic definitions to save the programmer from (re)writing instances of generic functions. Generic HASKELL extends the functional programming language Haskell [5] with, among other things, a construct for defining type-indexed values with kind-indexed types, based on recent work by Hinze [2]. These values can be specialised to all Haskell datatypes, facilitating wider application of generic programming than provided by earlier systems such as PolyP
Genero Business Development Language (pl, appeared 2010)
Origin: Four Js Development Tools Inc
Country: United States

Genero Business Development Language (BDL) is a program language designed to write an interactive database application.



OPTIONS SHORT CIRCUIT 
IMPORT FGL cust_data
SCHEMA stores

PRIVATE CONSTANT c_title = "Customer data form"
PUBLIC TYPE t_cust RECORD LIKE customer.*
PRIVATE DEFINE cust_arr DYNAMIC ARRAY OF t_cust

MAIN
    ...
END MAIN

DIALOG cust_dlg()
    INPUT BY NAME cust_rec.*
       ...
    END INPUT
END DIALOG

FUNCTION cust_display()
   ...
END FUNCTION

FUNCTION cust_input()
   ...
END FUNCTION

REPORT cust_rep(row)
   ...
END REPORT
GeneXus (pl, appeared 1988)
Origin: ARTech Consultores SRL
Country: Uruguay


GeneXus is a Cross-Platform, knowledge representation-based, development tool, mainly oriented to enterprise-class applications for  Web applications, smart devices and the Microsoft Windows platform. A developer describes an application in a high-level, mostly declarative language, from which native code is generated for multiple environments. It includes a normalization module, which creates and maintains an optimal database structure based on the user views of the reality described in a declarative (rule-based) language. The languages for which code can be generated include, COBOL, Java including Android and BlackBerry smart devices, Objective-C for Apple mobile devices, RPG, Ruby, Visual Basic, and Visual FoxPro.Most popular DBMSs are supported, such as Microsoft SQL Server, Oracle, DB2, Informix, PostgreSQL and MySQL. GeneXus is developed by Uruguayan company ARTech Consultores SRL.The latest version is Genexus 16, which was released in 2018.