pldb/PLDB huggingface dataset:
Slope (pl, appeared 2021)
Stands for: SLOum's Programming Environment
Creators: Sloum
Country: United States
Website: https://slope.colorfield.space
File extensions: slo
Keywords: define
set!
lambda
cond
case
if
for
load
load-mod
load-mod-file
usage
macro
eval
apply
and
or
begin
begin0
exists
coeval

A small s-expression based programming language



; hello world
(define greeting "Hello")
(display greeting ", world!\n")
Smali (assembly, appeared 2010)



GitHub description: smali/baksmali

.method public getTokens(I)I
 .locals 2
 .param p1, "amt"    # I
 
 .prologue
 const/4 v0, 0x0
 
 .line 512
 iget-boolean v1, p0, Lcom/limbenjamin/Example;->isPaid:Z
 
 if-nez v1, :cond_1
 
 .line 514
 :cond_0
 :goto_0
 return v0
 
 .line 513
 :cond_1
 iget-object v1, p0, Lcom/limbenjamin/Example;->handler:Lcom/limbenjamin/ExampleHandler;
 
 if-eqz v1, :cond_0
 
 .line 514
 move v3, p1
 
 iget-object v0, p0, Lcom/limbenjamin/Example;->handler:Lcom/limbenjamin/ExampleHandler;
 
 invoke-interface {v0, v3}, Lcom/limbenjamin/ExampleHandler;->creditTokens(I)V
 
 move-result v0
 
 goto :goto_0
.end method
Small-C (pl, appeared 1980)


Small-C is both a subset of the C programming language, suitable for resource-limited microcomputers and embedded systems, and an implementation of that subset. Originally valuable as an early compiler for microcomputer systems available during the late 1970s and early 1980s, the implementation has also been useful as an example simple enough for teaching purposes. The original compiler, written in Small-C for the Intel 8080 by Ron Cain, appeared in the May 1980 issue of Dr. Dobb's Journal of Computer Calisthenics & Orthodontia. James E. Hendrix improved and extended the original compiler, and wrote The Small-C Handbook. Ron bootstrapped Small-C on the SRI International PDP 11/45 Unix system with an account provided by John Bass for Small C development. The provided source code was released with management permission into the public domain. Small-C was important for tiny computers in a manner somewhat analogous to the importance of GCC for larger computers. Just like its Unix counterparts, the compiler generates assembler code, which then must be translated to machine code by an available assembler. Small-C is a retargetable compiler. Porting Small-C requires only that the back-end code generator be rewritten for the target processor.
SmallBASIC (pl, appeared 2001)
Website: https://smallbasic.github.io


SmallBASIC is a BASIC programming language dialect with interpreters released as  free software under the GNU General Public License version 2.

GitHub description: SmallBASIC is a fast and easy to learn BASIC language interpreter ideal for everyday calculations, scripts and prototypes. SmallBASIC includes trigonometric, matrices and algebra functions, a built in IDE, a powerful string library, system, sound, and graphic commands along with structured programming syntax
Smalltalk MT (pl, appeared 1994)


Smalltalk MT is an implementation of the Smalltalk programming language created in 1994 by Tarik Kerroum to deal with some of the shortcomings of Smalltalk-80 style of implementations. Smalltalk MT adopts a different approach in that the Smalltalk source is compiled to machine code before being executed. This allows the developer the freedom of working with compiled code without the need for the traditional compile-link-run cycle. This is like a specialized form of incremental or dynamic compilation. Smalltalk MT directly interfaces to DLLs in exactly the same manner as C which allows DLL calls to be tested directly in a Workspace, which allows a scripting style of approach to accessing any DLL based code. For example, one could write in a Workspace the following (single line or multiline, breaking on the '.' character) to reverse the string 'abc': a := 'abc'. WINAPI _strrev: a. a inspect. For 64-bit Windows , try: a:= 'abc'. WINAPI _wcsrev: a.  a inspect. The WINAPI call directly calls the DLL function _strrev natively passing parameters from the Smalltalk environment to the C environment and back. Smalltalk MT has a close integration with COM objects and fully compiled COM components can be created that operate in exactly the same way as C/C++ COM objects. In 1998 David Anderson teamed up with Tarik Kerroum to advance Smalltalk MT into the high performance and graphics areas.
Smalltalk (pl, appeared 1972)
Creators: Alan Kay
Dan Ingalls
Adele Goldberg
Country: United States


Smalltalk is an object-oriented, dynamically typed, reflective programming language. Smalltalk was created as the language to underpin the "new world" of computing exemplified by "human–computer symbiosis." It was designed and created in part for educational use, more so for constructionist learning, at the Learning Research Group (LRG) of Xerox PARC by Alan Kay, Dan Ingalls, Adele Goldberg, Ted Kaehler, Scott Wallace, and others during the 1970s. The language was first generally released as Smalltalk-80. Smalltalk-like languages are in continuing active development and have gathered loyal communities of users around them. ANSI Smalltalk was ratified in 1998 and represents the standard version of Smalltalk. Smalltalk took second place for "most loved programming language" in the Stack Overflow Developer Survey in 2017.
SMILES arbitrary target specification (textDataFormat, appeared 1987)
Creators: David Weininger


SMILES arbitrary target specification (SMARTS) is a language for specifying substructural patterns in molecules. The SMARTS line notation is expressive and allows extremely precise and transparent substructural specification and atom typing. SMARTS is related to the SMILES line notation that is used to encode molecular structures and like SMILES was originally developed by David Weininger and colleagues at Daylight Chemical Information Systems.  The most comprehensive descriptions of the SMARTS language can be found in Daylight's SMARTS theory manual, tutorial  and examples. OpenEye Scientific Software has developed their own version of SMARTS which differs from the original Daylight version in how the R descriptor (see cyclicity below) is defined.


[$([NH2][CX4]),$([NH]([CX4])[CX4]),$([NX3]([CX4])([CX4])[CX4])]
Smarty (template, appeared 2006)
Creators: Monte Ohrt
Messju Mohr
Uwe Tews
Website: http://www.smarty.net


Smarty is a web template system written in PHP. Smarty is primarily promoted as a tool for separation of concerns. Smarty is intended to simplify compartmentalization, allowing the front-end of a web page to change separately from its back-end. Ideally, this lowers costs and minimizes the efforts associated with software maintenance. Smarty generates web content through the placement of special Smarty tags within a document. These tags are processed and substituted with other code. Tags are directives for Smarty that are enclosed by template delimiters. These directives can be variables, denoted by a dollar sign ($), functions, logical or loop statements. Smarty allows PHP programmers to define custom functions that can be accessed using Smarty tags.


<!DOCTYPE html>
<html lang="en">
<head>
   <meta charset="utf-8">
   <title>{$title_text|escape}</title>
</head>

<body> {* This is a little comment that won't be visible in the HTML source *}
{$body_html}
</body> <!-- this is a little comment that will be seen in the HTML source -->
</html>
Smile data interchange format (binaryDataFormat, appeared 2010)
Creators: Tatu Saloranta


Smile is a computer data interchange format based on JSON. It can also be considered a binary serialization of the generic JSON data model, which means tools that operate on JSON may be used with Smile as well, as long as a proper encoder/decoder exists for the tool. The name comes from first 2 bytes of the 4 byte header, which consist of Smiley ":)" followed by a linefeed: choice made to make it easier to recognize Smile-encoded data files using textual command-line tools.

GitHub description: New home for Smile format (https://en.wikipedia.org/wiki/Smile_(data_interchange_format))
Smiles (textDataFormat, appeared 1988)
Stands for: Simplified molecular-input line-entry system
File extensions: smi


The simplified molecular-input line-entry system (SMILES) is a specification in the form of a line notation for describing the structure of chemical species using short ASCII strings. SMILES strings can be imported by most molecule editors for conversion back into two-dimensional drawings or three-dimensional models of the molecules. The original SMILES specification was initiated in the 1980s. It has since been modified and extended. In 2007, an open standard called OpenSMILES was developed in the open-source chemistry community.  Other linear notations include the Wiswesser line notation (WLN), ROSDAL, and SYBYL Line Notation (SLN).


CC(=O)NCCC1=CNc2c1cc(OC)cc2
CC(=O)NCCc1c[nH]c2ccc(OC)cc12
Semantic Patch Language (grammarLanguage, appeared 2006)
Creators: Yoann Padioleau
Website: http://coccinelle.lip6.fr/


Coccinelle (French for ladybug) is an open-source utility for matching and transforming the source code of programs written in the C programming language.

GitHub description: Source code of the Coccinelle project (mirror of the main Coccinelle repository located at Inria)
SMT (pl, appeared 2003)
Stands for: Satisfiability Modulo Theories
Website: http://smtlib.cs.uiowa.edu/language.shtml

Common input and output languages for SMT solvers.



; Getting assertions
(set-option :produce-assertions true)
(set-logic QF_UF)
(declare-const p Bool) (declare-const q Bool)
(push 1)
 (assert (or p q))
 (push 1)
  (assert (not q))
  (get-assertions)
  ; ((or p q)
  ;  (not q)
  ; )
 (pop 1)
  (get-assertions)
 ; ((or p q))
 (pop 1)
 (get-assertions)
 ; ()
(exit)
SMTP (protocol, appeared 1982)
Also known as: smtp
Stands for: Simple Mail Transfer Protocol


Simple Mail Transfer Protocol (SMTP) is an Internet standard for electronic mail (email) transmission. First defined by RFC 821 in 1982, it was last updated in 2008 with Extended SMTP additions by RFC 5321, which is the protocol in widespread use today. Although electronic mail servers and other mail transfer agents use SMTP to send and receive mail messages, user-level client mail applications typically use SMTP only for sending messages to a mail server for relaying. For retrieving messages, client applications usually use either IMAP or POP3. SMTP communication between mail servers uses TCP port 25. Mail clients on the other hand, often submit the outgoing emails to a mail server on port 587. Despite being deprecated, mail providers sometimes still permit the use of nonstandard port 465 for this purpose. SMTP connections secured by TLS, known as SMTPS, can be made using STARTTLS. Although proprietary systems (such as Microsoft Exchange and IBM Notes) and webmail systems (such as Outlook.com, Gmail and Yahoo! Mail) use their own non-standard protocols to access mail box accounts on their own mail servers, all use SMTP when sending or receiving email from outside their own systems.
snakemake (pl, appeared 2012)

A workflow is defined in a ‘Snakefile’ through a domain-specific language that is close to standard Python syntax. It consists of rules that denote how to create output files from input files. The workflow is implied by dependencies between the rules that arise from one rule needing an output file of another as an input file.



SAMPLES = "100 101 102 103".split()

REF = "hg19.fa"

rule all:

 input: "{sample}.coverage.pdf".format(sample = sample)

    for sample in SAMPLES

rule fastq_to_sai:

  input: ref = REF, reads = "{sample}.{group}.fastq"

  output: temp("{sample}.{group}.sai")

  shell: "bwa aln {input.ref} {input.reads} > {output}"

rule sai_to_bam:

  input: REF, "{sample}.1.sai", "{sample}.2.sai",

     "{sample}.1.fastq", "{sample}.2.fastq"

  output: protected("{sample}.bam")

  shell: "bwa sampe {input} | samtools view -Sbh - > {output}"

rule remove_duplicates:

  input: "{sample}.bam"

  output: "{sample}.nodup.bam"

  shell: "samtools rmdup {input} {output}"

rule plot_coverage_histogram:

  input: "{sample}.nodup.bam"

  output: hist = "{sample}.coverage.pdf"

  run:

    from matplotlib.pyplot import hist, savefig

    hist(list(map(int,

      shell("samtools mpileup {input} | cut -f4",

      iterable = True))))

    savefig(output.hist)
Snap! (pl, appeared 2011)
Creators: Brian Harvey


Snap! is a free, blocks- and browser-based educational graphical programming language that allows students to create interactive animations, games, stories, and more, while learning about mathematical and computational ideas. Snap! was inspired by Scratch, but also targets both novice and more advanced students by including and expanding Scratch's features. Since version 4.0, it is entirely browser-based, with no software that needs to be installed on the local device, much like Scratch.
SnapTag (barCodeFormat, appeared 2011)


SnapTag, invented by SpyderLynk, is a 2D mobile barcode alternative similar to a QR code, but that uses an icon or company logo and code ring rather than a square pattern of black dots.Similar to a QR code, SnapTags can be used to take consumers to a brand’s website, but can also facilitate mobile purchases, coupon downloads, free sample requests, video views, promotional entries,  Facebook Likes, Pinterest Pins, Twitter Follows, Posts and Tweets.  SnapTags offer back-end data mining capabilities.
Snit (pl, appeared 2002)


Snit or SNIT may refer to:  Droopy "Snit" McCool, a minor character in the film Return of the Jedi Snit (horse), a Thoroughbred horse which won the 1997 Cotillion Handicap Snit (mascot), a robotic character on Canadian TV channel YTV Wongsadhiraj Snit, Thai prince honored by UNESCO National System of Land Information or Sistema Nacional de Información Territorial (SNIT), government entity in Chile participating in GeoSUR Shree Narayan Institute of Technology (SNIT), a college in Khargone, India Snit, an object-oriented extension to the Tcl programming language Snit, a unit of measurement for alcoholic drinks Snit, Jamaican name for the fish Haemulon vittatum Šnit, a 2007 Igor Marojević novel Branwell F. Snit, character in a comic strip created by Morgan Sanders Snit Mandolin, main character in the 2009 Canadian film Hungry Hills Snits, West Frisian name for the Dutch city Sneek Snits, creatures in the board game Snit's Revenge
SNOBOL (pl, appeared 1962)
Creators: David J. Farber
Ralph E. Griswold
Country: United States
Website: http://www.snobol4.org


SNOBOL (StriNg Oriented and symBOlic Language) is a series of computer programming languages developed between 1962 and 1967 at AT&T Bell Laboratories by David J. Farber, Ralph E. Griswold and Ivan P. Polonsky, culminating in SNOBOL4. It was one of a number of text-string-oriented languages developed during the 1950s and 1960s; others included COMIT and TRAC. SNOBOL4 stands apart from most programming languages of its era by having patterns as a first-class data type (i.e. a data type whose values can be manipulated in all ways permitted to any other data type in the programming language) and by providing operators for pattern concatenation and alternation. In later object-oriented languages, such as JavaScript, patterns are a type of object, and admit various manipulations. Further, strings generated during execution can be treated as programs and executed (as in the eval function of other languages). SNOBOL4 was quite widely taught in larger US universities in the late 1960s and early 1970s and was widely used in the 1970s and 1980s as a text manipulation language in the humanities. In the 1980s and 1990s its use faded as newer languages such as AWK and Perl made string manipulation by means of regular expressions fashionable. SNOBOL4 patterns subsume BNF grammars, which are equivalent to context-free grammars and more powerful than regular expressions. The "regular expressions" in current versions of AWK and Perl are in fact extensions of regular expressions in the traditional sense, but regular expressions, unlike SNOBOL4 patterns, are not recursive, which gives a distinct computational advantage to SNOBOL4 patterns. (Recursive expressions did appear in Perl 5.10, though, released in December 2007.) One of the designers of SNOBOL, Ralph Griswold, designed successors to SNOBOL4 called SL5 and Icon, which combined the backtracking of SNOBOL4 pattern matching with more standard ALGOL-like structuring, as well as adding some features of their own.
SNOOP (pl, appeared 1988)


"Snoop" is a noun and verb referring to one who pries into the business of others; a busybody; it may also refer to: In aviation:  Eastern Ultralights Snoop, a family of ultralight aircraftIn entertainment:  Snoop Dogg, an American rapper, actor and music producer Snoop (The Wire), a character in the television series The Wire Felicia Pearson, also nicknamed "Snoop", the actress who plays the aforementioned character of the same name Snoopy, a famous character in the comic strip PeanutsIn technology:  snoop (software), a utility to capture and inspect network packets, included with the Solaris operating system Bus snooping in a microprocessor's cache coherency mechanism
Snowball (pl, appeared 1971)


Snowball is a small string processing programming language designed for creating stemming algorithms for use in information retrieval.The Snowball compiler translates a Snowball script (a  .sbl file) into either a thread-safe ANSI C program or a Java program. For ANSI C, each Snowball script produces a program file and corresponding header file (with  .c  and  .h  extensions). The Snowball compiler checks the consistency of its script, and this check was used to discover a typo in a seminal academic paper by Lovins which had remained undetected for 30 years.The basic datatypes handled by Snowball are strings of characters, signed integers, and boolean truth values, or more simply strings, integers and booleans. Snowball's characters are either 8-bit wide, or 16-bit, depending on the mode of use. In particular, both ASCII and 16-bit Unicode are supported. Like the SNOBOL programming language, the flow of control in Snowball is arranged by the implicit use of signals (each statement returns a true or false value), rather than the explicit use of constructs such as if, then, and break found in C and many other programming languages.The name Snowball was chosen as a tribute to the SNOBOL programming language, with which it shares the concept of string patterns delivering signals that are used to control the flow of the program. The creator of Snowball, Dr. Martin Porter, "toyed with the idea of calling it 'strippergram' ", because it "effectively provides a 'suffix STRIPPER GRAMmar' ".
SNQL: A Social Network Query and Transformation Language (queryLanguage, appeared 2011)




CONSTRUCT CP1
 WHERE EP2 FILTER ((A3 != A4) AND (A3 = A1 OR A3 = A2) AND
 (A4 = A1 OR A4 = A5))
 AND (TC(A1, A2, EP1) WITH L1=’John’)
 AND (TC(A1, A5, EP3) WITH L1=’John’)
FROM FriendshipNetwork
SOAP (xmlFormat, appeared 1998)
Stands for: Simple Object Access Protocol
Creators: Dave Winer
Don Box
Bob Atkinson
Mohsen Al-Ghosein


SOAP (originally Simple Object Access Protocol) is a protocol specification for exchanging structured information in the implementation of web services in computer networks. Its purpose is to induce extensibility, neutrality and independence. It uses XML Information Set for its message format, and relies on application layer protocols, most often Hypertext Transfer Protocol (HTTP) or Simple Mail Transfer Protocol (SMTP), for message negotiation and transmission. SOAP allows processes running on disparate operating systems (such as Windows and Linux) to communicate using Extensible Markup Language (XML). Since Web protocols like HTTP are installed and running on all operating systems, SOAP allows clients to invoke web services and receive responses independent of language and platforms.
Sophia (contractLanguage, appeared 2018)
Creators: Robert Virding
Website: https://aeternity.com/aesophia
Keywords: contract
library
entrypoint
function
stateful
state
hash
signature
tuple
list
address
string
bool
int
record
datatype
type
option
oracle
oracle_query
Call
Bits
Bytes
Oracle
String
Crypto
Address
Auth
Chain
None
Some
bits
bytes
event
let
map
private
public
true
false
var
if
else
throw



GitHub description:  Stand alone compiler for the Sophia smart contract language
sora (pl, appeared 2019)




func get(node: &mut Foo, k: usize) -> maybe &mut Foo {
    if k == 0 {
        return node // no semicolons, only newlines
    } else if let next = node->next { // node->next is a maybe &mut Foo, this accesses the value of the maybe type.
        return get(next, k-1)
    } else {
        return null
    }
}
Schema for Object-Oriented XML (xmlFormat, appeared 1998)


Schema for Object-Oriented XML, or SOX, is an XML schema language developed by Commerce One. In 1998 a SOX specification was submitted to the World Wide Web Consortium and published as a W3C Note. A revised version, SOX 2.0, was published as a W3C Note in 1999. SOX was one of several predecessors of the W3C's XML Schema language. After the publication of XML Schema, SOX continued to be supported by Commerce One until the company's bankruptcy in late 2004. The patents for SOX and other Commerce One technologies were purchased by Novell, Inc. in December 2004, reportedly in an effort to prevent them from being exploited by unrelated companies whose primary business is filing patent-related lawsuits.
Soy (template, appeared 2008)
Also known as: Google Closure Templates
Origin: Google
File extensions: soy




/**
 * Greets a person and optionally a list of other people.
 * @param name The name of the person.
 * @param additionalNames The additional names to greet. May be an empty list.
 */
{template .helloNames}
  // Greet the person.
  {call .helloName data="all" /}<br>
  // Greet the additional people.
  {foreach $additionalName in $additionalNames}
    {call .helloName}
      {param name: $additionalName /}
    {/call}
    {if not isLast($additionalName)}
      <br>  // break after every line except the last
    {/if}
  {ifempty}
    No additional people to greet.
  {/foreach}
{/template}
SP/k (pl, appeared 1974)
Creators: Ric Holt
D.B. Wortman
D.T. Barnard
James Cordy
Country: Canada


SP/k is a programming language developed circa 1974 by R.C. Holt, D.B. Wortman, D.T. Barnard and J.R. Cordy as a subset of the PL/I programming language designed for teaching programming. It was used for about a decade at over 40 universities, schools, and research laboratories in Canada and the United States. SP/k was one of the first languages specifically designed to encourage structured programming. The features of SP/k were chosen to encourage structured problem solving by computers, to make the language easy to learn and use, to eliminate confusing and redundant constructs, and to make the language easy to compile.The resulting language was suitable for introducing programming concepts used in various applications, including business data processing, scientific calculations and non-numeric computation.  SP/k is actually a sequence of language subsets called SP/1, SP/2, … SP/8. Each subset introduces new programming language constructs while retaining all the constructs of preceding subsets, forming a stepwise system for teaching computer programming. Each subset is precisely defined and self-contained, and can be learned or implemented without the following subsets. This allows for various levels of programming education. The design and philosophy of SP/k was a strong influence on the Turing programming language.