pldb/PLDB huggingface dataset:
AutoHotkey (pl, appeared 2003)
Origin: AutoHotkey Foundation LLC
Country: United States
Website: https://autohotkey.com


AutoHotkey is a free, open-source custom scripting language for Microsoft Windows, initially aimed at providing easy keyboard shortcuts or hotkeys, fast macro-creation and software automation that allows users of most levels of computer skill to automate repetitive tasks in any Windows application. User interfaces can easily be extended or modified by AutoHotkey (for example, overriding the default Windows control key commands with their Emacs equivalents). The AutoHotkey installation includes its own extensive help file with an always updated web-based version.
AutoIt (pl, appeared 1999)
Creators: Jonathan Bennett
Origin: AutoIt Consulting Ltd
Country: Unknown
Website: http://www.autoitscript.com/autoit3/
Keywords: #include-once
#include
#endregion
#forcedef
#forceref
#region
and
byref
case
continueloop
dim
do
else
elseif
endfunc
endif
endselect
exit
exitloop
for
func
global
if
local
next
not
or
return
select
step
then
to
until
wend
while
exit


AutoIt  is a freeware automation language for Microsoft Windows. In its earliest release, the software was primarily intended to create automation scripts (sometimes called macros) for Microsoft Windows programs but has since grown to include enhancements in both programming language design and overall functionality. While the scripting language in AutoIt 1 and 2 was statement-driven, designed primarily for simulating user interaction, from version 3 onwards the AutoIt syntax is similar to that found in the BASIC family of languages. In this form, AutoIt is a general-purpose, third-generation programming language with a classical data model and a variant data type that can store several types of data, including arrays. While version 1 and 2 were compatible with Windows 95, 98, ME, NT4, 2000, XP, 2003, Vista, Windows 7, support for operating systems older than Windows 2000 was discontinued with the release of v3.3.0 in December 2008. Currently AutoIt is also compatible with Windows 2008, Windows 8, Windows 2012, Windows 10, and the minimal requirement is Windows XP SP3. An AutoIt automation script can be converted into a compressed, stand-alone executable which can be run on computers that do not have the AutoIt interpreter installed. A wide range of function libraries (known as UDFs, or "User Defined Functions") are also included as standard or are available from the website to add specialized functionality. AutoIt is also distributed with an IDE based on the free SciTE editor. The compiler and help text are fully integrated and provide a de facto standard environment for developers using AutoIt.
AutoLISP (pl, appeared 1986)
Creators: David Betz
Origin: Autodesk
Basis Software
Country: United States


AutoLISP is a dialect of the LISP programming language built specifically for use with the full version of AutoCAD and its derivatives, which include AutoCAD Map 3D, AutoCAD Architecture and AutoCAD Mechanical. Neither the application programming interface nor the interpreter to execute AutoLISP code are included in the AutoCAD LT product line.
Avail (pl, appeared 2010)
Creators: Mark van Gulik
Todd L. Smith
Origin: The Avail Foundation, LLC
Country: United States
Website: https://www.availlang.org/

Avail is a multi-paradigmatic general purpose programming language whose feature set emphasizes support for articulate programming.


GitHub description: The Avail programming language. Includes the virtual machine, standard library, and standard examples.

Public method "Play Wump the Wumpus with reader_with reporter_" is
[
    reader : []→string,
    writer : [string]→⊤
|
    /* Set up the game's I/O. */
    Wump the Wumpus reader := reader;
    Wump the Wumpus reporter := writer;
    /* Create a new game. All references to game objects within the block are
     * implicitly understood as relative to this new game.
     */
    newGame ::= a game of Wump the Wumpus;
    Use newGame as the implied game and do
    [
        Welcome;
        Look around, having just entered;
        Until the game is over, do
        [
            Give the agent a turn;
            Give the first swarm a turn;
            Give the second swarm a turn;
            Give the wumpus a turn;
        ];
        If the agent is alive then
        [
            If the wumpus is dead then [Report victory;]
            else [Report cowardice;];
        ]
        else [Report defeat;];
        Goodbye;
    ];
] : ⊤;
Averest (pl, appeared 2005)
Origin: Technical University of Kaiserslautern
Country: Germany


Averest is a synchronous programming language and set of tools to specify, verify, and implement reactive systems. It includes a compiler for synchronous programs, a symbolic model checker, and a tool for hardware/software synthesis. It can be used to model and verify finite and infinite state systems, at varied abstraction levels. It is useful for hardware design, modeling communication protocols, concurrent programs, software in embedded systems, and more. Components: compiler to translate synchronous programs to transition systems, symbolic model checker, tool for hardware/software synthesis. These cover large parts of the design flow of reactive systems, from specifying to implementing. Though the tools are part of a common framework, they are mostly independent of each other, and can be used with 3rd-party tools.
AviSynth (editor, appeared 2000)
Creators: Ben Rudiak-Gould
Edwin van Eggelen
Klaus Post
Richard Berg
Ian Brabham
Origin: https://forum.doom9.org/showthread.php?t=181351
Country: The Netherlands
Website: http://avisynth.nl
File extensions: .avs

Avisynth is a scripting language and a collection of filters for simple (and not so simple!) non-linear video editing tasks. It frameserves video to applications


GitHub description: AviSynth with improvements

filename="somefile.avi"
logfile="output.txt" 
path="P:\ath\To\Files\" 
lumathresh=80 
imageprefix="prefix_"
avro (idl, appeared 2012)
Origin: The Apache Software Foundation
Country: Various
Website: https://avro.apache.org/




{"namespace": "example.avro",
 "type": "record",
 "name": "User",
 "fields": [
     {"name": "name", "type": "string"},
     {"name": "favorite_number",  "type": ["int", "null"]},
     {"name": "favorite_color", "type": ["string", "null"]}
 ]
}
awk (pl, appeared 1977)
Stands for: Aho, Weinberger, Kernighan
Creators: Alfred Aho
Peter J. Weinberger
Brian Kernighan
Origin: Bell Labs
Country: United States
Website: http://www.cs.princeton.edu/~bwk/btl.mirror/


AWK is a programming language designed for text processing and typically used as a data extraction and reporting tool. It is a standard feature of most Unix-like operating systems. The AWK language is a data-driven scripting language consisting of a set of actions to be taken against streams of textual data – either run directly on files or used as part of a pipeline – for purposes of extracting or transforming text, such as producing formatted reports. The language extensively uses the string datatype, associative arrays (that is, arrays indexed by key strings), and regular expressions. While AWK has a limited intended application domain and was especially designed to support one-liner programs, the language is Turing-complete, and even the early Bell Labs users of AWK often wrote well-structured large AWK programs. AWK was created at Bell Labs in the 1970s, and its name is derived from the surnames of its authors—Alfred Aho, Peter Weinberger, and Brian Kernighan. The acronym is pronounced the same as the name of the bird auk (which acts as an emblem of the language such as on The AWK Programming Language book cover – the book is often referred to by the abbreviation TAPL). When written in all lowercase letters, as awk, it refers to the Unix or Plan 9 program that runs scripts written in the AWK programming language.
AWS (cloud, appeared 2006)
Stands for: Amazon Web Services
Origin: Amazon
Country: United States
Website: https://aws.amazon.com/


Amazon Web Services (AWS) is a subsidiary of Amazon.com that provides on-demand cloud computing platforms to individuals, companies and governments, on a paid subscription basis with a free-tier option available for 12 months. The technology allows subscribers to have at their disposal a full-fledged virtual cluster of computers, available all the time, through the Internet. AWS's version of virtual computers have most of the attributes of a real computer including hardware (CPU(s) & GPU(s) for processing, local/RAM memory, hard-disk/SSD storage); a choice of operating systems; networking; and pre-loaded application software such as web servers, databases, CRM, etc. Each AWS system also virtualizes its console I/O (keyboard, display, and mouse), allowing AWS subscribers to connect to their AWS system using a modern browser. The browser acts as a window into the virtual computer, letting subscribers log-in, configure and use their virtual systems just as they would a real physical computer. They can choose to deploy their AWS systems to provide internet-based services for their own and their customers' benefit. The AWS technology is implemented at server farms throughout the world, and maintained by the Amazon subsidiary. Fees are based on a combination of usage, the hardware/OS/software/networking features chosen by the subscriber, required availability, redundancy, security, and service options. Based on what the subscriber needs and pays for, they can reserve a single virtual AWS computer, a cluster of virtual computers, a physical (real) computer dedicated for their exclusive use, or even a cluster of dedicated physical computers. As part of the subscription agreement, Amazon manages, upgrades, and provides industry-standard security to each subscriber's system. AWS operates from many global geographical regions including 6 in North America. In 2017, AWS comprised more than 90 services spanning a wide range including computing, storage, networking, database, analytics, application services, deployment, management, mobile, developer tools, and tools for the Internet of Things. The most popular include Amazon Elastic Compute Cloud (EC2) and Amazon Simple Storage Service (S3). Most services are not exposed directly to end users, but instead offer functionality through APIs for developers to use in their applications. Amazon Web Services’ offerings are accessed over HTTP, using the REST architectural style and SOAP protocol. Amazon markets AWS to subscribers as a way of obtaining large scale computing capacity more quickly and cheaply than building an actual physical server farm. All services are billed based on usage, but each service measures usage in varying ways.
AXIOM (pl, appeared 1992)
Origin: IBM
Country: United States


An axiom or postulate is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The word comes from the Greek axíōma (ἀξίωμα) 'that which is thought worthy or fit' or 'that which commends itself as evident.'The term has subtle differences in definition when used in the context of different fields of study. As defined in classic philosophy, an axiom is a statement that is so evident or well-established, that it is accepted without controversy or question. As used in modern logic, an axiom is a premise or starting point for reasoning.As used in mathematics, the term axiom is used in two related but distinguishable senses: "logical axioms" and "non-logical axioms". Logical axioms are usually statements that are taken to be true within the system of logic they define (e.g., (A and B) implies A), often shown in symbolic form, while non-logical axioms (e.g., a + b = b + a) are actually substantive assertions about the elements of the domain of a specific mathematical theory (such as arithmetic). When used in the latter sense, "axiom", "postulate", and "assumption" may be used interchangeably. In general, a non-logical axiom is not a self-evident truth, but rather a formal logical expression used in deduction to build a mathematical theory.  To axiomatize a system of knowledge is to show that its claims can be derived from a small, well-understood set of sentences (the axioms). There are typically multiple ways to axiomatize a given mathematical domain. Any axiom is a statement that serves as a starting point from which other statements are logically derived.  Whether it is meaningful (and, if so, what it means) for an axiom to be "true" is a subject of debate in the philosophy of mathematics.
axt-format (textDataFormat, appeared 2004)
Origin: Penn State University
Country: United States

axt alignment files are produced from Blastz, an alignment tool available from Webb Miller's lab at Penn State University. The axtNet and axtChain alignments are produced by processing the alignment files with additional utilities written by Jim Kent at UCSC.



0 chr19 3001012 3001075 chr11 70568380 70568443 - 3500
TCAGCTCATAAATCACCTCCTGCCACAAGCCTGGCCTGGTCCCAGGAGAGTGTCCAGGCTCAGA
TCTGTTCATAAACCACCTGCCATGACAAGCCTGGCCTGTTCCCAAGACAATGTCCAGGCTCAGA
Microsoft Azure (cloud, appeared 2010)
Origin: Microsoft
Country: United States
Website: https://azure.microsoft.com


Microsoft Azure (formerly Windows Azure)  is a cloud computing service created by Microsoft for building, testing, deploying, and managing applications and services through a global network of Microsoft-managed data centers. It provides software as a service (SaaS), platform as a service and infrastructure as a service and supports many different programming languages, tools and frameworks, including both Microsoft-specific and third-party software and systems. Azure was announced in October 2008 and released on February 1, 2010 as "Windows Azure" before being renamed "Microsoft Azure" on March 25, 2014.
B (pl, appeared 1969)
Creators: Ken Thompson
Dennis Ritchie
Origin: Bell Labs
Country: United States


B is a programming language developed at Bell Labs circa 1969. It is the work of Ken Thompson with Dennis Ritchie. B was derived from BCPL, and its name may be a contraction of BCPL. Thompson's coworker Dennis Ritchie speculated that the name might be based on Bon, an earlier, but unrelated, programming language that Thompson designed for use on Multics. B was designed for recursive, non-numeric, machine independent applications, such as system and language software.
B3 IR (ir, appeared 2016)
Origin: Apple
Website: https://webkit.org/docs/b3/intermediate-representation.html

B3 IR is a C-like SSA representation of a procedure. A procedure has a root block at which it starts execution when it is invoked. A procedure does not have to terminate, but if it does, then it can be either due to a Return, which gracefully returns some value, or by a side-exit at designated instructions. B3 gives the client a lot of flexibility to implement many different kinds of side-exits. B3 is designed to represent procedures for the purpose of transforming them. Knowing what transformations are legal requires knowing what a procedure does. A transformation is valid if it does not change the observable behavior of a procedure. This document tells you what B3 procedures do by telling you what each construct in B3 IR does.
B32 Business Basic (pl, appeared 1986)
Origin: B32 Software
Country: New Zealand


B32 Business Basic was a competitor to Data General Business Basic written by Murray Haszard in 1986. It ran on the Data General Eclipse MV line of computers initially, and was ported to Unix in 1989 and to DOS in 1991. B32 Software was the company that developed and supported B32 Business Basic, with the original site in Auckland, New Zealand supplemented by a sales and support centre in Blue Ash, Ohio. The B32 interpreter was highly compatible with Data General Business Basic (DGBB), but it also enhanced and extended that language in many ways. Like DGBB, B32 could access Data General's INFOS II database and it could use DGBB's lock server or its own improved version. B32 was over twice as fast for number crunching, string manipulation, and disk I/O. Many of the internal restrictions of DGBB were removed. B32 allowed 32,767 line numbers (65,535 in later versions), compared with DGBB's 9,999. B32 allowed more memory for programs, more simultaneous locks, and more files to be open at once. Language enhancements included a high-speed internal sort routine, do-while blocks, and the ability to step backwards through an indexed file. Debugging facilities were also significantly improved over DGBB. B32 allowed programs to run with full cursor positioning and attribute support on non-Data General terminals, even programs which had Data General control sequences hard-coded into them. B32 carried out all arithmetic at "quad precision", i.e. 64-bit, and emulated the "triple precision" and "double precision" versions of DGBB at runtime. This avoided the subtle incompatibilities between the two versions of DGBB. On Unix and DOS, B32 emulated all commonly used system calls of Data General's AOS/VS and RDOS operating systems, including implementing its own symbolic links on SCO Xenix and DOS. In 1991, a features war between B32 and one of its competitors, Transoft's Universal Business Basic, saw major improvements to the B32 language. B32 added a Bluebird Business Basic emulation mode, made line numbers optional, and added subroutine calls by name with parameter passing. Transoft had greater financial resources than B32, and more effective marketing. It purchased B32 in 1992. The DOS and Unix versions of B32 were discarded as Universal Business Basic ran on those operating systems, but the Eclipse MV version of B32 continued to be sold while the MV line lasted. Some of the B32 Software staff in Blue Ash moved to Transoft's Atlanta, Georgia office. The New Zealand staff went on to found Binary Research.
Baby modula-3 (pl, appeared 1993)
Origin: Digital Equipment Corporation
Country: United States


Baby Modula-3 is a functional programming sublanguage of Modula-3 (safe subset) programming language  based on ideals invented by Martín Abadi. It is an object oriented language for studying programming language design; one part of it is implicitly prototype-oriented programming language, and the other is explicitly statically typed designed for studying computer science type theories. It has been checked as a formal language of metaprogramming systems. It comes from the "Scandinavian School" of object-oriented programming languages.   Martín Abadi tried to give an example of pure object-oriented language which would allow the studying of formal semantics of objects. "Baby Modula-3 is defined with a structured operational semantics and with a set of static type rules. A denotational semantics guarantees the soundness of this definition." This object model has been shown to have well definiteness decidability  (a mechanical proof of it isn't known).  The inventor of Baby Modula-3 worked at Systems Research Center (SRC) of Digital Equipment Corporation (DEC) in Palo Alto, California. As DEC was bought by Compaq and Compaq itself was bought by Hewlett-Packard the SRC-report 95 was made available to the public by HP.
Babylonian numerals (numeralSystem, appeared -2000)

The Babylonian system is credited as being the first known positional numeral system, in which the value of a particular digit depends both on the digit itself and its position within the number. Only two symbols (Babylonian 1.svg to count units and Babylonian 10.svg to count tens) were used to notate the 59 non-zero digits.

Babylonian numerals were written in cuneiform, using a wedge-tipped reed stylus to make a mark on a soft clay tablet which would be exposed in the sun to harden to create a permanent record. The Babylonians, who were famous for their astronomical observations and calculations (aided by their invention of the abacus),  used a sexagesimal (base-60) positional numeral system inherited from either the Sumerian or the Eblaite civilizations. Neither of the predecessors was a positional system (having a convention for which ‘end’ of the numeral represented the units).
bag-format (binaryDataFormat, appeared 2010)
Origin: Open Robotics
Country: United States
Website: http://wiki.ros.org/Bags
File extensions: bag

A bag is a file format in ROS for storing ROS message data. Bags -- so named because of their .bag extension -- have an important role in ROS, and a variety of tools have been written to allow you to store, process, analyze, and visualize them.
Balanced ternary (notation, appeared 1544)


Balanced ternary is a non-standard positional numeral system (a balanced form), used in some early computers and useful in the solution of balance puzzles. It is a ternary (base 3) number system in which the digits have the values –1, 0, and 1, in contrast to the standard (unbalanced) ternary system, in which digits have values 0, 1 and 2.  Balanced ternary can represent all integers without using a separate minus sign; the value of the leading non-zero digit of a number has the sign of the number itself. While binary numerals with digits 0 and 1 provide the simplest positional numeral system for natural numbers (or for positive integers if using 1 and 2 as the digits), balanced ternary provides the simplest self-contained positional numeral system for integers. Different sources use different glyphs used to represent the three digits in balanced ternary. In this article, T (which resembles a ligature of the minus sign and 1) represents −1, while 0 and 1 represent themselves. Other conventions include using '−' and '+' to represent −1 and 1 respectively, or using Greek letter theta (Θ), which resembles a minus sign in a circle, to represent −1. In publications about the Setun computer, −1 is represented as overturned 1: "1".Balanced ternary makes an early appearance in Michael Stifel's book Arithmetica Integra (1544). It also occurs in the works of Johannes Kepler and Léon Lalanne. Related signed-digit schemes in other bases have been discussed by John Colson, John Leslie, Augustin-Louis Cauchy, and possibly even the ancient Indian Vedas.
BALGOL (pl, appeared 1959)
Creators: Bob Barton
Origin: Burroughs




INTEGER I..., J..., K..., L..., M..., N...$
BOOLEAN KEEP, LAST$
REAL MAT..., JOULES$
REAL OTHERWISE$
FUNCTION TORADS(DEGREES) = DEGREES . 3.1415926/180$
FUNCTION PYTHAGOREAN(A, B) = SQRT(A*2 + B*2)$
FOR I = 1, 3, 5, 7, 11, (13, 7, 99), 101, (103, 1, 125)$
   A(I) = I$

UNTIL A > 125 OR OUTTAHERE$
   BEGIN
   OUTTAHERE = A EQL 77$
   A = A + 3
   END$
Ballerina (pl, appeared 2015)
Creators: Sanjiva Weerawarana
James Clark
Sameera Jayasoma
Hasitha Aravinda
Srinath Perera
Frank Leymann
Origin: WSO2
Country: United States
Website: http://ballerina.io/


Ballerina is a compiled, type-safe, concurrent programming language targeting microservice development and integration.It is an open source project started in 2015 by architects from WSO2 as code-based alternative to the configuration-based integration tools such as EAI, ESB, and workflow products.Ballerina has various constructs geared toward cloud-native development including support for modern data formats and protocols, reliability, distributed transactions, APIs, and event streams.

GitHub description: The Ballerina Programming Language
Binary Alignment Map (binaryDataFormat, appeared 2009)
Also known as: BAM
Origin: Samtools
Country: Various

BAM is the compressed binary representation of SAM (Sequence Alignment Map). BAM is in compressed BGZF format.

Binary Alignment Map (BAM) is the comprehensive raw data of genome sequencing; it consists of the lossless, compressed binary representation of the Sequence Alignment Map.BAM is the compressed binary representation of SAM (Sequence Alignment Map). BAM is in compressed BGZF format.