{ "05ab1e": { "title": "05AB1E", "appeared": 2015, "type": "esolang", "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "\"" ] ], "example": [ "PUSH 4\nPUSH 5\nMULTIPLY" ], "githubRepo": { "firstCommit": 2015, "stars": 672, "forks": 39, "subscribers": 20, "created": 2015, "updated": 2022, "description": "A concise stack-based golfing language", "issues": 29, "url": "https://github.com/Adriandmen/05AB1E" }, "repoStats": { "firstCommit": 2015, "commits": 871, "committers": 28, "files": 49 }, "leachim6": { "filepath": "#/05AB1E", "example": [ "\"Hello World" ], "id": "05AB1E" } }, "1-pak": { "title": "1.pak", "appeared": 1973, "type": "pl", "reference": [ "https://pdfs.semanticscholar.org/5a43/c1b39643533b04a35f1811824c0c25d089fd.pdf?_ga=2.57752106.1877161244.1546024423-1663431151.1540068998" ], "originCommunity": [ "Department of Computer Science, University of Toronto" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4365", "centralPackageRepositoryCount": 0 }, "1620sps": { "title": "IBM 1620", "appeared": 1959, "type": "assembly", "originCommunity": [ "IBM" ], "wikipedia": { "example": [ "C F 8 4 2 1\n1 0 1 0  – Record Mark (right most end of record, prints as a double dagger symbol, ‡)\n1 1 0 0  – Numeric Blank (blank for punched card output formatting)\n1 1 1 1  – Group Mark (right most end of a group of records for disk I/O)" ], "related": [ "unicode", "assembly-language", "fortran" ], "summary": "The IBM 1620 was announced by IBM on October 21, 1959, and marketed as an inexpensive \"scientific computer\". After a total production of about two thousand machines, it was withdrawn on November 19, 1970. Modified versions of the 1620 were used as the CPU of the IBM 1710 and IBM 1720 Industrial Process Control Systems (making it the first digital computer considered reliable enough for real-time process control of factory equipment). Being variable word length decimal, as opposed to fixed-word-length pure binary, made it an especially attractive first computer to learn on – and hundreds of thousands of students had their first experiences with a computer on the IBM 1620. Core memory cycle times were 20 microseconds for the (earlier) Model I, 10 microseconds for the Model II (about a thousand times slower than typical computer main memory in 2006). The Model II was introduced in 1962.", "pageId": 92577, "created": 2002, "backlinksCount": 112, "revisionCount": 481, "dailyPageViews": 60, "appeared": 1962, "url": "https://en.wikipedia.org/wiki/IBM_1620" }, "fileType": "paper", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming the IBM 1620|1965|Eric A. Weiss|23978396|0.0|0|0", "isbndb": "", "semanticScholar": "" }, "1c-enterprise": { "title": "1C Enterprise Script", "appeared": 2002, "type": "pl", "description": "The 1C:Enterprise platform allows for business oriented application development. The software allows work in thick, thin and web clients.[21] It also supports creating mobile applications for Android and iOS in the same environment using the 1C programming language", "reference": [ "https://1c-dn.com/library/tutorials/practical_developer_guide_for_1c_enterprise_8_3/" ], "country": [ "Russia" ], "originCommunity": [ "1C Company" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Message" ] ], "stringToken": [ [ "\"" ] ], "githubLanguage": { "fileExtensions": [ "bsl", "os" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.bsl", "repos": 38669, "id": "1C Enterprise" }, "githubBigQuery": { "repos": 274, "users": 250, "id": "1C Enterprise" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 3, "commitCount": 261, "sampleCount": 6, "example": [ "Каталог = ОбъединитьПути(ТекущийКаталог(), \"libs\\oscript-library\\src\");\nЗагрузчик_Оригинал_ИмяФайла = ОбъединитьПути(Каталог, \"package-loader.os\");\n\nФайлы = НайтиФайлы(Каталог, , Ложь);\nДля Каждого ВыбФайл Из Файлы Цикл\n\n Если ВыбФайл.ЭтоФайл() Тогда\n Продолжить;\n КонецЕсли;\n\n Загрузчик_ИмяФайла = ОбъединитьПути(ВыбФайл.ПолноеИмя, \"package-loader.os\");\n Загрузчик_Файл = Новый Файл(Загрузчик_ИмяФайла);\n\n Если Загрузчик_Файл.Существует() Тогда\n Продолжить;\n КонецЕсли;\n\n КопироватьФайл(Загрузчик_Оригинал_ИмяФайла, Загрузчик_ИмяФайла);\n\nКонецЦикла;" ], "url": "https://github.com/xDrivenDevelopment/atom-language-1c-bsl.git" }, "leachim6": { "filepath": "#/1C Enterprise", "example": [ "Message(\"Hello World\");\n" ], "id": "1C Enterprise" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "2-pak": { "title": "2-pak", "appeared": 1975, "type": "pl", "reference": [ "https://www.ijcai.org/Proceedings/75/Papers/082.pdf" ], "originCommunity": [ "Department of Computer Science, University of Toronto" ], "example": [ "coroutine FRUIT_GEN()\n begin\n strin g FRUIT ;\n FRUIT :- 'CHERRY1\n ;\n detach ;\n whil e tru e do\n case FRUIT of\n 'CHERRY1\n : FRUIT := 'LEMON1\n ;\n 'LEMON': FRUIT := 'ORANGE?\n ;\n 'ORANGE1\n : FRUIT :- 'APPLE' ;\n 'APPLE': FRUIT :- 'CHERRY' ;\n end ;\n detach ;\n end ;\n end ;" ], "hopl": "https://hopl.info/showlanguage.prx?exp=663", "centralPackageRepositoryCount": 0 }, "20-gate": { "title": "20-GATE", "appeared": 1961, "type": "pl", "originCommunity": [ "Bendix Corporation" ], "wikipedia": { "related": [ "algol" ], "summary": "The Bendix G-20 computer was introduced in 1961 by the Bendix Corporation, Computer Division, Los Angeles, California. The G-20 followed the highly successful G-15 vacuum tube computer. Bendix sold its computer division to Control Data Corporation in 1963, effectively terminating the G-20.", "created": 2001, "backlinksCount": 15, "pageId": 15412723, "revisionCount": 33, "dailyPageViews": 1, "appeared": 1961, "url": "https://en.wikipedia.org/wiki/20-GATE" }, "hopl": "https://hopl.info/showlanguage.prx?exp=216", "centralPackageRepositoryCount": 0, "isbndb": "" }, "2lisp": { "title": "2lisp", "appeared": 1982, "type": "pl", "reference": [ "https://web.archive.org/web/20151022180515/http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TR-272.pdf" ], "originCommunity": [ "Massachusetts Institute of Technology" ] }, "2obj": { "title": "2OBJ", "appeared": 1995, "type": "pl", "reference": [ "https://www.cs.cmu.edu/~mleone/language/projects.html" ], "originCommunity": [ "Department of Computer Science, University of Oxford" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3684", "centralPackageRepositoryCount": 0 }, "3-lisp": { "title": "3-LISP", "appeared": 1982, "type": "pl", "reference": [ "https://books.google.com/books/about/Interim_3_LISP_Reference_Manual.html?id=sX6oHwAACAAJ" ], "originCommunity": [ "Xerox PARC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1066", "centralPackageRepositoryCount": 0 }, "3apl": { "title": "3APL", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5167cbb780bac55456a0f69c16f175eb61269c8d" ], "originCommunity": [ "Computer science Department, Utrecht University" ], "wikipedia": { "example": [ "PLANBASE { SetStatus(started); }\nPR-RULES {\n\tgoTo(R) <- location(R,X,Y) AND NOT at(X,Y) | {\n\t\tNowAt(X,Y);\n\t}\n\tclean(R) <- location(R,X,Y) AND at(X,Y) | {\n\t\tClean(R);\n\t}\n}" ], "related": [ "java", "prolog", "strips" ], "summary": "An Abstract Agent Programming Language or Artificial Autonomous Agents Programming Language or 3APL (pronounced triple-A-P-L) is an experimental tool and programming language for the development, implementation and testing of multiple cognitive agents using the Belief-Desire-Intention (BDI) approach.", "backlinksCount": 11, "pageId": 5229527, "dailyPageViews": 5, "created": 2006, "url": "https://en.wikipedia.org/wiki/3APL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7802", "centralPackageRepositoryCount": 0 }, "3d-logo": { "title": "3D Logo", "appeared": 1986, "type": "pl", "description": "“3D Logo” for the Apple IIGS, which supports 3D drawing by rotating the turtle into or out of the screen", "reference": [ "https://en.wikipedia.org/wiki/Apple_IIGS" ], "originCommunity": [ "Apple" ], "related": [ "logo" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7684", "isbndb": "" }, "3dcomposer": { "title": "3DComposer", "appeared": 1999, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6128962c90a401b57ce9a25b4b6f8d902c0ef869" ], "originCommunity": [ "The University of Auckland" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5542", "centralPackageRepositoryCount": 0 }, "3ds": { "title": "3DS", "appeared": 1990, "type": "binaryDataFormat", "description": "3DS is one of the file formats used by the Autodesk 3ds Max 3D modeling, animation and rendering software.", "originCommunity": [ "Autodesk Inc." ], "wikipedia": { "example": [ "0x4D4D // Main Chunk\n├─ 0x0002 // M3D Version\n├─ 0x3D3D // 3D Editor Chunk\n│ ├─ 0x4000 // Object Block\n│ │ ├─ 0x4100 // Triangular Mesh\n│ │ │ ├─ 0x4110 // Vertices List\n│ │ │ ├─ 0x4120 // Faces Description\n│ │ │ │ ├─ 0x4130 // Faces Material\n│ │ │ │ └─ 0x4150 // Smoothing Group List\n│ │ │ ├─ 0x4140 // Mapping Coordinates List\n│ │ │ └─ 0x4160 // Local Coordinates System\n│ │ ├─ 0x4600 // Light\n│ │ │ └─ 0x4610 // Spotlight\n│ │ └─ 0x4700 // Camera\n│ └─ 0xAFFF // Material Block\n│ ├─ 0xA000 // Material Name\n│ ├─ 0xA010 // Ambient Color\n│ ├─ 0xA020 // Diffuse Color\n│ ├─ 0xA030 // Specular Color\n│ ├─ 0xA200 // Texture Map 1\n│ ├─ 0xA230 // Bump Map\n│ └─ 0xA220 // Reflection Map\n│ │ /* Sub Chunks For Each Map */\n│ ├─ 0xA300 // Mapping Filename\n│ └─ 0xA351 // Mapping Parameters\n└─ 0xB000 // Keyframer Chunk\n ├─ 0xB002 // Mesh Information Block\n ├─ 0xB007 // Spot Light Information Block\n └─ 0xB008 // Frames (Start and End)\n ├─ 0xB010 // Object Name\n ├─ 0xB013 // Object Pivot Point\n ├─ 0xB020 // Position Track\n ├─ 0xB021 // Rotation Track\n ├─ 0xB022 // Scale Track\n └─ 0xB030 // Hierarchy Position" ], "related": [ "ascii", "wavefront-object" ], "summary": "3DS is one of the file formats used by the Autodesk 3ds Max 3D modeling, animation and rendering software. It was the native file format of the old Autodesk 3D Studio DOS (releases 1 to 4), which was popular until its successor (3D Studio MAX 1.0) replaced it in April 1996. Having been around since 1990 (when the first version of 3D Studio DOS was launched), it has grown to become a de facto industry standard for transferring models between 3D programs, or for storing models for 3D resource catalogs (along with OBJ, which is more frequently used as a model archiving file format).While the 3DS format aims to provide an import/export format, retaining only essential geometry, texture and lighting data, the related MAX format (now superseded by the PRJ format) also contains extra information specific to Autodesk 3ds Max, to allow a scene to be completely saved/loaded.", "backlinksCount": 39, "pageId": 21670782, "created": 2009, "revisionCount": 94, "dailyPageViews": 90, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/.3ds" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "3mf": { "title": "3D Manufacturing Format", "appeared": 2015, "type": "xmlFormat", "website": "http://www.3mf.io/specification/", "standsFor": "3D Manufacturing Format", "originCommunity": [ "3MF Consortium" ], "wikipedia": { "related": [ "xml" ], "summary": "3D Manufacturing Format or 3MF is a file format developed and published by the 3MF Consortium. 3MF is an XML-based data format designed for using additive manufacturing, including information about materials, colors, and other information that cannot be represented in the STL format. As of today, CAD software related companies such as Autodesk, Dassault Systems and Netfabb are part of the 3MF Consortium. Other firms in the 3MF Consortium are Microsoft (for Operating system support), SLM and HP, whilst Shapeways are also included to give insight from a 3D Printing background. Other key players in the 3D printing and additive manufacturing business, such as Materialise, 3D Systems, Siemens PLM Software and Stratasys have recently joined the consortium.", "pageId": 46580274, "dailyPageViews": 49, "created": 2015, "backlinksCount": 101, "revisionCount": 26, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/3D_Manufacturing_Format" }, "twitter": "https://twitter.com/3mfconsortium", "fileType": "text", "centralPackageRepositoryCount": 0 }, "3rip": { "title": "3RIP", "appeared": 1977, "type": "pl", "reference": [ "https://eric.ed.gov/?id=ED144615" ], "originCommunity": [ "KTH Royal Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4600", "centralPackageRepositoryCount": 0 }, "4g-standard": { "title": "4G", "appeared": 2013, "type": "standard", "wikipedia": { "summary": "4G is the fourth generation of broadband cellular network technology, succeeding 3G. A 4G system must provide capabilities defined by ITU in IMT Advanced. Potential and current applications include amended mobile web access, IP telephony, gaming services, high-definition mobile TV, video conferencing, and 3D television. The first-release Long Term Evolution (LTE) standard was commercially deployed in Oslo, Norway, and Stockholm, Sweden in 2009, and has since been deployed throughout most parts of the world. It has, however, been debated whether first-release versions should be considered 4G LTE, as discussed in the technical understanding section below.", "backlinksCount": 1287, "pageId": 486547, "dailyPageViews": 1738, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/4G" } }, "4th-dimension": { "title": "4th Dimension", "appeared": 1987, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/4th_Dimension_(software)" ], "aka": [ "4D" ], "originCommunity": [ "4D SAS" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "githubLanguage": { "type": "programming", "fileExtensions": [ "4dm" ], "aceMode": "text", "tmScope": "source.4dm", "repos": 365, "id": "4D" }, "leachim6": { "filepath": "#/4th Dimension.4dd", "example": [ "OPEN WINDOW (10;45;500;330;0;\"Hello Window\")\nWhile (True)\n MESSAGE (\"Hello World\")\nEnd while\n" ], "id": "4th Dimension" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2471", "centralPackageRepositoryCount": 0 }, "51forth": { "title": "51forth", "appeared": 1980, "type": "pl", "originCommunity": [ "IDACOM Electronics or Hewlett-Packard" ], "wikipedia": { "related": [ "assembly-language", "forth" ], "summary": "51-FORTH is an implementation of the Forth programming language for the Intel 8051 microcontroller. It was created in 1989 by Scott Gehmlich of IDACOM Electronics (which was acquired by Hewlett-Packard in 1990), and sent to Giovanni Moretti of Massey University, from whom it was propagated widely. The original 51forth.zip package is available from many archive sites, along with several other implementations of Forth. This implementation is subroutine-threaded, with about 20 words written in assembly language, and the complete system occupying a total of about 8K of RAM. It was cross-developed from a VAX to an RTX2000 Forth system connected to dual-ported RAM accessible to the microcontroller. The sources and documentation are in the public domain.", "created": 2001, "backlinksCount": 10, "pageId": 35509, "dailyPageViews": 3, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/51-FORTH" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5208", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "6gunz": { "title": "6gunz", "appeared": 2018, "type": "pl", "demoVideo": [ "https://www.youtube.com/watch?v=afXzeCuUuhU", "https://www.youtube.com/watch?v=qGOIt0xh0dw" ], "creators": [ "Matthew Steel" ], "website": "http://6gu.nz", "reference": [ "https://6gu.nz/language/" ], "country": [ "New Zealand" ], "originCommunity": [ "https://6gu.nz/" ], "domainName": { "awisRank": { "2022": 4564023 }, "name": "6gu.nz" }, "visualParadigm": true, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17544330|Show HN: 6gunz – spreadsheet / programming language / microservices framework|2018-07-16 19:36:57 UTC|1531769817|repsilat|5|9" }, "8th": { "title": "8th", "appeared": 2014, "type": "pl", "description": "8th is an innovative, secure, cross-platform, robust, and fun concatenative programming language for mobile, desktop, server, and embedded application development.", "website": "https://8th-dev.com/", "originCommunity": [ "Aaron High-Tech, Ltd" ], "domainName": { "registered": 2014, "awisRank": { "2022": 8326041 }, "name": "8th-dev.com" }, "leachim6": { "filepath": "#/8th", "example": [ "\"Hello World\\n\" .\n" ], "id": "8th" } }, "a-0-system": { "title": "A-0 system", "appeared": 1951, "type": "compiler", "originCommunity": [ "Remington Rand" ], "wikipedia": { "related": [ "arith-matic", "math-matic", "flow-matic" ], "summary": "The A-0 system (Arithmetic Language version 0), written by Grace Murray Hopper in 1951 and 1952 for the UNIVAC I, was an early compiler related tool developed for electronic computers. The A-0 functioned more as a loader or linker than the modern notion of a compiler. A program was specified as a sequence of subroutines and arguments. The subroutines were identified by a numeric code and the arguments to the subroutines were written directly after each subroutine code. The A-0 system converted the specification into machine code that could be fed into the computer a second time to execute the said program. The A-0 system was followed by the A-1, A-2, A-3 (released as ARITH-MATIC), AT-3 (released as MATH-MATIC) and B-0 (released as FLOW-MATIC). The A-2 system was developed at the UNIVAC division of Remington Rand in 1953 and released to customers by the end of that year. Customers were provided the source code for A-2 and invited to send their improvements back to UNIVAC. Thus A-2 was an early example of free and open-source software.", "pageId": 60383, "created": 2002, "backlinksCount": 36, "revisionCount": 87, "dailyPageViews": 640, "appeared": 1951, "url": "https://en.wikipedia.org/wiki/A-0_System" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4", "fileType": "na", "centralPackageRepositoryCount": 0 }, "a-sharp": { "title": "A#", "appeared": 2004, "type": "pl", "creators": [ "Dr. Martin C. Carlisle", "Lt Col Ricky Sward", "Maj Jeff Humphries" ], "country": [ "United States" ], "originCommunity": [ "AdaCore", "United States Air Force Academy" ], "wikipedia": { "related": [ "ada" ], "summary": "A# is a port of the Ada programming language to the Microsoft .NET platform. A# is freely distributed by the Department of Computer Science at the United States Air Force Academy as a service to the Ada community under the terms of the GNU General Public License. AdaCore has taken over this development, and announced \"GNAT for .NET\", which is a fully supported .NET product with all of the features of A# and more.", "pageId": 2994340, "created": 2005, "backlinksCount": 72, "revisionCount": 56, "dailyPageViews": 42, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/A_Sharp_(.NET)" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "a51": { "title": "A51 Assembly", "appeared": 1988, "type": "assembly", "description": "The A51 and A251 assembler translate programs you write in assembly language into executable machine instructions. You may use the A51 assembler to assemble programs for the 8051 family of microcontrollers.", "reference": [ "https://courses.cs.washington.edu/courses/cse466/01au/Lab/A251.pdf" ], "fileExtensions": [ "a51" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "aadl": { "title": "Avionics Architecture Design Language", "appeared": 2003, "type": "pl", "website": "http://www.aadl.info/aadl/currentsite/", "standsFor": "Avionics Architecture Design Language", "originCommunity": [ "Carnegie Mellon University" ], "wikipedia": { "related": [ "uml" ], "summary": "The Architecture Analysis & Design Language (AADL) is an architecture description language standardized by SAE. AADL was first developed in the field of avionics, and was known formerly as the Avionics Architecture Description Language.The Architecture Analysis & Design Language is derived from MetaH, an architecture description language made by the Advanced Technology Center of Honeywell. AADL is used to model the software and hardware architecture of an embedded, real-time system. Due to its emphasis on the embedded domain, AADL contains constructs for modeling both software and hardware components (with the hardware components named \"execution platform\" components within the standard). This architecture model can then be used either as a design documentation, for analyses (such as schedulability and flow control) or for code generation (of the software portion), like UML.", "created": 2005, "backlinksCount": 24, "pageId": 2998007, "revisionCount": 58, "dailyPageViews": 29, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Architecture_Analysis_%26_Design_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7771", "centralPackageRepositoryCount": 0 }, "aaf": { "title": "Advanced Authoring Format", "appeared": 2002, "type": "binaryDataFormat", "originCommunity": [ "Advanced Media Workflow Association" ], "wikipedia": { "summary": "The Advanced Authoring Format (AAF) is a file format for professional cross-platform data interchange, designed for the video post-production and authoring environment. It was created by the Advanced Media Workflow Association (AMWA), and is now being standardized through the Society of Motion Picture and Television Engineers (SMPTE).", "backlinksCount": 27, "pageId": 378634, "dailyPageViews": 52, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Advanced_Authoring_Format" } }, "aarch64": { "title": "AArch64", "appeared": 2011, "type": "assembly", "reference": [ "https://en.wikipedia.org/wiki/ARM_architecture#64.2F32-bit_architecture" ], "originCommunity": [ "Acorn Computers or Arm Ltd" ], "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nARM Assembly Language Programming & Architecture (Mazidi & Naimi ARM Books)|2013|Muhammad Ali Mazidi|26863964|4.17|30|6\nDigital Design and Computer Architecture: ARM Edition|2015|Sarah L. Harris|45521398|4.75|4|0\nArm Microprocessor Systems: Cortex-M Architecture, Programming, and Interfacing||Muhammad Tahir|52569166|3.50|2|0\nComputer Organization and Design: The Hardware Software Interface: ARM Edition (The Morgan Kaufmann Series in Computer Architecture and Design)||David A. Patterson|50635907|4.22|9|1\nARM embedded microprocessor architecture and assembly language programming|2010|GUAN YONG DENG|46186950|0.0|0|0\nArm Architecture: RISC-Based Computer Design||Carlton Neuenfeldt|54116299|0.0|0|0" }, "aardappel": { "title": "Aardappel", "appeared": 1997, "type": "pl", "creators": [ "Wouter Van Oortmerssen" ], "reference": [ "https://semanticscholar.org/paper/24495ce84438ba182e1b1bf006d61d7cc7757211" ], "originCommunity": [ "University of Southampton" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5743", "centralPackageRepositoryCount": 0 }, "aardvark": { "title": "Aardvark", "appeared": 2020, "type": "pl", "creators": [ "Hg0428", "JustCoding123", "CompilingCoder", "TheBoys619", "PlasDev", "ZDev1" ], "description": "Aardvark is an object oriented programming language designed writing clean and easy to read code. It is an interpreted language written in C++, Go, and Python. Version 0.1~0.8.9 was written in Python, Version 1.0 was written in C++, and AdkGO was written in Go. It has a UI, graphics, and data science/artificial intellegence library as of 2022.", "website": "https://docs.programit.repl.co", "country": [ "United Kingdom", "United States", "South Korea" ], "originCommunity": [ "discord" ], "example": [ "#include os as os\nclass Hello() {\n funct helloWorld() {\n output('helloWorld')\n i = 0\n if i==0 {\n output('i is 0!')\n }\n }\n}" ], "githubRepo": { "firstCommit": 2022, "stars": 5, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "issues": 0, "url": "https://github.com/Aardvark-team/Adk" }, "repoStats": { "firstCommit": 2022, "commits": 2, "committers": 1, "files": 94 }, "isOpenSource": true }, "abacus-machine": { "title": "Abacus", "appeared": -2700, "type": "computingMachine", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Abacus" } }, "abal": { "title": "ABAL", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/451fb648f4cf28e6b4d7ddb58717a68ad5e50a75" ], "originCommunity": [ "Auburn University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7892", "centralPackageRepositoryCount": 0 }, "abap": { "title": "ABAP", "appeared": 1983, "type": "pl", "website": "http://scn.sap.com/community/abap", "documentation": [ "https://help.sap.com/doc/abapdocu_755_index_htm/7.55/en-US/index.htm" ], "standsFor": "Advanced Business Application Programming", "originCommunity": [ "SAP" ], "releaseNotesUrl": "https://help.sap.com/docs/BTP/4726775c8bfc483abb210252604515b2/e9b10e43016e423ab0efe91e668a6efc.html", "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "* A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "isCaseSensitive": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasIntegers": { "example": "* [0-9]+", "value": true }, "lineCommentToken": [ [ "*" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abap-source", "abbreviated", "abstract", "accept", "accepting", "according", "activation", "actual", "add", "add-corresponding", "adjacent", "after", "alias", "aliases", "align", "all", "allocate", "alpha", "analysis", "analyzer", "and", "append", "appendage", "appending", "application", "archive", "area", "arithmetic", "as", "ascending", "aspect", "assert", "assign", "assigned", "assigning", "association", "asynchronous", "at", "attributes", "authority", "authority-check", "avg", "back", "background", "backup", "backward", "badi", "base", "before", "begin", "between", "big", "binary", "bintohex", "bit", "black", "blank", "blanks", "blob", "block", "blocks", "blue", "bound", "boundaries", "bounds", "boxed", "break-point", "buffer", "by", "bypassing", "byte", "byte-order", "call", "calling", "case", "cast", "casting", "catch", "center", "centered", "chain", "chain-input", "chain-request", "change", "changing", "channels", "character", "char-to-hex", "check", "checkbox", "ci_", "circular", "class", "class-coding", "class-data", "class-events", "class-methods", "class-pool", "cleanup", "clear", "client", "clob", "clock", "close", "coalesce", "code", "coding", "col_background", "col_group", "col_heading", "col_key", "col_negative", "col_normal", "col_positive", "col_total", "collect", "color", "column", "columns", "comment", "comments", "commit", "common", "communication", "comparing", "component", "components", "compression", "compute", "concat", "concat_with_space", "concatenate", "cond", "condense", "condition", "connect", "connection", "constants", "context", "contexts", "continue", "control", "controls", "conv", "conversion", "convert", "copies", "copy", "corresponding", "country", "cover", "cpi", "create", "creating", "critical", "currency", "currency_conversion", "current", "cursor", "cursor-selection", "customer", "customer-function", "dangerous", "data", "database", "datainfo", "dataset", "date", "dats_add_days", "dats_add_months", "dats_days_between", "dats_is_valid", "daylight", "dd/mm/yy", "dd/mm/yyyy", "ddmmyy", "deallocate", "decimal_shift", "decimals", "declarations", "deep", "default", "deferred", "define", "defining", "definition", "delete", "deleting", "demand", "department", "descending", "describe", "destination", "detail", "dialog", "directory", "disconnect", "display", "display-mode", "distinct", "divide", "divide-corresponding", "division", "do", "dummy", "duplicate", "duplicates", "duration", "during", "dynamic", "dynpro", "edit", "editor-call", "else", "elseif", "empty", "enabled", "enabling", "encoding", "end", "endat", "endcase", "endcatch", "endchain", "endclass", "enddo", "endenhancement", "end-enhancement-section", "endexec", "endform", "endfunction", "endian", "endif", "ending", "endinterface", "end-lines", "endloop", "endmethod", "endmodule", "end-of-definition", "end-of-editing", "end-of-file", "end-of-page", "end-of-selection", "endon", "endprovide", "endselect", "end-test-injection", "end-test-seam", "endtry", "endwhile", "endwith", "engineering", "enhancement", "enhancement-point", "enhancements", "enhancement-section", "entries", "entry", "enum", "environment", "equiv", "errormessage", "errors", "escaping", "event", "events", "exact", "except", "exception", "exceptions", "exception-table", "exclude", "excluding", "exec", "execute", "exists", "exit", "exit-command", "expand", "expanding", "expiration", "explicit", "exponent", "export", "exporting", "extend", "extended", "extension", "extract", "fail", "fetch", "field", "field-groups", "fields", "field-symbol", "field-symbols", "file", "filter", "filters", "filter-table", "final", "find", "first", "first-line", "fixed-point", "fkeq", "fkge", "flush", "font", "for", "form", "format", "forward", "found", "frame", "frames", "free", "friends", "from", "function", "functionality", "function-pool", "further", "gaps", "generate", "get", "giving", "gkeq", "gkge", "global", "grant", "green", "group", "groups", "handle", "handler", "harmless", "hashed", "having", "hdb", "header", "headers", "heading", "head-lines", "help-id", "help-request", "hextobin", "hide", "high", "hint", "hold", "hotspot", "icon", "id", "identification", "identifier", "ids", "if", "ignore", "ignoring", "immediately", "implementation", "implementations", "implemented", "implicit", "import", "importing", "in", "inactive", "incl", "include", "includes", "including", "increment", "index", "index-line", "infotypes", "inheriting", "init", "initial", "initialization", "inner", "inout", "input", "insert", "instance", "instances", "instr", "intensified", "interface", "interface-pool", "interfaces", "internal", "intervals", "into", "inverse", "inverted-date", "is", "iso", "job", "join", "keep", "keeping", "kernel", "key", "keys", "keywords", "kind", "language", "last", "late", "layout", "leading", "leave", "left", "left-justified", "leftplus", "leftspace", "legacy", "length", "let", "level", "levels", "like", "line", "lines", "line-count", "linefeed", "line-selection", "line-size", "list", "listbox", "list-processing", "little", "llang", "load", "load-of-program", "lob", "local", "locale", "locator", "logfile", "logical", "log-point", "long", "loop", "low", "lower", "lpad", "lpi", "ltrim", "mail", "main", "major-id", "mapping", "margin", "mark", "mask", "match", "matchcode", "max", "maximum", "medium", "members", "memory", "mesh", "message", "message-id", "messages", "messaging", "method", "methods", "min", "minimum", "minor-id", "mm/dd/yy", "mm/dd/yyyy", "mmddyy", "mode", "modif", "modifier", "modify", "module", "move", "move-corresponding", "multiply", "multiply-corresponding", "name", "nametab", "native", "nested", "nesting", "new", "new-line", "new-page", "new-section", "next", "no", "no-display", "no-extension", "no-gap", "no-gaps", "no-grouping", "no-heading", "no-scrolling", "no-sign", "no-title", "no-topofpage", "no-zero", "node", "nodes", "non-unicode", "non-unique", "not", "null", "number", "object", "objects", "obligatory", "occurrence", "occurrences", "occurs", "of", "off", "offset", "ole", "on", "only", "open", "option", "optional", "options", "or", "order", "other", "others", "out", "outer", "output", "output-length", "overflow", "overlay", "pack", "package", "pad", "padding", "page", "pages", "parameter", "parameters", "parameter-table", "part", "partially", "pattern", "percentage", "perform", "performing", "person", "pf1", "pf10", "pf11", "pf12", "pf13", "pf14", "pf15", "pf2", "pf3", "pf4", "pf5", "pf6", "pf7", "pf8", "pf9", "pf-status", "pink", "places", "pool", "pos_high", "pos_low", "position", "pragmas", "precompiled", "preferred", "preserving", "primary", "print", "print-control", "priority", "private", "procedure", "process", "program", "property", "protected", "provide", "public", "push", "pushbutton", "put", "queue-only", "quickinfo", "radiobutton", "raise", "raising", "range", "ranges", "read", "reader", "read-only", "receive", "received", "receiver", "receiving", "red", "redefinition", "reduce", "reduced", "ref", "reference", "refresh", "regex", "reject", "remote", "renaming", "replace", "replacement", "replacing", "report", "request", "requested", "reserve", "reset", "resolution", "respecting", "responsible", "result", "results", "resumable", "resume", "retry", "return", "returncode", "returning", "returns", "right", "right-justified", "rightplus", "rightspace", "risk", "rmc_communication_failure", "rmc_invalid_status", "rmc_system_failure", "role", "rollback", "rows", "rpad", "rtrim", "run", "sap", "sap-spool", "saving", "scale_preserving", "scale_preserving_scientific", "scan", "scientific", "scientific_with_leading_zero", "scroll", "scroll-boundary", "scrolling", "search", "secondary", "seconds", "section", "select", "selection", "selections", "selection-screen", "selection-set", "selection-sets", "selection-table", "select-options", "send", "separate", "separated", "set", "shared", "shift", "short", "shortdump-id", "sign_as_postfix", "single", "size", "skip", "skipping", "smart", "some", "sort", "sortable", "sorted", "source", "specified", "split", "spool", "spots", "sql", "sqlscript", "stable", "stamp", "standard", "starting", "start-of-editing", "start-of-selection", "state", "statement", "statements", "static", "statics", "statusinfo", "step-loop", "stop", "structure", "structures", "style", "subkey", "submatches", "submit", "subroutine", "subscreen", "subtract", "subtract-corresponding", "suffix", "sum", "summary", "summing", "supplied", "supply", "suppress", "switch", "switchstates", "symbol", "syncpoints", "syntax", "syntax-check", "syntax-trace", "system-call", "system-exceptions", "system-exit", "tab", "tabbed", "table", "tables", "tableview", "tabstrip", "target", "task", "tasks", "test", "testing", "test-injection", "test-seam", "text", "textpool", "then", "throw", "time", "times", "timestamp", "timezone", "tims_is_valid", "title", "titlebar", "title-lines", "to", "tokenization", "tokens", "top-lines", "top-of-page", "trace-file", "trace-table", "trailing", "transaction", "transfer", "transformation", "translate", "transporting", "trmac", "truncate", "truncation", "try", "tstmp_add_seconds", "tstmp_current_utctimestamp", "tstmp_is_valid", "tstmp_seconds_between", "type", "type-pool", "type-pools", "types", "uline", "unassign", "under", "unicode", "union", "unique", "unit_conversion", "unix", "unpack", "until", "unwind", "up", "update", "upper", "user", "user-command", "using", "utf-8", "valid", "value", "value-request", "values", "vary", "varying", "verification-message", "version", "via", "view", "visible", "wait", "warning", "when", "whenever", "where", "while", "width", "window", "windows", "with", "with-heading", "without", "with-title", "word", "work", "write", "writer", "xml", "xsd", "yellow", "yes", "yymmdd", "zero", "zone", "abap_system_timezone", "abap_user_timezone", "access", "action", "adabas", "adjust_numbers", "allow_precision_loss", "allowed", "amdp", "applicationuser", "as_geo_json", "as400", "associations", "balance", "behavior", "breakup", "bulk", "cds", "cds_client", "check_before_save", "child", "clients", "corr", "corr_spearman", "cross", "cycles", "datn_add_days", "datn_add_months", "datn_days_between", "dats_from_datn", "dats_tims_to_tstmp", "dats_to_datn", "db2", "db6", "ddl", "dense_rank", "depth", "deterministic", "discarding", "entities", "entity", "error", "failed", "finalize", "first_value", "fltp_to_dec", "following", "fractional", "full", "graph", "grouping", "hierarchy", "hierarchy_ancestors", "hierarchy_ancestors_aggregate", "hierarchy_descendants", "hierarchy_descendants_aggregate", "hierarchy_siblings", "incremental", "indicators", "lag", "last_value", "lead", "leaves", "like_regexpr", "link", "locale_sap", "lock", "locks", "many", "mapped", "matched", "measures", "median", "mssqlnt", "multiple", "nodetype", "ntile", "nulls", "occurrences_regexpr", "one", "operations", "oracle", "orphans", "over", "parent", "parents", "partition", "pcre", "period", "pfcg_mapping", "preceding", "privileged", "product", "projection", "rank", "redirected", "replace_regexpr", "reported", "response", "responses", "root", "row", "row_number", "sap_system_date", "save", "schema", "session", "sets", "shortdump", "siblings", "spantree", "start", "stddev", "string_agg", "subtotal", "sybase", "tims_from_timn", "tims_to_timn", "to_blob", "to_clob", "total", "trace-entry", "tstmp_to_dats", "tstmp_to_dst", "tstmp_to_tims", "tstmpl_from_utcl", "tstmpl_to_utcl", "unbounded", "utcl_add_seconds", "utcl_current", "utcl_seconds_between", "uuid", "var", "verbatim" ], "wikipedia": { "example": [ "* First define structured type\nTYPES: BEGIN OF t_vbrk,\n VBELN TYPE VBRK-VBELN,\n ZUONR TYPE VBRK-ZUONR,\n END OF t_vbrk.\n\n* Now define internal table of our defined type t_vbrk\nDATA : gt_vbrk TYPE STANDARD TABLE OF t_vbrk,\n gt_vbrk_2 TYPE STANDARD TABLE OF t_vbrk. \"easy to define more tables\n\n* If needed, define structure (line of internal table)\n* Definition with type or with reference to internal table:\nDATA : gs_vbrk TYPE t_vbrk,\n gs_vbrk2 LIKE LINE OF gt_vbrk2.\n\n* You can also define table type if needed\nTYPES tt_vbrk TYPE STANDARD TABLE OF t_vbrk." ], "related": [ "objective-c", "cobol", "sql", "java", "unix", "solaris", "linux", "systemz", "eclipse-editor" ], "summary": "ABAP (Advanced Business Application Programming, originally Allgemeiner Berichts-Aufbereitungs-Prozessor, German for \"general report creation processor\") is a high-level programming language created by the German software company SAP SE. It is currently positioned, alongside Java, as the language for programming the SAP Application Server, which is part of the NetWeaver platform for building business applications.", "pageId": 271832, "dailyPageViews": 439, "created": 2003, "backlinksCount": 181, "revisionCount": 1472, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/ABAP" }, "githubLanguage": { "fileExtensions": [ "abap" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "abap", "tmScope": "source.abap", "repos": 4488, "id": "ABAP" }, "githubBigQuery": { "repos": 450, "users": 387, "id": "ABAP" }, "monaco": "abap", "pygmentsHighlighter": { "filename": "business.py", "fileExtensions": [ "abap", "ABAP" ], "id": "ABAP" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2018, "committerCount": 4, "commitCount": 42, "sampleCount": 1, "example": [ "*/**\n* The MIT License (MIT)\n* Copyright (c) 2012 René van Mil\n* \n* Permission is hereby granted, free of charge, to any person obtaining\n* a copy of this software and associated documentation files (the\n* \"Software\"), to deal in the Software without restriction, including\n* without limitation the rights to use, copy, modify, merge, publish,\n* distribute, sublicense, and/or sell copies of the Software, and to\n* permit persons to whom the Software is furnished to do so, subject to\n* the following conditions:\n* \n* The above copyright notice and this permission notice shall be\n* included in all copies or substantial portions of the Software.\n* \n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\n*----------------------------------------------------------------------*\n* CLASS CL_CSV_PARSER DEFINITION\n*----------------------------------------------------------------------*\n*\n*----------------------------------------------------------------------*\nclass cl_csv_parser definition\n public\n inheriting from cl_object\n final\n create public .\n\n public section.\n*\"* public components of class CL_CSV_PARSER\n*\"* do not include other source files here!!!\n\n type-pools abap .\n methods constructor\n importing\n !delegate type ref to if_csv_parser_delegate\n !csvstring type string\n !separator type c\n !skip_first_line type abap_bool .\n methods parse\n raising\n cx_csv_parse_error .\n protected section.\n*\"* protected components of class CL_CSV_PARSER\n*\"* do not include other source files here!!!\n private section.\n*\"* private components of class CL_CSV_PARSER\n*\"* do not include other source files here!!!\n\n constants _textindicator type c value '\"'. \"#EC NOTEXT\n data _delegate type ref to if_csv_parser_delegate .\n data _csvstring type string .\n data _separator type c .\n type-pools abap .\n data _skip_first_line type abap_bool .\n\n methods _lines\n returning\n value(returning) type stringtab .\n methods _parse_line\n importing\n !line type string\n returning\n value(returning) type stringtab\n raising\n cx_csv_parse_error .\nendclass. \"CL_CSV_PARSER DEFINITION\n\n\n\n*----------------------------------------------------------------------*\n* CLASS CL_CSV_PARSER IMPLEMENTATION\n*----------------------------------------------------------------------*\n*\n*----------------------------------------------------------------------*\nclass cl_csv_parser implementation.\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Public Method CL_CSV_PARSER->CONSTRUCTOR\n* +-------------------------------------------------------------------------------------------------+\n* | [--->] DELEGATE TYPE REF TO IF_CSV_PARSER_DELEGATE\n* | [--->] CSVSTRING TYPE STRING\n* | [--->] SEPARATOR TYPE C\n* | [--->] SKIP_FIRST_LINE TYPE ABAP_BOOL\n* +--------------------------------------------------------------------------------------\n method constructor.\n super->constructor( ).\n _delegate = delegate.\n _csvstring = csvstring.\n _separator = separator.\n _skip_first_line = skip_first_line.\n endmethod. \"constructor\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Public Method CL_CSV_PARSER->PARSE\n* +-------------------------------------------------------------------------------------------------+\n* | [!CX!] CX_CSV_PARSE_ERROR\n* +--------------------------------------------------------------------------------------\n method parse.\n data msg type string.\n if _csvstring is initial.\n message e002(csv) into msg.\n raise exception type cx_csv_parse_error\n exporting\n message = msg.\n endif.\n\n \" Get the lines\n data is_first_line type abap_bool value abap_true.\n data lines type standard table of string.\n lines = _lines( ).\n field-symbols type string.\n loop at lines assigning .\n \" Should we skip the first line?\n if _skip_first_line = abap_true and is_first_line = abap_true.\n is_first_line = abap_false.\n continue.\n endif.\n \" Parse the line\n data values type standard table of string.\n values = _parse_line( ).\n \" Send values to delegate\n _delegate->values_found( values ).\n endloop.\n endmethod. \"parse\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Private Method CL_CSV_PARSER->_LINES\n* +-------------------------------------------------------------------------------------------------+\n* | [<-()] RETURNING TYPE STRINGTAB\n* +--------------------------------------------------------------------------------------\n method _lines.\n split _csvstring at cl_abap_char_utilities=>cr_lf into table returning.\n endmethod. \"_lines\n\n\n* ---------------------------------------------------------------------------------------+\n* | Instance Private Method CL_CSV_PARSER->_PARSE_LINE\n* +-------------------------------------------------------------------------------------------------+\n* | [--->] LINE TYPE STRING\n* | [<-()] RETURNING TYPE STRINGTAB\n* | [!CX!] CX_CSV_PARSE_ERROR\n* +--------------------------------------------------------------------------------------\n method _parse_line.\n data msg type string.\n\n data csvvalue type string.\n data csvvalues type standard table of string.\n\n data char type c.\n data pos type i value 0.\n data len type i.\n len = strlen( line ).\n while pos < len.\n char = line+pos(1).\n if char <> _separator.\n if char = _textindicator.\n data text_ended type abap_bool.\n text_ended = abap_false.\n while text_ended = abap_false.\n pos = pos + 1.\n if pos < len.\n char = line+pos(1).\n if char = _textindicator.\n text_ended = abap_true.\n else.\n if char is initial. \" Space\n concatenate csvvalue ` ` into csvvalue.\n else.\n concatenate csvvalue char into csvvalue.\n endif.\n endif.\n else.\n \" Reached the end of the line while inside a text value\n \" This indicates an error in the CSV formatting\n text_ended = abap_true.\n message e003(csv) into msg.\n raise exception type cx_csv_parse_error\n exporting\n message = msg.\n endif.\n endwhile.\n \" Check if next character is a separator, otherwise the CSV formatting is incorrect\n data nextpos type i.\n nextpos = pos + 1.\n if nextpos < len and line+nextpos(1) <> _separator.\n message e003(csv) into msg.\n raise exception type cx_csv_parse_error\n exporting\n message = msg.\n endif.\n else.\n if char is initial. \" Space\n concatenate csvvalue ` ` into csvvalue.\n else.\n concatenate csvvalue char into csvvalue.\n endif.\n endif.\n else.\n append csvvalue to csvvalues.\n clear csvvalue.\n endif.\n pos = pos + 1.\n endwhile.\n append csvvalue to csvvalues. \" Don't forget the last value\n\n returning = csvvalues.\n endmethod. \"_parse_line\nendclass. \"CL_CSV_PARSER IMPLEMENTATION" ], "url": "https://github.com/pvl/abap.tmbundle" }, "projectEuler": { "memberCount": { "2019": 45, "2022": 47 }, "id": "ABAP" }, "leachim6": { "filepath": "a/ABAP.abap", "fileExtensions": [ "abap" ], "example": [ "REPORT ZHELLO_WORLD.\n\nSTART-OF-SELECTION.\n WRITE: 'Hello World'.\n\n\n" ], "id": "ABAP" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ABAP", "indeedJobs": { "2022": 283, "query": "abap developer" }, "officialBlogUrl": [ "https://blogs.sap.com/tags/833755570260738661924709785639136/" ], "eventsPageUrl": [ "https://blogs.sap.com/2020/04/21/abap-community-online-events/" ], "tiobe": { "currentRank": 40, "id": "ABAP" }, "pypl": "Abap", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nABAP Objects: ABAP Programming in SAP NetWeaver Book/DVD Package|2007|H. Keller|2336185|4.25|8|1\nIntroduction to ABAP/4 Programming for SAP|1996|Robert Lyfareff|1052163|3.67|6|1\nABAP Objects: Introduction to Programming SAP Applications|2002|Horst Keller|1090441|4.10|20|1\nAdvanced ABAP Programming for SAP|1999|Gareth M. De Bruyn|1220544|3.00|4|0", "isbndb": "year|publisher|title|authors|isbn13\n2002|Addison-Wesley Professional|SAP.Keller: ABAP Objects_c|Keller, Horst and Keller, Horst and Kruger, Sascha|9780201750805\n2018|SAP Press|ABAP Programming Model for SAP Fiori: ABAP Development for SAP S/4HANA (SAP PRESS)|Stefan Haas and Bince Mathew|9781493217649\n1999|Premier Pr|Advanced Abap Programming For Sap (sap R/3)|Gareth M De Bruyn and Ken Kroes|9780761517986\n2010|Springer|Web Dynpro ABAP for Practitioners|Gellert, Ulrich and Cristea, Ana Daniela|9783642113857\n2019|SAP Press|ABAP: The Comprehensive Guide to SAP ABAP 7.52 and 1909 (Second Edition) (SAP PRESS)|Kiran Bandari|9781493218660\n2019|SAP Press|ABAP: An Introduction and Beginner's Guide to Programming with SAP ABAP (2nd Edition) (SAP PRESS)|Brian O'Neil and Jelena Perfiljeva|9781493218806\n2015-11-30T00:00:01Z|SAP Press|ABAP Objects: ABAP Object-Oriented Programming (OOP) (2nd Edition) (SAP PRESS)|James Wood and Joseph Rupert|9781592299935\n2019|SAP Press|ABAP to the Future: Advanced, Modern ABAP (Third Edition) (SAP PRESS)|Paul Hardy|9781493217618\n2019|Packt Publishing|Mastering SAP ABAP: A complete guide to developing fast, durable, and maintainable ABAP programs in SAP|Grześkowiak, Paweł and Ciesielski, Wojciech and Ćwik, Wojciech|9781787129498\n2011|SAP PRESS|Discover ABAP: Your Introduction to ABAP Objects|Kühnhauser, Karl-Heinz and Franz, Thorsten|9781592294022\n2007|SAP PRESS|ABAP Objects: ABAP Programming in SAP NetWeaver|Keller, Horst and Krüger, Sascha|9781592290796\n2017|Independently published|Learn ABAP in 1 Day: Definitive Guide to Learn SAP ABAP Programming for Beginners|Rungta, Krishna|9781521595701\n2014-07-17T00:00:01Z|Cengage Learning PTR|Introduction to ABAP Programming for SAP, 3rd Edition|Gareth M. De Bruyn and Robert Lyfareff and Mark Balleza and Dhruv Kashyap|9781305266476\n2019|SAP Press|ABAP RESTful Programming Model: ABAP Development for SAP S/4HANA (SAP PRESS)|Stefan Haas and Bince Mathew|9781493219032\n2009-09-28T00:00:01Z|SAP PRESS|Official ABAP Programming Guidelines|Keller, Horst and Thümmel, Wolf Hagen|9781592292905\n2012|Packt Publishing|SAP ABAP Advanced cookbook (Quick Answers to Common Problems)|Zaidi, Rehan|9781849684897\n2019|Packt Publishing|Mastering SAP ABAP: A complete guide to developing fast, durable, and maintainable ABAP programs in SAP|Grzeskowiak, Pawel and Ciesielski, Wojciech and Cwik, Wojciech|9781787288942\n2010-05-28T00:00:01Z|SAP PRESS|ABAP Cookbook: Programming Recipes for Everyday Solutions|Wood, James|9781592293261\n2021|Apress|Improving the Quality of ABAP Code: Striving for Perfection|Hardy, Paul David|9781484267110\n2013|Springer|Web Dynpro ABAP for Practitioners|Gellert, Ulrich and Cristea, Ana Daniela|9783642382475\n2009-01-28T00:00:01Z|SAP PRESS|Object-Oriented Programming with ABAP Objects|Wood, James|9781592292356\n2010|SAP PRESS|ABAP Development for Materials Management in SAP: User Exits and BAdIs|Schwaninger, Jürgen|9781592293735\n2017|Apress|Pro SAP Scripts, Smartforms, and Data Migration: ABAP Programming Simplified|Markandeya, Sushil|9781484231838\n2006|Apress|Foundations of Java for ABAP Programmers|Rooney, Alistair|9781590596258\n2012|Packt Publishing|SAP ABAP Advanced cookbook (Quick Answers to Common Problems)|Zaidi Rehan|9781849684880\n2006|Equity Press|SAP ABAP Certification Review: SAP ABAP Interview Questions, Answers, And Explanations|Fewer, Barry|9781933804064\n2004|SAP PRESS|Enhancing the Quality of ABAP Development|Heuvelmans, Wouter and Krouwels, Albert and Meijs, Ben and Sommen, Ron|9781592290307\n20170620|Springer Nature|JavaScript Essentials for SAP ABAP Developers|Rehan Zaidi|9781484222201\n2017|Rheinwerk Publishing,|Complete Abap|Bandari, Kiran|9781493212743\n2010-05-28|Rheinwerk Publishing, Inc.|ABAP Cookbook|James Wood|9781592298877\n2012-10-28|Rheinwerk Publishing, Inc.|Web Dynpro ABAP|James Wood and Shaan Parvaze|9781592295999\n20190927|Springer Nature|SAP ABAP Objects|Rehan Zaidi|9781484249642\n20210529|Springer Nature|ABAP in Eclipse|Łukasz Pęgiel|9781484269633\n2009-06-28|Rheinwerk Publishing, Inc.|ABAP Performance Tuning|Hermann Gahm|9781592295555\n2019-11-21|Rheinwerk Publishing, Inc.|ABAP RESTful Programming Model|Stefan Haas and Bince Mathew|9781493219049\n2013-10-28|Rheinwerk Publishing, Inc.|Function Modules in ABAP|Tanmaya Gupta|9781592298518\n2019-02-26|Rheinwerk Publishing, Inc.|ABAP to the Future|Paul Hardy|9781493217625\n2018-11-27|Rheinwerk Publishing, Inc.|ABAP Programming Model for SAP Fiori|Stefan Haas and Bince Mathew|9781493217656\n2018-08-01|Createspace Independent Publishing Platform|Interface Programming In Sap Abap|Dr Boris Rubarth|9781722902940\n20210401|Springer Nature|Automated Unit Testing with ABAP|James E. McDonough|9781484269510\n1996|Prima Pub|Introduction To Abap 4 Programming|Gareth Debruyn|9780761508038\n2016|Rheinwerk Publishing,|Object-oriented Programming With Abap Objects|Wood, James and Rupert, Joe|\n2015-10-22|Rheinwerk Publishing, Inc.|Object-Oriented Programming with ABAP Objects|James Wood and Joseph Rupert|9781592299942\n2010-11-28|Rheinwerk Publishing, Inc.|BRFplus—Business Rule Management for ABAP Applications|Thomas Albrecht and Carsten Ziegler|9781592298914\n1999|Consultants Network Inc|Instant Access: Sap Developer's Reference For Abap|The Consultants Network Inc.|9780965563345\n2011-01-28|Rheinwerk Publishing, Inc.|ABAP Development for Financial Accounting: Custom Enhancements|Sergey Korolev|9781592297399\n2012-09-28|Rheinwerk Publishing, Inc.|ABAP Development for Sales and Distribution in SAP|Michael Koch|9781592296033\n2000|Youguys Pub|Abap Programming: A Guide To The Certification Course|Kathleen Sikora|9780970655400\n2017|Apress|Pro Sap Scripts, Smartforms, And Data Migration: Abap Programming Simplified|Sushil Markandeya|9781484231821\n2010-11-28|Rheinwerk Publishing, Inc.|ABAP Development for Materials Management in SAP: User Exits and BAdIs|Jürgen Schwaninger|9781592297436\n2003|Sap Press|Web Programming With The Sap Web Application Server: The Complete Guide For Abap And Web Developers|Frédéric Heinemann and Christian Rau|9781592290130", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2002|Teaching SAP's ABAP Programming Language to IS Students: Adopting and Adapting Web-based Technologies|10.28945/2530|6|0|Brendan McCarthy and Paul Hawking|24eebbc39ee141a470e92d7d154c5bb7590f7914\n2008|ABAP OBJECTS: DESIGNING A PROGRAMMING COURSE FOR INFORMATION SYSTEMS STUDENTS USING SAP SOFTWARE|10.48009/1_iis_2008_165-167|1|0|C. Rogers|4b660a8a0cd7ff636673dd7553d2ad7a19914d04" }, "abbreviated-test-language-for-all-systems": { "title": "Abbreviated Test Language for All Systems", "appeared": 1984, "type": "pl", "originCommunity": [ "ARINC" ], "wikipedia": { "example": [ "...\n 010200 APPLY, AC SIGNAL, VOLTAGE-PP 7.5V, FREQ 3 KHZ, CNX HI=P1-1 $\n...\n 010300 VERIFY, (VOLTAGE-AV INTO ‘VAVG’), AC SIGNAL, VOLTAGE-PP RANGE 64V TO 1V, SAMPLE-WIDTH 10MSEC, \n SYNC-VOLTAGE 2 MAX 5, SYNC-NEG-SLOPE, MAX-TIME 0.5, GO-TO-STEP 400 IF GO, LL 0.5 UL 50, \n CNX HI=P2-4 LO=P2-5, SYNC HI=P2-8 LO=P2-5 $ \n..." ], "summary": "Abbreviated Test Language for All Systems (ATLAS) is a MILSPEC language for automatic testing of avionics equipment. It is a high-level computer language and can be used on any computer whose supporting software can translate it into the appropriate low-level instructions.", "created": 2002, "backlinksCount": 8, "pageId": 60446, "revisionCount": 101, "dailyPageViews": 14, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/Abbreviated_Test_Language_for_All_Systems" }, "centralPackageRepositoryCount": 0 }, "abc-80": { "title": "ABC 80", "appeared": 1978, "type": "pl", "originCommunity": [ "Dataindustrier AB" ], "wikipedia": { "related": [ "basic", "assembly-language" ], "summary": "The ABC 80 (Advanced BASIC Computer 80) was a personal computer engineered by the Swedish corporation Dataindustrier AB (DIAB) and manufactured by Luxor in Motala, Sweden in the late 1970s and early 1980s. It was introduced on the market in August 1978. The ABC 80 was based on an earlier modular computer system from the same company and built around a Z80 and 16 KB of ROM containing a fast semi-compiling BASIC interpreter. It had 16-32 KB of RAM as main memory and a dedicated (included) tape recorder for program and data storage, but could also be expanded to handle disk drives as well as many other peripherals. The ROM could be extended in increments of 1 or 4KB in order to handle such so called \"options\". The monitor was a black and white TV set modified for the purpose, an obvious choice since Luxor also made TVs. The ABC 80 was used in schools and officies around Scandinavia and parts of Europe. It was also used for industrial automation, scientific measurement and control systems. Like its successor, the ABC 800, the computer had an unusually quick and usable BASIC with excellent I/O response times, something that was often discovered when trying to switch to IBM PC-based personal computers. Due to its roots in an industrial computer system, the ABC 80 also had a flexible bus extension system with many (external) expansion and peripheral cards available for various purposes and applications, as well as high quality support and documentation. ABC 80 was also manufactured on license as BRG ABC80 by Budapesti Rádiótechnikai Gyár in Hungary. It used the same keyboard, but the case was metal instead of plastic.", "created": 2003, "backlinksCount": 32, "pageId": 164108, "revisionCount": 133, "dailyPageViews": 19, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/ABC_80" }, "centralPackageRepositoryCount": 0 }, "abc-algol": { "title": "ABC ALGOL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d332497d174c3e417cfc9c4bdb277e535bbfc3f9" ], "originCommunity": [ "University of Amsterdam" ], "hopl": "https://hopl.info/showlanguage.prx?exp=600", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "abc": { "title": "ABC", "appeared": 1980, "type": "pl", "country": [ "Netherlands" ], "originCommunity": [ "Centrum Wiskunde & Informatica" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "WRITE" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "HOW TO RETURN words document:\n PUT {} IN collection\n FOR line IN document:\n FOR word IN split line:\n IF word not.in collection:\n INSERT word IN collection\n RETURN collection" ], "related": [ "setl", "algol-68", "python", "basic", "pascal", "awk", "c", "unix", "isbn" ], "summary": "ABC is an imperative general-purpose programming language and programming environment developed at CWI, Netherlands by Leo Geurts, Lambert Meertens, and Steven Pemberton. It is interactive, structured, high-level, and intended to be used instead of BASIC, Pascal, or AWK. It is not meant to be a systems-programming language but is intended for teaching or prototyping. The language had a major influence on the design of the Python programming language; Guido van Rossum, who developed Python, previously worked for several years on the ABC system in the early 1980s.", "pageId": 147585, "dailyPageViews": 121, "created": 2002, "backlinksCount": 43, "revisionCount": 122, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/ABC_(programming_language)" }, "helloWorldCollection": [ "\\ Hello world in ABC\n\nWRITE \"Hello, World!\" /" ], "leachim6": { "filepath": "a/ABC.abc", "fileExtensions": [ "abc" ], "example": [ "WRITE \"Hello World\"\n" ], "id": "ABC" }, "rijuRepl": { "example": [ "WRITE \"Hello, world!\" /\n" ], "id": "https://riju.codes/abc" }, "tryItOnline": "abc", "tiobe": { "id": "ABC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1290", "fileType": "text", "wordRank": 4100, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2002|Abstracting C with abC|10.1007/3-540-45657-0_43|16|1|D. Dams and W. Hesse and G. Holzmann|df2e5c36fec9d882294eba1dc1181aec89e38a76\n1991|A short introduction to the ABC language|10.1145/122179.122180|8|0|S. Pemberton|fc573575ecdcba4c685739a5e6b89c17544b32c7\n2005|abc the aspectBench compiler for aspectJ a workbench for aspect-oriented programming language and compilers research|10.1145/1094855.1094877|6|0|Chris Allan and Pavel Avgustinov and Aske Simon Christensen and Bruno Dufour and C. Goard and L. Hendren and Sascha Kuzins and Jennifer Lhoták and O. Lhoták and O. Moor and D. Sereni and Ganesh Sittampalam and J. Tibble and Clark Verbrugge|e9c75ec43e213b983f7979ed44be5434b145c235\n2018|Analisis Dan Perancangan Sistem Informasi Penjualan Produk Kesehatan Pada PT. ABC|10.31937/SI.V8I2.645|4|0|T. Husain|9b182e2d3903c7356cc107abcad50f34e59485b9" }, "abcl-cp": { "title": "ABCL/c+", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/613510244f96433d5028261e59e3393d79d28609" ], "originCommunity": [ "Keio University", "Waseda University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1378", "centralPackageRepositoryCount": 0 }, "abcl-f": { "title": "ABCL/f", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/16d7acd6ce54c0fddd5f85dec14291f6b41d7db7" ], "originCommunity": [ "University of Tokyo", "Tokyo Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3575", "centralPackageRepositoryCount": 0 }, "abcl-lang": { "title": "Armed Bear Common Lisp", "appeared": 2008, "type": "pl", "description": "Armed Bear Common Lisp (ABCL) is a full implementation of the Common Lisp language featuring both an interpreter and a compiler, running in the JVM. Originally started to be a scripting language for the J editor, it now supports JSR-223 (Java scripting API): it can be a scripting engine in any Java application. Additionally, it can be used to implement (parts of) the application using Java to Lisp integration APIs.", "website": "https://common-lisp.net/project/armedbear/", "standsFor": "Armed Bear Common Lisp", "aka": [ "ABCL" ], "githubRepo": { "firstCommit": 2008, "stars": 206, "forks": 25, "subscribers": 20, "created": 2016, "updated": 2022, "description": "Armed Bear Common Lisp <--> Bridge", "issues": 89, "url": "https://github.com/armedbear/abcl" }, "repoStats": { "firstCommit": 2008, "commits": 3405, "committers": 23, "files": 841 }, "twitter": "https://twitter.com/armedbear" }, "abcl": { "title": "Actor-Based Concurrent Language", "appeared": 1986, "type": "pl", "standsFor": "Actor-Based Concurrent Language", "originCommunity": [ "University of Tokyo" ], "wikipedia": { "related": [ "common-lisp" ], "summary": "Actor-Based Concurrent Language (ABCL) is a family of programming languages, developed in Japan in the 1980s and 1990s.", "created": 2007, "backlinksCount": 26, "pageId": 11044709, "revisionCount": 32, "dailyPageViews": 9, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Actor-Based_Concurrent_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1779", "centralPackageRepositoryCount": 0 }, "abcpp": { "title": "ABC++", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0014195f11078f8e48eba5a9bf1b213d9db28093" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3637", "centralPackageRepositoryCount": 0 }, "abel": { "title": "ABEL", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/236ecf8536578457ddedcf9c35b843a970a1f726" ], "originCommunity": [ "Telemark College", "University of Oslo" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1780", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1994|Prentice Hall|Digital Design Using Abel|Pellerin, David and Holley, Michael|9780136058748\n2014|Springer|The Abel Prize 2008-2012|Helge Holden|9783642394492\n2013|Springer|NIELS HENRIK ABEL and his Times: Called Too Soon by Flames Afar|Stubhaug, Arild|9783662040768\n2008|Springer|Mathematics and Computation, a Contemporary View: The Abel Symposium 2006 (Abel Symposia Book 3)|Andrew Edney|9783540688501" }, "able": { "title": "ABLE", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/77c151aa7bd1eaefbf0ff95b50a23c1aa771cb21" ], "originCommunity": [ "The University of Utah" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5124", "wordRank": 727, "centralPackageRepositoryCount": 0, "isbndb": "" }, "abnf": { "title": "Augmented Backus-Naur Form", "appeared": 2008, "type": "grammarLanguage", "standsFor": "Augmented Backus-Naur Form", "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "booleanTokens": [ [ "true", "false" ] ], "wikipedia": { "example": [ "postal-address = name-part street zip-part\n\nname-part = *(personal-part SP) last-name [SP suffix] CRLF\nname-part =/ personal-part CRLF\n\npersonal-part = first-name / (initial \".\")\nfirst-name = *ALPHA\ninitial = ALPHA\nlast-name = *ALPHA\nsuffix = (\"Jr.\" / \"Sr.\" / 1*(\"I\" / \"V\" / \"X\"))\n\nstreet = [apt SP] house-num SP street-name CRLF\napt = 1*4DIGIT\nhouse-num = 1*8(DIGIT / ALPHA)\nstreet-name = 1*VCHAR\n\nzip-part = town-name \",\" SP state 1*2SP zip-code CRLF\ntown-name = 1*(ALPHA / SP)\nstate = 2ALPHA\nzip-code = 5DIGIT [\"-\" 4DIGIT]" ], "related": [ "regex" ], "summary": "In computer science, augmented Backus–Naur form (ABNF) is a metalanguage based on Backus–Naur form (BNF), but consisting of its own syntax and derivation rules. The motive principle for ABNF is to describe a formal system of a language to be used as a bidirectional communications protocol. It is defined by Internet Standard 68 (\"STD 68\", type case sic), which as of December 2010 is RFC 5234, and it often serves as the definition language for IETF communication protocols. RFC 5234 supersedes RFC 4234 (which superseded RFC 2234 and RFC 733). RFC 7405 updates it, adding a syntax for specifying case-sensitive string literals.", "pageId": 60476, "dailyPageViews": 51, "backlinksCount": 22, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Augmented_Backus–Naur_form" }, "githubLanguage": { "fileExtensions": [ "abnf" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.abnf", "repos": 1, "id": "ABNF" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/abnf", "pygmentsHighlighter": { "filename": "grammar_notation.py", "fileExtensions": [ "abnf" ], "id": "ABNF" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2016, "committerCount": 2, "commitCount": 46, "sampleCount": 1, "example": [ "; Source: https://github.com/toml-lang/toml\n; License: MIT\n\n;; This is an attempt to define TOML in ABNF according to the grammar defined\n;; in RFC 4234 (http://www.ietf.org/rfc/rfc4234.txt).\n\n;; TOML\n\ntoml = expression *( newline expression )\nexpression = (\n ws /\n ws comment /\n ws keyval ws [ comment ] /\n ws table ws [ comment ]\n)\n\n;; Newline\n\nnewline = (\n %x0A / ; LF\n %x0D.0A ; CRLF\n)\n\nnewlines = 1*newline\n\n;; Whitespace\n\nws = *(\n %x20 / ; Space\n %x09 ; Horizontal tab\n)\n\n;; Comment\n\ncomment-start-symbol = %x23 ; #\nnon-eol = %x09 / %x20-10FFFF\ncomment = comment-start-symbol *non-eol\n\n;; Key-Value pairs\n\nkeyval-sep = ws %x3D ws ; =\nkeyval = key keyval-sep val\n\nkey = unquoted-key / quoted-key\nunquoted-key = 1*( ALPHA / DIGIT / %x2D / %x5F ) ; A-Z / a-z / 0-9 / - / _\nquoted-key = quotation-mark 1*basic-char quotation-mark ; See Basic Strings\n\nval = integer / float / string / boolean / date-time / array / inline-table\n\n;; Table\n\ntable = std-table / array-table\n\n;; Standard Table\n\nstd-table-open = %x5B ws ; [ Left square bracket\nstd-table-close = ws %x5D ; ] Right square bracket\ntable-key-sep = ws %x2E ws ; . Period\n\nstd-table = std-table-open key *( table-key-sep key) std-table-close\n\n;; Array Table\n\narray-table-open = %x5B.5B ws ; [[ Double left square bracket\narray-table-close = ws %x5D.5D ; ]] Double right square bracket\n\narray-table = array-table-open key *( table-key-sep key) array-table-close\n\n;; Integer\n\ninteger = [ minus / plus ] int\nminus = %x2D ; -\nplus = %x2B ; +\ndigit1-9 = %x31-39 ; 1-9\nunderscore = %x5F ; _\nint = DIGIT / digit1-9 1*( DIGIT / underscore DIGIT )\n\n;; Float\n\nfloat = integer ( frac / frac exp / exp )\nzero-prefixable-int = DIGIT *( DIGIT / underscore DIGIT )\nfrac = decimal-point zero-prefixable-int\ndecimal-point = %x2E ; .\nexp = e integer\ne = %x65 / %x45 ; e E\n\n;; String\n\nstring = basic-string / ml-basic-string / literal-string / ml-literal-string\n\n;; Basic String\n\nbasic-string = quotation-mark *basic-char quotation-mark\n\nquotation-mark = %x22 ; \"\n\nbasic-char = basic-unescaped / escaped\nescaped = escape ( %x22 / ; \" quotation mark U+0022\n %x5C / ; \\ reverse solidus U+005C\n %x2F / ; / solidus U+002F\n %x62 / ; b backspace U+0008\n %x66 / ; f form feed U+000C\n %x6E / ; n line feed U+000A\n %x72 / ; r carriage return U+000D\n %x74 / ; t tab U+0009\n %x75 4HEXDIG / ; uXXXX U+XXXX\n %x55 8HEXDIG ) ; UXXXXXXXX U+XXXXXXXX\n\nbasic-unescaped = %x20-21 / %x23-5B / %x5D-10FFFF\n\nescape = %x5C ; \\\n\n;; Multiline Basic String\n\nml-basic-string-delim = quotation-mark quotation-mark quotation-mark\nml-basic-string = ml-basic-string-delim ml-basic-body ml-basic-string-delim\nml-basic-body = *( ml-basic-char / newline / ( escape newline ))\n\nml-basic-char = ml-basic-unescaped / escaped\nml-basic-unescaped = %x20-5B / %x5D-10FFFF\n\n;; Literal String\n\nliteral-string = apostraphe *literal-char apostraphe\n\napostraphe = %x27 ; ' Apostrophe\n\nliteral-char = %x09 / %x20-26 / %x28-10FFFF\n\n;; Multiline Literal String\n\nml-literal-string-delim = apostraphe apostraphe apostraphe\nml-literal-string = ml-literal-string-delim ml-literal-body ml-literal-string-delim\n\nml-literal-body = *( ml-literal-char / newline )\nml-literal-char = %x09 / %x20-10FFFF\n\n;; Boolean\n\nboolean = true / false\ntrue = %x74.72.75.65 ; true\nfalse = %x66.61.6C.73.65 ; false\n\n;; Datetime (as defined in RFC 3339)\n\ndate-fullyear = 4DIGIT\ndate-month = 2DIGIT ; 01-12\ndate-mday = 2DIGIT ; 01-28, 01-29, 01-30, 01-31 based on month/year\ntime-hour = 2DIGIT ; 00-23\ntime-minute = 2DIGIT ; 00-59\ntime-second = 2DIGIT ; 00-58, 00-59, 00-60 based on leap second rules\ntime-secfrac = \".\" 1*DIGIT\ntime-numoffset = ( \"+\" / \"-\" ) time-hour \":\" time-minute\ntime-offset = \"Z\" / time-numoffset\n\npartial-time = time-hour \":\" time-minute \":\" time-second [time-secfrac]\nfull-date = date-fullyear \"-\" date-month \"-\" date-mday\nfull-time = partial-time time-offset\n\ndate-time = full-date \"T\" full-time\n\n;; Array\n\narray-open = %x5B ws ; [\narray-close = ws %x5D ; ]\n\narray = array-open array-values array-close\n\narray-values = [ val [ array-sep ] [ ( comment newlines) / newlines ] /\n val array-sep [ ( comment newlines) / newlines ] array-values ]\n\narray-sep = ws %x2C ws ; , Comma\n\n;; Inline Table\n\ninline-table-open = %x7B ws ; {\ninline-table-close = ws %x7D ; }\ninline-table-sep = ws %x2C ws ; , Comma\n\ninline-table = inline-table-open inline-table-keyvals inline-table-close\n\ninline-table-keyvals = [ inline-table-keyvals-non-empty ]\ninline-table-keyvals-non-empty = key keyval-sep val /\n key keyval-sep val inline-table-sep inline-table-keyvals-non-empty\n\n;; Built-in ABNF terms, reproduced here for clarity\n\n; ALPHA = %x41-5A / %x61-7A ; A-Z / a-z\n; DIGIT = %x30-39 ; 0-9\n; HEXDIG = DIGIT / \"A\" / \"B\" / \"C\" / \"D\" / \"E\" / \"F\"\n" ], "url": "https://github.com/sanssecours/ABNF.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "abs": { "title": "abs", "appeared": 2018, "type": "pl", "creators": [ "Alessandro Nadalin" ], "description": "ABS is a programming language that works best when you're scripting on your terminal. It tries to combine the elegance of languages such as Python, or Ruby with the convenience of Bash.", "website": "https://www.abs-lang.org", "country": [ "United Arab Emirates" ], "domainName": { "registered": 2018, "name": "abs-lang.org" }, "example": [ "r = $(curl \"http://data.nba.net/prod/v1/20170201/0021600732_boxscore.json\" -H 'DNT: 1' -H 'Accept-Encoding: gzip, deflate, sdch' -H 'Accept-Language: en' -H 'User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_11_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/57.0.2987.133 Safari/537.36' -H 'Accept: */*' -H 'Referer: http://stats.nba.com/' -H 'Connection: keep-alive' --compressed);\nif !r.ok {\n echo(\"Could not fetch game data. Bummer!\")\n exit(1)\n}\ndoc = r.json()\narena = doc.basicGameData.arena.name\ncity = doc.basicGameData.arena.city\necho(\"The game was played at the %s in %s\", arena, city)\nhighlight = doc.basicGameData.nugget.text\nif highlight.len() {\n echo(\"The press said: \\\"%s\\\"\", highlight)\n}\n# The game was played at the TD Garden in Boston\n# The press said: \"Thomas scores 19 of 44 points in 4th quarter\"" ], "githubRepo": { "stars": 461, "forks": 33, "subscribers": 12, "created": 2018, "updated": 2022, "description": "Home of the ABS programming language: the joy of shell scripting.", "url": "https://github.com/abs-lang/abs" }, "repoStats": { "firstCommit": 2018, "commits": 849, "committers": 21, "files": 297 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n18755021|The ABS programming language|https://www.abs-lang.org/|2018-12-25 00:11:54 UTC|1545696714|odino|3|6" }, "abset": { "title": "ABSET", "appeared": 1969, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Aberdeen" ], "wikipedia": { "summary": "ABSET was an early declarative programming language from the University of Aberdeen.", "pageId": 114276, "created": 2002, "backlinksCount": 9, "revisionCount": 25, "dailyPageViews": 8, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/ABSET" }, "hopl": "https://hopl.info/showlanguage.prx?exp=356", "fileType": "text", "centralPackageRepositoryCount": 0 }, "abstract-state-machine-language": { "title": "Abstract State Machine Language", "appeared": 2001, "type": "pl", "originCommunity": [ "Microsoft" ], "wikipedia": { "summary": "Abstract State Machine Language (AsmL) is a programming language based on the Abstract State Machines formal method and developed by Microsoft. AsmL is a functional language (which are commonly used in academic research).XASM is an open source implementation of the language.", "created": 2006, "backlinksCount": 12, "pageId": 5365160, "revisionCount": 26, "dailyPageViews": 10, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Abstract_State_Machine_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3714", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "abstracto": { "title": "Abstracto", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/85863dbe91ea270a5010d2edcc637e8647b61825" ], "originCommunity": [ "Center for Mathematics and Computer Science-Amsterdam" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3790", "centralPackageRepositoryCount": 0 }, "absys": { "title": "ABSYS", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3ee349b69c1fb7404770d4ea7bc17d21046e934d" ], "wikipedia": { "related": [ "prolog", "abset" ], "summary": "Absys was an early declarative programming language from the University of Aberdeen. It anticipated a number of features of Prolog such as negation as failure, aggregation operators, the central role of backtracking and constraint solving. Absys was the first implementation of a logic programming language.The name Absys was chosen as an abbreviation for Aberdeen System.", "backlinksCount": 4, "pageId": 114299, "dailyPageViews": 6, "created": 2002, "appeared": 1967, "url": "https://en.wikipedia.org/wiki/Absys" }, "hopl": "https://hopl.info/showlanguage.prx?exp=357", "centralPackageRepositoryCount": 0 }, "ac-toolbox": { "title": "AC Toolbox", "appeared": 1992, "type": "pl", "reference": [ "http://www.actoolbox.net/" ], "originCommunity": [ "Institute of Sonology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6368", "centralPackageRepositoryCount": 0 }, "accent": { "title": "ACCENT", "appeared": 1990, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Rational_Synergy#History" ], "originCommunity": [ "Caseware, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1782", "wordRank": 8873, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n||Accent (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133141537" }, "ace": { "title": "Ace Editor", "appeared": 2010, "type": "editor", "creators": [ "Fabian Jakobs" ], "description": "Ace is an embeddable code editor written in JavaScript. It matches the features and performance of native editors such as Sublime, Vim and TextMate. It can be easily embedded in any web page and JavaScript application. Ace is maintained as the primary editor for Cloud9 IDE and is the successor of the Mozilla Skywriter (Bespin) project.", "website": "https://ace.c9.io", "webRepl": [ "https://ace.c9.io/build/kitchen-sink.html" ], "originCommunity": [ "Mozilla Labs", "Cloud9" ], "domainName": { "name": "ace.c9.io" }, "related": [ "codemirror", "monaco", "highlightjs", "pygments" ], "githubRepo": { "firstCommit": 2010, "stars": 24621, "forks": 5182, "subscribers": 629, "created": 2010, "updated": 2022, "description": "Ace (Ajax.org Cloud9 Editor)", "issues": 210, "url": "https://github.com/ajaxorg/ace" } }, "acl": { "title": "ACL", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e2e463360c01b0c1a047e4c23d7aac9c20dd74f4" ], "originCommunity": [ "University of British Columbia" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5260", "centralPackageRepositoryCount": 0 }, "acl2": { "title": "ACL2", "appeared": 1990, "type": "pl", "creators": [ "Robert S. Boyer", "J Strother Moore" ], "standsFor": "A Computational Logic for Applicative Common Lisp", "country": [ "United States" ], "originCommunity": [ "The University of Texas at Austin" ], "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "common-lisp", "axiom" ], "summary": "ACL2 (A Computational Logic for Applicative Common Lisp) is a software system consisting of a programming language, an extensible theory in a first-order logic, and an automated theorem prover. ACL2 is designed to support automated reasoning in inductive logical theories, mostly for the purpose of software and hardware verification. The input language and implementation of ACL2 are built on Common Lisp. ACL2 is free, open source (BSD license) software. The ACL2 programming language is an applicative (side-effect free) variant of Common Lisp. ACL2 is untyped. All ACL2 functions are total — that is, every function maps each object in the ACL2 universe to another object in its universe. ACL2's base theory axiomatizes the semantics of its programming language and its built-in functions. User definitions in the programming language that satisfy a definitional principle extend the theory in a way that maintains the theory's logical consistency. The core of ACL2's theorem prover is based on term rewriting, and this core is extensible in that user-discovered theorems can be used as ad-hoc proof techniques for subsequent conjectures. ACL2 is intended to be an \"industrial strength\" version of the Boyer–Moore theorem prover, NQTHM. Toward this goal, ACL2 has many features to support clean engineering of interesting mathematical and computational theories. ACL2 also derives efficiency from being built on Common Lisp; for example, the same specification that is the basis for inductive verification can be compiled and run natively. In 2005, the authors of the Boyer-Moore family of provers, which includes ACL2, received the ACM Software System Award \"for pioneering and engineering a most effective theorem prover (...) as a formal methods tool for verifying safety-critical hardware and software.\"", "pageId": 162049, "created": 2002, "backlinksCount": 72, "revisionCount": 124, "dailyPageViews": 35, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/ACL2" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ACL2", "hopl": "https://hopl.info/showlanguage.prx?exp=6972", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nComputer-Aided Reasoning: Acl2 Case Studies|2000|Matt Kaufmann|13910610|4.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n2000|Springer|Computer-Aided Reasoning: ACL2 Case Studies (Advances in Formal Methods, 4)||9780792378495" }, "acme": { "title": "Acme", "appeared": 1994, "type": "pl", "description": "Acme is a simple, generic software architecture description language (ADL) that can be used as a common interchange format for architecture design tools and/or as a foundation for developing new architectural design and analysis tools. This site provides an introduction to Acme along with a collection of useful Acme software and technical information.", "website": "http://www.cs.cmu.edu/~acme/docs/language_overview.html", "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University", "University of Southern California" ], "example": [ "System simple_cs = {\n Component client = { Port send-request; };\n Component server = { Port receive-request; };\n Connector rpc = { Roels { caller, callee}};\n Attachments {\n client.send-request to rpc.caller;\n server.receive-request to rpc.callee;\n }\n}" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4905", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2005|Modeling and implementing software architecture with Acme and ArchJava|10.1145/1028664.1028668|10|1|Jonathan Aldrich and D. Garlan and B. Schmerl and Tony Tseng|03730d8f1aa7070c99906e0e2ac49679f5b8d7e6\n2021|An In-Depth Symbolic Security Analysis of the ACME Standard|10.1145/3460120.3484588|3|1|K. Bhargavan and Abhishek Bichhawat and Quoc Huy Do and Pedram Hosseyni and Ralf Küsters and G. Schmitz and Tim Würtele|b9518eff4b41475c18c317bb62482c1f44192ce2\n2004|Modeling and implementing software architecture with acme and archJava|10.1145/1062455.1062604|1|0|Marwan Abi-Antoun and Jonathan Aldrich and D. Garlan and B. Schmerl and Nagi H. Nahas and Tony Tseng|86fe182c5e054c964b7b7f233bbf8cd1c2271bf2" }, "acore": { "title": "Acore", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d80d315bfb7d6497efbb58ab4bedd807d215890c" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6257", "centralPackageRepositoryCount": 0 }, "acorn-atom": { "title": "Acorn Atom", "appeared": 1980, "type": "pl", "originCommunity": [ "Acorn Computers" ], "wikipedia": { "related": [ "basic", "assembly-language", "bbc-basic" ], "summary": "The Acorn Atom is a home computer made by Acorn Computers Ltd from 1980 to 1982, when it was replaced by the BBC Micro. The Micro began life as an upgrade to the Atom, originally known as the Proton. The Atom was a progression of the MOS Technology 6502-based machines that the company had been making from 1979. The Atom was a cut-down Acorn System 3 without a disk drive but with an integral keyboard and cassette tape interface, sold in either kit or complete form. In 1980 it was priced between £120 in kit form, £170 ready assembled, to over £200 for the fully expanded version with 12 KB of RAM and the floating point extension ROM. The minimum Atom had 2 KB of RAM and 8 KB of ROM, with the maximum specification machine having 12 KB of each. An additional floating point ROM was also available. The 12 KB of RAM was divided between 1 KB for the zero page, 5 KB available for programs, and 6 KB for the high resolution graphics. The zero page was used by the CPU for stack storage, by the OS, and by the Atom BASIC for storage of the 27 variables. If high resolution graphics were not required then 5½ KB of the upper memory could be used for program storage. It had an MC6847 Video Display Generator (VDG) video chip, allowing for both text and graphics modes. It could be connected to a TV or modified to output to a video monitor. Basic video memory was 1 KB but could be expanded to 6 KB. Since the MC6847 could only output at 60 Hz, meaning that the video could not be resolved on a large proportion of European TV sets, a 50 Hz PAL colour card was later made available. Six video modes were available, with resolutions from 64×64 in 4 colours, up to 256×192 in monochrome. At the time, 256×192 was considered to be high resolution. It had built-in BASIC (Atom BASIC), a fast but idiosyncratic version, which included indirection operators (similar to PEEK and POKE) for bytes and words (of 4 bytes each). Assembly code could be included within a BASIC program, because the BASIC interpreter also contained an assembler for the 6502 assembly language which assembled the inline code during program execution and then executed it. This was a very unusual, but also very useful, function. In late 1982, Acorn released an upgrade ROM chip for the Atom which allowed users to switch between Atom BASIC and the more advanced BASIC used by the BBC Micro. The upgrade was purely to the programming language; the Atom's graphics and sound capabilities remained unchanged, and hence, contrary to some pre-release beliefs, the BBC BASIC ROM did not allow Atom users to run commercial BBC Micro software, since nearly all of it took advantage of the BBC machine's much more advanced graphics and sound hardware. Commercial BBC Micro cassettes could not have been loaded anyway, as they ran at a transfer rate of 1200 baud and the Atom's cassette interface only supported 300 baud. The manual for the Atom was called Atomic Theory and Practice and was written by David Johnson-Davies, subsequently Managing Director of Acornsoft. (The manual used the jargon 'pling' for exclamation mark, a term which may have originated at Acorn, and of which this may have been the first published usage.) The Acorn LAN, Econet, was first configured on the Atom. The case was designed by industrial designer Allen Boothroyd of Cambridge Product Design Ltd.", "created": 2003, "backlinksCount": 73, "pageId": 178774, "revisionCount": 165, "dailyPageViews": 35, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Acorn_Atom" }, "centralPackageRepositoryCount": 0 }, "acorn-lang": { "title": "acorn-lang", "appeared": 2015, "type": "pl", "creators": [ "Jonathan Goodwin" ], "website": "http://web3d.jondgoodwin.com/acorn/index.html", "githubRepo": { "firstCommit": 2015, "stars": 9, "forks": 0, "subscribers": 1, "created": 2017, "updated": 2022, "description": "Acorn Virtual Machine", "issues": 0, "url": "https://github.com/jondgoodwin/acornvm" }, "repoStats": { "firstCommit": 2015, "commits": 110, "committers": 1, "files": 68 }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "acorn": { "title": "ACORN", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/62427b746b050a8d2780f417acd23ffd1a31397b" ], "originCommunity": [ "Mobil Research and Developneat Corp" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3784", "centralPackageRepositoryCount": 0 }, "acornsoft-logo": { "title": "Acornsoft Logo", "appeared": 1985, "type": "pl", "originCommunity": [ "Bolt, Beranek and Newman" ], "wikipedia": { "related": [ "logo" ], "summary": "Acornsoft Logo is a commercial implementation of the Logo programming language for the 8-bit BBC Micro and Acorn Electron computers.", "created": 2011, "backlinksCount": 31, "pageId": 33134611, "revisionCount": 14, "dailyPageViews": 5, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Acornsoft_Logo" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "acos": { "title": "ACOS", "appeared": 1988, "type": "pl", "description": "The GBBS-Pro system was based on the ACOS compiler and language. ACOS was a BASIC-like language wherein the modem handling routines had replaced some of the other basic functions. Arrays (for instance) were unheard of in ACOS and so it was necessary to find other ways to work around these limitations (i.e. files replaced arrays).", "reference": [ "https://groups.google.com/forum/#!search/acos$20prodos/comp.sys.apple2/zTd13D23D0s/phJgdUqHPBgJ" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1784", "centralPackageRepositoryCount": 0 }, "acsi-matic": { "title": "ACSI-Matic", "appeared": 1959, "type": "pl", "reference": [ "https://apps.dtic.mil/docs/citations/AD0442338" ], "originCommunity": [ "University of Pennsylvania", "Radio Corporation of America" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2799" }, "acsl": { "title": "ACSL", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/25c28b0f7ee05e369d55abdbbadd6e038d1dac47" ], "originCommunity": [ "Institut de Biologie Théorique" ], "hopl": "https://hopl.info/showlanguage.prx?exp=683", "centralPackageRepositoryCount": 0 }, "act-iii": { "title": "ACT-III", "appeared": 1956, "type": "pl", "description": "The LGP-30 had a high-level language called ACT-III. Every token had to be delimited by an apostrophe, making it hard to read and even harder to prepare tapes.", "country": [ "United States" ], "originCommunity": [ "Librascope company" ], "example": [ "s1'dim'a'500'm'500'q'500''\nindex'j'j+1'j-1''\ndaprt'e'n't'e'r' 'd'a't'a''cr''\nrdxit's35''\ns2'iread'm'1''iread'q'1''iread'd''iread'n''\n1';'j''\n0'flo'd';'d.''\ns3'sqrt'd.';'sqrd.''\n1'unflo'sqrd.'i/'10';'sqrd''\n2010'print'sqrd.''2000'iprt'sqrd''cr''cr''" ], "wikipedia": { "example": [ "burrrp, clunk, \nburrrp, clunk, clunk, clunk, \nburrrp, clunk, \nburrrp, clunk, clunk, clunk,\nburrrp, clunk, \nburrrp, clunk, clunk, clunk, \nburrrp, clunk, \nburrrp, clunk, clunk, clunk, \nburrrp, clunk, \nburrrp, clunk, clunk, clunk, \nburrrp, clunk, \nburrrp, clunk, clunk, clunk." ], "related": [ "algol-60", "isbn" ], "summary": "The LGP-30, standing for Librascope General Purpose and then Librascope General Precision, was an early off-the-shelf computer. It was manufactured by the Librascope company of Glendale, California (a division of General Precision Inc.), and sold and serviced by the Royal Precision Electronic Computer Company, a joint venture with the Royal McBee division of the Royal Typewriter Company. The LGP-30 was first manufactured in 1956 with a retail price of $47,000—equivalent to about $423,000 in 2017.The LGP-30 was commonly referred to as a desk computer. It was 26 inches (660 mm) deep, 33 inches (840 mm) high, and 44 inches (1120 mm) long, exclusive of the typewriter shelf. The computer weighed approximately 800 pounds (360 kg) and was mounted on sturdy casters which facilitated movement of the computer.", "pageId": 1624694, "created": 2005, "backlinksCount": 43, "revisionCount": 171, "dailyPageViews": 37, "appeared": 1956, "url": "https://en.wikipedia.org/wiki/LGP-30" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3844", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "act-one": { "title": "ACT ONE", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3af3d0c1bd3bdde86b959ca285af5b49cf55620b" ], "originCommunity": [ "Technical University Berlin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1027", "centralPackageRepositoryCount": 0 }, "actalk": { "title": "Actalk", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/12ee1b30a768fbec188ae85dd2a9443e3a4429d6" ], "originCommunity": [ "Pierre", "Marie Curie University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1451", "centralPackageRepositoryCount": 0 }, "action-code-script": { "title": "Action Code Script", "appeared": 2004, "type": "pl", "originCommunity": [ "id Software" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "print" ] ], "wikipedia": { "example": [ "1 // Similar to C's stdio.h, ACS has its own library of basic functions\n2 #include \"zcommon.acs\"\n3 \n4 script 1 ENTER\n5 {\n6 print(s:\"Hello World!\");\n7 }" ], "related": [ "c", "quakec" ], "summary": "Action Code Script (ACS) is a scripting language used in video games such as HeXen and some modern Doom source ports, such as ZDoom. It is syntactically similar to C, but less flexible. As its name implies, most of the core logic for script functionality comes in the form of \"scripts\", which are traditionally identified with a numerical value. Later revisions of the ACS compiler added support for \"named\" scripts (which utilize a String in lieu of the numerical identifier), and simple functions. Similar to traditional code, ACS is compiled using ACC (an homage to C's gcc utility) for use in Doom, Hexen, etc... Scripts can be executed in a variety of methods, such as being attached to in-game actors, execution through level triggers around each map, or invocation from other scripts or functions. As the entire scripting language is built as a hack on top of the Doom id Tech's engine, there is no formal support for any Object-oriented programming principles.", "created": 2004, "backlinksCount": 10, "pageId": 421959, "revisionCount": 35, "dailyPageViews": 7, "url": "https://en.wikipedia.org/wiki/Action_Code_Script" }, "centralPackageRepositoryCount": 0 }, "action": { "title": "Action!", "appeared": 1983, "type": "pl", "originCommunity": [ "Optimized Systems Software" ], "hasConstructors": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "PRINTF" ] ], "booleanTokens": [ [ "True", "False" ] ], "wikipedia": { "example": [ "BYTE RTCLOK=20, ; addr of sys timer\n SDMCTL=559 ; DMA control\n\nBYTE ARRAY FLAGS(8190)\n\nCARD COUNT,I,K,PRIME,TIME\n\nPROC SIEVE()\n\n SDMCTL=0 ; shut off Antic\n RTCLOK=0 ; only one timer needed\n\n COUNT=0 ; init count\n FOR I=0 TO 8190 ; and flags\n DO\n FLAGS(I)='T ; \"'T\" is a compiler-provided constant for True\n OD\n\n FOR I=0 TO 8190 ; and flags\n DO\n IF FLAGS(I)='T THEN\n PRIME=I+I+3\n K=I+PRIME\n WHILE K<=8190\n DO\n FLAGS(K)='F ; \"'F\" is a compiler-provided constant for False\n K==+PRIME\n OD\n COUNT==+1\n FI\n OD\n TIME=RTCLOK ; get timer reading\n SDMCTL=34 ; restore screen\n\n PRINTF(\"%E %U PRIMES IN\",COUNT)\n PRINTF(\"%E %U JIFFIES\",TIME)\nRETURN" ], "related": [ "optimized-systems-software", "algol-68", "atari-basic" ], "summary": "Action! is a procedural programming language similar to ALGOL 68 that is intended to produce high-performance programs for the Atari 8-bit family. The language was written by Clinton Parker and distributed on ROM cartridge by Optimized Systems Software starting in 1983. Action! was used to develop at least two commercial products—the Homepak productivity suite and Games Computers Play client program—and numerous programs in ANALOG Computing and Antic magazines. The system was not ported to any other platforms. Parker had previously developed Micro-SPL with Henry Baker, a similar programming language for the Xerox Alto. The 6502 assembly language source code for Action! was made available under the GNU General Public License by the author in 2015.", "pageId": 1273369, "created": 2004, "backlinksCount": 14, "revisionCount": 181, "dailyPageViews": 15, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Action!_(programming_language)" }, "fileType": "text", "wordRank": 473, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAction Programming Languages|1905|Michael Thielscher|22766460|0.0|0|0" }, "actionscript": { "title": "ActionScript", "appeared": 1998, "type": "pl", "creators": [ "Gary Grossman" ], "documentation": [ "https://help.adobe.com/en_US/FlashPlatform/reference/actionscript/3/index.html" ], "originCommunity": [ "Macromedia" ], "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "trace" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "private function getNeighbours(_arg1:int, _arg2:int):Array{\n var _local3:Array = -(((null - !NULL!) % ~(undefined)));\n var _local4:*;\n var _local5:*;\n var _local6:*;\n _local3 = new Array();\n _local4 = 0;\n for (;//unresolved jump\n , _arg2 < 8;_local4++) {\n _local5 = (_arg1 + int(!NULL!));\n _local6 = (_arg2 + int(!NULL!));\n if (true){\n _arg1 = (((//unresolved nextvalue or nextname << !NULL!) + !NULL!) \n<< undefined);\n _arg1 = (!(!NULL!) ^ !NULL!);\n (!NULL! instanceof !NULL!);\n var _local1 = (((!NULL! as !NULL!) + !NULL!) == this);\n if (!(!NULL! == !NULL!)){\n -((true << !NULL!)).push(Cell(cells[_local5][_local6]));\n }\n }\n if (!true){\n (_local6 < 0);\n (_local6 < 0);\n (_local5 < 0);\n }\n }\nreturn (_local3);\n}" ], "related": [ "javascript", "java", "haxe", "hypertalk", "hypercard", "ecmascript", "ios", "android", "json", "opengl", "xml", "mxml" ], "summary": "438 184 ActionScript is an object-oriented programming language originally developed by Macromedia Inc. (later acquired by Adobe Systems). It is a derivation of HyperTalk, the scripting language for HyperCard. It is now a dialect of ECMAScript (meaning it is a superset of the syntax and semantics of the language more widely known as JavaScript), though it originally arose as a sibling, both being influenced by HyperTalk. ActionScript is used primarily for the development of websites and software targeting the Adobe Flash Player platform, used on Web pages in the form of embedded SWF files. ActionScript 3 is also used with Adobe AIR system for the development of desktop and mobile applications. The language itself is open-source in that its specification is offered free of charge and both an open source compiler (as part of Apache Flex) and open source virtual machine (Mozilla Tamarin) are available. ActionScript is also used with Scaleform GFx for the development of 3D video game user interfaces and HUDs.", "pageId": 519691, "dailyPageViews": 282, "created": 2004, "backlinksCount": 934, "revisionCount": 1221, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/ActionScript" }, "githubLanguage": { "fileExtensions": [ "as" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "actionscript", "tmScope": "source.actionscript.3", "aliases": [ "actionscript 3", "actionscript3", "as3" ], "repos": 24615, "id": "ActionScript" }, "githubBigQuery": { "repos": 8748, "users": 7197, "id": "ActionScript" }, "pygmentsHighlighter": { "filename": "actionscript.py", "fileExtensions": [ "as" ], "id": "ActionScript" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 9, "commitCount": 973, "sampleCount": 2, "example": [ "package mypackage\n{\n\tpublic class Hello\n\t{\n\t\t/* Let's say hello!\n\t\t * This is just a test script for Linguist's Actionscript detection.\n\t\t */\n\t\tpublic function sayHello():void\n\t\t{\n\t\t\ttrace(\"Hello, world\");\n\t\t}\n\t}\n}\n" ], "url": "https://github.com/simongregory/actionscript3-tmbundle" }, "leachim6": { "filepath": "a/ActionScript.as", "fileExtensions": [ "as" ], "example": [ "package \n{\n\timport flash.display.Sprite;\n\timport flash.text.TextField;\n\t\n\tpublic class actionscript extends Sprite\n\t{\n\t\tprivate var hello:TextField = new TextField();\n\t\t\n\t\tpublic function actionscript(){\n\t\t\thello.text = \"Hello World\";\n\t\t\taddChild(hello);\n\t\t}\n\t}\n}\n" ], "id": "ActionScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ActionScript", "indeedJobs": { "2022": 88, "query": "ActionScript developer" }, "tiobe": { "id": "ActionScript" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nActionScript 3.0 Game Programming University|2007|Gary Rosenzweig|559956|3.67|79|2\nLearning ActionScript 3.0: The Non-Programmer's Guide to ActionScript 3.0|2007|Rich Shupe|559954|3.90|83|11", "isbndb": "year|publisher|title|authors|isbn13\n2007|Que|ActionScript 3.0 Game Programming University|Rosenzweig, Gary|9780789737021\n20140703|O'Reilly Media, Inc.|ActionScript for Flash MX: The Definitive Guide|Moock, Colin|9780596003968\n2007|Adobe Developer Library|Essential ActionScript 3.0: ActionScript 3.0 Programming Fundamentals|Moock, Colin|9780596526948\n2008|O'Reilly/Adobe Developer Library|Learning ActionScript 3.0: A Beginner's Guide|Shupe, Rich and Rosser, Zevan|9780596527877\n2010|O'Reilly Media|Learning ActionScript 3.0: A Beginner's Guide|Shupe, Rich and Rosser, Zevan|9781449390174\n2008|New Riders|The ActionScript 3.0 Migration Guide: Making the Move from ActionScript 2.0|Hadlock, Kris|9780321555588\n2002|Wiley|Flash MX ActionScript For Designers: The Non-Programmer's Guide to Maximum Flash (Flash (Wiley))|Sahlin, Doug|9780764536878\n2007|Apress|Foundation ActionScript 3.0 with Flash CS3 and Flex|McSharry, Sean and YardFace, Gerald and Webster, Steve|9781590598153\n2006|Apress|Object-Oriented ActionScript For Flash 8|Elst, Peter and YardFace, Gerald|9781590596197\n2012|Apress|Foundation Game Design with ActionScript 3.0|van der Spuy, Rex|9781430239932\n2006|Apress|Foundation ActionScript for Flash 8|Besley, Kristian and Bhangal, Sham and Dolecki, Eric and Powers, David|9781590596180\n2009|Apress|Foundation ActionScript 3.0 Image Effects (Foundations)|YardFace, Gerald|9781430218715\n2008|Adobe Developer Library|The ActionScript 3.0 Quick Reference Guide: For Developers and Designers Using Flash: For Developers and Designers Using Flash CS4 Professional (Adobe Developer Library)|Stiller, David and Shupe, Rich and deHaan, Jen and Richardson, Darren|9780596517359\n2009|New Riders|ActionScript for Multiplayer Games and Virtual Worlds|Makar, Jobe|9780321643360\n2002|Que Publishing|Macromedia Flash MX ActionScript for Fun and Games|Rosenzweig, Gary|9780789727992\n2003|Macromedia Press|Macromedia Flash MX 2004 ActionScript 2.0 Dictionary|Macromedia|9780321228413\n2003|Course Technology PTR|Game Development with ActionScript|Moronta, Lewis|9781592001101\n20071213|O'Reilly Media, Inc.|Learning ActionScript 3.0|Rich Shupe; Zevan Rosser|9780596554552\n2016|Apress|Migrating to Swift from Flash and ActionScript|Adams, Radoslava Leseva and Lesev, Hristo|9781484216668\n20111124|Springer Nature|AdvancED ActionScript 3.0|Ben Smith|9781430236153\n20090125|Springer Nature|AdvancED ActionScript 3.0 Animation|Keith Peters|9781430216094\n2011|Que Publishing|ActionScript 3.0 Game Programming University|Rosenzweig, Gary|9780132678865\n2005|Apress|Foundation ActionScript Animation: Making Things Move!|Peters, Keith|9781590595183\n20091109|Springer Nature|Foundation ActionScript 3.0 for Flash and Flex|Darren Richardson; Paul Milbourne|9781430219194\n20090208|Springer Nature|Creating Flash Widgets with Flash CS4 and ActionScript 3.0|John Arana|9781430215851\n20070510|Springer Nature|The Essential Guide to Flex 2 with ActionScript 3.0|Charles Brown|9781430203360\n2010|Apress|The Essential Guide to Flash Games: Building Interactive Entertainment with ActionScript|Fulton, Jeff and Fulton, Steve|9781430226154\n2014|Apress|Foundation ActionScript 3|Milbourne, Paul and Richardson, Darren|9781484205839\n2011|Que Publishing|ActionScript 3.0 Game Programming University|Rosenzweig, Gary|9780789747327\n2007|Apress|Foundation Actionscript 3.0 Animation: Making Things Move!|Peters, Keith|9781590597910\n2010|Wiley|ActionScript 3.0 Bible|Braunstein, Roger|9780470525234\n2010|Peachpit Press|ActionScript 3.0: Visual QuickStart Guide|Ypenburg, Derrick|9780132104333\n2008|Peachpit Press|ActionScript 3.0: Visual QuickStart Guide|Ypenburg, Derrick|9780321564252\n2004|O'Reilly Media|Essential ActionScript 2.0: Object-Oriented Development with ActionScript 2.0|Moock, Colin|9780596006525\n2007|Que Publishing|ActionScript 3.0 Game Programming University|Rosenzweig, Gary|9780768689938\n2006|Adobe Developer Library|ActionScript 3.0 Cookbook: Solutions for Flash Platform and Flex Application Developers|Lott, Joey and Schall, Darron and Peters, Keith|9780596526955\n2011|Jones & Bartlett Learning|An Introduction to Programming with ActionScript 3.0|Trish Cornez and Richard Cornez|9781449600082\n2014|Apress|Advanced ActionScript 3: Design Patterns|Smith, Ben|9781484206713\n2010|New Riders|ActionScript 3.0 Migration Guide, The: Making the Move from ActionScript 2.0|Hadlock, Kris|9780132104678\n2006|Adobe Pr|Advanced ActionScript 3 with Design Patterns|Lott, Joey and Patterson, Danny|9780321426567\n2007|Apress|Object-Oriented ActionScript 3.0|Elst, Peter and Jacobs, Sas|9781590598450\n2007|Adobe Developer Library|ActionScript 3.0 Design Patterns: Object Oriented Programming Techniques (Adobe Developer Library)|Sanders, William and Cumaranatunge, Chandima|9780596528461\n2009|Apress|Foundation ActionScript 3.0 for Flash and Flex (Foundations)|Richardson, Darren and Milbourne, Paul|9781430219187\n2006|Wiley|Flash 8 ActionScript Bible|Lott, Joey and Reinhardt, Robert|9780471771975\n2011|Addison-Wesley Professional|Developing Flex 4 Components: Using ActionScript & MXML to Extend Flex and AIR Applications|Jones, Mike|9780321604132\n2005|Macmillan/Rand McNally|Learning Actionscript 2.0 for Macromedia Flash 8|Dehaan, Jen and Dehaan, Peter|9780321394156\n2006|Focal Press|Understanding Macromedia Flash 8 ActionScript 2: Basic techniques for creatives|Rapo, Andrew and Michael, Alex|9780240519913\n2011|O'Reilly Media|ActionScript Developer's Guide to Robotlegs: Building Flexible Rich Internet Applications|Hooks, Joel and Fallow), Stray (Lindsey|9781449308902\n2002|New Riders Pub|Object-Oriented Programming with ActionScript|Hall, Branden and Wan, Samuel|9780735711839\n2000|friendsofED|Foundation Actionscript|Bhangal, Sham|9781903450321\n2002|Delmar Cengage Learning|Flash MX: Advanced ActionScript|Mohler, James L. and Kothary, Nishant|9780766829107\n2004|New Riders Pub|Object-Oriented Programming With Actionscript 2.0|Tapper, Jeff and Talbot, James and Haffner, Robin|9780735713802\n2002|Sams|Sams Teach Yourself Flash MX ActionScript in 24 Hours|Rosenzweig, Gary|9780672323850\n2005|Macromedia Press|ActionScript 2.0 Language Reference for Macromedia Flash 8|Cheng, Francis and deHaan, Jen and Dixon, Robert L. and Rahim, Shimul|9780321384041\n2003|Apress|ActionScript Zero to Hero|Jen deHaan and Glen Rhodes|9781590591758\n2011|O'Reilly Media|Automating ActionScript Projects with Eclipse and Ant: Code, Compile, Debug and Deploy Faster|Koning, Sidney de|9781449307738\n2003|O'Reilly Media|ActionScript for Flash MX Pocket Reference: Quick Reference for Flash MX Programmers (Pocket Reference (O'Reilly))|Moock, Colin|9780596005146\n20061206|Springer Nature|Foundation ActionScript for Flash 8|Kristian Besley; Sham Bhangal; Eric Dolecki; David Powers|9781430201496\n20110808|O'Reilly Media, Inc.|ActionScript Developer's Guide to Robotlegs|Joel Hooks; Stray (Lindsey Fallow)|9781449315290\n20120328|Springer Nature|Foundation Game Design with ActionScript 3.0|Rex van der Spuy|9781430239949\n2011T|PEARSON EDUCATION|ActionScript 3.0 Game Programming University, 2e (New Edition)|Rosenzweig|9788131770566\n20061011|O'Reilly Media, Inc.|ActionScript 3.0 Cookbook|Joey Lott; Darron Schall; Keith Peters|9780596554620\n20061218|Springer Nature|AdvancED ActionScript Components|Antonio De Donatis|9781430201304\n20040616|O'Reilly Media, Inc.|Essential ActionScript 2.0|Colin Moock|9780596517809\n20101018|O'Reilly Media, Inc.|Learning ActionScript 3.0|Rich Shupe|9781449397876\n20101018|O'Reilly Media, Inc.|Learning ActionScript 3.0|Rich Shupe; Zevan Rosser|9781449397746\n06/2007|O'Reilly Media, Inc.|Essential ActionScript 3.0|Moock, Colin|9780596515973\n20070622|O'Reilly Media, Inc.|Essential ActionScript 3.0|Colin Moock|9780596554590\n20061122|Springer Nature|Foundation ActionScript Animation|Keith Peters|9781430200819\n2011-02-23|Wiley|ActionScript 3.0 Bible|Roger Braunstein|9781118081396\n2007-10-23|Wiley|ActionScript 3.0 Bible|Roger Braunstein and Mims H. Wright and Josuha J. Noble|9780470241936\n2001|Friendsofed|Flash 5 Actionscript Studio|Sham Bhangal and Jamie Macdonald and José Rodriguez and Michael Bedar and Richard Chu and John Davey and Justin Everett-church and Josie R. Rodriguez and Adam Wolff|9781903450352\n12/2007|O'Reilly Media, Inc.|Learning ActionScript 3.0: The Non-Programmer's Guide to ActionScript 3.0|Shupe, Rich; Rosser, Zevan|9780596519292\n20070716|O'Reilly Media, Inc.|ActionScript 3.0 Design Patterns|William Sanders; Chandima Cumaranatunge|9780596554842\n2002|friends of ED Ltd|ActionScript Zero to Hero|Jen deHaan and Glen Rhodes|9781904344117\n20070525|Springer Nature|Foundation Actionscript 3.0 Animation|Keith Peters|9781430203841\n2001|O'reilly Media|Actionscript X: Programming For Designers|Bill Sanders|9780596100513\n20111219|O'Reilly Media, Inc.|ActionScript Developer's Guide to PureMVC|Cliff Hall|9781449324728\n||Actionscript 3.0 Game Programming University|Rosenzweig and Gary|9780768676686\n20110808|O'Reilly Media, Inc.|ActionScript Developer's Guide to Robotlegs|Joel Hooks; Stray (Lindsey Fallow)|9781449315849\n20111219|O'Reilly Media, Inc.|ActionScript Developer's Guide to PureMVC|Cliff Hall|9781449324711\n20090725|Springer Nature|Foundation ActionScript 3.0 Image Effects|Gerald YardFace|9781430218722\n2013|Crc Press|Understanding Macromedia Flash 8 Actionscript 2|Andrew Rapo and Alex Michael|9781136143748\n20030319|O'Reilly Media, Inc.|ActionScript for Flash MX Pocket Reference|Colin Moock|9780596008284\n20061124|Springer Nature|Object-Oriented ActionScript For Flash 8|Peter Elst; Gerald YardFace|9781430201250\n2012|Taylor & Francis|Flash Mx Games: Actionscript For Artists|Nik Lever|9781136133176\n20131111|Springer Nature|Foundation ActionScript for Macromedia Flash MX|Ben Renow-Clarke; Sham Bhangal|9781430254102\n20130117|Taylor & Francis|Understanding Macromedia Flash 8 ActionScript 2|Andrew Rapo; Alex Michael|9781136143731\n|Que|Macromedia Flash Mx Actionscript For Fun & Games|Rosenzweig, Gary.|9780768683615\n2012|Taylor & Francis|Flash Mx 2004 Games: Art To Actionscript|Nik Lever|9781136144530\n20021218|O'Reilly Media, Inc.|ActionScript for Flash MX: The Definitive Guide|Colin Moock|9780596517021\n20130401|Jones & Bartlett Learning|An Introduction to Programming with ActionScript 3.0|California University of Redlands Patricia Cornez; University of Redlands Richard Cornez|9781449682071\n20111010|O'Reilly Media, Inc.|Automating ActionScript Projects with Eclipse and Ant|Sidney de Koning|9781449319113\n2002|O'reilly|ActionScript for Flash MX: the definitive guide|Moock, Colin.|9780596003968\n|O'reilly|Automating ActionScript projects with Eclipse and Ant|Koning, Sidney De.|9781449307738\n20111010|O'Reilly Media, Inc.|Automating ActionScript Projects with Eclipse and Ant|Sidney de Koning|9781449319106\n20090423|Springer Nature|The Essential Guide to Flash CS4 with ActionScript|Chris Kaplan; Paul Milbourne; Michael Boucher|9781430218128\n07/2007|O'Reilly Media, Inc.|ActionScript 3.0 Design Patterns: Object Oriented Programming Techniques|Sanders, William; Cumaranatunge, Chandima|9780596517625\n20080731|Springer Nature|Foundation ActionScript 3.0 with Flash CS3 and Flex|Sean McSharry; Gerald YardFace; Steve Webster|9781430201960\n2013|Focal Press|Understanding Flash Mx 2004 Actionscript 2: Basic Techniques For Creatives|Michael, Alex.|9780240519319\n2011|Createspace Independent Publishing Platform|Introduction To Actionscript Workbook: An Introduction To Actionscript And The Fundamentals Of Programming. The Only Curriculum Specifically Designed ... At Home, In The Classroom Or On-line.|Arthur Phillips|9781461019855\n20070118|O'Reilly Media, Inc.|ActionScript 3.0 Programming: Overview, Getting Started, and Examples of New Concepts|William Sanders|9781491911570\n10/2006|O'Reilly Media, Inc.|ActionScript 3.0 Cookbook: Solutions for Flash Platform and Flex Application Developers|Lott, Joey; Schall, Darron; Peters, Keith|9780596510060\n20070118|O'Reilly Media, Inc.|ActionScript 3.0 Programming: Overview, Getting Started, and Examples of New Concepts|William Sanders|9780596529239\n20081017|O'Reilly Media, Inc.|The ActionScript 3.0 Quick Reference Guide: For Developers and Designers Using Flash|David Stiller; Rich Shupe; Jen deHaan; Darren Richardson|9780596554163\n10/2008|O'Reilly Media, Inc.|The ActionScript 3.0 Quick Reference Guide: For Developers and Designers Using Flash: For Developers and Designers Using Flash CS4 Professional|Stiller, David; Shupe, Rich; deHaan, Jen; Richardson, Darren|9780596156565", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Foundation ActionScript 3|10.1007/978-1-4842-0583-9|2|0|D. Richardson and P. Milbourne|58f798455a8c221a6a29954f2db4698b567d6ac7\n2020|Guide Me to Exploit: Assisted ROP Exploit Generation for ActionScript Virtual Machine|10.1145/3427228.3427568|1|0|Fadi Yilmaz and Meera Sridhar and Wontae Choi|d4655b816867333c81ed6a7fa7883be3c330070f" }, "active-language-i": { "title": "Active Language I", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/22c3c8fc1396adc00a896de07acb84f803bb48f3" ], "originCommunity": [ "University of California" ], "hopl": "https://hopl.info/showlanguage.prx?exp=309", "centralPackageRepositoryCount": 0 }, "active-u-datalog": { "title": "Active-U-Datalog", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5078911ff4231663723797b23e0583742fba6919" ], "originCommunity": [ "University of Milano", "University of Pisa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5796", "centralPackageRepositoryCount": 0 }, "activevfp": { "title": "ActiveVFP", "appeared": 2001, "type": "pl", "originCommunity": [ "VFP Community" ], "hasLineComments": { "example": "* A comment", "value": true }, "hasComments": { "example": "* A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "*" ] ], "wikipedia": { "example": [ "* customers.prg -Customers Controller\n* * bypasses Main.prg and .AVFP script code\n* \nDEFINE CLASS customersController AS restController\n *\n PROCEDURE openData\n SELECT 0\n USE (THIS.homeFolder + \"customers.dbf\") ALIAS customers\n ENDPROC\n \n PROCEDURE infoAction && GET www.hostname.com/app/customers/info\n RETURN \"homeFolder: \" + THIS.homeFolder + \"\"\n ENDPROC\n \n PROCEDURE getAction && GET www.hostname.com/app/customers/\n LOCAL cCustId\n cCustId = THIS.Params[1]\n THIS.openData()\n SELECT CUSTOMERS\n LOCATE FOR custId = cCustId\n IF FOUND()\n LOCAL cJSON\n **USE mydbf &&test error\n *quick and dirty JSON\n cJSON = [{\"custId\":\"] + RTRIM(custId) + [\",\"custName\":\"] + RTRIM(custName) + [\",] + ;\n [\"custStat\":\"] + RTRIM(custStat) + [\"}]\n RETURN cJSON \n ENDIF\n ENDPROC\n \n PROCEDURE listAction && GET www.hostname.com/app/customers/\n LOCAL cHTML\n cHTML = \"\"\n *oEmp=newOBJECT('schedbizobj','c:\\avfp5.61Demo\\prg\\utiltest2.prg')\n SET PROC to substr(oProp.AppStartPath,1,AT([\\],oProp.AppStartPath,2))+'prg\\AVFPutilities' ADDITIVE && Make sure you use ADDITIVE or bad things happen!\n THIS.openData()\n SELECT CUSTOMERS\n cHTML= oHTML.mergescript(FILETOSTR(substr(oProp.AppStartPath,1,AT([\\],oProp.AppStartPath,2))+'viewtest.avfp'))\n RETURN cHTML \n ENDPROC\n \n PROCEDURE helloworld && custom method (&& GET www.hostname.com/app/customers/helloworld/)\n LOCAL cHTML\n cHTML = \"\"\n *USE mydbf\n *SET PROC to substr(oProp.AppStartPath,1,AT([\\],oProp.AppStartPath,2))+'prg\\AVFPutilities' ADDITIVE && Make sure you use ADDITIVE or bad things happen!\n cHTML= oHTML.mergescript(FILETOSTR(substr(oProp.AppStartPath,1,AT([\\],oProp.AppStartPath,2))+'hello.avfp'))\n RETURN cHTML \n ENDPROC\n \n PROCEDURE getemployees && custom method (&& GET www.hostname.com/app/customers/getemployee/\n \n\toJSON=NEWOBJECT('json','json.prg')\n \n SET PATH TO oProp.AppStartPath+'data\\AVFPdemo41\\'\n\t\n\tselect e.emp_id as id, e.first_Name as firstName, e.last_Name as lastName, e.title as title, [images/Emps/]+e.picture as picture,count(r.emp_id) as reportCount ;\n\tfrom employee e left join employee r on VAL(r.reports_to) = VAL(e.emp_id) ;\n\tINTO Cursor SearchResults;\n\tgroup by e.last_Name,e.emp_id, e.first_Name,e.title, e.picture ;\n\torder by e.last_Name,e.first_Name\n\n\toJSON.keyforcursors=\"items\"\n\n\t* send JSON data and properties back\n\toResponse.ContentType = \"application/json;charset=utf-8\" \n\toResponse.Write(oJSON.stringify('SearchResults'))\n\toResponse.Flush\n\tlcHTMLout=[]\n ENDPROC\n\n************************************************************************\n\nENDDEFINE" ], "related": [ "php", "visual-foxpro", "mysql", "rest", "html" ], "summary": "ActiveVFP (also known as AVFP) is a server-side scripting framework designed for Web development to produce dynamic Web pages. Similar to PHP, but using the native Visual Foxpro (VFP) language and database (or other databases like Microsoft SQL and MySQL), ActiveVFP can also be used in Model-View-Controller (MVC) web applications as well as RESTful API. ActiveVFP is completely free and open source and does not require the purchase of Microsoft Visual FoxPro or any additional software. ActiveVFP was originally created in 2001. The main implementation of ActiveVFP is now produced by the Foxpro Community at activevfp.codeplex.com and serves as the formal reference to ActiveVFP. ActiveVFP is free software released under the MIT License. ActiveVFP is unique among server-side web languages and frameworks because it has a database and database functionality built into the language.", "created": 2013, "backlinksCount": 9, "pageId": 38172349, "revisionCount": 58, "dailyPageViews": 13, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/ActiveVFP" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "activity-pub": { "title": "ActivityPub", "appeared": 2018, "type": "protocol", "screenshot": "https://upload.wikimedia.org/wikipedia/commons/2/20/ActivityPub-tutorial-image.png", "creators": [ "Christine Lemmer-Webber", "Jessica Tallon", "Erin Shepherd", "Amy Guy", "Evan Prodromou" ], "description": "ActivityPub is an open, decentralized social networking protocol based on Pump.io's ActivityPump protoco", "website": "https://activitypub.rocks/", "documentation": [ "https://w3c.github.io/activitypub/" ], "reference": [ "https://w3c.github.io/activitypub/" ], "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "domainName": { "name": "w3c.github.io" }, "githubRepo": { "firstCommit": 2014, "stars": 771, "forks": 54, "subscribers": 76, "created": 2014, "updated": 2022, "issues": 50, "url": "https://github.com/w3c/activitypub" }, "repoStats": { "firstCommit": 2014, "commits": 618, "committers": 24, "files": 22 }, "isOpenSource": true }, "actor": { "title": "Actor", "appeared": 1988, "type": "pl", "originCommunity": [ "The Whitewater Group" ], "wikipedia": { "summary": "The Actor programming language was invented by Charles Duff of The Whitewater Group in 1988. It was an offshoot of some object-oriented extensions to the Forth language he had been working on. Actor would be categorized as a pure object-oriented language in the style of Smalltalk. Like Smalltalk, everything was an object, including small integers. A Baker semi-space garbage collector was used, along with (in memory-constrained Windows 2.1 days) a software virtual memory system that swapped objects. A token threaded interpreter, written in 16-bit x86 assembly language, was the execution mechanism for compiled code. Actor only was released on the Microsoft Windows 2.1 and 3.0 operating system. Actor used perhaps the first pure object-oriented framework over native operating system calls as its basic GUI architecture. This allowed an Actor application to look and feel exactly like a Windows application written in C, but with all the advantages of an interactive Smalltalk-like development environment. Both a downside and upside to this architecture was a tight coupling to the Windows OS architecture, with a thin abstraction layer into objects. This allowed direct use of the rich Windows OS API, but also made it nearly impossible to support any other OS without a significant rewrite of the application framework.", "backlinksCount": 7, "pageId": 26849115, "dailyPageViews": 10, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/Actor_(programming_language)" } }, "actors": { "title": "Actors", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/498e5bc50cbf273f1ad241dd77d9bd3012b45b58" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=745", "wordRank": 5361, "centralPackageRepositoryCount": 0 }, "actus": { "title": "Actus", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dc5dbb27b77b33539309251481ea0f0efbeaf48d" ], "originCommunity": [ "The Queen's University of Belfast" ], "hopl": "https://hopl.info/showlanguage.prx?exp=839", "centralPackageRepositoryCount": 0 }, "ad-hoc": { "title": "Ad-hoc", "appeared": 2017, "type": "pl", "description": "Ad-hoc is an experimental programming language currently supporting the following features: first-class functions, immutability, lambda terms, recursion, closures, strict and non-strict evaluation, lexical and dynamic scopes, and deep binding.", "website": "https://gitlab.com/trobador/ad-hoc", "githubRepo": { "stars": 9, "forks": 1, "subscribers": 3, "created": 2017, "updated": 2019, "firstCommit": 2017, "description": "Ad-hoc programming language", "issues": 0, "url": "https://github.com/pera/ad-hoc" }, "repoStats": { "firstCommit": 2017, "commits": 64, "committers": 2, "files": 19 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "ada-95": { "title": "Ada 95", "appeared": 1995, "type": "pl", "reference": [ "https://www.embedded.com/electronics-blogs/beginner-s-corner/4024497/Introduction-to-Ada-95" ], "originCommunity": [ "Intermetrics" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1029", "centralPackageRepositoryCount": 0 }, "ada-9x": { "title": "Ada 9X", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1c016f9bd990ba1122af7fc1cdc69e83940aae32" ], "originCommunity": [ "Vrije Universiteit" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1380", "centralPackageRepositoryCount": 0 }, "ada-tl": { "title": "Ada/TL", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a7361999f44ac0c4d6a886ab155662251637a7b6" ], "originCommunity": [ "Kansas State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4658", "centralPackageRepositoryCount": 0 }, "ada": { "title": "Ada", "appeared": 1980, "type": "pl", "creators": [ "Jean Ichbiah" ], "website": "http://www.adaic.org", "documentation": [ "https://pyjarrett.github.io/programming-with-ada/" ], "emailList": [ "http://www.ada-auth.org/comment.html" ], "fileExtensions": [ "adb", "ads" ], "country": [ "United States" ], "originCommunity": [ "CII Honeywell Bull" ], "domainName": { "registered": 1998, "awisRank": { "2022": 1556974 }, "name": "adaic.org" }, "visualParadigm": false, "hasPointers": { "example": "", "value": true }, "hasGenerics": { "example": "generic\n Max_Size : Natural; -- a generic formal value\n type Element_Type is private; -- a generic formal type; accepts any nonlimited type\npackage Stacks is\n type Size_Type is range 0 .. Max_Size;\n type Stack is limited private;\n procedure Create (S : out Stack;\n Initial_Size : in Size_Type := Max_Size);\n procedure Push (Into : in out Stack; Element : in Element_Type);\n procedure Pop (From : in out Stack; Element : out Element_Type);\n Overflow : exception;\n Underflow : exception;\nprivate\n subtype Index_Type is Size_Type range 1 .. Max_Size;\n type Vector is array (Index_Type range <>) of Element_Type;\n type Stack (Allocated_Size : Size_Type := 0) is record\n Top : Index_Type;\n Storage : Vector (1 .. Allocated_Size);\n end record;\nend Stacks;", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasDirectives": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "with Gnat.Io; use Gnat.Io;\nprocedure Numbers is\n Score: Integer;\n F: Float := 1.0;\nbegin\n Score := 3 + 2#1011#;\n Put(score);\n New_Line;\n Score := Score + 1_000_000;\n Put(Score);\n New_Line;\nend Numbers;", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "isCaseSensitive": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasHexadecimals": { "example": "-- [0-9_]+#[0-9a-f_\\.]+#", "value": true }, "hasFloats": { "example": "-- [0-9_]+\\.[0-9_]*", "value": true }, "hasIntegers": { "example": "-- [0-9_]+", "value": true }, "hasFixedPoint": { "example": "", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "Text_IO.Put_Line" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "True", "False" ] ], "keywords": [ "abort", "else", "new", "return", "abs", "elsif", "not", "reverse", "abstract", "end", "null", "accept", "entry", "select", "access", "exception", "of", "separate", "aliased", "exit", "or", "some", "all", "others", "subtype", "and", "for", "out", "synchronized", "array", "function", "overriding", "at", "tagged", "generic", "package", "task", "begin", "goto", "pragma", "terminate", "body", "private", "then", "if", "procedure", "type", "case", "in", "protected", "constant", "interface", "until", "is", "raise", "use", "declare", "range", "delay", "limited", "record", "when", "delta", "loop", "rem", "while", "digits", "renames", "with", "do", "mod", "requeue", "xor" ], "wikipedia": { "example": [ "with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Traffic is\n\n type Airplane_ID is range 1..10; -- 10 airplanes\n\n task type Airplane (ID: Airplane_ID); -- task representing airplanes, with ID as initialisation parameter\n type Airplane_Access is access Airplane; -- reference type to Airplane\n\n protected type Runway is -- the shared runway (protected to allow concurrent access)\n entry Assign_Aircraft (ID: Airplane_ID); -- all entries are guaranteed mutually exclusive\n entry Cleared_Runway (ID: Airplane_ID);\n entry Wait_For_Clear;\n private\n Clear: Boolean := True; -- protected private data - generally more than just a flag...\n end Runway;\n type Runway_Access is access all Runway;\n\n -- the air traffic controller task takes requests for takeoff and landing\n task type Controller (My_Runway: Runway_Access) is\n -- task entries for synchronous message passing\n entry Request_Takeoff (ID: in Airplane_ID; Takeoff: out Runway_Access);\n entry Request_Approach(ID: in Airplane_ID; Approach: out Runway_Access);\n end Controller;\n\n -- allocation of instances\n Runway1 : aliased Runway; -- instantiate a runway\n Controller1: Controller (Runway1'Access); -- and a controller to manage it\n\n ------ the implementations of the above types ------\n protected body Runway is\n entry Assign_Aircraft (ID: Airplane_ID)\n when Clear is -- the entry guard - calling tasks are blocked until the condition is true\n begin\n Clear := False;\n Put_Line (Airplane_ID'Image (ID) & \" on runway \");\n end;\n\n entry Cleared_Runway (ID: Airplane_ID)\n when not Clear is\n begin\n Clear := True;\n Put_Line (Airplane_ID'Image (ID) & \" cleared runway \");\n end;\n\n entry Wait_For_Clear\n when Clear is\n begin\n null; -- no need to do anything here - a task can only enter if \"Clear\" is true\n end;\n end Runway;\n\n task body Controller is\n begin\n loop\n My_Runway.Wait_For_Clear; -- wait until runway is available (blocking call)\n select -- wait for two types of requests (whichever is runnable first)\n when Request_Approach'count = 0 => -- guard statement - only accept if there are no tasks queuing on Request_Approach\n accept Request_Takeoff (ID: in Airplane_ID; Takeoff: out Runway_Access)\n do -- start of synchronized part\n My_Runway.Assign_Aircraft (ID); -- reserve runway (potentially blocking call if protected object busy or entry guard false)\n Takeoff := My_Runway; -- assign \"out\" parameter value to tell airplane which runway\n end Request_Takeoff; -- end of the synchronised part\n or\n accept Request_Approach (ID: in Airplane_ID; Approach: out Runway_Access) do\n My_Runway.Assign_Aircraft (ID);\n Approach := My_Runway;\n end Request_Approach;\n or -- terminate if no tasks left who could call\n terminate;\n end select;\n end loop;\n end;\n\n task body Airplane is\n Rwy : Runway_Access;\n begin\n Controller1.Request_Takeoff (ID, Rwy); -- This call blocks until Controller task accepts and completes the accept block\n Put_Line (Airplane_ID'Image (ID) & \" taking off...\");\n delay 2.0;\n Rwy.Cleared_Runway (ID); -- call will not block as \"Clear\" in Rwy is now false and no other tasks should be inside protected object\n delay 5.0; -- fly around a bit...\n loop\n select -- try to request a runway\n Controller1.Request_Approach (ID, Rwy); -- this is a blocking call - will run on controller reaching accept block and return on completion\n exit; -- if call returned we're clear for landing - leave select block and proceed...\n or\n delay 3.0; -- timeout - if no answer in 3 seconds, do something else (everything in following block)\n Put_Line (Airplane_ID'Image (ID) & \" in holding pattern\"); -- simply print a message\n end select;\n end loop;\n delay 4.0; -- do landing approach...\n Put_Line (Airplane_ID'Image (ID) & \" touched down!\");\n Rwy.Cleared_Runway (ID); -- notify runway that we're done here.\n end;\n\n New_Airplane: Airplane_Access;\n\nbegin\n for I in Airplane_ID'Range loop -- create a few airplane tasks\n New_Airplane := new Airplane (I); -- will start running directly after creation\n delay 4.0;\n end loop;\nend Traffic;" ], "related": [ "spark", "ravenscar-profile", "algol-68", "pascal", "smalltalk", "java", "eiffel", "chapel", "nim", "pl-sql", "plpgsql", "ruby", "rust", "seed7", "sql-psm", "vhdl", "unicode", "lisp", "setl", "algol", "algol-60", "apse" ], "summary": "Ada is a structured, statically typed, imperative, wide-spectrum, and object-oriented high-level computer programming language, extended from Pascal and other languages. It has built-in language support for design-by-contract, extremely strong typing, explicit concurrency, offering tasks, synchronous message passing, protected objects, and non-determinism. Ada improves code safety and maintainability by using the compiler to find errors in favor of runtime errors. Ada is an international standard; the current version (known as Ada 2012) is defined by ISO/IEC 8652:2012. Ada was originally designed by a team led by Jean Ichbiah of CII Honeywell Bull under contract to the United States Department of Defense (DoD) from 1977 to 1983 to supersede over 450 programming languages used by the DoD at that time. Ada was named after Ada Lovelace (1815–1852), who has been credited with being the first computer programmer.", "pageId": 1242, "dailyPageViews": 768, "created": 2001, "backlinksCount": 744, "revisionCount": 1280, "appeared": 1980, "fileExtensions": [ "adb", "ads" ], "url": "https://en.wikipedia.org/wiki/Ada_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "adb", "ada", "ads" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "ada", "tmScope": "source.ada", "aliases": [ "ada95", "ada2005" ], "repos": 4785, "id": "Ada" }, "githubBigQuery": { "repos": 2172, "users": 1848, "id": "Ada" }, "pygmentsHighlighter": { "filename": "ada.py", "fileExtensions": [ "adb", "ads", "ada" ], "id": "Ada" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2015, "committerCount": 4, "commitCount": 44, "url": "https://github.com/textmate/ada.tmbundle" }, "projectEuler": { "memberCount": { "2019": 120, "2022": 129 }, "id": "Ada" }, "helloWorldCollection": [ "-- Hello World in Ada\n\nwith Text_IO;\nprocedure Hello_World is\n\nbegin\n Text_IO.Put_Line(\"Hello World!\");\nend Hello_World;\n" ], "leachim6": { "filepath": "a/Ada.adb", "fileExtensions": [ "adb" ], "example": [ "with Ada.Text_IO;\n\nprocedure Hello_World is\n use Ada.Text_IO;\nbegin\n Put_line (\"Hello World\");\nend Hello_World;\n" ], "id": "Ada" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Ada", "quineRelay": "Ada", "compilerExplorer": { "example": [ "-- This pragma will remove the warning produced by the default\n-- CE filename and the procedure name differing,\n-- see : https://gcc.gnu.org/onlinedocs/gcc-8.2.0/gnat_rm/Pragma-Source_005fFile_005fName.html#Pragma-Source_005fFile_005fName\npragma Source_File_Name (Square, Body_File_Name => \"example.adb\");\n\n-- Type your code here, or load an example.\nfunction Square(num : Integer) return Integer is\nbegin\n return num**2;\nend Square;\n\n-- Ada 2012 also provides Expression Functions\n-- (http://www.ada-auth.org/standards/12rm/html/RM-6-8.html)\n-- as a short hand for functions whose body consists of a\n-- single return statement. However they cannot be used as a\n-- compilation unit.\n-- function Square(num : Integer) return Integer is (num**2);\n" ], "id": "Ada" }, "rijuRepl": { "example": [ "with Ada.Text_IO;\n\nprocedure Main is\nbegin\n Ada.Text_IO.Put_Line(\"Hello, world!\");\nend Main;\n" ], "description": "Structured, statically typed, imperative, and object-oriented high-level programming language, extended from Pascal and other languages", "fileExtensions": [ "adb", "ads" ], "website": "https://www.adaic.org/", "gitRepo": "https://gcc.gnu.org/git.html", "id": "https://riju.codes/ada" }, "indeedJobs": { "2017": 2184, "query": "ada developer" }, "subreddit": [ { "memberCount": { "2017": 1092, "2022": 8055 }, "url": "https://reddit.com/r/ada" } ], "tiobe": { "currentRank": 28, "id": "Ada" }, "hopl": "https://hopl.info/showlanguage.prx?exp=840", "pypl": "Ada", "ubuntuPackage": "gnat", "gdbSupport": true, "fileType": "text", "wordRank": 8040, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2014|Cambridge University Press|Programming in Ada 2012|Barnes, John|9781107424814\n1999|Addison-Wesley|Ada 95: Problem Solving and Program Design (3rd Edition)|Feldman, Michael B. and Koffman, Elliot B.|9780201361230\n1986|Archon Books|The Calculating Passion of Ada Byron|Baum, Joan|9780208021199\n2006|Pearson|Programming in Ada 2005 with CD|Barnes, John|9780321340788\n1987|Tab Books|Power Programming With Ada For The Ibm Pc|Winters and John W.|9780830679027\n1984|Cambridge University Press|Ada For Multi-microprocessors (the Ada Companion Series)|M. Tedd|9780521301039\n1995|John Wiley &Sons|Rendezvous with ADA 95 2e|J. Naiditch, David|9780471012764\n2019|Candlewick|Dreaming in Code: Ada Byron Lovelace, Computer Pioneer|McCully, Emily Arnold|9780763693565\n1993|Addison-Wesley|Programming in Ada: Plus an Overview of Ada 9X (International computer science series)|Barnes, J. G. P.|9780201624076\n1986|Allyn And Bacon|Ada Programming With Applications|Eugen N Vasilescu|9780205087440\n1991|Silicon Press|Ada|Gehani, Narain|9780929306087\n1998|Dissertation.Com.|Distributed Programming in ADA with Protected Objects|Ledru, Pascal|9781581120349\n2015|Lulu.com|Ada Programming Success In A Day|Sam Key|9781329461680\n2002|Springer|Consolidated Ada reference manual: language and standard libraries : international standard ISO/IEC 8652/1995(E) with technical corrigendum 1|N/a|9783540430384\n1994|Jones And Bartlett Publishers, Inc|Programming And Problem Solving With Ada|Nell Dale and Et Al|9780669294279\n20030806|Springer Nature|Consolidated Ada Reference Manual|Erhard Ploedereder; S. Tucker Taft; Randall L. Brukardt|9783540453406\n2019|Apress|Beginning Ada Programming: From Novice to Professional|Shvets, Andrew T.|9781484254271\n2019|Apress|Beginning Ada Programming: From Novice to Professional|Shvets, Andrew T.|9781484254288\n20140114|Springer Nature|Ada 2012 Reference Manual. Language and Standard Libraries|L. Loh|9783642454196\n2019|Simon & Schuster Books for Young Readers|Ada Lace and the Suspicious Artist (5) (An Ada Lace Adventure)|Calandrelli, Emily|9781534416888\n2018|CreateSpace Independent Publishing Platform|Introduction to Ada Programming, 2nd Edition|Shvets, Andrew T.|9781987673852\n2018|Bodleian Library, University of Oxford|Ada Lovelace: The Making of a Computer Scientist|Hollings, Christopher and Martin, Ursula and Rice, Adrian|9781851244881\n2022|Cambridge University Press|Programming in Ada 2012 with a Preview of Ada 2022|Barnes, John|9781009181341\n1998|Addison-Wesley Professional|Programming in Ada 95 (2nd Edition) (International Computer Science Series)|Barnes, John|9780201342932\n1990|Addison-Wesley|Ada Programmer's Handbook and Language Reference Manual|Gonzalez, Dean W.|9780805325287\n1997|Addison-Wesley|Ada 95 for C and C ++ Programmers (International Computer Science Series)|Johnston, Simon|9780201403633\n2001-04-05T00:00:01Z|Addison Wesley|Real Time Systems and Programming Languages: Ada 95, Real-Time Java and Real-Time C/POSIX (3rd Edition)|Burns, Alan and Wellings, Andy|9780201729887\n2016|LernerClassroom|Programming Pioneer Ada Lovelace (STEM Trailblazer Bios)|Bodden, Valerie|9781512413038\n2007|Cambridge University Press|Concurrent and Real-Time Programming in Ada|Burns, Alan and Wellings, Andy|9780521866972\n2000|Jones & Bartlett Learning|Programming and Problem Solving with Ada 95|Nell B. Dale and Chip Weems and John W. McCormick|9780792376767\n2000|Jones & Bartlett Learning|Programming and Problem Solving with Ada 95|Nell B. Dale and Chip Weems and John W. McCormick|9780763707927\n2011-05-16T00:00:01Z|Cambridge University Press|Building Parallel, Embedded, and Real-Time Applications with Ada|McCormick, John W. and Singhoff, Frank and Hugues, Jérôme|9780521197168\n1995|Pearson Education|Programming in Ada 95 (International Computer Science Series)|Barnes, John|9780201877007\n1984T|Addison-Wesley|Programming in ADA (International computer science series)|Barnes, J. G. P|9780201137996\n1996|Addison-Wesley|Software Construction and Data Structures with Ada 95 (2nd Edition)|Feldman, Michael B.|9780201887952\n1996-10-24T00:00:01Z|Prentice Hall|Ada 95: The Craft of Object-Oriented Programming|English, John|9780132303507\n2015|CreateSpace Independent Publishing Platform|ADA Programming Success In A Day: Beginner’s guide to fast, easy and efficient learning of ADA programming|Key, Sam|9781515371328\n1989T|Addison-Wesley|Programming in ADA (International computer science series)|Barnes, J. G. P|9780201175660\n1990|Prentice Hall|Introduction to Programming Using Ada|Volper, Dennis and Katz, Martin D.|9780134935294\n1983|Horizon Pubs & Distributors Inc|Programming in ADA|Sincovec, Richard F. and Wiener, Richard|9780471870890\n1990|Benjamin-Cummings Pub Co|File Structures With Ada (Benjamin Cummings Series in Computer Science)|Miller, Nancy E. and Petersen, Charles G.|9780805304404\n1981|Prentice Hall International|The Ada programming language: A guide for programmers|Pyle, I. C|9780130039217\n2018|Abdo Publishing|Computer Programming: From ADA Lovelace to Mark Zuckerberg (Stem Stories)|Doudna, Kelly|9781532115455\n1997|Springer|Ada 95 Rationale: The Language - The Standard Libraries (Lecture Notes in Computer Science, 1247)||9783540631439\n2013|Springer|Ada 2012 Rationale: The Language -- The Standard Libraries (Lecture Notes in Computer Science (8338))|Barnes, John|9783642452093\n1983|Prentice Hall|The Programming Languages: Pascal, Modula, Chill and Ada|Smedema, Kees|9780137297566\n1991|Addison-Wesley|Programming in Ada Plus Language Reference Manual (International Computer Science Series)|Barnes|9780201565393\n1991|Cambridge University Press|Rationale for the Design of the Ada Programming Language (The Ada Companion Series)|Ichbiah, J.|9780521392679\n2021|Wiley-ISTE|Concepts and Semantics of Programming Languages 2: Modular and Object-oriented Constructs with OCaml, Python, C++, Ada and Java|Hardin, Therese and Jaume, Mathieu and Pessaux, François and Viguie Donzeau-Gouge, Veronique|9781786306029\n1993-03-01T00:00:01Z|Chapman & Hall|Introduction to Ada|Cooling, J. E. and Cooling, N.|9780412448102\n1996|Springer|Reliable Software Technologies - Ada Europe 96: 1996 Ada-Europe International Conference on Reliable Software Technologies, Montreux, Switzerland, ... (Lecture Notes in Computer Science, 1088)||9783540613176\n1982|Prentice Hall|Programming Embedded Systems With Ada|Downes, Valerie A.|9780137300105\n1984T|Prentice-Hall|Ada, an advanced introduction: Including reference manual for the Ada programming language (Prentice-Hall software series)|Gehani, Narain|9780130039972\n1996|McGraw-Hill College|Ada Minimanual to Accompany Programming Languages|Benjamin|9780070053182\n1982|John Wiley & Sons|Problem Solving with ADA (Wiley Medical Publication)|Mayoh, B. H.|9780471100256\n1991-11-01|McGraw Hill Higher Education|Programming Languages: Paradigm and Practice: Ada Mini-Manual|Appleby|9780070025783\n1990|Cambridge University Press|Distributed Ada: Developments and Experiences: Proceedings of the Distributed Ada '89 Symposium, University of Southampton, 11–12 December 1989|Bishop, Judy M.|9780521392518\n1990|Springer|Programming with Specifications: An Introduction to ANNA, A Language for Specifying Ada Programs (Monographs in Computer Science)|Luckham, David|9780387972541\n1996|Jones & Bartlett Learning|Programming and Problem Solving With Ada|Nell B. Dale and Chip Weems and John W. McCormick|9780763702939\n1993|Prentice Hall|Introduction to Abstract Data Types Using Ada|Hillam, Bruce|9780130459497\n1983|Castle House Publications Ltd|Reference Manual for the ADA Programming Language|Ichbiah, Jean D. & etc.|9780719400971\n2011|Cambridge University Press|Building Parallel, Embedded, And Real-time Applications With Ada|John W. McCormick and Frank Singhoff and Jérôme Hugues|9781139500005\n2010||Ada Programming Language: Ada|Books and LLC|9781156382783\n1988|Eyrolles|Ada|Narain Gehani|9782212084214", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1983|The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983|10.1007/3-540-12328-8|478|0|G. Goos and J. Hartmanis and D. Barstow and W. Brauer and P. B. Hansen and D. Gries and D. Luckham and C. Moler and A. Pnueli and G. Seegmüller and J. Stoer and N. Wirth|0db8635ac2161a3eda9e69ccb3cbfcdcd443597f\n1979|Rationale for the design of the Ada programming language|10.1145/956653.956654|423|16|J. Ichbiah and B. Krieg-Brueckner and B. Wichmann and J. Barnes and O. Roubine and J. Heliard|5bd19234d0c46775d07fe9e98c157f4f6d3f13f3\n1983|The Programming Language Ada|10.1007/3-540-10693-6|146|1|G. Goos and J. Hartmanis and W. Brauer and P. B. Hansen and D. Gries and C. Moler and G. Seegmüller and J. Stoer and N. Wirth|06e41d8bfca86aacba4779fa57533b0ad483fcd9\n1990|Programming with Specifications: An Introduction to ANNA, A Language for Specifying Ada Programs|10.5860/choice.28-5114|95|1|D. Luckham|c7cf8a74d165939386c2f2ba991788a4946b8f84\n1982|The programming language ADA reference manual: Springer-Verlag (1981) pp 243, $7.90, DM 16.50|10.1016/0141-9331(82)90378-7|74|1|S. J. Young|1fa0aff383fa6dc0aefcdcc166d320135c0d4e49\n1982|\"Review of \"\"The Ada programming language by Ian C. Pyle\"\", Prentice-Hall, Inc., Englewood Cliffs, N.J., 1981.\"|10.1145/1041326.1041337|53|0|P. Hilfinger|a31990b9ccfaac5a80229de9c27ff645a8f92c1c\n1980|Reference Manual for the Ada Programming Language. Proposed Standard Document|10.21236/ada090709|49|0|J. Ichbiah and B. Krieg-Brueckner and B. Wichmann and H. Ledgard and J. Heliard|c84bede16ef707b5ad9c00aad0bf9b0382b5ead5\n1983|The ada programming language|10.1016/0011-684x(85)90286-2|46|2|S. Saib and R. E. Fritz|c94126df9ae162da0ca25ffccdbd8c52cb362e55\n1998|Guidance for the use of the Ada programming language in high integrity systems|10.1145/290214.290222|44|1|B. Wichmann|c1efd5c0dcab29a50cdcc5bca94438957e50f9d4\n1985|The ada programming language|10.5860/choice.36-1004|42|1|I. Pyle|7c5fd21c5143acea788ddd1b6e8d93096785239f\n1982|The ADA programming language: Pyle, I C, Prentice-Hall International (1981) pp 293, £8.95|10.1016/0141-9331(82)90377-5|39|0|S. J. Young|189da10ccf871122d736fd3fa1d140c7f4e44554\n1985|Object-Based Computing and the Ada Programming Language|10.1109/MC.1985.1662826|34|0|G. Buzzard and T. Mudge|093f95ae840dfc4bd827b6be63540490ecd359f4\n1984|Using Ada as a programming language for robot-based manufacturing cells|10.1109/TSMC.1984.6313313|26|0|R. Volz and T. Mudge and D. A. Gal|fd8a692903506c79ce2f47cf00867d2f14265228\n2014|Programming in Ada 2012|10.1017/CBO9781139696616|17|0|J. Barnes|5754a4c9f110e8307609d2bc91533d9ecb82843c\n1983|Why Ada is not just another programming language|10.1145/800173.809685|17|0|J. Sammet|51b9e742858f056959914fd7ee1150968a5eb922\n1987|A Survey of Real-Time Performance Benchmarks for the Ada Programming Language|10.21236/ada200608|15|0|P. Donohoe|d50947c4e453bb3d420201bbec758c5201769477\n2014|Safe parallel programming in ada with language extensions|10.1145/2663171.2663181|13|0|S. Taft and B. Moore and L. M. Pinho and S. Michell|9c325ccd1c05de79bbcdee1cdf0de80e5d0396c8\n1985|Implementing Ada as the primary programming language|10.1145/323287.323389|9|1|Howard Evans and W. Patterson|14081e6ebabd4b930f1363603693c3fbdfe4a30c\n2018|Converging safety and high-performance domains: Integrating OpenMP into Ada|10.23919/DATE.2018.8342162|8|0|Sara Royuela and L. M. Pinho and E. Quiñones|ccd833915d5d2cace0c6a0d34760b60eab5a393e\n1899|The importance of Ada programming support environments|10.1145/1500774.1500815|7|0|T. Standish|e8416288ccd237bc5f36258cd2e32bd7a46edefa\n1996|Ada 95: An Effective Concurrent Programming Language|10.1007/BFb0013478|7|0|A. Burns and A. Wellings|a5dfb43a52ea2d24ef3494facc711fef4d1ff1a4\n1996|Using Ada as the first programming language: a retrospective|10.1109/SEEP.1996.534005|6|0|R. K. Allen and D. Grant and R. Smith|b3f100b2320a6417d4bef3fa0ef13f5558e2202c\n1981|Self-assessment procedure VIII: a self-assessment procedure dealing with the programming language Ada|10.1145/358769.358785|6|0|P. Wegner|d6f3c64b6625b582f3603be26b39dc0dd9352bea\n1990|Built-in reliability in the Ada programming language|10.1109/NAECON.1990.112833|6|1|T. Wu|7668ba4ae828a5b23e074a61a230edbbe54c5aa4\n2014|Towards a Runtime Verification Framework for the Ada Programming Language|10.1007/978-3-319-08311-7_6|6|0|A. Pedro and D. Pereira and L. M. Pinho and J. Pinto|627769c65b4bac6649b4d27cd3a22dd8ad6c294c\n1986|Engineering VAX Ada for a multi-language programming environment|10.1145/24208.24215|5|0|C. Mitchell|4abecab1498a0b7b7b436ebf08b31a1a04e3664a\n2003|Ada as a language for programming clusters of SMPs|10.17951/AI.2003.1.1.1-7|5|1|Przemysław Stpiczyński|33d24df6203b4bc474d0afedd756908094c402d2\n1979|TCOL Ada : an intermediate representation for the DOD standard programming language|10.21236/ada955948|5|0|B. Schatz|3c67231ccae5f9cd14d681fb2a5835f03e1db3ff\n1988|Experience with Ada as a first programming language|10.1145/54138.54149|5|0|Atanas Radensky and Emilia Zivkova and V. Petrova and Rumiana Lesseva and Christina Zascheva|a837805d46632f54180fe817c444aa1003608d73\n1981|Some comments on ADA as a real-time programming language|10.1145/954269.954282|5|0|A. Mahjoub|fd95d78b0a63c2e2cb47663c42fb38e624bb9959\n1990|Can Ada be used as a primary programming language?: major problems and their solutions by means of subsets|10.1145/323410.323452|5|0|Atanas Radensky|0156665673118b67b8bb9e7cfb0a41aa22771092\n1987|Is Ada an object oriented programming language?|10.1145/25267.25272|5|0|H. Touati|c2ce45f92d0d58ddc890af5d39c3154cff2c0703\n1994|Ada programming language for numerical computation|10.1109/NAECON.1994.332950|5|0|T. Wu|fcf479a134e593ff4a3eb783e8a9aa3957757938\n1980|The use of the Ada language for programming a distributed system|10.1016/S1474-6670(17)65159-0|4|1|V. Downes and S. Goldsack|a8ff42da6c1b74bae3b975a3271ea31644316409\n1982|Types in the Programming Language Ada|10.1007/978-1-4612-5196-5_14|4|0|B. Krieg-Brückner|1afeaecca6f9c07f6909fee5894203b3dbc54d03\n1995|Information Technology. Programming Language. The SQL Ada Module Description Language (SAMeDL).|10.3403/00539178|4|1|M. Graham|d5067e3310269f48c6035eee6db9d4e0e52f7b6e\n1986|ADDS - A Dialogue Development System for the Ada Programming Language|10.1016/S0020-7373(86)80046-3|4|0|A. Burns and J. Robinson|6669b65c09d65260d81ecf52b8658bed78f0655b\n2010|The Evolution of Real-Time Programming Revisited: Programming the Giotto Model in Ada 2005|10.1007/978-3-642-13550-7_14|3|0|A. Wellings and A. Burns|c01cde4d526b8709ed928528407923db38c0a7d7\n2010|AdaStreams: A Type-Based Programming Extension for Stream-Parallelism with Ada 2005|10.1007/978-3-642-13550-7_15|3|0|Jingun Hong and Kirak Hong and Bernd Burgstaller and Johann Blieberger|f8c945e0eee3e1ab9373f31cad42c6c4c77b9456\n1991|VADS APSE: an integrated Ada programming support environment|10.1145/112629.112638|3|0|E. Matthews and G. Burns|43bbe6388f88d2f0f43eaf93055a4c3c6a3b46a6\n1980|Some short comments on the definition and the documentation of the ADA programming language|10.1145/947680.947686|3|0|R. Nicolescu|84a27f3e956cbcd7aa367a00e61e8042802e999c\n2016|Rationale For The Design Of The Ada Programming Language|10.5860/choice.29-5168|3|1|S. Eberhart|8369c68a3c6ac543c134a0b1a5f963acdd62eada\n1992|IAda: A language for robot programming based on Ada|10.1016/0921-8890(92)90045-Z|2|0|D. Duhaut and P. Bidaud and D. Fontaine|9a3f9e15e26b683b05c8c217f7a07c015b9d2803\n1983|The current programming language standards scene VIIIA: ADA|10.1016/0167-8051(83)90010-4|2|0|A. McGettrick|eb47d46be8baa713fcff66e57b49913fe74ef813\n2016|Why the Expressive Power of Programming Languages Such as Ada Is Needed for Future Cyber Physical Systems|10.1007/978-3-319-39083-3_1|2|0|A. Burns|acf36a8fd5e2952ae9d72212984c3c15c3daebce\n1994|Proposals for enhancement of the Ada programming language|10.5075/EPFL-THESIS-1227|2|0|Mats Weber|caeecffdc6baeb1440fb40466206636d307b9563\n1980|\"Comments on the suggested implementation of tasking facilities in the \"\"rationale for the design of the ADA programming language\"\"\"|10.1145/947727.947733|2|0|K. Tai and K. Garrard|574e48b95a03cce88e8a1e5b37448ec1bba7baa8\n2012|Teaching 'Concepts of Programming Languages' with Ada|10.1007/978-3-642-30598-6_5|1|0|T. Tempelmeier|b5d480c144de0f4f5a7f9c7bd9b5b46fda97f705\n1981|Ada programming language standardization|10.1016/0164-1212(81)90009-1|1|0|Paul M. Cohen|de9b22cf99188af170f37770f8160c6819240b6c\n2015|From Byron to the Ada Programming Language|10.1145/2867731.2867745|1|0|J. Barnes|e73889075e3ca97186208255c7a359c106f527c6" }, "adabtpl": { "title": "ADABTPL", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1e4c50a1ef4c3cf1a77f7bbc66d35d63d2e6a003" ], "originCommunity": [ "University of Massachusetts", "University of Texas" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2834", "centralPackageRepositoryCount": 0 }, "adagio": { "title": "Adagio", "appeared": 2007, "type": "pl", "reference": [ "http://www.cs.cmu.edu/~rbd/doc/cmt/part4.html" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6369", "centralPackageRepositoryCount": 0 }, "adam-standard": { "title": "adam-standard", "appeared": 2009, "type": "standard", "description": "ADaM defines dataset and metadata standards that support: efficient generation, replication, and review of clinical trial statistical analyses, and traceability among analysis results, analysis data, and data represented in the Study Data Tabulation Model (SDTM).​", "reference": [ "https://www.cdisc.org/standards/foundational/adam" ], "originCommunity": [ "Clinical Data Interchange Standards Consortium" ] }, "adam": { "title": "ADAM", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/98fcabda6711dcd5e3a14c1e7b3d9e5f832c6044" ], "originCommunity": [ "The MITRE Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1788", "wordRank": 3477, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "adamant": { "title": "adamant", "appeared": 2018, "type": "pl", "creators": [ "Jeff Walker" ], "website": "https://adamant-lang.org", "domainName": { "registered": 2015, "name": "adamant-lang.org" }, "githubRepo": { "firstCommit": 2018, "stars": 22, "forks": 1, "subscribers": 3, "created": 2018, "updated": 2021, "description": "A compiler for the Adamant language", "issues": 2, "url": "https://github.com/adamant/adamant.tools.compiler.bootstrap" }, "repoStats": { "firstCommit": 2018, "commits": 1169, "committers": 2, "files": 635 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n19328130|Dreaming of a Parser Generator for Language Design|https://blog.adamant-lang.org/2019/dreaming-of-a-parser-generator/|2019-03-07 14:17:14 UTC|1551968234|matt_d|61|117", "twitter": "https://twitter.com/adamantlang" }, "adaplex": { "title": "Adaplex", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e9058c5e7abcd7aaf8eb3052131c81db67445615" ], "originCommunity": [ "Ministero della Pubblica Istruzione" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2658", "centralPackageRepositoryCount": 0 }, "address": { "title": "Address", "appeared": 1955, "type": "pl", "creators": [ "Kateryna Lohvynivna Yushchenko" ], "originCommunity": [ "USSR Academy of Sciences or National Academy of Sciences of Ukraine" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Address_programming_language" } }, "adenine-programming-language": { "title": "Adenine", "appeared": 1999, "type": "pl", "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "rdf", "python", "lisp" ], "summary": "Haystack was a project at the Massachusetts Institute of Technology to research and develop several applications around personal information management and the Semantic Web. The most notable of those applications is the Haystack client, a research personal information manager (PIM) and one of the first to be based on semantic desktop technologies. The Haystack client is published as open source software under the BSD license. Similar to the Chandler PIM, the Haystack system unifies handling different types of unstructured information. This information has a common representation in RDF that is presented to users in a configurable human-readable way.", "created": 2007, "backlinksCount": 19, "pageId": 5033679, "revisionCount": 45, "dailyPageViews": 4, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Adenine_(programming_language)" }, "centralPackageRepositoryCount": 0 }, "adept": { "title": "Adept", "appeared": 2018, "type": "pl", "creators": [ "Isaac Shelton" ], "description": "A blazing fast language for general purpose programming.", "website": "https://github.com/AdeptLanguage/Adept", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/AdeptLanguage/" ], "example": [ "/*\n For values that use ownership-based memory management\n (e.g. String, List, Grid)\n we must transfer ownership if we want to keep them\n alive for longer than their owner's scope\n*/\nimport basics\nfunc main {\n everyone List = getEveryoneAttending()\n each fullname String in everyone {\n print(\"=> \" + fullname)\n }\n}\nfunc getEveryoneAttending() List {\n everyone List\n person1 String = getFullnameReturnImmediately(\"Alice\", \"Golden\")\n person2 String = getFullnameStoreAndThenLaterReturn(\"Bob\", \"Johnson\")\n // Commit ownership of strings held by 'person1' and 'person2'\n // to be managed by the list\n everyone.add(person1.commit())\n everyone.add(person2.commit())\n // Commit ownership of the list to the caller\n return everyone.commit()\n}\nfunc getFullnameReturnImmediately(firstname, lastname String) String {\n // '.commit()' is not necessary here\n return firstname + \" \" + lastname\n}\nfunc getFullnameStoreAndThenLaterReturn(firstname, lastname String) String {\n fullname String = firstname + \" \" + lastname\n // Ownership of the result is held by 'fullname',\n // so we must transfer ownership to the caller in order\n // to keep it alive after this function returns\n // '.commit()' is necessary here\n return fullname.commit()\n}" ], "githubRepo": { "stars": 78, "forks": 3, "subscribers": 4, "created": 2018, "updated": 2022, "description": "The Adept Programming Language", "url": "https://github.com/AdeptLanguage/Adept" }, "repoStats": { "firstCommit": 2018, "commits": 851, "committers": 6, "files": 552 } }, "ades-ii": { "title": "ADES II", "appeared": 1955, "type": "pl", "reference": [ "https://semanticscholar.org/paper/baffa9cfb7d674656306137eeefc6c7afd823837" ], "originCommunity": [ "U.S Naval Ordnance Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2807", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ades": { "title": "ADES", "appeared": 1955, "type": "pl", "reference": [ "https://semanticscholar.org/paper/baffa9cfb7d674656306137eeefc6c7afd823837" ], "originCommunity": [ "U.S Naval Ordnance Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=37", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "aditi": { "title": "Aditi", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7ec2490b5918193ee10f25411d538968ffa5c58b" ], "originCommunity": [ "University of Melbourne" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7128", "centralPackageRepositoryCount": 0 }, "adlib": { "title": "ADLIB", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d4a87704f71685b44afb220acb41aac0421fbcd6" ], "originCommunity": [ "University of Stanford" ], "supersetOf": [ "pascal" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3507", "centralPackageRepositoryCount": 0 }, "adobe-font-metrics": { "title": "Adobe Font Metrics", "appeared": 1987, "type": "application", "reference": [ "https://www.adobe.com/content/dam/acom/en/devnet/font/pdfs/5004.AFM_Spec.pdf" ], "originCommunity": [ "Adobe Systems Incorporated" ], "githubLanguage": { "fileExtensions": [ "afm" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.afm", "aliases": [ "acfm", "adobe composite font metrics", "adobe multiple font metrics", "amfm" ], "id": "Adobe Font Metrics" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 2, "commitCount": 51, "sampleCount": 3, "example": [ "StartFontMetrics 2.0\nComment Generated by FontForge 20170719\nComment Creation Date: Sun Jul 23 23:14:02 2017\nFontName Greek_Lambda_Character-Regular\nFullName Greek_Lambda_Character Regular\nFamilyName Greek_Lambda_Character\nWeight Regular\nNotice (NONE. NADA. PUBLIC DOMAIN, BOI)\nItalicAngle 0\nIsFixedPitch false\nUnderlinePosition -175\nUnderlineThickness 90\nVersion 020.017\nEncodingScheme ISO10646-1\nFontBBox 33 -177 566 760\nStartCharMetrics 5\nC 13 ; WX 602 ; N uni000D ; B 0 0 0 0 ;\nC 32 ; WX 602 ; N space ; B 0 0 0 0 ;\nC -1 ; WX 602 ; N lambda ; B 33 0 566 760 ;\nC -1 ; WX 602 ; N .notdef ; B 50 -177 551 706 ;\nC -1 ; WX 0 ; N NULL ; B 0 0 0 0 ;\nEndCharMetrics\nEndFontMetrics" ], "url": "https://github.com/Alhadis/language-fontforge" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ads-b-standard": { "title": "ADS-B", "appeared": 2006, "type": "standard", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Automatic_dependent_surveillance_–_broadcast" } }, "advanced-continuous-simulation-language": { "title": "Advanced Continuous Simulation Language", "appeared": 1967, "type": "pl", "originCommunity": [ "Simulation Councils Inc" ], "wikipedia": { "related": [ "fortran" ], "summary": "The Advanced Continuous Simulation Language, or ACSL (pronounced \"axle\"), is a computer language designed for modeling and evaluating the performance of continuous systems described by time-dependent, nonlinear differential equations. Like SIMCOS and TUTSIM, ACSL is a dialect of the Continuous System Simulation Language (CSSL), originally designed by the Simulation Councils Inc (SCI) in 1967 in an attempt to unify the continuous simulations field.", "created": 2006, "backlinksCount": 12, "pageId": 3614270, "revisionCount": 44, "dailyPageViews": 8, "appeared": 1967, "url": "https://en.wikipedia.org/wiki/Advanced_Continuous_Simulation_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=282", "centralPackageRepositoryCount": 0 }, "advice-taker": { "title": "Advice Taker", "appeared": 1958, "type": "pl", "creators": [ "John McCarthy" ], "originCommunity": [ "Stanford University" ], "wikipedia": { "backlinksCount": 6, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/Advice_taker" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8401" }, "aed": { "title": "AED", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d89af6e80cb54a793c82d960826b9cb97c21c246" ], "originCommunity": [ "SofTech, Inc." ], "hopl": "https://hopl.info/showlanguage.prx?exp=217", "centralPackageRepositoryCount": 0 }, "aepl": { "title": "AEPL", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fb9879aeec21d4e123043d6dd5d32335b621066d" ], "originCommunity": [ "University of California", "New York University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2925", "centralPackageRepositoryCount": 0 }, "aesop": { "title": "AESOP", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3d06ecab730fcc4375b277eb2fdce1d68b79f6cd" ], "originCommunity": [ "The MITRE Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=278", "centralPackageRepositoryCount": 0 }, "afnix": { "title": "Afnix", "appeared": 2003, "type": "pl", "reference": [ "http://freshmeat.sourceforge.net/projects/afnix" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "println" ] ], "rijuRepl": { "example": [ "println \"Hello, world!\"\n" ], "id": "https://riju.codes/afnix" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8506", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "afs": { "title": "AFS", "appeared": 1982, "type": "filesystem", "standsFor": "Andrew File System", "originCommunity": [ "Carnegie Mellon" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Andrew_File_System" } }, "agda": { "title": "Agda", "appeared": 2007, "type": "pl", "creators": [ "Ulf Norell", "Catarina Coquand" ], "website": "http://wiki.portal.chalmers.se/agda", "documentation": [ "https://agda.readthedocs.io/en/v2.6.2.2/" ], "country": [ "Sweden" ], "originCommunity": [ "Chalmers University of Technology" ], "hasTypedHoles": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "-- 0[xX][\\da-fA-F]+", "value": true }, "hasFloats": { "example": "-- \\d+[eE][+-]?\\d+", "value": true }, "hasIntegers": { "example": "-- \\d+", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "putStrLn" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "data _≤_ : ℕ → ℕ → Set where\n z≤n : {n : ℕ} → zero ≤ n\n s≤s : {n m : ℕ} → n ≤ m → suc n ≤ suc m" ], "related": [ "coq", "epigram", "haskell", "idris", "emacs-editor", "unicode", "javascript" ], "summary": "Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with implementation described in his PhD thesis. The current version of Agda was originally known as Agda 2. The original Agda system was developed at Chalmers by Catarina Coquand in 1999. The current version is a full rewrite, which should be considered a new language that shares name and tradition. Agda is also a proof assistant based on the propositions-as-types paradigm, but unlike Coq, has no support for tactics, and proofs are written in a functional programming style. The language has ordinary programming constructs such as data types, pattern matching, records, let expressions and modules, and a Haskell-like syntax. The system has Emacs and Atom interfaces but can also be run in batch mode from the command line. Agda is based on Zhaohui Luo's Unified Theory of Dependent Types (UTT), a type theory similar to Martin-Löf type theory.", "pageId": 4426773, "created": 2006, "backlinksCount": 64, "revisionCount": 256, "dailyPageViews": 102, "appeared": 2007, "fileExtensions": [ "agda", "lagda" ], "url": "https://en.wikipedia.org/wiki/Agda_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "agda" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.agda", "repos": 2120, "id": "Agda" }, "githubBigQuery": { "repos": 207, "users": 143, "id": "Agda" }, "pygmentsHighlighter": { "filename": "haskell.py", "fileExtensions": [ "agda" ], "id": "Agda" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2014, "committerCount": 2, "commitCount": 6, "sampleCount": 1, "example": [ "module NatCat where\n\nopen import Relation.Binary.PropositionalEquality\n\n-- If you can show that a relation only ever has one inhabitant\n-- you get the category laws for free\nmodule\n EasyCategory\n (obj : Set)\n (_⟶_ : obj → obj → Set)\n (_∘_ : ∀ {x y z} → x ⟶ y → y ⟶ z → x ⟶ z)\n (id : ∀ x → x ⟶ x)\n (single-inhabitant : (x y : obj) (r s : x ⟶ y) → r ≡ s)\n where\n\n idʳ : ∀ x y (r : x ⟶ y) → r ∘ id y ≡ r\n idʳ x y r = single-inhabitant x y (r ∘ id y) r \n\n idˡ : ∀ x y (r : x ⟶ y) → id x ∘ r ≡ r\n idˡ x y r = single-inhabitant x y (id x ∘ r) r\n\n ∘-assoc : ∀ w x y z (r : w ⟶ x) (s : x ⟶ y) (t : y ⟶ z) → (r ∘ s) ∘ t ≡ r ∘ (s ∘ t)\n ∘-assoc w x y z r s t = single-inhabitant w z ((r ∘ s) ∘ t) (r ∘ (s ∘ t))\n\nopen import Data.Nat\n\nsame : (x y : ℕ) (r s : x ≤ y) → r ≡ s\nsame .0 y z≤n z≤n = refl\nsame .(suc m) .(suc n) (s≤s {m} {n} r) (s≤s s) = cong s≤s (same m n r s)\n\n≤-trans : ∀ x y z → x ≤ y → y ≤ z → x ≤ z\n≤-trans .0 y z z≤n s = z≤n\n≤-trans .(suc m) .(suc n) .(suc n₁) (s≤s {m} {n} r) (s≤s {.n} {n₁} s) = s≤s (≤-trans m n n₁ r s)\n\n≤-refl : ∀ x → x ≤ x\n≤-refl zero = z≤n\n≤-refl (suc x) = s≤s (≤-refl x)\n\nmodule Nat-EasyCategory = EasyCategory ℕ _≤_ (λ {x}{y}{z} → ≤-trans x y z) ≤-refl same\n" ], "url": "https://github.com/mokus0/Agda.tmbundle" }, "leachim6": { "filepath": "a/Agda.agda", "fileExtensions": [ "agda" ], "example": [ "module agda where\nopen import IO\n\nmain = run (putStrLn \"Hello World\")\n" ], "id": "Agda" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Agda", "tryItOnline": "agda", "hopl": "https://hopl.info/showlanguage.prx?exp=7860", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nVerified Functional Programming in Agda||Aaron Stump|49396006|4.00|1|0\nVerified Functional Programming in Agda||Aaron Stump|49396007|0.0|0|0\nProgramming Language Foundations in Agda||Philip Wadler|66111413|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2016|ACM Books|Verified Functional Programming in Agda (ACM Books)|Stump, Aaron|9781970001242\n2016|ACM Books|Verified Functional Programming in Agda (ACM Books)|Stump, Aaron|9781970001273\n20160201|Morgan & Claypool Publishers|Verified Functional Programming in Agda|Aaron Stump|9781970001266\n20160201|Morgan & Claypool Publishers|Verified Functional Programming in Agda|Aaron Stump|9781970001259", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|A Brief Overview of Agda - A Functional Language with Dependent Types|10.1007/978-3-642-03359-9_6|248|22|A. Bove and P. Dybjer and U. Norell|5b8b75c3049b78461e1f1eab598f4cc22ff898aa\n2011|On the bright side of type classes: instance arguments in Agda|10.1145/2034773.2034796|62|2|D. Devriese and F. Piessens|dd8bfacec46cd0fe6c0255ebec2d8f4f55fa9fc0\n2018|Programming Language Foundations in Agda|10.1007/978-3-030-03044-5_5|31|1|P. Wadler|559263fb7522805cb768a7ae0c4736d1972d9202\n2016|Verified Functional Programming in Agda|10.1145/2841316|27|1|Aaron Stump|a5c2444d3c977260dbbfc7c2eceea9bda2614e71\n2011|Integrating an Automated Theorem Prover into Agda|10.1007/978-3-642-20398-5_10|15|0|S. Foster and G. Struth|a3359b29ba67f6f950d2cdd1471d2a3b2e099c14\n2015|Pi-Ware: Hardware Description and Verification in Agda|10.4230/LIPIcs.TYPES.2015.9|11|1|J. P. P. Flor and W. Swierstra and Y. Sijsling|80a17295f94f6e5019b0846f56b62ef65153595e\n2015|Auto in Agda - Programming Proof Search Using Reflection|10.1007/978-3-319-19797-5_14|11|2|Pepijn Kokke and W. Swierstra|85f3bb9d1a14d5007674fe4917eeb279f1686a7f\n2020|Programming language foundations in Agda|10.1016/J.SCICO.2020.102440|6|0|Wen Kokke and Jeremy G. Siek and P. Wadler|bbfcb282284fae3c08db573efd84a0b280eb6f67\n2009|Embedding a logical theory of constructions in Agda|10.1145/1481848.1481857|5|0|A. Bove and P. Dybjer and Andrés Sicard-Ramírez|4eb11e41eea071024c3720cfa63002a097760efd\n2013|Dependently Typed Web Client Applications - FRP in Agda in HTML5|10.1007/978-3-642-45284-0_16|4|0|A. Jeffrey|6e588b21361d0f1d4a015e235f43397ce588c096\n2014|Case of (Quite) Painless Dependently Typed Programming: Fully Certified Merge Sort in Agda|10.1007/978-3-319-11863-5_5|2|0|Ernesto Copello and Á. Tasistro and Brunone Bianchi|ed2ecf1f4f3382c500d4979444107b49b00b0337\n2018|Formalizing Constructive Quantifier Elimination in Agda|10.4204/EPTCS.275.2|1|0|J. Pope|aa33c00f9b0175cb04208e3efa98e711ad4fd13c\n2011|Programming assurance cases in Agda|10.1145/2034773.2034794|1|0|M. Takeyama|f84dc6e52242df661da7bb499169393c05743b3b\n2022|An approach to translating Haskell programs to Agda and reasoning about them|10.48550/arXiv.2205.08718|1|0|H. Carr and Christa Jenkins and Mark Moir and Victor Cacciari Miraldo and Lisandra Silva|4f55424ebcf710cd8a46b9fad9c27f6803375835" }, "agent-k": { "title": "Agent-K", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0e668fd124b3007549edfb9d873db7271fef66a0" ], "originCommunity": [ "University of Aberdeen" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8163", "centralPackageRepositoryCount": 0 }, "agentspeak": { "title": "AgentSpeak", "appeared": 1994, "type": "pl", "creators": [ "Anand Rao" ], "reference": [ "https://semanticscholar.org/paper/ad65b6f0794c435b76cc4ef5defa4f2dea6dc6fd" ], "originCommunity": [ "Federal University of Rio Grande do Sul", "University of Massachusetts Amherst" ], "wikipedia": { "summary": "AgentSpeak is an agent-oriented programming language. It is based on logic programming and the BDI architecture for (cognitive) autonomous agents. The language was originally called AgentSpeak(L), but became more popular as AgentSpeak, a term that is also used to refer to the variants of the original language.", "backlinksCount": 16, "pageId": 22623404, "dailyPageViews": 10, "created": 2009, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/AgentSpeak" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7800", "centralPackageRepositoryCount": 0 }, "agl": { "title": "AGL", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a1d08a2eade452554948386c3280c8de0962c3e5" ], "originCommunity": [ "SOFREMI" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4382", "centralPackageRepositoryCount": 0 }, "agora": { "title": "Agora", "appeared": 1993, "type": "pl", "originCommunity": [ "Vrije Universiteit" ], "wikipedia": { "related": [ "java" ], "summary": "Agora is a reflective, prototype-based, object-oriented programming language that is based exclusively on message passing and not delegation. Agora was intended to show that even subject to that limit, it is possible to build a full object-oriented language that features inheritance, cloning and reflective operators.", "pageId": 933477, "created": 2004, "backlinksCount": 8, "revisionCount": 18, "dailyPageViews": 8, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Agora_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1794", "fileType": "text", "centralPackageRepositoryCount": 0 }, "ags-script": { "title": "Adventure Game Studio Script", "appeared": 2001, "type": "pl", "website": "http://www.adventuregamestudio.co.uk/site/ags/tutorial/scripting/1/", "originCommunity": [ "Adventure Game Studio" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "function hDoor_Look()\n{\n Display(\"It's quite a large, ominous looking door.\");\n}" ], "githubLanguage": { "fileExtensions": [ "asc", "ash" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-c++src", "tmScope": "source.c++", "aliases": [ "ags" ], "repos": 128, "id": "AGS Script" }, "githubBigQuery": { "repos": 674, "users": 631, "id": "AGS Script" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 23, "commitCount": 359, "sampleCount": 4, "example": [ "// Main header script - this will be included into every script in\n// the game (local and global). Do not place functions here; rather,\n// place import definitions and #define names here to be used by all\n// scripts." ], "url": "https://github.com/textmate/c.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "aheui": { "title": "Aheui", "appeared": 2012, "type": "esolang", "website": "http://aheui.github.io/aheuicon", "country": [ "Korea" ], "nativeLanguage": "Korean", "githubRepo": { "stars": 53, "forks": 5, "subscribers": 16, "created": 2015, "updated": 2022, "description": "Industrial-strength implementaiton of Aheui written in RPython with JIT", "issues": 4, "url": "https://github.com/aheui/rpaheui" }, "repoStats": { "firstCommit": 2015, "commits": 95, "committers": 4, "files": 27 }, "pygmentsHighlighter": { "filename": "esoteric.py", "fileExtensions": [ "aheui" ], "id": "Aheui" }, "leachim6": { "filepath": "a/Aheui.aheui", "fileExtensions": [ "aheui" ], "example": [ "밤밣따빠밣밟따뿌\n빠맣파빨받밤뚜뭏\n돋밬탕빠맣붏두붇\n볻뫃박발뚷투뭏붖\n뫃도뫃희멓뭏뭏붘\n뫃봌토범더벌뿌뚜\n뽑뽀멓멓더벓뻐뚠\n뽀덩벐멓뻐덕더벅\n" ], "id": "Aheui" }, "quineRelay": "Aheui", "rijuRepl": { "example": [ "밤밣따빠밣밟따뿌\n빠맣파빨받밤뚜뭏\n돋밬탕빠맣붏두붇\n볻뫃박발뚷투뭏붖\n뫃도뫃희멓뭏뭏붘\n뫃봌토범더벌뿌뚜\n뽑뽀멓멓더벓뻐뚠\n뽀덩벐멓뻐덕더벅\n" ], "id": "https://riju.codes/aheui" }, "tryItOnline": "aheui", "esolang": "https://esolangs.org/wiki/Aheui", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "aida": { "title": "AIDA", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/16c84df489224ba91ebae8ab89111fdecac5daf5" ], "originCommunity": [ "IP Sharp AG" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1195", "centralPackageRepositoryCount": 0 }, "aids": { "title": "AIDS", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6e2ba767170e785e238f34350a87cf47dbc4a64e" ], "originCommunity": [ "New York University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2964", "wordRank": 2404, "centralPackageRepositoryCount": 0 }, "ail": { "title": "AIL", "appeared": 2016, "type": "ir", "reference": [ "https://angr.io/" ], "standsFor": "angr Intermediate Language", "originCommunity": [ "University of California", "Arizona State University" ], "githubRepo": { "firstCommit": 2016, "stars": 16, "forks": 11, "subscribers": 10, "created": 2017, "updated": 2022, "description": "AIL: The angr Intermediate Language.", "issues": 3, "url": "https://github.com/angr/ailment" }, "repoStats": { "firstCommit": 2016, "commits": 466, "committers": 25, "files": 32 } }, "aime": { "title": "Aime", "appeared": 2013, "type": "pl", "creators": [ "Ciprian Niculescu" ], "description": "aime is an imperative procedural programming language, with a C inspired syntax.", "website": "https://aime-embedded.sourceforge.net/", "country": [ "Unknown" ], "originCommunity": [ "https://sourceforge.net/projects/aime-embedded/" ], "example": [ "integer\nmedian3(integer a, integer b, integer c)\n{\n integer m;\n if (a < b) {\n if (b < c) {\n m = b;\n } else {\n if (a < c) {\n m = c;\n } else {\n m = a;\n }\n }\n } else {\n if (a < c) {\n m = a;\n } else {\n if (b < c) {\n m = c;\n } else {\n m = b;\n }\n }\n }\n return m;\n}" ] }, "aiml": { "title": "AIML", "appeared": 2001, "type": "dataNotation", "website": "http://www.aiml.foundation/", "documentation": [ "http://www.aiml.foundation/doc.html" ], "standsFor": "Artificial Intelligence Markup Language", "originCommunity": [ "https://mindsdb.com/community" ], "domainName": { "name": "aiml.foundation" }, "githubRepo": { "stars": 15, "forks": 3, "subscribers": 2, "created": 2018, "updated": 2022, "issues": 0, "url": "https://github.com/AIML-Foundation/AIML-2.1-Spec" }, "repoStats": { "firstCommit": 2018, "commits": 1, "committers": 1, "files": 1 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Artificial_Intelligence_Markup_Language" } }, "aimms": { "title": "AIMMS", "appeared": 1993, "type": "pl", "creators": [ "Johannes J. Bisschop", "Marcel Roelofs" ], "description": "AIMMS (an acronym for \"Advanced Interactive Multidimensional Modeling System\") began as a software system designed for modeling and solving large-scale optimization and scheduling-type problems. AIMMS is considered to be one of the five most important algebraic modeling languages and the creator (Johannes J. Bisschop) has been awarded with INFORMS Impact Prize for his work in this language.", "reference": [ "https://download.aimms.com/aimms/download/references/AIMMS-Whitepaper-COA.pdf" ], "standsFor": "Advanced Interactive Multidimensional Modeling System", "originCommunity": [ "AIMMS B.V. or Paragon Decision Technology B.V." ], "wikipedia": { "related": [ "algebraic-modeling-language", "xml" ], "summary": "AIMMS is a prescriptive analytics software company with offices in the Netherlands, United States, China and Singapore. AIMMS has two main product offerings that provide modeling and optimization capabilities across a variety of industries. The AIMMS Prescriptive Analytics Platform is a tool for those with an Operations Research or Analytics background. It offers unlimited flexibility to develop optimization-based applications and deploy them to business users. AIMMS SC Navigator, launched in 2017, is built on the AIMMS Prescriptive Analytics Platform and provides configurable Apps for supply chain teams. SC Navigator provides supply chain analytics to individuals without a technical or analytics background so they can get the same benefits from sophisticated analytics without needing to code or model.", "pageId": 31460418, "created": 2011, "backlinksCount": 76, "revisionCount": 82, "dailyPageViews": 41, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/AIMMS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4940", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "air": { "title": "AIR", "appeared": 2016, "type": "ir", "description": "Bare Bones Backend / Assembly Intermediate Representation. The B3 compiler comprises two intermediate representations: a higher-level SSA-based representation called B3 IR and a lower-level representation that focuses of machine details, like registers. This lower-level form is called Air (Assembly Intermediate Representation).", "website": "https://webkit.org/docs/b3/assembly-intermediate-representation.html", "standsFor": "Assembly Intermediate Representation", "originCommunity": [ "Apple" ], "fileType": "text", "wordRank": 478, "centralPackageRepositoryCount": 0 }, "airtable-app": { "title": "Airtable", "appeared": 2012, "type": "application", "website": "https://airtable.com/", "originCommunity": [ "Formagrid, Inc." ], "domainName": { "registered": 2003, "awisRank": { "2022": 847 }, "name": "airtable.com" }, "wikipedia": { "summary": "Airtable is a cloud collaboration service headquartered in San Francisco. It was founded in 2012 by Howie Liu, Andrew Ofstad, and Emmett Nicholas. Airtable is a spreadsheet-database hybrid, with the features of a database but applied to a spreadsheet. The fields in an Airtable table are similar to cells in a spreadsheet, but have types such as 'checkbox', 'phone number', and 'drop-down list', and can reference file attachments like images.Users can create a database, set up column types, add records, link tables to one another, collaborate, sort records and publish views to external websites.", "backlinksCount": 14, "pageId": 49272892, "dailyPageViews": 149, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Airtable" }, "twitter": "https://twitter.com/airtable" }, "ais": { "title": "Alternate Instruction Set", "appeared": 2001, "type": "isa", "reference": [ "http://datasheets.chipdb.org/VIA/Eden-ESP/Eden%20v1.4.pdf" ], "originCommunity": [ "VIA Technologies, Inc" ], "wikipedia": { "related": [ "mmx", "nasm" ], "summary": "The Alternate Instruction Set (AIS) is a second 32-bit instruction set architecture found in some x86 CPUs made by VIA Technologies. On these VIA C3 processors, the second hidden processor mode is accessed by executing the x86 instruction ALTINST (0F 3F). If AIS mode has been enabled, the processor will perform a JMP EAX and begin executing AIS instructions at the address of the EAX register. Using AIS allows native access to the Centaur Technology-designed RISC core inside the processor.", "created": 2018, "backlinksCount": 9, "pageId": 58111994, "dailyPageViews": 22, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Alternate_Instruction_Set" }, "centralPackageRepositoryCount": 0 }, "aith": { "title": "Aith", "appeared": 2020, "type": "pl", "creators": [ "Superstar64" ], "description": "Aith is a perfomant systems programming language with am empathises on type systems. As of now Aith is very early stages and very little is implemented.", "website": "https://github.com/Superstar64/aith", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/Superstar64/aith" ], "keywords": [ "as", "bool", "borrow", "boxed", "break", "byte", "capacity", "continue", "copy", "else", "existence", "extern", "false", "function", "if", "in", "inline", "int", "integer", "invariant", "io", "kind", "let", "linear", "long", "loop", "module", "multiarg", "multiplicity", "native", "opaque", "pointer", "pretype", "region", "representation", "short", "signed", "signedness", "size", "step", "struct", "subtypable", "transparent", "true", "type", "ubyte", "uint", "ulong", "union", "unique", "unrestricted", "unsigned", "unwrap", "used", "uses", "ushort", "word", "wrap", "wrapper" ], "example": [ "module ::\n\ninline runtimeCall = \\f => \\x => f (x);\n\nmodule combinators = {\n inline flip = \\f => \\x => \\y => f !y !x;\n inline compose = \\f => \\g => \\x => f !(g !x);\n \n inline readerPure = \\x => \\r => x;\n inline readerBind = \\m => \\f => \\r => f !(m !r) !r;\n inline readerMap = \\f => \\m => readerBind !m !(compose !readerPure !f);\n};\n\nmodule systemf = {\n inline ignored : B -> B;\n inline ignored = \\(x : B) => x;\n\n inline idSysF = \\x : A => x;\n\n inline runIdSysF = \\f {\n |< f : A -> A >|\n };\n\n inline id = runIdSysF !idSysF;\n\n type natural = A -> (A -> A) -> A;\n\n inline zero<> : natural;\n inline zero = \\z : A => \\inc : A -> A => z;\n\n inline inc<> : natural -> natural;\n inline inc = \\n => \\z : A => \\inc : A -> A => inc !(|< n : natural >| !z !inc);\n\n inline one<> : natural;\n inline one = inc !zero;\n\n inline two<> : natural;\n inline two = inc !one;\n};\n\nmodule varSub = {\n inline sub, A : region, B : region >= A, C:type>\n : R in A -> R in B -> C -[linear]> C;\n inline sub = \\a => \\b => \\x => x;\n\n\n inline cycle = \\a => \\b => \\c {\n sub !a !b !(\n sub !b !c !(\n sub !c !a !(\n \\x => x\n )\n )\n )\n };\n};\n\nmodule default = {\n add = function(x,y) {\n x + y\n };\n\n ambigous = function(x) {\n inline y = 1;\n x\n };\n};\n\nmodule unit = {\n idUnit = function () {\n ()\n };\n};\n\nmodule boolean = {\n inline yes = true;\n\n branch = function(b) {\n if b {\n 1\n } else {\n 2\n }\n };\n\n complex = function(b) {\n if (if (b) { true } else {false} ) {\n 1\n } else {\n if yes {\n 2\n } else {\n 4\n }\n }\n };\n\n not = function(b) {\n !b\n };\n\n inBounds = function(x1, x2, x3) {\n x1 <= x2 & x2 < x3\n };\n};\n\nmodule pair = {\n fst = function(x, y) => x;\n\n snd = function(x, y) => y;\n \n pattern = function (pair) {\n (fst(pair), snd(pair))\n };\n};\n\nmodule ptr = {\n derefTriple = function(x) {\n ***x\n };\n\n deref = RA, T : pretype> : function (T* @ RA) => T uses RB;\n deref = RA, T : pretype> = function (x) {\n *x\n };\n\n write= A> : function(int* @ A) => () uses B;\n write= A> = function(x :: int* @ A) {\n *x = (1 :: int)\n };\n\n writeTriple = function(x) {\n ***x = 1 \n };\n\n swap = function(x,y) {\n let xp = *x;\n *x = (*y);\n *y = xp;\n ()\n };\n};\n\n\nmodule number = {\n type point = (int, int, int);\n\n dotProduct : function(point, point) => int uses R;\n dotProduct = function((x1,y1,z1), (x2, y2, z2)) {\n (x1 * x2 + y1 * y2 + z1 * z2)\n };\n \n mid : function(uint, uint) => uint uses R;\n mid = function(x,y) {\n (x + y) / 2\n };\n\n inline divGen = function(x,y) {\n (x + y - 1) / y\n };\n\n div = divGen;\n\n lessEqual = function(x,y) {\n x <= y\n };\n\n factorial : function(ulong) => ulong uses R; \n factorial = function(x) {\n if (x == 0) {\n 1\n } else {\n x * factorial (x - 1) \n }\n };\n};\n\nmodule fptr = {\n call = function(f) {\n f (1)\n };\n\n callUnit : function(function*(uint) => () uses R) => () uses R;\n callUnit = function(f) {\n f (2)\n };\n};\n\nmodule recurse = {\n explode> : function() => A uses R;\n explode> = function() {\n explode ()\n };\n};\n\nmodule world = {\n inline putchar : function*(int) => int uses io in A;\n inline putchar = extern \"putchar\";\n\n putPtr= io> : function(int* @ A) => int uses A;\n putPtr = function(ptr) {\n putchar (*ptr)\n };\n};\nmodule arrays = {\n inline get = \\x => \\i {\n * &* &x[i]\n };\n\n inline set = \\x => \\i => \\a {\n * &* &x[i] = a\n };\n\n swap = function(a, b, i) {\n let tmp = get !a !i;\n set !a !i !(get !b !i);\n set !b !i !tmp;\n ()\n };\n\n memcpyPtr = function(dst, src, i) {\n loop (let (dst, src, i) = (dst, src, i)) {\n if(i != 0) {\n * &* dst = (* &* src);\n continue (&dst[1], &src[1], i - 1)\n } else {\n break ()\n }\n }\n };\n};\n\nmodule sort = {\n\n inline get = /arrays/get;\n\n inline set = /arrays/set;\n\n insert : function(int[] @ R, unsigned integer(native)) => () uses R;\n insert = function(array, index) {\n loop (let (array, index) = (array,index)) {\n if (index > 0 & get !array !index < get !array !(index - 1) ) {\n let tmp = get !array !index;\n set !array !index !(get !array !(index - 1));\n set !array !(index - 1) !tmp;\n continue (array, index - 1)\n } else {\n break ()\n }\n }\n };\n\n sort : function(int[] @ R, unsigned integer(native)) => () uses R;\n sort = function(array, length) {\n if (length > 1) {\n sort(array, length - 1);\n insert(array, length - 1)\n } else {\n ()\n }\n };\n};\n\nmodule borrowed = {\n increment : function(unique int*) => unique int* uses R;\n increment = function(p :: unique int*) {\n let ((), p) = borrow p as = R>(x :: int* @ A) {\n *x = (*x + 1)\n };\n p\n };\n};\n\nmodule partial = {\n inline auto = \\x => x;\n \n inline semi = \\x : A => x;\n\n inline scoped : A -> A;\n inline scoped = \\x : A => x;\n\n inline manual : A -> A;\n inline manual = \\x => x;\n};\n\nmodule import = {\n inline id = \\x => x;\n module b = {\n inline const = \\y => /import/id;\n };\n};\n\nmodule levity = {\n idPolyPair> = function(x :: A) {\n x\n };\n\n idPolyUnion> = function(x :: A) {\n x\n };\n\n useId = function(ptr) {\n idPolyPair(ptr, 0)\n };\n};\n\nmodule sum = {\n triangular = function(start, end) {\n loop (let (i, total) = (start, 0)) {\n if (i <= end) {\n continue (i + 1, total + i)\n } else {\n break (total)\n }\n }\n };\n};\n\nmodule newtype = {\n wrapper num : pretype<32bit word, unrestricted>;\n wrapper num = int;\n\n makeNum = function() {\n wrap 1 :: num\n };\n\n\n wrapper linked : pretype;\n wrapper linked = linked2* @ io;\n\n type linked2 = linked;\n\n read = function (x) {\n *unwrap (x :: linked)\n };\n};" ], "githubRepo": { "stars": 41, "forks": 0, "subscribers": 5, "created": 2020, "updated": 2022, "description": "[Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions.", "url": "https://github.com/Superstar64/aith" }, "repoStats": { "firstCommit": 2020, "commits": 349, "committers": 1, "files": 33 } }, "akl": { "title": "AKL", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3cf082430cf623f49eed237d0b0e153b0fcde890" ], "originCommunity": [ "Swedish Institute of Computer Science" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1610", "centralPackageRepositoryCount": 0 }, "al": { "title": "AL", "appeared": 2016, "type": "pl", "creators": [ "Microsoft" ], "originCommunity": [ "Microsoft" ], "githubRepo": { "firstCommit": 2016, "stars": 574, "forks": 240, "subscribers": 150, "created": 2016, "updated": 2022, "description": "AL language code samples for developing extensions for Dynamics 365 Business Central", "issues": 489, "url": "https://github.com/microsoft/AL" }, "repoStats": { "firstCommit": 2016, "commits": 338, "committers": 63, "files": 100 } }, "aladin": { "title": "ALADIN", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ca5687e271a47aa04310374c184689cf9fca5c14" ], "originCommunity": [ "University of Grenoble" ], "hopl": "https://hopl.info/showlanguage.prx?exp=537", "centralPackageRepositoryCount": 0 }, "alambik": { "title": "Alambik", "appeared": 2011, "type": "pl", "reference": [ "http://light.alambik.com/intro.htm" ], "originCommunity": [ "Alambik Limited" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8507", "centralPackageRepositoryCount": 0 }, "alan": { "title": "alan", "appeared": 2018, "type": "pl", "website": "https://alan-platform.com/pages/tuts/introducing.html", "originCommunity": [ "Kjerner" ], "example": [ "'Reasons': collection { }\n'Users': collection {\n 'Name': text\n 'Active': stategroup @default: 'Yes' (\n 'Yes' -> { }\n 'No' -> {\n 'Reason': text -> ?^ .^ .'Reasons'\n }\n )\n}\n'Active Users':= integer 'n' = count .'Users'?'Active'|'Yes'" ], "fileType": "text", "wordRank": 3609, "centralPackageRepositoryCount": 0 }, "alba": { "title": "ALBA", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d0e28ee8b34841bba52b9183cd0b19ebd23aec72" ], "originCommunity": [ "Universidad Politécnica de Madrid", "Campus de Montegancedo" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4670", "centralPackageRepositoryCount": 0 }, "albatross": { "title": "albatross", "appeared": 2015, "type": "pl", "description": "Albatross is A Programming Language with Static Verification: You can develop programs and algorithms and prove them to be correct in Albatross", "website": "http://albatross-lang.sourceforge.net", "domainName": { "name": "albatross-lang.sourceforge.net" }, "example": [ "use alba.base.boolean\nend\nall (a:BOOLEAN)\nrequire\n a\nensure\n a\nend" ], "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n10034741|Albatross – A Programming Language with Static Verification|http://albatross-lang.sourceforge.net|2015-08-10 14:19:08 UTC|1439216348|helmut_brandl|7|15" }, "alcor": { "title": "ALCOR", "appeared": 1959, "type": "pl", "originCommunity": [ "ALCOR Group" ], "wikipedia": { "related": [ "algol-60" ], "summary": "For the cryonics organization, see Alcor Life Extension Foundation. ALCOR is a radar tracking station in Roi-Namur island in the north part of the Kwajalein atoll in the Marshall Islands.ALCOR is an early computer language definition created by the ALCOR Group, a consortium of universities, research institutions and manufacturers in Europe and the United States which was founded in 1959 and which had 60 members in 1966. The group had the aim of a common compiler specification for a subset of ALGOL 60 after the ALGOL meeting in Copenhagen in 1958.", "created": 2006, "backlinksCount": 12, "pageId": 4862582, "revisionCount": 26, "dailyPageViews": 5, "url": "https://en.wikipedia.org/wiki/ALCOR" }, "hopl": "https://hopl.info/showlanguage.prx?exp=360", "centralPackageRepositoryCount": 0 }, "aldat": { "title": "Aldat", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/53e758569fbf74a0f14f7fc08e7a554b3ff6a603" ], "originCommunity": [ "McGill University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1453", "centralPackageRepositoryCount": 0 }, "aldes": { "title": "ALDES", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f220d5342d2a16667111a855951b0ab9e6de1eab" ], "originCommunity": [ "Universität Tübingen" ], "hopl": "https://hopl.info/showlanguage.prx?exp=705", "centralPackageRepositoryCount": 0, "isbndb": "" }, "aldor": { "title": "Aldor", "appeared": 1990, "type": "pl", "creators": [ "Richard Dimick Jenks", "Barry Trager", "Stephen Watt", "James Davenport", "Robert Sutor", "Scott Morrison" ], "website": "http://www.aldor.org", "country": [ "United Kingdom" ], "originCommunity": [ "Western University" ], "domainName": { "registered": 2000, "awisRank": { "2022": 5414963 }, "name": "aldor.org" }, "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "lineCommentToken": [ [ "--" ] ], "wikipedia": { "example": [ "#include \"aldor\"\n#include \"aldorio\"\n\nimport from Integer, String;\n\nbob(n: Integer): String == {\n b: String := \" bottle\";\n\n if n ~= 1 then b := b + \"s\";\n b + \" of beer\";\n}\n\nmain(): () == {\n n: Integer := 99;\n otw: String := \" on the wall\";\n\n -- refrain\n while n > 0 repeat {\n stdout << n << bob(n) << otw << \", \" << n << bob(n) << \".\" << newline;\n stdout << \"Take one down and pass it around, \";\n n := n - 1;\n if n > 0 then stdout << n;\n else stdout << \"no more\";\n stdout << bob(n) << otw << \".\" << newline;\n stdout << newline;\n }\n\n -- last verse\n stdout << \"No more\" << bob(n) << otw << \", no more\" << bob(n) << \".\" << newline;\n stdout << \"Go to the store and buy some more, \";\n n: Integer := 99;\n stdout << n << bob(n) << otw << \".\" << newline;\n}\n\nmain();" ], "related": [ "linux", "solaris", "pascal", "haskell", "python" ], "summary": "Aldor is a programming language. It is the successor of A# as the extension language of the Axiom computer algebra system. Aldor combines imperative, functional, and object-oriented features. It has an elaborate type system,\"Aldor Programming Language\". Aldor.org. Retrieved 12 February 2017. allowing types to be used as first-class values. Aldor's syntax is heavily influenced by Pascal, but it is optionally indentation-sensitive, using whitespace characters and the off-side rule, like Python. In its current implementation, it is compiled, but an interactive listener is provided. Aldor is distributed as free and open-source software, under the Apache License 2.0.", "pageId": 948551, "created": 2004, "backlinksCount": 23, "revisionCount": 63, "dailyPageViews": 12, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Aldor" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6911", "jupyterKernel": [ "https://github.com/mattpap/IAldor" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "aldwych": { "title": "Aldwych", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/14d06667f8244f4863ab4b970a9671fa7f0c9042" ], "originCommunity": [ "Queen Mary", "Westfield College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6179", "centralPackageRepositoryCount": 0 }, "ale": { "title": "a Lisp Environment", "appeared": 2019, "type": "pl", "creators": [ "Thomas Bradford" ], "website": "https://www.ale-lang.org/", "standsFor": "a Lisp Environment", "domainName": { "registered": 2019, "name": "ale-lang.org" }, "githubRepo": { "firstCommit": 2019, "stars": 152, "created": 2019, "updated": 2022, "description": "Ale is a Lisp Environment for Go applications", "forks": 6, "subscribers": 4, "issues": 3, "url": "https://github.com/kode4food/ale" }, "repoStats": { "firstCommit": 2019, "commits": 398, "committers": 5, "files": 368 } }, "alec": { "title": "ALEC", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2df0ee436bc530c09295eef4354c9c040d03e55b" ], "originCommunity": [ "The University of Manchester" ], "hopl": "https://hopl.info/showlanguage.prx?exp=279", "centralPackageRepositoryCount": 0 }, "alef": { "title": "ALEF", "appeared": 1992, "type": "pl", "creators": [ "Phil Winterbottom" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "example": [ "(int, byte*, byte) \nfunc() \n{ \n return (10, \"hello\", ’c’); \n}\n\nvoid \nmain() \n{\n int a; \n byte* str; \n byte c; \n (a, str, c) = func(); \n}" ], "related": [ "c", "newsqueak", "limbo", "rust", "go", "csp" ], "summary": "Alef is a discontinued concurrent programming language, designed as part of the Plan 9 operating system by Phil Winterbottom of Bell Labs. It implemented the channel-based concurrency model of Newsqueak in a compiled, C-like language.", "pageId": 1935217, "created": 2005, "backlinksCount": 87, "revisionCount": 78, "dailyPageViews": 39, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Alef_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1799", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "aleph": { "title": "ALEPH", "appeared": 1992, "type": "pl", "reference": [ "http://wiki.c2.com/?AlephLanguage" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1801", "centralPackageRepositoryCount": 0 }, "alf": { "title": "Algebraic Logic Functional", "appeared": 1990, "type": "pl", "standsFor": "Algebraic Logic Functional", "country": [ "Germany" ], "originCommunity": [ "Carnegie Mellon University", "University of Kiel" ], "visualParadigm": false, "wikipedia": { "related": [ "c", "unix" ], "summary": "Algebraic Logic Functional programming language, also known as ALF, is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming. ALF was designed to be genuine integration of both programming paradigms, and thus any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF's operational semantics is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. In order to reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which, it is claimed, can be efficiently implemented. Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top. Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than Prolog's resolution strategy. Similarly to Prolog, ALF uses a backtracking strategy corresponding to a depth-first search in the derivation tree. The ALF system was designed to be an efficient implementation of the combination of resolution, narrowing, rewriting, and rejection. ALF programs are compiled into instructions of an abstract machine. The abstract machine is based on the Warren Abstract Machine (WAM) with several extensions to implement narrowing and rewriting. In the current ALF implementation programs of this abstract machine are executed by an emulator written in C. In the Carnegie Mellon University Artificial Intelligence Repository, ALF is included as an AI programming language, in particular as a functional/logic programming language Prolog implementation. A user manual describing the language and the use of the system is available. The ALF System runs under Unix and is free.", "pageId": 11868019, "created": 2004, "backlinksCount": 8, "revisionCount": 42, "dailyPageViews": 10, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Algebraic_Logic_Functional_programming_language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1804", "fileType": "text", "centralPackageRepositoryCount": 0 }, "alfred": { "title": "alfred", "appeared": 1972, "type": "pl", "website": "https://www.alfredapp.com/", "reference": [ "https://medium.com/@nikitavoloboev/writing-alfred-workflows-in-go-2a44f62dc432" ], "wikipedia": { "summary": "alfred is an application launcher and productivity application for macOS. Alfred is free, though an optional paid upgrade ('Powerpack') is available. Using a keyboard shortcut chosen by the user, Alfred provides a quick way to find and launch applications and files on the Mac or to search the web both with predefined keywords for often-used sites such as Amazon.com, IMDb, Wikipedia and many others, with the ability to add users' custom searches for the sites most applicable to them.", "created": 2010, "url": "https://en.wikipedia.org/wiki/Alfred_(software)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2926", "wordRank": 7505, "centralPackageRepositoryCount": 0 }, "algae": { "title": "Algae", "appeared": 1997, "type": "pl", "reference": [ "http://algae.sourceforge.net/" ], "originCommunity": [ "Boeing" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "printf" ] ], "leachim6": { "filepath": "a/Algae.algae", "fileExtensions": [ "algae" ], "example": [ "printf(\"Hello World\\n\");\n" ], "id": "Algae" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Algae", "hopl": "https://hopl.info/showlanguage.prx?exp=2713", "centralPackageRepositoryCount": 0 }, "algebraic-compiler": { "title": "Algebraic Compiler", "appeared": 1958, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7288833a8aa41499dcd75e1e62380aac13f1529e" ], "originCommunity": [ "Computer Usage Company, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5087", "centralPackageRepositoryCount": 0 }, "algebraic-modeling-language": { "title": "Algebraic modeling language", "appeared": 1980, "type": "pl", "originCommunity": [ "IBM" ], "wikipedia": { "related": [ "aimms", "ampl", "general-algebraic-modeling-system" ], "summary": "Algebraic modeling languages (AML) are high-level computer programming languages for describing and solving high complexity problems for large scale mathematical computation (i.e. large scale optimization type problems). One particular advantage of some algebraic modeling languages like AIMMS, AMPL, GAMS,MathProg, Mosel, and OPL is the similarity of their syntax to the mathematical notation of optimization problems. This allows for a very concise and readable definition of problems in the domain of optimization, which is supported by certain language elements like sets, indices, algebraic expressions, powerful sparse index and data handling variables, constraints with arbitrary names. The algebraic formulation of a model does not contain any hints how to process it. An AML does not solve those problems directly; instead, it calls appropriate external algorithms to obtain a solution. These algorithms are called solvers and can handle certain kind of mathematical problems like: linear problems integer problems (mixed integer) quadratic problems mixed complementarity problems mathematical programs with equilibrium constraints constrained nonlinear systems general nonlinear problems non-linear programs with discontinuous derivatives nonlinear integer problems global optimization problems stochastic optimization problems", "created": 2007, "backlinksCount": 45, "pageId": 9463527, "revisionCount": 93, "dailyPageViews": 20, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Algebraic_modeling_language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=882", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "algem": { "title": "ALGEM", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/32d41265e6f04ad1fc604e4ad7b159c281e8cb33" ], "originCommunity": [ "University of Toronto" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2884", "centralPackageRepositoryCount": 0 }, "algernon": { "title": "ALGERNON", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0aa12622d2b452aaf449f1f3a9d1b5794c136dba" ], "originCommunity": [ "University of Oregon", "The University of Texas at Austin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7728", "centralPackageRepositoryCount": 0 }, "algo": { "title": "ALGO", "appeared": 1958, "type": "pl", "originCommunity": [ "Bendix Corporation" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "PRINT" ] ], "wikipedia": { "example": [ "1 TITLE TRABB PARDO-KNUTH ALGORITHM\n 2 SUBSCript I,J\n 3 DATA A(11)\n 4 FORMAt FI(2DT), FLARGE(3D)\n 5 PROCEDURE F(T=Z)\n 6 BEGIN\n 7 Z=SQRT(ABS(T))+5*T^3\n 8 END\n 9 FOR I=0(1)10\n10 A[I]=KEYBD\n11 FOR J=0(1)10 BEGIN\n12 I=J-10\n13 F(A[I]=Y)\n14 PRINT(FI)=I\n15 IF Y > 400\n16 GO TO LARGE\n17 PRINT(FL)=Y\n18 GO TO NEXT\n19 LARGE: PRINT(FLARGE)=999\n20 NEXT: CARR(1) END\n21 2END" ], "related": [ "algol-60", "neliac", "algol-58" ], "summary": "ALGO is an algebraic programming language developed between 1959 and 1961 for the Bendix G-15 computer. ALGO was one of several programming languages inspired by the Preliminary Report on the Language written in Zürich in 1958. This report underwent several modifications before becoming the Revised Report on which most ALGOL implementations are based. As a result, ALGO and other early \"ALGOLs\" have a very different syntax from ALGOL 60. Other languages developed from the Zürich report include BENJAMIN, MAD (Michigan Algorithm Decoder) and NELIAC.", "created": 2004, "backlinksCount": 36, "pageId": 1149655, "revisionCount": 224, "dailyPageViews": 43, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/ALGO" }, "centralPackageRepositoryCount": 0 }, "algobox": { "title": "algobox", "appeared": 2011, "type": "pl", "website": "https://www.xm1math.net/algobox/", "reference": [ "https://www.algoboxpro.com/" ], "country": [ "France" ], "wikipedia": { "summary": "algobox is an easy-to-use pedagogical software for initiation to algorithms, distributed under the GNU/GPL license. It is available for free for Linux, macOS and Windows platforms and can even run on a simple USB key. Using an algorithmic language in French and a simple and ergonomic graphical user interface, this software makes it easy to design and test algorithms that may be encountered in secondary school mathematics education.", "dailyPageViews": -1, "created": 2020, "url": "https://fr.wikipedia.org/wiki/Algobox" }, "centralPackageRepositoryCount": 0 }, "algol-58": { "title": "ALGOL 58", "appeared": 1958, "type": "pl", "originCommunity": [ "Association for Computing Machinery", "Gesellschaft für Angewandte Mathematik und Mechanik" ], "wikipedia": { "related": [ "algol", "algol-60", "act-iii", "jovial", "neliac", "algo", "ada", "mad" ], "summary": "ALGOL 58, originally known as IAL, is one of the family of ALGOL computer programming languages. It was an early compromise design soon superseded by ALGOL 60. According to John Backus \"The Zurich ACM-GAMM Conference had two principal motives in proposing the IAL: (a) To provide a means of communicating numerical methods and other procedures between people, and (b) To provide a means of realizing a stated process on a variety of machines...\" ALGOL 58 introduced the fundamental notion of the compound statement, but it was restricted to control flow only, and it was not tied to identifier scope in the way that Algol 60's blocks were.", "pageId": 944870, "created": 2004, "backlinksCount": 101, "revisionCount": 133, "dailyPageViews": 78, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/ALGOL_58" }, "hopl": "https://hopl.info/showlanguage.prx?exp=17", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "algol-60": { "title": "ALGOL 60", "appeared": 1960, "type": "pl", "creators": [ "John Backus", "Friedrich L. Bauer", "Julien Green", "Charles Katz", "John McCarthy", "Peter Naur", "Alan Perlis", "Heinz Rutishauser", "Klaus Samelson", "Adriaan van Wijngaarden", "Bernard Vauquois", "Joseph Henry Wegstein", "Michael Woodger" ], "description": "ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family of computer programming languages. It followed on from ALGOL 58 which had introduced code blocks and the begin and end pairs for delimiting them. ALGOL 60 was the first language implementing nested function definitions with lexical scope. It gave rise to many other programming languages, including CPL, Simula, BCPL, B, Pascal and C.", "documentation": [ "http://www.algol60.org/4documentation.htm" ], "originCommunity": [ "International Federation for Information Processing" ], "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "WRITE" ] ], "stringToken": [ [ "\"" ] ], "example": [ "procedure Absmax(a) Size:(n, m) Result:(y) Subscripts:(i, k);\n value n, m; array a; integer n, m, i, k; real y;\ncomment The absolute greatest element of the matrix a, of size n by m,\n is transferred to y, and the subscripts of this element to i and k;\nbegin\n integer p, q;\n y := 0; i := k := 1;\n for p := 1 step 1 until n do\n for q := 1 step 1 until m do\n if abs(a[p, q]) > y then\n begin y := abs(a[p, q]);\n i := p; k := q\n end\nend Absmax " ], "wikipedia": { "example": [ "'PROGRAM' (HELLO)\n 'BEGIN'\n 'COMMENT' OPEN QUOTE IS '(', CLOSE IS ')', PRINTABLE SPACE HAS TO\n BE WRITTEN AS % BECAUSE SPACES ARE IGNORED;\n WRITE TEXT('('HELLO%WORLD')');\n 'END'\n 'FINISH'" ], "related": [ "algol-58", "simula", "cpl", "pascal", "ada", "c", "algol", "cpl", "bcpl", "b", "algol-w", "algol-68", "cobol", "scheme", "lisp", "synchronized-multimedia-integration-language", "act-iii", "elliott-algol", "espol", "newp", "algol-n", "atlas-autocode", "coral", "edinburgh-imp", "iswim", "jovial", "neliac", "s-algol" ], "summary": "ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family of computer programming languages. It followed on from ALGOL 58 which had introduced code blocks and the begin and end pairs for delimiting them. ALGOL 60 was the first language implementing nested function definitions with lexical scope. It gave rise to many other programming languages, including CPL, Simula, BCPL, B, Pascal and C. Niklaus Wirth based his own ALGOL W on ALGOL 60 before moving to develop Pascal. Algol-W was intended to be the next generation ALGOL but the ALGOL 68 committee decided on a design that was more complex and advanced rather than a cleaned simplified ALGOL 60. The official ALGOL versions are named after the year they were first published. Algol 68 is substantially different from Algol 60 and was criticised partially for being so, so that in general \"Algol\" refers to dialects of Algol 60.", "pageId": 692878, "created": 2004, "backlinksCount": 884, "revisionCount": 130, "dailyPageViews": 248, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/ALGOL_60" }, "leachim6": { "filepath": "a/ALGOL 60.algol60", "example": [ "BEGIN\n FILE F(KIND=REMOTE);\n EBCDIC ARRAY E[0:11];\n REPLACE E BY \"HELLO WORLD\";\n WRITE(F, *, E);\nEND.\n" ], "id": "ALGOL 60" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1807", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nprimer of ALGOL 60 programming.|1962|Edsger W. Dijkstra|3175934|4.25|4|1\nAlgol 60 Implementation: The Translation And Use Of Algol 60 Programs On A Computer||B. Randell|4237805|4.00|1|1\nCourse In Programming Algol 60 (Science Paperbacks)||Michael Wells|9980602|0.0|0|0\nHandbook and Guide for Comparing and Selecting Computer Languages: Basic, FORTRAN, PASCAL, COBOL, PL/1, APL, ALGOL-60, C|1985|James R. Ogden|3280647|0.0|0|0\nCompilers by Programming Language: ALGOL 60 Compilers, Assemblers, Basic Compilers, C++ Compilers, Cfml Compilers, C Compilers|2010|Books Group|15842336|0.0|0|0", "isbndb": "", "semanticScholar": "" }, "algol-68-r": { "title": "ALGOL 68-R", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/32fd282fa40e4cbb20eca00e57805a298598bb0a" ], "originCommunity": [ "Royal Radar Establishment" ], "wikipedia": { "example": [ "[1 : 120] CHAR buff;\nINT unitnumber;\nSTRUCT (BITS typemode, reply, INT count, REF CHAR address)\n control area := (8r47400014,0,120,buff[1]);\n...;\nCODE 0,6/unitnumber; 157,6/typemode OF control area EDOC" ], "related": [ "algol-68", "punched-tape" ], "summary": "ALGOL 68-R was the first implementation of the Algorithmic language ALGOL 68. In December 1968 the report on the Algorithmic language ALGOL 68 was published. On 20–24 July 1970 a working conference was arranged by the IFIP to discuss the problems of implementation of the language, a small team from the Royal Radar Establishment attended to present their compiler, written by I.F. Currie, Susan G. Bond and J.D. Morrison. In the face of estimates of up to 100 man-years to implement the language, using up to 7 pass compilers they described how they had already implemented a one-pass compiler which was in production use in engineering and scientific applications.", "backlinksCount": 8, "pageId": 8632932, "dailyPageViews": 5, "created": 2006, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/ALGOL_68-R" }, "hopl": "https://hopl.info/showlanguage.prx?exp=489", "centralPackageRepositoryCount": 0 }, "algol-68-rt": { "title": "ALGOL 68-RT", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/36048a45e78767ce6398d2790bf0aeeb08fd5170" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6134", "centralPackageRepositoryCount": 0 }, "algol-68": { "title": "ALGOL 68", "appeared": 1968, "type": "pl", "originCommunity": [ "International Federation for Information Processing" ], "hasDirectives": { "example": ".PR POINT .PR\n.PR UPPER .PR\n.PR RES .PR\n'pr' quote 'pr'", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "proc test = (real a, b) :...\n...\ntest (x plus 1, x);" ], "related": [ "algol-68-r", "flacc", "algol-60", "c", "bourne-shell", "bash", "python", "seed7", "mary", "s3", "s-algol", "pascal", "unix", "perl", "lisp", "unicode", "bcpl", "algol", "ascii", "java", "jovial", "simula", "coral", "pearl", "rtl-2", "hal-s", "fortran", "cobol", "cms-2", "bliss", "algol-w", "sparc", "solaris", "multics", "algol-n", "ada" ], "summary": "ALGOL 68 (short for Algorithmic Language 1968) is an imperative computer programming language that was conceived as a successor to the ALGOL 60 programming language, designed with the goal of a much wider scope of application and more rigorously defined syntax and semantics. The contributions of ALGOL 68 to the field of computer science have been deep, wide ranging and enduring, although many of these contributions were only publicly identified when they had reappeared in subsequently developed programming languages.", "pageId": 692880, "created": 2004, "backlinksCount": 246, "revisionCount": 813, "dailyPageViews": 121, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/ALGOL_68" }, "leachim6": { "filepath": "a/ALGOL 68.algol68", "example": [ "begin\n print((\"Hello World\",newline))\nend\n" ], "id": "ALGOL 68" }, "hopl": "https://hopl.info/showlanguage.prx?exp=311", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nIntroductory Algol 68 Programming|1979|D. F Brailsford|3545644|0.0|0|0\nProgramming And Problem Solving In Algol 68||Andrew John Theodore Colin|1152893|4.00|1|0\nA Practical Guide to Algol 68 (Wiley Series in Computing)|1976|Frank G. Pagan|1912869|0.0|0|0", "isbndb": "", "semanticScholar": "" }, "algol-e": { "title": "ALGOL-E", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b5f479facfa6fda421c75f08f080cd0e0a4bbdbd" ], "originCommunity": [ "Naval Postgraduate School" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5313", "centralPackageRepositoryCount": 0 }, "algol-n": { "title": "ALGOL N", "appeared": 1967, "type": "pl", "wikipedia": { "related": [ "algol-60", "algol-68" ], "summary": "ALGOL N is the name of a successor to ALGOL 60 designed in Japan with the aim of being as powerful as ALGOL 68 but as simple as ALGOL 60. The language was proposed by Nobuo Yoneda. Algol N tried to use extensibility in order to solve the problem that programming language designers faced when trying to make an inextensible language for everything or having to make many languages, one for each domain. It avoided coercion while not making things difficult for programmers. The letter 'N' is short for 'Nippon', or Japan in Japanese.", "created": 2004, "backlinksCount": 7, "pageId": 946649, "revisionCount": 21, "dailyPageViews": 3, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/ALGOL_N" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1809", "centralPackageRepositoryCount": 0 }, "algol-w": { "title": "ALGOL W", "appeared": 1966, "type": "pl", "originCommunity": [ "Stanford University" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "write" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "RECORD PERSON (\n STRING(20) NAME; \n INTEGER AGE; \n LOGICAL MALE; \n REFERENCE(PERSON) FATHER, MOTHER, YOUNGESTOFFSPRING, ELDERSIBLING\n);\n\nREFERENCE(PERSON) PROCEDURE YOUNGESTUNCLE (REFERENCE(PERSON) R);\n BEGIN\n REFERENCE(PERSON) P, M;\n P := YOUNGESTOFFSPRING(FATHER(FATHER(R)));\n WHILE (P ¬= NULL) AND (¬ MALE(P)) OR (P = FATHER(R)) DO\n P := ELDERSIBLING(P);\n M := YOUNGESTOFFSPRING(MOTHER(MOTHER(R)));\n WHILE (M ¬= NULL) AND (¬ MALE(M)) DO\n M := ELDERSIBLING(M);\n IF P = NULL THEN \n M \n ELSE IF M = NULL THEN \n P \n ELSE \n IF AGE(P) < AGE(M) THEN P ELSE M\n END" ], "related": [ "algol-60", "pascal", "modula-2" ], "summary": "ALGOL W is a programming language. It is based on a proposal for ALGOL X by Niklaus Wirth and Tony Hoare as a successor to ALGOL 60 in IFIP Working Group 2.1. When the committee decided that the proposal was not a sufficient advance over ALGOL 60, the proposal was published as A contribution to the development of ALGOL. After making small modifications to the language Wirth supervised a high quality implementation for the IBM/360 at Stanford University that was widely distributed.It represented a relatively conservative modification of ALGOL 60, adding string, bitstring, complex number and reference to record datatypes and call-by-result passing of parameters, introducing the while statement, replacing switch with the case statement, and generally tightening up the language. The implementation was written in PL/360, an ALGOL-like assembly language designed by Wirth. The implementation includes influential debugging and profiling abilities.", "pageId": 211058, "created": 2003, "backlinksCount": 41, "revisionCount": 107, "dailyPageViews": 29, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/ALGOL_W" }, "leachim6": { "filepath": "a/ALGOL W.algol", "example": [ "begin\n write( \"Hello World\" )\nend.\n" ], "id": "ALGOL W" }, "hopl": "https://hopl.info/showlanguage.prx?exp=243", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nStructured Programming And Problem Solving With Algol W||Richard B. Kieburtz|4755689|0.0|0|0", "isbndb": "" }, "algol-x": { "title": "ALGOL X", "appeared": 1963, "type": "pl", "originCommunity": [ "International Federation for Information Processing" ], "wikipedia": { "backlinksCount": 14, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/ALGOL_X" }, "hopl": "https://hopl.info/showlanguage.prx?exp=362" }, "algol": { "title": "Algol", "appeared": 1958, "type": "pl", "documentation": [ "https://public.support.unisys.com/aseries/docs/clearpath-mcp-17.0/pdf/86000098-515.pdf" ], "originCommunity": [ "Swiss Federal Institute of Technology" ], "hasAssignment": { "example": "", "value": true }, "assignmentToken": [ [ ":=" ] ], "wikipedia": { "example": [ "'BEGIN'\n WRITE TEXT('('HELLO%WORLD')');\n 'END'" ], "related": [ "pl-i", "simula", "bcpl", "b", "pascal", "c", "lisp", "cobol", "algol-58", "algol-60", "algol-68", "algol-w", "scheme", "ml", "elliott-algol", "jovial", "ada", "act-iii", "s-algol", "espol", "newp", "ascii", "alcor", "unicode", "atlas-autocode", "coral", "edinburgh-imp", "iswim", "neliac" ], "summary": "ALGOL (short for Algorithmic Language) is a family of imperative computer programming languages, originally developed in the mid-1950s, which greatly influenced many other languages and was the standard method for algorithm description used by the ACM in textbooks and academic sources for more than thirty years. In the sense that the syntax of most modern languages is \"Algol-like\", it was arguably the most influential of the four high-level programming languages among which it was roughly contemporary: FORTRAN, Lisp, and COBOL. It was designed to avoid some of the perceived problems with FORTRAN and eventually gave rise to many other programming languages, including PL/I, Simula, BCPL, B, Pascal, and C. ALGOL introduced code blocks and the begin…end pairs for delimiting them. It was also the first language implementing nested function definitions with lexical scope. Moreover, it was the first programming language which gave detailed attention to formal language definition and through the Algol 60 Report introduced Backus–Naur form, a principal formal grammar notation for language design. There were three major specifications, named after the year they were first published: ALGOL 58 – originally proposed to be called IAL, for International Algebraic Language. ALGOL 60 – first implemented as X1 ALGOL 60 in mid-1960. Revised 1963. ALGOL 68 – introduced new elements including flexible arrays, slices, parallelism, operator identification. Revised 1973. Niklaus Wirth based his own ALGOL W on ALGOL 60 before developing Pascal. ALGOL-W was based on the proposal for the next generation ALGOL, but the ALGOL 68 committee decided on a design that was more complex and advanced, rather than a cleaned, simplified ALGOL 60. ALGOL 68 is substantially different from ALGOL 60 and was not well received, so that in general \"Algol\" means ALGOL 60 and dialects thereof.", "pageId": 1453, "dailyPageViews": 323, "created": 2001, "backlinksCount": 453, "revisionCount": 865, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/ALGOL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ALGOL", "rijuRepl": { "example": [ "print((\"Hello, world!\",new line))\n" ], "description": "Seminal imperative programming language which introduced lexical scope and formal grammar specification", "fileExtensions": [ "alg" ], "website": "http://algol68.sourceforge.net/", "gitRepo": "https://jmvdveer.home.xs4all.nl/en.algol-68-genie.html", "id": "https://riju.codes/algol" }, "tiobe": { "id": "Algol" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2966", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nprimer of ALGOL 60 programming.|1962|Edsger W. Dijkstra|3175934|4.25|4|1\nAlgol-Like Languages|1996|Peter O'Hearn|2919390|5.00|1|0\nAlgol 60 Implementation: The Translation And Use Of Algol 60 Programs On A Computer||B. Randell|4237805|4.00|1|1\nA Guide to Algol Programming|1962|Daniel D. McCracken|17235198|4.00|1|0\nIntroductory Algol 68 Programming|1979|D. F Brailsford|3545644|0.0|0|0\nProgramming: ALGOL,|1969|D.J. Malcolme-Lawes|5752079|0.0|0|0\nProgramming In Algol|1970|J.S. Rohl|3934447|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1971|Oxford University Press|ALGOL in brief: A short, practical guide to computer programming in ALGOL,|Ractliffe, J. F|9780198596103\n1969|Palgrave Macmillan|Programming by Case Studies: An Algol Primer (Introductory Monographs in Mathematics)|Chedzoy, O.B. and Ford, Sandra Elizabeth|9780333101469\n1974|Oxford University Computing Laboratory, Programming Research Group|The Mathematical Semantics Of Algol 60 (technical Monographs)|Peter Mosses|9780902928084\n1969|Pergamon|Programming - ALGOL (The Commonwealth and international library of science, technology, engineering, and liberal studies)|Malcolme-Lawes, D. J.|9780080063843\n1962-12T|John Wiley & Sons Inc|A Guide to Algol Programming|McCracken, Daniel D.|9780471582342\n1962-06-01T00:00:01Z|Academic Pr|Primer of Algol 60 Programming (Studies in Data Processing)|Dijkstra, Edsger W.|9780122162503\n1965|McGraw Hill|Elementary Programming and Algol|Nicol, Keith|9780070940093\n1978|Palgrave HE UK|Programming and Problem-Solving in Algol 68|Colin, Andrew John Theodore|9780333231159\n1979|Prentice Hall Europe (a Pearson Education company)|Introductory Algol 68 Programming (Computers and Their Applications)|Brailsford, D. F. and Walker, A. N.|9780853121275\n1967|StudentlitteraturOxford University Press|Introduction to Algol Programming|Erik Torgil. FrFoberg, Carl µEkman|9789144004433\n1977|Elsevier Science|Informal Introduction to Algol 68|Lindsey, C.H.|9780720407266\n1971|North-Holland Pub. Co|Informal introduction to ALGOL 68|Meulen, S. G. van der|9780720420487\n1971|North-Holland Pub. Co|ALGOL 68 implementation;: Proceedings of the IFIP Working Conference on ALGOL 68 Implementation, Munich, July 20-24, 1970||9780720420456\n1969|Pergamon Press|Programming - Algol|D. J. Malcolme-lawes|9780080063850\n1970|Manchester U.p.|Programming In Algol|Rohl, J. S. (jeffrey Soden)|9780719004438\n1972|Mcgraw-hill Education|Algol 60 Programming (computer Science)|R.f. Shepherd|9780070941427\n1978|Macmillan International Higher Education|Programming And Problem-solving In Algol 68||9781349035618\n1968|Hodder & Stoughton Ltd|Introduction To Algol Programming (applied Mathematics S.)|R. Wooldridge~john Fuller Ratcliffe|9780340047309\n1975|Prentice Hall|Structural Programming And Problem Solving With Algol|Richard B. Kieburtz|9780138547370\n2011||Articles On Algol Programming Language Family, Including|Hephaestus Books|9781243309327\n1979|Halsted Press|Introductory Algol 68 Programming (computers And Their Applications)|D. F Brailsford|9780470267462\n1977|Macmillan|Programming And Problem-solving In Algol 68 (macmillan Computer Science Series)|Andrew John Theodore Colin|9780333217160\n1978|Elsevier|Introduction To The Formal Definition Of Algol 68 (annual Review In Automatic Programming)|Andrew D. Mcgettrick|9780080230566\n2010||Compilers By Programming Language: Algol 60 Compilers, Assemblers, Basic Compilers, C++ Compilers, Cfml Compilers, C Compilers|Group and Books and LLC|9781157807247", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1959|Report on the Algorithmic Language ALGOL the ACM committee on programming languages and the GAMM committee on programming|10.1007/BF01386372|32|1|A. Perlis and K. Samelson|9bc8b52e7f794020396c16be28a0f05059d82309\n1996|Note on Algol and conservatively extending functional programming|10.1017/S0956796800001611|8|0|P. O'Hearn|1fde5780f1f1d2a66d21564055c0d7b2cea87d35\n1962|A string language for symbol manipulation based on ALGOL 60|10.1145/366243.366745|6|0|J. Wegstein and W. W. Youden|de114e46faae7eff6390d13b0a1b1b7870cb4139\n1978|ACM SIGPLAN history of programming languages conference ALGOL 60 language summary|10.1145/960118.808368|6|0|D. Gries|34160ce443581c856da9a88f54568c3a0ffe9225\n2014|Was Algol 60 the First Algorithmic Language?|10.1109/MAHC.2014.63|5|0|Helena Durnova and G. Alberts|d49f0f159489b5e8f5e8f5f92421db53333a135a\n2014|Algol in France: From Universal Project to Embedded Culture|10.1109/MAHC.2014.50|4|0|P. Mounier-Kuhn|a55277bc35bc95f75ceab9430ff54e22056fa2a2\n2018|Formal Semantics of ALGOL 60: Four Descriptions in their Historical Context|10.1007/978-3-319-97226-8_4|4|0|Troy K. Astarte and Cliff B. Jones|459991a691c41f07c13d1ab0b5a557af5e7e9b6a\n2014|Universality versus Locality: The Amsterdam Style of Algol Implementation|10.1109/MAHC.2014.61|3|0|G. Alberts and E. Daylight|2e12390a2189bb300264ffab2c1bb18e7d82c31b\n1969|Algol 68 as an extensible language|10.1145/1115858.1115861|3|0|B. J. Mailloux and J. Peck|583d31c9492594eb2cab69f89ed2ddaf0718c83e\n1976|Evaluation of ALGOL 68, JOVIAL J3B, PASCAL, SIMULA 67, and TACPOL vs. TINMAN Requirements for a Common High Order Programming Language.|10.21236/ada033893|3|0|J. Goodenough and C. McGowan and J. R. Kelly|be654e5389930136859ef4263619d9f59a5ee216\n1979|On expressing control and data structures in predicate logic language ALGOL M|10.1145/988078.988083|2|0|Alois Glanc|cc083f1a6f1fc2bffa21650b328432a563e50918\n1977|Algol 68 as an implementation language for portable interpreters|10.1145/800238.807143|2|0|F. G. Pagan|f50e9dd7c4875c9f774cf128a248c146a520d01d\n1977|ALGOL 68 and structured programming for learner-programmers|10.1145/800238.807156|2|0|B. Ratcliff|debb422575b38c120434704dff7b34bfd194fee4\n1975|On the Design of Programming Languages Including Mini ALgol 68|10.1007/3-540-07410-4_654|2|0|L. Ammeraal|296f3ef8d9f61ca57b7229bfe5cc9539a64ab7f1\n2014|Embracing the Algol Effort in Czechoslovakia|10.1109/MAHC.2014.51|1|0|Helena Durnova|3b9f5a3e7bb3fe20f3b5a4d6272099025a63b04b\n1983|The current programming language standards scene IV: The ALGOL languages|10.1016/0167-8051(83)90006-2|1|0|I. D. Hill|5ac44dc4ec61360f97ed6583735cca5302762d08\n1966|A course in Algol programming : including the revised report on the algorithmiclanguage Algol 60 : including the revised report on the algorithmic language Algol 60|10.1016/b978-1-4831-9780-7.50012-2|1|0|G. F. Schaefler|a7fd9e07f55ffdf9b9971405cc3bdc7fa7ff3132" }, "algy": { "title": "ALGY", "appeared": 1961, "type": "pl", "reference": [ "https://semanticscholar.org/paper/203833984d0cac5c9c4eedddd80e435812fdb23b" ], "originCommunity": [ "Philco Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=363", "centralPackageRepositoryCount": 0 }, "alice": { "title": "Alice", "appeared": 2000, "type": "pl", "website": "http://www.ps.uni-saarland.de/alice", "originCommunity": [ "Saarland University" ], "wikipedia": { "example": [ "fun fib 0 = 0\n | fib 1 = 1\n | fib n = spawn fib(n-1) + fib(n-2);" ], "related": [ "ml", "oz", "standard-ml", "haskell" ], "summary": "Alice ML is a programming language designed by the Programming Systems Laboratory at Saarland University, Saarbrücken, Germany. It is a dialect of Standard ML, augmented with support for lazy evaluation, concurrency (multithreading and distributed computing via remote procedure calls) and constraint programming.", "pageId": 30877972, "dailyPageViews": 48, "created": 2006, "backlinksCount": 36, "revisionCount": 94, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Alice_(programming_language)" }, "leachim6": { "filepath": "a/Alice.alice", "fileExtensions": [ "alice" ], "example": [ "\"dlroW olleH\"d&O`@\n" ], "id": "Alice" }, "tryItOnline": "alice", "fileType": "text", "wordRank": 5414, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011|Pearson|Learning to Program with Alice (w/ CD ROM)|Dann, Wanda and Pausch, Randy|9780132122474\n2006|Cengage Learning|Alice 2.0: Introductory Concepts and Techniques (Shelly Cashman Series)|Shelly, Gary B. and Cashman, Thomas J. and Herbert, Charles W.|9781418859343\n2008|Pearson|Programming with Alice and Java|Lewis, John and DePasquale, Peter|9780321512093\n2006|Course Technology|Alice in Action: Computing Through Animation (Introduction to Programming)|Adams, Joel|9781418837716\n2013|CreateSpace Independent Publishing Platform|Learning Java through Alice|Daly, Tebring and Wrigley, Eileen|9781491073933\n2014|Cengage Learning|Alice 3 in Action: Computing Through Animation|Adams, Joel|9781305175938" }, "aljabr": { "title": "ALJABR", "appeared": 1991, "type": "pl", "reference": [ "http://www.computeralgebra.nl/systemsoverview/general/aljabr.html" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1811", "centralPackageRepositoryCount": 0 }, "allegro-common-lisp": { "title": "Allegro Common Lisp", "appeared": 1986, "type": "pl", "creators": [ "John Foderaro" ], "website": "https://franz.com/products/allegrocl/", "documentation": [ "https://franz.com/support/documentation/current/doc/introduction.htm" ], "aka": [ "Allegro CL" ], "originCommunity": [ "Franz Inc" ], "releaseNotesUrl": "https://franz.com/support/documentation/current/doc/release-notes.htm", "isLisp": { "example": "", "value": true }, "example": [ "(defun foo (x)\n (loop for y in-sequence x collect (1+ y)))\n(foo '(1 2 3)) => (2 3 4)\n(foo #(1 2 3)) => (2 3 4)" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Allegro_Common_Lisp" } }, "allo": { "title": "ALLO", "appeared": 1995, "type": "pl", "reference": [ "https://camo.ici.ro/projects/allo/allo.htm" ], "originCommunity": [ "The Research Institute for Informatics" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4939", "centralPackageRepositoryCount": 0, "isbndb": "" }, "alloy": { "title": "Alloy", "appeared": 1997, "type": "pl", "website": "http://alloytools.org/", "originCommunity": [ "Massachusetts Institute of Technology" ], "domainName": { "registered": 2017, "awisRank": { "2022": 3455732 }, "name": "alloytools.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasIntegers": { "example": "// [0-9]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "// A file system object in the file system\nsig FSObject { parent: lone Dir }\n\n// A directory in the file system\nsig Dir extends FSObject { contents: set FSObject }\n\n// A file in the file system\nsig File extends FSObject { }\n\n// A directory is the parent of its contents\nfact { all d: Dir, o: d.contents | o.parent = d }\n\n// All file system objects are either files or directories\nfact { File + Dir = FSObject }\n\n// There exists a root\none sig Root extends Dir { } { no parent }\n\n// File system is connected\nfact { FSObject in Root.*contents }\n\n// The contents path is acyclic\nassert acyclic { no d: Dir | d in d.^contents }\n\n// Now check it for a scope of 5\ncheck acyclic for 5\n\n// File system has one root\nassert oneRoot { one d: Dir | no d.parent }\n\n// Now check it for a scope of 5\ncheck oneRoot for 5\n\n// Every fs object is in at most one directory\nassert oneLocation { all o: FSObject | lone d: Dir | o in d.contents }\n\n// Now check it for a scope of 5\ncheck oneLocation for 5" ], "wikipedia": { "related": [ "z-notation" ], "summary": "In computer science and software engineering, Alloy is a declarative specification language for expressing complex structural constraints and behavior in a software system. Alloy provides a simple structural modeling tool based on first-order logic. Alloy is targeted at the creation of micro-models that can then be automatically checked for correctness. Alloy specifications can be checked using the alloy analyzer. Although Alloy is designed with automatic analysis in mind, Alloy differs from many specification languages designed for model-checking in that it permits the definition of infinite models. The Alloy Analyzer is designed to perform finite scope checks even on infinite models. The Alloy language and analyzer are developed by a team led by Daniel Jackson at the Massachusetts Institute of Technology in the United States.", "pageId": 11268035, "created": 2007, "backlinksCount": 18, "revisionCount": 50, "dailyPageViews": 31, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Alloy_(specification_language)" }, "githubLanguage": { "fileExtensions": [ "als" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.alloy", "repos": 759, "id": "Alloy" }, "githubBigQuery": { "repos": 90, "users": 84, "id": "Alloy" }, "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "als" ], "id": "Alloy" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2014, "committerCount": 3, "commitCount": 8, "sampleCount": 3, "example": [ "module examples/systems/file_system\n\n/*\n * Model of a generic file system.\n */\n\nabstract sig Object {}\n\nsig Name {}\n\nsig File extends Object {} { some d: Dir | this in d.entries.contents }\n\nsig Dir extends Object {\n entries: set DirEntry,\n parent: lone Dir\n} {\n parent = this.~@contents.~@entries\n all e1, e2 : entries | e1.name = e2.name => e1 = e2\n this !in this.^@parent\n this != Root => Root in this.^@parent\n}\n\none sig Root extends Dir {} { no parent }\n\nlone sig Cur extends Dir {}\n\nsig DirEntry {\n name: Name,\n contents: Object\n} {\n one this.~entries\n}\n\n\n/**\n * all directories besides root have one parent\n */\npred OneParent_buggyVersion {\n all d: Dir - Root | one d.parent\n}\n\n/**\n * all directories besides root have one parent\n */\npred OneParent_correctVersion {\n all d: Dir - Root | (one d.parent && one contents.d)\n}\n\n/**\n * Only files may be linked (that is, have more than one entry)\n * That is, all directories are the contents of at most one directory entry\n */\npred NoDirAliases {\n all o: Dir | lone o.~contents\n}\n\ncheck { OneParent_buggyVersion => NoDirAliases } for 5 expect 1\n\ncheck { OneParent_correctVersion => NoDirAliases } for 5 expect 0\n" ], "url": "https://github.com/macekond/Alloy.tmbundle" }, "fileType": "text", "wordRank": 9510, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Automated Test Generation and Mutation Testing for Alloy|10.1109/ICST.2017.31|32|1|Allison Sullivan and Kaiyuan Wang and Razieh Nokhbeh Zaeem and S. Khurshid|02365e0a9300c4f7ea050ce490e3b2f823e0240a\n2007|Verification of Aspect-UML models using alloy|10.1145/1229375.1229382|24|1|Farida Mostefaoui and J. Vachon|86f39af4fc13c5f3e5e4aa36b6e8ecad40784dd9\n2014|αRby - An Embedding of Alloy in Ruby|10.1007/978-3-662-43652-3_5|16|3|Aleksandar Milicevic and I. Efrati and D. Jackson|c6709b3b8420194bacc64e8f1bd1149cbbeaf710\n2014|Towards a test automation framework for alloy|10.1145/2632362.2632369|15|1|Allison Sullivan and Razieh Nokhbeh Zaeem and S. Khurshid and D. Marinov|0b67ad521542cbff55a7e8e6f469286fdc283656\n1990|Generators and the replicator control structure in the parallel environment of ALLOY|10.1145/93542.93565|9|0|Thanasis Mitsolides and M. Harrison|76bfb995b7cb3555a6458256ee6e2d2213a99202\n2006|An Automated Approach for Writing Alloy Specifications Using Instances|10.1109/ISoLA.2006.44|5|1|S. Khurshid and Muhammad Zubair Malik and Engin Uzuncaova|79e9b38fad4e522cbb1d8e4ea9494aa816bc414c\n2021|FLACK: Counterexample-Guided Fault Localization for Alloy Models|10.1109/ICSE43902.2021.00065|4|0|Guolong Zheng and ThanhVu Nguyen and Simón Gutiérrez Brida and Germán Regis and M. Frias and Nazareno Aguirre and H. Bagheri|ac6f783ac5d9105d4a80446529df3960b105527d\n2021|Bounded Exhaustive Search of Alloy Specification Repairs|10.1109/ICSE43902.2021.00105|4|0|Simón Gutiérrez Brida and Germán Regis and Guolong Zheng and H. Bagheri and ThanhVu Nguyen and Nazareno Aguirre and M. Frias|0ccfdd7d9c6923f7dd63001d08e42c193724d436\n2014|Numerical simulation of laser powder deposition for TC15 titanium alloy brick parts|10.1179/1432891714Z.000000000876|3|1|J. Cheng|6ed49718dea4fbc07f5dfba75f9f7ff81ed52c82\n2016|Discrete mathematics for computing students: A programming oriented approach with Alloy|10.1109/FIE.2016.7757641|3|0|Leo C. Ureel and C. Wallace|1563f83285dd8efb5883a0e9afae18004344afa1\n2006|Quantitative Characterization of Pore Arrangement in Pore Bands in Pressure Die Cast AZ91 Magnesium Alloy by Image Processing|10.4028/www.scientific.net/MSF.514-516.1477|2|0|D. Prakash and D. Regener|4cfb73ef9f238affa56a624c35ccacb04f325dc1\n2018|Lab exercises for a discrete structures course: exploring logic and relational algebra with Alloy|10.1145/3197091.3197127|1|0|L. E. Brown and Adam Feltz and C. Wallace|60d6989b023382d4dead4bb778046f667fe82ffe\n2018|A Labview/Arduino Measurement System for Shape Memory Alloy Wires|10.1109/INDUSCON.2018.8627164|1|0|J. Driesen and Clécio Fischer and Guilherme L. Caselato de Sousa and O. Santos and R. Loendersloot and D. Rade and Cristiane Aparecida Martins and L. Góes|2158c104f4adc159379c05131fac7a8bb56a9a4c" }, "alma-0": { "title": "Alma-0", "appeared": 1997, "type": "pl", "website": "http://www.cwi.nl/en/alma/", "originCommunity": [ "Centrum Wiskunde & Informatica" ], "wikipedia": { "related": [ "modula-2" ], "summary": "Alma-0 is a multi-paradigm computer programming language. This language is an augmented version of the imperative Modula-2 language with logic-programming features and convenient backtracking capability. It is small, strongly typed, and combines constraint programming, a limited number of features inspired by logic programming and supports imperative paradigms. The language advocates declarative programming. The designers claim that search-oriented solutions built with it are substantially simpler than their counterparts written in purely imperative or logic programming style. [1] Alma-0 provides natural, high-level constructs for the construction of search trees.", "pageId": 933674, "created": 2004, "backlinksCount": 27, "revisionCount": 46, "dailyPageViews": 10, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Alma-0" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "alma-007": { "title": "Alma", "appeared": 2014, "type": "pl", "creators": [ "Carl Mäsak" ], "description": "Alma is a small language created as a testbed for Raku macros.", "website": "http://masak.github.io/alma/", "aka": [ "007" ], "country": [ "Sweden" ], "originCommunity": [ "http://strangelyconsistent.org/" ], "example": [ "macro swap(a, b) {\n return quasi {\n my t = {{{a}}};\n {{{a}}} = {{{b}}};\n {{{b}}} = t;\n };\n}\nfunc gcd(a, b) {\n if b {\n return gcd(b, a % b);\n }\n return a.abs();\n}\nmy bigger = +prompt(\"Enter the bigger integer: \");\nmy smaller = +prompt(\"Enter the smaller integer: \");\nif bigger < smaller {\n swap(bigger, smaller);\n}\nsay();\nsay(\"Greatest common denominator: \", gcd(bigger, smaller));" ], "githubRepo": { "stars": 130, "forks": 14, "subscribers": 1, "created": 2014, "updated": 2021, "description": "ALgoloid with MAcros -- a language with Algol-family syntax where macros take center stage", "url": "https://github.com/masak/alma" }, "repoStats": { "firstCommit": 2014, "commits": 1721, "committers": 18, "files": 126 } }, "alma-o": { "title": "Alma-O", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/14375360347f4d2c600013bfbb31fc14eb224112" ], "originCommunity": [ "Università di Roma", "University of Amsterdam" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5516", "centralPackageRepositoryCount": 0 }, "alma": { "title": "Alma", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/18eb460dc8133e0f9cfc972a68ac3bb5effe52a2" ], "originCommunity": [ "Centrum Wiskunde & Informatica", "University of Amsterdam", "Universit`a di Udine" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3739", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1999|The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming|10.1007/3-540-48092-7_5|14|1|K. Apt and Andrea Schaerf|022dd2b2b6b2719663ffa8b6090c999b58a73a60\n2012|From Scilab to High Performance Embedded Multicore Systems: The ALMA Approach|10.1109/DSD.2012.65|7|0|J. Becker and T. Stripf and Oliver Oey and M. Hübner and Steven Derrien and D. Ménard and O. Sentieys and G. Rauwerda and K. Sunesen and N. Kavvadias and K. Masselos and G. Goulas and P. Alefragis and N. Voros and D. Kritharidis and N. Mitas and D. Göhringer|3748b2f30f012d47c128d29aecf39846e4dc9b16\n2008|ALMA versus DDD|10.2298/CSIS0802119d|2|0|Daniela Carneiro da Cruz and P. Henriques and M. J. Pereira|b579c48a43b17fc0e1149f138dc382913d202e2a" }, "almir": { "title": "ALMIR", "appeared": 1968, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/%D0%90%D0%BD%D0%B0%D0%BB%D0%B8%D1%82%D0%B8%D0%BA" ], "originCommunity": [ "Poltava National Technical University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5429", "centralPackageRepositoryCount": 0 }, "almquist-shell": { "title": "Almquist shell", "appeared": 1989, "type": "pl", "originCommunity": [ "Internet Ulm or Neu-Ulm eV" ], "wikipedia": { "related": [ "c", "bourne-shell", "bash", "freebsd", "korn-shell" ], "summary": "Almquist shell (also known as A Shell, ash and sh) is a lightweight Unix shell originally written by Kenneth Almquist in the late 1980s. Initially a clone of the System V.4 variant of the Bourne shell, it replaced the original Bourne shell in the BSD versions of Unix released in the early 1990s.", "created": 2003, "backlinksCount": 179, "pageId": 171928, "revisionCount": 206, "dailyPageViews": 99, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Almquist_shell" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "alohanet": { "title": "ALOHAnet", "appeared": 1971, "type": "protocol", "originCommunity": [ "University of Hawaii" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/ALOHAnet" } }, "alonzo": { "title": "Alonzo", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ec8b6e9cb4a7d2ac44989a3abaf89620000613e0" ], "originCommunity": [ "The MITRE Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2158", "centralPackageRepositoryCount": 0 }, "alpak": { "title": "ALPAK", "appeared": 1963, "type": "pl", "description": "This is the first of two papers on the ALPAK system for nonnumerical algebra on a digital computer. This paper is concerned with polynomials in several variables and truncated power series with polynomial coefficients. The second paper will discuss rational functions of several variables, truncated, power series with rational-function coefficients, and syste7ns of linear equations with rational-function coefficients. The ALPAK system has been programmed within the BE-S YS-4 monitor system on the IBM 7090 computer, but the language and concepts are machine independent.", "reference": [ "https://onlinelibrary.wiley.com/doi/pdf/10.1002/j.1538-7305.1964.tb04096.x" ], "originCommunity": [ "Nokia Bell Labs" ], "hopl": "https://hopl.info/showlanguage.prx?exp=175", "fileType": "text", "centralPackageRepositoryCount": 0 }, "alpha-programming-language": { "title": "Alpha", "appeared": 1971, "type": "pl", "reference": [ "https://www.researchgate.net/publication/255651557_The_ALPHA_Programming_Language_-_Language_Guide" ], "originCommunity": [ "Technological University Dublin", "University College Dublin" ], "wikipedia": { "related": [ "quel", "sql" ], "summary": "The Alpha language was the original database language proposed by Edgar F. Codd, the inventor of the relational database approach. It was defined in Codd's 1971 paper \"A Data Base Sublanguage Founded on the Relational Calculus\". Alpha influenced the design of QUEL. It was eventually supplanted by SQL (which is however based on the relational algebra defined by Codd in \"Relational Completeness of Data Base Sublanguages\"), which IBM developed for its first commercial relational database product.", "created": 2006, "backlinksCount": 37, "pageId": 4657107, "revisionCount": 30, "dailyPageViews": 11, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/Alpha_%28programming_language%29" }, "fileType": "text", "wordRank": 2841, "centralPackageRepositoryCount": 0 }, "alphabasic": { "title": "AlphaBasic", "appeared": 1976, "type": "pl", "originCommunity": [ "Alpha Microsystems" ], "wikipedia": { "related": [ "assembly-language" ], "summary": "AlphaBASIC is a computer programming language created by Alpha Microsystems in 1976. The language was written by Alpha Microsystems employees Paul Edelstein, Dick Wilcox and Bob Courier.", "created": 2005, "backlinksCount": 7, "pageId": 3555159, "revisionCount": 23, "dailyPageViews": 2, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/AlphaBasic" }, "centralPackageRepositoryCount": 0 }, "alphapop": { "title": "AlphaPop", "appeared": 1986, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/POP-2" ], "originCommunity": [ "University of Edinburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8157", "centralPackageRepositoryCount": 0 }, "alphard-programming-language": { "title": "Alphard", "appeared": 1974, "type": "pl", "originCommunity": [ "Carnegie Mellon University", "University of Southern California", "Carnegie Mellon University" ], "wikipedia": { "related": [ "pascal", "lisp" ], "summary": "Alphard is a Pascal-like programming language for data abstraction and verification, proposed and designed by William A. Wulf, Ralph L. London, and Mary Shaw. The language was the subject of several research publications in the late 1970s, but was never implemented. Its main innovative feature was the introduction of the 'form' datatype, which combines a specification and a procedural (executable) implementation. It also took the generator from IPL-V, as well as the mapping functions from Lisp and made it general case.", "created": 2005, "backlinksCount": 7, "pageId": 2789750, "revisionCount": 35, "dailyPageViews": 4, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Alphard_%28programming_language%29" }, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1976|An introduction to the construction and verification of Alphard programs|10.1109/TSE.1976.233830|321|7|W. Wulf and R. L. London and M. Shaw|7d06bf84338e89456f609896de4e41f61086d98e\n1981|Preliminary) An Informal Definition of Alphard|10.1007/978-1-4612-5979-4_13|6|0|P. Hilfinger and G. Feldman and Robert P. Fitzgerald and I. Kimura and R. L. London and K. V. S. Prasad and V. R. Prasad and Jonathan Rosenberg and M. Shaw and W. Wulf|7f7a88dff66ffba91b67e4a5985f08eaf3977a9c\n1978|An informal definition of Alphard (Preliminary)|10.21236/ada058871|6|0|W. Wulf and P. Hilfinger and Robert P. Fitzgerald and I. Kimura and R. L. London|75f852ec34afda8a477bc3909118c2d37e3e514e" }, "alphard": { "title": "AlpHard", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a6805b97cc161473e0a607ec3b21700bccf095e2" ], "originCommunity": [ "Institut de Recherche en Informatique et Systèmes Aléatoires", "Colorado State University", "CNET or France telecom" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2242", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1976|An introduction to the construction and verification of Alphard programs|10.1109/TSE.1976.233830|321|7|W. Wulf and R. L. London and M. Shaw|7d06bf84338e89456f609896de4e41f61086d98e\n1981|Preliminary) An Informal Definition of Alphard|10.1007/978-1-4612-5979-4_13|6|0|P. Hilfinger and G. Feldman and Robert P. Fitzgerald and I. Kimura and R. L. London and K. V. S. Prasad and V. R. Prasad and Jonathan Rosenberg and M. Shaw and W. Wulf|7f7a88dff66ffba91b67e4a5985f08eaf3977a9c\n1978|An informal definition of Alphard (Preliminary)|10.21236/ada058871|6|0|W. Wulf and P. Hilfinger and Robert P. Fitzgerald and I. Kimura and R. L. London|75f852ec34afda8a477bc3909118c2d37e3e514e" }, "alpine-abuild": { "title": "Alpine Abuild", "appeared": 2006, "type": "pl", "reference": [ "https://git.alpinelinux.org/cgit/abuild/tree/sample.APKBUILD" ], "originCommunity": [ "alpinelinux" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "githubLanguage": { "trendingProjectsCount": 0, "type": "programming", "group": "Shell", "filenames": [ "APKBUILD" ], "aceMode": "sh", "codemirrorMode": "shell", "codemirrorMimeType": "text/x-sh", "tmScope": "source.shell", "aliases": [ "abuild", "apkbuild" ], "repos": 99, "id": "Alpine Abuild" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 31, "commitCount": 243, "sampleCount": 1, "example": [ "# Contributor: Natanael Copa \n# Maintainer: Natanael Copa \npkgname=abuild\npkgver=2.27.0\n_ver=${pkgver%_git*}\npkgrel=0\npkgdesc=\"Script to build Alpine Packages\"\nurl=\"http://git.alpinelinux.org/cgit/abuild/\"\narch=\"all\"\nlicense=\"GPL2\"\ndepends=\"fakeroot sudo pax-utils openssl apk-tools>=2.0.7-r1 libc-utils\n\tattr tar pkgconf patch\"\nif [ \"$CBUILD\" = \"$CHOST\" ]; then\n\tdepends=\"$depends curl\"\nfi\nmakedepends_build=\"pkgconfig\"\nmakedepends_host=\"openssl-dev\"\nmakedepends=\"$makedepends_host $makedepends_build\"\ninstall=\"$pkgname.pre-install $pkgname.pre-upgrade\"\nsubpackages=\"apkbuild-cpan:cpan apkbuild-gem-resolver:gems\"\noptions=\"suid\"\npkggroups=\"abuild\"\nsource=\"http://dev.alpinelinux.org/archive/abuild/abuild-$_ver.tar.xz\n\t\"\n\n_builddir=\"$srcdir/$pkgname-$_ver\"\nprepare() {\n\tcd \"$_builddir\"\n\tfor i in $source; do\n\t\tcase $i in\n\t\t*.patch)\n\t\t\tmsg \"Applying $i\"\n\t\t\tpatch -p1 -i \"$srcdir\"/$i || return 1\n\t\t\t;;\n\t\tesac\n\tdone\n\tsed -i -e \"/^CHOST=/s/=.*/=$CHOST/\" abuild.conf\n}\n\nbuild() {\n\tcd \"$_builddir\"\n\tmake || return 1\n}\n\npackage() {\n\tcd \"$_builddir\"\n\tmake install DESTDIR=\"$pkgdir\" || return 1\n\tinstall -m 644 abuild.conf \"$pkgdir\"/etc/abuild.conf || return 1\n\tinstall -d -m 775 -g abuild \"$pkgdir\"/var/cache/distfiles || return 1\n}\n\ncpan() {\n\tpkgdesc=\"Script to generate perl APKBUILD from CPAN\"\n\tdepends=\"perl perl-libwww perl-json\"\n\tarch=\"noarch\"\n\tmkdir -p \"$subpkgdir\"/usr/bin\n\tmv \"$pkgdir\"/usr/bin/apkbuild-cpan \"$subpkgdir\"/usr/bin/\n}\n\ngems() {\n\tpkgdesc=\"APKBUILD dependency resolver for RubyGems\"\n\tdepends=\"ruby ruby-augeas\"\n\tarch=\"noarch\"\n\tmkdir -p \"$subpkgdir\"/usr/bin\n\tmv \"$pkgdir\"/usr/bin/apkbuild-gem-resolver \"$subpkgdir\"/usr/bin/\n}\n\nmd5sums=\"c67e4c971c54b4d550e16db3ba331f96 abuild-2.27.0.tar.xz\"\nsha256sums=\"c8db017e3dd168edb20ceeb91971535cf66b8c95f29d3288f88ac755bffc60e5 abuild-2.27.0.tar.xz\"\nsha512sums=\"98e1da4e47f3ab68700b3bc992c83e103f770f3196e433788ee74145f57cd33e5239c87f0a7a15f7266840d5bad893fc8c0d4c826d663df53deaee2678c56984 abuild-2.27.0.tar.xz\"" ], "url": "https://github.com/atom/language-shellscript" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "alps": { "title": "ALPS", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bdbd9b5ea3e8e38febf086788802bd4364d9c34f" ], "originCommunity": [ "Ohio State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1383", "centralPackageRepositoryCount": 0, "isbndb": "" }, "altac": { "title": "ALTAC", "appeared": 1959, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f8fec59ed32d82d62b2e62c7c453e17463aa2aca" ], "hopl": "https://hopl.info/showlanguage.prx?exp=364", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "altair-basic": { "title": "Altair BASIC", "appeared": 1975, "type": "pl", "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "assembly-language", "microsoft-basic", "punched-tape" ], "summary": "Altair BASIC is a discontinued interpreter for the BASIC programming language that ran on the MITS Altair 8800 and subsequent S-100 bus computers. It was Microsoft's first product (as Micro-Soft), distributed by MITS under a contract. Altair BASIC was the start of the Microsoft BASIC product range.", "created": 2001, "backlinksCount": 164, "pageId": 21786377, "revisionCount": 233, "dailyPageViews": 161, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Altair_BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "altibase": { "title": "Altibase", "appeared": 1999, "type": "database", "description": "Hybrid relational and in-memory database management system", "country": [ "South Korea" ], "originCommunity": [ "Altibase Corp." ] }, "altran": { "title": "ALTRAN", "appeared": 1968, "type": "pl", "creators": [ "W. Stanley Brown" ], "country": [ "United States" ], "originCommunity": [ "Bell Telephone Laboratories" ], "wikipedia": { "summary": "ALTRAN was a FORTRAN extension providing rational algebra, developed by W.S. Brown, at Bell Labs around 1968.", "pageId": 3264141, "created": 2005, "backlinksCount": 7, "revisionCount": 25, "dailyPageViews": 11, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/ALTRAN" }, "hopl": "https://hopl.info/showlanguage.prx?exp=312", "fileType": "text", "centralPackageRepositoryCount": 0 }, "alumina": { "title": "Alumina", "appeared": 2021, "type": "pl", "website": "https://docs.alumina-lang.net", "webRepl": [ "https://play.alumina-lang.net/" ], "documentation": [ "https://docs.alumina-lang.net/" ], "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/x4xhdj/alumina_programming_language/" ], "compilesTo": [ "c" ], "influencedBy": [ "rust" ], "example": [ "fn main() {\n println!(\"Hello, world!\");\n}" ], "githubRepo": { "firstCommit": 2021, "stars": 33, "forks": 1, "subscribers": 3, "created": 2021, "updated": 2022, "description": "A general purpose programming language", "issues": 0, "url": "https://github.com/tibordp/alumina" }, "repoStats": { "firstCommit": 2021, "commits": 252, "committers": 1, "files": 204 } }, "amalthea": { "title": "amalthea", "appeared": 2002, "type": "pl", "reference": [ "http://lambda-the-ultimate.org/node/1108" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7111", "centralPackageRepositoryCount": 0 }, "amanda": { "title": "Amanda", "appeared": 1988, "type": "pl", "reference": [ "https://github.com/remco138/amanda" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3776", "wordRank": 7602, "centralPackageRepositoryCount": 0 }, "amazon-dynamodb": { "title": "Amazon DynamoDB", "appeared": 2012, "type": "database", "description": "Proprietary NoSQL cloud-based database management system", "country": [ "United States" ], "originCommunity": [ "Amazon Web Services" ] }, "amazon-rds": { "title": "Amazon RDS", "appeared": 2009, "type": "database", "description": "Relational database management system (RDBMS) as a service", "country": [ "United States" ], "originCommunity": [ "Amazon Web Services" ] }, "amber": { "title": "Amber", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9490859394a04eb5da7da34cb17b42fb7cc9bdc5" ], "originCommunity": [ "AT&T Bell Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1067", "wordRank": 5716, "centralPackageRepositoryCount": 0 }, "ambienttalk": { "title": "AmbientTalk", "appeared": 2006, "type": "pl", "website": "https://code.google.com/p/ambienttalk", "country": [ "Belgium" ], "originCommunity": [ "Vrije Universiteit" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "stringToken": [ [ "\"" ] ], "example": [ "when: ChatService discovered: { |chatService| when: chatService<-login(roomID, username) becomes: { |chatRoom| chatRoom<-chat(\"hello world\"); // async message send whenever: chatRoom disconnected: { system.println(\"you're offline\"); }; whenever: chatRoom reconnected: { system.println(\"you're online again\"); }; }; };" ], "pygmentsHighlighter": { "filename": "ambient.py", "fileExtensions": [ "at" ], "id": "AmbientTalk" }, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2005|Ambient-oriented programming in ambientTalk|10.1145/1094855.1094879|131|5|J. Dedecker and T. V. Cutsem and S. Mostinckx and T. D'Hondt and W. Meuter|8d81b3c02aa72bcdca559e0452947d24bfb7e3e1\n2009|Mirror‐based reflection in AmbientTalk|10.1002/spe.909|23|1|S. Mostinckx and T. V. Cutsem and Stijn Timbermont and E. G. Boix and É. Tanter and W. Meuter|aadc488a4501dec96557a637b5d49f456d0a570b" }, "ambit-g": { "title": "AMBIT/G", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0c47123cd773a6f96c53eabd0083c7a4f1d4ae23" ], "originCommunity": [ "Massachusetts Computer Associates" ], "hopl": "https://hopl.info/showlanguage.prx?exp=313", "centralPackageRepositoryCount": 0 }, "ambit-l": { "title": "AMBIT/L", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7a6032b54f39c6abf6d994b9127b862773eb8084" ], "originCommunity": [ "Massachusetts Computer Assoicates" ], "hopl": "https://hopl.info/showlanguage.prx?exp=538", "centralPackageRepositoryCount": 0 }, "ambit": { "title": "AMBIT", "appeared": 1964, "type": "pl", "creators": [ "Carlos Christensen" ], "originCommunity": [ "Massachusetts Computer Associates" ], "wikipedia": { "related": [ "algol-60", "snobol" ], "summary": "AMBIT is a historical programming language that was introduced by Carlos Christensen of Massachusetts Computer Associates in 1964 for symbolic computation. The language was influenced by ALGOL 60 and is an early example of a pattern matching language for manipulation of strings (a more popular example from the same time is SNOBOL). The acronym AMBIT stands for \"Algebraic Manipulation by Identity Translation\", but has also claimed \"Acronym May Be Ignored Totally\". AMBIT had dialects for manipulation of lists (AMBIT-L) and graphs (AMBIT-G) Both pioneered with data structure diagrams and visual programming as data and patterns were used to be represented by directed-graph diagrams. AMBIT/L was implemented for a PDP-10 computer and used to implement the interactive algebraic manipulation system IAM.", "created": 2011, "backlinksCount": 4, "pageId": 30630800, "revisionCount": 13, "dailyPageViews": 4, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/AMBIT" }, "hopl": "https://hopl.info/showlanguage.prx?exp=194", "centralPackageRepositoryCount": 0 }, "ambush": { "title": "AMBUSH", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8db0e00953e405f1e1da41ad77362581012c14ff" ], "originCommunity": [ "Applied Data Research, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=539", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "amiga-e": { "title": "Amiga E", "appeared": 1993, "type": "pl", "creators": [ "Wouter Van Oortmerssen" ], "aka": [ "AmigaE", "E" ], "originCommunity": [ "Amiga" ], "visualParadigm": false, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "WriteF" ] ], "wikipedia": { "related": [ "e", "c" ], "summary": "Amiga E, or very often simply E, is a programming language created by Wouter van Oortmerssen on the Amiga. He has since moved on to develop the SHEEP programming language for the new AmigaDE platform and the CryScript language (also known as DOG) used during the development of the video game Far Cry.", "pageId": 114313, "created": 2002, "backlinksCount": 25, "revisionCount": 126, "dailyPageViews": 14, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Amiga_E" }, "leachim6": { "filepath": "a/Amiga-E.amiga-e", "fileExtensions": [ "amiga-e" ], "example": [ "PROC main() IS WriteF('Hello World\\n')\n" ], "id": "Amiga-E" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1817", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "amiga-programming-languages": { "title": "Amigas", "appeared": 1989, "type": "pl", "originCommunity": [ "Amiga" ], "wikipedia": { "related": [ "gfa-basic", "blitzbasic", "purebasic", "aztec-c", "free-pascal", "forth", "logo", "oberon", "perl", "ruby", "amiga-e", "python", "rebol", "arexx", "scheme", "scm", "modula-2", "java", "ml", "metacomco", "vrml", "visual-basic" ], "summary": "This article deals with programming languages used in the Amiga line of computers, running the AmigaOS operating system and its derivatives AROS and MorphOS. It is a split of the main article Amiga software. See also related articles Amiga productivity software, Amiga music software, Amiga Internet and communications software and Amiga support and maintenance software for other information regarding software that runs on Amiga.", "created": 2011, "backlinksCount": 10, "pageId": 31235619, "revisionCount": 57, "dailyPageViews": 19, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Amiga_programming_languages" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "amigabasic": { "title": "AmigaBASIC", "appeared": 1985, "type": "pl", "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "basic", "metacomco", "arexx", "rexx", "assembly-language", "amos", "blitzbasic", "gfa-basic", "true-basic" ], "summary": "AmigaBASIC was an interpreted BASIC programming language implementation for the Amiga, designed and written by Microsoft. AmigaBASIC shipped with AmigaOS versions 1.1 to 1.3. It succeeded MetaComCo's ABasiC, which was included in AmigaOS 1.0 and 1.1, and was superseded by ARexx, a REXX-style scripting language, from AmigaOS version 2.0 onwards.", "created": 2005, "backlinksCount": 204, "pageId": 1451001, "revisionCount": 139, "dailyPageViews": 21, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/AmigaBASIC" }, "centralPackageRepositoryCount": 0 }, "amos": { "title": "AMOS", "appeared": 1990, "type": "pl", "originCommunity": [ "Europress" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "stos-basic", "basic", "blitzbasic", "arexx" ], "summary": "AMOS BASIC is a dialect of the BASIC programming language implemented on the Amiga computer. AMOS BASIC was published by Europress Software and originally written by François Lionet with Constantin Sotiropoulos.", "pageId": 2957, "created": 2001, "backlinksCount": 115, "revisionCount": 157, "dailyPageViews": 34, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/AMOS_(programming_language)" }, "leachim6": { "filepath": "a/Amos", "example": [ "Print \"Hello World\"\n" ], "id": "Amos" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "amperes-circuital-equation": { "title": "Ampère's Circuital Equation", "appeared": 1961, "type": "equation", "equation": "∇xB=µ0*J", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Ampère%27s_circuital_law" } }, "ampl": { "title": "AMPL", "appeared": 1985, "type": "pl", "creators": [ "Robert Fourer", "David Gay", "Brian Kernighan" ], "website": "https://ampl.com/", "documentation": [ "https://ampl.com/learn/docs/" ], "standsFor": "A Mathematical Programming Language", "country": [ "United States" ], "originCommunity": [ "AMPL Optimization LLC" ], "domainName": { "registered": 1995, "awisRank": { "2022": 971333 }, "name": "ampl.com" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasFloats": { "example": "# (\\d+\\.(?!\\.)\\d*|\\.(?!.)\\d+)([eE][+-]?\\d+)?", "value": true }, "hasIntegers": { "example": "# \\d+([eE][+-]?\\d+)?", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "assignmentToken": [ [ ":=" ] ], "example": [ "set PROD; # products\n\nparam rate {PROD} > 0; # tons produced per hour\nparam avail >= 0; # hours available in week\n\nparam profit {PROD}; # profit per ton\nparam market {PROD} >= 0; # limit on tons sold in week\n\nvar Make {p in PROD} >= 0, <= market[p]; # tons produced\n\nmaximize Total_Profit: sum {p in PROD} profit[p] * Make[p];\n\n # Objective: total profits from all products\n\nsubject to Time: sum {p in PROD} (1/rate[p]) * Make[p] <= avail;\n\n # Constraint: total of hours used by all\n # products may not exceed hours available" ], "wikipedia": { "example": [ "set Plants;\n set Markets;\n\n # Capacity of plant p in cases\n param Capacity{p in Plants};\n\n # Demand at market m in cases\n param Demand{m in Markets};\n\n # Distance in thousands of miles\n param Distance{Plants, Markets};\n\n # Freight in dollars per case per thousand miles\n param Freight;\n\n # Transport cost in thousands of dollars per case\n param TransportCost{p in Plants, m in Markets} :=\n Freight * Distance[p, m] / 1000;\n\n # Shipment quantities in cases\n var shipment{Plants, Markets} >= 0;\n\n # Total transportation costs in thousands of dollars\n minimize cost:\n sum{p in Plants, m in Markets} TransportCost[p, m] * shipment[p, m];\n\n # Observe supply limit at plant p\n s.t. supply{p in Plants}: sum{m in Markets} shipment[p, m] <= Capacity[p];\n\n # Satisfy demand at market m\n s.t. demand{m in Markets}: sum{p in Plants} shipment[p, m] >= Demand[m];\n\n data;\n\n set Plants := seattle san-diego;\n set Markets := new-york chicago topeka;\n\n param Capacity :=\n seattle 350\n san-diego 600;\n\n param Demand :=\n new-york 325\n chicago 300\n topeka 275;\n\n param Distance : new-york chicago topeka :=\n seattle 2.5 1.7 1.8\n san-diego 2.5 1.8 1.4;\n\n param Freight := 90;" ], "related": [ "linux", "unix", "awk", "c", "algebraic-modeling-language", "nl", "xml", "excel-app" ], "summary": "A Mathematical Programming Language (AMPL) is an algebraic modeling language to describe and solve high-complexity problems for large-scale mathematical computing (i.e., large-scale optimization and scheduling-type problems). It was developed by Robert Fourer, David Gay, and Brian Kernighan at Bell Laboratories. AMPL supports dozens of solvers, both open source and commercial software, including CBC, CPLEX, FortMP, Gurobi, MINOS, IPOPT, SNOPT, KNITRO, and LGO. Problems are passed to solvers as nl files. AMPL is used by more than 100 corporate clients, and by government agencies and academic institutions. One advantage of AMPL is the similarity of its syntax to the mathematical notation of optimization problems. This allows for a very concise and readable definition of problems in the domain of optimization. Many modern solvers available on the NEOS Server (formerly hosted at the Argonne National Laboratory, currently hosted at the University of Wisconsin, Madison) accept AMPL input. According to the NEOS statistics AMPL is the most popular format for representing mathematical programming problems.", "pageId": 1076270, "dailyPageViews": 109, "created": 2004, "backlinksCount": 133, "revisionCount": 237, "appeared": 1985, "fileExtensions": [ "mod", "dat", "run" ], "url": "https://en.wikipedia.org/wiki/AMPL" }, "githubLanguage": { "fileExtensions": [ "ampl", "mod" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.ampl", "repos": 5570, "id": "AMPL" }, "githubBigQuery": { "repos": 852, "users": 806, "id": "AMPL" }, "pygmentsHighlighter": { "filename": "ampl.py", "fileExtensions": [ "run" ], "id": "Ampl" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2013, "committerCount": 2, "commitCount": 12, "sampleCount": 2, "example": [ "# A toy knapsack problem from the LocalSolver docs written in AMPL.\n\nset I;\nparam Value{I};\nparam Weight{I};\nparam KnapsackBound;\nvar Take{I} binary;\n\nmaximize TotalValue: sum{i in I} Take[i] * Value[i];\ns.t. WeightLimit: sum{i in I} Take[i] * Weight[i] <= KnapsackBound;\n\ndata;\n\nparam:\nI: Weight Value :=\n0 10 1\n1 60 10\n2 30 15\n3 40 40\n4 30 60\n5 20 90\n6 20 100\n7 2 15;\n\nparam KnapsackBound := 102;\n" ], "url": "https://github.com/ampl/sublime-ampl" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AMPL", "indeedJobs": { "2022": 3, "query": "ampl developer" }, "eventsPageUrl": [ "https://ampl.com/about/upcoming-events/" ], "faqPageUrl": [ "https://ampl.com/learn/docs/faqs/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7232", "twitter": "https://twitter.com/amplopt", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAmpl: A Modeling Language for Mathematical Programming|1993|Robert Fourer|2176571|4.00|17|0\nAMPL: A modeling language for mathematical programming : with AMPL Plus student edition for Microsoft Windows|1997|Robert Fourer|3846900|0.0|0|0\nAmpl: A Modeling Language for Mathematical Programming: With Ampl Plus Student Edition for Microsoft Windows|1997|Robert Fourer|20874764|0.0|0|0\nAmpl: A Modeling Language for Math Programming Package (with User Guide)|1999|Robert Fourer|20874765|2.00|1|0\nAmpl: A Molding Language for Mathematical Programming/Book & IBM 5 1/4 Disk|1991|Robert Fourer|2247991|0.0|0|0\nMathematical Optimization Software: Mathematica, General Algebraic Modeling System, Propt, Ioso, Mps, Ampl, Apmonitor, Tomsym, Worhp, Dido|2011|Source Wikipedia|15185414|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1997|Cengage Learning|AMPL: A Modeling Language for Mathematical Programming (with AMPL Plus Student Edition for Microsoft Windows) (The Scientific Press Series)|Fourer, Robert and Gay, David M. and Kernighan, Brian W.|9780894262326\n1997-01-13T00:00:01Z|Cengage Learning|AMPL: A Modeling Language for Mathematical Programming (with AMPL Plus Student Edition for Microsoft Windows) (The Scientific Press Series)|Fourer, Robert and Gay, David M. and Kernighan, Brian W.|9780534509835", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1996|DIY DEA: Implementing data envelopment analysis in the mathematical programming language AMPL|10.1016/0305-0483(96)00003-5|8|0|R. Green|2a84d88be4d3283124da624af001a3f0c4c01885\n1984|Loslan implementation of the AMPL message-passing system|10.1145/948596.948600|2|0|J. Milewski|7c0626677098596348ea9d02ad5f569a7aa2e19d" }, "amppl-i": { "title": "AMPPL-I", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4a4a7d6584c7a7b3351e01cc3de4903a10f86f70" ], "originCommunity": [ "State University of New York" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2968", "centralPackageRepositoryCount": 0, "isbndb": "" }, "amppl-ii": { "title": "AMPPL-II", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4a4a7d6584c7a7b3351e01cc3de4903a10f86f70" ], "originCommunity": [ "State University of New York" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1824", "centralPackageRepositoryCount": 0 }, "amqp": { "title": "Advanced Message Queuing Protocol", "appeared": 2003, "type": "protocol", "standsFor": "Advanced Message Queuing Protocol", "originCommunity": [ "JPMorgan Chase" ], "wikipedia": { "related": [ "tls", "erlang" ], "summary": "The Advanced Message Queuing Protocol (AMQP) is an open standard application layer protocol for message-oriented middleware. The defining features of AMQP are message orientation, queuing, routing (including point-to-point and publish-and-subscribe), reliability and security. AMQP mandates the behavior of the messaging provider and client to the extent that implementations from different vendors are interoperable, in the same way as SMTP, HTTP, FTP, etc. have created interoperable systems. Previous standardizations of middleware have happened at the API level (e.g. JMS) and were focused on standardizing programmer interaction with different middleware implementations, rather than on providing interoperability between multiple implementations. Unlike JMS, which defines an API and a set of behaviors that a messaging implementation must provide, AMQP is a wire-level protocol. A wire-level protocol is a description of the format of the data that is sent across the network as a stream of bytes. Consequently, any tool that can create and interpret messages that conform to this data format can interoperate with any other compliant tool irrespective of implementation language.", "pageId": 5657545, "dailyPageViews": 446, "created": 2006, "backlinksCount": 74, "revisionCount": 472, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Advanced_Message_Queuing_Protocol" }, "fileType": "na", "centralPackageRepositoryCount": 0, "isbndb": "" }, "amtran-70": { "title": "AMTRAN 70", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8c52c1c5e50971233835379c8002949eca17c51a" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7104", "centralPackageRepositoryCount": 0 }, "amtran": { "title": "AMTRAN", "appeared": 1966, "type": "pl", "description": "As a programming language, AMTRAN is designed to satisfy two objectives: the reduction of programming cost and effort by at least an order of magnitude, and the provision of a semiautomatic numerical analytical problem solving system. It resembles a blend of FORTRAN and ALGOL but possesses certain additional features. These include the following.", "reference": [ "https://dl.acm.org/citation.cfm?id=2402560" ], "country": [ "United States" ], "originCommunity": [ "NASA", "University of Georgia", "Northrop Space Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=244", "fileType": "text", "centralPackageRepositoryCount": 0 }, "amulet": { "title": "Amulet", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/46c9a1b21e678a617893cb5443425738ee8dc4a0" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7464", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ana": { "title": "ana", "appeared": 2018, "type": "pl", "githubRepo": { "firstCommit": 2018, "stars": 138, "forks": 6, "subscribers": 5, "created": 2018, "updated": 2022, "issues": 3, "url": "https://github.com/analang/ana" }, "repoStats": { "firstCommit": 2018, "commits": 178, "committers": 3, "files": 167 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17791287|Show HN: Ana-lang: C, PHP, Python inspired scripting language|2018-08-18 22:52:01 UTC|1534632721|ryanmccullagh|0|3" }, "analytical-engine-machine": { "title": "Analytical engine", "appeared": 1837, "type": "computingMachine", "wikipedia": { "related": [ "assembly-language", "punched-tape" ], "summary": "The Analytical Engine was a proposed mechanical general-purpose computer designed by English mathematician and computer pioneer Charles Babbage. It was first described in 1837 as the successor to Babbage's difference engine, a design for a mechanical computer. The Analytical Engine incorporated an arithmetic logic unit, control flow in the form of conditional branching and loops, and integrated memory, making it the first design for a general-purpose computer that could be described in modern terms as Turing-complete. In other words, the logical structure of the Analytical Engine was essentially the same as that which has dominated computer design in the electronic era.Babbage was never able to complete construction of any of his machines due to conflicts with his chief engineer and inadequate funding. It was not until the late 1940s that the first general-purpose computers were actually built, more than a century after Babbage had proposed the pioneering Analytical Engine in 1837.", "created": 2011, "backlinksCount": 186, "pageId": 1271, "revisionCount": 2, "dailyPageViews": 106, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Analytical_engine" }, "centralPackageRepositoryCount": 0 }, "and-or": { "title": "And/Or", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ad09c0ca9cef2e94f34f2a6b03f6fbf73cc0479e" ], "country": [ "United States" ], "originCommunity": [ "IBM Thomas J. Watson Research Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5707", "centralPackageRepositoryCount": 0 }, "andante": { "title": "Andante", "appeared": 1980, "type": "pl", "reference": [ "https://www.george.andante.no/" ], "country": [ "United States and Sweden" ], "originCommunity": [ "Massachusetts Institute of Technology", "Terje Dahl" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7208", "centralPackageRepositoryCount": 0 }, "andorra-i": { "title": "Andorra-I", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/98420e3acbf22f8b392b74a90fae97d7e05ffb6b" ], "country": [ "Portugal and England" ], "originCommunity": [ "Universidade do Porto", "SRI International", "University of Bristol" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4016", "centralPackageRepositoryCount": 0 }, "andorra": { "title": "Andorra", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0b74461efa395eedd5cb4c663abea88d6322c12e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1384", "wordRank": 9325, "centralPackageRepositoryCount": 0 }, "android": { "title": "Android", "appeared": 2008, "type": "os", "website": "https://android.com/", "country": [ "United States" ], "originCommunity": [ "Android Inc.", "Google" ], "domainName": { "registered": 1997, "awisRank": { "2022": 1249 }, "name": "android.com" }, "releaseNotesUrl": "https://developer.android.com/jetpack/androidx/versions/all-channel", "versions": { "2008": [ "1.0" ], "2009": [ "1.5", "1.6", "2.0" ], "2010": [ "2.2", "2.3" ], "2011": [ "3.0", "4.0" ], "2012": [ "4.1" ], "2013": [ "4.4" ], "2014": [ "5.0" ], "2015": [ "6.0" ], "2016": [ "7.0" ], "2017": [ "8.0" ], "2018": [ "9.0" ], "2019": [ "10" ], "2020": [ "11" ], "2021": [ "12" ], "2022": [ "13" ] }, "wikipedia": { "related": [ "java", "c", "arm", "x86-isa", "linux", "go", "kotlin", "eclipse-editor", "mips", "ios", "java-bytecode" ], "summary": "Android is a mobile operating system developed by Google, based on a modified version of the Linux kernel and other open source software and designed primarily for touchscreen mobile devices such as smartphones and tablets. In addition, Google has further developed Android TV for televisions, Android Auto for cars, and Wear OS for wrist watches, each with a specialized user interface. Variants of Android are also used on game consoles, digital cameras, PCs and other electronics. Initially developed by Android Inc., which Google bought in 2005, Android was unveiled in 2007, with the first commercial Android device launched in September 2008. The operating system has since gone through multiple major releases, with the current version being 9.0 \"Pie\", released in August 2018. The core Android source code is known as Android Open Source Project (AOSP), and is primarily licensed under the Apache License. Android is also associated with a suite of proprietary software developed by Google, called Google Mobile Services (GMS) that very frequently comes pre-installed in devices, which usually includes the Google Chrome web browser and Google Search and always includes core apps for services such as Gmail, as well as the application store and digital distribution platform Google Play, and associated development platform. These apps are licensed by manufacturers of Android devices certified under standards imposed by Google, but AOSP has been used as the basis of competing Android ecosystems, such as Amazon.com's Fire OS, which use their own equivalents to GMS. Android has been the best-selling OS worldwide on smartphones since 2011 and on tablets since 2013. As of May 2017, it has over two billion monthly active users, the largest installed base of any operating system, and as of June 2018, the Google Play store features over 3.3 million apps.", "dailyPageViews": 9920, "pageId": 12610483, "created": 2007, "backlinksCount": 12074, "revisionCount": 10354, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Android_(operating_system)" }, "leachim6": { "filepath": "a/Android.java", "fileExtensions": [ "java" ], "example": [ "package com.example.helloworld;\n\nimport android.app.Activity;\nimport android.os.Bundle;\nimport android.widget.TextView;\n\npublic class HelloWorld extends Activity {\n\n @Override\n public void onCreate(Bundle savedInstanceState) {\n super.onCreate(savedInstanceState);\n TextView tv = new TextView(this);\n tv.setText(\"Hello World\");\n setContentView(tv);\n }\n}\n" ], "id": "Android" }, "linkedInSkill": { "2018": 926337, "id": "android" }, "meetup": { "memberCount": 1514159, "groupCount": 2707, "url": "https://www.meetup.com/topics/android-developers" }, "twitter": "https://twitter.com/android", "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAndroid Application Development For Dummies|2010|Donn Felker|13607110|3.66|130|14\nAndroid Programming: The Big Nerd Ranch Guide|2012|Brian Hardy|17024214|4.29|405|35" }, "angelscript": { "title": "Angelscript", "appeared": 2003, "type": "pl", "creators": [ "Andreas Jönsson" ], "website": "http://angelcode.com/angelscript", "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "print" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "and", "abstract*", "auto", "bool", "break", "case", "cast", "class", "const", "continue", "default", "do", "double", "else", "enum", "false", "final*", "float", "for", "from*", "funcdef", "get*", "if", "import", "in", "inout", "int", "interface", "int8", "int16", "int32", "int64", "is", "mixin", "namespace", "not", "null", "or", "out", "override*", "private", "protected", "return", "set*", "shared*", "super*", "switch", "this*", "true", "typedef", "uint", "uint8", "uint16", "uint32", "uint64", "void", "while", "xor", "*", "**", "/", "%", "+", "-", "<=", "<", ">=", ">", "(", ")", "==", "!=", "?", ":", "=", "+=", "-=", "*=", "/=", "%=", "**=", "++", "--", "&", ",", "{", "}", ";", "|", "^", "~", "<<", ">>", ">>>", "&=", "|=", "^=", "<<=", ">>=", ">>>=", ".", "&&", "||", "!", "[", "]", "^^", "@", "!is", "::", "123456789", "123.123e123", "123.123e123f", "0x1234FEDC", "0d123987", "0o1276", "0b1010", "'abc'", "\"abc\"", "\"\"\"heredoc\"\"\"", "_Abc123", "//", "/*", "*/" ], "wikipedia": { "related": [ "eclipse-editor" ], "summary": "AngelScript is a game-oriented interpreted compiled scripting language. AngelScript features static typing, object handles (similar to C++ pointers but garbage collected via reference counting), object-orientation, single inheritance, multiple inheritance with interfaces. Allows operators to be registered and overloaded. AngelScript can be used with any C++ IDE, such as Netbeans, Geany, Eclipse, and also supported by AngelJuice IDE developed specifically for the language. C and C++ functions can be called within an AngelScript environment. AngelScript's class syntax closely follows C++ classes by design: no proxy functions are required to embed AngelScript in C++ applications easing the two languages integration. There are several differences of AngelScript and C++: AngelScript does not support multiple inheritance. Multiple-inheritance functionality may be achieved with Interfaces. It is impossible to declare methods or properties outside of the class body. All methods (including constructors and destructors) are virtual. AngelScript is used in video game development, including Amnesia: The Dark Descent, Amy, Dustforce, Gekkeiju Online, King Arthur's Gold, Legend of the Guardians: The Owls of Ga'Hoole, Overgrowth, Penumbra: Overture, Penumbra: Requiem, Puddle, Rigs of Rods, Sine Mora, Star Ruler, SuperTuxKart, Warhammer: Mark of Chaos, Warsow, Urho3D. AngelScript is used at the University of Ulm in interactive 3D-Animation program. AngelScript is also used in robotics, for example, to program behavioral rules of robotic agents.", "pageId": 39538319, "dailyPageViews": 29, "created": 2013, "backlinksCount": 23, "revisionCount": 58, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/AngelScript" }, "githubLanguage": { "fileExtensions": [ "as", "angelscript" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-c++src", "tmScope": "source.angelscript", "repos": 1140, "id": "AngelScript" }, "githubBigQuery": { "repos": 286, "users": 275, "id": "AngelScript" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2018, "committerCount": 4, "commitCount": 22, "sampleCount": 2, "example": [ "/*\n*\tThis is a sample script.\n*/\n\n#include \"BotManagerInterface.acs\"\n\nBotManager::BotManager g_BotManager( @CreateDumbBot );\n\nCConCommand@ m_pAddBot;\n\nvoid PluginInit()\n{\n\tg_BotManager.PluginInit();\n\t\n\t@m_pAddBot = @CConCommand( \"addbot\", \"Adds a new bot with the given name\", @AddBotCallback );\n}\n\nvoid AddBotCallback( const CCommand@ args )\n{\n\tif( args.ArgC() < 2 )\n\t{\n\t\tg_Game.AlertMessage( at_console, \"Usage: addbot \" );\n\t\treturn;\n\t}\n\t\n\tBotManager::BaseBot@ pBot = g_BotManager.CreateBot( args[ 1 ] );\n\t\n\tif( pBot !is null )\n\t{\n\t\tg_Game.AlertMessage( at_console, \"Created bot \" + args[ 1 ] + \"\\n\" );\n\t}\n\telse\n\t{\n\t\tg_Game.AlertMessage( at_console, \"Could not create bot\\n\" );\n\t}\n}\n\nfinal class DumbBot : BotManager::BaseBot\n{\t\n\tDumbBot( CBasePlayer@ pPlayer )\n\t{\n\t\tsuper( pPlayer );\n\t}\n\t\n\tvoid Think()\n\t{\n\t\tBotManager::BaseBot::Think();\n\t\t\n\t\t// If the bot is dead and can be respawned, send a button press\n\t\tif( Player.pev.deadflag >= DEAD_RESPAWNABLE )\n\t\t{\n\t\t\tPlayer.pev.button |= IN_ATTACK;\n\t\t}\n\t\telse\n\t\t\tPlayer.pev.button &= ~IN_ATTACK;\n\t\t\n\t\tKeyValueBuffer@ pInfoBuffer = g_EngineFuncs.GetInfoKeyBuffer( Player.edict() );\n\t\t\n\t\tpInfoBuffer.SetValue( \"topcolor\", Math.RandomLong( 0, 255 ) );\n\t\tpInfoBuffer.SetValue( \"bottomcolor\", Math.RandomLong( 0, 255 ) );\n\t\t\n\t\tif( Math.RandomLong( 0, 100 ) > 10 )\n\t\t\tPlayer.pev.button |= IN_ATTACK;\n\t\telse\n\t\t\tPlayer.pev.button &= ~IN_ATTACK;\n\t\t\t\n\t\tfor( uint uiIndex = 0; uiIndex < 3; ++uiIndex )\n\t\t{\n\t\t\tm_vecVelocity[ uiIndex ] = Math.RandomLong( -50, 50 );\n\t\t}\n\t}\n}\n\nBotManager::BaseBot@ CreateDumbBot( CBasePlayer@ pPlayer )\n{\n\treturn @DumbBot( pPlayer );\n}\n" ], "url": "https://github.com/wronex/sublime-angelscript" }, "helloWorldCollection": [ "// Hello world in AngelScript\n\nvoid main() { print(\"Hello world\\n\"); }" ], "leachim6": { "filepath": "a/AngelScript", "example": [ "void main() { print(\"Hello World\\n\"); }\n" ], "id": "AngelScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AngelScript", "tiobe": { "id": "Angelscript" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "angr": { "title": "angr", "appeared": 2015, "type": "decompiler", "description": "angr is an open-source binary analysis platform for Python. It combines both static and dynamic symbolic (\"concolic\") analysis, providing tools to solve a variety of tasks.", "website": "https://angr.io/", "country": [ "United States" ], "originCommunity": [ "University of California, Santa Barbara", "Arizona State University" ], "domainName": { "registered": 2015, "awisRank": { "2022": 376400 }, "name": "angr.io" } }, "anna": { "title": "ANNA", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4320fd009d95f66c8db4166c737bf0b9ea08da8f" ], "country": [ "United States and Germany and Norway" ], "originCommunity": [ "University of Oslo", "Universität Bremen", "Stanford University", "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=883", "wordRank": 4714, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ans-mumps": { "title": "ANS MUMPS", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4d4d69c0d7db4658ae21a78c2b06d69333a815e3" ], "country": [ "United States" ], "originCommunity": [ "Veterans Administration" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8088", "centralPackageRepositoryCount": 0 }, "ansi-basic": { "title": "ANSI BASIC", "appeared": 1980, "type": "pl", "reference": [ "https://www.atarimagazines.com/creative/v10n9/171_Structured_programming_in.php" ], "country": [ "United States" ], "originCommunity": [ "Dartmouth College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3034", "centralPackageRepositoryCount": 0 }, "ant-build-system": { "title": "Ant Build System", "appeared": 2000, "type": "application", "description": "Apache Ant is a Java library and command-line tool whose mission is to drive processes described in build files as targets and extension points dependent upon each other. The main known usage of Ant is the build of Java applications. Ant supplies a number of built-in tasks allowing to compile, assemble, test and run Java applications. Ant can also be used effectively to build non Java applications, for instance C or C++ applications. More generally, Ant can be used to pilot any type of process which can be described in terms of targets and tasks.", "website": "http://ant.apache.org/", "reference": [ "https://en.wikipedia.org/wiki/Apache_Ant" ], "country": [ "United States" ], "originCommunity": [ "Apache Software Foundation" ], "domainName": { "name": "ant.apache.org" }, "githubLanguage": { "trendingProjectsCount": 0, "type": "data", "filenames": [ "ant.xml", "build.xml" ], "aceMode": "xml", "codemirrorMode": "xml", "codemirrorMimeType": "application/xml", "tmScope": "text.xml.ant", "id": "Ant Build System" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2014, "committerCount": 3, "commitCount": 79, "sampleCount": 2, "example": [ "\n\n\n \n \n\n \n \n\n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n\n \n \n\n \n \n\n \n \n\n \n \n \n \n\n \n \n \n \n \n \n\n \n \n \n\n \n\t\n\t\n \n \n \n\n\n \n\n \n\n \n \n\n \n \n\n \n \n \n \n \n\n \n \n \n \n \n \n \n\n \n \n\n \n\n \n \n \n \n\n\n" ], "url": "https://github.com/textmate/ant.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ante-esolang": { "title": "Ante", "appeared": 2013, "type": "esolang", "creators": [ "Michael Dvorkin" ], "aka": [ "antecards" ], "githubRepo": { "stars": 48, "forks": 9, "subscribers": 5, "created": 2013, "updated": 2022, "firstCommit": 2013, "description": "Esoteric programming language where all you've got is a deck of cards", "issues": 2, "url": "https://github.com/michaeldv/ante" }, "repoStats": { "firstCommit": 2013, "commits": 47, "committers": 2, "files": 12 }, "esolang": "https://esolangs.org/wiki/Ante", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Two Different Points of View through Artificial Intelligence and Vector Autoregressive Models for Ex Post and Ex Ante Forecasting|10.1155/2015/409361|6|2|A. Aydin and S. C. Cavdar|d3b9babba0eb33cc651bcaf78106dcdbfacc2590" }, "ante": { "title": "Ante", "appeared": 2015, "type": "pl", "creators": [ "Jake Fecher" ], "description": "Ante is a compiled systems language focusing on providing extreme extensibility through the use of a compile-time API. Using such an API, compiler extensions can be created within the program itself, allowing for the addition of a garbage collector, ownership system, type system changes, etc.", "website": "http://antelang.org", "domainName": { "registered": 2018, "awisRank": { "2022": 919643 }, "name": "antelang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "githubRepo": { "stars": 1420, "forks": 49, "subscribers": 25, "created": 2015, "updated": 2022, "firstCommit": 2015, "description": "A safe, easy systems language", "issues": 17, "url": "https://github.com/jfecher/ante" }, "repoStats": { "firstCommit": 2020, "commits": 1377, "committers": 18, "files": 154 }, "leachim6": { "filepath": "a/Ante.ante", "fileExtensions": [ "ante" ], "example": [ "9♦8♥J♦A♦2♣3♥7♠J♦A♦7♦J♦J♦A♦3♦J♦5♥6♦4♥J♥A♥6♠6♠J♥A♦8♦J♦A♦8♠J♦A♦3♦J♦A♦6♠J♦A♦8♠J♦A♥3♦2♠J♥A♥2♣6♠J♥\n" ], "id": "Ante" }, "rijuRepl": { "example": [ "print \"Hello, world!\"\n" ], "id": "https://riju.codes/ante" }, "tryItOnline": "ante", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Two Different Points of View through Artificial Intelligence and Vector Autoregressive Models for Ex Post and Ex Ante Forecasting|10.1155/2015/409361|6|2|A. Aydin and S. C. Cavdar|d3b9babba0eb33cc651bcaf78106dcdbfacc2590" }, "antha": { "title": "antha", "appeared": 2014, "type": "pl", "website": "http://www.antha-lang.org", "country": [ "England" ], "originCommunity": [ "Synthace" ], "domainName": { "registered": 2014, "name": "antha-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n8704420|Antha – A high-level language for biology|http://www.antha-lang.org/|2014-12-05 13:44:00 UTC|1417787040|wspeirs|10|70" }, "antlr": { "title": "ANTLR", "appeared": 1992, "type": "grammarLanguage", "website": "http://www.antlr.org", "documentation": [ "https://www.antlr.org/", "https://www.antlr2.org/doc/", "https://theantlrguy.atlassian.net/wiki/spaces/ANTLR3/pages/2687234/ANTLR+v3+documentation" ], "country": [ "United States" ], "originCommunity": [ "University of San Francisco" ], "domainName": { "registered": 1997, "awisRank": { "2022": 477725 }, "name": "antlr.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "/** Taken from \"The Definitive ANTLR 4 Reference\" by Terence Parr */\n// Derived from http://json.org\ngrammar JSON;\njson\n : value\n ;\nobj\n : '{' pair (',' pair)* '}'\n | '{' '}'\n ;\npair\n : STRING ':' value\n ;\narr\n : '[' value (',' value)* ']'\n | '[' ']'\n ;\nvalue\n : STRING\n | NUMBER\n | obj\n | arr\n | 'true'\n | 'false'\n | 'null'\n ;\n\nSTRING\n : '\"' (ESC | SAFECODEPOINT)* '\"'\n ;\n\nfragment ESC\n : '\\\\' ([\"\\\\/bfnrt] | UNICODE)\n ;\nfragment UNICODE\n : 'u' HEX HEX HEX HEX\n ;\nfragment HEX\n : [0-9a-fA-F]\n ;\nfragment SAFECODEPOINT\n : ~ [\"\\\\\\u0000-\\u001F]\n ;\n\nNUMBER\n : '-'? INT ('.' [0-9] +)? EXP?\n ;\n\nfragment INT\n : '0' | [1-9] [0-9]*\n ;\n\n// no leading zeros\n\nfragment EXP\n : [Ee] [+\\-]? INT\n ;\n\n// \\- since - means \"range\" inside [...]\n\nWS\n : [ \\t\\n\\r] + -> skip\n ; " ], "wikipedia": { "example": [ "TextReader reader;\n // (...) Fill TextReader with character\n SumLexer lexer = new SumLexer(reader);\n SumParser parser = new SumParser(lexer);\n\n parser.expression();" ], "related": [ "java", "actionscript", "c", "csharp", "javascript", "objective-c", "perl", "python", "ruby", "standard-ml", "swift", "go", "groovy", "jython", "processing", "coco-r", "javacc", "peg" ], "summary": "In computer-based language recognition, ANTLR (pronounced Antler), or Another Tool For Language Recognition, is a parser generator that uses LL(*) for parsing. ANTLR is the successor to the Purdue Compiler Construction Tool Set (PCCTS), first developed in 1989, and is under active development. Its maintainer is Professor Terence Parr of the University of San Francisco.", "pageId": 765588, "dailyPageViews": 103, "created": 2004, "backlinksCount": 60, "revisionCount": 253, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/ANTLR" }, "githubLanguage": { "fileExtensions": [ "g4" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nantlr grammars-v4 https://github.com/antlr.png https://github.com/antlr/grammars-v4 ANTLR #9DC3FF 4119 1736 119 \"Grammars written for ANTLR v4; expectation that the grammars are free of actions.\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "tmScope": "source.antlr", "repos": 1415, "id": "ANTLR" }, "githubBigQuery": { "repos": 2866, "users": 2571, "id": "ANTLR" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/antlr4", "pygmentsHighlighter": { "filename": "parsers.py", "id": "ANTLR" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 5, "commitCount": 31, "url": "https://github.com/textmate/antlr.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ANTLR", "indeedJobs": { "2017": 7, "query": "antlr engineer" }, "linkedInSkill": { "2018": 2312, "id": "antlr" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1825", "twitter": "https://twitter.com/the_antlr_guy", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20130115|O'Reilly Media, Inc.|The Definitive ANTLR 4 Reference|Terence Parr|9781680505009", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Multilingual Detection of Code Clones Using ANTLR Grammar Definitions|10.1109/APSEC.2018.00088|7|0|Yuichi Semura and Norihiro Yoshida and Eunjong Choi and Katsuro Inoue|d52793ccd9657e79a6ec8087b84ac5148d7d6e6f" }, "apache-cassandra": { "title": "Apache Cassandra", "appeared": 2008, "type": "database", "website": "https://cassandra.apache.org", "country": [ "United States" ], "originCommunity": [ "Facebook", "Apache Software Foundation" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Apache_Cassandra" }, "subreddit": [ { "memberCount": { "2022": 2453 }, "url": "https://www.reddit.com/r/cassandra" } ] }, "apache-derby": { "title": "Apache Derby", "appeared": 2004, "type": "database", "description": "Relational database management system (RDBMS)", "country": [ "United States" ], "originCommunity": [ "Apache Software Foundation" ] }, "apache-hbase": { "title": "Apache Hbase", "appeared": 2008, "type": "application", "website": "https://hbase.apache.org/", "documentation": [ "https://hbase.apache.org/book.html" ], "originCommunity": [ "https://github.com/apache/hbase" ], "domainName": { "name": "hbase.apache.org" }, "writtenIn": [ "java" ], "githubRepo": { "stars": 4700, "forks": 3100, "updated": 2022, "description": "Apache HBase [1] is an open-source, distributed, versioned, column-oriented store modeled after Google' Bigtable: A Distributed Storage System for Structured Data by Chang et al.[2] Just as Bigtable leverages the distributed data storage provided by the Google File System, HBase provides Bigtable-like capabilities on top of Apache Hadoop [3]..", "issues": 275, "url": "https://github.com/apache/hbase" }, "wikipedia": { "related": [ "java", "linux", "json", "sql", "mongodb", "couchdb", "postgresql" ], "summary": "HBase is an open-source non-relational distributed database modeled after Google's Bigtable and written in Java. It is developed as part of Apache Software Foundation's Apache Hadoop project and runs on top of HDFS (Hadoop Distributed File System) or Alluxio, providing Bigtable-like capabilities for Hadoop.", "pageId": 16266878, "dailyPageViews": 106, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Apache_HBase" }, "indeedJobs": { "2022": 65, "query": "hbase developer" }, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nLearning HBase|2010|Shashwat Shriparv|24529152|4.57|7|3\nHBase: The Definitive Guide|2011|Lars George|10316770|3.74|121|7" }, "apache-phoenix": { "title": "Apache Phoenix", "appeared": 2014, "type": "database", "description": "Distributed SQL query engine for Apache HBase", "country": [ "United States" ], "originCommunity": [ "Apache Software Foundation" ] }, "apache-velocity": { "title": "Velocity", "appeared": 2003, "type": "template", "website": "http://velocity.apache.org/", "aka": [ "Velocity" ], "originCommunity": [ "Apache" ], "domainName": { "name": "velocity.apache.org" }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "\n \n Hello Velocity World!\n \n" ], "related": [ "java", "html", "sql", "postscript", "xml", "java-server-pages", "thymeleaf" ], "summary": "Apache Velocity is a Java-based template engine that provides a template language to reference objects defined in Java code. It aims to ensure clean separation between the presentation tier and business tiers in a Web application (the model–view–controller design pattern). Velocity is an open source software project hosted by the Apache Software Foundation. It is released under the Apache License.", "pageId": 2285690, "dailyPageViews": 82, "created": 2005, "backlinksCount": 209, "revisionCount": 133, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Apache_Velocity" }, "codeMirror": "velocity", "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "vm", "fhtml" ], "id": "Velocity" }, "helloWorldCollection": [ "\n\n\n #set( $foo = \"Hello World\" )\n $foo\n\n\n" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2018|Apress|Accelerating Development Velocity Using Docker: Docker Across Microservices|Jangla, Kinnary|9781484239360\n2022|Scholars International Publishing Corp.|Surfcam Velocity III|Su-Chen Jonathon Lin; Dave Zamora|9781886552210", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|A PDL Approach for Qualitative Velocity|10.1142/S021848851100685X|12|0|A. Burrieza and Emilio Muñoz-Velasco and M. Ojeda‐Aciego|90cdaccc42a799503cc5bfbba1c96b7c8e3a4a75\n2014|High velocity impact and fragmentation of concrete : numerical simulation|10.18419/OPUS-593|4|0|B. Irhan|b88d4658b6efbfb4fb6e23b3399376b77cb5788e" }, "apache": { "title": "APACHE", "appeared": 1961, "type": "pl", "reference": [ "https://semanticscholar.org/paper/85b663fe5cd3d2b73263f15522d9c2c028aa14ae" ], "country": [ "United States" ], "originCommunity": [ "EURATOM Computation Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2974", "wordRank": 4237, "centralPackageRepositoryCount": 0 }, "apacheconf": { "title": "ApacheConf", "appeared": 1995, "type": "application", "website": "https://httpd.apache.org/", "reference": [ "https://en.wikipedia.org/wiki/Apache_HTTP_Server" ], "country": [ "United States" ], "originCommunity": [ "Apache Software Foundation" ], "domainName": { "name": "httpd.apache.org" }, "githubLanguage": { "fileExtensions": [ "apacheconf", "vhost" ], "trendingProjectsCount": 0, "type": "data", "filenames": [ ".htaccess", "apache2.conf", "httpd.conf" ], "aceMode": "apache_conf", "tmScope": "source.apache-config", "aliases": [ "aconf", "apache" ], "id": "ApacheConf" }, "githubBigQuery": { "repos": 68565, "users": 55081, "id": "ApacheConf" }, "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ ".htaccess", "apache.conf", "apache2.conf" ], "id": "ApacheConf" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2016, "committerCount": 10, "commitCount": 93, "sampleCount": 1, "example": [ "#######################\n# HOSTNAME\n######################\n\n\n ServerAdmin patrick@heysparkbox.com\n DocumentRoot \"/var/www/HOSTNAME\"\n ServerName HOSTNAME\n\n \n Options Indexes MultiViews FollowSymLinks\n AllowOverride All\n Order allow,deny\n Allow from all\n DirectoryIndex index.php\n \n\n" ], "url": "https://github.com/textmate/apache.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "apar": { "title": "APAR", "appeared": 1958, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a74b671918bbfb9c0ecca06b75b871cf857340d9" ], "country": [ "United States" ], "originCommunity": [ "Sandia Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6025", "centralPackageRepositoryCount": 0 }, "aparel": { "title": "APAREL", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/45b7365ee5794b5fd6a33004455115e1906da41f" ], "country": [ "United States" ], "originCommunity": [ "The Rand Corp" ], "hopl": "https://hopl.info/showlanguage.prx?exp=365", "centralPackageRepositoryCount": 0 }, "ape100": { "title": "APE100", "appeared": 1995, "type": "pl", "country": [ "Italy" ], "originCommunity": [ "Istituto Nazionale di Fisica Nucleare" ], "wikipedia": { "summary": "APE100 was a family of SIMD supercomputers developed by the Istituto Nazionale di Fisica Nucleare (INFN) in Italy between 1989 and 1994. The systems were developed to study the structure of elementary particles by means of lattice gauge theories, especially quantum chromodynamics. APE (\"ah-pei\"), an acronym for Array Processor Experiment, was the collective name of several generations of massively parallel supercomputers since 1984, optimized for theoretical physics simulations. The APE machines were massively parallel 3D arrays of custom computing nodes with periodic boundary conditions. APE100 was developed at INFN in Rome and Pisa under the direction of Nicola Cabibbo. Each node was capable of 50MFLOPS so that the complete configuration with 2,048 nodes had a performance of 100GFLOPS. In 1991, it became the most powerful supercomputer in the world. A version of APE100 has been marketed by Alcatel Alenia Space under the name of Quadrics. After 1994 the project at INFN was continued with the new names APEmille and ApeNext.", "created": 2011, "backlinksCount": 3, "pageId": 32414162, "revisionCount": 4, "dailyPageViews": 2, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/APE100" }, "centralPackageRepositoryCount": 0 }, "apescript": { "title": "ApeScript", "appeared": 1995, "type": "pl", "wikipedia": { "example": [ "function( being ){\n number_b = 942 ;\n which_function = 2 ;\n offset_function = 15 ;\n which_function = 30 ;\n which_function = 151 ;\n run( which_function ){\n run( actual_three ){\n number_a = 932 ;\n number_a = 19572 ;\n number_a = 19699 ;\n }\n }\n number_result = 19699 ;\n }" ], "summary": "ApeScript is an interpreted procedural dynamic-typed language. It was developed for the Noble Ape Simulation through mid-2005 by Tom Barbalet. ApeScript was designed with the following specifications; simple language, stable memory footprint, minimal crashes, and, small code size.ApeScript is defined in the Noble Ape Simulation manual. Additional ApeScript tutorials are on the Noble Ape site.", "created": 2006, "backlinksCount": 6, "pageId": 3587360, "revisionCount": 17, "dailyPageViews": 3, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/ApeScript" }, "centralPackageRepositoryCount": 0 }, "apex": { "title": "Apex", "appeared": 2007, "type": "pl", "description": "Apex is a proprietary programming language provided by the Force.com platform to developers similar to Java and C#. It is a strongly typed, object-oriented, case-insensitive programming language, following a dot-notation and curly-brackets syntax. Apex can be used to execute programmed functions during most processes on the Force.com platform including custom buttons and links, event handlers on record insertion, update, or deletion, via scheduling, or via the custom controllers of Visualforce pages. Due to the multitenant nature of the platform, the language has strictly imposed governor limitations[61] to guard against any code monopolizing shared resources. Salesforce provides a series of asynchronous processing methods for Apex to allow developers to produce longer running and more complex Apex code.", "website": "https://developer.salesforce.com/docs/atlas.en-us.apexcode.meta/apexcode/apex_intro_what_is_apex.htm", "reference": [ "https://en.wikipedia.org/wiki/Salesforce.com#Apex" ], "originCommunity": [ "Salesforce" ], "firstAnnouncement": "http://www.zdnet.com/article/inside-the-salesforce-apex-language/", "announcementMethod": "interview", "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasInheritance": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "ABSTRACT", "Abstract", "activate", "ACTIVATE", "Activate", "and", "AND", "And", "any", "ANY", "Any", "array", "ARRAY", "Array", "as", "AS", "As", "asc", "ASC", "Asc", "assert", "ASSERT", "Assert", "autonomous", "AUTONOMOUS", "Autonomous", "begin", "BEGIN", "Begin", "bigdecimal", "BIGDECIMAL", "Bigdecimal", "blob", "BLOB", "Blob", "boolean", "BOOLEAN", "Boolean", "break", "BREAK", "Break", "bulk", "BULK", "Bulk", "by", "BY", "By", "case", "CASE", "Case", "cast", "CAST", "Cast", "catch", "CATCH", "Catch", "char", "CHAR", "Char", "class", "CLASS", "Class", "collect", "COLLECT", "Collect", "commit", "COMMIT", "Commit", "const", "CONST", "Const", "continue", "CONTINUE", "Continue", "convertcurrency", "CONVERTCURRENCY", "Convertcurrency", "decimal", "DECIMAL", "Decimal", "default", "DEFAULT", "Default", "delete", "DELETE", "Delete", "desc", "DESC", "Desc", "do", "DO", "Do", "double", "DOUBLE", "Double", "else", "ELSE", "Else", "end", "END", "End", "enum", "ENUM", "Enum", "exception", "EXCEPTION", "Exception", "exit", "EXIT", "Exit", "export", "EXPORT", "Export", "extends", "EXTENDS", "Extends", "false", "FALSE", "False", "final", "FINAL", "Final", "finally", "FINALLY", "Finally", "float", "FLOAT", "Float", "for", "FOR", "For", "from", "FROM", "From", "future", "FUTURE", "Future", "get", "GET", "Get", "global", "GLOBAL", "Global", "goto", "GOTO", "Goto", "group", "GROUP", "Group", "having", "HAVING", "Having", "hint", "HINT", "Hint", "if", "IF", "If", "implements", "IMPLEMENTS", "Implements", "import", "IMPORT", "Import", "in", "IN", "In", "inner", "INNER", "Inner", "insert", "INSERT", "Insert", "instanceof", "INSTANCEOF", "Instanceof", "int", "INT", "Int", "interface", "INTERFACE", "Interface", "into", "INTO", "Into", "join", "JOIN", "Join", "last_90_days", "LAST_90_DAYS", "Last_90_days", "last_month", "LAST_MONTH", "Last_month", "last_n_days", "LAST_N_DAYS", "Last_n_days", "last_week", "LAST_WEEK", "Last_week", "like", "LIKE", "Like", "limit", "LIMIT", "Limit", "list", "LIST", "List", "long", "LONG", "Long", "loop", "LOOP", "Loop", "map", "MAP", "Map", "merge", "MERGE", "Merge", "native", "NATIVE", "Native", "new", "NEW", "New", "next_90_days", "NEXT_90_DAYS", "Next_90_days", "next_month", "NEXT_MONTH", "Next_month", "next_n_days", "NEXT_N_DAYS", "Next_n_days", "next_week", "NEXT_WEEK", "Next_week", "not", "NOT", "Not", "null", "NULL", "Null", "nulls", "NULLS", "Nulls", "number", "NUMBER", "Number", "object", "OBJECT", "Object", "of", "OF", "Of", "on", "ON", "On", "or", "OR", "Or", "outer", "OUTER", "Outer", "override", "OVERRIDE", "Override", "package", "PACKAGE", "Package", "parallel", "PARALLEL", "Parallel", "pragma", "PRAGMA", "Pragma", "private", "PRIVATE", "Private", "protected", "PROTECTED", "Protected", "public", "PUBLIC", "Public", "retrieve", "RETRIEVE", "Retrieve", "return", "RETURN", "Return", "returning", "RETURNING", "Returning", "rollback", "ROLLBACK", "Rollback", "savepoint", "SAVEPOINT", "Savepoint", "search", "SEARCH", "Search", "select", "SELECT", "Select", "set", "SET", "Set", "short", "SHORT", "Short", "sort", "SORT", "Sort", "stat", "STAT", "Stat", "static", "STATIC", "Static", "strictfp", "STRICTFP", "Strictfp", "super", "SUPER", "Super", "switch", "SWITCH", "Switch", "synchronized", "SYNCHRONIZED", "Synchronized", "system", "SYSTEM", "System", "testmethod", "TESTMETHOD", "Testmethod", "then", "THEN", "Then", "this", "THIS", "This", "this_month", "THIS_MONTH", "This_month", "this_week", "THIS_WEEK", "This_week", "throw", "THROW", "Throw", "throws", "THROWS", "Throws", "today", "TODAY", "Today", "tolabel", "TOLABEL", "Tolabel", "tomorrow", "TOMORROW", "Tomorrow", "transaction", "TRANSACTION", "Transaction", "transient", "TRANSIENT", "Transient", "trigger", "TRIGGER", "Trigger", "true", "TRUE", "True", "try", "TRY", "Try", "type", "TYPE", "Type", "undelete", "UNDELETE", "Undelete", "update", "UPDATE", "Update", "upsert", "UPSERT", "Upsert", "using", "USING", "Using", "virtual", "VIRTUAL", "Virtual", "void", "VOID", "Void", "volatile", "VOLATILE", "Volatile", "webservice", "WEBSERVICE", "Webservice", "when", "WHEN", "When", "where", "WHERE", "Where", "while", "WHILE", "While", "yesterday", "YESTERDAY", "Yesterday" ], "githubLanguage": { "fileExtensions": [ "cls" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "java", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-java", "tmScope": "source.java", "repos": 22719, "id": "Apex" }, "githubBigQuery": { "repos": 778, "users": 537, "id": "Apex" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/apex", "monaco": "apex", "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 21, "commitCount": 283, "sampleCount": 6, "example": [ "public class GeoUtils {\n\t// generate a KML string given a page reference, call getContent() \n\t// then cleanup the output.\n\tpublic static string generateFromContent(PageReference pr) { \n\t\tstring ret = ''; \n\t\ttry { \n\t ret = (string) pr.getContent().toString();\n\t\t\t\n\t\t\tret = ret.replaceAll('\"','\\'' ); // get content produces quote chars \\\" \n\t ret = ret.replaceAll( '&','&');// we need to escape these in the node value\n } catch (exception e ) { \n \tsystem.debug( 'ERROR '+e); \n }\n \t\t\n \t\tret = ret.replaceAll('\\n',' ');\t// must use ALL since many new line may get \n ret = ret.replaceAll('\\r',' ');\t// get these also!\n // system.debug( ret); // dump the KML \n return ret ;\n\t}\n\t\n\tpublic static Map geo_response = new Map{'200'=>'G_GEO_SUCCESS',\n '400'=>'G_GEO_BAD_REQUEST',\n '500'=>'G_GEO_SERVER_ERROR',\n '601'=>'G_GEO_MISSING_ADDRESS',\n '602'=>'G_GEO_UNKNOWN_ADDRESS',\n '603'=>'G_GEO_UNAVAILABLE_ADDRESS',\n '604'=>'G_GEO_UNKNOWN_DIRECTIONS',\n '610'=>'G_GEO_BAD_KEY',\n '620'=>'G_GEO_TOO_MANY_QUERIES'\n };\n \n\tpublic static string accountAddressString ( account acct ) {\n \t// form an address string given an account object\n \tstring adr = acct.billingstreet + ',' + acct.billingcity + ',' + acct.billingstate; \n if ( acct.billingpostalcode != null ) adr += ',' + acct.billingpostalcode; \n if ( acct.billingcountry != null ) adr += ',' + acct.billingcountry; \n adr = adr.replaceAll('\\\"', '' );\n adr = adr.replaceAll('\\'', '' );\n adr = adr.replaceAll( '\\n', ' ' ); \n adr = adr.replaceAll( '\\r', ' ' ); \n system.debug( adr ); \n return adr;\t\n }\n \n\tpublic static testmethod void t1() { \n\t\tPageReference pageRef = Page.kmlPreviewTemplate;\n Test.setCurrentPage(pageRef);\n system.assert ( GeoUtils.generateFromContent( pageRef ) != null );\n Account a = new Account( name='foo', billingstreet='main', billingcity='springfield',billingstate='il',\n billingpostalcode='9',billingcountry='us');\n insert a;\n system.assertEquals( 'main,springfield,il,9,us',accountAddressString( a) );\n \n\t}\n}" ], "url": "https://github.com/textmate/java.tmbundle" }, "languageServerProtocolProject": [ "https://marketplace.visualstudio.com/items?itemName=salesforce.salesforcedx-vscode-apex\nwrittenIn typescript" ], "leachim6": { "filepath": "a/Apex.cls", "fileExtensions": [ "cls" ], "example": [ "global with sharing class HelloWorld {\n global static void main() {\n System.debug('Hello World');\n }\n}" ], "id": "Apex" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Apex", "tiobe": { "currentRank": 43, "id": "Apex" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|Desaware Publishing|Advanced Apex Programming for Salesforce.com and Force.com|Appleman, Dan|9781936754106\n2010|Packt Publishing|Oracle Apex 4.0 Cookbook|M. van Zoest and M. van der Plas|9781849681346\n2018|Desaware Publishing|Advanced Apex Programming in Salesforce|Appleman, Dan|9781936754120\n2021|Desaware Publishing|Advanced Apex Programming in Salesforce|Appleman, Dan|9781936754144\n2021|Desaware Publishing|Advanced Apex Programming in Salesforce|Appleman, Dan|9781936754151\n2020|BPB Publications|Learning Salesforce Development with Apex: Write, Run and Deploy Apex Code with Ease (English Edition)|Battisson, Paul|9789389898187\n2020-11-20T00:00:01Z|Packt Publishing|Mastering Apex Programming: A developer's guide to learning advanced techniques and best practices for building robust Salesforce applications|Battisson, Paul|9781800200920\n2016|Packt Publishing|Apex Design Patterns: Harness the power of Apex design patterns to build robust and scalable code architectures on the Force.com platform|Zaa, Jitendra and Verma, Anshul|9781782173656\n2013-10-25T00:00:01Z|Desaware Publishing|Advanced Apex Programming for Salesforce.com and Force.com|Appleman, Dan|9781936754076\n2015|Packt Publishing|Learning Apex Programming|Kaufman, Matt and Wicherski, Michael|9781782173977\n2013|Packt Publishing|Oracle APEX Cookbook, Second Edition|der Plas, Marcel van and Zoest, Michel van|9781782179689\n2017|McGraw-Hill Education|Oracle Application Express: Build Powerful Data-Centric Web Apps with APEX (Oracle Press)|Geller, Arie and Spendolini, Brian|9780071843041\n20150131|Packt Publishing|Learning Apex Programming|Matt Kaufman; Michael Wicherski|9781782173984\n27-04-2016|Packt Publishing|Apex Design Patterns|Jitendra Zaa|9781782173663\n20-11-2020|Packt Publishing|Mastering Apex Programming|Paul Battisson; Mike Wheeler|9781800204331\n2010-12-14|Packt Publishing|Oracle APEX 4.0 Cookbook|Michel van Zoest and Marcel van der Plas|9781849681353\n20200921|Springer Nature|Understanding Oracle APEX 20 Application Development|Edward Sciore|9781484261651\n2012|Desaware Publishing|Advanced Apex Programming For Salesforce.com And Force.com|Dan Appleman|9781936754052\n20170505|McGraw-Hill Professional|Oracle Application Express: Build Powerful Data-Centric Web Apps with APEX|Arie Geller; Brian Spendolini|9780071843065" }, "api-blueprint": { "title": "API Blueprint", "appeared": 2013, "type": "pl", "website": "https://apiblueprint.org", "documentation": [ "https://apiblueprint.org/documentation/" ], "country": [ "United States" ], "originCommunity": [ "API Blueprint" ], "domainName": { "registered": 2013, "awisRank": { "2022": 732854 }, "name": "apiblueprint.org" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "githubRepo": { "firstCommit": 2013, "stars": 8411, "forks": 2190, "subscribers": 208, "created": 2013, "updated": 2022, "description": "API Blueprint", "issues": 64, "url": "https://github.com/apiaryio/api-blueprint" }, "repoStats": { "firstCommit": 2013, "commits": 432, "committers": 63, "files": 31 }, "githubLanguage": { "fileExtensions": [ "apib" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "markdown", "tmScope": "text.html.markdown.source.gfm.apib", "repos": 14496, "id": "API Blueprint" }, "githubBigQuery": { "repos": 810, "users": 698, "id": "API Blueprint" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 15, "commitCount": 72, "sampleCount": 3, "example": [ "FORMAT: 1A\n\n# The Simplest API\nThis is one of the simplest APIs written in the **API Blueprint**.\nOne plain resource combined with a method and that's it! We will explain what is going on in the next installment - [Resource and Actions](02.%20Resource%20and%20Actions.md).\n\n**Note:** As we progress through the examples, do not also forget to view the [Raw](https://raw.github.com/apiaryio/api-blueprint/master/examples/01.%20Simplest%20API.md) code to see what is really going on in the API Blueprint, as opposed to just seeing the output of the Github Markdown parser.\n\nAlso please keep in mind that every single example in this course is a **real API Blueprint** and as such you can **parse** it with the [API Blueprint parser](https://github.com/apiaryio/drafter) or one of its [bindings](https://github.com/apiaryio/drafter#bindings).\n\n## API Blueprint\n+ [This: Raw API Blueprint](https://raw.github.com/apiaryio/api-blueprint/master/examples/01.%20Simplest%20API.md)\n+ [Next: Resource and Actions](02.%20Resource%20and%20Actions.md)\n\n# GET /message\n+ Response 200 (text/plain)\n\n Hello World!" ], "url": "https://github.com/apiaryio/api-blueprint-sublime-plugin" }, "twitter": "https://twitter.com/apiblueprint", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "apl-gpss": { "title": "APL-GPSS", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/88dbb8eedbbd857bcfd05d4f879e19e0df4edc1b" ], "country": [ "The Netherlands" ], "originCommunity": [ "Institute for Theoretical Biology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8247", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "apl-hp": { "title": "APL/HP", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0273985cb1e7cd38b9d97fc8ac130890717bd19b" ], "country": [ "Australia" ], "originCommunity": [ "C.A.READ & ASSOCIATES PTY LIMITED" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6957", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "apl-z80": { "title": "APL/Z80", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8530d52d22e6eb54eaf3326799682079f3514884" ], "country": [ "United States" ], "originCommunity": [ "Trinity University", "Vanguard Systems Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8253", "centralPackageRepositoryCount": 0 }, "apl": { "title": "APL", "appeared": 1964, "type": "pl", "creators": [ "Kenneth E. Iverson" ], "webRepl": [ "https://tryapl.org/" ], "documentation": [ "https://xosnitc.github.io/apl-spec.html" ], "standsFor": "A Programming Language", "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasLineComments": { "example": "⍝ A comment", "value": true }, "hasFunctionComposition": { "example": "foo←f∘g", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "lineCommentToken": [ [ "⍝" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "txt←'

This is emphasized text.

'\n⎕←{⍵/⍨~{⍵∨≠\\⍵}⍵∊'<>'}txt" ], "related": [ "aplx", "j", "go", "k", "matlab", "nial", "polymorphic-programming-language", "q", "s", "sac-programming-language", "speakeasy", "wolfram", "1620sps", "basic", "music-sp", "unix", "isbn", "ascii", "cobol", "java", "linux", "ruby", "r", "unicode", "c", "fortran", "csharp", "cil", "excel-app", "octave", "scilab", "lyapas", "rpl" ], "summary": "APL (named after the book A Programming Language) is a programming language developed in the 1960s by Kenneth E. Iverson. Its central datatype is the multidimensional array. It uses a large range of special graphic symbols to represent most functions and operators, leading to very concise code. It has been an important influence on the development of concept modeling, spreadsheets, functional programming, and computer math packages. It has also inspired several other programming languages. It is still used today for certain applications.", "pageId": 1451, "dailyPageViews": 680, "created": 2001, "backlinksCount": 388, "revisionCount": 1557, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/APL_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "apl", "dyalog" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "apl", "aplx", "dyalog" ], "aceMode": "text", "codemirrorMode": "apl", "codemirrorMimeType": "text/apl", "tmScope": "source.apl", "repos": 416, "id": "APL" }, "githubBigQuery": { "repos": 95, "users": 87, "id": "APL" }, "codeMirror": "apl", "pygmentsHighlighter": { "filename": "apl.py", "fileExtensions": [ "apl", "aplf", "aplo", "apln", "aplc", "apli", "dyalog" ], "id": "APL" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 1, "commitCount": 99, "sampleCount": 3, "example": [ "#!/usr/local/bin/apl --script\nNEWLINE ← ⎕UCS 10\nHEADERS ← 'Content-Type: text/plain', NEWLINE\nHEADERS\n⍝ ⎕←HEADERS\n⍝ ⍕⎕TS\n)OFF\n" ], "url": "https://github.com/Alhadis/language-apl.git" }, "projectEuler": { "memberCount": { "2019": 332, "2022": 2478 }, "id": "APL/J/K" }, "helloWorldCollection": [ "⍝ Hello World in APL\n\n⎕←\\'Hello World\\'" ], "leachim6": { "filepath": "a/APL.apl", "fileExtensions": [ "apl" ], "example": [ "⎕←'Hello World'\n\n" ], "id": "APL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:APL", "rijuRepl": { "example": [ "'Hello, world!'\n" ], "description": "Array-based programming language using large range of special symbols for concision", "fileExtensions": [ "apl" ], "gitRepo": "https://savannah.gnu.org/svn/?group=apl", "id": "https://riju.codes/apl" }, "replit": "https://repl.it/languages/apl", "stackOverflowSurvey": { "2021": { "users": 536, "medianSalary": 75631, "fans": 568, "percentageUsing": 0.01 } }, "tiobe": { "id": "APL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=18", "jupyterKernel": [ "https://github.com/Dyalog/dyalog-jupyter-kernel" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1988|Springer|An Apl Compiler|Timothy Budd|9780387966434\n1976|Winthrop Publishers|Structured programming in APL (Winthrop computer systems series)|Geller, Dennis P|9780876268599\n1970|Van Nost. Reinhold|Apl Programming and Computer Techniques|Katzan, Harry|9780442242510\n1981|Springer|Computing in Statistical Science through APL (Springer Series in Statistics)|Anscombe, Francis John|9780387905495\n||Apl Programming Language Family: Apl, J, Criticism Of Apl, Apl Syntax And Symbols, K, Apl, Scientific Time Sharing Corporation, Rank|Books and LLC|9781155513959\n2010||Apl (programming Language)|Miller and Frederic P. and Vandome and Agnes F. and McBrewster and John|9786132579935\n1978|Prentice-hall|Applied Apl Programming|Wilbur R Le Page|9780130400635\n1974|Petrocelli Books|Handbook Of Apl Programming|Clark Wiedmann|9780884050261\n1976|W. C. Brown Co. Publishers|Fundamentals Of Apl Programming|Paulman, Jack.|9780697081193\n1974|Petrocelli Books|Handbook Of Apl Programming|Clark Wiedmann|9780884050612\n2013|Springer-verlag|Einführung In Die Programmiersprache Apl|Peter P. Bothner and Wolf-Michael Kähler|9783663141617\n1977|Wiley|Introduction To Apl And Computer Programming|Edward Harms|9780471352013\n1992|Crc Press|Encyclopedia Of Microcomputers: Volume 9 - Icon Programming Language To Knowledge-based Systems: Apl Techniques (microcomputers Encyclopedia)|Allen Kent and James G. Williams|9780824727086", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1979|Programming with idioms in APL|10.1145/800136.804466|30|0|A. Perlis and S. Rugaber|f623a6274d803e43b54f59aae1347980b68acb8e\n2002|The Agent-based Programming Language: APL|10.1145/508791.508799|19|0|Chang-Hyun Jo and Allen J. Arnold|41310f13f4382999687e63e8c1e8f47fab01f230\n1986|LOGOS: An APL programming environment|10.1145/22415.22054|7|0|D. B. Allen and Leslie H. Goldsmith and Mark R. Dempsey and Kevin L. Harrell|b7a312ddc5cee5a105176ea4e4e41f20159bfb93\n1979|Introduction to APL and computer programming|10.1145/586058.586070|5|0|E. R. Mullins|75247adbe4b630f5dfcdd873e12992af620697a2\n1974|APLGOL - A Structured Programming Language for APL|10.1007/3-540-07131-8_25|5|0|H. Kolsky|f086795fbe65790a3337afa004b9191eb9ca80fd\n1974|APLGOL-2 a structured programming language system for APL|10.1145/800269.810821|5|0|Robert A. Kelley and J. R. Walters|8685983c85e8bad6270373694ad2e12e6367315d\n1989|Object oriented programming in AIDA APL|10.1145/75144.75167|4|0|M. Gfeller|16c84df489224ba91ebae8ab89111fdecac5daf5\n1980|APL as a Software Design Specification Language|10.1093/comjnl/23.3.230|4|1|W. Jones and S. Kirk|ae89a6d335e30fdc78a0b3dd2d12c4b0046f41ef\n1975|Is APL a Viable Programming Language?|10.1093/comjnl/18.4.318|4|0|R. Earnshaw|70d0dcea9dd4deb149fea2eb158b0ba391352cd1\n1990|The A+ programming language, a different APL|10.1145/97808.97621|4|0|J. Girardot|d791aecd0f6fde993fcfe56fcf11d2ba16342166\n1986|Extending APL to logic programming|10.1145/22415.22047|3|0|M. Alfonseca and M. Tobar|b88e6ab10eec875de707100b77bf7853b8b33eb5\n1984|Logic programming in APL|10.1145/800058.801103|2|0|R. Jernigan|6c977a8df107b3d97bd154615338e8ea373a4543\n1991|APL as an embedded language: the ultimate application?|10.1145/114054.114075|2|0|J. Girardot|b6ec374fbf3e3adb65049c11d5b5c5b6b5ada232\n1990|Programming ecology or APL and the world at large|10.1145/97808.97853|2|0|J. Lucas|4598098f83d5892f8f7e82d2f0578cad6208496b\n1991|Notes on C programming for APL programmers|10.1145/114054.114069|2|0|Stephen Deerhake|794f33cd75666c9d23542818c9f5ecc60dfe1049\n1982|Mathematical Programming Algorithms in APL|10.1007/978-3-642-95406-1_28|2|0|H. Crowder|5e02bfe2fa2b0a24c7f8d8256c514289da8fa3d8\n1978|Is APL a Programming Language?|10.1093/comjnl/21.2.128|2|0|W. Holmes|5d7a1e874961fc12e9d5fafa2e395085208a6e73\n2015|Compiling APL to accelerate through a typed array intermediate language|10.1145/2774959.2774966|2|0|Michael Budde and M. Dybdal and M. Elsman|4cfa806596ed3791d36ba88144514ae20e2c8592\n1978|Programming errors in APL|10.1145/586040.586045|1|0|G. Kearsley|0147995cf57130132be872de384a631606a30422\n1974|Limitations of APL as a language for student-computer dialogs|10.1145/585882.585887|1|0|A. Bork|363a3b9c42043dedf70b61e2de540ff3986effa8\n1976|Functions in APL to assist the programming and servicing of CAI-Lessons|10.1145/800114.803684|1|0|Georg R. Lampl and Isolde Schell-Haungs|e94e979493cd406942651ab23da266be572eb62c\n1976|Structured Programming in APL|10.1145/585987.585995|1|0|K. Smillie|3b7628eed2465e2a464cc7415267f6effb7b0b1f\n1987|APL — a higher level language|10.1007/978-1-349-08004-5_6|1|0|A. N. Barrett and A. Mackay|4bd0a7eb39e11bfb82e9480deadd5f57fbe6d029\n1986|Japanese APL language system on IBM Multistation 5550|10.1145/22415.22055|1|0|M. Udo and Y. Akimoto and S. Kaneko and T. Sanuki and M. Alfonseca|c4cb6a9d03d8b209c486983e5c1358ff4a836289\n1983|The current programming language standards scene XIVA: APL|10.1016/0167-8051(83)90017-7|1|0|J. Sykes|8bb4c670776f3cc9352fca29e326201e13107eb9\n1979|Applied APL programming|10.1145/586058.586071|1|0|Michael C. Powell|24ec84c729ffce1b7237efd7d860fcebc9580dc8\n1979|Teaching Mathematics via APL (A Programming Language).|10.5951/MT.72.2.0097|1|0|H. Peelle|e1a1a024f948575b7413d5b7095dc84b189edaa7\n1992|The CTalk programming language: a strategic evolution of APL|10.1145/144045.144088|1|0|J. Girardot|5dc43e3ca62e86deabb707ff14aa6b47a2fd36b9" }, "apl2": { "title": "APL2", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/510e2707a0461d4b803f6f0da22f529900cbcc8d" ], "country": [ "Australia" ], "originCommunity": [ "Monash University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1068", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|Parallel Expression in the APL2 Language|10.1147/sj.304.0498|15|0|Robert G. Willhoft|4a08e411712d63ac392401d79ba5e8a2f519d32c\n1986|Logic programming in APL2|10.1145/22415.22049|7|0|James A. Brown and J. H. Cook and Leo H. Groner and Edward V. Eusebi|406e1e17e07571ee4aa9d50b655a227357244e3f\n1984|Cultivating trees - an essay in APL2|10.1145/800058.801119|4|0|N. Thomson|65a1d0c22112d3b64796424efb2b8e759bb551e5\n1994|Using APL2 to Create an Object-Oriented Environment for Statistical Computation|10.1080/10618600.1994.10474654|4|0|M. Friendly and J. Fox|a359b41ea5934f91a0e1a137b59b132c5621aa70\n1986|APL2 and AI: a study of search|10.1145/22415.22051|3|0|Edward V. Eusebi and James A. Brown|5b1ccae9464b03196a96df34502d8d1103ac66fe\n1991|Comparison of the functional power of APL2 and FORTRAN 90|10.1145/114054.114094|3|0|Robert G. Willhoft|b42093d52cdb2d3a68ce47e640b2f9dcc6d777a5\n1995|Data Analysis Using APL2 and APL2STAT|10.1177/0049124195023003002|2|0|J. Fox and M. Friendly|f437b8524ef31b3ce413ef18c96b3a1d56da0ed1\n1994|An object-oriented APL2|10.1145/190271.190306|2|0|David Selby|3f892a43dd5ea0cd8fb651df342fa06afff6ee24\n1995|Is APL2 a good programming language?|10.1145/206913.206946|2|0|N. Beaumont|510e2707a0461d4b803f6f0da22f529900cbcc8d\n1992|Object oriented graphics in APL2|10.1145/144045.144062|1|0|M. Alfonseca|2227ba73ca6a23860f8cd9f89f9518663f02cb06\n1988|Eine Entwicklungsumgebung Fuer die Wissensbasierte Bildanalyse in APL2|10.1007/978-3-642-48706-4_87|1|0|U. Engelmann and H. Meinzer and Th. Gerneth|ce929d2fc29dc723d0c30b7aadda4d9919e77b10" }, "aplette": { "title": "aplette", "appeared": 2014, "type": "pl", "githubRepo": { "firstCommit": 2014, "stars": 83, "forks": 2, "subscribers": 5, "created": 2017, "updated": 2021, "description": "This is a new take on an old language: APL. The goal is to pare APL down to its elegant essence. This version of APL is oriented toward scripting within a Unix-style computing environment.", "issues": 0, "url": "https://github.com/gregfjohnson/aplette" }, "repoStats": { "firstCommit": 2014, "commits": 217, "committers": 9, "files": 386 } }, "aplgol-2": { "title": "APLGOL-2", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8685983c85e8bad6270373694ad2e12e6367315d" ], "country": [ "United States" ], "originCommunity": [ "International Business Machines" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4379", "centralPackageRepositoryCount": 0 }, "aplgol": { "title": "APLGOL", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/250b6e9a4f167e7e9e7430d9a22ee70c36e41f91" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1828", "centralPackageRepositoryCount": 0 }, "aplo": { "title": "APLO", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9e1e54cffa7123cd15b2d81901b76109f629c47f" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8246", "centralPackageRepositoryCount": 0 }, "aplus": { "title": "A+", "appeared": 1988, "type": "pl", "creators": [ "Arthur Whitney" ], "website": "http://www.aplusdev.org/", "country": [ "United States" ], "originCommunity": [ "Morgan Stanley" ], "domainName": { "awisRank": { "2022": 5856517 }, "name": "aplusdev.org" }, "wikipedia": { "related": [ "apl", "k", "unix", "linux", "j" ], "summary": "A+ is an array programming language descendent from the programming language A, which in turn was created to replace APL in 1988. Arthur Whitney developed the A portion of A+, while other developers at Morgan Stanley extended it, adding a graphical user interface and other language features. A+ is a high-level, interactive, interpreted language, designed for numerically intensive applications, especially those found in financial applications. A+ runs on many Unix variants, including Linux. It is free and open source software released under a GNU General Public License. A+ provides an extended set of functions and operators, a graphical user interface with automatic synchronizing of widgets and variables, asynchronous executing of functions associated with variables and events, dynamic loading of user compiled subroutines, and other features. A newer graphical user interface has not yet been ported to all supported platforms The A+ language implements the following changes to the APL language: an A+ function may have up to nine formal parameters A+ code statements are separated by semicolons, so a single statement may be divided into two or more physical lines The explicit result of a function or operator is the result of the last statement executed A+ implements an object called a dependency, which is a global variable (the dependent variable) and an associated definition that is like a function with no arguments. Values can be explicitly set and referenced in exactly the same ways as for a global variable, but they can also be set through the associated definition.Interactive A+ development is primarily done in the Xemacs editor, through extensions to the editor. Because A+ code uses the original APL symbols, displaying A+ requires a font with those special characters; a font named kapl is provided on the web site for that purpose. Arthur Whitney went on to create a proprietary array language named K. Like J, K omits the APL character set. It lacks some of the perceived complexities of A+, such as the existence of statements and two different modes of syntax.", "pageId": 890931, "created": 2008, "backlinksCount": 71, "revisionCount": 1, "dailyPageViews": 57, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/A+_(programming_language)" }, "rijuRepl": { "example": [ "'Hello, world!'\n" ], "id": "https://riju.codes/aplus" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1531", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "aplusplus": { "title": "A++", "appeared": 1996, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "Bull's Software-Haus" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "isbn" ], "summary": "A++ stands for abstraction plus reference plus synthesis which is used as a name for the minimalistic programming language that is built on ARS. ARS is an abstraction from the Lambda Calculus, taking its three basic operations, and giving them a more general meaning, thus providing a foundation for the three major programming paradigms: functional programming, object-oriented programming and imperative programming. ARS Based Programming is used as a name for programming which consists mainly of applying patterns derived from ARS to programming in any language. The technical texts in this article are taken from the online version of the 1st edition of the A++-book.The 2nd edition of the book A++ The Smallest Programming Language in the World (292 pages) was published in 2018.", "pageId": 425819, "created": 2001, "backlinksCount": 23, "revisionCount": 4661, "dailyPageViews": 38, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/A++" }, "leachim6": { "filepath": "a/A++", "example": [ "(print \"Hello World\")" ], "id": "A++" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "aplx": { "title": "APLX", "appeared": 1985, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "MicroAPL, Ltd" ], "wikipedia": { "related": [ "apl", "linux", "xml" ], "summary": "APLX is a cross-platform dialect of the programming language APL, created by British company MicroAPL, Ltd. APLX is intended for uses such as financial planning, market research, statistics, management information, and various kinds of scientific and engineering work. APLX is based on IBM's APL2, but includes several extensions. APLX version 3 was released in April and May 2005. It is available on Microsoft Windows, Linux, and macOS. Though APLX keeps APL's extended character set, APLX is a bit more verbose, due to the prevalence of system functions with long names, and the use of structured-control keywords. The use of explicit loops is a major deviation from earlier APL versions and derivatives. Other extensions include: Object-oriented programming Support for .NET Framework, ActiveX, operating system resources, and connectivity Extensible Markup Language (XML) array conversion primitivesEffective July 11, 2016, MicroAPL withdrew APLX from commercial sale. British firm Dyalog, authors of APL2000, began hosting the APLX Archive website including the download area and documentation.", "created": 2004, "backlinksCount": 45, "pageId": 933780, "revisionCount": 25, "dailyPageViews": 8, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/APLX" }, "centralPackageRepositoryCount": 0 }, "apollo-guidance-computer": { "title": "AGC", "appeared": 1966, "type": "assembly", "documentation": [ "https://www.ibiblio.org/apollo/assembly_language_manual.html" ], "standsFor": "Apollo Guidance Computer", "country": [ "United States" ], "originCommunity": [ "MIT Instrumentation Laboratory", "Charles Stark Draper Laboratory", "Raytheon" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "SWCHSET STORE NOMTPI\nINTLOOP DLOAD DAD\n TTPI\n NOMTPI\n STCALL TDEC1\n PRECSET\n CALL\n S33/34.1\n BZE EXIT\n SWCHCLR\n TC ALARM\n OCT 611\n CAF V05N09\n TC BANKCALL\n CADR GOFLASH\n TC GOTOPOOH\n TC P34/P74A # PROCEED\n TC -7 # V32" ], "wikipedia": { "related": [ "si", "assembly-language" ], "summary": "The Apollo Guidance Computer (AGC) was a digital computer produced for the Apollo program that was installed on board each Apollo Command Module (CM) and Lunar Module (LM). The AGC provided computation and electronic interfaces for guidance, navigation, and control of the spacecraft. The AGC has a 16-bit word length, with 15 data bits and one parity bit. Most of the software on the AGC is stored in a special read-only memory known as core rope memory, fashioned by weaving wires through magnetic cores, though a small amount of read-write core memory is available. Astronauts communicated with the AGC using a numeric display and keyboard called the DSKY (DiSplay&KeYboard, pronounced 'DISS-key'). The AGC and its DSKY user interface were developed in the early 1960s for the Apollo program by the MIT Instrumentation Laboratory and first flew in 1966. The AGC was one of the first integrated circuit-based computers. The computer's performance was comparable to the first generation of home computers from the late 1970s, such as the Apple II, TRS-80, and Commodore PET.", "backlinksCount": 174, "pageId": 188887, "created": 2003, "revisionCount": 733, "dailyPageViews": 561, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/Apollo_Guidance_Computer" }, "githubLanguage": { "fileExtensions": [ "agc" ], "trendingProjectsCount": 0, "type": "programming", "group": "Assembly", "aceMode": "assembly_x86", "tmScope": "source.agc", "repos": 210, "id": "Apollo Guidance Computer" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 1, "commitCount": 17, "sampleCount": 1, "example": [ "# Copyright:\tPublic domain.\n# Filename:\tBURN_BABY_BURN--MASTER_IGNITION_ROUTINE.agc\n# Purpose: \tPart of the source code for Luminary 1A build 099.\n#\t\tIt is part of the source code for the Lunar Module's (LM)\n#\t\tApollo Guidance Computer (AGC), for Apollo 11.\n# Assembler:\tyaYUL\n# Contact:\tRon Burkey .\n# Website:\twww.ibiblio.org/apollo.\n# Pages:\t731-751\n# Mod history:\t2009-05-19 RSB\tAdapted from the corresponding \n#\t\t\t\tLuminary131 file, using page \n#\t\t\t\timages from Luminary 1A.\n#\t\t2009-06-07 RSB\tCorrected 3 typos.\n#\t\t2009-07-23 RSB\tAdded Onno's notes on the naming\n#\t\t\t\tof this function, which he got from\n#\t\t\t\tDon Eyles.\n#\n# This source code has been transcribed or otherwise adapted from\n# digitized images of a hardcopy from the MIT Museum. The digitization\n# was performed by Paul Fjeld, and arranged for by Deborah Douglas of\n# the Museum. Many thanks to both. The images (with suitable reduction\n# in storage size and consequent reduction in image quality as well) are\n# available online at www.ibiblio.org/apollo. If for some reason you\n# find that the images are illegible, contact me at info@sandroid.org\n# about getting access to the (much) higher-quality images which Paul\n# actually created.\n#\n# Notations on the hardcopy document read, in part:\n#\n#\tAssemble revision 001 of AGC program LMY99 by NASA 2021112-61\n#\t16:27 JULY 14, 1969 \n\n# Page 731\n## At the get-together of the AGC developers celebrating the 40th anniversary\n## of the first moonwalk, Don Eyles (one of the authors of this routine along\n## with Peter Adler) has related to us a little interesting history behind the\n## naming of the routine.
\n##
\n## It traces back to 1965 and the Los Angeles riots, and was inspired \n## by disc jockey extraordinaire and radio station owner Magnificent Montague.\n## Magnificent Montague used the phrase \"Burn, baby! BURN!\" when spinning the \n## hottest new records. Magnificent Montague was the charismatic voice of\n## soul music in Chicago, New York, and" ], "url": "https://github.com/Alhadis/language-agc" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Apollo Guidance Computer: Architecture And Operation (Springer Praxis Books / Space Exploration)|2010|Frank O'Brien|10605768|4.26|69|9\nNoise margin testing of the Apollo guidance computer||J.J. Rocchio|16376445|0.0|0|0\nApollo guidance computer and associated ground support equipment Quarterly technical report, 1 Apr. - 30 Jun. 1964||NoN|16376441|0.0|0|0", "isbndb": "", "semanticScholar": "" }, "apostle": { "title": "APOSTLE", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e80d54fe0e00c854a20a17b7980bd8c16ff56e0c" ], "country": [ "United Kingdom" ], "originCommunity": [ "Defence Research Agency" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7565", "centralPackageRepositoryCount": 0 }, "appcode-editor": { "title": "appcode-editor", "appeared": 2016, "type": "editor" }, "appl-a": { "title": "APPL/A", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/21a38ad09a5345cc659e24917a5422758545e370" ], "country": [ "United States" ], "originCommunity": [ "University of Massachusetts", "University of Colorado" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3816", "centralPackageRepositoryCount": 0 }, "apple-1-machine": { "title": "Apple I", "appeared": 1976, "type": "computingMachine", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Apple_I" } }, "apple-basic": { "title": "Apple BASIC", "appeared": 1978, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "related": [ "hp-time-shared-basic", "applesoft-basic", "basic", "microsoft-basic", "altair-basic", "assembly-language" ], "summary": "Integer BASIC, written by Steve Wozniak, is the BASIC interpreter of the Apple I and original Apple II computers. Originally available on cassette, then included in ROM on the original Apple II computer at release in 1977, it was the first version of BASIC used by many early home computer owners.Integer BASIC was phased out in favor of Applesoft BASIC starting with the Apple II Plus in 1979. This was a licensed but modified version of Microsoft BASIC, which included the floating point support missing in Integer BASIC.", "created": 2006, "backlinksCount": 116, "pageId": 310928, "revisionCount": 1, "dailyPageViews": 8, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Apple_BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "apple-prodos": { "title": "Apple ProDOS", "appeared": 1983, "type": "os", "country": [ "United States" ], "originCommunity": [ "Apple Computer" ], "wikipedia": { "related": [ "integer-basic", "applesoft-basic", "ucsd-pascal", "fat" ], "summary": "ProDOS is the name of two similar operating systems for the Apple II series of personal computers. The original ProDOS, renamed ProDOS 8 in version 1.2, is the last official operating system usable by all 8-bit Apple II series computers, and was distributed from 1983 to 1993. The other, ProDOS 16, was a stop-gap solution for the 16-bit Apple IIGS that was replaced by GS/OS within two years.ProDOS was marketed by Apple as meaning Professional Disk Operating System, and became the most popular operating system for the Apple II series of computers 10 months after its release in January 1983.", "created": 2003, "backlinksCount": 130, "pageId": 253838, "dailyPageViews": 43, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Apple_ProDOS" }, "centralPackageRepositoryCount": 0 }, "applescript": { "title": "Applescript", "appeared": 1993, "type": "pl", "website": "https://developer.apple.com/library/content/documentation/AppleScript/Conceptual/AppleScriptX/AppleScriptX.html", "documentation": [ "https://developer.apple.com/library/archive/documentation/AppleScript/Conceptual/AppleScriptLangGuide/introduction/ASLR_intro.html" ], "fileExtensions": [ "scpt", "scptd", "AppleScript" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "influencedBy": [ "hypertalk" ], "hasComments": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasMessagePassing": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "-- [-+]?(\\d+\\.\\d*|\\d*\\.\\d+)(E[-+][0-9]+)?", "value": true }, "hasIntegers": { "example": "-- [-+]?\\d+", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "(*", "*)" ] ], "printToken": [ [ "display", "dialog" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "tell application \"Finder\"\n\tset anyNumber to my (random number from 5 to 50)\nend tell" ], "related": [ "hypertalk", "rexx", "hypercard", "ios", "xpath", "javascript", "perl", "python", "ruby", "tcl" ], "summary": "AppleScript is a scripting language created by Apple Inc. and built into the Classic Mac OS since System 7 and into all versions of macOS. The term \"AppleScript\" may refer to the scripting system itself, to an individual script written in the AppleScript language, or to the language itself.", "pageId": 88392, "dailyPageViews": 200, "created": 2002, "backlinksCount": 496, "revisionCount": 791, "appeared": 1993, "fileExtensions": [ "scpt", "scptd", "AppleScript" ], "url": "https://en.wikipedia.org/wiki/AppleScript" }, "githubLanguage": { "fileExtensions": [ "applescript", "scpt" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "osascript" ], "aceMode": "applescript", "tmScope": "source.applescript", "aliases": [ "osascript" ], "repos": 3425, "id": "AppleScript" }, "githubBigQuery": { "repos": 4075, "users": 3803, "id": "AppleScript" }, "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "applescript" ], "id": "AppleScript" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2017, "committerCount": 12, "commitCount": 198, "sampleCount": 7, "example": [ "(*\nGet User Name\n\nThis script uses UI element scripting to get the name for the\ncurrent user.\n\nIf \"Enable access for assistive devices\" is not checked,\nthis script will open the Universal Access System Preference and ask\nthe user to check the checkbox.\n\nCopyright 2007 Apple Inc.\n\nYou may incorporate this Apple sample code into your program(s) without\nrestriction. This Apple sample code has been provided \"AS IS\" and the\nresponsibility for its operation is yours. You are not permitted to\nredistribute this Apple sample code as \"Apple sample code\" after having\nmade changes. If you're going to redistribute the code, we require\nthat you make it clear that the code was descended from Apple sample\ncode, but that you've made changes.\n*)\n\ntell application \"System Preferences\"\n\tactivate\n\tset current pane to pane \"com.apple.preferences.users\"\nend tell\n\ntell application \"System Events\"\n\tif UI elements enabled then\n\t\ttell tab group 1 of window \"Accounts\" of process \"System Preferences\"\n\t\t\tclick radio button 1\n\t\t\tdelay 2\n\t\t\tget value of text field 1\n\t\tend tell\n\telse\n\t\ttell application \"System Preferences\"\n\t\t\tactivate\n\t\t\tset current pane to pane \"com.apple.preference.universalaccess\"\n\t\t\tdisplay dialog \"UI element scripting is not enabled. Check \\\"Enable access for assistive devices\\\"\"\n\t\tend tell\n\tend if\nend tell" ], "url": "https://github.com/textmate/applescript.tmbundle" }, "helloWorldCollection": [ "-- \"Hello World\" in AppleScript:\n\ndisplay dialog \"Hello World\"\n" ], "leachim6": { "filepath": "a/AppleScript.scpt", "fileExtensions": [ "scpt" ], "example": [ "display dialog \"Hello World\" \n" ], "id": "AppleScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AppleScript", "indeedJobs": { "2022": 6, "query": "applescript developer" }, "tiobe": { "id": "Applescript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1830", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAppleScript for Dummies|1995|Tom Trinko|2171980|3.75|4|1\nAppleScript Programming for the Absolute Beginner|2007|Jerry Lee Ford Jr.|3055205|3.20|5|0\nAppleScript Pocket Reference: The Essential AppleScript Language Reference|2006|Matt Neuburg|6294483|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2009|Peachpit Press|Apple Training Series: AppleScript 1-2-3|Soghoian, Sal and Cheeseman, Bill|9780321149312\n2004|John Wiley &Sons|Beginning AppleScript|Kochan, Stephen G.|9780764574009\n2004|For Dummies|AppleScript For Dummies|Trinko, Tom|9780764574948\n2007|Cengage Learning PTR|AppleScript Programming for the Absolute Beginner|Ford Jr., Jerry Lee|9781598633849\n2006|Cengage Learning PTR|AppleScript Studio Programming for the Absolute Beginner|Ford, Jr. Jerry Lee|9781598633030\n2001|O'Reilly Media|AppleScript in a Nutshell: A Desktop Quick Reference (In a Nutshell (O'Reilly))|Perry, Bruce W.|9781565928411\n2001|Peachpit Pr|AppleScript for Applications (Visual QuickStart Guide)|Wilde, Ethan|9780201716139\n2006|O'reilly|Applescript|Neuburg, Matt.|\n20010606|O'Reilly Media, Inc.|AppleScript in a Nutshell|Bruce W. Perry|9781491946374\n20010606|O'Reilly Media, Inc.|AppleScript in a Nutshell|Bruce W. Perry|9781491946367\n2009-10-29|Wiley|Apple Automator with AppleScript Bible|Thomas Myer|9780470604311\n2007|Course Technology Ptr|Applescript Programming For The Absolute Beginner|Jerry Lee Jr. Ford|9781598636208", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2007|AppleScript|10.1145/1238844.1238845|19|1|W. Cook|04216be6bacdea717c7ac6e2838f4227884626a3" }, "applesoft-basic": { "title": "Applesoft BASIC", "appeared": 1979, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "PRINT" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "microsoft-basic", "integer-basic", "macbasic", "c", "scheme", "java", "chinese-basic" ], "summary": "Applesoft BASIC is a dialect of Microsoft BASIC, developed by Marc McDonald and Ric Weiland, supplied with the Apple II series of computers. It supersedes Integer BASIC and is the BASIC in ROM in all Apple II series computers after the original Apple II model. It is also referred to as FP BASIC (from \"floating point\") because of the Apple DOS command used to invoke it, instead of INT for Integer BASIC. Applesoft BASIC was supplied by Microsoft and its name is derived from the names of both Apple and Microsoft. Apple employees, including Randy Wigginton, adapted Microsoft's interpreter for the Apple II and added several features. The first version of Applesoft was released in 1977 on cassette tape and lacked proper support for high-resolution graphics. Applesoft II, which was made available on cassette and disk and in the ROM of the Apple II Plus and subsequent models, was released in 1978. It is this latter version, which has some syntax differences and support for the Apple II high-resolution graphics modes, that is usually synonymous with the term \"Applesoft.\"", "created": 2001, "backlinksCount": 173, "pageId": 2100, "revisionCount": 331, "dailyPageViews": 56, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Applesoft_BASIC" }, "leachim6": { "filepath": "a/Applesoft BASIC", "example": [ "10 PRINT \"HELLO WORLD\"\n" ], "id": "Applesoft BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "applog": { "title": "APPLOG", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2b53401af863b483a1ce5e21df0593322aa4319c" ], "country": [ "Israel" ], "originCommunity": [ "Hebrew University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1198", "centralPackageRepositoryCount": 0 }, "april": { "title": "april", "appeared": 2017, "type": "pl", "githubRepo": { "firstCommit": 2017, "stars": 406, "forks": 22, "subscribers": 16, "created": 2017, "updated": 2022, "description": "The APL programming language (a subset thereof) compiling to Common Lisp.", "issues": 21, "url": "https://github.com/phantomics/april" }, "repoStats": { "firstCommit": 2017, "commits": 1820, "committers": 11, "files": 120 } }, "aprol": { "title": "APROL", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/43f9c7be228f9ae42f8b078dae1705f0916e2354" ], "country": [ "United States" ], "originCommunity": [ "Trinity University", "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4383", "centralPackageRepositoryCount": 0 }, "apse": { "title": "APSE", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "U.S. military Ada project" ], "wikipedia": { "related": [ "ada", "unix" ], "summary": "APSE standing for Ada Programming Support Environment was a specification for a programming environment to support software development in the Ada programming language. This represented the second stage of the U.S. military Ada project; once the language was implemented, it was felt necessary to specify and implement a standard set of tools, hence the APSE. CAIS-A, Common APSE Interface Set A, was defined in MIL STD-1838A. CAIS defines a set of Ada APIs to enable portability of development tools across operating systems. As of 1988, CAIS implementations were under development for Unix, VMS and IBM MVS.", "backlinksCount": 7, "pageId": 1064200, "dailyPageViews": 7, "created": 2004, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/APSE" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1273", "centralPackageRepositoryCount": 0 }, "apt-pm": { "title": "APT Debian", "appeared": 1998, "type": "packageManager", "country": [ "United State" ], "originCommunity": [ "The Debian Project" ], "wikipedia": { "summary": "Advanced Package Tool, or APT, is a free-software user interface that works with core libraries to handle the installation and removal of software on Debian, Ubuntu, and related Linux distributions. APT simplifies the process of managing software on Unix-like computer systems by automating the retrieval, configuration and installation of software packages, either from precompiled files or by compiling source code.", "backlinksCount": 133, "pageId": 187481, "dailyPageViews": 198, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/APT_(Debian)" }, "isOpenSource": true }, "apt": { "title": "Automatically Programmed Tool", "appeared": 1956, "type": "pl", "standsFor": "Automatically Programmed Tool", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "example": [ "PARTNO / APT-1\nCLPRNT\nUNITS / MM\nNOPOST\nCUTTER / 20.0\n\n$$ GEOMETRY DEFINITION\nSETPT = POINT / 0.0, 0.0, 0.0\nSTRTPT = POINT / 70,70,0\nP1 = POINT / 50, 50, 0\nP2 = POINT / 20, -20, 0\nC1 = CIRCLE / CENTER, P2, RADIUS, 30\nP3 = POINT / -50, -50, 0\nP5 = POINT / -30, 30, 0\nC2 = CIRCLE / CENTER, P5, RADIUS, 20\nP4 = POINT / 50, -20, 0\nL1 = LINE / P1, P4\nL2 = LINE / P3, PERPTO, L1\nL3 = LINE / P3, PARLEL, L1\nL4 = LINE / P1, PERPTO, L1\nPLAN1 = PLANE / P1, P2, P3\nPLAN2 = PLANE / PARLEL, PLAN1, ZSMALL, 16\n\n$$ MOTION COMMANDS\nSPINDL / 3000, CW\nFEDRAT / 100, 0\nFROM / STRTPT\nGO/TO, L1, TO, PLAN2, TO, L4\nTLLFT, GOFWD / L1, TANTO, C1\nGOFWD / C1, TANTO, L2\nGOFWD / L2, PAST, L3\nGORGT / L3, TANTO, C2\nGOFWD / C2, TANTO, L4\nGOFWD / L4, PAST, L1\nNOPS\nGOTO / STRTPT\nFINI" ], "related": [ "g-code" ], "summary": "APT or Automatically Programmed Tool is a high-level computer programming language most commonly used to generate instructions for numerically controlled machine tools. Douglas T. Ross is considered by many to be the father of APT: as head of the newly created Computer Applications Group of the Servomechanisms Laboratory at MIT in 1956, he led its technical effort. APT is a language and system that makes numerically controlled manufacturing possible. This early language was used widely through the 1970s and is still a standard internationally. Derivatives of APT were later developed.", "pageId": 3673047, "created": 2006, "backlinksCount": 24, "revisionCount": 98, "dailyPageViews": 64, "appeared": 1956, "url": "https://en.wikipedia.org/wiki/APT_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=23", "fileType": "text", "wordRank": 8742, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "aqasm": { "title": "aQasm", "appeared": 2017, "type": "assembly", "description": "aQasm can be executed as of today on a quantum simulator but also on quantum accelerators or physical quantum computers as soon as they are developed.", "standsFor": "Atos Quantum Assembly", "originCommunity": [ "Atos" ], "firstAnnouncement": "https://atos.net/en/2017/press-release/general-press-releases_2017_07_04/atos-launches-highest-performing-quantum-simulator-world", "announcementMethod": "pressRelease", "fileType": "text", "centralPackageRepositoryCount": 0 }, "aql": { "title": "AQL", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a72318cfaaf024d9c4813043f00a12374d7fe94c" ], "country": [ "Italy" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1832", "centralPackageRepositoryCount": 0 }, "aquarius-prolog": { "title": "Aquarius Prolog", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/901aabda7822b120245399bde172dbaf2cc68d9d" ], "country": [ "United States and France" ], "originCommunity": [ "Digital Equipment Corporation", "University of Southern California" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5494", "centralPackageRepositoryCount": 0 }, "arabic-numerals": { "title": "Hindu-Arabic numeral system", "appeared": 825, "type": "numeralSystem", "wikipedia": { "summary": "The Hindu–Arabic numeral system or Indo-Arabic numeral system (also called the Arabic numeral system or Hindu numeral system) is a positional decimal numeral system, and is the most common system for the symbolic representation of numbers in the world. It was invented between the 1st and 4th centuries by Indian mathematicians. The system was adopted in Arabic mathematics by the 9th century. Influential were the books of Muḥammad ibn Mūsā al-Khwārizmī (On the Calculation with Hindu Numerals, c. 825) and Al-Kindi (On the Use of the Hindu Numerals, c. 830). The system later spread to medieval Europe by the High Middle Ages. The system is based upon ten (originally nine) glyphs. The symbols (glyphs) used to represent the system are in principle independent of the system itself. The glyphs in actual use are descended from Brahmi numerals and have split into various typographical variants since the Middle Ages. These symbol sets can be divided into three main families: Western Arabic numerals used in the Greater Maghreb and in Europe, Eastern Arabic numerals (also called \"Indic numerals\") used in the Middle East, and the Indian numerals used in the Indian subcontinent.", "backlinksCount": 632, "pageId": 3393371, "dailyPageViews": 656, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Hindu–Arabic_numeral_system" } }, "arablan": { "title": "ARABLAN", "appeared": 1995, "type": "pl", "reference": [ "https://dl.acm.org/citation.cfm?id=2245799" ], "country": [ "Bahrain" ], "originCommunity": [ "University of Bahrain" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2788", "centralPackageRepositoryCount": 0 }, "arango-db": { "title": "ArangoDB", "appeared": 2011, "type": "database", "description": "Multi-model NoSQL database management system", "country": [ "Germany" ], "originCommunity": [ "ArangoDB GmbH" ] }, "arbortext-command-language": { "title": "arbortext-command-language", "appeared": 2009, "type": "pl", "reference": [ "http://dbpedia.org/page/Arbortext_Command_Language" ], "centralPackageRepositoryCount": 0 }, "arc-assembly": { "title": "Arc Assembly", "appeared": 1947, "type": "assembly", "creators": [ "Kathleen Booth" ], "reference": [ "https://en.wikipedia.org/wiki/Kathleen_Booth" ], "country": [ "United Kingdom" ], "originCommunity": [ "Birkbeck College, University of London" ], "fileType": "na", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "arc-isa": { "title": "ARC processor", "appeared": 1995, "type": "isa", "originCommunity": [ "ARC International PLC" ], "wikipedia": { "summary": "ARC (Argonaut RISC Core) embedded processors are a family of 32-bit CPUs originally designed by ARC International. They are widely used in SoC devices for storage, home, mobile, automotive, and Internet of Things applications. ARC processors have been licensed by more than 200 organizations and are shipped in more than 1.5 billion products per year. ARC processors are now part of the Synopsys DesignWare series, and can be optimized for a wide range of uses. Designers can differentiate their products by using patented configuration technology to tailor each ARC processor instance to meet specific performance, power and area requirements. The ARC processors are also extendable, allowing designers to add their own custom instructions that can significantly increase performance or reduce power consumption. ARC processors are RISC processors, and employ the 16-/32-bit ARCompact instruction set architecture that provides good performance and code density for embedded and host SoC applications. The processors are synthesizable and can be implemented in any foundry or process, and are supported by a complete suite of development tools. Configuration of the ARC processors occurs at design time, using the ARChitect processor configurator. The core was designed to be extensible. Unlike most embedded microprocessors, extra instructions, registers and functionality can be added, in a modular fashion. Customers analyse the task, break down the operations, and then choose the appropriate extensions, or develop their own, to create their own custom microprocessor. They might optimise for speed, energy efficiency or code density. Extensions can include, for example, an MMU, a fast multiplier–accumulator, a USB Host, a Viterbi path decoder, or a user's proprietary RTL functions. The ARC concept was developed initially within Argonaut Games through a series of 3D pipeline development projects starting with the Super FX chip for the Super Nintendo Entertainment System. In 1995, Argonaut was split into Argonaut Technologies Limited (ATL), which had a variety of technology projects, and Argonaut Software Limited (ASL). At the start of 1996, the General Manager of Argonaut, John Edelson, started reducing ATL projects such as BRender and motion capture and investing in the development of the ARC concept. In 1997, following investment by Apax Partners, ATL became ARC International and totally independent from Argonaut Games. Prior to their initial public offering on the London Stock Exchange, underwritten by Goldman Sachs and five other investment banks, three related technology companies were acquired: Metaware in Santa Cruz, California (development and modeling software), VAutomation in Nashua, New Hampshire (peripheral semiconductor IP), and Precise Software in Nepean, Ontario (RTOS).", "pageId": 45245980, "dailyPageViews": 97, "created": 2015, "backlinksCount": 139, "revisionCount": 38, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/ARC_(processor)" }, "fileType": "na", "centralPackageRepositoryCount": 0, "isbndb": "" }, "arc": { "title": "Arc", "appeared": 2001, "type": "pl", "creators": [ "Paul Graham", "Robert Morris" ], "website": "https://www.arclanguage.org", "webRepl": [ "http://tryarc.org/" ], "documentation": [ "http://www.arclanguage.org/tut.txt" ], "country": [ "United States" ], "related": [ "bel" ], "isLisp": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMacros": { "example": "; http://www.arclanguage.org/tut.txt\n; We know enough now to start writing macros. Macros are basically\n; functions that generate code. Of course, generating code is easy;\n; just call list.\n; \n; arc> (list '+ 1 2)\n; (+ 1 2)\n; \n; What macros offer is a way of getting code generated this way into\n; your programs. Here's a (rather stupid) macro definition:\n; \n; arc> (mac foo () \n; (list '+ 1 2))\n; *** redefining foo\n; #3(tagged mac #)\n; \n; Notice that a macro definition looks exactly like a function\n; definition, but with def replaced by mac. \n; \n; What this macro says is that whenever the expression (foo) occurs\n; in your code, it shouldn't be evaluated in the normal way like a\n; function call. Instead it should be replaced by the result of\n; evaluating the body of the macro definition, (list '+ 1 2).\n; This is called the \"expansion\" of the macro call.", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "prn" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "(defop said req\n (aform [onlink \"click here\" (pr \"you said: \" (arg _ \"foo\"))]\n (input \"foo\") \n (submit)))" ], "related": [ "lisp", "racket", "s-expressions", "scheme", "javascript", "java", "c", "interlisp", "lisp-machine-lisp", "common-lisp", "t", "emacs-lisp", "autolisp", "islisp", "openlisp", "picolisp", "eulisp", "newlisp", "clojure", "lfe" ], "summary": "Arc is a dialect of the Lisp programming language developed by Paul Graham and Robert Morris.", "pageId": 188190, "dailyPageViews": 82, "created": 2003, "backlinksCount": 50, "revisionCount": 193, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Arc_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "arc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 236, "id": "Arc" }, "githubBigQuery": { "repos": 467, "users": 417, "id": "Arc" }, "leachim6": { "filepath": "a/ARC.arc", "fileExtensions": [ "arc" ], "example": [ "(prn \"Hello World\")\n" ], "id": "ARC" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Arc", "tiobe": { "id": "Arc" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3986", "fileType": "text", "wordRank": 5327, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1992|HIERARCHICAL ARC CONSISTENCY FOR DISJOINT REAL INTERVALS IN CONSTRAINT LOGIC PROGRAMMING|10.1111/j.1467-8640.1992.tb00381.x|42|3|Greg Sidebottom and W. Havens|3a7ff3f7726ddf4df9e5cea3052529a4ceca681f\n1984|An overview of ARC SASL|10.1145/948290.948294|7|0|H. Richards|bb0ef266616ca38b26e78629f64d3b7db461bb58\n2013|Optimization of Flux Cored Arc Welding Process Parameter Using Genetic and Memetic Algorithms|10.1515/jmsp-2012-0040|7|0|T. Kannan and N. Murugan and B. N. Sreeharan|c6c8f562c37a83778f8affbd7cee43c4d922af6b\n2014|geneGIS: Geoanalytical Tools and Arc Marine Customization for Individual‐Based Genetic Records|10.1111/tgis.12090|7|0|Dorothy M. Dick and Shaun Walbridge and D. Wright and J. Calambokidis and E. Falcone and D. Steel and Tomas Follett and J. Holmberg and C. S. Baker|ab95a6cbf28c9765a60f1683f36dc493bd252290\n2016|Camera self-calibration with varying intrinsic parameters and arc of the circle|10.1109/SAI.2016.7556149|4|0|A. El Abderrahmani and K. Satori|ee88ba2dc9af13eb87a618faaab793c9f075d827\n2009|The ARC Programming Model - Language Constructs for Coordination|10.1016/j.entcs.2009.06.031|3|0|K. Marth and Shangping Ren|5d881e54dfe1190ddffec973e5b7d37526653ef7\n2018|Arc Flash Risk Assessment Using Methodology FMECA|10.1109/EEEIC.2018.8493936|1|1|Jan Pígl|8828b0aba9af74de4468b00dae6c999de0331b77\n2020|Process Design for the Wire Arc Additive Manufacturing of a Compressor Impeller|10.1088/1757-899X/969/1/012098|1|0|A. Kulikov and A. Sidorova and A. Balanovskiy|fb25ba6d83215550d928621b1e7cb999e9862cb8" }, "archi": { "title": "ARCHI", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2d4d00d274ce4eaec549077a854655b307afef69" ], "country": [ "United States" ], "originCommunity": [ "Vanderbilt University", "Institute for Defense Analysis" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1199", "centralPackageRepositoryCount": 0 }, "archieml": { "title": "ArchieML", "appeared": 2015, "type": "dataNotation", "description": "ArchieML (or \"AML\") was created at The New York Times to make it easier to write and edit structured text on deadline that could be rendered in web pages, or more specifically, rendered in interactive graphics.", "website": "http://archieml.org/", "webRepl": [ "http://archieml.org/sandbox.html" ], "aka": [ "aml" ], "country": [ "United States" ], "originCommunity": [ "The New York Times" ], "domainName": { "name": "archieml.org" }, "hasSemanticIndentation": { "example": "AML ignores all whitespace not within a value. We believe this makes it easier for non-programmers to use, and is essential for use in environments with non-monospaced fonts, like in Google Documents.", "value": false }, "example": [ "[days]\n* Sunday\nnote: holiday!\n* Monday\n* Tuesday\n\nWhitespace is still fine around the '*'\n * Wednesday\n\n* Thursday\n\nFriday!\n* Friday\n* Saturday\n[]\n[+books]\nkicker: Books you should read\n\nscore: ★★★★★!!!\ntitle: Wuthering Heights\nauthor: Emily Brontë\n\ntitle: Middlemarch\nauthor: George Eliot\nscore: ★★★★☆\n[]" ] }, "arctic": { "title": "Arctic", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0247233cafc9544ea7c10f994b5cf3ad42ab629d" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1069", "wordRank": 7734, "centralPackageRepositoryCount": 0 }, "arden-syntax": { "title": "Arden syntax", "appeared": 1992, "type": "dataNotation", "country": [ "United States" ], "originCommunity": [ "Columbia Presbyterian Medical Center", "IBM" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "maintenance:\n title: To check the diastolic blood pressure of the patient;;\n mlmname: Hypotension;;\n arden: version 2.7;;\n version: 1.00;;\n institution: Latrobe University Bundoora;;\n author: Lakshmi Devineni;;\n specialist: ;;\n date: 2013-06-02;;\n validation: testing;;\nlibrary:\n purpose: check if the diastolic blood pressure of the patient is within limits;;\n explanation: This MLM is an example for reading data and writing a message;;\n keywords: hypotension; categorization;;\n citations: ;;\n links: http://en.wikipedia.org/wiki/Hypotension;;\nknowledge:\n type: data_driven;;\n data:\n /* read the diastolic blood pressure */\n diastolic_blood_pressure := read last\n {diastolic blood pressure}; /* the value in braces is specific to your \n runtime environment */\n /* If the height is lower than height_threshold, output a message */\n diastolic_pressure_threshold := 60;\n stdout_dest := destination\n {stdout};\n ;;\n evoke: null_event;;\n logic:\n if (diastolic_blood_pressure is not number) then\n conclude false;\n endif;\n if (diastolic_blood_pressure >= diastolic_pressure_threshold) then\n conclude true;\n else\n conclude false;\n endif;\n ;;\n action:\n write \"Your Diastolic Blood Pressure is too low (hypotension)\"\n at stdout_dest;\n ;;\nresources:\n default: de\n ;;\n language: en\n 'msg' : \"The normal range from 60 to 90\";\n ;;\n language: de\n 'msg' : \"Der Normalbereich von 60 bis 90\";\n ;;\nend:" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Arden_syntax" } }, "arduino": { "title": "Arduino Programming Language", "appeared": 2005, "type": "pl", "description": "The Arduino Programming Language is mostly C++ with", "website": "https://www.arduino.cc", "documentation": [ "https://docs.arduino.cc/" ], "cheatSheetUrl": [ "https://github.com/liffiton/Arduino-Cheat-Sheet" ], "country": [ "Italy" ], "originCommunity": [ "Arduino" ], "releaseNotesUrl": "https://www.arduino.cc/en/software/ReleaseNotes", "extensionOf": [ "cpp" ], "hasPrintDebugging": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Serial.println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "#define LED_PIN 13 // Pin number attached to LED.\n\nvoid setup() {\n pinMode(LED_PIN, OUTPUT); // Configure pin 13 to be a digital output.\n}\n\nvoid loop() {\n digitalWrite(LED_PIN, HIGH); // Turn on the LED.\n delay(1000); // Wait 1 second (1000 milliseconds).\n digitalWrite(LED_PIN, LOW); // Turn off the LED.\n delay(1000); // Wait 1 second.\n}" ], "related": [ "atmel-avr", "x86-isa", "c", "processing", "basic-stamp", "arm", "java", "linux", "ia-32" ], "summary": "Arduino is an open-source hardware and software company, project and user community that designs and manufactures single-board microcontrollers and microcontroller kits for building digital devices and interactive objects that can sense and control objects in the physical and digital world. Its products are licensed under the GNU Lesser General Public License (LGPL) or the GNU General Public License (GPL), permitting the manufacture of Arduino boards and software distribution by anyone. Arduino boards are available commercially in preassembled form or as do-it-yourself (DIY) kits. Arduino board designs use a variety of microprocessors and controllers. The boards are equipped with sets of digital and analog input/output (I/O) pins that may be interfaced to various expansion boards or breadboards (shields) and other circuits. The boards feature serial communications interfaces, including Universal Serial Bus (USB) on some models, which are also used for loading programs from personal computers. The microcontrollers are typically programmed using a dialect of features from the programming languages C and C++. In addition to using traditional compiler toolchains, the Arduino project provides an integrated development environment (IDE) based on the Processing language project. The Arduino project started in 2003 as a program for students at the Interaction Design Institute Ivrea in Ivrea, Italy, aiming to provide a low-cost and easy way for novices and professionals to create devices that interact with their environment using sensors and actuators. Common examples of such devices intended for beginner hobbyists include simple robots, thermostats and motion detectors. The name Arduino comes from a bar in Ivrea, Italy, where some of the founders of the project used to meet. The bar was named after Arduin of Ivrea, who was the margrave of the March of Ivrea and King of Italy from 1002 to 1014.", "created": 2006, "backlinksCount": 748, "pageId": 5389424, "revisionCount": 2471, "dailyPageViews": 2640, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Arduino" }, "githubBigQuery": { "repos": 20461, "users": 16079, "id": "Arduino" }, "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "ino" ], "id": "Arduino" }, "leachim6": { "filepath": "a/Arduino.ino", "fileExtensions": [ "ino" ], "example": [ "void setup() {\n Serial.begin(9600);\n Serial.println(\"Hello World\");\n}\n\nvoid loop() {\n\n}" ], "id": "Arduino" }, "indeedJobs": { "2022": 598, "query": "arduino developer" }, "officialBlogUrl": [ "https://blog.arduino.cc/" ], "subreddit": [ { "memberCount": { "2022": 514177 }, "url": "https://www.reddit.com/r/arduino" } ], "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|Apress|Beginning C for Arduino, Second Edition: Learn C Programming for the Arduino|Purdum, Jack|9781484209417\n2013|McGraw Hill TAB|Arduino Robot Bonanza|McComb, Gordon|9780071782777\n2014|Sams|Arduino programming in 24 hours|Blum, Richard , 1962-|9780672337123\n2013|Packt Publishing|C Programming for Arduino|Bayle, Julien|9781849517584\n2010|Tab Books|30 Arduino Projects for the Evil Genius|Monk, Simon|9780071741330\n2013|For Dummies|Arduino For Dummies|Nussey, John|9781118446379\n2014|McGraw-Hill Education TAB|Arduino Projects for Amateur Radio|Purdum, Jack and Kidder, Dennis|9780071834056\n2013|For Dummies|Arduino Projects For Dummies|Craft, Brock|9781118551479\n2011|Apress|Practical Arduino Engineering (Technology in Action)|Timmis, Harold|9781430238850\n2012|Apress|Beginning Android ADK with Arduino (Technology in Action)|Bhmer, Mario|9781430241973\n2015|Packt Publishing|Programming Arduino with LabVIEW|Marco Schwartz and Oliver Manickum|9781849698221\n2016|Oxford University Press|Arduino for Musicians: A Complete Guide to Arduino and Teensy Microcontrollers|Edstrom, Brent|9780199309313\n2011|Apress|Beginning Arduino Programming (Technology in Action)|Evans, Brian|9781430237778\n2015|Apress|Arduino Music and Audio Projects|Cook, Mike|9781484217207\n2014|Packt Publishing|Arduino Home Automation Projects : Automate your Home using the powerful Arduino Platform (Community Experience Distilled)|Schwartz, Marco|9781783986064\n2013|Wrox|Professional Android Open Accessory Programming with Arduino|Goransson, Andreas and Ruiz, David Cuartielles|9781118454763\n2012|Make Community, LLC|Make: Lego and Arduino Projects: Projects for extending MINDSTORMS NXT with open-source electronics|Baichtal, John and Beckler, Matthew and Wolf, Adam|9781449321062\n2017|CreateSpace Independent Publishing Platform|Arduino: The complete guide to Arduino for beginners, including projects, tips, tricks, and programming!|Arthur, James|9781981195831\n2017|Apress|Arduino Programming with .NET and Sketch|Kurniawan, Agus|9781484226582\n2015|Packt Publishing|Building Wireless Sensor Networks Using Arduino (Community Experience Distilled)|Kooijman, Matthijs|9781784395582\n2015|Wiley|Arduino Sketches: Tools and Techniques for Programming Wizardry|Langbridge, James A.|9781118919606\n2020|Focal Press|Learn Audio Electronics with Arduino: Practical Audio Circuits with Arduino Control|Cullen, Charlie|9780367186654\n2015|Packt Publishing|Arduino Computer Vision Programming: Design and develop real-world computer vision applications with the powerful combination of OpenCV and Arduino|Ozkaya, Ozen and Yillikci, Giray|9781783552627\n2018|McGraw-Hill Education TAB|Programming Arduino Next Steps: Going Further with Sketches, Second Edition|Monk, Simon|9781260143249\n20100823|McGraw-Hill Professional|30 Arduino Projects for the Evil Genius|Simon Monk|9780071741347\n2016|CreateSpace Independent Publishing Platform|Arduino: Complete Beginners Guide For Arduino - Everything You Need To Know To Get Started|Mckinnon, Matthew|9781532701696\n2018|CreateSpace Independent Publishing Platform|Arduino: The Comprehensive Beginner's Guide to Take Control of Arduino Programming|Price, Miles|9781717107022\n2017|CreateSpace Independent Publishing Platform|Arduino: Advanced Strategies to Learn and Execute Arduino Programming (Volume 5)|Jones, Mr Daniel|9781979095488\n2018|Independently Published|Arduino Measurement Projects For Beginners: Arduino Programming Basics And Get Started Guide|Bales and Simone|9781728981727\n20111222|McGraw-Hill Professional|Programming Arduino Getting Started with Sketches|Simon Monk|9780071784238\n2016|People Post Press|Arduino Programming Guide 75 intelligent hardware programming skills(Chinese Edition)|[ YING ] Simon Monk ZHU|9787115414489\n2021|Wiley|Microcontroller Prototypes with Arduino and a 3D Printer: Learn, Program, Manufacture|Bolanakis, Dimosthenis E.|9781119782612\n2013|McGraw-Hill Education TAB|Build Your Own Autonomous NERF Blaster: Programming Mayhem with Processing and Arduino|Bigger, Bryce|9780071802758\n2019|Arduino Programming|Arduino Programming|Ryan Turner|9781090104816\n2011|O'Reilly Media, Inc.|Arduino Cookbook|Michael Margolis|9781449321192\n2011|Apress|Beginning Arduino|McRoberts, Michael|9781430232414\n20120115|Springer Nature|Arduino Internals|Dale Wheat|9781430238836\n20120121|Springer Nature|Practical Arduino Engineering|Harold Timmis|9781430238867\n2015|Packt Publishing|Programming Arduino with LabVIEW|Schwartz, Marco and Oliver Manickum|9781849698238\n2019|Independently published|Arduino: 2019 Beginner's Guide to Learn Arduino Programming Step by Step|Pearson, Dexter|9781086093773\n2015|Apress|Beginning C for Arduino, Second Edition: Learn C Programming for the Arduino|Purdum, Jack|9781484209400\n2013|Apress|Beginning C for Arduino: Learn C Programming for the Arduino (Technology in Action)|Purdum Ph.D., Jack|9781430247777\n2019|Nelly B.l. International Consulting Ltd.|Arduino Programming: The Ultimate Beginner's Guide To Learn Arduino Programming Step By Step|Turner Ryan|9781647710002\n2019|nelly B.L. International Consulting LTD.|Arduino Programming: 2 books in 1 - The Ultimate Beginner's & Intermediate Guide to Learn Arduino Programming Step by Step|Turner, Ryan|9781647710194\n2019|CRC Press|Internet of Things with Raspberry Pi and Arduino|Singh, Rajesh and Gehlot, Anita and Gupta, Lovi Raj and Singh, Bhupendra and Swain, Mahendra|9780367248215\n20150401|O'Reilly Media, Inc.|Faszinierende Elektronik-Projekte mit Scratch, Arduino und Raspberry Pi|Erik Bartmann|9783958750333\n2014|Constructing Modern Knowledge Press|Sylvia's Super-Awesome Project Book: Super-Simple Arduino (Volume 2)|\"Todd, Sylvia \"\"Super-Awesome\"\"\"|9780989151160\n2020|BPB Publications|Biomedical Sensors Data Acquisition with LabVIEW: Effective Way to Integrate Arduino with LabView (English Edition)|Prakash, Anshuman and Gupta, Dr. Lovi Raj and Gupta, Dr. Rajesh and Gehlot, Dr. Anita and Beri, Rydhm|9789389845990\n2020|O'Reilly Media|Arduino Cookbook: Recipes to Begin, Expand, and Enhance Your Projects|Margolis, Michael and Jepson, Brian and Weldin, Nicholas Robert|9781491903520\n2021|Michael Cheich|Arduino Book for Beginners|Cheich, Mike|9780988780613\n2014|Sams Publishing|Arduino Programming in 24 Hours, Sams Teach Yourself (Sams Teach Yourself: In 24 Hours)|Blum, Richard|9780672337123\n2011|O'Reilly Media|Arduino Cookbook, 2nd Edition|Margolis, Michael|9781449313876\n2022|Independently Published|\"Arduino Projects with Tinkercad: Designing and programming Arduino-based electronics projects using Tinkercad (Arduino | Introduction and Projects)\"|Wild, M.Eng. Johannes|9783987420375\n2017|McGraw-Hill Education TAB|Hacking Electronics: Learning Electronics with Arduino and Raspberry Pi, Second Edition|Monk, Simon|9781260012217\n2016|Oxford University Press|Arduino for Musicians: A Complete Guide to Arduino and Teensy Microcontrollers|Edstrom, Brent|9780199309320\n2014|Sams Publishing|Arduino Programming in 24 Hours, Sams Teach Yourself|Richard, Blum|9780133764130\n2013|McGraw-Hill Education TAB|30 Arduino Projects for the Evil Genius, Second Edition|Monk, Simon|9780071817721\n2018|McGraw-Hill Education TAB|Programming Arduino Next Steps: Going Further with Sketches, Second Edition|Monk, Simon|9781260143256\n2017|MicroDigitalEd|The AVR Microcontroller and Embedded Systems Using Assembly and C: Using Arduino Uno and Atmel Studio|Naimi, Sepehr and Naimi, Sarmad and Mazidi, Muhammad Ali|9780997925968\n2020|Independently published|Arduino: 2020 Beginners Guide to Learn Arduino Programming. Amazing Projects included .|Abdous, Rick|9781660614523\n2015|Packt Publishing|Python Programming for Arduino|Desai, Pratik|9781783285938\n2014|McGraw-Hill Education TAB|Arduino Projects for Amateur Radio|Purdum, Jack and Kidder, Dennis|9780071834063\n2013|McGraw-Hill Education TAB|Programming Arduino Next Steps: Going Further with Sketches|Monk, Simon|9780071830263\n2016-06-22T00:00:01Z|CreateSpace Independent Publishing Platform|ESP8266: Programming NodeMCU Using Arduino IDE - Get Started With ESP8266|Learning, UpSkill|9781534822665\n2013|McGraw-Hill Education Tab|Programming Arduino Next Steps: Going Further with Sketches|Monk, Simon|9780071830256\n2017|No Starch Press|Arduino Project Handbook, Volume 2: 25 Simple Electronics Projects for Beginners|Geddes, Mark|9781593278182\n2015|Packt Publishing|Arduino for Secret Agents|Schwartz, Marco|9781783986095\n2011|Apress|Beginning Arduino|McRoberts, Michael|9781430232407\n2015|Packt Publishing|Building Wireless Sensor Networks Using Arduino (Community Experience Distilled)|Kooijman, Matthijs|9781784397159\n2011|Make Community, LLC|Make: Arduino Bots and Gadgets: Six Embedded Projects with Open Source Hardware and Software (Learning by Discovery)|Karvinen, Tero and Karvinen, Kimmo|9781449389710\n2013|For Dummies|Arduino Projects For Dummies|Craft, Brock|9781118551516\n2016|Apress|Building Arduino Projects for the Internet of Things: Experiments with Real-World Applications|Javed, Adeel|9781484219393\n2013|McGraw-Hill Education TAB|30 Arduino Projects for the Evil Genius, Second Edition|Monk, Simon|9780071817738\n2019-12-13T00:00:01Z|Independently published|Computer Programming: This Book Includes: SQL, Linux, Java, Python, C#, Arduino, C# For Intermediates, Arduino For Intermediates Learn Any Computer Language In One Day Step by Step (#2020 Version)|Tudor, Steve|9781675075104\n2018|Packt Publishing|Building Smart Drones with ESP8266 and Arduino: Build exciting drones by leveraging the capabilities of Arduino and ESP8266|Faruk Towaha, Syed Omar|9781788476928\n2012|Apress|Beginning C for Arduino: Learn C Programming for the Arduino (Technology in Action)|Purdum, Jack|9781430247760\n2019-07-19T00:00:01Z|Independently published|Arduino for Beginners: Comprehensive Beginners Guide to Learn Arduino Programming Step by Step|THORPE, ETHAN|9781081547776\n2018|Bentham Science Publishers|Arduino meets MATLAB: Interfacing, Programs and Simulink|Singh, Rajesh and Gehlot, Anita and Singh, Bhupendra and Choudhury, Sushabhan|9781681087276\n2011|Maker Media, Inc|Getting Started with Arduino|Banzi, Massimo|9781449309879\n2013|McGraw-Hill Education TAB|Arduino Robot Bonanza|McComb, Gordon|9780071782784\n2015|Copperhill Media Corporation|SAE J1939 ECU Programming & Vehicle Bus Simulation with Arduino|Voss, Wilfried|9781938581182\n2011|O'Reilly Media|Arduino Cookbook|Margolis, Michael|9780596802479\n2015|Packt Publishing|Arduino for Secret Agents|Schwartz, Marco|9781783986088\n2011|Apress|Beginning Arduino Programming (Technology in Action)|Evans, Brian|9781430237785\n2017|CreateSpace Independent Publishing Platform|Basic Programming Essentials: Learn the Basics of Batch, HTML, C, G and M code and Arduino Programming|DeSipio Jr., Matthew M|9781979833868\n2011|McGraw-Hill Education TAB|Arduino + Android Projects for the Evil Genius: Control Arduino with Your Smartphone or Tablet|Monk, Simon|9780071775977\n2011|Apress|Arduino Internals (Technology in Action)|Wheat, Dale|9781430238829\n2015|Wiley|Arduino Sketches: Tools and Techniques for Programming Wizardry|Langbridge, James A.|9781118919699\n2015|Packt Publishing|Arduino Computer Vision Programming|Özkaya, Özen and Giray Yıllıkçı|9781782174288\n2012|Apress|Arduino Wearables (Technology in Action)|Olsson, Tony|9781430243595\n2015|Packt Publishing|Arduino Development Cookbook|Amariei, Cornel|9781783982950\n2015|Packt Publishing|Arduino by Example|Boloor, Adith Jagadish|9781785289088\n2019-12-14T00:00:01Z|Independently published|Arduino: Simple and Effective Strategies to Arduino Programming|Thorpe, Ethan|9781675486207\n2015|Packt Publishing|Arduino Wearable Projects|Olsson, Tony|9781785283307\n2016|Apress|Building Arduino Projects for the Internet of Things: Experiments with Real-World Applications|Javed, Adeel|9781484219409\n2019|Packt Publishing|Hands-On Internet of Things with MQTT: Build connected IoT devices with Arduino and MQ Telemetry Transport (MQTT)|Pulver, Tim|9781789345001\n2013|Apress|Beginning Arduino (Technology in Action)|McRoberts, Michael|9781430250173\n2013|Que Publishing|Arduino for Beginners: Essential Skills Every Maker Needs|Baichtal, John|9780133416732\n2017|Packt Publishing|Arduino for Kids: A cool guide to help kids develop robots and electronics|Kuber, Priya and Bhatnagar, Rishi Gaurav and Varada, Vijay|9781785882227\n2017|Packt Publishing|Learn Arduino Prototyping in 10 days|Choudhuri, Kallol Bosu Roy|9781788298544\n2015|Packt Publishing|Arduino Wearable Projects|Olsson, Tony|9781785282799\n2018|Independently published|Arduino: The Complete 3 Books in 1 for Beginners, Intermediate and 19 Sample Designs and Codings and Advance Crash Guide in Arduino Programming|Webber, Zach|9781730847844\n2018|Independently published|Advanced Programming For Arduino Geeks|Magda, Yury and Magda, Yury|9781718154780\n2017|Apress|Arduino Programming with .NET and Sketch|Kurniawan, Agus|9781484226599\n2018|CreateSpace Independent Publishing Platform|Arduino (Learn Programming Projects) (Volume 1)|Thompson, Matthew|9781721076628\n2013|AuthorHouse UK|C Programming for the Pc the Mac and the Arduino Microcontroller System|Minns, Peter D|9781491880517\n2016|CreateSpace Independent Publishing Platform|Arduino: Getting Started With Arduino: The Ultimate Beginner’s Guide (Arduino 101, Arduino sketches, Complete beginners guide, Programming, Raspberry Pi 2, xml, c++, Ruby, html, php, Robots)|Gold, Steve|9781523999972\n2019|Independently published|\"Arduino Programming: This book Includes: The Ultimate Beginner’s And Intermediate’s Guide To Learn Arduino In One Day Step-By-Step (#2020 Updated Version | Effective Computer Programming Languages)\"|Tudor, Steve|9781675577493\n2019-11-13T00:00:01Z|Independently published|Arduino Programming: The Ultimate Guide for Absolute Beginners with Steps to Learn Arduino Programming and The Fundamental Electronic Concepts|Géron, Daniel Géron|9781708010058\n2021|Springer|Physics Experiments with Arduino and Smartphones (Undergraduate Texts in Physics)|Organtini, Giovanni|9783030651404\n2013|Apress|Arduino Adventures: Escape from Gemini Station|Kelly, James Floyd and Harold Timmis|9781430246060\n2013|Packt Publishing|Raspberry Pi Home Automation with Arduino|K. Dennis, Andrew|9781849695862\n2015|Packt Publishing|Building a Home Security System with Arduino|Castro, Jorge R.|9781785280603\n2018-02-13T00:00:01Z|CreateSpace Independent Publishing Platform|Arduino: The ultimate Arduino guide for beginners, including Arduino programming, Arduino cookbook, tips, tricks, and more!|Newport, Craig|9781985354203\n2019|MicroDigitalEd|Arduino Programming From Beginning to Advanced|Mazidi, Muhammad Ali and Chen, Shujen and Ghaemi, Eshragh|9781970054200\n2019|Bentham Science Publishers|Arduino and Scilab based Projects|Gehlot, Anita and Singh, Rajesh and Singh, Bhupendra|9789811410918\n2021|Apress|Programming Arduino Projects with the PIC Microcontroller: A Line-by-Line Code Analysis and Complete Reference Guide for Embedded Programming in C|Ward, Hubert Henry|9781484272329\n2013|Apress|Arduino Adventures: Escape from Gemini Station|Floyd Kelly, James and Timmis, Harold|9781430246053\n2020|Blue Chip Publishing|Arduino Programming|Hamilton, Jason|9781922482211\n2016|McGraw-Hill Education TAB|Programming the Intel Galileo: Getting Started with the Arduino -Compatible Development Board|Rush, Christopher|9781259644801\n2019|Independently published|\"Arduino Programming: The Practical Beginner's Guide To Learn Arduino Programming In One Day Step-By-Step. (#2020 Updated Version | Effective Computer Languages)\"|Tudor, Steve|9781672188036\n2018-09-08T00:00:01Z|Independently published|Arduino: 19 Sample Designs, Coding, and Advanced Crash Course Guide in Arduino Programming|Webber, Zach|9781720160786\n2019|CRC Press|Internet of Things with Raspberry Pi and Arduino|Singh, Rajesh and Gehlot, Anita and Gupta, Lovi Raj and Singh, Bhupendra and Swain, Mahendra|9781000726787\n2019-09-25T00:00:01Z|Independently published|Arduino Programming: The Ultimate Beginner's Guide to Learn 10 Arduino Projects with Sensors|Munusami, Sivakumar|9781695475014\n2016|Packt Publishing|Arduino BLINK Blueprints|Shah, Samarth and Shah, Utsav|9781785285868\n2020|Ingram Publishing|Arduino: The complete guide to Arduino for beginners, including projects, tips, tricks, and programming!|Arthur, James|9781761032806\n2016|McGraw-Hill Education TAB|Programming the Intel Galileo: Getting Started with the Arduino -Compatible Development Board|Rush, Christopher|9781259644795\n2020|Ingram Publishing|Arduino: The ultimate Arduino guide for beginners, including Arduino programming, Arduino cookbook, tips, tricks, and more!|Newport, Craig|9781761032684\n2019|Independently published|Arduino Robotics: Design and Programming|david kon, john and david kon, john|9781089431732\n2015-07-31T00:00:01Z|CreateSpace Independent Publishing Platform|Arduino: Arduino User Guide for Operating system, Programming, Projects and More! (raspberry pi 2, xml, c++, ruby, html, projects, php, programming, ... php, sql, Mainframes, Minicomputer)|Scott, Robert|9781515307532\n2020-01-02T00:00:01Z|Independently published|Arduino Programming: A Step by Step Guide to Learn Arduino Programming For Absolute Beginners|Trinity, Lilly|9781654490676\n2019|Ingram Publishing|Arduino: The ultimate Arduino guide for beginners, including Arduino programming, Arduino cookbook, tips, tricks, and more!|Newport, Craig|9781925989816\n2013|AuthorHouseUK|C Programming For the PC the MAC and the Arduino Microcontroller System|Minns, Peter D.|9781491880500\n2020|Focal Press|Learn Audio Electronics with Arduino: Practical Audio Circuits with Arduino Control|Cullen, Charlie|9780367186647\n2017|ISBN Canada|Bluetooth Low Energy in Arduino 101: Your Guide to Programming the Internet of Things|Gaitatzis, Anthony|9781775128069\n2019|Independently published|Arduino Programming (3 books in 1): For Beginners + Intermediate + Advanced|Parsons, Wally|9781675868898\n2021|Apress|Programming Arduino Projects with the PIC Microcontroller: A Line-by-Line Code Analysis and Complete Reference Guide for Embedded Programming in C|Ward, Hubert Henry|9781484272299\n2019-06-14T00:00:01Z|MicroDigitalEd.com|TI ARM Microcontroller Programming with Energia: Going from Arduino to ARM: Using TI ARM Launchpad|Mazidi, Muhammad Ali and Chen, Shujen and Ghaemi, Eshragh|9781970054217\n2019|Ingram Publishing|Arduino: The complete guide to Arduino for beginners, including projects, tips, tricks, and programming!|Arthur, James|9781925989700\n2012|Apress|Practical AVR Microcontrollers: Games, Gadgets, and Home Automation with the Microcontroller Used in the Arduino (Technology in Action)|Trevennor, Alan|9781430244462\n2017-08-24T00:00:01Z|CreateSpace Independent Publishing Platform|Arduino: Simple and Effective Strategies to Learn Arduino Programming (Volume 3)|Jones, Mr Daniel|9781975777623\n2015|LAP Lambert Academic Publishing|Design of a Arduino Processor Based Bi-Servo Robotic Walker|Chowdhury Dibyendu and Roy Avisankar and Das Avishek|9783659684487\n2018|CreateSpace Independent Publishing Platform|Arduino: 2 Books in 1: The Comprehensive Beginner's Guide to Take Control of Arduino Programming & Best Practices to Excel While Learning Arduino Programming|Price, Miles|9781719310819\n2018|CreateSpace Independent Publishing Platform|Hacking: 3 Books in 1: The Beginner's Complete Guide to Computer Hacking and Penetration Testing & The Complete Beginner's Guide to Learning Ethical ... Guide to Take Control of Arduino Programming|Price, Miles|9781719312318\n2014|Cherry Lake Publishing|Arduino|Terence O'Neill|9781624312038\n2019||Arduino Projects|Sivakumar Munusami|9781697408362\n20120913|Springer Nature|Arduino Wearables|Tony Olsson|9781430243601\n2020|Blue Chip Publishing|Arduino Programming|Hamilton, Jason|9781922482228\n2013|Wiley & Sons, Incorporated, John|Exploring Arduino|Jeremy Blum|9781118786161\n2019||Arduino Basics|Moaml Mohmmed|9781082120145\n2021-01-28T00:00:01Z|Amplitudo Ltd|Arduino: The Arduino Book is the Ultimate Guide to Learn And Understand Arduino Programming, Ideal For Arduino Beginners.|Myers, Eric|9781801144834\n2018|Createspace Independent Publishing Platform|Arduino: The Complete Beginner's Guide To Programming Arduino|Berke and Bruce|9781718903371\n2015|Createspace Independent Publishing Platform|Arduino Meets Linux|Bob Hammell|9781514230220\n2018||Esp8266 Arduino Tutorial|Sha Ga|9781983286698\n2022|Zoe Lawson|Arduino: Getting Started With Arduino and Basic Programming With Projects (Advanced Methods to Learn Arduino Programming)|Leclerc, Ernest|9781774854891\n2019||The Basics Of Arduino|Moaml Mohmmed|9781070857244\n2014|Rosen Reference|Getting To Know Arduino|Heather Moore Niver|9781477775028\n2022|Elektor|C Programming with Arduino|Warwick A. Smith|9781907920462\n2020|LAP LAMBERT Academic Publishing|Scratch Arduino: Basics Book for Learning programming Arduino by Scratch Language|A.Saeed, Elaf|9786202683333\n2021|Independently published|ESP8266 Programming Tutorial: Programming With Arduino: Esp-01 Programming With Arduino Ide|Toolan, Barton|9798746226273\n2021|CRC Press|Programming and Interfacing with Arduino|Misra, Yogesh|9781032059853\n2021|CRC Press|Programming and Interfacing with Arduino|Misra, Yogesh|9781032063164\n2019|Lulu Press, Inc|Arduino Programming Simply In Depth|Ajit Singh|9780359984923\n||Arduino Programming: The Ultimate Guide For Making The Best Of Your Arduino Programming Projects||9781801114042\n2020-10-17T00:00:01Z|New Begin Ltd|Arduino Programming: The Ultimate Guide For Making the Best of Your Arduino Programming Projects|Parker, Damon|9781801128001\n2013-02-05|Packt Publishing|Raspberry Pi Home Automation with Arduino|Andrew K. Dennis|9781849695879\n2015|Mcgraw-hill Education Tab|Led Wizardry With Propeller Quickstart And Arduino|Thomas Talbot|9780071839525\n2019|Scholars' Press|A Guide to Lab view Interfaced Arduino Projects|Kumar, Pardeep and Kaur Channi, Harpreet and Kundu, Mousumi|9786138913238\n2021|Crc Press|Internet Of Things With Raspberry Pi And Arduino|Rajesh Singh and Taylor & Francis Group and Anita Gehlot and Lovi Raj Gupta and Bhupendra Singh and Mahendra Swain|9781032085982\n2018||Esp8266 Nodemcu Using Arduino Ide (internet Of Things)|Jacob Kale|9781982985189\n2021-01-19T00:00:01Z|Tiger Gain Ltd|Arduino Programming: The Ultimate Guide for Absolute Beginners with Steps to Learn Arduino Programming and The Fundamental Electronic Concepts|Géron, Daniel|9781914306709\n2021-01-12T00:00:01Z|Tiger Gain Ltd|Arduino Programming: The Ultimate Guide for Absolute Beginners with Steps to Learn Arduino Programming and The Fundamental Electronic Concepts|Géron, Daniel|9781914306198\n2021|Tiger Gain Ltd|Arduino Programming: The Ultimate Guide for Absolute Beginners with Steps to Learn Arduino Programming and The Fundamental Electronic Concepts||9781801943550\n2019|Independently published|\"Arduino Programming: The Practical Intermediate's Guide To Learn Arduino Programming In One Day Step-By-Step (#2020 Updated Version | Effective Computer Languages)\"|Tudor, Steve|9781672192484\n2020|Ep Enterprise Holding Limited|Arduino Programming: The Ultimate Beginner's And Intermediate's Guide To Learn Arduino In One Day Step-By-Step (#2020 Updated Version - Effective Computer Programming Languages)|Tudor, Steve|9781914088506\n2020|New Begin Ltd|Computer Programming: This Book Includes: Learn Python + SQL Programming + Arduino Programming|Parker, Damon|9781801235563\n2011|Make Community, LLC|Beginning AVR Programming: Learn the microcontroller that's the heart of Arduino|Trevennor, Alan|9781449307684\n2021-01-12T00:00:01Z|Tiger Gain Ltd|Computer Programming for Beginners: This Book Includes: SQL, C++, C#, Arduino Programming|Géron, Daniel|9781914306204\n2021|Tiger Gain Ltd|Computer Programming for Beginners: This Book Includes: SQL, C++, C#, Arduino Programming|Géron, Daniel|9781914306716\n2016-12-01T00:00:01Z|CreateSpace Independent Publishing Platform|Arduino Programming for Beginners in Projects and Examples: How to Get Started|Sharp, Max|9781540636898\n|Daniel Geron|Computer Programming for Beginners: This Book Includes: SQL, C++, C#, Arduino Programming||9781801944083\n2021|Computer DM-Academy|Arduino for Beginners: Learn how to Create Interactive Electronic Objects, Setting up Your Board, Discover How Coding Works, Create Your Circuit Plus All the Essentials of Arduino Programming||9781801875400\n2019|LAP LAMBERT Academic Publishing|Arduino Based 2-D Robotic Plotter: A Guide to Design: 2 D plotter|Patil, Sheetal N. and Patil, Prashant|9786139452620\n2020|Apress|IoT Machine Learning Applications in Telecom, Energy, and Agriculture: With Raspberry Pi and Arduino Using Python|Mathur, Puneet|9781484255490\n2018|Createspace Independent Publishing Platform|Arduino|Zach Webber|9781987665819\n2016|Createspace Independent Publishing Platform|Programming Arduino|Upskill Learning|9781540314086\n2015-01-05|Wiley Professional Development (P&T)|Arduino Sketches: Tools and Techniques for Programming Wizardry|James A. Langbridge|9781118919620\n2015|O'Reilly Media, Incorporated|Arduino Cookbook|Michael Margolis|9781449371968\n20181226|Springer Nature|Arduino Applied|Neil Cameron|9781484239605\n20210309|Springer Nature|Arduino III|Steven F. Barrett|9783031799235\n20110324|O'Reilly Media, Inc.|Arduino Cookbook|Michael Margolis|9781449305611\n20200417|O'Reilly Media, Inc.|Arduino Cookbook|Michael Margolis; Brian Jepson; Nicholas Robert Weldin|9781491903483\n2019|John Wiley & Sons|Exploring Arduino|Jeremy Blum|9781119405351\n2020|O'reilly Media|Arduino Cookbook|Michael Margolis and Brian Jepson and Nicholas Robert Weldin|9781491903506\n20200804|Springer Nature|Arduino II|Steven F. Barrett|9783031799198\n20200804|Morgan & Claypool Publishers|Arduino II|Steven F. Barrett|9781681738994\n20210310|Morgan & Claypool Publishers|Arduino III|Steven F. Barrett|9781636390840\n20140821|Packt Publishing|Arduino Networking|Marco Schwartz|9781783986873\n20150224|Packt Publishing|Arduino Essentials|Francis Perea|9781784395865\n2018||Practical Arduino Projects|Michael Klements|9781980308171\n2011|Lulu.com|Arduino Programming Notebook|Brian W. Evans|9781257126064\n20170207|Springer Nature|Building Arduino PLCs|Pradeeka Seneviratne|9781484226322\n2018-04-30|Createspace Independent Publishing Platform|Arduino: Best Practices To Excel While Learning Arduino Programming|Miles Price|9781717393821\n2016|Oxford University Press|Arduino For Musicians|Brent Edstrom|9780199309337\n20130529|Simon & Schuster|Arduino in Action|Jordan Hochenbaum; Joshua Noble; Martin Evans|9781638353911\n2015-04-27|Wiley Professional Development (P&T)|Adventures in Arduino|Becky Stewart|9781118948460\n20150914|Packt Publishing|Arduino by Example|Adith Jagadish Boloor|9781785287114\n20211007|Springer Nature|Arduino in Science|Richard J. Smythe|9781484267783\n20160325|Oxford University Press Academic US|Arduino for Musicians|Brent Edstrom|9780190460044\n20160704|Springer Nature|Junk Box Arduino|James R. Strickland|9781484214251\n04/2013|Wiley Professional Development (P&T)|Arduino For Dummies|Nussey, John|9781118446423\n2013-04-29|Wiley|Arduino For Dummies|John Nussey|9781118446430\n20140814|Packt Publishing|Arduino Robotic Projects|Richard Grimmett|9781783989836\n20141222|Packt Publishing|Arduino Android Blueprints|Marco Schwartz; Stefan Buttigieg|9781784391683\n20170912|O'Reilly Media, Inc.|Learn Electronics with Arduino|Jody Culkin; Eric Hagan|9781680453713\n2017|Maker Media, Inc.|Learn Electronics With Arduino|Jody Culkin and Eric Hagan|9781680453737\n|Packt Pub.|C Programming For Arduino|Bayle, Julien.|9781849517584\n2016|Apress|Arduino + Visual Basic 6.0|Ujash G. Patel|9781484218440\n2020-06-11|Elektor International Media|C Programming with Arduino|Warwick A. Smith|9783895763526\n2022-04-23|3DTech|Arduino Step by Step|M.Eng. Johannes Wild|9783949804793\n20140723|Packt Publishing|Arduino Home Automation Projects|Marco Schwartz|9781783986071\n20200326|Taylor & Francis|Learn Audio Electronics with Arduino|Charlie Cullen|9780429588884\n20140715|Rosen Publishing|Getting to Know Arduino|Heather Moore Niver|9781477775004\n20120126|O'Reilly Media, Inc.|Environmental Monitoring with Arduino|Emily Gertz; Patrick Di Justo|9781449328610\n20150227|Packt Publishing|Python Programming for Arduino|Pratik Desai|9781783285945\n2019-12-26|Independently Published|Arduino Developer's Notebook: Dotted Grid Pages Customized For Arduino Programmers And Developers, Notebook For Arduino Programming, Arduino Notebook, Include Numbered Pages (150 Pages, 6 X9 Inches)|Red Factory|9781651074701\n20170515|Random House Publishing Services|The Arduino Inventor's Guide|Brian Huang; Derek Runberg|9781593278397\n20130517|Packt Publishing|C Programming for Arduino|Julien Bayle|9781849517591\n20120126|O'Reilly Media, Inc.|Environmental Monitoring with Arduino|Emily Gertz; Patrick Di Justo|9781449328948\n24-03-2017|Packt Publishing|Learning C for Arduino|Syed Omar Faruk Towaha|9781787123571\n2010|Morgan & Claypool Publishers|Arduino Microcontroller Processing For Everyone|Steven Barrett|9781608454389\n2019|Independently Published|Arduino For Beginners: A Step By Step Ultimate Guide To Learn Arduino Programming|Mark Arthur|9781709004612\n2021|Taylor & Francis Group|Programming And Interfacing With Arduino|Yogesh Misra|9781003201700\n2019-12-05|Nelly B.l. International Consulting Ltd.|Arduino Programming: The Ultimate Intermediate Guide To Learn Arduino Programming Step By Step|Ryan Turner|9781647710132\n2019|Independently Published|Arduino Programming: A Comprehensive Beginner's Guide To Learn Arduino Programming From A-z|Alexander Bold|9781701328457\n20110913|O'Reilly Media, Inc.|iOS Sensor Apps with Arduino|Alasdair Allan|9781449317157\n20110317|O'Reilly Media, Inc.|Make: Arduino Bots and Gadgets|Tero Karvinen; Kimmo Karvinen|9781449307233\n20110317|O'Reilly Media, Inc.|Make: Arduino Bots and Gadgets|Tero Karvinen; Kimmo Karvinen|9781449307318\n20121127|O'Reilly Media, Inc.|Make: Lego and Arduino Projects|John Baichtal; Matthew Beckler; Adam Wolf|9781449324933\n2019-03-05|Bentham Science Publishers|Arduino and Scilab based Projects|Rajesh Singh and Anita Gehlot and Bhupendra Singh|9789811410925\n20110913|O'Reilly Media, Inc.|iOS Sensor Apps with Arduino|Alasdair Allan|9781449317546\n20121127|O'Reilly Media, Inc.|Make: Lego and Arduino Projects|John Baichtal; Matthew Beckler; Adam Wolf|9781449324940\n20210906|Taylor & Francis|Programming and Interfacing with Arduino|Yogesh Misra|9781000431698\n2016||Embedded Controllers Using C And Arduino|James Fiore|9781796836226\n2016-11-21|LAP LAMBERT Academic Publishing|A Complete Programming guide implementing technical designs - Arduino|V.S Prasanth and A. Parveen|9783330011069\n20141114|Emereo|Arduino 144 Success Secrets - 144 Most Asked Questions On Arduino - What You Need To Know|Johnny Mendez|9781488819124\n2012-12-16|Createspace Independent Publishing Platform|Arduino 101: A Beginner's Guide To Programming|William Smith|9781480146044\n|John Wiley & Sons, Inc.|Professional Android Open Accessory Programming With Arduino|Göransson, Andreas.|9781118454770\n2017|Independently Published|Learn Arduino Programming Using 37 Sensors For Beginners: Practical Way To Learn Arduino For The Year 2017|Jennifer Williams|9781521566763\n20210303|Springer Nature|Beginning Robotics with Raspberry Pi and Arduino|Jeff Cicolani|9781484268919\n20210930|Springer Nature|Programming Arduino Projects with the PIC Microcontroller|Hubert Henry Ward|9781484272305\n2017-12-05|LAP LAMBERT Academic Publishing|Basics of Arduino Uno Programming for Beginners|Abrham Mengistu and Dagnachew Melesew|9786202094566\n2014-05-21|Packt Publishing|Internet of Things with the Arduino Yun|Marco Schwartz|9781783288014\n20150901|Packt Publishing|Building a Home Security System with Arduino|Jorge R. Castro|9781785283802\n2019|Crc Press|Internet Of Things With Raspberry Pi And Arduino|Anita Gehlot|9780429284564\n2018|Createspace Independent Publishing Platform|Ti Arm Programming For Arduino Programmers Using Energia|Muhammad Ali Mazidi and Shujen Chen and Eshragh Ghaemi|9781720390237\n2021|Wiley & Sons, Incorporated, John|Microcontroller Prototypes With Arduino And A 3d Printer|Dimosthenis E. Bolanakis|9781119782674\n20191118|Taylor & Francis|Internet of Things with Raspberry Pi and Arduino|Rajesh Singh; Anita Gehlot; Lovi Raj Gupta; Bhupendra Singh; Mahendra Swain|9781000727029\n2021-04-09|Wiley|Microcontroller Prototypes with Arduino and a 3D Printer|Dimosthenis E. Bolanakis|9781119782681\n2018|Independently Published|Arduino Programming For Beginners: Getting Started With Sketches Guide|Simone Bales|9781729108970\n2019|Vidstrom Labs|The Vidstrom Labs Guide To Arduino Assembly Language Programming|Arne Vidstrom|9789198566109\n04/2015|O'Reilly Media, Inc.|Faszinierende Elektronik-Projekte mit Scratch, Arduino und Raspberry Pi|Bartmann, Erik|9783958750326\n08/2012|O'Reilly Media, Inc.|Das intelligente Haus – Heimautomation mit Arduino und Android und PC|Riley, Mike|9783868993646\n08/2012|O'Reilly Media, Inc.|Das intelligente Haus – Heimautomation mit Arduino und Android und PC|Riley, Mike|9783955610050\n20171123|McGraw-Hill Professional|Arduino and Raspberry Pi Sensor Projects for the Evil Genius|Robert Chin|9781260010909", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Smart drip irrigation system using raspberry pi and arduino|10.1109/CCAA.2015.7148526|125|3|N. Agrawal and Smita Singhal|764fb4d5d79641193570ca843589149f3f2dfde5\n2016|Sensing heart beat and body temperature digitally using Arduino|10.1109/SCOPES.2016.7955737|37|3|Salomi S. Thomas and Amar Saraswat and Anurag Shashwat and Vishal Bharti|3730e4fa848ea6c6e3c9e9121be351d3f64c5805\n2016|Juniper: a functional reactive programming language for the Arduino|10.1145/2975980.2975982|26|1|Caleb Helbling and Samuel Z. Guyer|4823a13fb9060fb8614141ac492fe3cbf704f4a2\n2016|Haskino: A Remote Monad for Programming the Arduino|10.1007/978-3-319-28228-2_10|14|2|Mark Grebe and Andy Gill|45db20fdde1f12a7b43744793fbae46aaf2bcc55\n2019|PyBoKids: An Innovative Python-Based Educational Framework Using Real and Simulated Arduino Robots|10.3390/ELECTRONICS8080899|13|0|J. Vega and J. Cañas|af02c074aaa97c01f42d6e40c43ae08ac877a4d4\n2021|Light Control Using Human Body Temperature Based on Arduino Uno and PIR (Passive Infrared Receiver) Sensor|10.18196/jrc.2497|9|0|Reza Perkasa and Refni Wahyuni and Rika Melyanti and H. Herianto and Yuda Irawan|3d4e107dc810feb462ae19321db73584322abb43\n2017|Arduviz, a visual programming IDE for arduino|10.1109/ICODSE.2017.8285871|9|0|Adin Baskoro Pratomo and Riza Satria Perdana|a2d83c85397baa058b6a5a60d18beacd62c25cd8\n2011|Concurrent Event-driven Programming in occam-π for the Arduino|10.3233/978-1-60750-774-1-177|6|1|C. Jacobsen and M. Jadud and Omer Kilic and A. Sampson|092209255dbb9239484b4d223ec20c3d3622f801\n2019|Declarative Programming for Microcontrollers - Datalog on Arduino|10.1007/978-3-030-46714-2_9|6|0|Mario Wenzel and Stefan Brass|146aa8fd69bdcc9cbb970cc2d2b638196930b333\n2019|An Arduino board with ultrasonic sensor investigation of simple harmonic motion|10.1088/1742-6596/1380/1/012098|5|0|A. Buachoom and A. Thedsakhulwong and S. Wuttiprom|587c301df2198301da289530e180771f63520b40\n2019|Automatic System to Fish Feeder and Water Turbidity Detector Using Arduino Mega|10.1088/1742-6596/1339/1/012013|5|0|H. Hendri and S. Enggari and Mardison and M. R. Putra and L. N. Rani|fc19165adfdb5eb3694cafbc7d31ecb015b71820\n2012|Teaching Introductory Programming Concepts: A Comparison of Scratch and Arduino|10.15368/THESES.2012.95|5|0|A. Beug|81c185f394ae848b35a9bee8d7c30a707ed4298a\n2020|Analysis and experimental realization of the logistic map using Arduino Pro Mini|10.32782/cmis/2608-23|3|0|V. Rusyn and S. Subbotin and A. Sambas|711b1f6e3c4aa6cd0e3a4738008e24e2bc28724a\n2017|Blocklino: A graphical language for Arduino|10.1109/COGINFOCOM.2017.8268214|3|0|P. Domokos and M. Széll and Viktor Takács|a6fcc4cbdca7db19f3c97508f9acc797fc7a2b28\n2019|Arduino Visual Programming|10.1109/ICSEC47112.2019.8974710|3|1|Kitsiri Chochiang and Kullawat Chaowanawatee and Kittasil Silanon and Thitinan Kliangsuwan|982eec22a89913793ee1ec8ea9263b5c98b35256\n2019|Ardestan: A Visual Programming Language for Arduino|10.1145/3332167.3357126|3|1|H. Nishino|135dfc5d5ce2a18ac3b7ec35bd0703ae018965e1\n2018|Design and Implementation of a Low-Cost Real-Time In-Situ Drinking Water Quality Monitoring System Using Arduino|10.1109/ICCCEEE.2018.8515886|2|0|S.O. Osman and Mohamed Mohamed and Alzain M. Suliman and A. Mohammed|4137c711b60b71321cda141c433e5e0ebf63a6a8\n2020|Converter matlab fuzzy inference to arduino Csystem|10.1088/1742-6596/1456/1/012010|2|0|M. Khairudin and H. A. Wijaya and Muslikhin|14d3f48a18166aabb9d51aad9efbc32495e10c29\n2018|Comparative Study on Flexible Link Aerator Using Arduino Programming and Dissolved Oxygen Meter|10.30880/IJIE.2018.10.04.001|2|0|B. A. Zain and Fatin Farhana Anuar and N. Al-Shaibani|129821888cf2d4b65e914a2554d05ff7a0d8ba48\n2018|Detection of Lock on Radar System Based on Ultrasonic US 100 Sensor And Arduino Uno R3 With Image Processing GUI|10.1088/1757-899X/336/1/012016|1|0|F. Baskoro and B. Reynaldo|f8d53433c462b3a588278e88681d17c9ee1e6191\n2018|Hydrolysis of Glucose from Bamboo with Micro Controller PID type Arduino UNO and Fuzzy Method|10.2991/ICST-18.2018.8|1|0|N. K. Sari and D. Ernawati and I. Purbasari and B. Rahmat|f9895f90e6161b9d3ae0e8c291b3f560481a7967\n2018|Block Coding Algorithm Training Examples using Arduino Board for Elementary and Secondary School Students|10.14257/IJAST.2018.115.01|1|0|Kyeong Hur and Won-Sung Sohn and Kil Young Kwon|b7a813d8edd47d5fe1ff20e00c5f65cf4a520efe\n2018|Leveraging the Arduino Platform to Develop Information Technology Devices|10.4018/978-1-5225-2255-3.CH285|1|0|D. Recupero and Valentino Artizzu and F. Cella and Alessandro Cotza and Davide Curcio and G. Iengo and Riccardo Macis and A. Marras and Simone Picci and Michael Planu and Riccardo Scasseddu|a579b2243027c6b565b6cee98633c5e140500df2\n2019|RANCANG BANGUN KENDALI OTOMATIS LAMPU DAN PENDINGIN RUANGAN PADA RUANG PERKULIAHAN BERBASIS MIKROKONTROLER ARDUINO NANO|10.24843/SPEKTRUM.2019.V06.I02.P16|1|0|I. W. Yoga Widiana and I. R. Raka Agung and Pratolo Rahardjo|5488111b4a607eafbbb6fb2a37af78ae6f4f9e9f\n2020|PATIENT HEALTH MONITORING USING ARDUINO THROUGH IOT|10.36713/epra4554|1|0|Dr.B.Srikanth and P.Divya and P.Nandini and Sk.Sabira and T.Bharathi.|81b346e408659041e18d78ecc269f1ad21cf8fff\n2020|Kendali Kecepatan Motor DC Penguat Terpisah Berbeban Berbasis Arduino|10.24036/jtev.v6i2.108395|1|0|Dio Taufiq Arif and Aswardi Aswardi|5c56716c594dc0662b336ca54c34b733ece038bb\n2020|Experimental Implementation of TinyIPFIX Protocol for Arduino and Raspberry Pi Platform|10.1109/ICETA51985.2020.9379188|1|0|R. Petija and M. Glevaňák and M. Kučan and P. Fecilak and F. Jakab|60c8eb9ea6d32d0806aa59c69d8fcc437172487f\n2021|Perancangan Sistem Perangkap Hama Tanaman Petani Otomatis Menggunakan Modul Mikrokontroler Arduino|10.32672/JNKTI.V4I1.2663|1|0|Rahmat Tampune Bangun and Hasan Fahmi|c8e7fac5b5b8291c011d4d9920626161b05705ee" }, "arend": { "title": "arend", "appeared": 2019, "type": "pl", "website": "https://arend-lang.github.io", "country": [ "Czech Republic" ], "originCommunity": [ "JetBrains" ], "domainName": { "name": "arend-lang.github.io" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n20630319|Arend: Theorem Prover Based on Homotopy Type Theory by JetBrains|https://arend-lang.github.io/|2019-08-06 22:29:45 UTC|1565130585|adamnemecek|114|309", "twitter": "https://twitter.com/arendlang" }, "aretext": { "title": "aretext", "appeared": 2020, "type": "editor", "demoVideo": [ "https://raw.githubusercontent.com/aretext/aretext/main/screencast.gif" ], "creators": [ "Will Daly" ], "description": "Minimalist text editor with vim-compatible key bindings.", "website": "https://aretext.org", "documentation": [ "https://aretext.org/docs/#getting-started" ], "reference": [ "https://aretext.org/docs/#getting-started" ], "cheatSheetUrl": [ "https://aretext.org/docs/cheat-sheet.html" ], "country": [ "United States" ], "originCommunity": [ "https://dev-nonsense.com" ], "domainName": { "name": "aretext.org" }, "versions": { "2022": [ "0.7", "0.6", "0.5" ] }, "writtenIn": [ "go" ], "githubRepo": { "firstCommit": 2020, "stars": 96, "forks": 7, "subscribers": 10, "created": 2021, "updated": 2022, "description": "Minimalist text editor with vim-compatible key bindings.", "issues": 3, "url": "https://github.com/aretext/aretext" }, "isOpenSource": true }, "arexx": { "title": "ARexx", "appeared": 1987, "type": "pl", "country": [ "United States" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "wikipedia": { "example": [ "/* Alarm.rexx */\n \n ARG event\n \n IF event = 0 THEN EXIT\n IF event = 1 THEN SAY \"Program has ended unexpectedly\"\n IF event = 2 THEN SAY \"Program has finished its job\"\n IF event = 3 THEN SAY \"Cannot find data in selected directory\"" ], "related": [ "tex", "rexx" ], "summary": "ARexx is an implementation of the Rexx language for the Amiga, written in 1987 by William S. Hawes, with a number of Amiga-specific features beyond standard REXX facilities. Like most REXX implementations, ARexx is an interpreted language. Programs written for ARexx are called \"scripts\", or \"macros\"; several programs offer the ability to run ARexx scripts in their main interface as macros. ARexx can easily communicate with third-party software that implements an \"ARexx port\". Any Amiga application or script can define a set of commands and functions for ARexx to address, thus making the capabilities of the software available to the scripts written in ARexx. ARexx can direct commands and functions to several applications from the same script, thus offering the opportunity to mix and match functions from the different programs. For example, an ARexx script could extract data from a database, insert the data into a spreadsheet to perform calculations on it, then insert tables and charts based on the results into a word processor document.", "pageId": 1858505, "created": 2005, "backlinksCount": 139, "revisionCount": 139, "dailyPageViews": 23, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/ARexx" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8017", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Arexx Cookbook: A Tutorial Guide To The Arexx Language On The Commodore Amiga Personal Computer||Merrill Callaway|3720368|3.00|1|0", "isbndb": "", "semanticScholar": "" }, "arezzo-notation": { "title": "arezzo-notation", "appeared": 1033, "type": "musicalNotation", "description": "The stave of 4 lines is usually attributed to an Italian Benedictine Monk called Guido of Arezzo (approx. 991-1033). In \"Micrologus\" a treatise on music notation, he also used the initial letters of a hymn to define musical pitches. These letters were ut, re mi, fa, sol, la. In most countries \"Ut\" became \"Do\" and centuries later with the addition of \"ti\" the system came to be called the sol-fa notation which was taught in many schools.", "reference": [ "https://www.mfiles.co.uk/music-notation-history.htm" ], "country": [ "Spain and Italy" ], "originCommunity": [ "Italian Benedictine Monastery" ] }, "argdown": { "title": "Argdown", "appeared": 2014, "type": "textMarkup", "website": "https://argdown.org/", "webRepl": [ "https://argdown.org/sandbox/html" ], "country": [ "Germany" ], "originCommunity": [ "Karlsruhe Institute of Technology" ], "domainName": { "registered": 2018, "name": "argdown.org" }, "visualParadigm": true, "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "" ] ], "example": [ " # Welcome to Argdown!\n\n [Intro]: Argdown is a simple syntax for defining argumentative \n structures, inspired by Markdown.\n + Writing a *pro & contra list* in Argdown is as \n simple as writing a twitter message (actually we are \n right in the middle of one).\n + But you can also \n **logically reconstruct** more complex dialectical \n relations between arguments or dive into \n the details of their premise-conclusion structures.\n + Finally, you can export Argdown as a graph and create \n **argument maps** of whole debates.\n\n This Argdown document only demonstrates the basic syntax elements. \n The argument map produced is a \"bogus debate\". \n\n To read a reconstruction of a *real* debate, select one of the \n **example debates** by moving your mouse to the *\"Examples\"* button \n on the upper left, above the text editor.\n\n ## Argdown Basics\n\n This is a normal statement with __bold__ and _italic_ text, \n a #tag and a [link](https://github.com/christianvoigt/argdown-parser).\n\n [Statement 1]: Another statement (after a blank line), \n this time with a title defined in square brackets. \n We can use the title to refer to this statement later \n or mention it in other statements. #(Another tag)\n\n [Statement 2]: Let's do that now: The previous \n statement was @[Statement 1].\n + : Statements can be supported \n by __arguments__. Arguments are defined by \n using angle brackets. #tag\n - : This arguments attacks @[Statement 2]. #tag\n - : Arguments can also \n be supported or attacked. #yet-another-tag\n \n\n We can also do that the other way around:\n\n [Intro]\n -> \n\n Headings can be used to group arguments and statements together. \n In the map these groups are visualized as grey boxes.\n\n Tags are visualized by the colors of the arguments and statements in the map.\n\n ### Argument reconstructions\n\n So far, we have ignored the internal structure of arguments. Arguments \n consist of premises from which conclusions are inferred. We can precisely \n define this premise-conclusion structure with Argdown:\n\n \n\n (1) First premise (this is is a normal statement \n and you can do everything with it, we have done \n with the statements above).\n (2) [Statement 2]: We have already defined a statement \n with this title.\n Argdown allows you to add multiple statements \n to the same \"equivalence class\" by giving them \n the same title. The statements will then be treated \n as logically equivalent.\n --\n Some inference rule (Some additional info: 1,2)\n --\n (3) And now the conclusion \n -> Outgoing relations of the conclusion, \n are also interpreted as outgoing relations of \n the whole argument.\n +> \n \n -> [Statement 1]\n\n We can also link to headings: \n [Back to top](#heading-welcome-to-argdown)" ], "githubRepo": { "firstCommit": 2014, "stars": 583, "forks": 20, "subscribers": 22, "created": 2014, "updated": 2022, "description": "a simple syntax for complex argumentation", "issues": 98, "url": "https://github.com/christianvoigt/argdown" }, "repoStats": { "firstCommit": 2014, "commits": 987, "committers": 6, "files": 661 } }, "argon": { "title": "Argon", "appeared": 2022, "type": "pl", "description": "Argon - an interpreted multi-paradigm programming language", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/vjuazo/argon_an_interpreted_multiparadigm_programming/" ] }, "argos": { "title": "Argos", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/745b3f15a0d525e8f79e9b0e98dd9fba2f5074ea" ], "country": [ "France" ], "originCommunity": [ "Verimag" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5550", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Feature and Performance Comparison of the V-REP, Gazebo and ARGoS Robot Simulators|10.1007/978-3-319-96728-8_30|50|4|Lenka Pitonakova and M. Giuliani and A. Pipe and A. Winfield|2dee5378dc52882ef4e8d51eca25c6ef6c1d7126" }, "argus": { "title": "Argus", "appeared": 1982, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "clu" ], "summary": "Argus is a programming language created at MIT by Barbara Liskov between 1982 and 1988, in collaboration with Maurice Herlihy, Paul Johnson, Robert Scheifler, and William Weihl. It is an extension of the CLU language, and utilizes most of the same syntax and semantics. Argus was designed to support the creation of distributed programs, by encapsulating related procedures within objects called guardians, and by supporting atomic operations called actions.", "pageId": 27580389, "created": 2010, "backlinksCount": 15, "revisionCount": 13, "dailyPageViews": 12, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/Argus_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1295", "fileType": "text", "centralPackageRepositoryCount": 0 }, "arith-matic": { "title": "ARITH-MATIC", "appeared": 1954, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Remington Rand" ], "wikipedia": { "summary": "You may have been looking for arithmetic, a branch of mathematics.ARITH-MATIC is an extension of Grace Hopper's A-2 programming language, developed around 1955. ARITH-MATIC was originally known as A-3, but was renamed by the marketing department of Remington Rand UNIVAC.", "created": 2002, "backlinksCount": 14, "pageId": 60393, "revisionCount": 23, "dailyPageViews": 9, "appeared": 1955, "url": "https://en.wikipedia.org/wiki/ARITH-MATIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1833", "centralPackageRepositoryCount": 0 }, "arjuna": { "title": "Arjuna", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/328cdea1a98b7bdacb49fa059e0fe5c6495d8402" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Newcastle" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2907", "centralPackageRepositoryCount": 0 }, "ark-lang": { "title": "Ark", "appeared": 2014, "type": "pl", "website": "https://ark-lang.github.io/", "domainName": { "name": "ark-lang.github.io" }, "example": [ "// binding to printf\n[c] func printf(fmt: ^u8, ...);\n\npub func main(argc: int, argv: ^^u8) -> int {\n // accessed via the C module\n C::printf(c\"Running %s\\n\", ^argv);\n\n // mutable i, type inferred\n mut i := 0;\n\n for i < 5 {\n C::printf(c\"%d\\n\", i);\n\n i += 1;\n }\n return 0;\n}\n" ], "githubRepo": { "firstCommit": 2014, "stars": 676, "forks": 51, "subscribers": 42, "created": 2014, "updated": 2022, "description": "A compiled systems programming language written in Go using the LLVM framework", "issues": 45, "url": "https://github.com/ark-lang/ark" }, "repoStats": { "firstCommit": 2014, "commits": 3483, "committers": 48, "files": 233 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n10845659|Show HN: A programming language I've been working on called Ark|2016-01-05 20:10:20 UTC|1452024620|felixangell1024|3|15" }, "ark": { "title": "ARK", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b61d5f1346e7a4b76c49853fa20e387e253046d1" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Glasgow" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3540", "centralPackageRepositoryCount": 0 }, "arkscript": { "title": "ArkScript", "appeared": 2019, "type": "pl", "creators": [ "Alexandre Plateau", "Pierre Pharel", "Natendrtfm" ], "description": "ArkScript is a small, fast, functional and scripting language for video games.", "website": "https://arkscript-lang.github.io", "country": [ "France" ], "originCommunity": [ "Alexandre Plateau" ], "domainName": { "name": "arkscript-lang.github.io" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "{\n # more or less game\n (print \"More or less game!\")\n (import \"random.bin\")\n (import \"Math/Arithmetic.ark\")\n \n (let number (mod (abs (random)) 10000))\n (mut value 0)\n (mut essais 0)\n (mut continue true)\n \n (while continue {\n (set value (toNumber (input \"Input a numeric value: \")))\n (if (< value number)\n # then\n (print \"More!\")\n # else\n (if (= value number)\n # then\n { (print \"Bingo!\") (set continue false) }\n # else\n (print \"Less!\")))\n (set essais (+ 1 essais))})\n (print \"You won in \" essais \" tries\")\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 452, "forks": 42, "subscribers": 12, "created": 2019, "updated": 2022, "description": "ArkScript is a small, fast, functional and scripting language for C++ projects", "issues": 22, "url": "https://github.com/ArkScript-lang/Ark" }, "repoStats": { "firstCommit": 2019, "commits": 2276, "committers": 43, "files": 247 }, "leachim6": { "filepath": "a/ArkScript.ark", "fileExtensions": [ "ark" ], "example": [ "(print \"Hello World\")\n" ], "id": "ArkScript" }, "semanticScholar": "" }, "arm-templates": { "title": "ARM Templates", "appeared": 2017, "type": "jsonFormat", "description": "Azure Resource Manager templates are JavaScript Object Notation (JSON) files that define the infrastructure and configuration for your project.", "reference": [ "https://docs.microsoft.com/en-us/azure/azure-resource-manager/templates/" ], "originCommunity": [ "Microsoft" ], "example": [ "\"properties\": {\n \"publisher\": \"Microsoft.Azure.Extensions\",\n \"type\": \"CustomScript\",\n \"typeHandlerVersion\": \"2.0\",\n \"autoUpgradeMinorVersion\": true,\n \"settings\": {\n \"fileUris\": [\n \"[concat(variables('template').assets, '/lamp-app/install_lamp.sh')]\"\n ]\n },\n \"protectedSettings\": {\n \"commandToExecute\": \"[concat('sh install_lamp.sh ', parameters('mySqlPassword'))]\"\n }\n}" ], "semanticScholar": "" }, "arm": { "title": "ARM", "appeared": 1985, "type": "assembly", "creators": [ "Sophie Wilson", "Steve Furber", "Acorn Computers" ], "documentation": [ "https://developer.arm.com/documentation/" ], "standsFor": "Acorn RISC Machine", "country": [ "United Kingdom" ], "originCommunity": [ "Acorn Computers or Arm Ltd" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "; if (r0 == r1)\nCMP r0, r1\nITE EQ ; ARM: no code ... Thumb: IT instruction\n; then r0 = r2;\nMOVEQ r0, r2 ; ARM: conditional; Thumb: condition via ITE 'T' (then)\n; else r0 = r3;\nMOVNE r0, r3 ; ARM: conditional; Thumb: condition via ITE 'E' (else)\n; recall that the Thumb MOV instruction has no bits to encode \"EQ\" or \"NE\"" ], "related": [ "x86-isa", "java-bytecode", "bbc-basic", "verilog", "c", "assembly-language", "java", "csharp", "perl", "python", "mmx", "javascript", "android", "unix", "ios", "freebsd", "linux" ], "summary": "ARM, originally Acorn RISC Machine, later Advanced RISC Machine, is a family of reduced instruction set computing (RISC) architectures for computer processors, configured for various environments. British company ARM Holdings develops the architecture and licenses it to other companies, who design their own products that implement one of those architectures‍—‌including systems-on-chips (SoC) and systems-on-modules (SoM) that incorporate memory, interfaces, radios, etc. It also designs cores that implement this instruction set and licenses these designs to a number of companies that incorporate those core designs into their own products. Processors that have a RISC architecture typically require fewer transistors than those with a complex instruction set computing (CISC) architecture (such as the x86 processors found in most personal computers), which improves cost, power consumption, and heat dissipation. These characteristics are desirable for light, portable, battery-powered devices‍—‌including smartphones, laptops and tablet computers, and other embedded systems. For supercomputers, which consume large amounts of electricity, ARM could also be a power-efficient solution. ARM Holdings periodically releases updates to architectures and core designs. All of them support a 32-bit address space (only pre-ARMv3 chips, made before ARM Holdings was formed, as in original Acorn Archimedes, had smaller) and 32-bit arithmetic; instructions for ARM Holdings' cores have 32-bit fixed-length instructions, but later versions of the architecture also support a variable-length instruction set that provides both 32- and 16-bit instructions for improved code density. Some older cores can also provide hardware execution of Java bytecodes. The ARMv8-A architecture, announced in October 2011, adds support for a 64-bit address space and 64-bit arithmetic with its new 32-bit fixed-length instruction set. With over 100 billion ARM processors produced as of 2017, ARM is the most widely used instruction set architecture in terms of quantity produced. Currently, the widely used Cortex cores, older \"classic\" cores, and specialized SecurCore cores variants are available for each of these to include or exclude optional capabilities.", "pageId": 60558, "dailyPageViews": 2538, "created": 2002, "backlinksCount": 1871, "revisionCount": 3920, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/ARM_architecture" }, "rijuRepl": { "example": [ "\t.text\n\t.globl main\nmain:\n\tmov r7, #4\n\tmov r0, #1\n\tldr r1, =message\n\tmov r2, #14\n\tswi 0\n\tmov r7, #1\n\tmov r0, #0\n\tswi 0\n\t.data\nmessage:\n\t.string \"Hello, world!\\n\"\n" ], "description": "Popular RISC architecture used in mobile devices", "fileExtensions": [ "S" ], "website": "https://developer.arm.com/architectures/cpu-architecture", "gitRepo": "https://gcc.gnu.org/git.html", "id": "https://riju.codes/arm" }, "indeedJobs": { "2022": 6588, "query": "arm architecture developer" }, "linkedInSkill": { "2018": 110713, "id": "arm" }, "faqPageUrl": [ "https://developer.arm.com/documentation/102870/latest/" ], "downloadPageUrl": [ "https://developer.arm.com/downloads/-/arm-compiler-for-embedded" ], "jupyterKernel": [ "https://github.com/DeepHorizons/iarm" ], "fileType": "text", "wordRank": 3230, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|Morgan Kaufmann|Digital Design and Computer Architecture: ARM Edition|Harris, Sarah and Harris, David|9780128000564\n2016|Newnes|Modern Assembly Language Programming with the ARM Processor|Pyeatt, Larry D.|9780128036983\n2000|Addison-Wesley Professional|ARM System-on-Chip Architecture (2nd Edition)|Furber, Steve|9780201675191\n2004|Morgan Kaufmann|ARM System Developer's Guide: Designing and Optimizing System Software (The Morgan Kaufmann Series in Computer Architecture and Design)|Sloss, Andrew and Symes, Dominic and Wright, Chris|9781558608740\n2016|MicroDigitalEd|TI MSP432 ARM Programming for Embedded Systems (ARM books) (Volume 4)|Mazidi, Muhammad Ali and Chen, Shujen and Naimi, Sepehr and Naimi, Sarmad and Salmanzadeh, Misagh|9780997925913\n2005|CRC Press|Real-Time Embedded Multithreading: Using ThreadX and ARM|Lamie, Edward L.|9781578201341\n2018|MicroDigitalEd|ARM Assembly Language Programming with Raspberry Pi using GCC|Naimi, Sepehr and Naimi, Sarmad and Yaghini, Azalia and Mazidi, Muhammad Ali|9781970054002\n2019|Apress|Raspberry Pi Assembly Language Programming: ARM Processor Coding|Smith, Stephen|9781484252871\n2014|Springer|ARM Assembly Language with Hardware Experiments|Elahi, Ata and Arjeski, Trevor|9783319117041\n2004|Morgan Kaufmann|ARM System Developer's Guide: Designing and Optimizing System Software (ISSN)|Sloss, Andrew and Symes, Dominic and Wright, Chris|9780080490496\n2009|Newnes|The Definitive Guide to the ARM Cortex-M3|Yiu, Joseph|9781856179638\n2016-08-12T00:00:01Z|MicroDigitalEd.com|ARM Assembly Language Programming & Architecture (ARM books) (Volume 1)|Mazidi, Muhammad Ali and Naimi, Sarmad and Naimi, Sepehr and Chen, Shujen|9780997925906\n2016|Newnes|Fast and Effective Embedded Systems Design: Applying the ARM mbed|Wilmshurst, Tim and Toulson, Rob|9780081009031\n2014|CRC Press|ARM Assembly Language: Fundamentals and Techniques, Second Edition|Hohl, William and Hinds, Christopher|9781482229868\n2019-10-24T00:00:01Z|Apress|Raspberry Pi Assembly Language Programming: ARM Processor Coding|Smith, Stephen|9781484252864\n2021|Apress|RP2040 Assembly Language Programming: ARM Cortex-M0+ on the Raspberry Pi Pico|Smith, Stephen|9781484277539\n2021|Apress|RP2040 Assembly Language Programming: ARM Cortex-M0+ on the Raspberry Pi Pico|Smith, Stephen|9781484277522\n2020|Apress|Modern Arm Assembly Language Programming: Covers Armv8-A 32-bit, 64-bit, and SIMD|Kusswurm, Daniel|9781484262665\n2015|Morgan Kaufmann|Digital Design and Computer Architecture: ARM Edition|Harris, Sarah and Harris, David|9780128009116\n2019|Newnes|ARM 64-Bit Assembly Language|Pyeatt, Larry D. and Ughetta, William|9780128192214\n2017|MicroDigitalEd|TI Tiva ARM Programming For Embedded Systems: Programming ARM Cortex-M4 TM4C123G with C (Mazidi & Naimi ARM Series) (Volume 2)|Mazidi, Muhammad Ali and Chen, Shujen and Naimi, Sarmad and Naimi, Sepehr|9780997925920\n2020|Apress|Programming with 64-Bit ARM Assembly Language: Single Board Computer Development for Raspberry Pi and Mobile Devices|Smith, Stephen|9781484258804\n2018-05-14T00:00:01Z|MicroDigitalEd|STM32 Arm Programming for Embedded Systems (Volume 6)|Mazidi, Muhammad Ali and Chen, Shujen and Ghaemi, Eshragh|9780997925944\n2015|Newnes|The Definitive Guide to ARM Cortex -M0 and Cortex-M0+ Processors|Yiu, Joseph|9780128032770\n2016|Morgan Kaufmann|Computer Organization and Design ARM Edition: The Hardware Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)|Patterson, David A. and Hennessy, John L.|9780128018354\n2017|MicroDigitalEd|Atmel ARM Programming for Embedded Systems (Mazidi & Naimi ARM Series) (Volume 5)|Mazidi, Muhammad Ali and Chen, Shujen and Ghaemi, Eshragh and Naimis|9780997925975\n2016-10-15T00:00:01Z|MicroDigitalEd|Freescale ARM Cortex-M Embedded Programming (Mazidi and Naimi ARM books) (Volume 3)|Mazidi, Muhammad Ali and Naimi, Sarmad and Naimi, Sepehr and Chen, Shujen|9780997925982\n2017|CRC Press|ARM Microprocessor Systems: Cortex-M Architecture, Programming, and Interfacing|Tahir, Muhammad and Javed, Kashif|9781482259384\n2012|Newnes|Fast and Effective Embedded Systems Design: Applying the ARM mbed|Toulson, Rob and Wilmshurst, Tim|9780080977690\n2015|Morgan Kaufmann|Embedded Systems: ARM Programming and Optimization|Bakos, Jason D.|9780128004128\n2020|Mazidi & Naimi|Arm Cortex-M Assembly Programming for Embedded Programmers: Using Keil|Naimi, Sepehr and Naimi, Sarmad and Mazidi, Muhammad Ali|9781970054132\n1996|Addison-Wesley|ARM System Architecture|Furber, Stephen B.|9780201403527\n2022|Springer|Embedded System Design with ARM Cortex-M Microcontrollers: Applications with C, C++ and MicroPython|Ünsalan, Cem and Gürhan, Hüseyin Deniz and Yücel, Mehmet Erkin|9783030884390\n2009|CRC Press|ARM Assembly Language: Fundamentals and Techniques|Hohl, William|9781439806104\n2012|Newnes|Fast and Effective Embedded Systems Design: Applying the ARM mbed|Toulson, Rob and Wilmshurst, Tim|9780080977683\n2011|Newnes|The Definitive Guide to the ARM Cortex-M0|Yiu, Joseph|9780123854773\n2015|Morgan Kaufmann|Embedded Systems: ARM Programming and Optimization|Bakos, Jason D.|9780128003428\n2007|Newnes|The Definitive Guide to the ARM Cortex-M3 (Embedded Technology)|Yiu, Joseph|9780750685344\n2009|Newnes|The Definitive Guide to the ARM Cortex-M3|Yiu, Joseph|9781856179645\n2016|Springer|ARM Assembly Language with Hardware Experiments|Elahi, Ata and Arjeski, Trevor|9783319379548\n2012|Wiley-ISTE|Assembly Language Programming: ARM Cortex-M3|Mahout, Vincent|9781848213296\n2019-06-14T00:00:01Z|MicroDigitalEd.com|TI ARM Microcontroller Programming with Energia: Going from Arduino to ARM: Using TI ARM Launchpad|Mazidi, Muhammad Ali and Chen, Shujen and Ghaemi, Eshragh|9781970054217\n2016|CreateSpace Independent Publishing Platform|ARM Cortex-M3 & Cortex-M4 Assembly Language Programming: The Beginners Guide to ARM Cortex-M3 and Cortex-M4 Processors|Learning, UpSkill|9781540653444\n2017-08-07T00:00:01Z|Notion Press, Inc.|Make Your First Robot: 1. Robotics programming for beginners. 2. Foster your Creativity using Inexpensive Robots. 3. Program a Robotic arm to help yourself.|Kumar K K, Vineesh|9781947586741\n1987|MTC|ARM Assembly Language Programming|Cockerell, Peter J|9780951257906\n2012|LAP LAMBERT Academic Publishing|Robotic Arm Control With Human Arm Movement: Robot and Human Arm Interfacing via non contact sensors|Khan, Irfan and Ali, Samee Zeeshan|9783659128448\n2009||Solutions Manual - Arm Assembly Language|Crc Press|9781439815625\n2018||St Micro Arm Programming For Embedded Systems|Muhammad Ali Mazidi and Shujen Chen and Eshragh Ghaemi|9780997925937\n2015|LAP Lambert Academic Publishing|A Textbook on Microcontroller Based System Design using 8051 and ARM|Panachakel Jerrin Thomas|9783659692178\n2017|LAP LAMBERT Academic Publishing|Fuzzy Model Reference Learning Control for an Arm of a Robot|Casavela, Stelian Valentin and Casavela, Cristofor and Casavela, Antonio|9786202025034\n2012|LAP LAMBERT Academic Publishing|Elegant ARM Using Parallel Processing: An Approach Towards Multi-Core Programming|Verma, Gurudatta|9783659273780\n2010|LAP LAMBERT Academic Publishing|Open Digital Signal Processing Platform Abstraction Layer: For an ARM Linux based system: EP9302|Medina, Alejandra|9783838374796", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2016|The Python ARM Radar Toolkit (Py-ART), a Library for Working with Weather Radar Data in the Python Programming Language|10.5334/JORS.119|181|14|Jonathan J. Helmus and S. Collis|49d96266eb10a539b120c2bac02cd4ad454bb089\n2005|A multimodal interface to control a robot arm via the web: a case study on remote programming|10.1109/TIE.2005.858733|161|4|R. Marín and P. Sanz and P. Nebot and R. Wirz|e7def17d4b275dd7f88f4b8ffbfe51cfc6cc5a93\n2015|BRACON: Control system for a robotic arm with 6 degrees of freedom for education systems|10.1109/ICARA.2015.7081174|18|0|David Rivas and V. MarceloÁlvarez and Patricio Velasco and Javier Mamarandi and J. Carrillo-Medina and Victor Bautista and Omar Galarza-Barrionuevo and Patricio Reyes-Bedoya and Mayra Erazo-Rodas and Milton Perez and Mónica Huerta|6480d898b86d1d5781567e59cc4fc3327003378c\n2009|ARM Assembly Language: Fundamentals and Techniques|10.1201/9781439806111|14|0|W. Hohl|7fa354f6723d64b53eb3ca0686039a7e207f348e\n2020|RusTEE: Developing Memory-Safe ARM TrustZone Applications|10.1145/3427228.3427262|10|1|Shengye Wan and Ning Zhang|8652404567d4c092534fc445a2b5033fbc82050d\n2006|Matlab-C++ Interface for a Flexible Arm Manipulator Simulation Using Multi-Language Techniques|10.1109/MICAI.2006.31|8|1|M. Gamiño and J. Pedraza and J. Ramos and E. Gorrostieta|1484f07a8a0cd0bcc3af18990621dce9c8558ef2\n2014|Android Operated Robotic Arm|10.13189/UJCA.2014.020101|8|0|Z. Ali and M.Tanveer and H. Shaukat and Saad Anwar|9bf584f14c7222fa239b9a574074433e1a0c22db\n2011|Kinematics of AdeptThree Robot Arm|10.5772/17732|7|0|A. B. Rehiara|9afdcd66f1acce464d5797bc7d121b4e306da893\n2018|Implementation of Object Detection and Recognition Algorithms on a Robotic Arm Platform Using Raspberry Pi|10.1109/IDAP.2018.8620916|7|0|Çagri Kaymak and A. Uçar|a65fa0e396fb23cd369e8851445707a78c298252\n2016|Modern Assembly Language Programming with the ARM Processor|10.1016/c2015-0-00180-0|6|0|Larry D. Pyeatt|8d2a6b8f25cb7a0e514bcd5ff4bcac67ccfc54f0\n2015|Wireless colour sensing arm robot|10.1109/RACE.2015.7097240|5|0|J. Nandhini and K. Shabatini and S. Karthikeyan|9d34e08b8b25e15cfa5ed7e2d7f303d8a3bbae68\n2012|An open-source and cross-platform framework for Brain Computer Interface-guided robotic arm control|10.4103/2152-7806.104743|4|0|P. Kubben and N. Pouratian|978c287eebde9ebf04126982e369caae2a54bd5b\n2014|Robotic arm autonomous movement in 3D space using stereo image recognition in Linux|10.1109/ISETC.2014.7010792|4|0|R. Szabó and A. Gontean|b52a44899e3f86e60584aeecce11f4c75d226b57\n2008|Proposal for Teaching Manufacturing and Control Programming Using Autonomous Mobile Robots with an Arm|10.1007/978-3-540-69924-8_7|4|0|S. Kurebayashi and Hiroyuki Aoki and T. Kamada and S. Kanemune and Y. Kuno|6e19c24996a4fdbaa3c1333fcec161a1ebd148d8\n2019|Wireless Hand Gesture Controlled Robotic Arm Via NRF24L01 Transceiver|10.1109/ISCAIE.2019.8743772|3|0|Ahmad Bazli Bakri and R. Adnan and F. Ruslan|1370c395bb0212ab7ca9be535085d8bb00e81bc5\n2019|Development of Robotic Arm Control System Using Computational Vision|10.1109/TLA.2019.8932334|3|0|Oliveira Glaufe and Oliveira Gladstone and Egoavil Ciro and Carvalho C. A. T. and Luna José|5a48d06b21dfa484eefca063f0b5df01dd535f57\n2013|High Efficiency Code Optimization in ARM Cortex-M Series Processor|10.3182/20130925-3-CZ-3023.00109|2|0|M. Penhaker and Lukas Vaculik|759da6047ea2976a7e3b678ebc376318cee86577\n2018|Design of mechanical arm for an automatic sorting system of recyclable cans|10.1088/1742-6596/1007/1/012066|2|0|Y. Resti and A. S. Mohruni and F. Burlian and I. Yani and A. Amran|003de1d37b8deacbb9f1872133bedb0c0843813b\n2013|Applying language-based static verification in an ARM operating system|10.1145/2518148.2518154|2|0|Matthew Danish and H. Xi and R. West|4c68610586c426f2c6f1faddbaa029e06aae6468\n1990|A computational model for a robotic arm instructed by natural language|10.1109/ICSMC.1990.142147|1|0|L. Liang and C. Crangle and L. Leifer|199218cbc9dfb16f01bcab29277f9a8a0a75fe19\n1987|A Command Language for Multiple Robot Arm Coordination|10.1109/TE.1987.5570532|1|0|R. A. Perez and Dimitrios I. Koutsourelis|1e9b0da45a9ed9787066a27008c8825d18e5b7a2\n2015|Emulating a robotic manipulator arm with an hybrid motion-control system|10.1088/1742-6596/582/1/012052|1|0|G. Aragón-González and A. León-Galicia and M. Noriega-Hernández and A. Salazar-Hueta|d034fcfb223272a07475eaf371b1266744595fc0\n2017|Static Binary Code Instrumentation for ARM Architecture|10.1007/978-3-319-74313-4_9|1|0|M. Ermakov|95ad0658014cd66b278211b60e197495c7914191\n2014|ARM Assembly Language with Hardware Experiments|10.1007/978-3-319-11704-1|1|0|A. Elahi and B. T. Arjeski|3d90fb407dd639b4fbb2e8f652f33de099d2262d\n2019|Electromyography-based Control of Prosthetic Arm for Transradial Amputees using Principal Component Analysis and Support Vector Machine Algorithms|10.1109/HNICEM48295.2019.9073353|1|0|K.R.L. Cabegin and M. Lim and D. Fernan and R.G. Garcia Santos and G. Magwili|1ed5943c951e4b536c9fef8b63f5f0a4152c6c8b\n2019|A Study of Robot Control Programing for an Industrial Robotic Arm|10.1109/ACCS-PEIT48329.2019.9062878|1|0|M. Abdelaal|59d4285d4be3edf0864454032d7d4b99d3ccfccf\n2019|The use of LEGO Mindstorms to create a model of the surgical robot arm for the education of medical students|10.1515/bams-2019-0011|1|0|M. Rudnik and P. Walecki|79f3d2d0159a9225d0f3df9317423171d3310255\n2021|Convolutional Neural Network Based Electroencephalogram Controlled Robotic Arm|10.1109/I2CACIS52118.2021.9495879|1|0|Z. Lim and Neo Yong Quan|05030dd400a17e4ff5c6c2d7789aa069540a6e04\n2016|Robot arm simulation using 3D software application with 3D modeling, programming and simulation support|10.1109/MHS.2016.7824231|1|0|S. C. Abdullah and M. A. M. Jusoh and Nazri M. Nawi and M. D. Amari|25f08ce8a41058c44602af34678cb68c99af96a1\n2019|Raspberry Pi Assembly Language Programming: ARM Processor Coding|10.1007/978-1-4842-5287-1|1|0|Stephen Smith|ddc720739f6303a7d41749a964cd2e2d00181ca3\n2013|Design an Arm Robot through Prolog Programming Language|10.4172/2168-9695.1000104|1|0|A. Azad and T. Rashid|1e2d636b3b4df2802b0815122ba551c001f7235a\n2020|Programming with 64-Bit ARM Assembly Language: Single Board Computer Development for Raspberry Pi and Mobile Devices|10.1007/978-1-4842-5881-1|1|0|Stephen Smith|bc2528fd5909abf90be93ff0a57e7390675af005" }, "armani": { "title": "Armani", "appeared": 1999, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bdf831dc0faa2839b9098c33839f583d6e1b16fa" ], "country": [ "United States" ], "originCommunity": [ "Wright Laboratory", "Aeronautical Systems Center", "Air Force Materiel Command, USAF", "Advanced Research Projects Agency" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5804", "centralPackageRepositoryCount": 0 }, "arret": { "title": "arret", "appeared": 2017, "type": "pl", "creators": [ "Ryan Cumming" ], "githubRepo": { "firstCommit": 2017, "stars": 198, "forks": 2, "subscribers": 4, "created": 2018, "updated": 2022, "description": "Pure functional Lisp implemented in Rust", "issues": 5, "url": "https://github.com/etaoins/arret" }, "repoStats": { "firstCommit": 2017, "commits": 2587, "committers": 9, "files": 330 } }, "arrow-format": { "title": "Apache Arrow", "appeared": 2016, "type": "binaryDataFormat", "description": "Apache Arrow is a cross-language development platform for in-memory data. It specifies a standardized language-independent columnar memory format for flat and hierarchical data, organized for efficient analytic operations on modern hardware. It also provides computational libraries and zero-copy streaming messaging and interprocess communication. Languages currently supported include C, C++, Java, JavaScript, Python, and Ruby.", "website": "https://arrow.apache.org/", "aka": [ "feather" ], "country": [ "Various" ], "originCommunity": [ "The Apache Software Foundation" ], "domainName": { "name": "arrow.apache.org" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "arrow": { "title": "arrow", "appeared": 2015, "type": "pl", "description": "A Modern Reversible Programming Language. Reversible programming languages are those whose programs can be run backwards as well as forwards. This condition impacts even the most basic constructs, such as =, if and while. I discuss Janus, the first imperative reversible programming language, and its limitations. I then introduce Arrow, a reversible language with modern features, including functions.", "reference": [ "https://etd.ohiolink.edu/!etd.send_file?accession=oberlin1443226400" ], "pygmentsHighlighter": { "filename": "arrow.py", "fileExtensions": [ "arw" ], "id": "Arrow" }, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|Fletcher: A Framework to Efficiently Integrate FPGA Accelerators with Apache Arrow|10.1109/FPL.2019.00051|18|1|J. Peltenburg and J. V. Straten and L. Wijtemans and L. V. Leeuwen and Z. Al-Ars and H. P. Hofstee|111981252a6bad30e1fc7ad27bfdf219fd3cddba\n2009|The Arrow Calculus as a Quantum Programming Language|10.1007/978-3-642-02261-6_30|12|0|J. K. Vizzotto and A. R. D. Bois and A. Sabry|8cd48d0c0dd109ff97b221b1648123c97181964a\n2020|Optimizing performance of GATK workflows using Apache Arrow In-Memory data framework|10.1186/s12864-020-07013-y|4|0|Tanveer Ahmad and Nauman Ahmed and Z. Al-Ars and H. P. Hofstee|fcb3832d9a7728a625816bdeace7c4ec9c5748cb\n1999|Event, State, And Process In Arrow Logic|10.1023/A:1008370613208|4|1|S. Tojo|fe08d5aefe5aad91347aa9a19c56119b20824a39" }, "arta": { "title": "ARTA", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bd16c122a4e3c97041a3cc1c85fae6efac786939" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5473", "centralPackageRepositoryCount": 0 }, "artspeak": { "title": "ARTSPEAK", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7e51608a6d02d19d33e8f69a65b1d3fb2f222ec4" ], "country": [ "United States" ], "originCommunity": [ "Boston University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=635", "centralPackageRepositoryCount": 0, "isbndb": "" }, "arturo": { "title": "Arturo", "appeared": 2019, "type": "pl", "creators": [ "Yanis Zafirópulos" ], "website": "https://arturo-lang.io", "domainName": { "registered": 2019, "name": "arturo-lang.io" }, "semanticScholar": "" }, "arvelie-format": { "title": "arvelie-format", "appeared": 2017, "type": "timeFormat", "description": "The Arvelie Calendar has 26 months of 14 days each. Each month has 2 weeks of 7 days, and each month's name is one of the 26 letters of the alphabet. The 365th day of the year is the Year Day(+01), preceded by the Leap Day(+02) on leap years.", "website": "https://wiki.xxiivv.com/#arvelie", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/XXIIVV" ], "domainName": { "name": "wiki.xxiivv.com" }, "example": [ "02A01 2002-01-01 01D07 2001-02-18\n13B12 2013-01-26 02E07 2002-03-04\n24C01 2024-01-29 03+01 2003-12-31\n22D12 2022-02-23 19U07 Today" ], "isbndb": "", "semanticScholar": "" }, "ascii-armor": { "title": "ASCII Armor", "appeared": 2007, "type": "textEncodingFormat", "description": "OpenPGP provides the service of converting the raw 8-bit binary octet stream to a stream of printable ASCII characters, called Radix-64 encoding or ASCII Armor.", "reference": [ "https://datatracker.ietf.org/doc/html/rfc4880#page-54" ], "related": [ "base64" ], "example": [ " -----BEGIN PGP MESSAGE-----\n Version: OpenPrivacy 0.99\n \n yDgBO22WxBHv7O8X7O/jygAEzol56iUKiXmV+XmpCtmpqQUKiQrFqclFqUDBovzS\n vBSFjNSiVHsuAA==\n =njUN\n -----END PGP MESSAGE-----" ], "pygmentsHighlighter": { "filename": "asc.py", "fileExtensions": [ "asc", "pem", "id_dsa", "id_ecdsa", "id_ecdsa_sk", "id_ed25519", "id_ed25519_sk", "id_rsa" ], "id": "ASCII armored" } }, "ascii": { "title": "ASCII", "appeared": 1963, "type": "characterEncoding", "description": "Started out as 7 bits. Now 8.", "standsFor": "American Standard Code for Information Interchange", "country": [ "United States" ], "originCommunity": [ "American National Standards Institute" ], "wikipedia": { "example": [ "!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" ], "related": [ "punched-tape", "c", "vi-editor", "multics", "unix", "ftp", "utf-8", "unicode", "java", "perl" ], "summary": "ASCII ( ( listen) ASS-kee), abbreviated from American Standard Code for Information Interchange, is a character encoding standard for electronic communication. ASCII codes represent text in computers, telecommunications equipment, and other devices. Most modern character-encoding schemes are based on ASCII, although they support many additional characters. ASCII is the traditional name for the encoding system; the Internet Assigned Numbers Authority (IANA) prefers the updated name US-ASCII, which clarifies that this system was developed in the US and based on the typographical symbols predominantly in use there.", "pageId": 586, "dailyPageViews": 4139, "created": 2001, "backlinksCount": 4364, "revisionCount": 3541, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/ASCII" }, "fileType": "na", "wordRank": 7938, "centralPackageRepositoryCount": 0 }, "asciidoc": { "title": "AsciiDoc", "appeared": 2002, "type": "textMarkup", "website": "http://asciidoc.org/", "domainName": { "awisRank": { "2022": 833537 }, "name": "asciidoc.org" }, "wikipedia": { "example": [ "= My Article\nJ. Smith\n\nhttps://wikipedia.org[Wikipedia] is an\non-line encyclopaedia, available in\nEnglish and *many* other languages.\n\n== Software\n\nYou can install 'package-name' using\nthe `gem` command:\n\n gem install package-name\n\n== Hardware\n\nMetals commonly used include:\n\n* copper\n* tin\n* lead" ], "related": [ "python", "ruby", "xml", "html", "tex", "unix", "java" ], "summary": "AsciiDoc is a human-readable document format, semantically equivalent to DocBook XML, but using plain-text mark-up conventions. AsciiDoc documents can be created using any text editor and read “as-is”, or rendered to HTML or any other format supported by a DocBook tool-chain, i.e. PDF, TeX, Unix manpages, e-books, slide presentations, etc.", "pageId": 6697014, "created": 2006, "backlinksCount": 69, "revisionCount": 116, "dailyPageViews": 89, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/AsciiDoc" }, "githubLanguage": { "fileExtensions": [ "asciidoc", "adoc", "asc" ], "trendingProjectsCount": 0, "type": "prose", "aceMode": "asciidoc", "tmScope": "text.html.asciidoc", "wrap": true, "repos": 21, "id": "AsciiDoc" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2015, "committerCount": 8, "commitCount": 37, "sampleCount": 3, "example": [ "AsciiDoc Home Page\n==================\n\nTitle\n-----\n\nExample Articles\n~~~~~~~~~~~~~~~~\n- Item 1\n\n- Item 2\n\n- Item 3\n" ], "url": "https://github.com/zuckschwerdt/asciidoc.tmbundle" }, "rijuRepl": { "example": [ "Hello, world!\n" ], "description": "Human-readable document format, semantically equivalent to DocBook XML, but using plain-text mark-up conventions", "fileExtensions": [ "adoc" ], "website": "https://asciidoc.org/", "gitRepo": "https://github.com/asciidoc/asciidoc", "id": "https://riju.codes/asciidoc" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "asciidots": { "title": "AsciiDots", "appeared": 2017, "type": "esolang", "creators": [ "Aaron Janse" ], "website": "http://ajanse.me/asciidots/", "webRepl": [ "http://ajanse.me/asciidots/demo" ], "visualParadigm": true, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "example": [ "/-& `` This is where the program ends!\n|\n\\-\\ /-\\\n | | |\n/-/ | \\-\\\n\\---/ |\n |\n \\-. `` Here's where the program starts" ], "githubRepo": { "stars": 1047, "forks": 36, "subscribers": 24, "created": 2017, "updated": 2022, "firstCommit": 2017, "description": "Esolang inspired by ASCII art", "issues": 12, "url": "https://github.com/aaronduino/asciidots" }, "repoStats": { "firstCommit": 2017, "commits": 455, "committers": 19, "files": 124 }, "leachim6": { "filepath": "a/AsciiDots.ascii", "fileExtensions": [ "ascii" ], "example": [ ".-$\"Hello World\" \n" ], "id": "AsciiDots" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AsciiDots", "tryItOnline": "asciidots", "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n14947449|Show HN: AsciiDots – a 2D esoteric language inspired by circuits|2017-08-07 13:57:27 UTC|1502114247|aaronduino|33|148", "esolang": "https://esolangs.org/wiki/AsciiDots", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "asciimath": { "title": "AsciiMath", "appeared": 2014, "type": "textMarkup", "creators": [ "Peter Krautzberger" ], "description": "AsciiMath is an easy-to-write markup language for mathematics.", "website": "http://asciimath.org/", "domainName": { "awisRank": { "2022": 1444282 }, "name": "asciimath.org" }, "related": [ "latex" ], "example": [ "sum_(i=1)^n i^3=((n(n+1))/2)^2" ], "githubRepo": { "firstCommit": 2014, "stars": 863, "forks": 194, "subscribers": 37, "created": 2014, "updated": 2022, "description": "A new home for asciimathml", "issues": 47, "url": "https://github.com/mathjax/asciimathml" }, "repoStats": { "firstCommit": 2014, "commits": 166, "committers": 16, "files": 29 } }, "asdf": { "title": "ASDF", "appeared": 2015, "type": "pl", "creators": [ "Perry Greenfield", "Michael Droettboom", "Erik M. Bray" ], "website": "https://asdf.readthedocs.io/", "country": [ "United States" ], "originCommunity": [ "Space Telescope Science Institute" ], "githubRepo": { "firstCommit": 2011, "stars": 423, "forks": 48, "subscribers": 24, "created": 2014, "updated": 2022, "description": "ASDF (Advanced Scientific Data Format) is a next generation interchange format for scientific data", "issues": 77, "url": "https://github.com/asdf-format/asdf" }, "repoStats": { "firstCommit": 2011, "commits": 4129, "committers": 63, "files": 239 } }, "asf-sdf": { "title": "ASF+SDF", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0d3d2fce141270ea72833e3f31982654c21ef954" ], "country": [ "Netherlands" ], "originCommunity": [ "Centrum Wiskunde & Informatica", "Software Improvement Group", "Utrecht University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5515", "centralPackageRepositoryCount": 0 }, "ashmedai": { "title": "ASHMEDAI", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4eabeac5f92184ae0ae03f2685cbf0a036602bab" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University", "University of Pittsburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1835", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "asic-programming-language": { "title": "ASIC", "appeared": 1992, "type": "pl", "country": [ "United States" ], "originCommunity": [ "80/20 Software" ], "wikipedia": { "example": [ "REM 10 a=2\nL10: \n\tA@ = 2 \n\t\n\tREM 20 b=a^10\n\t2: Syntax error\n\n\tREM 30 PRINT b\tREM 30 PRINT b\t3: Syntax error" ], "related": [ "microsoft-macro-assembler", "basic", "gw-basic" ], "summary": "ASIC is a programming language, a BASIC dialect and shareware compiler for DOS systems. Written by Dave Visti of 80/20 Software, it achieved brief popularity in the 1990s as one of the few BASIC compilers legally available for download from BBSes. However, ASIC understood only a small subset of the BASIC language, with most versions having little or no support for logical operators, control structures, and floating-point arithmetic. These shortcomings are the reason for the software's tongue-in-cheek motto, \"ASIC: It's almost BASIC!\"Notably, however, ASIC did feature a rudimentary integrated development environment and an RS-232 communications library for writing terminal and BBS software, as well not requiring line numbers. The last release of ASIC, version 5.00, was more compatible with GW-BASIC and offered a utility to convert GW-BASIC programs to ASIC syntax. ASIC allows compiling to a DOS EXE file or COM file. The low overhead of the COM file format lets ASIC make one of the smallest compiled executables of the Hello world program, typically 360 bytes.", "created": 2005, "backlinksCount": 94, "pageId": 1459799, "revisionCount": 67, "dailyPageViews": 16, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/ASIC_programming_language" }, "centralPackageRepositoryCount": 0 }, "asmjs": { "title": "Asm.js", "appeared": 2013, "type": "ir", "website": "http://asmjs.org/", "originCommunity": [ "Mozilla" ], "domainName": { "registered": 2012, "awisRank": { "2017": 814936, "2022": 11291320 }, "name": "asmjs.org" }, "wikipedia": { "example": [ "function strlen(ptr) {\n ptr = ptr|0;\n var curr = 0;\n curr = ptr;\n while (MEM8[curr]|0 != 0) {\n curr = (curr + 1)|0;\n }\n return (curr - ptr)|0;\n}" ], "related": [ "javascript", "llvmir", "lua", "perl", "python", "ruby", "opengl", "vim-editor", "sqlite", "gnuplot", "unity-engine", "godot-game-engine", "wasm" ], "summary": "asm.js is an intermediate programming language designed to allow computer software written in languages such as C to be run as web applications while maintaining performance characteristics considerably better than standard JavaScript, the typical language used for such applications. asm.js consists of a strict subset of JavaScript, into which code written in statically-typed languages with manual memory management (such as C) is translated by a source-to-source compiler such as Emscripten (based on LLVM). Performance is improved by limiting language features to those amenable to ahead-of-time optimization and other performance improvements. Mozilla Firefox was the first web browser to implement asm.js-specific optimizations, starting with version 22.", "pageId": 38962533, "dailyPageViews": 176, "created": 2013, "backlinksCount": 218, "revisionCount": 203, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/Asm.js" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "asn-1": { "title": "ASN.1", "appeared": 1984, "type": "idl", "country": [ "United Kingdom" ], "originCommunity": [ "International Telecommunication Union", "International Electrotechnical Commission" ], "example": [ "FooProtocol DEFINITIONS ::= BEGIN\n\n FooQuestion ::= SEQUENCE {\n trackingNumber INTEGER,\n question IA5String\n }\n\n FooAnswer ::= SEQUENCE {\n questionNumber INTEGER,\n answer BOOLEAN\n }\n\nEND" ], "wikipedia": { "example": [ "\n 5\n Anybody there?\n" ], "related": [ "protobuf", "thrift", "ascii", "json", "xml" ], "summary": "Abstract Syntax Notation One (ASN.1) is an interface description language for defining data structures that can be serialized and deserialized in a standard, cross-platform way. It's broadly used in telecommunications and computer networking, and especially in cryptography. Protocol developers define data structures in ASN.1 modules, which are generally a section of a broader standards document written in the ASN.1 language. Because the language is both human-readable and machine-readable, modules can be automatically turned into libraries that process their data structures, using an ASN.1 compiler. ASN.1 is similar in purpose and use to protocol buffers and Apache Thrift, which are also interface description languages for cross-platform data serialization. Like those languages, it has a schema (in ASN.1, called a \"module\"), and a set of encodings, typically type-length-value encodings. However, ASN.1, defined in 1984, predates them by many years. It also includes a wider variety of basic data types, some of which are obsolete, and has more options for extensibility. A single ASN.1 message can include data from multiple modules defined in multiple standards, even standards defined years apart.", "pageId": 75625, "dailyPageViews": 358, "created": 2002, "backlinksCount": 145, "revisionCount": 363, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Abstract_Syntax_Notation_One" }, "githubLanguage": { "fileExtensions": [ "asn", "asn1" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "codemirrorMode": "asn.1", "codemirrorMimeType": "text/x-ttcn-asn", "tmScope": "source.asn", "repos": 0, "id": "ASN.1" }, "codeMirror": "asn-1", "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2016, "committerCount": 4, "commitCount": 20, "sampleCount": 1, "example": [ "MyShopPurchaseOrders DEFINITIONS AUTOMATIC TAGS ::= BEGIN\n\nPurchaseOrder ::= SEQUENCE {\ndateOfOrder\tDATE,\ncustomer \tCustomerInfo,\nitems \tListOfItems\n}\n\nCustomerInfo ::= SEQUENCE {\ncompanyName\t VisibleString (SIZE (3..50)),\nbillingAddress\tAddress,\ncontactPhone NumericString (SIZE (7..12))\n}\n\nAddress::= SEQUENCE {\nstreet\t VisibleString (SIZE (5 .. 50)) OPTIONAL,\ncity\t VisibleString (SIZE (2..30)),\nstate\t VisibleString (SIZE(2) ^ FROM (\"A\"..\"Z\")),\nzipCode\tNumericString (SIZE(5 | 9))\n}\n\nListOfItems ::= SEQUENCE (SIZE (1..100)) OF Item\n\nItem ::= SEQUENCE {\nitemCode\t INTEGER (1..99999),\ncolor \tVisibleString (\"Black\" | \"Blue\" | \"Brown\"),\npower \tINTEGER (110 | 220),\ndeliveryTime \tINTEGER (8..12 | 14..19),\nquantity\t INTEGER (1..1000),\nunitPrice\t REAL (1.00 .. 9999.00),\nisTaxable\t BOOLEAN\n}\nEND\n" ], "url": "https://github.com/ajLangley12/language-asn1" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1070", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "asp.net": { "title": "ASP.NET", "appeared": 2002, "type": "pl", "originCommunity": [ "Microsoft" ], "successorOf": [ "asp" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/ASP.NET" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "asax", "ascx", "ashx", "asmx", "aspx", "axd" ], "aceMode": "text", "codemirrorMode": "htmlembedded", "codemirrorMimeType": "application/x-aspx", "tmScope": "text.html.asp", "aliases": [ "aspx", "aspx-vb" ], "repos": 21976, "id": "ASP.NET" }, "githubBigQuery": { "repos": 543, "users": 463, "id": "ASP.NET" } }, "asp": { "title": "ASP", "appeared": 1996, "type": "template", "documentation": [ "https://learn.microsoft.com/en-us/previous-versions/iis/6.0-sdk/ms526064(v=vs.90)" ], "standsFor": "Active Server Pages", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Response.Write" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "<%\nOn Error Resume Next\n\nResponse.Write 1 / 0 ' Division by zero\n\nIf Err.Number <> 0 Then\n Response.Write \"Error Code: \" & Server.HTMLEncode(Err.Number) & \"
\"\n Response.Write \"Error Source: \" & Server.HTMLEncode(Err.Source) & \"
\"\n Response.Write \"Error Description: \" & Server.HTMLEncode(Err.Description) & \"
\"\n Err.Clear \nEnd If \n%>" ], "related": [ "vbscript", "jscript", "html", "csharp", "java-server-pages", "php" ], "summary": "Active Server Pages (ASP), later known as Classic ASP or ASP Classic, is Microsoft's first server-side script engine for dynamically generated web pages. ASP.NET, first released in January 2002, has superseded ASP.", "pageId": 2883, "dailyPageViews": 329, "created": 2001, "backlinksCount": 817, "revisionCount": 1093, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Active_Server_Pages" }, "githubLanguage": { "fileExtensions": [ "asp", "asax", "ascx", "ashx", "asmx", "aspx", "axd" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nhq450 fancyss https://github.com/hq450.png https://github.com/hq450/fancyss ASP #6a40fd 4177 1188 357 \"fancyss is a project providing tools to across the GFW on asuswrt/merlin based router.\"\nkoolshare armsoft https://github.com/koolshare.png https://github.com/koolshare/armsoft ASP #6a40fd 107 23 40 \"梅林384软件中心 for armv7l架构机型\"", "trendingProjectsCount": 3, "repos": 47971, "id": "ASP" }, "githubBigQuery": { "repos": 32849, "users": 22600, "id": "ASP" }, "pygmentsHighlighter": { "filename": "dotnet.py", "fileExtensions": [ "aspx", "asax", "ascx", "ashx", "asmx", "axd" ], "id": "aspx-vb" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2015, "committerCount": 4, "commitCount": 39, "url": "https://github.com/textmate/asp.tmbundle" }, "leachim6": { "filepath": "a/ASP.asp", "fileExtensions": [ "asp" ], "example": [ "<%@ Language= \"VBScript\" %>\n<%\n Response.Write(\"Hello World\")\n%>\n" ], "id": "ASP" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ASP", "indeedJobs": { "2022": 9630, "query": "ASP developer" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5356", "fileType": "text", "wordRank": 4194, "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nActive Server Pages For Dummies|1999|Bill Hatfield|4619106|2.00|2|0\nProgramming Active Server Pages|1997|Scot Hillier|2090303|4.50|2|0\nActive Server Pages 2.0 for Dummies [With CDROM]|1999|Bill Hatfield|1505073|3.12|8|2\nASP Developer's Guide [With CDROM]|2000|Greg Buczek|418681|3.64|11|0\nASP 3.0 Programmer's Reference|1999|Richard Anderson|979592|3.64|11|0\nWeb Programming with ASP and COM|1999|Matt J. Crouch|4948265|5.00|4|0", "isbndb": "year|publisher|title|authors|isbn13\n2009|Cengage Learning|ASP .NET Programming with C# & SQL Server (Web Technologies)|Gosselin, Don|9781423903246\n1999|Wrox Press|Beginning ASP Databases|Willis, Thearon|9781861002723\n2001|Syngress|ASP Configuration Handbook|Syngress and Thurston, Sean|9781928994268\n2000|Sams Publishing|Sams Teach Yourself E-Commerce Programming with ASP in 21 Days|Walther, Stephen and Banick, Steve and Levine, Jonathan|9780672318986\n2000|Apress|Professional ASP Data Access|James De Carli and Rama Ramachandran and Richard Anderson and Simon Robinson and Charles Fairchild and Joshua Parkin and Dino Esposito and Ulrich Schwanitz and Jason Hales|9781861003928\n2005|Jones & Bartlett Learning|Access 2003 Programming By Example With VBA, XML, And ASP|Korol, Julitta|9781556222238\n2009|Jones & Bartlett Learning|Excel 2007 VBA Programming with XML and ASP (Wordware Applications Library)|Korol, Julitta|9781598220438\n2004|Apress|Asp Web Development With Macromedia Dreamweaver Mx 2004 (expert's Voice Books For Professionals By Professionals)|Rachel Andrew|9781590593493\n2000|McGraw-Hill Osborne Media|Instant ASP Scripts|Buczek, Greg|9780072127300\n2007|Jones & Bartlett Learning|Access 2007 Programming By Example With VBA, XML, And ASP (Wordware Database Library)|Korol, Julitta|9781598220421\n2003|iUniverse, Inc.|Programming a REAL Internet Site with ASP and HTML: Book I: HTML and Basic ASP|Bosque, Marcelo|9780595271764\n1999|Apress|Enterprise Application Architecture with VB, ASP and MTS|Moniz, Joseph|9781861002587\n2005|Jones & Bartlett Learning|Excel 2003 VBA Programming With XML And ASP|Korol, Julitta|9781556222252\n20061206|Springer Nature|Foundation ASP for Dreamweaver 8|Rob Turnbull; Omar Elbaga|9781430201205\n||Programming Microsoft® Asp . Net 2. 0: Core Reference||9788178530949\n2001|iUniverse|Professional ASP Programming Guide for Office Web Component: With Office 2000 and Office XP|Zhang, Qimao|9780595198467\n2019-07-23T00:00:01Z|Mercury Learning & Information|Microsoft Access 2019 Programming by Example with VBA, XML, and ASP|Korol, Julitta|9781683924036\n2016-08-11T00:00:01Z|Mercury Learning & Information|Microsoft Access 2016 Programming By Example: with VBA, XML, and ASP|Korol, Julitta|9781942270843\n2016|Mercury Learning and Information|ACCESS 2016 PROGRAMMING BY EXAMPLE: with VBA, XML, and ASP|Korol, Julitta|9781944534509\n2016-07-06T00:00:01Z|Mercury Learning & Information|Microsoft Excel 2016 Programming by Example with VBA, XML, and ASP|Korol, Julitta|9781942270850\n2019-07-22T00:00:01Z|Mercury Learning & Information|Microsoft Excel 2019 Programming by Example with VBA, XML, and ASP|Korol, Julitta|9781683924005\n2016|Mercury Learning and Information|EXCEL 2016 Programming By Example: with VBA, XML, and ASP|Korol, Julitta|9781944534516\n2014-03-27T00:00:01Z|Mercury Learning & Information|Microsoft Access 2013 Programming by Example with VBA, XML, and ASP|Korol, Julitta|9781938549809\n2014-03-27T00:00:01Z|Mercury Learning & Information|Microsoft Excel 2013 Programming by Example with VBA, XML, and ASP (Computer Science)|Korol, Julitta|9781938549915\n2011|Mercury Learning & Information|Microsoft® Access® 2010 Programming By Example: with VBA, XML, and ASP|Korol, Julitta|9781936420025\n2011-08-05T00:00:01Z|Mercury Learning & Information|Microsoft® Excel® 2010 Programming By Example: with VBA, XML, and ASP|Korol, Julitta|9781936420032\n2002-07-15T00:00:01Z|Course Technology PTR|ASP Programming for the Absolute Beginner|Gosney, John W.|9781931841016\n2002|Wiley|ASP .NET Bible|Parihar, Mridula and Ahmed, Essam and Chandler, Jim and Hatfield, Bill and Lassan, Rick and MacIntyre, Peter and Wanta, Dave|9780764548161\n2000|Prentice Hall PTR|Essential ASP for Web Professionals (The Prentice Hall Essential Web Professional Series)|Lovejoy, Elijah|9780130304995\n2000|Wiley|ActivePerl with ASP and ADO|Martinsson, Tobias|9780471383147\n2003|Wordware Publishing, Inc.|Learn Microsoft Excel 2002: VBA Programming with XML and ASP|Korol, Julitta|9781556227615\n2000|Apress|Professional Windows DNA: Building Distributed Web Applications with VB, COM+, MSMQ, SOAP, and ASP|Blexrud, Chris and Short, Scott and Loesgen, Brian and Crossland, Jonathan and Esposito, Dino and Hales, Jason and Hankison, Whitney and Honnaya, Vishwanath and Huckaby, Tim and Kristich, Slava and Lee, Edward and Lhotka, Rockford and Mohr, Stephen and Robinson, Simon and Rofail, Ash and Sherrell, Brad and Wahlin, Dan|9781861004451\n2000|McGraw-Hill Osborne Media|Instant ASP Components (Book/CD-ROM package)|Buczek, Greg|9780072125528\n2002|Apress|XML Programming: Web Applications and Web Services With JSP and ASP|Alexander Nakhimovsky and Tom Myers|9781590590034\n2002-08-31T00:00:01Z|McGraw-Hill Education|Database Design and Programming With Access, Sql, Visual Basica and Asp|Carter, John|9780077099862\n1999|Addison-Wesley|Web Programming with ASP and COM|Crouch, Matt and Crouch, Matt J.|9780201604603\n2000|Muska & Lipman/Premier-Trade|ASP 3 Fast & Easy Web Development W/CD|Thomasson, Michael|9780761528548\n1999|Apress|Beginning Components for ASP|Anderson, Richard and Robinson, Simon and Anderson, Richard|9781861002884\n20000706|O'Reilly Media, Inc.|ASP in a Nutshell|Keyton Weissinger|9781449379599\n2008|Mike Young|Programming Dynamic Websites Using ASP|Young, Mike|9780955987717\n2000|McGraw-Hill Companies|ASP 3.0: A Beginner's Guide||9780072127416\n1999|Manning Publications|XML Programming with VB and ASP|Wilson, Mark and Wilson, Tracey|9781884777875\n1999|Apress|Professional Ado Rds Programming With Asp|Caison, Charles Crawford, Jr. and Debetta, Peter and Papa, John and Brown, Matt and Wilson, Eric|9781861001641\n|Bpb Publications|Learn Excel 2002 Vba Programming With Xml Asp||9788176567824\n2000|Apress|Professional ADO 2.5 Rds Programming with ASP 3.0|John Papa|9781861003249\n2001|Anaya Multimedia-Anaya Interactiva|ASP 3 Programacion en Vbscript para IIS 5.0/ ASP 3 Programming in Vbscript For IIS 5.0 (Guias Practicas/ Practical Guides) (Spanish Edition)|Gonzalez, Oscar|9788441511576\n2000|China Water Power Press|ASP programming Liang Jianwu Chen Yu Lin. China Water Power Press 9787508407272(Chinese Edition)|LIANG JIAN WU CHEN YU LIN|9787508407272\n||Asp Programming|Niit|9788120325159\n20000706|O'Reilly Media, Inc.|ASP in a Nutshell|Keyton Weissinger|9780596157289\n1999|Wrox Press Limited|Adsi Cdo Programming With Asp|Mikael Freidlitz; Todd Mondor|9781861001900\n2002|Prima Tech|Asp Programming For The Absolute Beginner|John Gosney|9780761536208\n20140922|Emereo|Asp 325 Success Secrets - 325 Most Asked Questions On Asp - What You Need To Know|Michelle Tran|9781488597725\n2003||Asp Made Simple. Made Simple Programming Series.|Sharon Deane|9780080522029\n2000|Tsinghua University|Asp And Xml Advanced Programming(chinese Edition)|Mark Baartse Richard Blair|9787302049340\n20090727|Cengage Learning US|ASP .NET Programming with C# & SQL Server|Don Gosselin|9781111782894\n2009|Jones & Bartlett Publishers|Excel 2007 Vba Programming With Xml And Asp|Julitta Korol|9780763782764\n20080101|Springer Nature|ASP Web Development with Macromedia Dreamweaver MX 2004|Rachel Andrew; Alan Foley; Rob Turnbull; Drew McLellan|9781430207221\n2001||Real World Web Code : Techniques For Structured Asp Programming|Pohlson Scott and Loba Scott|9780735710337\n2005|Wordware Pub.|Access 2003 Programming By Example With Vba, Xml, And Asp|Julitta Korol|\n2010|Jones & Bartlett Learning|Access 2007 Programming By Example With Vba, Xml, And Asp|Julitta Korol|9781449627263\n|Plano, Tex. : Wordware Pub., C2003.|Learn Microsoft Excel 2002 Vba Programming With Xml And Asp|Julitta Korol|9780585448312\n2007|Microsoft Press|Programming Microsoft Asp Net 2 0 Applications Advanced Topics In Russian|Espozito Dino|9785911801960\n2014|Stylus Publishing, Llc|Microsoft Excel 2013 Programming By Example With Vba, Xml, And Asp|Julitta Korol|9781938549458\n19960420|Pearson Technology Group|Sams Teach Yourself E-Commerce Programming with ASP in 21 Days|Stephen Walther; Steve Banick; Jonathan Levine|9780132714396\n2006|Equity Press|Asp .net 2.0 Website Programming Interview Questions: Microsoft .net Interview Questions, Answers, And Explanations|Itcookbook|9781933804514\n2003-01-01|Prentice Hall India|Microsoft® Asp .net Programming With Microsoft® Visual C#® .net-step By Step: Version 2003|Duthie|9788120324237", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Computing LPMLN using ASP and MLN solvers*|10.1017/S1471068417000400|33|3|Joohyung Lee and Samidh Talsania and Yi Wang|9006869772aa734c5c3c3ba0cffc05bec16880ff\n2016|ASP with Applications to Mazes and Levels|10.1007/978-3-319-42716-4_8|20|4|M. Nelson and Adam M. Smith|1c166b6fecb7d06372fb36aed2bb5c450ccad6dc\n2013|ASP with non-herbrand partial functions: a language and system for practical use|10.1017/S1471068413000343|18|4|M. Balduccini|1d3d7deb0389b058f278fbff65b6f6b0719170d4\n2017|plasp 3: Towards Effective ASP Planning|10.1017/S1471068418000583|14|4|Yannis Dimopoulos and M. Gebser and Patrick Lühne and J. Romero and Torsten Schaub|2d39cfb36a2f02d8a2bc63c703a49a492d572319\n2011|Answer Set Programming's Contributions to Classical Logic - An Analysis of ASP Methodology|10.1007/978-3-642-20832-4_2|8|1|M. Denecker and Joost Vennekens and H. Vlaeminck and Johan Wittocx and M. Bruynooghe|e4f26c54f2e8d8ea7d2e9b80cc68b157dbd91c42\n2019|An ASP Based Approach to Answering Questions for Natural Language Text|10.1007/978-3-030-05998-9_4|7|0|Dhruva Pendharkar and G. Gupta|1a3f6da60233d6d21b184df53bc19024b8f93052\n2013|An Application of ASP to the Field of Second Language Acquisition|10.1007/978-3-642-40564-8_39|4|0|Daniela Inclezan|bab9c0ee1b24dc464ad503e31d21a859e2c0c159" }, "aspectcpp": { "title": "AspectC++", "appeared": 2001, "type": "pl", "website": "http://aspectc.org/", "country": [ "Various countries in Western Europe" ], "originCommunity": [ "Various developers" ], "domainName": { "registered": 2001, "awisRank": { "2022": 6370014 }, "name": "aspectc.org" }, "rijuRepl": { "example": [ "#include \n\nint main() {\n std::cout << \"Hello, world!\" << std::endl;\n return 0;\n}\n" ], "id": "https://riju.codes/aspectcpp" }, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2002|Program instrumentation for debugging and monitoring with AspectC++|10.1109/ISORC.2002.1003713|78|1|D. Mahrenholz and O. Spinczyk and W. Schröder-Preikschat|dcf354c2d60a27ec0a6ffc6d9d93a0ad229b5298\n2004|Generic Advice: On the Combination of AOP with Generative Programming in AspectC++|10.1007/978-3-540-30175-2_4|60|3|D. Lohmann and Georg Blaschke and O. Spinczyk|126e4d5dc864133ecc2b5dbed60e91d4966cae16\n2006|Static and Dynamic Weaving in System Software with AspectC++|10.1109/HICSS.2006.437|23|1|W. Schröder-Preikschat and D. Lohmann and Fabian Scheler and W. Gilani and O. Spinczyk|2695674b89840eaabcf42ec3cdbcc241f3cf1c06\n2006|Developing embedded software product lines with AspectC++|10.1145/1176617.1176702|5|0|D. Lohmann and O. Spinczyk|4da6d1a30a3fbcf4ec5c19bf7c889ada7b05f2a0\n2012|A UML profile for AspectC++|10.1109/ICITES.2012.6216630|3|0|Mustapha Redouane Djabri and M. Amroune|95d4ea45d2685386e4db98ab754556c5815edef7" }, "aspectj": { "title": "AspectJ", "appeared": 2001, "type": "pl", "website": "http://www.eclipse.org/aspectj/", "fileExtensions": [ "aj" ], "country": [ "Canada" ], "originCommunity": [ "Eclipse Foundation" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "// 0[0-7_]+[lL]?", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F][0-9a-fA-F_]*[lL]?", "value": true }, "hasFloats": { "example": "// ([0-9][0-9_]*\\.([0-9][0-9_]*)?|\\.[0-9][0-9_]*)([eE][+\\-]?[0-9][0-9_]*)?[fFdD]?|[0-9][eE][+\\-]?[0-9][0-9_]*[fFdD]?|[0-9]([eE][+\\-]?[0-9][0-9_]*)?[fFdD]|0[xX]([0-9a-fA-F][0-9a-fA-F_]*\\.?|([0-9a-fA-F][0-9a-fA-F_]*)?\\.[0-9a-fA-F][0-9a-fA-F_]*)[pP][+\\-]?[0-9][0-9_]*[fFdD]?", "value": true }, "hasIntegers": { "example": "// 0|[1-9][0-9_]*[lL]?", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01][01_]*[lL]?", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "System.out.println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "pointcut set() : execution(* set*(..) ) && this(Point);" ], "related": [ "java", "eclipse-editor", "emacs-editor", "isbn" ], "summary": "AspectJ is an aspect-oriented programming (AOP) extension created at PARC for the Java programming language. It is available in Eclipse Foundation open-source projects, both stand-alone and integrated into Eclipse. AspectJ has become a widely used de facto standard for AOP by emphasizing simplicity and usability for end users. It uses Java-like syntax, and included IDE integrations for displaying crosscutting structure since its initial public release in 2001.", "pageId": 237214, "dailyPageViews": 88, "created": 2003, "backlinksCount": 100, "revisionCount": 172, "appeared": 2001, "fileExtensions": [ "aj" ], "url": "https://en.wikipedia.org/wiki/AspectJ" }, "githubLanguage": { "fileExtensions": [ "aj" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.aspectj", "repos": 671, "id": "AspectJ" }, "githubBigQuery": { "repos": 793, "users": 734, "id": "AspectJ" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/aspectj", "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "aj" ], "id": "AspectJ" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2017, "committerCount": 2, "commitCount": 21, "sampleCount": 2, "example": [ "package com.blogspot.miguelinlas3.aspectj.cache;\n\nimport java.util.Map;\nimport java.util.WeakHashMap;\n\nimport org.aspectj.lang.JoinPoint;\n\nimport com.blogspot.miguelinlas3.aspectj.cache.marker.Cacheable;\n\n/**\n * This simple aspect simulates the behaviour of a very simple cache\n * \n * @author migue\n *\n */\npublic aspect CacheAspect {\n\n\tpublic pointcut cache(Cacheable cacheable): execution(@Cacheable * * (..)) && @annotation(cacheable);\n\t\n\tObject around(Cacheable cacheable): cache(cacheable){\n\t\n\t\tString evaluatedKey = this.evaluateKey(cacheable.scriptKey(), thisJoinPoint);\n\t\t\n\t\tif(cache.containsKey(evaluatedKey)){\n\t\t\tSystem.out.println(\"Cache hit for key \" + evaluatedKey);\n\t\t\treturn this.cache.get(evaluatedKey);\n\t\t}\n\t\t\n\t\tSystem.out.println(\"Cache miss for key \" + evaluatedKey);\n\t\tObject value = proceed(cacheable);\n\t\tcache.put(evaluatedKey, value);\n\t\treturn value;\n\t}\n\t\n\tprotected String evaluateKey(String key, JoinPoint joinPoint) {\n\t\t// TODO add some smart staff to allow simple scripting in @Cacheable annotation\n\t\treturn key;\n\t}\n\t\n\tprotected Map cache = new WeakHashMap();\n}\n" ], "url": "https://github.com/pchaigno/sublime-aspectj" }, "leachim6": { "filepath": "a/Aspectj.aj", "fileExtensions": [ "aj" ], "example": [ "System.out.println(\"Hello World\");" ], "id": "Aspectj" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AspectJ", "quineRelay": "AspectJ", "rijuRepl": { "example": [ "public class Main {\n public static void main(String[] args) {\n System.out.println(\"Hello, world!\");\n }\n}\n" ], "id": "https://riju.codes/aspectj" }, "tiobe": { "id": "AspectJ" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7055", "ubuntuPackage": "aspectj", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nEclipse AspectJ: Aspect-Oriented Programming with AspectJ and the Eclipse AspectJ Development Tools|2004|Adrian Colyer|974936|3.25|8|0\nAspectj in Action: Practical Aspect-Oriented Programming|2003|Ramnivas Laddad|2052653|3.76|34|2\nAspect-Oriented Programming with Aspectj|2002|Ivan Kiselev|6484284|3.00|3|0\nMastering Aspectj: Aspect-Oriented Programming in Java|2003|Joseph D. Gradecki|1944006|3.20|5|1\nAspect-Oriented Programming with Aspectj|2002|Ivan Kiselev|41635597|0.0|0|0\nJava Programming Language Family: Godiva, Scala, Processing, Aspectj, Groovy, Javafx Script, Einstein, J Sharp, Judoscript, Jasmin, Beanshell|2011|Books LLC|15219374|0.0|0|0\nLogging and Simulation using Aspect Oriented Software: AOP and AspectJ||Mutum Meetei|54120798|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2005|O'Reilly Media|AspectJ Cookbook: Aspect Oriented Solutions to Real-World Problems|Miles, Russ|9780596006549\n2009|Manning Publications|AspectJ in Action: Enterprise AOP with Spring Applications|Ramnivas Laddad|9781933988054\n2004|Addison-Wesley Professional|Eclipse AspectJ: Aspect-Oriented Programming with AspectJ and the Eclipse AspectJ Development Tools|Colyer, Adrian|9780321245878\n2003|Manning Publications|Aspectj in Action: Practical Aspect-Oriented Programming|Laddad, Ramnivas|9781930110939\n20041220|O'Reilly Media, Inc.|AspectJ Cookbook|Russ Miles|9781449338411\n20041220|O'Reilly Media, Inc.|AspectJ Cookbook|Russ Miles|9781449338428\n20090831|Simon & Schuster|AspectJ in Action|Raminvas Laddad|9781638354086\n2003|Sams|Aspect-oriented Programming With Aspectj|Ivan Kiselev|9780672324109\n|Sams|Aspect-oriented programming using AspectJ|Ivan Kiselev|9780768662467\n2018-05-31|LAP LAMBERT Academic Publishing|Aspect-Oriented Programming with Eclipse AspectJ Development Tools|Pankaj Kumar|9786139848805", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2005|abc: an extensible AspectJ compiler|10.1145/1052898.1052906|235|16|Pavel Avgustinov and Aske Simon Christensen and L. Hendren and Sascha Kuzins and Jennifer Lhoták and O. Lhoták and O. Moor and D. Sereni and Ganesh Sittampalam and J. Tibble|3b08aa3b0bdbf04e686abfebc1b35a077dd1b2d6\n2002|A UML-based aspect-oriented design notation for AspectJ|10.1145/508386.508399|223|12|D. Stein and Stefan Hanenberg and R. Unland|f81f2c353e82df92fa84084e48876d1063c3e797\n2008|Racer: effective race detection using aspectj|10.1145/1390630.1390650|98|8|E. Bodden and K. Havelund|ad09cd720a5de53ddc995630d019bbee2d2ce72d\n2005|Aspect-oriented programming with AspectJ|10.1147/sj.442.0301|86|5|A. Colyer and Andy Clement|fe6e3b460c6de9b24957b480f6661808823c9b1c\n2006|From multi-modal scenarios to code: compiling LSCs into aspectJ|10.1145/1181775.1181802|81|2|S. Maoz and D. Harel|ab75f597e895a52c7be4be2351b66446a245022e\n2003|Pipa: A Behavioral Interface Specification Language for AspectJ|10.1007/3-540-36578-8_11|76|5|Jianjun Zhao and M. Rinard|36150e05a0b891d257cfa5ff192ea82375779400\n2004|Generating AspectJ Programs with Meta-AspectJ|10.1007/978-3-540-30175-2_1|67|8|David Zook and Shan Shan Huang and Y. Smaragdakis|633d837993e813f23aa93fb2aa29ca95b9c6d7fa\n2005|Using AspectJ to build a software product line for mobile devices|10.14288/1.0051632|64|9|Trevor J. Young|ab3777108d66be3baef50eceeb153bdd06a487d8\n2007|Bridging Java and AspectJ through explicit join points|10.1145/1294325.1294335|54|5|Kevin J. Hoffman and P. Eugster|266a6af42ce0277ba6182a43709820fdfa3fd7c9\n2006|Declarative, formal, and extensible syntax definition for aspectJ|10.1145/1167473.1167491|49|5|Martin Bravenboer and É. Tanter and E. Visser|2a7b1bfeddf2dfa96b44443752f217760575a84c\n2008|Automated Generation of Pointcut Mutants for Testing Pointcuts in AspectJ Programs|10.1109/ISSRE.2008.58|41|7|P. Anbalagan and Tao Xie|dbf5430d23c8586eeac347fbdc19bbac763ba31c\n2007|Semantics of static pointcuts in aspectJ|10.1145/1190216.1190221|40|6|Pavel Avgustinov and Elnar Hajiyev and Neil Ongkingco and O. Moor and D. Sereni and J. Tibble and M. Verbaere|3226f7ce9359d37efc592c34e96a5e42cf3fd483\n2003|Aspects and polymorphism in AspectJ|10.1145/643603.643619|36|1|Erik Ernst and D. Lorenz|30eb6b208747be2da42b571a66bb074f28354241\n2007|SCoPE: an AspectJ compiler for supporting user-defined analysis-based pointcuts|10.1145/1218563.1218582|36|3|Tomoyuki Aotani and Hidehiko Masuhara|c739bd026a9cce9c0b8aee7314ab8bda4f9397b1\n2006|Applyinq AspectJ to J2EE application development|10.1109/MS.2006.1|26|0|Nicholas Lesiecki|a7c1c10921ab37c06d2f91c853c08eeb17adb97a\n2006|APTE: automated pointcut testing for AspectJ programs|10.1145/1146374.1146379|26|2|P. Anbalagan and Tao Xie|384678644e110223a089ab3aa9116266903dbb62\n2011|A Compiler for Multimodal Scenarios: Transforming LSCs into AspectJ|10.1145/2000799.2000804|19|2|S. Maoz and D. Harel and A. Kleinbort|e002f7757db323c5402827ac9906b50d03e19fb6\n2018|An empirical study on the impact of AspectJ on software evolvability|10.1007/s10664-017-9580-7|17|1|Adam Przybyłek|56f08b65a1c3fd04caa27c951b7b634f672cf241\n2006|Security crosscutting concerns and AspectJ|10.1145/1501434.1501488|16|0|Dima Alhadidi and Nadia Belblidia and M. Debbabi|b93f1c3f93b22e53cd9e54b1c6799d7ec65119d6\n2009|Region pointcut for AspectJ|10.1145/1509276.1509287|13|1|Shumpei Akai and S. Chiba and Muga Nishizawa|92927f6909e66bfc681376e7598ca41105ab03d3\n2001|AspectJ Paradigm Model: A Basis for Multi-paradigm Design for AspectJ|10.1007/3-540-44800-4_5|12|1|V. Vranic|b5b884c6578e9d6711393da502b2eda05d05f855\n2006|Formalizing AspectJ Weaving for Static Pointcuts|10.1109/SEFM.2006.19|10|2|Nadia Belblidia and M. Debbabi|7328f6f8de8829350a78a97748ff41f169b1e5fd\n2001|Case study: a distributed concurrent system with AspectJ|10.1145/512000.512004|9|0|R. Raje and Ming Zhong and Tong-yang Wang|6331bf3ad179c88136a4d713de8c819afbc1e9d2\n2005|Complex code querying and navigation for AspectJ|10.1145/1117696.1117709|8|0|J. Pfeiffer and Andonis Sardos and J. Gurd|55571587a2d64d6fedbf4846081c7eedde0c8e16\n2005|Traits Programming with AspectJ|10.3166/objet.11.3.69-86|8|1|S. Denier|3758faced50e19baae3042e86c9f4667081a298b\n2005|Teste de programas orientados a aspectos: uma abordagem estrutural para AspectJ|10.11606/D.55.2005.TDE-13042005-111234|7|2|O. Lemos|8919c2f85e6d9076b315466f314b6bef1a043e30\n2010|An Advice for Advice Composition in AspectJ|10.1007/978-3-642-14046-4_9|7|1|Fuminobu Takeyama and S. Chiba|01528533d03b11fb09a9043d4e6a2443fea31804\n2011|2D and 3D visualization of AspectJ programs|10.1109/ISPS.2011.5898888|6|0|S. Bentrad and D. Meslati|5ce3a0dc903cad7cd435f59ae1beef9adf10545d\n2005|abc the aspectBench compiler for aspectJ a workbench for aspect-oriented programming language and compilers research|10.1145/1094855.1094877|6|0|Chris Allan and Pavel Avgustinov and Aske Simon Christensen and Bruno Dufour and C. Goard and L. Hendren and Sascha Kuzins and Jennifer Lhoták and O. Lhoták and O. Moor and D. Sereni and Ganesh Sittampalam and J. Tibble and Clark Verbrugge|e9c75ec43e213b983f7979ed44be5434b145c235\n2009|On ASPECTJ and Composition Filters: A Mapping of Concepts|10.15388/INFORMATICA.2009.266|5|0|D. Meslati|b23fd11b73b6d0e2f163cf80a003d88da68ec3c9\n2011|Accessing and Evaluating AspectJ based Mutation Testing Tools|10.5120/3791-5220|5|0|Mayank Singh and Shailendra Mishra and R. Mall|18995a17b168c0a7020820261dda4b08591b67a8\n2005|A Case Study of Development of a Java Bytecode Analyzer Framework Using AspectJ|10.2197/IPSJDC.1.104|3|0|Susumu Yamazaki and Michihiro Matsumoto and T. Nakanishi and T. Kitasuka and Akira Fukuda|3515ccc40a107af0784bd8d854ae80cdf6fbd56b\n2008|Overcoming comprehension barriers in the AspectJ programming language|10.5381/jot.2008.7.6.a4|3|1|Venera Arnaoudova and L. Eshkevari and Elaheh Safari-Sharifabadi and Constantinos A. Constantinides|a46f13879344a8a5cc5aa67a8e6dce0f5aba3c87\n2006|Automated testing of pointcuts in AspectJ programs|10.1145/1176617.1176711|2|0|P. Anbalagan|ac9f4a883dabe2ea944facc2356d9ddc4a9d2a10\n2011|Comparative Analysis of Java and AspectJ on the Basis of Various Metrics|10.1109/ICIS.2011.50|2|0|Inderjit Singh Dhanoa and Er. Dalwinder Singh Salaria and H. S. Johal|1009e19133e91087b39f2cd4faa27e3ea5941f7f\n2008|New AspectJ Pointcuts for Integer Overflow and Underflow Detection|10.1080/19393550802492479|1|0|Dima Alhadidi and M. Debbabi and P. Bhattacharya|96be1a745232f172b0ce307e7f00ca4e7f3a50d5\n2011|Tackling the Challenges of Integrating 3rd Party Software Using AspectJ|10.1007/978-3-642-22031-9_4|1|0|U. Hohenstein and M. Jäger|c85660cb51317005395a8463e9c309919614b4df" }, "aspen": { "title": "ASPEN", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d255ba8420cac03b439d866d0893639836837bdf" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois" ], "hopl": "https://hopl.info/showlanguage.prx?exp=749", "centralPackageRepositoryCount": 0 }, "aspol": { "title": "ASPOL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c9c2b7e181f63216162aa030f3c20eba555dc76e" ], "country": [ "United States" ], "originCommunity": [ "Apple Computer" ], "hopl": "https://hopl.info/showlanguage.prx?exp=668", "centralPackageRepositoryCount": 0, "isbndb": "" }, "assembly-language": { "title": "Assembly language", "appeared": 1960, "type": "assembly", "documentation": [ "https://docs.oracle.com/cd/E19253-01/817-5477/817-5477.pdf" ], "aka": [ "assembly" ], "wikipedia": { "example": [ "include \\masm32\\include\\masm32rt.inc\t; use the Masm32 library\n\n.code\ndemomain:\n REPEAT 20\n\tswitch rv(nrandom, 9)\t; generate a number between 0 and 8\n\tmov ecx, 7\n\tcase 0\n\t\tprint \"case 0\"\n\tcase ecx\t\t\t\t; in contrast to most other programming languages,\n\t\tprint \"case 7\"\t\t; the Masm32 switch allows \"variable cases\"\n\tcase 1 .. 3\n\t\t.if eax==1\n\t\t\tprint \"case 1\"\n\t\t.elseif eax==2\n\t\t\tprint \"case 2\"\n\t\t.else\n\t\t\tprint \"cases 1 to 3: other\"\n\t\t.endif\n\tcase 4, 6, 8\n\t\tprint \"cases 4, 6 or 8\"\n\tdefault\n\t\tmov ebx, 19\t\t ; print 20 stars\n\t\t.Repeat\n\t\t\tprint \"*\"\n\t\t\tdec ebx\n\t\t.Until Sign?\t\t ; loop until the sign flag is set\n\tendsw\n\tprint chr$(13, 10)\n ENDM\n exit\nend demomain" ], "related": [ "x86-isa", "fortran", "algol", "lisp", "gas", "x86-assembly", "punched-tape", "ia-32", "autocoder", "pl-i", "cobol", "c", "unix", "espol", "turbo-pascal", "visual-basic", "pascal", "hla", "wasm" ], "summary": "An assembly (or assembler) language, often abbreviated asm, is any low-level programming language in which there is a very strong correspondence between the program's statements and the architecture's machine code instructions.Each assembly language is specific to a particular computer architecture and operating system. In contrast, most high-level programming languages are generally portable across multiple architectures but require interpreting or compiling. Assembly language may also be called symbolic machine code.Assembly language usually has one statement per machine instruction, but assembler directives, macros and symbolic labels of program and memory locations are often also supported. Assembly code is converted into executable machine code by a utility program referred to as an assembler. The conversion process is referred to as assembly, or assembling the source code.", "created": 2001, "backlinksCount": 3074, "pageId": 1368, "revisionCount": 2431, "dailyPageViews": 2352, "appeared": 1949, "url": "https://en.wikipedia.org/wiki/Assembly_language" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "asm", "a51", "i", "inc", "nas", "nasm" ], "aceMode": "assembly_x86", "tmScope": "source.assembly", "aliases": [ "asm", "nasm" ], "repos": 109158, "id": "Assembly" }, "githubBigQuery": { "repos": 47629, "users": 33301, "id": "Assembly" }, "projectEuler": { "memberCount": { "2022": 223 }, "id": "Assembly" }, "compilerExplorer": { "example": [ "infiniteLoop:\n jmp main\nmain:\n jmp infiniteLoop\n" ], "id": "Assembly" }, "indeedJobs": { "2022": 1329, "query": "assembly language developer" }, "stackOverflowSurvey": { "2021": { "users": 4632, "medianSalary": 55211, "fans": 3578, "percentageUsing": 0.06 } }, "subreddit": [ { "memberCount": { "2022": 14763 }, "url": "https://reddit.com/r/asm" } ], "tiobe": { "currentRank": 8, "id": "assembly-language" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "assemblyscript": { "title": "AssemblyScript", "appeared": 2017, "type": "pl", "website": "https://assemblyscript.org", "country": [ "Ukraine and Germany" ], "originCommunity": [ "The AssemblyScript Project" ], "domainName": { "registered": 2017, "awisRank": { "2022": 603117 }, "name": "assemblyscript.org" }, "influencedBy": [ "typescript" ], "example": [ "/** Calculates the n-th Fibonacci number. */\nexport function fib(n: i32): i32 {\n var a = 0, b = 1\n if (n > 0) {\n while (--n) {\n let t = a + b\n a = b\n b = t\n }\n return b\n }\n return a\n}" ], "githubRepo": { "firstCommit": 2017, "stars": 14159, "forks": 603, "subscribers": 192, "created": 2017, "updated": 2022, "description": "A TypeScript-like language for WebAssembly.", "issues": 200, "url": "https://github.com/AssemblyScript/assemblyscript" }, "repoStats": { "firstCommit": 2017, "commits": 2162, "committers": 75, "files": 1192 }, "twitter": "https://twitter.com/assemblyscript" }, "associons": { "title": "associons", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/df0d35d506cc25700b255481ce5e63fe2182931b" ], "country": [ "The Netherlands" ], "originCommunity": [ "Eindhoven University of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6032", "centralPackageRepositoryCount": 0 }, "asspegique": { "title": "Asspegique", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c0be8b78e5bdd8934496b32f68fa7985457de712" ], "country": [ "France" ], "originCommunity": [ "University of Paris" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6979", "centralPackageRepositoryCount": 0 }, "astatine": { "title": "Astatine", "appeared": 2022, "type": "pl", "creators": [ "Spydr06" ], "website": "https://github.com/Spydr06/astatine/", "country": [ "Germany" ], "originCommunity": [ "https://github.com/Spydr06" ], "example": [ "module Main where\nimport * from IO\n-- prints 'Hello, World' to stdout\nmain :: (args [String]) -> Int32\n = do\n IO::puts(\"Hello, World\")\n 0\n end" ], "githubRepo": { "stars": 2, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "description": "Astatine is a is a mid-level, statically typed, procedural programming language with some functional components.", "url": "https://github.com/Spydr06/astatine/" }, "repoStats": { "firstCommit": 2022, "commits": 13, "committers": 2, "files": 53 } }, "asterisk": { "title": "Asterisk", "appeared": 1999, "type": "application", "website": "https://wiki.asterisk.org/wiki/display/AST/Dialplan", "country": [ "United States" ], "originCommunity": [ "Sangoma Technologies Corporation" ], "wikipedia": { "related": [ "c", "linux", "freebsd", "solaris" ], "summary": "Asterisk is a software implementation of a telephone private branch exchange (PBX); it allows attached telephones to make calls to one another, and to connect to other telephone services, such as the public switched telephone network (PSTN) and Voice over Internet Protocol (VoIP) services. Its name comes from the asterisk symbol \"*\". Asterisk is released with a dual license model, using the GNU General Public License (GPL) as a free software license and a proprietary software license to permit licensees to distribute proprietary, unpublished system components. Asterisk was created in 1999 by Mark Spencer of Digium. Originally designed for Linux, Asterisk runs on a variety of operating systems, including NetBSD, OpenBSD, FreeBSD, macOS, and Solaris, and can be installed in embedded systems based on OpenWrt and on flash drives.", "pageId": 946004, "dailyPageViews": 287, "created": 2004, "backlinksCount": 160, "revisionCount": 1053, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Asterisk_(PBX)" }, "codeMirror": "asterisk", "helloWorldCollection": [ ";; Hello world in Asterisk\n\nexten => s,1,NoOp(Hello World)" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "asterius-compiler": { "title": "asterius-compiler", "appeared": 2017, "type": "compiler", "creators": [ "Shao Cheng" ], "country": [ "France and United Kingdom and Cyprus" ], "originCommunity": [ "Tweag I/O" ], "githubRepo": { "firstCommit": 2017, "stars": 1917, "forks": 61, "subscribers": 76, "created": 2017, "updated": 2022, "description": "A Haskell to WebAssembly compiler", "issues": 134, "url": "https://github.com/tweag/asterius" } }, "astlog": { "title": "ASTLOG", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/29d4fbb4fe3e22bf20a82e1e7144df036a74c62a" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3737", "centralPackageRepositoryCount": 0 }, "astro": { "title": "astro", "appeared": 2016, "type": "pl", "website": "http://www.nairaland.com/3557200/astro-programming-language-0.2-indefinite", "country": [ "Nigeria" ], "githubRepo": { "stars": 649, "forks": 33, "subscribers": 43, "created": 2017, "updated": 2022, "firstCommit": 2017, "description": "A fun safe language for rapid prototyping and high performance applications", "issues": 7, "url": "https://github.com/AppCypher/Astro" }, "repoStats": { "firstCommit": 2017, "commits": 1462, "committers": 10, "files": 41 }, "githubLanguage": { "type": "markup", "fileExtensions": [ "astro" ], "aceMode": "html", "codemirrorMode": "jsx", "codemirrorMimeType": "text/jsx", "tmScope": "source.astro", "repos": 4515, "id": "Astro" }, "githubBigQuery": { "repos": 4, "users": 4, "id": "Astro" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Astro", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "astroml": { "title": "astroml", "appeared": 2012, "type": "library", "creators": [ "Jacob Vanderplas" ], "website": "http://www.astroml.org/", "country": [ "United States" ], "originCommunity": [ "Google" ], "domainName": { "registered": 2013, "awisRank": { "2022": 1299900 }, "name": "astroml.org" }, "githubRepo": { "stars": 833, "forks": 283, "subscribers": 93, "created": 2012, "updated": 2022, "firstCommit": 2012, "description": "Machine learning, statistics, and data mining for astronomy and astrophysics", "issues": 63, "url": "https://github.com/astroML/astroML" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "asymptote": { "title": "Asymptote", "appeared": 2004, "type": "application", "creators": [ "Andy Hammerlindl", "John C. Bowman", "Tom Prince" ], "country": [ "Canada" ], "originCommunity": [ "University of Alberta" ], "hasComments": { "example": "", "value": true }, "wikipedia": { "example": [ "import graph;\nimport settings;\noutformat=\"pdf\";\n\nsize(300,300);\n\n// Function.\nreal[] x1 = {-1.5,0};\nreal[] y1 = {0,0};\nreal[] x2 = {0,1.5};\nreal[] y2 = {1,1};\ndraw(graph(x1,y1),red+2);\ndraw(graph(x2,y2),red+2);\n\ndraw((0,0)--(0,1),red+1.5+linetype(\"4 4\"));\nfill( circle((0,1),0.035), red);\nfilldraw( circle((0,0),0.03), white, red+1.5);\n\n// Axes.\nxaxis( Label(\"$x$\"), Ticks(new real[]{-1,-0.5,0.5,1}), Arrow);\nyaxis( Label(\"$y$\"), Ticks(new real[]{0.5,1}), Arrow, ymin=-0.18, ymax=1.25);\n// Origin.\nlabelx(\"$O$\",0,SW);" ], "related": [ "unix", "latex", "postscript", "pdf", "svg", "tex", "python" ], "summary": "Asymptote is a descriptive vector graphics language — developed by Andy Hammerlindl, John C. Bowman (University of Alberta), and Tom Prince — which provides a natural coordinate-based framework for technical drawing. Asymptote runs on all major platforms (Unix, Mac OS, Microsoft Windows). It is free software, available under the terms of the GNU Lesser General Public License (LGPL).", "pageId": 3469522, "dailyPageViews": 37, "created": 2005, "backlinksCount": 54, "revisionCount": 136, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Asymptote_(vector_graphics_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "asy" ], "interpreters": [ "asy" ], "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-kotlin", "tmScope": "source.c++", "id": "Asymptote" }, "githubBigQuery": { "repos": 25, "users": 23, "id": "Asymptote" }, "pygmentsHighlighter": { "filename": "graphics.py", "fileExtensions": [ "asy" ], "id": "Asymptote" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Asymptote", "rijuRepl": { "example": [ "write(\"Hello, world!\");\n" ], "id": "https://riju.codes/asymptote" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAsymptote (Vector Graphics Language)|2012|Jesse Russell|22967337|0.0|0|0\nAsymptote: The Vector Graphics Language|2014|Andy Hammerlindl|41384552|0.0|0|0" }, "atari-basic": { "title": "Atari BASIC", "appeared": 1983, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Shepardson Microsystems" ], "wikipedia": { "example": [ "10 REM Opens the cassette device on channel 1 for reading in BASIC\n20 OPEN #1,4,0,\"C:MYPROG.DAT\"" ], "related": [ "atari-microsoft-basic", "atari-st-basic", "basic-programming", "microsoft-basic", "basic", "applesoft-basic", "basic-plus", "hp-time-shared-basic", "optimized-systems-software", "turbo-basic-xl" ], "summary": "Atari BASIC is an interpreter for the BASIC programming language that shipped with the Atari 8-bit family of 6502-based home computers. Unlike most 8-bit BASICs, Atari BASIC is not a derivative of Microsoft BASIC, and differs in significant ways. It includes keywords for Atari-specific features and lacks support for string arrays, for example. The language was originally an 8 KB ROM cartridge for the first machines in the 8-bit series, the 400, 800 and 1200XL. Starting with the 600XL and 800XL, BASIC was built-in to the machines, but can be disabled by holding down the OPTION key while booting. The XEGS disables BASIC if powered without the keyboard attached. The complete annotated source code and design specifications of Atari BASIC were published as The Atari BASIC Source Book in 1983.", "created": 2002, "backlinksCount": 147, "pageId": 147581, "revisionCount": 723, "dailyPageViews": 54, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/Atari_BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "atari-microsoft-basic": { "title": "Atari Microsoft BASIC", "appeared": 1981, "type": "pl", "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "atari-basic", "microsoft-basic", "turbo-basic-xl", "optimized-systems-software" ], "summary": "The Atari Microsoft BASIC and Atari Microsoft BASIC II variants of the BASIC programming language were ROM cartridge or floppy disk packaged versions of the Microsoft BASIC dialect ported to the Atari 8-bit machines. Atari originally licensed Microsoft BASIC for use in their 8-bit computers, but were unable to fit it in an 8 KB ROM cartridge, the largest cartridge size available at the time. They outsourced to another company, Shepardson Microsystems Inc. (SMI), who had similar problems fitting the language onto an 8k cartridge. SMI proposed creating an entirely new version of BASIC for the new platforms, and built Atari BASIC instead. Atari Microsoft BASIC, unlike Atari BASIC, didn't allow abbreviations for keywords; keywords had to be fully spelled out. Syntax checking occurred after running a program, not immediately after entering the line. Also, arithmetic operations with integers resulted in an integer result. Atari Microsoft BASIC came in two packages: Floppy disk – CX8126 ROM cartridge – RX8035. Since the cartridge could only hold 16 KB, the remaining 11 KB file was included on an \"extension\" disk. The cartridge version was called Atari Microsoft BASIC II.Although more feature filled than Atari BASIC, Microsoft BASIC never had the popularity that Atari BASIC had. The biggest problems were: increased memory needed (at least 32 KB) disk drive required performance (faster than Atari BASIC, but slower than Turbo-Basic XL and BASIC XL) not compatible with Atari BASIC added costThe cartridge version eliminated the first two requirements, but a disk drive was needed for all of its features.", "created": 2004, "backlinksCount": 84, "pageId": 555301, "revisionCount": 69, "dailyPageViews": 10, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/Atari_Microsoft_BASIC" }, "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "" }, "atari-st-basic": { "title": "Atari ST BASIC", "appeared": 1985, "type": "pl", "country": [ "England" ], "originCommunity": [ "MetaComCo" ], "wikipedia": { "example": [ "function not yet done\nSystem error #%N, please restart" ], "related": [ "metacomco", "basic", "amigabasic", "gfa-basic", "stos-basic", "isbn" ], "summary": "Atari ST BASIC (or ST Basic) was the first dialect of BASIC that was produced for the Atari ST line of computers. It was bundled with all new STs in the early years of the ST's lifespan, and quickly became the standard BASIC for that platform. However, many users disliked it, and improved dialects of BASIC quickly came out to replace it.", "created": 2005, "backlinksCount": 88, "pageId": 1931968, "revisionCount": 56, "dailyPageViews": 9, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Atari_ST_BASIC" }, "centralPackageRepositoryCount": 0 }, "atlas-autocode": { "title": "Atlas Autocode", "appeared": 1965, "type": "pl", "country": [ "England" ], "originCommunity": [ "University of Manchester" ], "wikipedia": { "related": [ "algol", "edinburgh-imp", "compiler-compiler", "autocode" ], "summary": "Atlas Autocode (AA) was a programming language developed around 1965 at Manchester University. A variant of the ALGOL programming language, it was developed by Tony Brooker and Derrick Morris for the Atlas Computer. (\"Autocode\" was basically an early term for \"programming language\"; different autocodes could be totally different).", "created": 2002, "backlinksCount": 26, "pageId": 2726, "revisionCount": 85, "dailyPageViews": 11, "appeared": 1965, "url": "https://en.wikipedia.org/wiki/Atlas_Autocode" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1840", "centralPackageRepositoryCount": 0, "isbndb": "" }, "atlas": { "title": "ATLAS Transformation Language", "appeared": 2005, "type": "pl", "website": "https://www.eclipse.org/atl/", "fileExtensions": [ "atl" ], "country": [ "Canada" ], "originCommunity": [ "Eclipse Foundation" ], "example": [ "rule TreeNodeRoot2RootElement {\n from\n rt : MMTree!Node (rt.isTreeNodeRoot()) \n to\n lstRt : MMElementList!RootElement (\n name <- rt.name,\n elements <- elmLst\n ),\n elmLst : distinct MMElementList!CommonElement foreach(leaf in rt.getAllChildren())(\n name <- leaf.name\n )\n}" ], "wikipedia": { "summary": "ATL (ATLAS Transformation Language) is a model transformation language and toolkit developed and maintained by OBEO and AtlanMod. It was initiated by the AtlanMod team (previously called ATLAS Group). In the field of Model-Driven Engineering (MDE), ATL provides ways to produce a set of target models from a set of source models. Released under the terms of the Eclipse Public License, ATL is an M2M (Eclipse) component, inside of the Eclipse Modeling Project (EMP).", "backlinksCount": 55, "pageId": 4671634, "dailyPageViews": 23, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/ATLAS_Transformation_Language" } }, "atmel-avr": { "title": "Atmel AVR", "appeared": 1996, "type": "pl", "country": [ "Norway" ], "originCommunity": [ "Norwegian Institute of Technology" ], "wikipedia": { "related": [ "arduino", "arm", "avr", "c", "pic-microcontroller", "linux", "freebsd", "assembly-language", "vhdl", "verilog" ], "summary": "AVR is a family of microcontrollers developed since 1996 by Atmel, acquired by Microchip Technology in 2016. These are modified Harvard architecture 8-bit RISC single-chip microcontrollers. AVR was one of the first microcontroller families to use on-chip flash memory for program storage, as opposed to one-time programmable ROM, EPROM, or EEPROM used by other microcontrollers at the time. AVR microcontrollers find many applications as embedded systems. They are especially common in hobbyist and educational embedded applications, popularized by their inclusion in many of the Arduino line of open hardware development boards.", "created": 2018, "backlinksCount": 156, "pageId": 100290, "revisionCount": 1, "dailyPageViews": 151, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Atmel_AVR" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "atol": { "title": "ATOL", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1c8f60b3a523bf37cd14ae9d5b61f7ad505f30fb" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Birmingham" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4088", "centralPackageRepositoryCount": 0 }, "atom-editor": { "title": "Atom", "appeared": 2014, "type": "editor", "country": [ "United States" ], "originCommunity": [ "GitHub" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Atom_(text_editor)" } }, "atom": { "title": "Atom", "appeared": 2007, "type": "pl", "creators": [ "Thomas Hawkins" ], "wikipedia": { "related": [ "haskell", "bluespec", "verilog" ], "summary": "Atom is a domain-specific language (DSL) in Haskell, for designing real-time embedded software.", "backlinksCount": 9, "pageId": 25291178, "created": 2009, "revisionCount": 49, "dailyPageViews": 12, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Atom_(programming_language)" }, "fileType": "text", "wordRank": 2431, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "atomese": { "title": "Atomese", "appeared": 2007, "type": "pl", "description": "Atomese was originally intended to be a language for knowledge representation (KR): that is, a way of encoding facts and hypothesis, in a machine-readable way, such that the knowledge can be manipulated, data-mined, reasoned with. This language subset was vaguely inspired by Prolog and Datalog. More correctly, it was constructed by layering concepts from mathematical logic onto a graph database: representing logical, symbolic statements as graphs.", "website": "https://wiki.opencog.org/w/Atomese", "reference": [ "https://arxiv.org/pdf/2004.05267.pdf", "https://opencog.org/" ], "country": [ "Various" ], "originCommunity": [ "OpenCog Foundation" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "(define find-animals\n (BindLink\n ;; The variable to be bound\n (VariableNode \"$var\")\n ;; The pattern to be searched for\n (InheritanceLink\n (VariableNode \"$var\")\n (ConceptNode \"animal\")\n )\n ;; The value to be returned.\n (VariableNode \"$var\")\n )\n)\n \n;; Run the above pattern\n(cog-bind find-animals)" ], "semanticScholar": "" }, "atomo": { "title": "atomo", "appeared": 2010, "type": "pl", "website": "http://atomo-lang.org", "domainName": { "registered": 2022, "name": "atomo-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n1901268|Atomo, the programmer's programmable programming language|http://atomo-lang.org/|2010-11-13 18:10:31 UTC|1289671831|steveklabnik|34|162" }, "atomos": { "title": "Atomos", "appeared": 2006, "type": "pl", "description": "Atomos is the first programming language with implicit transactions, strong atomicity, and a scalable multiprocessor implementation. Atomos is derived from Java, but replaces its synchronization and conditional waiting constructs with simpler transactional alternatives.", "reference": [ "https://www.semanticscholar.org/paper/The-Atomos-transactional-programming-language-Carlstrom-McDonald/24fb613bf421ae2bbb32a9df08e3b9d2508d5ca0" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "atomspace": { "title": "atomspace", "appeared": 2008, "type": "application", "website": "https://wiki.opencog.org/w/AtomSpace", "country": [ "Various" ], "originCommunity": [ "OpenCog Foundation" ], "githubRepo": { "firstCommit": 2008, "stars": 617, "forks": 220, "subscribers": 88, "created": 2015, "updated": 2022, "description": "The OpenCog (hyper-)graph database and graph rewriting system", "issues": 89, "url": "https://github.com/opencog/atomspace" } }, "ats": { "title": "ATS", "appeared": 2013, "type": "pl", "creators": [ "Hongwei Xi" ], "website": "http://www.ats-lang.org/", "standsFor": "Applied Type System", "aka": [ "ATS/Postiats", "Postiats" ], "country": [ "United States" ], "originCommunity": [ "Boston University" ], "domainName": { "registered": 2007, "awisRank": { "2022": 5478886 }, "name": "ats-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "(*", "*)" ] ], "keywords": [ "abstype", "abst0ype", "absprop", "absview", "absvtype", "absviewtype", "absvt0ype", "absviewt0ype", "as", "and", "assume", "begin", "classdec", "datasort", "datatype", "dataprop", "dataview", "datavtype", "dataviewtype", "do", "end", "extern", "extype", "extvar", "exception", "fn", "fnx", "fun", "prfn", "prfun", "praxi", "castfn", "if", "then", "else", "ifcase", "in", "infix", "infixl", "infixr", "prefix", "postfix", "implmnt", "implement", "primplmnt", "primplement", "import", "let", "local", "macdef", "macrodef", "nonfix", "symelim", "symintr", "overload", "of", "op", "rec", "sif", "scase", "sortdef", "sta", "stacst", "stadef", "static", "staload", "dynload", "try", "tkindef", "typedef", "propdef", "viewdef", "vtypedef", "viewtypedef", "prval", "var", "prvar", "when", "where", "with", "withtype", "withprop", "withview", "withvtype", "withviewtype" ], "wikipedia": { "example": [ "#define BUFLEN 10\nvar !p_buf with pf_buf = @[byte][BUFLEN](0) // pf_buf = @[byte][BUFLEN](0) @ p_buf[14]" ], "related": [ "dependent-ml", "ml", "ocaml", "c" ], "summary": "ATS (Applied Type System) is a programming language designed to unify programming with formal specification. ATS has support for combining theorem proving with practical programming through the use of advanced type systems. A past version of The Computer Language Benchmarks Game has demonstrated that the performance of ATS is comparable to that of the C and C++ programming languages. By using theorem proving and strict type checking, the compiler can detect and prove that its implemented functions are not susceptible to bugs such as division by zero, memory leaks, buffer overflow, and other forms of memory corruption by verifying pointer arithmetic and reference counting before the program compiles. Additionally, by using the integrated theorem-proving system of ATS (ATS/LF), the programmer may make use of static constructs that are intertwined with the operative code to prove that a function attains its specification.", "pageId": 19905196, "dailyPageViews": 71, "created": 2008, "backlinksCount": 20, "revisionCount": 295, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/ATS_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "dats", "hats", "sats" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "ocaml", "tmScope": "source.ats", "aliases": [ "ats2" ], "repos": 217, "id": "ATS" }, "githubBigQuery": { "repos": 46, "users": 26, "id": "ATS" }, "monaco": "postiats", "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2016, "committerCount": 7, "commitCount": 46, "sampleCount": 9, "example": [ "(* ****** ****** *)\n//\n// HX-2013-11\n//\n// Implementing a variant of\n// the problem of Dining Philosophers\n//\n(* ****** ****** *)\n//\n#include \"share/atspre_define.hats\"\n#include \"share/atspre_staload.hats\"\n//\n(* ****** ****** *)\n\nstaload \"{$LIBATSHWXI}/teaching/mythread/SATS/mythread.sats\"\n\n(* ****** ****** *)\n\nlocal\n//\n#include \"{$LIBATSHWXI}/teaching/mythread/DATS/mythread.dats\"\n//\nin (* in of [local] *)\n//\n// HX: it is intentionally left to be empty\n//\nend // end of [local]\n\n(* ****** ****** *)\n\nlocal\n//\n#include \"{$LIBATSHWXI}/teaching/mythread/DATS/mythread_posix.dats\"\n//\nin (* in of [local] *)\n//\n// HX: it is intentionally left to be empty\n//\nend // end of [local]\n\n(* ****** ****** *)\n\n(* end of [DiningPhil2_thread.dats] *)\n" ], "url": "https://github.com/steinwaywhw/ats-mode-sublimetext" }, "helloWorldCollection": [ "// Hello world in ATS\n\nimplement main () = begin\n print (\"Hello, world!\"); print_newline ()\nend" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:ATS", "rijuRepl": { "example": [ "val _ = print (\"Hello, world!\\n\")\nimplement main0 () = ()\n" ], "description": "Programming language designed to unify programming with formal specification", "fileExtensions": [ "sats", "dats", "cats", "hats" ], "website": "http://www.ats-lang.org/", "gitRepo": "https://github.com/githwxi/ATS-Postiats", "id": "https://riju.codes/ats" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012||Ats (programming Language)|Niek Yoan|9786201963160", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|ATS (AUTOMATIC TRANSFER SWITCH) BERBASIS PROGRAMMABLLE LOGIC CONTROLLER CPM1A AUTOMATIC TRANSFER SWITCH (ATS) BASED ON PROGRAMMABLLE LOGIC CONTROLLER CPM1A|10.31000/JT.V8I1.1579|3|0|Sumardi Sadi and S. Mulyati|63338d33f437a3e21ed477293e9dac064bceb9bf" }, "attic-numerals": { "title": "Attic numerals", "appeared": -600, "type": "numeralSystem", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Attic_numerals" } }, "attoparsec": { "title": "attoparsec", "appeared": 2010, "type": "library", "description": "attoparsec is a fast Haskell parser combinator library, aimed particularly at dealing efficiently with network protocols and complicated text/binary file formats.", "website": "http://hackage.haskell.org/package/attoparsec", "writtenIn": [ "haskell" ], "related": [ "megaparsec" ], "githubRepo": { "stars": 495, "forks": 91, "subscribers": 21, "created": 2010, "updated": 2023, "description": "A fast Haskell library for parsing ByteStrings", "issues": 32, "url": "https://github.com/haskell/attoparsec" } }, "aubit-4gl": { "title": "aubit-4gl", "appeared": 2001, "type": "pl", "website": "http://aubit4gl.sourceforge.net/aubit4gldoc/", "country": [ "England and Wales" ], "originCommunity": [ "Aubit Computing Limited" ], "centralPackageRepositoryCount": 0 }, "augeas": { "title": "Augeas", "appeared": 2007, "type": "pl", "website": "http://augeas.net/", "country": [ "United States" ], "originCommunity": [ "Red Hat Software" ], "domainName": { "registered": 2008, "awisRank": { "2022": 6616817 }, "name": "augeas.net" }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "c", "xml", "xpath", "python", "ruby", "ocaml", "perl", "haskell", "java", "php", "tcl", "puppet" ], "summary": "Augeas is a free software configuration-management library, written in the C programming language. It is licensed under the terms of the GNU Lesser General Public License. Augeas uses programs called lenses (in reference to the Harmony Project) to map a filesystem to an XML tree which can then be parsed using an XPath syntax, using a bidirectional transformation. Writing such lenses extends the amount of files Augeas can parse.", "created": 2011, "pageId": 79322, "backlinksCount": 150, "revisionCount": 25, "dailyPageViews": 9, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/Augeas_(software)" }, "githubLanguage": { "fileExtensions": [ "aug" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 68, "id": "Augeas" }, "githubBigQuery": { "repos": 293, "users": 265, "id": "Augeas" }, "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "aug" ], "id": "Augeas" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "augment": { "title": "Augment", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/10d89b3b16ec56053272895b1f996f713a3d80ac" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin - Madison", "The Boeing Company" ], "wikipedia": { "summary": "Augment or augmentation may refer to:", "backlinksCount": 25, "pageId": 1693769, "dailyPageViews": 36, "created": 2002, "url": "https://en.wikipedia.org/wiki/Augment" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7408", "centralPackageRepositoryCount": 0 }, "aui": { "title": "AUI", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4ca9970ceade9580757916d20bc4a1bf19688860" ], "country": [ "Canada" ], "originCommunity": [ "University of Saskatchewan", "Queen's University" ], "wikipedia": { "summary": "AUI may stand for: Ethernet's Attachment Unit Interface, a 15-pin D-connector The constructed language aUI (language) The National Rail code for Ardlui railway station, United Kingdom Associated Universities, Inc., the corporation that operates the National Radio Astronomy Observatory (NRAO) Amiga User International, a monthly magazine dedicated to the Amiga computer Al Akhawayn University, a university located in Ifrane, Morocco Adaptive user interface Audible user interface, for blind people to use digital devices Attentive user interface", "backlinksCount": 17, "pageId": 332459, "dailyPageViews": 19, "created": 2003, "url": "https://en.wikipedia.org/wiki/AUI" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5777", "centralPackageRepositoryCount": 0 }, "aur-pm": { "title": "AUR", "appeared": 2015, "type": "packageManager", "website": "https://aur.archlinux.org/", "reference": [ "https://en.wikipedia.org/wiki/Arch_Linux#Arch_User_Repository_.28AUR.29" ], "standsFor": "Archlinux User Repository", "domainName": { "name": "aur.archlinux.org" } }, "aurora": { "title": "Aurora", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8060357b5ac75b0116738a906794fb6e4feaf5e0" ], "country": [ "Hungary" ], "originCommunity": [ "IQSOFT or ZKI Intelligent Software Ltd" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1386", "wordRank": 8018, "centralPackageRepositoryCount": 0 }, "austral": { "title": "Austral", "appeared": 2018, "type": "pl", "creators": [ "Fernando Borretti" ], "description": "Austral is a new systems programming language. You can think of it as Rust: The Good Parts or a modernized, stripped-down Ada. It features a strong static type system, linear types, capability-based security, and strong modularity.", "website": "https://austral-lang.org/", "reference": [ "https://borretti.me/article/introducing-austral" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/austral/" ], "example": [ "let db: Db := connect(\"localhost\");\nclose(db);\n-- The below is tuple destructuring notation.\nlet { first as db1: Db, second: Rows } := query(db, \"SELECT ...\");\nclose(db); -- error: `db` consumed again.\n-- another error: `db1` never consumed." ], "githubRepo": { "stars": 408, "forks": 8, "subscribers": 15, "created": 2018, "updated": 2023, "description": "Systems language with linear types and capability-based security.", "issues": 14, "url": "https://github.com/austral/austral/" }, "repoStats": { "firstCommit": 2018, "commits": 8737, "committers": 17, "files": 898 } }, "autasim": { "title": "AUTASIM", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b0336d934a38cd48e0b0c317a4ff234dca50b997" ], "country": [ "United States" ], "originCommunity": [ "General Research Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5437", "centralPackageRepositoryCount": 0 }, "autocad-app": { "title": "AUTOCAD", "appeared": 1982, "type": "application", "country": [ "United States" ], "originCommunity": [ "Autodesk" ], "wikipedia": { "related": [ "ios", "android", "dwg", "unix", "autolisp", "vba" ], "summary": "AutoCAD is a commercial computer-aided design (CAD) and drafting software application. Developed and marketed by Autodesk, AutoCAD was first released in December 1982 as a desktop app running on microcomputers with internal graphics controllers. Before AutoCAD was introduced, most commercial CAD programs ran on mainframe computers or minicomputers, with each CAD operator (user) working at a separate graphics terminal. Since 2010, AutoCAD was released as a mobile- and web app as well, marketed as AutoCAD 360. AutoCAD is used across a wide range of industries, by architects, project managers, engineers, graphic designers, town planners and many other professionals. It was supported by 750 training centers worldwide in 1994.", "backlinksCount": 741, "pageId": 2753, "dailyPageViews": 1669, "created": 2001, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/AutoCAD" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4836", "centralPackageRepositoryCount": 0 }, "autocode": { "title": "Autocode", "appeared": 1954, "type": "pl", "country": [ "England" ], "originCommunity": [ "University of Manchester", "University of Cambridge", "University of London" ], "wikipedia": { "example": [ "1 n1 = 1 \n vn1 = I reads input into v[n[1]]\n n1 = n1 + 1\n j1,11 ≥ n1 jumps to 1 if n[1] ≤ 11" ], "related": [ "autocoder", "cobol", "fortran", "dartmouth-basic", "algol", "atlas-autocode", "cpl", "bcpl", "b", "c" ], "summary": "Autocode is the name of a family of \"simplified coding systems\", later called programming languages, devised in the 1950s and 1960s for a series of digital computers at the Universities of Manchester, Cambridge and London. Autocode was a generic term; the autocodes for different machines were not necessarily closely related as are, for example, the different versions of the single language FORTRAN. Today the term is used to refer to the family of early languages descended from the Manchester Mark 1 autocoder systems, which were generally similar. In the 1960s, the term autocoders was used more generically as to refer to any high-level programming language using a compiler. Examples of languages referred to as autocodes are COBOL and Fortran.", "created": 2005, "backlinksCount": 52, "pageId": 1619142, "revisionCount": 122, "dailyPageViews": 47, "appeared": 1950, "url": "https://en.wikipedia.org/wiki/Autocode" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5", "centralPackageRepositoryCount": 0 }, "autocoder-ii": { "title": "AUTOCODER II", "appeared": 1958, "type": "assembly", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3873" }, "autocoder-iii": { "title": "AUTOCODER III", "appeared": 1958, "type": "assembly", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3872", "isbndb": "" }, "autocoder": { "title": "AUTOCODER", "appeared": 1955, "type": "assembly", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "related": [ "autocode", "assembly-language" ], "summary": "Autocoder was the name given to certain assemblers for a number of IBM computers of the 1950s and 1960s. The first Autocoders appear to have been the earliest assemblers to provide a macro facility.", "pageId": 1861435, "created": 2005, "backlinksCount": 22, "revisionCount": 67, "dailyPageViews": 15, "appeared": 1955, "url": "https://en.wikipedia.org/wiki/Autocoder" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2989", "fileType": "text", "centralPackageRepositoryCount": 0 }, "autoconf": { "title": "Autoconf", "appeared": 1991, "type": "configFormat", "description": "GNU Autoconf is a tool for producing configure scripts for building, installing, and packaging software on computer systems where a Bourne shell is available.", "fileExtensions": [ "ac" ], "country": [ "Various\t" ], "originCommunity": [ "The GNU Project" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Autoconf" } }, "autodraft": { "title": "AUTODRAFT", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ee390f2474cf01852f134fa3631e6f492448dbc9" ], "country": [ "United States" ], "originCommunity": [ "North American Aviation", "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5291", "centralPackageRepositoryCount": 0 }, "autogrp": { "title": "AUTOGRP", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/903de0e968425976256621565fd7fa60bbe7bfc8" ], "country": [ "United States" ], "originCommunity": [ "Yale University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=708", "centralPackageRepositoryCount": 0 }, "autohotkey": { "title": "AutoHotkey", "appeared": 2003, "type": "pl", "website": "https://autohotkey.com", "country": [ "United States" ], "originCommunity": [ "AutoHotkey Foundation LLC" ], "domainName": { "registered": 2003, "awisRank": { "2022": 17775 }, "name": "autohotkey.com" }, "hasComments": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasOctals": { "example": "; 0\\d+", "value": true }, "hasHexadecimals": { "example": "; 0[xX][a-fA-F0-9]+", "value": true }, "hasFloats": { "example": "; (\\d+\\.\\d*|\\d*\\.\\d+)([eE][+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "; \\d+", "value": true }, "lineCommentToken": [ [ ";" ] ], "assignmentToken": [ [ ":=" ] ], "wikipedia": { "example": [ "^+w::last := CopyUser() ; Ctrl+Shift+w\n^+e::edit := CopyUser() ; Ctrl+Shift+e\n\nCopyUser() {\n Clipboard =\n StringReplace, Clipboard, Clipboard, http://en.wikipedia.org/\n StringReplace, Clipboard, Clipboard, wiki/\n StringReplace, Clipboard, Clipboard, w/index.php?title=\n StringReplace, Clipboard, Clipboard, Special:Contributions&target=\n StringReplace, Clipboard, Clipboard, User:\n StringReplace, Clipboard, Clipboard, &action=edit\n StringReplace, Clipboard, Clipboard, _, %A_Space%, All\n Return, Clipboard\n}\n\n; Ctrl+Shift+r\n^+r::Send revert edits by [[Special:Contributions/%edit%|%edit%]] to last version by %last%" ], "related": [ "emacs-editor", "c", "excel-app", "autoit", "visual-basic.net", "csharp", "lua", "lisp", "vbscript", "jscript", "kixtart", "winbatch" ], "summary": "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.", "pageId": 1485612, "dailyPageViews": 308, "created": 2005, "backlinksCount": 146, "revisionCount": 496, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/AutoHotkey" }, "githubLanguage": { "fileExtensions": [ "ahk", "ahkl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "autohotkey", "tmScope": "source.ahk", "aliases": [ "ahk" ], "repos": 14623, "id": "AutoHotkey" }, "githubBigQuery": { "repos": 1470, "users": 1244, "id": "AutoHotkey" }, "pygmentsHighlighter": { "filename": "automation.py", "fileExtensions": [ "ahk", "ahkl" ], "id": "autohotkey" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 5, "commitCount": 53, "sampleCount": 1, "example": [ "MsgBox, Hello`, World!\n" ], "url": "https://github.com/ahkscript/SublimeAutoHotkey" }, "projectEuler": { "memberCount": { "2019": 23, "2022": 28 }, "id": "AutoHotkey" }, "helloWorldCollection": [ "; Hello World in AutoHotkey\n\nMsgbox Hello, World!\n" ], "leachim6": { "filepath": "a/AutoHotKey.ahk", "fileExtensions": [ "ahk" ], "example": [ "MsgBox, Hello World\n" ], "id": "AutoHotKey" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AutoHotkey", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAutoHotkey Hotkeys: Tips, Tricks, Techniques, and Best Practices for Automating Your Windows Computers (AutoHotkey Tips and Tricks Book 7)||Jack Dunning|56446542|0.0|0|0\nAutoHotkey Tricks You Ought To Do With Windows (Fourth Edition): If You Do Nothing Else with the Free Autohotkey Software, These Tips Are a Must for Windows ... (AutoHotkey Tips and Tricks Book 4)|2015|Jack Dunning|45853897|2.50|2|0\nUltimate AutoHotkey Tutorial for Non-programmer and Beginners||Chijiiwa Hiroaki|59496740|0.0|0|0\nJack's New Beginner's Guide to AutoHotkey: Absolutely the Best Free Windows Utility Software Ever! Add Power to Any Version of Windows! Now Includes AutoHotkey ... Code! (AutoHotkey Tips and Tricks Book 1)||Jack Dunning|61026743|0.0|0|0\nArticles on GUI Automation, Including: AppleScript, Test Automation, Metacard, Automator (Software), Autohotkey, Autokey, HP Winrunner, Silktest, Autoit, Guidancer, Xvt, Visual Test, Selenium (Software), Pigui, List of Pigui Packages|2011|Hephaestus Books|17503124|0.0|0|0\nA Beginner's Guide to AutoHotkey, Absolutely the Best Free Windows Utility Software Ever!: Create Power Tools for Windows XP, Windows Vista, Windows 7 ... 8 (Second Edition) (Windows Tips and Tricks)|2012|Jack Dunning|26886515|3.62|8|0\nA Beginner's Guide to AutoHotkey, Absolutely the Best Free Windows Utility Software Ever! (Third Edition) Create Power Tools for Windows XP, Windows Vista, Windows 7, Windows 8 and Windows 10||Jack Dunning|56218249|0.0|0|0", "isbndb": "", "semanticScholar": "" }, "autoit": { "title": "AutoIt", "appeared": 1999, "type": "pl", "creators": [ "Jonathan Bennett" ], "website": "http://www.autoitscript.com/autoit3/", "documentation": [ "https://www.autoitscript.com/autoit3/docs/" ], "country": [ "Unknown" ], "originCommunity": [ "AutoIt Consulting Ltd" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "; 0\\d+", "value": true }, "hasHexadecimals": { "example": "; 0[xX][a-fA-F0-9]+", "value": true }, "hasFloats": { "example": "; (\\d+\\.\\d*|\\d*\\.\\d+)([eE][+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "; \\d+", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "MsgBox" ] ], "stringToken": [ [ "\"" ] ], "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" ], "wikipedia": { "example": [ "; Find Average by JohnOne, modified by czardas\n#include \n\n_Example() ; Run the example.\n\nFunc _Example()\n ; Display an input box and ask the user to enter some numbers separated by commas.\n Local $sInput = InputBox(\"Find Average\", \"Enter some numbers separated by commas: 1,2,42,100,3\")\n\n\t; If an error occurred then exit the script.\n\tIf @error Then Exit\n\n ; Populate an array with the user's input.\n Local $aSplit = StringSplit($sInput, \",\")\n\n ; Pass the array to the function _Find_Average() and then check for errors.\n Local $fAverage = _Find_Average($aSplit)\n If @error Then Exit\n\n ; Display the result in a message box.\n MsgBox($MB_OK, \"Find Average\", \"Result: \" & $fAverage)\nEndFunc ;==>_Example\n\nFunc _Find_Average($aArray)\n ; If the input is not of the correct type (an array), then return an error along with the details.\n If Not IsArray($aArray) Then Return SetError(1, 0, VarGetType($aArray))\n\t; More detailed checks are possible, but for brevity just one is performed here.\n\n ; Declare a variable to store the sum of the numbers.\n Local $iArraySum = 0\n\n ; Loop through the array.\n For $i = 1 To $aArray[0]\n ; Increment the sum by the number in each array element.\n $iArraySum += Number($aArray[$i])\n Next\n\n ; Return the average rounded to 2 decimal places.\n Return Round($iArraySum / $aArray[0], 2)\nEndFunc ;==>_Find_Average" ], "related": [ "basic", "tcp", "udp", "autohotkey", "kixtart", "thinbasic", "visual-basic", "winbatch", "expect" ], "summary": "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.", "pageId": 2281448, "dailyPageViews": 158, "created": 2005, "backlinksCount": 174, "revisionCount": 567, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/AutoIt" }, "githubLanguage": { "fileExtensions": [ "au3" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "autohotkey", "tmScope": "source.autoit", "aliases": [ "au3", "AutoIt3", "AutoItScript" ], "repos": 4732, "id": "AutoIt" }, "githubBigQuery": { "repos": 650, "users": 561, "id": "AutoIt" }, "pygmentsHighlighter": { "filename": "automation.py", "fileExtensions": [ "au3" ], "id": "AutoIt" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 11, "commitCount": 88, "url": "https://github.com/AutoIt/SublimeAutoItScript" }, "projectEuler": { "memberCount": { "2019": 7, "2022": 12 }, "id": "AutoIt" }, "leachim6": { "filepath": "a/AutoIt.au3", "fileExtensions": [ "au3" ], "example": [ "MsgBox(0, \"Message Box\", \"Hello World\")" ], "id": "AutoIt" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AutoIt", "tiobe": { "id": "AutoIt" }, "twitter": "https://twitter.com/autoitconsult", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|Instant AutoIt Scripting|Laso, Emilio Aristides de Fez|9781782165798\n2015|CreateSpace Independent Publishing Platform|AutoIT Scripting for Beginners|E, Rajan|9781514144480\n2013-07-26|Packt Publishing|Instant AutoIt Scripting|Emilio Aristides de Fez Laso|9781782165781\n|Wiley-vch,|Practical Laboratory Automation: Made Easy With Autoit|Carvalho, Matheus C.|9783527341580\n2016-10-24|Wiley Global Research (STMS)|Practical Laboratory Automation: Made Easy with AutoIt|Matheus C. Carvalho|9783527801961", "semanticScholar": "" }, "autolisp": { "title": "AutoLISP", "appeared": 1986, "type": "pl", "creators": [ "David Betz" ], "country": [ "United States" ], "originCommunity": [ "Autodesk", "Basis Software" ], "isLisp": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "1 (defun c:pointlabel ( / pnt )\n 2 (if (setq pnt (getpoint \"\\nSpecify point: \"))\n 3 (progn\n 4 (entmake\n 5 (list\n 6 '(0 . \"POINT\")\n 7 (cons 10 (trans pnt 1 0))\n 8 )\n 9 )\n10 (entmake\n11 (list\n12 '(0 . \"TEXT\")\n13 (cons 10 (trans (cons (+ (car pnt) 0.6) (cdr pnt)) 1 0))\n14 (cons 40 (getvar 'textsize))\n15 (cons 1 (strcat \"X:\" (rtos (car pnt)) \" Y:\" (rtos (cadr pnt))))\n16 )\n17 )\n18 )\n19 )\n20 (princ)\n21 )" ], "related": [ "autocad-app", "vba", "lisp", "interlisp", "lisp-machine-lisp", "scheme", "common-lisp", "t", "emacs-lisp", "islisp", "openlisp", "picolisp", "eulisp", "newlisp", "racket", "clojure", "arc", "lfe" ], "summary": "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.", "pageId": 51458, "dailyPageViews": 82, "created": 2001, "backlinksCount": 74, "revisionCount": 232, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/AutoLISP" }, "leachim6": { "filepath": "a/AutoLISP.lsp", "fileExtensions": [ "lsp" ], "example": [ "(alert \"Hello World\")\n" ], "id": "AutoLISP" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AutoLISP", "tiobe": { "id": "AutoLISP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1842", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAutoLISP Programming|1993|Rod R. Rawls|675018|2.50|2|0\nAutoLISP Programming: Principles and Techniques|1997|Rod R. Rawls|15332754|0.0|0|0\nAutoLISP: Programming by Example|1992|Gene Straka|3212808|0.0|0|0\nAutoLISP: Programming by Example|1992|Gene Straka|15209678|0.0|0|0\nAutoLISP Concepts: Programming for Productivity|1989|William Kramer|6371294|0.0|0|0\nAutoLISP in Plain English: A Practical Guide for Non-Programmers|1987|George O. Head|675019|4.33|3|0", "isbndb": "year|publisher|title|authors|isbn13\n1996|Goodheart-Willcox Pub|Autolisp Programming: Principles and Techniques|Rawls, Rod R. and Hagen, Mark A.|9781566374170\n2008|Princeton Architectural Press|The Codewriting Workbook: Creating Computational Architecture in AutoLISP|Krawczyk, Robert J.|9781568987927\n2000|Thomson Delmar Learning|AutoLISP to Visual LISP: Design Solutions: Design Solutions for AutoCAD 2000 (Autodesk's Programmer Series)|Standiford, Kevin|9780766815179\n1998|Longman Pub Group|A Practical Guide to AutoCAD AutoLISP|Bousfield, Trevor|9780582326736\n|Goodheart-Willcox Pub|AutoLISP Programming|Rod Rawls|9780870069420\n1994|Goodheart-willcox Pub|Autolisp Programming/solution Manual|Rod Rawls and Mark Hagen|9780870069437\n1999|Wiley|Using Autolisp With Autocad|Robert Mcfarlane and Camillus P. Mcelhinney|9780470328996\n1996|Pearson|Introduction To Autolisp|Peter M. Moanfeldt|9780132066242\n1998|Goodheart-willcox Pub|Autolisp Programming: Principles & Techniques|Rod R. Rawls and Mark A. Hagen|9781566374187\n2014-08-11|Wiley Professional Development (P&T)|AutoCAD Platform Customization: AutoLISP|Lee Ambrosius|9781118900550\n1995|Goodheart-willcox Pub|Autolisp Programming: Principles And Techniques|Rod R. Rawls and Mark A. Hagen|9781566371964\n1989|Ariel Communications|Autolisp Concepts: Programming For Productivity|William Kramer|9780926401006\n1999|Coriolis Group|Autolisp R15 In Depth: Expand Your Programming Possibilities||9781576104071\n|Browning Computer Documentation|Autolisp Programming: A Coursework Book For The City & Guilds 4351-05 Scheme||9780952024101", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Methodical complex of training in programming on AutoLISP language|10.12737/471|2|0|E. Alshakova|a2debd870483830578736892d1aeae39270920d1" }, "autoloft": { "title": "AUTOLOFT", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/61bdacbbd73376ccf06d005a0eac2f7f37f06f23" ], "country": [ "United States" ], "originCommunity": [ "North American Aviation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5290", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "automast": { "title": "AUTOMAST", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e3df7bbbe11bb0667a732e1f68199b36867969a4" ], "country": [ "United States" ], "originCommunity": [ "Washington University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2890", "centralPackageRepositoryCount": 0 }, "automator": { "title": "Automator", "appeared": 2005, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/List_of_macOS_components#Automator" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "tiobe": { "id": "Automator" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "autopromt": { "title": "AUTOmatic PROgramming of Machine Tools", "appeared": 1961, "type": "pl", "reference": [ "https://books.google.com/books?id=t5vjTpoTdUsC&pg=PA128&lpg=PA128&dq=AUTOPROMT+language&source=bl&ots=O3BIKpMOml&sig=0d2mrPs6mssofDliLeU4NYmeoKY&hl=en&sa=X&ved=2ahUKEwiYr_nrkqreAhUPCTQIHX_kAaIQ6AEwAXoECAcQAQ#v=onepage&q=AUTOPROMT%20language&f=false" ], "country": [ "United States" ], "originCommunity": [ "IBM", "United Aircraft Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=369", "fileType": "text", "centralPackageRepositoryCount": 0 }, "avail": { "title": "Avail", "appeared": 2010, "type": "pl", "creators": [ "Mark van Gulik", "Todd L. Smith" ], "description": "Avail is a multi-paradigmatic general purpose programming language whose feature set emphasizes support for articulate programming.", "website": "https://www.availlang.org/", "country": [ "United States" ], "originCommunity": [ "The Avail Foundation, LLC" ], "example": [ "Public method \"Play Wump the Wumpus with reader_with reporter_\" is\n[\n reader : []→string,\n writer : [string]→⊤\n|\n /* Set up the game's I/O. */\n Wump the Wumpus reader := reader;\n Wump the Wumpus reporter := writer;\n /* Create a new game. All references to game objects within the block are\n * implicitly understood as relative to this new game.\n */\n newGame ::= a game of Wump the Wumpus;\n Use newGame as the implied game and do\n [\n Welcome;\n Look around, having just entered;\n Until the game is over, do\n [\n Give the agent a turn;\n Give the first swarm a turn;\n Give the second swarm a turn;\n Give the wumpus a turn;\n ];\n If the agent is alive then\n [\n If the wumpus is dead then [Report victory;]\n else [Report cowardice;];\n ]\n else [Report defeat;];\n Goodbye;\n ];\n] : ⊤;" ], "githubRepo": { "stars": 48, "forks": 3, "subscribers": 11, "created": 2010, "updated": 2022, "description": "The Avail programming language. Includes the virtual machine, standard library, and standard examples.", "url": "https://github.com/AvailLang/Avail" }, "repoStats": { "firstCommit": 2010, "commits": 3638, "committers": 59, "files": 2600 } }, "avalon-common-lisp": { "title": "Avalon/Common LISP", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/af24e3f80b26437dcf21afd674b619cdd4e543b3" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1536", "centralPackageRepositoryCount": 0 }, "averest": { "title": "Averest", "appeared": 2005, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "Technical University of Kaiserslautern" ], "wikipedia": { "related": [ "esterel" ], "summary": "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.", "created": 2005, "backlinksCount": 8, "pageId": 2211949, "revisionCount": 18, "dailyPageViews": 8, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Averest" }, "centralPackageRepositoryCount": 0 }, "avi-synth": { "title": "AviSynth", "appeared": 2000, "type": "editor", "creators": [ "Ben Rudiak-Gould", "Edwin van Eggelen", "Klaus Post", "Richard Berg", "Ian Brabham" ], "description": "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", "website": "http://avisynth.nl", "documentation": [ "http://avisynth.nl/index.php/Main_Page" ], "cheatSheetUrl": [ "http://avisynth.nl/index.php/First_script" ], "fileExtensions": [ ".avs" ], "country": [ "The Netherlands" ], "originCommunity": [ "https://forum.doom9.org/showthread.php?t=181351" ], "domainName": { "name": "avisynth.nl" }, "versions": { "2022": [ "3.7.2" ] }, "writtenIn": [ "cpp" ], "example": [ "filename=\"somefile.avi\"\nlogfile=\"output.txt\" \npath=\"P:\\ath\\To\\Files\\\" \nlumathresh=80 \nimageprefix=\"prefix_\"" ], "githubRepo": { "firstCommit": 2002, "stars": 703, "forks": 59, "subscribers": 47, "created": 2013, "updated": 2023, "description": "AviSynth with improvements", "issues": 61, "url": "https://github.com/AviSynth/AviSynthPlus" }, "sourcehutRepo": "https://sourceforge.net/projects/avisynth2/", "wikipedia": { "url": "https://en.wikipedia.org/wiki/AviSynth" }, "packageRepository": [ "https://www.npmjs.com/package/avisynth" ], "isOpenSource": true }, "avr": { "title": "Atmel AVR instruction set", "appeared": 1996, "type": "isa", "country": [ "United States" ], "originCommunity": [ "Atmel" ], "wikipedia": { "related": [ "atmel-avr" ], "summary": "The Atmel AVR instruction set is the machine language for the Atmel AVR, a modified Harvard architecture 8-bit RISC single chip microcontroller which was developed by Atmel in 1996. The AVR was one of the first microcontroller families to use on-chip flash memory for program storage.", "pageId": 1716422, "dailyPageViews": 74, "created": 2005, "backlinksCount": 30, "revisionCount": 170, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Atmel_AVR_instruction_set" }, "fileType": "na", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming and Customizing the Avr Microcontroller|2000|Dhananjay Gadre|449589|3.65|26|3\nEmbedded C Programming and the Atmel AVR with CDROM|2002|Richard H. Barnett|191732|4.06|36|1\nBASCOM AVR Programming|2012|Jurij Mikeln|22114860|3.00|2|0\nBeginning AVR Programming||Alan Trevennor|18403570|0.0|0|0\nMake: AVR Programming: Learning to Write Software for Hardware (Make : Technology on Your Time)|2013|Elliot Williams|40114251|4.18|71|10\nProgramming and Interfacing Atmel's Avrs|2015|Thomas Grace|42898480|5.00|3|1\nAtmel AVR Microcontroller Primer: Programming and Interfacing|1905|Steven Barrett|1684918|3.22|9|1" }, "avro": { "title": "avro", "appeared": 2012, "type": "idl", "website": "https://avro.apache.org/", "country": [ "Various" ], "originCommunity": [ "The Apache Software Foundation" ], "domainName": { "name": "avro.apache.org" }, "related": [ "protobuf", "thrift" ], "example": [ "{\"namespace\": \"example.avro\",\n \"type\": \"record\",\n \"name\": \"User\",\n \"fields\": [\n {\"name\": \"name\", \"type\": \"string\"},\n {\"name\": \"favorite_number\", \"type\": [\"int\", \"null\"]},\n {\"name\": \"favorite_color\", \"type\": [\"string\", \"null\"]}\n ]\n}" ], "fileType": "binary", "centralPackageRepositoryCount": 0 }, "awk": { "title": "awk", "appeared": 1977, "type": "pl", "creators": [ "Alfred Aho", "Peter J. Weinberger", "Brian Kernighan" ], "website": "http://www.cs.princeton.edu/~bwk/btl.mirror/", "documentation": [ "https://www.gnu.org/software/gawk/manual/gawk.html" ], "standsFor": "Aho, Weinberger, Kernighan", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "# 0x[0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "# [0-9][0-9]*\\.[0-9]+([eE][0-9]+)?[fd]?", "value": true }, "hasIntegers": { "example": "# [0-9]+", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "BEGIN {\n pattern = ARGV[1]\n for (i = 1; i < ARGC; i++) # remove first argument\n ARGV[i] = ARGV[i + 1]\n ARGC--\n if (ARGC == 1) { # the pattern was the only thing, so force read from standard input (used by book)\n ARGC = 2\n ARGV[1] = \"-\"\n }\n}\n$0 ~ pattern { print FILENAME \":\" $0 }" ], "related": [ "c", "snobol", "bourne-shell", "tcl", "ampl", "perl", "lua", "regex", "unix", "sed", "freebsd", "solaris", "java", "isbn" ], "summary": "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.", "pageId": 1456, "dailyPageViews": 506, "created": 2001, "backlinksCount": 495, "revisionCount": 770, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/AWK" }, "githubLanguage": { "fileExtensions": [ "awk", "auk", "gawk", "mawk", "nawk" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "awk", "gawk", "mawk", "nawk" ], "aceMode": "text", "tmScope": "source.awk", "repos": 2552, "id": "Awk" }, "githubBigQuery": { "repos": 20601, "users": 13611, "id": "Awk" }, "pygmentsHighlighter": { "filename": "textedit.py", "fileExtensions": [ "awk" ], "id": "Awk" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2016, "committerCount": 3, "commitCount": 22, "sampleCount": 1, "example": [ "#!/bin/awk -f\n\nBEGIN {\n # It is not possible to define output file names here because\n # FILENAME is not define in the BEGIN section\n n = \"\";\n printf \"Generating data files ...\";\n network_max_bandwidth_in_byte = 10000000;\n network_max_packet_per_second = 1000000;\n last3 = 0;\n last4 = 0;\n last5 = 0;\n last6 = 0;\n}\n{\n if ($1 ~ /Average/)\n { # Skip the Average values\n n = \"\";\n next;\n }\n\n if ($2 ~ /all/)\n { # This is the cpu info\n print $3 > FILENAME\".cpu.user.dat\";\n#\t print $4 > FILENAME\".cpu.nice.dat\";\n print $5 > FILENAME\".cpu.system.dat\";\n# print $6 > FILENAME\".cpu.iowait.dat\";\n print $7 > FILENAME\".cpu.idle.dat\";\n print 100-$7 > FILENAME\".cpu.busy.dat\";\n }\n if ($2 ~ /eth0/)\n { # This is the eth0 network info\n if ($3 > network_max_packet_per_second)\n\tprint last3 > FILENAME\".net.rxpck.dat\"; # Total number of packets received per second.\n else\n\t{\n\t last3 = $3;\n\t print $3 > FILENAME\".net.rxpck.dat\"; # Total number of packets received per second.\n\t}\n if ($4 > network_max_packet_per_second)\n\tprint last4 > FILENAME\".net.txpck.dat\"; # Total number of packets transmitted per second.\n else\n\t{\n\t last4 = $4;\n\t print $4 > FILENAME\".net.txpck.dat\"; # Total number of packets transmitted per second.\n\t}\n if ($5 > network_max_bandwidth_in_byte)\n\tprint last5 > FILENAME\".net.rxbyt.dat\"; # Total number of bytes received per second.\n else\n\t{\n\t last5 = $5;\n\t print $5 > FILENAME\".net.rxbyt.dat\"; # Total number of bytes received per second.\n\t}\n if ($6 > network_max_bandwidth_in_byte)\n\tprint last6 > FILENAME\".net.txbyt.dat\"; # Total number of bytes transmitted per second.\n else\n\t{\n\t last6 = $6;\n\t print $6 > FILENAME\".net.txbyt.dat\"; # Total number of bytes transmitted per second.\n\t}\n# print $7 > FILENAME\".net.rxcmp.dat\"; # Number of compressed packets received per second (for cslip etc.).\n# print $8 > FILENAME\".net.txcmp.dat\"; # Number of compressed packets transmitted per second.\n# print $9 > FILENAME\".net.rxmcst.dat\"; # Number of multicast packets received per second.\n }\n\n # Detect which is the next info to be parsed\n if ($2 ~ /proc|cswch|tps|kbmemfree|totsck/)\n {\n n = $2;\n }\n\n # Only get lines with numbers (real data !)\n if ($2 ~ /[0-9]/)\n {\n if (n == \"proc/s\")\n\t{ # This is the proc/s info\n\t print $2 > FILENAME\".proc.dat\";\n#\t n = \"\";\n\t}\n if (n == \"cswch/s\")\n\t{ # This is the context switches per second info\n\t print $2 > FILENAME\".ctxsw.dat\";\n#\t n = \"\";\n\t}\n if (n == \"tps\")\n\t{ # This is the disk info\n\t print $2 > FILENAME\".disk.tps.dat\"; # total transfers per second\n\t print $3 > FILENAME\".disk.rtps.dat\"; # read requests per second\n\t print $4 > FILENAME\".disk.wtps.dat\"; # write requests per second\n\t print $5 > FILENAME\".disk.brdps.dat\"; # block reads per second\n\t print $6 > FILENAME\".disk.bwrps.dat\"; # block writes per second\n#\t n = \"\";\n\t}\n if (n == \"kbmemfree\")\n\t{ # This is the mem info\n\t print $2 > FILENAME\".mem.kbmemfree.dat\"; # Amount of free memory available in kilobytes.\n\t print $3 > FILENAME\".mem.kbmemused.dat\"; # Amount of used memory in kilobytes. This does not take into account memory used by the kernel itself.\n\t print $4 > FILENAME\".mem.memused.dat\"; # Percentage of used memory.\n# It appears the kbmemshrd has been removed from the sysstat output - ntolia\n#\t print $X > FILENAME\".mem.kbmemshrd.dat\"; # Amount of memory shared by the system in kilobytes. Always zero with 2.4 kernels.\n#\t print $5 > FILENAME\".mem.kbbuffers.dat\"; # Amount of memory used as buffers by the kernel in kilobytes.\n\t print $6 > FILENAME\".mem.kbcached.dat\"; # Amount of memory used to cache data by the kernel in kilobytes.\n#\t print $7 > FILENAME\".mem.kbswpfree.dat\"; # Amount of free swap space in kilobytes.\n#\t print $8 > FILENAME\".mem.kbswpused.dat\"; # Amount of used swap space in kilobytes.\n\t print $9 > FILENAME\".mem.swpused.dat\"; # Percentage of used swap space.\n#\t n = \"\";\n \t}\n if (n == \"totsck\")\n\t{ # This is the socket info\n\t print $2 > FILENAME\".sock.totsck.dat\"; # Total number of used sockets.\n\t print $3 > FILENAME\".sock.tcpsck.dat\"; # Number of TCP sockets currently in use.\n#\t print $4 > FILENAME\".sock.udpsck.dat\"; # Number of UDP sockets currently in use.\n#\t print $5 > FILENAME\".sock.rawsck.dat\"; # Number of RAW sockets currently in use.\n#\t print $6 > FILENAME\".sock.ip-frag.dat\"; # Number of IP fragments currently in use.\n#\t n = \"\";\n \t}\n }\n}\nEND {\n print \" '\" FILENAME \"' done.\";\n}\n" ], "url": "https://github.com/github-linguist/awk-sublime" }, "projectEuler": { "memberCount": { "2019": 9, "2022": 14 }, "id": "AWK" }, "helloWorldCollection": [ "# Hello world in AWK\n\nBEGIN {\n print \"Hello World!\"\n}" ], "leachim6": { "filepath": "a/AWK.awk", "fileExtensions": [ "awk" ], "example": [ "# awk -f awk.awk\nBEGIN { print \"Hello World\" }\n" ], "id": "AWK" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:AWK", "quineRelay": "Awk", "rijuRepl": { "example": [ "BEGIN { print \"Hello, world!\" }\n" ], "description": "Domain-specific language designed for text processing and typically used as a data extraction and reporting tool", "fileExtensions": [ "awk" ], "gitRepo": "https://savannah.gnu.org/git/?group=gawk", "id": "https://riju.codes/awk" }, "tryItOnline": "awk", "indeedJobs": { "2022": 7, "query": "awk engineer" }, "subreddit": [ { "memberCount": { "2017": 720, "2022": 1929 }, "url": "https://reddit.com/r/awk" } ], "tiobe": { "currentRank": 37, "id": "Awk" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1844", "ubuntuPackage": "gawk", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe AWK Programming Language|1988|Alfred V. Aho|689393|4.25|142|11\nEffective awk Programming: Text Processing and Pattern Matching|1997|Arnold Robbins|707065|3.97|37|2\nGAWK: Effective Awk Programming|1996|Arnold D. Robbins|27480621|4.00|1|0\nAWK Programming: Questions and Answers|2014|George Duckett|43826300|0.0|0|0\nawk Programmer's Toolbox: Advanced awk and Unix Shell Scripting Examples and Techniques|2013|Steve Myers|27006436|5.00|1|0\nAwk Programming (2 Days)||Sim McNally|5706968|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1997|O'Reilly Media|sed & awk|Dougherty, Dale and Robbins, Arnold|9781565922259\n1988|Pearson|The AWK Programming Language|Aho, Alfred V. and Kernighan, Brian W. and Weinberger, Peter J.|9780201079814\n2001|O'Reilly Media|Effective awk Programming (3rd Edition)|Robbins, Arnold|9780596000707\n2015|O'Reilly Media|Effective awk Programming: Universal Text Processing and Pattern Matching|Robbins, Arnold|9781491904619\n2018|Packt Publishing|Learning AWK Programming: A fast, and simple cutting-edge utility for text-processing on the Unix-like environment|Kalkhanda, Shiwang|9781788397087\n2018-03-26T00:00:01Z|Packt Publishing|Learning AWK Programming: A fast, and simple cutting-edge utility for text-processing on the Unix-like environment|Kalkhanda, Shiwang|9781788391030\n2013|CreateSpace Independent Publishing Platform|Hands-On Korn Shell and AWK Scripting: Learn Unix and Linux Programming Through Advanced Scripting Examples|Williams, Brian|9781492724049\n19970301|O'Reilly Media, Inc.|sed & awk|Dale Dougherty; Arnold Robbins|9781449396602\n1997|O'reilly Media|Effective Awk Programming|Arnold Robbins|9781578310005\n19970301|O'Reilly Media, Inc.|sed & awk|Dale Dougherty; Arnold Robbins|9781449301880\n20150303|O'Reilly Media, Inc.|Effective awk Programming|Arnold Robbins|9781491904961\n2000|Iuniverse Inc|Effective Awk Programming: A User's Guide For Gnu Awk, Edition 1.0.3|Arnold D. Robbins|9780595100347\n20150303|O'Reilly Media, Inc.|Effective awk Programming|Arnold Robbins|9781491904978\n2000|D D C Pub|Awk Programming (2 Days)|Sim Mcnally|9781562439811\n2011|Lulu.com|Gawk: Effective Awk Programming|Arnold Robbins|9781447550839\n20020612|O'Reilly Media, Inc.|sed and awk Pocket Reference|Arnold Robbins|9780596529024\n20020612|O'Reilly Media, Inc.|sed and awk Pocket Reference|Arnold Robbins|9780596552022\n1996|Specialized Systems Consultants|Effective Awk Programming: A User's Guide For Gnuawk|Arnold D. Robbins|9780916151881\n2013|Createspace Independent Publishing Platform|Unix Command Line And Awk Scripting: Harnessing The Power Of Unix And Linux Programming Environments|Dmitri Petrovic|9781492724315\n2013|Createspace Independent Publishing Platform|Advanced Unix Shell Scripting: How To Reduce Your Labor And Increase Your Effectiveness Through Mastery Of Unix Shell Scripting And Awk Programming|Praveen Puri|9781484076385", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1988|The awk programming language|10.1007/BF00054275|464|23|A. Aho and B. Kernighan and P. Weinberger|eae275046b909dec7a062a35862376c750e60463\n1979|Awk — a pattern scanning and processing language|10.1002/spe.4380090403|155|7|A. Aho and B. Kernighan and P. Weinberger|00ff20695a0b6734a0812593b2373cb929b50b8f\n2019|AWK and GNU Octave Programming Languages Integrated with Generic Mapping Tools for Geomorphological Analysis|10.35180/gse-2019-0020|41|0|Polina Lemenkova|a33b25d841b65b2b636e26300d6df6af1a86d29f\n1983|A walk through AWK|10.1145/988193.988201|34|0|L. Levy|7824109be5cdea9d5743cb9a4995a161030fc99e\n1996|A debugger and assertion checker for the Awk programming language|10.1109/SEEP.1996.534006|6|0|M. Auguston and S. Banerjee and M. Mamnani and G. Nabi and J. Reinfelds and U. Sarkans and I. Strnad|c3e0c030141740f5949525feeb173bd81f7f3236\n2005|From AWK to Google: Peter Weinberger Talks Search|10.1109/MSP.2005.123|1|0|L. McLaughlin|808ab018a01eac1ba2a8e60fccc6f1d58ed7f787\n1987|AWK — A Prototyping Language|10.1007/978-1-4612-4718-0_6|1|0|L. Levy|3dc3122a21edf010a1f44872b9cc730916f5171d\n1989|The awk programming language [Book Review]|10.1109/ms.1989.1105889|1|0|Brian and Kemighan and P. Weinberger|9e42b6a3b8e7a39465cb7172391139d07a42e7ca" }, "awl": { "title": "awl", "appeared": 2014, "type": "pl", "creators": [ "Zaven Muradyan" ], "website": "http://skepsi.me/awl/", "country": [ "United States" ], "originCommunity": [ "Zaven Muradyan" ], "githubRepo": { "firstCommit": 2014, "stars": 7, "forks": 2, "subscribers": 2, "created": 2014, "updated": 2021, "description": "Experimental Lispy mini-language", "issues": 0, "url": "https://github.com/voithos/awl" }, "repoStats": { "firstCommit": 2014, "commits": 185, "committers": 4, "files": 51 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8173123|Show HN: Awl, a toy Lisp language written in C and transpiled to JavaScript|2014-08-13 14:46:55 UTC|1407941215|voithos|1|8" }, "aws": { "title": "AWS", "appeared": 2006, "type": "cloud", "website": "https://aws.amazon.com/", "standsFor": "Amazon Web Services", "country": [ "United States" ], "originCommunity": [ "Amazon" ], "domainName": { "name": "aws.amazon.com" }, "wikipedia": { "related": [ "login", "azure", "redis", "mysql", "postgresql", "android", "google-cloud" ], "summary": "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.", "pageId": 1691376, "dailyPageViews": 2390, "created": 2005, "backlinksCount": 1102, "revisionCount": 1093, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Amazon_Web_Services" }, "linkedInSkill": { "2018": 251197, "id": "aws" }, "meetup": { "memberCount": 454966, "groupCount": 887, "url": "https://www.meetup.com/topics/aws" }, "twitter": "https://twitter.com/awscloud", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAmazon Web Services for Dummies|2013|Bernard Golden|24205551|3.83|76|7\nAWS Computing Basics for Linux|2012|Amazon Web Services|26504667|3.62|47|2" }, "axcess": { "title": "axcess", "appeared": 1983, "type": "pl", "reference": [ "https://www.scribd.com/doc/60469007/AXCESS-Programming-Language" ], "country": [ "United States" ], "originCommunity": [ "AMX Corporation" ], "centralPackageRepositoryCount": 0 }, "axiom-computer-algebra-system": { "title": "Axiom", "appeared": 1992, "type": "pl", "country": [ "Various" ], "originCommunity": [ "Independent group of people" ], "wikipedia": { "related": [ "fortran", "coq", "acl2", "emacs-editor", "aldor" ], "summary": "Axiom is a free, general-purpose computer algebra system. It consists of an interpreter environment, a compiler and a library, which defines a strongly typed, mathematically (mostly) correct type hierarchy.", "created": 2004, "backlinksCount": 98, "pageId": 487947, "revisionCount": 221, "dailyPageViews": 57, "appeared": 1965, "url": "https://en.wikipedia.org/wiki/Axiom_%28computer_algebra_system%29" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1979|Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems|10.1145/322108.322121|163|7|E. Clarke|ab700e484d9874228ae428fc2edaf89b6ca278f4\n1977|Programming language constructs for which it is impossible to obtain good hoare-like axiom systems|10.1145/512950.512952|52|1|E. Clarke|697fdb7fa9bed25e8fcb498b501697597f409cc7\n1984|A good Hoare axiom system for an ALGOL-like language|10.1145/800017.800538|20|0|Joseph Y. Halpern|3c678b7e2829a743f28feb356f21f6415716d006\n1992|Computation of the Jordan canonical form of a square matrix (using the Axiom programming language)|10.1145/143242.143295|10|1|I. Gil|7a72bdb20f9ea1e1ade90be6668d5abe067a70e0\n2016|Verifying safety critical task scheduling systems in PPTL axiom system|10.1007/s10878-014-9776-3|6|0|N. Zhang and Mengfei Yang and B. Gu and Zhenhua Duan and Cong Tian|f4e6fb0d23cdab55e02ce3cf7d310ad073850cd4\n1994|How to make AXIOM into a scratchpad|10.1145/190347.190357|5|0|R. Jenks and B. Trager|5aa0cc98cc623c61d77cd900dbacc21d921152a3" }, "axiom": { "title": "AXIOM", "appeared": 1992, "type": "pl", "documentation": [ "https://axm.dev/language.html" ], "reference": [ "https://semanticscholar.org/paper/5aa0cc98cc623c61d77cd900dbacc21d921152a3" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "summary": "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.", "backlinksCount": 1197, "pageId": 928, "dailyPageViews": 994, "created": 2001, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/Axiom" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Axiom", "hopl": "https://hopl.info/showlanguage.prx?exp=1673", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1979|Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems|10.1145/322108.322121|163|7|E. Clarke|ab700e484d9874228ae428fc2edaf89b6ca278f4\n1977|Programming language constructs for which it is impossible to obtain good hoare-like axiom systems|10.1145/512950.512952|52|1|E. Clarke|697fdb7fa9bed25e8fcb498b501697597f409cc7\n1984|A good Hoare axiom system for an ALGOL-like language|10.1145/800017.800538|20|0|Joseph Y. Halpern|3c678b7e2829a743f28feb356f21f6415716d006\n1992|Computation of the Jordan canonical form of a square matrix (using the Axiom programming language)|10.1145/143242.143295|10|1|I. Gil|7a72bdb20f9ea1e1ade90be6668d5abe067a70e0\n2016|Verifying safety critical task scheduling systems in PPTL axiom system|10.1007/s10878-014-9776-3|6|0|N. Zhang and Mengfei Yang and B. Gu and Zhenhua Duan and Cong Tian|f4e6fb0d23cdab55e02ce3cf7d310ad073850cd4\n1994|How to make AXIOM into a scratchpad|10.1145/190347.190357|5|0|R. Jenks and B. Trager|5aa0cc98cc623c61d77cd900dbacc21d921152a3" }, "axt-format": { "title": "axt-format", "appeared": 2004, "type": "textDataFormat", "description": "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.", "reference": [ "https://github.com/lastz/lastz/blob/a93880f640776e9c7427326f1401a429ad14f2fb/src/axt.c" ], "country": [ "United States" ], "originCommunity": [ "Penn State University" ], "example": [ "0 chr19 3001012 3001075 chr11 70568380 70568443 - 3500\nTCAGCTCATAAATCACCTCCTGCCACAAGCCTGGCCTGGTCCCAGGAGAGTGTCCAGGCTCAGA\nTCTGTTCATAAACCACCTGCCATGACAAGCCTGGCCTGTTCCCAAGACAATGTCCAGGCTCAGA" ], "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "aztec-c": { "title": "Aztec C", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Manx Software Systems" ], "wikipedia": { "related": [ "c" ], "summary": "Aztec C is a C compiler for MS-DOS, Apple II DOS 3.3 and ProDOS, Commodore 64, early Macintosh, CP/M-80, Amiga, and Atari ST.", "created": 2007, "backlinksCount": 11, "pageId": 14352493, "revisionCount": 84, "dailyPageViews": 11, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Aztec_C" }, "centralPackageRepositoryCount": 0 }, "azure": { "title": "Microsoft Azure", "appeared": 2010, "type": "cloud", "website": "https://azure.microsoft.com", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "domainName": { "name": "azure.microsoft.com" }, "wikipedia": { "related": [ "linux", "php", "python", "ftp", "mercurial", "json", "redis", "rest", "xml", "visual-studio-editor", "eclipse-editor", "aws", "google-cloud" ], "summary": "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.", "pageId": 19961416, "dailyPageViews": 1843, "created": 2008, "backlinksCount": 815, "revisionCount": 1288, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Microsoft_Azure" }, "linkedInSkill": { "2018": 144808, "id": "azure" }, "meetup": { "memberCount": 131967, "groupCount": 386, "url": "https://www.meetup.com/topics/microsoft-azure" }, "twitter": "https://twitter.com/azure", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Microsoft Azure Service Fabric||Haishi Bai|47765433|3.35|20|3" }, "b-line": { "title": "B-LINE", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/829159c49678d6768c01e4738af8e2c667fdd3ae" ], "country": [ "United States" ], "originCommunity": [ "Bell Telephone" ], "hopl": "https://hopl.info/showlanguage.prx?exp=315", "centralPackageRepositoryCount": 0, "isbndb": "" }, "b": { "title": "B", "appeared": 1969, "type": "pl", "creators": [ "Ken Thompson", "Dennis Ritchie" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "putchar" ] ], "wikipedia": { "example": [ "/* The following function will print a non-negative number, n, to\n the base b, where 2<=b<=10. This routine uses the fact that\n in the ASCII character set, the digits 0 to 9 have sequential\n code values. */\n\nprintn(n, b) {\n extrn putchar;\n auto a;\n\n if (a = n / b) /* assignment, not test for equality */\n printn(a, b); /* recursive */\n putchar(n % b + '0');\n}" ], "related": [ "abc", "bcpl", "pl-i", "c", "multics", "algol-58", "unix", "tmg", "yacc" ], "summary": "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.", "pageId": 4475, "dailyPageViews": 272, "created": 2001, "backlinksCount": 110, "revisionCount": 288, "appeared": 1969, "fileExtensions": [ "b" ], "url": "https://en.wikipedia.org/wiki/B_(programming_language)" }, "leachim6": { "filepath": "b/B.b", "fileExtensions": [ "b" ], "example": [ "main() {\n putchar ('Hell'); putchar ('o Wo'); putchar ('rld'); putchar ('*n');\n}\n" ], "id": "B" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:B", "hopl": "https://hopl.info/showlanguage.prx?exp=492", "fileType": "text", "wordRank": 124, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2005|Using B as a High Level Programming Language in an Industrial Project: Roissy VAL|10.1007/11415787_20|120|6|Frédéric Badeau and Arnaud Amelot|96cacd0917d376c0a63a060ed78c20a9a3220091\n2002|New approach to pharmacophore mapping and QSAR analysis using inductive logic programming. Application to thermolysin inhibitors and glycogen phosphorylase B inhibitors.|10.1021/JM0155244|49|6|N. Marchand-Geneste and K. Watson and B. Alsberg and R. King|477a1ae7e98ce12366e059e619621adcdbc74057\n1982|An overview of the B programming language or B without tears|10.1145/988164.988169|8|0|L. Geurts|83db737c7cc1f733358e0dedd3eac7763d1d0bd9" }, "b3-ir": { "title": "B3 IR", "appeared": 2016, "type": "ir", "description": "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.", "website": "https://webkit.org/docs/b3/intermediate-representation.html", "originCommunity": [ "Apple" ], "compilesTo": [ "x86-64-isa", "arm" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "b32-business-basic": { "title": "B32 Business Basic", "appeared": 1986, "type": "pl", "country": [ "New Zealand" ], "originCommunity": [ "B32 Software" ], "wikipedia": { "related": [ "data-general-business-basic", "unix" ], "summary": "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.", "created": 2004, "backlinksCount": 9, "pageId": 649437, "revisionCount": 12, "dailyPageViews": 4, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/B32_Business_Basic" }, "centralPackageRepositoryCount": 0 }, "b4tran": { "title": "B4Tran", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d9ee7619863c6d8050371ee82fd273ad02e5a0cc" ], "country": [ "United States" ], "originCommunity": [ "University of California" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5095", "centralPackageRepositoryCount": 0 }, "babel": { "title": "BABEL", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/68794aaac6109aef1a841dd4eb3ee45b93784583" ], "country": [ "Spain and Germany" ], "originCommunity": [ "University of Münster", "Universidad Politécnica de Madrid" ], "hasComments": { "example": "", "value": true }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Babel", "hopl": "https://hopl.info/showlanguage.prx?exp=1537", "centralPackageRepositoryCount": 0, "isbndb": "" }, "baby-modula-3": { "title": "Baby modula-3", "appeared": 1993, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "related": [ "modula-3", "ada", "c" ], "summary": "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.", "created": 2018, "backlinksCount": 2, "pageId": 13603363, "revisionCount": 1, "dailyPageViews": 1, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Baby_modula-3" }, "centralPackageRepositoryCount": 0 }, "babylonian-numerals": { "title": "Babylonian numerals", "appeared": -2000, "type": "numeralSystem", "description": "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.", "wikipedia": { "summary": "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).", "backlinksCount": 186, "pageId": 152323, "dailyPageViews": 210, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Babylonian_numerals" } }, "back": { "title": "BACK", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c55321572b3f757b5e8a11ffd0fc871304aba62d" ], "country": [ "Germany" ], "originCommunity": [ "Technical University Berlin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2320", "wordRank": 103, "centralPackageRepositoryCount": 0 }, "badlanguage": { "title": "badlanguage", "appeared": 2017, "type": "pl", "creators": [ "Martin Capodici" ], "country": [ "Australia" ], "originCommunity": [ "Martin Capodici" ], "githubRepo": { "firstCommit": 2017, "stars": 28, "forks": 1, "subscribers": 1, "created": 2017, "updated": 2021, "description": "A lisp-looking language with interpreter and compiler to JS", "issues": 0, "url": "https://github.com/mcapodici/badlanguage" }, "repoStats": { "firstCommit": 2017, "commits": 3, "committers": 2, "files": 19 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n16918315|Show HN: Bad Language: A lisp-looking language with interpreter and JS compiler|2018-04-25 02:46:53 UTC|1524624413|quickthrower2|2|6" }, "bag-format": { "title": "bag-format", "appeared": 2010, "type": "binaryDataFormat", "description": "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.", "website": "http://wiki.ros.org/Bags", "reference": [ "http://wiki.ros.org/Bags/Format" ], "fileExtensions": [ "bag" ], "country": [ "United States" ], "originCommunity": [ "Open Robotics" ], "hasBooleans": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true } }, "balanced-ternary-notation": { "title": "Balanced ternary", "appeared": 1544, "type": "notation", "wikipedia": { "summary": "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.", "backlinksCount": 160, "pageId": 376757, "dailyPageViews": 72, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/Balanced_ternary" } }, "balg": { "title": "BALG", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f9ff034f17aaa88ae42e8a258982265e4af29d4b" ], "country": [ "Germany" ], "originCommunity": [ "Karlsruhe Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6523", "centralPackageRepositoryCount": 0 }, "balgol": { "title": "BALGOL", "appeared": 1959, "type": "pl", "creators": [ "Bob Barton" ], "reference": [ "https://datatron.blogspot.com/2018/08/balgol-burroughs-algebraic-compiler.html", "https://www.digm.com/UNITE/2019/2019-Origins-Burroughs-Algol.pdf" ], "originCommunity": [ "Burroughs" ], "influencedBy": [ "algol-58", "fortran" ], "hasIntegers": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasLists": { "example": "ARRAY MONTHDAYS(12) = (31,28,31,30,31,30,31,31,30,31,30,31)$", "value": true }, "hasFunctions": { "example": "FUNCTION TORADS(DEGREES) = DEGREES . 3.1415926/180$", "value": true }, "hasExpressions": { "example": "ALPHA + BETA / GAMMA", "value": true }, "hasAssignment": { "example": "ALPHA = BETA = GAMMA = 2DELTA + 1$", "value": true }, "hasConditionals": { "example": "EITHER IF A > B$ FWD = 1$ OTHERWISE$ FWD = 0$", "value": true }, "example": [ "INTEGER I..., J..., K..., L..., M..., N...$\nBOOLEAN KEEP, LAST$\nREAL MAT..., JOULES$\nREAL OTHERWISE$\nFUNCTION TORADS(DEGREES) = DEGREES . 3.1415926/180$\nFUNCTION PYTHAGOREAN(A, B) = SQRT(A*2 + B*2)$\nFOR I = 1, 3, 5, 7, 11, (13, 7, 99), 101, (103, 1, 125)$\n A(I) = I$\n\nUNTIL A > 125 OR OUTTAHERE$\n BEGIN\n OUTTAHERE = A EQL 77$\n A = A + 3\n END$" ] }, "balinda-lisp": { "title": "BaLinda Lisp", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/78f3cad4e39ad2ea9fce95a3a5646aaf4bd5bdf5" ], "country": [ "Singapore" ], "originCommunity": [ "National University of Singapore" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2786", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ballerina-central-pm": { "title": "ballerina-central-pm", "appeared": 2015, "type": "packageManager", "country": [ "United States" ], "originCommunity": [ "WSO2" ], "packageRepository": [ "https://central.ballerina.io/" ], "packageCount": 105, "forLanguages": [ "ballerina" ] }, "ballerina": { "title": "Ballerina", "appeared": 2015, "type": "pl", "creators": [ "Sanjiva Weerawarana", "James Clark", "Sameera Jayasoma", "Hasitha Aravinda", "Srinath Perera", "Frank Leymann" ], "website": "http://ballerina.io/", "webRepl": [ "https://play.ballerina.io/" ], "documentation": [ "https://ballerina.io/learn/" ], "country": [ "United States" ], "originCommunity": [ "WSO2" ], "domainName": { "registered": 2017, "awisRank": { "2022": 898947 }, "name": "ballerina.io" }, "hasComments": { "example": "// A comment", "value": true }, "hasImports": { "example": "import ballerina/http;\nimport ballerina/io;", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "io:println" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2014, "stars": 3093, "forks": 692, "subscribers": 169, "created": 2016, "updated": 2022, "description": "The Ballerina Programming Language", "issues": 1709, "url": "https://github.com/ballerina-platform/ballerina-lang" }, "repoStats": { "firstCommit": 2014, "commits": 126307, "committers": 698, "files": 20266 }, "wikipedia": { "example": [ "// The simplest hello world REST API\n// To run it:\n// ballerina run demo.bal\n// To invoke:\n// curl localhost:9090/hello/hi\n\nimport ballerina/http;\n\nservice hello bind {port:9090} {\n hi (endpoint caller, http:Request request) {\n http:Response res;\n res.setTextPayload(\"Hello World!\\n\");\n _ = caller->respond(res);\n }\n}" ], "related": [ "java", "go", "rust" ], "summary": "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.", "pageId": 57629994, "created": 2018, "backlinksCount": 12, "revisionCount": 42, "dailyPageViews": 37, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/Ballerina_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "bal" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.ballerina", "repos": 1483, "id": "Ballerina" }, "githubBigQuery": { "repos": 22, "users": 21, "id": "Ballerina" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 7, "commitCount": 58, "sampleCount": 5, "example": [ "import ballerina.lang.system;\n\nfunction main (string[] args) {\n system:println(\"Hello, World!\");\n}\n\n" ], "url": "https://github.com/ballerina-platform/ballerina-grammar" }, "languageServerProtocolProject": [ "https://github.com/ballerina-platform/ballerina-lang/tree/master/language-server\nwrittenIn java" ], "leachim6": { "filepath": "b/Ballerina.bal", "fileExtensions": [ "bal" ], "example": [ "import ballerina/io;\n\npublic function main() {\n io:println(\"Hello World\");\n}\n" ], "id": "Ballerina" }, "packageRepository": [ "https://central.ballerina.io/" ], "twitter": "https://twitter.com/ballerinalang", "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2020|Apress|Beginning Ballerina Programming: From Novice to Professional|Fernando, Anjana and Warusawithana, Lakmal|9781484251393\n2020-02-25T00:00:01Z|Apress|Beginning Ballerina Programming: From Novice to Professional|Fernando, Anjana and Warusawithana, Lakmal|9781484251386", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Bringing Middleware to Everyday Programmers with Ballerina|10.1007/978-3-319-98648-7_2|3|0|S. Weerawarana and Chathura C. Ekanayake and S. Perera and F. Leymann|03c90e1e79a69449585a0799f5be78b4d9744704" }, "balm": { "title": "BALM", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d5f03da36b96c98aa4c115113e2dc17bb980d451" ], "country": [ "United States" ], "originCommunity": [ "New York University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=493", "centralPackageRepositoryCount": 0 }, "balsa": { "title": "BALSA", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/152842adf3d5045beef3732cc9e05e843d4cf509" ], "country": [ "England" ], "originCommunity": [ "University of Manchester" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4986", "centralPackageRepositoryCount": 0 }, "baltazar": { "title": "baltazar", "appeared": 1993, "type": "pl", "description": "Czech visual educational language, for MS-DOS only, created by author of Baltík", "reference": [ "https://cs.wikipedia.org/wiki/Baltazar" ], "country": [ "The Czech Republic" ], "nativeLanguage": "Czech", "originCommunity": [ "SGP Systems" ], "semanticScholar": "" }, "baltik": { "title": "Baltík", "appeared": 1996, "type": "pl", "reference": [ "http://www.sgpsys.com/doc/b4/en-US/" ], "country": [ "The Czech Republic" ], "nativeLanguage": "Czech", "originCommunity": [ "SGP Systems" ], "visualParadigm": true }, "bam-format": { "title": "Binary Alignment Map", "appeared": 2009, "type": "binaryDataFormat", "description": "BAM is the compressed binary representation of SAM (Sequence Alignment Map). BAM is in compressed BGZF format.", "aka": [ "BAM" ], "country": [ "Various" ], "originCommunity": [ "Samtools" ], "wikipedia": { "related": [ "fastq-format", "sam-format", "cram-format" ], "summary": "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.", "pageId": 51385546, "created": 2016, "backlinksCount": 11, "revisionCount": 21, "dailyPageViews": 13, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Binary_Alignment_Map" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "bamboo": { "title": "bamboo", "appeared": 2016, "type": "pl", "creators": [ "Yoichi Hirai" ], "description": "Bamboo is a programming language for Ethereum contracts.", "githubRepo": { "firstCommit": 2016, "stars": 316, "forks": 42, "subscribers": 34, "created": 2016, "updated": 2022, "description": "Bamboo see https://github.com/cornellblockchain/bamboo", "issues": 48, "url": "https://github.com/pirapira/bamboo" }, "repoStats": { "firstCommit": 2016, "commits": 939, "committers": 12, "files": 167 }, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Hydrolysis of Glucose from Bamboo with Micro Controller PID type Arduino UNO and Fuzzy Method|10.2991/ICST-18.2018.8|1|0|N. K. Sari and D. Ernawati and I. Purbasari and B. Rahmat|f9895f90e6161b9d3ae0e8c291b3f560481a7967" }, "bancstar-programming-language": { "title": "BANCStar", "appeared": 1996, "type": "pl", "country": [ "United States" ], "originCommunity": [ "National Financial Computer Services, Inc or Broadway & Seymour" ], "wikipedia": { "example": [ "8607,,,1\n11547,15475,22002,22002\n1316,1629,1,1649\n3001,1316,3,30078\n11528,22052,22002,22002\n9301,0,1528,1528\n31568,10001,800,107\n8560,,,1568\n8550,210,,\n3001,,,\n3100,1316,3,30089\n11547,15475,22002,22002\n3001,1316,3,30089\n3001,1317,3,10000\n8400,,,\n8550,700,801,\n3001,,,\n9301,0,522,522\n3000,1284,3,10001\n8500,,3,\n8500,,5,\n1547,,1,-2301" ], "summary": "BANCStar is a specialist computer programming language for financial applications. The language is an internal language for the National Financial Computer Services, Inc (later Broadway & Seymour) BANCStar application, which is software to automate the operations of a bank branch.The language is a fixed format four integer command language NFCS internally referred to as \"Screen Code\". It resembles an esoteric programming language; so much so that it has sometimes been mistaken for a joke language. Conceptually the BANCStar application executed \"Screen Code\" much like a primitive Virtual Machine. In the 5.1c release the only legal characters are the numerals 0–9, the comma, the minus sign and the carriage return. However, it is used in real commercial applications. It was originally intended as generated code from a user interface-building tool — similar to bytecode rendered in ASCII — but due to limitations in the tool, it became a directly programmed language in itself.The BANCStar 10.0 release changed the \"Screen Code\" format to binary, and rearranged the numeric codes into an opcode with a variable number of parameter integers. The 10.0 opcode encoded a bit mapped length value that indicated the length of the command in words.", "created": 2007, "backlinksCount": 9, "pageId": 14938248, "revisionCount": 38, "dailyPageViews": 7, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/BANCStar_programming_language" }, "centralPackageRepositoryCount": 0 }, "bare": { "title": "BARE", "appeared": 2020, "type": "idl", "description": "BARE is a simple binary representation for structured application data.", "website": "https://baremessages.org", "country": [ "Various" ], "originCommunity": [ "Internet Engineering Task Force" ], "domainName": { "registered": 2020, "name": "baremessages.org" }, "keywords": [ "type", "enum", "u8", "u16", "u32", "u64", "uint", "i8", "i16", "i32", "i64", "int", "f32", "f64", "bool", "void", "data", "string", "optional", "map" ], "example": [ "type PublicKey data[128]\ntype Time str # ISO 8601\n\ntype Department enum {\n ACCOUNTING\n ADMINISTRATION\n CUSTOMER_SERVICE\n DEVELOPMENT\n\n # Reserved for the CEO\n JSMITH = 99\n}\n\ntype Address list[4] # street, city, state, country\n\ntype Customer struct {\n name: str\n email: str\n address: Address\n orders: list\n metadata: map\n}\n\ntype Employee struct {\n name: str\n email: str\n address: Address\n department: Department\n hireDate: Time\n publicKey: optional\n metadata: map\n}\n\ntype TerminatedEmployee void\n\ntype Person union {Customer | Employee | TerminatedEmployee}" ], "pygmentsHighlighter": { "filename": "bare.py", "fileExtensions": [ "bare" ], "id": "BARE" } }, "barrel": { "title": "Barrel", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4be56ef09cf39ac55bcf78169c49bd92d6449934" ], "country": [ "United States" ], "originCommunity": [ "GTS Computer Systems Inc", "University of Alabama" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4731", "wordRank": 8375, "centralPackageRepositoryCount": 0 }, "bartok": { "title": "Bartok", "appeared": 2001, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Bartok_(compiler)" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3712", "centralPackageRepositoryCount": 0 }, "base64": { "title": "Base64", "appeared": 1987, "type": "textEncodingFormat", "country": [ "United States" ], "originCommunity": [ "RSA Laboratories" ], "wikipedia": { "summary": "In computer science, Base64 is a group of binary-to-text encoding schemes that represent binary data in an ASCII string format by translating it into a radix-64 representation. The term Base64 originates from a specific MIME content transfer encoding. Each Base64 digit represents exactly 6 bits of data. Three 8-bit bytes (i.e., a total of 24 bits) can therefore be represented by four 6-bit Base64 digits. Common to all binary-to-text encoding schemes, Base64 is designed to carry data stored in binary formats across channels that only reliably support text content. Base64 is particularly prevalent on the World Wide Web where its uses include the ability to embed image files or other binary assets inside textual assets such as HTML and CSS files.", "backlinksCount": 381, "pageId": 215241, "dailyPageViews": 2402, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/Base64" }, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|Base64 Encoding on Heterogeneous Computing Platforms|10.1109/ASAP.2019.00014|1|0|Zheming Jin and H. Finkel|748ab7705c599ab009e9e2fc84970d5afbee677a" }, "baseball": { "title": "BASEBALL", "appeared": 1961, "type": "pl", "reference": [ "https://semanticscholar.org/paper/89d025804988944d6fa4e95f49bff011b33d1418" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2797", "wordRank": 2295, "centralPackageRepositoryCount": 0 }, "basel": { "title": "BASEL", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f82211423d9cbf034d87598a93d9b4cae147ef34" ], "country": [ "United States" ], "originCommunity": [ "ADR or Computer Associates" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2998", "centralPackageRepositoryCount": 0, "isbndb": "" }, "bash": { "title": "Bash", "appeared": 1989, "type": "pl", "creators": [ "Brian Fox" ], "website": "https://www.gnu.org/software/bash/", "documentation": [ "https://www.gnu.org/savannah-checkouts/gnu/bash/manual/bash.html", "https://devdocs.io/bash/" ], "aka": [ "Shell" ], "country": [ "United States" ], "originCommunity": [ "GNU" ], "hasVariableSubstitutionSyntax": { "example": "STR=\"Hello World!\"\necho $STR", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasUnitsOfMeasure": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasIntegers": { "example": "PLDB=80766866", "value": true }, "hasHereDocs": { "example": "cat < output.txt", "value": true }, "hasPrintDebugging": { "example": "echo \"Hello World\"", "value": true }, "hasAssignment": { "example": "FOO=\"bar\"", "value": true }, "hasImports": { "example": "source ./bash.sh", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "echo" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "if", "then", "do", "else", "elif", "while", "until", "for", "in", "esac", "fi", "fin", "fil", "done", "exit", "set", "unset", "export", "function" ], "wikipedia": { "example": [ "cd \"$SOMEWHERE\" && ./do_something || echo \"An error occurred\" >&2" ], "related": [ "c", "gettext", "bourne-shell", "login", "linux", "almquist-shell", "android", "regex", "perl", "awk", "unix", "emacs-editor" ], "summary": "Bash is a Unix shell and command language written by Brian Fox for the GNU Project as a free software replacement for the Bourne shell. First released in 1989, it has been distributed widely as the default login shell for most Linux distributions and Apple's macOS (formerly OS X). A version is also available for Windows 10. Bash is a command processor that typically runs in a text window, where the user types commands that cause actions. Bash can also read and execute commands from a file, called a script. Like all Unix shells, it supports filename globbing (wildcard matching), piping, here documents, command substitution, variables, and control structures for condition-testing and iteration. The keywords, syntax and other basic features of the language are all copied from sh. Other features, e.g., history, are copied from csh and ksh. Bash is a POSIX-compliant shell, but with a number of extensions. The shell's name is an acronym for Bourne-again shell, punning on the name of the Bourne shell that it replaces and on the term \"born again\" that denotes spiritual rebirth in contemporary American Christianity. A security hole in Bash dating from version 1.03 (August 1989), dubbed Shellshock, was discovered in early September 2014 and quickly led to a range of attacks across the Internet. Patches to fix the bugs were made available soon after the bugs were identified, but not all computers have been updated.", "pageId": 4547, "dailyPageViews": 1271, "created": 2001, "backlinksCount": 1835, "revisionCount": 1360, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Bash_(Unix_shell)" }, "githubLanguage": { "fileExtensions": [ "sh", "bash", "bats", "cgi", "command", "env", "fcgi", "ksh", "shin", "tmux", "tool", "zsh", "zsh-theme" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nkaldi-asr kaldi https://github.com/kaldi-asr.png https://github.com/kaldi-asr/kaldi Shell #89e051 7031 3224 623 \"This is the official location of the Kaldi project.\"\ndylanaraps pure-bash-bible https://github.com/dylanaraps.png https://github.com/dylanaraps/pure-bash-bible Shell #89e051 14224 1102 899 \"📖 A collection of pure bash alternatives to external processes.\"\npi-hole pi-hole https://github.com/pi-hole.png https://github.com/pi-hole/pi-hole Shell #89e051 17711 1224 847 \"A black hole for Internet advertisements\"\ntrimstray nginx-admins-handbook https://github.com/trimstray.png https://github.com/trimstray/nginx-admins-handbook Shell #89e051 9683 677 986 \"How to improve NGINX performance, security, and other important things; @ssllabs A+ 100%, @mozilla A+ 120/100.\"\nv1s1t0r1sh3r3 airgeddon https://github.com/v1s1t0r1sh3r3.png https://github.com/v1s1t0r1sh3r3/airgeddon Shell #89e051 2052 515 286 \"This is a multi-use bash script for Linux systems to audit wireless networks.\"\nesc0rtd3w wifi-hacker https://github.com/esc0rtd3w.png https://github.com/esc0rtd3w/wifi-hacker Shell #89e051 811 283 420 \"Shell Script For Attacking Wireless Connections Using Built-In Kali Tools. Supports All Securities (WEP, WPS, WPA, WPA2)\"\ntoniblyx my-arsenal-of-aws-security-tools https://github.com/toniblyx.png https://github.com/toniblyx/my-arsenal-of-aws-security-tools Shell #89e051 2624 378 440 \"List of open source tools for AWS security: defensive, offensive, auditing, DFIR, etc.\"\nrobbyrussell oh-my-zsh https://github.com/robbyrussell.png https://github.com/robbyrussell/oh-my-zsh Shell #89e051 94524 17446 1679 \"🙃 A delightful community-driven (with 1,300+ contributors) framework for managing your zsh configuration. Includes 200+ optional plugins (rails, git, OSX, hub, capistrano, brew, ant, php, python, etc), over 140 themes to spice up your morning, and an auto-update tool so that makes it easy to keep up with the latest updates from the community.\"\ntermux termux-packages https://github.com/termux.png https://github.com/termux/termux-packages Shell #89e051 2485 827 109 \"Android terminal and Linux environment - packages repository.\"\nwmnnd nginx-certbot https://github.com/wmnnd.png https://github.com/wmnnd/nginx-certbot Shell #89e051 579 208 127 \"Boilerplate configuration for nginx and certbot with docker-compose\"\ntomav docker-mailserver https://github.com/tomav.png https://github.com/tomav/docker-mailserver Shell #89e051 4463 747 140 \"A fullstack but simple mailserver (smtp, imap, antispam, antivirus, ssl...) using Docker.\"\ndotnet core https://github.com/dotnet.png https://github.com/dotnet/core Shell #89e051 11705 2542 339 \"Home repository for .NET Core\"\nthelinuxchoice saycheese https://github.com/thelinuxchoice.png https://github.com/thelinuxchoice/saycheese Shell #89e051 152 105 45 \"Grab target's webcam shots by link\"\nhashicorp vault-helm https://github.com/hashicorp.png https://github.com/hashicorp/vault-helm Shell #89e051 108 34 106 \"Helm chart to install Vault and other associated components.\"\nNeilpang acme.sh https://github.com/Neilpang.png https://github.com/Neilpang/acme.sh Shell #89e051 14044 1787 406 \"A pure Unix shell script implementing ACME client protocol\"\nmathiasbynens dotfiles https://github.com/mathiasbynens.png https://github.com/mathiasbynens/dotfiles Shell #89e051 22044 7799 200 \"🔧 .files, including ~/.macos — sensible hacker defaults for macOS\"\ndennyzhang cheatsheet-kubernetes-A4 https://github.com/dennyzhang.png https://github.com/dennyzhang/cheatsheet-kubernetes-A4 Shell #89e051 436 246 62 \"📖 Kubernetes CheatSheets In A4\"\nromkatv powerlevel10k https://github.com/romkatv.png https://github.com/romkatv/powerlevel10k Shell #89e051 1514 72 357 \"A fast reimplementation of Powerlevel9k ZSH theme\"\nskywind3000 awesome-cheatsheets https://github.com/skywind3000.png https://github.com/skywind3000/awesome-cheatsheets Shell #89e051 4926 917 146 \"超级速查表 - 编程语言、框架和开发工具的速查表，单个文件包含一切你需要知道的东西 ⚡️\"\nfouldsy azure-mol-samples https://github.com/fouldsy.png https://github.com/fouldsy/azure-mol-samples Shell #89e051 357 131 39 \"Supporting resources for \"\"Learn Azure in a Month of Lunches\"\" (Manning Publications)\"\nvulhub vulhub https://github.com/vulhub.png https://github.com/vulhub/vulhub Shell #89e051 4211 1485 250 \"Pre-Built Vulnerable Environments Based on Docker-Compose\"\nnvm-sh nvm https://github.com/nvm-sh.png https://github.com/nvm-sh/nvm Shell #89e051 36851 3480 616 \"Node Version Manager - POSIX-compliant bash script to manage multiple active node.js versions\"\neaszlab kubeasz https://github.com/easzlab.png https://github.com/easzlab/kubeasz Shell #89e051 3840 1573 407 使用Ansible脚本安装K8S集群，介绍组件交互原理，方便直接，不受国内网络环境影响\ndylanaraps neofetch https://github.com/dylanaraps.png https://github.com/dylanaraps/neofetch Shell #89e051 6957 441 186 \"🖼️ A command-line system information tool written in bash 3.2+\"\nashishb android-security-awesome https://github.com/ashishb.png https://github.com/ashishb/android-security-awesome Shell #89e051 4067 1026 65 \"A collection of android security related resources\"", "trendingProjectsCount": 26, "type": "programming", "filenames": [ ".bash_aliases", ".bash_history", ".bash_logout", ".bash_profile", ".bashrc", ".cshrc", ".env", ".env.example", ".flaskenv", ".kshrc", ".login", ".profile", ".zlogin", ".zlogout", ".zprofile", ".zshenv", ".zshrc", "9fs", "PKGBUILD", "bash_aliases", "bash_logout", "bash_profile", "bashrc", "cshrc", "gradlew", "kshrc", "login", "man", "profile", "zlogin", "zlogout", "zprofile", "zshenv", "zshrc" ], "interpreters": [ "ash", "bash", "dash", "ksh", "mksh", "pdksh", "rc", "sh", "zsh" ], "aceMode": "sh", "codemirrorMode": "shell", "codemirrorMimeType": "text/x-sh", "tmScope": "source.shell", "aliases": [ "sh", "shell-script", "bash", "zsh" ], "repos": 1579442, "id": "Shell" }, "githubBigQuery": { "repos": 640005, "users": 358317, "id": "Shell" }, "monaco": "shell", "pygmentsHighlighter": { "filename": "shell.py", "fileExtensions": [ "sh", "ksh", "bash", "ebuild", "eclass", "exheres-0", "exlib", "zsh", ".bashrc", "bashrc", ".bash_*", "bash_*", "zshrc", ".zshrc", ".kshrc", "kshrc", "PKGBUILD" ], "id": "Bash" }, "linguistGrammarRepo": { "sampleCount": 17, "example": [ "#!/bin/sh\necho \"sh\"\n" ], "url": "https://github.com/atom/language-shellscript" }, "languageServerProtocolProject": [ "https://github.com/mads-hartmann/bash-language-server\nwrittenIn typescript" ], "leachim6": { "filepath": "s/Shell.sh", "fileExtensions": [ "sh" ], "example": [ "#!/bin/sh\necho \"Hello World\"\n" ], "id": "Shell" }, "quineRelay": "bash", "rijuRepl": { "example": [ "echo \"Hello, world!\"\n" ], "description": "Unix shell and command language written by Brian Fox for the GNU Project as a free software replacement for the Bourne shell", "fileExtensions": [ "bash", "sh" ], "gitRepo": "https://savannah.gnu.org/projects/bash/", "id": "https://riju.codes/bash" }, "tryItOnline": "bash", "indeedJobs": { "2022": 4774, "query": "bash developer" }, "stackOverflowSurvey": { "2021": { "users": 22385, "medianSalary": 71340, "fans": 14043, "percentageUsing": 0.27 } }, "subreddit": [ { "memberCount": { "2022": 54171 }, "url": "https://reddit.com/r/bash" } ], "tiobe": { "id": "Bash" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1851", "packageRepository": [ "http://www.bpkg.sh/" ], "ubuntuPackage": "bash", "jupyterKernel": [ "https://github.com/takluyver/bash_kernel" ], "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n1998|O'Reilly Media|Learning the bash Shell, 2nd Edition|Newham, Cameron and Rosenblatt, Bill|9781565923478\n2004|Sams|Linux Shell Scripting with Bash|Burtch, Ken O.|9780672326424\n2019|In Easy Steps Limited|Bash in easy steps|McGrath, Mike|9781840788099\n2018|Packt Publishing|Mastering Linux Shell Scripting: A practical guide to Linux command-line, Bash scripting, and Shell programming, 2nd Edition|Ebrahim, Mokhtar and Mallett, Andrew|9781788990554\n2015|CreateSpace Independent Publishing Platform|Shell Scripting: How to Automate Command Line Tasks Using Bash Scripting and Shell Programming|Cannon, Jaosn|9781517380434\n2005|O'Reilly Media|Learning the bash Shell: Unix Shell Programming (In a Nutshell (O'Reilly))|Newham, Cameron|9780596009656\n2014|CreateSpace Independent Publishing Platform|Command Line Kung Fu: Bash Scripting Tricks, Linux Shell Programming Tips, and Bash One-liners|Cannon, Jason|9781499222036\n2004|Apress|From Bash to Z Shell: Conquering the Command Line|Kiddle, Oliver and Stephenson, Peter and Peek, Jerry|9781590593769\n2018|Packt Publishing|Mastering Linux Shell Scripting,: A practical guide to Linux command-line, Bash scripting, and Shell programming, 2nd Edition|Ebrahim, Mokhtar and Mallett, Andrew|9781788990158\n2015|Apress|Pro Bash Programming, Second Edition: Scripting the GNU/Linux Shell|Johnson, Chris and Varma, Jayant|9781484201220\n2017-06-21T00:00:01Z|Packt Publishing|Mastering Bash: A Step-by-Step Guide to working with Bash Programming and Shell Scripting|Zarrelli, Giorgio|9781784396879\n2015|In Easy Steps Ltd|Unix in easy steps: Commanding the BASH shell|McGrath, Mike|9781840786736\n2015|Apress|Pro Bash Programming, Second Edition: Scripting the GNU/Linux Shell|Johnson, Chris and Varma, Jayant|9781484201213\n2009|Apress|Pro Bash Programming: Scripting the Linux Shell (Expert's Voice in Linux)|Johnson, Chris|9781430219972\n2016|CreateSpace Independent Publishing Platform|Shell Programming and Bash Scripting: Ultimate Beginners Guide Book|Collins, Robert|9781540637703\n2015|CreateSpace Independent Publishing Platform|Linux Command Line: FAST and EASY!: Linux Commands, Bash Scripting Tricks, Linux Shell Programming Tips and Bash One-Liners|Gimson, Matthew|9781519127044\n2019-12-09T00:00:01Z|Independently published|LINUX Command-Line for Beginners: A Comprehensive Step-by-Step Starting Guide to Learn Linux from Scratch to Bash Scripting and Shell Programming|Mach, Dylan|9781673712551\n2017|CreateSpace Independent Publishing Platform|Shell Programming: Bash Scripting from First Steps To Confident User|Johnson, Sean|9781544208978\n20070524|O'Reilly Media, Inc.|bash Cookbook|Carl Albing|9780596554705\n20070524|O'Reilly Media, Inc.|bash Cookbook|Carl Albing|9780596516031\n21-06-2017|Packt Publishing|Mastering Bash|Giorgio Zarrelli|9781784391980\n20091205|Springer Nature|Pro Bash Programming|Chris Johnson|9781430219989\n20160217|O'Reilly Media, Inc.|Bash Pocket Reference|Arnold Robbins|9781491941560\n03/2014|O'Reilly Media, Inc.|Bash kurz & gut|Günther, Karsten|9783955617653\n20160217|O'Reilly Media, Inc.|Bash Pocket Reference|Arnold Robbins|9781491941546\n03/2014|O'Reilly Media, Inc.|Bash kurz & gut|Günther, Karsten|9783955617660\n28-09-2018|Packt Publishing|Bash Quick Start Guide|Tom Ryder|9781789534085\n20050329|O'Reilly Media, Inc.|Learning the bash Shell|Cameron Newham|9780596519063\n20050329|O'Reilly Media, Inc.|Learning the bash Shell|Cameron Newham|9780596555009\n20040129|Pearson Technology Group|Linux Shell Scripting with Bash|Ken O. Burtch|9780768663495\n||Bash Scripting, Linux And Shell Programming Complete Guide|Frahaan Hussain|9781838984595\n20111215|De Gruyter|Eine praktische Einführung in die Informatik mit Bash und Python|Tobias Häberlein|9783486714456\n2015,[2015]|Apress,,Springer Science+Business Media New York|Pro Bash programming,UNIX Shells,UNIX (Computer file),UNIX (Computer file),UNIX Shells|Johnson, Chris F. A. and Varma, Jayant|", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2021|Explainable Natural Language to Bash Translation using Abstract Syntax Tree|10.18653/v1/2021.conll-1.20|3|0|Shikhar Bharadwaj and S. Shevade|6fe61d77b8a4a090899867b79e32efd658f848e7" }, "basic-11": { "title": "BASIC-11", "appeared": 1976, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "related": [ "basic" ], "summary": "BASIC-11 was a dialect of the basic language for PDP-11 operating systems such as RSX-11, RT-11, TSX and TSX-Plus. It was a classic BASIC in that it used line numbers, supported line number editing, and classic function syntax. It provided extended support for user-defined functions, external sequential disk files, and linking with assembler language modules for device support and operating system interfaces.", "created": 2006, "backlinksCount": 6, "pageId": 5370062, "revisionCount": 22, "dailyPageViews": 2, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/BASIC-11" }, "centralPackageRepositoryCount": 0 }, "basic-256": { "title": "Basic-256", "appeared": 2007, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Shawnee State University" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "basic" ], "summary": "Basic-256 is a project to learn the basics of computer programming. The project started in 2007 inspired by the article “Why Johnny can't code” by David Brin. Its main focus is to provide a simple and comprehensive environment for middle/high school students to learn the basics of computer programming. Basic-256 is a simple version of BASIC, the code editor, text output window and graphics editor window are all visible in the same screen. However the successive versions haven been adding new features, namely: Files (Eof, Size)- Version 9.4d Mouse events - Version 9.4d Sprites handling - Version 0.9.6n Database functions - Version 0.9.6y Network - Version 0.9.6.31 Real Functions and Subroutines - Version 0.9.9.1Complete documentation is available in English, Russian, Dutch, Spanish and Portuguese.", "created": 2010, "backlinksCount": 14, "pageId": 29687615, "revisionCount": 55, "dailyPageViews": 9, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/Basic-256" }, "leachim6": { "filepath": "b/BASIC 256.kbs", "example": [ "Print \"Hello World\"\n" ], "id": "BASIC 256" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "basic-ap": { "title": "BASIC A+", "appeared": 1983, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Optimized Systems Software" ], "wikipedia": { "related": [ "optimized-systems-software", "atari-basic", "turbo-basic-xl" ], "summary": "BASIC A+ was developed by Optimized Systems Software of Cupertino, California, United States, to provide the Atari 8-bit family with an extended BASIC compatible with, but faster than, the simpler ROM-based Atari BASIC. While Atari BASIC came on an 8 KB ROM cartridge, BASIC A+ was delivered on floppy disk and took 15 KB of the computer's RAM, leaving 23 KB available for user programs in a 48 KB Atari 800. BASIC A+ was offered at a price of US$80.00 in 1983, including the products OS/A+ and EASMD (Editor/Assembler), and being an extension of Atari BASIC, came with a supplement to the latter's reference manual as its documentation. In addition to being faster than its ROM-bound counterpart, BASIC A+ provided a number of extra commands for DOS operations, player/missile graphics, and debugging.", "created": 2004, "backlinksCount": 94, "pageId": 555899, "revisionCount": 35, "dailyPageViews": 8, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/BASIC_A%2B" }, "centralPackageRepositoryCount": 0 }, "basic-e": { "title": "BASIC-E", "appeared": 1976, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Gordon Eubanks" ], "wikipedia": { "related": [ "pl-m", "basic", "mbasic" ], "summary": "CBASIC is a compiled version of the BASIC programming language written for the CP/M operating system by Gordon Eubanks in 1976–1977. It is an enhanced version of BASIC-E.", "created": 2006, "backlinksCount": 38, "pageId": 6900131, "revisionCount": 2, "dailyPageViews": 2, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/BASIC-E" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1991", "centralPackageRepositoryCount": 0, "isbndb": "" }, "basic-pdp-1-lisp": { "title": "Basic PDP-1 Lisp", "appeared": 1963, "type": "pl", "reference": [ "http://s3data.computerhistory.org/pdp-1/DEC.pdp_1.1964.102650371.pdf" ], "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3898", "centralPackageRepositoryCount": 0 }, "basic-plus": { "title": "BASIC-PLUS", "appeared": 1975, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "related": [ "basic", "dartmouth-basic", "microsoft-basic", "hp-basic-for-openvms" ], "summary": "BASIC-PLUS was an extended dialect of the BASIC programming language developed by Digital Equipment Corporation (DEC) for use on its RSTS/E time-sharing operating system for the PDP-11 series of 16-bit minicomputers in the early 1970s through the 1980s. BASIC-PLUS is based very closely on the original Dartmouth BASIC, although it added a number of new structures. In turn, BASIC-PLUS was the version that the original Microsoft BASIC was patterned.The language was later rewritten as a true compiler as BASIC-Plus-2, and was ported to the VAX-11 platform as that machine's native BASIC implementation. This version survived several platform changes, and is today known as HP BASIC for OpenVMS.", "created": 2004, "backlinksCount": 26, "pageId": 617705, "revisionCount": 99, "dailyPageViews": 16, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/BASIC-PLUS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3420", "centralPackageRepositoryCount": 0, "isbndb": "" }, "basic-programming": { "title": "BASIC Programming", "appeared": 1979, "type": "pl", "creators": [ "Warren Robinett" ], "country": [ "United States" ], "originCommunity": [ "Atari, Inc" ], "wikipedia": { "related": [ "basic", "family-basic" ], "summary": "BASIC Programming (Model# CX2620) is an Atari 2600 cartridge that teaches simple computer programming. It was released in 1979 and was one of only a few non-gaming cartridges designed for the console. The programming language is similar to dialects of BASIC. The Atari 2600's RAM size of 128 bytes restricts the possibilities for writing programs.", "created": 2003, "backlinksCount": 108, "pageId": 174486, "revisionCount": 118, "dailyPageViews": 53, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/BASIC_Programming" }, "centralPackageRepositoryCount": 0 }, "basic-stamp": { "title": "BASIC Stamp", "appeared": 1990, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Parallax, Inc." ], "wikipedia": { "related": [ "pbasic", "basic", "java", "parallax-propeller", "arduino" ], "summary": "The BASIC Stamp is a microcontroller with a small, specialized BASIC interpreter (PBASIC) built into ROM. It is made by Parallax, Inc. and has been popular with electronics hobbyists since the early 1990s.", "created": 2004, "backlinksCount": 64, "pageId": 890313, "revisionCount": 185, "dailyPageViews": 35, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/BASIC_Stamp" }, "centralPackageRepositoryCount": 0 }, "basic": { "title": "BASIC", "appeared": 1964, "type": "pl", "creators": [ "John G. Kemeny", "Thomas E. Kurtz" ], "description": "BASIC (Beginner's All-purpose Symbolic Instruction Code)[1] is a family of general-purpose, high-level programming languages whose design philosophy emphasizes ease of use. In 1964, John G. Kemeny and Thomas E. Kurtz designed the original BASIC language at Dartmouth College. They wanted to enable students in fields other than science and mathematics to use computers. At the time, nearly all use of computers required writing custom software, which was something only scientists and mathematicians tended to learn.", "documentation": [ "https://en.wikibooks.org/wiki/BASIC_Programming" ], "standsFor": "Beginner's All-purpose Symbolic Instruction Code", "country": [ "United States" ], "originCommunity": [ "Dartmouth College" ], "hasComments": { "example": "REM This BASIC program shows the use of the PRINT and GOTO Statements.", "value": true }, "hasGotos": { "example": "10 REM This BASIC program shows the use of the PRINT and GOTO Statements.\n15 REM It fills the screen with the phrase \"HELLO\"\n20 PRINT \"HELLO\"\n30 GOTO 20", "value": true }, "hasOperatorOverloading": { "example": "", "value": false }, "hasLineComments": { "example": "REM A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "isCaseSensitive": { "example": "", "value": false }, "lineCommentToken": [ [ "REM" ] ], "printToken": [ [ "PRINT" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "Public Class StarsProgram\n Public Shared Sub Main()\n Dim UserName, Answer, stars As String, NumStars As Integer\n Console.Write(\"What is your name: \")\n UserName = Console.ReadLine()\n Console.WriteLine(\"Hello {0}\", UserName)\n Do\n Console.Write(\"How many stars do you want: \")\n NumStars = CInt(Console.ReadLine())\n stars = New String(\"*\", NumStars)\n Console.WriteLine(stars)\n Do\n Console.Write(\"Do you want more stars? \")\n Answer = Console.ReadLine()\n Loop Until Answer <> \"\"\n Answer = Answer.Substring(0, 1)\n Loop While Answer.ToUpper() = \"Y\"\n Console.WriteLine(\"Goodbye {0}\", UserName)\n End Sub\nEnd Class" ], "related": [ "atari-basic", "dartmouth-basic", "apple-basic", "sinclair-basic", "commodore-basic", "bbc-basic", "ti-basic", "casio-basic", "microsoft-basic", "liberty-basic", "visual-basic", "freebasic", "powerbasic", "gambas", "algol-60", "fortran", "joss", "comal", "visual-basic.net", "grass", "autoit", "autohotkey", "basic-plus", "hp-time-shared-basic", "pick-operating-system", "msx-basic", "tiny-basic", "li-chen-wang", "altair-basic", "mbasic", "ibm-basica", "qbasic", "pascal", "turbo-basic", "amigabasic", "c", "excel-app", "vbscript", "csharp", "java", "qb64", "rapidq", "purebasic", "xojo", "true-basic", "microsoft-small-basic", "quickbasic", "gw-basic", "lotusscript", "vba", "chipmunk-basic", "hp-basic-for-openvms", "superbasic", "staroffice-basic", "forth" ], "summary": "BASIC (an acronym for Beginner's All-purpose Symbolic Instruction Code) is a family of general-purpose, high-level programming languages whose design philosophy emphasizes ease of use. In 1964, John G. Kemeny and Thomas E. Kurtz designed the original BASIC language at Dartmouth College in New Hampshire, United States. They wanted to enable students in fields other than science and mathematics to use computers. At the time, nearly all use of computers required writing custom software, which was something only scientists and mathematicians tended to learn. Versions of BASIC became widespread on microcomputers in the mid-1970s and 1980s. Microcomputers usually shipped with BASIC, often in the machine's firmware. Having an easy-to-learn language on these early personal computers allowed small business owners, professionals, hobbyists, and consultants to develop custom software on computers they could afford. In the 2010s, BASIC was popular in many computing dialects and in new languages influenced by BASIC, such as Microsoft's Visual Basic.", "pageId": 4015, "dailyPageViews": 1401, "created": 2001, "backlinksCount": 2623, "revisionCount": 2802, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/BASIC" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "bas" ], "aceMode": "text", "tmScope": "source.basic", "repos": 829, "id": "BASIC" }, "githubBigQuery": { "repos": 66, "users": 61, "id": "BASIC" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/basic", "projectEuler": { "memberCount": { "2019": 1334, "2022": 1336 }, "id": "BASIC" }, "helloWorldCollection": [ "10 REM Hello World in BASIC\n20 PRINT \"Hello World!\"\n" ], "leachim6": { "filepath": "b/BASIC.bas", "fileExtensions": [ "bas" ], "example": [ "10 PRINT \"Hello World\"\n20 END\n" ], "id": "BASIC" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:BASIC", "rijuRepl": { "example": [ "PRINT \"Hello, world!\"\n" ], "description": "General-purpose, high-level programming language whose design philosophy emphasizes ease of use", "fileExtensions": [ "bas" ], "gitRepo": "https://sourceforge.net/projects/bwbasic/files/bwbasic/", "id": "https://riju.codes/basic" }, "tiobe": { "id": "Basic" }, "hopl": "https://hopl.info/showlanguage.prx?exp=176", "fileType": "text", "wordRank": 945, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010|McGraw-Hill Education|Programming in Visual Basic 2010|Bradley, Julia Case and Millspaugh, Anita|9780073517254\n2009|McGraw-Hill Education|Advanced Programming Using Visual Basic 2008|Bradley, Julia Case and Millspaugh, Anita|9780073517223\n2008|Wiley|Basic Engineering Circuit Analysis|Irwin, J. David and Nelms, R. Mark|9780470128695\n2014|Cengage Learning|Microsoft Visual Basic Programs to Accompany Programming Logic and Design|Smith, Jo Ann|9781285867397\n2010|Pearson|An Introduction to Programming Using Visual Basic 2010, 8th Edition|Schneider, David I.|9780132128568\n2011|Cengage Learning|Clearly Visual Basic: Programming with Microsoft Visual Basic 2010 (SAM 2010 Compatible Products)|Zak, Diane|9781111530150\n2012|Wrox|Beginning Visual Basic 2012|Newsome, Bryan|9781118311813\n2010|Cengage Learning|Microsoft Visual Basic 2010: For Windows, Web, Office, and Database Applications: Comprehensive (SAM 2010 Compatible Products)|Shelly, Gary B. and Hoisington, Corinne|9780538468473\n2013|Pearson|Intro to Programming Using Visual Basic 2012 plus MyProgrammingLab with Pearson eText -- Access Card Package (9th Edition)|Schneider, David I.|9780133450866\n2003|Pearson|An Introduction to Programming with Visual Basic 6.0, Update Edition (4th Edition)|Schneider, David I.|9780131427075\n2010|Cengage Learning|Microsoft Visual Basic 2010 for Windows, Web, and Office Applications: Complete (SAM 2010 Compatible Products)|Shelly, Gary B. and Hoisington, Corinne|9780538468480\n2006|Cengage Learning|Microsoft Visual Basic 2005 for Windows and Mobile Applications: Introductory|Gary B. Shelly and Thomas J. Cashman and Corinne Hoisington and Corrine Hoisington|9780619254803\n2009|Pearson|Starting Out With Visual Basic 2008 Update|Gaddis, Tony and Irvine, Kip R.|9780136076957\n2006|Routledge|Structural Equation Modeling With EQS: Basic Concepts, Applications, and Programming, Second Edition (Multivariate Applications Series)|Byrne, Barbara M. and Byrne, Barbara M.|9780805841268\n2013|McGraw-Hill Education|CATIA V5: Macro Programming with Visual Basic Script|Ziethen, Dieter|9780071800020\n2011|Course Technology|Programming with Microsoft Visual Basic 2010 (VB.Net Programming)|Zak, Diane|9781111529437\n2011|Routledge|Structural Equation Modeling with Mplus: Basic Concepts, Applications, and Programming (Multivariate Applications Series)|Byrne, Barbara M.|9781848728394\n2011|Routledge|Structural Equation Modeling with Mplus: Basic Concepts, Applications, and Programming (Multivariate Applications Series)|Byrne, Barbara M.|9780805859867\n2000|Prentice Hall|Introduction to Computer Programming with Visual Basic 6: A Problem-Solving Approach|Harriger, Alka R. and Lisack, Susan K. and Gotwals, John K. and Lutes, Kyle D.|9780130165336\n2010|Pearson|Visual Basic 2010 How to Program (5th Edition) (Pearson Custom Computer Science)|Deitel, Paul and Deitel, Harvey|9780132152136\n2014|CRC Press|Applied Medical Image Processing: A Basic Course|Birkfellner, Wolfgang|9781466555570\n2009|Cengage Learning|Programming with Microsoft Visual Basic 2008 (Available Titles Skills Assessment Manager (SAM) - Office 2010)|Zak, Diane|9780324782769\n1983|Compute! Books|Machine language for beginners: Machine language programming for BASIC language programmers|Mansfield, Richard|9780942386110\n2006|Course Technology|Microsoft Visual Basic 2005: RELOADED, Second Edition (Visual Studio)|Zak, Diane|9781418836238\n2004|McGraw-Hill Science/Engineering/Math|Introduction to Matlab 7 for Engineers (McGraw-Hill's Best: Basic Engineering Series and Tools)|Palm III,William|9780072548181\n2002|McGraw-Hill Companies|Visual Basic .NET Tips & Techniques|Kris Jamsa|9780072223187\n1999|Pearson|Introduction to Computer Programming with Visual Basic 6 (Series in Programming and Development)|Harriger, Alka R. and Lisack, Susan K.|9781580762410\n2010|Cengage Learning|Microsoft Visual Basic 2010 for Windows Applications: Introductory (Available Titles Skills Assessment Manager (SAM) - Office 2010)|Shelly, Gary B. and Hoisington, Corinne|9780538468459\n2005|Wrox|Beginning Visual Basic 2005|Willis, Thearon and Newsome, Bryan|9780764574016\n2002|Course Technology PTR|Visual Basic Game Programming with DirectX (The Premier Press Game Development Series)|Harbour, Jonathan S.|9781931841252\n2002|Course Technology PTR|Visual Basic Programming for the Absolute Beginner w/CD|Vine, Michael|9780761535539\n2000|CRC Press|Evolutionary Computation 1: Basic Algorithms and Operators||9780750306645\n2008|Cambridge University Press|Basic Proof Theory 2ed (Cambridge Tracts in Theoretical Computer Science)|Troelstra/Schwichtenberg|9780521779111\n1998|Prentice Hall|Visual Basic 6 How to Program|Deitel, Harvey M. and Deitel, Paul J. and Nieto, Tem R.|9780134569550\n2012|Sams|Sams Teach Yourself Visual Basic 2012 in 24 Hours|Foxall, James|9780672336294\n2010|Apress|Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source)|Hetland, Magnus Lie|9781430232377\n1999|McGraw-Hill Osborne Media|Visual Basic Answers!|Otey, Michael|9780072118957\n2008|Prentice Hall|Introduction to Programming Using Visual Basic 2008, An (w/VS2008 DVD) (7th Edition)|Schneider, David I.|9780136060727\n1978|Workman Pub Co|BASIC Computer Games: Microcomputer Edition|Ahl, David H.|9780894800528\n1985|Prentice-hall|More Basic Is Child's Play, Commodore Edition|Robert T Grauer|9780136010715\n2010|Sams Publishing|Sams Teach Yourself Visual Basic 2010 in 24 Hours Complete Starter Kit|Foxall, James|9780672331138\n1998|For Dummies|Visual Basic 6 For Dummies|Wang, Wallace|9780764503702\n2008|Wrox|Beginning Microsoft Visual Basic 2008|Willis, Thearon and Newsome, Bryan|9780470191347\n2021|Harcourt College Pub|Programming In Visual Basic 6.0|Spear, Robert J. and Spear, Timothy M.|9780030263910\n1984|Kar-ben Pub|Alef Basic: A Guide To Basic Programming With Facts, Fun, And Games From Jewish History And Tradition|Rachelle S. Heller|9780930494315\n2001|Sybex|Mastering Visual Basic .NET|Petroutsos, Evangelos|9780782128772\n1984|Little Brown & Co|Let's Learn Basic: A Kids' Introduction to Basic Programming on the Commodore 64 (The Little, Brown Microcomputer Bookshelf)|Shneiderman, Ben|9780316787253\n1985|Childrens Press|The Apple Basic Manual (kids Working With Computers)|Thomas Milton Kemnitz and Lynne Mass|9780516084220\n2007|Addison-Wesley Professional|Doing Objects in Visual Basic 2005|Kurata, Deborah|9780321320490\n2001|Sams Publishing|Sams Teach Yourself Visual Basic .NET Web Programming in 21 Days|Aitken, Peter|9780672322365\n1984|West Pub. Co|Complete Basic Programming|Mandell and Steven L|9780314779212\n1980|Halsted Pr|Basic Programming|Kemeny, John G.|9780471018636\n1974|R. D. Irwin|Basic Fortran Iv Programming (irwin-dorsey Information Processing Series)|Donald H Ford|9780256015805\n2004|Jones & Bartlett Learning|Introduction To Programming With Visual Basic .NET|Bronson, Gary|9780763724788\n1999|O'Reilly Media|Win32 API Programming with Visual Basic|Steven Roman, PhD|9781565926318\n2010|lulu.com|Beginning Programming with Liberty BASIC|Gundel, Carl|9780557228119\n1980|Meta Pubns|Practical Magic: A Translation of Basic Neuro-Linguistic Programming into Clinical Psychotherapy|Lankton, Stephen|9780916990084", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|Distributed pC++ Basic Ideas for an Object Parallel Language|10.1155/1993/158246|176|9|F. Bodin and P. Beckman and Dennis Gannon and S. Narayana and S. Yang|f0d0e8e319f4f733d066f6490cee425a2d864d84\n1983|A diagnosis of beginning programmers' misconceptions of BASIC programming statements|10.1145/358172.358408|147|9|P. Bayman and R. Mayer|1ba008748c01d4bb8889e765f513f0f3dfbf4a53\n2015|Design and First Results of a Psychometric Test for Measuring Basic Programming Abilities|10.1145/2818314.2818320|75|4|A. Mühling and Alexander Ruf and Peter Hubwieser|3b3ef3c47c104d7a28597c006b3deae8fb8d89e8\n1991|The Effect of BASIC Programming Language Instruction on High School Students’ Problem Solving Ability and Computer Anxiety|10.1080/08886504.1991.10781967|60|0|D. Palumbo and W. M. Reed|ca3f13b926c35417fd729735adefd8510ce7e194\n2019|Improving students' understanding of basic programming concepts through visual programming language: The role of self-efficacy|10.1016/j.chb.2018.11.038|49|3|Chun-Yen Tsai|99b5c0c121932ce81498732539ba360252f7dd0d\n1987|The Effect of the BASIC Programming Language on Problem-Solving Skills and Computer Anxiety|10.1300/J025V04N03_11|40|2|W. M. Reed and D. Palumbo|fc814e59d1827cc9468f14da81c494160d91f619\n1986|Basic concepts in object oriented programming|10.1145/323779.323751|39|1|K. Nygaard|ba2be42b631dda8c51d9c90e26755353ce53bab4\n2009|Evaluating a BASIC approach to sensor network node programming|10.1145/1644038.1644054|25|0|J. S. Miller and P. Dinda and R. Dick|ada19ba29f19f212feb635b69a52ae61141a50b3\n1975|A rationale and description of a CAI program to teach the BASIC programming language|10.1007/BF00157068|25|0|A. Barr and M. Beard and R. Atkinson|b1f3ca8dcb3a193ca2228d0bb720de7ae140d44b\n2009|Developing Student Programming and Problem-Solving Skills with Visual Basic|10.1177/107621750903200408|18|1|Del Siegle|9efa9995668bc1c3be84e436e3b030f2e1abc4d3\n2010|Python Algorithms: Mastering Basic Algorithms in the Python Language|10.5860/choice.48-5731|15|1|Magnus Lie Hetland|acd47deeb3a2880764cdb66af506c9cd7ea3741a\n2000|BCOOPL: Basic concurrent object-oriented programming language|10.1002/(SICI)1097-024X(20000710)30:8%3C849::AID-SPE318%3E3.0.CO;2-0|7|0|H. D. Bruin|a71956655add35c8a7a7bb8f2bce594fa9af1675\n2003|BASIC Programming Language|10.1016/B0-12-227410-5/00838-3|2|0|T. Kurtz|567862576b247d16ce2a942ed3527fa5126e47a2" }, "basic09": { "title": "BASIC09", "appeared": 1978, "type": "pl", "originCommunity": [ "Motorola" ], "wikipedia": { "related": [ "ucsd-pascal", "microsoft-basic" ], "summary": "BASIC09 is a structured BASIC programming language dialect developed by Microware and Motorola for the then-new Motorola 6809 CPU and released in 1980.", "created": 2002, "backlinksCount": 14, "pageId": 39564, "revisionCount": 70, "dailyPageViews": 5, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/BASIC09" }, "centralPackageRepositoryCount": 0 }, "basic4android": { "title": "Basic4android", "appeared": 2011, "type": "pl", "country": [ "Israel" ], "originCommunity": [ "Anywhere Software Ltd" ], "wikipedia": { "related": [ "android", "java", "visual-basic", "isbn" ], "summary": "Basic4Android (currently known as B4A) is a rapid application development tool for native Android applications, developed and marketed by Anywhere Software Ltd. B4A is an alternative to programming with Java.B4A includes a visual designer that simplifies the process of building user interfaces that target phones and tablets with different screen sizes. Compiled programs can be tested in AVD Manager emulators or on real Android devices using Android Debug Bridge and B4A Bridge. The language itself is similar to Visual Basic and Visual Basic .Net though it is adapted to the native Android environment. B4A is an object-based and event-driven language. B4A generates standard signed Android applications which can be uploaded to app stores like Google Play, Samsung Apps and Amazon Appstore. There are no special dependencies or runtime frameworks required.", "created": 2013, "backlinksCount": 92, "pageId": 40303335, "revisionCount": 42, "dailyPageViews": 48, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/Basic4android" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "basic4gl": { "title": "Basic4GL", "appeared": 2002, "type": "pl", "country": [ "New Zealand" ], "originCommunity": [ "Tom Mulgrew" ], "wikipedia": { "related": [ "linux", "quickbasic", "basic", "opengl", "qbasic", "gfa-basic", "c", "glbasic", "darkbasic", "freebasic", "thinbasic" ], "summary": "Basic4GL (B4GL; from Basic for openGL) is an interpreted, open source version of the BASIC programming language which features support for 3D computer graphics using OpenGL. While being interpreted, it is also able to compile programs on top of the virtual machine to produce standalone executable programs. It uses a syntax similar to traditional dialects of BASIC and features an IDE and a very thorough and comprehensive debugger. Basic4GL is not designed to compete with programming languages such as C++; it was intended to replace older languages such as QBasic or GFA BASIC. Basic4GL features the usual commands that you would expect to find in a version of BASIC such as... PRINT INPUT GOSUBIt also includes a few features that C programmers will be familiar with, such as support for pointers, structures and most importantly the entire OpenGL v1.1 API.", "created": 2007, "backlinksCount": 16, "pageId": 8740064, "revisionCount": 115, "dailyPageViews": 5, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Basic4GL" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "basic4ppc": { "title": "Basic4ppc", "appeared": 2005, "type": "pl", "creators": [ "Erel Uziel" ], "country": [ "Israel" ], "originCommunity": [ "Anywhere Software" ], "wikipedia": { "example": [ "Sub App_Start\nnumA = \"Five \"\nnumB = \"5\"\nnumC = 6\n\nSUM1 = numA & numB 'remark: = \"Five 5\"\nSUM2 = numB + numC 'remark: = 11\nEnd Sub" ], "related": [ "visual-basic", "basic", "xml" ], "summary": "Basic4ppc (pronounced \"Basic for PPC\") is a programming language for Pocket PC handheld computers running Windows Mobile operating system, by Anywhere Software. The language is based on a BASIC-like syntax, taking advantage of Microsoft's .NET technology, to allow additional libraries, graphical user interface design of windows forms, rapid application development (RAD), and .NET framework compatible compilation. The language implements a unique way of adding objects to a program without being object-oriented. Its advantages are simplicity, development pace and the integration with .NET framework. A special version of the integrated development environment (IDE) allows developing straight onto the Windows Mobile device. With the demise of Windows Mobile operating system and the devices running it Basic4PPC came to the end of its life in about 2012. For owners of Basic4PPC it remains a useful Windows-desktop BASIC compiler as it runs code directly in the Windows environment and it can compile a project to a Windows 'exe' file for use as a Windows program.", "created": 2009, "backlinksCount": 88, "pageId": 23497750, "revisionCount": 63, "dailyPageViews": 11, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Basic4ppc" }, "centralPackageRepositoryCount": 0 }, "basicode": { "title": "BASICODE", "appeared": 1980, "type": "pl", "country": [ "Netherlands" ], "originCommunity": [ "Nederlandse Omroep Stichting" ], "wikipedia": { "example": [ "minimodem --rx 1200 -q -S 1200 -M 2400 --stopbits 2 -f basicode.wav" ], "related": [ "basic", "acorn-atom", "pascal", "java", "pdf", "ascii", "isbn" ], "summary": "BASICODE was a computer project intended to create a unified standard for the BASIC programming language. BASIC was available on many popular home computers, but there were countless variants that were mostly incompatible with each other. The project was initiated in 1980 by Hobbyscoop, a radio program of the Dutch broadcasting organisation Nederlandse Omroep Stichting (NOS). The basic implementation were architecture-specific utility applications that executed calls of subroutines for text, audio and sound defined in the BASICODE language standard according to the abilities of the computer in question. These applications, called Bascoders, also enabled the sharing of data and programs across different computer platforms by defining a data format for the compact audio cassettes that were regularly used as storage media in the 1980s. A BASICODE program stored on cassette could be loaded and run on any computer supporting the language. BASICODE was often called \"Esperanto for computers\" for that reason.", "created": 2006, "backlinksCount": 19, "pageId": 4753069, "revisionCount": 120, "dailyPageViews": 9, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/BASICODE" }, "centralPackageRepositoryCount": 0 }, "basicx": { "title": "BasicX", "appeared": 1998, "type": "pl", "country": [ "United States" ], "originCommunity": [ "NetMedia Inc" ], "wikipedia": { "related": [ "basic", "isbn" ], "summary": "BasicX is a free programming language designed specifically for NetMedia's BX-24 microcontroller and based on the BASIC programming language. It is used in the design of robotics projects such as the Robodyssey Systems Mouse robot.", "created": 2006, "backlinksCount": 8, "pageId": 6171129, "revisionCount": 21, "dailyPageViews": 2, "url": "https://en.wikipedia.org/wiki/BasicX" }, "centralPackageRepositoryCount": 0 }, "basil": { "title": "BASIL", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/22260132d100eb0b6e63328b3f569aca43cf400d" ], "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4107", "centralPackageRepositoryCount": 0 }, "basis-universal-format": { "title": "Basis Codec", "appeared": 2019, "type": "binaryDataFormat", "description": "Basis Universal GPU Texture and Texture Video Compression Reference Codec", "fileExtensions": [ "basis" ], "country": [ "Unknown" ], "originCommunity": [ "BinomialLLC" ], "githubRepo": { "firstCommit": 2019, "stars": 2127, "forks": 200, "subscribers": 50, "created": 2019, "updated": 2022, "description": "Basis Universal GPU Texture Codec", "issues": 83, "url": "https://github.com/binomialLLC/basis_universal" } }, "batari-basic": { "title": "Batari Basic", "appeared": 2007, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Atari, Inc" ], "wikipedia": { "related": [ "assembly-language", "basic", "isbn" ], "summary": "An Atari 2600 homebrew (short for Atari 2600 homebrew game, where homebrew is synonymous with hobbyist-developed) is a video game designed for the Atari 2600 by an independent developer following the discontinuation of the console in 1992. The first 2600 homebrew was written in 1995, and since then over 100 titles have been released. There is an active community of Atari 2600 developers—the largest among classic video game homebrew communities.The majority of homebrew games are unlicensed clones of arcade games, personal computer games, and games from other consoles, but there are also ROM hacks and some original titles. Several games have received attention outside the homebrew community; some have been included in an Atari 2600 game anthology from by Activision.With severe resource limitations including only 128 bytes of RAM and no video frame buffer, the 2600 is a difficult machine to program. However, tools such as emulators, the batari Basic language, and a wealth of documentation, exist to assist the homebrewer.", "created": 2010, "backlinksCount": 113, "pageId": 28573548, "revisionCount": 2, "dailyPageViews": 2, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Batari_Basic" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "batch": { "title": "Batchfile", "appeared": 1985, "type": "pl", "aka": [ "bat", "cmd" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "REM A comment", "value": true }, "hasComments": { "example": "REM A comment\n:: Another type of comment", "value": true }, "hasGotos": { "example": ":: this would create an endless loop\n:myLabel\ngoto myLabel", "value": true }, "lineCommentToken": [ [ "REM" ] ], "printToken": [ [ "echo" ] ], "wikipedia": { "example": [ "C:\\>set /p =\"Message 1\"data.txt\nC:\\>set /p =\"Message 2\">data.txt\nC:\\>set /p =\"Message 3\">data.txt\nC:\\>type data.txt\nMessage 1Message 2Message 3" ], "related": [ "jcl", "linux", "notepad-editor", "unicode", "kixtart", "vbscript", "jscript", "powershell", "unix", "perl", "python", "ruby", "php" ], "summary": "A batch file is a kind of script file in DOS, OS/2 and Microsoft Windows. It consists of a series of commands to be executed by the command-line interpreter, stored in a plain text file. A batch file may contain any command the interpreter accepts interactively and use constructs that enable conditional branching and looping within the batch file, such as IF, FOR, and GOTO labels. The term \"batch\" is from batch processing, meaning \"non-interactive execution\", though a batch file may not process a batch of multiple data. Similar to Job Control Language (JCL) and other systems on mainframe and minicomputer systems, batch files were added to ease the work required for certain regular tasks by allowing the user to set up a script to automate them. When a batch file is run, the shell program (usually COMMAND.COM or cmd.exe) reads the file and executes its commands, normally line-by-line. Unix-like operating systems, such as Linux, have a similar, but more flexible, type of file called a shell script. The filename extension .bat is used in DOS and Windows. Windows NT and OS/2 also added .cmd. Batch files for other environments may have different extensions, e.g., .btm in 4DOS, 4OS2 and 4NT related shells. The detailed handling of batch files has changed. Some of the detail in this article applies to all batch files, while other details apply only to certain versions.", "pageId": 15264030, "dailyPageViews": 757, "created": 2004, "backlinksCount": 845, "revisionCount": 1307, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Batch_file" }, "githubLanguage": { "fileExtensions": [ "bat", "cmd" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nrealpython python-guide https://github.com/realpython.png https://github.com/realpython/python-guide Batchfile #C1F12E 19021 5085 295 \"Python best practices guidebook, written for humans.\"\nniudai How-to-be-a-good-programmer https://github.com/niudai.png https://github.com/niudai/How-to-be-a-good-programmer Batchfile #C1F12E 132 51 116 \"I'm here to tell you some amazing stuff which teacher would never tell you.\"\nkkkgo KMS_VL_ALL https://github.com/kkkgo.png https://github.com/kkkgo/KMS_VL_ALL Batchfile #C1F12E 689 122 54 \"🔑KMS_VL_ALL - Smart Activation Script\"\nMr-xn BurpSuite-collections https://github.com/Mr-xn.png https://github.com/Mr-xn/BurpSuite-collections Batchfile #C1F12E 513 160 255 \"BurpSuite收集：包括不限于 Burp 文章、破解版、插件(非BApp Store)、汉化等相关教程，欢迎添砖加瓦\"\nCHEF-KOCH KMS-activator https://github.com/CHEF-KOCH.png https://github.com/CHEF-KOCH/KMS-activator Batchfile #C1F12E 288 64 41 \"Windows activation research project.\"\nkkkgo LTSC-Add-MicrosoftStore https://github.com/kkkgo.png https://github.com/kkkgo/LTSC-Add-MicrosoftStore Batchfile #C1F12E 225 29 33 \"Add Windows Store for LTSC\"\nFQrabbit SSTap-Rule https://github.com/FQrabbit.png https://github.com/FQrabbit/SSTap-Rule Batchfile #C1F12E 2367 613 195 支持更多游戏规则，让SSTap成为真正的“网游加速器”", "trendingProjectsCount": 8, "type": "programming", "aceMode": "batchfile", "tmScope": "source.batchfile", "aliases": [ "bat", "batch", "dosbatch", "winbatch" ], "repos": 72380, "id": "Batchfile" }, "githubBigQuery": { "repos": 97775, "users": 76182, "id": "Batchfile" }, "monaco": "bat", "pygmentsHighlighter": { "filename": "shell.py", "fileExtensions": [ "bat", "cmd" ], "id": "Batchfile" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 3, "commitCount": 55, "url": "https://github.com/mmims/language-batchfile" }, "projectEuler": { "memberCount": { "2022": 9 }, "id": "Batch" }, "leachim6": { "filepath": "b/Batch.bat", "fileExtensions": [ "bat" ], "example": [ "@echo off\necho Hello World\n" ], "id": "Batch" }, "rijuRepl": { "example": [ "echo \"Hello, world!\"\n" ], "description": "Obsolete (but still default) command-line interpreter for Microsoft Windows", "fileExtensions": [ "bat" ], "website": "https://docs.microsoft.com/en-us/windows-server/administration/windows-commands/windows-commands", "id": "https://riju.codes/cmd" }, "fileType": "text", "wordRank": 7410, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "battlestar": { "title": "Battlestar", "appeared": 2014, "type": "pl", "creators": [ "Alexander Rødseth" ], "country": [ "Norway" ], "originCommunity": [ "Arch Linux" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "githubRepo": { "firstCommit": 2014, "stars": 70, "forks": 5, "subscribers": 3, "created": 2014, "updated": 2022, "description": ":dizzy: A different take on Assembly, with the goal of creating tiny executables.", "issues": 0, "url": "https://github.com/xyproto/battlestar" }, "repoStats": { "firstCommit": 2014, "commits": 367, "committers": 7, "files": 128 }, "leachim6": { "filepath": "b/Battlestar.bts", "fileExtensions": [ "bts" ], "example": [ "#!/usr/bin/bts\nconst hello = \"Hello World\\n\"\nprint(hello)\n" ], "id": "Battlestar" }, "rijuRepl": { "example": [ "const message = \"Hello, world!\\n\"\n\nfun main\n syscall(1, 1, message, len(message))\nend\n" ], "description": "A different take on assembly, with the goal of creating tiny executables", "fileExtensions": [ "bts" ], "gitRepo": "https://github.com/xyproto/battlestar", "id": "https://riju.codes/battlestar" } }, "bawk": { "title": "bawk", "appeared": 1994, "type": "pl", "creators": [ "Bob Brodt" ], "reference": [ "http://www.cs.columbia.edu/~sedwards/classes/2013/w4115-summer/lrms/bawk.pdf" ], "country": [ "United States" ], "originCommunity": [ "Columbia University" ], "supersetOf": [ "awk" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1852", "centralPackageRepositoryCount": 0 }, "bayer-expressions": { "title": "Bayer Expressions", "appeared": 2018, "type": "dataNotation", "creators": [ "Dave Bayer" ], "description": "An alternative notation for S-Expressions that uses fewer parentheses. As described by the creator: Indentation implies parentheses. A pipe \"|\" opens a parenthesis that auto-closes at the end of that line or at the next \")\". A dollar \"$\" opens a parenthesis that auto-closes when the indentation recovers. The result has a lighter, more poetic look than any language I know, and the parentheses that are left actually matter, so I pay attention to them.", "reference": [ "https://news.ycombinator.com/item?id=19431720" ], "related": [ "s-expressions", "i-expressions" ], "example": [ "define | edge? g e\n let\n $ es | edges g\n e2 | reverse e\n or (member e es) (member e2 es)" ], "isbndb": "" }, "bayes-equation": { "title": "Bayes' Equation", "appeared": 1763, "type": "equation", "creators": [ "Thomas Bayes" ], "equation": "P(A|B) = (P(B|A))*P(A))/P(B)", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Bayes%27_theorem" } }, "baysick": { "title": "baysick", "appeared": 2009, "type": "esolang", "creators": [ "Michael Fogus" ], "website": "http://blog.fogus.me/2009/03/26/baysick-a-scala-dsl-implementing-basic/", "country": [ "United States" ], "originCommunity": [ "Cognitect, Inc" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "PRINT" ] ], "example": [ "object SquareRoot extends Baysick {\n def main(args:Array[String]) = {\n 10 PRINT \"Enter a number\"\n 20 INPUT 'n\n 30 PRINT \"Square root of \" % \"'n is \" % SQRT('n)\n 40 END\n RUN\n }\n}" ], "githubRepo": { "firstCommit": 2009, "stars": 244, "forks": 46, "subscribers": 15, "created": 2009, "updated": 2022, "description": "An embedded Insane-specific Language for Scala implementing the BASIC programming language", "issues": 5, "url": "https://github.com/fogus/baysick" }, "repoStats": { "firstCommit": 2009, "commits": 126, "committers": 6, "files": 8 }, "twitter": "https://twitter.com/fogus" }, "bazel": { "title": "Bazel", "appeared": 2015, "type": "application", "creators": [ "Han-Wen Nienhuys" ], "description": "Bazel is an open-source build and test tool similar to Make, Maven, and Gradle. It uses a human-readable, high-level build language. Bazel supports projects in multiple languages and builds outputs for multiple platforms. Bazel supports large codebases across multiple repositories, and large numbers of users. See starlark for the language.", "website": "https://bazel.build/", "country": [ "United States" ], "originCommunity": [ "Google" ], "domainName": { "registered": 2016, "awisRank": { "2022": 451403 }, "name": "bazel.build" }, "githubRepo": { "firstCommit": 2015, "stars": 18903, "forks": 3457, "subscribers": 608, "created": 2014, "updated": 2022, "description": "a fast, scalable, multi-language and extensible build system", "issues": 2555, "url": "https://github.com/bazelbuild/bazel" }, "wikipedia": { "summary": "In software development, Bazel is a free software tool that allows for the automation of building and testing of software. The company Google uses the build tool Blaze internally and released an open-sourced part of the Blaze tool as Bazel, named as an anagram of Blaze. Bazel was first released in March 2015 and achieved beta status by September 2015.Similar to build tools like Make, Apache Ant, or Apache Maven, Bazel builds software applications from source code using a set of rules. Rules and macros are created in the Starlark language (previously called Skylark), a dialect of Python. There are built-in rules for building software written in the programming languages of Java, C, C++, Go, Python, Objective-C and Bourne shell scripts. Bazel can produce software application packages suitable for deployment for the Android and iOS operating systems.In designing Bazel, emphasis has been placed on build speed, correctness, and reproducibility. The tool uses parallelization to speed up parts of the build process. It includes a Bazel Query language that can be used to analyze build dependencies in complex build graphs.", "backlinksCount": 19, "pageId": 50918393, "dailyPageViews": 96, "appeared": 2019, "url": "https://en.wikipedia.org/wiki/Bazel_(software)" }, "twitter": "https://twitter.com/bazelbuild" }, "bbc-basic": { "title": "BBC BASIC", "appeared": 1981, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "BBC Micro" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "PRINT" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "IF INSTR(REPORT$,\"VI\") THEN PRINT \"BASIC64\" ELSE PRINT \"BASIC\"" ], "related": [ "basic", "bcpl", "acorn-atom", "comal", "arm", "assembly-language", "c" ], "summary": "BBC BASIC is a programming language, developed in 1981 as a native programming language for the MOS Technology 6502 based Acorn BBC Micro home/personal computer. It is a version of the BASIC programming language adapted for a UK computer literacy project of the BBC. It was written mainly by Sophie Wilson. BBC BASIC, based on the older Atom BASIC (for the Acorn Atom), extended traditional BASIC with named DEF PROC/DEF FN procedures and functions, REPEAT UNTIL loops, and IF THEN ELSE structures inspired by COMAL. The interpreter also included powerful statements for controlling the BBC Micro's four-channel sound output and its low-/high-resolution eight-mode graphics display. One of the unique features of BBC BASIC was the presence of an inline assembler allowing users to write 6502, and later: Z80, NS32016 and ARM assembly language programs. The assembler was fully integrated into the BASIC interpreter and shared variables with it, which could be included between the [ and ] characters, saved via *SAVE and *LOAD, and called via the CALL or USR commands. This allowed developers to write not just assembly language code, but also BASIC code to emit assembly language, making it possible to use code-generation techniques and even write simple compilers in BASIC.", "created": 2002, "backlinksCount": 213, "pageId": 56273, "revisionCount": 308, "dailyPageViews": 63, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/BBC_BASIC" }, "pygmentsHighlighter": { "filename": "basic.py", "fileExtensions": [ "bbc" ], "id": "BBC Basic" }, "leachim6": { "filepath": "b/BBC BASIC.bbc", "example": [ "PRINT \"Hello World\"\n" ], "id": "BBC BASIC" }, "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "" }, "bbcode": { "title": "BBCode", "appeared": 1998, "type": "textMarkup", "country": [ "Unknown" ], "originCommunity": [ "Coalson LLC" ], "wikipedia": { "example": [ "[table]\n[tr]\n [td]table cell 1[/td]\n [td]table cell 2[/td]\n[/tr]\n[tr]\n [td]table cell 3[/td]\n [td]table cell 4[/td]\n[/tr]\n[/table]" ], "related": [ "mediawiki", "html", "php", "regex" ], "summary": "BBCode or Bulletin Board Code is a lightweight markup language used to format posts in many message boards and on sites based on MediaWiki. The available tags are usually indicated by square brackets ([ ]) surrounding a keyword, and they are parsed by the message board system before being translated into a markup language that web browsers understand—usually HTML or XHTML.BBCode was introduced in 1998 by the messageboard software Ultimate Bulletin Board (UBB) implemented in Perl. In 2000 BBCode was used in phpBB—an internet forum system written in PHP and also XMB forum. vBulletin also uses BBCode.", "pageId": 689527, "created": 2004, "backlinksCount": 134, "revisionCount": 794, "dailyPageViews": 358, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/BBCode" }, "pygmentsHighlighter": { "filename": "markup.py", "id": "BBCode" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "bbj": { "title": "BBj", "appeared": 2001, "type": "pl", "description": "BASIS created the newest version of BBx®, the sixth generation, using Java technology. Business BASIC on Java, registered as BBj®, gives application developers the necessary tools to create modern, 21st century e-commerce and enterprise solutions", "website": "https://www.basis.com/bbj", "country": [ "United States" ], "originCommunity": [ "BASIS International Ltd." ], "related": [ "bbx" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/BBj" }, "centralPackageRepositoryCount": 0 }, "bbn-lisp": { "title": "BBN-LISP", "appeared": 1960, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bolt, Beranek and Newman Inc." ], "wikipedia": { "backlinksCount": 49, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/BBN_LISP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3347" }, "bbx": { "title": "BBx", "appeared": 1985, "type": "pl", "description": "In 1985, BASIS released their first generation of Business BASIC to extend the functionality of Business BASIC and aptly named it BBx® (Business BASIC eXtended). Successive generations of BASIS technology continue to enhance the Business BASIC language. A fifth generation product delivers BASIS' first GUI deployment, followed by the sixth generation that introduces modern graphical application development tools for Business BASIC. Coupling these tools with a powerful database management system enable developers to create comprehensive and tightly integrated business applications that are reliable, scalable, cost-effective, and platform independent. Computer programs and associated documentation providing tools and programming language to enable software developers to create and prepare business, internet, and applications software Scientific, nautical, surveying, photographic, cinematographic, optical, weighing, measuring, signalling, checking (supervision), life-saving and teaching apparatus and instruments; apparatus and instruments for conducting, switching, transforming, accumulating, regulating or controlling electricity; apparatus for recording, transmission or reproduction of sound or images; magnetic data carriers, recording discs; automatic vending machines and mechanisms for coin operated apparatus; cash registers, calculating machines, data processing equipment and computers; fire extinguishing apparatus.", "reference": [ "https://trademark.trademarkia.com/bbx-78639049.html", "https://www.basis.com/bbj" ], "country": [ "United States" ], "originCommunity": [ "BASIS International Ltd." ], "related": [ "bbj" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/BBx" }, "centralPackageRepositoryCount": 0 }, "bc-neliac": { "title": "BC NELIAC", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/015559b28c47f2a182d5cd7a4d345a0212c2d040" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkley" ], "hopl": "https://hopl.info/showlanguage.prx?exp=157", "centralPackageRepositoryCount": 0 }, "bc": { "title": "basic calculator", "appeared": 1975, "type": "pl", "standsFor": "basic calculator", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "$ result=$(echo \"scale=2; 5 * 7 /3;\" | bc)\n$ echo $result\n11.66" ], "related": [ "c", "unix", "dc", "reverse-polish-notation", "yacc", "bash" ], "summary": "bc, for basic calculator (often referred to as bench calculator), is \"an arbitrary-precision calculator language\" with syntax similar to the C programming language. bc is typically used as either a mathematical scripting language or as an interactive mathematical shell. A typical interactive usage is typing the command bc on a Unix command prompt and entering a mathematical expression, such as (1 + 3) * 2, whereupon 8 will be output. While bc can work with arbitrary precision, it actually defaults to zero digits after the decimal point, so the expression 2/3 yields 0. This can surprise new bc users unaware of this fact. The -l option to bc sets the default scale (digits after the decimal point) to 20 and adds several additional mathematical functions to the language. bc first appeared in Version 6 Unix in 1975 and was written by Robert Morris and Lorinda Cherry of Bell Labs. bc was preceded by dc, an earlier arbitrary-precision calculator written by the same authors. dc could do arbitrary-precision calculations, but its reverse Polish notation (RPN) syntax was inconvenient for users, and therefore bc was written as a front-end to dc. bc was a very simple compiler (a single yacc source file with a few hundred lines), which converted the new, C-like, bc syntax into dc's postfix notation and piped the results through dc. In 1991, POSIX rigorously defined and standardized bc. Two implementations of this standard survive today: The first is the traditional Unix implementation, a front-end to dc, which survives in Unix and Plan 9 systems. The second is the free software GNU bc, first released in 1991 by Philip A. Nelson. The GNU implementation has numerous extensions beyond the POSIX standard and is no longer a front-end to dc (it is a bytecode interpreter).", "pageId": 646359, "created": 2004, "backlinksCount": 221, "revisionCount": 236, "dailyPageViews": 84, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Bc_(programming_language)" }, "pygmentsHighlighter": { "filename": "algebra.py", "fileExtensions": [ "bc" ], "id": "BC" }, "leachim6": { "filepath": "b/BC.bc", "fileExtensions": [ "bc" ], "example": [ "\"Hello World\"\n" ], "id": "BC" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Bc", "rijuRepl": { "example": [ "\"Hello, world!\n\"\n" ], "id": "https://riju.codes/bc" }, "tryItOnline": "bc", "fileType": "text", "wordRank": 2585, "centralPackageRepositoryCount": 0, "isbndb": "" }, "bcpl": { "title": "BCPL", "appeared": 1966, "type": "pl", "creators": [ "Martin Richards" ], "documentation": [ "http://www.math.bas.bg/bantchev/place/bcpl.html" ], "standsFor": "Basic Combined Programming Language", "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "WRITES" ] ], "assignmentToken": [ [ ":=" ] ], "example": [ "GET \"LIBHDR\"\n\nLET START() = VALOF $(\n FOR I = 1 TO 5 DO\n WRITEF(\"%N! = %I4*N\", I, FACT(I))\n RESULTIS 0\n$)\n\nAND FACT(N) = N = 0 -> 1, N * FACT(N - 1)" ], "wikipedia": { "example": [ "GET \"LIBHDR\"\n\nGLOBAL $(\n\tCOUNT: 200\n\tALL: 201\n$)\n\nLET TRY(LD, ROW, RD) BE\n\tTEST ROW = ALL THEN\n\t\tCOUNT := COUNT + 1\n\tELSE $(\n\t\tLET POSS = ALL & ~(LD | ROW | RD)\n\t\tUNTIL POSS = 0 DO $(\n\t\t\tLET P = POSS & -POSS\n\t\t\tPOSS := POSS - P\n\t\t\tTRY(LD + P << 1, ROW + P, RD + P >> 1)\n\t\t$)\n\t$)\n\nLET START() = VALOF $(\n\tALL := 1\n\tFOR I = 1 TO 12 DO $(\n\t\tCOUNT := 0\n\t\tTRY(0, 0, 0)\n\t\tWRITEF(\"%I2-QUEENS PROBLEM HAS %I5 SOLUTIONS*N\", I, COUNT)\n\t\tALL := 2 * ALL + 1\n\t$)\n\tRESULTIS 0\n$)" ], "related": [ "cpl", "b", "c", "go", "pascal", "java", "fortran", "cpl" ], "summary": "BCPL (\"Basic Combined Programming Language\"; or 'Before C Programming Language' (a common humorous backronym) ) is a procedural, imperative, and structured computer programming language. Originally intended for writing compilers for other languages, BCPL is no longer in common use. However, its influence is still felt because a stripped down and syntactically changed version of BCPL, called B, was the language on which the C programming language was based. BCPL introduced several features of modern programming languages, including using curly braces to delimit code blocks; compilation via virtual machine byte code; and the world's first 'hello world' demonstrator program.", "pageId": 4052, "dailyPageViews": 206, "created": 2001, "backlinksCount": 176, "revisionCount": 291, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/BCPL" }, "helloWorldCollection": [ "// Hello world in BCLP\nGET \"libhdr\"\n\nLET start() = VALOF\n$( writes(\"Hello world*N\")\n RESULTIS 0\n$)\n" ], "leachim6": { "filepath": "b/BCPL.bcl", "fileExtensions": [ "bcl" ], "example": [ "GET \"LIBHDR\"\n\nLET START() BE\n$(\n WRITES(\"Hello World*N\")\n$)\n" ], "id": "BCPL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:BCPL", "tiobe": { "id": "bc" }, "hopl": "https://hopl.info/showlanguage.prx?exp=374", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nBcpl: The Language and Its Compiler|1981|Martin Richards|4472135|4.33|3|1\nBcpl: The Language and Its Compiler|1980|M. Richards|3919566|2.00|1|0\nBcpl On The Bbc Microcomputer User Guide||Chris Jobson|4321106|0.0|0|0\nCurly Bracket Programming Languages: C, Java, C++, Perl, JavaScript, PHP, Ruby, Bcpl, awk, Quakec, Objective-C, Cyclone, Pike, Unrealscript, Rc|2010|Books LLC|14292084|3.00|1|0", "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1980|Implementing BCPL on the burroughs B6700|10.1002/spe.4380100806|3|0|C. Lakos|96e39bcc53135bb26b8bb543bc1a15909bbf261e\n1978|Machine architecture and the programming language BCPL|10.14288/1.0051782|3|0|M. Fox|0673e32eb5993d77fe3561bc3d6811a6d0e7db33\n1980|A space‐efficient code generation scheme for BCPL|10.1002/spe.4380100202|2|0|R. Agarwal and S. Chanson|7fda6c1e2fcf63e526f0d2388a1c13a1f20f5755\n1975|The Emulated OCODE Machine for the Support of BCPL|10.7146/DPB.V4I45.7692|1|0|O. Sørensen|dabdd10fe0d38b4a0b6f165f626fd0310e4112c8\n2013|How BCPL Evolved from CPL|10.1093/comjnl/bxs026|1|0|M. Richards|d6b48c3577d5115b6d7e848accea82e65046b6d4" }, "bcx": { "title": "BCX", "appeared": 1999, "type": "pl", "creators": [ "Kevin Diggins", "Robert Wishlaw" ], "country": [ "Unknown" ], "originCommunity": [ "https://sourceforge.net/p/bcx-basic/discussion" ], "wikipedia": { "related": [ "c" ], "summary": "BCX is a free software programming development application originally created in 1999 by Kevin Diggins. BCX converts BASIC source code to C/C++ source code which can then be compiled using any one of a number of available Microsoft Win32 C/C++ compilers. For many years, most implementations of BASIC shared a nagging drawback - the programs that users created performed slower than similar programs that were created using C/C++. BCX changed that by giving users the friendliness and ease of use of the BASIC language and coupled it with the high performance and flexibility of C/C++. BCX is written in the BCX BASIC language, making BCX a self-translating translator. BCX was made an open source project in 2004. Since then, several members of the BCX community have led the continued development and maintenance of BCX. Recent project forks have resulted in variants of BCX that can produce native-code applications that run on Linux and Apple operating systems. BCX contains verbs that simplify the creation of Windows UI desktop applications. Unlike many BASIC implementations that rely on run-time engines, the combination of BCX and most C/C++ compilers produce efficient and performant native code applications. BCX can be used to create GUI, DLL, console mode, and web server applications. BCX can use the Standard C Library.", "created": 2005, "backlinksCount": 23, "pageId": 1442891, "revisionCount": 179, "dailyPageViews": 10, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/BCX" }, "centralPackageRepositoryCount": 0 }, "bdl": { "title": "BDL", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dea46a2f3329d44386208e9e237a80725b74f1ef" ], "country": [ "United States" ], "originCommunity": [ "Hewlett-Packard" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1298", "centralPackageRepositoryCount": 0 }, "beads-lang": { "title": "beads-lang", "appeared": 2016, "type": "pl", "creators": [ "Edward de Jong" ], "website": "http://beadslang.org/", "reference": [ "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "fileExtensions": [ "beads" ], "country": [ "United States" ], "originCommunity": [ "Edward de Jong" ], "domainName": { "registered": 2016, "name": "beadslang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "example": [ "beads level 1 program calculator\n// flutter version available at: on github, look for: flutter-calculator-demo\n// article: https://itnext.io/building-a-calculator-app-in-flutter-824254704fe6\n\nconst\n C_OP = #3E424D // keycap fill for an operator like C\n C_DIGIT = #6E6E6E // keycap fill for a digit\n C_ARITH = #1A4C6E // keycap fill for arithmetic buttons\n\n // warning: you must use the same unicode math chars in case statements later in arithmetic()\n KEYCAPS = [ 'C', '±', '%', '÷', // tried \\u207A\\u2215\\u208B instead of ± but it is ugly\n '1', '2', '3', 'x', \n '4', '5', '6', '−', // \\u2212 is the minus sign \n '7', '8', '9', '+',\n '', '0', '.', '='] // '⌫' is U+232B, for future undo key\n\n KEYCOLORS = [C_OP, C_OP, C_OP, C_ARITH,\n C_DIGIT, C_DIGIT, C_DIGIT, C_ARITH,\n C_DIGIT, C_DIGIT, C_DIGIT, C_ARITH,\n C_DIGIT, C_DIGIT, C_DIGIT, C_ARITH,\n C_OP, C_DIGIT, C_OP, C_ARITH]\n\n SPACING = 3 // points between each cell\n HAIR = \"\\u2009\" // a thin space 200A is even thinner\n\nrecord a_term\n ss : str // the string containing the contents of the term\n op : str // the operator in keycap string form '+', '-'...\n\nrecord a_state\n terms : array of a_term\n termx : num // which term we are on\n chain_op : str // chain operator char for repeated = presses\n chain_val: num // chain value to repeat\n fresh : yesno // if this is Y, then next digit will clear existing value\n\nvar g : a_state\n\ncalc main_init\n g.terms[1].ss = \"\"\n g.termx = 1\n g.fresh = Y\n\nvert slice main_draw\n var cellsize = if b.box.width > b.box.height then b.box.height/8 else b.box.width/4\n var result_v = cellsize*2 // need to enhance compiler so that expressions don't get converted \n var keys_v = cellsize*5\n var keys_maxh = min(b.box.width, cellsize*8) // don't go wider than 8 squares wide (double)\n draw_rect(b.box, fill:#121F30)\n skip 10 al\n add result_v px d_result\n add keys_v px d_keys(keys_maxh)\n skip 10 al\n\ndraw d_result\n draw_rect(b.box, fill:#0D161F)\n\n // build the string out of the active terms\n var s : str = \"\"\n loop array:g.terms index:i\n g.terms[i].ss &=> s\n if g.terms[i].op <> U\n HAIR & g.terms[i].op & HAIR &=> s // append the operator\n\n if (s == \"\")\n s = \"0\" // when nothing is entered into our expression, call it zero\n\n draw_str(b.box, s, size:b.box.height*0.5, just:RIGHT, indent:20 pt, color:WHITE)\n\nhorz slice d_keys(\n totwidth -- max width we allow for the grid, might be all of the space\n )\n // in landscape mode, we don't want the key grid to get too wide, looks bad\n skip 10 al\n add totwidth px d_keygrid\n skip 10 al\n\ntable d_keygrid\n horz slice\n skip SPACING pt\n loop reps:4\n add 10 al\n skip SPACING pt\n vert slice\n skip SPACING pt\n loop reps:5\n add 10 al\n skip SPACING pt\n\n // inside grid cell draw function, b has properties b.box, cell_seq, cell:a_xy, nrows, ncols\n cell\n draw_rect(b.box, fill:KEYCOLORS[b.cell_seq], corner:6 pt)\n draw_str(b.box, KEYCAPS[b.cell_seq], size:b.box.height, color:WHITE)\ntrack EV_TAP\n // respond to the command\n case b.cell_seq\n | 1 // clear\n do_clear\n\n | 2 // plusminus - change the sign of the current term\n sign_change(g.termx)\n\n | 3 // percent - divide the current term by 100\n do_percent\n\n | 4, 8, 12, 16 // arithmetic operations\n do_arith(KEYCAPS[b.cell_seq])\n \n | 17 // future feature - backspace\n nop // do_backspace\n\n | 19 // period\n do_period\n\n | 20 // equals\n do_equals\n\n else\n // must be a digit\n add_digit(KEYCAPS[b.cell_seq]) \n\n// calc do_backspace\n// log \"backspace\"\n// reserved for future undo functionality\n// this will test ability to read code and extend it\n \ncalc do_percent\n // if the current term is empty do nothing\n // apple's calculator takes the sequence 900+% and makes it 900^2 which is nutty\n if g.terms[g.termx].ss <> \"\"\n if g.termx > 1\n // when we have two terms, like 300 + 20% we take 20% of the first term and replace\n g.terms[g.termx].ss = to_str(eval(g.termx)*eval(g.termx-1)/100)\n else\n // we only have 1 term, so just divide it by 100\n g.terms[g.termx].ss = to_str(eval(g.termx)/100)\n g.fresh = Y\n\ncalc eval (\n termx -- term index to evaluate\n ) : num // convert a term to a floating point number\n var ss : str = g.terms[termx].ss\n if ss == \"\"\n return 0\n return to_num(ss)\n\ncalc do_clear // clear the current term to blank.\n // if the user has entered 123+, there is an empty current term will do nothing\n g.terms[g.termx].ss = \"\"\n\ncalc sign_change(\n tx -- term index\n )\n var old : str = g.terms[tx].ss\n if old == \"\"\n // we have no operand yet in the current term, so\n // either ignore it or change previous operand's sign\n // this is what apple's calculator does\n if tx > 1\n sign_change(tx-1) // change previous operand's sign. kinda weird really.\n elif str_begins(old, \"-\")\n g.terms[tx].ss = str_subset(old, from:2) // strip the minus\n else\n g.terms[tx].ss = '-' & old // prepend a minus\n\ncalc do_period\n // ignore attempts to add more than one period\n var list : array of num\n str_find(g.terms[g.termx].ss, \".\", list)\n if tree_count(list) == 0\n add_digit(\".\") // no period yet, so append one\n\ncalc do_equals\n var val = eval(1) // start with the first term by itself\n var val2\n\n // if there is no second or later term use the chain operator and value\n if tree_count(g.terms) < 2\n // use repeat if we have one\n if g.chain_op <> U\n val = arithmetic(g.chain_op, val, g.chain_val)\n else\n // two or more terms to process\n loop from:1 index:tx while:g.terms[tx+1].ss <> \"\" and g.terms[tx].op <> U\n val2 = eval(tx+1)\n // remember the last operator we used as our chaining value\n g.chain_op = g.terms[tx].op\n g.chain_val = val2\n val = arithmetic(g.chain_op, val, val2)\n\n // calculation done, convert the value back as if we entered it\n trunc g.terms // zap the array\n g.terms[1].ss = to_str(val) // replace our value\n g.termx = 1\n g.fresh = Y\n\ncalc arithmetic(\n operand : str -- operation like \"+\", must match keycap\n term1 : num\n term2 : num\n ) : num -- resulting value\n var result\n case operand // note: these operators must match the keycaps\n | '+'\n term1 + term2 => result\n | '−'\n term1 - term2 => result\n | 'x'\n term1 * term2 => result\n | '÷'\n term1 / term2 => result\n else\n result = ERR\n return result\n \ncalc add_digit(\n digit : str // digit to append to current term\n )\n // if we are starting fresh, then erase what was there before\n // we also replace the previous string if it was a leading zero\n if g.fresh or g.terms[g.termx].ss == \"0\"\n g.terms[g.termx].ss = \"\" // clear whatever was there\n digit &=> g.terms[g.termx].ss\n g.fresh = N\n\ncalc do_arith(\n operand : str // '+', etc\n )\n if g.terms[g.termx].ss == \"\"\n // we have no term, so treat that as replacing the previously entered operation\n // and if this is the very beginning and we have no prior operation, ignore it\n if g.termx == 1\n // starting with a plus on an empty term is ignored\n return\n \n // multiple operators in a row, rewrite the previous operator\n g.terms[g.termx-1].op = operand\n else\n // we did have a term, advance to the next term \n g.terms[g.termx].op = operand\n inc g.termx\n g.terms[g.termx].ss = \"\" // empty term " ] }, "beagle": { "title": "beagle", "appeared": 2019, "type": "pl", "isDead": true, "creators": [ "Alex Couch" ], "reference": [ "https://github.com/AlexCouch/beagle-lang-specifications" ], "githubRepo": { "firstCommit": 2019, "stars": 15, "subscribers": 1, "created": 2019, "updated": 2022, "description": "The old official source code for the beagle programming language. New repo here: https://github.com/beaglelang/beagle-lang", "forks": 0, "issues": 0, "url": "https://github.com/AlexCouch/beagle-lang" } }, "beam-bytecode": { "title": "BEAM Bytecode", "appeared": 2017, "type": "bytecode", "reference": [ "http://gomoripeti.github.io/beam_by_example/" ], "country": [ "Hungary" ], "originCommunity": [ "Péter Gömöri" ] }, "beam-vm": { "title": "BEAM Erlang virtual machine", "appeared": 2011, "type": "vm", "creators": [ "Bogumil Hausman" ], "reference": [ "https://www.erlang.org/blog/a-brief-beam-primer/" ], "standsFor": "Bogdan's Erlang Abstract Machine", "country": [ "Sweden" ], "originCommunity": [ "Ericsson" ], "wikipedia": { "summary": "BEAM is the virtual machine at the core of the Erlang Open Telecom Platform (OTP). BEAM is part of the Erlang Run-Time System (ERTS), which compiles Erlang and Elixir source code into bytecode, which is then executed on the BEAM. BEAM bytecode files have the .beam file extension.Originally BEAM was short for Bogdan's Erlang Abstract Machine, named after Bogumil \"Bogdan\" Hausman, who wrote the original version, but the name may also be referred to as Björn's Erlang Abstract Machine, after Björn Gustavsson, who wrote and maintains the current version. Both developers worked on the system while at Ericsson.", "backlinksCount": 18, "pageId": 57341082, "dailyPageViews": 49, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/BEAM_(Erlang_virtual_machine)" } }, "beanshell": { "title": "BeanShell", "appeared": 1999, "type": "pl", "website": "http://www.beanshell.org/", "country": [ "Various" ], "originCommunity": [ "Java Community Process" ], "domainName": { "registered": 1999, "awisRank": { "2022": 4177493 }, "name": "beanshell.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "java", "jvm", "javascript", "perl" ], "summary": "BeanShell is a Java-like scripting language, invented by Patrick Niemeyer. It runs in the Java Runtime Environment (JRE) and uses a variation of the Java syntax, in addition to scripting commands and syntax.", "pageId": 1565435, "created": 2005, "backlinksCount": 120, "revisionCount": 118, "dailyPageViews": 44, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/BeanShell" }, "leachim6": { "filepath": "b/Beanshell.bsh", "fileExtensions": [ "bsh" ], "example": [ "print (\"Hello World\");\n" ], "id": "Beanshell" }, "rijuRepl": { "example": [ "print(\"Hello, world!\");\n" ], "id": "https://riju.codes/beanshell" }, "tryItOnline": "beanshell", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nJava Programming Language Family: Godiva, Scala, Processing, Aspectj, Groovy, Javafx Script, Einstein, J Sharp, Judoscript, Jasmin, Beanshell|2011|Books LLC|15219374|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2011|Apress|Pro Android Python with SL4A: Writing Android Native Apps Using Python, Lua, and Beanshell|Ferrill, Paul|9781430235699\n2011|Apress|Pro Android Python with SL4A: Writing Android Native Apps Using Python, Lua, and Beanshell|Ferrill, Paul|9781430235705", "semanticScholar": "" }, "beatnik": { "title": "Beatnik", "appeared": 2001, "type": "esolang", "country": [ "United States" ], "rijuRepl": { "example": [ "Soars, larkspurs, rains.\nIndistinctness.\nMario snarl (nurses, natures, rules...) sensuously retries goal.\nAgribusinesses' costs par lain ropes (mopes) autos' cores.\nTuner ambitiousness.\nFlit.\nDour entombment.\nLegals' saner kinking lapse.\nNests glint.\nDread, tied futures, dourer usual tumor grunts alter atonal\n garb tries shouldered coins.\nTaste a vast lustiness.\nStile stuns gad subgroup gram lanes.\nDraftee insurer road: cuckold blunt, strut sunnier.\nRely enure pantheism: arty gain groups (genies, pan) titters, tattles, nears.\nBluffer tapes? Idle diatom stooge!\nFeted antes anklets ague? Remit goiter gout!\nDoubtless teared toed alohas will dull gangs' aerials' tails' sluices;\nGusset ends! Gawkier halo!\n\nEnter abstruse rested loser beer guy louts.\nCurtain roams lasso weir lupus stunt.\nTruant bears animate talon. Entire torte originally timer.\nRedo stilt gobs.\n\nUtter centaurs;\nUrgent stars;\nUsurers (dilute);\nNoses;\nBones;\nBrig sonar graders;\nUtensil silts;\nLazies.\nFret arson veterinary rows.\n\nAtlas grunted: \"Pates, slues, sulfuric manor liaising tines,\n trailers, rep... unfair! Instant snots!\"\n\nSled rested until eatery fail.\nErgs fortitude\n Indent spotter\nEuros enter egg.\nCurious tenures.\nTorus cutlasses.\nSarong torso earns cruel lags it reeled.\n\nEngineer: \"Erase handbag -- unite ratification!\"\n\noaring oaten donkeys unsold, surer rapid saltest tags\nBUTTERED TIBIA LUGS REWIRING TOILETS\nanion festers raring edit epilogues.\nDIRGE ROTOR.\nlinnet oaring.\nGORE BOOTIES.\nIroned goon lists tallest sublets --\nRiots,\nRaucous onset.\n\nIgnobly, runners' diet anguishes sunrise loner.\nErode mob, slier switcher!\nLoaners stilt drudge pearl atoll, risking hats' ends.\n\nRebind sitters.\n\nToga epistles -- crud lard. (Pager purse dons souls.)\n\nglob title a curio hired rites shed suds lade grease strut arctic revs toad\nunless idlers rind stilt region land GERMICIDES SULTANA GUTS gill siting leans\nnice spurs\ntests gloves\nroused asp\n\nHoles! Moles! (Sores!)\nHygienists! Scars! (Asses!)\nSmells spell rares.\n\nCubs instant sing in parse goodies.\nRosin. Unhelpful sisal acres. Slope told.\nMALENESS PASTA LAB. \"Infirmary vine,\" rang illiterates (beans).\nRosin sours, insults truss abalones, nailed rules, helical atlases.\nDear remodeling stings mar rents.\nSunless shiner orb (silly idol.)\nClarity disses senna.\nVagabonds sauted; sloes performed gelds.\nAlter post radial lip sectioning gums.\nSaint Towellings.\nLarger aeons telephone stolid char, pal!\nBoats Dean forsook, rosters, tunas, terrariums -- united, traced.\nNude pagoda careens.\n" ], "description": "Stack-based esoteric programming language created by Cliff L. Biffle", "fileExtensions": [ "beatnik" ], "website": "https://cliffle.com/esoterica/beatnik/", "gitRepo": "https://github.com/catseye/Beatnik", "id": "https://riju.codes/beatnik" }, "esolang": "https://esolangs.org/wiki/Beatnik", "isbndb": "" }, "beautiful-report-language": { "title": "beautiful-report-language", "appeared": 2003, "type": "pl", "website": "http://brl.sourceforge.net/", "reference": [ "http://brl.sourceforge.net/brl_toc.html" ], "aka": [ "BRL" ], "domainName": { "name": "brl.sourceforge.net" }, "example": [ "[(define myname \"Bruce\")\n(define my \"Bruce's\")]\n\n
\nThis is [my] web page.\n[myname myname\n myname myname]\n\n[my] favorite person is [[your name here].\n[my] favorite number is [(brl-random 2)].\n
" ], "centralPackageRepositoryCount": 0 }, "bebasic": { "title": "BeBasic", "appeared": 2009, "type": "pl", "creators": [ "BBK" ], "website": "https://github.com/wenerme/bbvm", "country": [ "China" ], "originCommunity": [ "polymer-china" ], "example": [ "; ____________________\n; \\______ \\______ \\___ _______\n; | | _/| | _/\\ \\/ / \\\n; | | \\| | \\ \\ / Y Y \\\n; |______ /|______ / \\_/|__|_| /\n; \\/ \\/ \\/\n\nJMP CODE\nDATA STR CHAR \"Hello, BBvm\",0\nCODE:\n\nOUT 1, STR\nEXIT" ], "githubRepo": { "firstCommit": 2014, "stars": 12, "forks": 1, "subscribers": 2, "created": 2014, "updated": 2022, "description": "BeBasic Virtual Machine", "issues": 0, "url": "https://github.com/wenerme/bbvm" }, "repoStats": { "firstCommit": 2014, "commits": 195, "committers": 1, "files": 159 } }, "bed-format": { "title": "Browser Extensible Data Format", "appeared": 2004, "type": "textDataFormat", "description": "BED (Browser Extensible Data) format provides a flexible way to define the data lines that are displayed in an annotation track. BED lines have three required fields and nine additional optional fields. The number of fields per line must be consistent throughout any single set of data in an annotation track. The order of the optional fields is binding: lower-numbered fields must always be populated if higher-numbered fields are used.", "reference": [ "https://doi.org/10.1093/nar/gkh103" ], "standsFor": "Browser Extensible Data", "country": [ "United States" ], "originCommunity": [ "University of California Santa Cruz" ], "example": [ "track name=pairedReads description=\"Clone Paired Reads\" useScore=1\nchr22 1000 5000 cloneA 960 + 1000 5000 0 2 567,488, 0,3512\nchr22 2000 6000 cloneB 900 - 2000 6000 0 2 433,399, 0,3601" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "bedsocs": { "title": "BEDSOCS", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/18db935aa4522c154d4ce918a49de474537e0343" ], "country": [ "United States" ], "originCommunity": [ "IBM", "Motorola" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4161", "centralPackageRepositoryCount": 0 }, "bee": { "title": "bee", "appeared": 2019, "type": "pl", "creators": [ "Elucian Moise" ], "website": "https://sagecode.net/bee-lang/", "country": [ "United States" ], "originCommunity": [ "Sage-Code" ], "githubRepo": { "firstCommit": 2019, "stars": 0, "subscribers": 4, "created": 2019, "updated": 2022, "description": "Bee Language", "forks": 0, "issues": 0, "url": "https://github.com/sage-code/bee" }, "repoStats": { "firstCommit": 2019, "commits": 671, "committers": 5, "files": 95 }, "subreddit": [ { "memberCount": { "2017": 29, "2022": 1273 }, "url": "https://reddit.com/r/bee_lang" } ] }, "beebasic": { "title": "BeeBasic", "appeared": 2013, "type": "pl", "reference": [ "https://sourceforge.net/projects/beebasic/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8512", "centralPackageRepositoryCount": 0 }, "beef-lang": { "title": "BEEF", "appeared": 1961, "type": "pl", "reference": [ "https://semanticscholar.org/paper/cc99ab4b69a92f11fdf90f40e3fed8e6fae361bd" ], "country": [ "United States" ], "originCommunity": [ "Westinghouse Electric Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3356", "wordRank": 5584, "centralPackageRepositoryCount": 0 }, "beef": { "title": "beef-lang", "appeared": 2019, "type": "pl", "creators": [ "Brian Fiete" ], "website": "https://www.beeflang.org/", "reference": [ "https://news.ycombinator.com/item?id=21991382" ], "fileExtensions": [ "bf" ], "country": [ "Unknown" ], "originCommunity": [ "beefytech" ], "domainName": { "registered": 2018, "awisRank": { "2022": 5248960 }, "name": "beeflang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Console.WriteLine" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2019, "stars": 2015, "subscribers": 46, "created": 2019, "updated": 2022, "description": "Beef Programming Language", "forks": 109, "issues": 158, "url": "https://github.com/beefytech/Beef" }, "repoStats": { "firstCommit": 2019, "commits": 4235, "committers": 55, "files": 3871 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "bf" ], "aceMode": "csharp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-csharp", "tmScope": "source.cs", "repos": 137, "id": "Beef" }, "githubBigQuery": { "repos": 3, "users": 3, "id": "Beef" }, "leachim6": { "filepath": "b/Beef.bf", "fileExtensions": [ "bf" ], "example": [ "using System;\n\nnamespace HelloWorld\n{\n class Program\n {\n static void Main()\n {\n Console.WriteLine(\"Hello World\");\n }\n }\n}\n" ], "id": "Beef" }, "redditDiscussion": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/elbt5u/introducing_the_beef_programming_language/" ], "wordRank": 5584, "isbndb": "" }, "beflix": { "title": "BEFLIX", "appeared": 1963, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "summary": "BEFLIX is the name of the first embedded domain-specific language for computer animation, invented by Ken Knowlton at Bell Labs in 1963. The name derives from a combination of Bell Flicks. Ken Knowlton used BEFLIX to create animated films for educational and engineering purposes. He also collaborated with the artist Stan Vanderbeek at Bell Labs to create a series of computer-animated films called Poemfields between 1966 and 1969. BEFLIX was developed on the IBM 7090 mainframe computer using a Stromberg-Carlson SC2040 microfilm recorder for output. The programming environment targeted by BEFLIX consisted of a FORTRAN II implementation with FORTRAN II Assembly Program (FAP) macros. The first version of BEFLIX was implemented through the FAP macro facility. A later version targeting FORTRAN IV resembled a more traditional subroutine library and lost some of the unique flavor to the language. Pixels are produced by writing characters to the screen of the microfilm recorder with a defocused electron beam. The SC2040 used a charactron tube to expose microfilm. In BEFLIX, the electron beam is defocused to draw pixels as blurred character shapes. Characters are selected to create a range of grayscale values for pixels. The microfilm recorder is not connected directly to the 7090, but communicates through magnetic tape. BEFLIX writes the magnetic tape output on the 7090 and the film recorder reads the tape to create the film output. BEFLIX also supports a preview mode where selected frames of the output are written to the line printer.", "created": 2006, "backlinksCount": 8, "pageId": 5621549, "revisionCount": 20, "dailyPageViews": 7, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/BEFLIX" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7742", "centralPackageRepositoryCount": 0 }, "befunge": { "title": "Befunge", "appeared": 1993, "type": "esolang", "creators": [ "Chris Pressey" ], "country": [ "United States" ], "originCommunity": [ "Cat's Eye Technologies" ], "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "wikipedia": { "example": [ ">25*\"!dlrow ,olleH\":v\n v:,_@\n > ^" ], "related": [ "forth", "intercal", "ascii", "brainfuck", "lisp", "python", "whitespace", "malbolge" ], "summary": "Befunge is a stack-based, reflective, esoteric programming language. It differs from conventional languages in that programs are arranged on a two-dimensional grid. \"Arrow\" instructions direct the control flow to the left, right, up or down, and loops are constructed by sending the control flow in a cycle. It has been described as \"a cross between Forth and Lemmings.\" A worthy companion to INTERCAL; a computer language family which escapes the quotidian limitation of linear control flow and embraces program counters flying through multiple dimensions with exotic topologies.", "pageId": 53391, "dailyPageViews": 80, "created": 2002, "backlinksCount": 57, "revisionCount": 228, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Befunge" }, "githubLanguage": { "fileExtensions": [ "befunge" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.befunge", "repos": 1, "id": "Befunge" }, "githubBigQuery": { "repos": 7, "users": 7, "id": "Befunge" }, "pygmentsHighlighter": { "filename": "esoteric.py", "fileExtensions": [ "befunge" ], "id": "Befunge" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2014, "committerCount": 2, "commitCount": 20, "url": "https://github.com/johanasplund/sublime-befunge" }, "projectEuler": { "memberCount": { "2019": 9, "2022": 10 }, "id": "Befunge" }, "helloWorldCollection": [ "v Hello World in Befunge\n\n>\"dlroW olleH\",,,,,,,,,,,@\n" ], "leachim6": { "filepath": "b/Befunge.be", "fileExtensions": [ "be" ], "example": [ ">\"dlroW olleH\",,,,,,,,,,,@\n" ], "id": "Befunge" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Befunge", "quineRelay": "Befunge", "rijuRepl": { "example": [ "64+\"!dlrow ,olleH\">:#,_@\n" ], "description": "Two-dimensional esoteric programming language invented in 1993 by Chris Pressey with the goal of being as difficult to compile as possible", "fileExtensions": [ "be", "bf", "b93", "b98", "befunge" ], "website": "https://catseye.tc/article/Languages.md#befunge-93", "gitRepo": "https://github.com/amicloud/befunge93", "id": "https://riju.codes/befunge" }, "tryItOnline": "befunge", "hopl": "https://hopl.info/showlanguage.prx?exp=1717", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "behavior-markup-language": { "title": "BML", "appeared": 2007, "type": "xmlFormat", "website": "http://www.mindmakers.org/projects/bml-1-0/wiki", "standsFor": "Behavior Markup Language", "country": [ "Various" ], "originCommunity": [ "Communicative Machines" ], "example": [ "\n \n This is an example\n \n \n \n ...\n \n \n \n \n \n " ], "semanticScholar": "" }, "bel-lang": { "title": "Biological Expression Language", "appeared": 2003, "type": "textDataFormat", "website": "http://openbel.org/", "reference": [ "https://github.com/OpenBEL/language" ], "standsFor": "Biological Expression Language", "country": [ "United States" ], "originCommunity": [ "bel.bio" ], "domainName": { "registered": 2011, "name": "openbel.org" }, "example": [ "r(HGNC:CFTR, var(\"r.1653_1655delcuu\"))\nr(REF:\"NM_000492.3\", var(\"r.1653_1655delcuu\"))" ], "semanticScholar": "" }, "bel": { "title": "Bel", "appeared": 2019, "type": "pl", "creators": [ "Paul Graham" ], "website": "http://paulgraham.com/bel.html", "documentation": [ "https://sep.yimg.com/ty/cdn/paulgraham/bellanguage.txt?t=1595850613&" ], "country": [ "United States" ], "related": [ "arc" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasPairs": { "example": "(foo . bar)", "value": true }, "hasSymbols": { "example": "foo", "value": true }, "hasCharacters": { "example": "\\p\n; Characters that aren't letters may have longer names. For example the bell character, after which Bel is named, is\n\\bel", "value": true }, "hasLists": { "example": "; here is a list of a, b, and c:\n(a . (b . (c . nil)))\n; can be written as\n(a b c)", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStreams": { "example": "", "value": true }, "hasExpressions": { "example": "(+ 1 2)", "value": true }, "hasFunctions": { "example": "(fn (x) (+ x 1))", "value": true }, "hasBooleans": { "example": "; The symbol nil represents falsity as well as the empty list.\n; The symbol t is the default representation for truth, but any object other than nil also counts as true. ", "value": true }, "hasStrings": { "example": "(\\h \\e \\l \\l \\o)\n; can also be represented as\n\"hello\"", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasMacros": { "example": "; A macro is essentially a function that generates code. I would have \n; liked the first example of a macro to be something simpler, but fn\n; is the one we need first. So I'll introduce macros using a simpler \n; macro that isn't part of Bel, then explain fn.\n; Here is a very simple macro:\n(mac nilwith (x)\n (list 'cons nil x))\n", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "prn" ] ], "example": [ "; Bel in Bel. 9 October 2019, 9:14 GMT\n(def no (x)\n (id x nil))\n(def atom (x)\n (no (id (type x) 'pair)))\n(def all (f xs)\n (if (no xs) t\n (f (car xs)) (all f (cdr xs))\n nil))\n(def some (f xs)\n (if (no xs) nil\n (f (car xs)) xs\n (some f (cdr xs))))\n(def reduce (f xs)\n (if (no (cdr xs))\n (car xs)\n (f (car xs) (reduce f (cdr xs)))))\n(def cons args\n (reduce join args))\n(def append args\n (if (no (cdr args)) (car args)\n (no (car args)) (apply append (cdr args))\n (cons (car (car args))\n (apply append (cdr (car args))\n (cdr args)))))" ] }, "ber": { "title": "BER", "appeared": 1988, "type": "pl", "reference": [ "https://www.rpmfind.net/linux/rpm2html/search.php?query=golang-github-go-asn1-ber-asn1-ber-devel" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1858", "centralPackageRepositoryCount": 0 }, "berkeley-db-lib": { "title": "Berkeley DB", "appeared": 1994, "type": "library", "country": [ "United States" ], "originCommunity": [ "Sleepycat Software", "Oracle Corporation" ], "writtenIn": [ "c" ], "wikipedia": { "summary": "Berkeley DB (BDB) is a software library intended to provide a high-performance embedded database for key/value data. Berkeley DB is written in C with API bindings for C++, C#, Java, Perl, PHP, Python, Ruby, Smalltalk, Tcl, and many other programming languages. BDB stores arbitrary key/data pairs as byte arrays, and supports multiple data items for a single key. Berkeley DB is not a relational database.BDB can support thousands of simultaneous threads of control or concurrent processes manipulating databases as large as 256 terabytes, on a wide variety of operating systems including most Unix-like and Windows systems, and real-time operating systems. BDB was commercially supported and developed by Sleepycat Software from 1996 to 2006. This company was acquired by Oracle Corporation in February 2006, which continues to develop and sell Berkeley DB. Under Oracle's stewardship, \"Berkeley DB\" has become a common brand name for three distinct products: Oracle Berkeley DB, Berkeley DB Java Edition, and Berkeley DB XML. These three products all share a common ancestry and are currently under active development.", "backlinksCount": 190, "pageId": 4706, "dailyPageViews": 150, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Berkeley_DB" } }, "berkeleydb": { "title": "Berkeley DB", "appeared": 1991, "type": "library", "description": "The Berkeley Database (Berkeley DB) is an embedded database system that can be used in applications requiring high-performance concurrent storage and retrieval of key/value pairs. The software is distributed as a library that can be linked directly into an application. It provides a variety of programmatic interfaces, including callable APIs for C, C++, Perl, Tcl and Java. Users may download Berkeley DB from Sleepycat Software’s Web site, at www.sleepycat.com.", "reference": [ "http://static.usenix.org/event/usenix99/full_papers/olson/olson.pdf" ], "country": [ "United States" ], "originCommunity": [ "Sleepycat Software, Inc." ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "berry": { "title": "Berry", "appeared": 2018, "type": "pl", "creators": [ "官文亮" ], "description": "Berry is a ultra-lightweight dynamically typed embedded scripting language. It is designed for lower-performance embedded devices. The Berry interpreter-core's code size is less than 40KiB and can run on less than 4KiB heap (on ARM Cortex M4 CPU, Thumb ISA and ARMCC compiler).", "website": "https://github.com/berry-lang/berry", "country": [ "China" ], "originCommunity": [ "https://github.com/berry-lang/" ], "example": [ "def fib(x)\n if (x <= 1)\n return x\n end\n return fib(x - 1) + fib(x - 2)\nend" ], "githubRepo": { "stars": 1400, "forks": 40, "subscribers": 26, "created": 2018, "updated": 2022, "description": "A ultra-lightweight embedded scripting language optimized for microcontrollers.", "url": "https://github.com/berry-lang/berry" }, "repoStats": { "firstCommit": 2018, "commits": 927, "committers": 31, "files": 199 } }, "besys": { "title": "BESYS", "appeared": 1958, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f1e8d0446d70f3538836ea0d6c2db445fd9174ff" ], "country": [ "Unknown" ], "originCommunity": [ "R.E. Drummond" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3515", "centralPackageRepositoryCount": 0 }, "beta-basic": { "title": "Beta BASIC", "appeared": 1983, "type": "pl", "country": [ "United States" ], "originCommunity": [ "BetaSoft" ], "wikipedia": { "related": [ "sinclair-basic", "bbc-basic", "sam-coupe" ], "summary": "Beta BASIC is a BASIC interpreter for the Sinclair Research ZX Spectrum microcomputer, written by Dr Andy Wright in 1983 and sold by his one-man software house BetaSoft. BetaSoft also produced a regular newsletter/magazine, BetaNews. Originally it started as a BASIC toolkit but over time it grew into a full replacement.", "created": 2005, "backlinksCount": 95, "pageId": 2793688, "revisionCount": 75, "dailyPageViews": 8, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Beta_BASIC" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "beta-project": { "title": "BETA Project", "appeared": 1961, "type": "grammarLanguage", "description": "The promising 'BETA project'' in Novosibirsk primarily designed by Dr. A. P. Ershov, M. Shvartsman, A. A. Baehrs was intended to produce compilers from language descriptions almost automatically, and it had Algol 68, PL/I and Simula 67 as its first objectives", "reference": [ "http://www.softwarepreservation.org/projects/ALGOL/algol68impl/" ], "country": [ "Russia" ], "originCommunity": [ "USSR Academy of Information Sciences" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "beta-prolog": { "title": "Beta-Prolog", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bf615fd2ea5daad2e10d16d919923c8352d416ba" ], "country": [ "Japan" ], "originCommunity": [ "Kyushu Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5028", "centralPackageRepositoryCount": 0 }, "beta": { "title": "BETA", "appeared": 1983, "type": "pl", "creators": [ "Bent Bruun Kristensen", "Ole Lehrmann Madsen", "Birger Møller-Pedersen", "Kristen Nygaard" ], "website": "http://cs.au.dk/~beta", "country": [ "Norway" ], "originCommunity": [ "Scandinavian School of object- orientation" ], "visualParadigm": false, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "max: (#\n x, y, z: @integer\nenter (x, y)\ndo\n (if x >= y // True then\n x -> z\n else\n y -> z\n if)\nexit z\n#)" ], "related": [ "simula", "eiffel" ], "summary": "BETA is a pure object-oriented language originating within the \"Scandinavian School\" in object-orientation where the first object-oriented language Simula was developed. Among its notable features, it introduced nested classes, and unified classes with procedures into so called patterns.", "pageId": 135868, "dailyPageViews": 27, "created": 2002, "backlinksCount": 28, "revisionCount": 125, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/BETA_(programming_language)" }, "helloWorldCollection": [ "{ *** Hello World in BETA ***}\n(#\n do\n 'Hello World!'->putLine\n#)\n" ], "leachim6": { "filepath": "b/Beta.bet", "fileExtensions": [ "bet" ], "example": [ "ORIGIN '~beta/basiclib/betaenv'\n-- program: Descriptor --\n(* Hello World in BETA *)\n(# do 'Hello World' -> putLine #)\n" ], "id": "Beta" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Beta", "tiobe": { "id": "BETA" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1032", "fileType": "text", "wordRank": 2635, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2000|Apress|C# Programming with the Public Beta|Robinson, Simon and Templeman, Julian and Watson, Karli and Harvey, Burt|9781861004871\n1993|Assn for Computing Machinery|Object-Oriented Programming in the Beta Programming Language|Madsen, Ole Lehrmann and Moller-Pedersen, Birger and Nygaard, Kristen|9780201624304\n1996|O'Reilly Media|JavaScript: The Definitive Guide, Beta Version (Nutshell Handbooks)|Flanagan, David|9781565921931\n2001|Apress|VB.NET Programming with the Public Beta|Billy Hollis and Rockford Lhotka|9781861004918\n2005|Addison-Wesley Professional|ADO.NET and System.XML V. 2.0--The Beta Version|Homer, Alex and Sussman, Dave and Fussell, Mark|9780321247124\n2011|Nova Science Pub Incorporated|Beta Cells|Sarah E. Gallagher|9781617612121" }, "bgraf2": { "title": "BGRAF2", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/83aab389ba4b2e40390c37ecae56778089bca9c4" ], "country": [ "Israel" ], "originCommunity": [ "Ben-Gurion University of the Negev", "Hebrew University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4140", "centralPackageRepositoryCount": 0 }, "bhsl": { "title": "BHSL", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2585e5a917cfd81d6c52f6f240def5101cd092ec" ], "country": [ "United States" ], "originCommunity": [ "Electronic Associates Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3003", "centralPackageRepositoryCount": 0 }, "bibtex": { "title": "BibTeX", "appeared": 1985, "type": "application", "website": "https://www.ctan.org/pkg/bibtex", "fileExtensions": [ "bib" ], "country": [ "United States" ], "originCommunity": [ "The TeX Users Group" ], "example": [ " @inproceedings{Gousi13,\n author = {Gousios, Georgios},\n title = {The GHTorrent dataset and tool suite},\n booktitle = {Proceedings of the 10th Working Conference on Mining Software\n Repositories},\n series = {MSR '13},\n year = {2013},\n isbn = {978-1-4673-2936-1},\n location = {San Francisco, CA, USA},\n pages = {233--236},\n numpages = {4},\n url = {http://dl.acm.org/citation.cfm?id=2487085.2487132},\n acmid = {2487132},\n publisher = {IEEE Press},\n address = {Piscataway, NJ, USA},\n }" ], "wikipedia": { "example": [ "@Book{abramowitz+stegun,\n author = \"Milton {Abramowitz} and Irene A. {Stegun}\",\n title = \"Handbook of Mathematical Functions with\n Formulas, Graphs, and Mathematical Tables\",\n publisher = \"Dover\",\n year = 1964,\n address = \"New York City\",\n edition = \"ninth Dover printing, tenth GPO printing\"\n}" ], "related": [ "latex", "tex", "url", "common-lisp", "unicode", "scribe", "html", "emacs-editor", "pdf" ], "summary": "BibTeX is reference management software for formatting lists of references. The BibTeX tool is typically used together with the LaTeX document preparation system. Within the typesetting system, its name is styled as B I B T E X {\\displaystyle {\\mathrm {B{\\scriptstyle {IB}}\\!T\\!_{\\displaystyle E}\\!X} }} . The name is a portmanteau of the word bibliography and the name of the TeX typesetting software. The purpose of BibTeX is to make it easy to cite sources in a consistent manner, by separating bibliographic information from the presentation of this information, similarly to the separation of content and presentation/style supported by LaTeX itself.", "pageId": 239392, "dailyPageViews": 417, "created": 2003, "backlinksCount": 197, "revisionCount": 583, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/BibTeX" }, "githubLanguage": { "type": "markup", "fileExtensions": [ "bib", "bibtex" ], "group": "TeX", "aceMode": "tex", "codemirrorMode": "stex", "codemirrorMimeType": "text/x-stex", "tmScope": "text.bibtex", "id": "BibTeX" }, "pygmentsHighlighter": { "filename": "bibtex.py", "fileExtensions": [ "bib" ], "id": "BibTeX" }, "helloWorldCollection": [ "%Hello world in BibTex\n\nENTRY{author}{}{}\n\nFUNCTION {hello.world}\n{ \n \"Hello World!\" write$ newline$\n}\n\nREAD \nEXECUTE {hello.world}" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "bicep": { "title": "Bicep", "appeared": 2020, "type": "jsonFormat", "creators": [ "Anthony Martin" ], "description": "Bicep is a Domain Specific Language (DSL) for deploying Azure resources declaratively.", "reference": [ "https://docs.microsoft.com/en-us/azure/azure-resource-manager/bicep/" ], "originCommunity": [ "Microsoft" ], "compilesTo": [ "arm-templates" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "keywords": [ "targetScope", "resource", "module", "param", "var", "output", "for", "in", "if", "existing" ], "example": [ "@minLength(3)\n@maxLength(11)\nparam storagePrefix string\n\nparam storageSKU string = 'Standard_LRS'\nparam location string = resourceGroup().location\n\nvar uniqueStorageName = '${storagePrefix}${uniqueString(resourceGroup().id)}'\n\nresource stg 'Microsoft.Storage/storageAccounts@2019-04-01' = {\n name: uniqueStorageName\n location: location\n sku: {\n name: storageSKU\n }\n kind: 'StorageV2'\n properties: {\n supportsHttpsTrafficOnly: true\n }\n}\n\nmodule webModule './webApp.bicep' = {\n name: 'webDeploy'\n params: {\n skuName: 'S1'\n location: location\n }\n}\n\noutput storageEndpoint object = stg.properties.primaryEndpoints" ], "githubRepo": { "firstCommit": 2020, "stars": 2438, "forks": 617, "subscribers": 116, "created": 2020, "updated": 2022, "description": "Bicep is a declarative language for describing and deploying Azure resources", "issues": 1060, "url": "https://github.com/Azure/bicep" }, "repoStats": { "firstCommit": 2020, "commits": 5981, "committers": 152, "files": 3683 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "bicep" ], "aceMode": "text", "tmScope": "source.bicep", "repos": 2562, "id": "Bicep" }, "githubBigQuery": { "repos": 17, "users": 13, "id": "Bicep" }, "monaco": "bicep", "isbndb": "", "semanticScholar": "" }, "biferno": { "title": "Biferno", "appeared": 2003, "type": "pl", "description": "Biferno is a new generation object-oriented Web scripting language that allows developers the rapid implementation of dynamic Web applications and of sites that offer a high degree of user interactivity.", "reference": [ "https://sourceforge.net/projects/biferno/" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Biferno", "hopl": "https://hopl.info/showlanguage.prx?exp=8513", "centralPackageRepositoryCount": 0, "isbndb": "" }, "bigloo": { "title": "Bigloo", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e9f6988ba5a9cc8f6cd9a9437968580215981eeb" ], "country": [ "France" ], "originCommunity": [ "National Institute for Research in Digital Science and Technology", "Inria" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3601", "centralPackageRepositoryCount": 0 }, "bigmac": { "title": "BIGMAC", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/cb07cb8a4f42e57b29b2ea01e44d26ea16844642" ], "country": [ "United States" ], "originCommunity": [ "University of Colorado" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4435", "centralPackageRepositoryCount": 0, "isbndb": "" }, "bigwig-format": { "title": "bigWig format", "appeared": 2009, "type": "binaryDataFormat", "description": "The bigWig format is the recommended format for almost all graphing track needs. The bigWig format is useful for dense, continuous data that will be displayed in the Genome Browser as a graph. BigWig files are created from wiggle (wig) type files using the program wigToBigWig. bigWig files are indexed binary files.", "reference": [ "http://genome.ucsc.edu/goldenPath/help/bigWig.html" ], "country": [ "United States" ], "originCommunity": [ "University of California, Santa Cruz" ], "fileType": "binary", "centralPackageRepositoryCount": 0 }, "bigwig-programming-language": { "title": "Bigwig Programming Language", "appeared": 1998, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Bigwig_%28programming_language%29" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "bigwig": { "title": "BIGWIG", "appeared": 1998, "type": "pl", "reference": [ "http://www.brics.dk/bigwig/publications/bigwig/" ], "country": [ "Denmark" ], "originCommunity": [ "Danish National Research Foundation or Aarhus University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1860", "centralPackageRepositoryCount": 0, "isbndb": "" }, "binary-equation": { "title": "Binary Equation", "appeared": 1689, "type": "equation", "creators": [ "Gottfried Leibniz" ], "reference": [ "https://math.stackexchange.com/questions/960236/trying-to-understand-binary-number-equation" ], "country": [ "United States and Israel" ], "originCommunity": [ "New York University", "Hebrew University" ], "equation": "n = [{0,1}...] ∀ N\nAll languages can be represented in 0 and 1s." }, "binary-ninja": { "title": "Binary Ninja", "appeared": 2015, "type": "decompiler", "description": "Binary Ninja is an interactive disassembler, decompiler, and binary analysis platform for reverse engineers, malware analysts, vulnerability researchers, and software developers that runs on Windows, macOS, Linux.", "website": "https://binary.ninja/", "country": [ "United States" ], "originCommunity": [ "Vector 35" ], "domainName": { "registered": 2014, "awisRank": { "2022": 1277213 }, "name": "binary.ninja" } }, "binary-notation": { "title": "Binary notation", "appeared": 1689, "type": "notation", "photo": "https://pldb.com/photos/binary-notation.png", "demoVideo": [ "https://www.youtube.com/watch?v=wgbV6DLVezo" ], "creators": [ "Gottfried Leibniz" ], "reference": [ "https://pdfs.semanticscholar.org/4e42/8d4918e7da3adc468c5b7cc3958b1fe21fc2.pdf", "https://writings.stephenwolfram.com/2013/05/dropping-in-on-gottfried-leibniz/" ], "wikipedia": { "example": [ "100101 = [ ( 1 ) × 2^5 ] + [ ( 0 ) × 2^4 ] + [ ( 0 ) × 2^3 ] + [ ( 1 ) × 2^2 ] + [ ( 0 ) × 2^1 ] + [ ( 1 ) × 2^0 ]\n100101 = [ 1 × 32 ] + [ 0 × 16 ] + [ 0 × 8 ] + [ 1 × 4 ] + [ 0 × 2 ] + [ 1 × 1 ]\n100101 = 37" ], "summary": "A binary code represents text, computer processor instructions, or any other data using a two-symbol system. The two-symbol system used is often \"0\" and \"1\" from the binary number system. The binary code assigns a pattern of binary digits, also known as bits, to each character, instruction, etc. For example, a binary string of eight bits can represent any of 256 possible values and can, therefore, represent a wide variety of different items. In computing and telecommunications, binary codes are used for various methods of encoding data, such as character strings, into bit strings. Those methods may use fixed-width or variable-width strings. In a fixed-width binary code, each letter, digit, or other character is represented by a bit string of the same length; that bit string, interpreted as a binary number, is usually displayed in code tables in octal, decimal or hexadecimal notation. There are many character sets and many character encodings for them. A bit string, interpreted as a binary number, can be translated into a decimal number. For example, the lower case a, if represented by the bit string 01100001 (as it is in the standard ASCII code), can also be represented as the decimal number \"97\".", "backlinksCount": 447, "pageId": 219202, "dailyPageViews": 939, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/Binary_code" }, "conference": [ "https://binary-tools.net/summit.html" ], "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n30539292|How I See Numbers|https://www.csun.io/2022/03/03/how-i-see-numbers.html|2022-03-03 10:24:28 UTC|1646283268|igpay|194|300", "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nBinary Numbers|1977| Clyde Watson, Wendy Watson|1110018|4.17|12|3", "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Binary Numbers|10.5951/mathteacmiddscho.24.1.0006|2|0|J. Ryu|68c823ef9fa80e960022ad7a61cefcac369cb354\n2017|The Universe of Binary Numbers|10.1007/978-3-319-64807-1_1|0|0|V. Moret-Bonillo|4f3a9d920a68b601d732b4ea68061e9e46bb630b" }, "binaryen": { "title": "binaryen", "appeared": 2015, "type": "compiler", "creators": [ "Alon Zakai" ], "country": [ "Various" ], "originCommunity": [ "WebAssembly" ], "githubRepo": { "firstCommit": 2015, "stars": 5719, "forks": 574, "subscribers": 182, "created": 2015, "updated": 2022, "description": "Compiler infrastructure and toolchain library for WebAssembly", "issues": 504, "url": "https://github.com/WebAssembly/binaryen" } }, "bind-app": { "title": "BIND", "appeared": 2000, "type": "application", "country": [ "United States" ], "originCommunity": [ "Internet Systems Consortium" ], "wikipedia": { "summary": "BIND (), or named (pronounced name-dee, short for name daemon: ), is the most widely used Domain Name System (DNS) software on the Internet. | On Unix-like operating systems it is the de facto standard. It performs both of the main DNS server roles - acting as an authoritative name server for one or more specific domains, and acting as a recursive resolver for the DNS system generally. The software was originally designed at the University of California, Berkeley (UCB) in the early 1980s. The name originates as an acronym of Berkeley Internet Name Domain, reflecting the application's use within UCB. The software consists, most prominently, of the DNS server component, called named, a contracted form of name daemon. In addition the suite contains various administration tools, and a DNS resolver interface library. The latest version of BIND is BIND 9, first released in 2000. BIND 9 is actively maintained, with new releases issued several times a year. Starting in 2009, the Internet Software Consortium (ISC) developed a new software suite, initially called BIND10. With release version 1.2.0 the project was renamed Bundy to terminate ISC involvement in the project.", "backlinksCount": 153, "pageId": 8735, "dailyPageViews": 180, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/BIND" } }, "bioconductor-pm": { "title": "Bioconductor", "appeared": 2001, "type": "packageManager", "website": "https://www.bioconductor.org/", "country": [ "United States" ], "originCommunity": [ "Fred Hutchinson Cancer Research Center" ], "domainName": { "registered": 2001, "awisRank": { "2022": 32833 }, "name": "bioconductor.org" }, "wikipedia": { "dailyPageViews": 162, "url": "https://en.wikipedia.org/wiki/Bioconductor" }, "packageCount": 1649, "twitter": "https://twitter.com/bioconductor" }, "biomod": { "title": "BIOMOD", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c4ca6afeefb145cba751a4ffba63b55b2373f177" ], "country": [ "United States" ], "originCommunity": [ "The Rand Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5705", "centralPackageRepositoryCount": 0 }, "bioscript": { "title": "bioscript", "appeared": 2019, "type": "pl", "description": "This paper introduces BioScript, a domain-specific language (DSL) for programmable biochemistry which executes on emerging microfluidic platforms. The goal of this research is to provide a simple, intuitive, and type-safe DSL that is accessible to life science practitioners. The novel feature of the language is its syntax, which aims to optimize human readability; the technical contributions of the paper include the BioScript type system and relevant portions of its compiler. The type system ensures that certain types of errors, specific to biochemistry, do not occur, including the interaction of chemicals that may be unsafe. The compiler includes novel optimizations that place biochemical operations to execute concurrently on a spatial 2D array platform on the granularity of a control flow graph, as opposed to individual basic blocks. Results are obtained using both a cycle-accurate microfluidic simulator and a software interface to a real-world platform.", "reference": [ "https://dl.acm.org/citation.cfm?id=3276498" ], "country": [ "United States" ], "originCommunity": [ "University of California, Riverside" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/* Initialization Omitted */\n2 mixture = mix 10 uL of water with\n3 10 uL of blood for 10 s\n4 heat mixture at 100 C for 10 s" ] }, "biossim": { "title": "BIOSSIM", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/34531aba71ad7526d20309ac1ecb25119b04a2be" ], "country": [ "United States" ], "originCommunity": [ "University of Pennsylvania" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6673", "centralPackageRepositoryCount": 0 }, "biplan": { "title": "BIPLAN", "appeared": 2017, "type": "pl", "creators": [ "Giovanni Blu Mitolo" ], "website": "https://github.com/gioblu/BIPLAN", "country": [ "Italy" ] }, "bird": { "title": "BIRD", "appeared": 2021, "type": "pl", "reference": [ "https://bird.network.cz/?get_doc&v=20&f=bird-5.html" ], "country": [ "Czech Republic" ], "originCommunity": [ "CZ.NIC" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Bird", "hopl": "https://hopl.info/showlanguage.prx?exp=4483", "wordRank": 2707, "centralPackageRepositoryCount": 0 }, "birkbeck-assembly": { "title": "Birkbeck Assembly", "appeared": 1947, "type": "assembly", "creators": [ "Kathleen Booth" ], "description": "Kathleen Booth née Britten (1922 –) wrote the first assembly language and designed the assembler and autocode for the first computer systems at Birkbeck College, University of London.", "reference": [ "https://en.wikipedia.org/wiki/Kathleen_Booth" ], "country": [ "England" ], "originCommunity": [ "Birkbeck College, University of London" ], "centralPackageRepositoryCount": 0 }, "bison": { "title": "Bison", "appeared": 1985, "type": "grammarLanguage", "creators": [ "Robert Corbett" ], "website": "https://www.gnu.org/software/bison/", "documentation": [ "https://www.gnu.org/software/bison/manual/bison.html" ], "reference": [ "https://github.com/babyraging/yash" ], "country": [ "United States" ], "originCommunity": [ "GNU Project" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/* Reverse Polish Notation calculator. */\n\n%{\n #include \n #include \n int yylex (void);\n void yyerror (char const *);\n%}\n\n%define api.value.type {double}\n%token NUM\n\n%% /* Grammar rules and actions follow. */" ], "wikipedia": { "example": [ "# Makefile\n\nFILES\t= Lexer.c Parser.c Expression.c main.c\nCC\t= g++\nCFLAGS\t= -g -ansi\n\ntest:\t\t$(FILES)\n\t\t$(CC) $(CFLAGS) $(FILES) -o test\n\nLexer.c:\tLexer.l \n\t\tflex Lexer.l\n\nParser.c:\tParser.y Lexer.c\n\t\tbison Parser.y\n\nclean:\n\t\trm -f *.o *~ Lexer.c Lexer.h Parser.c Parser.h test" ], "related": [ "c", "m4", "java", "yacc", "ruby", "php", "go", "bash", "lilypond", "postgresql", "mysql", "octave" ], "summary": "GNU bison, commonly known as Bison, is a parser generator that is part of the GNU Project. Bison reads a specification of a context-free language, warns about any parsing ambiguities, and generates a parser (either in C, C++, or Java) which reads sequences of tokens and decides whether the sequence conforms to the syntax specified by the grammar. Bison by default generates LALR parsers but can also create GLR parsers. In POSIX mode, Bison is compatible with yacc, but also has several extensions over this earlier program. flex, an automatic lexical analyser, is often used with Bison, to tokenise input data and provide Bison with tokens. Bison was originally written by Robert Corbett in 1985. Later, in 1989, Robert Corbett released another parser generator named Berkeley Yacc. Bison was made Yacc-compatible by Richard Stallman. Bison is free software and is available under the GNU General Public License, with an exception (discussed below) allowing its generated code to be used without triggering the copyleft requirements of the licence.", "pageId": 53189, "dailyPageViews": 125, "created": 2002, "backlinksCount": 65, "revisionCount": 1, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/GNU_bison" }, "githubLanguage": { "fileExtensions": [ "bison" ], "trendingProjectsCount": 0, "type": "programming", "group": "Yacc", "aceMode": "text", "tmScope": "source.yacc", "repos": 196, "id": "Bison" }, "githubBigQuery": { "repos": 3641, "users": 2747, "id": "Bison" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2011, "committerCount": 2, "commitCount": 2, "url": "https://github.com/textmate/bison.tmbundle" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4653", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20090805|O'Reilly Media, Inc.|flex & bison|John Levine|9781449379278\n20090805|O'Reilly Media, Inc.|flex & bison|John Levine|9781449391973", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2001|Why bison is becoming extinct|10.1145/969637.969640|9|1|John Aycock|cddbb56c25f401c0a8fd179101524e09ae17c75d" }, "bisonpp": { "title": "Bison++", "appeared": 1998, "type": "grammarLanguage", "reference": [ "http://www.kohsuke.org/flex++bison++/" ], "country": [ "United States" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4654", "centralPackageRepositoryCount": 0 }, "bistro-programming-language": { "title": "Bistro", "appeared": 1999, "type": "pl", "creators": [ "Nikolas S. Boyd" ], "description": "Bistro is a variation of Smalltalk that integrates the best features of Smalltalk and Java. Bistro Smalltalk is an experimental programming language that runs on the Java Virtual Machine, or JVM.", "website": "https://bitbucket.org/nik_boyd/bistro-smalltalk", "reference": [ "http://bistro.sourceforge.net/" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Bistro_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1861", "centralPackageRepositoryCount": 0, "isbndb": "" }, "bitarray": { "title": "Bit array", "appeared": 2004, "type": "dataStructure", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Bit_array" } }, "bitbake": { "title": "BitBake", "appeared": 2004, "type": "pl", "website": "https://yoctoproject.org/tools-resources/projects/bitbake", "country": [ "Various" ], "originCommunity": [ "Yocto Project" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "require qt5-git.inc\nrequire ${PN}.inc\n\ndo_install_append() {\n # for modules which are still using syncqt and call qtPrepareTool(QMAKE_SYNCQT, syncqt)\n # e.g. qt3d, qtwayland\n ln -sf syncqt.pl ${D}${OE_QMAKE_PATH_QT_BINS}/syncqt\n}\n\nQT_MODULE_BRANCH = \"release\"\n# v5.2.1 + 168 commits\nSRCREV = \"08cbbde61778276ccdda73d89fd64d02c623779f\"\n\n " ], "wikipedia": { "related": [ "python", "linux", "subversion" ], "summary": "BitBake is a make-like build tool with the special focus of distributions and packages for embedded Linux cross compilation, although it is not limited to that. It is inspired by Portage, which is the package management system used by the Gentoo Linux distribution. BitBake existed for some time in the OpenEmbedded project until it was separated out into a standalone, maintained, distribution-independent tool. BitBake is co-maintained by the Yocto Project and the OpenEmbedded project. BitBake recipes specify how a particular package is built. Recipes consist of the source URL (http, https, ftp, cvs, svn, git, local file system) of the package, dependencies and compile or install options. They also store the metadata for the package in standard variables. During the build process, recipes are used to track dependencies, performing native or cross-compilation of the package and package it so that it is suitable for installation on the local or a target device. It is also possible to create complete images consisting of a root file system and kernel. As a first step in a cross-build setup, the framework will attempt to create a cross-compiler toolchain suited for the target platform.", "pageId": 17006433, "created": 2008, "backlinksCount": 46, "revisionCount": 63, "dailyPageViews": 61, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/BitBake" }, "githubLanguage": { "fileExtensions": [ "bb" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 3285, "id": "BitBake" }, "githubBigQuery": { "repos": 1040, "users": 667, "id": "BitBake" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "bitc": { "title": "BitC", "appeared": 2004, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/BitC" }, "centralPackageRepositoryCount": 0 }, "bizubee": { "title": "Bizubee", "appeared": 2015, "type": "pl", "creators": [ "Gabe", "Gabe" ], "website": "https://bizubee.github.io/", "fileExtensions": [ "jsl" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/bizubee/" ], "githubRepo": { "stars": 15, "forks": 4, "subscribers": 5, "created": 2015, "updated": 2017, "description": "This is the bizubee command line tool. For other bizubee tools and libraries check out bizubee.github.io/tools", "url": "https://github.com/bizubee/bizubee" }, "repoStats": { "firstCommit": 2015, "commits": 33, "committers": 11, "files": 12 } }, "bjou": { "title": "bjou", "appeared": 2019, "type": "pl", "website": "https://bjou-lang.org", "country": [ "Unknown" ], "originCommunity": [ "kammerdienerb" ], "domainName": { "registered": 2019, "name": "bjou-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n20411255|Self Hosting a Million-Lines-per-Second Parser|https://bjou-lang.org/blog/7-10-2019-self-hosting-a-million-lines-per-second-parser/7-10-2019-self-hosting-a-million-lines-per-second-parser.html|2019-07-11 13:17:01 UTC|1562851021|kammerdiener|0|2" }, "bla": { "title": "Bla", "appeared": 1994, "type": "pl", "creators": [ "Wouter Van Oortmerssen" ], "website": "http://strlen.com/bla-language/", "country": [ "Netherlands" ], "originCommunity": [ "University of Amsterdam" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "example": [ "map(f,[]) = []\nmap(f,[h|t]) = [f(h)|map(f,t)]\n\nqsort([],_) = []\nqsort([h|t],lt) = append(qsort(filter(lambda(x) = lt(x,h),t),lt),\n [h|qsort(filter(lambda(x) = not lt(x,h),t),lt)])\n\nstack[T]() = self where\n d = []\n isempty() = d=[]\n push(x:T) do d:=[x|d]\n pop():T = d | [] -> nil -- raise stack_empty\n | [h|t] -> h do d:=t" ] }, "blackcoffee": { "title": "BlackCoffee", "appeared": 2014, "type": "pl", "creators": [ "Frank van Viegen" ], "website": "https://github.com/paiq/blackcoffee", "fileExtensions": [ "coffee" ], "country": [ "The Netherlands" ], "originCommunity": [ "Paiq BV" ], "keywords": [ "macro" ], "githubRepo": { "stars": 104, "forks": 2000, "subscribers": 9, "created": 2014, "updated": 2014, "description": "CoffeeScript + hygienic macros", "url": "https://github.com/paiq/blackcoffee" }, "repoStats": { "firstCommit": 2009, "commits": 4133, "committers": 196, "files": 246 } }, "blacklight": { "title": "Blacklight", "appeared": 2015, "type": "pl", "creators": [ "Anthony M. Cook" ], "description": "blacklight is a general-pupose multithreading concatenative stack-based programming language with first-class queues and objects with delegation.", "website": "http://blog.anthonymcook.com/blacklight/", "country": [ "Unknown" ], "originCommunity": [ "http://anthonymcook.com/" ], "example": [ "newq newq ;; create send and receive queues\n[\n [\n deq ;; will block if the queue is empty\n n-to-cv rot swap enq ;; convert number into a cv (string) and send back\n swap ;; reorder queues so we can loop without confusion\n ] loop ;; using loop since it goes forever\n] work ;; start new thread and swap the queues\nswap ;; bring send queue to top\n1 enq 2 enq 3 enq 4 enq ;; send some numbers to be converted\n0\n[ 1 add ]\n[ 1000 eq ]\nuntil drop ;; give the main thread busywork\nswap q-to-v ;; get contents of receive Q as V\nprint ;; display contents of V" ], "githubRepo": { "stars": 42, "forks": 5, "subscribers": 10, "created": 2015, "updated": 2022, "description": "a stack-based concatenative virtual machine for implementing highly concurrent languages", "url": "https://github.com/acook/blacklight" }, "repoStats": { "firstCommit": 2015, "commits": 653, "committers": 4, "files": 90 } }, "blade-lang": { "title": "Blade", "appeared": 2022, "type": "pl", "description": "Blade Programming Language v0.0.73", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wb11jv/blade_programming_language_v0073/" ], "country": [ "Nigeria" ], "originCommunity": [ "Mcfriends Limited" ] }, "blade": { "title": "Blade", "appeared": 2011, "type": "template", "website": "https://laravel.com/docs/5.7/blade", "country": [ "United States" ], "originCommunity": [ "Laravel" ], "example": [ "\n\n\n \n App Name - @yield('title')\n \n \n @section('sidebar')\n This is the master sidebar.\n @show\n\n
\n @yield('content')\n
\n \n" ], "githubLanguage": { "fileExtensions": [ "blade", "bladephp" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "text", "tmScope": "text.html.php.blade", "repos": 41201, "id": "Blade" }, "githubBigQuery": { "repos": 372, "users": 324, "id": "Blade" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 13, "commitCount": 245, "sampleCount": 2, "example": [ "\n\n\n @yield('title', 'We love GitHub')\n @stack('scripts')\n @stack('styles')\n\n\n @include('partials.nav')\n\n @yield('content')\n\n
    \n @foreach($foo as $bar)\n
  • {{ $bar }}
    • \n @endforeach\n
\n\n {!! $raw_content !!}\n\n\n" ], "url": "https://github.com/jawee/language-blade" }, "fileType": "text", "wordRank": 5556, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2022|Titan Comics|Blade Runner: Origins Vol. 3: Burning (Blade Runner, 3)|Perkins, K and Brown, Mellow|9781787736429" }, "blake-hash-function": { "title": "BLAKE", "appeared": 2012, "type": "hashFunction", "country": [ "Switzerland and Malaysia and Germany" ], "originCommunity": [ "UBS AG", "Cyberjaya", "Stuttgart Technology University of Applied Sciences", "Kudelski Security" ], "wikipedia": { "summary": "BLAKE is a cryptographic hash function based on Dan Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants, is added before each ChaCha round. Like SHA-2, there are two variants differing in the word size. ChaCha operates on a 4×4 array of words. BLAKE repeatedly combines an 8-word hash value with 16 message words, truncating the ChaCha result to obtain the next hash value. BLAKE-256 and BLAKE-224 use 32-bit words and produce digest sizes of 256 bits and 224 bits, respectively, while BLAKE-512 and BLAKE-384 use 64-bit words and produce digest sizes of 512 bits and 384 bits, respectively. The BLAKE2 hash function, based on BLAKE, was announced in 2012. The BLAKE3 hash function, based on BLAKE2, was announced in 2020.", "backlinksCount": 144, "pageId": 30054589, "dailyPageViews": 133, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/BLAKE_(hash_function)" } }, "blank": { "title": "blank", "appeared": 2018, "type": "esolang", "website": "https://esolangs.org/wiki/Blank", "country": [ "Poland" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n16814993|Show HN: Blank – A stack-based programming language I wrote 21 years ago|2018-04-11 20:07:14 UTC|1523477234|aturley|11|73", "isbndb": "" }, "blaze-2": { "title": "BLAZE 2", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a0875a7a4b6f843d245dd7a330708e0b0adaa3bc" ], "country": [ "United States" ], "originCommunity": [ "Purdue University", "NASA" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1457", "centralPackageRepositoryCount": 0, "isbndb": "" }, "blaze": { "title": "BLAZE", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bfe1b6062b2e25f4025857f20ef8c87ff4365b3c" ], "country": [ "United States" ], "originCommunity": [ "Institute for Computer Applications in Science and Engineering", "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1299", "centralPackageRepositoryCount": 0 }, "blazex": { "title": "BlazeX", "appeared": 2020, "type": "pl", "creators": [ "RoMeAh" ], "website": "https://www.blazex.blazify.rocks/", "country": [ "Unknown" ], "originCommunity": [ "Blazify" ], "githubRepo": { "firstCommit": 2020, "stars": 47, "forks": 5, "subscribers": 2, "created": 2020, "updated": 2022, "description": "AOT compiled object oriented programming language", "issues": 0, "url": "https://github.com/BlazifyOrg/blazex" }, "repoStats": { "firstCommit": 2020, "commits": 285, "committers": 8, "files": 69 } }, "blc": { "title": "Binary Lambda Calculus", "appeared": 2004, "type": "esolang", "creators": [ "John Tromp" ], "description": "Binary lambda calculus (BLC) is a minimal, pure functional programming language invented by John Tromp in 2004,[1] based on a binary encoding of the untyped lambda calculus in De Bruijn index notation.", "website": "http://tromp.github.io/cl/Binary_lambda_calculus.html", "country": [ "Netherlands" ], "originCommunity": [ "Centrum Wiskunde & Informatica" ], "leachim6": { "filepath": "b/BLC.Blc", "fileExtensions": [ "Blc" ], "example": [ " Hello World\n" ], "id": "BLC" }, "rijuRepl": { "example": [ "001010100100100001100101011011000110110001101111001011000010\n000001110111011011110111001001101100011001000010000100001010\n" ], "description": "Minimal, pure functional programming language invented by John Tromp in 2004, based on a binary encoding of the untyped lambda calculus in De Bruijn index notation", "fileExtensions": [ "blc" ], "website": "https://tromp.github.io/cl/Binary_lambda_calculus.html", "gitRepo": "https://www.ioccc.org/2012/tromp/tromp.c", "id": "https://riju.codes/blc" }, "esolang": "https://esolangs.org/wiki/Binary_lambda_calculus", "isbndb": "" }, "blender-app": { "title": "Blender", "appeared": 1998, "type": "application", "fileExtensions": [ "blend" ], "country": [ "Netherlands" ], "originCommunity": [ "Blender Foundation" ], "wikipedia": { "summary": "Blender is a free and open-source 3D computer graphics software toolset used for creating animated films, visual effects, art, 3D printed models, interactive 3D applications and video games. Blender's features include 3D modeling, UV unwrapping, texturing, raster graphics editing, rigging and skinning, fluid and smoke simulation, particle simulation, soft body simulation, sculpting, animating, match moving, rendering, motion graphics, video editing and compositing. While current versions also feature an integrated game engine, the upcoming 2.8 release will remove it.", "backlinksCount": 993, "pageId": 81926, "dailyPageViews": 1068, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Blender_(software)" }, "leachim6": { "filepath": "b/Blender.py", "fileExtensions": [ "py" ], "example": [ "import Blender\nfrom Blender import Scene, Text3d\n\ntext = Text3d.New(\"Text\")\ntext.setText(\"Hello World\")\nScene.GetCurrent().objects.new(text)\nBlender.Redraw()\n" ], "id": "Blender" } }, "bliss": { "title": "BLISS", "appeared": 1969, "type": "pl", "creators": [ "William Wulf" ], "reference": [ "https://semanticscholar.org/paper/4430dfe254804b19bb6a4d9fc10d5bed2932b7cc" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "hasLineComments": { "example": "! A comment", "value": true }, "hasComments": { "example": "! A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "!" ] ], "wikipedia": { "example": [ "MODULE E1 (MAIN = CTRL) =\nBEGIN\nFORWARD ROUTINE\n CTRL,\n STEP;\nROUTINE CTRL =\n!+\n! This routine inputs a value, operates on it, and\n! then outputs the result.\n!-\n BEGIN\n EXTERNAL ROUTINE\n GETNUM, ! Input a number from terminal\n PUTNUM; ! Output a number to terminal\n LOCAL\n X, ! Storage for input value\n Y; ! Storage for output value\n GETNUM(X);\n Y = STEP(.X);\n PUTNUM(.Y)\n END;\nROUTINE STEP(A) =\n!+\n! This routine adds 1 to the given value.\n!-\n (.A+1);\nEND\nELUDOM" ], "related": [ "mips", "ia-32", "algol", "c", "doi" ], "summary": "BLISS is a system programming language developed at Carnegie Mellon University by W. A. Wulf, D. B. Russell, and A. N. Habermann around 1970. It was perhaps the best known systems programming language right up until C made its debut a few years later. Since then, C took off and BLISS faded into obscurity. When C was in its infancy, a few projects within Bell Labs were debating the merits of BLISS vs. C. BLISS is a typeless block-structured language based on expressions rather than statements, and includes constructs for exception handling, coroutines, and macros. It does not include a goto statement. The name is variously said to be short for \"Basic Language for Implementation of System Software\" or \"System Software Implementation Language, Backwards\". It was sometimes called \"Bill's Language for Implementing System Software\", after Bill Wulf. The original Carnegie Mellon compiler was notable for its extensive use of optimizations, and formed the basis of the classic book The Design of an Optimizing Compiler. DEC developed and maintained BLISS compilers for the PDP-10, PDP-11, VAX, DEC Prism, MIPS, DEC Alpha, and Intel IA-32, The language did not become popular among customers and few had the compiler, but DEC used it heavily in-house into the 1980s; most of the utility programs for the VMS operating system were written in BLISS-32. After its acquisition of DEC, Compaq developed and maintained a BLISS compiler for Intel IA-64.", "backlinksCount": 113, "pageId": 390261, "dailyPageViews": 44, "created": 2003, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/BLISS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=375", "centralPackageRepositoryCount": 0 }, "blitz3d": { "title": "Blitz3D", "appeared": 2001, "type": "pl", "country": [ "New Zealand" ], "originCommunity": [ "Blitz Research" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "AppTitle = \"Binary Clock\"\n Graphics 145,85\n\n secondtimer = CreateTimer(2)\n \n Repeat\n Hour = CurrentTime()[..2].ToInt()\n Minute = CurrentTime()[4..6].ToInt()\n Second = CurrentTime()[6..].ToInt()\n\n If Hour >= 12 Then PM = 1\n If Hour > 12 Then Hour = Hour - 12\n If Hour = 0 Then Hour = 12\n\n 'should do this otherwise the PM dot will be\n 'Left up once the clock rolls past midnight!\n Cls\n\n SetColor(0,255,0) 'make the text green For the PM part\n If PM = 1 Then DrawText \"PM\",5,5\n 'set the text colour back To white For the rest\n SetColor(255,255,255)\n\n For bit=0 Until 6\n xpos=20*(6-bit)\n binaryMask=2^bit\n 'do hours\n If (bit<4)\n If (hour & binaryMask)\n DrawText \"1\",xpos,5\n Else\n DrawText \"0\",xpos,5\n EndIf\n EndIf\n\n 'do the minutes\n If (minute & binaryMask)\n DrawText \"1\", xpos,25\n Else\n DrawText \"0\", xpos,25\n EndIf\n\n 'do the seconds\n If (second & binaryMask)\n DrawText \"1\",xpos,45\n Else\n DrawText \"0\",xpos,45\n EndIf\n Next\n\n 'make the text red For the decimal time\n SetColor(255,0,0)\n DrawText \"Decimal: \" + CurrentTime(),5,65\n 'set the text back To white For the rest\n SetColor(255,255,255)\n\n \t Flip\n\n 'will wait half a second\n WaitTimer(secondTimer)\n \t If KeyHit(KEY_ESCAPE) Then Exit\n Forever" ], "related": [ "basic", "linux", "monkey", "opengl", "ascii", "lua", "unicode", "csharp", "purebasic", "ios" ], "summary": "Blitz BASIC refers to the programming language dialect that was interpreted by the first Blitz compilers, devised by New Zealand-based developer Mark Sibly. Being derived from BASIC, Blitz syntax was designed to be easy to pick up for beginners first learning to program. The languages are game-programming oriented but are often found general-purpose enough to be used for most types of application. The Blitz language evolved as new products were released, with recent incarnations offering support for more advanced programming techniques such as object-orientation and multi-threading. This led to the languages losing their BASIC moniker in later years.", "created": 2008, "backlinksCount": 126, "pageId": 4840, "revisionCount": 27, "dailyPageViews": 11, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Blitz3D" }, "leachim6": { "filepath": "b/Blitz3D.bb", "fileExtensions": [ "bb" ], "example": [ ";Blitz3D Hello World demo by MANIAK_dobrii\nPrint \"Hello World\"\nWaitKey\nEnd\n" ], "id": "Blitz3D" }, "centralPackageRepositoryCount": 0 }, "blitzbasic": { "title": "BlitzBasic", "appeared": 2000, "type": "pl", "documentation": [ "https://daemonbite.com/files/linked/BB21Manual.pdf" ], "country": [ "New Zealand" ], "originCommunity": [ "Blitz Research" ], "hasBooleans": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "booleanTokens": [ [ "True", "False" ] ], "wikipedia": { "example": [ "AppTitle = \"Binary Clock\"\n Graphics 145,85\n\n secondtimer = CreateTimer(2)\n \n Repeat\n Hour = CurrentTime()[..2].ToInt()\n Minute = CurrentTime()[4..6].ToInt()\n Second = CurrentTime()[6..].ToInt()\n\n If Hour >= 12 Then PM = 1\n If Hour > 12 Then Hour = Hour - 12\n If Hour = 0 Then Hour = 12\n\n 'should do this otherwise the PM dot will be\n 'Left up once the clock rolls past midnight!\n Cls\n\n SetColor(0,255,0) 'make the text green For the PM part\n If PM = 1 Then DrawText \"PM\",5,5\n 'set the text colour back To white For the rest\n SetColor(255,255,255)\n\n For bit=0 Until 6\n xpos=20*(6-bit)\n binaryMask=2^bit\n 'do hours\n If (bit<4)\n If (hour & binaryMask)\n DrawText \"1\",xpos,5\n Else\n DrawText \"0\",xpos,5\n EndIf\n EndIf\n\n 'do the minutes\n If (minute & binaryMask)\n DrawText \"1\", xpos,25\n Else\n DrawText \"0\", xpos,25\n EndIf\n\n 'do the seconds\n If (second & binaryMask)\n DrawText \"1\",xpos,45\n Else\n DrawText \"0\",xpos,45\n EndIf\n Next\n\n 'make the text red For the decimal time\n SetColor(255,0,0)\n DrawText \"Decimal: \" + CurrentTime(),5,65\n 'set the text back To white For the rest\n SetColor(255,255,255)\n\n \t Flip\n\n 'will wait half a second\n WaitTimer(secondTimer)\n \t If KeyHit(KEY_ESCAPE) Then Exit\n Forever" ], "related": [ "basic", "linux", "monkey", "opengl", "ascii", "lua", "unicode", "csharp", "purebasic", "ios" ], "summary": "Blitz BASIC refers to the programming language dialect that was interpreted by the first Blitz compilers, devised by New Zealand-based developer Mark Sibly. Being derived from BASIC, Blitz syntax was designed to be easy to pick up for beginners first learning to program. The languages are game-programming oriented but are often found general-purpose enough to be used for most types of application. The Blitz language evolved as new products were released, with recent incarnations offering support for more advanced programming techniques such as object-orientation and multi-threading. This led to the languages losing their BASIC moniker in later years.", "backlinksCount": 126, "pageId": 4840, "created": 2001, "revisionCount": 448, "dailyPageViews": 51, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Blitz_BASIC" }, "githubLanguage": { "fileExtensions": [ "bb", "decls" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.blitzmax", "aliases": [ "b3d", "blitz3d", "blitzplus", "bplus" ], "repos": 595, "id": "BlitzBasic" }, "githubBigQuery": { "repos": 492, "users": 417, "id": "BlitzBasic" }, "pygmentsHighlighter": { "filename": "basic.py", "fileExtensions": [ "bb", "decls" ], "id": "BlitzBasic" }, "linguistGrammarRepo": { "firstCommit": 2009, "lastCommit": 2016, "committerCount": 2, "commitCount": 35, "sampleCount": 3, "example": [ "\nLocal i, start, result\n\nLocal s.Sum3Obj = New Sum3Obj\n\nFor i = 1 To 100000\n\ts = New Sum3Obj\n\tresult = Handle Before s\n\tDelete s\nNext\n\nstart = MilliSecs()\nFor i = 1 To 1000000\n\tresult = Sum3_(MakeSum3Obj(i, i, i))\nNext\nstart = MilliSecs() - start\nPrint start\n\nstart = MilliSecs()\nFor i = 1 To 1000000\n\tresult = Sum3(i, i, i)\nNext\nstart = MilliSecs() - start\nPrint start\n\nWaitKey\nEnd\n\n\nFunction Sum3(a, b, c)\n\tReturn a + b + c\nEnd Function\n\n\nType Sum3Obj\n\tField isActive\n\tField a, b, c\nEnd Type\n\nFunction MakeSum3Obj(a, b, c)\n\tLocal s.Sum3Obj = Last Sum3Obj\n\tIf s\\isActive Then s = New Sum3Obj\n\ts\\isActive = True\n\ts\\a = a\n\ts\\b = b\n\ts\\c = c\n\t\n\tRestore label\n\tRead foo\n\t\n\tReturn Handle(s)\nEnd Function\n\n.label\nData (10 + 2), 12, 14\n:\nFunction Sum3_(a_)\n\tLocal a.Sum3Obj = Object.Sum3Obj a_\n\tLocal return_ = a\\a + a\\b + a\\c\n\tInsert a Before First Sum3Obj :: a\\isActive = False\n\tReturn return_\nEnd Function\n\n\n;~IDEal Editor Parameters:\n;~C#Blitz3D" ], "url": "https://github.com/textmate/blitzmax.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "blitzmax": { "title": "BlitzMax", "appeared": 2014, "type": "pl", "country": [ "New Zealand" ], "originCommunity": [ "Blitz Research" ], "hasPointers": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2014, "stars": 141, "forks": 49, "subscribers": 19, "created": 2014, "updated": 2022, "description": "BlitzMax", "issues": 7, "url": "https://github.com/blitz-research/blitzmax" }, "repoStats": { "firstCommit": 2014, "commits": 97, "committers": 8, "files": 2272 }, "githubLanguage": { "fileExtensions": [ "bmx" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.blitzmax", "aliases": [ "bmax" ], "repos": 219, "id": "BlitzMax" }, "githubBigQuery": { "repos": 52, "users": 46, "id": "BlitzMax" }, "pygmentsHighlighter": { "filename": "basic.py", "fileExtensions": [ "bmx" ], "id": "BlitzMax" }, "linguistGrammarRepo": { "firstCommit": 2009, "lastCommit": 2016, "committerCount": 2, "commitCount": 35, "sampleCount": 1, "example": [ "SuperStrict\n\nFramework Brl.StandardIO\n\nType TMyType\n\tField property:int\n\n\tFunction A:int(param:int)\n\t\t'do nothing\n\tEnd Function\n\n\tMethod B:int(param:int)\n\t\t'do nothing\n\tEnd Method\nEnd Type\n\n\nGlobal my:TMyType = new TMyType\n?Win32\n\tmy.A()\n\tmy.B()\n?Linux\n\tmy.B()\n\tmy.A()\n?" ], "url": "https://github.com/textmate/blitzmax.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:BlitzMax", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nBlitzmax for Absolute Beginners: Games Programming for the Absolute Beginner||Sloan Kelly|53255227|0.0|0|0\nGames Programming For The Absolute Beginner With Blitzmax||Sloan Kelly|2493016|0.0|0|0\nGames Programming for the Absolute Beginner with BlitzMax Kindle Edition|2011|Sloan Kelly|27446641|5.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n2016|Apress|BlitzMax for Absolute Beginners: Games Programming for the Absolute Beginner|Kelly, Sloan|9781484225226\n2016|Apress Media Llc,|Blitzmax For Absolute Beginners|Kelly, Sloan and Springer Science+business Media|\n20161214|Springer Nature|BlitzMax for Absolute Beginners|Sloan Kelly|9781484225233" }, "blitzplus": { "title": "BlitzPlus", "appeared": 2003, "type": "pl", "country": [ "New Zealand" ], "originCommunity": [ "Blitz Research" ], "wikipedia": { "example": [ "AppTitle = \"Binary Clock\"\n Graphics 145,85\n\n secondtimer = CreateTimer(2)\n \n Repeat\n Hour = CurrentTime()[..2].ToInt()\n Minute = CurrentTime()[4..6].ToInt()\n Second = CurrentTime()[6..].ToInt()\n\n If Hour >= 12 Then PM = 1\n If Hour > 12 Then Hour = Hour - 12\n If Hour = 0 Then Hour = 12\n\n 'should do this otherwise the PM dot will be\n 'Left up once the clock rolls past midnight!\n Cls\n\n SetColor(0,255,0) 'make the text green For the PM part\n If PM = 1 Then DrawText \"PM\",5,5\n 'set the text colour back To white For the rest\n SetColor(255,255,255)\n\n For bit=0 Until 6\n xpos=20*(6-bit)\n binaryMask=2^bit\n 'do hours\n If (bit<4)\n If (hour & binaryMask)\n DrawText \"1\",xpos,5\n Else\n DrawText \"0\",xpos,5\n EndIf\n EndIf\n\n 'do the minutes\n If (minute & binaryMask)\n DrawText \"1\", xpos,25\n Else\n DrawText \"0\", xpos,25\n EndIf\n\n 'do the seconds\n If (second & binaryMask)\n DrawText \"1\",xpos,45\n Else\n DrawText \"0\",xpos,45\n EndIf\n Next\n\n 'make the text red For the decimal time\n SetColor(255,0,0)\n DrawText \"Decimal: \" + CurrentTime(),5,65\n 'set the text back To white For the rest\n SetColor(255,255,255)\n\n \t Flip\n\n 'will wait half a second\n WaitTimer(secondTimer)\n \t If KeyHit(KEY_ESCAPE) Then Exit\n Forever" ], "related": [ "basic", "linux", "monkey", "opengl", "ascii", "lua", "unicode", "csharp", "purebasic", "ios" ], "summary": "Blitz BASIC refers to the programming language dialect that was interpreted by the first Blitz compilers, devised by New Zealand-based developer Mark Sibly. Being derived from BASIC, Blitz syntax was designed to be easy to pick up for beginners first learning to program. The languages are game-programming oriented but are often found general-purpose enough to be used for most types of application. The Blitz language evolved as new products were released, with recent incarnations offering support for more advanced programming techniques such as object-orientation and multi-threading. This led to the languages losing their BASIC moniker in later years.", "created": 2010, "backlinksCount": 126, "pageId": 4840, "revisionCount": 1, "dailyPageViews": 1, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/BlitzPlus" }, "centralPackageRepositoryCount": 0 }, "blockly": { "title": "Blockly", "appeared": 2011, "type": "library", "country": [ "United States" ], "originCommunity": [ "Google", "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "javascript", "scratch", "python", "php", "dart", "webgl", "svg", "android", "ios" ], "summary": "Blockly is a client-side JavaScript library for creating visual block programming languages and editors. It is a project of Google and is open-source under the Apache 2.0 License. It typically runs in a web browser, and visually resembles Scratch. Blockly is also being implemented for Android and iOS; not all web browser based features are available for Android/iOS. Blockly uses visual blocks that link together to make writing code easier, and can generate JavaScript, Python, PHP or Dart code. It can also be customised to generate code in any textual computer language.", "pageId": 44494473, "dailyPageViews": 93, "created": 2014, "backlinksCount": 22, "revisionCount": 101, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Blockly" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "blockml": { "title": "blockml", "appeared": 2014, "type": "textMarkup", "website": "http://blockml.awwapps.com", "country": [ "Germany" ], "originCommunity": [ "Aww Apps" ], "domainName": { "name": "blockml.awwapps.com" }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "/*\n ____ __ __ __ _____ \n / __ )/ /___ _____/ /__/ |/ / / \n / __ / / __ \\/ ___/ //_/ /|_/ / / \n / /_/ / / /_/ / /__/ ,< / / / / /___\n/_____/_/\\____/\\___/_/|_/_/ /_/_____/\n\n*/\n\n\nhead[\n\ntitle[Recap of John McCarthy's Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I]\n\nh3[Judith Lindemann]\n\nh5[Berlin, 25 December 2013]\n\n]\n\nh1[Preface]\n\nThis text is originated as an exercise for an university course about scientific writing at the Beuth University of Applied Sciences Berlin. The assignment was to choose a computer science paper, reproduce the key ideas in own words, and add some own thoughts about that topic as conclusion. \n\nI have selected the classical paper \"b[Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I]\" by John McCarthy from 1960 (id[LISP]), because it permits a fascinating look into the history of programming languages and is the origin of many concepts that are still relevant today.\n\nThis text is also influenced by Paul Graham's article \"b[Roots of Lisp]\" from 2002 (id[ROOTS]) about that McCarthy paper. I follow Paul Graham's approach to provide code examples in actual LISP code instead of m-expressions, and I assume that c[quote] and c[cond] are elementary functions.\n\ntoc[Contents]\n\nsec[Introduction][\n\nThe paper (id[LISP]) describes a dynamic typed and functional programming language called LISP. The name LISP is an abbreviation for b[LIS]t b[P]rocessor, which is a very suitable name, because the whole syntax is completely based on a simple list notation for code and data.\n\nLISP was developed in 1958, two years before the paper was published. The main purpose for the development was the lack of appropriate programming languages for artificial intelligence applications. At this time FORTRAN was the dominant high level programming language, but it was developed for numeric calculations and engineering tasks and therefore no good fit for AI problems.\n\nLISP was influenced by IPL (Information Processing Language), which was an experimental programming language from 1957 (see id[IPL]). IPL was dedicated to AI research, but also inappropriate because it was an assembly language. Some of the IPL concepts that LISP had adopted and heavily improved were: list-processing, higher-order functions, recursion and computation with symbols. Some other concepts were new, for example: conditional control flow, garbage collection, lazy evaluation, and dynamic typing.\n\nAt first, we will learn something about the mathematical concepts behind LISP. Then, we will see that the early LISP had only two simple data types. After that, we will define 5-7 elementary functions and we will use them as building blocks to create our own functions. Then, we will see how the memory management works. At the end, we will look, how LISP was doing in the past 55 years and how LISP is doing today.\n\n]/* Introduction */\n\nsec[Mathematical concepts][\n\nsec[Propositional expressions][\nPropositional expressions are expressions whose values are either c[T] \"true\" or c[F] \"false\". These expressions are often combined by connectives like c[∧] \"and\", c[∨] \"or\" and c[¬] \"not\". Typical examples are:\n\nmath[$$x < y$$\n$$(x < y) \\land (b = c)$$]\n\n]/* Propositional Expressions */\n\nsec[Conditional expressions][\nThe notation of conditional expressions was a new concept, developed by McCarthy in 1960. It is the ancestor of the \"if...then...else\" condition, who is part of nearly every programming language nowadays. Conditional expressions allow a recursive definition of functions in a convenient way. A conditional expression has the form:\n\nmath[$$(p_1 \\rightarrow e_1,\\cdots,p_n \\rightarrow e_n)$$]\n\nThe b[p]’s are propositional expressions that are true or false. The b[e]’s could be any kind of expression. One could read \"if b[p]sub[1] then b[e]sub[1], else if b[p] sub[2] then b[e]sub[2], ..., else if b[p]sub[n] then b[e]sub[n]\" or \"b[p]sub[1] yields b[e]sub[1], ..., b[p]sub[n] yields b[e]sub[n]\".\n\nThe b[p]’s get evaluate from left to right. When the first true b[p] is found, then the conditional expressions returns the b[e] that belongs to the b[p].\n\nmath[$$(1 < 2 \\rightarrow 4, 1 > 2 \\rightarrow 3) = 4$$\n\n$$(2 < 1 \\rightarrow 4, 2 > 1 \\rightarrow 3, 2 > 1 \\rightarrow 2) = 3$$\n\n$$(2 < 1 \\rightarrow 4, T \\rightarrow 3) = 3$$\n\n$$(2 < 1 \\rightarrow {0 \\over 0}, T \\rightarrow 3) = 3$$]\n\nThe whole conditional expressions is undefined:\nol[\n- if all b[p]'s are false, \n- if an undefined b[p] occurs before a true b[p] occurs \n- or if the b[e] that belongs to the first true b[p] is undefined it self\n]\n\nmath[$$(2 < 1 \\rightarrow 3, 4 < 1 \\rightarrow 4) \\mbox{ is undefined}$$\n\n$$({0 \\over 0} < 1 \\rightarrow 3, 1 < 4 \\rightarrow 4) \\mbox{ is undefined}$$\n\n$$(2 < 1 \\rightarrow 3, T \\rightarrow {0 \\over 0} )\\mbox{ is undefined}$$]\n\n][COND]/* Conditional expressions */\n\nsec[Recursive function definitions][\n\nWith the help of conditional expressions it is easy to define recursive functions. The factorial of a non-negative integer b[n] could be described as follows:\n\nmath[$$n! = (n = 0 \\rightarrow 1, T \\rightarrow n \\cdot(n - 1)!)$$]\n\nThe evaluation of 0! returns 1. The evaluation of 2! looks as follows:\n\nmath[\\\\begin{eqnarray*}\n2! &=& (2 = 0 \\\\rightarrow 1, T \\\\rightarrow 2 \\\\cdot (2 - 1)!)\\\\\\\\\n&=& 2 \\\\cdot 1!\\\\\\\\\n&=& 2 \\\\cdot (1 = 0 \\\\rightarrow 1 T \\\\rightarrow \\\\cdot (1 - 1)!)\\\\\\\\\n&=& 2 \\\\cdot 1 \\\\cdot 0!\\\\\\\\\n&=& 2 \\\\cdot 1 \\\\cdot (0 = 0 \\\\rightarrow 1, T \\\\rightarrow 0\\\\cdot(0-1)!)\\\\\\\\\n&=&2\\\\cdot1\\\\cdot1\\\\\\\\\n&=&2\n\\\\end{eqnarray*}]\n\n]/* Recursive function definitions */\n\nsec[Lambda calculus][\nThe Lambda calculus is a formal notation, which is used in LISP to generate new functions and to use functions as arguments. It was introduced by Alonzo Church in 1941 (see id[ LAMBDA]).\n\nChurch distinguishes between forms and functions. An expression like im[$y^2 + x$] is a form. An expression like im[$f(3, 4)$ ] a function. im[$y^2 + x$] is not a function because the expression im[$y^2 + x(3, 4)$] does not determine and could turn into 19 or 13. The problem is that the order, in which the arguments 3 and 4 are inserted into the form, is undefined. To convert a form into a function we can write: is $2.50 for the first one, and $2.00 for each additional one\n\nmath[$$\\lambda((x_1, \\cdots, x_n),\\cal E)$$]\n\nim[$\\cal E$] is a form and im[$x_1, \\cdots, x_n$] are the ordered parameters for im[$\\cal E$]. The λ-expression is a function because the variables in im[$\\cal E$] can be substituted with arguments in the order of the parameter list im[$x_1, \\cdots, x_n$]. We say that the variables of a λ-expression are bounded. The example from above looks now like this:\n\nmath[$$\\lambda((x,y),y^2 +x)$$]\n\nAnd with arguments like this:\n\nmath[$$\\lambda((x,y),y^2 +x)(3,4) = 19$$]\n\n\nIf we want to define a recursive function like\n\nmath[$${\\rm sqrt}(a,x,\\epsilon)\n = (|x^2 - a| < \\epsilon \\rightarrow x, T \\rightarrow {\\rm sqrt}(a,\n{1 \\over 2}(x + {a \\over x}),\\epsilon))$$]\n\nin lambda notation\n\nmath[$${\\rm sqrt} = \\lambda((a,x,\\epsilon),(|x^2 - a| < \\epsilon \\rightarrow x,\nT\\rightarrow\n{\\rm sqrt} (a,{1 \\over 2}(x + {a \\over x}), \\epsilon))),$$]\n\nwe found that these definition is inadequate, because the right-hand side im[$sqrt$] can not serve as an expression for the whole function. Remember, a function would look like im[$sqrt(a,x,ε)$].\n\nIn order to define recursive λ-expressions, we must introduce a new notation.\n\nmath[$$label(f,\\cal E)$$]\n\nb[f] can be seen as the function name. The occurrence of b[f] within im[$\\cal E$] will be evaluated to the label-expression as if b[f] is a parameter of the function. \n\nmath[$$label(sqrt, \\lambda((a,x,\\epsilon),(| x^2 - a|\n< \\epsilon \\rightarrow x, T \\rightarrow {\\rm sqrt} (a, {1 \\over 2}(x + {a\n\\over x}),\\epsilon))))$$]\n\n][LAMBDACALCULUS]/* Lambda calculus */\n\n]/* Mathematical concepts behind Lisp */" ], "githubRepo": { "firstCommit": 2013, "stars": 4, "forks": 1, "subscribers": 1, "created": 2013, "updated": 2022, "description": "BlockML is a lightweight markup language for scientific documents.", "issues": 23, "url": "https://github.com/Lindemann/BlockML" }, "repoStats": { "firstCommit": 2013, "commits": 160, "committers": 3, "files": 286 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n7698827|Show HN: BlockML – A markup language for scientific documents|2014-05-05 14:47:24 UTC|1399301244|Lindemann|0|3", "twitter": "https://twitter.com/awwapps" }, "bloom": { "title": "bloom", "appeared": 2010, "type": "pl", "website": "http://bloom-lang.net/", "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "domainName": { "registered": 2010, "name": "bloom-lang.net" }, "githubRepo": { "firstCommit": 2010, "stars": 823, "forks": 62, "subscribers": 58, "created": 2011, "updated": 2022, "description": "Prototype Bud runtime (Bloom Under Development)", "issues": 100, "url": "https://github.com/bloom-lang/bud" }, "repoStats": { "firstCommit": 2010, "commits": 3176, "committers": 28, "files": 99 } }, "blooms": { "title": "BLOOMS", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/81afa041b9e93bcaf86555f952fcf14fbc1b8b09" ], "country": [ "Italy" ], "originCommunity": [ "University of Rome", "University of Siena" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8035", "centralPackageRepositoryCount": 0 }, "bloop": { "title": "BlooP", "appeared": 1979, "type": "esolang", "country": [ "United States" ], "originCommunity": [ "Fluid Analogies Research Group" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "PRINT" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "DEFINE PROCEDURE ''ACKERMANN'' [M, N]:\nBLOCK 0: BEGIN\n\tCELL(0) ⇐ M;\n\tOUTPUT ⇐ N;\n\tCELL(1) ⇐ 0;\n\tMU-LOOP:\n\tBLOCK 1: BEGIN\n\t\tIF CELL(0) = 0, THEN:\n\t\tBLOCK 2: BEGIN\n\t\t\tOUTPUT ⇐ OUTPUT + 1;\n\t\t\tIF CELL(1) = 0, THEN: ABORT LOOP 1;\n\t\t\tCELL(0) ⇐ TOP [CELL(1)];\n\t\t\tCELL(1) ⇐ POP [CELL(1)];\n\t\t\tQUIT BLOCK 1;\n\t\tBLOCK 2: END\n\t\tIF OUTPUT = 0, THEN:\n\t\tBLOCK 3: BEGIN\n\t\t\tOUTPUT ⇐ 1;\n\t\t\tCELL(0) ⇐ MINUS [CELL(0), 1];\n\t\t\tQUIT BLOCK 1;\n\t\tBLOCK 3: END \n\t\tOUTPUT ⇐ MINUS [OUTPUT, 1];\n\t\tCELL(1) ⇐ PUSH [MINUS [CELL(0), 1], CELL(1)];\n\tBLOCK 1: END;\nBLOCK 0: END." ], "summary": "BlooP and FlooP are simple programming languages designed by Douglas Hofstadter to illustrate a point in his book Gödel, Escher, Bach. BlooP is a non-Turing-complete programming language whose main control flow structure is a bounded loop (i.e. recursion is not permitted). All programs in the language must terminate, and this language can only express primitive recursive functions. FlooP is identical to BlooP except that it supports unbounded loops; it is a Turing-complete language and can express all computable functions. For example, it can express the Ackermann function, which (not being primitive recursive) cannot be written in BlooP. Borrowing from standard terminology in mathematical logic, Hofstadter calls FlooP's unbounded loops MU-loops. Like all Turing-complete programming languages, FlooP suffers from the halting problem: programs might not terminate, and it is not possible, in general, to decide which programs do. BlooP and FlooP can be regarded as models of computation, and have sometimes been used in teaching computability.", "pageId": 436718, "dailyPageViews": 33, "created": 2004, "backlinksCount": 41, "revisionCount": 99, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/BlooP_and_FlooP" }, "leachim6": { "filepath": "b/Bloop.bloop", "fileExtensions": [ "bloop" ], "example": [ "DEFINE PROCEDURE ''HELLO-WORLD'' [N]:\nBLOCK 0: BEGIN\n PRINT['Hello World']\nBLOCK 0: END.\nHELLO-WORLD[1]; " ], "id": "Bloop" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:BlooP", "replit": "https://repl.it/languages/bloop", "hopl": "https://hopl.info/showlanguage.prx?exp=844", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n||Experimental Programming Languages: Subtext, Iswim, Unity, P, Lava, Lithe, Bloop And Floop, Advice Taker, Charity, Ambienttalk, Lagoona|Books and LLC|9781156905357" }, "blox": { "title": "Blox", "appeared": 2018, "type": "pl", "example": [ "print(1+2*3/4)\n\nprint(3.0-1.5)\n\nprint(1 > 0)\nprint(1 < 0)\nprint(1 >= 0)\nprint(1 <= 0)\nprint(1 == 0)\nprint(1 != 0)\n\nprint(not TRUE and FALSE or TRUE)" ], "githubRepo": { "stars": 0, "forks": 1, "subscribers": 1, "created": 2018, "updated": 2018, "description": "Blox programming language", "issues": 0, "url": "https://github.com/ciromoraismedeiros/blox-lang" }, "repoStats": { "firstCommit": 2018, "commits": 47, "committers": 2, "files": 25 }, "centralPackageRepositoryCount": 0 }, "blue-programming-language": { "title": "Blue", "appeared": 1977, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Blue_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=792", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2007|A K Peters/CRC Press|Game Design: From Blue Sky to Green Light|Todd, Deborah|9781568813189", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2008|Fine-grained parallelization of the Car - Parrinello ab initio molecular dynamics method on the IBM Blue Gene/L supercomputer|10.1147/rd.521.0159|46|2|Eric J. Bohm and A. Bhatele and L. Kalé and M. Tuckerman and Sameer Kumar and John A. Gunnels and G. Martyna|40880700cd8fbee9c639c2b67eb4297e002163a6\n2014|Parallel Deep Neural Network Training for Big Data on Blue Gene/Q|10.1109/SC.2014.66|33|1|I. Chung and T. Sainath and B. Ramabhadran and M. Picheny and John A. Gunnels and V. Austel and U. Chaudhari and Brian Kingsbury|bac96c394bf6aed8aded20b3d5ff96825e074da9\n2005|Blue Gene/L advanced diagnostics environment|10.1147/rd.492.0319|24|3|M. Giampapa and R. Bellofatto and M. Blumrich and Dong Chen and M. B. Dombrowa and A. Gara and R. Haring and P. Heidelberger and D. Hoenicke and G. Kopcsay and B. J. Nathanson and B. Steinmacher-Burow and M. Ohmacht and V. Salapura and P. Vranas|f7f10b44a2313c51e3184057c0588e554ffef2c6\n2002|A C++ implementation of the co-array programming model for blue gene/L|10.1109/IPDPS.2002.1016489|6|0|M. Eleftheriou and S. Chatterjee and J. Moreira|fdaafa27b0141beb3001a89f84e9485c85d186f8\n1996|Blue - language for teaching object-oriented programming|10.1145/236462.236537|3|0|M. Kölling and J. Rosenberg|aff4b6fd9f4493cf3d0b643f7163ee1ad96cacac\n2015|\"\"\"Add Another Blue Stack of the Same Height!\"\": ASP Based Planning and Plan Failure Analysis\"|10.1007/978-3-319-23264-5_11|2|0|Chitta Baral and Tran Cao Son|9a9dac5f940d3587611b98e5e44c4bda35a0f160\n2006|The Blue Gene, GCC and lattice QCD: a case study|10.1088/1742-6596/46/1/022|1|0|A. Pochinsky|3d707daa92b3c9fe9f6580b1be930b9c7704b8d6" }, "blue": { "title": "blue", "appeared": 2009, "type": "pl", "reference": [ "https://www.ibm.com/developerworks/library/os-blue/index.html" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1863", "wordRank": 618, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2007|A K Peters/CRC Press|Game Design: From Blue Sky to Green Light|Todd, Deborah|9781568813189", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2008|Fine-grained parallelization of the Car - Parrinello ab initio molecular dynamics method on the IBM Blue Gene/L supercomputer|10.1147/rd.521.0159|46|2|Eric J. Bohm and A. Bhatele and L. Kalé and M. Tuckerman and Sameer Kumar and John A. Gunnels and G. Martyna|40880700cd8fbee9c639c2b67eb4297e002163a6\n2014|Parallel Deep Neural Network Training for Big Data on Blue Gene/Q|10.1109/SC.2014.66|33|1|I. Chung and T. Sainath and B. Ramabhadran and M. Picheny and John A. Gunnels and V. Austel and U. Chaudhari and Brian Kingsbury|bac96c394bf6aed8aded20b3d5ff96825e074da9\n2005|Blue Gene/L advanced diagnostics environment|10.1147/rd.492.0319|24|3|M. Giampapa and R. Bellofatto and M. Blumrich and Dong Chen and M. B. Dombrowa and A. Gara and R. Haring and P. Heidelberger and D. Hoenicke and G. Kopcsay and B. J. Nathanson and B. Steinmacher-Burow and M. Ohmacht and V. Salapura and P. Vranas|f7f10b44a2313c51e3184057c0588e554ffef2c6\n2002|A C++ implementation of the co-array programming model for blue gene/L|10.1109/IPDPS.2002.1016489|6|0|M. Eleftheriou and S. Chatterjee and J. Moreira|fdaafa27b0141beb3001a89f84e9485c85d186f8\n1996|Blue - language for teaching object-oriented programming|10.1145/236462.236537|3|0|M. Kölling and J. Rosenberg|aff4b6fd9f4493cf3d0b643f7163ee1ad96cacac\n2015|\"\"\"Add Another Blue Stack of the Same Height!\"\": ASP Based Planning and Plan Failure Analysis\"|10.1007/978-3-319-23264-5_11|2|0|Chitta Baral and Tran Cao Son|9a9dac5f940d3587611b98e5e44c4bda35a0f160\n2006|The Blue Gene, GCC and lattice QCD: a case study|10.1088/1742-6596/46/1/022|1|0|A. Pochinsky|3d707daa92b3c9fe9f6580b1be930b9c7704b8d6" }, "blueprints": { "title": "Blueprints", "appeared": 2014, "type": "visual", "description": "Blueprints is the visual scripting system inside Unreal Engine 4 and is a fast way to start prototyping your game.", "website": "https://docs.unrealengine.com/latest/INT/Engine/Blueprints/index.html", "country": [ "United States" ], "originCommunity": [ "Epic Games" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "bluespec": { "title": "Bluespec", "appeared": 2000, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bluespec, Inc" ], "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "booleanTokens": [ [ "True", "False" ] ], "wikipedia": { "related": [ "haskell", "systemverilog" ], "summary": "Bluespec, Inc. is a semiconductor tool design company co-founded by Prof. Arvind of MIT in June 2003. Arvind had previously founded Sandburst in 2000, which specialized in producing chips for 10G-bit Ethernet routers; for this task, Arvind had developed the Bluespec language, a high-level functional hardware description programming language which was essentially Haskell extended to handle chip design and electronic design automation in general. The main designer and implementor of Bluespec was Lennart Augustsson. Bluespec is partially evaluated (to convert the Haskell parts) and compiled to the term rewriting system (TRS). It comes with a SystemVerilog frontend.Bluespec has two product lines. Primarily for ASIC and FPGA hardware designers and architects, Bluespec supplies high-level synthesis (ESL logic synthesis) with RTL. The first Bluespec workshop [1] was held on August 13, 2007 at MIT.", "pageId": 5931665, "created": 2006, "backlinksCount": 11, "revisionCount": 33, "dailyPageViews": 25, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Bluespec" }, "githubLanguage": { "fileExtensions": [ "bsv" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "verilog", "tmScope": "source.bsv", "repos": 275, "id": "Bluespec" }, "githubBigQuery": { "repos": 51, "users": 32, "id": "Bluespec" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2015, "committerCount": 2, "commitCount": 12, "sampleCount": 2, "example": [ "package TbTL;\n\nimport TL::*;\n\ninterface Lamp;\n method Bool changed;\n method Action show_offs;\n method Action show_ons;\n method Action reset;\nendinterface\n\nmodule mkLamp#(String name, Bool lamp)(Lamp);\n Reg#(Bool) prev <- mkReg(False);\n\n method changed = (prev != lamp);\n\n method Action show_offs;\n if (prev && !lamp)\n $write (name + \" off, \");\n endmethod\n\n method Action show_ons;\n if (!prev && lamp)\n $write (name + \" on, \");\n endmethod\n\n method Action reset;\n prev <= lamp;\n endmethod\nendmodule\n\n\n(* synthesize *)\nmodule mkTest();\n let dut <- sysTL;\n\n Reg#(Bit#(16)) ctr <- mkReg(0);\n\n Reg#(Bool) carN <- mkReg(False);\n Reg#(Bool) carS <- mkReg(False);\n Reg#(Bool) carE <- mkReg(False);\n Reg#(Bool) carW <- mkReg(False);\n\n Lamp lamps[12];\n\n lamps[0] <- mkLamp(\"0: NS red \", dut.lampRedNS);\n lamps[1] <- mkLamp(\"1: NS amber\", dut.lampAmberNS);\n lamps[2] <- mkLamp(\"2: NS green\", dut.lampGreenNS);\n lamps[3] <- mkLamp(\"3: E red \", dut.lampRedE);\n lamps[4] <- mkLamp(\"4: E amber\", dut.lampAmberE);\n lamps[5] <- mkLamp(\"5: E green\", dut.lampGreenE);\n lamps[6] <- mkLamp(\"6: W red \", dut.lampRedW);\n lamps[7] <- mkLamp(\"7: W amber\", dut.lampAmberW);\n lamps[8] <- mkLamp(\"8: W green\", dut.lampGreenW);\n\n lamps[9] <- mkLamp(\"9: Ped red \", dut.lampRedPed);\n lamps[10] <- mkLamp(\"10: Ped amber\", dut.lampAmberPed);\n lamps[11] <- mkLamp(\"11: Ped green\", dut.lampGreenPed);\n\n rule start (ctr == 0);\n $dumpvars;\n endrule\n\n rule detect_cars;\n dut.set_car_state_N(carN);\n dut.set_car_state_S(carS);\n dut.set_car_state_E(carE);\n dut.set_car_state_W(carW);\n endrule\n\n rule go;\n ctr <= ctr + 1;\n if (ctr == 5000) carN <= True;\n if (ctr == 6500) carN <= False;\n if (ctr == 12_000) dut.ped_button_push;\n endrule\n\n rule stop (ctr > 32768);\n $display(\"TESTS FINISHED\");\n $finish(0);\n endrule\n\n function do_offs(l) = l.show_offs;\n function do_ons(l) = l.show_ons;\n function do_reset(l) = l.reset;\n\n function do_it(f);\n action\n for (Integer i=0; i<12; i=i+1)\n f(lamps[i]);\n endaction\n endfunction\n\n function any_changes();\n Bool b = False;\n for (Integer i=0; i<12; i=i+1)\n b = b || lamps[i].changed;\n return b;\n endfunction\n\n rule show (any_changes());\n do_it(do_offs);\n do_it(do_ons);\n do_it(do_reset);\n $display(\"(at time %d)\", $time);\n endrule\nendmodule\n\nendpackage\n" ], "url": "https://github.com/thotypous/sublime-bsv" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "blur-markup-language": { "title": "blur-markup-language", "appeared": 2017, "type": "textMarkup", "creators": [ "Andrew Yoon" ], "website": "http://www.bml-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://nothing-to-say.org/" ], "domainName": { "registered": 2018, "name": "bml-lang.org" }, "githubRepo": { "firstCommit": 2017, "stars": 21, "subscribers": 2, "created": 2017, "updated": 2022, "description": "a stochastic markup language", "forks": 0, "issues": 2, "url": "https://github.com/ajyoon/bml" }, "repoStats": { "firstCommit": 2017, "commits": 336, "committers": 3, "files": 59 } }, "blz": { "title": "blz", "appeared": 2015, "type": "pl", "website": "https://blazingk.in/blz", "country": [ "United States" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "import Lists\n:main\n # Print cubes of even numbers\n evens = range(1000).filter!(x -> x % 2 == 0)\n print(evens.map!(x -> x ** 3)\nend" ], "githubRepo": { "stars": 23, "forks": 0, "subscribers": 6, "created": 2014, "updated": 2021, "description": "An open source programming language", "issues": 17, "url": "https://github.com/blazingkin/blz-ospl" }, "repoStats": { "firstCommit": 2014, "commits": 538, "committers": 8, "files": 480 } }, "bmd": { "title": "BMD", "appeared": 1961, "type": "pl", "description": "Biomedical Computer Programs for Data Description and Statistical Analyses", "reference": [ "https://www.jstor.org/stable/pdf/3150004.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "hopl": "https://hopl.info/showlanguage.prx?exp=145" }, "bml": { "title": "bml", "appeared": 2014, "type": "dataNotation", "reference": [ "https://news.ycombinator.com/item?id=8645591" ], "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "server\n path: /core/www/\n host: example.com\n port: 80\n service: true\n proxy\n host: proxy.example.com\n port: 8080\n authentication: plain\n description\n :Primary web-facing server\n :Provides commerce-related functionality\n\nserver\n ...\n proxy host=\"proxy.example.com\" port=\"8080\"\n authentication: plain" ], "semanticScholar": "" }, "bmp-format": { "title": "BMP file format", "appeared": 2000, "type": "binaryDataFormat", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "summary": "The BMP file format, also known as bitmap image file or device independent bitmap (DIB) file format or simply a bitmap, is a raster graphics image file format used to store bitmap digital images, independently of the display device (such as a graphics adapter), especially on Microsoft Windows and OS/2 operating systems. The BMP file format is capable of storing two-dimensional digital images both monochrome and color, in various color depths, and optionally with data compression, alpha channels, and color profiles. The Windows Metafile (WMF) specification covers the BMP file format. Among others, wingdi.h defines BMP constants and structures.", "backlinksCount": 627, "pageId": 250336, "dailyPageViews": 1316, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/BMP_file_format" } }, "bnf": { "title": "BNF", "appeared": 1956, "type": "grammarLanguage", "creators": [ "John Backus", "Peter Naur" ], "standsFor": "Backus–Naur Form", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "example": [ " ::= | \n ::= \"<\" \">\" \"::=\" \n ::= \" \" | \"\"\n ::= | \"|\" \n ::= | \n ::= | \n ::= | \"<\" \">\"\n ::= '\"' '\"' | \"'\" \"'\"\n ::= \"\" | \n ::= \"\" | \n ::= | | \n ::= \"A\" | \"B\" | \"C\" | \"D\" | \"E\" | \"F\" | \"G\" | \"H\" | \"I\" | \"J\" | \"K\" | \"L\" | \"M\" | \"N\" | \"O\" | \"P\" | \"Q\" | \"R\" | \"S\" | \"T\" | \"U\" | \"V\" | \"W\" | \"X\" | \"Y\" | \"Z\" | \"a\" | \"b\" | \"c\" | \"d\" | \"e\" | \"f\" | \"g\" | \"h\" | \"i\" | \"j\" | \"k\" | \"l\" | \"m\" | \"n\" | \"o\" | \"p\" | \"q\" | \"r\" | \"s\" | \"t\" | \"u\" | \"v\" | \"w\" | \"x\" | \"y\" | \"z\"\n ::= \"0\" | \"1\" | \"2\" | \"3\" | \"4\" | \"5\" | \"6\" | \"7\" | \"8\" | \"9\"\n ::= \"|\" | \" \" | \"-\" | \"!\" | \"#\" | \"$\" | \"%\" | \"&\" | \"(\" | \")\" | \"*\" | \"+\" | \",\" | \"-\" | \".\" | \"/\" | \":\" | \";\" | \">\" | \"=\" | \"<\" | \"?\" | \"@\" | \"[\" | \"\\\" | \"]\" | \"^\" | \"_\" | \"`\" | \"{\" | \"}\" | \"~\"\n ::= | \"'\"\n ::= | '\"'\n ::= | \n ::= | | \"-\"" ], "related": [ "algol-58", "algol", "algol-60", "compiler-compiler", "yacc", "symbol", "ascii", "regex", "pl-i", "peg", "antlr", "java", "haskell", "coco-r", "gold", "bison", "xpl", "isbn" ], "summary": "In computer science, Backus–Naur form or Backus normal form (BNF) is a notation technique for context-free grammars, often used to describe the syntax of languages used in computing, such as computer programming languages, document formats, instruction sets and communication protocols. They are applied wherever exact descriptions of languages are needed: for instance, in official language specifications, in manuals, and in textbooks on programming language theory. Many extensions and variants of the original Backus–Naur notation are used; some are exactly defined, including extended Backus–Naur form (EBNF) and augmented Backus–Naur form (ABNF).", "pageId": 62247, "dailyPageViews": 488, "backlinksCount": 130, "appeared": 1956, "url": "https://en.wikipedia.org/wiki/Backus–Naur_form" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/bnf", "pygmentsHighlighter": { "filename": "grammar_notation.py", "fileExtensions": [ "bnf" ], "id": "BNF" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1865", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "boa": { "title": "boa", "appeared": 2013, "type": "plzoo", "description": "object-oriented, eager, first-class functions, dynamic types, extensible objects", "website": "http://plzoo.andrej.com/language/boa.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "boa.py", "fileExtensions": [ "boa" ], "id": "Boa" }, "centralPackageRepositoryCount": 0 }, "bob": { "title": "Bob", "appeared": 1991, "type": "pl", "reference": [ "https://github.com/dbetz/bob" ], "country": [ "United States" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1611", "wordRank": 1923, "centralPackageRepositoryCount": 0 }, "bog": { "title": "bog", "appeared": 2020, "type": "pl", "description": "Small, strongly typed, embeddable language.", "country": [ "Finland" ], "originCommunity": [ "https://github.com/Vexu/bog/issues" ], "writtenIn": [ "zig" ], "hasPrintDebugging": { "example": "", "value": true }, "hasAssignment": { "example": "let pldb = \"pldb\"", "value": true }, "hasStrings": { "example": "\"pldb\"", "value": true }, "hasImports": { "example": "let {print} = import \"std.io\"", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasDestructuring": { "example": "let add = fn ((a,b)) a + b\nlet tuplify = fn (a,b) (a,b)\nreturn add(tuplify(1,2)) # 3", "value": true }, "hasTryCatch": { "example": "let foo = fn(arg)\n try\n fails_on_1(arg)\n fails_on_2(arg)\n fails_on_3(arg)\n catch let err\n return err\n return 99", "value": true }, "hasForLoops": { "example": "let mut sum = 0\nfor let c in \"hellö wörld\"\n match c\n \"h\" => sum += 1\n \"e\" => sum += 2\n \"l\" => sum += 3\n \"ö\" => sum += 4\n \"w\" => sum += 5\n \"d\" => sum += 6", "value": true }, "hasAsyncAwait": { "example": "let {print} = import \"std.io\"\nlet foo = fn()\n print(\"foo started\")\n let bar_frame = async bar()\n print(\"in foo\")\n let bar_res = await bar_frame\n print(\"foo finished\")\n return bar_res\nlet bar = fn()\n print(\"bar started\")\n suspend\n print(\"bar resumed\")\n suspend\n print(\"bar finished\")\n return 1\nprint(\"main started\")\nlet foo_frame = async foo()\nprint(\"in main\")\nlet res = await foo_frame\nprint(\"main finished:\", res)", "value": true }, "example": [ "let {print} = import \"std.io\"\nlet world = \"world\"\nprint(f\"hello {world}!\")" ], "githubRepo": { "stars": 254, "forks": 5, "subscribers": 10, "created": 2020, "updated": 2023, "description": "Small, strongly typed, embeddable language.", "issues": 5, "url": "https://github.com/Vexu/bog" }, "repoStats": { "firstCommit": 2020, "commits": 441, "committers": 8, "files": 52 } }, "boil": { "title": "BOIL", "appeared": 1998, "type": "pl", "reference": [ "http://www.sai.msu.su/sal/F/1/BOIL.html" ], "country": [ "Germany" ], "originCommunity": [ "netEstate GmbH" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8517", "centralPackageRepositoryCount": 0 }, "bolin": { "title": "Bolin", "appeared": 2022, "type": "pl", "description": "Bolin - A compiler friends and I wrote", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wnvsiy/bolin_a_compiler_friends_and_i_wrote/", "https://bolinlang.com/" ], "country": [ "Canada" ] }, "bolt": { "title": "BOLT", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/52ce99d5cefd05c4e30dbf631e4bc9f24f34c52b" ], "country": [ "United States" ], "originCommunity": [ "American Microsystems, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5317", "wordRank": 9798, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1990|Future Directions in Natural Language Processing: The Bolt Beranek and Newman Natural Language Symposium|10.1609/aimag.v11i2.834|2|0|M. Maybury|8e9c31a8c5af8cfc38e0360c41b0d42203ba94e6" }, "bon-programming-language": { "title": "Bon", "appeared": 1967, "type": "pl", "description": "Bon was a programming language created by Ken Thompson while he worked on the MULTICS operating system. Bon was named either after Thompson's wife Bonnie or else, after \"a religion whose rituals involve the murmuring of magic formulas\" (a reference to the Tibetan native religion Bön).", "reference": [ "http://self.gutenberg.org/articles/bon_programming_language" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Bon_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "boo": { "title": "Boo", "appeared": 2003, "type": "pl", "creators": [ "Rodrigo B. De Oliveira" ], "website": "https://github.com/boo-lang", "documentation": [ "https://bootest.readthedocs.io/en/latest/" ], "country": [ "Brasil" ], "originCommunity": [ "The Boo Programming Language" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "# 0\\d+", "value": true }, "hasHexadecimals": { "example": "# 0x[a-fA-F0-9]+", "value": true }, "hasFloats": { "example": "# (\\d+\\.\\d*|\\d*\\.\\d+)([fF][+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "# \\d+", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "def fib():\n a, b = 0L, 1L # The 'L's make the numbers double word length (typically 64 bits)\n while true:\n yield b\n a, b = b, a + b\n\n# Print the first 5 numbers in the series:\nfor index as int, element in zip(range(5), fib()):\n print(\"${index+1}: ${element}\")" ], "related": [ "csharp", "python", "genie", "vala", "unicode", "unity-engine", "fantom", "groovy", "nemerle", "rebol" ], "summary": "Boo is an object-oriented, statically typed, general-purpose programming language that seeks to make use of the Common Language Infrastructure's support for Unicode, internationalization, and web applications, while using a Python-inspired syntax and a special focus on language and compiler extensibility. Some features of note include type inference, generators, multimethods, optional duck typing, macros, true closures, currying, and first-class functions. Boo was one of the three scripting languages for the Unity game engine (Unity Technologies employed De Oliveira), until it was dropped in 2014 due to small userbase. Boo is free software released under the BSD 3-Clause license. It is compatible with both the Microsoft .NET and Mono frameworks.", "pageId": 1147624, "dailyPageViews": 128, "created": 2004, "backlinksCount": 127, "revisionCount": 274, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Boo_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "boo" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nbyt3bl33d3r SILENTTRINITY https://github.com/byt3bl33d3r.png https://github.com/byt3bl33d3r/SILENTTRINITY Boo #d4bec1 858 166 114 \"An asynchronous, collaborative post-exploitation agent powered by Python and .NET's DLR\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "tmScope": "source.boo", "repos": 232, "id": "Boo" }, "githubBigQuery": { "repos": 241, "users": 208, "id": "Boo" }, "pygmentsHighlighter": { "filename": "dotnet.py", "fileExtensions": [ "boo" ], "id": "Boo" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2016, "committerCount": 5, "commitCount": 56, "url": "https://github.com/Shammah/boo-sublime" }, "projectEuler": { "memberCount": { "2019": 21, "2022": 23 }, "id": "Boo" }, "helloWorldCollection": [ "# Hello World in Boo\nprint \"Hello World\"\n" ], "leachim6": { "filepath": "b/Boo.boo", "fileExtensions": [ "boo" ], "example": [ "print \"Hello World\"\n" ], "id": "Boo" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Boo", "rijuRepl": { "example": [ "print \"Hello, world!\"\n" ], "description": "Object-oriented, statically typed, general-purpose programming language on Microsoft's Common Language Infrastructure", "fileExtensions": [ "boo" ], "website": "https://boo-language.github.io/", "gitRepo": "https://github.com/boo-lang/boo", "id": "https://riju.codes/boo" }, "tryItOnline": "boo", "tiobe": { "id": "Boo" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "boogie": { "title": "Boogie", "appeared": 2008, "type": "pl", "description": "The Boogie IVL (intermediate verification language) is a simple language designed for verification which was originally created by Microsoft Research.", "website": "https://boogie-docs.readthedocs.io/en/latest/", "originCommunity": [ "Microsoft" ], "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "example": [ "// Variable a is a nested map that maps\n// integers to a map that maps 32-bit wide bitvectors\n// to booleans.\nvar a:[int][bv32]bool;" ], "githubLanguage": { "type": "programming", "fileExtensions": [ "bpl" ], "interpreters": [ "boogie" ], "aceMode": "text", "tmScope": "source.boogie", "repos": 21, "id": "Boogie" }, "githubBigQuery": { "repos": 4, "users": 4, "id": "Boogie" }, "pygmentsHighlighter": { "filename": "verification.py", "fileExtensions": [ "bpl" ], "id": "Boogie" } }, "boomerang-decompiler": { "title": "Boomerang Decompiler", "appeared": 2002, "type": "decompiler", "country": [ "Australia" ], "originCommunity": [ "Queensland University of Technology" ], "githubRepo": { "firstCommit": 2002, "stars": 314, "forks": 54, "subscribers": 27, "created": 2013, "updated": 2022, "description": "Boomerang Decompiler - Fighting the code-rot :)", "issues": 36, "url": "https://github.com/BoomerangDecompiler/boomerang" } }, "boost-lib": { "title": "Boost C++ libraries", "appeared": 1998, "type": "library", "website": "https://www.boost.org/", "country": [ "Interstellar Space" ], "originCommunity": [ "Boost.org" ], "domainName": { "registered": 1998, "awisRank": { "2022": 54216 }, "name": "boost.org" }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Boost_(C%2B%2B_libraries)" } }, "booster": { "title": "Booster", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/688ffbc3b481bb451bc1cb206e67478138b0eee7" ], "country": [ "The Netherlands" ], "originCommunity": [ "TN0 Institute of Applied Computer Science", "Delft University of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1458", "centralPackageRepositoryCount": 0 }, "borneo": { "title": "Borneo", "appeared": 1998, "type": "pl", "reference": [ "http://sonic.net/~jddarcy/Borneo/" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8518", "centralPackageRepositoryCount": 0 }, "boron": { "title": "Boron", "appeared": 2009, "type": "pl", "creators": [ "Karl Robillard" ], "description": "Boron is a scripting language similar to REBOL. The interpreter is a C library which may be copied under the terms of the LGPLv3.", "website": "http://urlan.sourceforge.net/boron/", "fileExtensions": [ "b", "sb" ], "influencedBy": [ "rebol" ], "canDoShebang": { "example": "#!/usr/bin/env boron", "value": true }, "canWriteToDisk": { "example": "write %helloworld.txt \"Hello, world!^/\"", "value": true }, "hasComments": { "example": "", "value": true }, "hasExceptions": { "example": "catch [throw 22 print \"You'll never see this.\"]\n\nif error? try [read %does_not_exist] [print \"File not found\"]", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasHomoiconicity": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasLists": { "example": "my-list: [1 two 3.0 \"four\"]", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasMultilineStrings": { "example": "{{\n Line 1\n Line 2\n}}", "value": true }, "hasStrings": { "example": "\"Hello world\"\n{He said \"That looks good!\"}", "value": true }, "hasThreads": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "print", "probe" ] ], "stringToken": [ [ "\"", "{", "}", "{{", "}}" ] ], "booleanTokens": [ [ "true", "false" ] ], "fileType": "text", "isOpenSource": true, "semanticScholar": "" }, "bosque": { "title": "bosque", "appeared": 2019, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Microsoft Research" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2019, "stars": 5294, "forks": 314, "subscribers": 179, "created": 2019, "updated": 2022, "description": "The Bosque programming language is an experiment in regularized design for a machine assisted rapid and reliable software development lifecycle. ", "issues": 4, "url": "https://github.com/Microsoft/BosqueLanguage" }, "repoStats": { "firstCommit": 2019, "commits": 585, "committers": 47, "files": 256 }, "leachim6": { "filepath": "b/Bosque.bsq", "fileExtensions": [ "bsq" ], "example": [ "namespace NSMain;\n\nentrypoint function main(): String { \n return \"Hello World\";\n}" ], "id": "Bosque" }, "isbndb": "year|publisher|title|authors|isbn13\n2021|Packt Publishing|Learn Bosque Programming: Boost your productivity and software reliability with Microsoft's new open-source programming language|Kaczmarek, Sebastian and Ibaceta, Joel|9781839211973" }, "bossam": { "title": "Bossam Rule Language", "appeared": 2004, "type": "queryLanguage", "reference": [ "https://link.springer.com/chapter/10.1007/978-3-540-30504-0_10" ], "country": [ "South Korea" ], "originCommunity": [ "Electronics & Telecommunications Research Institute" ], "related": [ "owl", "rdf" ], "example": [ "prefix family = http://family.com/Family#;\nnamespace = http://family.com/Johns#;\nrule r1 is\n if\n family:isFatherOf(?x,?y)\n and family:isBrotherOf(?z,?\n then\n family:isUncleOf(?z,?y);\nfact f1 is\n family:isFatherOf(John,Bob);" ] }, "bounce-lang": { "title": "Bounce", "appeared": 2016, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/orionrobots" ], "githubRepo": { "stars": 53, "forks": 20, "subscribers": 17, "created": 2016, "updated": 2022, "description": "Visual Programming System For Esp8266 running NodeMCU", "issues": 15, "url": "https://github.com/orionrobots/Bounce" }, "repoStats": { "firstCommit": 2015, "commits": 360, "committers": 6, "files": 204 } }, "bounce": { "title": "Bounce", "appeared": 1994, "type": "pl", "description": "Bounce is a real time visual data flow programming language, designed to create interactive graphical simulations, and to filter and control midi, serial, ethernet, and other devices.", "reference": [ "https://donhopkins.medium.com/bounce-stuff-8310551a96e3" ], "originCommunity": [ "Levity Systems" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3403", "centralPackageRepositoryCount": 0 }, "bourne-shell": { "title": "Bourne shell", "appeared": 1977, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bell Telephone" ], "canDoShebang": { "example": "#!/bin/sh -x", "value": true }, "hasHereDocs": { "example": "", "value": true }, "wikipedia": { "related": [ "unix", "algol-68", "c", "almquist-shell", "bash", "rc", "linux" ], "summary": "The Bourne shell (sh) is a shell, or command-line interpreter, for computer operating systems. The Bourne shell was the default shell for Version 7 Unix. Most Unix-like systems continue to have /bin/sh—which will be the Bourne shell, or a symbolic link or hard link to a compatible shell—even when other shells are used by most users. Developed by Stephen Bourne at Bell Labs, it was a replacement for the Thompson shell, whose executable file had the same name—sh. It was released in 1977 in the Version 7 Unix release distributed to colleges and universities. Although it is used as an interactive command interpreter, it was also intended as a scripting language and contains most of the features that are commonly considered to produce structured programs. It gained popularity with the publication of The Unix Programming Environment by Brian Kernighan and Rob Pike—the first commercially published book that presented the shell as a programming language in a tutorial form.", "pageId": 92839, "dailyPageViews": 270, "created": 2002, "backlinksCount": 249, "revisionCount": 420, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Bourne_shell" }, "projectEuler": { "memberCount": { "2022": 85 }, "id": "Bourne Shell" }, "tiobe": { "id": "Bourne shell" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3931", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPortable Shell Programming: An Extensive Collection of Bourne Shell Examples|1995|Bruce Blinn|592781|4.18|11|3\nText-Oriented Programming Languages: Perl, Python, awk, sed, Bash, TCL, Snobol, Icon, Bourne Shell, Text Editor and Corrector, C Shell, Tcsh|2011|Source Wikipedia|18993822|0.0|0|0", "isbndb": "", "semanticScholar": "" }, "boxer": { "title": "Boxer", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/06f0570a120bbf4b081999e543dc039fe23ae65b" ], "country": [ "United States" ], "originCommunity": [ "National Science Foundation", "Defense Advanced Research Projects Agency" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1868", "centralPackageRepositoryCount": 0 }, "boxx": { "title": "Boxx", "appeared": 2002, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Boxx" }, "centralPackageRepositoryCount": 0 }, "bpel": { "title": "BPEL", "appeared": 2001, "type": "xmlFormat", "standsFor": "Business Process Execution Language", "country": [ "United States" ], "originCommunity": [ "OASIS" ], "wikipedia": { "related": [ "business-process-modeling-language", "wsdl", "xpath", "bpmn", "yawl" ], "summary": "The Web Services Business Process Execution Language (WS-BPEL), commonly known as BPEL (Business Process Execution Language), is an OASIS standard executable language for specifying actions within business processes with web services. Processes in BPEL export and import information by using web service interfaces exclusively.", "pageId": 334947, "dailyPageViews": 116, "created": 2003, "backlinksCount": 113, "revisionCount": 662, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Business_Process_Execution_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nBusiness Process Execution Language for Web Services: An Architect and Developer's Guide to Orchestrating Web Services Using Bpel4ws||Juric Matjaz B Mathew Benny Sarang P G|42650875|0.0|0|0\nBusiness Process Execution Language for Web Services: An Architect and Developer's Guide to Orchestrating Web Services Using Bpel4ws|2006|Matjaz B Juric|23112063|0.0|0|0\nBpel 100 Success Secrets - Business Process Execution Language for Web Services- The XML-Based Language for the Formal Specification of Business Proce|2008|Tony Willis|26610549|0.0|0|0\nSOA for the Business Developer: Concepts, BPEL, and SCA|2007|Ben Margolis|768745|2.00|1|0\nSOA for the Business Developer: Concepts, BPEL, and SCA: Concepts, BPEL and SCA (Business Developers series)||Ben Margolis|63352983|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|BPEL and Java Cookbook|Laznik, Jurij|9781849689205\n17-09-2013|Packt Publishing|BPEL and Java Cookbook|Laznik Jurij|9781849689212\n2007-11-30|Packt Publishing|SOA Approach to Integration: XML, Web services, ESB, and BPEL in real-world SOA projects|Frank Jennings and Matjaz B. Juric and Poornachandra Sarang and Ramesh Loganathan|9781847190116" }, "bpkg-pm": { "title": "bpkg-pm", "appeared": 2017, "type": "packageManager", "creators": [ "Joseph Werle" ], "website": "http://www.bpkg.sh/", "country": [ "Various" ], "originCommunity": [ "The bpkg Team" ], "domainName": { "registered": 2017, "awisRank": { "2022": 6185536 }, "name": "bpkg.sh" }, "githubRepo": { "firstCommit": 2014, "stars": 1665, "forks": 89, "subscribers": 33, "created": 2014, "updated": 2022, "description": "Lightweight bash package manager", "issues": 31, "url": "https://github.com/bpkg/bpkg" }, "packageCount": 26, "forLanguages": [ "bash" ] }, "bpl": { "title": "BPL", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/10c3895ecf739d379279f8a697c1df0a9cd9b89d" ], "country": [ "United Kingdom" ], "originCommunity": [ "Heriot-Watt University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5986", "centralPackageRepositoryCount": 0 }, "bpmn": { "title": "BPMN", "appeared": 2004, "type": "visual", "documentation": [ "https://www.bpmn.org/" ], "standsFor": "Business Process Model and Notation", "country": [ "United States" ], "originCommunity": [ "Business Process Management Initiative", "Object Management Group" ], "wikipedia": { "related": [ "uml", "bpel", "xml", "yawl" ], "summary": "Business Process Model and Notation (BPMN) is a graphical representation for specifying business processes in a business process model. Business Process Management Initiative (BPMI) developed BPMN, which has been maintained by the Object Management Group since the two organizations merged in 2005. Version 2.0 of BPMN was released in January 2011, at which point the name was adapted to Business Process Model and Notation as execution semantics were also introduced alongside the notational and diagramming elements.", "pageId": 3015586, "dailyPageViews": 806, "created": 2005, "backlinksCount": 715, "revisionCount": 716, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Business_Process_Model_and_Notation" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|Springer|A Rigorous Semantics for BPMN 2.0 Process Diagrams|Kossak, Felix and Illibauer, Christa and Geist, Verena and Kubovy, Jan and Natschläger, Christine and Ziebermayr, Thomas and Kopetzky, Theodorich and Freudenthaler, Bernhard and Schewe, Klaus-Dieter|9783319099316\n2015|Springer|A Rigorous Semantics for BPMN 2.0 Process Diagrams|Kossak, Felix and Illibauer, Christa and Geist, Verena and Kubovy, Jan and Natschläger, Christine and Ziebermayr, Thomas and Kopetzky, Theodorich and Freudenthaler, Bernhard and Schewe, Klaus-Dieter|9783319099309", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Extending BPMN for Business Activity Monitoring|10.1109/HICSS.2012.276|71|10|Jan-Philipp Friedenstab and Christian Janiesch and M. Matzner and Oliver Müller|0e2cf738c55d91e3987ac402e60675eafbdaf7ce\n2015|BPMN 2.0 for Modeling Business Processes|10.1007/978-3-642-45100-3_10|58|3|Gustav Aagesen and J. Krogstie|5ee9ff04c275551f8032b8f88e0e482887b53147\n2014|BPMN4CP: Design and implementation of a BPMN extension for clinical pathways|10.1109/BIBM.2014.6999261|55|2|Richard Braun and H. Schlieter and Martin Burwitz and W. Esswein|8c5453a923c3e8c273f06eaf1457ae6e1008ec54\n2011|A Security Language for BPMN Process Models|10.5445/IR/1000023041|51|4|J. Mülle and S. V. Stackelberg and Klemens Böhm|ad1be8bcb0bcaf1abded15fb674fe27df56232f5\n2014|Modeling of privacy-aware business processes in BPMN to protect personal data|10.1145/2554850.2555014|47|5|Wadha Labda and N. Mehandjiev and P. Sampaio|5da5dbfaf00df8d226fe87ae7668cd2937e11527\n2013|Extending BPMN for Wireless Sensor Networks|10.1109/CBI.2013.24|41|4|C. Sungur and P. Spiess and N. Oertel and Oliver Kopp|f3ffe408f09313a33e9c19a5ca0237b598095c1d\n2011|Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language|10.1016/j.jvlc.2010.11.005|40|0|Steffen Mazanek and M. Hanus|5d5cd3710044964e4082b637796d5738cb71787f\n2011|Proposal of Formal Verification of Selected BPMN Models with Alvis Modeling Language|10.1007/978-3-642-24013-3_26|31|0|M. Szpyrka and G. J. Nalepa and A. Ligeza and Krzysztof Kluza|df3a327a1a48710d134a4d839cdb26bee3887d96\n2014|BPMN Formalization and Verification using Maude|10.1145/2630768.2630769|30|1|Nissreen A. S. El-Saber and A. Boronat|34473a7b74a1b6d1ea48558d8209339c45d4c716\n2012|BPMN Conformance in Open Source Engines|10.1109/SOCA.2012.6449467|24|1|Simon Harrer and J. Lenhard and G. Wirtz|a485a2b9af269f3abfd113d6764a164f3dace6ef\n2010|Business process modelling in the context of SOA – an empirical study of the acceptance between EPC and BPMN|10.1504/WRSTSD.2010.032351|19|0|K. Kruczynski|55d948e1fab1434d5f42af585595617b350421a4\n2017|BPMN 2.0 based modeling and customization of variants in business process families|10.1109/CLEI.2017.8226450|5|0|Andrea Delgado and Daniel Calegari|f413c8729a117d05db0bb0b5c56d93c32555db75\n2015|A visual editor for language-independent scripting for BPMN modeling|10.1109/JCSSE.2015.7219788|2|0|Jessada Wiriyakul and T. Senivongse|a0e4b31352211856a0c61cebdf6286146bae514c\n2011|Levi - A Workflow Engine Using BPMN 2.0|10.1007/978-3-642-38333-5_13|1|0|Keheliya Gallaba and Umashanthi Pavalanathan and I. Jayawardena and E. Sooriyabandara and V. Nanayakkara|44009df56d7b8d6c3f9d6f528d7c78cc8b53d79a\n2014|Visually scripting portable BPMN script tasks|10.1109/ICODSE.2014.7062710|1|0|Jessada Wiriyakul and T. Senivongse|c220cd58be6364232249824f65f47c876338c8f0\n2015|Semantic investigation of a control-flow subset of BPMN 2.0|10.1109/ICCP.2015.7312707|1|0|E. Todoran and P. Mitrea|c642e95582ecaabb603b63c3bbf0617a55f0c0c7" }, "bpn2": { "title": "Basic Petri Net Programming Notation", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/16b8846f75a43d31c19530d08cf3e4826f91878e" ], "country": [ "Germany and United Kingdom" ], "originCommunity": [ "Universit/it Hildesheim", "Newcastle University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5671", "centralPackageRepositoryCount": 0 }, "bqn": { "title": "BQN", "appeared": 2020, "type": "pl", "creators": [ "Marshall Lochbaum" ], "description": "An APL-like programming language. Self-hosted!", "website": "https://mlochbaum.github.io/BQN/", "documentation": [ "https://mlochbaum.github.io/BQN/doc/index.html" ], "standsFor": "Big Questions Notation", "country": [ "United States" ], "originCommunity": [ "https://github.com/mlochbaum/BQN/issues" ], "influencedBy": [ "apl" ], "example": [ "#! /usr/bin/env bqn\n\n# Case conversion utilities\ncase ← {\n diff ← -´ \"Aa\"\n Lower ⇐ -⟜diff\n Upper ⇐ Lower⁼\n}\n\nhw ← <˘ 2‿∘ ⥊ \"helloworld\"\nhw case.Upper⌾(⊑¨)↩\n•Out hw ↩ ∾ ⥊⍉ [hw, \", \"‿\"!\"] # Hello, World!\n\n# Split at spaces and repeated characters\nSplit ← {\n !1==𝕩 ⋄ (!2=•Type)¨𝕩\n Proc ← {\n · 𝕊 ' ': spl⇐1 ; # Space: break and delete it\n prev Fn cur: ⟨spl,str⟩⇐\n spl←0 ⋄ str←⟨cur⟩ # Include and don't break...\n { prev=cur ? spl+↩1 ; @ } # except at equal characters\n }\n GV‿GS ← {𝕏¨}¨ ⟨ {⟨s⇐str⟩:s;\"\"}\n {𝕩.spl} ⟩\n r ← Proc{»𝔽¨⊢} 𝕩\n (∾¨ GV ⊔˜ ·+`GS) r\n}\n•Show Split hw # ⟨ \"Hel\" \"lo,\" \"World!\" ⟩" ], "githubRepo": { "stars": 587, "forks": 46, "subscribers": 21, "created": 2020, "updated": 2023, "description": "An APL-like programming language. Self-hosted!", "issues": 1, "url": "https://github.com/mlochbaum/BQN" }, "repoStats": { "firstCommit": 2020, "commits": 2684, "committers": 35, "files": 533 } }, "brackets-editor": { "title": "brackets-editor", "appeared": 2012, "type": "editor" }, "brain-flak": { "title": "Brain-Flak", "appeared": 2016, "type": "esolang", "creators": [ "DJMcMayhem" ], "website": "https://github.com/DJMcMayhem/Brain-Flak/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/DJMcMayhem" ], "writtenIn": [ "ruby" ], "githubRepo": { "stars": 84, "forks": 12, "subscribers": 5, "created": 2016, "updated": 2018, "description": "A minimalist esolang", "url": "https://github.com/DJMcMayhem/Brain-Flak/" }, "repoStats": { "firstCommit": 2016, "commits": 268, "committers": 15, "files": 11 } }, "brainfuck": { "title": "Brainfuck", "appeared": 1993, "type": "esolang", "creators": [ "Urban Müller" ], "description": "A nsfw esolang.", "documentation": [ "https://gist.github.com/roachhd/dce54bec8ba55fb17d3a" ], "aka": [ "brainf" ], "country": [ "Switzerland" ], "originCommunity": [ "Sentience Politics" ], "wikipedia": { "example": [ "-,+[ Read first character and start outer character reading loop\n -[ Skip forward if character is 0\n >>++++[>++++++++<-] Set up divisor (32) for division loop\n (MEMORY LAYOUT: dividend copy remainder divisor quotient zero zero)\n <+<-[ Set up dividend (x minus 1) and enter division loop\n >+>+>-[>>>] Increase copy and remainder / reduce divisor / Normal case: skip forward\n <[[>+<-]>>+>] Special case: move remainder back to divisor and increase quotient\n <<<<<- Decrement dividend\n ] End division loop\n ]>>>[-]+ End skip loop; zero former divisor and reuse space for a flag\n >--[-[<->+++[-]]]<[ Zero that flag unless quotient was 2 or 3; zero quotient; check flag\n ++++++++++++<[ If flag then set up divisor (13) for second division loop\n (MEMORY LAYOUT: zero copy dividend divisor remainder quotient zero zero)\n >-[>+>>] Reduce divisor; Normal case: increase remainder\n >[+[<+>-]>+>>] Special case: increase remainder / move it back to divisor / increase quotient\n <<<<<- Decrease dividend\n ] End division loop\n >>[<+>-] Add remainder back to divisor to get a useful 13\n >[ Skip forward if quotient was 0\n -[ Decrement quotient and skip forward if quotient was 1\n -<<[-]>> Zero quotient and divisor if quotient was 2\n ]<<[<<->>-]>> Zero divisor and subtract 13 from copy if quotient was 1\n ]<<[<<+>>-] Zero divisor and add 13 to copy if quotient was 0\n ] End outer skip loop (jump to here if ((character minus 1)/32) was not 2 or 3)\n <[-] Clear remainder from first division if second division was skipped\n <.[-] Output ROT13ed character from copy and clear it\n <-,+ Read next character\n] End character reading loop" ], "related": [ "ascii", "c" ], "summary": "Brainfuck is an esoteric programming language created in 1993 by Urban Müller, and notable for its extreme minimalism. The language consists of only eight simple commands and an instruction pointer. While it is fully Turing-complete, it is not intended for practical use, but to challenge and amuse programmers. Brainfuck simply requires one to break commands into microscopic steps. The language's name is a reference to the slang term brainfuck, which refers to things so complicated or unusual that they exceed the limits of one's understanding.", "pageId": 4086, "dailyPageViews": 1238, "created": 2001, "backlinksCount": 278, "revisionCount": 1468, "appeared": 1993, "fileExtensions": [ "b", "bf" ], "url": "https://en.wikipedia.org/wiki/Brainfuck" }, "githubLanguage": { "fileExtensions": [ "b", "bf" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "brainfuck", "codemirrorMimeType": "text/x-brainfuck", "tmScope": "source.bf", "repos": 1631, "id": "Brainfuck" }, "githubBigQuery": { "repos": 832, "users": 790, "id": "Brainfuck" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/brainfuck", "codeMirror": "brainfuck", "pygmentsHighlighter": { "filename": "esoteric.py", "fileExtensions": [ "bf", "b" ], "id": "Brainfuck" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 2, "commitCount": 4, "sampleCount": 5, "example": [ "// Hello World\n\n++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++." ], "url": "https://github.com/Drako/SublimeBrainfuck" }, "helloWorldCollection": [ "Hello World in Brainfuck\n\n++++++++++[>+++++++>++++++++++>+++<<<-]>++.>+.+++++++\n..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+." ], "leachim6": { "filepath": "b/Brainfuck.bf", "fileExtensions": [ "bf" ], "example": [ "-[------->+<]>-.-[->+++++<]>++.+++++++..+++.[--->+<]>-----.---[->+++<]>.-[--->+<]>---.+++.------.--------." ], "id": "Brainfuck" }, "quineRelay": "Brainfuck", "rijuRepl": { "example": [ "++++++++\n[\n >++++\n [\n >++\n >+++\n >+++\n >+\n <<<<-\n ]\n >+\n >+\n >-\n >>+\n [<]\n\n <-\n]\n\n>>.\n>---.\n+++++++..+++.\n>>.\n<-.\n<.\n+++.------.--------.\n>>+.\n>++.\n" ], "description": "Famous esoteric programming language created in 1993 by Urban Müller", "fileExtensions": [ "b", "bf" ], "gitRepo": "https://github.com/andreabolognani/beef", "id": "https://riju.codes/brainf" }, "replit": "https://repl.it/languages/brainfuck", "tryItOnline": "brainfuck", "ubuntuPackage": "bf", "jupyterKernel": [ "https://github.com/robbielynch/ibrainfuck" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "breccia": { "title": "Breccia", "appeared": 2019, "type": "textMarkup", "creators": [ "Michael Allan" ], "website": "http://reluk.ca/project/Breccia/", "fileExtensions": [ "brec" ], "country": [ "Canada" ], "originCommunity": [ "reluk" ], "example": [ "Definition of terms for project Breccia\n\n : see also http://reluk.ca/project/wayic/refractory/index.brec\n\n @\n - A containment operator.\n : see `^^containment clause$` @ language_definition.brec\n : see `^^CS$` @ language_definition.brec\n alphanumeric\n - (of a character) Having a Unicode property of `Alphabetic` or `Decimal_Number`.\n : re `Alphabetic` see https://www.unicode.org/reports/tr44/tr44-26.html#Alphabetic\n : re `Decimal_Number`\n see https://www.unicode.org/reports/tr44/tr44-26.html#General_Category_Values\n .brec\n - The file extension for Breccia.\n : see `Filename extension` @ README.html" ], "githubRepo": { "firstCommit": 2019, "stars": 0, "forks": 0, "subscribers": 0, "created": 2019, "updated": 2021, "description": "Lightweight markup for point-form outlining and drafting. (mirror)", "issues": 0, "url": "https://github.com/Michael-Allan/Breccia" }, "repoStats": { "firstCommit": 2019, "commits": 329, "committers": 1, "files": 6 } }, "bridgetalk": { "title": "BridgeTalk", "appeared": 1987, "type": "pl", "creators": [ "Jeffrey G. Bonar", "Blaise W. Liffick" ], "description": "A Visual Programming Language for Novices", "reference": [ "http://www.dtic.mil/dtic/tr/fulltext/u2/a218940.pdf" ], "country": [ "United States" ], "originCommunity": [ "Defense Technical Information Center" ], "visualParadigm": true, "hopl": "https://hopl.info/showlanguage.prx?exp=1871", "centralPackageRepositoryCount": 0 }, "brightscript-lang": { "title": "BrightScript", "appeared": 2008, "type": "pl", "description": "BrightScript is a powerful scripting language for building media and networked applications for embedded devices. This language features integrated support for a lightweight library of BrightScript objects, which are used to expose the API of the platform (device) that is running BrightScript. The BrightScript language connects generalized script functionality with underlying components for networking, media playback, UI screens, and interactive interfaces; BrightScript is optimized for generating user-friendly applications with minimal programmer effort. Now part of Roku.", "website": "http://docs.brightsign.biz/display/DOC/BrightScript", "country": [ "Australia" ], "originCommunity": [ "Atlassian" ], "example": [ "REM\nREM The game of Snake\nREM demonstrates BrightScript programming concepts\nREM June 22, 2008\n \nREM\nREM Every BrightScript program must have a single Main()\nREM\n \nSub Main()\n \n game_board=newGameBoard()\n \n While true\n game_board.SetSnake(newSnake(game_board.StartX(), game_board.StartY()))\n game_board.Draw()\n game_board.EventLoop()\n if game_board.GameOver() then ExitWhile\n End While\nEnd Sub" ], "centralPackageRepositoryCount": 0 }, "brisk": { "title": "Brisk", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7a034dbe8ed1dd9a29ce3d9ec449efab5462a849" ], "country": [ "England" ], "originCommunity": [ "University of Bristol" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3656", "centralPackageRepositoryCount": 0 }, "brl": { "title": "BRL", "appeared": 1997, "type": "pl", "website": "http://web.mit.edu/wwwdev/brl/intro.html", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8520", "centralPackageRepositoryCount": 0 }, "bro": { "title": "Bro", "appeared": 1994, "type": "pl", "description": "Bro's domain-specific scripting language enables site-specific monitoring policies.", "website": "https://www.bro.org/", "standsFor": "Big Red One", "renamedTo": [ "zeek" ], "country": [ "United States" ], "originCommunity": [ "Lawrence Berkeley National Lab" ], "domainName": { "registered": 2002, "awisRank": { "2022": 8098956 }, "name": "bro.org" }, "wikipedia": { "backlinksCount": 97, "pageId": 8846268, "created": 2007, "revisionCount": 513, "dailyPageViews": 41, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/Bro" }, "githubLanguage": { "fileExtensions": [ "bro" ], "trendingProjectsCount": 0, "repos": 1383, "id": "Bro" }, "githubBigQuery": { "repos": 149, "users": 122, "id": "Bro" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2016, "committerCount": 4, "commitCount": 32, "url": "https://github.com/bro/bro-sublime" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "broccoli-1": { "title": "Broccoli", "appeared": 2020, "type": "pl", "creators": [ "CoconutMacaroon" ], "website": "https://github.com/CoconutMacaroon/Broccoli", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/CoconutMacaroon/" ], "writtenIn": [ "c" ], "githubRepo": { "stars": 0, "forks": 0, "subscribers": 0, "created": 2020, "updated": 2020, "description": "A simple programming language based on the board game Robot Turtles (Kickstarter edition)", "url": "https://github.com/CoconutMacaroon/Broccoli" }, "repoStats": { "firstCommit": 2020, "commits": 60, "committers": 2, "files": 47 } }, "broccoli-2": { "title": "Broccoli", "appeared": 2022, "type": "esolang", "creators": [ "Mathieu CAROFF" ], "website": "https://mathieucaroff.com/broccoli", "country": [ "France" ], "originCommunity": [ "IMT Atlantique" ], "githubRepo": { "stars": 0, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "description": "Interpreter for the concatenative programming language Broccoli", "url": "https://github.com/mathieucaroff/broccoli/" }, "repoStats": { "firstCommit": 2022, "commits": 34, "committers": 1, "files": 27 } }, "broccoli": { "title": "Broccoli", "appeared": 2008, "type": "pl", "creators": [ "Fogus" ], "website": "https://blog.fogus.me/2008/03/26/broccoli-abominable/", "country": [ "United States" ], "originCommunity": [ "https://github.com/broccoli-lang/" ], "githubRepo": { "stars": 7, "forks": 0, "subscribers": 6, "created": 2018, "updated": 2018, "description": "An interpreter for the broccoli 0.0.x language: http://blog.fogus.me/?s=broccoli", "url": "https://github.com/broccoli-lang/broccoli/" }, "repoStats": { "firstCommit": 2018, "commits": 163, "committers": 8, "files": 31 } }, "brooks-programming-language": { "title": "brooks-programming-language", "appeared": 2003, "type": "pl", "reference": [ "https://pdfs.semanticscholar.org/d5cc/6ed179e1d856575ea1ce08b70728c1082415.pdf" ], "country": [ "Germany" ], "originCommunity": [ "Brandenburg University of Technology" ], "centralPackageRepositoryCount": 0 }, "brouhaha": { "title": "BrouHaHa", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/96e9bf5ca274c5ac6d729e55659e9133c466c835" ], "country": [ "England" ], "originCommunity": [ "University of London,QueenMary College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7759", "centralPackageRepositoryCount": 0, "isbndb": "" }, "brown-university-interactive-language": { "title": "BRUIN", "appeared": 1968, "type": "pl", "standsFor": "Brown University Interactive Language", "country": [ "United States" ], "originCommunity": [ "Brown University" ], "wikipedia": { "related": [ "joss", "doi" ], "summary": "Brown University Interactive Language (BRUIN) was an introductory programming language developed at Brown University in the late 1960s. It operated in the IBM 360, and was similar to PL/1. The abstract of R. G. Munck's document, \"Meeting the Computational Requirements of the University, Brown University Interactive Language\" describes BRUIN as \"a JOSS-like interpreter and a WATFOR-Like compiler and has a syntax very much like PL/I. It is intended that BRUIN and PL/I will together form a language system which will supply most of the (non-computer science) computational requirements of the university.\"", "created": 2005, "backlinksCount": 7, "pageId": 3244022, "revisionCount": 16, "dailyPageViews": 4, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Brown_University_Interactive_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=377", "centralPackageRepositoryCount": 0, "isbndb": "" }, "bscript-interpreter": { "title": "bscript-interpreter", "appeared": 1999, "type": "interpreter", "description": "BScript is a (yet another) BASIC interpreter.", "website": "http://bscript.sourceforge.net/", "domainName": { "name": "bscript.sourceforge.net" }, "centralPackageRepositoryCount": 0 }, "bscript": { "title": "BScript", "appeared": 1999, "type": "pl", "website": "https://www.softart.ch/en/bscriptm/about-bscript/", "hopl": "https://hopl.info/showlanguage.prx?exp=8521", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "bsml": { "title": "BSML", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/118071e30ff606de1e51650251c2e5e723d48a3a" ], "country": [ "United States and China" ], "originCommunity": [ "University of Orléans", "Huawei Technologies" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3604", "centralPackageRepositoryCount": 0 }, "bsp": { "title": "BSP", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f9bebdaa89d9bcc70a6230b55ac30361759ba6ae" ], "country": [ "Canada and England" ], "originCommunity": [ "Queen's University", "University of Oxford" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6225", "centralPackageRepositoryCount": 0 }, "bucardo": { "title": "Bucardo", "appeared": 2009, "type": "application", "creators": [ "Jon Jensen" ], "description": "Bucardo is an asynchronous PostgreSQL replication system, allowing for multi-source, multi-target operations. Bucardo is a replication system for Postgres that supports any number of sources and targets (aka masters and slaves). It is asynchronous and trigger based.", "website": "https://bucardo.org/Bucardo/", "documentation": [ "https://bucardo.org/Bucardo/" ], "reference": [ "https://wiki.postgresql.org/wiki/Bucardo" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/bucardo/bucardo" ], "domainName": { "name": "bucardo.org" }, "related": [ "postgresql", "sql", "plpgsql", "perl" ], "githubRepo": { "stars": 646, "forks": 95, "subscribers": 36, "created": 2009, "updated": 2023, "description": "Bucardo multimaster and master/slave Postgres replication", "issues": 81, "url": "https://github.com/bucardo/bucardo" }, "isOpenSource": true }, "bucklescript": { "title": "Bucklescript", "appeared": 2010, "type": "pl", "creators": [ "Evan Martin" ], "website": "https://bucklescript.github.io", "country": [ "Unknown" ], "originCommunity": [ "ReScript Association" ], "domainName": { "name": "bucklescript.github.io" }, "githubRepo": { "firstCommit": 2010, "stars": 5798, "forks": 406, "subscribers": 131, "created": 2016, "updated": 2022, "description": "The compiler for ReScript.", "issues": 334, "url": "https://github.com/BuckleScript/bucklescript" }, "repoStats": { "firstCommit": 2010, "commits": 14027, "committers": 415, "files": 5633 } }, "buddyscript": { "title": "BuddyScript", "appeared": 2002, "type": "pl", "country": [ "United States" ], "originCommunity": [ "ActiveBuddy" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "related": [ "python" ], "summary": "BuddyScript is a domain-specific language originally developed by ActiveBuddy. The main purpose of the language is to be able to process natural language queries and return results in natural language form. It was the core language for the SmarterChild and Windows Live Agents which were IM/Web based robots. As the Windows Live Agents SDK has been retired by Microsoft, the future of BuddyScript is uncertain. Like Python BuddyScript uses whitespace indentation to delimit blocks (also known as off-side rule).", "dailyPageViews": 3, "pageId": 19855193, "created": 2008, "backlinksCount": 5, "revisionCount": 17, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/BuddyScript" }, "helloWorldCollection": [ "# Hello World in BuddyScript\n\n+ =AnythingPerfect\n\n - Hello, world!\n" ], "leachim6": { "filepath": "b/BuddyScript", "example": [ "=AnythingPerfect\n\n - Hello World\n" ], "id": "BuddyScript" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "bugsys": { "title": "BUGSYS", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5bfe6c7cf02dfdcdc9bdb775c327b2435d1054c8" ], "country": [ "United States" ], "originCommunity": [ "National Biomedical Research Foundation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=246", "centralPackageRepositoryCount": 0 }, "bullfrog": { "title": "BullFrog", "appeared": 2005, "type": "esolang", "hopl": "https://hopl.info/showlanguage.prx?exp=8522", "esolang": "https://esolangs.org/wiki/Bullfrog", "centralPackageRepositoryCount": 0 }, "bun": { "title": "Bun", "appeared": 2021, "type": "vm", "creators": [ "Jarred Sumner" ], "description": "Bundle, transpile, install and run JavaScript & TypeScript projects — all in Bun. Bun is a new JavaScript runtime with a native bundler, transpiler, task runner and npm client built-in.", "website": "https://bun.sh/", "reference": [ "https://news.ycombinator.com/item?id=31993429" ], "country": [ "Various" ], "originCommunity": [ "Zig Programming Language" ], "domainName": { "registered": 2021, "awisRank": { "2022": 95720 }, "name": "bun.sh" }, "writtenIn": [ "zig" ], "related": [ "deno", "v8" ], "githubRepo": { "firstCommit": 2021, "stars": 2346, "forks": 10, "subscribers": 905, "created": 2021, "updated": 2022, "description": "Incredibly fast JavaScript runtime, bundler, transpiler and package manager – all in one.", "issues": 72, "url": "https://github.com/Jarred-Sumner/bun" } }, "bush": { "title": "BUSH", "appeared": 2002, "type": "pl", "website": "http://bush.sourceforge.net/", "country": [ "Canada" ], "originCommunity": [ "PegaSoft" ], "domainName": { "name": "bush.sourceforge.net" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8524", "wordRank": 1122, "centralPackageRepositoryCount": 0 }, "business-application-language": { "title": "Business application language", "appeared": 1974, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Honeywell" ], "wikipedia": { "related": [ "basic", "unix" ], "summary": "Business Application Language (BAL) refers to one of many offshoots of the BASIC language and should not be confused with IBM's well-established Basic assembly language. Business Application Language was originally defined by Honeywell in 1973 and the major diffusion was in their system '80-'90 in Europe with the work of French firm Prologue S.A. that used BAL for programming on their proprietary Operative System (Prologue). In 1986 the language was ported to the Unix platform by GuyPes. The first development environment, named Balix, are distributed starting in 1988 in Italy and France. A different evolution path was made by Prologue S.A., named ABAL, in 1992. The evolution of Balix, developed in Italy, is called B2U (an acronym for Business under UNIX) developed by GuyPes, and are used for a Banking Information System that are used by one hundred banks in Italy.", "created": 2006, "backlinksCount": 7, "pageId": 7937393, "revisionCount": 32, "dailyPageViews": 3, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/Business_application_language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4895", "centralPackageRepositoryCount": 0 }, "business-basic": { "title": "Business Basic", "appeared": 1970, "type": "pl", "country": [ "United States" ], "originCommunity": [ "MAI Systems" ], "wikipedia": { "related": [ "basic", "mai-basic-four", "data-general-business-basic", "unix", "linux", "alphabasic", "b32-business-basic", "rexon", "dartmouth-basic", "true-basic", "providex" ], "summary": "Business Basic is a category of variants of the BASIC computer programming language which were specialised for business use on minicomputers in the 1970s and 1980s. Business Basics added indexed file access methods to the normal set of BASIC commands, and were optimised for other input/output access, especially display terminal control. The two major families of Business Basic are MAI Basic Four and Data General Business Basic. In addition the Point 4 company, which developed the IRIS operating system, had their own version of BASIC. The UniBASIC owned by Dynamic Concepts of Irvine is a derivative of the Point 4 BASIC. In the 1980s, Business Basics were ported from their original proprietary environments to many Unix platforms, CP/M, and to DOS. In the 1990s, some Business Basics were ported to Linux and Windows, and Business Basic integrated development environments became available. Business Basic continues to be widely used due to the very large base of application software.", "pageId": 912124, "created": 2004, "backlinksCount": 17, "revisionCount": 74, "dailyPageViews": 19, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Business_Basic" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAdvanced Business Basic for Microcomputers|1985|Chao Chien|4508658|0.0|0|0\nBasic Business Basic: Using Microcomputers|1983|Peter Mears|3812402|0.0|0|0\nApple Basic for Business Basic Programming and Visicalc|1984|Alan J. Parker|3431487|0.0|0|0" }, "business-object-notation": { "title": "Business Object Notation", "appeared": 1989, "type": "notation", "description": "The BON method for analysis and design of object-oriented software was developed 1989-93 by Jean-Marc Nerson and Kim Waldén as a means of extending the higher-level concepts of the Eiffel programming language into the realm of analysis and design aided by a graphical notation. The core idea is simplicity and well-defined semantics, since from our industrial experience we know that anything complex and/or ambiguous becomes useless in practice, and tends to be a hindrance rather than an aid to successful completion of software projects. In this respect, BON could be viewed as the direct opposite of the widely publicized UML/RUP approach.", "website": "http://www.bon-method.com/index_normal.htm", "country": [ "United States" ], "originCommunity": [ "Eiffel Software" ], "wikipedia": { "related": [ "eiffel", "uml" ], "summary": "In software engineering, Business Object Notation (BON) is a method and graphical notation for high-level object-oriented analysis and design. The method was developed 1989–93 by Jean-Marc Nerson and Kim Waldén as a means of extending the higher-level concepts of the Eiffel programming language. It claims to be much simpler than its competition - the UML - but it didn't enjoy its commercial success.", "created": 2005, "backlinksCount": 8, "pageId": 1790493, "revisionCount": 12, "dailyPageViews": 4, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Business_Object_Notation" }, "centralPackageRepositoryCount": 0 }, "business-process-modeling-language": { "title": "BPML", "appeared": 2002, "type": "pl", "originCommunity": [ "Business Modeling", "Integration Domain Task Force" ], "wikipedia": { "related": [ "xml", "uml", "bpel", "bpmn" ], "summary": "Business Process Modeling Language (BPML) is an XML-based language for business process modeling. It was maintained by the Business Process Management Initiative (BPMI) until June 2005 when BPMI and OMG (Object Management Group) announced the merger of their respective Business Process Management (BPM) activities to form the Business Modeling and Integration Domain Task Force (BMI DTF)[1]. It is deprecated since 2008. BPML was useful to OMG in order to enrich UML with process notation.", "created": 2006, "backlinksCount": 13, "pageId": 5938839, "revisionCount": 58, "dailyPageViews": 44, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Business_Process_Modeling_Language" }, "centralPackageRepositoryCount": 0 }, "business-rule-language": { "title": "business-rule-language", "appeared": 2012, "type": "pl", "description": "Business Rule Language (BRL) allows IF/THEN testing on certain information available when the rules execute. Your own cancel message can be included within the rules you create by using special message variables. BRL is a non-procedural, high-level application development language that allows you to develop sophisticated programs with less effort than conventional programming languages. BRL rules consist of three parts: the rule name, which serves as a comment or description, and is not syntactically necessary to the rule; a supporting condition (antecedent) or procedure statement; and a conclusion.", "website": "https://webfocusinfocenter.informationbuilders.com/wfappent/TLs/TL_ra/TL_rg/source/ACrg20.htm", "reference": [ "https://infocenter.informationbuilders.com/wf80/index.jsp?topic=%2Fpubdocs%2FResGovernor%2Fsource%2Ftopic47.htm" ], "aka": [ "BRL" ], "centralPackageRepositoryCount": 0 }, "butterfly-common-lisp": { "title": "Butterfly Common LISP", "appeared": 1993, "type": "pl", "reference": [ "https://www.cs.cmu.edu/Groups/AI/lang/lisp/impl/bbn/0.html" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1875", "centralPackageRepositoryCount": 0 }, "buzz": { "title": "buzz", "appeared": 2021, "type": "pl", "screenshot": "https://raw.githubusercontent.com/buzz-language/buzz/main/example.png", "photo": "https://raw.githubusercontent.com/ziglang/logo/master/zig-logo-dark.svg", "creators": [ "Benoit Giannangeli" ], "description": "A small/lightweight typed scripting language (in development)", "documentation": [ "https://github.com/buzz-language/buzz/blob/main/README.md" ], "fileExtensions": [ "buzz" ], "country": [ "France" ], "originCommunity": [ "https://github.com/buzz-language/" ], "releaseNotesUrl": "https://github.com/buzz-language/buzz/releases", "versions": { "2022": [ "0.1.0-rc.1" ] }, "writtenIn": [ "zig" ], "influencedBy": [ "lua" ], "githubRepo": { "firstCommit": 2021, "stars": 407, "forks": 5, "subscribers": 9, "created": 2021, "updated": 2022, "description": "👨‍🚀 buzz, A small/lightweight typed scripting language (in development)", "issues": 45, "url": "https://github.com/buzz-language/buzz" }, "repoStats": { "firstCommit": 2021, "commits": 676, "committers": 8, "files": 162 }, "isOpenSource": true }, "bx": { "title": "bx", "appeared": 1990, "type": "pl", "website": "http://www.skrenta.com/bx/", "country": [ "United States" ], "originCommunity": [ "Commodore-Amiga" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8525", "centralPackageRepositoryCount": 0 }, "bytecode-modeling-language": { "title": "bytecode-modeling-language", "appeared": 2008, "type": "bytecode", "website": "http://www-sop.inria.fr/everest/BML/", "country": [ "France and Poland" ], "originCommunity": [ "INRIA", "University of Warsaw" ] }, "bytelisp": { "title": "ByteLisp", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/970195421bf978329d6738c4372ab7ad0063c404" ], "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3792", "centralPackageRepositoryCount": 0 }, "bython": { "title": "Bython", "appeared": 2016, "type": "pl", "description": "Python with braces. Because python is awesome, but whitespace is awful.", "country": [ "Norway" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "example": [ "def print_message(num_of_times) {\n for i in range(num_of_times) {\n print(\"Bython is awesome!\");\n }\n}\n\nif __name__ == \"__main__\" {\n print_message(10);\n}" ], "githubRepo": { "firstCommit": 2016, "stars": 393, "forks": 21, "subscribers": 14, "created": 2016, "updated": 2022, "description": "Python with braces. Because python is awesome, but whitespace is awful.", "issues": 17, "url": "https://github.com/mathialo/bython" }, "repoStats": { "firstCommit": 2016, "commits": 170, "committers": 4, "files": 33 }, "rijuRepl": { "example": [ "print(\"Hello, world!\")" ], "id": "https://riju.codes/bython" } }, "bywater-basic": { "title": "Bywater BASIC", "appeared": 1992, "type": "pl", "reference": [ "http://web.cs.mun.ca/~ed/cs2602/basic1.html" ], "country": [ "Canada" ], "originCommunity": [ "Memorial University of Newfoundland" ], "wikipedia": { "related": [ "basic", "metacomco", "abc-80", "alphabasic", "altair-basic", "amigabasic", "blitzbasic", "stos-basic", "apple-basic", "applesoft-basic", "commodore-basic", "asic-programming-language", "basic-programming", "atari-basic", "atari-microsoft-basic", "atmel-avr", "acorn-atom", "autoit", "b32-business-basic", "unix", "linux", "seed7", "gw-basic", "mbasic", "basic-ap", "optimized-systems-software", "ibm-basica", "basic4gl", "basic-11", "basic-256", "basic-e", "hp-basic-for-openvms", "basic-plus", "rocky-mountain-basic", "basic09", "basicode", "visual-basic", "batari-basic", "bbc-basic", "c", "business-basic", "bcx", "beta-basic", "sinclair-basic", "blitz3d", "blitzplus", "opengl", "reverse-polish-notation", "tiny-basic", "bywater-basic", "ca-realizer", "casio-basic", "cbasic", "chinese-basic", "chipmunk-basic", "color-basic", "trs-80-color-computer", "microsoft-basic", "creative-basic", "darkbasic", "dartmouth-basic", "data-general-business-basic", "freebasic", "quickbasic", "futurebasic", "galaksija-basic", "gambas", "gfa-basic", "glbasic", "graphics-basic", "pic-microcontroller", "high-tech-basic", "hp-time-shared-basic", "winwrap-basic", "music-sp", "integer-basic", "liberty-basic", "locomotive-basic", "lotusscript", "ios", "macbasic", "mai-basic-four", "mallard-basic", "mapbasic", "microsoft-macro-assembler", "microsoft-small-basic", "monkey", "morfik", "msx-basic", "processor-technology", "northstar-basic", "x86-isa", "ns-basic", "opl", "owbasic", "parrot-basic", "parrot-vm", "pbasic", "basic-stamp", "phoenix-object-basic", "pick-operating-system", "powerbasic", "providex", "purebasic", "qb64", "qbasic", "rapidq", "solaris", "sparc", "android", "xojo", "run-basic", "sam-coupe", "sbasic", "scriptbasic", "sdlbasic", "wxbasic", "simons-basic", "smallbasic", "southampton-basic-system", "ibm-rational-sqabasic", "staroffice-basic", "superbasic", "arduino", "theos-multi-user-basic", "thinbasic", "ti-basic", "tiger-basic", "true-basic", "turbo-basic", "turbo-basic-xl", "tymshare-superbasic", "ubasic", "universe", "vbscript", "asp", "batch", "vilnius-basic", "haskell", "visual-basic.net", "vba", "visual-test", "watcom", "xblite", "yabasic", "zbasic", "algol", "comal", "euphoria" ], "summary": "This is an alphabetical list of BASIC dialects—interpreted and compiled variants of the BASIC programming language. Each dialect's platform(s), i.e., the computer models and operating systems, are given in parentheses along with any other significant information.", "created": 2003, "backlinksCount": 122, "pageId": 1774611, "revisionCount": 39, "dailyPageViews": 2, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/Bywater_BASIC" }, "centralPackageRepositoryCount": 0 }, "c--": { "title": "C--", "appeared": 1997, "type": "pl", "creators": [ "Simon Peyton Jones" ], "website": "http://www.cs.tufts.edu/~nr/c--/index.html", "country": [ "United States" ], "originCommunity": [ "Tufts University" ], "wikipedia": { "related": [ "c", "ascii", "assembly-language", "modula-3", "bcpl", "llvmir" ], "summary": "C-- (pronounced cee minus minus) is a C-like programming language. Its creators, functional programming researchers Simon Peyton Jones and Norman Ramsey, designed it to be generated mainly by compilers for very high-level languages rather than written by human programmers. Unlike many other intermediate languages, its representation is plain ASCII text, not bytecode or another binary format.", "pageId": 1422467, "dailyPageViews": 568, "created": 2005, "backlinksCount": 45, "revisionCount": 148, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/C--" }, "leachim6": { "filepath": "c/C--", "example": [ "target byteorder little;\nimport puts;\nexport main;\n\nsection \"data\"{\n s:bits8[] \"Hello World\\0\";\n}\n\nforeign \"C\" main(){\n foreign \"C\" puts(\"address\"s);\n foreign \"C\" return(0);\n}\n" ], "id": "C--" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3733", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "c-al": { "title": "C/AL", "appeared": 1987, "type": "pl", "creators": [ "Michael Nielsen" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "TRUE", "FALSE" ] ], "wikipedia": { "example": [ "Item.RESET;\n Item.SETRANGE(\"Blocked\",TRUE);\n IF Item.FINDSET THEN\n REPEAT\n IF Item.\"Profit %\" < 20 THEN BEGIN\n Item.\"Profit %\" := 20;\n Item.MODIFY(TRUE);\n END;\n UNTIL Item.NEXT = 0;\n Item.MODIFYALL(\"Blocked\",FALSE);" ], "related": [ "pascal" ], "summary": "C/AL (Client/server Application Language) is the programming language used within C/SIDE the Client/Server Integrated Development Environment in Microsoft Dynamics NAV (Formerly known as Navision Attain). C/AL is a Database specific programming language, and is primarily used for retrieving, inserting and modifying records in a Navision database. C/AL resembles the Pascal language on which it is based. The original C/AL compiler was written by Michael Nielsen.", "created": 2007, "backlinksCount": 14, "pageId": 13281075, "revisionCount": 81, "dailyPageViews": 72, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/C/AL" }, "centralPackageRepositoryCount": 0 }, "c-cubed": { "title": "C^3", "appeared": 2009, "type": "pl", "website": "http://c3wife.com/", "aka": [ "c3" ], "domainName": { "registered": 2009, "name": "c3wife.com" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "c-flat": { "title": "C flat", "appeared": 1991, "type": "pl", "creators": [ "Bill McKeeman" ], "description": "C♭: a low-level subset of C. Journal of C Language Translation, 3(3):214–226, December 1991.", "aka": [ "C♭" ], "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3909" }, "c-for-all": { "title": "C∀", "appeared": 2018, "type": "pl", "description": "C∀ (C-for-all) is an open-source project extending ISO C with modern safety and productivity features, while still ensuring backwards compatibility with C and its programmers. C∀ is designed to have an orthogonal feature-set based closely on the C programming paradigm (non-object-oriented) and these features can be added incrementally to an existing C code-base allowing programmers to learn C∀ on an as-needed basis. In many ways, C∀ is to C as Scala is to Java, providing a research vehicle for new typing and control-flow capabilities on top of a highly popular programming language allowing immediate dissemination.", "website": "https://cforall.uwaterloo.ca/", "reference": [ "https://onlinelibrary.wiley.com/doi/10.1002/spe.2624" ], "standsFor": "C-for-all", "country": [ "Canada and China" ], "originCommunity": [ "University of Waterloo", "Huawei" ], "domainName": { "name": "cforall.uwaterloo.ca" }, "isbndb": "", "semanticScholar": "" }, "c-headers": { "title": "C Header Files", "appeared": 1972, "type": "headerLang", "description": "A header file is a file containing C declarations and macro definitions (see Macros) to be shared between several source files. You request the use of a header file in your program by including it, with the C preprocessing directive ‘#include’.", "reference": [ "https://gcc.gnu.org/onlinedocs/cpp/Header-Files.html" ], "fileExtensions": [ "h" ], "subsetOf": [ "c" ], "related": [ "c" ] }, "c-shell": { "title": "C shell", "appeared": 1978, "type": "pl", "website": "http://mx.gw.com", "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "domainName": { "name": "mx.gw.com" }, "hasHereDocs": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "echo" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "# Always creates an empty file\nif ( ! -e myfile ) echo mytext > myfile" ], "related": [ "c", "linux", "bourne-shell", "algol-68", "unicode", "grep", "bash" ], "summary": "The C shell (csh or the improved version, tcsh) is a Unix shell created by Bill Joy while he was a graduate student at University of California, Berkeley in the late 1970s. It has been widely distributed, beginning with the 2BSD release of the Berkeley Software Distribution (BSD) that Joy began distributing in 1978. Other early contributors to the ideas or the code were Michael Ubell, Eric Allman, Mike O'Brien and Jim Kulp. The C shell is a command processor typically run in a text window, allowing the user to type commands. The C shell can also read commands from a file, called a script. Like all Unix shells, it supports filename wildcarding, piping, here documents, command substitution, variables and control structures for condition-testing and iteration. What differentiated the C shell from others, especially in the 1980s, were its interactive features and overall style. Its new features made it easier and faster to use. The overall style of the language looked more like C and was seen as more readable. On many systems, such as Mac OS X and Red Hat Linux, csh is actually tcsh, an improved version of csh. Often one of the two files is either a hard link or a symbolic link to the other, so that either name refers to the same improved version of the C shell. On Debian and some derivatives (including Ubuntu), there are two different packages: csh and tcsh. The former is based on the original BSD version of csh and the latter is the improved tcsh. tcsh added filename and command completion and command line editing concepts borrowed from the Tenex system, which is the source of the \"t\". Because it only added functionality and did not change what was there, tcsh remained backward compatible with the original C shell. Though it started as a side branch from the original source tree Joy had created, tcsh is now the main branch for ongoing development. tcsh is very stable but new releases continue to appear roughly once a year, consisting mostly of minor bug fixes.", "pageId": 95833, "dailyPageViews": 19, "created": 2002, "backlinksCount": 173, "revisionCount": 3, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/C_Shell" }, "leachim6": { "filepath": "c/C Shell.csh", "example": [ "#!/bin/csh\necho \"Hello World\"\n" ], "id": "C Shell" }, "tiobe": { "id": "C shell" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "c-smile": { "title": "c-smile", "appeared": 2002, "type": "pl", "creators": [ "Andrew Fedoniouk" ], "description": "C-SMILE is a scripting language, which inherits it's syntax and structure from C, C++, Java(tm) and JavaScript. On hypothetical \"axis of programming languages\" it resides somewhere between Java(tm) and JavaScript. In the same way as in JavaScript, all variables are typeless and as in Java it is mandatory to declare variables before usage. C-SMILE has a compiler, a virtual machine running bytecodes, and a C/C++ extensible runtime. C-SMILE is intended to run in standalone or embedded mode.", "website": "http://c-smile.sourceforge.net/", "country": [ "Unknown" ], "originCommunity": [ "terra informatica", "deeptown" ], "domainName": { "name": "c-smile.sourceforge.net" } }, "c-talk": { "title": "c-talk", "appeared": 1999, "type": "pl", "creators": [ "Konstantin Knizhnik" ], "description": "C-Talk is interpreted scripting language with C-like syntax and dynamic type checking. Variables in C-Talk have no type. So there is no compile time type checking in C-Talk, all checking is performed at runtime. To preserve reference integrity, explicit memory deallocation is prohibited in C-Talk, unused objects are automatically deallocated by garbage collector.", "website": "http://www.garret.ru/ctalk.html", "country": [ "Russia" ], "originCommunity": [ "Moscow State Industrial University" ], "example": [ "CtkObject myPrimitive(int nArgs, CtkObject* args) {\n char* s;\n ctk_integer i;\n ctk_real r;\n CtkObject o;\n ctkParseArguments(nArgs, args, \"siro\", &s, &i, &r, &o);\n ...\n}" ] }, "c": { "title": "C", "appeared": 1972, "type": "pl", "creators": [ "Dennis Ritchie" ], "documentation": [ "https://devdocs.io/c/" ], "spec": "https://www.iso-9899.info/wiki/The_Standard", "reference": [ "http://www.c4learn.com/c-programming/c-keywords/" ], "cheatSheetUrl": [ "https://courses.cs.washington.edu/courses/cse351/14sp/sections/1/Cheatsheet-c.pdf" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasEnums": { "example": "enum Gender {\n Male,\n Female,\n};", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": false }, "hasCharacters": { "example": "char character = 'P';", "value": true }, "hasTernaryOperators": { "example": "#include \nint main(void) { printf(\"%d\", 1 ? 1 : 0); }", "value": true }, "hasPointers": { "example": "int *ptr;", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasAssertStatements": { "example": "#include \nint i, a[10];\nfor (i = 0; i < 10; ++i)\n {\n assert(0 <= i && i < 10);\n a[i] = 10-i;\n }\nfor (i = 0; i < 10; ++i)\n {\n assert(0 <= i && i < 10);\n assert(0 <= a[i] && a[i] < 10);\n a[a[i]] = a[i];\n }", "value": true }, "hasBitWiseOperators": { "example": "int i = 4; /* bit pattern equivalent is binary 100 */\nint j = i << 2; /* makes it binary 10000, which multiplies the original number by 4 i.e. 16 */", "value": true }, "hasSymbolTables": { "example": "// Declare an external function\nextern double bar(double x);\n\n// Define a public function\ndouble foo(int count)\n{\n double sum = 0.0;\n\n // Sum all the values bar(1) to bar(count)\n for (int i = 1; i <= count; i++)\n sum += bar((double) i);\n return sum;\n}\n// Symbol Table:\n// Symbol name|Type|Scope\n// bar|function, double|extern\n// x|double|function parameter\n// foo|function, double|global\n// count|int|function parameter\n// sum|double|block local\n// i|int|for-loop statement", "value": true }, "hasComments": { "example": "/* hello world */\n// hi", "value": true }, "hasStructs": { "example": "struct account {\n int account_number;\n char *first_name;\n char *last_name;\n float balance;\n};", "value": true }, "hasGarbageCollection": { "example": "", "value": false }, "hasGotos": { "example": "// C/C++ program to check if a number is \n// even or not using goto statement \n#include \nusing namespace std; \n \n// function to check even or not \nvoid checkEvenOrNot(int num) \n{ \n if (num % 2 == 0) \n goto even; // jump to even \n else\n goto odd; // jump to odd \n \neven: \n cout << num << \" is evenn\"; \n return; // return if even \nodd: \n cout << num << \" is oddn\"; \n} \n \n// Driver program to test above function \nint main() \n{ \n int num = 26; \n checkEvenOrNot(num); \n return 0; \n}", "value": true }, "hasDirectives": { "example": "#include \n#define height 10\n#ifdef\n#endif\n#if\n#else\n#ifndef\n#undef\n#pragma", "value": true }, "hasExplicitTypeCasting": { "example": "double da = 3.3;\ndouble db = 3.3;\ndouble dc = 3.4;\nint result = (int)da + (int)db + (int)dc; //result == 9", "value": true }, "hasImports": { "example": "// If a header file is included within <>, the preprocessor will search a predetermined directory path to locate the header file. If the header file is enclosed in \"\", the preprocessor will look for the header file in the same directory as the source file.\n#include \n#include \"stdio.h\"", "value": true }, "hasNamespaces": { "example": "", "value": false }, "hasMultipleInheritance": { "example": "", "value": false }, "hasTemplates": { "example": "", "value": false }, "hasIntegers": { "example": "int pldb = 80766866;", "value": true }, "hasMacros": { "example": "// https://learn.microsoft.com/en-us/cpp/preprocessor/macros-c-cpp?redirectedfrom=MSDN&view=msvc-170\n// https://gcc.gnu.org/onlinedocs/cpp/Macro-Arguments.html\n#define min(X, Y) ((X) < (Y) ? (X) : (Y))\n x = min(a, b); → x = ((a) < (b) ? (a) : (b));\n y = min(1, 2); → y = ((1) < (2) ? (1) : (2));\n z = min(a + 28, *p); → z = ((a + 28) < (*p) ? (a + 28) : (*p));", "value": true }, "hasManualMemoryManagement": { "example": "#include \n#include \nint main(void)\n{\n int *poin = malloc(4);\n free(poin);\n}", "value": true }, "hasOperatorOverloading": { "example": "", "value": false }, "hasOperators": { "example": "1 + 1;", "value": true }, "hasVariadicFunctions": { "example": "double average(int count, ...)\n{\n //\n}", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": true }, "hasIncrementAndDecrementOperators": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSwitch": { "example": "switch(expression) {\n case true :\n break;\n default :\n //\n break;\n}", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAccessModifiers": { "example": "", "value": false }, "hasClasses": { "example": "", "value": false }, "hasExceptions": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasFixedPoint": { "example": "", "value": false }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "printf" ] ], "assignmentToken": [ [ "=" ] ], "keywords": [ "auto", "break", "case", "char", "const", "continue", "default", "do", "double", "else", "enum", "extern", "float", "for", "goto", "if", "int", "long", "register", "return", "short", "signed", "sizeof", "static", "struct", "switch", "typedef", "union", "unsigned", "void", "volatile", "while" ], "funFact": " C gets credit for the // comments, starting in 1972, but that's not really accurate. BCPL -- which begat B which begat C -- had // comments but they were not included in C until C99. C++ (which isn't included in their top 30 languages) brought back // comments from BCPL sometime between 1979 and 1985 (the first public release of cfront). Many C compilers included // comments as an extension prior to C99 but those were inspired by C++", "wikipedia": { "example": [ "#include \n\nint main(void)\n{\n printf(\"hello, world\\n\");\n}" ], "related": [ "cyclone", "unified-parallel-c", "split-c", "cilk", "b", "bcpl", "cpl", "algol-68", "assembly-language", "pl-i", "ampl", "awk", "c--", "csharp", "objective-c", "d", "go", "java", "javascript", "julia", "limbo", "lpc", "perl", "php", "pike", "processing", "python", "rust", "seed7", "vala", "verilog", "unix", "algol", "swift", "multics", "unicode", "fortran", "pascal", "mathematica", "matlab", "ch", "smalltalk" ], "summary": "C (, as in the letter c) is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations. By design, C provides constructs that map efficiently to typical machine instructions, and therefore it has found lasting use in applications that had formerly been coded in assembly language, including operating systems, as well as various application software for computers ranging from supercomputers to embedded systems. C was originally developed by Dennis Ritchie between 1969 and 1973 at Bell Labs, and used to re-implement the Unix operating system. It has since become one of the most widely used programming languages of all time, with C compilers from various vendors available for the majority of existing computer architectures and operating systems. C has been standardized by the American National Standards Institute (ANSI) since 1989 (see ANSI C) and subsequently by the International Organization for Standardization (ISO). C is an imperative procedural language. It was designed to be compiled using a relatively straightforward compiler, to provide low-level access to memory, to provide language constructs that map efficiently to machine instructions, and to require minimal run-time support. Despite its low-level capabilities, the language was designed to encourage cross-platform programming. A standards-compliant and portably written C program can be compiled for a very wide variety of computer platforms and operating systems with few changes to its source code. The language has become available on a very wide range of platforms, from embedded microcontrollers to supercomputers.", "pageId": 6021, "dailyPageViews": 6268, "created": 2001, "backlinksCount": 10585, "revisionCount": 7316, "appeared": 2011, "fileExtensions": [ "Mono" ], "url": "https://en.wikipedia.org/wiki/C_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "c", "cats", "h", "idc" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\npwn20wndstuff Undecimus https://github.com/pwn20wndstuff.png https://github.com/pwn20wndstuff/Undecimus C #555555 4836 991 1356 \"unc0ver jailbreak for iOS 11.0 - 12.4\"\nLiteOS LiteOS https://github.com/LiteOS.png https://github.com/LiteOS/LiteOS C #555555 3361 1146 1832 \"code and manual\"\ngit git https://github.com/git.png https://github.com/git/git C #555555 29183 16856 680 \"Git Source Code Mirror - This is a publish-only repository and all pull requests are ignored. Please follow Documentation/SubmittingPatches procedure for any of your improvements.\"\nnginx nginx https://github.com/nginx.png https://github.com/nginx/nginx C #555555 9590 3619 293 \"An official read-only mirror of http://hg.nginx.org/nginx/ which is updated hourly. Pull requests on GitHub cannot be accepted and will be automatically closed. The proper way to submit changes to nginx is via the nginx development mailing list, see http://nginx.org/en/docs/contributing_changes.html\"\nlittlevgl lvgl https://github.com/littlevgl.png https://github.com/littlevgl/lvgl C #555555 2274 522 128 \"Powerful and easy-to-use embedded GUI with many widgets, advanced visual effects (opacity, antialiasing, animations) and low memory requirements (16K RAM, 64K Flash).\"\nGenymobile scrcpy https://github.com/Genymobile.png https://github.com/Genymobile/scrcpy C #555555 18275 1510 2342 \"Display and control your Android device\"\nNVIDIA open-gpu-doc https://github.com/NVIDIA.png https://github.com/NVIDIA/open-gpu-doc C #555555 734 39 721 \"Documentation of NVIDIA chip/hardware interfaces\"\nbetaflight betaflight https://github.com/betaflight.png https://github.com/betaflight/betaflight C #555555 3001 1405 124 \"Open Source Flight Controller Firmware\"\nnothings stb https://github.com/nothings.png https://github.com/nothings/stb C #555555 10557 2767 341 \"stb single-file public domain libraries for C/C++\"\nopenbsd src https://github.com/openbsd.png https://github.com/openbsd/src C #555555 1202 314 52 \"Public git conversion mirror of OpenBSD's official CVS src repository. Pull requests not accepted - send diffs to the tech@ mailing list.\"\nARMmbed littlefs https://github.com/ARMmbed.png https://github.com/ARMmbed/littlefs C #555555 1480 220 333 \"A little fail-safe filesystem designed for microcontrollers\"\nnmap nmap https://github.com/nmap.png https://github.com/nmap/nmap C #555555 3319 1126 114 \"Nmap - the Network Mapper. Github mirror of official SVN repository.\"\nRT-Thread rt-thread https://github.com/RT-Thread.png https://github.com/RT-Thread/rt-thread C #555555 3199 2128 227 \"RT-Thread is an open source IoT operating system from China.\"\nDoubleLabyrinth navicat-keygen https://github.com/DoubleLabyrinth.png https://github.com/DoubleLabyrinth/navicat-keygen C++ #f34b7d 7512 1890 565 \"A keygen for Navicat\"\ntorvalds linux https://github.com/torvalds.png https://github.com/torvalds/linux C #555555 79929 27885 1452 \"Linux kernel source tree\"\nzephyrproject-rtos zephyr https://github.com/zephyrproject-rtos.png https://github.com/zephyrproject-rtos/zephyr C #555555 2423 1468 115 \"Primary Git Repository for the Zephyr Project. Zephyr is a new generation, scalable, optimized, secure RTOS for multiple hardware architectures.\"\nKevinOConnor klipper https://github.com/KevinOConnor.png https://github.com/KevinOConnor/klipper C #555555 1531 724 62 \"Klipper is a 3d-printer firmware\"\nJVictorDias Dinossauro-Google https://github.com/JVictorDias.png https://github.com/JVictorDias/Dinossauro-Google C #555555 297 85 191 \"Código do projeto onde uma rede neural aprende a jogar o dinossauro do google\"\ncommaai openpilot https://github.com/commaai.png https://github.com/commaai/openpilot C #555555 12310 2924 408 \"open source driving agent\"\nqmk qmk_firmware https://github.com/qmk.png https://github.com/qmk/qmk_firmware C #555555 4961 9458 204 \"Open-source keyboard firmware for Atmel AVR and Arm USB families\"\ncfenollosa os-tutorial https://github.com/cfenollosa.png https://github.com/cfenollosa/os-tutorial C #555555 16163 1776 271 \"How to create an OS from scratch\"\nmit-pdos xv6-public https://github.com/mit-pdos.png https://github.com/mit-pdos/xv6-public C #555555 2956 1586 92 \"xv6 OS\"\nphp php-src https://github.com/php.png https://github.com/php/php-src C #555555 24746 5666 486 \"The PHP Interpreter\"\nmicropython micropython https://github.com/micropython.png https://github.com/micropython/micropython C #555555 9015 2745 190 \"MicroPython - a lean and efficient Python implementation for microcontrollers and constrained systems\"\nesp8266 Arduino https://github.com/esp8266.png https://github.com/esp8266/Arduino C #555555 9944 7850 166 \"ESP8266 core for Arduino\"", "trendingProjectsCount": 26, "type": "programming", "interpreters": [ "tcc" ], "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-csrc", "tmScope": "source.c", "repos": 2160271, "id": "C" }, "githubBigQuery": { "repos": 292876, "users": 177962, "id": "C" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/c", "monaco": "cpp", "pygmentsHighlighter": { "filename": "c_cpp.py", "fileExtensions": [ "c", "h", "idc", "x[bp]m" ], "id": "C" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 23, "commitCount": 359, "sampleCount": 57, "example": [ "#ifndef HELLO_H\n#define HELLO_H\n\nvoid hello();\n\n#endif\n" ], "url": "https://github.com/textmate/c.tmbundle" }, "projectEuler": { "memberCount": { "2019": 41087, "2022": 46028 }, "id": "C/C++" }, "leachim6": { "filepath": "c/C.c", "example": [ "#include \n\nmain()\n{\n printf(\"Hello World\\n\");\n}\n" ], "id": "C" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:C", "quineRelay": "C", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nint square(int num) {\n return num * num;\n}" ], "id": "C" }, "rijuRepl": { "example": [ "#include \n\nint main() {\n printf(\"Hello, world!\\n\");\n return 0;\n}\n" ], "description": "General-purpose, procedural computer programming language supporting structured programming, lexical variable scope, and recursion, with a static type system", "fileExtensions": [ "c", "h" ], "gitRepo": "https://github.com/llvm/llvm-project", "id": "https://riju.codes/c" }, "replit": "https://repl.it/languages/c", "indeedJobs": { "2017": 23567, "query": "c engineer" }, "linkedInSkill": { "2018": 3635195, "id": "c" }, "stackOverflowSurvey": { "2021": { "users": 17329, "medianSalary": 53184, "fans": 9702, "percentageUsing": 0.21 } }, "subreddit": [ { "memberCount": { "2017": 30709, "2022": 127013 }, "url": "https://reddit.com/r/C_Programming" } ], "meetup": { "memberCount": 69338, "groupCount": 204, "url": "https://www.meetup.com/topics/c" }, "tiobe": { "currentRank": 2, "id": "C" }, "hopl": "https://hopl.info/showlanguage.prx?exp=577", "pypl": "C", "ubuntuPackage": "gcc", "gdbSupport": true, "jupyterKernel": [ "https://github.com/brendan-rius/jupyter-c-kernel" ], "fileType": "text", "wordRank": 81, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2003|McGraw-Hill Education|Introduction to Computing Systems: From Bits and Gates to C and Beyond|Yale N. Patt and Sanjay J. Patel|9780072467505\n1978|Prentice-Hall|The C Programming Language|Brian W. Kernighan and Dennis M. Ritchie|9780131101630\n1995|Pearson|Data Structures Using C and C++ (2nd Edition)|Langsam, Yedidyah and Augenstein, Moshe J. and Tenenbaum, Aaron M.|9780130369970\n2012|Pearson|Problem Solving and Program Design in C (7th Edition)|Hanly, Jeri R. and Koffman, Elliot B.|9780132936491\n1996|Pearson|Data Structures and Algorithm Analysis in C (2nd Edition)|Weiss, Mark A.|9780201498400\n2014|Cengage Learning PTR|C Programming for the Absolute Beginner|Davenport, Keith and Vine, Michael|9781305273764\n1992|Pearson|Standard C Library, The|Plauger, P.J.|9780131315099\n1999|Pearson|SPARC Architecture, Assembly Language Programming, and C|Paul, Richard|9780130255969\n2009|Pearson|System Programming with C and Unix|Hoover, Adam|9780136067122\n1994|Pearson|Expert C Programming: Deep C Secrets|van der Linden, Peter|9780131774292\n1997|Addison-Wesley Professional|Book on C, A: Programming in C|Kelley, Al and Pohl, Ira|9780201183993\n2000|Pearson|C for Java Programmers|Muldner, Tomasz|9780201702798\n2013|O'Reilly Media|Understanding and Using C Pointers: Core Techniques for Memory Management|Reese, Richard M|9781449344184\n2019|Pearson|C for Scientists and Engineers|Johnsonbaugh, Richard and Kalin, Martin|9780023611360\n2002|Addison-Wesley Professional|Embedded C: Embedded C|Pont, Michael|9780201795233\n2015|Apress|Beginning C for Arduino, Second Edition: Learn C Programming for the Arduino|Purdum, Jack|9781484209417\n2007|Cengage Learning PTR|C Programming for the Absolute Beginner|Vine, Michael|9781598634808\n2008|Charles River Media|Microcontrollers: From Assembly Language to C Using the Pic24 Family|Reese, Robert B. and Bruce, J. W. and Jones, Bryan A.|9781584505839\n2013|Packt Publishing|C Programming for Arduino|Bayle, Julien|9781849517584\n2004|Pearson|Engineering Problem Solving with C (3rd Edition)|Etter, Delores M.|9780131429710\n1994|Sams Publishing|Absolute Beginner's Guide to C (2nd Edition)|Perry, Greg|9780672305108\n2016|CreateSpace Independent Publishing Platform|C Programming Language: A Step by Step Beginner's Guide to Learn C Programming in 7 Days|Graham, Darrel L.|9781534679702\n2015|CRC Press|Intermediate C Programming|Lu, Yung-Hsiang|9781498711630\n2013|Prentice Hall|C for Programmers with an Introduction to C11 (Deitel Developer Series): With an Introduction to C11 (Deitel Developer (Paperback))|Deitel, Paul|9780133462067\n1996|W W Norton & Co Inc|C Programming: A Modern Approach|King, K. N. and King, K.N.|9780393969450\n|Pearson Learning Solutions|C Knights: An Introduction to Programming in C (with selections by Arup Guha and Ali Orooji)||9780558564698\n1993|Sams|The Waite Group's New C Primer Plus|Waite, Mitchell and Prata, Stephen|9780672303197\n2015|Pearson|Problem Solving and Program Design in C Plus MyLab Programming with Pearson eText -- Access Card Package|Hanly, Jeri and Koffman, Elliot|9780134243948\n1999|Pearson|Introduction to C|Etter, Delores|9780130118547\n1995|Computing McGraw-Hill|Enough Rope to Shoot Yourself in the Foot: Rules for C and C++ Programming (Unix/C)|Holub, Allen I.|9780070296893\n2022|Mc Graw Hill India|Programming In Ansi C|E Balagurusamy|9789339219666\n2012|Oxford University Press|Programming in C 2/e (Oxford Higher Education)|Dey, Pradip and Ghosh, Manas|9780198065289\n1991|Pearson|Crafting a Compiler with C|Fischer, Charles and LeBlanc Jr., Richard|9780805321661\n2005|Smiley Micros|C Programming for Microcontrollers Featuring ATMEL's AVR Butterfly and the free WinAVR Compiler|Pardue, Joe|9780976682202\n2014|O'Reilly Media|21st Century C: C Tips from the New School|Klemens, Ben|9781491903896\n1994|Cambridge University Press|C by Example (Cambridge Computer Science Texts, Series Number 29)|Kalicharan, Noel|9780521456500\n1995|Waite Group Pr|Black Art of 3D Game Programming: Writing Your Own High-Speed 3D Polygon Video Games in C|Lamothe, Andre|9781571690043\n1986|Scott, Foresman|Programming C On The Macintosh|Terry A Ward|9780673182746\n2007|BPB Publications|Let Us C Solutions|Yashavant Kanetkar|9788183331777\n1995|Addison-Wesley|C by Dissection: The Essentials of C Programming|Kelley, Al and Pohl, Ira|9780805331493\n1998|Addison-Wesley Professional|C++ For C Programmers, Third Edition (3rd Edition)|Pohl, Ira|9780201395198\n1988|Cambridge University Press|Numerical Recipes in C|Press, W. H. and Flannery, B. P. and Teukolsky, S. A. and Vetterling, W. T.|9780521354653\n1996|Springer|C A Software Engineering Approach|Darnell, Peter A. and Margolis, Philip E.|9780387946757\n2007|O'Reilly Media|Linux System Programming: Talking Directly to the Kernel and C Library|Love, Robert|9780596009588\n2020|Addison-Wesley Professional|C Puzzle Book, The|Feuer, Alan|9780201604610\n1995|O'Reilly & Associates|C++ The Core Language: A Foundation for C Programmers (Nutshell Handbooks)|Brown, Doug and Satir, Gregory|9781565921160\n2000|Cambridge University Press|Simulating Ecological and Evolutionary Systems in C|Wilson, Will|9780521772280\n2017|MC GRAW HILL INDIA|Computing Fundamentals And C Programming 2Nd Edition|BALAGURUSAMY|9789352604166\n2022|PEARSON INDIA|Programming in C|KOCHAN|9789332554665\n2012|Oxford University Press|Computer Fundamentals & Programming in C|Thareja, Reema|9780198078883\n1994|Wiley|Programming for Graphics Files: In C and C++|Levine, John R. and Levine, John|9780471598565\n1992|West Publishing Company, College & School Division|Programming in ANSI C|Kumar, Ram; Agrawal, Rakesh|9780195690378\n2003|Thomson Delmar Learning|Programming in Objective- C|Cengage|9780672325861\n2011|MC GRAW HILL INDIA|Parallel Programming In C With Mpi And Open Mp, 1St Edn|QUINN|9780070582019\n|BPB Publications|ANSI C Programming||9788183333245\n2013|Oxford University Press|Introduction to C Programming|Thareja, Reema|9780198086390\n2014|Oxford University Press|Introduction to C Programming|Thareja, Reema|9780199452057\n1995|Addison-Wesley Professional|C Programming Faqs: Frequently Asked Questions|Summit, Steve|9780201845198\n2020|For Dummies|C Programming For Dummies (For Dummies (Computer/Tech))|Gookin, Dan|9781119740247\n1989|Wiley|Graphics Programming In Turbo C|Leen Ammeraal|9780471924395\n2020|BPB Publications|Let Us C: Authentic Guide to C PROGRAMMING Language 17th Edition (English Edition)|Kanetkar, Yashavant|9789389845686\n1997|Prentice Hall|大学计算机教育丛书•C程序设计语言习题解答(第2版)(影印版) - The C Answer Book - Solutions to the Exercises in the C Programming Language - 2nd Edition||9787302027287\n2009|Wiley India|Computer Concepts and C Programming|VIKAS GUPTA|9788177229981\n1986|Springer|The Art of C Programming|Jones, Robin and Stewart, Ian|9780387963921\n2015|Pearson|Mylab Programming with Pearson Etext -- Access Code Card -- For Problem Solving and Program Design in C|Hanly, Jeri and Koffman, Elliot|9780134253992\n2015|Pearson|MyLab Programming with Pearson eText -- Standalone Access Card -- for C How to Program|Deitel, Paul and Deitel, Harvey|9780134225340\n1985|Que Corp|C programming guide|Purdum, Jack J|9780880221573\n1996|McGraw Hill|Programming with C|Hubbard, John|9780070593695\n2012|O'Reilly Media|21st Century C: C Tips from the New School|Klemens, Ben|9781449327149\n1996|Prentice Hall|Data Structures and Program Design In C (2nd Edition)|Kruse, Robert L. and Leung, Bruce P. and Tondo, Clovis L.|9780132883665\n1989|McGraw-Hill Osborne Media|Advanced Turbo C (Borland-Osborne/McGraw-Hill Programming Series)|Schildt, Herbert|9780078814792\n2004|Bpb Publications|Data Structures Through C in Depth [May 30, 2004] Srivastava, S. K. and Srivastava, Deepali|Srivastava, S. K.|9788176567411\n2010|People Post Press Pub. Date: 2010 -04|C language programming: a modern approach(Chinese Edition)|( MEI )K. N. King|9787115219572\n20081020|Springer Nature|Foundations of C /CLI|Gordon Hogenson|9781430210245\n1988|Sams|Programming in C (Hayden books C library)|Kochan, Stephen G.|9780672484209\n1992|M & T Books|Getting Graphic: Programming Fundamentals in C and C++/Book and Disk|Finlay, Mark|9781558512825\n20140307|Pearson Education (US)|Starting Out with C From Control Structures to Objects|Tony Gaddis|9780133888201\n1992|Dryden Pr|Business Programming in C for Dos-Based Systems (The Dryden Press Series in Information System)|Millspaugh, A. C.|9780155001398", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1978|The C Programming Language|10.1007/978-3-662-09507-2_22|2216|51|B. Kernighan and D. Ritchie|d36227ed3bfbe37972acfc90acea59f1246e0fde\n1992|The Semantics of the C Programming Language|10.1007/3-540-56992-8_17|252|10|Y. Gurevich and J. Huggins|6d65722122ef01784cf681cffff7b8e70a033f5b\n2008|Hardbound: architectural support for spatial safety of the C programming language|10.1145/1346281.1346295|211|30|Joseph Devietti and Colin Blundell and Milo M. K. Martin and S. Zdancewic|4f8aa76dd8c1309d48bca4858a468769c992bff9\n1989|The concurrent C programming language|10.5860/choice.27-0970|84|1|N. Gehani and W. D. Roome|6f4869aad5488ceb5dc9123f812cf650f8ad07b5\n1978|UNIX time-sharing system: The C programming language|10.1002/J.1538-7305.1978.TB02140.X|58|0|D. Ritchie and S. C. Johnson and M. Lesk and B. Kernighan|1f12815c916ee291721ab09f32b6dc9cccf78052\n2017|Real-time learning analytics for C programming language courses|10.1145/3027385.3027407|32|1|Xinyu Fu and Atsushi Shimada and H. Ogata and Yuta Taniguchi and D. Suehiro|e62c260c0bdafaff60edd58cca1916b6bfd1de01\n2008|Introductory C Programming Language Learning with Game-Based Digital Learning|10.1007/978-3-540-85033-5_22|24|3|Wen-Chih Chang and Yu-Min Chou|c608f31fcf55b8025d32db5b5e5e6965d0c86124\n1996|C Programming: A Modern Approach|10.5860/choice.34-0350|23|3|K. N. King|96393da4f7c043d840fab62911d1fa4a44b12b39\n2011|A minimal, extensible, drag-and-drop implementation of the C programming language|10.1145/2047594.2047646|22|1|S. Federici|19bcbe22289575283fa5ea50b28b98b4fef0195e\n1985|Omega—A Data Flow Analysis Tool for the C Programming Language|10.1109/TSE.1985.232542|20|1|C. Wilson and L. Osterweil|a17b956678ab4e32f2246a425d92d2d0c9d9035a\n1996|The development of the C programming language|10.1145/234286.1057834|18|0|D. Ritchie|53a1e8c89f53aee3cb584f63968c65bbc23516bb\n1993|Extensions to the C programming language for enhanced fault detection|10.1002/spe.4380230604|17|1|D. Flater and Y. Yesha and E. Park|85f138643978fbd9f461a0a024e9d20009a33d20\n2015|Research and Reflection on Teaching of C Programming Language Design|10.1007/978-3-662-46248-5_45|12|0|Hui Gao and Zhaowen Qiu and Di Wu and Liyan Gao|ca493d45444957fb34f85425e89c1132c1e58797\n2017|A Serious Game for Learning C Programming Language Concepts Using Solo Taxonomy|10.3991/ijet.v12i03.6476|12|0|Alaeeddine Yassine and D. Chenouni and M. Berrada and A. Tahiri|dab275e2c8e9f22bc9cce1286b62fcb6ba3b2f2d\n2018|Timed C: An Extension to the C Programming Language for Real-Time Systems|10.1109/RTAS.2018.00031|10|0|Saranya Natarajan and David Broman|d1baf7641b5c7f0074923e3b3773f0f6d6f77741\n1987|Design tradeoffs to support the C programming language in the CRISP microprocessor|10.1145/36206.36198|8|0|D. Ditzel and H. McLellan|37a1c18cce1c6840b7b94600a4e7247b534382b6\n1985|The C Programming Language and a C Compiler|10.1147/sj.241.0037|7|0|Ralph R. Ryan and Hans-Dieter Spiller|0f9a12e9901772a51486f72283b7e34e3d54f996\n2008|Virtual Education System for the C Programming Language|10.1007/978-3-540-85033-5_20|5|1|Il-Hyeon Moon and Saeron Han and KwanSun Choi and Dongsik Kim and Changwan Jeon and Sunheum Lee and Heunggu Jeon|3c048305affc8dd4a384db4843f4c98d59cf4660\n1985|The C programming language|10.1016/0011-684X(85)90032-2|2|0|Russell Jones|4ad1b60dca3d306e164233d7044f9587f296e002" }, "c2": { "title": "C2", "appeared": 2012, "type": "pl", "creators": [ "Bas van den Berg" ], "website": "http://www.c2lang.org/", "country": [ "The Netherlands" ], "domainName": { "registered": 2012, "name": "c2lang.org" }, "related": [ "c", "c3" ], "hasAccessModifiers": { "example": "", "value": true }, "hasAssignment": { "example": "", "value": true }, "hasBinaryOperators": { "example": "", "value": true }, "hasBitWiseOperators": { "example": "", "value": true }, "hasBlobs": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasBreak": { "example": "", "value": true }, "hasBuiltInRegex": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasClasses": { "example": "", "value": false }, "hasComments": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": false }, "hasContinue": { "example": "", "value": true }, "hasDirectives": { "example": "", "value": true }, "hasEnums": { "example": "", "value": true }, "hasStructs": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "hasUnionTypes": { "example": "", "value": true }, "hasUnaryOperators": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2013, "stars": 618, "forks": 45, "subscribers": 44, "created": 2013, "updated": 2022, "description": "the C2 programming language", "issues": 16, "url": "https://github.com/c2lang/c2compiler" }, "repoStats": { "firstCommit": 2013, "commits": 1343, "committers": 18, "files": 1291 } }, "c3": { "title": "C3", "appeared": 2019, "type": "pl", "creators": [ "Christoffer Lernö" ], "description": "C3 is a programming language that builds on the syntax and semantics of the C language, with the goal of evolving it while still retaining familiarity for C programmers.", "website": "http://www.c3-lang.org/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/ex7hpp/february_2020_monthly_what_are_you_working_on/fgdpuki/", "https://news.ycombinator.com/item?id=32005678" ], "fileExtensions": [ "c3", "c3i" ], "country": [ "Sweden" ], "originCommunity": [ "The C3 Language Project" ], "domainName": { "registered": 2019, "awisRank": { "2022": 6109240 }, "name": "c3-lang.org" }, "influencedBy": [ "c2", "c" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment\n/* Another comment */", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasBitWiseOperators": { "example": "int i = b << 4 + x; // Same as (b << 4) + x ", "value": true }, "hasOctals": { "example": "0o177", "value": true }, "hasArraySlicingSyntax": { "example": "int[] slice1 = array[0..5]; // start..end\nint[] slice2 = array[0:6]; // start:length", "value": true }, "hasAsyncAwait": { "example": "", "value": false }, "hasBoundedCheckedArrays": { "example": "", "value": true }, "hasBreak": { "example": "", "value": true }, "hasBuiltInRegex": { "example": "", "value": false }, "hasContinue": { "example": "", "value": true }, "hasDuckTyping": { "example": "", "value": false }, "hasDynamicProperties": { "example": "", "value": false }, "hasEscapeCharacters": { "example": "\"\\e\\n\\r\"", "value": true }, "hasExpressions": { "example": "", "value": true }, "hasForLoops": { "example": "", "value": true }, "hasHereDocs": { "example": "", "value": false }, "hasHexadecimals": { "example": "", "value": true }, "hasIfs": { "example": "", "value": true }, "hasIfElses": { "example": "", "value": true }, "hasImplicitTypeConversions": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasFunctionOverloading": { "example": "", "value": false }, "hasFunctionComposition": { "example": "", "value": false }, "hasHomoiconicity": { "example": "", "value": false }, "hasInheritance": { "example": "", "value": true }, "hasLabels": { "example": "while FOO: (x > 0)\n{\n for (int i = 0; i < 10; i++\n {\n x = baz();\n if (x > i) break FOO;\n }\n}", "value": true }, "hasLazyEvaluation": { "example": "fn void print(String s)\n{\n io::printfn(\"Said: %s\", s);\n} \nmacro @foo(bool run, #lazy)\n{\n if (run) #lazy;\n}\n// Only \"Said: Hello\" is printed:\n@foo(false, print(\"Bye\"));\n@foo(true, print(\"Hello\"));", "value": true }, "hasMagicGettersAndSetters": { "example": "", "value": false }, "hasMessagePassing": { "example": "", "value": false }, "hasNull": { "example": "", "value": true }, "hasPipes": { "example": "", "value": false }, "hasSExpressions": { "example": "", "value": false }, "hasBinaryNumbers": { "example": "0b110011", "value": true }, "hasExplicitTypeCasting": { "example": "double d = 3.3;\nint x = (int)d;", "value": true }, "hasNamespaces": { "example": "import std::io;\n...\nio::printf(\"%d\", i);", "value": true }, "hasMultipleInheritance": { "example": "", "value": false }, "hasDirectives": { "example": "", "value": false }, "hasIntegers": { "example": "int x = 314159;", "value": true }, "hasIncrementAndDecrementOperators": { "example": "i++; --j;", "value": true }, "hasManualMemoryManagement": { "example": "", "value": true }, "hasAssertStatements": { "example": "assert(a > 0, \"Expected a positive number\");\n$assert(Foo.sizeof == 8, \"Foo sizecheck at compile time failed\");", "value": true }, "hasDefaultParameters": { "example": "fn void test(int x = 10) { ... } ", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasClasses": { "example": "", "value": false }, "hasConstants": { "example": "const FOO = 123;\nconst void* BAR = null;", "value": true }, "hasAbstractTypes": { "example": "", "value": false }, "hasDocComments": { "example": "/**\n * @param [in] foo \"The foo value\"\n * @return \"the toal foo count\"\n **/", "value": true }, "hasEnums": { "example": "enum TestEnum : int\n{\n FOO,\n BAR,\n BAZ\n}", "value": true }, "hasUnaryOperators": { "example": "", "value": true }, "hasUnicodeIdentifiers": { "example": "", "value": false }, "hasUnitsOfMeasure": { "example": "", "value": false }, "hasUserDefinedOperators": { "example": "", "value": false }, "hasSingleTypeArrays": { "example": "", "value": true }, "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasUnionTypes": { "example": "union Foo\n{\n int x;\n float f;\n struct \n {\n char[2] z;\n } \n} ", "value": true }, "hasMacros": { "example": "macro square(x)\n{\n return x * x;\n}", "value": true }, "hasForEachLoops": { "example": "foreach (x : list)\n{\n foo(x);\n} ", "value": true }, "hasImports": { "example": "import std::io;", "value": true }, "hasMethods": { "example": "fn int Foo.get_value(Foo* this)\n{\n return this.value;\n}", "value": true }, "hasMultiLineComments": { "example": "/* \n Multiline comment\n*/", "value": true }, "hasMultilineStrings": { "example": "String s = `this\n string is multiline`;", "value": true }, "hasOperatorOverloading": { "example": "fn int IntList.get(IntList* this, int idx) @operator([])\n{\n return this.vals[idx];\n}\n...\nIntList x = ...\nfoo(x[1]);", "value": true }, "hasModules": { "example": "module my_module::submodule;\n...", "value": true }, "hasReservedWords": { "example": "", "value": true }, "hasVariadicFunctions": { "example": "fn void foo_typed(int x, int... arg) { ... }\nfn void foo_untyped(int x, ...arg) \n...\nfoo_typed(1, 2, 3);\nfoo_untyped(1, \"hello\", 1.2);", "value": true }, "hasPointers": { "example": "", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasAssignment": { "example": "a = b;", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasWhileLoops": { "example": "while (int x = foo(); x > 0) \n{\n sum += x;\n}", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "hasTernaryOperators": { "example": "int foo = x ? 1 : 0;", "value": true }, "hasStrings": { "example": "String s = \"hello\";\nString t = `I say \"hello\"`;", "value": true }, "hasStructs": { "example": "struct Test\n{\n int x;\n float y;\n String z;\n} ", "value": true }, "hasGotos": { "example": "", "value": false }, "hasGarbageCollection": { "example": "", "value": false }, "hasSwitch": { "example": "switch(expression) \n{\n case 1:\n do_something();\n case 2:\n if (x > 0) nextcase 1; // Jump to 1\n nextcase; // Jump to the next case.\n default:\n foo();\n}\n", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "module stack ;\n// Above: the parameterized type is applied to the entire module.\nimport std::mem;\n\nstruct Stack\n{\n usize capacity;\n usize size;\n Type* elems;\n}\n\n// The type methods offers dot syntax calls,\n// so this function can either be called \n// Stack.push(&my_stack, ...) or\n// my_stack.push(...)\nfn void Stack.push(Stack* this, Type element)\n{\n if (this.capacity == this.size)\n {\n this.capacity *= 2;\n this.elems = mem::realloc(this.elems, $sizeof(Type) * this.capacity);\n }\n this.elems[this.size++] = element;\n}\n\nfn Type Stack.pop(Stack* this)\n{\n assert(this.size > 0);\n return this.elems[--this.size];\n}\n\nfn bool Stack.empty(Stack* this)\n{\n return !this.size;\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 886, "subscribers": 19, "created": 2019, "updated": 2023, "issues": 41, "forks": 49, "description": "The C3 compiler.", "url": "https://github.com/c3lang/c3c" }, "repoStats": { "firstCommit": 2019, "commits": 1295, "committers": 40, "files": 1000 }, "rosettaCode": "https://rosettacode.org/wiki/Category:C3", "officialBlogUrl": [ "https://c3.handmade.network/blog" ], "twitter": "https://twitter.com/C3Lang", "isOpenSource": true, "semanticScholar": "" }, "ca-realizer": { "title": "CA-Realizer", "appeared": 1992, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Within Technologies" ], "wikipedia": { "related": [ "basic", "visual-basic" ], "summary": "CA-Realizer was a BASIC-language software development product originally developed by Within Technologies, but first commercially released by Computer Associates, as CA-Realizer 1.0 in 1992. Several versions were released, that provided a version of the BASIC programming language, a Rapid application development tool, including forms building and some powerful built-in components, that was comparable to, and competitive with Microsoft Visual Basic, in its early days. It offered some functionality (like a fairly useful spreadsheet) and cross-platform capability. There were versions for 16-bit Windows 3.1, 32-bit Windows 95, and 32-bit IBM OS/2. The final version was CA-Realizer 3.0, released around 1996. As MS Visual Basic 4.0, and later continued to advance in functionality, CA-Realizer was left behind, and was quietly retired from CA's product offerings in the late 1990s. In the 1996 to 1999 versions of Accpac ERP for Windows, CA Realizer was responsible for the dreaded \"CarlZ Error\" which would periodically hang up the software. This error disappeared in the 2000 version of the software when it under went a rewrite in C compiler.", "created": 2007, "backlinksCount": 3, "pageId": 12326944, "revisionCount": 15, "dailyPageViews": 3, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/CA-Realizer" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ca-telon": { "title": "CA-Telon", "appeared": 1981, "type": "pl", "country": [ "United States" ], "originCommunity": [ "CA Technologies" ], "wikipedia": { "related": [ "cullinet", "cobol", "pl-i", "synon" ], "summary": "TELON, later renamed CA-TELON, is one of the first commercially successful application generators for building business applications.", "created": 2006, "backlinksCount": 5, "pageId": 5332972, "revisionCount": 68, "dailyPageViews": 10, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/CA-Telon" }, "centralPackageRepositoryCount": 0 }, "ca65-assembly": { "title": "ca65 Assembly", "appeared": 1998, "type": "assembly", "reference": [ "https://cc65.github.io/doc/ca65.html" ], "country": [ "Germany" ], "originCommunity": [ "MU software development" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "stringToken": [ [ "\"" ] ], "example": [ " Label: ; A label and a comment\n lda #$20 ; A 6502 instruction plus comment\n L1: ldx #$20 ; Same with label\n L2: .byte \"Hello world\" ; Label plus control command\n mymac $20 ; Macro expansion\n MySym = 3*L1 ; Symbol definition\n MaSym = Label ; Another symbol" ], "pygmentsHighlighter": { "filename": "asm.py", "fileExtensions": [ "s" ], "id": "ca65 assembler" } }, "cabal": { "title": "CABAL", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/487a30d8edf301dd180503f56a8c0c4749858965" ], "country": [ "England" ], "originCommunity": [ "Trinity College, Cambridge", "University of Bath" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7008", "centralPackageRepositoryCount": 0 }, "cache-basic": { "title": "Caché Basic", "appeared": 1997, "type": "queryLanguage", "description": "Caché is a high-performance object database with several built-in general-purpose programming languages. It supports multiple processes and provides concurrency control. Each process has direct, efficient access to the data.", "reference": [ "https://docs.intersystems.com/latest/csp/docbook/DocBook.UI.Page.cls?KEY=TBAS_ARoutine" ], "country": [ "United States" ], "originCommunity": [ "InterSystems Corporation" ], "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "'" ] ], "printToken": [ [ "println" ] ], "booleanTokens": [ [ "True", "False" ] ], "example": [ "' RightTriangle compute area and hypotenuse of a right triangle\n' this routine contains examples of Cache Basic features */\n \nSub Run() \nprintln \"Compute the area and hypotenuse of a right triangle\"\nprintln \"given the lengths of its two sides.\" \nprintln\nprintln \"First, choose a unit of measurement. \" \ninput \"(i)nches, (f)eet, (m)iles, \" _\n , \"(c)entimeters, m(e)ters, (k)ilometers: \", units\nprintln\n' translate units to a full word\nselect case left(units, 1)\n case \"i\" units = \"inches\"\n case \"f\" units = \"feet\"\n case \"m\" units = \"miles\"\n case \"c\" units = \"centimeters\"\n case \"e\" units = \"meters\"\n case \"k\" units = \"kilometers\"\n case else units = \"units\"\nend select\n \ndo\n println\n input \"Length of side 1: \", side1\n if (side1) = \"\" then exit do\nloop while IsNegative( side1 )\nif (side1 = \"\") then exit sub\n \ndo\n println\n input \"Length of side 2: \", side2\n if (side2) = \"\" then exit do\nloop while IsNegative( side2 )\nif (side2 = \"\") then exit sub\n \nCompute(units, side1, side2)\nend sub\n \npublic function IsNegative(ByVal num As %String) As %Boolean\n' is num negative?\n ' check in range \"1\" through \"9\"\n if (num < chr(49)) or (num > chr(57)) then\n print \" Enter a positive number.\" \n return True\n else\n print \" Accepted.\"\n return False\n end if\nend function\n \nprivate function Compute(ByVal units As %String, _\n ByVal A As %Integer, _\n ByVal B As %Integer)\n' compute and display area and hypotenuse\n \narea = round((( A * B ) / 2), 2)\nhypot = round(sqr(( A ^ 2 ) + ( B ^ 2 )), 2)\n \nprintln : println\nprintln \"The area of this triangle is \", area, \" square \", units, \".\"\nprintln\nprintln \"The hypotenuse is \", hypot, \" \", units, \".\"\nend function" ], "centralPackageRepositoryCount": 0 }, "cache-objectscript": { "title": "Caché ObjectScript", "appeared": 1997, "type": "pl", "country": [ "United States" ], "originCommunity": [ "InterSystems" ], "supersetOf": [ "mumps" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Write" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "mumps", "sql" ], "summary": "Caché ObjectScript is a part of the Caché database system sold by InterSystems. The language is a functional superset of the ANSI-standard MUMPS programming language. Since Caché is at its core a MUMPS implementation, it can run ANSI MUMPS routines with no change. To appeal as a commercial product, Caché implements support for object-oriented programming, a macro preprocessing language, embedded SQL for ANSI-standard SQL access to M's built-in database, procedure and control blocks using C-like brace syntax, procedure-scoped variables, and relaxed whitespace syntax limitations. The language has private and public variables and globals. Global has a different meaning in this language than in most; such variables are global across routines, processes, and sessions. Thus, editing a global variable is making permanent and immediate changes to a system-universal database (which survives reboots, etc.). The scope of a private variable is the local function, the scope of a public variable is the entire process. Variables, private and public, may be single elements or complete multi-dimensional arrays. The great majority of Caché's feature-set is inherited from the ANSI MUMPS standard. See that article for details on how data is represented and the different ways a programmer can think about the data during development.", "pageId": 2242790, "created": 2005, "backlinksCount": 19, "revisionCount": 55, "dailyPageViews": 19, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Caché_ObjectScript" }, "leachim6": { "filepath": "c/Cache ObjectScript.mac", "example": [ "HelloWorld ;\n Write \"Hello World\"\n Quit\n" ], "id": "Cache ObjectScript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4987", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCache Objectscript and Mumps: Technical Learning Manual|2012|Paul Mike Kadow|23453991|3.29|7|0" }, "cactus": { "title": "Cactus", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d5fce60f47169d0ad35715b575f8182063e40c26" ], "country": [ "Greece" ], "originCommunity": [ "National", "Kapodistrian University of Athens", "Ionian University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2852", "centralPackageRepositoryCount": 0 }, "cadence-skill": { "title": "Cadence SKILL", "appeared": 1990, "type": "pl", "reference": [ "http://pwp.gatech.edu/wp-content/uploads/sites/367/2016/03/Intro_to_skill_prog.pdf" ], "aka": [ "SKILL" ], "country": [ "United States" ], "originCommunity": [ "Cadence Design Systems, Inc" ], "wikipedia": { "related": [ "scheme", "common-lisp", "lisp" ], "summary": "SKILL is a Lisp dialect used as a scripting language and PCell (parameterized cells) description language used in many EDA software suites by Cadence Design Systems. It was originally put forth in an IEEE paper in 1990.", "created": 2006, "backlinksCount": 53, "pageId": 6693612, "revisionCount": 133, "dailyPageViews": 34, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Cadence_SKILL" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "cado-systems-technical-information": { "title": "cado-systems-technical-information", "appeared": 1973, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/CADO_Systems" ], "country": [ "Ireland" ], "originCommunity": [ "CADO Systems" ], "centralPackageRepositoryCount": 0, "isbndb": "" }, "cafeobj": { "title": "CafeObj", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/07dc369fd161797123658430ae376b0ac800bce1" ], "country": [ "Japan" ], "originCommunity": [ "Japan Advanced Institute of Science and Technology" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:CafeOBJ", "hopl": "https://hopl.info/showlanguage.prx?exp=3677", "centralPackageRepositoryCount": 0 }, "caffeine": { "title": "Caffeine", "appeared": 2012, "type": "pl", "creators": [ "Roman I. Kuzmin" ], "website": "https://github.com/ich/caffeine", "fileExtensions": [ "coffee" ], "country": [ "Russia" ], "originCommunity": [ "https://github.com/ich" ], "githubRepo": { "stars": 21, "forks": 2000, "subscribers": 3, "created": 2012, "updated": 2013, "description": "Caffeine extends CoffeeScript.", "url": "https://github.com/ich/caffeine" }, "repoStats": { "firstCommit": 2009, "commits": 3581, "committers": 105, "files": 88 } }, "cages": { "title": "CAGES", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8226f1d402f5a322b8da84593dbeba5b26592f29" ], "country": [ "United States" ], "originCommunity": [ "University of North Carolina" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7350", "centralPackageRepositoryCount": 0 }, "caisys": { "title": "CAISYS", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3728e2c01fdb17b90a02a203ffe52623daceb75c" ], "country": [ "United States" ], "originCommunity": [ "University of Texas" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6668", "centralPackageRepositoryCount": 0 }, "cajole": { "title": "CAJOLE", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/653798784585ee159dd25fa50017d0f99a88ea8e" ], "country": [ "England" ], "originCommunity": [ "Westfield College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=944", "centralPackageRepositoryCount": 0, "isbndb": "" }, "cal": { "title": "CAL Actor Language", "appeared": 2001, "type": "pl", "reference": [ "https://ptolemy.berkeley.edu/projects/embedded/caltrop/language.html" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "wikipedia": { "summary": "CAL (the Cal Actor Language) is a high-level programming language for writing (dataflow) actors, which are stateful operators that transform input streams of data objects (tokens) into output streams. CAL has been compiled to a variety of target platforms, including single-core processors, multicore processors, and programmable hardware. It has been used in several application areas, including video and processing, compression and cryptography. The MPEG Reconfigurable Video Coding (RVC) working group has adopted CAL as part of their standardization efforts.", "backlinksCount": 8, "pageId": 26018004, "dailyPageViews": 9, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/CAL_Actor_Language" } }, "calc-var": { "title": "calc_var", "appeared": 2013, "type": "plzoo", "description": "integer arithmetic +, -, *, /, variables", "website": "http://plzoo.andrej.com/language/calc_var.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "centralPackageRepositoryCount": 0 }, "calc": { "title": "calc", "appeared": 2013, "type": "plzoo", "description": "integer arithmetic +, -, *, /", "website": "http://plzoo.andrej.com/language/calc.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2006|Packt Publishing|Learn OpenOffice.org Spreadsheet Macro Programming: OOoBasic and Calc automation: A fast and friendly tutorial to writing macros and spreadsheet applications|Bain, Dr Mark Alexander|9781847190970\n2006-12-22|Packt Publishing|Learn OpenOffice.org Spreadsheet Macro Programming : OOoBasic and Calc Automation|Mark Alexander Bain|9781847190994" }, "calc4": { "title": "Calc4", "appeared": 2018, "type": "pl", "creators": [ "Yuya Watari" ], "description": "Calc4 is a programming language where everything in its code is an operator.", "website": "https://github.com/proprowataya/calc4", "country": [ "Japan" ], "originCommunity": [ "https://github.com/proprowataya" ], "example": [ "[fib2|x, a, b|x ? ((x-1) ? ((x-1) {fib2} (a+b) {fib2}a) ? a) ? b] 38{fib2}1{fib2}0" ], "githubRepo": { "stars": 3, "forks": 0, "subscribers": 2, "created": 2018, "updated": 2022, "description": "The Calc4 Programming Language - Every code element is an operator, allowing programming in the style of a calculator", "url": "https://github.com/proprowataya/calc4" }, "repoStats": { "firstCommit": 2018, "commits": 180, "committers": 4, "files": 37 } }, "cali-lang": { "title": "Cali-Lang", "appeared": 2015, "type": "pl", "description": "Cali is an object oriented interpreted programming language written in Java. It is an efficiency (glue) language that is loosely typed. Cali has it's own standard library but anyone can create external Java modules to extend Cali. In fact, the entire standard library was written by wrapping Java code.", "website": "https://web.archive.org/web/20160820093952/http://cali-lang.com/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/cali-lang" ], "example": [ "include console;\ninclude net.rpc;\ninclude rpcDemoObj; // Include demo object.\nclass rpcDemoServer : rpcServer\n{\n public main(args)\n {\n rd = new rpcDemoServer();\n console\n .println('Starting up rpcDemoServer on localhost:9090')\n .println('Hit ctrl-c to kill the server.')\n .println('Waiting for calls ...\\n')\n ;\n rd.start();\n }\n cart = [];\n public rpcDemoServer()\n {\n this // Hosted methods\n .add('addToCart')\n .add('getCart')\n ;\n }\n public addToCart(object Item)\n {\n if(Item instanceof 'rpcDemoObj')\n {\n console.println(\"Adding item '\" + Item.getModelName() + \"' to cart.\");\n this.cart @= Item;\n return true;\n }\n else { throw \"Unexpected object found.\"; }\n }\n public getCart()\n {\n console.println('Returning shopping cart.');\n return this.cart;\n }\n}" ], "githubRepo": { "stars": 1, "forks": 0, "subscribers": 2, "created": 2017, "updated": 2021, "description": "Base implementation of Cali interpreter.", "url": "https://github.com/cali-lang/cali.lang.base" }, "repoStats": { "firstCommit": 2017, "commits": 39, "committers": 5, "files": 104 } }, "caltech-intermediate-form": { "title": "Caltech Intermediate Form", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "California Institute of Technology" ], "wikipedia": { "example": [ "cifFile ::= (blank* command? semi)* endCommand blank*\ncommand ::= primCommand | defDeleteCommand | defStartCommand semi (blank* primCommand? semi)* defFinishCommand\nprimCommand ::= polygonCommand | boxCommand | roundFlashCommand | wireCommand | layerCommand | callCommand | userExtensionCommand | commentCommand\npolygonCommand ::= \"P\" path\nboxCommand ::= \"B\" integer sep integer sep point (sep point)?\nroundFlashCommand ::= \"R\" integer sep point\nwireCommand ::= \"W\" integer sep path\nlayerCommand ::= \"L\" blank* shortname\ndefStartCommand ::= \"D\" blank* \"S\" integer (sep integer sep integer)?\ndefFinishCommand ::= \"D\" blank* \"F\"\ndefDeleteCommand ::= \"D\" blank* \"D\" integer\ncallCommand ::= \"C\" integer transformation\nuserExtensionCommand ::= digit userText\ncommentCommand ::= \"(\" commentText \")\"\nendCommand ::= \"E\"\ntransformation ::= (blank* (\"T\" point |\"M\" blank* \"X\" |\"M\" blank* \"Y\" |\"R\" point)*)*\npath ::= point (sep point)*\npoint ::= sInteger sep sInteger\nsInteger ::= sep* \"-\"? integerD\ninteger ::= sep* integerD\nintegerD ::= digit+\nshortname ::= c c? c? c?\nc ::= digit | upperChar\nuserText ::= userChar*\ncommentText ::= commentChar* | commentText \"(\" commentText \")\" commentText\nsemi ::= blank* \";\" blank*\nsep ::= upperChar | blank\ndigit ::= \"0\" | \"1\" | ... | \"9\"\nupperChar ::= \"A\" | \"B\" | ... | \"Z\"\nblank ::= any ASCII character except digit, upperChar, \"-\", \"(\", \")\", or \";\"\nuserChar ::= any ASCII character except \";\"\ncommentChar ::= any ASCII character except \"(\" or \")\"" ], "summary": "Caltech Intermediate Form (CIF) is a file format for describing integrated circuits. CIF provides a limited set of graphics primitives that are useful for describing the two-dimensional shapes on the different layers of a chip. The format allows hierarchical description, which makes the representation concise. In addition, it is a terse but human-readable text format.", "created": 2006, "backlinksCount": 8, "pageId": 4558978, "revisionCount": 36, "dailyPageViews": 10, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Caltech_Intermediate_Form" }, "hopl": "https://hopl.info/showlanguage.prx?exp=890", "centralPackageRepositoryCount": 0, "isbndb": "" }, "calypso": { "title": "Calypso", "appeared": 2020, "type": "pl", "creators": [ "ThePuzzlemaker" ], "website": "https://calypso-lang.github.io/", "country": [ "Unknown" ], "originCommunity": [ "teamisotope" ], "githubRepo": { "firstCommit": 2020, "stars": 57, "forks": 4, "subscribers": 3, "created": 2020, "updated": 2022, "description": "Calypso is a mostly imperative language with some functional influences that is focused on flexibility and simplicity.", "issues": 8, "url": "https://github.com/calypso-lang/calypso" }, "repoStats": { "firstCommit": 2020, "commits": 527, "committers": 8, "files": 143 } }, "cam": { "title": "Content Assembly Mechanism", "appeared": 2002, "type": "xmlFormat", "country": [ "United States" ], "originCommunity": [ "OASIS Content Assembly Technical Committee" ], "example": [ "\n
\n\n\n \n" ], "wikipedia": { "summary": "Content Assembly Mechanism (CAM) is an XML-based standard for creating and managing information exchanges that are interoperable and deterministic descriptions of machine-processable information content flows into and out of XML structures. CAM is a product of the OASIS Content Assembly Technical Committee. The CAM approach aligns with the National Information Exchange Model (NIEM) approach and assists with producing Information Exchange Package Documentation (IEPD). The camprocessor tools enable creation of realistic XML examples from XSD schema structure definitions. These XML samples simulate test cases for use in interoperability testing and determination of templates for use in actual business information exchanges. The single most important problem that CAM is solving is simpler and more reliable interoperability for business information exchanges. Today's electronic commerce via the internet is extremely limited in the amount of automation or integration that is occurring. The ability to share accurate concise and verifiable information exchange definitions is a critical next step in enabling easier and cheaper global commerce. CAM is emerging as the definitive standard underlying effective management of information exchanges through the critical mass being generated by the open source solution.A broad range of OASIS standard definitions are now being documented, validated and enhanced using the CAM open source toolset and approach. To date these include EDXL, CIQ, and EML. CAM use is also extending to external industry groups such as PESC, MISMO, STAR Automotive, CAQH and then for government uses including stratML, LEXS and NIEM. Each group faces the same challenges in promoting localizations of their overall standards in ways that can be quickly verified and adopted. Using CAM they are able to take their existing XSD schema work and rapidly develop localization templates, XML test cases, new subset schemas for use with web services and create re-usable want lists and content hints. In addition CAM templates are used to build domain dictionaries directly from the XSD schema definitions and then produce cross-reference spreadsheets for individual templates to the master dictionary definitions. All these capabilities are aimed at improving the quality and speed of implementation and interoperability using business information exchanges based on XML.", "backlinksCount": 52, "pageId": 20946162, "dailyPageViews": 33, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Content_Assembly_Mechanism" } }, "camac": { "title": "CAMAC", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/69cd60bccf029341fbc3f605bd19e9dd9599db51" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois Chicago" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4095", "centralPackageRepositoryCount": 0 }, "camal": { "title": "Cambridge Algebra System", "appeared": 1973, "type": "pl", "country": [ "England" ], "originCommunity": [ "Cambridge University" ], "wikipedia": { "related": [ "assembly-language", "bcpl" ], "summary": "Cambridge Algebra System (CAMAL) is a computer algebra system written in Cambridge University by David Barton, Steve Bourne, and John Fitch. It was initially used for computations in celestial mechanics and general relativity. The foundation code was written in Titan computer assembler,. In 1973, when Titan was replaced with an IBM370/85, it was rewritten in ALGOL 68C and then BCPL where it could run on IBM mainframes and assorted microcomputers.", "pageId": 36699162, "created": 2012, "backlinksCount": 57, "revisionCount": 29, "dailyPageViews": 3, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/Cambridge_Algebra_System" }, "hopl": "https://hopl.info/showlanguage.prx?exp=671", "fileType": "text", "centralPackageRepositoryCount": 0 }, "camil": { "title": "CAMIL", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5f58fb7451e50e8d5d76ab871430c10942d42cac" ], "country": [ "United States" ], "originCommunity": [ "McDonnell Douglas Automation Company" ], "hopl": "https://hopl.info/showlanguage.prx?exp=793", "centralPackageRepositoryCount": 0 }, "caml": { "title": "Caml", "appeared": 1985, "type": "pl", "creators": [ "Gérard Huet", "Guy Cousineau", "Ascánder Suárez", "Pierre Weis", "Michel Mauny" ], "website": "https://caml.inria.fr", "standsFor": "Categorical abstract machine language", "country": [ "France" ], "originCommunity": [ "INRIA" ], "domainName": { "name": "caml.inria.fr" }, "related": [ "ocaml" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print_endline" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "# haar [1; 2; 3; 4; -4; -3; -2; -1];;\n - : int list = [0; 20; 4; 4; -1; -1; -1; -1]" ], "related": [ "ocaml", "ml", "f-sharp", "lisp", "c", "standard-ml" ], "summary": "Caml (originally an acronym for Categorical abstract machine language) is a multi-paradigm, general-purpose programming language which is a dialect of the ML programming language family. Caml was developed in France at INRIA and ENS. Like many descendants of ML, Caml is statically typed, strictly evaluated, and uses automatic memory management. OCaml, as of 2017 the main implementation of Caml, adds many features to the language, including an object layer.", "pageId": 2362118, "dailyPageViews": 84, "created": 2005, "backlinksCount": 31, "revisionCount": 124, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Caml" }, "leachim6": { "filepath": "c/CAML.ml", "fileExtensions": [ "ml" ], "example": [ "print_endline \"Hello World\";;\n" ], "id": "CAML" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Caml", "tiobe": { "id": "Caml" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1460", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Objective Caml Programming Language||Tim Rentsch|14474263|5.00|1|0\nFunctional programming using Caml Light||Michel Mauny|58185709|4.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n2010|LAP LAMBERT Academic Publishing|Creating High-Performance, Statically Type-Safe Network Applications: Domain-Specific Languages for constructing network applications using Objective Caml|Madhavapeddy, Anil|9783838355870\n2008|Abscissa Press|The Objective Caml Programming Language|Tim Rentsch|9780981599205", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2008|Caml trading – experiences with functional programming on Wall Street|10.1017/S095679680800676X|18|1|Y. Minsky and Stephen Weeks|44a9c723abf93c6237068cc853449598943699c7\n2008|Caml trading|10.1145/1328897.1328441|2|0|Y. Minsky|73c6801a4412becd2f1cf0536e9bf9381e565b39" }, "candor": { "title": "candor", "appeared": 2012, "type": "pl", "creators": [ "Fedor Indutny" ], "website": "http://candor-lang.org", "country": [ "United States" ], "originCommunity": [ "https://darksi.de/" ], "domainName": { "name": "candor-lang.org" }, "githubRepo": { "firstCommit": 2012, "stars": 175, "forks": 16, "subscribers": 14, "created": 2012, "updated": 2022, "description": "Experimental VM for a `Candor` language", "issues": 4, "url": "https://github.com/indutny/candor" }, "repoStats": { "firstCommit": 2012, "commits": 1008, "committers": 7, "files": 198 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n4717487|The Candor programing language - simplified JS|http://candor-lang.org/|2012-10-30 14:35:35 UTC|1351607735|fogus|0|1", "semanticScholar": "" }, "candy-codes": { "title": "Candy Codes", "appeared": 2022, "type": "barCodeFormat", "description": "CandyCodes: simple universally unique edible identifiers for confirming the authenticity of pharmaceuticals. A 3-D UID format.", "reference": [ "https://www.nature.com/articles/s41598-022-11234-4" ], "country": [ "United States" ], "originCommunity": [ "University of California, Riverside" ] }, "candy": { "title": "Candy", "appeared": 2020, "type": "pl", "creators": [ "Jonas Wanke", "Marcel Garus" ], "website": "https://github.com/candy-lang/Candy", "fileExtensions": [ "candy" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/candy-lang/" ], "example": [ "type = use \"..Type\"\nis value := type.is value Struct\nhasKey struct key :=\n needs (is struct)\n ✨.structHasKey struct key\ngetUnwrap struct key :=\n needs (is struct)\n needs (hasKey struct key)\n ✨.structGet struct key\ngetKeys struct :=\n needs (is struct)\n ✨.structGetKeys struct" ], "githubRepo": { "stars": 77, "forks": 1, "subscribers": 3, "created": 2020, "updated": 2022, "description": "A sweet programming language that is robust, minimalistic, and expressive.", "url": "https://github.com/candy-lang/Candy" }, "repoStats": { "firstCommit": 2020, "commits": 3655, "committers": 9, "files": 295 } }, "cane": { "title": "Cane", "appeared": 2022, "type": "musicalNotation", "creators": [ "Jack Clarke" ], "website": "https://github.com/Jackojc/cane", "country": [ "Ireland" ], "originCommunity": [ "Hopson Community" ], "githubRepo": { "firstCommit": 2022, "stars": 26, "forks": 3, "subscribers": 1, "created": 2022, "updated": 2022, "description": "A small MIDI sequencer DSL designed around vectors and euclidean rhythms", "issues": 7, "url": "https://github.com/Jackojc/cane" }, "repoStats": { "firstCommit": 2022, "commits": 225, "committers": 3, "files": 47 } }, "canon-capsl": { "title": "CaPSL", "appeared": 1989, "type": "pl", "reference": [ "https://books.google.com/books?id=WIeyaksLI8gC&pg=PT174&lpg=PT174&dq=canon+CaPSL&source=bl&ots=u6g2YFIG_Q&sig=V6dx8vmgwAPobt8DVmkYZfujmcU&hl=en&sa=X&ved=2ahUKEwjX_beW6JTfAhXqrlQKHeyZAUkQ6AEwB3oECAIQAQ#v=onepage&q=canon%20CaPSL&f=false" ], "country": [ "Japan" ], "originCommunity": [ "Canon Inc" ], "wikipedia": { "summary": "CaPSL is a printer command language/page description language used by early Canon printers including the LBP-8III series and supported on (at least) LBP-8IV printers. This language was discontinued, with later Canon printers implementing PCL. It was also called LIPS or LIPS4. A Windows Spool File could contain RAW CaPSL data.", "created": 2006, "backlinksCount": 4, "pageId": 6422417, "revisionCount": 25, "dailyPageViews": 2, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/CaPSL" }, "centralPackageRepositoryCount": 0 }, "cantor": { "title": "Cantor", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/832ef97843186ea175db8348768719664eab2fc5" ], "country": [ "United States" ], "originCommunity": [ "California Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1303", "centralPackageRepositoryCount": 0 }, "capn-proto": { "title": "Cap'n Proto", "appeared": 2013, "type": "idl", "creators": [ "Kenton Varda" ], "website": "https://capnproto.org/", "country": [ "United States and Portugal" ], "originCommunity": [ "Cap'n Proto" ], "domainName": { "registered": 2013, "awisRank": { "2022": 1586908 }, "name": "capnproto.org" }, "related": [ "protobuf" ], "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2013, "stars": 9043, "forks": 773, "subscribers": 317, "created": 2013, "updated": 2022, "description": "Cap'n Proto serialization/RPC system - core tools and C++ library", "issues": 172, "url": "https://github.com/capnproto/capnproto" }, "repoStats": { "firstCommit": 2013, "commits": 4833, "committers": 227, "files": 484 }, "githubLanguage": { "fileExtensions": [ "capnp" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.capnp", "repos": 134567, "id": "Cap'n Proto" }, "githubBigQuery": { "repos": 690, "users": 557, "id": "Cap'n Proto" }, "pygmentsHighlighter": { "filename": "capnproto.py", "fileExtensions": [ "capnp" ], "id": "Cap'n Proto" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 2, "commitCount": 2, "url": "https://github.com/textmate/capnproto.tmbundle" }, "twitter": "https://twitter.com/capnproto", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "capsl": { "title": "Common Authentication Protocol Specification Language", "appeared": 1996, "type": "pl", "description": "a high-level language to support security analysis of cryptographic authentication and key distribution protocols. It is translated to CIL, an intermediate language expressing state transitions with term-rewriting rules. Connectors are being written to adapt CIL to supply input to different security analysis tools, including PVS for inductive verification and Maude for model-checking.", "reference": [ "https://pdfs.semanticscholar.org/696d/b0556e653f96d0de57c5e6d1ca1634de08fb.pdf" ], "country": [ "United States" ], "originCommunity": [ "SRI International" ], "centralPackageRepositoryCount": 0 }, "capsule": { "title": "Capsule", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c073dc5be6ba3916ee929856348d7cab25f18b31" ], "country": [ "United States" ], "originCommunity": [ "Temple University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6992", "centralPackageRepositoryCount": 0 }, "capybara": { "title": "capybara", "appeared": 2009, "type": "library", "creators": [ "Jonas Nicklas", "Kevin Fitzpatrick" ], "website": "http://teamcapybara.github.io/capybara/", "country": [ "United States" ], "originCommunity": [ "teamcapybara" ], "githubRepo": { "firstCommit": 2009, "stars": 9606, "forks": 1413, "subscribers": 221, "created": 2009, "updated": 2022, "description": "Acceptance test framework for web applications", "issues": 21, "url": "https://github.com/teamcapybara/capybara" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "caramel": { "title": "Caramel", "appeared": 2020, "type": "pl", "creators": [ "Leandro Ostera" ], "website": "https://caramel.run/", "country": [ "Sweden" ], "originCommunity": [ "https://abstractmachines.dev" ], "githubRepo": { "firstCommit": 2020, "stars": 970, "forks": 24, "subscribers": 25, "created": 2020, "updated": 2022, "description": ":candy: a functional language for building type-safe, scalable, and maintainable applications", "issues": 20, "url": "https://github.com/AbstractMachinesLab/caramel" }, "repoStats": { "firstCommit": 2020, "commits": 688, "committers": 10, "files": 4120 } }, "carbon": { "title": "Carbon", "appeared": 2020, "type": "pl", "reference": [ "https://news.ycombinator.com/item?id=32151609" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/carbon-language" ], "example": [ "package Sorting api;\n\nfn Partition[T:! Comparable & Movable](s: Slice(T))\n -> i64 {\n var i: i64 = -1;\n\n for (e: T in s) {\n if (e <= s.Last()) {\n ++i;\n Swap(&s[i], &e);\n }\n }\n return i;\n}\n\nfn QuickSort[T:! Comparable & Movable](s: Slice(T)) {\n if (s.Size() <= 1) {\n return;\n }\n let p: i64 = Partition(s);\n QuickSort(s[:p - 1]));\n QuickSort(s[p + 1:]));\n}" ], "githubRepo": { "firstCommit": 2020, "stars": 1099, "forks": 21, "subscribers": 31, "created": 2020, "updated": 2022, "description": "Carbon language specification and documentation.", "issues": 94, "url": "https://github.com/carbon-language/carbon-lang" }, "repoStats": { "firstCommit": 2020, "commits": 1654, "committers": 117, "files": 3991 }, "compilerExplorer": { "example": [ "package sample api;\n\nfn Square(x: i32) -> i32 {\n return x * x;\n}\n\nfn Main() -> i32 {\n return Square(12);\n}\n" ], "id": "Carbon" } }, "carp": { "title": "carp", "appeared": 2016, "type": "pl", "creators": [ "Erik Svedäng" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/carp-lang" ], "writtenIn": [ "haskell" ], "isLisp": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": false }, "hasStaticTyping": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 4571, "forks": 158, "subscribers": 101, "created": 2016, "updated": 2022, "firstCommit": 2016, "description": "A statically typed lisp, without a GC, for real-time applications.", "issues": 129, "url": "https://github.com/carp-lang/carp" }, "repoStats": { "firstCommit": 2016, "commits": 5018, "committers": 77, "files": 411 }, "helloWorldCollection": [ ";; Hello world in Carp\n\n(println \"hello world\")" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|Comparison of Carp Rabin Algorithm and Jaro-Winkler Distance to Determine The Equality of Sunda Languages|10.1109/TSSA48701.2019.8985470|4|0|K. Manaf and S. Pitara and B. Subaeki and Rudy Gunawan and Rodiah and Bakhtiar|d97a39d51ab8f6e621839311d808181a0272a2b9\n2020|Scientific footprint of Indian major carp research in South Asia: a scientometric study between 1955 and 2018|10.1080/10454438.2020.1748787|1|0|Tharindu Bandara|d4d3c5b4139d3128df44d1286d6f8eaadafae523" }, "carpet": { "title": "Carpet", "appeared": 1997, "type": "pl", "creators": [ "Giandomenico Spezzano", "Domenico Talia" ], "description": "This paper describes CARPET, a high-level programming language based on the cellular automata model. CARPET is a programming language designed to support the development of parallel high performance software. It exploits the computing power of a highly parallel computer releasing a user from using explicit parallel constructs. A CARPET implementation has been used for programming cellular algorithms in the CAMEL parallel environment. By CARPET a user might write programs to describe the actions of thousands of simple active agents interacting locally, then the CAMEL environment allows a user to observe the global complex evolution that arises from their parallel execution and their local interactions.", "reference": [ "https://semanticscholar.org/paper/ca5c3e6a3f7e5223052fef1d626c6f29e4b6bc8a", "https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=ec6ea12f096627857637678555a968f40a94a6d1" ], "country": [ "Italy" ], "originCommunity": [ "University of Calabria" ], "example": [ "cadef\n{\ndimension 2;\nradius 1;\nstate (short which, rand, gas);\nneighbor Margolus[9]([1,0]East,[1,1]SE,[0,1]South,[-1,1]SO,\n [-1,0]West,[-1,-1]NW,[0,-1]North,[1,-1] NE,[1,0] East);\n}\n int i; short temp, temprand;\n{\nif((cell_which == 0 && step %2 == 1)||(cell_which == 3 && step % 2 == 0))\n { temprand = 0;\n for(i=0; i < 3; i++)\n temprand = temprand + Margolus_rand[i];\n temprand = temprand + cell_rand;\n if (temprand % 2 == 1)\n update(cell_gas, South_gas);\n else\n update(cell_gas, East_gas);\n } else\n if((cell_which == 1 && step % 2 == 1)||(cell_which == 2 && step % 2 == 0))\n { temprand = 0;\n for(i=2; i < 5; i++)\n temprand = temprand + Margolus_rand[i];\n temprand = temprand + cell_rand;\n if (temprand % 2 == 1)\n update(cell_gas, West_gas);\n else\n update(cell_gas, South_gas);\n } else\n if((cell_which == 3 && step %2 == 1)||(cell_which == 0 && step % 2 == 0))\n{ temprand = 0;\n for(i=4; i < 7; i++)\n temprand = temprand + Margolus_rand[i];\n temprand = temprand + cell_rand;\n if (temprand % 2 == 1)\n update(cell_gas, North_gas);\n else\n update(cell_gas, West_gas);\n } else\n { temprand = 0;\n for (i=6; i < 9; i++)\n temprand= temprand + Margolus_rand[i];\n temprand = temprand + cell_rand;\n if (temprand % 2 == 1)\n update(cell_gas, East_gas);\n else\n update(cell_gas, North_gas);\n }\n temp = (cell_rand + East_rand + North_rand + West_rand + South_rand ) % 2\n up" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6227", "wordRank": 5304, "centralPackageRepositoryCount": 0 }, "carth": { "title": "carth", "appeared": 2018, "type": "pl", "creators": [ "Johan Johansson" ], "description": "Purely functional programming with lisp-syntax. Less infix, more parens!", "website": "https://carth.jo.zone/", "country": [ "Sweden" ], "domainName": { "name": "carth.jo.zone" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ ";; Note that many of these functions are/will be in the standard\n;; library in some shape or form. We just include them all in the same\n;; file here to show off more of the syntax and features.\n\n;; ~start~ is the programs entrypoint\n(define (start _) (fizzbuzz unit))\n\n(define (fizzbuzz _)\n (for (range 1 100)\n (comp display fizzbuzz')))\n\n(define (fizzbuzz' n)\n (match (Pair (divisible? n 3) (divisible? n 5))\n (case (Pair false false) (my-show-int n))\n (case (Pair true false) \"Fizz\")\n (case (Pair false true) \"Buzz\")\n (case (Pair true true) \"Fizzbuzz\")))\n\n(define my-show-int\n (fun-match\n (case 1 \"one\")\n (case 2 \"two\")\n (case n (show-int n))))\n\n;; Apply an action to each element in an iterator\n(define (for xs f)\n (match (next xs)\n (case None unit)\n (case (Some (Pair x xs'))\n (seq (f x) (for xs' f)))))\n\n;; Iterator over the closed range $[a, b]$\n(define (range a b)\n (Iter (Lazy (if (> a b)\n (fun _ None)\n (fun _ (Some (Pair a (range (+ a 1) b))))))))\n\n;; Advances an iterator, returning the next value and the rest of the\n;; iterator\n(define (next (Iter it)) (lively it))\n\n;; An iterator / non-strict list\n(type (Iter a)\n (Iter (Lazy (Maybe (Pair a (Iter a))))))\n\n(define (lively (Lazy f))\n (f unit))\n\n;; A lazy, or rather a non-strict value\n(type (Lazy a)\n (Lazy (Fun Unit a)))\n\n(type (Maybe a)\n None\n (Some a))\n\n(define (seq a b)\n b)\n\n;; Function composition\n(define (comp f g a)\n (f (g a)))\n\n(define (divisible? n m)\n (= (rem n m) 0))\n\n(define (display s)\n (display-inline (str-append s \"\\n\")))\n\n;;; Currying wrappers\n\n(define (rem a b) (rem-int (Pair a b)))\n(define (= a b) (eq-int (Pair a b)))\n(define (> a b) (gt-int (Pair a b)))\n(define (+ a b) (add-int (Pair a b)))\n(define (str-append s1 s2) (-str-append (Pair s1 s2)))\n\n;;; External functions defined in the foreign-core library\n\n(extern show-int (Fun Int Str))\n(extern eq-int (Fun (Pair Int Int) Bool))\n(extern gt-int (Fun (Pair Int Int) Bool))\n(extern rem-int (Fun (Pair Int Int) Int))\n(extern add-int (Fun (Pair Int Int) Int))\n(extern display-inline (Fun Str Unit))\n(extern -str-append (Fun (Pair Str Str) Str))" ], "githubRepo": { "firstCommit": 2018, "stars": 20, "forks": 1, "subscribers": 2, "created": 2019, "updated": 2022, "description": "The Carth programming language. Mirror of https://sr.ht/~jojo/Carth/", "issues": 0, "url": "https://github.com/bryal/carth" }, "repoStats": { "firstCommit": 2018, "commits": 857, "committers": 4, "files": 142 } }, "cartocss": { "title": "CartoCSS", "appeared": 2010, "type": "pl", "reference": [ "https://blog.mapbox.com/the-end-of-cartocss-da2d7427cf1" ], "country": [ "United States" ], "originCommunity": [ "Mapbox" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubLanguage": { "fileExtensions": [ "mss" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.css.mss", "aliases": [ "Carto" ], "repos": 477, "id": "CartoCSS" }, "githubBigQuery": { "repos": 341, "users": 289, "id": "CartoCSS" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 2, "commitCount": 19, "sampleCount": 1, "example": [ "@marina-text: #576ddf; // also swimming_pool\n@wetland-text: darken(#017fff, 10%); /* Also for marsh */\n@mud-text: darken(#aea397, 20%);\n@shop-icon: #ac39ac;\n@transportation-icon: #0092da;\n@transportation-text: #0066ff;\n@airtransport: #8461C4;\n\n@landcover-font-size: 10;\n@landcover-font-size-big: 12;\n@landcover-font-size-bigger: 15;\n@landcover-wrap-width-size: 25;\n@landcover-wrap-width-size-big: 35;\n@landcover-wrap-width-size-bigger: 45;\n@landcover-face-name: @oblique-fonts;\n\n@standard-wrap-width: 30;\n\n.points {\n [feature = 'tourism_alpine_hut'][zoom >= 13] {\n point-file: url('symbols/alpinehut.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_shelter'][zoom >= 16] {\n point-file: url('symbols/shelter2.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_atm'][zoom >= 17] {\n point-file: url('symbols/atm2.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_bank'][zoom >= 17] {\n point-file: url('symbols/bank2.p.16.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_bar'][zoom >= 17] {\n point-file: url('symbols/bar.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'amenity_bicycle_rental'][zoom >= 17] {\n point-file: url('symbols/rental_bicycle.p.20.png');\n point-placement: interior;\n }\n\n [feature = 'highway_bus_stop'] {\n [zoom >= 16] {\n marker-file: url('symbols/square.svg');\n marker-fill: @transportation-icon;\n marker-placement: interior;\n marker-width: 6;\n }\n [zoom >= 17] {\n marker-file: url('symbols/bus_stop.p.12.png');\n marker-width: 12;\n }\n }\n\n [feature = 'amenity_bus_station'][zoom >= 16] {\n point-file: url('symbols/bus_station.n.16.png');\n point-placement: interior;\n }\n\n [feature = 'highway_traffic_signals'][zoom >= 17] {\n marker-file: url('symbols/traffic_light.svg');\n marker-fill: #0a0a0a;\n marker-placement: interior;\n }\n\n [feature = 'amenity_cafe'][zoom >= 17] {\n point-file: url('symbols/cafe.p.1" ], "url": "https://github.com/yohanboniface/carto-atom" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "casio-basic": { "title": "Casio BASIC", "appeared": 2006, "type": "pl", "country": [ "Japan" ], "originCommunity": [ "Casio Computer Co., Ltd" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "basic" ], "summary": "Casio BASIC is a programming language used in the Casio calculators such as the Classpad, fx-9860G Series, and CFX graphing calculators. The language is a linear structured, BASIC-based programming language. It was devised to allow users to program in commonly performed calculations, such as the Pythagorean theorem and complex trigonometric calculations. Output from the program can be in the form of scrolling or located text, graphs, or by writing data to lists in the calculator memory. Casio also makes label printers which can be used with rolls of paper for the Casio BASIC calculators, and programmes, variables, data, and other items can be exchanged from one calculator to another and to and from a computer via the same kind of cable and audio-type plug used by the TI graphing calculators and/or the same type of cable and mini-USB plug used on HP calculators from the HP48 and many cellular telephones; several models of Casio graphing calculators have both portsThe Casio calculators, as with those of many of the other big three manufacturers' machines, can acquire data from instruments via a data logger to which probes for temperature, light intensity, pH, sound intensity (dBA), voltage and other electrical parameters, as well as other readings, and custom probes to attach to the data logger can be built and configured for use with the data logger and calculator. Existing instruments can also be modified to interface with the calculator-data logger, in order to collect such data including such things as weather instruments and means of collecting data such as pulse, blood pressure, galvanic skin resistance, EKG and so on. Numerical data can be stored in the lists and matrices available on Casio calculators. This data can be used to create sprites for non-text programs. In this way, the language can also be used to create games, such as Pong, Monopoly and role-playing games.", "created": 2006, "backlinksCount": 100, "pageId": 6475278, "revisionCount": 57, "dailyPageViews": 26, "url": "https://en.wikipedia.org/wiki/Casio_BASIC" }, "leachim6": { "filepath": "c/Casio BASIC", "example": [ "\"Hello World\"\n" ], "id": "Casio BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "cassandre": { "title": "CASSANDRE", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0dbf87aac61698a5f2919252902aa89c1f42b158" ], "country": [ "France" ], "originCommunity": [ "Université Grenoble Alpes" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3011", "centralPackageRepositoryCount": 0 }, "cat": { "title": "cat", "appeared": 2016, "type": "pl", "creators": [ "Christopher Diggins" ], "description": "Cat is a higher-order stack-oriented language.", "reference": [ "https://web.archive.org/web/20150205061802/http://cat-language.com/tutorial.html" ], "country": [ "Canada" ], "example": [ "1 1 +\neq 2\n[\"As I expected!\"]\n[\"I need to be repaired!\"]\nif" ], "githubRepo": { "firstCommit": 2016, "stars": 185, "forks": 10, "subscribers": 9, "created": 2016, "updated": 2022, "description": "Cat - a statically typed functional stack-based programming language ", "issues": 4, "url": "https://github.com/cdiggins/cat-language" }, "repoStats": { "firstCommit": 2016, "commits": 14, "committers": 2, "files": 428 }, "leachim6": { "filepath": "c/cat.cat", "fileExtensions": [ "cat" ], "example": [ "Hello World\n" ], "id": "cat" }, "rijuRepl": { "example": [ "72 101 108 108 111 44 32 119 111 114 108 100 33 10\n" ], "description": "Statically typed stack-based programming language in C#", "fileExtensions": [ "cat" ], "gitRepo": "https://github.com/cdiggins/cat-language", "id": "https://riju.codes/cat" } }, "catala": { "title": "Catala", "appeared": 2019, "type": "pl", "creators": [ "Denis Merigoux" ], "website": "https://catala-lang.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/CatalaLang" ], "domainName": { "registered": 2020, "name": "catala-lang.org" }, "example": [ "scope QualifiedEmployeeDiscount :\n definition qualified_employee_discount\n under condition is_property consequence\n equals\n if employee_discount >$\n customer_price ×$ gross_profit_percentage\n then customer_price ×$ gross_profit_percentage\n else employee_discount" ], "githubRepo": { "firstCommit": 2019, "stars": 846, "forks": 38, "subscribers": 18, "created": 2020, "updated": 2022, "description": "Programming language for literate programming law specification", "issues": 56, "url": "https://github.com/CatalaLang/catala" }, "repoStats": { "firstCommit": 2019, "commits": 3398, "committers": 54, "files": 651 } }, "catalysis": { "title": "Catalysis", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bf36bc3c33b51e1853cb99c30591712559137cff" ], "country": [ "United States" ], "originCommunity": [ "Platinum Technology Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5691", "centralPackageRepositoryCount": 0 }, "categorical-query-language": { "title": "categorical-query-language", "appeared": 2019, "type": "queryLanguage", "website": "https://www.categoricaldata.net/", "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/CategoricalData", "https://www.categoricaldata.net/" ], "domainName": { "registered": 2012, "name": "categoricaldata.net" }, "githubRepo": { "firstCommit": 2019, "stars": 243, "forks": 16, "subscribers": 26, "created": 2019, "updated": 2022, "description": "Categorical Query Language IDE", "issues": 39, "url": "https://github.com/CategoricalData/CQL" }, "repoStats": { "firstCommit": 2019, "commits": 110, "committers": 6, "files": 927 }, "isbndb": "" }, "cayenne": { "title": "Cayenne", "appeared": 1998, "type": "pl", "country": [ "Sweden" ], "originCommunity": [ "Chalmers University of Technology" ], "wikipedia": { "example": [ "PrintfType :: String -> #\nPrintfType (Nil) = String\nPrintfType ('%':('d':cs)) = Int -> PrintfType cs\nPrintfType ('%':('s':cs)) = String -> PrintfType cs\nPrintfType ('%':( _ :cs)) = PrintfType cs\nPrintfType ( _ :cs) = PrintfType cs\n\naux :: (fmt::String) -> String -> PrintfType fmt\naux (Nil) out = out\naux ('%':('d':cs)) out = \\ (i::Int) -> aux cs (out ++ show i)\naux ('%':('s':cs)) out = \\ (s::String) -> aux cs (out ++ s)\naux ('%':( c :cs)) out = aux cs (out ++ c : Nil)\naux (c:cs) out = aux cs (out ++ c : Nil)\n\nprintf :: (fmt::String) -> PrintfType fmt\nprintf fmt = aux fmt Nil" ], "related": [ "agda", "dependent-ml", "haskell" ], "summary": "Cayenne is a dependently typed functional programming language created by Lennart Augustsson in 1998, making it one of the earliest dependently type programming language (as opposed to proof assistant or logical framework). A notable design decision is that the language allows unbounded recursive functions to be used on the type level, making type checking undecidable. Most dependently typed proof assistants and later dependently typed languages such as Agda included a termination checker to prevent the type checker from looping, while the contemporary Dependent ML restricted the expressivity of the type-level language to maintain decidability. There are very few building blocks in the language, but much syntactic sugar to make it more readable. The basic types are functions, products, and sums. Functions and products use dependent types to gain additional power. The syntax is largely borrowed from Haskell. There is no special module system, because with dependent types records (products) are powerful enough to define modules. The Cayenne implementation was written in Haskell, and it also translated to Haskell, but is currently no longer being maintained.", "pageId": 6528823, "created": 2006, "backlinksCount": 18, "revisionCount": 35, "dailyPageViews": 11, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Cayenne_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5746", "fileType": "text", "centralPackageRepositoryCount": 0 }, "cayley": { "title": "CAYLEY", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6300a0277cbcfc161ac7df82f59da26aa14c9ce2" ], "country": [ "Australia" ], "originCommunity": [ "University of Sydney" ], "hopl": "https://hopl.info/showlanguage.prx?exp=710", "centralPackageRepositoryCount": 0 }, "cbasic": { "title": "CBASIC", "appeared": 1982, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Naval Postgraduate School" ], "wikipedia": { "related": [ "pl-m", "basic", "mbasic" ], "summary": "CBASIC is a compiled version of the BASIC programming language written for the CP/M operating system by Gordon Eubanks in 1976–1977. It is an enhanced version of BASIC-E.", "created": 2006, "backlinksCount": 38, "pageId": 6900131, "revisionCount": 49, "dailyPageViews": 11, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/CBASIC" }, "centralPackageRepositoryCount": 0 }, "cbor": { "title": "CBOR", "appeared": 2013, "type": "binaryDataFormat", "website": "https://cbor.io/", "country": [ "Germany and United States" ], "originCommunity": [ "Technologie-Zentrum Informatik und Informationstechnik", "The Internet Corporation for Assigned Names and Numbers" ], "domainName": { "registered": 2013, "awisRank": { "2022": 5982331 }, "name": "cbor.io" }, "wikipedia": { "summary": "CBOR (Concise Binary Object Representation) is a binary data serialization format loosely based on JSON. Like JSON it allows the transmission of data objects that contain name–value pairs, but in a more concise manner. This increases processing and transfer speeds at the cost of human-readability. It is defined in IETF RFC 7049.Amongst other uses, it is the recommended data serialization layer for the CoAP Internet of Things protocol suite and the data format on which COSE messages are based. It is also used in the Client-to-Authenticator Protocol (CTAP) within the scope of the FIDO2 project.", "backlinksCount": 41, "pageId": 51407038, "dailyPageViews": 96, "url": "https://en.wikipedia.org/wiki/CBOR" } }, "ccal": { "title": "CCal", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/402a2cb76c48fcf8c851859c5a3781ea78fcc3e3" ], "country": [ "United States" ], "originCommunity": [ "The College of William and Mary", "Tartan Laboratories", "University of Pittsburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3796", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ccd": { "title": "Continuity of Care Document", "appeared": 2008, "type": "xmlFormat", "country": [ "United States" ], "originCommunity": [ "Health Level Seven International" ], "wikipedia": { "summary": "The Continuity of Care Document (CCD) specification is an XML-based markup standard intended to specify the encoding, structure, and semantics of a patient summary clinical document for exchange.", "backlinksCount": 27, "pageId": 18486702, "dailyPageViews": 62, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Continuity_of_Care_Document" }, "isbndb": "" }, "ccel": { "title": "CCEL", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0800cd350021b6aa17a0036357fdd2d04a2a7066" ], "country": [ "United States" ], "originCommunity": [ "Brown University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2093", "centralPackageRepositoryCount": 0 }, "ccr": { "title": "Continuity of Care Record", "appeared": 2007, "type": "xmlFormat", "country": [ "United States" ], "originCommunity": [ "ASTM International", "Massachusetts Medical Society", "Healthcare Information", "Management Systems Society", "American Academy of Family Physicians", "American Academy of Pediatrics" ], "wikipedia": { "summary": "Continuity of Care Record (CCR) is a health record standard specification developed jointly by ASTM International, the Massachusetts Medical Society (MMS), the Healthcare Information and Management Systems Society (HIMSS), the American Academy of Family Physicians (AAFP), the American Academy of Pediatrics (AAP), and other health informatics vendors.", "backlinksCount": 66, "pageId": 2698482, "dailyPageViews": 19, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Continuity_of_Care_Record" } }, "ccs": { "title": "CCS", "appeared": 1999, "type": "pl", "description": "CCS is a proprietary scripting language for executing sequences of command-line interface (CLI) commands on NetMRI-supported network devices, to perform job automation tasks. If you know Cisco IOS, writing CCS scripts is relatively straightforward.", "reference": [ "https://www.infoblox.com/wp-content/uploads/infoblox-eval-download-netmri-NetMRI_CCS_Scripting_Guide.pdf" ], "country": [ "United States" ], "originCommunity": [ "Infoblox Inc" ], "example": [ "Script-Filter:\n$Vendor eq \"Cisco\" and\n$sysDescr like /IOS/ and\n$Version like /^1[2-9]/ and\n$Type in ['Router', 'Switch-Router']]" ] }, "cda": { "title": "Clinical Document Architecture", "appeared": 1996, "type": "xmlFormat", "country": [ "United States" ], "originCommunity": [ "Health Level Seven International" ], "wikipedia": { "summary": "The HL7 Clinical Document Architecture (CDA) is an XML-based markup standard intended to specify the encoding, structure and semantics of clinical documents for exchange. In November 2000, HL7 published Release 1.0. The organization published Release 2.0 with its \"2005 Normative Edition.\"", "backlinksCount": 47, "pageId": 4684004, "dailyPageViews": 57, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Clinical_Document_Architecture" } }, "cddl": { "title": "CBOR data definition language", "appeared": 2017, "type": "idl", "description": "Concise Data Definition Language (CDDL): A Notational Convention to Express Concise Binary Object Representation (CBOR) and JSON Data Structures", "reference": [ "https://tools.ietf.org/html/draft-ietf-cbor-cddl-00" ], "standsFor": "CBOR data definition language", "country": [ "Germany" ], "originCommunity": [ "Fraunhofer-Institut für Sichere Informationstechnologie SIT", "Technologie-Zentrum Informatik und Informationstechnik" ], "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "example": [ "pii = (\n age: int,\n name: tstr,\n employer: tstr,\n)" ], "pygmentsHighlighter": { "filename": "cddl.py", "fileExtensions": [ "cddl" ], "id": "CDDL" } }, "cdf": { "title": "Common Data Format", "appeared": 1985, "type": "binaryDataFormat", "standsFor": "Common Data Format", "country": [ "United States" ], "originCommunity": [ "NASA" ], "wikipedia": { "related": [ "hdf" ], "summary": "Common Data Format (CDF) is a library and toolkit that was developed by the National Space Science Data Center (NSSDC) at NASA starting in 1985. The software is an interface for the storage and manipulation of multi-dimensional data sets.", "pageId": 635458, "created": 2004, "backlinksCount": 18, "revisionCount": 35, "dailyPageViews": 18, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Common_Data_Format" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "cdl": { "title": "CDL", "appeared": 1995, "type": "pl", "creators": [ "Christian Hochberger" ], "description": "A Language for Cellular Processing. Our goal is to describe complex cellular automata in a concise and readable way.", "reference": [ "https://doi.org/10.1007/3-540-60222-4\\_107" ], "country": [ "Germany" ], "originCommunity": [ "Technische Universität Darmstadt" ] }, "cdlpp": { "title": "CDL++", "appeared": 1999, "type": "pl", "creators": [ "Christian Hochberger" ], "reference": [ "https://semanticscholar.org/paper/d2eb641aeddd364f5180b30421d7dc22bcf3788b" ], "country": [ "Germany" ], "originCommunity": [ "Technische Universität Darmstadt" ], "successorOf": [ "cdl" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6254", "centralPackageRepositoryCount": 0 }, "cecil": { "title": "CECIL", "appeared": 1992, "type": "pl", "creators": [ "Craig Chambers" ], "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "wikipedia": { "related": [ "objective-c", "modula-3", "self", "cesil" ], "summary": "Cecil is a pure object-oriented programming language that was developed by Craig Chambers at the University of Washington in 1992 to be part of the Vortex project there. Cecil has many similarities to other object-oriented languages, most notably Objective-C, Modula-3, and Self. The main goals of the project were extensibility, orthogonality, efficiency, and ease-of-use. The language supports multiple dispatch and multimethods, dynamic inheritance, and optional static type checking. Unlike most other OOP systems, Cecil allows subtyping and code inheritance to be used separately, allowing run-time or external extension of object classes or instances. Like Objective-C, all object services in Cecil are invoked by message passing, and the language supports run-time class identification. These features allow Cecil to support dynamic, exploratory programming styles. Parameterized types and methods (generics, polymorphism), garbage collection, and delegation are also supported. Cecil also supports a module mechanism for isolating independent libraries or packages. Cecil does not presently support threads or any other form of concurrency. A standard library for Cecil is also available and includes various collection, utility, system, I/O, and GUI classes. The Diesel language was the successor of Cecil.There was also an assembler type language known as Cesil (Computer Education in Schools Instructional Language) used in the late-1970s developed by ICL. It was quite similar to the later language MASM.", "pageId": 527946, "created": 2004, "backlinksCount": 13, "revisionCount": 55, "dailyPageViews": 11, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Cecil_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Cecil", "hopl": "https://hopl.info/showlanguage.prx?exp=1720", "fileType": "text", "centralPackageRepositoryCount": 0 }, "cedar-fortran": { "title": "Cedar Fortran", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/af2c750cd758849aa071cb1bbaa9c222b5be400b" ], "country": [ "United States" ], "originCommunity": [ "The University of Illinois Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7026", "centralPackageRepositoryCount": 0 }, "cedar": { "title": "Cedar", "appeared": 1983, "type": "pl", "description": "The Cedar language is a programming language derived from Mesa, which in turn is derived from Pascal. It is meant to be used for a wide variety of programming tasks, ranging from low level systems software to large applications. In addition to the sequential control constructs, static type checking and structured types of Pascal, and the modules, exception handling, and concurrency control constructs of Mesa, Cedar also has garbage collection, dynamic types, and a limited form of type parameterization.", "reference": [ "https://www.microsoft.com/en-us/research/publication/description-cedar-language/" ], "originCommunity": [ "Xerox PARC" ], "supersetOf": [ "mesa" ] }, "ceemac": { "title": "CEEMAC", "appeared": 1980, "type": "pl", "creators": [ "Brooke Boering" ], "country": [ "United States" ], "originCommunity": [ "Vagabondo Enterprises" ], "wikipedia": { "example": [ "SCORE: KT\n \t\t\t:FIRE ORGAN KEY T\n \t\t\tSPEED [0,0]\n \t\t\t: - BUT 0\n \t\t\t0\n \t\t\tCLEAR [0,0]\n \t\t\tXY1 = $80;$80\n \t\t\t: MAIN LOOP\n \t\t\tF\n \t\t\t:FORGND SYMMETRY 0-3\n \t\t\tVC = RND3 ORA 3\n \t\t\t: SAVE FORGND ROTATION\n \t\t\tVD = ROTEZ\n \t\t\t:FORGND COLOR\n \t\t\tCOLOR = NXTCOL" ], "related": [ "basic", "pascal" ], "summary": "CEEMAC is a programming language developed in the 1980s for the Apple II family of computers. It was authored by Brooke Boering and published by Vagabondo Enterprises,CEEMAC was designed to be a visual composition language in which the programmer designed dynamic \"scores\" by programatically controlling color, shape, sound and movement. Additionally, a programmer could then \"perform\" their score through use of the Apple II keyboard or paddle input devices to introduce additional variation.CEEMAC syntax loosely resembled a combination of BASIC and Pascal and include control commands such as GOTO, GOSUB, DO, AGAIN, FOR, SKIP, EXIT and loop control structures such as IF/WHILE and TIL/UNLESS. Additionally, 30 predefined macros were included in CEEMAC to aid in score composition.The following is a small CEEMAC sample score: \t\t SCORE: KT \t\t\t:FIRE ORGAN KEY T \t\t\tSPEED [0,0] \t\t\t: - BUT 0 \t\t\t0 \t\t\tCLEAR [0,0] \t\t\tXY1 = $80;$80 \t\t\t: MAIN LOOP \t\t\tF \t\t\t:FORGND SYMMETRY 0-3 \t\t\tVC = RND3 ORA 3 \t\t\t: SAVE FORGND ROTATION \t\t\tVD = ROTEZ \t\t\t:FORGND COLOR \t\t\tCOLOR = NXTCOL CEEMAC was originally marketed through distribution of a free demonstration program entitled Fire Organ. This program contained several scores create by Boering and other programmers to demonstrate some of the capabilities of the language.", "created": 2011, "backlinksCount": 3, "pageId": 30646029, "revisionCount": 17, "dailyPageViews": 3, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/CEEMAC" }, "centralPackageRepositoryCount": 0 }, "celip": { "title": "CELIP", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a7fed1aa9ac988b98f9e945e45a9fa3d78bd4d79" ], "country": [ "Germany" ], "originCommunity": [ "University of Duisburg-Essen" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1539", "centralPackageRepositoryCount": 0 }, "cell": { "title": "Cell", "appeared": 2017, "type": "pl", "description": "Cell is a very high-level embeddable language. Cell's data model combines a staple of functional programming, algebraic data types, with relations and other ideas from relational databases.", "website": "http://cell-lang.net/", "country": [ "Various" ], "originCommunity": [ "https://github.com/cell-lang" ], "domainName": { "registered": 2017, "awisRank": { "2017": 2019201, "2022": 3568675 }, "name": "cell-lang.net" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "type AddUser = add_user(\n id: UserId,\n username: String,\n signup_date: Date,\n first_name: String,\n last_name: String,\n date_of_birth: Date?\n);\n\nOnlineForum.AddUser {\n id = self.id;\n // Inserting the new user id and setting all the mandatory attributes\n insert user(id),\n username(id, self.username),\n first_name(id, self.first_name),\n last_name(id, self.last_name),\n signup_date(id, self.signup_date);\n // Setting the date_of_birth attribute, if available\n insert date_of_birth(id, self.date_of_birth) if self.date_of_birth?;\n}", "reactive Thermostat {\n input:\n temperature: Float;\n\n output:\n on: Bool;\n\n state:\n // When the system is initialized, on is true if\n // and only if the current temperature exceeds 28°C\n on: Bool = temperature > 28.0;\n\n rules:\n // Switching on the air conditioner when\n // the temperature exceeds 28°C\n on = true when temperature > 28.0;\n\n // Switching it off when it falls below 24°C\n on = false when temperature < 24.0;\n}" ], "githubRepo": { "stars": 98, "forks": 2, "subscribers": 9, "created": 2017, "updated": 2022, "description": "Cell compiler", "issues": 1, "url": "https://github.com/cell-lang/compiler" }, "repoStats": { "firstCommit": 2017, "commits": 560, "committers": 2, "files": 130 }, "twitter": "https://twitter.com/cell_lang", "fileType": "text", "wordRank": 695, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|Prentice Hall|Programming the Cell Processor: For Games, Graphics, and Computation|Scarpino, Matthew|9780136008866\n2004|Morgan Kaufmann|The Mobile Connection: The Cell Phone's Impact on Society (Interactive Technologies)|Ling, Rich|9781558609365\n2008|Wiley-Interscience|Chemical and Functional Genomic Approaches to Stem Cell Biology and Regenerative Medicine||9780470041468\n1986|Cambridge University Press|Embryogenesis In Angiosperms: A Developmental And Experimental Study (developmental And Cell Biology Series)|Valayamghat Raghavan|9780521267717\n1995|Springer|Formal Development of Reactive Systems: Case Study Production Cell (Lecture Notes in Computer Science (891))||9783540588672\n2008|Morgan Kaufmann|In Silico: 3D Animation and Simulation of Cell Biology with Maya and MEL (The Morgan Kaufmann Series in Computer Graphics)|Sharpe, Jason and Lumsden, Charles John and Woolridge, Nicholas|9780123736550\n20070723|Springer Nature|A Computer Scientist's Guide to Cell Biology|William W. Cohen|9780387482781\n1975|Springer-verlag|Cell Cycle And Cell Differentiation (results And Problems In Cell Differentiation, Volume 7)|J Holtzer and H Reinert|9780387070698\n2009|Humana|Regulatory Networks in Stem Cells (Stem Cell Biology and Regenerative Medicine)|Farit G. Avkhadiev; Karl-Joachim Wirths|9781603272278" }, "cellsim": { "title": "CELLSIM", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/240e8bdc17c675b63f9e88f0cfe324dd0a7e448c" ], "country": [ "United States" ], "originCommunity": [ "Industrial Engineering Department" ], "hopl": "https://hopl.info/showlanguage.prx?exp=672", "centralPackageRepositoryCount": 0 }, "celsius-webscript": { "title": "Celsius WebScript", "appeared": 2006, "type": "pl", "reference": [ "http://celsiusws.sourceforge.net/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8678", "centralPackageRepositoryCount": 0 }, "ceprol": { "title": "Ceprol", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c636f2417d3a94e744853d7d4318bbc665a9bf87" ], "country": [ "Germany" ], "originCommunity": [ "Technical University of Braunschweig" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6229", "centralPackageRepositoryCount": 0 }, "cesil": { "title": "Cesil", "appeared": 1974, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "International Computers Limited" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "PRINT" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "LOAD 0\nLOOP STORE TOTAL\n IN\n JINEG DONE\n ADD TOTAL\n JUMP LOOP\n\nDONE PRINT \"The total is: \"\n LOAD TOTAL\n OUT\n LINE\n HALT\n\n %\n 1\n 2\n 3\n -1\n\n[Output of above program running...] \n The total is: 6" ], "related": [ "assembly-language" ], "summary": "Cesil, or Computer Education in Schools Instruction Language, was a programming language designed to introduce pupils in British schools to Assembly language. It is a low level language containing a total of fourteen instructions: Load value - place the immediate value or the contents of the variable named in the accumulator. Store variable - place the contents of the accumulator in the variable. Jump label - transfer control to location labelled. Jineg label - transfer control to location labelled if the accumulator contains a negative value. Jizero label - transfer control to location labelled if the accumulator contains zero. Print literal - output the following string, delimited by single quotes. Line - output a carriage return In - allow user to input a numerical value from the console. Out - Output the contents of the accumulator as a decimal integer, signed if negative. Add value - add the variable or immediate integer value to the accumulator. Subtract value - subtract the variable or immediate integer from the accumulator. Multiply value - place the product of the accumulator and the variable or immediate integer in the accumulator. Divide value - place the contents of the accumulator divided by the value in the accumulator. Halt - return control to console.", "created": 2016, "backlinksCount": 3, "pageId": 2834686, "revisionCount": 1, "dailyPageViews": 3, "url": "https://en.wikipedia.org/wiki/Cesil" }, "leachim6": { "filepath": "c/CESIL.cesil", "fileExtensions": [ "cesil" ], "example": [ " PRINT \"Hello World\"\n HALT\n%\n*" ], "id": "CESIL" }, "centralPackageRepositoryCount": 0 }, "ceu": { "title": "Céu", "appeared": 2011, "type": "pl", "creators": [ "Francisco Sant'Anna" ], "website": "http://www.ceu-lang.org", "reference": [ "http://www.ceu-lang.org/chico/ceu_sensys11.pdf" ], "country": [ "Brazil" ], "originCommunity": [ "Pontifical Catholic University of Rio de Janeiro" ], "domainName": { "registered": 2012, "name": "ceu-lang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "_printf" ] ], "example": [ "input int KEY; \npar/or do \n every 1s do \n _printf(\"Hello World!\\n\"); \n end \nwith \n await KEY; \nend" ], "githubRepo": { "stars": 1, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "url": "https://github.com/fsantanna/ceu" }, "repoStats": { "firstCommit": 2022, "commits": 342, "committers": 2, "files": 57 } }, "ceylon": { "title": "Ceylon", "appeared": 2011, "type": "pl", "creators": [ "Gavin King" ], "website": "http://ceylon-lang.org", "documentation": [ "https://ceylon-lang.org/documentation/current/" ], "originCommunity": [ "Red Hat" ], "domainName": { "registered": 2011, "awisRank": { "2017": 1029547 }, "name": "ceylon-lang.org" }, "writtenIn": [ "java" ], "runsOnVm": [ "jvm" ], "hasOperatorOverloading": { "example": "", "value": true }, "hasStaticTyping": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "// #([0-9a-fA-F]{4})(_[0-9a-fA-F]{4})+", "value": true }, "hasFloats": { "example": "// \\d{1,3}(_\\d{3})+\\.\\d{1,3}(_\\d{3})+[kMGTPmunpf]?", "value": true }, "hasIntegers": { "example": "// \\d{1,3}(_\\d{3})+[kMGTP]?", "value": true }, "hasBinaryNumbers": { "example": "// \\$([01]{4})(_[01]{4})+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 387, "forks": 64, "subscribers": 41, "created": 2015, "updated": 2022, "firstCommit": 2017, "description": "The Ceylon compiler, language module, and command line tools", "issues": 1027, "url": "https://github.com/eclipse/ceylon" }, "repoStats": { "firstCommit": 2017, "commits": 40307, "committers": 12, "files": 13362 }, "wikipedia": { "example": [ "/* The classic Hello World program */\nshared void run() {\n print(\"Hello, World!\");\n}" ], "related": [ "jvm", "javascript", "java", "scala", "smalltalk", "ml", "lisp", "maven-pom", "typescript", "dart", "fantom" ], "summary": "Ceylon is an object-oriented, strongly statically typed programming language with an emphasis on immutability, created by Red Hat. Ceylon programs run on the Java virtual machine (JVM), and can be compiled to JavaScript. The language design focuses on source code readability, predictability, toolability, modularity, and metaprogrammability. Important features of Ceylon include: A type system enforcing null safety and list element existence at compile time Regular syntax and semantics, avoiding special cases and primitively-defined constructs in favor of syntactic sugar Support for generic programming and metaprogramming, with reified generics Modularity built into the language, based on JBoss modules, interoperable with OSGi and Maven powerful tools, including an Eclipse-based IDE The name \"Ceylon\" is an oblique reference to Java, in that Java and Sri Lanka, formerly known as Ceylon, are islands known for growth and export of coffee and tea. In August 2017, Ceylon was donated to the Eclipse Foundation.", "pageId": 31483631, "dailyPageViews": 72, "created": 2011, "backlinksCount": 33, "revisionCount": 218, "appeared": 2011, "fileExtensions": [ "ceyloncite", "web" ], "url": "https://en.wikipedia.org/wiki/Ceylon_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ceylon" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.ceylon", "repos": 336, "id": "Ceylon" }, "githubBigQuery": { "repos": 167, "users": 85, "id": "Ceylon" }, "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "ceylon" ], "id": "Ceylon" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 6, "commitCount": 29, "sampleCount": 1, "example": [ "\"Test function for Ceylon\"\nby (\"Enrique\")\nshared void test() {\n print(\"test\");\n}\n\n\"Test class for Ceylon\"\nshared class Test(name) satisfies Comparable {\n shared String name;\n shared actual String string = \"Test ``name``.\";\n\n shared actual Comparison compare(Test other) {\n return name<=>other.name;\n }\n}\n" ], "url": "https://github.com/jeancharles-roger/ceylon-sublimetext" }, "languageServerProtocolProject": [ "https://github.com/jvasileff/vscode-ceylon\nwrittenIn ceylon" ], "projectEuler": { "memberCount": { "2019": 5, "2022": 8 }, "id": "Ceylon" }, "helloWorldCollection": [ "// Hello world in Ceylon\n\nprint(\"Hello, World!\");" ], "leachim6": { "filepath": "c/Ceylon.ceylon", "fileExtensions": [ "ceylon" ], "example": [ "shared void hello() {\n print(\"Hello World\");\n}\n" ], "id": "Ceylon" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Ceylon", "rijuRepl": { "example": [ "shared void run() {\n print(\"Hello, world!\");\n}\n" ], "description": "Object-oriented, strongly statically typed programming language with an emphasis on immutability, created by Red Hat", "fileExtensions": [ "ceylon" ], "website": "https://ceylon-lang.org/", "gitRepo": "https://ceylon-lang.org/code/source/", "id": "https://riju.codes/ceylon" }, "tryItOnline": "ceylon", "tiobe": { "id": "Ceylon" }, "twitter": "https://twitter.com/ceylonlang", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "cfengine": { "title": "CFEngine", "appeared": 1993, "type": "application", "website": "https://cfengine.com", "country": [ "Norway" ], "originCommunity": [ "Oslo University" ], "domainName": { "registered": 2001, "awisRank": { "2022": 1520855 }, "name": "cfengine.com" }, "example": [ "#!/var/cfengine/bin/cf-agent --no-lock\nbody common control\n{\n bundlesequence => { \"hello_world\" };\n}\n\nbundle agent hello_world\n{\n reports:\n\n any::\n\n \"Hello World!\";\n\n}" ], "wikipedia": { "related": [ "linux", "solaris", "puppet" ], "summary": "CFEngine is an open source configuration management system, written by Mark Burgess. Its primary function is to provide automated configuration and maintenance of large-scale computer systems, including the unified management of servers, desktops, consumer and industrial devices, embedded networked devices, mobile smartphones, and tablet computers.", "pageId": 1109117, "created": 2004, "backlinksCount": 34, "revisionCount": 273, "dailyPageViews": 56, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/CFEngine" }, "leachim6": { "filepath": "c/CFEngine.cf", "fileExtensions": [ "cf" ], "example": [ "body common control\n{\n bundlesequence => { \"run\" };\n}\n\nbundle agent run\n{\n reports:\n cfengine::\n \"Hello World\";\n}\n" ], "id": "CFEngine" }, "twitter": "https://twitter.com/cfengine", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nA System Engineer's Guide to Host Configuration and Maintenance using Cfengine (SAGE Short Topics in System Administration, #16)|2007|Mark Burgess|15031383|0.0|0|0" }, "cfml": { "title": "CFML", "appeared": 1995, "type": "pl", "creators": [ "Jeremy Allaire" ], "website": "http://www.adobe.com/products/coldfusion", "standsFor": "ColdFusion Markup Language", "country": [ "United States and Switzerland", "United States" ], "originCommunity": [ "Adobe Systems", "Lucee Association", "New Atlanta", "openBD", "The Railo Company" ], "hasConstructors": { "example": "component {\n // properties\n property name=\"cheeseName\";\n \n // constructor\n function Cheese init( required string cheeseName ) {\n variables.cheeseName = arguments.cheeseName;\n return this;\n }\n}", "value": true }, "wikipedia": { "example": [ "" ], "related": [ "coldfusion", "java", "cfscript", "javascript", "xml", "java-server-pages", "soap" ], "summary": "ColdFusion Markup Language, more commonly known as CFML, is a scripting language for web development that runs on the JVM, the .NET framework, and Google App Engine. Multiple commercial and open source implementations of CFML engines are available, including Adobe ColdFusion, Lucee, New Atlanta BlueDragon (who makes both a Java-based and a .NET-based version), Railo, and Open BlueDragon as well as other CFML server engines.", "pageId": 962933, "dailyPageViews": 105, "created": 2004, "backlinksCount": 75, "revisionCount": 257, "appeared": 1995, "fileExtensions": [ "cfm", "cfc" ], "url": "https://en.wikipedia.org/wiki/ColdFusion_Markup_Language" }, "tiobe": { "id": "CFML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5234", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011||Articles On Cfml Programming Language, Including|Hephaestus Books|9781244545434\n2011||Articles On Cfml Programming Language, Including|Hephaestus Books|9781242966637\n2010||Compilers By Programming Language: Algol 60 Compilers, Assemblers, Basic Compilers, C++ Compilers, Cfml Compilers, C Compilers|Group and Books and LLC|9781157807247" }, "cfscript": { "title": "CFScript", "appeared": 1999, "type": "pl", "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "x = 0;\ndo {\n x = x+1;\n WriteOutput(x);\n} while (x LTE 0);\n// Outputs: 1" ], "related": [ "cfml", "javascript", "html" ], "summary": "CFScript is an extension of CFML on the ColdFusion platform. CFScript resembles JavaScript. Some ColdFusion developers prefer it since it has less visual and typographical overhead than ordinary CFML.", "created": 2006, "backlinksCount": 10, "pageId": 8036673, "revisionCount": 68, "dailyPageViews": 7, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/CFScript" }, "centralPackageRepositoryCount": 0 }, "cg": { "title": "Cg", "appeared": 2003, "type": "pl", "reference": [ "https://arxiv.org/pdf/cs/0302013.pdf" ], "standsFor": "C for Graphics", "country": [ "United States" ], "originCommunity": [ "Nvidia" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "// input vertex\n struct VertIn {\n float4 pos : POSITION;\n float4 color : COLOR0;\n };\n \n // output vertex\n struct VertOut {\n float4 pos : POSITION;\n float4 color : COLOR0;\n };\n \n // vertex shader main entry\n VertOut main(VertIn IN, uniform float4x4 modelViewProj) {\n VertOut OUT;\n OUT.pos = mul(modelViewProj, IN.pos); // calculate output coords\n OUT.color = IN.color; // copy input color to output\n OUT.color.z = 1.0f; // blue component of color = 1.0f\n return OUT;\n }" ], "related": [ "c", "opengl", "unity-engine" ], "summary": "Cg (short for C for Graphics) is a high-level shading language developed by Nvidia in close collaboration with Microsoft for programming vertex and pixel shaders. Cg is based on the C programming language and although they share the same syntax, some features of C were modified and new data types were added to make Cg more suitable for programming graphics processing units. This language is only suitable for GPU programming and is not a general programming language. The Cg compiler outputs DirectX or OpenGL shader programs. Since 2012, Cg was deprecated, with no additional development or support available.", "pageId": 390212, "dailyPageViews": 189, "created": 2003, "backlinksCount": 122, "revisionCount": 233, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Cg_(programming_language)" }, "tiobe": { "id": "cg" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6204", "fileType": "text", "wordRank": 7928, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2003|Addison-Wesley Professional|The CG Tutorial: The Definitive Guide to Programmable Real-Time Graphics|Fernando, Randima and Kilgard, Mark J.|9780321194961\n2006|Springer|Computers and Games: 4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004. Revised Papers (Lecture Notes in Computer Science, 3846)||9783540324881\n2008|Springer|Computers and Games: 6th International Conference, CG 2008 Beijing, China, September 29 - October 1, 2008. Proceedings (Lecture Notes in Computer Science, 5131)||9783540876076\n2011||Cg (programming Language)|Frederic P. Miller|9786135608311\n20121212|Taylor & Francis|Essential CG Lighting Techniques with 3ds Max|Darren Brooker|9781136138935" }, "cgol": { "title": "CGOL", "appeared": 1973, "type": "pl", "creators": [ "Vaughan Ronald Pratt" ], "reference": [ "https://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/lang/lisp/code/syntax/cgol/0.html" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "example": [ "for i in 1 to n do\n for k in 1 to n do\n (ac := 0;\n for j in 1 to n do\n ac := ac + a(i,j)*b(j,k);\n c(i,k) := ac)" ], "wikipedia": { "summary": "CGOL (pronounced \"see goll\") is an alternative syntax featuring an extensible algebraic notation for the Lisp programming language. It was designed for MACLISP by Vaughan Pratt and subsequently ported to Common Lisp.The notation of CGOL is a traditional infix notation, in the style of ALGOL, rather than Lisp's traditional, uniformly-parenthesized prefix notation syntax. The CGOL parser is based on Pratt's design for top-down operator precedence parsing, sometimes informally referred to as a \"Pratt parser\". Semantically, CGOL is essentially just Common Lisp, with some additional reader and printer support.", "backlinksCount": 9, "pageId": 14030444, "dailyPageViews": 7, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/CGOL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=750" }, "ch": { "title": "Ch computer programming", "appeared": 2001, "type": "pl", "website": "http://www.softintegration.com", "country": [ "United States" ], "originCommunity": [ "SoftIntegration, Inc" ], "domainName": { "registered": 1998, "awisRank": { "2022": 6579250 }, "name": "softintegration.com" }, "wikipedia": { "related": [ "c", "linux", "solaris", "freebsd", "x86-isa", "sparc", "labview", "pike" ], "summary": "Ch is a proprietary cross-platform C and C++ interpreter and scripting language environment, originally designed by Harry H. Cheng as a scripting language for beginners to learn mathematics, computing, numerical analysis (numeric methods), and programming in C/C++. Ch is now developed and marketed by SoftIntegration, Inc. A student edition is freely available. Ch Professional Edition for Raspberry Pi is free for non-commercial use. Ch can be embedded in C/C++ application programs. It has numerical computing and graphical plotting features. Ch is a combined shell and IDE. Ch shell combines the features of common shell and C language. ChIDE provides quick code navigation and symbolic debugging. It is based on embedded Ch, Scite and Scintilla.Ch is written in C and runs on Windows, Linux, macOS, FreeBSD, AIX, Solaris, QNX, and HP-UX. It supports C90 and major C99 features, but it does not support the full set of C++ features. C99 complex number, IEEE-754 floating-point arithmetic, and variable-length array features were supported in Ch before they became part of the C99 standard. An article published by Computer Reseller News (CRN) named Ch as notable among C-based virtual machines for its functionality and the availability of third-party libraries.Ch has many toolkits that extend its functions. For example, Ch Mechanism Toolkit is used for design and analysis of commonly used mechanisms such as fourbar linkage, five-bar linkage, six-bar linkage, crank-slider mechanism, and cam-follower system. Ch Control System Toolkit is used for modeling, design, and analysis of continuous-time or discrete-time linear time invariant (LTI) control systems. Both toolkits includes the source code. Ch is now used and integrated into curriculum by many high schools and universities to teach computing and programming in C/C++. Ch has been integrated into free C-STEM Studio, a platform for learning computing, science, technology, engineering, and mathematics (C-STEM) with robotics. C-STEM Studio is developed by UC Davis Center for Integrated Computing and STEM Education (C-STEM). It offers the curriculum for K-12 students. Ch supports LEGO Mindstorms NXT and EV3, Arduino, Linkbot, Finch Robot, RoboTalk and Rasperry PI, Pi Zero, and ARM for robot programming and learning.It can also be embedded into the LabVIEW system-design platform and development environment.", "pageId": 31643142, "created": 2005, "backlinksCount": 41, "revisionCount": 213, "dailyPageViews": 47, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Ch_(computer_programming)" }, "fileType": "text", "wordRank": 2789, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "chain-format": { "title": "chain-format", "appeared": 2013, "type": "textDataFormat", "description": "The chain format describes a pairwise alignment that allow gaps in both sequences simultaneously. Each set of chain alignments starts with a header line, contains one or more alignment data lines, and terminates with a blank line. The format is deliberately quite dense.", "reference": [ "https://genome.ucsc.edu/goldenPath/help/chain.html" ], "country": [ "United States" ], "originCommunity": [ "University of California, Santa Cruz" ], "example": [ "chain 4900 chrY 58368225 + 25985403 25985638 chr5 151006098 - 43257292 43257528 1\n9 1 0\n10 0 5\n61 4 0\n16 0 4\n42 3 0\n16 0 8\n14 1 0\n3 7 0\n48\nchain 4900 chrY 58368225 + 25985406 25985566 chr5 151006098 - 43549808 43549970 2\n16 0 2\n60 4 0\n10 0 4\n70" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "chain-programming-language": { "title": "CHAIN", "appeared": 1981, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Datapoint" ], "country": [ "United Kingdom" ], "originCommunity": [ "Datapoint Corporation" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/CHAIN_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "chained-arrow-notation": { "title": "Conway chained arrow notation", "appeared": 1996, "type": "notation", "creators": [ "John Conway" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "related": [ "up-arrow-notation" ], "example": [ "3->3->2 = 7,625,597,484,987" ], "wikipedia": { "summary": "Conway chained arrow notation, created by mathematician John Horton Conway, is a means of expressing certain extremely large numbers. It is simply a finite sequence of positive integers separated by rightward arrows, e.g. 2 → 3 → 4 → 5 → 6 {\\displaystyle 2\\to 3\\to 4\\to 5\\to 6} . As with most combinatorial notations, the definition is recursive. In this case the notation eventually resolves to being the leftmost number raised to some (usually enormous) integer power.", "backlinksCount": 123, "pageId": 305456, "dailyPageViews": 68, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Conway_chained_arrow_notation" }, "isbndb": "" }, "chaiscript": { "title": "chaiscript", "appeared": 2009, "type": "pl", "website": "http://chaiscript.com/", "country": [ "United States and New Zealand" ], "originCommunity": [ "https://github.com/ChaiScript" ], "domainName": { "registered": 2009, "awisRank": { "2022": 11052396 }, "name": "chaiscript.com" }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "example": [ "#include \nstd::string helloWorld(const std::string &t_name) {\n return \"Hello \" + t_name + \"!\";\n}\nint main() {\n chaiscript::ChaiScript chai;\n chai.add(chaiscript::fun(&helloWorld), \"helloWorld\");\n chai.eval(R\"(\n puts(helloWorld(\"Bob\"));\n )\");\n}" ], "githubRepo": { "firstCommit": 2009, "stars": 2532, "forks": 317, "subscribers": 126, "created": 2011, "updated": 2022, "description": "Embedded Scripting Language Designed for C++", "issues": 114, "url": "https://github.com/ChaiScript/ChaiScript" }, "repoStats": { "firstCommit": 2009, "commits": 2380, "committers": 79, "files": 386 }, "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "chai" ], "id": "ChaiScript" } }, "champ": { "title": "CHAMP", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4bcf6e9dfca82fe8e30799bb246c7f9ede3a6c23" ], "country": [ "United States" ], "originCommunity": [ "University of Virginia" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3015", "centralPackageRepositoryCount": 0 }, "chaos-lang": { "title": "chaos-lang", "appeared": 2020, "type": "pl", "website": "https://chaos-lang.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/chaos-lang" ], "domainName": { "registered": 2019, "name": "chaos-lang.org" }, "semanticScholar": "" }, "chapel": { "title": "Chapel", "appeared": 2004, "type": "pl", "creators": [ "David Callahan", "Hans Zima", "Brad Chamberlain", "John Plevyak" ], "website": "https://chapel-lang.org/", "documentation": [ "https://chapel-lang.org/docs/" ], "reference": [ "https://ieeexplore.ieee.org/document/1299190" ], "fileExtensions": [ "chpl" ], "country": [ "United States" ], "originCommunity": [ "Cray" ], "domainName": { "registered": 2014, "awisRank": { "2017": 4723261, "2022": 3010307 }, "name": "chapel-lang.org" }, "releaseNotesUrl": "https://chapel-lang.org/releaseNotes.html", "writtenIn": [ "chapel" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "// 0[oO][0-7]+", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "// (\\d*\\.\\d+)([eE][+-]?[0-9]+)?i?", "value": true }, "hasIntegers": { "example": "// [0-9]+", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "writeln" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "_", "align", "atomic", "begin", "break", "by", "class", "cobegin", "coforall", "config", "const", "continue", "delete", "dmapped", "do", "domain", "else", "enum", "export", "extern", "for", "forall", "if", "in", "index", "inline", "inout", "iter", "label", "let", "local", "module", "new", "nil", "on", "otherwise", "out", "param", "proc", "record", "reduce", "ref", "return", "scan", "select", "serial", "single", "sparse", "subdomain", "sync", "then", "type", "union", "use", "var", "when", "where", "while", "yield", "zip" ], "githubRepo": { "stars": 1454, "forks": 390, "subscribers": 60, "created": 2014, "updated": 2022, "firstCommit": 2009, "description": "a Productive Parallel Programming Language", "issues": 2459, "url": "https://github.com/chapel-lang/chapel" }, "repoStats": { "firstCommit": 2009, "commits": 89061, "committers": 353, "files": 63638 }, "wikipedia": { "related": [ "ada", "csharp", "c", "fortran", "java", "fortress", "unified-parallel-c", "x10", "isbn" ], "summary": "Chapel, the Cascade High Productivity Language, is a parallel programming language developed by Cray. It is being developed as part of the Cray Cascade project, a participant in DARPA's High Productivity Computing Systems (HPCS) program, which had the goal of increasing supercomputer productivity by the year 2010. It is being developed as an open source project, under version 2 of the Apache license.", "pageId": 6776794, "dailyPageViews": 63, "created": 2006, "backlinksCount": 198, "revisionCount": 122, "appeared": 2009, "fileExtensions": [ "chpl" ], "url": "https://en.wikipedia.org/wiki/Chapel_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "chpl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.chapel", "aliases": [ "chpl" ], "repos": 212, "id": "Chapel" }, "githubBigQuery": { "repos": 55, "users": 50, "id": "Chapel" }, "pygmentsHighlighter": { "filename": "chapel.py", "fileExtensions": [ "chpl" ], "id": "Chapel" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2018, "committerCount": 7, "commitCount": 40, "sampleCount": 5, "example": [ "writeln(\"Hello, world!\"); // print 'Hello, world!' to the console\n" ], "url": "https://github.com/chapel-lang/chapel-tmbundle" }, "projectEuler": { "memberCount": { "2019": 8, "2022": 11 }, "id": "Chapel" }, "leachim6": { "filepath": "c/Chapel.chpl", "fileExtensions": [ "chpl" ], "example": [ "writeln(\"Hello World\");\n" ], "id": "Chapel" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Chapel", "tryItOnline": "chapel", "indeedJobs": { "2022": 1, "query": "chapel developer" }, "officialBlogUrl": [ "https://chapel-lang.org/whatsnew.html" ], "eventsPageUrl": [ "https://chapel-lang.org/events.html" ], "subreddit": [ { "memberCount": { "2022": 12989 }, "url": "https://reddit.com/r/chapel" } ], "hopl": "https://hopl.info/showlanguage.prx?exp=8171", "twitter": "https://twitter.com/ChapelLanguage", "fileType": "text", "wordRank": 6683, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|Springer|Languages And Compilers For Parallel Computing: 11th International Workshop, Lcpc'98, Chapel Hill, Nc, Usa, August 7-9, 1998, Proceedings (lecture Notes In Computer Science)|Chatterjee and J.f.|9783540664260\n2014|William Morrow|The Hydra Protocol: A Jim Chapel Mission (Jim Chapel Missions)|Wellington, David|9780062248800", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2007|Parallel Programmability and the Chapel Language|10.1177/1094342007078442|948|67|B. Chamberlain and D. Callahan and H. Zima|24f093129e03eb7e8911d9556d70d90153e81584\n2012|Performance Portability with the Chapel Language|10.1109/IPDPS.2012.60|46|2|A. Sidelnik and Saeed Maleki and B. Chamberlain and M. Garzarán and D. Padua|96973447980a120734a8b1368b566eb159b87b70\n2012|Global Data Re-allocation via Communication Aggregation in Chapel|10.1109/SBAC-PAD.2012.18|21|3|Alberto Sanz and R. Asenjo and Juan López and R. Larrosa and A. Navarro and V. Litvinov and Sung-Eun Choi and B. Chamberlain|aba4addd7f8317e721eba2cffcd124a1dd55f38b\n2006|Iterators in Chapel|10.1109/IPDPS.2006.1639499|17|1|Mackale Joyner and B. Chamberlain and Steven J. Deitz|f9d65fcdcb1bf8fa7b1de7c6e1b8398132f2d37c\n2012|An Empirical Performance Study of Chapel Programming Language|10.1109/IPDPSW.2012.64|13|1|N. Dun and K. Taura|66b83390781ac875d253f48c219db3d0939493c1\n2013|Automated Verification of Chapel Programs Using Model Checking and Symbolic Execution|10.1007/978-3-642-38088-4_14|11|1|Timothy K. Zirkel and Stephen F. Siegel and Timothy McClory|ab3d61bcf5bab68d67814c101e13e68777008f18\n2017|Comparative Performance and Optimization of Chapel in Modern Manycore Architectures|10.1109/IPDPSW.2017.126|9|1|Engin Kayraklioglu and Wo Chang and T. El-Ghazawi|2013fa22a8f0dd21d543b1198696e85cb38a7548\n2014|Affine Loop Optimization Based on Modulo Unrolling in Chapel|10.1145/2676870.2676877|8|0|Aroon Sharma and Darren Smith and Joshua Koehler and R. Barua and Michael P. Ferguson|4cd64ddd973fcec98e20062ac2b1fd5ee8e47794\n2016|PGAS Access Overhead Characterization in Chapel|10.1109/IPDPSW.2016.193|7|0|Engin Kayraklioglu and O. Serres and Ahmad Anbar and Hashem Elezabi and T. El-Ghazawi|cdc0d2b153f15c52367e319ddb34acbbf4b57e1b\n2020|Development of Parallel CFD Applications with the Chapel Programming Language|10.2514/6.2021-0749|7|0|M. Parenteau and S. Bourgault-Cote and Frédéric Plante and Engin Kayraklioglu and E. Laurendeau|0db7434a6fb2dfb0bfb674b9865d5bdafcff07c2\n2017|Data Centric Performance Measurement Techniques for Chapel Programs|10.1109/IPDPS.2017.37|6|0|Hui Zhang and J. Hollingsworth|2342215a29e15e7d2c9ac9eb63ca5db4a87cac3a\n2015|Assessing Memory Access Performance of Chapel through Synthetic Benchmarks|10.1109/CCGrid.2015.157|3|0|Engin Kayraklioglu and T. El-Ghazawi|797dfc31a180c9b3de24b3f587292e201c7f7e42\n2017|Scheduling Chapel Tasks with Qthreads on Manycore: A Tale of Two Schedulers|10.1145/3095770.3095774|3|0|N. Evans and Stephen L. Olivier and R. Barrett and George Stelle|10858d712705556b133407d1434352c42d0cfba6\n2017|Towards a GraphBLAS Library in Chapel|10.1109/IPDPSW.2017.118|3|0|A. Azad and A. Buluç|79ad275569d313354c203623eb321817542de819\n2016|Transparently Resilient Task Parallelism for Chapel|10.1109/IPDPSW.2016.102|2|0|Konstantina Panagiotopoulou and Hans-Wolfgang Loidl|2edf5b50f4845936aab09ecfa806219cd14437b7\n2011|Translating Chapel to Use FREERIDE: A Case Study in Using an HPC Language for Data-Intensive Computing|10.1109/IPDPS.2011.266|2|0|Bin Ren and G. Agrawal and B. Chamberlain and Steven J. Deitz|2d2a24c4a338f0d65d74e6b283c026ab093ff857\n2019|Graph Algorithms in PGAS: Chapel and UPC++|10.1109/HPEC.2019.8916309|2|0|Louis Jenkins and J. Firoz and Marcin Zalewski and C. Joslyn and Mark Raugas|cf83d871185279c6b4108126b5710fc1cfd70376\n2021|Towards High Productivity and Performance for Irregular Applications in Chapel|10.1109/SCWS55283.2021.00012|2|0|Thomas B. Rolinger and Joseph Craft and Christopher D. Krieger and A. Sussman|8b1fb263b1e8b7ae3edf81ac2b2d3a13d18be553\n2018|ChplBlamer: A Data-centric and Code-centric Combined Profiler for Multi-locale Chapel Programs|10.1145/3205289.3205314|1|0|Hui Zhang and J. Hollingsworth|4fe4bc6f6332e63b653b1f4ffe73efedec7bdc6c" }, "chappe-code": { "title": "chappe-code", "appeared": 1792, "type": "notation", "description": "An optical telegraph notation.", "reference": [ "https://en.wikipedia.org/wiki/Optical_telegraph" ] }, "charcoal": { "title": "Charcoal", "appeared": 2016, "type": "esolang", "creators": [ "somebody1234" ], "website": "https://github.com/somebody1234/Charcoal/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/somebody1234" ], "writtenIn": [ "python" ], "githubRepo": { "stars": 178, "forks": 8, "subscribers": 4, "created": 2016, "updated": 2022, "description": "A concise language for sketching ASCII art.", "url": "https://github.com/somebody1234/Charcoal/" }, "repoStats": { "firstCommit": 2016, "commits": 264, "committers": 10, "files": 46 } }, "charity": { "title": "Charity", "appeared": 1992, "type": "pl", "website": "http://pll.cpsc.ucalgary.ca/charity1/www/home.html", "country": [ "Canada" ], "originCommunity": [ "University of Calgary" ], "hasLineComments": { "example": "% A comment", "value": true }, "hasComments": { "example": "% A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "%" ] ], "example": [ "%\n% Some very badly written Charity\n%\n\ndata LA(A) -> D = ss: A -> D\n | ff: -> D." ], "wikipedia": { "related": [ "linux", "ml" ], "summary": "Charity is an experimental purely functional programming language, developed at the University of Calgary under the supervision of Robin Cockett. Based on ideas by Hagino Tatsuya, it is completely grounded in category theory. Disregarding interactions with the outside world, all Charity programs are guaranteed to terminate or stay productive. The language allows ordinary recursive data types, such as might be found in ML, which are required to be finite, and corecursive data types, which are allowed to be potentially infinite. The control structure for operating on recursive data types is primitive recursion or paramorphism, and the control structure for corecursive data types is primitive co-recursion or apomorphism. Neither control structure can operate over the other kind of data, so all paramorphisms terminate and all apomorphisms are productive.", "pageId": 1364508, "created": 2005, "backlinksCount": 16, "revisionCount": 38, "dailyPageViews": 18, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Charity_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ch" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 11, "id": "Charity" }, "githubBigQuery": { "repos": 10, "users": 7, "id": "Charity" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1540", "fileType": "text", "wordRank": 4766, "centralPackageRepositoryCount": 0 }, "charly": { "title": "charly", "appeared": 2017, "type": "pl", "website": "https://github.com/charly-lang", "country": [ "Switzerland" ], "originCommunity": [ "Eastern Switzerland University of Applied Sciences" ], "domainName": { "name": "charly-lang.github.io" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n14092907|The Charly programming language|https://charly-lang.github.io/charly/|2017-04-11 22:01:23 UTC|1491948083|mabynogy|0|2", "isbndb": "" }, "charmpp": { "title": "CHARM++", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5e50ffa96fa021c85ccedb1bb8b84b59ee268de8" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois, Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1895", "centralPackageRepositoryCount": 0 }, "charrette-ada": { "title": "Charrette Ada", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dd3a2e7535ac8799215a4a80e1319927ae9b9b07" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3902", "centralPackageRepositoryCount": 0 }, "chartio-app": { "title": "chartio-app", "appeared": 2010, "type": "application", "website": "https://chartio.com/", "reference": [ "https://www.crunchbase.com/organization/chart-io" ], "country": [ "United States" ], "originCommunity": [ "chart-io" ], "domainName": { "registered": 2010, "awisRank": { "2022": 26655 }, "name": "chartio.com" }, "twitter": "https://twitter.com/chartio" }, "charybdis": { "title": "CHARYBDIS", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/428db58389f4f81607f02302020bf5b49c158dc3" ], "country": [ "United States" ], "originCommunity": [ "The MITRE Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=382", "centralPackageRepositoryCount": 0 }, "chatterbot": { "title": "chatterbot", "appeared": 2014, "type": "library", "creators": [ "Gunther Cox" ], "website": "https://chatterbot.readthedocs.io", "country": [ "United States" ], "originCommunity": [ "salvius" ], "domainName": { "awisRank": { "2022": 685897 }, "name": "chatterbot.readthedocs.io" }, "githubRepo": { "stars": 12366, "forks": 4097, "subscribers": 555, "created": 2014, "updated": 2022, "firstCommit": 2014, "description": "ChatterBot is a machine learning, conversational dialog engine for creating chat bots", "issues": 338, "url": "https://github.com/gunthercox/ChatterBot" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nNatural Language Parsing: Chatterbot|2010|Books LLC|15703851|0.0|0|0" }, "checked-c": { "title": "checked-c", "appeared": 2015, "type": "pl", "creators": [ "David Tarditi" ], "website": "https://www.microsoft.com/en-us/research/project/checked-c/", "reference": [ "https://www.microsoft.com/en-us/research/project/checked-c/" ], "country": [ "United States" ], "originCommunity": [ "Microsoft Research" ], "githubRepo": { "firstCommit": 2016, "stars": 2723, "forks": 189, "subscribers": 106, "created": 2016, "updated": 2022, "description": "Checked C is an extension to C that lets programmers write C code that is guaranteed by the compiler to be type-safe. The goal is to let people easily make their existing C code type-safe and eliminate entire classes of errors. Checked C does not address use-after-free errors. This repo has a wiki for Checked C, sample code, the specification, and test code.", "issues": 61, "url": "https://github.com/Microsoft/checkedc" }, "repoStats": { "firstCommit": 2016, "commits": 486, "committers": 36, "files": 223 }, "isbndb": "", "semanticScholar": "" }, "checkout": { "title": "checkout", "appeared": 2011, "type": "assembly", "description": "It is designed to be lower-level than assembler or even machine code, by matching the way modern processors work more closely than machine language does (machine code matches the way processors used to work decades ago, rather than the way they work nowadays). Thus, it makes operations like memory transfers (which take up the most time on a modern processor) explicit; this leads to the language's name, as memory needs to be \"checked out\" via copy or move instructions in order to be able to use it. The secondary effect of this is that efficient code tends to be shorter and simpler than inefficient code, although it can sometimes be harder to see how it works.", "reference": [ "https://esolangs.org/wiki/Checkout" ], "country": [ "Unknown" ], "originCommunity": [ "esolangs.org" ] }, "cheetah": { "title": "CheetahTemplate", "appeared": 2001, "type": "template", "country": [ "Various" ], "originCommunity": [ "cheetahtemplate.org" ], "wikipedia": { "related": [ "python", "html", "linux" ], "summary": "Cheetah (or CheetahTemplate) is a template engine that uses the Python programming language. It can be used standalone or combined with other tools and frameworks. It is often used for server-side scripting and dynamic web content by generating HTML, but can also be used to generate source code. Cheetah is free/open-source software licensed under the MIT License. Templating engines encourage clean separation of content, graphic design, and program code. This leads to more modular, flexible, and reusable site architectures, shorter development time, and code that is easier to understand and maintain. Cheetah compiles templates into optimized, yet readable, Python code. It gives template authors full access to any Python data and functionality, while providing a way for administrators to selectively restrict access to Python when needed. Cheetah is included in the FreeBSD Ports collection and several Linux distributions: Gentoo, Fedora, Debian, and Ubuntu among others.", "backlinksCount": 15, "pageId": 2852798, "created": 2005, "revisionCount": 72, "dailyPageViews": 7, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/CheetahTemplate" }, "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "tmpl", "spt" ], "id": "Cheetah" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "chef": { "title": "chef", "appeared": 2002, "type": "esolang", "description": "Chef is a programming language in which programs look like recipes.", "website": "http://www.dangermouse.net/esoteric/chef.html", "reference": [ "https://esolangs.org/wiki/Chef" ], "country": [ "Australia" ], "originCommunity": [ "www.dangermouse.net" ], "example": [ "Hello World Souffle.\n\nThis recipe prints the immortal words \"Hello world!\", in a basically brute force way. It also makes a lot of food for one person.\n\nIngredients.\n72 g haricot beans\n101 eggs\n108 g lard\n111 cups oil\n32 zucchinis\n119 ml water\n114 g red salmon\n100 g dijon mustard\n33 potatoes\n\nMethod.\nPut potatoes into the mixing bowl. Put dijon mustard into the mixing bowl. Put lard into the mixing bowl. Put red salmon into the mixing bowl. Put oil into the mixing bowl. Put water into the mixing bowl. Put zucchinis into the mixing bowl. Put oil into the mixing bowl. Put lard into the mixing bowl. Put lard into the mixing bowl. Put eggs into the mixing bowl. Put haricot beans into the mixing bowl. Liquefy contents of the mixing bowl. Pour contents of the mixing bowl into the baking dish.\n\nServes 1." ], "rijuRepl": { "example": [ "Hello World Cake with Chocolate Sauce.\n\nIngredients.\n33 g chocolate chips\n100 g butter\n54 ml double cream\n2 pinches baking powder\n114 g sugar\n111 ml beaten eggs\n119 g flour\n32 g cocoa powder\n0 g cake mixture\n\nCooking time: 25 minutes.\n\nPre-heat oven to 180 degrees Celsius.\n\nMethod.\nPut chocolate chips into the mixing bowl.\nPut butter into the mixing bowl.\nPut sugar into the mixing bowl.\nPut beaten eggs into the mixing bowl.\nPut flour into the mixing bowl.\nPut baking powder into the mixing bowl.\nPut cocoa powder into the mixing bowl.\nStir the mixing bowl for 1 minute.\nCombine double cream into the mixing bowl.\nStir the mixing bowl for 4 minutes.\nLiquefy the contents of the mixing bowl.\nPour contents of the mixing bowl into the baking dish.\nbake the cake mixture.\nWait until baked.\nServe with chocolate sauce.\n\nChocolate Sauce.\n\nIngredients.\n111 g sugar\n108 ml hot water\n108 ml heated double cream\n101 g dark chocolate\n72 g milk chocolate\n\nMethod.\nClean the mixing bowl.\nPut sugar into the mixing bowl.\nPut hot water into the mixing bowl.\nPut heated double cream into the mixing bowl.\ndissolve the sugar.\nagitate the sugar until dissolved.\nLiquefy the dark chocolate.\nPut dark chocolate into the mixing bowl.\nLiquefy the milk chocolate.\nPut milk chocolate into the mixing bowl.\nLiquefy contents of the mixing bowl.\nPour contents of the mixing bowl into the baking dish.\nRefrigerate for 1 hour.\n" ], "description": "Stack-based language where programs look like cooking recipes", "fileExtensions": [ "chef" ], "website": "https://www.dangermouse.net/esoteric/chef.html", "gitRepo": "http://search.cpan.org/author/SMUELLER/Acme-Chef/", "id": "https://riju.codes/chef" } }, "chemtrains": { "title": "ChemTrains", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/981157c40bd6736cb097708bbca719fdb2e25d0e" ], "country": [ "United States" ], "originCommunity": [ "U S WEST Advanced Technologies, Inc", "University of Colorado" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6142", "centralPackageRepositoryCount": 0 }, "cheri": { "title": "Cheri", "appeared": 2010, "type": "isa", "description": "CHERI extends conventional hardware Instruction-Set Architectures (ISAs) with new architectural features to enable fine-grained memory protection and highly scalable software compartmentalization.", "website": "https://www.cl.cam.ac.uk/research/security/ctsrd/cheri/", "standsFor": "Capability Hardware Enhanced RISC Instructions", "country": [ "England" ], "originCommunity": [ "University of Cambridge" ] }, "chevrotain": { "title": "chevrotain", "appeared": 2015, "type": "library", "website": "http://sap.github.io/chevrotain/", "country": [ "Germany" ], "originCommunity": [ "SAP" ], "example": [ "\"use strict\"\n/**\n * An Example of implementing a CSV Grammar with Chevrotain.\n *\n * Based on: https://github.com/antlr/grammars-v4/blob/master/csv/CSV.g4\n *\n * Note that this is a pure grammar without any actions (either embedded or via a CST Visitor).\n */\nconst { createToken, Lexer, Parser, EMPTY_ALT } = require(\"chevrotain\")\n\n// ----------------- lexer -----------------\nconst Text = createToken({ name: \"Text\", pattern: /[^,\\n\\r\"]+/ })\nconst Comma = createToken({ name: \"Comma\", pattern: /,/ })\nconst NewLine = createToken({\n name: \"NewLine\",\n pattern: /\\r?\\n/\n})\nconst String = createToken({ name: \"String\", pattern: /\"(?:\"\"|[^\"])*\"/ })\n\nconst allTokens = [Text, String, Comma, NewLine]\nconst CsvLexer = new Lexer(allTokens)\n\n// Parser\nclass CsvParser extends Parser {\n constructor() {\n super(allTokens)\n\n // not mandatory, using $ (or any other sign) to reduce verbosity\n const $ = this\n\n $.RULE(\"csvFile\", () => {\n $.SUBRULE($.hdr)\n $.AT_LEAST_ONE(() => {\n $.SUBRULE2($.row)\n })\n })\n\n $.RULE(\"hdr\", () => {\n $.SUBRULE($.row)\n })\n\n $.RULE(\"row\", () => {\n $.SUBRULE($.field)\n $.MANY(() => {\n $.CONSUME(Comma)\n $.SUBRULE2($.field)\n })\n $.CONSUME(NewLine)\n })\n\n $.RULE(\"field\", () => {\n $.OR([\n { ALT: () => $.CONSUME(Text) },\n { ALT: () => $.CONSUME(String) },\n { ALT: EMPTY_ALT(\"empty field\") }\n ])\n })\n\n // very important to call this after all the rules have been defined.\n // otherwise the parser may not work correctly as it will lack information\n // derived during the self analysis phase.\n this.performSelfAnalysis()\n }\n}\n\n// wrapping it all together\n// reuse the same parser instance.\nconst parser = new CsvParser([])\n\nmodule.exports = function(text) {\n // 1. Tokenize the input.\n const lexResult = CsvLexer.tokenize(text)\n\n // 2. Set the Parser's input\n parser.input = lexResult.tokens\n\n // 3. invoke the desired parser rule\n const cst = parser.csvFile()\n\n return {\n cst: cst,\n lexResult: lexResult,\n parseErrors: parser.errors\n }\n}" ], "githubRepo": { "stars": 1957, "forks": 176, "subscribers": 29, "created": 2015, "updated": 2022, "firstCommit": 2015, "description": "Parser Building Toolkit for JavaScript", "issues": 47, "url": "https://github.com/SAP/chevrotain" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "chibicc": { "title": "chibicc", "appeared": 2019, "type": "compiler", "creators": [ "Rui Ueyama" ], "description": "A Small C Compiler.", "country": [ "Singapore" ], "originCommunity": [ "https://github.com/rui314" ], "inputLanguages": [ "c" ], "githubRepo": { "firstCommit": 2019, "stars": 5426, "forks": 495, "subscribers": 145, "created": 2019, "updated": 2022, "description": "A small C compiler", "issues": 70, "url": "https://github.com/rui314/chibicc" } }, "chicken-lang": { "title": "chicken-lang", "appeared": 2013, "type": "esolang", "website": "http://torso.me/chicken", "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n5969535|Show HN: Chicken chicken chicken – chicken chicken programming language|2013-07-01 09:14:35 UTC|1372670075|torso|71|147" }, "chicken": { "title": "CHICKEN", "appeared": 1994, "type": "pl", "creators": [ "Felix Winkelmann" ], "country": [ "Various" ], "originCommunity": [ "The Chicken Team" ], "wikipedia": { "related": [ "scheme", "linux", "ios", "android", "stalin" ], "summary": "Chicken (stylized as CHICKEN) is a programming language, specifically a compiler and interpreter which implement a dialect of the programming language Scheme, and which compiles Scheme source code to standard C. It is mostly R5RS compliant and offers many extensions to the standard. The newer R7RS standard is supported through an extension library. Chicken is free and open-source software available under a BSD license. It is implemented mostly in Scheme, with some parts in C for performance or to make embedding into C programs easier.", "created": 2006, "backlinksCount": 128, "pageId": 4397102, "dailyPageViews": 24, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/CHICKEN_(Scheme_implementation)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8676", "wordRank": 3605, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "chicon": { "title": "Chicon", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f205749110fa5f26bf8996e38b6dbb1857f4ce03" ], "country": [ "China" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4378", "centralPackageRepositoryCount": 0 }, "chika": { "title": "Chika", "appeared": 2019, "type": "pl", "creators": [ "Patrick" ], "website": "https://phunanon.github.io/Chika", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/phunanon" ], "githubRepo": { "firstCommit": 2019, "stars": 10, "forks": 2, "subscribers": 2, "created": 2019, "updated": 2022, "description": "S-expression programming language with VM targeting both PC and Arduino.", "issues": 1, "url": "https://github.com/phunanon/Chika" }, "repoStats": { "firstCommit": 2019, "commits": 216, "committers": 3, "files": 64 } }, "chill": { "title": "CHILL", "appeared": 1980, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "ITU Telecommunication Standardization Sector" ], "wikipedia": { "related": [ "cobol", "ada", "plex", "erlang" ], "summary": "In computing, CHILL (an acronym for CCITT High Level Language) is a procedural programming language designed for use in telecommunication switches (the hardware used inside telephone exchanges). The language is still used for legacy systems in some telecommunication companies and for signal box programming. The CHILL language is similar in size and complexity to the original Ada language. The first specification of the CHILL language was published in 1980, a few years before Ada. ITU provides a standard CHILL compiler. A free CHILL compiler was bundled with GCC up to version 2.95, however, was removed from later versions. An object-oriented version, called Object CHILL, was developed also. ITU is responsible for the CHILL standard, known as ITU-T Rec. Z.200. The equivalent ISO standard is ISO/IEC 9496:2003. (The text of the two documents is the same). In late 1999 CCITT stopped maintaining the CHILL standard. CHILL was used in systems of Alcatel System 12 and Siemens EWSD, for example.", "pageId": 765313, "dailyPageViews": 20, "created": 2004, "backlinksCount": 20, "revisionCount": 62, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/CHILL" }, "tiobe": { "id": "CHILL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=889", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1983|Prentice Hall|The Programming Languages: Pascal, Modula, Chill and Ada|Smedema, Kees|9780137297566" }, "chimera": { "title": "Chimera", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/489859de40c0e609b0cf40925aacb8971928f70c" ], "country": [ "Italy and The Netherlands" ], "originCommunity": [ "Università di Genova", "Università di Milano", "University of Twente" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2945", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|Momentum|The Chimera Vector: The Fifth Column 1|Nathan M Farrugia|9781743340332\n20140729|Taylor & Francis|Computational and Visualization Techniques for Structural Bioinformatics Using Chimera|Forbes J. Burkowski|9781482262346\n20140729|Taylor & Francis|Computational and Visualization Techniques for Structural Bioinformatics Using Chimera|Forbes J. Burkowski|9781439836620" }, "chinese-basic": { "title": "Chinese BASIC", "appeared": 1980, "type": "pl", "country": [ "Taiwan" ], "originCommunity": [ "Acer", "others" ], "wikipedia": { "related": [ "basic", "applesoft-basic" ], "summary": "Chinese BASIC (Chinese: 中文培基; pinyin: Zhōngwén Péijī) is the name given to several Chinese-localized versions of the BASIC programming language in the early 1980s.", "created": 2005, "backlinksCount": 20, "pageId": 1977500, "revisionCount": 54, "dailyPageViews": 14, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Chinese_BASIC" }, "centralPackageRepositoryCount": 0 }, "chip-8": { "title": "CHIP-8", "appeared": 1970, "type": "pl", "country": [ "United States" ], "originCommunity": [ "RCA Corporation" ], "wikipedia": { "related": [ "verilog" ], "summary": "CHIP-8 is an interpreted programming language, developed by Joseph Weisbecker. It was initially used on the COSMAC VIP and Telmac 1800 8-bit microcomputers in the mid-1970s. CHIP-8 programs are run on a CHIP-8 virtual machine. It was made to allow video games to be more easily programmed for these computers. Roughly twenty years after CHIP-8 was introduced, derived interpreters appeared for some models of graphing calculators (from the late 1980s onward, these handheld devices in many ways have more computing power than most mid-1970s microcomputers for hobbyists). An active community of users and developers existed in the late 1970s, beginning with ARESCO's \"VIPer\" newsletter whose first three issues revealed the machine code behind the CHIP-8 interpreter.", "pageId": 1119698, "created": 2004, "backlinksCount": 21, "revisionCount": 170, "dailyPageViews": 139, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/CHIP-8" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3381", "fileType": "text", "centralPackageRepositoryCount": 0 }, "chip-programming-language": { "title": "CHIP", "appeared": 1985, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "European Computer-Industry Research Centre" ], "wikipedia": { "related": [ "prolog", "c" ], "summary": "CHIP (Constraint Handling in Prolog) is a constraint logic programming language developed by M. Dincbas and alias in 1985 at ECRC, initially using a Prolog language interface. CHIP V5 is the version developed and marketed by COSYTEC in Paris since 1993 with Prolog, using C, C++, or Prolog language interfaces. The commercially successful ILOG Solver is also, partly, an offshoot of ECRC version of CHIP.", "created": 2006, "backlinksCount": 15, "pageId": 3803093, "revisionCount": 34, "dailyPageViews": 6, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/CHIP_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1131", "centralPackageRepositoryCount": 0 }, "chipmunk-basic": { "title": "Chipmunk Basic", "appeared": 1989, "type": "pl", "website": "http://www.nicholson.com/rhn/basic/", "reference": [ "http://www.nicholson.com/rhn/basic/basic.man.html" ], "country": [ "United States" ], "wikipedia": { "related": [ "linux", "pascal" ], "summary": "Chipmunk Basic is a freeware version of the BASIC programming language maintained by developer Ron Nicholson. Chipmunk basic was originally developed for the Apple Macintosh and has been ported to Linux and Windows. The \"windowed\" Macintosh version includes a wide variety of graphics drawing commands. It also has object-oriented capabilities. The current version of Chipmunk Basic (and its spinoff products for Palm OS, cBasPad and HotPaw BASIC) was based on a public domain, Pascal implementation by David Gillespie, author of the Pascal translation tool p2c. In January 2015, a Cocoa version was released that may lack features from the older Carbon-based OS X port.", "created": 2005, "backlinksCount": 94, "pageId": 1604792, "revisionCount": 52, "dailyPageViews": 11, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/Chipmunk_Basic" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "chirp": { "title": "chirp", "appeared": 2008, "type": "visual", "description": "Chirp is a Scratch modification made by Jens, who was at the time a member of the Scratch Team. It was the precursor to BYOB and adds a number of new features to Scratch, while remaining fully compatible", "website": "https://en.scratch-wiki.info/wiki/Chirp_(Scratch_modification)", "country": [ "United States" ], "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2006|Chirp on crickets: teaching compilers using an embedded robot controller|10.1145/1121341.1121370|29|0|Li Xu and F. Martin|cb2801c66e850dfbe4a6a7a88bd507f02110f21c\n2016|FPGA-based I/Q chirp generator using first quadrant DDS compression for pulse compression radar|10.1063/1.4958607|1|0|R. I. Wijaya and S. Ros and E. S. Bagus and M. Dadan|2f682146c68008f2cd8cf803b9c51c92498bf612" }, "chisel": { "title": "chisel", "appeared": 2015, "type": "hardwareDescriptionLanguage", "website": "https://www.chisel-lang.org/", "reference": [ "https://chisel.eecs.berkeley.edu/" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "domainName": { "registered": 2016, "awisRank": { "2022": 517528 }, "name": "chisel-lang.org" }, "githubRepo": { "firstCommit": 2015, "stars": 2602, "forks": 456, "subscribers": 150, "created": 2015, "updated": 2022, "description": "Chisel 3: A Modern Hardware Design Language", "issues": 297, "url": "https://github.com/freechipsproject/chisel3" }, "repoStats": { "firstCommit": 2015, "commits": 7906, "committers": 196, "files": 627 }, "twitter": "https://twitter.com/chisel_lang", "isbndb": "" }, "chocolatey-pm": { "title": "chocolatey-pm", "appeared": 2011, "type": "packageManager", "description": "Chocolatey is a package manager for Windows (like apt-get or yum but for Windows).", "website": "https://chocolatey.org/", "country": [ "United States" ], "originCommunity": [ "Chocolatey Software" ], "domainName": { "registered": 2011, "awisRank": { "2022": 21292 }, "name": "chocolatey.org" }, "centralPackageRepositoryCount": 0 }, "chomski": { "title": "Chomski", "appeared": 2007, "type": "pl", "wikipedia": { "example": [ "cat inputFileName | chomski -s '[-n]{plus;} <>{count;print;}'" ], "related": [ "sed", "unix", "grep", "unicode", "c" ], "summary": "chomski virtual machine (named after the noted linguist Noam Chomsky) and pp (the pattern parser) refer to both a command line computer language and utility (interpreter for that language) which can be used to parse and transform text patterns. The utility reads input files character by character (sequentially), applying the operation which has been specified via the command line or a pp script, and then outputs the line. It was developed from 2006 as a Unix and Windows utility, and is available today for Windows and Linux systems. Pp has derived a number of ideas and syntax elements from Sed, a command line text stream editor.", "created": 2008, "backlinksCount": 9, "pageId": 18718048, "revisionCount": 54, "dailyPageViews": 12, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Chomski" }, "centralPackageRepositoryCount": 0 }, "chrome-programming-language": { "title": "Chrome", "appeared": 2008, "type": "pl", "country": [ "United States" ], "originCommunity": [ "RemObjects Software" ], "wikipedia": { "example": [ "Type: System.Int32\n-> a = 23, b = 15\n-> a = 15, b = 23\nType: System.String\n-> a = abc, b = def\n-> a = def, b = abc\nType: System.Double\n-> a = 1,1, b = 1,2\n-> a = 1,2, b = 1,1" ], "related": [ "wasm", "object-pascal", "csharp", "eiffel", "java", "f-sharp", "delphi", "swift", "free-pascal" ], "summary": "Oxygene (formerly known as Chrome) is a programming language developed by RemObjects Software for Microsoft's Common Language Infrastructure, the Java Platform and Cocoa. Oxygene is Object Pascal-based, but also has influences from C#, Eiffel, Java, F# and other languages. Compared to the now deprecated Delphi.NET, Oxygene does not emphasize total backward compatibility, but is designed to be a \"reinvention\" of the language, be a good citizen on the managed development platforms, and leverage all the features and technologies provided by the .NET and Java runtimes. Oxygene is a commercial product, and offers full integration into Microsoft's Visual Studio IDE on Windows, as well as its own IDE, Fire for use on macOS. The command line compiler is available free. Oxygene is one of four languages supported by the underlying Elements Compiler toolchain, next to C#, Swift and Java). From 2008 to 2012, RemObjects Software has licensed its compiler and IDE technology to Embarcadero to be used in their Embarcadero Prism product. Starting in the Fall of 2011, Oxygene became available in two separate editions, with the second edition adding support for the Java and Android runtimes. Starting with the release of XE4, Embarcadero Prism is no longer part of the RAD Studio SKU. Numerous support and upgrade paths for Prism customers exist to migrate to Oxygene. As of 2016, there is only one edition of Oxygene, which allows development on Windows or macOS, and which can create executables for Windows .NET, iOS, Android, Java and macOS.", "created": 2008, "backlinksCount": 208, "pageId": 4249746, "revisionCount": 3, "dailyPageViews": 4, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Chrome_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "chronolog": { "title": "Chronolog", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/436c8be2764d3ee31a2ba2cceba8791f9a49e4d4" ], "country": [ "Australia" ], "originCommunity": [ "University of New South Wales" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2225", "centralPackageRepositoryCount": 0 }, "chronologmc": { "title": "ChronologMC", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ce15ef3881d751edca92faab9ba4f641c171876b" ], "country": [ "Australia" ], "originCommunity": [ "Macquarie University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6819", "centralPackageRepositoryCount": 0 }, "chronologz": { "title": "ChronologZ", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1cfff731500ea8da53d21a20c70a48cb6a4c0a1e" ], "country": [ "Australia and Canada" ], "originCommunity": [ "Macquarie University", "University of Victoria", "University of New Brunswick" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6821", "centralPackageRepositoryCount": 0 }, "chrysalisp": { "title": "chrysaLisp", "appeared": 2015, "type": "pl", "creators": [ "Chris Hinsley" ], "country": [ "United Kingdom" ], "originCommunity": [ "Tao Group" ], "example": [ ";imports\n(import 'sys/lisp.inc)\n(import 'class/lisp.inc)\n(import 'gui/lisp.inc)\n\n(structure 'event 0\n (byte 'win_close 'win_min 'win_max 'win_button))\n\n(ui-tree window (create-window (+ window_flag_close window_flag_min window_flag_max)) nil\n (ui-element _ (create-flow) ('flow_flags (logior flow_flag_down flow_flag_fillw flow_flag_lasth))\n (ui-element display (create-label) ('text \"0\" 'color argb_white 'flow_flags flow_flag_align_hright\n 'font (create-font \"fonts/OpenSans-Regular.ttf\" 24)))\n (ui-element _ (create-grid) ('grid_width 4 'grid_height 4 'color toolbar_col\n 'font (create-font \"fonts/OpenSans-Regular.ttf\" 42))\n (each (lambda (text)\n (component-connect\n (ui-element _ (create-button) ('text (if (eql text \"C\") \"AC\" text)))\n event_win_button)) \"789/456*123-0=C+\"))))\n\n(gui-add (apply view-change (cat (list window 920 48)\n (view-pref-size (window-set-title (window-connect-close (window-connect-min\n (window-connect-max window event_win_max) event_win_min) event_win_close) \"Calculator\")))))\n\n(defun do_lastop ()\n (cond\n ((eql lastop \"+\")\n (setq accum (+ accum num)))\n ((eql lastop \"-\")\n (setq accum (- accum num)))\n ((eql lastop \"*\")\n (setq accum (* accum num)))\n ((eql lastop \"/\")\n (if (/= num 0) (setq accum (/ accum num)))))\n accum)\n\n(defq id t accum 0 value 0 num 0 lastop nil)\n(while id\n (cond\n ((>= (setq id (get-long (defq msg (mail-read (task-mailbox))) ev_msg_target_id)) event_win_button)\n (defq op (get (view-find-id window (get-long msg ev_msg_action_source_id)) 'text))\n (cond\n ((eql op \"AC\")\n (setq accum 0 value 0 num 0 lastop nil))\n ((find op \"=+-/*\")\n (if lastop\n (setq value (do_lastop))\n (setq value num accum num))\n (setq lastop op num 0))\n (t\n (cond\n ((= num 0)\n (unless (eql op \"0\"))\n (setq num (to-num op)))\n (t (setq num (to-num (cat (str num) op)))))\n (setq value num)))\n (set display 'text (str value))\n (view-dirty (view-layout display)))\n ((= id event_win_close)\n ;close button\n (setq id nil))\n ((= id event_win_min)\n ;min button\n (bind '(x y _ _) (view-get-bounds window))\n (bind '(w h) (view-pref-size window))\n (view-change-dirty window x y w h))\n ((= id event_win_max)\n ;max button\n (bind '(x y _ _) (view-get-bounds window))\n (view-change-dirty window x y 512 512))\n (t (view-event window msg))))\n\n(view-hide window)" ], "githubRepo": { "firstCommit": 2015, "stars": 1314, "forks": 84, "subscribers": 63, "created": 2015, "updated": 2022, "description": "Parallel OS, with GUI, Terminal, OO Assembler, Class libraries, C-Script compiler, Lisp interpreter and more...", "issues": 31, "url": "https://github.com/vygr/ChrysaLisp" }, "repoStats": { "firstCommit": 2015, "commits": 7504, "committers": 15, "files": 590 } }, "chuck": { "title": "Ch", "appeared": 2003, "type": "pl", "creators": [ "Ge Wang" ], "website": "http://chuck.cs.princeton.edu", "country": [ "United States" ], "originCommunity": [ "chuck team" ], "domainName": { "name": "chuck.cs.princeton.edu" }, "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "// our signal graph (patch)\n SinOsc f => dac;\n // set gain\n .3 => f.gain;\n // an array of pitch classes (in half steps)\n [ 0, 2, 4, 6, 9, 10 ] @=> int hi[];\n \n // infinite loop\n while( true )\n {\n // choose a note, shift registers, convert to frequency\n Std.mtof( 65 + Std.rand2(0,1) * 43 +\n hi[Std.rand2(0,hi.cap()-1)] ) => f.freq;\n \n // advance time by 120 ms\n 120::ms => now;\n }" ], "related": [ "linux", "ios" ], "summary": "ChucK is a concurrent, strongly timed audio programming language for real-time synthesis, composition, and performance, which runs on Linux, Mac OS X, Microsoft Windows, and iOS. It is designed to favor readability and flexibility for the programmer over other considerations such as raw performance. It natively supports deterministic concurrency and multiple, simultaneous, dynamic control rates. Another key feature is the ability to live code; adding, removing, and modifying code on the fly, while the program is running, without stopping or restarting. It has a highly precise timing/concurrency model, allowing for arbitrarily fine granularity. It offers composers and researchers a powerful and flexible programming tool for building and experimenting with complex audio synthesis programs, and real-time interactive control. ChucK was created and chiefly designed by Ge Wang as a graduate student working with Perry R. Cook. ChucK is distributed freely under the terms of the GNU General Public License on Mac OS X, Linux and Microsoft Windows. On iPhone and iPad, ChiP (ChucK for iPhone) is distributed under a limited, closed source license, and is not currently licensed to the public. However, the core team has stated that it would like to explore \"ways to open ChiP by creating a beneficial environment for everyone\".", "pageId": 478750, "dailyPageViews": 63, "created": 2004, "backlinksCount": 118, "revisionCount": 319, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/ChucK" }, "githubLanguage": { "fileExtensions": [ "ck" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "java", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-java", "tmScope": "source.java", "repos": 571, "id": "ChucK" }, "githubBigQuery": { "repos": 95, "users": 85, "id": "ChucK" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 21, "commitCount": 283, "url": "https://github.com/textmate/java.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ChucK", "tiobe": { "id": "Ch" }, "fileType": "text", "wordRank": 6367, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ciao-programming-language": { "title": "Ciao", "appeared": 1984, "type": "pl", "website": "http://ciao-lang.org", "country": [ "Spain and United States" ], "originCommunity": [ "IMDEA Software Institute", "Universidad Politécnica de Madrid", "University of Texas", "Microelectronics and Technology Corporation" ], "domainName": { "registered": 2013, "name": "ciao-lang.org" }, "wikipedia": { "related": [ "unix", "prolog", "c", "java" ], "summary": "Ciao is a general-purpose programming language which supports logic, constraint, functional, higher-order, and object-oriented programming styles. Its main design objectives are high expressive power, extensibility, safety, reliability, and efficient execution.", "created": 2011, "backlinksCount": 16, "pageId": 31540643, "revisionCount": 47, "dailyPageViews": 15, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Ciao_%28programming_language%29" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9277054|Ciao – Logic, constraint, functional, higher-order, and object-oriented language|http://ciao-lang.org/|2015-03-27 16:01:12 UTC|1427472072|wuschel|6|82", "hopl": "https://hopl.info/showlanguage.prx?exp=5477", "centralPackageRepositoryCount": 0 }, "ciel": { "title": "Ciel", "appeared": 2010, "type": "pl", "creators": [ "Ron Garret" ], "description": "Ciel is a lisp-like language implemented in C++. What Clojure is to Java, Ciel is designed to be to C++.", "country": [ "United States" ], "originCommunity": [ "https://flownet.com" ], "writtenIn": [ "cpp" ], "example": [ "(set lambda fn)\n(set def set)\n(def vector (lambda x x))\n(vector 1 2 3)" ], "githubRepo": { "firstCommit": 2010, "stars": 71, "forks": 9, "subscribers": 5, "created": 2010, "updated": 2022, "description": "A Lisp-like language implemented in C++", "issues": 0, "url": "https://github.com/rongarret/ciel" }, "repoStats": { "firstCommit": 2010, "commits": 6, "committers": 3, "files": 14 } }, "cif": { "title": "Crystallographic Information File", "appeared": 1991, "type": "textDataFormat", "reference": [ "https://www.iucr.org/resources/cif/spec/version1.1/cifsyntax" ], "country": [ "United Kingdom and Germany" ], "originCommunity": [ "International Union of Crystallography" ], "wikipedia": { "summary": "Crystallographic Information File (CIF) is a standard text file format for representing crystallographic information, promulgated by the International Union of Crystallography (IUCr). CIF was developed by the IUCr Working Party on Crystallographic Information in an effort sponsored by the IUCr Commission on Crystallographic Data and the IUCr Commission on Journals. The file format was initially published by Hall, Allen, and Brown and has since been revised, most recently version 1.1. Full specifications for the format are available at the IUCr website. Many computer programs for molecular viewing are compatible with this format, including Jmol. Closely related is mmCIF, macromolecular CIF, which is intended as an alternative to the Protein Data Bank (PDB) format. Also closely related is Crystallographic Information Framework, a broader system of exchange protocols based on data dictionaries and relational rules expressible in different machine-readable manifestations, including, but not restricted to, Crystallographic Information File and XML.", "backlinksCount": 24, "pageId": 6100843, "dailyPageViews": 41, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Crystallographic_Information_File" } }, "cigale": { "title": "Cigale", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/71184cb8ab020a6f7147a3ca9fb9454ac76c7a01" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1204", "centralPackageRepositoryCount": 0 }, "cil": { "title": "CIL", "appeared": 2000, "type": "pl", "documentation": [ "http://people.eecs.berkeley.edu/~necula/cil/" ], "standsFor": "Common Intermediate Language", "aka": [ "Microsoft Intermediate Language MSIL" ], "originCommunity": [ "Microsoft" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "call", "void", "[mscorlib]System.Console::WriteLine" ] ], "stringToken": [ [ "\"" ] ], "example": [ ".assembly Hello {}\n.assembly extern mscorlib {}\n.method static void Main()\n{\n .entrypoint\n .maxstack 1\n ldstr \"Hello, world!\"\n call void [mscorlib]System.Console::WriteLine(string)\n ret\n}" ], "wikipedia": { "example": [ ".method assembly static void modopt([mscorlib]System.Runtime.CompilerServices.CallConvCdecl) \n test_pointer_operations(int32 param) cil managed\n{\n .vtentry 1 : 1\n // Code size 44 (0x2c)\n .maxstack 2\n .locals ([0] int32* ptr,\n [1] valuetype A* V_1,\n [2] valuetype A* a,\n [3] int32 k)\n// k = 0;\n IL_0000: ldc.i4.0 \n IL_0001: stloc.3\n// ptr = &k;\n IL_0002: ldloca.s k // load local's address instruction\n IL_0004: stloc.0\n// *ptr = 1;\n IL_0005: ldloc.0\n IL_0006: ldc.i4.1\n IL_0007: stind.i4 // indirection instruction\n// ptr = ¶m\n IL_0008: ldarga.s param // load parameter's address instruction\n IL_000a: stloc.0\n// *ptr = 2\n IL_000b: ldloc.0\n IL_000c: ldc.i4.2\n IL_000d: stind.i4\n// a = new A;\n IL_000e: ldloca.s a\n IL_0010: call valuetype A* modopt([mscorlib]System.Runtime.CompilerServices.CallConvThiscall) 'A.{ctor}'(valuetype A* modopt([mscorlib]System.Runtime.CompilerServices.IsConst) modopt([mscorlib]System.Runtime.CompilerServices.IsConst))\n IL_0015: pop\n// ptra = &a;\n IL_0016: ldloca.s a\n IL_0018: stloc.1\n// ptra->meth();\n IL_0019: ldloc.1\n IL_001a: dup\n IL_001b: ldind.i4 // reading the VMT for virtual call\n IL_001c: ldind.i4\n IL_001d: calli unmanaged stdcall void modopt([mscorlib]System.Runtime.CompilerServices.CallConvStdcall)(native int)\n IL_0022: ret\n} // end of method 'Global Functions'::test_pointer_operations" ], "related": [ "cli-assembly", "assembly-language", "csharp", "x86-isa", "java-bytecode", "visual-basic.net" ], "summary": "Common Intermediate Language (CIL, pronounced either sil or kil), formerly called Microsoft Intermediate Language (MSIL), is the lowest-level human-readable programming language defined by the Common Language Infrastructure (CLI) specification and is used by the .NET Framework and Mono. Languages which target a CLI-compatible runtime environment compile to CIL, which is assembled into an object code that has a bytecode-style format. CIL is an object-oriented assembly language, and is entirely stack-based. Its bytecode is translated into native code or—most commonly—executed by a virtual machine. CIL was originally known as Microsoft Intermediate Language (MSIL) during the beta releases of the .NET languages. Due to standardization of C# and the Common Language Infrastructure, the bytecode is now officially known as CIL.", "pageId": 46004, "dailyPageViews": 212, "created": 2002, "backlinksCount": 168, "revisionCount": 342, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Common_Intermediate_Language" }, "leachim6": { "filepath": "c/Cil.il", "fileExtensions": [ "il" ], "example": [ "// ilasm cil.il\n.assembly HelloWorld {}\n.method public static void Main() cil managed\n{\n .entrypoint\n .maxstack 1\n ldstr \"Hello World\"\n call void [mscorlib]System.Console::WriteLine(string)\n ret\n}\n" ], "id": "Cil" }, "rijuRepl": { "example": [ ".assembly main {}\n.class Main\n{\n .method static void Main() cil managed\n {\n .entrypoint\n ldstr \"Hello, world!\"\n call void [mscorlib]System.Console::WriteLine(string)\n ret\n }\n}" ], "id": "https://riju.codes/cil" }, "indeedJobs": { "2022": 0, "query": "cil developer" }, "tiobe": { "id": "CIL" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCIL Programming: Under the Hood of .Net|2002|Jason Bock|253979|3.50|2|0", "isbndb": "year|publisher|title|authors|isbn13\n2008|Apress|CIL Programming: Under the Hood of .NET (Expert's Voice)|Bock, Jason|9781430208457\n2002|Apress|CIL Programming: Under the Hood of .NET|Bock, Jason|9781590590416\n2013|Apress|CIL Programming: Under the Hood of .NET|Bock, Jason|9781430251569", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2004|CIL + Metadata > Executable Program|10.5381/jot.2004.3.2.a2|8|0|Giuseppe Attardi and A. Cisternino and Diego Colombo|5391e1abf4e75970c25bfed0fc0548bb62bcd4aa\n1984|Interactive verification of communication software on the basis of CIL|10.1145/800056.802065|7|1|H. Krumm and O. Drobnik|b2379292d4ba1430da0ceb5bd007574b7bc7bb42\n2002|CIL Programming: Under the Hood™ of .NET|10.1007/978-1-4302-0845-7|5|0|Jason Bock|eec8568a3e6a51db647aafcac1779eb8993bae4d\n2018|CIL to Java-Bytecode Translation for Static Analysis Leveraging|10.1145/3193992.3193994|3|0|Pietro Ferrara and A. Cortesi and F. Spoto|24536578ef032ac8f7076fa381a920bd4386b6db" }, "cilk": { "title": "CIL", "appeared": 1994, "type": "pl", "website": "http://www.cilk.com/", "country": [ "United States" ], "originCommunity": [ "Intel" ], "domainName": { "registered": 1999, "name": "cilk.com" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "// y ← α x + y\n void axpy(int n, float alpha, const float *x, float *y)\n {\n for (int i = 0; i < n; i++) {\n y[i] += alpha * x[i];\n }\n }" ], "related": [ "c", "opencl", "nesl", "unified-parallel-c" ], "summary": "Cilk, Cilk++ and Cilk Plus are general-purpose programming languages designed for multithreaded parallel computing. They are based on the C and C++ programming languages, which they extend with constructs to express parallel loops and the fork–join idiom. Originally developed in the 1990s at the Massachusetts Institute of Technology (MIT) in the group of Charles E. Leiserson, Cilk was later commercialized as Cilk++ by a spinoff company, Cilk Arts. That company was subsequently acquired by Intel, which increased compatibility with existing C and C++ code, calling the result Cilk Plus.", "pageId": 945803, "dailyPageViews": 85, "created": 2004, "backlinksCount": 179, "revisionCount": 211, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Cilk" }, "githubLanguage": { "type": "data", "fileExtensions": [ "cil" ], "aceMode": "text", "tmScope": "source.cil", "repos": 1, "id": "CIL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Cilk", "tiobe": { "id": "CIL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1899", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|Apress|CIL Programming: Under the Hood of .NET (Expert's Voice)|Bock, Jason|9781430208457\n2002|Apress|CIL Programming: Under the Hood of .NET|Bock, Jason|9781590590416\n2013|Apress|CIL Programming: Under the Hood of .NET|Bock, Jason|9781430251569", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2004|CIL + Metadata > Executable Program|10.5381/jot.2004.3.2.a2|8|0|Giuseppe Attardi and A. Cisternino and Diego Colombo|5391e1abf4e75970c25bfed0fc0548bb62bcd4aa\n1984|Interactive verification of communication software on the basis of CIL|10.1145/800056.802065|7|1|H. Krumm and O. Drobnik|b2379292d4ba1430da0ceb5bd007574b7bc7bb42\n2002|CIL Programming: Under the Hood™ of .NET|10.1007/978-1-4302-0845-7|5|0|Jason Bock|eec8568a3e6a51db647aafcac1779eb8993bae4d\n2018|CIL to Java-Bytecode Translation for Static Analysis Leveraging|10.1145/3193992.3193994|3|0|Pietro Ferrara and A. Cortesi and F. Spoto|24536578ef032ac8f7076fa381a920bd4386b6db" }, "cimfast": { "title": "cimfast", "appeared": 1991, "type": "pl", "description": "CIMfast was an event driven language for \"computer integrated manufacturing\", developed in the early 1990's. It was high level language used to control BaseStar. BaseStar was a software library for manufacturing support (basically it was messaging middleware, nothing specific for any kind of industry), developed and sold by DEC. It had C API. CIMfast was language intended to replace the need for low level C. CIMfast controlled manufacturing line was deployed by Fiat.", "reference": [ "http://www.activityclub.org/decnotes/showconf.php?conf=340" ], "fileExtensions": [ "cel" ], "country": [ "United States" ], "originCommunity": [ "DEC" ] }, "cims-pl-i": { "title": "CIMS PL/I", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/14c285f087bd69de2f79f7647e552e8a8d0c3a0f" ], "country": [ "United States" ], "originCommunity": [ "Courant Institute of Mathematical Sciences" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1900", "centralPackageRepositoryCount": 0 }, "cir": { "title": "CIR", "appeared": 2020, "type": "ir", "description": "Clang IR (CIR) is a new IR for Clang.", "website": "https://facebookincubator.github.io/clangir/", "reference": [ "https://news.ycombinator.com/item?id=31904624", "https://discourse.llvm.org/t/rfc-an-mlir-based-clang-ir-cir/63319" ], "standsFor": "Clang IR", "country": [ "United States" ], "originCommunity": [ "Engineering at Meta" ], "related": [ "llvmir" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// Read from local variable, address in %0.\n%1 = cir.load %0 : !cir.ptr, i32\n\n// Load address from memory at address %0. %3 is used by at least one\n// operation that dereferences a pointer.\n%3 = cir.load deref %0 : cir.ptr >" ], "githubRepo": { "firstCommit": 2001, "stars": 150, "forks": 5, "subscribers": 9, "created": 2022, "updated": 2022, "description": "A new high-level IR for clang.", "issues": 0, "url": "https://github.com/facebookincubator/clangir" }, "isbndb": "" }, "circa": { "title": "circa", "appeared": 2012, "type": "pl", "website": "http://circa-lang.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/andyfischer" ], "domainName": { "registered": 2020, "name": "circa-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n3864676|Circa is a programming language for live coding, in development|http://circa-lang.org/about/introduction.html|2012-04-19 19:28:17 UTC|1334863697|barrybe|32|116" }, "circal": { "title": "CIRCAL", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4d29be5bab2a6ef5e285819432654042ba3ae006" ], "country": [ "Scotland" ], "originCommunity": [ "University of Edinburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1132", "centralPackageRepositoryCount": 0, "isbndb": "" }, "circle-lang": { "title": "circle-lang", "appeared": 2019, "type": "pl", "creators": [ "Sean Baxter" ], "description": "The C++ Automation Language", "website": "http://www.circle-lang.org/", "reference": [ "https://news.ycombinator.com/item?id=23086227" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/seanbaxter" ], "domainName": { "registered": 2019, "name": "circle-lang.org" }, "githubRepo": { "firstCommit": 2019, "stars": 1254, "forks": 45, "subscribers": 52, "created": 2019, "updated": 2022, "description": "The compiler is available for download. Get it!", "issues": 36, "url": "https://github.com/seanbaxter/circle" }, "repoStats": { "firstCommit": 2019, "commits": 375, "committers": 4, "files": 510 }, "isbndb": "" }, "cirru": { "title": "Cirru", "appeared": 2012, "type": "pl", "creators": [ "ChenYong" ], "description": "Cirru Project helps people code in syntax tree. It offers a tree editor and a text syntax.", "website": "http://text.cirru.org/", "reference": [ "https://github.com/Cirru/cirru-parser/wiki/About-Cirru" ], "country": [ "China" ], "originCommunity": [ "https://github.com/Cirru" ], "domainName": { "name": "text.cirru.org" }, "hasSemanticIndentation": { "example": "print\n + 1 2\n , 11", "value": true }, "example": [ "set a\n add\n number 1\n number 2" ], "githubLanguage": { "fileExtensions": [ "cirru" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "cirru", "tmScope": "source.cirru", "repos": 346, "id": "Cirru" }, "githubBigQuery": { "repos": 288, "users": 266, "id": "Cirru" }, "pygmentsHighlighter": { "filename": "webmisc.py", "fileExtensions": [ "cirru" ], "id": "Cirru" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2015, "committerCount": 3, "commitCount": 31, "sampleCount": 9, "example": [ "\nrequire ./stdio.cr" ], "url": "https://github.com/Cirru/sublime-cirru" }, "twitter": "https://twitter.com/cirrulang", "fileType": "text", "centralPackageRepositoryCount": 0 }, "cish": { "title": "Cish", "appeared": 2022, "type": "pl", "description": "Cish", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/voohrh/cish/", "https://reddit.com/r/ProgrammingLanguages/comments/vgbtmd/superforth_v11/" ], "oldName": "SuperForth", "country": [ "United States" ], "originCommunity": [ "https://github.com/TheRealMichaelWang" ] }, "cito": { "title": "Ć", "appeared": 2011, "type": "pl", "creators": [ "Piotr Fusik" ], "description": "Ć programming language. Translated automatically to C, C++, C#, Java, JavaScript, Python, Swift, TypeScript and OpenCL C.", "website": "https://github.com/pfusik/cito", "country": [ "Unknown" ], "originCommunity": [ "http://fusik.info/piotr/" ], "example": [ "public class HelloCi\n{\n public static string GetMessage()\n {\n return \"Hello, world!\";\n }\n}" ], "githubRepo": { "stars": 1400, "forks": 40, "subscribers": 26, "created": 2011, "updated": 2022, "description": "Ć programming language. Translated automatically to C, C++, C#, Java, JavaScript, Python, Swift, TypeScript and OpenCL C.", "url": "https://github.com/pfusik/cito" }, "repoStats": { "firstCommit": 2011, "commits": 2070, "committers": 8, "files": 620 } }, "citrine": { "title": "Citrine", "appeared": 2014, "type": "pl", "website": "http://citrine-lang.org/", "reference": [ "https://news.ycombinator.com/item?id=23885059" ], "country": [ "The Netherlands" ], "originCommunity": [ "gaborsoftware.nl" ], "domainName": { "registered": 2014, "name": "citrine-lang.org" }, "example": [ "salut := 'Bună țară!'.\nsalut țară: 'România'.\nscrie: salut." ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Citrine" }, "twitter": "https://twitter.com/citrinelanguage", "centralPackageRepositoryCount": 0 }, "cityhash-hash-function": { "title": "cityhash-hash-function", "appeared": 2011, "type": "hashFunction", "reference": [ "https://opensource.googleblog.com/2011/04/introducing-cityhash.html" ], "country": [ "United States" ], "originCommunity": [ "Google" ], "githubRepo": { "firstCommit": 2011, "stars": 875, "forks": 168, "subscribers": 41, "created": 2015, "updated": 2022, "description": "Automatically exported from code.google.com/p/cityhash", "issues": 13, "url": "https://github.com/google/cityhash" } }, "cixl": { "title": "cixl", "appeared": 2018, "type": "pl", "githubRepo": { "url": "https://github.com/basic-gongfu/cixl" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n16057489|Show HN: Cixl – a minimal, decently typed scripting language|2018-01-03 01:11:49 UTC|1514941909|sifoo|0|2" }, "cl-i": { "title": "CL-I", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8a4bed9ba734d807bd0ab87f9f2e49807132a4f0" ], "country": [ "United States" ], "originCommunity": [ "Technical Operations Incorporated" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3017", "centralPackageRepositoryCount": 0 }, "claire": { "title": "CLAIRE", "appeared": 2004, "type": "pl", "creators": [ "Yves Caseau" ], "country": [ "France" ], "originCommunity": [ "Bouygues' e-Lab research laboratory" ], "visualParadigm": false, "wikipedia": { "example": [ "fib(n:integer) : integer\n-> (if (n < 2) 1\nelse fib(n - 1) + fib(n - 2))" ], "related": [ "smalltalk", "setl", "ops5", "lisp", "ml", "c", "java", "ocaml", "scala", "f-sharp" ], "summary": "Claire is a high-level functional and object-oriented programming language with rule processing abilities. It was designed by Yves Caseau at Bouygues' e-Lab research laboratory, and received its final definition in 2004. Claire provides: a simple object system with parametric classes and methods polymorphic and parametric functional programming production rules triggered by events versioned snapshots of the state of the whole system, or any part, supporting rollback and easy exploration of search spaces explicit relations between entities; for example, two entities might be declared inverses of one another first-class sets with convenient syntax for set-based programming an expressive set-based type system allowing both second-order static and dynamic typingClaire's reference implementation, consisting of an interpreter and compiler, was fully open-sourced with the release of version 3.3.46 in February 2009. Another implementation, WebClaire, is commercially supported.", "pageId": 930956, "created": 2004, "backlinksCount": 18, "revisionCount": 96, "dailyPageViews": 9, "appeared": 2004, "fileExtensions": [ "cl" ], "url": "https://en.wikipedia.org/wiki/Claire_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1902", "fileType": "text", "wordRank": 8044, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "clamp": { "title": "Common Lisp with Arc Macros and Procedures", "appeared": 2014, "type": "pl", "standsFor": "Common Lisp with Arc Macros and Procedures", "country": [ "United States" ], "originCommunity": [ "https://github.com/malisper" ], "example": [ "(map [+ _ 1] '(1 2 3))" ], "githubRepo": { "firstCommit": 2014, "stars": 68, "forks": 4, "subscribers": 9, "created": 2014, "updated": 2022, "description": "Common Lisp with Arc Macros and Procedures", "issues": 0, "url": "https://github.com/malisper/Clamp" }, "repoStats": { "firstCommit": 2014, "commits": 675, "committers": 5, "files": 65 }, "semanticScholar": "" }, "clanger": { "title": "CLANGER", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/84b45cb9368d15f63f1183fa73e33680ada60e5d" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4450", "centralPackageRepositoryCount": 0, "isbndb": "" }, "clarion": { "title": "Clarion", "appeared": 1986, "type": "pl", "website": "http://www.softvelocity.com", "country": [ "United States" ], "originCommunity": [ "Jensen & Partners International", "Clarion International", "SoftVelocity" ], "domainName": { "registered": 2000, "awisRank": { "2022": 2887840 }, "name": "softvelocity.com" }, "wikipedia": { "example": [ "PROGRAM\n MAP\n END\n CODE\n MESSAGE('Hello World!','Clarion')\n RETURN" ], "related": [ "sql", "ascii", "csv", "foxpro", "dbase", "xml", "html", "pdf", "turbo-pascal" ], "summary": "Clarion is a commercial, 4GL, multi-paradigm, programming language and Integrated Development Environment from SoftVelocity used to program database applications. It is compatible with ISAM, SQL and ADO data access methods, reads and writes several flat file desktop database formats including ASCII, CSV, DOS (Binary), FoxPro, Clipper, dBase, and some relational databases via ODBC, MS SQL Server, Sybase SQL Anywhere and Oracle through the use of accelerated native database drivers, and XML, Clarion can be used to output to HTML, XML, plaintext, and PDF, among others. The Clarion Development Environment (IDE) sits on top of the Clarion Programming Language. The IDE provides code generation facilities via a system of templates which allow programmers to describe the program from an abstract level higher than actual code statements. The generator then turns this higher level into code, which in turn is then compiled and linked using a normal compiler and linker. This generation layer is sometimes referred to as 4GL programming. The generation layer is not required. It is possible to create programs completely at the code level (the so-called 3GL layer), bypassing all the code generation facilities. If the templates are used to generate code then programmers are able to inject their own code into the generated code to alter, or extend, the functionality offered by the template layer. This process of embedding code can be done while viewing the surrounding generated code. This mixing of template code and generated code allows the template settings to be updated, and the code regenerated, without the loss of the embedded code. The templates (from which the code is generated) are provided in source form and developers are free to create their own templates. A large collection of templates have been written by various developers some of which are offered as commercial add-ons and some of which are free. There are several Clarion products available; Clarion Professional Edition, Clarion Enterprise Edition and Clarion.Net.", "pageId": 508614, "dailyPageViews": 65, "created": 2004, "backlinksCount": 40, "revisionCount": 540, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Clarion_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "clw" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.clarion", "repos": 223, "id": "Clarion" }, "githubBigQuery": { "repos": 278, "users": 252, "id": "Clarion" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2018, "committerCount": 3, "commitCount": 67, "sampleCount": 4, "example": [ " PROGRAM\n\n MAP\n END\n\n CODE\n\n MESSAGE('Hello World!')\n\n RETURN" ], "url": "https://github.com/fushnisoft/SublimeClarion" }, "helloWorldCollection": [ "!Hello World in Clarion \n \n PROGRAM\n \n MAP\n END\n \n CODE\n \n MESSAGE('Hello World!')\n \n RETURN\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Clarion", "tiobe": { "id": "Clarion" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1903", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Clarion (programming Language)|Miller and Frederic P. and Vandome and Agnes F. and McBrewster and John|9786130282738\n1995|Sams|Developing Clarion For Windows Applications/book And Disk|Ross A. Santos and David Harms|9780672306747" }, "clarity": { "title": "clarity", "appeared": 2019, "type": "contractLanguage", "website": "https://docs.blockstack.org/core/smart/overview.html", "country": [ "United States" ], "originCommunity": [ "https://clarity-lang.org/" ], "githubRepo": { "stars": 160, "forks": 30, "subscribers": 24, "created": 2020, "updated": 2023, "description": "Overview of the Clarity language for smart contracts", "issues": 9, "url": "https://github.com/clarity-lang/overview" }, "repoStats": { "firstCommit": 2020, "commits": 8, "committers": 3, "files": 5 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "clar" ], "aceMode": "lisp", "tmScope": "source.clar", "repos": 84, "id": "Clarity" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n20308653|Show HN: Clarity language for predictable smart contracts|2019-06-28 20:45:43 UTC|1561754743|muneeb|0|3" }, "claro": { "title": "Claro", "appeared": 2021, "type": "pl", "creators": [ "Jason Steving" ], "website": "https://clarolang.com/", "country": [ "United States" ], "originCommunity": [ "https://github.com/JasonSteving99" ], "domainName": { "registered": 2020, "name": "clarolang.com" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "print" ] ], "githubRepo": { "firstCommit": 2020, "stars": 3, "forks": 1, "subscribers": 2, "created": 2020, "updated": 2022, "description": "Claro Lang", "issues": 18, "url": "https://github.com/JasonSteving99/claro-lang" }, "repoStats": { "firstCommit": 2020, "commits": 284, "committers": 3, "files": 345 }, "rijuRepl": { "example": [ "# Thanks for trying out Claro during its early development stages!\n# To learn Claro by example, check out:\n# https://clarolang.com/tree/main/src/java/com/claro/claro_programs\n\nprint(\"Hello, world!\");\n" ], "description": "High-level toy programming language providing standardized Software Engineering best practices out of the box", "fileExtensions": [ "claro" ], "website": "https://clarolang.com/", "gitRepo": "https://github.com/JasonSteving99/claro-lang", "id": "https://riju.codes/claro" } }, "clascal": { "title": "Clascal", "appeared": 1983, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Clascal" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3710", "centralPackageRepositoryCount": 0 }, "clash": { "title": "clash", "appeared": 2015, "type": "pl", "website": "http://www.clash-lang.org", "country": [ "The Netherlands" ], "originCommunity": [ "Haskell Foundation" ], "domainName": { "registered": 2015, "awisRank": { "2022": 456913 }, "name": "clash-lang.org" }, "githubRepo": { "stars": 1217, "forks": 134, "subscribers": 52, "created": 2013, "updated": 2023, "description": "Haskell to VHDL/Verilog/SystemVerilog compiler", "issues": 255, "url": "https://github.com/clash-lang/clash-compiler" }, "repoStats": { "firstCommit": 2012, "commits": 6632, "committers": 79, "files": 1351 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9516217|CλaSH – From Haskell to Hardware|http://www.clash-lang.org/|2015-05-09 12:50:01 UTC|1431175801|jdmoreira|55|158" }, "class": { "title": "CLASS", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e781175930bf95dfd327f75b3358906e2984d35c" ], "country": [ "United States" ], "originCommunity": [ "Air Force Logistics Command" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5148", "wordRank": 388, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1994|Engineering a Programming Language: The Type and Class System of Sather|10.1007/3-540-57840-4_33|89|5|C. Szyperski and S. Omohundro and S. Murer|47859a3e075dddf97b090c2316b67bc591783c14\n2018|A User-Friendly Hybrid Sparse Matrix Class in C++|10.1007/978-3-319-96418-8_50|66|0|C. Sanderson and Ryan R. Curtin|993f7e6b6c61fb85c7c4ef355e140a37f7f1f766\n1988|Object-oriented programming with class dictionaries|10.1007/BF01806171|32|1|K. Lieberherr|245a87995b8d172910867b81966c2d7163103125\n1992|A class of programming language mechanisms to facilitate multiple implementations of the same specification|10.1109/ICCL.1992.185491|7|0|M. Sitaraman|c87571871a8d6c428c10f37cdfa01c6a390faa04" }, "classic-ada": { "title": "Classic-Ada", "appeared": 1992, "type": "pl", "reference": [ "https://www.semanticscholar.org/paper/Object-oriented-programming-in-Classic-Ada-Nelson-Mota/17bde721a4ede89353143c95307de63574e4cc79" ], "country": [ "United States" ], "originCommunity": [ "Naval Postgraduate School", "Brazilian Navy" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1905", "centralPackageRepositoryCount": 0 }, "classic": { "title": "ClassiC", "appeared": 1998, "type": "pl", "reference": [ "https://www.sciencedirect.com/science/article/pii/S1383762197000891" ], "country": [ "United Kingdom" ], "originCommunity": [ "Coventry University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3546", "wordRank": 1360, "centralPackageRepositoryCount": 0 }, "clausal-lang": { "title": "Clausal Language", "appeared": 1997, "type": "pl", "description": "CL (Clausal Language) is a declarative programming language with the look and feel of a modern functional programming language. CL identifies the domain of symbolic expressions of LISP with the domain of natural numbers.", "website": "http://ii.fmph.uniba.sk/cl/view.php/", "reference": [ "http://dai.fmph.uniba.sk/~voda/" ], "aka": [ "cl" ], "country": [ "Slovakia" ], "originCommunity": [ "Comenius University Bratislava" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5505", "fileType": "text", "centralPackageRepositoryCount": 0 }, "clay": { "title": "clay", "appeared": 2010, "type": "pl", "creators": [ "KS Sreeram", "Joe Groff" ], "website": "http://claylabs.com/clay", "reference": [ "https://bitbucket.org/kssreeram/clay/src/default/" ], "country": [ "Various" ], "originCommunity": [ "https://claylabs.com/" ], "hasPrintDebugging": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "println" ] ], "example": [ "import printer.(println);\n\nfactorial1(n) {\n if (n == 0)\n return 1;\n return n*factorial1(n-1);\n}\n\nfactorial2(n) {\n var p = 1;\n again :\n if (n == 0)\n return p;\n p *: n;\n n -: 1;\n goto again;\n}\n\nfactorial3(n) {\n var p = 1;\n while (true) {\n if (n == 0) break;\n p *: n;\n n -: 1;\n }\n return p;\n}\n\nfactorial4(n) {\n var p = 1;\n for (i in range(n))\n p *: i+1;\n return p;\n}\n\nmain() {\n var n = 7;\n n -: 1;\n var f = factorial4(n);\n println(\"factorial(\", n, \") = \", f);\n return 0;\n}" ], "githubRepo": { "firstCommit": 2010, "stars": 395, "forks": 37, "subscribers": 23, "created": 2010, "updated": 2022, "description": "The Clay programming language", "issues": 63, "url": "https://github.com/jckarter/clay" }, "repoStats": { "firstCommit": 2010, "commits": 8315, "committers": 40, "files": 1530 }, "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "clay" ], "id": "Clay" }, "projectEuler": { "memberCount": { "2022": 5 }, "id": "Clay" }, "twitter": "https://twitter.com/claylabs", "isbndb": "" }, "clean": { "title": "Clean", "appeared": 1987, "type": "pl", "website": "http://clean.cs.ru.nl", "documentation": [ "https://wiki.clean.cs.ru.nl/Documentation" ], "fileExtensions": [ "icl", "dcl", "abc", "sapl" ], "country": [ "Netherlands" ], "originCommunity": [ "Radboud University Nijmegen" ], "domainName": { "name": "clean.cs.ru.nl" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "case", "ccall", "class", "code", "code", "inline", "derive", "export", "foreign", "generic", "if", "in", "infix", "infixl", "infixr", "instance", "let", "of", "otherwise", "special", "stdcall", "where", "with" ], "wikipedia": { "example": [ "(^) infixr 8 :: Int Int -> Int\n (^) x 0 = 1\n (^) x n = x * x ^ (n-1)" ], "related": [ "miranda", "haskell", "c", "solaris", "linux", "fibonacci", "prolog" ], "summary": "Clean is a general-purpose purely functional computer programming language. For much of the language's active development history it was called Concurrent Clean, but this was dropped at some point.", "pageId": 161878, "dailyPageViews": 52, "created": 2002, "backlinksCount": 41, "revisionCount": 390, "appeared": 1987, "fileExtensions": [ "icl", "dcl", "abc", "sapl" ], "url": "https://en.wikipedia.org/wiki/Clean_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "icl", "dcl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.clean", "repos": 206, "id": "Clean" }, "githubBigQuery": { "repos": 263, "users": 231, "id": "Clean" }, "pygmentsHighlighter": { "filename": "clean.py", "fileExtensions": [ "icl", "dcl" ], "id": "Clean" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 2, "commitCount": 25, "sampleCount": 9, "example": [ "definition module GenMap\n\nimport StdGeneric\n\ngeneric gMap a b :: .a -> .b\nderive gMap c, UNIT, PAIR, EITHER, CONS, FIELD, OBJECT, {}, {!} \n\nderive gMap [], (,), (,,), (,,,), (,,,,), (,,,,,), (,,,,,,), (,,,,,,,)\n\n" ], "url": "https://github.com/timjs/atom-language-clean.git" }, "helloWorldCollection": [ "// Hello World in Clean\n\nmodule hello\n\nStart :: String\nStart = \"Hello World!\\n\"\n" ], "leachim6": { "filepath": "c/Clean.icl", "fileExtensions": [ "icl" ], "example": [ "module hello\nStart :: {#Char}\nStart = \"Hello World\"\n" ], "id": "Clean" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Clean", "compilerExplorer": { "example": [ "module example\n\nimport StdInt\n\nsquare :: Int -> Int\nsquare n = n * n\n\nStart :: Int\nStart = square 3\n" ], "id": "Clean" }, "rijuRepl": { "example": [ "module main\n\nimport StdEnv\n\nStart world\n #(console, world) = stdio world\n #console = fwrites \"Hello, world!\\n\" console\n #(ok, world) = fclose console world\n = world\n" ], "description": "General-purpose purely functional computer programming language", "fileExtensions": [ "icl", "dcl", "abc" ], "website": "https://clean.cs.ru.nl/Clean", "gitRepo": "https://gitlab.science.ru.nl/clean-compiler-and-rts/compiler", "id": "https://riju.codes/clean" }, "tryItOnline": "clean", "tiobe": { "id": "Clean" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1305", "fileType": "text", "wordRank": 1809, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011|Pearson|The Clean Coder: A Code of Conduct for Professional Programmers|Martin, Robert|9780137081073\n2020|No Starch Press|Beyond the Basic Stuff with Python: Best Practices for Writing Clean Code|Sweigart, Al|9781593279677\n2017|Pearson|Clean Architecture: A Craftsman's Guide to Software Structure and Design (Robert C. Martin Series)|C., Martin Robert|9780134494326\n2018|Packt Publishing|Reactive Programming with Swift 4: Build asynchronous reactive applications with easy-to-maintain and clean code using RxSwift and Xcode 9|Singh, Navdeep|9781787120211\n2018|Packt Publishing|Clean Code in Python: Refactor your legacy code base|Anaya, Mariano|9781788837064\n2020|No Starch Press|Beyond the Basic Stuff with Python: Best Practices for Writing Clean Code|Sweigart, Al|9781593279660\n2019|Pearson|Clean Agile: Back to Basics (Robert C. Martin Series)|C., Martin Robert|9780135781999\n2021|Packt Publishing|Clean Code in Python: Develop maintainable and efficient code, 2nd Edition|Anaya, Mariano|9781800562097\n2021|Addison-Wesley Professional|Clean Craftsmanship: Disciplines, Standards, and Ethics (Robert C. Martin Series)|Martin, Robert C.|9780136915836", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1995|The ins and outs of Clean I/O|10.1017/S0956796800001258|90|8|P. Achten and M. J. Plasmeijer|4124fc65e84e6232b6e00ebbe5233ba421ef806f\n1997|Interactive Functional Objects in Clean|10.1007/BFb0055438|44|2|P. Achten and M. J. Plasmeijer|494110f72ac432c12d716be98b08c268f15f0cc2\n2011|Clean Translation of an Imperative Reversible Programming Language|10.1007/978-3-642-19861-8_9|31|2|Holger Bock Axelsen|6a98a6e70a1d3c21ad583ef6a83a83224d18c524\n2017|Luandri: A Clean Lua Interface to the Indri Search Engine|10.1145/3077136.3080650|5|0|Bhaskar Mitra and Fernando Diaz and Nick Craswell|0af8eea643b0391fb552db4828d7706366ee546f\n2010|Exchanging sources between clean and Haskell: a double-edged front end for the clean compiler|10.1145/1863523.1863530|4|0|John H. G. van Groningen and T. V. Noort and P. Achten and P. Koopman and M. J. Plasmeijer|acfddf78d7f34f83eafd13a9ee70d52c79af3ae7" }, "cleanlang": { "title": "cleanlang", "appeared": 2017, "type": "pl", "creators": [ "Santosh Rajan" ], "website": "https://www.npmjs.com/package/cleanlang", "country": [ "India" ], "originCommunity": [ "https://www.geekskool.com/" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n14753846|Show HN: `cleanlang` a clean compile to JavaScript language|2017-07-12 16:24:02 UTC|1499876642|santrajan|0|2", "twitter": "https://twitter.com/npmjs" }, "clear": { "title": "CLEAR", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6789dd3c3c211738e6d12ff918147867400c1974" ], "country": [ "Scotland" ], "originCommunity": [ "University of Edinburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=945", "wordRank": 907, "centralPackageRepositoryCount": 0 }, "cleo": { "title": "Clear Language for Expressing Orders", "appeared": 1963, "type": "pl", "standsFor": "Clear Language for Expressing Orders", "country": [ "United Kingdom" ], "originCommunity": [ "English Electric LEO Co" ], "hopl": "https://hopl.info/showlanguage.prx?exp=318", "isbndb": "" }, "cleogo": { "title": "CLeogo", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b04baa516381ae90ad3863a2b5b64e82797c9a3f" ], "country": [ "New Zealand" ], "originCommunity": [ "University of Canterbury", "Christchurch School of Medicine" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5768", "centralPackageRepositoryCount": 0 }, "cleopatra": { "title": "CLEOPATRA", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9b4e7d47971b594a4679ef22c81ad905f7f6fd0c" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3422", "centralPackageRepositoryCount": 0 }, "cli-assembly": { "title": "Assembly CLI", "appeared": 2005, "type": "library", "aka": [ "cli" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "example": [ ".method private hidebysig static void Main(string[] args) cil managed {\n .entrypoint\n .custom instance void [mscorlib]System.STAThreadAttribute::.ctor() = ( 01 00 00 00 )\n // Code size 11 (0xb)\n .maxstack 1\n IL_0000: ldstr \"Hello World\"\n IL_0005: call void [mscorlib]System.Console::WriteLine(string)\n IL_000a: ret } // end of method Class1::Main" ], "related": [ "cil", "visual-studio-editor", "fat", "ntfs" ], "summary": "Defined by Microsoft for use in recent versions of Windows, an assembly in the Common Language Infrastructure (CLI) is a compiled code library used for deployment, versioning, and security. There are two types: process assemblies (EXE) and library assemblies (DLL). A process assembly represents a process that will use classes defined in library assemblies. CLI assemblies contain code in CIL, which is usually generated from a CLI language, and then compiled into machine language at run time by the just-in-time compiler. In the .NET Framework implementation, this compiler is part of the Common Language Runtime (CLR). An assembly can consist of one or more files. Code files are called modules. An assembly can contain more than one code module. And since it is possible to use different languages to create code modules, it is technically possible to use several different languages to create an assembly. Visual Studio however does not support using different languages in one assembly.", "pageId": 2016154, "dailyPageViews": 44, "created": 2005, "backlinksCount": 101, "revisionCount": 409, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Assembly_(CLI)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "click": { "title": "Click", "appeared": 1999, "type": "pl", "website": "https://github.com/kohler/click/wiki/Language", "documentation": [ "https://click.palletsprojects.com/en/8.1.x/" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "booleanTokens": [ [ "true", "false" ] ], "githubRepo": { "firstCommit": 1999, "stars": 667, "forks": 316, "subscribers": 75, "created": 2010, "updated": 2022, "description": "The Click modular router: fast modular packet processing and analysis", "issues": 140, "url": "https://github.com/kohler/click" }, "repoStats": { "firstCommit": 1999, "commits": 10877, "committers": 144, "files": 1971 }, "githubLanguage": { "fileExtensions": [ "click" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.click", "repos": 39, "id": "Click" }, "githubBigQuery": { "repos": 127, "users": 115, "id": "Click" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2017, "committerCount": 4, "commitCount": 22, "sampleCount": 2, "example": [ "rates :: AvailableRates\nelementclass sr2 {\n $sr2_ip, $sr2_nm, $wireless_mac, $gateway, $probes|\n\n\narp :: ARPTable();\nlt :: LinkTable(IP $sr2_ip);\n\n\ngw :: SR2GatewaySelector(ETHTYPE 0x062c,\n\t\t IP $sr2_ip,\n\t\t ETH $wireless_mac,\n\t\t LT lt,\n\t\t ARP arp,\n\t\t PERIOD 15,\n\t\t GW $gateway);\n\n\ngw -> SR2SetChecksum -> [0] output;\n\nset_gw :: SR2SetGateway(SEL gw);\n\n\nes :: SR2ETTStat(ETHTYPE 0x0641, \n\t ETH $wireless_mac, \n\t IP $sr2_ip, \n\t PERIOD 30000,\n\t TAU 300000,\n\t ARP arp,\n\t PROBES $probes,\n\t ETT metric,\n\t RT rates);\n\n\nmetric :: SR2ETTMetric(LT lt);\n\n\nforwarder :: SR2Forwarder(ETHTYPE 0x0643, \n\t\t\t IP $sr2_ip, \n\t\t\t ETH $wireless_mac, \n\t\t\t ARP arp, \n\t\t\t LT lt);\n\n\nquerier :: SR2Querier(ETH $wireless_mac, \n\t\t SR forwarder,\n\t\t LT lt, \n\t\t ROUTE_DAMPENING true,\n\t\t TIME_BEFORE_SWITCH 5,\n\t\t DEBUG true);\n\n\nquery_forwarder :: SR2MetricFlood(ETHTYPE 0x0644,\n\t\t\t IP $sr2_ip, \n\t\t\t ETH $wireless_mac, \n\t\t\t LT lt, \n\t\t\t ARP arp,\n\t\t\t DEBUG false);\n\nquery_responder :: SR2QueryResponder(ETHTYPE 0x0645,\n\t\t\t\t IP $sr2_ip, \n\t\t\t\t ETH $wireless_mac, \n\t\t\t\t LT lt, \n\t\t\t\t ARP arp,\n\t\t\t\t DEBUG true);\n\n\nquery_responder -> SR2SetChecksum -> [0] output;\nquery_forwarder -> SR2SetChecksum -> SR2Print(forwarding) -> [0] output;\nquery_forwarder [1] -> query_responder;\n\ndata_ck :: SR2SetChecksum() \n\ninput [1] \n-> host_cl :: IPClassifier(dst net $sr2_ip mask $sr2_nm,\n\t\t\t\t-)\n-> querier\n-> data_ck;\n\n\nhost_cl [1] -> [0] set_gw [0] -> querier;\n\nforwarder[0] \n -> dt ::DecIPTTL\n -> data_ck\n -> [2] output;\n\n\ndt[1] \n-> Print(ttl-error) \n-> ICMPError($sr2_ip, timeexceeded, 0) \n-> querier;\n\n\n// queries\nquerier [1] -> [1] query_forwarder;\nes -> SetTimestamp() -> [1] output;\n\n\nforwarder[1] //ip packets to me\n -> SR2StripHeader()\n -> CheckIPHeader()\n -> from_gw_cl :: IPClassifier(src net $sr2_ip mask $sr2_nm,\n\t\t\t\t-)\n -> [3] output;\n\nfrom_gw_cl [1] -> [1] set_gw [1] -> [3] output;\n\n input [0]\n -> ncl :: Classifier(\n\t\t\t12/0643 , //sr2_forwarder\n\t\t\t12/0644 , //sr2\n\t\t\t12/0645 , //replies\n\t\t\t12/0641 , //sr2_es\n\t\t\t12/062c , //sr2_gw\n\t\t\t);\n \n \n ncl[0] -> SR2CheckHeader() -> [0] forwarder;\n ncl[1] -> SR2CheckHeader() -> PrintSR(query) -> query_forwarder\n ncl[2] -> SR2CheckHeader() -> query_responder;\n ncl[3] -> es;\n ncl[4] -> SR2CheckHeader() -> gw;\n \n}\n\n\n\nIdle -> s :: sr2(2.0.0.1, 255.0.0.0, 00:00:00:00:00:01, false, \"12 60 12 1500\") -> Discard;\nIdle -> [1] s;\ns[1] -> Discard;\ns[2] -> Discard;\ns[3] -> Discard;\n" ], "url": "https://github.com/stenverbois/language-click.git" }, "fileType": "text", "wordRank": 94, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "clickpath": { "title": "clickpath", "appeared": 2011, "type": "queryLanguage", "website": "http://infunl.com/ql", "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n3352368|Show HN: Clickpath query language|2011-12-14 16:16:58 UTC|1323879418|Qwl|8|25" }, "clike": { "title": "clike", "appeared": 2014, "type": "pl", "originCommunity": [ "https://github.com/combinatorylogic/" ], "githubRepo": { "stars": 128, "forks": 6, "subscribers": 6, "created": 2014, "updated": 2022, "firstCommit": 2014, "description": "A simple C-like language compiler with an extensible syntax and typed macros support", "issues": 2, "url": "https://github.com/combinatorylogic/clike" }, "repoStats": { "firstCommit": 2014, "commits": 22, "committers": 2, "files": 66 }, "codeMirror": "clike", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "clion-editor": { "title": "clion-editor", "appeared": 2015, "type": "editor" }, "clipper": { "title": "Clipper", "appeared": 1985, "type": "pl", "demoVideo": [ "https://www.youtube.com/watch?v=Opv647iFbAk" ], "website": "http://www.grafxsoft.com/clipper.htm", "country": [ "United States" ], "originCommunity": [ "Nantucket Corporation" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "USE Customer SHARED NEW\nclear\n@ 1, 0 SAY \"CustNum\" GET Customer->CustNum PICT \"999999\" VALID Customer->CustNum > 0\n@ 3, 0 SAY \"Contact\" GET Customer->Contact VALID !empty(Customer->Contact)\n@ 4, 0 SAY \"Address\" GET Customer->Address\nREAD" ], "related": [ "xbase", "c", "visual-objects", "visual-basic", "delphi", "xbasepp", "linux", "unix", "visual-foxpro", "sql", "dbase" ], "summary": "Clipper is an xBase compiler, which is a computer programming language, that is used to create software programs that originally operated primarily under MS-DOS. Although it is a powerful general-purpose programming language, it was primarily used to create database/business programs.", "pageId": 246367, "dailyPageViews": 99, "created": 2003, "backlinksCount": 70, "revisionCount": 235, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Clipper_(programming_language)" }, "helloWorldCollection": [ "// Hello World in Clipper\n\n? \"Hello World\"" ], "leachim6": { "filepath": "c/Clipper.prg", "fileExtensions": [ "prg" ], "example": [ "? \"Hello World\"\n" ], "id": "Clipper" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Clipper", "tiobe": { "id": "Clipper" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1909", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1992|Microtrend|Clipper Programming Guide, Version 5.01 (Lance A. Leventhal Microtrend Series)|Spence, Rick|9780915391684\n1991|Holt, Henry & Company, Inc.|Clipper 5: A Developer's Guide|Joseph D. Booth and Greg Lief and Craig Yellick|9781558512429\n1988|Addison-Wesley|Programming in Clipper: The Definitive Guide to the Clipper dBASE Compiler|Straley, Stephen J.|9780201145830\n1991T|Microtrend Books|Clipper programming guide (The Data based advisor series)|Spence, Rick|9780915391417\n1991|Que Pub|Using Clipper (Programming Series)|Tiley, W. Edward|9780880228855\n1994|Butterworth-Heinemann|Clipper Programming by Example|Darling, Paul|9780750620819\n1995|Walnut Creek Cdrom|Clipper|Walnut Creek Cdrom (firm)|9781571760821\n||Clipper Programming|Beam and Gary|9780830635429\n1990|Mcgraw-hill Osborne Media|Clipper Programming|Dan Parsons|9780078816499\n1991|Mcgraw-hill Osborne Media|Clipper Programming|Brett Oliver and Jim Sheldon|9780078817588\n1992|Slawson Communications|Clipper Database Programming|Michael Towle|9781850581734\n1988/12/31|Pearson Scott Foresman|Programming in Clipper|Justin Werner and Bruce C. Donaldson and Margaret A. Zinky|9780673383617\n2004|Ediciones Diaz De Santos S A|Programacion En Clipper 5/ Programming In Clipper 5 (spanish Edition)|M. Schinkel and J. Kaster|9780201601213\n1988|Addison-wesley Pub. Co|Programming In Clipper: The Definitive Guide To The Clipper Dbase Compiler|Stephen J Straley|9780201119930\n1991|Que Pub|Clipper Programmer's Reference (programming Series)|W. Edward Tiley|9780880226776\n1990|Addison-wesley|Advanced Programming In Clipper With C|Straley, Stephen J. and Karasek, David.|9780201517354\n1993|Random House Electronic Publishing,U.S.|Straley's Programming with Clipper|Stephen J. Straley|9780679791546\n1992|Addison-wesley (c)|Programming In Clipper 5/includes Version 5.01|Mike Schinkel|9780201570182\n1994/11/01|Random House Electronic Publishing,U.S.|Straley's Object-Oriented Clipper Programming|Stephen J. Straley|9780679791409\n1989|Microtrend Books|Clipper Programming Guide (the Data Based Advisor Series)|Rick Spence|9780915391318\n1995|Richard D Irwin|Xbase Programming For The True Beginner: An Introduction To The Xbase Language In The Context Of Dbase Iii+, Iv, 5, Foxpro, And Clipper|Eugene Kaluzniacky and Vijay Kanabar|9780256204322", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Automating tasks in protein structure determination with the clipper python module|10.1002/pro.3299|5|0|S. McNicholas and T. Croll and T. Burnley and Colin M. Palmer and Soon Wen Hoh and H. Jenkins and Eleanor Dodson and K. Cowtan and J. Agirre|4c477e1555359e79f90e4184526893dbdce78028" }, "clips": { "title": "CLIPS", "appeared": 1985, "type": "pl", "website": "http://www.clipsrules.net/", "documentation": [ "https://www.clipsrules.net/Documentation.html" ], "standsFor": "C Language Integrated Production System", "country": [ "United States" ], "originCommunity": [ "NASA" ], "domainName": { "registered": 2016, "awisRank": { "2022": 1175916 }, "name": "clipsrules.net" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "stringToken": [ [ "\"" ] ], "example": [ " (deftemplate car_problem\n (slot name)\n (slot status))\n\n (deffacts trouble_shooting\n (car_problem (name ignition_key) (status on))\n (car_problem (name engine) (status wont_start))\n (car_problem (name headlights) (status work)))\n\n (defrule rule1\n (car_problem (name ignition_key) (status on))\n (car_problem (name engine) (status wont_start))\n =>\n (assert (car_problem (name starter) (status faulty))))" ], "wikipedia": { "example": [ "(deftemplate car_problem\n (slot name)\n (slot status))\n\n (deffacts trouble_shooting\n (car_problem (name ignition_key) (status on))\n (car_problem (name engine) (status wont_start))\n (car_problem (name headlights) (status work)))\n\n (defrule rule1\n (car_problem (name ignition_key) (status on))\n (car_problem (name engine) (status wont_start))\n =>\n (assert (car_problem (name starter) (status faulty))))" ], "related": [ "ops5", "c", "lisp", "java", "isbn" ], "summary": "CLIPS is a public domain software tool for building expert systems. The name is an acronym for \"C Language Integrated Production System.\" The syntax and name was inspired by Charles Forgy's OPS (\"Official Production System,\" although there was nothing really official about it). The first versions of CLIPS were developed starting in 1985 at NASA-Johnson Space Center (as an alternative for existing system ART*Inference) until the mid-1990s when the development group's responsibilities ceased to focus on expert system technology. The original name of the project was NASA's AI Language (NAIL). CLIPS is probably the most widely used expert system tool. CLIPS incorporates a complete object-oriented language (hence the acronym COOL) for writing expert systems. CLIPS itself is written in C, extensions can be written in C, and CLIPS can be called from C. Its user interface closely resembles that of the programming language Lisp. COOL combines the programming paradigms of procedural, object oriented and logical (theorem proving) languages.", "pageId": 418603, "created": 2003, "backlinksCount": 39, "revisionCount": 274, "dailyPageViews": 86, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/CLIPS" }, "githubLanguage": { "fileExtensions": [ "clp" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.clips", "repos": 1638, "id": "CLIPS" }, "githubBigQuery": { "repos": 991, "users": 901, "id": "CLIPS" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2016, "committerCount": 3, "commitCount": 30, "sampleCount": 2, "example": [ ";;; http://www.angusj.com/sudoku/hints\n;;; http://www.scanraid.com/BasicStrategies.htm\n;;; http://www.sudokuoftheday.com/pages/techniques-overview\n;;; http://www.sudokuonline.us/sudoku_solving_techniques\n;;; http://www.sadmansoftware.com/sudoku/techniques.htm\n;;; http://www.krazydad.com/blog/2005/09/29/an-index-of-sudoku-strategies/\n\n;;; #######################\n;;; DEFTEMPLATES & DEFFACTS\n;;; #######################\n\n(deftemplate possible\n (slot row)\n (slot column)\n (slot value)\n (slot group)\n (slot id))\n \n(deftemplate impossible\n (slot id)\n (slot value)\n (slot priority)\n (slot reason))\n \n(deftemplate technique-employed\n (slot reason)\n (slot priority))\n\n(deftemplate technique\n (slot name)\n (slot priority))\n \n(deffacts startup\n (phase grid-values))\n\n(deftemplate size-value\n (slot size)\n (slot value))\n \n(deffacts values\n (size-value (size 1) (value 1))\n (size-value (size 2) (value 2))\n (size-value (size 2) (value 3))\n (size-value (size 2) (value 4))\n (size-value (size 3) (value 5))\n (size-value (size 3) (value 6))\n (size-value (size 3) (value 7))\n (size-value (size 3) (value 8))\n (size-value (size 3) (value 9))\n (size-value (size 4) (value 10))\n (size-value (size 4) (value 11))\n (size-value (size 4) (value 12))\n (size-value (size 4) (value 13))\n (size-value (size 4) (value 14))\n (size-value (size 4) (value 15))\n (size-value (size 4) (value 16))\n (size-value (size 5) (value 17))\n (size-value (size 5) (value 18))\n (size-value (size 5) (value 19))\n (size-value (size 5) (value 20))\n (size-value (size 5) (value 21))\n (size-value (size 5) (value 22))\n (size-value (size 5) (value 23))\n (size-value (size 5) (value 24))\n (size-value (size 5) (value 25)))\n \n;;; ###########\n;;; SETUP RULES\n;;; ###########\n\n;;; ***********\n;;; stress-test\n;;; ***********\n\n(defrule stress-test\n \n (declare (salience 10))\n \n (phase match)\n \n (stress-test)\n \n (priority ?last)\n \n (not (priority ?p&:(> ?p ?last)))\n \n (technique (priority ?next&:(> ?next ?last)))\n \n (not (technique (priority ?p&:(> ?p ?last)&:(< ?p ?next))))\n \n =>\n \n (assert (priority ?next)))\n \n;;; *****************\n;;; enable-techniques\n;;; *****************\n\n(defrule enable-techniques\n\n (declare (salience 10))\n \n (phase match)\n \n (size ?)\n \n (not (possible (value any)))\n \n =>\n \n (assert (priority 1)))\n\n;;; **********\n;;; expand-any\n;;; **********\n\n(defrule expand-any\n\n (declare (salience 10))\n\n (phase expand-any)\n \n ?f <- (possible (row ?r) (column ?c) (value any) (group ?g) (id ?id))\n \n (not (possible (value any) (id ?id2&:(< ?id2 ?id))))\n \n (size ?s)\n \n (size-value (size ?as&:(<= ?as ?s)) (value ?v))\n \n (not (possible (row ?r) (column ?c) (value ?v)))\n \n (not (and (size-value (value ?v2&:(< ?v2 ?v)))\n \n (not (possible (row ?r) (column ?c) (value ?v2)))))\n \n =>\n \n (assert (possible (row ?r) (column ?c) (value ?v) (group ?g) (id ?id))))\n \n;;; *****************\n;;; position-expanded\n;;; *****************\n\n(defrule position-expanded\n\n (declare (salience 10))\n\n (phase expand-any)\n \n ?f <- (possible (row ?r) (column ?c) (value any) (group ?g) (id ?id))\n \n (size ?s)\n \n (not (and (size-value (size ?as&:(<= ?as ?s)) (value ?v))\n \n (not (possible (row ?r) (column ?c) (value ?v)))))\n\n =>\n \n (retract ?f))\n \n;;; ###########\n;;; PHASE RULES\n;;; ###########\n\n;;; ***************\n;;; expand-any-done\n;;; ***************\n\n(defrule expand-any-done\n\n (declare (salience 10))\n\n ?f <- (phase expand-any)\n\n (not (possible (value any)))\n \n =>\n \n (retract ?f)\n \n (assert (phase initial-output))\n (assert (print-position 1 1)))\n \n;;; ***********\n;;; begin-match\n;;; ***********\n\n(defrule begin-match\n\n (declare (salience -20))\n \n ?f <- (phase initial-output)\n \n =>\n \n (retract ?f)\n \n (assert (phase match)))\n\n;;; *****************\n;;; begin-elimination\n;;; *****************\n\n(defrule begin-elimination\n\n (declare (salience -20))\n \n ?f <- (phase match)\n \n (not (not (impossible)))\n \n =>\n \n (retract ?f)\n \n (assert (phase elimination)))\n\n;;; *************\n;;; next-priority\n;;; *************\n\n(defrule next-priority\n\n (declare (salience -20))\n \n (phase match)\n \n (not (impossible))\n \n (priority ?last)\n \n (not (priority ?p&:(> ?p ?last)))\n \n (technique (priority ?next&:(> ?next ?last)))\n \n (not (technique (priority ?p&:(> ?p ?last)&:(< ?p ?next))))\n \n =>\n \n (assert (priority ?next)))\n\n;;; ************\n;;; begin-output\n;;; ************\n\n(defrule begin-output\n\n (declare (salience -20))\n \n ?f <- (phase match)\n \n (not (impossible))\n \n (priority ?last)\n \n (not (priority ?p&:(> ?p ?last)))\n\n (not (technique (priority ?next&:(> ?next ?last))))\n \n =>\n \n (retract ?f)\n \n (assert (phase final-output))\n (assert (print-position 1 1)))\n\n \n\n \n \n \n \n \n \n \n \n \n \n \n" ], "url": "https://github.com/psicomante/CLIPS-sublime" }, "leachim6": { "filepath": "c/CLIPS.clips", "fileExtensions": [ "clips" ], "example": [ "(defrule hw\n (f ?x)\n=>\n (printout t ?x crlf))\n\n(assert (f \"Hello World\"))\n\n(run)\n" ], "id": "CLIPS" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:CLIPS", "tryItOnline": "clips", "hopl": "https://hopl.info/showlanguage.prx?exp=1759", "fileType": "text", "wordRank": 2427, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Internet of Smart Things - IoST: Using Blockchain and CLIPS to Make Things Autonomous|10.1109/IEEE.ICCC.2017.9|63|4|Mayra Samaniego and R. Deters|5e32390ddfd8658f8453c86e3bd51936bb7a0f67\n2017|Recommendation of Instructional Video Clips for HTML Learners Based on the ID3 Algorithm|10.1109/IIAI-AAI.2017.84|1|0|Ting-Chia Hsu and Kai-Zhong Zhou|1bd14d790a2abaa69d9a7114cf864d970516f63b\n2020|Research on Fault Diagnosis Expert System of On-board Radio of a Certain Armored Vehicle Based on CLIPS|10.1007/978-3-030-63784-2_82|1|0|Changhong Gong and Xiao Ming and Lingxiang Xia|46a02d369c374e0420ae13f4fa0a17e838318f78" }, "clisp": { "title": "CLISP", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4fa23aa15e2d62ee9f3a4091d8b05b1fe4dcd1ac" ], "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "write-line" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "common-lisp", "unix", "c" ], "summary": "In computing, CLISP is an implementation of the programming language Common Lisp originally developed by Bruno Haible and Michael Stoll for the Atari ST. Today it supports the Unix and Microsoft Windows operating systems. CLISP includes an interpreter, a bytecode compiler, debugger, socket interface, high-level foreign language interface, strong internationalization support, and two object systems: Common Lisp Object System (CLOS) and metaobject protocol (MOP). It is written in C and Common Lisp. It is now part of the GNU Project and is free software, available under the terms of the GNU General Public License (GPL).", "backlinksCount": 118, "pageId": 940494, "dailyPageViews": 31, "created": 2004, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/CLISP" }, "leachim6": { "filepath": "c/CLISP.lisp", "fileExtensions": [ "lisp" ], "example": [ "(write-line \"Hello World\")" ], "id": "CLISP" }, "tryItOnline": "clisp", "hopl": "https://hopl.info/showlanguage.prx?exp=604", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "clist": { "title": "CLIST", "appeared": 1990, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "1 /********************************************************************/\n 2 /* MULTI-LINGUAL \"HELLO WORLD\" PROGRAM. */\n 3 /* */\n 4 /* THIS CLIST, STORED AS USERID.TSO.CLIST(TEST), CAN BE INVOKED */\n 5 /* FROM THE ISPF COMMAND LINE AS SHOWN IN THE FOLLOWING EXAMPLE: */\n 6 /* */\n 7 /* COMMAND ===> TSO TEST SPANISH */\n 8 /* */\n 9 /********************************************************************/\n10 PROC 1 LANGUAGE\n11 IF &LANGUAGE = SPANISH THEN +\n12 WRITE HOLA, MUNDO\n13 ELSE IF &LANGUAGE = FRENCH THEN +\n14 WRITE BONJOUR, MONDE\n15 ELSE +\n16 WRITE HELLO, WORLD\n17 EXIT" ], "related": [ "batch", "cobol", "pl-i", "jcl", "rexx" ], "summary": "CLIST (Command List) (pronounced \"C-List\") is a procedural programming language for TSO in MVS systems. It originated in OS/360 Release 20 and has assumed a secondary role since the availability of Rexx in TSO/E Version 2. The term CLIST is also used for command lists written by users of NetView.In its basic form, a CLIST program (or \"CLIST\" for short) can take the form of a simple list of commands to be executed in strict sequence (like a DOS batch file (*.bat) file). However, CLIST also features If-Then-Else logic as well as loop constructs. CLIST is an interpreted language. That is, the computer must translate a CLIST every time the program is executed. CLISTs therefore tend to be slower than programs written in compiled languages such as COBOL, FORTRAN, or PL/1. (A program written in a compiled language is translated once to create a \"load module\" or executable.) CLIST can read/write MVS files and read/write from/to a TSO terminal. It can read parameters from the caller and also features a function to hold global variables and pass them between CLISTs. A CLIST can also call an MVS application program (written in COBOL or PL/I, for example). CLISTs can be run in background (by running JCL which executes the TSO control program (IKJEFT01)). TSO I/O screens and menus using ISPF dialog services can be displayed by CLISTs. Compare the function of CLIST with that provided by REXX.", "pageId": 391542, "created": 2003, "backlinksCount": 24, "revisionCount": 63, "dailyPageViews": 21, "appeared": 1956, "url": "https://en.wikipedia.org/wiki/CLIST" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3423", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nClist Programming|1990|Kurt Bosler|4579164|2.00|1|0\nCommand Language Cookbook For Mainframes, Minicomputers, And Pc's: Dos/Os/2 Batch Language, Clist, Dcl, Perl, And Rexx|1992|Hallett German|1795689|5.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n1990|Mcgraw-hill|Clist Programming (j Ranade Ibm Series)|Kurt Bosler|9780070065512" }, "clix": { "title": "CLiX markup", "appeared": 1998, "type": "xmlFormat", "description": "CLiX is a constraint language based on first order logic. It was first specified in 1998, when XML was not yet ubiquitous, in research at University College London. The language has since been developed and taken forward by Systemwire Ltd., a spin-off company that provides rule-based validation products around CLiX. Even though a commercial implementation is available, the language specification is published, and free for anybody to implement. It is hosted at http://www.clixml.org.", "website": "http://www.clixml.org/", "reference": [ "https://www.w3.org/2004/12/rules-ws/paper/24/" ], "country": [ "England" ], "originCommunity": [ "University College London" ], "domainName": { "name": "clixml.org" }, "example": [ "\n \n" ], "wikipedia": { "summary": "Constraint Language in XML (CLiX) used to constrain the content of XML documents. It is based on first order logic and XPath, and its purpose is to enable the specification of constraints on the structure and content of XML documents. CLiX constraints can be used both to constraint documents internally and to execute inter-document checks between a number of documents. The goal of CLiX is to enable users and developers to express business properties and complex constraints that cannot be handled in traditional schema languages, and to automate checks that would otherwise have to be hard-coded.", "backlinksCount": 2, "pageId": 44979100, "dailyPageViews": 2, "url": "https://en.wikipedia.org/wiki/CLiX_(markup)" } }, "cloc": { "title": "cloc", "appeared": 2006, "type": "application", "creators": [ "Al Danial" ], "reference": [ "http://cloc.sourceforge.net/" ], "standsFor": "Count Lines Of Code", "country": [ "United States" ], "originCommunity": [ "https://github.com/AlDanial" ], "githubRepo": { "firstCommit": 2015, "stars": 14319, "forks": 831, "subscribers": 205, "created": 2015, "updated": 2022, "description": "cloc counts blank lines, comment lines, and physical lines of source code in many programming languages.", "issues": 19, "url": "https://github.com/AlDanial/cloc" } }, "cloe": { "title": "cloe", "appeared": 2018, "type": "pl", "website": "https://cloe-lang.org", "originCommunity": [ "https://github.com/cloe-lang" ], "domainName": { "registered": 2018, "name": "cloe-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n17043881|Cloe programming language|https://cloe-lang.org|2018-05-10 23:52:51 UTC|1525996371|raviqqe42|0|3" }, "clojars-pm": { "title": "clojars-pm", "appeared": 2009, "type": "packageManager", "website": "https://clojars.org/", "country": [ "New Zealand and United States" ], "originCommunity": [ "https://github.com/clojars" ], "domainName": { "registered": 2009, "awisRank": { "2022": 758932 }, "name": "clojars.org" }, "packageCount": 23459, "forLanguages": [ "clojure" ], "twitter": "https://twitter.com/clojars" }, "clojure": { "title": "Clojure", "appeared": 2007, "type": "pl", "creators": [ "Rich Hickey" ], "website": "https://clojure.org", "documentation": [ "https://clojuredocs.org/", "https://clojure-doc.org/" ], "reference": [ "https://download.clojure.org/papers/clojure-hopl-iv-final.pdf" ], "cheatSheetUrl": [ "http://web.csulb.edu/~artg/524/clojure-cheat-sheet-a4-grey.pdf" ], "fileExtensions": [ "clj", "cljs", "cljc", "edn" ], "country": [ "United States" ], "originCommunity": [ "Cognitect, Inc" ], "domainName": { "registered": 2005, "awisRank": { "2017": 105076, "2022": 176648 }, "name": "clojure.org" }, "releaseNotesUrl": "https://clojure.org/releases/devchangelog", "runsOnVm": [ "jvm" ], "isLisp": { "example": "", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasPartialApplication": { "example": "(defn fun-full [x y] (+ x y))\n(fun-full 2 3)\n(def fun-half (partial fun-full 2))\n(fun-half 3)", "value": true }, "hasComments": { "example": "", "value": true }, "hasImports": { "example": "(load \"fun\")\n(load \"files/fun\")\n(load-file \"./files/fun.clj\")\n(defproject project-a\n:dependencies [[org.clojure/clojure \"1.5.1\"]\n [project-b \"0.1.0\"]])\n(require '[clojure.string :as string])\n(use '[clojure.string :only [split]])\n(import 'java.util.Date)\n(java.util.Date.)\n(require 'clojure.contrib.def 'clojure.contrib.except 'clojure.contrib.sql)\n(require '(clojure.contrib def except sql))", "value": true }, "hasMacros": { "example": "; https://www.braveclojure.com/writing-macros/\n; https://clojure.org/reference/macros\n(defmacro and\n \"Evaluates exprs one at a time, from left to right. If a form\n returns logical false (nil or false), and returns that value and\n doesn't evaluate any of the other expressions, otherwise it returns\n the value of the last expr. (and) returns true.\"\n {:added \"1.0\"}\n ([] true)\n ([x] x)\n ([x & next]\n `(let [and# ~x]\n (if and# (and ~@next) and#))))", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasHomoiconicity": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "(comment A comment\n)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasHexadecimals": { "example": "; 0x-?[abcdef\\d]+", "value": true }, "hasFloats": { "example": "; -?\\d+\\.\\d+", "value": true }, "hasIntegers": { "example": "; -?\\d+", "value": true }, "lineCommentToken": [ [ ";" ] ], "multiLineCommentTokens": [ [ "(comment", ")" ] ], "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "gource": "https://www.youtube.com/watch?v=wM5sxT0BEdU", "githubRepo": { "stars": 9941, "forks": 1457, "subscribers": 690, "created": 2010, "updated": 2023, "description": "The Clojure programming language", "issues": 0, "url": "https://github.com/clojure/clojure" }, "repoStats": { "firstCommit": 2006, "commits": 3861, "committers": 215, "files": 323 }, "wikipedia": { "example": [ ";; A typical entry point of a Clojure program:\n;; `-main` function\n(defn -main ; name\n [& args] ; (variable) parameters\n (println \"Hello, World!\")) ; body" ], "related": [ "jvm", "csharp", "common-lisp", "erlang", "haskell", "mathematica", "ml", "prolog", "scheme", "java", "racket", "ruby", "elixir", "lisp", "maven-pom", "s-expressions", "csp", "actionscript", "python", "unicode" ], "summary": "Clojure ( , like \"closure\") is a dialect of the Lisp programming language. Clojure is a general-purpose programming language with an emphasis on functional programming. It runs on the Java virtual machine and the Common Language Runtime. Like other Lisps, Clojure treats code as data and has a macro system. The current development process is community-driven, overseen by Rich Hickey as its benevolent dictator for life (BDFL). Clojure encourages immutability and immutable data structures. While its type system is entirely dynamic, recent efforts have also sought the implementation of gradual typing. Clojure encourages programmers to be explicit about managing state and identity. This focus on programming with immutable values and explicit progression-of-time constructs is intended to facilitate developing more robust programs, especially multithreaded ones. Clojure is used in industry by firms such as Funding Circle, Walmart, Puppet, and other large software firms. Commercial support for Clojure is provided by Cognitect. Annual Clojure conferences are organised every year across the globe, the most famous of them being Clojure/conj (US east coast), Clojure/West (US west coast), and EuroClojure (Europe). The latest stable version of Clojure is 1.8, released on January 19, 2016. The first stable release was version 1.0, released on May 4, 2009. Clojure is free software released under the Eclipse Public License.", "pageId": 16561990, "dailyPageViews": 610, "created": 2008, "backlinksCount": 363, "revisionCount": 594, "appeared": 2007, "fileExtensions": [ "clj", "cljs", "cljc", "edn" ], "url": "https://en.wikipedia.org/wiki/Clojure" }, "githubLanguage": { "fileExtensions": [ "clj", "bb", "boot", "cl2", "cljc", "cljs", "cljshl", "cljscm", "cljx", "hic" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ntonsky FiraCode https://github.com/tonsky.png https://github.com/tonsky/FiraCode Clojure #db5855 38337 1263 1065 \"Monospaced font with programming ligatures\"\nstatus-im status-react https://github.com/status-im.png https://github.com/status-im/status-react Clojure #db5855 2759 701 44 \"a free (libre) open source, mobile OS for Ethereum\"\nfunctional-koans clojure-koans https://github.com/functional-koans.png https://github.com/functional-koans/clojure-koans Clojure #db5855 3168 1833 22 \"A set of exercises for learning Clojure\"\nDay8 re-frame https://github.com/Day8.png https://github.com/Day8/re-frame Clojure #db5855 3897 515 61 \"A Reagent Framework For Writing SPAs, in Clojurescript.\"\nmetabase metabase https://github.com/metabase.png https://github.com/metabase/metabase Clojure #db5855 16675 2211 484 \"The simplest, fastest way to get business intelligence and analytics to everyone in your company 😋\"\nring-clojure ring https://github.com/ring-clojure.png https://github.com/ring-clojure/ring Clojure #db5855 2869 437 31 \"Clojure HTTP server abstraction\"\nLightTable LightTable https://github.com/LightTable.png https://github.com/LightTable/LightTable Clojure #db5855 10751 913 65 \"The Light Table IDE ⛺\"\nreagent-project reagent https://github.com/reagent-project.png https://github.com/reagent-project/reagent Clojure #db5855 3544 294 48 \"A minimalistic ClojureScript interface to React.js\"", "trendingProjectsCount": 9, "type": "programming", "filenames": [ "riemann.config" ], "interpreters": [ "bb" ], "aceMode": "clojure", "codemirrorMode": "clojure", "codemirrorMimeType": "text/x-clojure", "tmScope": "source.clojure", "repos": 82125, "id": "Clojure" }, "githubBigQuery": { "repos": 25889, "users": 13795, "id": "Clojure" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/clojure", "monaco": "clojure", "codeMirror": "clojure", "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "clj", "cljc" ], "id": "Clojure" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 36, "commitCount": 149, "sampleCount": 9, "example": [ "(defn rand\n \"Returns a random floating point number between 0 (inclusive) and\n n (default 1) (exclusive).\"\n ([] (scm* [n] (random-real)))\n ([n] (* (rand) n)))" ], "url": "https://github.com/atom/language-clojure" }, "languageServerProtocolProject": [ "https://github.com/snoe/clojure-lsp\nwrittenIn clojure" ], "projectEuler": { "memberCount": { "2019": 1572, "2022": 1655 }, "id": "Clojure" }, "helloWorldCollection": [ "; Hello world in Clojure\n\n(defn hello []\n (println \"Hello world!\"))\n\n(hello)" ], "leachim6": { "filepath": "c/Clojure.clj", "fileExtensions": [ "clj" ], "example": [ "(println \"Hello World\")\n" ], "id": "Clojure" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Clojure", "quineRelay": "Clojure", "rijuRepl": { "example": [ "(println \"Hello, world!\")\n" ], "description": "Modern, dynamic, and functional dialect of the Lisp programming language on the Java platform", "fileExtensions": [ "clj", "cljc", "edn" ], "website": "https://clojure.org/", "gitRepo": "https://github.com/clojure/clojure", "id": "https://riju.codes/clojure" }, "replit": "https://repl.it/languages/clojure", "tryItOnline": "clojure", "indeedJobs": { "2017": 355, "query": "clojure engineer" }, "linkedInSkill": { "2018": 11354, "id": "clojure" }, "stackOverflowSurvey": { "2021": { "users": 1552, "medianSalary": 95000, "fans": 2413, "percentageUsing": 0.02 } }, "officialBlogUrl": [ "https://clojure.org/news/news" ], "eventsPageUrl": [ "https://clojure.org/events/2022/reclojure" ], "faqPageUrl": [ "https://clojure.org/guides/faq" ], "downloadPageUrl": [ "https://clojure.org/releases/downloads" ], "subreddit": [ { "memberCount": { "2017": 12947, "2022": 29258 }, "url": "https://reddit.com/r/Clojure" } ], "meetup": { "memberCount": 163418, "groupCount": 378, "url": "https://www.meetup.com/topics/clojure" }, "tiobe": { "currentRank": 42, "id": "Clojure" }, "packageRepository": [ "https://clojars.org/" ], "ubuntuPackage": "clojure", "jupyterKernel": [ "https://github.com/roryk/clojupyter", "https://github.com/achesnais/clj-jupyter" ], "fileType": "text", "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Clojure|2009|Stuart Halloway|6025753|3.82|559|45\nClojure Programming|2011|Chas Emerick|15799459|4.18|423|30\nClojure Reactive Programming|2015|Leonardo Borges|44920753|3.81|21|1\nClojure Cookbook: Recipes for Functional Programming|2014|Luke VanderHart|26177078|3.75|55|5\nClojure High Performance Programming|2013|Shantanu Kumar|26977256|2.84|19|4", "isbndb": "year|publisher|title|authors|isbn13\n2015|Packt Publishing|Clojure Reactive Programming|Borges, Leonardo|9781783986668\n2012|O'Reilly Media|Clojure Programming: Practical Lisp for the Java World|Emerick, Chas and Carper, Brian and Grand, Christophe|9781449394707\n2011|Manning Publications|The Joy of Clojure: Thinking the Clojure Way|Michael Fogus and Chris Houser|9781935182641\n2015|Pragmatic Bookshelf|Clojure Applied: From Practice to Practitioner|Vandgrift, Ben and Miller, Alex|9781680500745\n2014|Pragmatic Bookshelf|Mastering Clojure Macros: Write Cleaner, Faster, Smarter Code|Jones, Colin|9781941222225\n2012|Pragmatic Bookshelf|Programming Clojure|Halloway, Stuart and Bedra, Aaron|9781934356869\n2014|Packt Publishing|Mastering Clojure Data Analysis|Rochester, Eric|9781783284139\n2016|Packt Publishing|Mastering Clojure|Wali, Akhil|9781785889745\n2016|Packt Publishing|Clojure for Java Developers|Diaz, Eduardo|9781785281501\n2014|Manning Publications|The Joy of Clojure|Michael Fogus and Chris Houser|9781617291418\n2021|Pragmatic Bookshelf|Web Development with Clojure|Sotnikov, Dmitri and Brown, Scot|9781680508840\n2020|Packt Publishing|The Clojure Workshop: Use functional programming to build data-centric applications with Clojure and ClojureScript|Fahey, Joseph and Haratyk, Thomas and McCaughie, Scott and Sharvit, Yehonathan and Szydlo, Konrad|9781838825119\n2016|Wrox|Professional Clojure|Anderson, Jeremy and Gaare, Michael and Holguín, Justin and Bailey, Nick and Pratley, Timothy|9781119267294\n2016|Wrox|Professional Clojure|Anderson, Jeremy and Gaare, Michael and Holguín, Justin and Bailey, Nick and Pratley, Timothy|9781119267270\n2018-03-20T00:00:01Z|Pragmatic Bookshelf|Programming Clojure (The Pragmatic Programmers)|Miller, Alex and Halloway, Stuart and Bedra, Aaron|9781680502466\n2015|Packt Publishing|Clojure for Data Science|Garner, Henry|9781784397180\n2015|Packt Publishing|Clojure Reactive Programming - How to Develop Concurrent and Asynchronous Applications with Clojure|Borges, Leonardo|9781783986675\n2014|O'Reilly Media|Clojure Cookbook: Recipes for Functional Programming|VanderHart, Luke and Neufeld, Ryan|9781449366179\n2015|Addison-Wesley Professional|Clojure Recipes (Developer's Library)|Gamble, Julian|9780133430073\n2014|Packt Publishing|Clojure for Machine Learning|Wali, Akhil|9781783284351\n2009-06-07T00:00:01Z|Pragmatic Bookshelf|Programming Clojure (Pragmatic Programmers)|Halloway, Stuart|9781934356333\n2010|Apress|Practical Clojure (Expert's Voice in Open Source)|VanderHart, Luke and Sierra, Stuart|9781430272304\n2015|Packt Publishing|Clojure Data Structures and Algorithms Cookbook|Naccache, Rafik|9781785281457\n2016|Packt Publishing|Clojure Programming Cookbook|Hashimoto, Makoto and Modrzyk, Nicolas|9781785885037\n2013|Packt Publishing|Clojure High Performance Programming|Kumar, Shantanu|9781782165606\n2013|Packt Publishing|Clojure for Domain-specific Languages|D. Kelker, Ryan|9781782166504\n2016|Packt Publishing|Clojure for Finance|Washington, Timothy|9781785289286\n2010-09-01|dpunkt|Clojure|Stefan Kamphausen and Tim Oliver Kaiser|9783898648905\n20140305|O'Reilly Media, Inc.|Clojure Cookbook|Luke VanderHart; Ryan Neufeld|9781449366414\n20180509|O'Reilly Media, Inc.|Getting Clojure|Russ Olsen|9781680506099\n20150414|O'Reilly Media, Inc.|Living Clojure|Carin Meier|9781491909294\n28-03-2016|Packt Publishing|Mastering Clojure|Akhil Wali|9781785882050\n20191115|Packt Publishing|Clojure Polymorphism|Paul Stadig|9781838988371\n20150414|O'Reilly Media, Inc.|Living Clojure|Carin Meier|9781491909287\n20151216|Simon & Schuster|Clojure in Action|Amit Rathore|9781638355335\n25-01-2018|Packt Publishing|Microservices with Clojure|Anuj Kumar|9781788626316\n20120330|O'Reilly Media, Inc.|Clojure Programming|Chas Emerick; Brian Carper; Christophe Grand|9781449335359\n20140305|O'Reilly Media, Inc.|Clojure Cookbook|Luke VanderHart; Ryan Neufeld|9781449366407\n20120330|O'Reilly Media, Inc.|Clojure Programming|Chas Emerick; Brian Carper; Christophe Grand|9781449335342\n2016|Packt Publishing Ltd|Clojure Programming Cookbook|Makoto Hashimoto and Nicolas Modrzyk|9781785888519\n20140528|Simon & Schuster|The Joy of Clojure|Chris Houser; Michael Fogus|9781638351283\n2013-11-20|Packt Publishing|Clojure High Performance Programming|Shantanu Kumar|9781782165613\n2016-01-11|Packt Publishing|Clojure for Finance|Timothy Washington|9781785287619\n28-10-2016|Packt Publishing|Clojure Programming Cookbook|Makoto Hashimoto|9781785888519\n20150903|Packt Publishing|Clojure for Data Science|Henry Garner|9781784397500\n20150224|Packt Publishing|Clojure Web Development Essentials|Ryan Baldwin|9781784394875\n2014-04-24|Packt Publishing|Clojure for Machine Learning|Akhil Wali|9781783284368\n20160714|O'Reilly Media, Inc.|Web Development with Clojure|Dmitri Sotnikov|9781680505306\n23-02-2016|Packt Publishing|Clojure for Java Developers|Eduardo Diaz|9781785280412\n2013-12-18|Packt Publishing|Clojure for Domain-specific Languages|Ryan D. Kelker|9781782166511\n20151015|Random House Publishing Services|Clojure for the Brave and True|Daniel Higginbotham|9781593277239\n2015|Packt Publishing 2015-09-29|Clojure High Performance Programming - Second Edition|Kumar and Shantanu|9781785283642\n20150929|Packt Publishing|Clojure High Performance Programming - Second Edition|Shantanu Kumar|9781785287671\n20141030|Emereo|Clojure 134 Success Secrets - 134 Most Asked Questions On Clojure - What You Need To Know|Cynthia Harmon|9781488813016\n25-01-2019|Packt Publishing|Hands-On Reactive Programming with Clojure|Konrad Szydlo; Leonardo Borges|9781789341966", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2008|The Clojure programming language|10.1145/1408681.1408682|187|20|R. Hickey|d9567af818aae84bae7ec340aff4a7a664e1777a\n2010|Getting Started with Google App Engine and Clojure|10.1109/MIC.2010.92|36|3|Aaron Bedra|1bc8d663955e442c0ec6564e1abb6e05349ed048\n2020|A history of Clojure|10.1145/3386321|12|3|R. Hickey|f931ff3469da7d1537f338b63b0051e8709b4470\n2010|Practical Clojure|10.1007/978-1-4302-7230-4|5|0|Luke VanderHart and S. Sierra|733c78d87b4b684e6de3d7b5463fd837484e663a\n2010|cljRobust - Clojure Programming API for Lego Mindstorms NXT|10.1007/978-3-642-13541-5_6|4|0|K. Kułakowski|452889551382a4ba973482d6ac70599a1c889e02\n2017|An open source implementation of an intuitionistic fuzzy inference system in Clojure|10.1109/FUZZ-IEEE.2017.8015697|2|0|Amaury Hernández-Águila and Mario García Valdez and O. Castillo and J. J. M. Guervós|3a851fc47e922137f1829ca3fcce286982784a2f\n2019|Towards Static Verification of Clojure Contract-Based Programs|10.1007/978-3-030-29852-4_5|2|0|Gheorghe Pinzaru and V. Rivera|26132abec6e92e8df28cdea73b9b5f0411edf17d" }, "clojurescript": { "title": "ClojureScript", "appeared": 2011, "type": "pl", "website": "https://clojurescript.org/", "webRepl": [ "https://clojurescript.io/" ], "cheatSheetUrl": [ "http://cljs.info/cheatsheet/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/clojure" ], "domainName": { "registered": 2011, "awisRank": { "2017": 660977, "2022": 403705 }, "name": "clojurescript.org" }, "firstAnnouncement": "http://clojure.com/blog/2011/07/22/introducing-clojurescript.html", "announcementMethod": "blogPost", "compilesTo": [ "javascript" ], "hasPrintDebugging": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "println" ] ], "githubRepo": { "stars": 8887, "forks": 783, "subscribers": 379, "created": 2011, "updated": 2022, "firstCommit": 2011, "description": "Clojure to JS compiler", "issues": 2, "url": "https://github.com/clojure/clojurescript" }, "repoStats": { "firstCommit": 2011, "commits": 6165, "committers": 248, "files": 392 }, "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "cljs" ], "id": "ClojureScript" }, "rijuRepl": { "example": [ "(println \"Hello, world!\")\n" ], "description": "Compiler for Clojure that targets JavaScript", "fileExtensions": [ "cljs" ], "website": "https://clojurescript.org/", "gitRepo": "https://github.com/clojure/clojurescript", "id": "https://riju.codes/clojurescript" }, "subreddit": [ { "memberCount": { "2022": 2985 }, "url": "https://reddit.com/r/Clojurescript" } ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nClojurescript: Up and Running: Functional Programming for the Web|2015|Stuart Sierra|46459747|4.00|1|0\nReactive with Clojurescript Recipes: Functional Programming for the Web||Nicolas Modrzyk|57019123|0.0|0|0\nReactive with ClojureScript Recipes: Functional Programming for the Web||Nicolas Modrzyk|59492133|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n20170928|Springer Nature|Reactive with ClojureScript Recipes|Nicolas Modrzyk|9781484230091\n2020|Packt Publishing|The Clojure Workshop: Use functional programming to build data-centric applications with Clojure and ClojureScript|Fahey, Joseph and Haratyk, Thomas and McCaughie, Scott and Sharvit, Yehonathan and Szydlo, Konrad|9781838825119\n2017-09-29T00:00:01Z|Apress|Reactive with ClojureScript Recipes: Functional Programming for the Web|Modrzyk, Nicolas|9781484230084\n30-06-2016|Packt Publishing|Learning ClojureScript|W. David Jarvis|9781785887796\n2016-06-30|Packt Publishing|Learning ClojureScript|W. David Jarvis and Allen Rohner|9781785887635\n20151116|O'Reilly Media, Inc.|Etudes for ClojureScript|J. David Eisenberg|9781491952306", "semanticScholar": "" }, "clos": { "title": "CLOS", "appeared": 1988, "type": "pl", "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "; declare the common argument structure prototype\n(defgeneric f (x y))\n\n; define an implementation for (f integer t), where t matches all types\n(defmethod f ((x integer) y) 1)\n\n(f 1 2.0) => 1\n\n; define an implementation for (f integer real)\n(defmethod f ((x integer) (y real)) 2)\n\n(f 1 2.0) => 2 ; dispatch changed at runtime" ], "related": [ "common-lisp", "java", "commonloops", "eulisp", "emacs-lisp", "flavors", "interlisp", "dylan", "guile", "islisp", "cadence-skill" ], "summary": "The Common Lisp Object System (CLOS) is the facility for object-oriented programming which is part of ANSI Common Lisp. CLOS is a powerful dynamic object system which differs radically from the OOP facilities found in more static languages such as C++ or Java. CLOS was inspired by earlier Lisp object systems such as MIT Flavors and CommonLoops, although it is more general than either. Originally proposed as an add-on, CLOS was adopted as part of the ANSI standard for Common Lisp and has been adapted into other Lisp dialects such as EuLisp or Emacs Lisp.", "created": 2007, "backlinksCount": 142, "pageId": 191414, "revisionCount": 2, "dailyPageViews": 10, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/CLOS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1389", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1993|The MIT Press|Object-Oriented Programming: The CLOS Perspective||9780262161367\n1988-08-01T00:00:01Z|Addison-Wesley Professional|Object-Oriented Programming in COMMON LISP: A Programmer's Guide to CLOS|Keene, Sonya E.|9780201175899\n1993|The MIT Press|Object-Oriented Programming: The CLOS Perspective (The MIT Press)||9780262661751" }, "closure-templates": { "title": "Closure Templates", "appeared": 2009, "type": "template", "country": [ "United States" ], "originCommunity": [ "Google" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/**\n * Says hello to the world.\n */\n{template .helloWorld}\n Hello world!\n{/template}" ], "githubRepo": { "firstCommit": 2009, "stars": 561, "forks": 190, "subscribers": 40, "created": 2014, "updated": 2022, "description": "A client- and server-side templating system that helps you dynamically build reusable HTML and UI elements", "issues": 118, "url": "https://github.com/google/closure-templates" }, "repoStats": { "firstCommit": 2009, "commits": 5393, "committers": 89, "files": 1503 }, "githubLanguage": { "fileExtensions": [ "soy" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "soy_template", "codemirrorMode": "soy", "codemirrorMimeType": "text/x-soy", "tmScope": "text.html.soy", "aliases": [ "soy" ], "repos": 424389, "id": "Closure Templates" }, "githubBigQuery": { "repos": 25, "users": 18, "id": "Closure Templates" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2017, "committerCount": 2, "commitCount": 19, "sampleCount": 1, "example": [ "{namespace Exmaple}\n\n/**\n * Example\n */\n{template .foo}\n {@param count: string}\n {@param? name: int}\n\n {if isNonnull($name)}\n

{$name}

\n {/if}\n\n
\n {switch count}\n {case 0}\n {call Empty.view}\n {param count: $count /}\n {/call}\n {default}\n

Wow, so many!

\n {/switch}\n
\n{/template}" ], "url": "https://github.com/mthadley/language-closure-templates" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "cloud-firestore-security-rules": { "title": "Cloud Firestore Security Rules", "appeared": 2017, "type": "application", "reference": [ "https://firebase.google.com/docs/reference/rules/rules" ], "country": [ "United States" ], "originCommunity": [ "Google" ], "githubLanguage": { "type": "data", "filenames": [ "firestore.rules" ], "aceMode": "less", "codemirrorMode": "css", "codemirrorMimeType": "text/css", "tmScope": "source.firestore", "id": "Cloud Firestore Security Rules" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2018, "committerCount": 3, "commitCount": 22, "sampleCount": 1, "example": [ "service cloud.firestore {\n match /databases/{database}/documents {\n match /activities/{activity} {\n\n allow create: if isSignedIn()\n && isOwner(incomingData().authorId)\n && isValidActivity(incomingData())\n && hasAllowedActivityFieldsForCreate(incomingData());\n\n allow read, delete: if isSignedIn()\n && isOwner(existingData().authorId);\n\n allow update: if isSignedIn()\n && isOwner(existingData().authorId)\n && isValidActivity(incomingData())\n && hasAllowedActivityFieldsForUpdate(incomingData());\n\n }\n match /skills/{skill} {\n\n allow create: if isSignedIn()\n && isOwner(incomingData().authorId)\n && isValidSkill(incomingData())\n && hasAllowedSkillFieldsForCreate(incomingData());\n\n allow read, delete: if isSignedIn()\n && isOwner(existingData().authorId);\n\n allow update: if isSignedIn()\n && isOwner(existingData().authorId)\n && isValidSkill(incomingData())\n && hasAllowedSkillFieldsForUpdate(incomingData());\n\n }\n match /activities-skills/{activitySkill} {\n\n allow create: if isSignedIn()\n && isOwner(incomingData().authorId)\n && isValidActivitySkill(incomingData())\n && hasAllowedActivitySkillFieldsForCreate(incomingData());\n\n allow read, delete: if isSignedIn()\n && isOwner(existingData().authorId);\n\n allow update: if isSignedIn()\n && isOwner(existingData().authorId)\n && isValidActivitySkill(incomingData())\n && hasAllowedActivitySkillFieldsForUpdate(incomingData());\n\n }\n /// Functions ///\n function isSignedIn() {\n return request.auth != null;\n }\n function isOwner(userId) {\n return request.auth.uid == userId;\n }\n function existingData() {\n return resource.data;\n }\n function incomingData() {\n return request.resource.data;\n }\n function isValidActivity(activity) {\n return activity.title is string\n \t&& activity.title.size() > 3\n && activity.title.size() < 250\n && activity.summary is string\n && (activity.audienceCountMin is int || activity.audienceCountMin == null)\n && (activity.audienceCountMax is int || activity.audienceCountMax == null)\n && (activity.audienceAgeMin is int || activity.audienceAgeMin == null)\n && (activity.audienceAgeMax is int || activity.audienceAgeMax == null)\n && activity.lastUpdateDate.date() is timestamp;\n }\n function hasAllowedActivityFieldsForUpdate(activity) {\n return activity.keys().size() == 9 && activity.keys().hasAll(['authorId', 'title', 'summary', 'audienceCountMin', 'audienceCountMax', 'audienceAgeMin', 'audienceAgeMax', 'lastUpdateDate']);\n }\n function hasAllowedActivityFieldsForCreate(activity) {\n return activity.keys().size() == 8 && activity.keys().hasAll(['authorId', 'title', 'summary', 'audienceCountMin', 'audienceCountMax', 'audienceAgeMin', 'audienceAgeMax', 'lastUpdateDate']);\n }\n\n function isValidSkill(skill) {\n return skill.title is string\n && skill.title.size() > 3\n && skill.title.size() < 250\n && skill.summary is string\n && skill.lastUpdateDate.date() is timestamp;\n }\n function hasAllowedSkillFieldsForUpdate(skill) {\n return skill.keys().size() == 5 && skill.keys().hasAll(['authorId', 'title', 'summary', 'lastUpdateDate']);\n }\n function hasAllowedSkillFieldsForCreate(skill) {\n return skill.keys().size() == 4 && skill.keys().hasAll(['authorId', 'title', 'summary', 'lastUpdateDate']);\n }\n function isValidActivitySkill(activitySkill) {\n return activitySkill.skillId is string\n && activitySkill.activityId is string;\n }\n function hasAllowedActivitySkillFieldsForUpdate(activitySkill) {\n return activitySkill.keys().size() == 4 && activitySkill.keys().hasAll(['authorId', 'skillId', 'activityId']);\n }\n function hasAllowedActivitySkillFieldsForCreate(activitySkill) {\n return activitySkill.keys().size() == 3 && activitySkill.keys().hasAll(['authorId', 'skillId', 'activityId']);\n }\n }\n}" ], "url": "https://github.com/jaysquared/atom-firestore-grammar" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "clover": { "title": "CLOVER", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4402741aa70e4cae37839f196b5741fd6b843428" ], "country": [ "United Kingdom" ], "originCommunity": [ "University College London" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4707", "centralPackageRepositoryCount": 0 }, "clox": { "title": "clox", "appeared": 2020, "type": "pl", "website": "https://craftinginterpreters.com/", "country": [ "Italy" ], "originCommunity": [ "https://github.com/evacchi" ], "githubRepo": { "stars": 0, "forks": 0, "subscribers": 2, "created": 2020, "updated": 2022, "description": "Crafting Interpreters (clox)", "issues": 0, "url": "https://github.com/evacchi/crafting-interpreters/tree/main/clox" } }, "clp-star": { "title": "CLP*", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/76c2859734d725a4f8d7e94f33a4bdad32581fc5" ], "country": [ "United States" ], "originCommunity": [ "Brandeis University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1465", "centralPackageRepositoryCount": 0 }, "clpr": { "title": "CLPR", "appeared": 1986, "type": "pl", "country": [ "Australia" ], "originCommunity": [ "Monash University" ], "supersetOf": [ "prolog" ], "example": [ "3*X + 4*Y - 2*Z = 8,\nX - 5*Y + Z = 10,\n2*X + 3*Y -Z = 20." ], "wikipedia": { "example": [ "3*X + 4*Y - 2*Z = 8,\nX - 5*Y + Z = 10,\n2*X + 3*Y -Z = 20." ], "related": [ "prolog" ], "summary": "CLP(R) is a declarative programming language. It stands for constraint logic programming (Real) where real refers to the real numbers. It can be considered and is generally implemented as a superset or add-on package for a Prolog implementation.", "pageId": 14734259, "created": 2007, "backlinksCount": 10, "revisionCount": 31, "dailyPageViews": 5, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/CLP(R)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1205", "fileType": "text", "centralPackageRepositoryCount": 0 }, "clu": { "title": "CLU", "appeared": 1975, "type": "pl", "creators": [ "Barbara Liskov" ], "website": "http://www.pmg.lcs.mit.edu/CLU.html", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "stream$putl" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "complex_number = cluster is add, subtract, multiply, ...\n rep = record [ real_part: real, imag_part: real ]\n add = proc ... end add;\n subtract = proc ... end subtract;\n multiply = proc ... end multiply;\n ...\n end complex_number;" ], "related": [ "sparc", "algol-60", "lisp", "simula", "ada", "argus", "lua", "ruby", "sather", "swift", "algol", "ml", "cpl", "java", "python", "csharp", "perl" ], "summary": "CLU is a programming language created at the Massachusetts Institute of Technology (MIT) by Barbara Liskov and her students between 1974 and 1975. While it did not find extensive use, it introduced many features that are used widely now, and is seen as a step in the development of object-oriented programming (OOP). Key contributions include abstract data types, call-by-sharing, iterators, multiple return values (a form of parallel assignment), type-safe parameterized types, and type-safe variant types. It is also notable for its use of classes with constructors and methods, but without inheritance.", "pageId": 7575, "dailyPageViews": 62, "created": 2001, "backlinksCount": 48, "revisionCount": 166, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/CLU_(programming_language)" }, "leachim6": { "filepath": "c/CLU.clu", "fileExtensions": [ "clu" ], "example": [ "start_up = proc ()\n po: stream := stream$primary_output ()\n stream$putl (po, \"Hello World\")\n end start_up\n" ], "id": "CLU" }, "tiobe": { "id": "CLU" }, "hopl": "https://hopl.info/showlanguage.prx?exp=637", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011||Clu (programming Language)|Jordan Naoum|9786136725222", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1977|Abstraction mechanisms in CLU|10.1145/800022.808322|607|25|B. Liskov and A. Snyder and R. Atkinson and Craig Schaffert|17fe58e6115711ce4d5ceef941c60eb6d6898dcf\n1979|Exception Handling in CLU|10.1109/TSE.1979.230191|211|15|B. Liskov and A. Snyder|8a9fedd17162c475ec76305606e2c38bfca8c63a\n1977|Abstraction mechanisms in CLU|10.1145/359763.359789|90|0|B. Liskov and A. Snyder and R. Atkinson and Craig Schaffert|31d59422eed57a00df4734d625b950b3ab8317a7\n1993|A history of CLU|10.1145/155360.155367|66|8|B. Liskov|50cbaf258d7a2b0539302784a640ecbfed8cabc1\n1989|XE design rationale: Clu revisited|10.1145/68127.68130|1|0|V. Hirvisalo and J. Arkko and Juha Kuusela and Esko Nuutila and Markku Tamminen|a9e292d74d2bbd33c3b72a4ef50689375a4780c8" }, "clx": { "title": "CLX", "appeared": 1985, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/CLX_(Common_Lisp)" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/sharplispers" ], "wikipedia": { "summary": "The acronym CLX can refer to a number of things: 160 in Roman numerals Cargolux, an airline using the ICAO code CLX CLX (Common Lisp), a Common Lisp computer library CLX Communications, a telecommunications and cloud communications platform as a service company, based in Stockholm, Sweden Component Library for Cross Platform (CLX), a cross-platform visual component-based framework", "backlinksCount": 8, "pageId": 350113, "dailyPageViews": 4, "url": "https://en.wikipedia.org/wiki/CLX" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7124", "centralPackageRepositoryCount": 0 }, "cmake": { "title": "CMake", "appeared": 2000, "type": "application", "website": "https://cmake.org/", "reference": [ "https://www.jetbrains.com/help/clion/cmakelists-txt-file.html" ], "country": [ "United States" ], "originCommunity": [ "Kitware, Inc" ], "domainName": { "registered": 2001, "awisRank": { "2022": 23114 }, "name": "cmake.org" }, "gitlabRepo": "https://gitlab.kitware.com/cmake/cmake", "wikipedia": { "related": [ "c", "visual-studio-editor", "eclipse-editor", "linux", "ninja", "unix", "falcon", "kicad", "llvmir", "mysql", "mariadb", "qt", "amqp", "root-lib", "meson", "qmake" ], "summary": "CMake is cross-platform free and open-source software for managing the build process of software using a compiler-independent method. It supports directory hierarchies and applications that depend on multiple libraries. It is used in conjunction with native build environments such as make, Apple's Xcode, and Microsoft Visual Studio. It has minimal dependencies, requiring only a C++ compiler on its own build system.", "pageId": 4965560, "dailyPageViews": 255, "created": 2006, "backlinksCount": 90, "revisionCount": 560, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/CMake" }, "githubLanguage": { "fileExtensions": [ "cmake", "cmakein" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nmicrosoft vcpkg https://github.com/microsoft.png https://github.com/microsoft/vcpkg CMake #ccc 6545 1638 307 \"C++ Library Manager for Windows, Linux, and MacOS\"\nwzpan cmake-demo https://github.com/wzpan.png https://github.com/wzpan/cmake-demo CMake #ccc 533 332 37 《CMake入门实战》源码\nultralight-ux Ultralight https://github.com/ultralight-ux.png https://github.com/ultralight-ux/Ultralight CMake #ccc 1145 65 95 \"Ultralight— a lightweight, pure-GPU, HTML UI renderer for native apps.\"", "trendingProjectsCount": 4, "type": "programming", "filenames": [ "CMakeLists.txt" ], "aceMode": "text", "codemirrorMode": "cmake", "codemirrorMimeType": "text/x-cmake", "tmScope": "source.cmake", "id": "CMake" }, "githubBigQuery": { "repos": 56490, "users": 39454, "id": "CMake" }, "codeMirror": "cmake", "pygmentsHighlighter": { "filename": "make.py", "fileExtensions": [ "cmake", "CMakeLists.txt" ], "id": "CMake" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2015, "committerCount": 7, "commitCount": 48, "sampleCount": 6, "example": [ "cmake_minimum_required(VERSION 2.6)\n\nenable_testing()\n\nset(CMAKE_BUILD_TYPE debug)\n\ninclude_directories(\"/usr/local/include\")\n\nfind_library(ssl_LIBRARY NAMES ssl PATHS \"/usr/local/lib\")\n\nadd_custom_command(OUTPUT \"ver.c\" \"ver.h\" COMMAND ./ver.sh)\n\nadd_executable(foo foo.c bar.c baz.c ver.c)\n\ntarget_link_libraries(foo ${ssl_LIBRARY})\n" ], "url": "https://github.com/textmate/cmake.tmbundle" }, "helloWorldCollection": [ "# Hello World in CMake\n\nmessage(STATUS \"Hello World!\")\n" ], "leachim6": { "filepath": "c/CMake.cmake", "fileExtensions": [ "cmake" ], "example": [ "message(\"Hello World\")\n" ], "id": "CMake" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:CMake", "compilerExplorer": { "example": [ "project(default)\n\nadd_compile_options(-Werror -Wall -Wextra -g)\n\nadd_executable(output.s example.cpp)\n" ], "id": "CMake" }, "rijuRepl": { "example": [ "message(\"Hello, world!\")\n" ], "id": "https://riju.codes/cmake" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCMake Cookbook: Over 40 recipes enabling you to build, test, and package software for distribution using the CMake suite||Radovan Bast;Roberto Di Remigio|63961172|0.0|0|0\nCMake Cookbook: Over 40 recipes enabling you to build, test, and package software for distribution using the CMake suite||Radovan Bast|61191205|0.0|0|0\nBuilding C++ Software with CMake (Software Tools Series Book 1)|2014|Chris Weed|42501938|5.00|2|0\nUsing CMake to Manage Project - A Demo (Linux Software Development)||Jie Deng|52502246|0.0|0|0" }, "cmix": { "title": "CMIX", "appeared": 1980, "type": "pl", "creators": [ "Paul Lansky" ], "description": "CMIX is a computer music \"language\" designed to create and manipulate soundfiles, or files containing raw binary data which can be converted into sound on a computer equipped with an appropriate digital-to-analog convertor. It is somewhat similar to CSOUND and CMUSIC (two other popular software synthesis and signal-processing computer music packages). All three of these languages are in one way or another derived from the work done by Max Matthews and others at Bell Laboratories in the late 1950's and 1960's.", "reference": [ "http://sites.music.columbia.edu/cmc/cmix_dir/cmix_docs/history.html" ], "country": [ "United States" ], "originCommunity": [ "Princeton University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6376", "centralPackageRepositoryCount": 0 }, "cmn": { "title": "CMN", "appeared": 1990, "type": "pl", "reference": [ "https://github.com/thormagnusson/cmn" ], "country": [ "Various countries in Western Europe" ], "originCommunity": [ "http://www.ixi-audio.net/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6377", "centralPackageRepositoryCount": 0 }, "cms-2": { "title": "CMS-2", "appeared": 1968, "type": "pl", "creators": [ "Vincent Cecil Secades", "David Clark Rummler" ], "reference": [ "https://www.semanticscholar.org/paper/Steps-toward-a-revised-compiler-monitor-system-II-Secades-Rummler/2ea5859d3f2045a9dd3296c28a9d18a87853a083" ], "country": [ "United States" ], "originCommunity": [ "Naval Postgraduate School" ], "wikipedia": { "related": [ "fortran", "jovial", "pl-i", "ada" ], "summary": "CMS-2 is an embedded systems programming language used by the United States Navy. It was an early attempt to develop a standardized high-level computer programming language intended to improve code portability and reusability. CMS-2 was developed primarily for the US Navy’s tactical data systems (NTDS).CMS-2 was developed by RAND Corporation in the early 1970s and stands for \"Compiler Monitor System\". The name \"CMS-2\" is followed in literature by a letter designating the type of target system. For example, CMS-2M targets Navy 16-bit processors, such as the AN/AYK-14.", "pageId": 1181779, "created": 2004, "backlinksCount": 24, "revisionCount": 93, "dailyPageViews": 22, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/CMS-2_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=711", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|Book On Demand Limited|Cms-2 (programming Language)|Jesse Russell and Ronald Cohn|9785511887821" }, "cms-exec": { "title": "EXEC", "appeared": 1966, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "example": [ "* The following code issues CMS commands to set\n* the \"blip\" character to asterisk and request\n* the \"short\" format for system ready messages.\n&CONTROL OFF\nSET BLIP *\nSET RDYMSG SMSG" ], "related": [ "exec-2", "rexx" ], "summary": "CMS EXEC, or EXEC, is an interpreted, command procedure control, computer scripting language used by the CMS EXEC Processor supplied with the IBM Virtual Machine/Conversational Monitor System (VM/CMS) operating system. EXEC was written in 1966 by Stuart Madnick at MIT on the model of CTSS RUNCOM. He originally called this processor COMMAND, and it was later renamed EXEC. CMS EXEC has been superseded by EXEC 2 and REXX. All three — CMS EXEC, EXEC 2 and REXX — continue to be supported by the IBM CMS product.", "pageId": 9424740, "dailyPageViews": 8, "created": 2007, "backlinksCount": 16, "revisionCount": 31, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/CMS_EXEC" }, "tiobe": { "id": "EXEC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2023", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1986|Addison-Wesley|AMIGA ROM Kernel Reference Manual: Exec|Sassenrath, Carl|9780201110999\n1993-04-01T00:00:01Z|SAMS Publishing|Assembly Language: For Real Programmers Only!/Disk Contains Programming Examples, Sets of Data Files, Interfaces for the 8086 and 80386/486 and Exec|Johnson, Marcus|9780672484704" }, "cms-pipelines": { "title": "CMS Pipelines", "appeared": 1986, "type": "pl", "reference": [ "https://www-01.ibm.com/support/docview.wss?uid=pub1sl26001805" ], "aka": [ "TSO Pipelines" ], "originCommunity": [ "IBM" ], "example": [ "PIPE (end ?) \n < input txt \n | a: locate /Hello/ \n | insert / World!/ after\n | i: faninany\n | > newfile txt a\n ? a:\n | xlate upper\n | i:" ], "wikipedia": { "summary": "CMS Pipelines implements the pipeline concept under the VM/CMS operating system. The programs in a pipeline operate on a sequential stream of records. A program writes records that are read by the next program in the pipeline. Any program can be combined with any other because reading and writing is done through a device independent interface.", "backlinksCount": 10, "pageId": 692211, "dailyPageViews": 7, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/CMS_Pipelines" }, "semanticScholar": "" }, "cmu-common-lisp": { "title": "CMU Common Lisp", "appeared": 1980, "type": "pl", "website": "https://www.cons.org/cmucl/", "aka": [ "cmucl" ], "country": [ "United States" ], "originCommunity": [ "CMUCL Project" ], "wikipedia": { "summary": "CMUCL is a free Common Lisp implementation, originally developed at Carnegie Mellon University. CMUCL runs on most Unix-like platforms, including Linux and BSD; there is an experimental Windows port as well. Steel Bank Common Lisp is derived from CMUCL. The Scieneer Common Lisp is a commercial derivative from CMUCL.", "backlinksCount": 103, "pageId": 969655, "dailyPageViews": 13, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/CMU_Common_Lisp" } }, "co-dfns": { "title": "co-dfns", "appeared": 2012, "type": "pl", "creators": [ "Aaron Hsu" ], "website": "https://www.patreon.com/arcfide", "reference": [ "https://dl.acm.org/doi/10.1145/2627373.2627384" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/Co-dfns/" ], "githubRepo": { "firstCommit": 2012, "stars": 519, "forks": 27, "subscribers": 26, "created": 2012, "updated": 2022, "description": "High-performance, Reliable, and Parallel APL", "issues": 149, "url": "https://github.com/Co-dfns/Co-dfns" }, "repoStats": { "firstCommit": 2012, "commits": 4736, "committers": 21, "files": 209 }, "twitter": "https://twitter.com/patreon", "semanticScholar": "" }, "co2": { "title": "co2", "appeared": 2016, "type": "pl", "creators": [ "Dave Griffiths" ], "country": [ "United States" ], "originCommunity": [ "dustmop.io" ], "githubRepo": { "firstCommit": 2016, "stars": 165, "subscribers": 6, "created": 2017, "updated": 2022, "description": "Lispy language for creating NES / Famicom software", "issues": 2, "forks": 6, "url": "https://github.com/dustmop/co2" }, "repoStats": { "firstCommit": 2016, "commits": 311, "committers": 4, "files": 98 } }, "cobloc": { "title": "COBLOC", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2126e975cafb6e67d5542d7b7cb525ceffbc4f51" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3019", "centralPackageRepositoryCount": 0 }, "cobol-net": { "title": "Cobol.NET", "appeared": 2002, "type": "pl", "website": "https://www.fujitsu.com/global/products/software/developer-tool/netcobol/", "reference": [ "https://nl.wikipedia.org/wiki/COBOL.NET" ], "country": [ "United States" ], "originCommunity": [ "Fujitsu Computer Systems Corporation." ], "hopl": "https://hopl.info/showlanguage.prx?exp=3730", "centralPackageRepositoryCount": 0 }, "cobol": { "title": "COBOL", "appeared": 1959, "type": "pl", "creators": [ "Howard Bromberg", "Norman Discount", "Vernon Reeves", "Jean E. Sammet", "William Selden", "Gertrude Tierney", "Grace Hopper" ], "documentation": [ "https://openbase.com/js/cobol/documentation" ], "emailList": [ "https://lists.midrange.com/mailman/listinfo/cobol400-l", "https://lists.openmainframeproject.org/g/wg-cobol/subgroups" ], "standsFor": "COmmon Business Oriented Language", "fileExtensions": [ "cbl", "cob", "cpy" ], "country": [ "United States" ], "originCommunity": [ "Conference/Committee on Data Systems Languages" ], "hasPointers": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": false }, "hasMultiLineComments": { "example": "", "value": false }, "hasLineComments": { "example": "MOVE ABC to XYZ *> This is a comment.", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasFixedPoint": { "example": "", "value": true }, "lineCommentToken": [ [ "*>" ] ], "printToken": [ [ "DISPLAY" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "ACCEPT", "ACCESS", "ADD", "ADDRESS", "ADVANCING", "AFTER", "ALL", "ALPHABET", "ALPHABETIC", "ALPHABETIC-LOWER", "ALPHABETIC-UPPER", "ALPHANUMERIC", "ALPHANUMERIC-EDITED", "ALSO", "ALTER", "ALTERNATE", "AND", "ANY", "APPLY", "ARE", "AREA", "AREAS", "ASCENDING", "ASSIGN", "AT", "AUTHOR", "BASIS", "BEFORE", "BEGINNING", "BINARY", "BLANK", "BLOCK", "BOTTOM", "BY", "CALL", "CANCEL", "CBL", "CD", "CF", "CH", "CHARACTER", "CHARACTERS", "CLASS", "CLASS-ID", "CLOCK-UNITS", "CLOSE", "COBOL", "CODE", "CODE-SET", "COLLATING", "COLUMN", "COM-REG", "COMMA", "COMMON", "COMMUNICATION", "COMP", "COMP-1", "COMP-2", "COMP-3", "COMP-4", "COMP-5", "COMPUTATIONAL", "COMPUTATIONAL-1", "COMPUTATIONAL-2", "COMPUTATIONAL-3", "COMPUTATIONAL-4", "COMPUTATIONAL-5", "COMPUTE", "CONFIGURATION", "CONTAINS", "CONTENT", "CONTINUE", "CONTROL", "CONTROLS", "CONVERTING", "COPY", "CORR", "CORRESPONDING", "COUNT", "CURRENCY", "DATA", "DATE-COMPILED", "DATE-WRITTEN", "DAY", "DAY-OF-WEEK", "DBCS", "DE", "DEBUG-CONTENTS", "DEBUG-ITEM", "DEBUG-LINE", "DEBUG-NAME", "DEBUG-SUB-1", "DEBUG-SUB-2", "DEBUG-SUB-3", "DEBUGGING", "DECIMAL-POINT", "DECLARATIVES", "DELETE", "DELIMITED", "DELIMITER", "DEPENDING", "DESCENDING", "DESTINATION", "DETAIL", "DISPLAY", "DISPLAY-1", "DIVIDE", "DIVISION", "DOWN", "DUPLICATES", "DYNAMIC", "EGCS", "EGI", "EJECT", "ELSE", "EMI", "ENABLE", "END", "END-ADD", "END-CALL", "END-COMPUTE", "END-DELETE", "END-DIVIDE", "END-EVALUATE", "END-IF", "END-INVOKE", "END-MULTIPLY", "END-OF-PAGE", "END-PERFORM", "END-READ", "END-RECEIVE", "END-RETURN", "END-REWRITE", "END-SEARCH", "END-START", "END-STRING", "END-SUBTRACT", "END-UNSTRING", "END-WRITE", "ENDING", "ENTER", "ENTRY", "ENVIRONMENT", "EOP", "EQUAL", "ERROR", "ESI", "EVALUATE", "EVERY", "EXCEPTION", "EXIT", "EXTEND", "EXTERNAL", "FALSE", "FD", "FILE", "FILE-CONTROL", "FILLER", "FINAL", "FIRST", "FOOTING", "FOR", "FROM", "FUNCTION", "GENERATE", "GIVING", "GLOBAL", "GO", "GOBACK", "GREATER", "GROUP", "HEADING", "HIGH-VALUE", "HIGH-VALUES", "I-O", "I-O-CONTROL", "ID", "IDENTIFICATION", "IF", "IN", "INDEX", "INDEXED", "INDICATE", "INHERITS", "INITIAL", "INITIALIZE", "INITIATE", "INPUT", "INPUT-OUTPUT", "INSERT", "INSPECT", "INSTALLATION", "INTO", "INVALID", "INVOKE", "IS", "JUST", "JUSTIFIED", "KANJI", "KEY", "LABEL", "LAST", "LEADING", "LEFT", "LENGTH", "LESS", "LIMIT", "LIMITS", "LINAGE", "LINAGE-COUNTER", "LINE", "LINE-COUNTER", "LINES", "LINKAGE", "LOCAL-STORAGE", "LOCK", "LOW-VALUE", "LOW-VALUES", "MEMORY", "MERGE", "MESSAGE", "METACLASS", "METHOD", "METHOD-ID", "MODE", "MODULES", "MORE-LABELS", "MOVE", "MULTIPLE", "MULTIPLY", "NATIVE", "NATIVE_BINARY", "NEGATIVE", "NEXT", "NO", "NOT", "NULL", "NULLS", "NUMBER", "NUMERIC", "NUMERIC-EDITED", "OBJECT", "OBJECT-COMPUTER", "OCCURS", "OF", "OFF", "OMITTED", "ON", "OPEN", "OPTIONAL", "OR", "ORDER", "ORGANIZATION", "OTHER", "OUTPUT", "OVERFLOW", "OVERRIDE", "PACKED-DECIMAL", "PADDING", "PAGE", "PAGE-COUNTER", "PASSWORD", "PERFORM", "PF", "PH", "PIC", "PICTURE", "PLUS", "POINTER", "POSITION", "POSITIVE", "PRINTING", "PROCEDURE", "PROCEDURE-POINTER", "PROCEDURES", "PROCEED", "PROCESSING", "PROGRAM", "PROGRAM-ID", "PURGE", "QUEUE", "QUOTE", "QUOTES", "RANDOM", "RD", "READ", "READY", "RECEIVE", "RECORD", "RECORDING", "RECORDS", "RECURSIVE", "REDEFINES", "REEL", "REFERENCE", "REFERENCES", "RELATIVE", "RELEASE", "RELOAD", "REMAINDER", "REMOVAL", "RENAMES", "REPLACE", "REPLACING", "REPORT", "REPORTING", "REPORTS", "REPOSITORY", "RERUN", "RESERVE", "RESET", "RETURN", "RETURN-CODE", "RETURNING", "REVERSED", "REWIND", "REWRITE", "RF", "RH", "RIGHT", "ROUNDED", "RUN", "SAME", "SD", "SEARCH", "SECTION", "SECURITY", "SEGMENT", "SEGMENT-LIMIT", "SELECT", "SELF", "SEND", "SENTENCE", "SEPARATE", "SEQUENCE", "SEQUENTIAL", "SERVICE", "SET", "SHIFT-IN", "SHIFT-OUT", "SIGN", "SIZE", "SKIP1", "SKIP2", "SKIP3", "SORT", "SORT-CONTROL", "SORT-CORE-SIZE", "SORT-FILE-SIZE", "SORT-MERGE", "SORT-MESSAGE", "SORT-MODE-SIZE", "SORT-RETURN", "SOURCE", "SOURCE-COMPUTER", "SPACE", "SPACES", "SPECIAL-NAMES", "STANDARD", "STANDARD-1", "STANDARD-2", "START", "STATUS", "STOP", "STRING", "SUB-QUEUE-1", "SUB-QUEUE-2", "SUB-QUEUE-3", "SUBTRACT", "SUM", "SUPER", "SUPPRESS", "SYMBOLIC", "SYNC", "SYNCHRONIZED", "TABLE", "TALLY", "TALLYING", "TAPE", "TERMINAL", "TERMINATE", "TEST", "TEXT", "THAN", "THEN", "THROUGH", "THRU", "TIME", "TIMES", "TITLE", "TO", "TOP", "TRACE", "TRAILING", "TRUE", "TYPE", "UNIT", "UNSTRING", "UNTIL", "UP", "UPON", "USAGE", "USE", "USING", "VALUE", "VALUES", "VARYING", "WHEN", "WHEN-COMPILED", "WITH", "WORDS", "WORKING-STORAGE", "WRITE", "WRITE-ONLY", "ZERO", "ZEROES", "ZEROS" ], "wikipedia": { "example": [ "19.52.48 JOB 3 $HASP100 COBUCLG ON READER1 COBOL BASE TEST\n 19.52.48 JOB 3 IEF677I WARNING MESSAGE(S) FOR JOB COBUCLG ISSUED\n 19.52.48 JOB 3 $HASP373 COBUCLG STARTED - INIT 1 - CLASS A - SYS BSP1\n 19.52.48 JOB 3 IEC130I SYSPUNCH DD STATEMENT MISSING\n 19.52.48 JOB 3 IEC130I SYSLIB DD STATEMENT MISSING\n 19.52.48 JOB 3 IEC130I SYSPUNCH DD STATEMENT MISSING\n 19.52.48 JOB 3 IEFACTRT - Stepname Procstep Program Retcode\n 19.52.48 JOB 3 COBUCLG BASETEST COB IKFCBL00 RC= 0000\n 19.52.48 JOB 3 COBUCLG BASETEST LKED IEWL RC= 0000\n 19.52.48 JOB 3 +HELLO, WORLD\n 19.52.48 JOB 3 COBUCLG BASETEST GO PGM=*.DD RC= 0000\n 19.52.48 JOB 3 $HASP395 COBUCLG ENDED" ], "related": [ "comtran", "eiffel", "flow-matic", "smalltalk", "pl-i", "plb", "algol-58", "fact", "algol", "unicode", "xml", "unix", "visual-basic.net", "utf-8", "jcl", "pascal" ], "summary": "COBOL (, an acronym for common business-oriented language) is a compiled English-like computer programming language designed for business use. It is imperative, procedural and, since 2002, object-oriented. COBOL is primarily used in business, finance, and administrative systems for companies and governments. COBOL is still widely used in legacy applications deployed on mainframe computers, such as large-scale batch and transaction processing jobs. But due to its declining popularity and the retirement of experienced COBOL programmers, programs are being migrated to new platforms, rewritten in modern languages or replaced with software packages. Most programming in COBOL is now purely to maintain existing applications. COBOL was designed in 1959 by CODASYL and was partly based on previous programming language design work by Grace Hopper, commonly referred to as \"the (grand)mother of COBOL\". It was created as part of a US Department of Defense effort to create a portable programming language for data processing. Intended as a stopgap, the Department of Defense promptly forced computer manufacturers to provide it, resulting in its widespread adoption. It was standardized in 1968 and has since been revised four times. Expansions include support for structured and object-oriented programming. The current standard is ISO/IEC 1989:2014. COBOL has an English-like syntax, which was designed to be self-documenting and highly readable. However, it is verbose and uses over 300 reserved words. In contrast with modern, succinct syntax like y = x;, COBOL has a more English-like syntax (in this case, MOVE x TO y). COBOL code is split into four divisions (identification, environment, data and procedure) containing a rigid hierarchy of sections, paragraphs and sentences. Lacking a large standard library, the standard specifies 43 statements, 87 functions and just one class. Academic computer scientists were generally uninterested in business applications when COBOL was created and were not involved in its design; it was (effectively) designed from the ground up as a computer language for business, with an emphasis on inputs and outputs, whose only data types were numbers and strings of text. COBOL has been criticized throughout its life, however, for its verbosity, design process and poor support for structured programming, which resulted in monolithic and incomprehensible programs.", "pageId": 6799, "dailyPageViews": 1302, "created": 2001, "backlinksCount": 1151, "revisionCount": 2255, "appeared": 1959, "fileExtensions": [ "cbl", "cob", "cpy" ], "url": "https://en.wikipedia.org/wiki/COBOL" }, "githubLanguage": { "fileExtensions": [ "cob", "cbl", "ccp", "cobol", "cpy" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "cobol", "codemirrorMode": "cobol", "codemirrorMimeType": "text/x-cobol", "tmScope": "source.cobol", "repos": 3411, "id": "COBOL" }, "githubBigQuery": { "repos": 667, "users": 628, "id": "COBOL" }, "codeMirror": "cobol", "pygmentsHighlighter": { "filename": "business.py", "fileExtensions": [ "cob", "COB", "cpy", "CPY" ], "id": "COBOL" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 6, "commitCount": 94, "sampleCount": 4, "example": [ " program-id. hello.\n procedure division.\n display \"Hello, World!\".\n stop run.\n\n" ], "url": "https://bitbucket.org/bitlang/sublime_cobol" }, "projectEuler": { "memberCount": { "2019": 34, "2022": 39 }, "id": "COBOL" }, "helloWorldCollection": [ " * Hello World in COBOL\n\n*****************************\nIDENTIFICATION DIVISION.\nPROGRAM-ID. HELLO.\nENVIRONMENT DIVISION.\nDATA DIVISION.\nPROCEDURE DIVISION.\nMAIN SECTION.\nDISPLAY \"Hello World!\"\nSTOP RUN.\n****************************" ], "leachim6": { "filepath": "c/COBOL.cbl", "fileExtensions": [ "cbl" ], "example": [ " identification division.\n program-id. cobol.\n procedure division.\n main.\n display 'Hello World.' end-display.\n stop run.\n" ], "id": "COBOL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:COBOL", "quineRelay": "Cobol", "rijuRepl": { "example": [ "IDENTIFICATION DIVISION.\nPROGRAM-ID. MAIN.\nPROCEDURE DIVISION.\n DISPLAY \"Hello, world!\".\n STOP RUN.\n" ], "description": "Compiled English-like computer programming language designed for business use", "fileExtensions": [ "cbl", "cob", "cpy" ], "gitRepo": "https://sourceforge.net/p/gnucobol/_list/svn", "id": "https://riju.codes/cobol" }, "indeedJobs": { "2017": 838, "query": "cobol developer" }, "linkedInSkill": { "2018": 177803, "id": "cobol" }, "stackOverflowSurvey": { "2021": { "users": 437, "medianSalary": 52340, "fans": 309, "percentageUsing": 0.01 } }, "subreddit": [ { "memberCount": { "2017": 715, "2022": 2605 }, "url": "https://reddit.com/r/cobol" } ], "meetup": { "memberCount": 123, "groupCount": 4, "url": "https://www.meetup.com/topics/cobol" }, "tiobe": { "currentRank": 25, "id": "COBOL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=139", "pypl": "Cobol", "ubuntuPackage": "open-cobol", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCobol Programming|1983|M.K. Roy|4944251|4.11|9|1\nStructured Cobol Programming|1979|Nancy B. Stern|9030220|4.33|15|0\nDB2 for the COBOL Programmer, Part 1|1998|Curtis Garvin|2637661|3.58|12|1\nIMS for the COBOL Programmer: Database Processing with DL/I|1985|Steve Eckols|2866873|4.12|33|3\nMurach's CICS for the COBOL Programmer|2001|Raul Menendez|1002732|3.96|25|1\nVsam For The Cobol Programmer: Concepts, Cobol, Jcl, Idcams|1982|Doug Lowe|1555249|2.60|5|1\nDB2 for the COBOL Programmer|1999|Curtis Garvin|1458408|4.17|6|1\nCobol Programming A Complete Course In Writing Cobol Programs|1972|John Watters|5144775|2.00|4|0\nDB2 for the COBOL Programmer: An Introductory Course|1991|Steve Eckols|2866874|4.11|9|0\nCOBOL for Dummies [With One/Cheatsheet]|1997|Arthur Griffith|2386608|2.33|3|0", "isbndb": "year|publisher|title|authors|isbn13\n2005|Wiley|COBOL for the 21st Century|Stern, Nancy B. and Stern, Robert A. and Ley, James P.|9780471722618\n1999|Wiley|Successful COBOL Upgrades: Highlights and Programming Techniques|Chae, Young and Rogers, Steven|9780471330110\n1999|Wiley|Structured Cobol Programming: For the Year 2000 and Beyond, 9th Edition|Stern, Nancy B. and Stern, Robert A.|9780471318811\n1991|Mitchell McGraw-Hill|Modern COBOL programming|Price, Wilson T|9780070510449\n1998|Wiley|Structured COBOL Programming: Year 2000 Update Version (with Syntax Guide and Disk)|Stern, Nancy B. and Stern, Robert A.|9780471299875\n1987|McGraw-Hill|Cobol Programming Problems and Solutions|Roy, M.|9780074518656\n1972|Heinemann Educational|Cobol programming: A complete course in writing Cobol programs|Watters, John|9780435778033\n1973|Anaheim Pub Co|Introduction to Computer Programming: ANSI Cobol|Shelly, Gary B.|9780882361031\n1984|South-western Pub. Co|Programming Principles With Cobol I|Don B Medley|9780538104203\n20041228|Cambridge University Press|COBOL Programmers Swing with Java|E. Reed Doke; Bill C. Hardgrave; Richard A. Johnson|9780511081507\n1995|Butterworth-Heinemann|Cobol for Students|Parkin, Andrew and Yorke, Richard|9780340645529\n1987|Fresno, Calif. : M. Murach & Associates, c1986-|Structured ANS COBOL|Mike Murach and Paul Noll|9780911625387\n1992|Wiley|Micro Focus Workbench: Developing Mainframe COBOL Applications on the PC|Jatich, Alida and Nowak, Phil|9780471556114\n1996|Wiley|Structured COBOL Programming: With Syntax Guide and Student Program and Data Disk|Stern, Nancy B. and Stern, Robert A.|9780471138860\n1984|Prentice Hall|Cobol Programming|Peter Abel|9780835908351\n1981|D.Van Nostrand|Introductory Structured Cobol Programming|Popkin, Gary S.,|9780442231668\n1997|Cambridge University Press|Object-Oriented COBOL (SIGS: Advances in Object Technology)|Arranga, Edmund C. and Coyle, Frank P.|9780132611404\n2003|Morgan Kaufmann|From COBOL to OOP (The Morgan Kaufmann Series in Software Engineering and Programming)|Knasmüller, Markus|9781558608221\n1997|Mike Murach & Associates Inc|Structured Cobol Methods: How to Design, Code, and Test Your Programs So They're Easier to Debug, Document, and Maintain|Noll, Paul|9780911625943\n1986|McGraw-Hill College|Structured Cobol|Philippakis, A. S. and Kazmier, Leonard J.|9780070498099\n1997|Wiley|An Introduction to Object COBOL|Doke, E. Reed and Hardgrave, Bill C.|9780471183464\n1992|Mike Murach & Associates Inc|Cics for the Cobol Programmer: An Introductory Course (Pt. 1)|Lowe, Doug|9780911625608\n2021|CENEAGE LEARNING INDIA PVT LTD|Structured Cobol Programming|Shelly|9788131503829\n1979|John Wiley & Sons Inc|Introduction To Business Data Processing With Basic, Fortran And Cobol Programming|Donald Keith Caver|9780471030911\n1971||Fundamentals of COBOL Programming|Carl Feingold|9780697081018\n1983|W.C. Brown Co|Fundamentals of structured COBOL programming|Feingold, Carl|9780697081735\n1987|Prentice Hall|Programming Standards And Guidelines: Cobol Edition|Barry K. Nirmal|9780137298235\n1997|Wiley|Mastering Cobal: Let the PC Teach You COBOL Programming|Woollard, Rex and Bonner, Andrea|9780471159742\n1976|Watfac|An Introduction To Cobol And Watbol ; A Structured Programming Approach|Cowsan and D. D. ; Dirksen and P. H. ; Graham and J. W.|9780919884038\n1990|McGraw-Hill|COBOL II: Programming Techniques, Efficiency Considerations, Debugging Techniques (IBM McGraw-Hill Series)|Bookman, Harvey|9780070065338\n1986|Mike Murach & Associates Inc|How To Evaluate-and Improve-your Cobol Programming Methods: A Guide For Managers|Paul Noll|9780911625288\n|Geelong, Vic. : Deakin University, 1992.|Cobol Programming|P. A. Crump and R. D. Pearson|9780730013242\n2010|Equity Press|Cobol Programming Interview Questions: Cobol Job Interview Review Guide|Terry Sanchez-clark|9781933804453\n1983|Hyperion Books|Methodical Programming in COBOL|Ray Welland|9780273018209\n1985|Kent Pub Co|Introductory Structured Cobol Programming||9780534231668\n|Dubuque, Iowa : W.c. Brown Col., C1983.|Fundamentals Of Structured Cobol Programming||9780697081865\n1994|Course Technology Inc|Using Micro Focus Cobol Workbench|Leona Roen|9780877098140\n1976|Linnet Books|COBOL programming: An introduction for librarians|Brophy, Peter|9780208015273\n1991|Thomson Learning|Structured Programming In Cobol (complete Course Texts)|B.j. Holmes|9781870941822\n1971|Mcgraw-hill|Elementary Cobol Programming;: A Step By Step Approach|Gordon Bitter Davis|9780070157804\n1997|Wiley|Getting Started With Micro Focus Personal COBOL for Windows|Doke, E. Reed|9780471184904\n2004|Mike Murach & Associates|Murach's Mainframe COBOL|Mike Murach and Anne Prince and Raul Menendez|9781890774240\n2001|Wiley|Programming In COBOL / 400|Cooper, James and Stern, Nancy B. and Stern, Robert A.|9780471418467\n1998|Wiley|Advanced COBOL for Structured and Object-Oriented Programming, 3rdEdition|Brown, Gary DeWard|9780471314813\n2008|Charles River Media|Java for COBOL Programmers (Programming Series)|Byrne, John C.|9781584505655\n2014|Apress|Beginning COBOL for Programmers|Coughlan, Michael|9781430262541\n1989|Mike Murach & Associates Inc|Vsam for the Cobol Programmer: Concepts, Cobol, Jcl, Idcams|Lowe, Doug|9780911625455\n2002|Wiley|COBOL for the 21st Century|Stern, Nancy B. and Stern, Robert A. and Ley, James P.|9780471073215\n2000|Mike Murach & Associates Inc|Murach's Structured COBOL|Murach, Mike and Prince, Anne and Menendez, Raul|9781890774059\n1998|Sams Publishing|Sams Teach Yourself COBOL in 24 Hours|Hubbell, Thane|9780768685206\n1998|Sams Publishing|Sams Teach Yourself COBOL in 24 Hours|Hubbell, Thane|9780672314537\n1998|Sams|Cobol Unleashed|Wessler, Jon|9780672312540\n1994-02-02T00:00:01Z|Wiley|Structured COBOL Programming, 7th Edition|Stern, Nancy and Stern, Robert A.|9780471597476\n1977|Prentice Hall|Cobol Programming: A Structural Approach|Nickerson, Robert C.|9780876261293\n1999-11-18T00:00:01Z|Course Technology|Structured COBOL Programming, Second Edition (Shelly Cashman Series)|Shelly, Gary B. and Cashman, Thomas J. and Foreman, Roy O.|9780789557032\n2002|Charles River Media|Java for Cobol Programmers (Programming Series)|Byrne, John C and Cross, Jim|9781584502289\n1992|Wiley|Advanced ANSI COBOL with Structured Programming: For VS COBOL II and Microsoft Micro Focus COBOL|Brown, Gary DeWard|9780471547860\n1978T|W. C. Brown Co|Fundamentals of structured COBOL programming|Feingold, Carl|9780697081285\n1998-03-09T00:00:01Z|Wiley|Structured Cobol Programming|Stern, Nancy B. and Stern, Robert A.|9780471183846\n1970|John Wiley & Sons|COBOL Programming|Stern, Nancy B. and Stern, Robert A.|9780471823179\n1994|Wiley|Structured COBOL Programming Seventh Edition with Wiley COBOL Syntax Reference Guide with IBM and VAX Enhancements|Stern, Nancy B. and Stern, Robert A.|9780471008385\n2002|iUniverse|Structured Programming with COBOL Examples|Parsons, Earl H.|9780595650347\n2003|Apress|COBOL and Visual Basic on .NET: A Guide for the Reformed Mainframe Programmer|Chris L. Richardson|9781590590485\n1970|Wiley-Interscience|A guide to COBOL programming|McCracken, Daniel D|9780471582434\n2008|Pearson Technology Group|C for COBOL Programmers: A Business Approach|Gearing, Jim|9780805316605\n1991-07-01T00:00:01Z|McGraw-Hill College|Modern Cobol Programming|Price, Wilson T. and Olson, Jack|9780078375279\n1985-04-01T00:00:01Z|Pearson College Div|Structured Cobol Programming|Grauer, Robert T.|9780138542177\n2002|iUniverse|Structured Programming with COBOL Examples|Parsons, Earl|9780595250943\n1995|Course Technology|Structured COBOL Programming (Shelly Cashman Series)|Shelly, Gary B. and Cashman, Thomas J. and Foreman, Roy O.|9780878354863\n1985T|Anaheim Pub. Co|Structured COBOL|Shelly, Gary B|9780878351978\n1989-06-01T00:00:01Z|McGraw-Hill Education - Europe|COBOL Programming: Problems and Solutions: Refer to Title When This ISBN Is the Main ISBN|Roy|9780074603185\n1994|Sams|Teach Yourself Cobol in 21 Days (Sams Teach Yourself)|Budlong, Mo|9780672304699\n1990|McGraw-Hill Inc.,US|Structured Cobol|Welburn, Tyler and Price, Wilson|9780070691667\n1976|Wiley|A simplified guide to structured COBOL programming|McCracken, Daniel D|9780471582847\n1974-06-01T00:00:01Z|Anaheim Pub Co|Advanced ANSI Cobol Disk/Tape Programming Efficiencies (Their ANSI COBOL series)|Shelly, Gary B. and Cashman, Thomas J.|9780882361055\n1980|Reston Pub. Co|Cobol programming, a structured approach|Abel, Peter|9780835908337\n1991|John Wiley & Sons Inc|Structured Cobol Programming 6ed||9780471549291\n1991|Wiley|Structured COBOL Programming, Syntax Guide|Stern, Nancy B. and Stern, Robert A.|9780471540281\n1991|William C Brown Pub|Fundamentals of Structured Cobol Programming|Feingold, Carl and Wolff, Louis|9780697067227\n1984|Letts Educational|Structured Programming in Cobol|Holmes, B. J.|9780905435411\n1988-01-01T00:00:01Z|Harcourt College Pub|Beginning Structured Cobol|Coburn, Edward J.|9780155053700\n1981|John Wiley & Sons|Beyond Cobol|Brown, Gary|9780471099499\n2007|STERN/ STERN|Structured Cobol Programming, 8Th Ed|WILEY INDIA and WILEY INDIA and WILEY INDIA|9788126511877\n1997|Boyd & Fraser Pub. Co.|Comprehensive Structured COBOL|Horn, L. Wayne and Gleason, Gary M. and Horn, Lister Wayne|9780877096214\n1984|Computing McGraw-Hill|Schaum's Outline of Theory and Problems of Programming With Structured Cobol (Schaum's Outlines)|Newcomer, Lawrence R.|9780070379985\n1983|Palgrave Macmillan|Mastering COBOL Programming (Macmillan Master Series)|Hutty, R.|9780333343852\n1977|Winthrop Publishers|High level COBOL programming (Winthrop computer systems series)|Weinberg, Gerald M.; et.al.|9780876263297\n2001|Wiley|Structured COBOL Programming: Update Version for 2001 - 2002|Stern, Nancy B. and Stern, Robert A.|9780471438656\n1981-06T|Anaheim Pub Co|Introduction to Computer Programming Structured COBOL|Shelly, Gary B. and Cashman, Thomas J.|9780882362267\n1977|Wiley|Advanced ANS COBOL with structured programming|Brown, Gary DeWard|9780471106425\n1985|Wiley|Structured COBOL programming|Stern, Nancy B|9780471871507\n1975|John Wiley & Sons|COBOL Programming|Stern, Nancy B.|9780471823292\n1982-10-01T00:00:01Z|Hodder & Stoughton Educational Division|Teach Yourself Computer Programming in COBOL (Teach Yourself)|Fisher, M.|9780340203835\n1997|Wiley|Structured COBOL programming|Stern, Nancy B|9780471170662\n1990|Wiley|Structured COBOL Programming|Stern, Nancy B. and Stern, Robert A.|9780471524212\n1990|Prentice Hall|Professional Programming in Cobol|Johnson, Bruce M. and Ruwe, Marcia|9780137255733\n2005-09-14T00:00:01Z|John Wiley & Sons Inc|Structured COBOL Programming|Stern, Nancy B.|9780471755395\n1974|R. D. Irwin|COBOL logic and programming (Irwin-Dorsey information processing series)|McCameron, Fritz A|9780256015812\n1991-02-01T00:00:01Z|McGraw-Hill College|Modern Cobol Programming/Book and Disk|Price, Wilson T.|9780078375262\n1971|Holt Rinehart and Winston|American National Standard COBOL Programming|Newell, John C.|9780030863127\n1977-06-01T00:00:01Z|Anaheim Pub Co|Introduction to Computer Programming: Structured Cobol (With Charts)|Shelly, Gary B.|9780882361116\n1973|Wiley|Modular programming in COBOL (Business data processing: a Wiley series)|Armstrong, Russell M|9780471033257\n1972|John Wiley & Sons|COBOL Support Packages: Programming and Productivity AIDS (Chemistry of Functional Groups)|Naftaly, Stanley M.|9780471628408\n1981|R.D. Irwin|COBOL logic and programming: A structured approach (The Irwin series in information and decision sciences)|McCameron, Fritz A|9780256024838\n1990|Wiley|VS COBOL II for COBOL Programmers|Sandler, Robert J.|9780471622260\n19900704|Bloomsbury UK|COBOL 85 Programming|Roger Hutty|9781349208111\n1979|John Wiley & Sons|Structured COBOL Programming|Stern, Nancy B.|9780471049135\n19971111|Bloomsbury UK|Mastering COBOL Programming|Roger Hutty; Mary Spence|9781349143276\n1984|Reston Pub. Co|COBOL programming: A structured approach|Abel, Peter|9780835908085\n1988|Prentice Hall|Cobol Programming: A Structured Approach|Abel, Peter|9780131392472\n1990|Krieger Pub Co|Structured Programming With Cobol and Jsp|Thompson, John B.|9780862382452\n2018|Forgotten Books|American National Standard, Programming Language Cobol (Classic Reprint)|Standards, National Bureau of|9780428621605\n1977|Winthrop Publishers|COBOL for students: A programming primer (Winthrop computer systems series)|Finkenaur, Robert G|9780876261323\n19911111|Bloomsbury UK|COBOL|Tony Royce|9781349122387\n1991|William C Brown Pub|Structured Cobol|Gerard A. Paquette|9780697077639\n1970|Heinemann Educational|Cobol Programming|Watters, John.|9780435778019\n1988||Cobol Programming: A Structured Approach|Peter Abel|9780131398900\n1980/05/08|John Wiley & Sons|Structured COBOL|Ruth Ashley|9780471053620\n1987|New York : McGraw-Hill, c1987.|Structured COBOL|step approach|9780070157880\n1998|John Wiley & Sons Inc|Cobol Programming|Nancy B. Stern|9780471315391\n1983|Mcgraw-hill Education|Cobol Programming|M.k. Roy and D.ghosh Dastidar|9780074518663\n1982|John Wiley & Sons|Cobol Programming|J.m. Triance|9780471894957\n1989|W.c. Brown|Structured Cobol|Matthews, Robert I.|9780697067777\n||COBOL Programming|Triance and J. M.|9780850122497\n19921111|Bloomsbury UK|Structured COBOL|Tony Royce|9781349122400\n1990|Wiley|Simplified Structured Cobol With Microsoft Microfocus Cobol|Mccracken and Daniel D.; Golden and Donald G.|9780471514077\n1988/02/01|St. Louis : Times Mirror/Mosby College Pub., 1988.|Structured COBOL|College Pub. and 1988.|9780801616624\n1993|Mcgraw-hill|Cobol/370: For Vs Cobol And Cobol Ii Programmers (j Ranade Ibm Series)|Harvey Bookman|9780070065833\n1990|John Wiley And Sons Ltd|Structured Cobol Programming|Nancy Stern and Robert A. Stern|9780471534006\n1994|John Wiley And Sons Ltd|Structured Cobol Programming|Nancy Stern and Robert A. Stern|9780471305804\n1982|Bobbs-merrill Educational Pub|Structured Cobol Programming|Morris Pollack|9780672976919\n2000||Structured Cobol Programming|Gary B. Shelly / Cashman / Foreman / Thomas J. Cashman|9780789557155\n1998|Prentice Hall Ptr|Cobol Programmer's Notebook|James Edward Keogh|9780139774140\n2002|Wiley|Structured Cobol Programming|Nancy B Stern|9780471232148\n1999|John Wiley & Sons Inc|Structured Cobol Programming|Nancy B. Stern and Robert A. Stern|9780471362197\n1985|D C Heath & Co|Structured Cobol (college)|Gary Haggard|9780669062076\n1996|Wiley|Structured Cobol Programming|Nancy Stern and Robert A. M. Stern and Robert A. Stern|9789971512460\n1977|Prentice-hall|Ans Cobol Programming|James A Saxon|9780130377708\n1984|Blackwell Publishers|Structured Cobol Programming|J. M. Triance|9780850124217\n1974|Manchester University Press|Programming In Cobol|John M. Triance|9780719005923\n1999|John Wiley & Sons Inc|Structured Cobol Programming|Nancy B. Stern and Robert A. Stern|9780471384304\n1972|Prentice-hall|Ansi Cobol Programming|Saxon and James A|9780130377395\n1982|Bobbs-merrill Educational Pub|Structured Cobol Programming|Morris Pollack|9780672976902\n2000|Wiley|Structured Cobol Programming, Getting Started With Fujitsu Cobol 3.0|Nancy Stern and Robert A. Stern and Calvin Priester|9780471378839\n1988/04/27|John Wiley & Sons|Structured COBOL Programming|Robert A. Stern and Nancy B. Stern|9780471632870\n|Watsonville, Calif. : Mitchell Pub., C1989.|Modern Cobol Programming||9780075552901\n1987|Englewood Cliffs, N.J. : Prentice-Hall, 1985.|Structured COBOL programming|Robert T. Grauer|9780138534905\n1976|New York : Academic Press, c1976|Programming standard COBOL|Winchung A. Chai and Henry W. Chai|9780121665500\n|John Wiley & Sons Inc|Structured COBOL Programming|Stern, Nancy B. and Stern, Robert Mitchell|9780471323730\n|John Wiley & Sons Inc|Structured Cobol Programming 8e + Microfocus Personal Cobol For Windows + Mastering Cobol Computer Based Training Set||9780471255253\n|Watsonville, Calif. : Mitchell Pub., C1989.|Modern Cobol Programming||9780075564966\n1986|Glenview, Ill. : Scott, Foresman, C1986.|Structured Cobol Programming|J K Pierson and Jeretta Horn|9780673159137\n1984/11/01|Monterey, Calif. : Brooks/Cole Pub. Co., c1985.|Beginning structured COBOL|Donald Keith Carver|9780534037956\n1972|Englewood Cliffs, N.J., Prentice-Hall [1972]|ANSI COBOL programming|James A. Saxon and H.S. Englander|9780130377210\n2015-01-05|Wiley|COBOL Software Modernization|Franck Barbier and Jean-Luc Recoussine|9781119073222\n1996|Course Technology Ptr|Structured Cobol Programming: With Microfocus Cobol For Windows 1.1|Gary B. Shelly and Thomas J. Cashman and Roy O. Foreman|9780789512963\n1991|Mcgraw-hill Education (ise Editions)|Comprehensive Cobol: Advanced Cobol Programming (chapters 14-26) Vol Ii|Andrew S. Philippakis and Leonard J. Kazmier|9780071127684\n1975|Petrocelli Books|Cobol Programming: An Introduction|Torgil Ekman|9780884053156\n2004|Prentice-hall Of India Pvt.ltd|Computer Programming In Cobol|V. Rajaram and H.v. Sahashrabuddhe|9788120300309\n1981|Van Nostrand Reinhold Co|Introductory Structured Cobol Programming|Gary S Popkin|9780442267711\n1975|Prentice Hall|Fundamental Ansi Cobol Programming|James B. Maginnis|9780133392340\n1994|Dame Publications|Application Programming Using Cobol|N/a|9780873932509\n1987|Little, Brown|Fundamentals Of Structured Cobol|Robert C Nickerson|9780316606622\n1996||Structured Cobol Programming Seventh Edition With Syntax Guide Cobol Cbt Set|Nancy Stern|9780471160083\n1984|Pearson College Div|Structured Ans Cobol Programming|William M. Fuori and Stephen Gaughran|9780138544300\n1973|Science Research Associates|Programming In Standard Cobol|Gopal K. Kapur|9780574179807\n1977|Dryden Press|Elements Of Cobol Programming|Wilson T. Price; Jack Olson|9780030183713\n||Wie Structured COBOL Programming|Stern and Robert A. and Ley and James P. and Nancy|9780471428855\n1987|Holt Rinehart & Winston|Structured Programming In Cobol|Robert Boettcher|9780030705595\n1979|Allyn And Bacon|Cobol Programming And Applications|C. Joseph Sass|9780205065509\n1976|Allyn And Bacon|Fundamentals Of Cobol Programming|Walker, Terry M.|9780205048847\n1980|Van Nostrand Reinhold|Introductory Structured Cobol Programming|Gary Popkin|9780442267735\n1973|W. C. Brown Co|Fundamentals Of Cobol Programming|Carl Feingold|9780697081070\n1985|Kent Pub Co|Introductory Structured Cobol Programming|Popkin and Gary S.|9780534045661\n1970|John Wiley & Sons Inc|Guide To Cobol Programming|Daniel D. Mccracken and Umberto Garbassi|9780471582441\n1977|A Wiley-qed Publication|High Level Cobol Programming|Gerald Weinberg|9780894351266\n2014|Apress,|Beginning Cobol For Programmers|Coughlan, Michael|\n1997|29th Street Pr|Programming In Cobol 400|Virginia Willis|9781882419326\nOctober 1997||Structured Cobol Programming Eighth Edition and Mastering COBOL: Computer Based Training|Rex Woollard and Nancy Stern|9780471184089\n1991|Mcgraw-hill Education (ise Editions)|Comprehensive Cobol: Fundamentals Of Cobol Programming (chapters 1-13) Vol I|Andrew S. Philippakis and Leonard J. Kazmier|9780071127677\n|Englewood Cliffs, N.J., Prentice-Hall [1974, c1975]|Fundamental ANSI COBOL programming|Maginnis and James B.|9780133392180\n1982|Rockville, MD : Computer Science Press, c1982.|Essentials of COBOL programming|Gerald N Pitts|9780914894346\n1995|New York : McGraw-Hill, c1996.|Reengineering COBOL with objects|step to sustainable legacy systems|9780070377745\n1984|Wiley|Using Structured Cobol. Cobol Book 2. (data Processing Training Series) (bk. 2)|Ruth Ashley|9780471871859\n1991|Prentice Hall|Cobol From Micro To Mainframe, Structured Cobol Programming Volume 1 (volume 1)|Robert T. Grauer & Carol Vazquez Villar|9780131402782\n1989|Prentice Hall|Crystal Clear Cobol: An Introduction To Cobol And Structured Programming (v. 1)|Trotter and William H.|9780131950177\n1975|Harcourt Brace Jovanovich|Introduction To Standard Cobol Programming|Fredric Stuart|9780155459632\n1974|Intext Educational Publishers|An Introduction To Cobol Programming|Paul W Murrill|9780700224579\n1994|Dame|Advanced Application Programming Using Cobol|Kenneth D Douglas|9780873932806\n1998|John Wiley And Sons Ltd|Structures Cobol Programming 8e Set|Stern|9780471321033\n1993|*a Wiley-qed Publication|Vse Cobol Ii Power Programming|David S. Kirk|9780471573586\n1990|Palgrave|Cobol 85 Programming (computer Science)|Roger Hutty|9780333484302\n1994|Dame|Comprehensive Application Programming Using Cobol|Kenneth D Douglas|9780873932912\n1978|Krieger Pub Co|Essentials Of Structured Cobol Programming|Jan Lee Mize and William W. Cotterman|9780534005801\n1994||Structured Cobol Programming 7e Tr|Nancy B. Stern|9780471306740\n1986|Van Nostrand Reinhold|Cobol For The Ibm Pc|Lim, Pacifico A.|9780442259709\n1997|John Wiley & Sons Inc|Structured Cobol Programming 8e Tb|Stern and Nancy B.|9780471167808\n1982|Holt Rinehart & Winston|Elements Of Structured Cobol Programming|Wilson T. Price|9780030580529\n1988|W.c. Brown|Fundamentals Of Structured Cobol Programming|Carl Feingold|9780697009692\n1994|Wiley|Structured Cobol Programming Seventh Edition With Syntax Reference Guide And Micro Focus Personal Cobol Compiler And Mf Cobol Student Manual Set|Nancy B. Stern and Robert A. Stern|9780471034483\n1992|John Wiley & Sons Inc|Structured Cobol Programming 6e Tr|N Stern|9780471535430\n1985|South-western Pub|Programming Principles With Cobol Ii|Ronald W. Eaves and Don B. Medley|9780538104609\n1988|John Wiley And Sons Ltd|Stern: Structured Cobol Programming 5ed|N Stern|9780471610533\n1993|Micro Focus Pub|Object Orientation For Cobol Programming|Raymond Obin|9781569280058\n1994|Dubuque, IA : Business & Educational Technologies, c1994.|Using Micro Focus Personal COBOL|Mark W. Smith and Douglas Coker|9780697226457\n1991|Wiley|Getting Started With Rm/cobol Sixth Edition Set 5.25 And Structured Cobol Programming|Nancy B. Stern and Robert A. Stern|9780471533597\n1991|John Wiley & Sons Inc.|Getting Started With Rm/cobal-85/structured Cobol Programming/with Free Cobol Syntax Referen...|Nancy Stern and Robert Stern|9780471533603\n1990|Palgrave Macmillan|Cobol 85 Programming (computer Science Series)|Roger Hutty|9780333484296\n1984|J. Wiley|A Practical Approach To Cobol Programming|Sharad Kant|9780470273920\n1977|Petrocelli/charter|Reducing Cobol Complexity Through Structured Programming|Carma L Mcclure|9780884054665\n1983|Palgrave Macmillan|Mastering Cobol Programming (macmillan Modern Shakespeare)|R. Hutty|9780333343845\n2002|Pearson Education|Cobol Programming Using The .net Framework|Ronald D. Reeves|9780130668431\n1983|Palgrave, Formerly Macmillan Press|Mastering Cobol Programming (macmillan Master Guides)|R. Hutty|9780333354575\n1978|Van Nostrand Reinhold|Reducing Cobol Complexity Through Structured Programming|Carma L. Mcclure|9780442804664\n1969|Prentice-hall|Fundamental Cobol For Ibm System 360|Robert L Jones|9780133321142\n1976|Facet Publishing|Cobol Programming: An Introduction For Librarians|Peter Brophy|9780851572154\n1999|John Wiley And Sons|Structured Cobol Programming Fujitsu Compiler Cd|Stern|9780471350286\n2010|New Age International Publisher|A Practical Approach To Cobol Programming|Sharad Kant|9788122427752\n1984|International Thomson Publishing|Programming The Ibm Personal Computer: Cobol|Graham and N.|9780030595639\n1997|Palgrave|Mastering Cobol Programming (macmillan Master Series)|Roger Hutty and Mary Spence|9780333681060\n1988|Prentice Hall|Advanced Structured Cobol And Program Design|Don Cassel|9780130114952\n1988|Prentice Hall|Cobol For The Ibm Personal Computer|Kip R. Irvine|9780131397347\n1983|Newnes Technical Books|Cobol For Micros (newnes Programming Books)|Norman Stang|9780408013420\n1984|New York : Holt, Rinehart, and Winston, c1984.|Programming the IBM Personal Computer, COBOL|Neill Graham|9780030639937\n20080101|Springer Nature|COBOL and Visual Basic on .NET|Chris L. Richardson|9781430207726\n1983|Teach Yourself|Teach Yourself Computer Programming In Cobol|Random House Staff|9780679102595\n20140106|Emereo|COBOL 177 Success Secrets - 177 Most Asked Questions On COBOL - What You Need To Know|Wayne Russell|9781488533242\n05/2001|Mike Murach & Associates|Murach's CICS for the COBOL Programmer|Doug Lowe, Raul Menendez|9781943872428\n|D C Heath & Co|Application Programming And File Processing In Cobol|Yuksel Uckan|9780669165715\n1994|Boyd & Fraser Pub Co|Structured Cobol Programming: Interactive And Batch Processing|Bernard L. Levite|9780877098928\n1988|Wiley|A Simplified Guide To Structured Cobol Programming|Daniel D. Mccracken and Donald G. Golden|9780471886587\n1992|D C Heath & Co|Application Programming And File Processing In Cobol|Yuksel Uckan|9780669165708\n||Programming Principles With Cobol I: Instructors' Manual||9780538277051\n1997|John Wiley & Sons|Structured Cobol Programming With Syntax Guide And Student Program, Data Disk And Micro Focus Personal Cobol For Windows And Getting Started With Microfocus Cobol For Windows|Nancy Stern and Robert A. Stern and John Crawford and E. Reed Doke|9780471184966\n1984|Barrons Educational Series Inc|Computer Programming In Cobol The Easy Way|Beverly Rosendorf|9780812028010\n1989|Wadsworth Pub|A Complete Course In Structured Cobol Programming|John C Molluzzo|9780534100926\n1988|John Wiley And Sons (wie)|A Simplified Guide To Structured Cobol Programming|Daniel D. Mccracken and Donald G. Golden|9780471610540\n|Scott, Foresman|Instructor's Manual To Accompany Structured Cobol Programming|Horn, Jeretta A.|9780673481054\n1997||Structured Cobol Programming Eighth Edition And Getting Started With Ryan Mcfarland Cobol 3.5 Inch Disks, Second Edition|J. Janossy and Nancy Stern|9780471184096\n1997|Wiley|Structured Cobol Programming Eighth Edition With Syntax Guide And Student Program And Data Disk And Micro Focus Personal Cobol 2.0 For Dos Compiler ... Micro Focus Personal Cobol Student Manual|Nancy B. Stern and Robert A. Stern and John B. Crawford|9780471184959\n1987|Wellesley, Mass. : QED Information Sciences, c1988.|Handbook of COBOL techniques and programming standards|Partners and Computer|9780894352270\n2004|John Wiley & Sons|Structured Cobol Programming: With Microfocus Net Express 4.0|Nancy Stern|9780471690580\n1989|Krieger Pub Co|Structured Programming With Cobol And Jsp (polytechnic Series)|John B. Thompson|9780862381547\n1983|Ccd Online Systems|Cics/vs Command Level Programming With Cobol Examples|S. David Lee|9780131338852\n1970-06|Addison-wesley Pub Co|Basic Cobol Programming: Self-instructional Manual And Text|L.m. Spitzearth|9780201071337\n1981|Financial Times Prentice Hall (a Pearson Education Company)|Pocket Guide To Cobol (pitman Programming Pocket Guides)|Ray Welland|9780273016502\n|John Wiley & Sons Inc|Cobol 2000 Upd Mf Comp Doke Bonner Set||9780471321293\n|John Wiley & Sons Inc|Stern/structured Cobol Programming Seventh Edition With Syntax Reference Guide 2e And Stern/getting Started With Micro Focus Cobol Set|Stern|9780471014355\n1986|Mike Murach & Associates Inc|Structured Ans Cobol, Part 1: A Course For Novices Using A Subset Of 1974 And 1985 Ans Cobol (pt. 1)|Mike Murach|9780911625370\n11/1/1984|Englewood Cliffs, NJ : Prentice-Hall, c1985.|COBOL with an emphasis on structured program design|Dennis F. Galletta|9780131398580\n1988|Wiley|Simplified Guide To Structured Cobol Programming: Instructor's Manual|Donald G. Golden and Daniel D. McCracken|9780471600190\n|Boston: Allyn and Bacon, 1979.|Solutions manual to accompany COBOL programming and applications||9780205065523\n|John Wiley & Sons Inc|Website To Accompany Structured Cobol Programming, 10th Edition||9780471232131\n1986|C C D Online Systems, Incorporated|Cics/Vs Command Level Programming With Cobol Examples|S. David Lee|9780961181017\n1999|John Wiley & Sons Inc|Structured Cobol Programming: For The Year 2000 And Beyond|Nancy Stern|9780471362487\n1989|William C Brown Pub|Essentials Of Cics Vs Command Level Programming Using Cobol|Robert William Lowe|9780697073211\n1994|*a Wiley-qed Publication|Os/2 Presentation Manager Programming For Cobol Programmers, Rev.ed.|Robert B. Chapman|9780471561408\n1976|Hayden Book Co|Cobol With Style: Programming Proverbs (hayden Computer Programming Series)|Louis J Chmura|9780810457812\n1987|Wadsworth Pub Co|Structured Cobol Programming (wadsworth Series In Computer Information Systems)|John C. Molluzzo|9780534071882\n1994|John Wiley & Sons Inc|Structured Cobol Programming 7e - Instructor's Resource Guide (paper Only)|Nancy B. Stern|9780471306757\n1985|John Wiley & Sons Inc|Study Guide To Accompany Structured Cobol Programming, 4th Edition|Nancy Stern|9780471880677\n1985|Prentice Hall|Cobol Programming For The Ibm Pc And Pc Xt|William M. Fuori|9789993270805\n1985|Amer Natl Standards Inst|Programming Language Cobol (ansi X3 23-1985, Fips 21-3)|Unknown|9789993129134\n1992|John Wiley & Sons Inc|Stern: Teachers Manual To Accompany Structured Cobol Programming 6ed (manual)|Stern|9780471535447\n2001|Object-z Publishing|Elements Of Cobol Web Programming : Using Micro Focus Net Express|Price and Wilson T|9780965594516\n1997|Macmillan Digital Publishing|Cobol Programming Starter Kit (includes Cd-rom) C/ww95/us|Microfocus Personal|9780672312045\n1984|Wiley|Introduction To Structured Cobol (data Processing Training Series) (bk. 1)|Ruth Ashley|9780471870258\n1977|Mike Murach & Associates|Structured Programming For The Cobol Programmer: Design Documentation Coding Testing|Paul Noll|9780911625035\n1996|Ibm|Ibm Visualage For Cobol For Os/2 Object: Oriented Programming|Ibm Redbooks|9780738409344\n1973|Wadsworth Pub. Co.|American National Standard Cobol For The Ibm System 360-370|Drummond, Marshall E.|9780534001490\n1980|John Wiley & Sons Inc|Introduction To Business Data Processing With Basic, Fortran And Cobol Programming|Donald Keith Carver|9780471063032\n1999|M V S Training, Incorporated|Cobol For Os/390 Power Programming With Complete Year 2000 Section|David S. Kirk|9781892559029\n1977|Scott Foresman & Co|Cobol For Students: A Programming Primer (little, Brown Computer Systems Series)|Robert G. Finkenaur|9780316283205\n1985|R.d. Irwin|Cobol Logic And Programming (the Irwin Series In Information And Decision Sciences)|Fritz A Mccameron|9780256032109\n1986|Mcgraw-hill Book Company, New York|Schaum's Outling Series: Theory And Problems Of Programming With Advanced Structured Cobol|Lawrence R. Newcomer|9780070379992\n1984|R.d. Irwin|Essentials Of Cobol Programming (the Irwin Series In Information And Decision Sciences)|Roger R Mcgrath|9780256029956\n1997|Made Simple|Cobol Made Simple: (programming For The Year 2000 Problem) (made Simple Books)|Conor Sexton|9780750638340\n1982|William C Brown Pub|Business Applications Of Structured Cobol Programming (allyn And Bacon Computer Science Series)|Anne L. Topping|9780205077502\n1971|Mcgraw-hill|Instructor's Manual To Accompany Elementary Cobol Programming, A Step By Step Approach|Gordon Bitter Davis|9780070157811\n1992|Wiley|Vax Cobol On-line: Interactive Programming Concepts And Examples (wiley Professional Computing)|James G. Janossy|9780471551966\n1999||Structured Cobol Programming 9e Sol Programming Assignments For The Year 2000 & Beyond +d3|Nancy B. Stern|9780471332596\n1985|Brooks/cole Pub Co|Structured Cobol Programming And Data-processing Methods (brooks/cole Series In Computer Science)|Richard Mccalla|9780534044886\n2000|A H Wheeler Publishing Co Ltd|General Computing: Programming Languages - Basic, Cobol And Fortran (wheeler's Question Bank On Computer Science)|Subhash Mehta|9788175440784\n1988|Prentice Hall|The Cics Companion: A Reference Guide To Cobol Command Level Programming (mainframe Software Series)|Thomas Robert Gildersleeve|9780131344617\n1975|Wiley-interscience|Effective Use Of Ans Cobol Computer Programming Language (business Data Processing, A Wiley Series)|Laurence S Cohn|9780471164364\n1985|Ccd Online Systems|Ims/vs Dl/i Programming With Cobol Examples (ccd Online Systems Data Processing Series)|David Lee|9780961181048\n1994|Mcgraw-hill|Schaum's Outline Of Theory And Problems Of Programming With Modern Structured Cobol (schaum's Outlines)|Lawrence R. Newcomer|9780070380196\n1992|Van Nostrand Reinhold Computer|The Cobol Presentation Manager Programming Guide: For Os/2 Versions 1.3 And 2.0 (vnr Computer Library)|David Dill|9780442012939\n1980|Van Nostrand Reinhold|A Guide To Structured Cobol With Efficiency Techniques And Special Algorithms (van Nostrand Reinhold Data Processing Series)|Pacifico A. Lim|9780442245856\n|New York, Wiley [c1972]|Cobol Support Packages: Programming And Productivity Aids [by] Stanley M. Naftaly, Michael C. Cohen [and] Bruce G. Johnson||9780471622109\n1994|John Wiley & Sons Inc|Stern Structured Cobol Programming Seventh Edition And Wiley Syntax Reference Guide Second Edition And Stern Getting Started With Ryan Mcfarland Dual Med Set|Nancy Stern|9780471045106", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1976|A study of errors, error-proneness, and error diagnosis in Cobol|10.1145/359970.359991|59|3|C. Litecky and G. Davis|0ae9de76083b4c52136049dc7e0212a57d2be99e\n2010|Migrating from COBOL to Java|10.1109/ICSM.2010.5609583|41|3|H. Sneed|cd620781e4fb1729d66e09f1753ceb6dc6011add\n1996|Object-oriented COBOL|10.1201/9780849331350.ch17|22|3|E. C. Arranga and Frank P. Coyle|422657a2aa3ac33ab058ae758fdcdd7ed3e7b4b4\n1979|An implementation of structured walk-throughs in teaching Cobol programming|10.1145/359114.359116|21|0|Ronald S. Lemos|14d9e6e6c93402073cc01e64c6d30bd0c27b185b\n1987|Implications of automated restructuring of COBOL|10.1145/24900.24908|18|0|J. W. Miller and Burton M. Strauss|a1c6d7d68d2bd0168958c1e671ac4cede66e2542\n1979|Exploring software science relations in cobol and api|10.1109/CMPSAC.1979.762584|14|0|S. Zweben and K. Fung|359f381d8e35fccd4f59799dc26a2b62c18902ca\n2000|Cobol in an Object-Oriented World: A Learning Perspective|10.1109/52.841601|13|0|B. Hardgrave and E. Doke|30eeb73fb3a27fe03503d0b8ec23757b28efd682\n1983|Cost-benefit impact study on the adoption of the draft proposed revised X3.23 American National Standard programming language COBOL|10.6028/NBS.IR.83-2639|9|0|M. Fiorello and J. Cugini|32357d3a28ef8dbe3f0231b7f8221204bd80cd26\n2000|Cobol for the Next Millennium|10.1109/52.841606|8|0|Don Schricker|3390e1b5e9d9ed0883a5451249d1f00304f0edf4\n1980|Structured Programming in COBOL - The Corrent Options|10.1093/comjnl/23.3.194|4|0|J. M. Triance|4c7788321fee507324960b2f379965a5d97c8644\n1976|An introductory COBOL course with structured programming|10.1145/800107.803441|4|0|Asad Khailany|59d15bbc5f950e4827596d5a53c402fc6fe5db4f\n1978|The cost-effectiveness of team debugging in teaching cobol programming|10.1145/990555.990623|4|0|Ronald S. Lemos|3da3fa58a1b1575f382535765829d78cb2cf0306\n2012|A Toolchain for Metrics-based Comparison of COBOL and Migrated Java Systems|10.1007/BF03323484|3|1|Jan Jelschen and A. Winter|9520e40b3bf5bd351bf75f7cd1c1a899ad0faf79\n2015|Grace Hopper: Compilers and Cobol|10.1109/MITP.2015.6|3|0|George O. Strawn and Candace Strawn|f70f56977fdeb32ede03fabd85e49c62ca4e94ee\n1997|Facilitating COBOL programmers' transition to the C language|10.1145/268820.268876|2|0|Ritu Agarwal and Jayesh Prasad|7ec7ab7cfa8716e31c44378a0a3527e0cacf8326\n1978|ACM SIGPLAN history of programming languages conference COBOL 60 language summary|10.1145/960118.808377|2|0|S. Hautaniemi|3f13750bca503cab4a411c996277b2be87ecf0df\n1973|B73-1 An Introduction to Cobol Programming|10.1109/T-C.1973.223607|2|0|K. Siler|b5dddc982de38a810cc1c486021320f7a446a0c6\n2013|Design of a Reverse Engineering Model (A Case Study of COBOL to Java Migration)|10.5120/13734-1532|1|0|Aditya Trivedi and U. Suman|4ac6817bba526d3a2d558ce4f920ce7082696529\n2014|Beginning COBOL for Programmers|10.1007/978-1-4302-6254-1|1|0|Michael Coughlan|69a84011a9ef5a16a13e2b428c5ee223b0a9a00c\n2000|COBOL Script: a business-oriented scripting language|10.1109/EDOC.2000.882363|1|0|T. Imajo and T. Miyake and S. Sato and T. Ito and D. Yokotsuka and Y. Tsujihata and S. Uemura|7a68a5640d97453aeb2a2cd85d424671f54e167c" }, "cobolscript": { "title": "CobolScript", "appeared": 1999, "type": "pl", "website": "https://web.archive.org/web/20010402110850/http://deskware.com/", "country": [ "United States" ], "originCommunity": [ "Deskware" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "DISPLAY" ] ], "wikipedia": { "related": [ "cobol" ], "summary": "CobolScript is a programming language created by Matthew Dean and Charles Schereda of Deskware in 1999. The language was intended to provide web-enabled COBOL, and was targeted at businesses using legacy software written in that language.", "created": 2016, "backlinksCount": 16, "pageId": 50155661, "revisionCount": 10, "dailyPageViews": 6, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/CobolScript" }, "leachim6": { "filepath": "c/CobolScript.cbl", "fileExtensions": [ "cbl" ], "example": [ "DISPLAY `Content-type: text/html `.\nDISPLAY LINEFEED.\nDISPLAY ``.\nDISPLAY `
Hello World
`.\nDISPLAY ``.\nGOBACK.\n" ], "id": "CobolScript" }, "centralPackageRepositoryCount": 0 }, "cobra": { "title": "Cobra", "appeared": 2006, "type": "pl", "creators": [ "Charles Esterbrook" ], "website": "http://cobra-language.com/", "fileExtensions": [ "cobra" ], "country": [ "United States" ], "originCommunity": [ "Cobra Language LLC" ], "domainName": { "registered": 2008, "awisRank": { "2017": 5837168 }, "name": "cobra-language.com" }, "hasSemanticIndentation": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "class Person\n\n var _name as String\n var _age as int\n\n cue init(name as String, age as int)\n _name, _age = name, age\n\n def toString as String is override\n return 'My name is [_name] and I am [_age] years old'" ], "related": [ "python", "eiffel", "csharp", "objective-c" ], "summary": "Cobra is a general-purpose, object-oriented programming language. Cobra is designed by Charles Esterbrook, and runs on the Microsoft .NET and Mono platforms. It is strongly influenced by Python, C#, Eiffel, Objective-C, and other programming languages. It supports both static and dynamic typing. It has support for unit tests and contracts. It has lambda expressions, closures, list comprehensions, and generators. Cobra is an open-source project; it was released under the MIT License on February 29, 2008. Updates are posted to the Cobra news forum with progress on features, fixes, documentation and related projects since the last update.", "pageId": 13862555, "dailyPageViews": 82, "created": 2007, "backlinksCount": 104, "revisionCount": 136, "appeared": 2006, "fileExtensions": [ "cobra" ], "url": "https://en.wikipedia.org/wiki/Cobra_(programming_language)" }, "projectEuler": { "memberCount": { "2019": 11, "2022": 11 }, "id": "Cobra" }, "helloWorldCollection": [ "\"\"\"Hello world in Cobra\"\"\"\n\nclass Hello\n\n def main\n print 'Hello, world.'" ], "leachim6": { "filepath": "c/Cobra.cobra", "fileExtensions": [ "cobra" ], "example": [ "class Hello\n\n def main\n print 'Hello World'" ], "id": "Cobra" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Cobra", "tryItOnline": "cobra", "tiobe": { "id": "Cobra" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Cobra (programming Language From Cobra Language Llc)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786132215611" }, "coco-r": { "title": "Coco/R", "appeared": 1990, "type": "grammarLanguage", "description": "Coco/R is a compiler generator, which takes an attributed grammar of a source language and generates a scanner and a parser for this language. The scanner works as a deterministic finite automaton. The parser uses recursive descent. LL(1) conflicts can be resolved by a multi-symbol lookahead or by semantic checks. Thus the class of accepted grammars is LL(k) for an arbitrary k.", "website": "http://ssw.jku.at/coco/", "country": [ "Austria" ], "originCommunity": [ "Johannes Kepler University" ], "wikipedia": { "related": [ "unicode", "utf-8", "java", "csharp", "pascal", "modula-2", "modula-3", "codegear-delphi", "python", "ruby", "eclipse-editor", "antlr", "javacc" ], "summary": "Coco/R is a compiler generator that takes an L-attributed Extended Backus–Naur Form (EBNF) grammar of a source language and generates a scanner and a parser for that language. The scanner works as a deterministic finite automaton. It supports Unicode characters in UTF-8 encoding and can be made case-sensitive or case-insensitive. It can also recognize tokens based on their right-hand-side context. In addition to terminal symbols the scanner can also recognize pragmas, which are tokens that are not part of the syntax but can occur anywhere in the input stream (e.g. compiler directives or end-of-line characters). The parser uses recursive descent; LL(1) conflicts can be resolved by either a multi-symbol lookahead or by semantic checks. Thus the class of accepted grammars is LL(k) for an arbitrary k. Fuzzy parsing is supported by so-called ANY symbols that match complementary sets of tokens. Semantic actions are written in the same language as the generated scanner and parser. The parser's error handling can be tuned by specifying synchronization points and \"weak symbols\" in the grammar. Coco/R checks the grammar for completeness, consistency, non-redundancy as well as for LL(1) conflicts. There are versions of Coco/R for most modern languages (Java, C#, C++, Pascal, Modula-2, Modula-3, Delphi, VB.NET, Python, Ruby and others). The latest versions from the University of Linz are those for C#, Java and C++. For the Java version, there is an Eclipse plug-in and for C#, a Visual Studio plug-in. There are also sample grammars for Java and C#. Coco/R was originally developed at the ETHZ and moved with Hanspeter Mössenböck to University of Linz when he got his appointment there. Coco/R is distributed under the terms of a slightly relaxed GNU General Public License.", "created": 2004, "pageId": 862658, "backlinksCount": 27, "revisionCount": 51, "dailyPageViews": 15, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Coco/R" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "coco": { "title": "Coco", "appeared": 2010, "type": "pl", "creators": [ "Satoshi Murakami" ], "website": "https://satyr.github.io/coco/", "fileExtensions": [ "co" ], "country": [ "Japan" ], "originCommunity": [ "https://github.com/satyr/" ], "compilesTo": [ "javascript" ], "githubRepo": { "stars": 501, "forks": 49, "subscribers": 25, "updated": 2014, "description": "Unfancy CoffeeScript", "url": "https://github.com/satyr/coco/" }, "repoStats": { "firstCommit": 2009, "commits": 3401, "committers": 39, "files": 69 } }, "cocoapods-pm": { "title": "cocoapods-pm", "appeared": 2011, "type": "packageManager", "website": "https://cocoapods.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/CocoaPods" ], "domainName": { "registered": 2011, "awisRank": { "2022": 61280 }, "name": "cocoapods.org" }, "packageCount": 57000, "forLanguages": [ "swift", "objective-c" ], "twitter": "https://twitter.com/cocoapods" }, "coconut": { "title": "Coconut", "appeared": 2014, "type": "pl", "website": "http://coconut-lang.org/", "webRepl": [ "https://cs121-team-panda.github.io/coconut-interpreter/" ], "reference": [ "https://news.ycombinator.com/item?id=23759721" ], "country": [ "Various" ], "originCommunity": [ "http://coconut-lang.org" ], "domainName": { "registered": 2016, "awisRank": { "2017": 4032050 }, "name": "coconut-lang.org" }, "compilesTo": [ "python" ], "writtenIn": [ "python" ], "hasPatternMatching": { "example": "match [head] + tail in [0, 1, 2, 3]:\n print(head, tail)", "value": true }, "hasInfixNotation": { "example": "5 `mod` 3 == 2", "value": true }, "hasAnonymousFunctions": { "example": "x -> x ** 2", "value": true }, "hasDestructuring": { "example": "{\"list\": [0] + rest} = {\"list\": [0, 1, 2, 3]}", "value": true }, "hasFunctionComposition": { "example": "(f..g..h)(x, y, z)", "value": true }, "hasAlgebraicTypes": { "example": "data Empty()\ndata Leaf(n)\ndata Node(l, r)\n\ndef size(Empty()) = 0\n\naddpattern def size(Leaf(n)) = 1\n\naddpattern def size(Node(l, r)) = size(l) + size(r)", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 3495, "forks": 104, "subscribers": 63, "created": 2014, "updated": 2022, "firstCommit": 2014, "description": "Simple, elegant, Pythonic functional programming.", "issues": 71, "url": "https://github.com/evhub/coconut" }, "repoStats": { "firstCommit": 2014, "commits": 4855, "committers": 34, "files": 89 }, "leachim6": { "filepath": "c/Coconut.coc", "fileExtensions": [ "coc" ], "example": [ "\"Hello World\" |> print\n" ], "id": "Coconut" }, "rijuRepl": { "example": [ "print(\"Hello, world!\")\n" ], "description": "Simple, elegant, Pythonic functional programming", "fileExtensions": [ "coco" ], "website": "https://coconut-lang.org/", "gitRepo": "https://github.com/evhub/coconut", "id": "https://riju.codes/coconut" }, "tryItOnline": "coconut", "jupyterKernel": [ "http://coconut-lang.org/" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "coda-editor": { "title": "Coda web development software", "appeared": 2007, "type": "editor", "website": "https://www.panic.com/coda/", "country": [ "United States" ], "originCommunity": [ "Panic Inc" ], "wikipedia": { "summary": "Coda is a commercial and proprietary web development application for macOS, developed by Panic. It was first released on April 23, 2007 and won the 2007 Apple Design Award for Best User Experience. Coda version 2.0 was released on 24 May 2012, along with an iPad version called Diet Coda. Although formerly available on the Mac App Store, it was announced on May 14, 2014 that the update to Coda 2.5 would not be available in the Mac App Store due to sandboxing restrictions.", "backlinksCount": 130, "pageId": 10858243, "dailyPageViews": 44, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Coda_(web_development_software)" } }, "code-blocks-editor": { "title": "code-blocks-editor", "appeared": 2005, "type": "editor" }, "codecept": { "title": "codecept", "appeared": 2015, "type": "library", "website": "http://codecept.io/", "country": [ "Ukraine and India" ], "originCommunity": [ "https://github.com/codeceptjs/" ], "domainName": { "registered": 2015, "awisRank": { "2022": 797998 }, "name": "codecept.io" }, "githubRepo": { "stars": 3725, "forks": 668, "subscribers": 106, "created": 2015, "updated": 2022, "description": "Supercharged End 2 End Testing Framework for NodeJS", "issues": 344, "url": "https://github.com/codeception/codeceptjs/" }, "twitter": "https://twitter.com/codeceptjs", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "codeflow": { "title": "codeflow", "appeared": 2014, "type": "pl", "isDead": true, "website": "https://codeflow.co/", "country": [ "Unknown" ], "originCommunity": [ "codeflow.co" ], "domainName": { "registered": 2015, "name": "codeflow.co" }, "visualParadigm": true, "githubRepo": { "stars": 4, "subscribers": 2, "created": 2016, "updated": 2019, "description": "Codeflow runtime engine", "url": "https://github.com/codeflowlang/codeflow-engine" }, "twitter": "https://twitter.com/codeflowlang" }, "codegear-delphi": { "title": "CodeGear Delphi", "appeared": 1995, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Borland Software Corporation", "Embarcadero Technologies" ], "wikipedia": { "example": [ "procedure TForm1.ShowSomethingOnCreate;\nbegin\n Label1.Text := 'Hello World!';\nend;" ], "related": [ "object-pascal", "pascal", "ia-32", "ios", "android", "linux", "turbo-pascal", "assembly-language", "java", "uml", "xml", "cil", "php", "visual-basic", "oxygene", "free-pascal" ], "summary": "Delphi is an integrated development environment (IDE) for rapid application development of desktop, mobile, web, and console software, developed by Embarcadero Technologies. It is also an event-driven language. Delphi's compilers use their own Object Pascal dialect of Pascal and generate native code for Microsoft Windows, macOS (IA-32 only), iOS, Android and Linux (x64 only). Since 2016, there have been new releases of Delphi every six months, with new platforms being added approximately every second release.Delphi includes a code editor, a visual designer, an integrated debugger, a source code control component, and support for third-party plugins. The code editor features Code Insight (code completion), Error Insight (real-time error-checking), and refactoring. The visual forms designer has traditionally used Visual Component Library (VCL) for native Windows development, but the FireMonkey (FMX) platform was later added for cross-platform development. Database support in Delphi is very strong. A Delphi project of a million lines to compile in a few seconds – one benchmark gave 170,000 lines per second. Delphi was originally developed by Borland as a rapid application development tool for Windows as the successor of Turbo Pascal. Delphi added full object-oriented programming to the existing language, and since then the language has grown to support generics and anonymous methods, and native Component Object Model (COM) support. In 2006, Borland’s developer tools section was transferred from Borland to a wholly owned subsidiary known as CodeGear, which was sold to Embarcadero Technologies in 2008. In 2015, Embarcadero was purchased by Idera Software, but the Embarcadero mark was retained for the developer tools division. Delphi and its C++ counterpart, C++Builder, are interoperable. They share many core components, notably the IDE, VCL, and much of the runtime library. In addition, they can be used jointly in a project. For example, C++Builder 6 and later can consume Delphi source code and C++ in one project, while packages compiled with C++Builder can be used from within Delphi. In 2007, the products were released jointly as RAD Studio, a shared host for Delphi and C++Builder, which can be purchased with either or both.", "created": 2009, "backlinksCount": 128, "pageId": 349208, "revisionCount": 3, "dailyPageViews": 7, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/CodeGear_Delphi" }, "centralPackageRepositoryCount": 0 }, "codelite-editor": { "title": "codelite-editor", "appeared": 2006, "type": "editor" }, "codemirror": { "title": "CodeMirror", "appeared": 2007, "type": "editor", "creators": [ "Marijn Haverbeke" ], "website": "https://codemirror.net/", "webRepl": [ "https://codemirror.net/try/" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/codemirror" ], "domainName": { "registered": 2010, "awisRank": { "2022": 102621 }, "name": "codemirror.net" }, "related": [ "monaco" ], "githubRepo": { "firstCommit": 2018, "stars": 2709, "forks": 207, "subscribers": 59, "created": 2018, "updated": 2022, "description": "Develpment repository for the CodeMirror editor project", "issues": 28, "url": "https://github.com/codemirror/dev" }, "wikipedia": { "related": [ "javascript", "vi-editor", "emacs-editor" ], "summary": "CodeMirror is a JavaScript component that provides a code editor in the browser. It has a rich programming API and a focus on extensibility.", "pageId": 38914715, "created": 2013, "backlinksCount": 171, "revisionCount": 74, "dailyPageViews": 37, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/CodeMirror" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "codeql": { "title": "CodeQL", "appeared": 2018, "type": "queryLanguage", "creators": [ "Pavel Avgustinov" ], "description": "CodeQL let's you query code as if it were data.", "website": "https://codeql.github.com/", "reference": [ "https://www.cyberark.com/resources/threat-research-blog/make-memcpy-safe-again-codeql" ], "fileExtensions": [ "ql" ], "originCommunity": [ "GitHub" ], "example": [ "from DataFlow::PathNode source, DataFlow::PathNode sink, UnsafeDeserializationConfig conf\n \n where conf.hasFlowPath(source, sink)\n \n select sink.getNode().(UnsafeDeserializationSink).getMethodAccess(), source, sink,\n \"Unsafe deserialization of $@.\", source.getNode(), \"user input\"" ], "githubRepo": { "firstCommit": 2018, "stars": 5035, "forks": 1089, "subscribers": 191, "created": 2018, "updated": 2022, "description": "CodeQL: the libraries and queries that power security researchers around the world, as well as code scanning in GitHub Advanced Security (code scanning), LGTM.com, and LGTM Enterprise", "issues": 736, "url": "https://github.com/github/codeql" }, "repoStats": { "firstCommit": 2018, "commits": 57878, "committers": 480, "files": 42417 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "ql", "qll" ], "aceMode": "text", "tmScope": "source.ql", "aliases": [ "ql" ], "repos": 3559, "id": "CodeQL" }, "githubBigQuery": { "repos": 25, "users": 23, "id": "CodeQL" } }, "codil": { "title": "CODIL", "appeared": 1970, "type": "pl", "reference": [ "https://doi.org/10.1093/comjnl/14.3.217" ], "country": [ "United Kingdom" ], "originCommunity": [ "International Computers Limited" ], "hopl": "https://hopl.info/showlanguage.prx?exp=544", "centralPackageRepositoryCount": 0 }, "coff": { "title": "Common Object File Format", "appeared": 1983, "type": "binaryExecutable", "standsFor": "Common Object File Format", "country": [ "United States" ], "originCommunity": [ "AT&T Corporation" ], "wikipedia": { "related": [ "unix", "elf", "c" ], "summary": "The Common Object File Format (COFF) is a format for executable, object code, and shared library computer files used on Unix systems. It was introduced in Unix System V, replaced the previously used a.out format, and formed the basis for extended specifications such as XCOFF and ECOFF, before being largely replaced by ELF, introduced with SVR4. COFF and its variants continue to be used on some Unix-like systems, on Microsoft Windows, in EFI environments and in some embedded development systems.", "pageId": 328325, "dailyPageViews": 79, "created": 2003, "backlinksCount": 63, "revisionCount": 134, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/COFF" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "coffee-cinema-4d": { "title": "COFFEE Cinema 4D", "appeared": 1992, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Cinema_4D" ], "country": [ "Germany" ], "originCommunity": [ "Maxon" ], "wikipedia": { "related": [ "perl", "javascript" ], "summary": "COFFEE (often written as \"C.O.F.F.E.E\") is a computer scripting language that forms part of CINEMA 4D, a proprietary 3D graphics application. Although presented as an acronym the letters of the word COFFEE do not appear to stand for anything, but are rather a comic reference to Java, a considerably more famous computer language.", "created": 2006, "backlinksCount": 5, "pageId": 6261085, "revisionCount": 19, "dailyPageViews": 5, "url": "https://en.wikipedia.org/wiki/COFFEE_(Cinema_4D)" }, "centralPackageRepositoryCount": 0 }, "coffeepp": { "title": "coffeepp", "appeared": 2017, "type": "pl", "website": "https://bixense.com/coffeepp/", "country": [ "Germany" ], "originCommunity": [ "bixense.com" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n14819066|Show HN: Coffee++, idea for a language that compiles into C++|2017-07-21 09:03:46 UTC|1500627826|jhasse|16|23" }, "coffeescript": { "title": "CoffeeScript", "appeared": 2009, "type": "pl", "creators": [ "Jeremy Ashkenas" ], "website": "http://coffeescript.org", "documentation": [ "https://coffeescript.org/#introduction", "https://devdocs.io/coffeescript~1/" ], "aka": [ "coffee" ], "fileExtensions": [ "coffee", "litcoffee" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/jashkenas" ], "domainName": { "registered": 2009, "awisRank": { "2017": 128299, "2022": 383033 }, "name": "coffeescript.org" }, "compilesTo": [ "javascript" ], "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "### A comment\n###", "value": true }, "hasStrings": { "example": "", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasInheritance": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasHexadecimals": { "example": "# 0x[0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "# [0-9][0-9]*\\.[0-9]+([eE][0-9]+)?[fd]?", "value": true }, "hasIntegers": { "example": "# [0-9]+", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "###" ] ], "printToken": [ [ "console.log" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "and", "or", "is", "isnt", "not", "on", "yes", "@", "no", "off", "true", "false", "null", "this", "new", "delete", "typeof", "in", "instanceof", "return", "throw", "break", "continue", "debugger", "if", "else", "switch", "for", "while", "do", "try", "catch", "finally", "class", "extends", "super", "undefined", "then", "unless", "until", "loop", "of", "by", "when" ], "wikipedia": { "example": [ "author = \"Wittgenstein\"\nquote = \"A picture is a fact. -- #{ author }\"\n\nsentence = \"#{ 22 / 7 } is a decent approximation of π\"" ], "related": [ "haskell", "javascript", "perl", "python", "ruby", "yaml", "livescript", "rails", "jquery", "maven-pom", "java", "markdown", "elm", "haxe", "dart", "opa", "typescript" ], "summary": "CoffeeScript is a programming language that transcompiles to JavaScript. It adds syntactic sugar inspired by Ruby, Python and Haskell in an effort to enhance JavaScript's brevity and readability. Specific additional features include list comprehension and pattern matching. CoffeeScript support is included in Ruby on Rails version 3.1 and Play Framework. In 2011, Brendan Eich referenced CoffeeScript as an influence on his thoughts about the future of JavaScript.", "pageId": 27403236, "dailyPageViews": 295, "created": 2010, "backlinksCount": 205, "revisionCount": 394, "appeared": 2011, "fileExtensions": [ "coffee", "litcoffee" ], "url": "https://en.wikipedia.org/wiki/CoffeeScript" }, "githubLanguage": { "fileExtensions": [ "coffee", "_coffee", "cake", "cjsx", "iced" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ncypress-io cypress https://github.com/cypress-io.png https://github.com/cypress-io/cypress CoffeeScript #244776 14465 770 668 \"Fast, easy and reliable testing for anything that runs in a browser.\"\nbasecamp trix https://github.com/basecamp.png https://github.com/basecamp/trix CoffeeScript #244776 13950 661 171 \"A rich text editor for everyday writing\"\ncodecombat codecombat https://github.com/codecombat.png https://github.com/codecombat/codecombat CoffeeScript #244776 6869 3506 42 \"Game for learning how to code.\"\noverleaf overleaf https://github.com/overleaf.png https://github.com/overleaf/overleaf CoffeeScript #244776 5599 712 110 \"A web-based collaborative LaTeX editor\"\nFelisCatus SwitchyOmega https://github.com/FelisCatus.png https://github.com/FelisCatus/SwitchyOmega CoffeeScript #244776 13272 2230 266 \"Manage and switch between multiple proxies quickly & easily.\"\nphilc vimium https://github.com/philc.png https://github.com/philc/vimium CoffeeScript #244776 11430 1380 164 \"The hacker's browser.\"", "trendingProjectsCount": 7, "type": "programming", "filenames": [ "Cakefile" ], "interpreters": [ "coffee" ], "aceMode": "coffee", "codemirrorMode": "coffeescript", "codemirrorMimeType": "text/x-coffeescript", "tmScope": "source.coffee", "aliases": [ "coffee", "coffee-script" ], "repos": 64590, "id": "CoffeeScript" }, "githubBigQuery": { "repos": 68631, "users": 44937, "id": "CoffeeScript" }, "monaco": "coffee", "codeMirror": "coffeescript", "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "coffee" ], "id": "CoffeeScript" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 30, "commitCount": 332, "sampleCount": 10, "example": [ "console.log \"Hello, World!\"\n" ], "url": "https://github.com/atom/language-coffee-script" }, "helloWorldCollection": [ "// Hello world in CoffeeScript\n\nalert \"Hello, World!\"" ], "leachim6": { "filepath": "c/CoffeeScript.coffee", "fileExtensions": [ "coffee" ], "example": [ "alert \"Hello World\"\n" ], "id": "CoffeeScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:CoffeeScript", "quineRelay": "CoffeeScript", "rijuRepl": { "example": [ "console.log \"Hello, world!\"\n" ], "description": "Compile-to-JavaScript programming language adding syntactic sugar inspired by Ruby, Python and Haskell in an effort to enhance JavaScript's brevity and readability", "fileExtensions": [ "coffee", "litcoffee" ], "website": "https://coffeescript.org/", "gitRepo": "https://github.com/jashkenas/coffeescript", "id": "https://riju.codes/coffeescript" }, "replit": "https://repl.it/languages/coffeescript", "tryItOnline": "coffeescript", "linkedInSkill": { "2018": 21574, "id": "coffeescript" }, "faqPageUrl": [ "https://github.com/jashkenas/coffeescript/wiki/FAQ" ], "tiobe": { "id": "CoffeeScript" }, "ubuntuPackage": "coffeescript", "jupyterKernel": [ "https://github.com/n-riesco/jp-coffeescript" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming in CoffeeScript (Developer's Library)|2012|Mark Bates|19193715|3.50|22|2\nCoffeescript Programming with Jquery, Rails, and Node.Js|2012|Michael Erasmus|23544945|3.50|10|2\nProgramming in Coffeescript|2012|Mark Bates|46311721|0.0|0|0\nProgramming in Coffeescript|2012|Mark Bates|46311722|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|CoffeeScript Application Development|Young, Ian|9781782162667\n2014|Manning|CoffeeScript in Action|Patrick Lee|9781617290626\n2012|Packt Publishing|CoffeeScript Programming with jQuery, Rails, and Node.js|Erasmus, Michael|9781849519588\n2012-12-13|Packt Publishing|CoffeeScript Programming with jQuery, Rails, and Node.js|Michael Erasmus|9781849519595\n2012|Addison-Wesley Professional|Programming in CoffeeScript (Developer's Library)|Bates, Mark|9780132946148\n2015|Packt Publishing|CoffeeScript Application Development Cookbook|Hatfield, Mike|9781783289707\n2012|Addison-Wesley Professional|Programming in CoffeeScript (Developer's Library)|Bates, Mark|9780321820105\n2013|Wiley|Smashing CoffeeScript|Hudson, Alex|9781118454374\n20121128|O'Reilly Media, Inc.|Jump Start CoffeeScript|Earle Castledine|9781457191961\n20140508|Simon & Schuster|CoffeeScript in Action|Patrick Lee|9781638352921\n20121128|O'Reilly Media, Inc.|Jump Start CoffeeScript|Earle Castledine|9781457191954\n20120119|O'Reilly Media, Inc.|The Little Book on CoffeeScript|Alex MacCaw|9781449325541\n20120119|O'Reilly Media, Inc.|The Little Book on CoffeeScript|Alex MacCaw|9781449325558", "semanticScholar": "" }, "cogmap": { "title": "CogMap", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b2d15340dc6750d68749bcfb4a02646712448933" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5536", "centralPackageRepositoryCount": 0 }, "cogo": { "title": "COGO", "appeared": 1962, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=280" }, "coherence": { "title": "coherence", "appeared": 2009, "type": "pl", "website": "http://coherence-lang.org", "domainName": { "registered": 2020, "name": "coherence-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n578630|Coherence Language: an experimental continuation of Subtext|http://coherence-lang.org|2009-04-25 04:58:28 UTC|1240635508|bkudria|0|2", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2004|Programming with transactional coherence and consistency (TCC)|10.1145/1037949.1024395|140|8|Lance Hammond and B. Carlstrom and Vicky Wong and Ben Hertzberg and Michael K. Chen and C. Kozyrakis and K. Olukotun|5987b948677c5528a061890f4df507c85a5a97b5\n1996|Teapot: language support for writing memory coherence protocols|10.1145/231379.231430|76|4|S. Chandra and Brad Richards and J. Larus|a9568ba43bd241415d27b65a6cdea7cf46a5e2ed\n1991|The Coherence of Languages with Intersection Types|10.1007/3-540-54415-1_70|71|6|J. C. Reynolds|a5b63628b2656ba3081f007f827fdebe693e955c\n2015|Multiparty session types as coherence proofs|10.1007/s00236-016-0285-y|44|1|Marco Carbone and F. Montesi and C. Schürmann and N. Yoshida|247f1c9e6ad2f7e0fcf0017d0d4bda58336fc693\n2003|Model checking a cache coherence protocol for a Java DSM implementation|10.1109/IPDPS.2003.1213433|30|1|J. Pang and W. Fokkink and Rutger F. H. Hofman and R. Veldema|c5250fa58feb8b2ca600185cab6cce797177ba2f\n1996|A correctness proof of a cache coherence protocol|10.1109/CMPASS.1996.507881|11|1|A. Felty and F. Stomp|e54b8645f4af7f923872e958cf3267f160576b55\n2017|Logical relations for coherence of effect subtyping|10.23638/LMCS-14(1:11)2018|10|0|Dariusz Biernacki and Piotr Polesiuk|3b073bb3a07cc91739492acdd13c9263f84adfd7\n2015|RC3: Consistency Directed Cache Coherence for x86-64 with RC Extensions|10.1109/PACT.2015.37|9|2|M. Elver and V. Nagarajan|36d51b7e6965e92ff53bd104bb4c10628890f656\n2006|Exploring Remote Object Coherence in XMLWeb Services|10.1109/ICWS.2006.61|8|0|R. Engelen and M. Govindaraju and Wei Zhang|cc772bbcd107219851224e64285b4ad147298394\n1990|Cache coherence requirements for interprocess rendezvous|10.1007/BF01407863|4|0|R. Clapp and T. Mudge and D. C. Winsor|9b16a0421e02dac3e1084912e9e9a82b744db92a\n2019|A Simple Algorithm for Hard Exudate Detection in Diabetic Retinopathy Using Spectral-Domain Optical Coherence Tomography|10.1007/978-3-030-22514-8_15|2|0|Maciej Szymkowski and Emil Saeed and K. Saeed and Z. Mariak|c7c4af747d3a32fe15f7c35ff5ad6930de41ee95" }, "coherent-parallel-c": { "title": "Coherent Parallel C", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/374fe7e3353bbd4cdc7c286945d2820a0049bb73" ], "country": [ "United States" ], "originCommunity": [ "California Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1391", "centralPackageRepositoryCount": 0, "isbndb": "" }, "coi-protocol": { "title": "coi-protocol", "appeared": 2019, "type": "protocol", "website": "https://www.coi-dev.org/", "domainName": { "registered": 2019, "name": "coi-dev.org" } }, "cokescript": { "title": "CokeScript", "appeared": 2015, "type": "pl", "creators": [ "Batiste Bieler" ], "website": "https://batiste.github.io/CokeScript/", "country": [ "Switzerland" ], "originCommunity": [ "https://batiste.github.io/" ], "githubRepo": { "stars": 41, "forks": 5, "subscribers": 4, "created": 2015, "updated": 2022, "description": "CokeScript is a whitespace sensitive language that compile to JavaScript", "url": "https://github.com/batiste/CokeScript" }, "repoStats": { "firstCommit": 2015, "commits": 117, "committers": 5, "files": 28 } }, "col": { "title": "COL", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c50f9565885013f2f15f94ac240af94479ff4558" ], "country": [ "France" ], "originCommunity": [ "I.N.R.I.A" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3539", "wordRank": 7706, "centralPackageRepositoryCount": 0 }, "colascript": { "title": "ColaScript", "appeared": 2012, "type": "pl", "creators": [ "Dan Onoshko" ], "website": "https://github.com/TrigenSoftware/ColaScript/wiki/A-Tour-of-the-ColaScript", "country": [ "Georgia" ], "originCommunity": [ "TrigenSoftware" ], "compilesTo": [ "javascript" ], "writtenIn": [ "javascript" ], "githubRepo": { "stars": 27, "forks": 1200, "subscribers": 10, "created": 2012, "updated": 2015, "description": "ColaScript is the language that compiles into JavaScript. This language is similar to Dart, CoffeeScript, Python, Go and PHP, with some original ideas. Compiler based on UglifyJS2. You can try ColaScript here (stable) or here (dev). Learn more about ColaScript.", "url": "https://github.com/TrigenSoftware/ColaScript" }, "repoStats": { "firstCommit": 2012, "commits": 671, "committers": 43, "files": 48 } }, "colasl": { "title": "COLASL", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/707261f2899b9b7f8ea6f5d5dd4a97fe94e5d260" ], "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "hopl": "https://hopl.info/showlanguage.prx?exp=386", "centralPackageRepositoryCount": 0 }, "cold-k": { "title": "COLD-K", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7d4fe02193296c28a8790b70beb99abfae094025" ], "country": [ "The Netherlands" ], "originCommunity": [ "Philips Research Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1467", "centralPackageRepositoryCount": 0 }, "coldfusion-components": { "title": "ColdFusion Components", "appeared": 1995, "type": "xmlFormat", "reference": [ "https://helpx.adobe.com/coldfusion/developing-applications/building-blocks-of-coldfusion-applications/building-and-using-coldfusion-components.html", "https://helpx.adobe.com/coldfusion/developing-applications/building-blocks-of-coldfusion-applications/building-and-using-coldfusion-components/cfc-variables-and-scope.html" ], "country": [ "United States" ], "originCommunity": [ "Adobe" ], "related": [ "cfml", "coldfusion" ], "example": [ " \n \n \n \nSELECT * FROM Employee \n \n \n \n \n \nSELECT Firstname, Lastname, Salary, Contract \nFROM Employee \n \n \n \n \n \nSELECT FirstName || ' ' || LastName AS FullName \nFROM Employee \n \n \n \n \n \nSELECT Dept_ID, FirstName || ' ' || LastName \nAS FullName \nFROM Employee \nORDER BY Dept_ID \n \n \n \n \n \nSELECT * FROM Employee \nWHERE Emp_ID = #URL.Emp_ID# \n \n \n \n \n \nDELETE FROM Employee \nWHERE Emp_ID = #Form.Emp_ID# \n \n \n \n \n \nSELECT DISTINCT Location \nFROM Departmt \n \n \n" ], "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "cfc" ], "id": "Coldfusion CFC" } }, "coldfusion": { "title": "ColdFusion", "appeared": 1995, "type": "pl", "creators": [ "Joseph J. Allaire" ], "website": "https://www.adobe.com/products/coldfusion", "documentation": [ "https://cfdocs.org/" ], "originCommunity": [ "Adobe" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "cfoutput" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "http://path/to/components/Component.cfc?method=search&query=your+query&mode=strict" ], "related": [ "java", "html", "cfml", "asp", "java-server-pages", "php", "javascript", "cfscript", "soap", "pdf", "smtp", "ftp", "xml", "xpath", "solaris", "excel-app", "linux", "ecmascript", "eclipse-editor", "wsdl", "json", "jython", "groovy", "jruby" ], "summary": "Adobe ColdFusion is a commercial rapid web application development platform created by J. J. Allaire in 1995. (The programming language used with that platform is also commonly called ColdFusion, though is more accurately known as CFML.) ColdFusion was originally designed to make it easier to connect simple HTML pages to a database. By version 2 (1996), it became a full platform that included an IDE in addition to a full scripting language.", "pageId": 374636, "dailyPageViews": 85, "created": 2012, "backlinksCount": 386, "revisionCount": 1, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/ColdFusion" }, "githubLanguage": { "fileExtensions": [ "cfm", "cfml" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "coldfusion", "tmScope": "text.html.cfm", "aliases": [ "cfm", "cfml", "coldfusion html" ], "repos": 20756, "id": "ColdFusion" }, "githubBigQuery": { "repos": 2061, "users": 1476, "id": "ColdFusion" }, "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "cfm", "cfml" ], "id": "Coldfusion HTML" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2017, "committerCount": 15, "commitCount": 584, "sampleCount": 1, "example": [ "\n --->\n\n--->\n\n\n\nDate Functions\n\n\n\n\n #RightNow#
\n #DateFormat(RightNow)#
\n #DateFormat(RightNow,\"mm/dd/yy\")#
\n #TimeFormat(RightNow)#
\n #TimeFormat(RightNow,\"hh:mm tt\")#
\n #IsDate(RightNow)#
\n #IsDate(\"January 31, 2007\")#
\n #IsDate(\"foo\")#
\n #DaysInMonth(RightNow)#\n\n\n\n\n\n #x#\n #y#\n #z#\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n ---> comment --->" ], "url": "https://github.com/SublimeText/ColdFusion" }, "projectEuler": { "memberCount": { "2019": 9, "2022": 10 }, "id": "ColdFusion" }, "helloWorldCollection": [ "\n\n\n #message#\n" ], "leachim6": { "filepath": "c/ColdFusion.cfm", "fileExtensions": [ "cfm" ], "example": [ "\n #message#\n" ], "id": "ColdFusion" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ColdFusion", "meetup": { "memberCount": 7310, "groupCount": 22, "url": "https://www.meetup.com/topics/coldfusion" }, "packageRepository": [ "https://www.forgebox.io/" ], "twitter": "https://twitter.com/coldfusion", "fileType": "text", "isOpenSource": false, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming ColdFusion|2001|Rob Brooks-Bilson|559987|3.86|7|0\nProgramming Coldfusion MX|2003|Rob Brooks-Bilson|559982|3.78|18|0\nObject-Oriented Programming in Coldfusion|2010|Matt Gifford|14947964|3.92|12|4\nColdfusion 8 Developer Tutorial|2008|John Farrar|6550757|4.00|5|0\nMacromedia Coldfusion Mx7 Certified Developer Study Guide|2001|Ben Forta|559981|3.56|27|2\nJava for Coldfusion Developers|2003|Eben Hewitt|2233112|3.00|3|0\nColdFusion MX for Dummies|2002|John Paul Ashenfelter|614391|4.25|4|0\nColdfusion 4.5 for Dummies [With CDROM]|2000|Alexis D. Gutzman|1731069|3.00|1|0\nColdfusion 9 Developer Tutorial|2010|John Farrar|14182329|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2010|Adobe Press|Adobe ColdFusion 9 Web Application Construction Kit: v. 1: Getting Started|Forta, Ben Forta|9780321660343\n2001|O'Reilly Media|Programming ColdFusion|Brooks-Bilson, Rob|9781565926981\n2010|Adobe Press|Adobe ColdFusion 9 Web Application Construction Kit, Volume 2: Application Development|Forta, Ben|9780321679192\n2002|Macromedia Press|ColdFusion MX Web Application Construction Kit (5th Edition)|Forta, Ben and Weiss, Nate and Chalnick, Leon and Buraglia, Angela C.|9780321125163\n2010|Packt Publishing|Object-Oriented Programming in ColdFusion|Gifford, Matt|9781847196323\n2004|Career Education|Programming The Web With Coldfusion Mx 6.1 Using Xhtml (web Developer Series)|Lakshmi Prayaga and Hamsa Suri|9780072890327\n2001|Pearson Education|ColdFusion 5 Language Reference|Ben Forta|9780789726988\n2010|Packt Publishing|ColdFusion 9 Developer Tutorial|Farrar, John|9781849690249\n2013|Adobe Press|Adobe ColdFusion 10 Web Application Construction Kit: ColdFusion 10 Enhancements and Improvements|Ben Forta and Charlie Arehart and Raymond Camden and Ken Fricklas and Hemanth Khandelwal and Chandan Kumar and Rob Brooks-Bilson|9780321890962\n2010|Packt Publishing|ColdFusion 9 Developer Tutorial|Farrar, John|9781849690256\n2013|Adobe Press|Adobe ColdFusion Web Application Construction Kit: ColdFusion 10 Enhancements and Improvements|Forta, Ben and Charlie Arehart and Raymond Camden and Ken Fricklas and Hemanth Khandelwal and Chandan Kumar and Rob Brooks-Bilson|9780133352511\n2003|O'Reilly Media|Programming ColdFusion MX, 2nd Edition|Rob Brooks-Bilson|9780596003807\n2002|Prentice Hall Ptr|Java for ColdFusion Developers|Hewitt, Eben|9780130461803\n1998|Que Pub|The Coldfusion 4.0 Web Application Construction Kit|Forta, Ben and Weiss, Nate|9780789718099\n2002|Syngress|Hack Proofing ColdFusion|Steve Casco and Rob Rusher and Greg Meyer and Sarge and David Vaccaro and David An|9781928994770\n2002|McGraw-Hill/OsborneMedia|ColdFusion 5: A Beginner's Guide (Beginner's Guides (Osborne))||9780072191097\n20121206|Springer Nature|Essential ColdFusion fast|Matthew Norman|9781447103332\n20030813|O'Reilly Media, Inc.|Programming ColdFusion MX|Rob Brooks-Bilson|9780596516987\n2011|Apress|Adobe Coldfusion Anthology|Michael Dinowitz and Judith Dinowitz|9781430269533\n2002|Macromedia Press|Macromedia ColdFusion 5: training from the source|Schmidt, Kevin J. (kevin James)|9780201758474\n20030813|O'Reilly Media, Inc.|Programming ColdFusion MX|Rob Brooks-Bilson|9781491909485\n2001|Osborne/mcgraw-hill|Optimizing Coldfusion 5|Chris Cortes|9780072193046\n20101228|Springer Nature|Adobe ColdFusion Anthology|Michael Dinowitz; Judith Dinowitz|9781430272144\n2002|New Riders|Dynamic Publishing with ColdFusion MX|Benjamin Elmore|9780735713123\n20101013|Packt Publishing|Object-Oriented Programming in ColdFusion|Matt Gifford|9781847196330\n2006|Equity Press|Macromedia Coldfusion MX 7 Interview Que|Terry Sanchez-Clark and Itcookbook|9781933804538\n2003|Mcgraw-hill Custom Publishing|Programming The Web With Coldfusion Mx Using Xhtml|Hamsa Suri Lakshmi Prayaga|9780072943924", "semanticScholar": "" }, "collada": { "title": "COLLADA", "appeared": 2004, "type": "application", "country": [ "United States and Japan" ], "originCommunity": [ "Sony Computer Entertainment", "Khronos Group" ], "wikipedia": { "related": [ "xml", "delphi", "kml", "godot-game-engine", "unity-engine", "maple", "python", "objective-c", "javascript", "webgl", "vrml" ], "summary": "COLLADA (COLLAborative Design Activity) is an interchange file format for interactive 3D applications. It is managed by the nonprofit technology consortium, the Khronos Group, and has been adopted by ISO as a publicly available specification, ISO/PAS 17506.COLLADA defines an open standard XML schema for exchanging digital assets among various graphics software applications that might otherwise store their assets in incompatible file formats. COLLADA documents that describe digital assets are XML files, usually identified with a .dae (digital asset exchange) filename extension.", "pageId": 1464418, "created": 2005, "backlinksCount": 115, "revisionCount": 408, "dailyPageViews": 152, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/COLLADA" }, "githubLanguage": { "fileExtensions": [ "dae" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "xml", "codemirrorMode": "xml", "codemirrorMimeType": "text/xml", "tmScope": "text.xml", "id": "COLLADA" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 12, "commitCount": 97, "url": "https://github.com/textmate/xml.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "color-basic": { "title": "Color BASIC", "appeared": 1980, "type": "pl", "creators": [ "Bill Gates" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "example": [ "FOR {num} = {number} TO {number} [STEP {number}]\n...\nNEXT (num)" ], "related": [ "trs-80-color-computer", "microsoft-basic", "basic", "c", "assembly-language", "ascii" ], "summary": "Color BASIC is the implementation of Microsoft BASIC that is included in the ROM of the Tandy/Radio Shack TRS-80 Color Computers manufactured between 1980 and 1991. BASIC (Beginners All-purpose Symbolic Instruction Code) is a high level language with simple syntax that makes it easy for novices to write simple programs. Color BASIC is interpreted, that is, decoded as it is run. Because of this, it is simple to edit and debug but performance is significantly lower than a compiled language such as C or assembly language.", "created": 2005, "backlinksCount": 92, "pageId": 3251996, "revisionCount": 69, "dailyPageViews": 13, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Color_BASIC" }, "centralPackageRepositoryCount": 0 }, "colorforth": { "title": "ColorForth", "appeared": 1992, "type": "pl", "creators": [ "Charles H. Moore" ], "description": "In Forth, a new word is defined by a preceding colon, words inside a definition are compiled, outside are executed. In colorForth a new word is red, green words are compiled, yellow executed. This use of color further reduces the syntax, or punctuation, needed. It also makes explicit how the computer will interpret each word.", "website": "https://colorforth.github.io/cf.htm", "country": [ "United States" ], "originCommunity": [ "https://github.com/colorforth" ], "wikipedia": { "summary": "colorForth is a programming language from the Forth language's original designer, Charles H. Moore, developed in the 1990s. There was an earlier predecessor called 386 OK which appeared for sale at Silicon Valley Forth Interest Group (SVFIG) meetings in 1992.An idiosyncratic programming environment, the colors simplify Forth's semantics, speed compiling, and are said to aid Moore's own poor eyesight: colorForth uses different colors in its source code (replacing some of the punctuation in standard Forth) to determine how different words are treated. colorForth was originally developed as the scripting language for Moore's own homebrew VLSI CAD program OKAD, with which he develops custom Forth processors. As the language gained utility, he rewrote his CAD program in it, spruced up the environment, and released it to the public. It has since gained a small following, spurred much debate in the Forth community, and sprung offshoots for other processors and operating environments. The language's roots are closer to the Forth machine languages Moore develops for his processors than to the mainstream standardized Forths in more widespread use. The language comes with its own tiny (63K) operating system. Practically everything is stored as source code and compiled as and when needed. The current colorForth environment is limited to running on Pentium grade PCs with limited support for lowest-common-denominator motherboards, AGP video, disk, and network hardware. Coloring in colorForth has semantic meaning. Red words start a definition and green words are compiled into the current definition. Thus, colorForth would be rendered in standard Forth as: : color forth ; Moore developed Forth in the early 1970s and created a series of implementations of the language. In the 1980s he diverged from (or rather ignored) the standardization of the language, instead continuing to evolve it. He developed a series of Forth-like languages, each fairly extreme in its simplicity: Machine Forth, OK, colorForth. There is some controversy about colorForth marginalizing color blind programmers, but Moore has stated that color is only one option for displaying the language. One of Moore's papers on colorForth was printed in black and white, but used italics and other typographical conventions to present source code.", "backlinksCount": 7, "pageId": 436740, "dailyPageViews": 13, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/ColorForth" }, "isbndb": "" }, "comal": { "title": "COMAL", "appeared": 1973, "type": "pl", "creators": [ "Børge R. Christensen", "Benedict Løfstedt" ], "country": [ "Denmark" ], "originCommunity": [ "A school in Denmark" ], "wikipedia": { "example": [ "10 PAGE\n20 FOR number:= 1 TO 10 DO\n30 PRINT \"HELLO, WORLD!\"\n40 NEXT or ENDFOR (Unicomal)\n50 END \" \"" ], "related": [ "basic", "pascal", "logo", "isbn", "bbc-basic", "unix", "doi", "action" ], "summary": "COMAL (Common Algorithmic Language) is a computer programming language developed in Denmark by Benedict Løfstedt and Børge R. Christensen in 1973. COMAL was one of the few structured programming languages that was available for and comfortably usable on 8-bit home computers. The \"COMAL Kernel Syntax & Semantics\" contains the formal definition of the language. Further extensions common to many implementations are described in .", "pageId": 197700, "dailyPageViews": 23, "created": 2003, "backlinksCount": 33, "revisionCount": 111, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/COMAL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Comal", "tiobe": { "id": "COMAL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=605", "fileType": "text", "centralPackageRepositoryCount": 0 }, "combined-log-format": { "title": "Combined Log Format", "appeared": 2002, "type": "textDataFormat", "description": "Common Log Format plus referrer and user agent columns.", "reference": [ "https://documentation.softwareag.com/webmethods/microservices_container/msc10-11/10-11_MSC_PIE_webhelp/index.html#page/integration-server-integrated-webhelp/to-http_log_4.html", "http://justsolve.archiveteam.org/wiki/Combined_Log_Format" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana–Champaign" ], "forkOf": [ "common-log-format" ], "example": [ "0:0:0:0:0:0:0:1 - Administrator [17/Sep/2021:13:51:27 -0400] \"GET /invoke/pub.flow/getTransportInfo\" 200 2502 https://mycompany.com/test/webapp \"Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/93.0.4577.63 Safari/537.36\"" ] }, "comby": { "title": "comby", "appeared": 2019, "type": "grammarLanguage", "creators": [ "Rijnard van Tonder" ], "website": "https://comby.dev/", "country": [ "United States" ], "originCommunity": [ "https://github.com/comby-tools" ], "domainName": { "registered": 2019, "awisRank": { "2022": 2618356 }, "name": "comby.dev" }, "example": [ "if (:[_] && :[height] :[_])" ], "githubRepo": { "firstCommit": 2019, "stars": 1750, "forks": 46, "subscribers": 22, "created": 2019, "updated": 2022, "description": "A tool for structural code search and replace that supports ~every language.", "issues": 55, "url": "https://github.com/comby-tools/comby" }, "repoStats": { "firstCommit": 2019, "commits": 630, "committers": 14, "files": 345 }, "twitter": "https://twitter.com/rvtond" }, "comfy": { "title": "COMFY", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f2bbc26d34d2093ca0e6b9a9024573c95a8d7768" ], "country": [ "United States" ], "originCommunity": [ "http://home.pipeline.com/ ̃hbaker1/home.html" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4059", "centralPackageRepositoryCount": 0, "isbndb": "" }, "comit": { "title": "COMIT", "appeared": 1957, "type": "pl", "creators": [ "Victor Yngve" ], "country": [ "United States" ], "originCommunity": [ "University of Chicago", "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "snobol", "perl" ], "summary": "COMIT was the first string processing language (compare SNOBOL, TRAC, and Perl), developed on the IBM 700/7000 series computers by Dr. Victor Yngve and collaborators at MIT from 1957 to 1965. Yngve created the language for supporting computerized research in the field of linguistics, and more specifically, the area of machine translation for natural language processing. The creation of COMIT led to the creation of SNOBOL.", "pageId": 1012894, "created": 2004, "backlinksCount": 18, "revisionCount": 52, "dailyPageViews": 16, "appeared": 1957, "url": "https://en.wikipedia.org/wiki/COMIT" }, "hopl": "https://hopl.info/showlanguage.prx?exp=19", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nComit Programmers Reference Manual||Comit|20504959|0.0|0|0\nComputer Programming With Comit Ii|1972|Victor H. Yngve|4310573|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1972|The Mit Press|Computer Programming With Comit Ii|Victor H. Yngve|9780262740074" }, "comm": { "title": "comm", "appeared": 2013, "type": "plzoo", "description": "A procedural language with integer arithmetic, local variables, conditional statements, while loops and print, compiled to simple machine code.", "website": "http://plzoo.andrej.com/language/comm.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "wordRank": 7673, "centralPackageRepositoryCount": 0 }, "commen": { "title": "COMMEN", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7f5200d593e5c162613ea3663f559ad2f5e244b3", "https://dl.acm.org/doi/pdf/10.1145/1465482.1465590" ], "country": [ "United States" ], "originCommunity": [ "Leo J. Cohen Associates" ], "hopl": "https://hopl.info/showlanguage.prx?exp=281", "centralPackageRepositoryCount": 0, "isbndb": "" }, "commodore-basic": { "title": "Commodore BASIC", "appeared": 1977, "type": "pl", "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "basic", "microsoft-basic", "applesoft-basic", "simons-basic", "graphics-basic" ], "summary": "Commodore BASIC, also known as PET BASIC, is the dialect of the BASIC programming language used in Commodore International's 8-bit home computer line, stretching from the PET of 1977 to the C128 of 1985. The core was based on 6502 Microsoft BASIC, and as such it shares many characteristics with other 6502 BASICs of the time, such as Applesoft BASIC. Commodore licensed BASIC from Microsoft on a \"pay once, no royalties\" basis after Jack Tramiel turned down Bill Gates' offer of a $3 per unit fee, stating, \"I'm already married,\" and would pay no more than $25,000 for a perpetual license.", "created": 2003, "backlinksCount": 164, "pageId": 318597, "revisionCount": 337, "dailyPageViews": 160, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Commodore_BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "common-lisp": { "title": "Common Lisp", "appeared": 1984, "type": "pl", "creators": [ "Scott Fahlman", "Richard P. Gabriel", "David A. Moon", "Kent Pitman", "Guy Steele", "Dan Weinreb" ], "website": "http://common-lisp.net/", "documentation": [ "https://common-lisp.net/documentation" ], "aka": [ "commonlisp" ], "fileExtensions": [ "lisp", "lsp", "l", "cl", "fasl" ], "country": [ "United States" ], "originCommunity": [ "American National Standards Institute" ], "domainName": { "registered": 2003, "awisRank": { "2017": 413857, "2022": 1041452 }, "name": "common-lisp.net" }, "visualParadigm": false, "isLisp": { "example": "", "value": true }, "hasSingleDispatch": { "example": "; https://eli.thegreenplace.net/2016/a-polyglots-guide-to-multiple-dispatch-part-3/\n(defclass Person () ())\n(defmethod frobnicate ((p Person) record spreadsheet)\n (format t \"~a ~a ~a~&\" (type-of p) (type-of record) (type-of spreadsheet)))\n(defclass Asteroid () ())\n(defmethod frobnicate ((a Asteroid) velocity size)\n ; do stuff\n )\n; At runtime these 2 would be routed to respective methods:\n(frobnicate a-person his-record big-spreadsheet)\n(frobnicate an-asteroid very-fast pretty-small)", "value": true }, "hasMultipleDispatch": { "example": " (defmethod collide-with ((x asteroid) (y asteroid))\n ;; deal with asteroid hitting asteroid\n )\n(defmethod collide-with ((x asteroid) (y spaceship))\n ;; deal with asteroid hitting spaceship\n )\n(defmethod collide-with ((x spaceship) (y asteroid))\n ;; deal with spaceship hitting asteroid\n )\n(defmethod collide-with ((x spaceship) (y spaceship))\n ;; deal with spaceship hitting spaceship\n )", "value": true }, "hasComments": { "example": "", "value": true }, "hasDirectives": { "example": "", "value": true }, "hasMultipleInheritance": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "PRINT" ] ], "wikipedia": { "example": [ "CL-USER > (available-shells)\n(#P\"/bin/bash\" #P\"/bin/csh\" #P\"/bin/ksh\" #P\"/bin/sh\" #P\"/bin/tcsh\" #P\"/bin/zsh\")" ], "related": [ "lisp", "clisp", "lispworks", "lisp-machine-lisp", "scheme", "interlisp", "clojure", "dylan", "emacs-lisp", "eulisp", "islisp", "julia", "r", "cadence-skill", "spice-lisp", "s-expressions", "ascii", "unicode", "c", "pascal", "java", "autolisp", "algol-68", "ada", "perl", "unix", "freebsd", "linux", "solaris", "x86-isa", "corman-common-lisp", "maxima", "acl2", "poplog", "pop-11", "prolog", "standard-ml", "emacs-editor" ], "summary": "Common Lisp (CL) is a dialect of the Lisp programming language, published in ANSI standard document ANSI INCITS 226-1994 (R2004) (formerly X3.226-1994 (R1999)). The Common Lisp HyperSpec, a hyperlinked HTML version, has been derived from the ANSI Common Lisp standard. The Common Lisp language was developed as a standardized and improved successor of Maclisp. By the early 1980s several groups were already at work on diverse successors to MacLisp: Lisp Machine Lisp (aka ZetaLisp), Spice Lisp, NIL and S-1 Lisp. Common Lisp sought to unify, standardise, and extend the features of these MacLisp dialects. Common Lisp is not an implementation, but rather a language specification. Several implementations of the Common Lisp standard are available, including free and open-source software and proprietary products. Common Lisp is a general-purpose, multi-paradigm programming language. It supports a combination of procedural, functional, and object-oriented programming paradigms. As a dynamic programming language, it facilitates evolutionary and incremental software development, with iterative compilation into efficient run-time programs. This incremental development is often done interactively without interrupting the running application. It also supports optional type annotation and casting, which can be added as necessary at the later profiling and optimization stages, to permit the compiler to generate more efficient code. For instance, fixnum can hold an unboxed integer in a range supported by the hardware and implementation, permitting more efficient arithmetic than on big integers or arbitrary precision types. Similarly, the compiler can be told on a per-module or per-function basis which type safety level is wanted, using optimize declarations. Common Lisp includes CLOS, an object system that supports multimethods and method combinations. It is often implemented with a Metaobject Protocol. Common Lisp is extensible through standard features such as Lisp macros (code transformations) and reader macros (input parsers for characters). Common Lisp provides some backwards compatibility to Maclisp and to John McCarthy's original Lisp. This allows older Lisp software to be ported to Common Lisp.", "pageId": 6068, "dailyPageViews": 334, "created": 2001, "backlinksCount": 866, "revisionCount": 1099, "appeared": 1984, "fileExtensions": [ "lisp", "lsp", "l", "cl", "fasl" ], "url": "https://en.wikipedia.org/wiki/Common_Lisp" }, "githubLanguage": { "fileExtensions": [ "lisp", "asd", "cl", "l", "lsp", "ny", "podsl", "sexp" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\natlas-engineer next https://github.com/atlas-engineer.png https://github.com/atlas-engineer/next \"Common Lisp\" #3fb68b 3553 151 401 \"Next browser - Be productive.\"\nnorvig paip-lisp https://github.com/norvig.png https://github.com/norvig/paip-lisp \"Common Lisp\" #3fb68b 4207 428 62 \"Lisp code for the textbook \"\"Paradigms of Artificial Intelligence Programming\"\"\"\ndimitri pgloader https://github.com/dimitri.png https://github.com/dimitri/pgloader \"Common Lisp\" #3fb68b 2221 289 56 \"Migrate to PostgreSQL in a single command!\"", "trendingProjectsCount": 4, "type": "programming", "interpreters": [ "lisp", "sbcl", "ccl", "clisp", "ecl" ], "aceMode": "lisp", "codemirrorMode": "commonlisp", "codemirrorMimeType": "text/x-common-lisp", "tmScope": "source.lisp", "aliases": [ "lisp" ], "repos": 24262, "id": "Common Lisp" }, "githubBigQuery": { "repos": 5678, "users": 3752, "id": "Common Lisp" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "cl", "lisp" ], "id": "Common Lisp" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 6, "commitCount": 40, "sampleCount": 9, "example": [ "(DEFUN HELLO ()\n (PRINT 'HELLO))\n" ], "url": "https://github.com/textmate/lisp.tmbundle" }, "leachim6": { "filepath": "c/Common Lisp.lisp", "example": [ "(defun hello-world ()\n (format t \"Hello World~%\"))\n\n(hello-world)\n" ], "id": "Common Lisp" }, "quineRelay": "Common Lisp", "rijuRepl": { "example": [ "(format t \"Hello, world!\")\n" ], "description": "Modern, multi-paradigm, high-performance, compiled, ANSI-standardized, most prominent (along with Scheme) descendant of the Lisp family", "fileExtensions": [ "lisp", "lsp", "l", "cl", "fasl" ], "website": "https://common-lisp.net/", "gitRepo": "https://sourceforge.net/p/sbcl/sbcl/ci/master/tree/", "id": "https://riju.codes/commonlisp" }, "indeedJobs": { "2017": 24, "query": "\"common lisp\"" }, "officialBlogUrl": [ "https://common-lisp.net/news" ], "faqPageUrl": [ "https://common-lisp.net/faq" ], "downloadPageUrl": [ "https://common-lisp.net/downloads" ], "tiobe": { "id": "Common Lisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=946", "ubuntuPackage": "clisp", "jupyterKernel": [ "https://github.com/fredokun/cl-jupyter" ], "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nParadigms of Artificial Intelligence Programming: Case Studies in Common LISP|1991|Peter Norvig|80981|4.33|439|9\nProgramming In Common Lisp|1985|Rodney A. Brooks|1178516|4.00|1|0\nCommon LISP: Common LISP Implementations, Common LISP Publications, Common LISP Software, Cyc, Maxima, Kyoto Common LISP, Acl2, Genera, ACT-R||Source Wikipedia|55083353|0.0|0|0\nA Programmer's Guide To Common Lisp|1987|Deborough G. Tatar|1732767|0.0|0|0\nCommon Lisp Programming|2012|Steve Howard|27090533|3.25|4|0\nObject-Oriented Programming in Common LISP: A Programmer's Guide to Clos|1989|Sonya E. Keene|1163506|4.02|48|4", "isbndb": "", "semanticScholar": "" }, "common-log-format": { "title": "Common Log Format", "appeared": 1995, "type": "textDataFormat", "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana–Champaign" ], "example": [ "127.0.0.1 user-identifier frank [10/Oct/2000:13:55:36 -0700] \"GET /apache_pb.gif HTTP/1.0\" 200 2326" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Common_Log_Format" } }, "common-workflow-language": { "title": "CWL", "appeared": 2014, "type": "pl", "creators": [ "Luka Stojanovic" ], "description": "The Common Workflow Language (CWL) is a specification for describing analysis workflows and tools in a way that makes them portable and scalable across a variety of software and hardware environments, from workstations to cluster, cloud, and high performance computing (HPC) environments. CWL is designed to meet the needs of data-intensive science, such as Bioinformatics, Medical Imaging, Astronomy, Physics, and Chemistry.", "website": "https://www.commonwl.org/", "reference": [ "https://doi.org/10.6084/m9.figshare.3115156.v2" ], "country": [ "Various" ], "originCommunity": [ "https://w3id.org/cwl/meeting_minutes" ], "domainName": { "registered": 2015, "awisRank": { "2022": 1200759 }, "name": "commonwl.org" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "githubRepo": { "firstCommit": 2014, "stars": 284, "forks": 193, "subscribers": 48, "created": 2015, "updated": 2022, "description": "Common Workflow Language reference implementation", "issues": 396, "url": "https://github.com/common-workflow-language/cwltool" }, "repoStats": { "firstCommit": 2014, "commits": 4865, "committers": 152, "files": 967 }, "githubLanguage": { "fileExtensions": [ "cwl" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "cwl-runner" ], "aceMode": "yaml", "codemirrorMode": "yaml", "codemirrorMimeType": "text/x-yaml", "tmScope": "source.cwl", "aliases": [ "cwl" ], "repos": 464, "id": "Common Workflow Language" }, "githubBigQuery": { "repos": 75, "users": 57, "id": "Common Workflow Language" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2018, "committerCount": 5, "commitCount": 41, "sampleCount": 1, "example": [ "#!/usr/bin/env cwl-runner\n# Originally from\n# https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/utils/trunk-peak-score.cwl\n# Released under the MIT License:\n# https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/LICENSE\n# Converted to CWL v1.0 syntax using\n# https://github.com/common-workflow-language/cwl-upgrader\n# and polished by Michael R. Crusoe \n# All modifications also released under the MIT License\ncwlVersion: v1.0\nclass: CommandLineTool\ndoc: Trunk scores in ENCODE bed6+4 files\n\nhints:\n DockerRequirement:\n dockerPull: dukegcb/workflow-utils\n\ninputs:\n peaks:\n type: File\n sep:\n type: string\n default: \\t\n\noutputs:\n trunked_scores_peaks:\n type: stdout\n\nbaseCommand: awk\n\narguments:\n- -F $(inputs.sep)\n- BEGIN{OFS=FS}$5>1000{$5=1000}{print}\n- $(inputs.peaks.path)\n\nstdout: $(inputs.peaks.nameroot).trunked_scores$(inputs.peaks.nameext)\n" ], "url": "https://github.com/manabuishii/language-cwl" }, "twitter": "https://twitter.com/commonwl", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "commonloops": { "title": "CommonLoops", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/529224b910e0f9e658c3e5d8421694db487b1ed5" ], "country": [ "United States" ], "originCommunity": [ "Hewlett-Packard" ], "wikipedia": { "related": [ "common-lisp", "java", "clos" ], "summary": "CommonLoops (the Common Lisp Object-Oriented Programming System; an acronym reminiscent of the earlier Lisp OO system \"Loops\" for the Interlisp-D system) is an early programming language which extended Common Lisp to include Object-oriented programming functionality and is a dynamic object system which differs from the OOP facilities found in static languages such as C++ or Java. Like New Flavors, CommonLoops supported multiple inheritance, generic functions and method combination. CommonLoops also supported multi-methods and made use of metaobjects. CommonLoops and New Flavors were the primary ancestors of CLOS. CommonLoops was supported by a portable implementation known as Portable CommonLoops (PCL) which ran on all Common Lisp implementations of the day.", "backlinksCount": 61, "pageId": 7720744, "dailyPageViews": 4, "created": 2006, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/CommonLoops" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1208", "centralPackageRepositoryCount": 0 }, "commonmark": { "title": "commonmark", "appeared": 2014, "type": "textMarkup", "creators": [ "John MacFarlane" ], "description": "A strongly defined, highly compatible specification of Markdown", "website": "https://commonmark.org/", "country": [ "United States" ], "originCommunity": [ "codinghorror.com", "github", "University of California,Berkeley" ], "domainName": { "registered": 2014, "awisRank": { "2022": 184319 }, "name": "commonmark.org" }, "githubRepo": { "firstCommit": 2014, "stars": 4585, "forks": 561, "subscribers": 147, "created": 2014, "updated": 2022, "description": "CommonMark spec, with reference implementations in C and JavaScript", "issues": 87, "url": "https://github.com/commonmark/commonmark-spec" }, "repoStats": { "firstCommit": 2014, "commits": 1848, "committers": 108, "files": 22 } }, "compact-application-solution-language": { "title": "Compact Application Solution Language", "appeared": 1997, "type": "pl", "reference": [ "https://groups.google.com/forum/#!search/compact-application-solution-language/alt.sys.pc-clone.gateway2000/OD4BEk8Axls/klFwJw8NXXgJ" ], "country": [ "United States" ], "originCommunity": [ "WAGWARE Systems Inc", "Brainyware LLC" ], "wikipedia": { "related": [ "pascal", "visual-basic" ], "summary": "Compact Application Solution Language (CASL) is a programming language used to create computer programs for Palm OS, and Microsoft Windows desktops, laptops, and Pocket PCs with Windows Mobile. It is published by WAGWARE Systems, Inc., and Brainyware, LLC. As a language, CASL is similar to Pascal or Visual Basic with object-oriented programming features. The CASL software development kit (SDK) includes a graphical user interface (GUI) forms editor, an integrated development environment (IDE), and a compiler. CASL programs can either be run as interpreted applications on target devices (using a small helper binary), or compiled directly to native code (CASLpro). One of CASL's key features is that the same source can be compiled to Palm OS, Windows, or Pocket PC with Windows Mobile, without changing the code, termed \"write once, run all\". In July 2005, CASLsoft announced they were discontinuing support for CASL and releasing it as freeware, with version 4.2 as the last official release. A month later, WAGWARE Systems, Inc. and Brainyware, LLC announced the purchase of CASL, updated the product and continue to release it as commercial software. CASL Version 4.3 was released on 3 July 2006. In January 2007, more libraries were released to support the Janam XP20/XP30 series of barcode devices. The CASL libraries are also backward compatible with the Symbol SPT series devices.", "created": 2005, "backlinksCount": 3, "pageId": 2283274, "revisionCount": 51, "dailyPageViews": 2, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Compact_Application_Solution_Language" }, "centralPackageRepositoryCount": 0 }, "compiler-compiler": { "title": "Compiler-Compiler", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b1f4f9e12792a745e2229eca84cfe886496bb4dd" ], "wikipedia": { "example": [ "expr_gen(ADD[expr_gen(x),expr_gen(y)]) =>\n \n releasereg(y);\n return x;\n (SUB[expr_gen(x),expr_gen(y)])=>\n \n releasereg(y);\n return x;\n (MUL[expr_gen(x),expr_gen(y)])=>\n .\n .\n .\n (x)=> r1 = getreg();\n load(r1, x);\n return r1;\n..." ], "related": [ "antlr", "basic", "algol-60", "atlas-autocode", "coco-r", "bison", "javacc", "lisp-2", "lisp", "yacc", "xpl", "peg", "doi", "isbn" ], "summary": "In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a programming language and machine. The input may be a text file containing the grammar written in BNF or EBNF that defines the syntax of a programming language, and whose generated output is some source code of the parser for the programming language, although other definitions exist. Usually, the resulting source code will have to be extended upon before a complete compiler emerges.A metacompiler is a software development tool used chiefly in the construction of compilers, translators, and interpreters for other programming languages. The input to a metacompiler is a computer program written in a specialized programming metalanguage designed chiefly for the purpose of constructing compilers. The language of the compiler produced is called the object language. The minimal input producing a compiler is a metaprogram specifying the object language grammar and semantic transformations into an object program.", "backlinksCount": 107, "pageId": 70097, "dailyPageViews": 59, "created": 2002, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/Compiler-compiler" }, "hopl": "https://hopl.info/showlanguage.prx?exp=179", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "complex-prolog": { "title": "Complex-Prolog", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0d371de6c17b2745fa9c1b793fd9e7d9231ce391" ], "country": [ "Italy" ], "originCommunity": [ "Società Italiana per l'Esercizio delle Telecomunicazioni" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5801", "centralPackageRepositoryCount": 0 }, "component-pascal": { "title": "COMPONENT PASCAL", "appeared": 1997, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "www.oberon.ch" ], "supersetOf": [ "oberon-2" ], "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "githubLanguage": { "fileExtensions": [ "cp", "cps" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "pascal", "codemirrorMode": "pascal", "codemirrorMimeType": "text/x-pascal", "tmScope": "source.pascal", "repos": 13387, "id": "Component Pascal" }, "githubBigQuery": { "repos": 132, "users": 128, "id": "Component Pascal" }, "pygmentsHighlighter": { "filename": "oberon.py", "fileExtensions": [ "cp", "cps" ], "id": "Component Pascal" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2016, "committerCount": 4, "commitCount": 37, "sampleCount": 2, "example": [ "MODULE ObxFact;\n(**\n project = \"BlackBox\"\n organization = \"www.oberon.ch\"\n contributors = \"Oberon microsystems\"\n version = \"System/Rsrc/About\"\n copyright = \"System/Rsrc/About\"\n license = \"Docu/BB-License\"\n changes = \"\"\n issues = \"\"\n\n**)\n\nIMPORT\n Stores, Models, TextModels, TextControllers, Integers;\n\nPROCEDURE Read(r: TextModels.Reader; VAR x: Integers.Integer);\n VAR i, len, beg: INTEGER; ch: CHAR; buf: POINTER TO ARRAY OF CHAR;\nBEGIN\n r.ReadChar(ch);\n WHILE ~r.eot & (ch <= \" \") DO r.ReadChar(ch) END;\n ASSERT(~r.eot & (((ch >= \"0\") & (ch <= \"9\")) OR (ch = \"-\")));\n beg := r.Pos() - 1; len := 0;\n REPEAT INC(len); r.ReadChar(ch) UNTIL r.eot OR (ch < \"0\") OR (ch > \"9\");\n NEW(buf, len + 1);\n i := 0; r.SetPos(beg);\n REPEAT r.ReadChar(buf[i]); INC(i) UNTIL i = len;\n buf[i] := 0X;\n Integers.ConvertFromString(buf^, x)\nEND Read;\n\nPROCEDURE Write(w: TextModels.Writer; x: Integers.Integer);\n VAR i: INTEGER;\nBEGIN\n IF Integers.Sign(x) < 0 THEN w.WriteChar(\"-\") END;\n i := Integers.Digits10Of(x);\n IF i # 0 THEN\n REPEAT DEC(i); w.WriteChar(Integers.ThisDigit10(x, i)) UNTIL i = 0\n ELSE w.WriteChar(\"0\")\n END\nEND Write;\n\nPROCEDURE Compute*;\n VAR beg, end, i, n: INTEGER; ch: CHAR;\n s: Stores.Operation;\n r: TextModels.Reader; w: TextModels.Writer; attr: TextModels.Attributes;\n c: TextControllers.Controller;\n x: Integers.Integer;\nBEGIN\n c := TextControllers.Focus();\n IF (c # NIL) & c.HasSelection() THEN\n c.GetSelection(beg, end);\n r := c.text.NewReader(NIL); r.SetPos(beg); r.ReadChar(ch);\n WHILE ~r.eot & (beg < end) & (ch <= \" \") DO r.ReadChar(ch); INC(beg) END;\n IF ~r.eot & (beg < end) THEN\n r.ReadPrev; Read(r, x);\n end := r.Pos(); r.ReadPrev; attr :=r.attr;\n IF (Integers.Sign(x) > 0) & (Integers.Compare(x, Integers.Long(MAX(LONGINT))) <= 0) THEN\n n := SHORT(Integers.Short(x)); i := 2; x := Integers.Long(1);\n WHILE i <= n DO x := Integers.Product(x, Integers.Long(i)); INC(i) END;\n Models.BeginScript(c.text, \"computation\", s);\n c.text.Delete(beg, end);\n w := c.text.NewWriter(NIL); w.SetPos(beg); w.SetAttr(attr);\n Write(w, x);\n Models.EndScript(c.text, s)\n END\n END\n END\nEND Compute;\n\nEND ObxFact." ], "url": "https://github.com/textmate/pascal.tmbundle" }, "projectEuler": { "memberCount": { "2022": 8 }, "id": "Component Pascal" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1209", "fileType": "text", "centralPackageRepositoryCount": 0 }, "computer-compiler": { "title": "Computer Compiler", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3721bb17e208e46c731581b0281a2af63f74e1fd" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois" ], "hopl": "https://hopl.info/showlanguage.prx?exp=389", "centralPackageRepositoryCount": 0 }, "computest": { "title": "COMPUTEST", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4505b1af681f34d91ed762a78b8d978635bd892b" ], "country": [ "United States" ], "originCommunity": [ "University of California, San Francisco" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5576", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "comskee": { "title": "COMSKEE", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/36257298def4b321665a2841c5a6e33a19cd66b1" ], "country": [ "Unknown" ], "originCommunity": [ "electronic language research Innovative information infrastructure" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3808", "centralPackageRepositoryCount": 0, "isbndb": "" }, "comsl": { "title": "COMSL", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6ec7db268d07e25991756c50be1cdbec19ca5e10" ], "country": [ "United States" ], "originCommunity": [ "Communications Satellite Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=498", "centralPackageRepositoryCount": 0 }, "comsol-script": { "title": "COMSOL Script", "appeared": 1998, "type": "pl", "website": "http://www.comsol.com", "reference": [ "https://en.wikipedia.org/wiki/COMSOL_Multiphysics" ], "country": [ "United States" ], "originCommunity": [ "COMSOL Inc" ], "domainName": { "name": "comsol.com" }, "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/COMSOL_Script" }, "centralPackageRepositoryCount": 0 }, "comtran": { "title": "COMTRAN", "appeared": 1957, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "example": [ "01001 *PROCEDURE\n \n 01002 CALL (EMPLOYEE.NUMBER) EMPLOYNO,\n 01003 (BONDEDUCTION) BONDEDUCT,\n 01004 (BONDENOMINATION) BONDENOM,\n 01005 (BONDACCUMULATION) BONDACCUM,\n 01006 (INSURANCE.PREM) INSPREM,\n 01007 (RETIREMENT.PREM) RETPREM,\n 01008 (DEPARTMENT.TOTAl) DPT.\n \n 01009 START. OPEN ALL FILES.\n \n 01010 GET.MASTER. GET MASTER, AT END DO END.OF.MASTERS.\n \n 01011 GET.DETAIL. GET DETAIL, AT END GO TO END.OF.DETAILS.\n \n 01012 COMPARE.EMPLOYEE.NUMBERS. GO TO COMPUTE.PAY WHEN DETAIL EMPLOYNO\n 01013 IS EQUAL TO MASTER EMPLOYNO, LOW.DETAIL WHEN DETAIL\n 01014 EMPLOYNO IS LESS THAN MASTER EMPLOYNO.\n \n 01015 HIGH.DETAIL. MOVE 'M' TO MASTER ERRORCODE, FILE MASTER IN\n 01016 ERROR.FILE.\n \n 01017 GET MASTER, AT END DO END.OF.MASTERS.\n \n 01018 GO TO COMPARE.EMPLOYEE.NUMBERS.\n \n 02001 LOW.DETAIL. MOVE 'D' TO DETAIL ERRORCODE, FILE DETAIL IN\n 02002 ERROR.FILE.\n \n 02003 GO TO GET.DETAIL.\n \n 02004 END.OF.MASTERS. IF DETAIL EMPLOYNO = HIGH.VALUE THEN GO TO\n 02005 END.OF.RUN OTHERWISE SET MASTER EMPLOYNO = HIGH.VALUE.\n \n 02006 END.OF.DETAILS. IF MASTEREMPLOYNO = HIGH.VALUE THEN GO TO\n 02007 END.OF.RUN OTHERWISE SET DETAIL EMPLOYNO = HIGH.VALUE, GO\n 02008 TO COMPARE.EMPLOYEE.NUMBERS.\n \n 02009 END.OF.RUN. MOVE CORRESPONDING GRAND.TOTAL TO PAYRECORD, FILE\n 02010 PAYRECORD, CLOSE ALL FILES.\n 02011 STOP 1234.\n \n 02012 COMPUTE.PAY. IF DETAIL HOURS IS GREATER THAN 40 THEN SET DETAIL\n 02013 GROSS = (DETAIL HOURS - 40) * MASTER RATE * 1.5.\n \n 02014 SET DETAIL GROSS = DETAIL GROSS + MASTER RATE * 40, DO\n 02015 FICA.ROUTINE, DO WITHHOLDING.TAX.ROUTINE.\n \n 02016 IF MASTER BONDEDUCT IS NOT EQUAL TO ZERO THEN DO\n 02017 BOND.ROUTINE.\n \n 02018 DO SEARCH FOR INDEX = 1(1)12.\n \n 02019 NET. SET PAYRECORD NETPAY = DETAIL GROSS - DETAIL FICA - DETAIL\n 02020 WHT -DETAIL RETIREMENT - DETAIL INSURANCE - DETAIL\n 02021 BONDEDUCT." ], "related": [ "flow-matic", "cobol" ], "summary": "COMTRAN (COMmercial TRANslator) is an early programming language developed at IBM. It was intended as the business programming equivalent of the scientific programming language FORTRAN (FORmula TRANslator). It served as one of the forerunners to the COBOL language. Developed by Bob Bemer, in 1957, the language was the first to feature the programming language element known as a picture clause.", "pageId": 4292196, "created": 2006, "backlinksCount": 18, "revisionCount": 35, "dailyPageViews": 547, "appeared": 1957, "url": "https://en.wikipedia.org/wiki/COMTRAN" }, "hopl": "https://hopl.info/showlanguage.prx?exp=387", "fileType": "text", "centralPackageRepositoryCount": 0 }, "cona": { "title": "CONA", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c18fee4f7e0cabf150e70ac5a747669d60fa3ffb" ], "country": [ "United Kingdom" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3797", "centralPackageRepositoryCount": 0 }, "conan-center-pm": { "title": "Conan Center", "appeared": 2016, "type": "packageManager", "website": "https://bintray.com/conan/conan-center", "country": [ "United States" ], "originCommunity": [ "JFrog Ltd" ], "packageCount": 216, "forLanguages": [ "c", "cpp" ], "twitter": "https://twitter.com/bintray" }, "conan-pm": { "title": "Conan", "appeared": 2015, "type": "packageManager", "description": "Conan, the C / C++ Package Manager for Developers", "website": "https://conan.io/", "country": [ "Spain" ], "originCommunity": [ "https://github.com/conan-io" ], "domainName": { "registered": 2015, "awisRank": { "2022": 135345 }, "name": "conan.io" }, "githubRepo": { "firstCommit": 2015, "stars": 5983, "forks": 758, "subscribers": 130, "created": 2015, "updated": 2022, "description": "Conan - The open-source C/C++ package manager", "issues": 2087, "url": "https://github.com/conan-io/conan" }, "forLanguages": [ "c", "cpp" ] }, "conc": { "title": "ConC", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/16d28ea9cb901e30df0ce0ea0a7c49cabe5cc57a" ], "country": [ "United States" ], "originCommunity": [ "University of Texas", "University of California, Berkeley" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1614", "centralPackageRepositoryCount": 0 }, "concept-script": { "title": "concept-script", "appeared": 1879, "type": "notation", "creators": [ "Gottlob Frege" ], "description": "Frege initiated an ambitious program to use a precise notation which would help in the rigorous development of mathematics. Although his efforts were almost entirely focused on the natural numbers, he discussed possible applications to geometry, analysis, mechanics, physics of motion, and philosophy. The precise notation of Frege was introduced in Concept Script (Begriffschrift) in 1879. This was a two-dimensional notation whose powers he compared to a microscope. The framework in which he set up his Concept Script was quite simple -- we live in a world of objects and concepts, and we deal with statements about these in a manner subject to the laws of logic. Thus Frege had only one model in mind, the real world. Let us refer to this as the absolute universe. From this he was going to distill the numbers and their properties. The absolute universe approach to mathematics via logic was dominant until 1930 -- we see it in the work of Whitehead and Russell (1910-1913). His formal system with two-dimensional notation had the universal quantifier, negation, implication, predicates of several variables, axioms for logic, and rules of inference. The explicit universal quantifier, predicates of several variables and the rules of inference were new to formal systems!", "reference": [ "https://www.math.uwaterloo.ca/~snburris/htdocs/scav/frege/frege.html#:~:text=Frege%20initiated%20an%20ambitious%20program,the%20rigorous%20development%20of%20mathematics.&text=His%20formal%20system%20with%20two,logic%2C%20and%20rules%20of%20inference." ] }, "conceptual": { "title": "Conceptual", "appeared": 2019, "type": "pl", "description": "The Conceptual language aims to completely separate all features and quirks of programming and bring them to the realm of concepts, bridging machines and minds. This language is not a goal in itself, but a platform for the future; understanding this future allows to put its features into their proper context.", "website": "https://github.com/Antipurity/conceptual", "aka": [ "Antipurity" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/Antipurity/conceptual" ], "example": [ "concept\n(\nmap\ntxt\t'(examples F): Returns examples of usage of a function, in `(… (CodeString BecomesString) …)` format.\n(examples): Returns all available examples in a (… (Name … (CodeString BecomesString) …) …) format.'\ncall\t(_jsEval \"function(f) {\n if (_isArray(f)) return error\n if (f === undefined) {\n // Accumulate all examples (from parse.ctx).\n const result = [map]\n parse.ctx.forEach((v,k) => {\n if (k[0] === '_') return\n const r = _getDataOverride(v, examples)\n if (r !== undefined)\n result.push(v, r)\n })\n return result\n } else\n return _checkOverride(f, examples, f)\n}\"" ], "githubRepo": { "stars": 8, "forks": 0, "subscribers": 2, "created": 2019, "updated": 2021, "description": "An experimental programming language / IDE of evil.", "url": "https://github.com/Antipurity/conceptual" }, "repoStats": { "firstCommit": 2019, "commits": 245, "committers": 2, "files": 136 } }, "concert-c": { "title": "Concert/C", "appeared": 1993, "type": "pl", "reference": [ "https://www.researchgate.net/publication/2427206_ConcertC_A_Language_for_Distributed_Programming" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1721", "centralPackageRepositoryCount": 0 }, "concise-encoding": { "title": "Concise Encoding", "appeared": 2018, "type": "dataNotation", "creators": [ "Karl Stenerud" ], "description": "Concise Encoding gives you ease and efficiency with its 1:1 compatible text and binary formats.", "website": "https://concise-encoding.org", "country": [ "Czech Republic and Germany" ], "originCommunity": [ "https://github.com/kstenerud/concise-encoding" ], "domainName": { "registered": 2019, "awisRank": { "2022": 4431517 }, "name": "concise-encoding.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "c1\n{\n \"boolean\" = true\n \"binary int\" = -0b10001011\n \"octal int\" = 0o644\n \"decimal int\" = -10000000\n \"hex int\" = 0xfffe0001\n \"very long int\" = 100000000000000000000000000000000000009\n \"decimal float\" = -14.125\n \"hex float\" = 0x5.1ec4p+20\n \"very long flt\" = 4.957234990634579394723460546348e+100000\n \"not-a-number\" = nan\n \"infinity\" = inf\n \"neg infinity\" = -inf\n}", "c1\n{\n \"string\" = \"Strings support escape sequences: \\n \\t \\+1f415.\"\n \"url\" = @\"https://example.com/\"\n \"email\" = @\"mailto:me@somewhere.com\"\n}", "c1\n{\n \"uuid\" = f1ce4567-e89b-12d3-a456-426655440000\n \"date\" = 2019-07-01\n \"time\" = 18:04:00.948/Europe/Prague\n \"timestamp\" = 2010-07-15/13:28:15.415942344\n \"null\" = null\n \"media\" = |m application/x-sh 23 21 2f 62 69 6e 2f 73 68 0a 0a\n 65 63 68 6f 20 68 65 6c 6c 6f 20 77 6f 72 6c 64 0a|\n}", "c1\n{\n \"list\" = [1 2.5 \"a string\"]\n \"map\" = {\"one\"=1 2=\"two\" \"today\"=2020-09-10}\n \"bytes\" = |u8x 01 ff de ad be ef|\n \"int16 array\" = |i16 7374 17466 -9957|\n \"uint16 hex\" = |u16x 91fe 443a 9c15|\n \"float32 array\" = |f32 1.5e10 -8.31e-12|\n}", "c1\n[\n @vehicle<\"make\" \"model\" \"drive\" \"sunroof\">\n @vehicle(\"Ford\" \"Explorer\" \"4wd\" true )\n @vehicle(\"Toyota\" \"Corolla\" \"fwd\" false )\n @vehicle(\"Honda\" \"Civic\" \"fwd\" false )\n]", "c1\n[\n {\n \"make\" = \"Ford\"\n \"model\" = \"Explorer\"\n \"drive\" = \"4wd\"\n \"sunroof\" = true\n }\n {\n \"make\" = \"Toyota\"\n \"model\" = \"Corolla\"\n \"drive\" = \"fwd\"\n \"sunroof\" = false\n }\n {\n \"make\" = \"Honda\"\n \"model\" = \"Civic\"\n \"drive\" = \"fwd\"\n \"sunroof\" = false\n }\n]", "c1\n//\n// The tree:\n//\n// 2\n// / \\\n// 5 7\n// / /|\\\n// 9 6 1 2\n// / / \\\n// 4 8 5\n//\n(2\n (7\n 2\n 1\n (6\n 5\n 8\n )\n )\n (5\n (9\n 4\n )\n )\n)", "c1\n//\n// The weighted graph:\n//\n// b\n// /|\\\n// 4 1 1\n// / | \\\n// a-3-c-4-d\n//\n{\n \"vertices\" = [\n &a:{}\n &b:{}\n &c:{}\n &d:{}\n ]\n \"edges\" = [\n @($a {\"weight\"=4 \"direction\"=\"both\"} $b)\n @($a {\"weight\"=3 \"direction\"=\"both\"} $c)\n @($b {\"weight\"=1 \"direction\"=\"both\"} $c)\n @($b {\"weight\"=1 \"direction\"=\"both\"} $d)\n @($c {\"weight\"=4 \"direction\"=\"both\"} $d)\n ]\n}", "c1\n{\n // Entire map will be referenced later as $id1\n \"marked object\" = &id1:{\n \"recursive\" = $id1\n }\n \"ref1\" = $id1\n \"ref2\" = $id1\n\n // Reference pointing to part of another document.\n \"outside ref\" = $\"https://xyz.com/document.cte#some_id\"\n}", "c1\n{\n // Custom types are user-defined, with user-supplied codecs.\n \"custom text\" = |c \"cplx(2.94+3i)\"|\n \"custom binary\" = |c 01 f6 28 3c 40 00 00 40 40|\n}" ], "githubRepo": { "firstCommit": 2018, "stars": 225, "forks": 5, "subscribers": 5, "created": 2018, "updated": 2022, "description": "The secure data format for a modern world", "issues": 23, "url": "https://github.com/kstenerud/concise-encoding" }, "repoStats": { "firstCommit": 2018, "commits": 1003, "committers": 4, "files": 19 }, "isbndb": "" }, "concordance": { "title": "concordance", "appeared": 1994, "type": "pl", "reference": [ "https://books.google.com/books?id=Z4oYATKfX38C&pg=PA132&lpg=PA132&dq=concordance+programming+language&source=bl&ots=gq9Zak0BpI&sig=ACfU3U1mnNG5pPSFrgbklse9veXigydgBw&hl=en&sa=X&ved=2ahUKEwjbv7LhiZfgAhVpl1QKHQgQB0wQ6AEwB3oECAMQAQ" ], "centralPackageRepositoryCount": 0 }, "concur": { "title": "CONCUR", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/97150dfc91fee1d7ddb51dcd7d681ca4ea554d32" ], "country": [ "United States" ], "originCommunity": [ "Oberlin College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=947", "centralPackageRepositoryCount": 0 }, "concurnas": { "title": "concurnas", "appeared": 2018, "type": "pl", "website": "http://concurnas.com/", "reference": [ "https://news.ycombinator.com/item?id=23321096" ], "country": [ "England" ], "originCommunity": [ "https://github.com/Concurnas" ], "domainName": { "registered": 2018, "name": "concurnas.com" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "System.out.println" ] ], "stringToken": [ [ "\"" ] ], "example": [ "def gcd(x int, y int){//greatest common divisor of two integers\n while(y){\n (x, y) = (y, x mod y)\n }\n x\n}\ncalc1 = gcd(8, 20)!//run this calculation in a isolate\ncalc2 = gcd(6, 45)!//run this calculation in a separate isolate\ncalc3 = calc1 if calc1 > calc2 else calc2\n//^^^ wait for the results of calc1 and calc2 before assigning calc3" ], "leachim6": { "filepath": "c/Concurnas.conc", "fileExtensions": [ "conc" ], "example": [ "System.out.println(\"Hello World\")\n" ], "id": "Concurnas" }, "twitter": "https://twitter.com/concurnas" }, "concurr": { "title": "ConCurr", "appeared": 1979, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "https://codeberg.org/Wezl/ConCurr" ], "gitRepo": "https://codeberg.org/Wezl/ConCurr" }, "concurrent-cpp": { "title": "Concurrent C++", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/016343974357eac84e053921efc0a33f2f0b2eee" ], "country": [ "United States" ], "originCommunity": [ "Bell Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1211", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "concurrent-metatem": { "title": "Concurrent METATEM", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1716556a2336d202f6ddeaafd9566004e1a7673a" ], "country": [ "United Kingdom" ], "originCommunity": [ "Manchester Metropolitan University" ], "wikipedia": { "summary": "Concurrent MetateM is a multi-agent language in which each agent is programmed using a set of (augmented) temporal logic specifications of the behaviour it should exhibit. These specifications are executed directly to generate the behaviour of the agent. As a result, there is no risk of invalidating the logic as with systems where logical specification must first be translated to a lower-level implementation. The root of the MetateM concept is Gabbay's separation theorem; any arbitrary temporal logic formula can be rewritten in a logically equivalent past → future form. Execution proceeds by a process of continually matching rules against a history, and firing those rules when antecedents are satisfied. Any instantiated future-time consequents become commitments which must subsequently be satisfied, iteratively generating a model for the formula made up of the program rules.", "backlinksCount": 12, "pageId": 19835689, "dailyPageViews": 3, "created": 2008, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Concurrent_MetateM" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5661", "centralPackageRepositoryCount": 0 }, "concurrent-ml": { "title": "Concurrent ML", "appeared": 1993, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bell Labs, Lucent Technologies" ], "hasMessagePassing": { "example": "", "value": true }, "wikipedia": { "summary": "Concurrent ML (CML) is a concurrent extension of the Standard ML programming language characterized by its ability to allow programmers to create composable communication abstractions that are first class rather than built into the language. The design of CML and its primitive operations have been adopted in several other programming languages such as GNU Guile, Racket, and Manticore.", "backlinksCount": 19, "pageId": 2037178, "dailyPageViews": 18, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Concurrent_ML" }, "isbndb": "" }, "concurrent-pascal": { "title": "Concurrent Pascal", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7c50b456ac72914cc88b7454517f00f96548e834" ], "country": [ "United States" ], "originCommunity": [ "Stony Brook University", "The University of Texas" ], "hopl": "https://hopl.info/showlanguage.prx?exp=578", "centralPackageRepositoryCount": 0 }, "concurrent-prolog": { "title": "Concurrent Prolog", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ffd05630d00bd0f03e261fa9c67d14d571835c21" ], "country": [ "Italy" ], "originCommunity": [ "crai-supermercati" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1309", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "cone": { "title": "Cone", "appeared": 2017, "type": "pl", "creators": [ "Jonathan Goodwin" ], "description": "Acorn2's passion is the 3D web and his Pegasus3D browser, and the web is powered by languages. His Cone language powers the 3D web. Cone is statically-typed, and uses LLVM to generate native efficient executables. Cone will also be a test bed for implementing gradual memory management. His previous work, Acorn is a dynamic language with some of the same features.", "website": "http://cone.jondgoodwin.com/", "country": [ "Australia and Belgium and France and Sweden and Indonesia" ], "originCommunity": [ "https://github.com/jondgoodwin/cone" ], "domainName": { "name": "cone.jondgoodwin.com" }, "githubRepo": { "stars": 430, "forks": 18, "subscribers": 25, "created": 2017, "updated": 2022, "firstCommit": 2017, "description": "Cone Programming Language", "issues": 2, "url": "https://github.com/jondgoodwin/cone" }, "repoStats": { "firstCommit": 2017, "commits": 1117, "committers": 6, "files": 161 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Second-order Cone Programming|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786131174155" }, "confluence": { "title": "Confluence", "appeared": 2004, "type": "textMarkup", "website": "https://confluence.atlassian.com/doc/confluence-wiki-markup-251003035.html", "country": [ "Australia" ], "originCommunity": [ "Atlassian" ], "rijuRepl": { "example": [ "Hello, world!\n" ], "description": "Markup format for a popular web-based corporate wiki developed by Atlassian", "website": "https://confluence.atlassian.com/doc/confluence-wiki-markup-251003035.html", "gitRepo": "https://github.com/jgm/pandoc", "id": "https://riju.codes/confluence" }, "subreddit": [ { "memberCount": { "2022": 1232 }, "url": "https://reddit.com/r/confluence" } ], "isbndb": "year|publisher|title|authors|isbn13\n2003|Pearson Education Limited|Computer Confluence It Edition and CD 5.|Beekman, George|9780131051898" }, "congolog": { "title": "conGolog", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4beb92be155c822674c25e8b1f76ac6e3e684071" ], "country": [ "Canada" ], "originCommunity": [ "York University", "University of Toronto" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2951", "centralPackageRepositoryCount": 0 }, "conlan": { "title": "CONLAN", "appeared": 1980, "type": "pl", "reference": [ "https://dl.acm.org/doi/pdf/10.1145/1500518.1500552", "https://semanticscholar.org/paper/f0112db48f405e9cdfb02da1328248a6e9d67cb7" ], "country": [ "United States and France and Germany and Japan" ], "originCommunity": [ "Bell Northern Research", "Sperry Univac", "Office of Naval Research", "IRIA", "Busdesministerium fur Forschungund Technologie", "Siemens", "Fujitsu" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7182", "centralPackageRepositoryCount": 0 }, "conll-u": { "title": "CoNLL-U", "appeared": 2014, "type": "application", "reference": [ "http://universaldependencies.org/format.html" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/UniversalDependencies" ], "githubLanguage": { "fileExtensions": [ "conllu", "conll" ], "type": "data", "aceMode": "text", "tmScope": "text.conllu", "aliases": [ "CoNLL", "CoNLL-X" ], "id": "CoNLL-U" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 2, "commitCount": 7, "sampleCount": 3, "example": [ "# newdoc id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200\n# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0001\n# text = What if Google Morphed Into GoogleOS?\n1\tWhat\twhat\tPRON\tWP\tPronType=Int\t0\troot\t0:root\t_\n2\tif\tif\tSCONJ\tIN\t_\t4\tmark\t4:mark\t_\n3\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t4\tnsubj\t4:nsubj\t_\n4\tMorphed\tmorph\tVERB\tVBD\tMood=Ind|Tense=Past|VerbForm=Fin\t1\tadvcl\t1:advcl\t_\n5\tInto\tinto\tADP\tIN\t_\t6\tcase\t6:case\t_\n6\tGoogleOS\tGoogleOS\tPROPN\tNNP\tNumber=Sing\t4\tobl\t4:obl\tSpaceAfter=No\n7\t?\t?\tPUNCT\t.\t_\t4\tpunct\t4:punct\t_\n\n# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0002\n# text = What if Google expanded on its search-engine (and now e-mail) wares into a full-fledged operating system?\n1\tWhat\twhat\tPRON\tWP\tPronType=Int\t0\troot\t0:root\t_\n2\tif\tif\tSCONJ\tIN\t_\t4\tmark\t4:mark\t_\n3\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t4\tnsubj\t4:nsubj\t_\n4\texpanded\texpand\tVERB\tVBD\tMood=Ind|Tense=Past|VerbForm=Fin\t1\tadvcl\t1:advcl\t_\n5\ton\ton\tADP\tIN\t_\t15\tcase\t15:case\t_\n6\tits\tits\tPRON\tPRP$\tGender=Neut|Number=Sing|Person=3|Poss=Yes|PronType=Prs\t15\tnmod:poss\t15:nmod:poss\t_\n7\tsearch\tsearch\tNOUN\tNN\tNumber=Sing\t9\tcompound\t9:compound\tSpaceAfter=No\n8\t-\t-\tPUNCT\tHYPH\t_\t9\tpunct\t9:punct\tSpaceAfter=No\n9\tengine\tengine\tNOUN\tNN\tNumber=Sing\t15\tcompound\t15:compound\t_\n10\t(\t(\tPUNCT\t-LRB-\t_\t9\tpunct\t9:punct\tSpaceAfter=No\n11\tand\tand\tCCONJ\tCC\t_\t13\tcc\t13:cc\t_\n12\tnow\tnow\tADV\tRB\t_\t13\tadvmod\t13:advmod\t_\n13\te-mail\te-mail\tNOUN\tNN\tNumber=Sing\t9\tconj\t9:conj\tSpaceAfter=No\n14\t)\t)\tPUNCT\t-RRB-\t_\t15\tpunct\t15:punct\t_\n15\twares\twares\tNOUN\tNNS\tNumber=Plur\t4\tobl\t4:obl\t_\n16\tinto\tinto\tADP\tIN\t_\t22\tcase\t22:case\t_\n17\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t22\tdet\t22:det\t_\n18\tfull\tfull\tADV\tRB\t_\t20\tadvmod\t20:advmod\tSpaceAfter=No\n19\t-\t-\tPUNCT\tHYPH\t_\t20\tpunct\t20:punct\tSpaceAfter=No\n20\tfledged\tfledged\tADJ\tJJ\tDegree=Pos\t22\tamod\t22:amod\t_\n21\toperating\toperating\tNOUN\tNN\tNumber=Sing\t22\tcompound\t22:compound\t_\n22\tsystem\tsystem\tNOUN\tNN\tNumber=Sing\t4\tobl\t4:obl\tSpaceAfter=No\n23\t?\t?\tPUNCT\t.\t_\t4\tpunct\t4:punct\t_\n\n# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0003\n# text = [via Microsoft Watch from Mary Jo Foley ]\n1\t[\t[\tPUNCT\t-LRB-\t_\t4\tpunct\t4:punct\tSpaceAfter=No\n2\tvia\tvia\tADP\tIN\t_\t4\tcase\t4:case\t_\n3\tMicrosoft\tMicrosoft\tPROPN\tNNP\tNumber=Sing\t4\tcompound\t4:compound\t_\n4\tWatch\tWatch\tPROPN\tNNP\tNumber=Sing\t0\troot\t0:root\t_\n5\tfrom\tfrom\tADP\tIN\t_\t6\tcase\t6:case\t_\n6\tMary\tMary\tPROPN\tNNP\tNumber=Sing\t4\tnmod\t4:nmod\t_\n7\tJo\tJo\tPROPN\tNNP\tNumber=Sing\t6\tflat\t6:flat\t_\n8\tFoley\tFoley\tPROPN\tNNP\tNumber=Sing\t6\tflat\t6:flat\t_\n9\t]\t]\tPUNCT\t-RRB-\t_\t4\tpunct\t4:punct\t_\n\n# newdoc id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700\n# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0001\n# text = (And, by the way, is anybody else just a little nostalgic for the days when that was a good thing?)\n1\t(\t(\tPUNCT\t-LRB-\t_\t14\tpunct\t14:punct\tSpaceAfter=No\n2\tAnd\tand\tCCONJ\tCC\t_\t14\tcc\t14:cc\tSpaceAfter=No\n3\t,\t,\tPUNCT\t,\t_\t14\tpunct\t14:punct\t_\n4\tby\tby\tADP\tIN\t_\t6\tcase\t6:case\t_\n5\tthe\tthe\tDET\tDT\tDefinite=Def|PronType=Art\t6\tdet\t6:det\t_\n6\tway\tway\tNOUN\tNN\tNumber=Sing\t14\tobl\t14:obl\tSpaceAfter=No\n7\t,\t,\tPUNCT\t,\t_\t14\tpunct\t14:punct\t_\n8\tis\tbe\tAUX\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t14\tcop\t14:cop\t_\n9\tanybody\tanybody\tPRON\tNN\tNumber=Sing\t14\tnsubj\t14:nsubj\t_\n10\telse\telse\tADJ\tJJ\tDegree=Pos\t9\tamod\t9:amod\t_\n11\tjust\tjust\tADV\tRB\t_\t13\tadvmod\t13:advmod\t_\n12\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t13\tdet\t13:det\t_\n13\tlittle\tlittle\tADJ\tJJ\tDegree=Pos\t14\tobl:npmod\t14:obl:npmod\t_\n14\tnostalgic\tnostalgic\tNOUN\tNN\tNumber=Sing\t0\troot\t0:root\t_\n15\tfor\tfor\tADP\tIN\t_\t17\tcase\t17:case\t_\n16\tthe\tthe\tDET\tDT\tDefinite=Def|PronType=Art\t17\tdet\t17:det\t_\n17\tdays\tday\tNOUN\tNNS\tNumber=Plur\t14\tnmod\t14:nmod\t_\n18\twhen\twhen\tADV\tWRB\tPronType=Rel\t23\tadvmod\t23:advmod\t_\n19\tthat\tthat\tPRON\tDT\tNumber=Sing|PronType=Dem\t23\tnsubj\t23:nsubj\t_\n20\twas\tbe\tAUX\tVBD\tMood=Ind|Number=Sing|Person=3|Tense=Past|VerbForm=Fin\t23\tcop\t23:cop\t_\n21\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t23\tdet\t23:det\t_\n22\tgood\tgood\tADJ\tJJ\tDegree=Pos\t23\tamod\t23:amod\t_\n23\tthing\tthing\tNOUN\tNN\tNumber=Sing\t17\tacl:relcl\t17:acl:relcl\tSpaceAfter=No\n24\t?\t?\tPUNCT\t.\t_\t14\tpunct\t14:punct\tSpaceAfter=No\n25\t)\t)\tPUNCT\t-RRB-\t_\t14\tpunct\t14:punct\t_\n\n# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0002\n# text = This BuzzMachine post argues that Google's rush toward ubiquity might backfire -- which we've all heard before, but it's particularly well-put in this post.\n1\tThis\tthis\tDET\tDT\tNumber=Sing|PronType=Dem\t3\tdet\t3:det\t_\n2\tBuzzMachine\tBuzzMachine\tPROPN\tNNP\tNumber=Sing\t3\tcompound\t3:compound\t_\n3\tpost\tpost\tNOUN\tNN\tNumber=Sing\t4\tnsubj\t4:nsubj\t_\n4\targues\targue\tVERB\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t0\troot\t0:root\t_\n5\tthat\tthat\tSCONJ\tIN\t_\t12\tmark\t12:mark\t_\n6\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t8\tnmod:poss\t8:nmod:poss\tSpaceAfter=No\n7\t's\t's\tPART\tPOS\t_\t6\tcase\t6:case\t_\n8\trush\trush\tNOUN\tNN\tNumber=Sing\t12\tnsubj\t12:nsubj\t_\n9\ttoward\ttoward\tADP\tIN\t_\t10\tcase\t10:case\t_\n10\tubiquity\tubiquity\tNOUN\tNN\tNumber=Sing\t8\tnmod\t8:nmod\t_\n11\tmight\tmight\tAUX\tMD\tVerbForm=Fin\t12\taux\t12:aux\t_\n12\tbackfire\tbackfire\tVERB\tVB\tVerbForm=Inf\t4\tccomp\t4:ccomp\t_\n13\t--\t--\tPUNCT\t,\t_\t12\tpunct\t12:punct\t_\n14\twhich\twhich\tPRON\tWDT\tPronType=Rel\t18\tobj\t18:obj\t_\n15\twe\twe\tPRON\tPRP\tCase=Nom|Number=Plur|Person=1|PronType=Prs\t18\tnsubj\t18:nsubj\tSpaceAfter=No\n16\t've\thave\tAUX\tVBP\tMood=Ind|Tense=Pres|VerbForm=Fin\t18\taux\t18:aux\t_\n17\tall\tall\tADV\tRB\t_\t18\tadvmod\t18:advmod\t_\n18\theard\thear\tVERB\tVBN\tTense=Past|VerbForm=Part\t12\tacl:relcl\t12:acl:relcl\t_\n19\tbefore\tbefore\tADV\tRB\t_\t18\tadvmod\t18:advmod\tSpaceAfter=No\n20\t,\t,\tPUNCT\t,\t_\t27\tpunct\t27:punct\t_\n21\tbut\tbut\tCCONJ\tCC\t_\t27\tcc\t27:cc\t_\n22\tit\tit\tPRON\tPRP\tCase=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs\t27\tnsubj:pass\t27:nsubj:pass\tSpaceAfter=No\n23\t's\tbe\tVERB\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t27\taux:pass\t27:aux:pass\t_\n24\tparticularly\tparticularly\tADV\tRB\t_\t27\tadvmod\t27:advmod\t_\n25\twell\twell\tADV\tRB\tDegree=Pos\t27\tadvmod\t27:advmod\tSpaceAfter=No\n26\t-\t-\tPUNCT\tHYPH\t_\t27\tpunct\t27:punct\tSpaceAfter=No\n27\tput\tput\tVERB\tVBN\tTense=Past|VerbForm=Part\t4\tconj\t4:conj\t_\n28\tin\tin\tADP\tIN\t_\t30\tcase\t30:case\t_\n29\tthis\tthis\tDET\tDT\tNumber=Sing|PronType=Dem\t30\tdet\t30:det\t_\n30\tpost\tpost\tNOUN\tNN\tNumber=Sing\t27\tobl\t27:obl\tSpaceAfter=No\n31\t.\t.\tPUNCT\t.\t_\t4\tpunct\t4:punct\t_\n\n# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0003\n# text = Google is a nice search engine.\n1\tGoogle\tGoogle\tPROPN\tNNP\tNumber=Sing\t6\tnsubj\t6:nsubj\t_\n2\tis\tbe\tAUX\tVBZ\tMood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin\t6\tcop\t6:cop\t_\n3\ta\ta\tDET\tDT\tDefinite=Ind|PronType=Art\t6\tdet\t6:det\t_\n4\tnice\tnice\tADJ\tJJ\tDegree=Pos\t6\tamod\t6:amod\t_\n5\tsearch\tsearch\tNOUN\tNN\tNumber=Sing\t6\tcompound\t6:compound\t_\n6\tengine\tengine\tNOUN\tNN\tNumber=Sing\t0\troot\t0:root\tSpaceAfter=No\n7\t.\t.\tPUNCT\t.\t_\t6\tpunct\t6:punct\t_" ], "url": "https://github.com/odanoburu/conllu-linguist-grammar" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "conman": { "title": "ConMan", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/013d01f986166b5509dea4b52a22836a418cb6e3" ], "country": [ "United States" ], "originCommunity": [ "Silicon Graphics, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1775", "centralPackageRepositoryCount": 0 }, "connection-machine-lisp": { "title": "Connection Machine LISP", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0a86be8e1f4dc7942d4c6b113eea8a9434a45702" ], "country": [ "United States" ], "originCommunity": [ "Thinking Machines Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1212", "centralPackageRepositoryCount": 0, "isbndb": "" }, "connection-machine": { "title": "Connection Machine", "appeared": 1990, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "lisp", "common-lisp", "sparc" ], "summary": "A Connection Machine (CM) is a member of a series of massively parallel supercomputers that grew out of doctoral research on alternatives to the traditional von Neumann architecture of computers by Danny Hillis at the Massachusetts Institute of Technology (MIT) in the early 1980s. Starting with CM-1, the machines were intended originally for applications in artificial intelligence and symbolic processing, but later versions found greater success in the field of computational science.", "created": 2002, "backlinksCount": 103, "pageId": 68760, "revisionCount": 227, "dailyPageViews": 82, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Connection_Machine" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2401", "centralPackageRepositoryCount": 0, "isbndb": "" }, "conniver": { "title": "CONNIVER", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4a2986f8a3b4a385ef410bfac509ace84401e961" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=606", "centralPackageRepositoryCount": 0 }, "consim": { "title": "CONSIM", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/93f0a7a8fb873dc3cf322944a3cd8d36a600e981", "https://collections.lib.utah.edu/ark:/87278/s6f4869g" ], "country": [ "United States" ], "originCommunity": [ "Texas A & M University", "University of Utah" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5500", "centralPackageRepositoryCount": 0 }, "constraintlisp": { "title": "ConstraintLisp", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/da3a2e378ccc794a445277caa6fa980796484738" ], "country": [ "Singapore" ], "originCommunity": [ "National Computer Board" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1678", "centralPackageRepositoryCount": 0 }, "constraints": { "title": "CONSTRAINTS", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d14a60b4058c036197276d24a57239915d345a52" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=892", "wordRank": 5947, "centralPackageRepositoryCount": 0 }, "consul": { "title": "Consul", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d46bcfce44def084cebfb4aea31898f8a5a23a61" ], "country": [ "United States" ], "originCommunity": [ "University of Rochester" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1921", "centralPackageRepositoryCount": 0, "isbndb": "" }, "context-diff": { "title": "Context Diff", "appeared": 1981, "type": "diffFormat", "reference": [ "https://en.wikipedia.org/wiki/Diff#Context_format" ], "originCommunity": [ "University of California, Berkeley" ], "example": [ "*** /path/to/original\ttimestamp\n--- /path/to/new\ttimestamp\n***************\n*** 1,3 ****\n--- 1,9 ----\n+ This is an important\n+ notice! It should\n+ therefore be located at\n+ the beginning of this\n+ document!\n+\n This part of the\n document has stayed the\n same from version to\n***************\n*** 8,20 ****\n compress the size of the\n changes.\n\n- This paragraph contains\n- text that is outdated.\n- It will be deleted in the\n- near future.\n\n It is important to spell\n! check this dokument. On\n the other hand, a\n misspelled word isn't\n the end of the world.\n--- 14,21 ----\n compress the size of the\n changes.\n\n It is important to spell\n! check this document. On\n the other hand, a\n misspelled word isn't\n the end of the world.\n***************\n*** 22,24 ****\n--- 23,29 ----\n this paragraph needs to\n be changed. Things can\n be added after it.\n+\n+ This paragraph contains\n+ important new additions\n+ to this document." ] }, "contracts.coffee": { "title": "contracts.coffee", "appeared": 2011, "type": "pl", "creators": [ "Tim Disney" ], "website": "https://disnet.github.io/contracts.coffee/", "fileExtensions": [ "coffee" ], "country": [ "United States" ], "originCommunity": [ "https://www.disnetdev.com/" ], "compilesTo": [ "javascript" ], "githubRepo": { "stars": 217, "forks": 2000, "subscribers": 6, "updated": 2014, "url": "https://github.com/disnet/contracts.coffee" }, "repoStats": { "firstCommit": 2009, "commits": 3929, "committers": 94, "files": 224 } }, "contrans": { "title": "CONTRANS", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a13f98cea406613320f3a7eb5f93fdb63c7b1079" ], "country": [ "United States" ], "originCommunity": [ "Walter Johnson High School" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5883", "centralPackageRepositoryCount": 0 }, "converge": { "title": "converge", "appeared": 2004, "type": "pl", "website": "https://convergepl.org/", "country": [ "United Kingdom" ], "originCommunity": [ "King's College London" ], "domainName": { "registered": 2004, "name": "convergepl.org" }, "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "import Sys\n\nfunc main():\n Sys::println(\"Hello world!\")" ] }, "convert": { "title": "CONVERT", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/498ff90afe4299c3a368e12f67e434ebf6642903" ], "country": [ "Mexico" ], "originCommunity": [ "Benemérita Universidad Autónoma de Puebla" ], "wikipedia": { "summary": "Conversion or convert may refer to:", "backlinksCount": 76, "pageId": 19666920, "dailyPageViews": 23, "created": 2012, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Convert" }, "hopl": "https://hopl.info/showlanguage.prx?exp=249", "wordRank": 4174, "centralPackageRepositoryCount": 0 }, "cooc": { "title": "cooC", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d6c7eed2fed4a142080112fe7cf2e0507906d2c7" ], "country": [ "Japan" ], "originCommunity": [ "Toshiba Corporation" ], "supersetOf": [ "objective-c" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1922", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "cool": { "title": "Classroom Object Oriented Language", "appeared": 1996, "type": "pl", "creators": [ "Alexander Aiken" ], "standsFor": "Classroom Object Oriented Language", "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "(*", "*)" ] ], "printToken": [ [ "out_string" ] ], "booleanTokens": [ [ "true", "false" ] ], "wikipedia": { "example": [ "class Main inherits IO {\n main(): Object {{\n out_string(\"Enter an integer greater-than or equal-to 0: \");\n\n let input: Int <- in_int() in\n if input < 0 then\n out_string(\"ERROR: Number must be greater-than or equal-to 0\\n\")\n else {\n out_string(\"The factorial of \").out_int(input);\n out_string(\" is \").out_int(factorial(input));\n out_string(\"\\n\");\n }\n fi;\n }};\n\n factorial(num: Int): Int {\n if num = 0 then 1 else num * factorial(num - 1) fi\n };\n};" ], "related": [ "clips", "sather", "java", "ml", "pascal", "ocaml", "mips" ], "summary": "Cool, an acronym for Classroom Object Oriented Language, is a computer programming language designed by Alexander Aiken for use in an undergraduate compiler course project. While small enough for a one term project, Cool still has many of the features of modern programming languages, including objects, automatic memory management, strong static typing and simple reflection. The reference Cool compiler is written in C++, built fully on the public domain tools. It generates code for a MIPS simulator, SPIM. Thus, the language should port easily to other platforms. It has been used for teaching compilers at many institutions (such as the University of California at Berkeley, where it was first used or Shahid Beheshti University of Iran) and the software is stable. This language is unrelated to the COOL language included in CLIPS.", "pageId": 14782123, "created": 2007, "backlinksCount": 18, "revisionCount": 105, "dailyPageViews": 25, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Cool_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "cl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.cool", "repos": 102, "id": "Cool" }, "githubBigQuery": { "repos": 57, "users": 56, "id": "Cool" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2014, "committerCount": 1, "commitCount": 4, "sampleCount": 2, "example": [ "(* This simple example of a list class is adapted from an example in the\n Cool distribution. *)\n\nclass List {\n isNil() : Bool { true };\n head() : Int { { abort(); 0; } };\n tail() : List { { abort(); self; } };\n cons(i : Int) : List {\n (new Cons).init(i, self)\n };\n};\n\nclass Cons inherits List {\n car : Int;\t-- The element in this list cell\n cdr : List;\t-- The rest of the list\n isNil() : Bool { false };\n head() : Int { car };\n tail() : List { cdr };\n init(i : Int, rest : List) : List {\n {\n\t car <- i;\n\t cdr <- rest;\n\t self;\n }\n };\n};\n" ], "url": "https://github.com/anunayk/cool-tmbundle" }, "leachim6": { "filepath": "c/Cool.cl", "fileExtensions": [ "cl" ], "example": [ "class Main inherits IO {\n main(): Object {\n\tout_string(\"Hello World.\\n\")\n };\n};\n" ], "id": "Cool" }, "fileType": "text", "wordRank": 1457, "centralPackageRepositoryCount": 0, "isbndb": "" }, "coordinate-format": { "title": "Matrix Market Coordinate Format", "appeared": 1996, "type": "textDataFormat", "website": "https://math.nist.gov/MatrixMarket/formats.html#MMformat", "country": [ "United States" ], "originCommunity": [ "National Institute of Standards and Technology" ], "example": [ "1 0 0 6 0\n0 10.5 0 0 0\n0 0 .015 0 0å\n0 250.5 0 -280 33.32\n0 0 0 0 12" ], "wikipedia": { "related": [ "ascii", "harwell-boeing-format" ], "summary": "The Matrix Market exchange formats are a set of human readable, ASCII-based file formats designed to facilitate the exchange of matrix data. The file formats were designed and adopted for the Matrix Market, a NIST repository for test data for use in comparative studies of algorithms for numerical linear algebra.", "pageId": 26998361, "created": 2010, "backlinksCount": 3, "revisionCount": 7, "dailyPageViews": 6, "url": "https://en.wikipedia.org/wiki/Matrix_Market_exchange_formats" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "copas": { "title": "COPAS", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/393d85af81656c5b69411358afc5512db2e7bf39" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Shefield" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3491", "centralPackageRepositoryCount": 0 }, "cope": { "title": "COPE", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8277190b2f13c5cd0e73940dd164e72f89ab9ce1" ], "country": [ "Australia" ], "originCommunity": [ "The University of Adelaide" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2145", "wordRank": 9848, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Developing a Secure Programming Module to cope with Modern Vulnerabilities|10.11591/IJINS.V1I1.404|3|0|Nigel McKelvey|fb5a93da3b8d83092b89b276b73c279beebcbb4b" }, "copilot": { "title": "Copilot", "appeared": 2021, "type": "pl", "description": "Copilot is a realtime programming language and Runtime Verification framework. It allows users to write concise programs in a simple but powerful way using a stream-based approach. Programs can be interpreted for testing, or translated C99 code to be incorporated in a project, or as a standalone application. The C99 backend ensures us that the output is constant in memory and time, making it suitable for systems with hard realtime requirements.", "website": "https://copilot-language.github.io/", "country": [ "United States" ], "originCommunity": [ "NASA", "https://github.com/Copilot-Language" ], "example": [ "-- Raw temperature from sensor, range -50.0C to 100.0C.\ntemp :: Stream Word8\ntemp = extern \"temperature\" Nothing\n\n-- Transform the temperature to Celsius.\nctemp :: Stream Float\nctemp = (unsafeCast temp) * (150.0 / 255.0) - 50.0\n\n-- Bind two triggers with a 3.0C hysteresis.\nspec = do\n trigger \"heaton\" (ctemp < 18.0) [arg ctemp]\n trigger \"heatoff\" (ctemp > 21.0) [arg ctemp]" ] }, "coq": { "title": "Coq", "appeared": 1989, "type": "pl", "website": "https://coq.inria.fr/", "webRepl": [ "https://coq.vercel.app/" ], "documentation": [ "https://coq.inria.fr/documentation" ], "devDocumentation": [ "https://github.com/coq/coq/blob/master/CONTRIBUTING.md" ], "country": [ "France" ], "originCommunity": [ "The Coq development team" ], "hasMultiLineComments": { "example": "(* a comment *)", "value": true }, "hasDependentTypes": { "example": "(* http://www-sop.inria.fr/members/Yves.Bertot/tsinghua/tsinghua-1.pdf *)", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "githubRepo": { "url": "https://github.com/coq/coq" }, "wikipedia": { "related": [ "ocaml", "agda", "idris", "c", "isabelle" ], "summary": "In computer science, Coq is an interactive theorem prover. It allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification. Coq works within the theory of the calculus of inductive constructions, a derivative of the calculus of constructions. Coq is not an automated theorem prover but includes automatic theorem proving tactics and various decision procedures. The Association for Computing Machinery rewarded Thierry Coquand, Gérard Pierre Huet, Christine Paulin-Mohring, Bruno Barras, Jean-Christophe Filliâtre, Hugo Herbelin, Chetan Murthy, Yves Bertot and Pierre Castéran with the 2013 ACM Software System Award for Coq.", "pageId": 581974, "dailyPageViews": 265, "created": 2004, "backlinksCount": 138, "revisionCount": 267, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Coq" }, "githubLanguage": { "fileExtensions": [ "coq", "v" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.coq", "repos": 5206, "id": "Coq" }, "githubBigQuery": { "repos": 1013, "users": 793, "id": "Coq" }, "pygmentsHighlighter": { "filename": "theorem.py", "fileExtensions": [ "v" ], "id": "Coq" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 4, "commitCount": 62, "sampleCount": 13, "example": [ "Require Import FunctionNinjas.All.\nRequire Import ListString.All.\nRequire Import Computation.\n\nImport C.Notations.\n\nDefinition error (message : LString.t) : C.t :=\n do_call! Command.ShowError message in\n ret.\n\nDefinition main : C.t :=\n call! card_is_valid := Command.AskCard in\n if card_is_valid then\n call! pin := Command.AskPIN in\n match pin with\n | None => error @@ LString.s \"No PIN given.\"\n | Some pin =>\n call! pin_is_valid := Command.CheckPIN pin in\n if pin_is_valid then\n call! ask_amount := Command.AskAmount in\n match ask_amount with\n | None => error @@ LString.s \"No amount given.\"\n | Some amount =>\n call! amount_is_valid := Command.CheckAmount amount in\n if amount_is_valid then\n call! card_is_given := Command.GiveCard in\n if card_is_given then\n call! amount_is_given := Command.GiveAmount amount in\n if amount_is_given then\n ret\n else\n error @@ LString.s \"Cannot give you the amount. Please contact your bank.\"\n else\n error @@ LString.s \"Cannot give you back the card. Please contact your bank.\"\n else\n error @@ LString.s \"Invalid amount.\"\n end\n else\n error @@ LString.s \"Invalid PIN.\"\n end\n else\n error @@ LString.s \"Invalid card.\".\n" ], "url": "https://github.com/mkolosick/Sublime-Coq" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Coq", "zulip": "https://coq.zulipchat.com/", "discourse": "https://coq.discourse.group/", "subreddit": [ { "memberCount": { "2022": 2066 }, "url": "https://reddit.com/r/Coq" } ], "hopl": "https://hopl.info/showlanguage.prx?exp=6970", "twitter": "https://twitter.com/CoqLang", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013-12-06T00:00:01Z|The MIT Press|Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant (The MIT Press)|Chlipala, Adam|9780262026659\n2022|MIT Press|Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant|Chlipala, Adam|9780262545747\n2017|ISTE Press - Elsevier|Computer Arithmetic and Formal Proofs: Verifying Floating-point Algorithms with the Coq System (Computer Engineering)|Boldo, Sylvie and Melquiond, Guillaume|9780081011706", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Extending Coq with Imperative Features and Its Application to SAT Verification|10.1007/978-3-642-14052-5_8|76|6|Michaël Armand and B. Grégoire and A. Spiwack and Laurent Théry|62a54d650f4e872c333164a03a02809bb5033c8b\n2012|Strongly Typed Term Representations in Coq|10.1007/s10817-011-9219-0|74|3|Nick Benton and C. Hur and A. Kennedy and Conor McBride|addf7c769cc3b08ed853e76605c266ab51010fdb\n2013|Canonical Structures for the Working Coq User|10.1007/978-3-642-39634-2_5|55|0|A. Mahboubi and E. Tassi|1f151ce64779eb673b5b06a4211480968e211452\n2018|Œuf: minimizing the Coq extraction TCB|10.1145/3167089|35|1|Eric Mullen and Stuart Pernsteiner and James R. Wilcox and Zachary Tatlock and D. Grossman|ef537a2cd3b2a2d28e8ec07195265a61a9ad4c26\n2017|Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq|10.1007/978-3-319-66107-0_13|34|3|Y. Forster and G. Smolka|adba80bbf7c50743fda436ef1919baff64fb1bf7\n2011|Verification of PLC Properties Based on Formal Semantics in Coq|10.1007/978-3-642-24690-6_6|32|1|J. Blech and Sidi Ould Biha|d30c9e9c8749b7e5e408804ae4ce9a446ea1c725\n2011|Verifying Object-Oriented Programs with Higher-Order Separation Logic in Coq|10.1007/978-3-642-22863-6_5|31|3|J. Bengtson and J. B. Jensen and Filip Sieczkowski and L. Birkedal|b6d3405002dcd052327c7052e83753a407477a59\n2013|Aliasing Restrictions of C11 Formalized in Coq|10.1007/978-3-319-03545-1_4|27|1|R. Krebbers|7ecd6f0e29de44baa17072f68225349c90c39871\n2018|Mtac2: typed tactics for backward reasoning in Coq|10.1145/3236773|24|1|Jan-Oliver Kaiser and Beta Ziliani and R. Krebbers and Y. Régis-Gianas and Derek Dreyer|d6b3a74639659f59cf6e36a653669fee84dd1aef\n2010|An Introduction to Programming and Proving with Dependent Types in Coq|10.6092/issn.1972-5787/1978|21|0|A. Chlipala|6ca05b1d04e65c1c34eb0565ec44ce47605efed3\n2019|ConCert: a smart contract certification framework in Coq|10.1145/3372885.3373829|21|2|D. Annenkov and Bas Spitters|4d656733e7205530d78a8887d429b41f9c789be0\n2017|Calculating Parallel Programs in Coq Using List Homomorphisms|10.1007/s10766-016-0415-8|16|1|F. Loulergue and Wadoud Bousdira and J. Tesson|adb8b0667728336d881a19f6c7defe51deb1c642\n2020|Verified programming of Turing machines in Coq|10.1145/3372885.3373816|16|0|Y. Forster and F. Kunze and Maximilian Wuttke|5ad36475e45e3f17be1d5cd5a77154cfba2a6994\n2011|A Formalization of the C99 Standard in HOL, Isabelle and Coq|10.1007/978-3-642-22673-1_28|14|0|R. Krebbers and F. Wiedijk|4f5516f1cc9d97769e44abc5ea6250e050174839\n2013|Computational Verification of Network Programs in Coq|10.1007/978-3-319-03545-1_3|13|1|Gordon Stewart|0549085a388b2772b3eedb8a62c3efd5654d4a1c\n2015|A unification algorithm for Coq featuring universe polymorphism and overloading|10.1145/2784731.2784751|12|0|Beta Ziliani and Matthieu Sozeau|61664cd31fa465ababe6c1ce8e0d10d2a15bb0b9\n2014|Bringing Coq into the World of GCM Distributed Applications|10.1007/s10766-013-0264-7|11|1|Nuno Gaspar and L. Henrio and E. Madelaine|0e8ec78725517d4cbfc667b04a8f6f16bed1c9e9\n2019|A Hybrid Formal Verification System in Coq for Ensuring the Reliability and Security of Ethereum-Based Service Smart Contracts|10.1109/ACCESS.2020.2969437|11|0|Zheng Yang and Hang Lei and Weizhong Qian|29f39232b4fdd69f22c9212d41bdc2e14690a22c\n2014|30 years of research and development around Coq|10.1145/2578855.2537848|10|0|G. Huet and Hugo Herbelin|b46004f9d17e3720845c833fbb05c012c9134df3\n2018|Call-by-Value Lambda Calculus as a Model of Computation in Coq|10.1007/s10817-018-9484-2|7|0|Y. Forster and G. Smolka|95dba68b129ba0a617ca4f328420f8f9259af4b0\n2013|An operational foundation for the tactic language of Coq|10.1145/2505879.2505890|7|0|Wojciech Jedynak and Malgorzata Biernacka and Dariusz Biernacki|b32892ebcba24dc35ca26bfce86f45fd216888ef\n2013|Translating Higher-Order Specifications to Coq Libraries Supporting Hybrid Proofs|10.29007/jqtz|3|0|Nada Habli and A. Felty|037ea8aa6131e318d4c9732a8f6f3c251f3301c6\n2020|Coq à la carte: a practical approach to modular syntax with binders|10.1145/3372885.3373817|3|0|Y. Forster and Kathrin Stark|3a0e6a70d01db87f52ba81100d4ade869aac6a9a\n2012|Towards a Framework for Building Formally Verified Supercompilers in Coq|10.1007/978-3-642-40447-4_9|1|0|D. Krustev|e56ffb2a1acae3e4d6a9bafd206d33068cfb562f\n2008|Programming with Effects in Coq|10.1007/978-3-540-70594-9_3|1|0|J. G. Morrisett|c890394f4a24dafbaae3546839efb5bc3ba15106\n2018|Type- Theoretical Foundations of the Derivation System in Coq|10.1109/SAIC.2018.8516885|1|0|Vasyl Lenko and V. Pasichnyk and N. Kunanets and Y. Shcherbyna|c22ba6504f78cedede886be7bee43165da9f58fa\n2015|Interactive typed tactic programming in the Coq proof assistant|10.22028/D291-26598|1|0|Beta Ziliani|4b34dede898a0e7108beb16f1e0aba20bd16d4f5" }, "cor": { "title": "cor", "appeared": 2016, "type": "pl", "creators": [ "Yosbel Marin" ], "website": "http://yosbelms.github.io/cor/", "country": [ "United States" ], "originCommunity": [ "https://github.com/yosbelms/cor" ], "compilesTo": [ "javascript" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "console.log" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 52, "forks": 3, "subscribers": 9, "created": 2015, "updated": 2022, "firstCommit": 2016, "description": "Straightforward language for the Web.", "issues": 0, "url": "https://github.com/yosbelms/cor" }, "repoStats": { "firstCommit": 2016, "commits": 419, "committers": 3, "files": 144 }, "leachim6": { "filepath": "c/Cor.cor", "fileExtensions": [ "cor" ], "example": [ "func main() console.log(\"Hello World\")\n" ], "id": "Cor" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n10555178|Show HN: Cor - the language of the web|2015-11-12 18:41:20 UTC|1447353680|yosbelms|7|4", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "coral-64": { "title": "CORAL 64", "appeared": 1964, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Coral_66" ], "country": [ "United Kingdom" ], "originCommunity": [ "Royal Radar Establishment" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2672", "centralPackageRepositoryCount": 0 }, "coral-lang": { "title": "Coral", "appeared": 2017, "type": "pl", "website": "https://corallanguage.org/", "country": [ "United States" ], "originCommunity": [ "University of California, Riverside", "University of Arizona" ], "visualParadigm": true }, "coral": { "title": "CORAL", "appeared": 1964, "type": "pl", "description": "CORAL (Computer On-line Real-time Applications Language) is a programming language originally developed in 1964 at the Royal Radar Establishment (RRE), Malvern, UK, as a subset of JOVIAL", "standsFor": "Computer On-line Real-time Applications Language", "country": [ "United Kingdom" ], "originCommunity": [ "Royal Radar Establishment" ], "wikipedia": { "related": [ "algol", "jovial", "algol-60", "fortran", "pascal", "edinburgh-imp", "sparc", "solaris", "linux", "ada", "bcpl" ], "summary": "CORAL (Computer On-line Real-time Applications Language) is a programming language originally developed in 1964 at the Royal Radar Establishment (RRE), Malvern, UK, as a subset of JOVIAL. Coral 66 was subsequently developed by I. F. Currie and M. Griffiths under the auspices of IECCA (Inter-Establishment Committee for Computer Applications). Its official definition, edited by Woodward, Wetherall and Gorman, was first published in 1970.", "pageId": 7262, "created": 2002, "backlinksCount": 29, "revisionCount": 92, "dailyPageViews": 17, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/Coral_66" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3026", "fileType": "text", "wordRank": 6801, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1978|Distributed In The Usa And Canada By Hayden Book|Coral 66 Programming|J. T Webb|9780850121933" }, "coralpp": { "title": "Coral++", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b3d08ba272f24782fc2bea8278fed11e8c02d6d9" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin", "AT&T Bell Labs" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5783", "centralPackageRepositoryCount": 0 }, "corbascript": { "title": "CorbaScript", "appeared": 1998, "type": "pl", "reference": [ "http://www.omg.org/cgi-bin/doc?orbos/98-12-08" ], "country": [ "France" ], "originCommunity": [ "https://web.archive.org/web/20050422083703/http://corbaweb.lifl.fr/CorbaScript/" ], "wikipedia": { "summary": "CorbaScript is an object-oriented scripting language designed for use with CORBA.", "created": 2004, "backlinksCount": 6, "pageId": 511196, "revisionCount": 19, "dailyPageViews": 2, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/CorbaScript" }, "centralPackageRepositoryCount": 0 }, "corc": { "title": "CORC", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5e94e8a03a744fc64c50dccdc98a94fe325ffd45" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=180", "centralPackageRepositoryCount": 0 }, "corelscript": { "title": "CorelScript", "appeared": 1994, "type": "pl", "description": "CorelSCRIPT is a dialect of Basic that serves as the macro extension language for many products from Corel Corp, including their line of graphics products. While the syntax of CorelSCRIPT is nearly identical to that of Microsoft's Visual Basic, it is distinguished by the large number of built-in functions that it provides for the end-user. In versions of CorelDraw 6.0 and later, for example, essentially every function the drawing tool can perform is available to the CorelSCRIPT programmer. Also, Corel tools can compile scripts to speed execution; this capability is somewhat unusual for an application macro language. Like the Visual Basic language systems it resembles, CorelSCRIPT is compatible with MS-Windows OLE automation facility, allowing a CorelSCRIPT program to invoke and control any OLE-capable Windows application. CorelSCRIPT is a commercial product available only with Corel Corporation products. Meager information about the language is available on the WWW.", "website": "http://www.corel.com/en/", "reference": [ "http://cgibin.erols.com/ziring/cgi-bin/cep/cep.pl?_key=CorelScript" ], "country": [ "United States" ], "originCommunity": [ "Corel Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5235", "centralPackageRepositoryCount": 0 }, "corescript": { "title": "corescript", "appeared": 2018, "type": "pl", "creators": [ "Stephan Bruny" ], "country": [ "Germany" ], "originCommunity": [ "https://www.stephanbruny.de/" ], "githubRepo": { "firstCommit": 2018, "stars": 19, "subscribers": 4, "created": 2018, "updated": 2020, "description": "A dynamically typed, functional-first, object-oriented, concurrent, general-purpose, embeddable scipting and programming language (for dotnet core 2.0).", "forks": 0, "issues": 0, "url": "https://github.com/stephanbruny/corescript" }, "repoStats": { "firstCommit": 2018, "commits": 14, "committers": 1, "files": 70 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n16419144|Show HN: CoreScript – a scripting language for dotnet core|2018-02-20 10:09:49 UTC|1519121389|sbruny|0|2" }, "corman-common-lisp": { "title": "Corman Common Lisp", "appeared": 1995, "type": "pl", "creators": [ "Scott Fahlman", "Richard P. Gabriel", "David A. Moon", "Kent Pitman", "Guy Steele", "Dan Weinreb", "Roger Corman" ], "website": "https://groups.google.com/g/cormanlisp", "country": [ "United States" ], "originCommunity": [ "Corman Technologies" ], "wikipedia": { "related": [ "common-lisp" ], "summary": "Corman Common Lisp is a commercial implementation of the Common Lisp programming language featuring support for the Windows operating system.", "created": 2009, "backlinksCount": 53, "pageId": 21565436, "revisionCount": 34, "dailyPageViews": 8, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Corman_Common_Lisp" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "cornell-university-programming-language": { "title": "Cornell University Programming Language", "appeared": 1967, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Cornell University" ], "wikipedia": { "related": [ "basic", "pl-i", "pl-c" ], "summary": "Cornell University Programming Language (also called CUPL) is a procedural computer programming language developed at Cornell University in the late 1960s. CUPL was based on an earlier Cornell-developed programming language, CORC. It was used to teach introductory computer programming classes. CUPL was developed by R. W. Conway, W. L. Maxwell, G. Blomgren, Howard Elder, H. Morgan, C. Pottle, W. Riddle, and Robert Walker. CUPL had a very simple syntax similar to BASIC and to PL/I. The processor was designed to offer extensive error correction and diagnostic capabilities. This would allow student programs to execute even if they contained minor syntax errors. The compiler also included spelling correction capabilities so that if a variable name is referenced only once, the compiler would assume that it was a misspelling of some other intended name. CUPL also offered an extensive set of matrix operations and offered dynamic run-time memory allocation. At the time, Cornell's computer was an IBM System 360 Model 40 with only 64K of core memory. CUPL was able to process a large batch of student programs quickly by remaining resident in core memory, but the compiler occupied 58K of memory, leaving only a small amount for the program code and variable storage.", "created": 2010, "backlinksCount": 6, "pageId": 29012502, "revisionCount": 12, "dailyPageViews": 10, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/Cornell_University_Programming_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=283", "centralPackageRepositoryCount": 0 }, "corvision": { "title": "CorVision", "appeared": 1986, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Cortex Corporation" ], "wikipedia": { "related": [ "inform", "unix", "visual-basic", "java", "sql", "digital-command-language" ], "summary": "CorVision is a fourth generation programming tool (4GL) currently owned by Attunity, Inc. CorVision was developed by Cortex Corporation for the VAX/VMS ISAM environment. Although Cortex beta tested CorVision-10 which was generated for PCs but CorVision itself stayed anchored on VMS. CorVision-10 proved more difficult than hoped, and was never released.", "pageId": 4891630, "created": 2006, "backlinksCount": 11, "revisionCount": 86, "dailyPageViews": 7, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/CorVision" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "cosh": { "title": "cosh", "appeared": 2022, "type": "pl", "description": "Concatenative command-line shell", "country": [ "United States" ], "originCommunity": [ "https://github.com/tomhrr/cosh/issues" ], "related": [ "bash" ], "example": [ "lsr; [test m] grep; [f<; [data m] grep] map" ], "githubRepo": { "stars": 4, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2023, "description": "Concatenative command-line shell", "issues": 3, "url": "https://github.com/tomhrr/cosh" }, "repoStats": { "firstCommit": 2022, "commits": 345, "committers": 4, "files": 50 } }, "cosmicos": { "title": "CosmicOS", "appeared": 2000, "type": "pl", "reference": [ "https://people.csail.mit.edu/paulfitz/cosmicos.shtml" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6959", "centralPackageRepositoryCount": 0 }, "cosmo": { "title": "COSMO", "appeared": 2001, "type": "pl", "reference": [ "https://semanticscholar.org/paper/aaf8047fcab399d36cc38dafbed5a4d35f58d44f" ], "country": [ "Czech Republic" ], "originCommunity": [ "Charles University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3027", "centralPackageRepositoryCount": 0 }, "cosmos": { "title": "Cosmos", "appeared": 2022, "type": "pl", "description": "Cosmos 0.2 - now with Pure Arithmetics", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/u09sxl/cosmos_02_now_with_pure_arithmetics/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/mcsoto/cosmos" ] }, "cotton": { "title": "Cotton", "appeared": 2021, "type": "pl", "creators": [ "Mado Nanika" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/nanikamado/cotton" ], "githubRepo": { "firstCommit": 2021, "stars": 16, "forks": 1, "subscribers": 1, "created": 2021, "updated": 2022, "description": "A programming language", "issues": 0, "url": "https://github.com/nanikamado/cotton" }, "repoStats": { "firstCommit": 2021, "commits": 534, "committers": 3, "files": 110 } }, "couchbase-mobile": { "title": "Couchbase Mobile", "appeared": 2010, "type": "database", "description": "NoSQL document-oriented database management system for mobile devices", "country": [ "United States" ], "originCommunity": [ "Couchbase Inc." ] }, "couchbase": { "title": "Couchbase", "appeared": 2011, "type": "database", "description": "NoSQL document-oriented database management system", "country": [ "United States" ], "originCommunity": [ "Couchbase Inc." ] }, "couchdb": { "title": "CouchDB", "appeared": 2005, "type": "application", "website": "https://couchdb.apache.org/", "documentation": [ "https://docs.couchdb.org/en/3.2.2-docs/" ], "originCommunity": [ "https://github.com/apache/couchdb" ], "domainName": { "name": "couchdb.apache.org" }, "writtenIn": [ "cpp", "c", "javascript", "erlang", "python", "elixir" ], "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "githubRepo": { "stars": 5500, "forks": 1000, "updated": 2022, "description": "Seamless multi-master syncing database with an intuitive HTTP/JSON API, designed for reliability", "issues": 275, "url": "https://github.com/apache/couchdb" }, "wikipedia": { "related": [ "c", "javascript", "linux", "solaris", "freebsd", "json", "nginx-config", "sql", "mongodb", "postgresql" ], "summary": "Apache CouchDB is an open-source document-oriented NoSQL database, implemented in Erlang. CouchDB uses multiple formats and protocols to store, transfer, and process its data. It uses JSON to store data, JavaScript as its query language using MapReduce, and HTTP for an API.", "pageId": 13427539, "dailyPageViews": 70, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Apache_CouchDB" }, "indeedJobs": { "2022": 13, "query": "couchdb developer" }, "subreddit": [ { "memberCount": { "2022": 1000 }, "url": "https://www.reddit.com/r/CouchDB" } ], "twitter": "https://twitter.com/couchdb", "fileType": "text", "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Definitive Guide: Time to Relax|2010|J.Chris Anderson|6712632|3.50|68|9\nGetting Started with CouchDB|2011|M.C. Brown|13217933|3.42|19|2\nScaling CouchDB|2011|Bradley Holt|11354246|3.58|12|0" }, "coulombs-equation": { "title": "Coulomb's Equation", "appeared": 1785, "type": "equation", "equation": "|F|=K*(|q1||q2|/(r^2))", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Coulomb%27s_law" } }, "cowsel": { "title": "COWSEL", "appeared": 1964, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Edinburgh" ], "wikipedia": { "example": [ "function member\nlambda x y\ncomment Is x a member of list y;\ndefine y atom then *0 end\n y hd x equal then *1 end\n y tl -> y repeat up" ], "related": [ "cpl", "lisp", "pop-2", "reverse-polish-notation", "pop-11", "poplog" ], "summary": "COWSEL (COntrolled Working SpacE Language) is a programming language designed between 1964 and 1966 by Robin Popplestone. It was based on an RPN form of Lisp combined with some ideas from CPL. COWSEL was initially implemented on a Ferranti Pegasus computer at the University of Leeds and on a Stantec Zebra at the Bradford Institute of Technology; later, Rod Burstall implemented it on an Elliot 4120 at the University of Edinburgh. COWSEL was renamed POP-1 during the summer of 1966 and development continued under that name from then on.", "pageId": 94451, "created": 2002, "backlinksCount": 15, "revisionCount": 32, "dailyPageViews": 8, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/COWSEL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=196", "fileType": "text", "centralPackageRepositoryCount": 0 }, "cp": { "title": "CP", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ac97d662b36e0d7bd476839349b0bd29321cdb1e" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "leachim6": { "filepath": "c/C+", "example": [ "THATSCPLUSCODENONOTCPLUSPLUSCPLUS{includ =iostrea; usin namespac st> in mai()|cou == ^^Hello World^^ == en>retur -1>?\n" ], "id": "C+" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1311", "wordRank": 4860, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2007|MiniZinc: Towards a Standard CP Modelling Language|10.1007/978-3-540-74970-7_38|739|106|N. Nethercote and Peter James Stuckey and Ralph Becket and S. Brand and Gregory J. Duck and Guido Tack|01957c9c91ea40a8ad5ab5a12d694a85c53a956e\n2005|Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings|10.1007/11564751|214|0|P. V. Beek|b5f8380bb6149ec2f4e5bf4f5ab7551ca9b3c37b\n2011|Ankle control and strength training for children with cerebral palsy using the Rutgers Ankle CP|10.1109/ICORR.2011.5975432|42|3|D. Cioi and A. Kale and G. Burdea and J. Engsberg and W. Janes and S. Ross|6e330875094dc466c07cc460dc5065d3d2c9caf8\n2008|CP with ACO|10.1007/978-3-540-68155-7_32|12|1|M. Khichane and P. Albert and Christine Solnon|df8420cff9faf2f296d342e31d4279d73687fad3" }, "cpan-pm": { "title": "cpan-pm", "appeared": 1995, "type": "packageManager", "website": "https://www.cpan.org/", "country": [ "Various" ], "originCommunity": [ "https://pause.perl.org/pause/query?ACTION=who_admin" ], "domainName": { "registered": 1998, "awisRank": { "2022": 353560 }, "name": "cpan.org" }, "packageCount": 176876, "packageAuthors": 13699, "forLanguages": [ "perl" ] }, "cperl": { "title": "cperl", "appeared": 2017, "type": "pl", "creators": [ "Reini Urban" ], "description": "cperl is a better variant of Perl 5 with many Perl 6 based features and improvements, but without breaking compatibility. CPAN works. It is a \"perl 11\", 5 + 6 = 11.", "website": "http://perl11.github.io/", "country": [ "Various" ], "originCommunity": [ "https://github.com/perl11/" ], "domainName": { "registered": 2021, "name": "perl11.org" }, "githubRepo": { "firstCommit": 1987, "stars": 135, "forks": 13, "subscribers": 21, "created": 2015, "updated": 2022, "description": "A perl5 with classes, types, compilable, company friendly, security", "issues": 116, "url": "https://github.com/perl11/cperl" }, "repoStats": { "firstCommit": 1987, "commits": 94417, "committers": 1592, "files": 7391 }, "semanticScholar": "" }, "cpl": { "title": "CPL", "appeared": 1963, "type": "pl", "creators": [ "Christopher Strachey" ], "standsFor": "Combined Programming Language", "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge", "University of London" ], "hasAssignment": { "example": "", "value": true }, "assignmentToken": [ [ ":=" ] ], "wikipedia": { "example": [ "Max(Items, ValueFunction) = value of\n§ (Best, BestVal) = (NIL, -∞)\nwhile Items do §\n(Item, Val) = (Head(Items), ValueFunction(Head(Items)))\nif Val > BestVal then (Best, BestVal) := (Item, Val)\nItems := Rest(Items) §⃒\nresult is Best §⃒" ], "related": [ "algol-60", "bcpl", "pop-2", "b", "c" ], "summary": "CPL (Combined Programming Language) is a multi-paradigm programming language, that was developed in the early 1960s. It is an early ancestor of the C language via the BCPL and B languages.", "pageId": 828614, "created": 2001, "backlinksCount": 31, "revisionCount": 157, "dailyPageViews": 58, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/CPL_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=181", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCpl (Programming Language)||Jesse Russell|54888258|0.0|0|0", "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1963|The Main Features of CPL|10.1093/COMJNL/6.2.134|66|1|D. W. Barron and J. Buxton and D. Hartley and Eric Nixon and C. Strachey|8da5a37ad82fef63bb2fc61103556506e4a7df74\n2013|How BCPL Evolved from CPL|10.1093/comjnl/bxs026|1|0|M. Richards|d6b48c3577d5115b6d7e848accea82e65046b6d4" }, "cpp": { "title": "C++", "appeared": 1985, "type": "pl", "creators": [ "Bjarne Stroustrup" ], "website": "http://isocpp.org/", "documentation": [ "https://devdocs.io/cpp/" ], "emailList": [ "https://lists.isocpp.org/mailman/listinfo.cgi" ], "spec": "https://isocpp.org/std/the-standard", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "domainName": { "registered": 2012, "awisRank": { "2022": 210505 }, "name": "isocpp.org" }, "releaseNotesUrl": "https://en.cppreference.com/w/cpp/language/history", "supersetOf": [ "c" ], "visualParadigm": false, "hasPartialApplication": { "example": "// http://www.cplusplus.com/reference/functional/bind/\n// bind example\n#include // std::cout\n#include // std::bind\n\n// a function: (also works with function object: std::divides my_divide;)\ndouble my_divide (double x, double y) {return x/y;}\n\nstruct MyPair {\n double a,b;\n double multiply() {return a*b;}\n};\n\nint main () {\n using namespace std::placeholders; // adds visibility of _1, _2, _3,...\n\n // binding functions:\n auto fn_five = std::bind (my_divide,10,2); // returns 10/2\n std::cout << fn_five() << '\\n'; // 5\n\n auto fn_half = std::bind (my_divide,_1,2); // returns x/2\n std::cout << fn_half(10) << '\\n'; // 5\n\n auto fn_invert = std::bind (my_divide,_2,_1); // returns y/x\n std::cout << fn_invert(10,2) << '\\n'; // 0.2\n\n auto fn_rounding = std::bind (my_divide,_1,_2); // returns int(x/y)\n std::cout << fn_rounding(10,3) << '\\n'; // 3\n\n MyPair ten_two {10,2};\n\n // binding members:\n auto bound_member_fn = std::bind (&MyPair::multiply,_1); // returns x.multiply()\n std::cout << bound_member_fn(ten_two) << '\\n'; // 20\n\n auto bound_member_data = std::bind (&MyPair::a,ten_two); // returns ten_two.a\n std::cout << bound_member_data() << '\\n'; // 10\n\n return 0;\n}", "value": true }, "hasSingleDispatch": { "example": "", "value": true }, "hasMagicGettersAndSetters": { "example": "", "value": false }, "hasConstructors": { "example": "class Foobar {\n public:\n Foobar(double r = 1.0,\n double alpha = 0.0) // Constructor, parameters with default values.\n : x_(r * cos(alpha)) // <- Initializer list\n {\n y_ = r * sin(alpha); // <- Normal assignment\n }\n\n private:\n double x_;\n double y_;\n};\nFoobar a,\n b(3),\n c(5, M_PI/4);", "value": true }, "hasIterators": { "example": "std::vector items;\nitems.push_back(5); // Append integer value '5' to vector 'items'.\nitems.push_back(2); // Append integer value '2' to vector 'items'.\nitems.push_back(9); // Append integer value '9' to vector 'items'.\n\nfor (auto it = items.begin(); it != items.end(); ++it) { // Iterate through 'items'.\n std::cout << *it; // And print value of 'items' for current index.\n}", "value": true }, "hasFunctionOverloading": { "example": "// volume of a cube\nint volume(const int s) {\n return s*s*s;\n}\n// volume of a cylinder\ndouble volume(const double r, const int h) {\n return 3.1415926*r*r*static_cast(h);\n}", "value": true }, "hasNamespaces": { "example": "#include \nusing namespace std;\n\n// Variable created inside namespace\nnamespace first\n{\n int val = 500;\n}\n \n// Global variable\nint val = 100;\n// Ways to do it: https://en.cppreference.com/w/cpp/language/namespace\nnamespace ns_name { declarations }\ninline namespace ns_name { declarations }\nnamespace { declarations }\nns_name::name\nusing namespace ns_name;\nusing ns_name::name;\nnamespace name = qualified-namespace ;\nnamespace ns_name::inline(since C++20)(optional) name { declarations } ", "value": true }, "hasMultipleInheritance": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasTemplates": { "example": "template \nVector& Vector::operator+=(const Vector& rhs)\n{\n for (int i = 0; i < length; ++i)\n value[i] += rhs.value[i];\n return *this;\n}", "value": true }, "hasVirtualFunctions": { "example": "class Animal {\n public:\n // Intentionally not virtual:\n void Move(void) {\n std::cout << \"This animal moves in some way\" << std::endl;\n }\n virtual void Eat(void) = 0;\n};\n\n// The class \"Animal\" may possess a definition for Eat if desired.\nclass Llama : public Animal {\n public:\n // The non virtual function Move is inherited but not overridden.\n void Eat(void) override {\n std::cout << \"Llamas eat grass!\" << std::endl;\n }\n};", "value": true }, "hasThreads": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "std::cout" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "#define", "#defined", "#elif", "#else", "#endif", "#error", "#if", "#ifdef", "#ifndef", "#include", "#line", "#pragma", "#undef", "alignas", "alignof", "and", "and_eq", "asm", "atomic_cancel", "atomic_commit", "atomic_noexcept", "auto", "bitand", "bitor", "bool", "break", "case", "catch", "char", "char16_t", "char32_t", "class", "compl", "concept", "const", "constexpr", "const_cast", "continue", "decltype", "default", "delete", "do", "double", "dynamic_cast", "else", "enum", "explicit", "export", "extern", "false", "final", "float", "for", "friend", "goto", "if", "inline", "int", "import", "long", "module", "mutable", "namespace", "new", "noexcept", "not", "not_eq", "nullptr", "operator", "or", "or_eq", "override", "private", "protected", "public", "register", "reinterpret_cast", "requires", "return", "short", "signed", "sizeof", "static", "static_assert", "static_cast", "struct", "switch", "synchronized", "template", "this", "thread_local", "throw", "transaction_safe", "transaction_safe_dynamic", "true", "try", "typedef", "typeid", "typename", "union", "unsigned", "using", "virtual", "void", "volatile", "wchar_t", "while", "xor", "xor_eq" ], "wikipedia": { "example": [ "1 #include \n2 #include \n3 #include \n4 \n5 int main() {\n6 try {\n7 std::vector vec{3, 4, 3, 1};\n8 int i{vec.at(4)}; // Throws an exception, std::out_of_range (indexing for vec is from 0-3 not 1-4)\n9 }\n10 // An exception handler, catches std::out_of_range, which is thrown by vec.at(4)\n11 catch (std::out_of_range &e) {\n12 std::cerr << \"Accessing a non-existent element: \" << e.what() << '\\n';\n13 }\n14 // To catch any other standard library exceptions (they derive from std::exception)\n15 catch (std::exception &e) {\n16 std::cerr << \"Exception thrown: \" << e.what() << '\\n';\n17 }\n18 // Catch any unrecognised exceptions (i.e. those which don't derive from std::exception)\n19 catch (...) {\n20 std::cerr << \"Some fatal error\\n\";\n21 }\n22 }" ], "related": [ "ada", "algol-68", "c", "clu", "ml", "simula", "python", "csharp", "chapel", "d", "java", "lua", "perl", "php", "rust", "nim", "sql", "bcpl", "unix", "assembly-language", "regex" ], "summary": "C++ ( pronounced cee plus plus) is a general-purpose programming language. It has imperative, object-oriented and generic programming features, while also providing facilities for low-level memory manipulation. It was designed with a bias toward system programming and embedded, resource-constrained and large systems, with performance, efficiency and flexibility of use as its design highlights. C++ has also been found useful in many other contexts, with key strengths being software infrastructure and resource-constrained applications, including desktop applications, servers (e.g. e-commerce, web search or SQL servers), and performance-critical applications (e.g. telephone switches or space probes). C++ is a compiled language, with implementations of it available on many platforms. Many vendors provide C++ compilers, including the Free Software Foundation, Microsoft, Intel, and IBM. C++ is standardized by the International Organization for Standardization (ISO), with the latest standard version ratified and published by ISO in December 2014 as ISO/IEC 14882:2014 (informally known as C++14). The C++ programming language was initially standardized in 1998 as ISO/IEC 14882:1998, which was then amended by the C++03, ISO/IEC 14882:2003, standard. The current C++14 standard supersedes these and C++11, with new features and an enlarged standard library. Before the initial standardization in 1998, C++ was developed by Bjarne Stroustrup at Bell Labs since 1979, as an extension of the C language as he wanted an efficient and flexible language similar to C, which also provided high-level features for program organization. The C++17 standard is due in July 2017, with the draft largely implemented by some compilers already, and C++20 is the next planned standard thereafter. Many other programming languages have been influenced by C++, including C#, D, Java, and newer versions of C.", "pageId": 72038, "dailyPageViews": 4307, "created": 2001, "backlinksCount": 10943, "revisionCount": 1487, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/C++" }, "githubLanguage": { "fileExtensions": [ "cpp", "c++", "cc", "cp", "cxx", "h", "h++", "hh", "hpp", "hxx", "inc", "inl", "ino", "ipp", "ixx", "re", "tcc", "tpp" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ngoogle mediapipe https://github.com/google.png https://github.com/google/mediapipe C++ #f34b7d 2824 386 2250 \"MediaPipe is a cross-platform framework for building multimodal applied machine learning pipelines\"\nfmtlib fmt https://github.com/fmtlib.png https://github.com/fmtlib/fmt C++ #f34b7d 6596 796 273 \"A modern formatting library\"\nTheCherno Hazel https://github.com/TheCherno.png https://github.com/TheCherno/Hazel C++ #f34b7d 1589 265 130 \"Hazel Engine\"\narendst Sonoff-Tasmota https://github.com/arendst.png https://github.com/arendst/Sonoff-Tasmota C++ #f34b7d 7683 1795 281 \"Provide ESP8266 based itead Sonoff with Web, MQTT and OTA firmware using Arduino IDE or PlatformIO\"\nocornut imgui https://github.com/ocornut.png https://github.com/ocornut/imgui C++ #f34b7d 16553 2604 474 \"Dear ImGui: Bloat-free Immediate Mode Graphical User interface for C++ with minimal dependencies\"\nanhkgg SuperWeChatPC https://github.com/anhkgg.png https://github.com/anhkgg/SuperWeChatPC C++ #f34b7d 2071 573 474 超级微信电脑客户端，支持多开、防消息撤销、语音消息备份...开放WeChatSDK\ngnuradio gnuradio https://github.com/gnuradio.png https://github.com/gnuradio/gnuradio C++ #f34b7d 1798 1055 79 \"GNU Radio\"\nplaidml plaidml https://github.com/plaidml.png https://github.com/plaidml/plaidml C++ #f34b7d 2457 214 120 \"PlaidML is a framework for making deep learning work everywhere.\"\nTonyChen56 WeChatRobot https://github.com/TonyChen56.png https://github.com/TonyChen56/WeChatRobot C++ #f34b7d 1468 559 938 PC版微信机器人\nhuihut interview https://github.com/huihut.png https://github.com/huihut/interview C++ #f34b7d 7108 2269 641 \"📚 C/C++ 技术面试基础知识总结，包括语言、程序库、数据结构、算法、系统、网络、链接装载库等知识及面试经验、招聘、内推等信息。\"\nskypjack entt https://github.com/skypjack.png https://github.com/skypjack/entt C++ #f34b7d 2053 180 302 \"Gaming meets modern C++ - a fast and reliable entity-component system (ECS) and much more\"\nOneLoneCoder videos https://github.com/OneLoneCoder.png https://github.com/OneLoneCoder/videos C++ #f34b7d 535 395 72 \"The official distribution of olcConsoleGameEngine, a tool used in javidx9's YouTube videos and projects\"\ndolphin-emu dolphin https://github.com/dolphin-emu.png https://github.com/dolphin-emu/dolphin C++ #f34b7d 5521 1278 96 \"Dolphin is a GameCube / Wii emulator, allowing you to play games for these two platforms on PC with improvements.\"\nosquery osquery https://github.com/osquery.png https://github.com/osquery/osquery C++ #f34b7d 14868 1796 457 \"SQL powered operating system instrumentation, monitoring, and analytics.\"\ndanielkrupinski Osiris https://github.com/danielkrupinski.png https://github.com/danielkrupinski/Osiris C++ #f34b7d 260 115 56 \"Free open-source training software / cheat for Counter-Strike: Global Offensive, written in modern C++. GUI powered by imgui.\"\ncarla-simulator carla https://github.com/carla-simulator.png https://github.com/carla-simulator/carla C++ #f34b7d 3098 840 239 \"Open-source simulator for autonomous driving research.\"\ngrpc grpc https://github.com/grpc.png https://github.com/grpc/grpc C++ #f34b7d 22945 5381 557 \"The C based gRPC (C++, Python, Ruby, Objective-C, PHP, C#)\"\nFastLED FastLED https://github.com/FastLED.png https://github.com/FastLED/FastLED C++ #f34b7d 3180 828 63 \"The main FastLED library (successor to FastSPI_LED). Please direct questions/requests for advice to the reddit community - http://fastled.io/r - we'd like to keep issues to just tracking bugs/enhancements/tasks. *NOTE* major library work is currently on hold\"\nTarsCloud Tars https://github.com/TarsCloud.png https://github.com/TarsCloud/Tars C++ #f34b7d 7510 1822 243 \"Tars is a high-performance RPC framework based on name service and Tars protocol, also integrated administration platform, and implemented hosting-service via flexible schedule.\"\napache thrift https://github.com/apache.png https://github.com/apache/thrift C++ #f34b7d 6723 3037 131 \"Apache Thrift\"\nNVIDIA DALI https://github.com/NVIDIA.png https://github.com/NVIDIA/DALI C++ #f34b7d 1829 208 245 \"A library containing both highly optimized building blocks and an execution engine for data pre-processing in deep learning applications\"\nhaoel leetcode https://github.com/haoel.png https://github.com/haoel/leetcode C++ #f34b7d 11615 3642 295 \"LeetCode Problems' Solutions\"\nllvm llvm-project https://github.com/llvm.png https://github.com/llvm/llvm-project C++ #f34b7d 1832 557 213 \"This is the canonical git mirror of the LLVM subversion repository. The repository does not accept github pull requests at this moment. Please submit your patches at http://reviews.llvm.org.\"\npytorch pytorch https://github.com/pytorch.png https://github.com/pytorch/pytorch C++ #f34b7d 31392 7706 966 \"Tensors and Dynamic neural networks in Python with strong GPU acceleration\"\nmicrosoft onnxruntime https://github.com/microsoft.png https://github.com/microsoft/onnxruntime C++ #f34b7d 1113 247 135 \"ONNX Runtime: cross-platform, high performance scoring engine for ML models\"", "trendingProjectsCount": 26, "type": "programming", "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-c++src", "tmScope": "source.c++", "aliases": [ "cpp" ], "repos": 2161625, "id": "C++" }, "githubBigQuery": { "repos": 277733, "users": 170927, "id": "C++" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/cpp", "monaco": "cpp", "pygmentsHighlighter": { "filename": "c_cpp.py", "fileExtensions": [ "cpp", "hpp", "c++", "h++", "cc", "hh", "cxx", "hxx", "C", "H", "cp", "CPP", "tpp" ], "id": "C++" }, "linguistGrammarRepo": { "sampleCount": 49, "example": [ "#include \n\nnamespace Gui\n{\n\n}\n" ], "url": "https://github.com/textmate/c.tmbundle" }, "projectEuler": { "memberCount": { "2019": 41087, "2022": 46028 }, "id": "C/C++" }, "helloWorldCollection": [ "// Hello World in C++ (pre-ISO)\n\n#include \n\nmain()\n{\n cout << \"Hello World!\" << endl;\n return 0;\n}\n" ], "leachim6": { "filepath": "c/C++.cpp", "fileExtensions": [ "cpp" ], "example": [ "#include \n\nint main()\n{\n std::cout << \"Hello World\" << std::endl;\n}\n" ], "id": "C++" }, "quineRelay": "C++", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nint square(int num) {\n return num * num;\n}" ], "id": "C++" }, "rijuRepl": { "example": [ "#include \n\nint main() {\n std::cout << \"Hello, world!\" << std::endl;\n return 0;\n}\n" ], "description": "General-purpose programming language created by Bjarne Stroustrup as an extension of the C programming language", "fileExtensions": [ "C", "cc", "cpp", "cxx", "c++", "h", "hh", "hpp", "hxx", "h++" ], "gitRepo": "https://github.com/llvm/llvm-project", "id": "https://riju.codes/cpp" }, "replit": "https://repl.it/languages/cpp", "indeedJobs": { "2017": 22237, "query": "c++ engineer" }, "linkedInSkill": { "2018": 3886123, "id": "c++" }, "stackOverflowSurvey": { "2021": { "users": 20057, "medianSalary": 54049, "fans": 15249, "percentageUsing": 0.24 } }, "annualReportsUrl": [ "https://isocpp.org/about/annual-reports" ], "officialBlogUrl": [ "https://www.isocpp.org/blog" ], "eventsPageUrl": [ "https://isocpp.org/blog/category/events" ], "subreddit": [ { "memberCount": { "2017": 56189, "2022": 220359 }, "url": "https://reddit.com/r/cpp" } ], "meetup": { "memberCount": 69338, "groupCount": 204, "url": "https://www.meetup.com/topics/c" }, "conference": [ "https://cppcon.org/ CppCon", "https://cppcon.org CppCon" ], "tiobe": { "currentRank": 4, "id": "C++" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1202", "pypl": "C++", "twitter": "https://twitter.com/isocpp", "ubuntuPackage": "g++", "gdbSupport": true, "jupyterKernel": [ "https://github.com/root-mirror/cling", "https://github.com/QuantStack/xeus-cling" ], "fileType": "text", "githubCopilotOptimized": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011|PEARSON INDIA|ADTs, Data Structures, and Problem Solving with C++|Nyhoff|9780131409095\n2013|Pearson|Data Structures & Algorithm Analysis in C++|Weiss, Mark|9780132847377\n2012|Addison-Wesley Professional|C++ Primer (5th Edition)|Lippman, Stanley and Lajoie, Josée and Moo, Barbara|9780321714114\n2001|Pearson|Data Structures with C++ Using STL|Ford, William and Topp, William|9780130858504\n2013|Pearson|Introduction to Programming with C++ (Myprogramminglab)|Liang, Y. Daniel|9780133252811\n2013|Pearson|C++ How to Program (Early Objects Version) (9th Edition)|Deitel, Paul and Deitel, Harvey|9780133378719\n2014|Cengage Learning|C++ Programming: Program Design Including Data Structures|Malik, D. S.|9781285852751\n2011|Pearson|Engineering Problem Solving with C++ (3rd Edition)|Etter, Delores M. and Ingber, Jeanine A.|9780132492652\n2011|Pearson|Problem Solving With C++|Savitch, Walter|9780132162739\n2010|Pearson|C++ How to Program: Late Objects Version (How to Program (Deitel))|Deitel, Paul and Deitel, Harvey|9780132165419\n2007|Pearson|C++ Programming Today|Johnston, Barbara|9780136150992\n2003|Pearson|C++ for Java Programmers|Weiss, Mark|9780139194245\n2010|Wiley|C++ for Everyone|Horstmann, Cay S.|9780470927137\n1995|Pearson|Data Structures Using C and C++ (2nd Edition)|Langsam, Yedidyah and Augenstein, Moshe J. and Tenenbaum, Aaron M.|9780130369970\n2012|Cengage Learning|Introduction to Programming with C++|Zak, Diane|9781285061474\n2006|Pearson College Div|Data Structures And Algorithm Analysis in C++|Weiss, Mark Allen|9780321441461\n2011|Jones & Bartlett Learning|C++ Plus Data Structures|Dale, Nell|9781449646752\n2004|Addison-Wesley Professional|Developing Series 60 Applications: A Guide for Symbian OS C++ Developers: A Guide for Symbian OS C++ Developers|Edwards, Leigh and Barker, Richard and Staff of EMCC Software Ltd.|9780321227225\n1997|Addison-Wesley Professional|The C++ Programming Language (3rd Edition)|Stroustrup, Bjarne|9780201889543\n2012|PEARSON INDIA|C++ Standard Library, The: A Tutorial And Reference 2Nd Edition|NICOLAI M JOSUTTIS|9780321623218\n2012|Pearson|Starting Out with Games & Graphics in C++|Gaddis, Tony|9780133128079\n2008|Addison Wesley|Problem Solving with C++|Savitch, Walter|9780321531346\n2009|Jones & Bartlett Learning|Programming And Problem Solving With C++|Dale, Nell|9780763771560\n2009|Course Technology|Introduction to C++ Programming, Brief Edition|D. S. Malik|9781423902461\n2008|Addison-Wesley Professional|Programming: Principles and Practice Using C++|Stroustrup, Bjarne|9780321543721\n2008|Cengage Learning|C++ Programming: From Problem Analysis to Program Design|Malik, D. S.|9781423902096\n1998|Pearson|An Introduction to Computing Using C++ and Object Technology|Ford, William H. and Topp, William R.|9780132681520\n2004|Addison-Wesley Professional|C++ Template Metaprogramming|Abrahams, David|9780321227256\n2017|Cengage Learning|C++ Programming: Program Design Including Data Structures (MindTap Course List)|Malik, D. S.|9781337117562\n2012|Course Technology|C++ Programs to Accompany Programming Logic and Design|Smith, Jo Ann|9781133525806\n2011|Wiley|C++ for Everyone|Horstmann, Cay S.|9780470920923\n2010|Cengage Learning|C++ Programming: From Problem Analysis to Program Design (Introduction to Programming)|Malik, D. S.|9780538798082\n2000|Course Technology|Understanding Programming: An Introduction Using C++|Cannon, Scott R.|9780534379759\n2009|Pearson|Absolute C++ (4th Edition)|Savitch, Walter|9780136083818\n1994|Mcgraw-Hill Osborne Media|C++ from the Ground Up: Learn C++ from the Master|Schildt, Herbert|9780078819698\n2019|Packt Publishing|Hands-On Embedded Programming with C++17: Create versatile and robust embedded solutions for MCUs and RTOSes with modern C++|Posch, Maya|9781788629300\n2013|Pearson|C++ How to Program plus MyProgrammingLab with Pearson eText -- Access Card Package (9th Edition)|Deitel, Paul and Deitel, Harvey|9780133450736\n2008|Prentice Hall|C++ GUI Programming with Qt 4 (2nd Edition) (Prentice Hall Open Source Software Development Series)|Blanchette, Jasmin and Summerfield, Mark|9780132354165\n2003|McGraw-Hill Education|C++ from the Ground Up, Third Edition|Schildt, Herbert|9780072228977\n2008|Cengage Learning|Object-Oriented Programming Using C++ (Introduction to Programming)|Farrell, Joyce|9781423902577\n2017|Pearson|Problem Solving with C++ Plus MyLab Programming with Pearson eText -- Access Card Package|Savitch, Walter|9780134710747\n2007|Prentice Hall|C++ How to Program (6th Edition)|Deitel, Paul J.|9780136152507\n1992|Addison-Wesley Pub (Sd)|Algorithms in C++|Sedgewick, Robert|9780201510591\n2005|Wrox|Professional C++|Solter, Nicholas A. and Kleper, Scott J.|9780764574849\n2003|Cambridge University Press|Parallel Scientific Computing in C++ and MPI: A Seamless Approach to Parallel Algorithms and their Implementation|Karniadakis, George Em|9780521520805\n2006|Prentice Hall PTR|C++ GUI Programming with Qt 4|Blanchette, Jasmin and Summerfield, Mark|9780131872493\n2005|Addison-Wesley Professional|C++ Primer|Lippman, Stanley B. and Lajoie, Josee and Moo, Barbara E.|9780201721485\n1995|Computing McGraw-Hill|Enough Rope to Shoot Yourself in the Foot: Rules for C and C++ Programming (Unix/C)|Holub, Allen I.|9780070296893\n2004|Course Technology|Assembly Language and Computer Architecture Using C++ and Java™|Dos Reis, Anthony J.|9780534405274\n1999|Addison-Wesley Professional|Advanced CORBA® Programming with C++|Henning, Michi and Vinoski, Steve|9780201379273\n2009|Pearson|Introduction to Programming with C++ (2nd Edition)|Liang, Y. Daniel|9780136097204\n1989|Pearson Ptr|Programming in C++|Dewhurst, Stephen|9780137231560\n2011|In Easy Steps Limited|C++ Programming in easy steps|McGrath, Mike|9781840784329\n2002|Addison-Wesley Professional|C++ Gotchas: Avoiding Common Problems in Coding and Design|Dewhurst, Stephen C.|9780321125187\n2017|Pearson|MyLab Programming with Pearson eText -- Access Card -- for Starting Out with C++ from Control Structures to Objects (My Programming Lab)|Gaddis, Tony|9780134484198\n1994|Macmillan Coll Div|Object Oriented Programming In C++|Johnsonbaugh, Richard and Kalin, Martin|9780023606823\n2010|Wrox|Ivor Horton's Beginning Visual C++ 2010|Horton, Ivor|9780470500880\n2008|Pearson|C++ Programming And Fundamental Concepts|Anderson Jr., Arthur E.|9780131182660\n2009|For Dummies|C++ All-In-One Desk Reference For Dummies|Mueller, John Paul and Cogswell, Jeff|9780470317358\n1996|Addison-Wesley Professional|Inside the C++ Object Model|Lippman, Stanley B.|9780201834543\n2013|Packt Publishing|Boost.Asio C++ Network Programming|Torjo, John|9781782163268\n2002|Addison-Wesley Professional|C++ Network Programming, Volume 2: Systematic Reuse with ACE and Frameworks|Debbie Lafferty and Schmidt, Douglas and Huston, Stephen|9780201795257\n1999|Addison-Wesley Professional|Essential C++|Lippman, Stanley B.|9780201485189\n2016|Packt Publishing|Beginning C++ Game Programming|Horton, John|9781786466198\n1998|Oxford University Press|An Introduction to C++ and Numerical Methods|Ortega, James M. and Grimshaw, Andrew S.|9780195117677\n2014|Pearson|Mylab Programming with Pearson Etext -- Access Card -- For Problem Solving with C++|Savitch, Walter|9780133834413\n1998|Sams|The Waite Group's Object-Oriented Programming in C++|Lafore, Robert and Waite Group|9781571691606\n2008|Packt Publishing|Microsoft Visual C++ Windows Applications by Example: Code and explanation for real-world MFC C++ Applications|Stefan Björnander|9781847195562\n2002|Prentice Hall|C++ How to Program (4th Edition)|Deitel, Harvey M. and Deitel, Paul J.|9780130384744\n1998|Addison-Wesley Professional|C++ For C Programmers, Third Edition (3rd Edition)|Pohl, Ira|9780201395198\n2012|Cambridge University Press|Numerical Methods in Finance with C++ (Mastering Mathematical Finance)|Capinski, Maciej J.|9780521177160\n2002|Wiley|Object-Oriented Programming in C++|Josuttis, Nicolai M.|9780470843994\n2006|Cengage Learning PTR|Beginning C++ Through Game Programming, Second Edition|Dawson, Michael|9781598633603\n2005|Peachpit Pr|C++ Programming|Ullman, Larry E. and Signer, Andreas|9780321356567\n2015|Apress|Advanced Metaprogramming in Classic C++|Di Gennaro, Davide|9781484210116\n1998|Waite Group Pr|C++ Primer Plus (Mitchell Waite Signature Series)|Prata, Stephen|9781571691316\n2018|Packt Publishing|Expert C++ Programming: Leveraging the power of modern C++ to build scalable modular applications|Swaminathan, Jeganathan and Posch, Maya and Galowicz, Jacek|9781788831390\n1995|O'Reilly & Associates|C++ The Core Language: A Foundation for C Programmers (Nutshell Handbooks)|Brown, Doug and Satir, Gregory|9781565921160\n1999|Microsoft Press|Learn Microsoft Visual C++ 6.0 Now|Sphar, Chuck|9781572319653\n2015|Pearson|Mylab Programming with Pearson Etext -- Access Code Card -- For Absolute C++|Savitch, Walter and Mock, Kenrick|9780134254005\n1995|McGraw-Hill College|Programming With Class: Introduction To Computer Science With C++|Kamin, Samuel N. and Reingold, Edward M.|9780070518339\n2005|Addison-Wesley Professional|C++ Common Knowledge: Essential Intermediate Programming: Essential Intermediate Programming|Dewhurst, Stephen|9780321321923\n2005|Charles River Media|C++ Standard Library Practical Tips (Programming Series)|Reese, Greg|9781584504009\n2001|Sams|Sams Teach Yourself C++ in 21 Days (Sams Teach Yourself...in 21 Days)|Liberty, Jesse|9780672320729\n2000|Microsoft Press|Microsoft Mastering: MFC Development Using Microsoft Visual C++ 6.0 (DV-DLT Mastering)|Microsoft Press|9780735609259\n2001|Addison-Wesley Professional|C++ Network Programming, Volume I: Mastering Complexity with ACE and Patterns: Mastering Complexity with ACE and Patterns|Schmidt, Douglas and Huston, Stephen|9780201604641\n2018|Manning Publications|Functional Programming in C++: How to improve your C++ programs using functional techniques|Cukic, Ivan|9781617293818\n2006|A-list Publishing|Hackish C++ Games & Demos|Michael Flenov|9781931769587\n1998|Sigs|Using Motif With C++ (sigs: Advances In Object Technology)|Daniel J. Bernstein|9780132073905\n2001|Irwin Professional Publishing|C++ Program Design|Davidson|9780072411638\n1989|Addison-Wesley|C++ primer|Lippman, Stanley B|9780201164879\n1996|Jones & Bartlett Pub|Programming and Problem Solving With C++|Dale, Nell B. and Weems, Chip and Headington, Mark and Dale, Nell|9780763702922\n2021|Reema Thareja|Object Oriented Programming With C++|OXFORD UNIVERSITY PRESS and OXFORD UNIVERSITY PRESS and OXFORD UNIVERSITY PRESS|9780199459636\n2005|For Dummies|C++ Timesaving Techniques For Dummies|Telles, Matthew|9780764579868\n2021|Prentice Hall of India|Unix System Programming Using C++|Chan, Terrence|9788120314689\n1992|Que Pub|C++ by Example (Programming Series)|Perry, Greg M.|9781565290389\n1996|Mcgraw-Hill|Schaum's Outlines - Programming With C++|Hubbard, John R. and Hubbard, John R.|9780070308374\n1994|Wiley|Programming for Graphics Files: In C and C++|Levine, John R. and Levine, John|9780471598565\n2020|Apress|Modern C++ for Absolute Beginners: A Friendly Introduction to C++ Programming Language and C++11 to C++20 Standards|Dmitrović, Slobodan|9781484260463\n2003|Jones And Bartlett Publishers|C++ Plus Data Structures|Dale, Nell|9780763704810\n2016|Packt Publishing|C++ Windows Programming|Bjornander, Stefan|9781786464224\n2007|Course Technology|An Introduction to Programming With C++ (Available Titles Skills Assessment Manager (SAM) - Office 2010)|Zak, Diane|9781418836184\n2007|Springer|Introduction to C++ Programming and Graphics|Pozrikidis, Constantine|9780387689920\n1994|Morgan Kaufmann Pub|Windows Animation Programming With C++|Young, Michael J.|9780127737508\n2006|Addison Wesley|Problem Solving, Abstraction & Design Using C++ (5th Edition)|Friedman, Frank L. and Koffman, Elliot B.|9780321450050\n2006|Oxford University Press|Object-Oriented Programming with C++ (Oxford Higher Education)|Sahay, Sourav|9780195681529\n2013|Addison-Wesley Professional|C++ Programming Language, The|Bjarne, Stroustrup|9780133522853\n2001|Pearson|C++ Programming with Design Patterns Revealed|Muldner, Tomasz|9780201722314\n1999|Wiley|Speech Recognition: Theory and C++ Implementation|Becchetti, Claudio and Ricotti, Lucio Prina|9780471977308\n1999|McGraw-Hill|Schaum's Easy Outline: Programming with C++|Hubbard, John R.|9780070527133\n1996|Prentice Hall|C++ and Object Oriented Programming|Irvine, Kip R.|9780023598524\n1999|Pearson|Object-Oriented Programming in C++ (2nd Edition)|Johnsonbaugh, Richard and Kalin, Martin|9780130158857\n2015|Apress|Practical C++ Financial Programming|Oliveira, Carlos|9781430267157\n2012|Wrox|Ivor Horton's Beginning Visual C++ 2012|Horton, Ivor|9781118368084\n2004|Wiley|Financial Instrument Pricing Using C++|Duffy, Daniel J.|9780470855096\n1999|Sams|Sams Teach Yourself C++ in 21 Days, Third Edition|Liberty, Jesse|9780672315152\n2005|Course Technology|Program Development and Design Using C++|Bronson, Gary J.|9780619216771\n1995|Wiley-interscience|A Jump Start Course In C++ Programming|James W. Cooper and Richard B. Lam|9780471031710\n1993|Que Pub|Borland C++ Power Programming/Book and Disk|Walnum, Clayton|9781565291720\n1999|Que Pub|Practical C++|McGregor, Robert W.|9780789721440\n2008|Prentice Hall In Association With Trolltech Press|C++ Gui Programming With Qt 4|Blanchette, Jasmin.|9780137143979\n2005|Addison Wesley|Starting Out With C++: Brief Version Update, Visual C++ .net (4th Edition)|Tony Gaddis and Barret Krupnow|9780321419613\n1997|TBS|Object-oriented Programming with C++|E Balagurusamy|9780074620380\n2008|In Easy Steps Limited|C++ Programming In Easy Steps|McGrath, Mike|9781840783520\n1996|Addison-Wesley|Stl Tutorial & Reference Guide: C++ Programming With the Standard Template Library (Addison-Wesley Professional Computing Series)|Musser, David R. and Saini, Atul|9780201633986\n2016|Packt Publishing|Boost.Asio C++ Network Programming Cookbook: Over 25 hands-on recipes to create robust and highly-effi cient cross-platform distributed applications with the Boost.Asio library|Radchuk, Dmytro|9781783986545\n2000|Scott Jones|Starting Out With The C++ (2nd Brief Edition)|Tony Gaddis|9781576760406\n2019|BPB Publications|Data Structures Through C++: Experience Data Structures C++ through animations|Kanetkar, Yashavant|9789388511360", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1986|C++ Programming Language|10.1002/9781118361054.ch3|7014|230|B. Stroustrup|c04e29b09f67158e7c4405ddad18108a1ddecbd4\n2018|TOPAS and TOPAS-Academic: an optimization program integrating computer algebra and crystallographic objects written in C++|10.1107/S1600576718000183|627|27|A. Coelho|f24ca222ed1a87ff7892d5bf969643eb240e86b3\n1991|Advanced C++ Programming Styles and Idioms|10.1109/TOOLS.1997.681881|468|14|J. Coplien|20627f2ad92cf787efb4ec960e49b89d10bb4529\n2000|Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language|10.1006/jsco.2001.0494|389|39|Christian Bauer and A. Frink and R. Kreckel|5b2f780c3ce63f1795bbfa6e3e7e22d8ae5e268b\n2004|Supporting Students in C++ Programming Courses with Automatic Program Style Assessment|10.28945/300|84|6|Kirsti Ala-Mutka and Toni Uimonen and Hannu-Matti Järvinen|7880378ba289053eadf19cb03ce2f543616a2b53\n1999|An Overview of the C++ Programming Language|10.1201/9781420049114.sec3|24|3|B. Stroustrup|eb331db6ec60d64b9e0d90978ee7398d9e2f0605" }, "cql": { "title": "cql", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/20a10f4140ae568527c3de5603300e7b1ec6caa9" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "wikipedia": { "related": [ "cypher" ], "summary": "As an abbreviation, CQL can refer to: Chess Query Language, a query language for interrogating chess databases Contextual Query Language (or common query language), for information retrieval Cassandra Query Language, for Apache Cassandra Classora Query Language, for Classora Knowledge Base CIM Query Language, a query language for the Common Information Model (CIM) standard from the Distributed Management Task Force (DMTF) Cypher Query Language a declarative graph query language that allows for expressive and efficient querying and updating of a property graph.", "backlinksCount": 6, "pageId": 9672354, "dailyPageViews": 6, "created": 2007, "url": "https://en.wikipedia.org/wiki/CQL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5568", "centralPackageRepositoryCount": 0 }, "cqlf": { "title": "CQLF", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8589fd3f54e4e5598b5e5b73f8a9bc35df77e7e3" ], "country": [ "United States" ], "originCommunity": [ "Computer Corporation of America" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5596", "centralPackageRepositoryCount": 0 }, "cqlpp": { "title": "CQL++", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7dcdc97759ffb864694092473bc03512e9648858" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5753", "centralPackageRepositoryCount": 0 }, "crack": { "title": "crack", "appeared": 2011, "type": "pl", "website": "http://crack-lang.org", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/crack-lang" ], "domainName": { "name": "crack-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n12016563|The Crack Programming Language|http://crack-lang.org/index.html|2016-07-01 15:00:59 UTC|1467385259|PuerkitoBio|0|2" }, "cram-format": { "title": "CRAM file format", "appeared": 2011, "type": "binaryDataFormat", "description": "CRAM files typically vary from 30 to 60% smaller than BAM, depending on the data held within them.", "country": [ "Canada" ], "originCommunity": [ "Global Alliance for Genomics and Health" ], "wikipedia": { "related": [ "sam-format", "bam-format", "python", "java", "c" ], "summary": "CRAM is a compressed columnar file format for storing biological sequences aligned to a reference sequence, initially devised by Markus Hsi-Yang Fritz et al.CRAM was designed to be an efficient reference-based alternative to the Sequence Alignment Map (SAM) and Binary Alignment Map (BAM) file formats. It optionally uses a genomic reference to describe differences between the aligned sequence fragments and the reference sequence, reducing storage costs. Additionally each column in the SAM format is separated into its own blocks, improving compression ratio. CRAM files typically vary from 30 to 60% smaller than BAM, depending on the data held within them.", "backlinksCount": 12, "pageId": 58749955, "created": 2018, "revisionCount": 19, "dailyPageViews": 23, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/CRAM_(file_format)" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "cran-pm": { "title": "cran-pm", "appeared": 1993, "type": "packageManager", "website": "https://cran.r-project.org/", "reference": [ "https://en.wikipedia.org/wiki/R_(programming_language)#CRAN" ], "country": [ "Austria" ], "originCommunity": [ "Vienna University of Economics", "Business" ], "domainName": { "name": "cran.r-project.org" }, "packageCount": 13674, "forLanguages": [ "r" ] }, "cranelift-ir": { "title": "Cranelift", "appeared": 2016, "type": "ir", "creators": [ "Jakob Olesen" ], "website": "https://cranelift.readthedocs.io/en/latest/ir.html", "country": [ "Various" ], "originCommunity": [ "https://github.com/CraneStation/" ], "githubRepo": { "firstCommit": 2016, "stars": 2474, "forks": 211, "subscribers": 94, "created": 2016, "updated": 2022, "description": "Cranelift code generator", "issues": 0, "url": "https://github.com/CraneStation/cranelift" }, "repoStats": { "firstCommit": 2016, "commits": 3172, "committers": 139, "files": 1 } }, "crates-pm": { "title": "crates-pm", "appeared": 2014, "type": "packageManager", "website": "https://crates.io/", "country": [ "Various" ], "originCommunity": [ "https://github.com/rust-lang" ], "domainName": { "registered": 2014, "awisRank": { "2022": 55057 }, "name": "crates.io" }, "packageCount": 22486, "packageInstallCount": 770549116, "forLanguages": [ "rust" ] }, "creative-basic": { "title": "Creative Basic", "appeared": 2008, "type": "pl", "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "'" ] ], "wikipedia": { "example": [ "def w:WINDOW\ndef wstyle:INT\n\nwstyle = @SIZE|@MINBOX|@MAXBOX\n\nWINDOW w,50,50,800,600,wstyle,0,\"Window Title\",main\nSETWINDOWCOLOR w,RGB(0,0,90)\n\nCONTROL w,\"B,Exit,(800-80)/2, 500, 80, 40, 0, 1\"\n\nWAITUNTIL w = 0\nEND\n\nSUB main\nSELECT @CLASS\n\tcase @IDCLOSEWINDOW\n\t\tclosewindow w\n' clicking the Exit button ...\n\tcase @IDCONTROL\n\t\tselect @CONTROLID\n\t\t\tcase 1\n\t\t\t\tclosewindow w\n\t\tendselect\nendselect\nRETURN" ], "summary": "Creative Basic (CB) is a third-generation event-driven programming language for Windows, with an integrated development environment (IDE). Current version executables are interpreted and require no runtime libraries be installed on the end-user's computer. A planned future version will have compiled executables. Creative Basic has an extensive command set, and access to the application programming interface (API) libraries available in the Microsoft Windows operating system. Although this modern version dates from 2007, it is a development from, and is completely compatible with IBasic, which has been in use worldwide since 2002. Some notable projects are Jerry Muelver's WikiWriter, a WikiWriter to Chm Wizard by Alyce Watson, and Mike Rainey's manufacturing engineering programs. (see the Links below).", "created": 2008, "backlinksCount": 5, "pageId": 20125093, "revisionCount": 16, "dailyPageViews": 3, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Creative_Basic" }, "centralPackageRepositoryCount": 0 }, "crema": { "title": "Crema", "appeared": 2014, "type": "pl", "creators": [ "Jacob Torrey", "Jared Wright" ], "description": "Crema is a LLVM front-end that aims to specifically execute in sub-Turing Complete space. Designed to be simple to learn, and practical for the majority of programming tasks needed, Crema can restrict the computational complexity of the program to the minimum needed to improve security.", "website": "https://github.com/ainfosec/crema/wiki", "country": [ "United States" ], "originCommunity": [ "Assured Information Security, Inc." ], "keywords": [ "as", "bool", "break", "char", "def", "double", "else", "eq", "extern", "false", "foreach", "ge", "gt", "if", "int", "le", "lt", "neq", "return", "sdef", "string", "struct", "true", "uint", "void" ], "example": [ "def int binarySearch(int values[], int searchTarget){\n int upperBound = list_length(values) - 1 # Upper index of seach region\n int lowerBound = 0 # Lower index of seach region\n int delta = list_length(values) # Distance between upperBound and lowerBound\n int middleValueIndex = 0 # Mid-point index between upper and lower bounds\n int middleValue = 0 # Value at the mid-point index\n int foundIndex = -1 # The index of the target number after finding\n\n foreach(values as value){\n # Check middle value to see if it matches target number\n middleValueIndex = ((upperBound + lowerBound) / 2)\n middleValue = values[middleValueIndex]\n if(middleValue == searchTarget){\n foundIndex = middleValueIndex\n break\n }\n\n #Re-adjust the lower and upper bounds for next itteration\n if(middleValue >= searchTarget){\n upperBound = middleValueIndex - 1\n }else{\n lowerBound = middleValueIndex + 1\n }\n delta = upperBound - lowerBound\n }\n return foundIndex\n}" ], "githubRepo": { "stars": 64, "forks": 11, "subscribers": 14, "created": 2014, "updated": 2015, "description": "Crema: A Sub-Turing Programming Language ", "url": "https://github.com/ainfosec/crema" }, "repoStats": { "firstCommit": 2014, "commits": 317, "committers": 6, "files": 84 } }, "creole": { "title": "Creole", "appeared": 2007, "type": "textMarkup", "description": "Creole is a lightweight markup language, aimed at being a common markup language for wikis, enabling and simplifying the transfer of content between different wiki engines.", "country": [ "Denmark" ], "originCommunity": [ "International Symposium on Wikis" ], "example": [ "* Bullet list\n* Second item\n** Sub item\n\n# Numbered list\n# Second item\n## Sub item" ], "wikipedia": { "example": [ "|= |= table |= header |\n| a | table | row |\n| b | table | row |" ], "related": [ "xml", "mediawiki", "tiddlywiki" ], "summary": "Creole is a lightweight markup language, aimed at being a common markup language for wikis, enabling and simplifying the transfer of content between different wiki engines.", "pageId": 20480609, "created": 2008, "backlinksCount": 52, "revisionCount": 91, "dailyPageViews": 59, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Creole_(markup)" }, "githubLanguage": { "fileExtensions": [ "creole" ], "trendingProjectsCount": 0, "type": "prose", "aceMode": "text", "tmScope": "text.html.creole", "wrap": true, "repos": 0, "id": "Creole" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2018, "committerCount": 3, "commitCount": 17, "sampleCount": 1, "example": [ "= Creole\n\nCreole is a Creole-to-HTML converter for Creole, the lightweight markup\nlanguage (http://wikicreole.org/). Github uses this converter to render *.creole files.\n\nProject page on github:\n\n* http://github.com/minad/creole\n\nTravis-CI:\n\n* https://travis-ci.org/minad/creole\n\nRDOC:\n\n* http://rdoc.info/projects/minad/creole\n\n== INSTALLATION\n\n{{{\ngem install creole\n}}}\n\n== SYNOPSIS\n\n{{{\nrequire 'creole'\nhtml = Creole.creolize('== Creole text')\n}}}\n\n== BUGS\n\nIf you found a bug, please report it at the Creole project's tracker\non GitHub:\n\nhttp://github.com/minad/creole/issues\n\n== AUTHORS\n\n* Lars Christensen (larsch)\n* Daniel Mendler (minad)\n\n== LICENSE\n\nCreole is Copyright (c) 2008 - 2013 Lars Christensen, Daniel Mendler. It is free software, and\nmay be redistributed under the terms specified in the README file of\nthe Ruby distribution.\n" ], "url": "https://github.com/Siddley/Creole" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "crmsh": { "title": "crmsh", "appeared": 2008, "type": "pl", "creators": [ "Dejan Muhamedagic" ], "description": "crmsh is a cluster management shell for the Pacemaker High Availability stack.", "website": "http://crmsh.github.io/", "country": [ "Various" ], "originCommunity": [ "https://github.com/ClusterLabs/" ], "domainName": { "name": "crmsh.github.io" }, "githubRepo": { "firstCommit": 2008, "stars": 115, "forks": 81, "subscribers": 29, "created": 2014, "updated": 2022, "description": "Command-line interface for High-Availability cluster management on GNU/Linux systems.", "issues": 95, "url": "https://github.com/ClusterLabs/crmsh" }, "repoStats": { "firstCommit": 2008, "commits": 5832, "committers": 84, "files": 423 }, "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "crmsh", "pcmk" ], "id": "Crmsh" } }, "croc": { "title": "Croc", "appeared": 2006, "type": "pl", "creators": [ "Jarrett Billingsley" ], "description": "Croc is a small, dynamically-typed language most closely related to Lua, with C-style syntax. Its semantics are borrowed mainly from Lua, D, Squirrel, and Io, though many other languages served as inspirations.", "website": "https://web.archive.org/web/20120625151120/http://jfbillingsley.com/croc/", "oldName": "minid", "country": [ "United States" ], "originCommunity": [ "http://www.dsource.org/projects/minid" ], "related": [ "minid" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F][0-9a-fA-F_]*", "value": true }, "hasFloats": { "example": "// ([0-9][0-9_]*)(?=[.eE])(\\.[0-9][0-9_]*)?([eE][+\\-]?[0-9_]+)?", "value": true }, "hasIntegers": { "example": "// ([0-9][0-9_]*)(?![.eE])", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01][01_]*", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "example": [ "module samples.interfaces\n\nclass Method\n{\n _name\n _numParams\n\n this(name: string, numParams: int)\n {\n :_name = name\n :_numParams = numParams\n }\n\n function name() =\n :_name\n\n function implements(f: function) =\n f.numParams() == :_numParams\n\n function toString() =\n \"{} ({} params)\".format(:_name, :_numParams)\n}\n\nclass Interface\n{\n _name\n _methods\n _implementors\n\n this(name: string, methods: array)\n {\n if(!methods.all(\\m -> m as Method))\n throw TypeError(\"All methods must be Methods\")\n\n :_name = name\n :_methods = methods.dup()\n :_implementors = {}\n }\n\n function implement(T: class)\n {\n foreach(m; :_methods)\n {\n local name = m.name()\n\n if(!hasMethod(T, name) || !m.implements(T.(name)))\n throw TypeError(\"Class {} does not implement method '{}' from {}\".format(nameOf(T), m, :_name))\n }\n\n :_implementors[T] = true\n }\n\n function opCall(val: instance)\n {\n if(superOf(val) not in :_implementors)\n :implement(superOf(val))\n\n return true\n }\n}\n\nfunction implements(T: class, vararg)\n{\n for(i; 0 .. #vararg)\n {\n local p = vararg[i]\n\n if(!(p as Interface))\n throw TypeError(\"All varargs must be Interfaces\")\n\n p.implement(T)\n }\n\n return T\n}\n\nlocal IStream = Interface(\"IStream\",\n[\n Method(\"read\", 3)\n Method(\"write\", 3)\n Method(\"seek\", 2)\n])\n\nclass DerpStream\n{\n function read(m, offset, size) {}\n function write(m, offset, size) {}\n function seek(offset, whence) {}\n}\n\nfunction streamSomething(s: @IStream)\n{\n s.read()\n writeln(\"yay!\")\n}\n\nfunction main()\n{\n local d = DerpStream()\n streamSomething(d)\n}" ], "githubRepo": { "stars": 74, "forks": 11, "subscribers": 9, "created": 2006, "updated": 2017, "description": "Croc is an extensible extension language in the vein of Lua, which also wishes it were a standalone language. Also it's fun. ", "url": "https://github.com/JarrettBillingsley/Croc" }, "repoStats": { "firstCommit": 2006, "commits": 1481, "committers": 2, "files": 226 }, "wikipedia": { "example": [ "function first(x: array|string) = x[0]\n\n writeln(first([1, 2, 3])) // prints 1\n writeln(first(\"hello\")) // prints h\n writeln(first(45)) // error, invalid parameter type 'int'" ], "related": [ "d", "lua", "squirrel", "python", "io", "ecmascript", "c" ], "summary": "The MiniD (has been renamed Croc) programming language is a small, lightweight, extension language in the vein of Lua or Squirrel, but designed to be used mainly with the D programming language. It supports both object-oriented and imperative programming paradigms, as well as some simple functional aspects. Distributed under the licence of zlib/libpng, MiniD is free software.", "pageId": 10965409, "created": 2007, "backlinksCount": 8, "revisionCount": 39, "dailyPageViews": 13, "appeared": 2006, "url": "https://web.archive.org/web/20190311032913/https://en.wikipedia.org/wiki/MiniD" }, "pygmentsHighlighter": { "filename": "d.py", "fileExtensions": [ "croc" ], "id": "Croc" } }, "croma": { "title": "Croma", "appeared": 2005, "type": "pl", "country": [ "Ireland" ], "originCommunity": [ "http://patrickcollison.com/" ], "wikipedia": { "summary": "Croma may refer to: Croma (programming language), a dialect of the Lisp programming language Cromā, an Indian retailer of consumer electronics Giulio Croma (died 1632), an Italian painter Fiat Croma, a car Italian for an eighth note in music", "created": 2014, "backlinksCount": 15, "pageId": 41775380, "revisionCount": 3, "dailyPageViews": 32, "url": "https://en.wikipedia.org/wiki/Croma" }, "centralPackageRepositoryCount": 0 }, "crush": { "title": "crush", "appeared": 2020, "type": "pl", "creators": [ "Axel Liljencrantz" ], "description": "Crush is an attempt to make a traditional command line shell that is also a modern programming language. It has the features one would expect from a modern programming language like a type system, closures and lexical scoping, but with a syntax geared toward both batch and interactive shell usage.", "reference": [ "https://news.ycombinator.com/item?id=24079001" ], "country": [ "Sweden" ], "originCommunity": [ "https://github.com/liljencrantz/" ], "related": [ "powershell" ], "githubRepo": { "firstCommit": 2019, "stars": 1804, "forks": 38, "subscribers": 22, "created": 2019, "updated": 2022, "description": "Crush is a command line shell that is also a powerful modern programming language.", "issues": 18, "url": "https://github.com/liljencrantz/crush" }, "repoStats": { "firstCommit": 2019, "commits": 708, "committers": 13, "files": 225 }, "isbndb": "year|publisher|title|authors|isbn13\n2015|Createspace Independent Publishing Platform|Php Programming: Learn Php Programming: - Crush It In One Day. Learn It Fast. Learn It Once. Get Coding Today.|Giggle Publishing|9781517659738\n|James Bolt|Python Data Science: Deep Learning Guide for Beginners with Data Science. Python Programming and Crush Course||9781667151342\n|James Bolt|Python Data Science: Deep Learning Guide for Beginners with Data Science. Python Programming and Crush Course||9781667151274" }, "cryptol": { "title": "Cryptol", "appeared": 2014, "type": "pl", "creators": [ "Adam C. Foltzer" ], "website": "https://galois.com/", "country": [ "United States" ], "originCommunity": [ "Galois,Inc" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2014, "stars": 1014, "forks": 111, "subscribers": 59, "created": 2014, "updated": 2022, "description": "Cryptol: The Language of Cryptography", "issues": 171, "url": "https://github.com/GaloisInc/cryptol" }, "repoStats": { "firstCommit": 2014, "commits": 4534, "committers": 84, "files": 1517 }, "wikipedia": { "summary": "Cryptol is a domain specific programming language for cryptography developed by the Portland, Oregon based software development firm, Galois, Inc.. The language was originally developed for use by the United States National Security Agency. The language is also used by private firms that provide information technology systems, such as the American company Rockwell Collins provides to aerospace and defense contractors in the United States.The programming language is used for all aspects of developing and using cryptography, such as the design and implementation of new ciphers and the verification of existing cryptographic algorithms. Cryptol is designed to allow the cryptographer to watch how stream processing functions in the program manipulate the ciphers or encryption algorithms.", "pageId": 20921449, "created": 2008, "backlinksCount": 28, "revisionCount": 64, "dailyPageViews": 10, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Cryptol" }, "pygmentsHighlighter": { "filename": "haskell.py", "fileExtensions": [ "cry" ], "id": "Cryptol" }, "leachim6": { "filepath": "c/Cryptol", "example": [ ":set ascii=on\n\"Hello World\"" ], "id": "Cryptol" }, "tryItOnline": "cryptol", "jupyterKernel": [ "https://github.com/GaloisInc/ICryptol" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "crystal": { "title": "Crystal", "appeared": 2014, "type": "pl", "creators": [ "Ary Borenszweig", "Juan Wajnerman", "Brian Cardiff" ], "website": "https://crystal-lang.org", "webRepl": [ "https://play.crystal-lang.org/#/cr" ], "documentation": [ "https://crystal-lang.org/reference/1.6/index.html", "https://devdocs.io/crystal/" ], "fileExtensions": [ "cr" ], "country": [ "Argentina and Germany and Turkey" ], "originCommunity": [ "https://forum.crystal-lang.org/" ], "domainName": { "registered": 2013, "awisRank": { "2017": 299324, "2022": 387907 }, "name": "crystal-lang.org" }, "releaseNotesUrl": "https://github.com/crystal-lang/crystal/blob/master/CHANGELOG.md", "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasImports": { "example": "require \"../../spec_helper\"", "value": true }, "hasClasses": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "puts" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "includeToken": [ [ "require" ] ], "keywords": [ "abstract", "do", "if", "nil?", "self", "unless", "alias", "else", "in", "of", "sizeof", "until", "as", "elsif", "include", "out", "struct", "when", "as?", "end", "instance_sizeof", "pointerof", "super", "while", "asm", "ensure", "is_a?", "private", "then", "with", "begin", "enum", "lib", "protected", "true", "yield", "break", "extend", "macro", "require", "type", "case", "false", "module", "rescue", "typeof", "class", "for", "next", "return", "uninitialized", "def", "fun", "nil", "select", "union" ], "gource": "https://www.youtube.com/watch?v=YToY_0fhEzc", "githubRepo": { "stars": 17909, "forks": 1367, "subscribers": 416, "created": 2012, "updated": 2022, "firstCommit": 2012, "description": "The Crystal Programming Language", "issues": 1520, "url": "https://github.com/crystal-lang/crystal" }, "repoStats": { "firstCommit": 2012, "commits": 15519, "committers": 602, "files": 2191 }, "wikipedia": { "example": [ "channel = Channel(Int32).new\n\nspawn do\n puts \"Before first send\"\n channel.send(1)\n puts \"Before second send\"\n channel.send(2)\nend\n\nputs \"Before first receive\"\nvalue = channel.receive\nputs value # => 1\n\nputs \"Before second receive\"\nvalue = channel.receive\nputs value # => 2" ], "related": [ "ia-32", "freebsd", "ruby", "c", "rust", "go", "csharp", "python", "llvmir", "csp" ], "summary": "In computer software programming languages, Crystal is a general-purpose, object-oriented programming language, designed and developed by Ary Borenszweig and Juan Wajnerman and more than 200 contributors. With syntax inspired by the language Ruby, it is a compiled language with static type-checking, but specifying the types of variables or method arguments is generally unneeded. Types are resolved by an advanced global type inference algorithm. Crystal is in active development. It is released as free and open-source software under the Apache License version 2.0", "pageId": 48972626, "dailyPageViews": 143, "created": 2016, "backlinksCount": 31, "revisionCount": 95, "appeared": 2014, "fileExtensions": [ "cr" ], "url": "https://en.wikipedia.org/wiki/Crystal_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "cr" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nomarroth invidious https://github.com/omarroth.png https://github.com/omarroth/invidious Crystal #000100 1184 86 154 \"Invidious is an alternative front-end to YouTube\"\ncrystal-lang crystal https://github.com/crystal-lang.png https://github.com/crystal-lang/crystal Crystal #000100 13807 1071 172 \"The Crystal Programming Language\"", "trendingProjectsCount": 3, "type": "programming", "interpreters": [ "crystal" ], "aceMode": "ruby", "codemirrorMode": "crystal", "codemirrorMimeType": "text/x-crystal", "tmScope": "source.crystal", "repos": 7522, "id": "Crystal" }, "githubBigQuery": { "repos": 1197, "users": 767, "id": "Crystal" }, "pygmentsHighlighter": { "filename": "crystal.py", "fileExtensions": [ "cr" ], "id": "Crystal" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 47, "commitCount": 320, "sampleCount": 3, "example": [ "#!/usr/bin/env bin/crystal --run\nrequire \"../../spec_helper\"\n\ndescribe \"Type inference: declare var\" do\n it \"types declare var\" do\n assert_type(\"a :: Int32\") { int32 }\n end\n\n it \"types declare var and reads it\" do\n assert_type(\"a :: Int32; a\") { int32 }\n end\n\n it \"types declare var and changes its type\" do\n assert_type(\"a :: Int32; while 1 == 2; a = 'a'; end; a\") { union_of(int32, char) }\n end\n\n it \"declares instance var which appears in initialize\" do\n result = assert_type(\"\n class Foo\n @x :: Int32\n end\n\n Foo.new\") { types[\"Foo\"] }\n\n mod = result.program\n\n foo = mod.types[\"Foo\"] as NonGenericClassType\n foo.instance_vars[\"@x\"].type.should eq(mod.int32)\n end\n\n it \"declares instance var of generic class\" do\n result = assert_type(\"\n class Foo(T)\n @x :: T\n end\n\n Foo(Int32).new\") do\n foo = types[\"Foo\"] as GenericClassType\n foo_i32 = foo.instantiate([int32] of Type | ASTNode)\n foo_i32.lookup_instance_var(\"@x\").type.should eq(int32)\n foo_i32\n end\n end\n\n it \"declares instance var of generic class after reopen\" do\n result = assert_type(\"\n class Foo(T)\n end\n\n f = Foo(Int32).new\n\n class Foo(T)\n @x :: T\n end\n\n f\") do\n foo = types[\"Foo\"] as GenericClassType\n foo_i32 = foo.instantiate([int32] of Type | ASTNode)\n foo_i32.lookup_instance_var(\"@x\").type.should eq(int32)\n foo_i32\n end\n end\n\n it \"declares an instance variable in initialize\" do\n assert_type(\"\n class Foo\n def initialize\n @x :: Int32\n end\n\n def x\n @x\n end\n end\n\n Foo.new.x\n \") { int32 }\n end\nend\n" ], "url": "https://github.com/atom-crystal/language-crystal" }, "languageServerProtocolProject": [ "https://github.com/kofno/scry\nwrittenIn crystal" ], "projectEuler": { "memberCount": { "2019": 5, "2022": 14 }, "id": "Crystal" }, "helloWorldCollection": [ "# Hello world in Crystal\n\nputs \"Hello World\"" ], "leachim6": { "filepath": "c/Crystal.cr", "fileExtensions": [ "cr" ], "example": [ "puts \"Hello World\"\n" ], "id": "Crystal" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Crystal", "compilerExplorer": { "example": [ "# Type your code here, or load an example.\n\n# compile with --prelude=empty\nfun square(num : Int32) : Int32\n num &* num\nend" ], "id": "Crystal" }, "rijuRepl": { "example": [ "puts \"Hello, world!\"\n" ], "description": "General-purpose, object-oriented programming language with syntax inspired by the language Ruby", "fileExtensions": [ "cr" ], "website": "https://crystal-lang.org/", "gitRepo": "https://github.com/crystal-lang/crystal", "id": "https://riju.codes/crystal" }, "tryItOnline": "crystal", "stackOverflowSurvey": { "2021": { "users": 466, "medianSalary": 72400, "fans": 790, "percentageUsing": 0.01 } }, "officialBlogUrl": [ "https://crystal-lang.org/blog/" ], "faqPageUrl": [ "https://forum.crystal-lang.org/" ], "subreddit": [ { "memberCount": { "2022": 4118 }, "url": "https://reddit.com/r/crystal_programming" } ], "tiobe": { "currentRank": 24, "id": "Crystal" }, "twitter": "https://twitter.com/crystallanguage", "fileType": "text", "wordRank": 2716, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "cs-script": { "title": "CS-Script", "appeared": 2004, "type": "pl", "country": [ "Australia" ], "originCommunity": [ "https://github.com/oleg-shilo" ], "wikipedia": { "related": [ "boo", "visual-studio-editor" ], "summary": "CS-Script (www.csscript.net) is a CLR (Common Language Runtime) based scripting system which uses ECMA-compliant C# as a programming language. CS-Script currently targets Microsoft implementation of CLR (.NET 2.0/3.0/3.5/4.0) and with full support for Mono. CS-Script as well as a few other .NET languages (e.g. Boo) is a statically typed language and it allows unlimited access to .NET/CLR functionality with plain vanilla C# syntax. CS-Script as a scripting environment offers stand alone script execution as well as hosting the script engine from CLR application. Because of statically typed nature of the script execution CS-Script demonstrates no performance degradation comparing to the compiled managed binaries. Existing .NET development tools (e.g. MS Visual Studio, Sharp Develop) can be used, allowing editing and debugging scripts within traditional .NET Development environment. In addition to this in 2013 an Open Source CS-Script plugin for Notepad++ has been made publicly available. CS-Script has been used in a number of open-source and proprietary products of different scale and complexity (e.g. FlashDevelop, MediaPortal). CS-Script is released under the custom \"liberal\" license, which is allows free commercial use and free access to the source code.", "created": 2009, "backlinksCount": 4, "pageId": 23439251, "revisionCount": 32, "dailyPageViews": 14, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/CS-Script" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "csa": { "title": "CodeStudAssembler", "appeared": 2017, "type": "assembly", "reference": [ "https://v8.dev/blog/csa" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/v8" ], "example": [ " test al,0x1\n jz not_string\n movq rbx,[rax-0x1]\n cmpb [rbx+0xb],0x80\n jnc not_string\n movq rax,[rax+0xf]\n retl\nnot_string:\n movq rax,[r13-0x60]\n retl" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "csharp": { "title": "C#", "appeared": 2000, "type": "pl", "creators": [ "Anders Hejlsberg" ], "website": "https://docs.microsoft.com/dotnet/csharp/language-reference/", "documentation": [ "https://learn.microsoft.com/en-us/dotnet/csharp/" ], "emailList": [ "https://www.bouncycastle.org/csharp/mailing_lists.html" ], "spec": "https://learn.microsoft.com/en-us/dotnet/csharp/language-reference/language-specification/introduction", "fileExtensions": [ "cs" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "releaseNotesUrl": "https://learn.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-version-history", "versions": { "2002": [ "1.0" ], "2003": [ "1.2" ], "2005": [ "2.0" ], "2007": [ "3.0" ], "2010": [ "4.0" ], "2012": [ "5.0" ], "2015": [ "6.0" ], "2017": [ "7.0" ], "2019": [ "8.0" ], "2020": [ "9.0" ], "2021": [ "10.0" ], "2022": [ "11.0" ] }, "visualParadigm": false, "hasComments": { "example": "// This is a comment", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasIntegers": { "example": "int pldb = 80766866;", "value": true }, "hasAssignment": { "example": "int pldb = 80766866;", "value": true }, "hasPrintDebugging": { "example": "Console.WriteLine(\"This is C#\");", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasAsyncAwait": { "example": "public async Task FindPageSize(Uri uri) \n{\n byte[] data = await new WebClient().DownloadDataTaskAsync(uri);\n return data.Length;\n}", "value": true }, "hasPointers": { "example": "// Pointers supported only under certain conditions.\n// Get 16 bytes of memory from the process's unmanaged memory\nIntPtr pointer = System.Runtime.InteropServices.Marshal.AllocHGlobal(16);", "value": true }, "hasGenerics": { "example": "// Declare the generic class.\npublic class GenericList\n{\n public void Add(T input) { }\n}\nclass TestGenericList\n{\n private class ExampleClass { }\n static void Main()\n {\n // Declare a list of type int.\n GenericList list1 = new GenericList();\n list1.Add(1);\n\n // Declare a list of type string.\n GenericList list2 = new GenericList();\n list2.Add(\"\");\n\n // Declare a list of type ExampleClass.\n GenericList list3 = new GenericList();\n list3.Add(new ExampleClass());\n }\n}", "value": true }, "hasConstructors": { "example": "public class MyClass\n{\n private int a;\n private string b;\n\n // Constructor\n public MyClass() : this(42, \"string\")\n {\n }\n\n // Overloading a constructor\n public MyClass(int a, string b)\n {\n this.a = a;\n this.b = b;\n }\n}\n// Code somewhere\n// Instantiating an object with the constructor above\nMyClass c = new MyClass(42, \"string\");", "value": true }, "hasGenerators": { "example": "// Method that takes an iterable input (possibly an array)\n// and returns all even numbers.\npublic static IEnumerable GetEven(IEnumerable numbers) {\n foreach (int i in numbers) {\n if ((i % 2) == 0) {\n yield return i;\n }\n }\n}", "value": true }, "hasDirectives": { "example": "#define MAX_CLIENTS 200\nint array[MAX_CLIENTS];\n\n#if PRODUCTION\n//code\n#elif DEVELOPMENT\n//code\n#else\n//code\n#endif", "value": true }, "hasExplicitTypeCasting": { "example": "Animal animal = new Cat();\n\nBulldog b = (Bulldog) animal; // if (animal is Bulldog), stat.type(animal) is Bulldog, else an exception\nb = animal as Bulldog; // if (animal is Bulldog), b = (Bulldog) animal, else b = null\n\nanimal = null;\nb = animal as Bulldog; // b == null", "value": true }, "hasImports": { "example": "using static System.Console;\nusing static System.Math;\nclass Program\n{\n static void Main()\n {\n WriteLine(Sqrt(3*3 + 4*4));\n }\n}", "value": true }, "hasNamespaces": { "example": "namespace MyNamespace;\nclass MyClass\n{\n public void MyMethod()\n {\n System.Console.WriteLine(\"Creating my namespace\");\n }\n}", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasModules": { "example": "// In C#, namespaces are the semi-equivalent of Java's packages.\nnamespace com.test\n{\n class Test {}\n}", "value": true }, "hasDisposeBlocks": { "example": "using (Resource resource = GetResource())\n{\n // Perform actions with the resource.\n ...\n}", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasDefaultParameters": { "example": "public void ExampleMethod(string optionalstr = \"default string\") {}", "value": true }, "hasFunctionComposition": { "example": "// Call example:\n// var c = Compose(f, g);\n//\n// Func g = _ => ...\n// Func f = _ => ...\n\nFunc Compose(Func f, Func g) => _ => f(g(_));", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "Console.WriteLine" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "add", "alias", "as", "ascending", "async", "await", "base", "bool", "break", "byte", "case", "catch", "char", "checked", "class", "const", "continue", "decimal", "default", "delegate", "descending", "do", "double", "dynamic", "else", "enum", "event", "explicit", "extern", "false", "finally", "fixed", "float", "for", "foreach", "from", "get", "global", "goto", "group", "if", "implicit", "in", "int", "interface", "internal", "into", "is", "join", "let", "lock", "long", "namespace", "new", "null", "object", "operator", "orderby", "out", "override", "params", "partial", "private", "protected", "public", "readonly", "record", "ref", "remove", "return", "sbyte", "sealed", "select", "set", "short", "sizeof", "stackalloc", "static", "string", "struct", "switch", "this", "throw", "true", "try", "typeof", "uint", "ulong", "unchecked", "unsafe", "ushort", "using", "value", "var", "virtual", "void", "volatile", "where", "while", "yield" ], "wikipedia": { "example": [ "using System.Windows.Forms;\n\nclass Program\n{\n static void Main(string[] args)\n {\n MessageBox.Show(\"Hello, World!\");\n System.Console.WriteLine(\"Is almost the same argument!\");\n }\n}" ], "related": [ "spec-sharp", "eiffel", "java", "modula-3", "object-pascal", "ml", "visual-basic", "icon", "haskell", "rust", "jsharp", "f-sharp", "chapel", "crystal", "d", "dart", "hack", "kotlin", "monkey", "nemerle", "oxygene", "swift", "vala", "unity-engine", "c", "turbo-pascal", "smalltalk", "linq", "a-sharp", "ada", "cil", "fortran", "visual-studio-editor", "morfik" ], "summary": "C# (pronounced as see sharp) is a multi-paradigm programming language encompassing strong typing, imperative, declarative, functional, generic, object-oriented (class-based), and component-oriented programming disciplines. It was developed by Microsoft within its .NET initiative and later approved as a standard by Ecma (ECMA-334) and ISO (ISO/IEC 23270:2006). C# is one of the programming languages designed for the Common Language Infrastructure. C# is a general-purpose, object-oriented programming language. Its development team is led by Anders Hejlsberg. The most recent version is C# 11, which was released in 2022 along with .NET 7. The language is being actively developed with a new version being released yearly along with the latest .NET version. The Unity game engine uses C# as its primary scripting language.", "pageId": 2356196, "dailyPageViews": 2794, "created": 2001, "backlinksCount": 4097, "revisionCount": 4580, "appeared": 2017, "fileExtensions": [ "cs" ], "url": "https://en.wikipedia.org/wiki/C_Sharp_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "cs", "cake", "csx", "linq" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nmxgmn WaveFunctionCollapse https://github.com/mxgmn.png https://github.com/mxgmn/WaveFunctionCollapse C# #178600 12814 642 580 \"Bitmap & tilemap generation from a single example with the help of ideas from quantum mechanics.\"\nppy osu https://github.com/ppy.png https://github.com/ppy/osu C# #178600 3486 733 227 \"rhythm is just a *click* away!\"\ndotnet samples https://github.com/dotnet.png https://github.com/dotnet/samples C# #178600 618 1379 71 \"Sample code and snippets used in the .NET documentation\"\nHMBSbige ShadowsocksR-Windows https://github.com/HMBSbige.png https://github.com/HMBSbige/ShadowsocksR-Windows C# #178600 677 194 208 \"【自用】Forked from shadowsocksr and shadowsocksrr\"\ndotnet coreclr https://github.com/dotnet.png https://github.com/dotnet/coreclr C# #178600 11992 2818 177 \"CoreCLR is the runtime for .NET Core. It includes the garbage collector, JIT compiler, primitive data types and low-level classes.\"\nEduardoPires EquinoxProject https://github.com/EduardoPires.png https://github.com/EduardoPires/EquinoxProject C# #178600 2873 883 128 \"Full ASP.NET Core 2.2 application with DDD, CQRS and Event Sourcing\"\nconfluentinc confluent-kafka-dotnet https://github.com/confluentinc.png https://github.com/confluentinc/confluent-kafka-dotnet C# #178600 1172 366 69 \"Confluent's Apache Kafka .NET client\"\nasc-lab dotnetcore-microservices-poc https://github.com/asc-lab.png https://github.com/asc-lab/dotnetcore-microservices-poc C# #178600 529 167 153 \"Very simplified insurance sales system made in a microservices architecture using .NET Core\"\nthangchung awesome-dotnet-core https://github.com/thangchung.png https://github.com/thangchung/awesome-dotnet-core C# #178600 9843 1502 307 \"🐝 A collection of awesome .NET core libraries, tools, frameworks and software\"\njellyfin jellyfin https://github.com/jellyfin.png https://github.com/jellyfin/jellyfin C# #178600 3666 346 407 \"The Free Software Media System\"\n0xd4d dnSpy https://github.com/0xd4d.png https://github.com/0xd4d/dnSpy C# #178600 11499 1810 374 \".NET debugger and assembly editor\"\ndotnetcore WTM https://github.com/dotnetcore.png https://github.com/dotnetcore/WTM C# #178600 932 220 252 WTM框架是针对中小规模后台管理系统的开发利器。基于DotNetCore，实现0编码创建项目，0编码生成业务模块。框架严格遵循MVVM的开发模式，并深得MVVM的精髓。对于新手，可以快速上手搭建项目；对于高手，可以把那些繁琐重复的工作交给框架生成，专心攻克需求难点。框架经过数十个真实项目检测，可以极大提高开发效率，降低开发成本。\nJasonGT NorthwindTraders https://github.com/JasonGT.png https://github.com/JasonGT/NorthwindTraders C# #178600 2559 873 138 \"Northwind Traders is a sample application built using ASP.NET Core and Entity Framework Core.\"\naspnet EntityFrameworkCore https://github.com/aspnet.png https://github.com/aspnet/EntityFrameworkCore C# #178600 8039 2058 143 \"Entity Framework Core is a lightweight and extensible version of the popular Entity Framework data access technology\"\nmicrosoft appcenter https://github.com/microsoft.png https://github.com/microsoft/appcenter C# #178600 367 70 49 \"Central repository for App Center open source resources and planning.\"\nAzure azure-powershell https://github.com/Azure.png https://github.com/Azure/azure-powershell C# #178600 1598 1679 58 \"Microsoft Azure PowerShell\"\nHangfireIO Hangfire https://github.com/HangfireIO.png https://github.com/HangfireIO/Hangfire C# #178600 5046 1139 132 \"An easy way to perform background job processing in your .NET and .NET Core applications. No Windows Service or separate process required\"\ngrandnode grandnode https://github.com/grandnode.png https://github.com/grandnode/grandnode C# #178600 797 324 83 \"Free and Open Source Ecommerce Shopping Cart solution based on ASP.NET CORE and MongoDB\"\nquasar QuasarRAT https://github.com/quasar.png https://github.com/quasar/QuasarRAT C# #178600 2618 1155 95 \"Remote Administration Tool for Windows\"\nmigueldeicaza gui.cs https://github.com/migueldeicaza.png https://github.com/migueldeicaza/gui.cs C# #178600 2674 201 232 \"Console-based user interface toolkit for .NET applications.\"\ndotnetcore CAP https://github.com/dotnetcore.png https://github.com/dotnetcore/CAP C# #178600 3096 623 179 \"Distributed transaction solution in micro-service base on eventually consistency, also an eventbus with Outbox pattern\"\nMaterialDesignInXAML MaterialDesignInXamlToolkit https://github.com/MaterialDesignInXAML.png https://github.com/MaterialDesignInXAML/MaterialDesignInXamlToolkit C# #178600 7150 1706 211 \"Google's Material Design in XAML & WPF, for C# & VB.Net.\"\n2dust v2rayN https://github.com/2dust.png https://github.com/2dust/v2rayN C# #178600 581 111 486 \nAzure DotNetty https://github.com/Azure.png https://github.com/Azure/DotNetty C# #178600 2571 673 69 \"DotNetty project – a port of netty, event-driven asynchronous network application framework\"\nGoogleCloudPlatform microservices-demo https://github.com/GoogleCloudPlatform.png https://github.com/GoogleCloudPlatform/microservices-demo C# #178600 5767 865 372 \"Sample cloud-native application with 10 microservices showcasing Kubernetes, Istio, gRPC and OpenCensus. Provided for illustration and demo purposes.\"", "trendingProjectsCount": 26, "type": "programming", "aceMode": "csharp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-csharp", "tmScope": "source.cs", "aliases": [ "csharp", "cake", "cakescript" ], "repos": 2161625, "id": "C#" }, "githubBigQuery": { "repos": 133078, "users": 82607, "id": "C#" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/csharp", "monaco": "csharp", "pygmentsHighlighter": { "filename": "dotnet.py", "fileExtensions": [ "cs" ], "id": "C#" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 30, "commitCount": 235, "sampleCount": 5, "example": [ "using System;\n\nnamespace MongoDB.Serialization.Descriptors\n{\n internal class BsonPropertyValue\n {\n public bool IsDictionary { get; private set; }\n\n public Type Type { get; private set; }\n\n public object Value { get; private set; }\n\n public BsonPropertyValue(Type type, object value, bool isDictionary)\n {\n Type = type;\n Value = value;\n IsDictionary = isDictionary;\n }\n }\n}" ], "url": "https://github.com/atom/language-csharp" }, "languageServerProtocolProject": [ "https://github.com/OmniSharp/csharp-language-server-protocol\nwrittenIn csharp" ], "projectEuler": { "memberCount": { "2019": 13078, "2022": 14113 }, "id": "C#" }, "leachim6": { "filepath": "c/CSharp.cs", "fileExtensions": [ "cs" ], "example": [ "System.Console.WriteLine(\"Hello World\");\n" ], "id": "CSharp" }, "compilerExplorer": { "example": [ "class Program\n{\n static int Square(int num) => num * num;\n}\n" ], "id": "C#" }, "rijuRepl": { "example": [ "class main {\n static void Main(string[] args) {\n System.Console.WriteLine(\"Hello, world!\");\n }\n}" ], "id": "https://riju.codes/csharp" }, "replit": "https://repl.it/languages/csharp", "indeedJobs": { "2017": 19747, "query": "c# developer" }, "stackOverflowSurvey": { "2021": { "users": 22984, "medianSalary": 58368, "fans": 17999, "percentageUsing": 0.28 } }, "subreddit": [ { "memberCount": { "2017": 46616, "2022": 202070 }, "url": "https://reddit.com/r/csharp" } ], "meetup": { "memberCount": 351091, "groupCount": 802, "url": "https://www.meetup.com/topics/csharp" }, "tiobe": { "currentRank": 5, "id": "C#" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3445", "pypl": "C#", "packageRepository": [ "https://www.nuget.org/" ], "jupyterKernel": [ "https://github.com/zabirauf/icsharp" ], "fileType": "text", "githubCopilotOptimized": true, "isbndb": "year|publisher|title|authors|isbn13\n2015|Cengage Learning|C# Programming: From Problem Analysis to Program Design|Doyle, Barbara|9781285856872\n2016|Pearson|Starting out with Visual C#|Gaddis, Tony|9780134382609\n2013|Microsoft Press|Microsoft Visual C# 2013 Step by Step|Sharp, John|9780735681835", "semanticScholar": "" }, "csl": { "title": "CSL", "appeared": 1966, "type": "pl", "reference": [ "https://doi.org/10.1093/comjnl/5.3.194" ], "country": [ "United States and United Kingdom" ], "originCommunity": [ "IBM", "Esso Petroleum Co. Ltd" ], "hasSemanticIndentation": { "example": "", "value": true }, "tryItOnline": "csl", "hopl": "https://hopl.info/showlanguage.prx?exp=250", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1994|Springer Verlag|Computer Science Logic: 7th Workshop, Csl '93 Swansea, United Kingdom September 13-17, 1993 Selected Papers (lecture Notes In Computer Science)|Egon Borger and Yuri Gurevich|9780387582771\n2000|Springer|Computer Science Logic: 14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings (Lecture Notes in Computer Science, 1862)||9783540678953\n1994|Springer|Computer Science Logic: 7th Workshop, CSL '93, Swansea, United Kingdom, September 13 - 17, 1993. Selected Papers (Lecture Notes in Computer Science, 832)||9783540582779\n2007|Springer-verlag|Computer Science Logic: 6th Workshop, Csl '92, San Miniato, Italy, September 28-october 2, 1992 : Selected Papers|Workshop On Computer Science Logic (6th : 1992 : San Miniato, Italy)|9783540569923\n2007|Springer|Csl '89: 3rd Workshop On Computer Science Logic. Kaiserslautern, Frg, October 2-6, 1989. Proceedings (lecture Notes In Computer Science)|Egon Börger and Hans Kleine Büning and Michael M. Richter|9783540527534" }, "csmp": { "title": "CSMP", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/201dcc0e571cc267e50d31d2ed183c791ddccbe8" ], "country": [ "The Netherlands" ], "originCommunity": [ "Wageningen Agricultural University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=714", "centralPackageRepositoryCount": 0 }, "cson": { "title": "CSON", "appeared": 2011, "type": "dataNotation", "creators": [ "Benjamin Lupton" ], "standsFor": "CoffeeScript Object Notation", "country": [ "Australia" ], "originCommunity": [ "https://bevry.me/" ], "githubRepo": { "firstCommit": 2011, "stars": 1307, "forks": 58, "subscribers": 20, "created": 2011, "updated": 2022, "description": "CoffeeScript-Object-Notation. Same as JSON but for CoffeeScript objects.", "issues": 11, "url": "https://github.com/bevry/cson" }, "repoStats": { "firstCommit": 2011, "commits": 205, "committers": 18, "files": 48 }, "githubLanguage": { "fileExtensions": [ "cson" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "coffee", "codemirrorMode": "coffeescript", "codemirrorMimeType": "text/x-coffeescript", "tmScope": "source.coffee", "repos": 16, "id": "CSON" }, "githubBigQuery": { "repos": 2, "users": 1, "id": "CSON" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 30, "commitCount": 332, "sampleCount": 4, "example": [ "'menu': [\n {\n 'label': 'Packages'\n 'submenu': [\n 'label': 'Wercker Status'\n 'submenu': [\n { 'label': 'Check now!', 'command': 'wercker-status:checknow' }\n ]\n ]\n }\n]" ], "url": "https://github.com/atom/language-coffee-script" }, "leachim6": { "filepath": "c/CSON.cson", "fileExtensions": [ "cson" ], "example": [ "{'Hello': 'World'}\n" ], "id": "CSON" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "csound": { "title": "Csound", "appeared": 1985, "type": "pl", "website": "http://csound.com", "fileExtensions": [ "csd", "sco" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "domainName": { "registered": 2008, "awisRank": { "2022": 1392357 }, "name": "csound.com" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "\n \n \n csound -W -d -o tone.wav\n \n \n \n sr = 96000 ; Sample rate.\n kr = 9600 ; Control signal rate.\n ksmps = 10 ; Samples per control signal.\n nchnls = 1 ; Number of output channels.\n\n instr 1\n a1 oscil p4, p5, 1 ; Oscillator: p4 and p5 are the arguments from the score, 1 is the table number.\n out a1 ; Output.\n endin\n \n\n \n f1 0 8192 10 1 ; Table containing a sine wave. Built-in generator 10 produces a sum of sinusoids, here only one.\n i1 0 1 20000 1000 ; Play one second of one kHz at amplitude 20000.\n e\n \n\n" ], "related": [ "c", "saol", "python", "java", "lisp", "tcl", "haskell", "bison", "max", "emacs-editor" ], "summary": "Csound is a computer programming language for sound, also known as a sound compiler or an audio programming language, or more precisely, an audio DSL. It is called Csound because it is written in C, as opposed to some of its predecessors. It is free software, available under the LGPL. Csound was originally written at MIT by Barry Vercoe in 1985, based on his earlier system called Music 11, which in its turn followed the MUSIC-N model initiated by Max Mathews at the Bell Labs. Its development continued throughout the 1990s and 2000s, led by John ffitch at the University of Bath. The first documented version 5 release is version 5.01 on March 18, 2006. Many developers have contributed to it, most notably Istvan Varga, Gabriel Maldonado, Robin Whittle, Richard Karpen, Michael Gogins, Matt Ingalls, Steven Yi, Richard Boulanger, and Victor Lazzarini. Developed over many years, it currently has nearly 1700 unit generators. One of its greatest strengths is that it is completely modular and extensible by the user. Csound is closely related to the underlying language for the Structured Audio extensions to MPEG-4, SAOL.", "pageId": 149998, "created": 2002, "backlinksCount": 111, "revisionCount": 309, "dailyPageViews": 60, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Csound" }, "githubLanguage": { "fileExtensions": [ "orc", "udo" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "csound_orchestra", "tmScope": "source.csound", "aliases": [ "csound-orc" ], "repos": 50, "id": "Csound" }, "githubBigQuery": { "repos": 65, "users": 57, "id": "Csound" }, "pygmentsHighlighter": { "filename": "csound.py", "fileExtensions": [ "csd" ], "id": "Csound Document" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 5, "commitCount": 207, "sampleCount": 3, "example": [ "sr = 44100\nkr = 44100\nksmps = 1\nnchnls = 2\n\n; pvanal -n 512 -w 8 allglass1-L.wav allglass1-L.pvc\n; pvanal -n 512 -w 8 allglass1-R.wav allglass1-R.pvc\ninstr 1\n ktime line 0, p3, 17.5018\n arL pvoc ktime, 1, \"allglass1-L.pvc\"\n arR pvoc ktime, 1, \"allglass1-R.pvc\"\n out arL, arR\nendin\n" ], "url": "https://github.com/nwhetsell/language-csound" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5383", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Csound Book: Perspectives in Software Synthesis, Sound Design, Signal Processing, and Programming|2000|Richard Boulanger|154554|4.02|46|2\nProgramming digital music with Csound|2014|Peter Fitton|39833906|4.00|1|0\nCsound: A Sound and Music Computing System||Victor Lazzarini|51915844|5.00|2|0", "isbndb": "year|publisher|title|authors|isbn13\n2000|The MIT Press|The Csound Book: Perspectives in Software Synthesis, Sound Design, Signal Processing,and Programming||9780262522618\n2000||The Csound Book: Perspectives in Software Synthesis, Sound Design, Signal Processing, and Programming|Richard Charles Boulanger|9780585343426", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Ubiquitous Music Ecosystems: Faust Programs in Csound|10.1007/978-3-319-11152-0_7|10|0|Victor Lazzarini and Damián Keller and M. Pimenta and J. Timoney|ce87ec294c43104056d1635bb2720ff9ec008479\n2017|Supporting an Object-Oriented Approach to Unit Generator Development: The Csound Plugin Opcode Framework|10.3390/APP7100970|6|0|Victor Lazzarini|096d54246c58341365cdbcf7870d580e98da5737" }, "csp-oz-dc": { "title": "CSP-OZ-DC", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/094c9e50a787c1fb851b0e2324006cbdc758819b" ], "country": [ "Germany" ], "originCommunity": [ "University of Oldenbury" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6810", "centralPackageRepositoryCount": 0 }, "csp-oz": { "title": "CSP-OZ", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6fbec4f031b919012e0a48d3e33a42f88fa0cf65" ], "country": [ "Germany" ], "originCommunity": [ "University of Oldenburg" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6809", "centralPackageRepositoryCount": 0 }, "csp": { "title": "CSP", "appeared": 1978, "type": "pl", "documentation": [ "https://aiochan.readthedocs.io/en/latest/csp.html" ], "standsFor": "Communicating Sequential Processes", "country": [ "United States", "United Kingdom" ], "originCommunity": [ "Oxford University" ], "keywords": [ "" ], "example": [ "COPY = *[c:character; west?c → east!c]" ], "wikipedia": { "related": [ "occam", "limbo", "go", "crystal", "clojure", "ada" ], "summary": "In computer science, communicating sequential processes (CSP) is a formal language for describing patterns of interaction in concurrent systems. It is a member of the family of mathematical theories of concurrency known as process algebras, or process calculi, based on message passing via channels. CSP was highly influential in the design of the occam programming language, and also influenced the design of programming languages such as Limbo, RaftLib, Go, Crystal, and Clojure's core.async. CSP was first described in a 1978 paper by Tony Hoare, but has since evolved substantially. CSP has been practically applied in industry as a tool for specifying and verifying the concurrent aspects of a variety of different systems, such as the T9000 Transputer, as well as a secure ecommerce system. The theory of CSP itself is also still the subject of active research, including work to increase its range of practical applicability (e.g., increasing the scale of the systems that can be tractably analyzed).", "pageId": 247370, "created": 2003, "backlinksCount": 133, "revisionCount": 456, "dailyPageViews": 281, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Communicating_sequential_processes" }, "monaco": "csp", "hopl": "https://hopl.info/showlanguage.prx?exp=795", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCsp: A Developer's Guide|1992|Shashi Malik|5518824|0.0|0|0\nCSP as a Coordination Language||Kleine Moritz|51931033|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n|Oxford, England : Oxford University Computing Laboratory, Programming Research Group, [1988]|Two papers on CSP|A. W. Roscoe|9780902928497\n|Oxford, England : Oxford University Computing Laboratory, Programming Research Group, 1988.|The Sliding-window Protocol In Csp|K. Paliwoda and J. W. Sanders|9780902928480\n|Oxford, England : Oxford University Computing Laboratory, Programming Research Group, C1993.|Probabilities And Priorities In Timed Csp||9780902928886\n|Oxford, England : Oxford University Computing Laboratory, Programming Research Group, 1992.|A Brief History Of Timed Csp|Jim Davies and Steve Schneider|9780902928749\n|Oxford [england] : Oxford University Computing Laboratory, Programming Research Group, C1996.|The Timed Failures-stability Model For Csp|G. M. Reed and A. W. Roscoe|9780902928930", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1986|The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP|10.1007/BFb0027044|45|0|J. Hooman and W. P. Roever|f752804133a4e5014f6485aa9cdfeaa33d30e8de\n2006|A Reasoning Method for Timed CSP Based on Constraint Solving|10.1007/11901433_19|43|1|J. Dong and Ping Hao and Jun Sun and Xian Zhang|63b5fdc9db311e527efb6bdc613db7b02b1ac304\n1991|Embedding as a Tool for Language Comparison: On the CSP Hierarchy|10.1007/3-540-54430-5_85|27|1|F. S. Boer and C. Palamidessi|e5cf0ff98d509e90ba5d1bf39488815c5aba5a85\n2004|Practical Application of CSP and FDR to Software Design|10.1007/11423348_9|20|2|Jonathan Lawrence|3dd4308be86507c6154cc7033ea8b4866746ff78\n2008|A CSP Model for Mobile Channels|10.3233/978-1-58603-907-3-17|20|1|P. Welch and F. Barnes|71201fc33539bab1ed70b50fba8bc39f59436e75\n2003|Bridging CSP and C++ with selective formalism and executable specifications|10.1109/MEMCOD.2003.1210108|18|0|W. B. Gardner|8ea78309dbdde85ea68f91bdb8d4040f5046e71f\n2009|CSP as a Domain-Specific Language Embedded in Python and Jython|10.3233/978-1-60750-065-0-293|15|0|S. Mount and Mohammad Hammoudeh and Sam Wilson and R. Newman|4cfaf832b2ba26b30a584a5055361de505d6d5b8\n2011|Verification of Distributed Embedded Real-Time Systems and their Low-Level Implementations Using Timed CSP|10.1109/APSEC.2011.52|13|1|B. Bartels and S. Glesner|00612e04938e115ece447f8961aff0d5b4fcc1ba\n1987|A programming environment for CSP|10.1145/24208.24213|13|1|N. Delisle and M. Schwartz|8a67620f9eabbb7a91c7c426e99af616dd45849f\n2005|Converging CSP specifications and C++ programming via selective formalism|10.1145/1067915.1067919|13|0|W. B. Gardner|1fbb2ae9bfd1f8f8f8361c4d7d92508ab16133db\n1997|Designing reusable software components following the CSP distributed programming model|10.1109/PDSE.1997.596837|5|0|J. M. Mantas and A. Palma|f0291b9e835111956f6fbcdbe6e30a195218d582\n2012|An Analytical and Experimental Comparison of CSP Extensions and Tools|10.1007/978-3-642-34281-3_27|4|0|Ling Shi and Yang Liu and Jun Sun and J. Dong and Gustavo Carvalho|4374e617864948df9a7ce03b5f4ffda3d7594421\n2015|Mobile CSP|10.1007/978-3-319-29473-5_3|4|1|J. Woodcock and A. Wellings and A. Cavalcanti|71cdb631ce5b4e9d8efc52896362547a4a055490\n2008|Converting scenarios to CSP traces with Mise en Scene for requirements-based programming|10.1007/s11334-007-0041-0|4|0|J. Carter and W. B. Gardner|d12658ffa5c582756136fc324e0bbe3364808491\n2011|CSP as a Coordination Language|10.1007/978-3-642-21464-6_5|4|0|Moritz Kleine|c6817f27cbdff3ad7186f137220491a5dfbe5b71\n2010|Unfolding CSP|10.1007/978-1-84882-912-1_10|3|0|M. Bundgaard and R. Milner|d11c09b7c43198f994fd6a0670e2cdede4d51707\n2013|A Verified Protocol to Implement Multi-way Synchronisation and Interleaving in CSP|10.1007/978-3-642-40561-7_4|3|0|M. Oliveira and Ivan Soares de Medeiros Júnior and J. Woodcock|2f0c9d5a4afbadb9e26818311fd56ae468eebec0\n2011|Development of an ML-based Verification Tool for Timed CSP Processes|10.3233/978-1-60750-774-1-363|2|0|T. Yamakawa and T. Ohashi and C. Fukunaga|176d88c154cd18cd6a7ec6ed3be5ca5d7cd13461\n2007|Mise en Scene: Converting Scenarios to CSP Traces in Support of Requirements-Based Programming|10.1109/SEW.2007.104|2|0|J. Carter and W. B. Gardner|363989b6ae3f6191dfea00fbc24e0c6cd6b3944a\n1995|Tools for teaching CCRs, monitors, and CSP concurrent programming concepts|10.1145/201998.202008|1|0|R. Olsson and Carole M. McNamee|bf4178c1fa36ea3d87ede0d1960c41582c1670b1\n2017|CSP for Parallelising Brzozowski's DFA Construction Algorithm|10.1142/9789813148208_0010|1|0|Tinus Strauss and B. Watson and D. Kourie and L. Cleophas|528fadf6dff50aef434ed6a4d2ff4f884d9830ef" }, "cspydr": { "title": "CSpydr", "appeared": 2021, "type": "pl", "creators": [ "Spydr06" ], "website": "https://github.com/spydr06/cspydr", "fileExtensions": [ "csp" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/spydr06/" ], "example": [ "# fibonacci.csp\nimport \"io.csp\";\nfn fib(n: i32): i32 {\n let a = 0;\n let b = 0;\n for 0 .. n {\n a + b |> (a = b, b = $);\n }\n <- a;\n}\nfn main(): i32 {\n let n = 10;\n std::io::printf(\"fib(%i) = %i\\n\", n, fib(n));\n <- 0;\n}" ], "githubRepo": { "stars": 38, "forks": 0, "subscribers": 5, "created": 2021, "updated": 2022, "description": "A static typed low-level compiled programming language inspired by Rust and C", "url": "https://github.com/spydr06/cspydr" }, "repoStats": { "firstCommit": 2021, "commits": 811, "committers": 6, "files": 315 } }, "css-doodle": { "title": "CSS Doodle", "appeared": 2017, "type": "pl", "creators": [ "Yuan Chuan" ], "website": "https://css-doodle.com/", "country": [ "Various" ], "originCommunity": [ "https://github.com/css-doodle" ], "example": [ "@grid: 14 / 80%;\n\n@random {\n border-left: 1px solid #5d81bc;\n}\n@random {\n border-top: 1px solid #5d81bc;\n}\n@random(.25) {\n background: linear-gradient(\n @p(#fff, tan, #5d81bc), @lp\n )\n 50% / @r(60%) @lr\n no-repeat;\n}\n@random {\n filter: drop-shadow(0 0 10px #fff);\n}" ], "githubRepo": { "firstCommit": 2017, "stars": 4518, "forks": 181, "subscribers": 49, "created": 2017, "updated": 2022, "description": "🎨 A web component for drawing patterns with CSS.", "issues": 10, "url": "https://github.com/css-doodle/css-doodle" }, "repoStats": { "firstCommit": 2017, "commits": 975, "committers": 8, "files": 76 } }, "css": { "title": "CSS", "appeared": 1996, "type": "stylesheetLanguage", "creators": [ "Håkon Wium Lie" ], "webRepl": [ "https://playcode.io/css/" ], "documentation": [ "https://devdocs.io/css/" ], "reference": [ "https://examples.p6c.dev/categories/parsers/CSSGrammar.html" ], "standsFor": "Cascading Style Sheets", "country": [ "Switzerland" ], "originCommunity": [ "Conseil Européen pour la Recherche Nucléaire" ], "hasEnums": { "example": "", "value": false }, "hasMixins": { "example": "", "value": false }, "canWriteToDisk": { "example": "", "value": false }, "hasImports": { "example": "@import 'custom.css';", "value": true }, "hasFunctions": { "example": "", "value": false }, "hasTernaryOperators": { "example": "", "value": false }, "hasLineComments": { "example": "", "value": false }, "hasComments": { "example": "/* This is a single-line comment */ p { color: red; }", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "body {\n overflow: hidden;\n background: #000000;\n}" ], "related": [ "html", "javascript", "webgl", "xml", "svg", "xpath" ], "summary": "Cascading Style Sheets (CSS) is a style sheet language used for describing the presentation of a document written in a markup language. Although most often used to set the visual style of web pages and user interfaces written in HTML and XHTML, the language can be applied to any XML document, including plain XML, SVG and XUL, and is applicable to rendering in speech, or on other media. Along with HTML and JavaScript, CSS is a cornerstone technology used by most websites to create visually engaging webpages, user interfaces for web applications, and user interfaces for many mobile applications. CSS is designed primarily to enable the separation of presentation and content, including aspects such as the layout, colors, and fonts. This separation can improve content accessibility, provide more flexibility and control in the specification of presentation characteristics, enable multiple HTML pages to share formatting by specifying the relevant CSS in a separate .css file, and reduce complexity and repetition in the structural content. Separation of formatting and content makes it possible to present the same markup page in different styles for different rendering methods, such as on-screen, in print, by voice (via speech-based browser or screen reader), and on Braille-based tactile devices. It can also display the web page differently depending on the screen size or viewing device. Readers can also specify a different style sheet, such as a CSS file stored on their own computer, to override the one the author specified. Changes to the graphic design of a document (or hundreds of documents) can be applied quickly and easily, by editing a few lines in the CSS file they use, rather than by changing markup in the documents. The CSS specification describes a priority scheme to determine which style rules apply if more than one rule matches against a particular element. In this so-called cascade, priorities (or weights) are calculated and assigned to rules, so that the results are predictable. The CSS specifications are maintained by the World Wide Web Consortium (W3C). Internet media type (MIME type) text/css is registered for use with CSS by RFC 2318 (March 1998). The W3C operates a free CSS validation service for CSS documents.", "pageId": 23290197, "dailyPageViews": 1937, "created": 2001, "backlinksCount": 7498, "revisionCount": 3840, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Cascading_Style_Sheets" }, "githubLanguage": { "fileExtensions": [ "css" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nLanikSJ slack-dark-mode https://github.com/LanikSJ.png https://github.com/LanikSJ/slack-dark-mode CSS #563d7c 425 52 202 \"Slack Dark Mode for macOS Desktop\"\nCyb3rWard0g HELK https://github.com/Cyb3rWard0g.png https://github.com/Cyb3rWard0g/HELK CSS #563d7c 1743 327 110 \"The Hunting ELK\"\nmicrosoft TypeScript-Node-Starter https://github.com/microsoft.png https://github.com/microsoft/TypeScript-Node-Starter CSS #563d7c 5908 1323 307 \"A starter template for TypeScript and Node with a detailed README describing how to use the two together.\"\nUndeadSec SocialFish https://github.com/UndeadSec.png https://github.com/UndeadSec/SocialFish CSS #563d7c 1216 441 97 \"Educational Phishing Tool & Information Collector\"\njonasschmedtmann advanced-css-course https://github.com/jonasschmedtmann.png https://github.com/jonasschmedtmann/advanced-css-course CSS #563d7c 1413 1726 86 \"Starter files, final projects and FAQ for my Advanced CSS course\"\nnecolas normalize.css https://github.com/necolas.png https://github.com/necolas/normalize.css CSS #563d7c 36137 7356 423 \"A modern alternative to CSS resets\"\nvinceliuice Mojave-gtk-theme https://github.com/vinceliuice.png https://github.com/vinceliuice/Mojave-gtk-theme CSS #563d7c 352 71 58 \"Mojave is a macos Mojave like theme for GTK 3, GTK 2 and Gnome-Shell\"\nnikitavoloboev my-mac-os https://github.com/nikitavoloboev.png https://github.com/nikitavoloboev/my-mac-os CSS #563d7c 15117 629 171 \"List of applications and tools that make my macOS experience even more amazing\"\njgthms bulma https://github.com/jgthms.png https://github.com/jgthms/bulma CSS #563d7c 36439 2965 550 \"Modern CSS framework based on Flexbox\"\nrstacruz cheatsheets https://github.com/rstacruz.png https://github.com/rstacruz/cheatsheets CSS #563d7c 7217 1704 226 \"My cheatsheets\"\ntroxler awesome-css-frameworks https://github.com/troxler.png https://github.com/troxler/awesome-css-frameworks CSS #563d7c 2026 151 99 \"List of awesome CSS frameworks\"\npmarsceill just-the-docs https://github.com/pmarsceill.png https://github.com/pmarsceill/just-the-docs CSS #563d7c 847 420 80 \"A modern, high customizable, responsive Jekyll theme for documention with built-in search.\"\ntailwindcss tailwindcss https://github.com/tailwindcss.png https://github.com/tailwindcss/tailwindcss CSS #563d7c 14288 666 761 \"A utility-first CSS framework for rapid UI development.\"\nStylishThemes GitHub-Dark https://github.com/StylishThemes.png https://github.com/StylishThemes/GitHub-Dark CSS #563d7c 5847 421 215 \"Dark GitHub style\"\nryanoasis nerd-fonts https://github.com/ryanoasis.png https://github.com/ryanoasis/nerd-fonts CSS #563d7c 16392 1030 650 \"Iconic font aggregator, collection, & patcher. 3,600+ icons, 40+ patched fonts: Hack, Source Code Pro, more. Glyph collections: Font Awesome, Material Design Icons, Octicons, & more\"\nBlackrockDigital startbootstrap-sb-admin https://github.com/BlackrockDigital.png https://github.com/BlackrockDigital/startbootstrap-sb-admin CSS #563d7c 2234 1587 29 \"A free, open source, Bootstrap admin theme created by Start Bootstrap\"\nDMQ mvvm https://github.com/DMQ.png https://github.com/DMQ/mvvm CSS #563d7c 3821 942 113 剖析vue实现原理，自己动手实现mvvm\nBNDong Cnblogs-Theme-SimpleMemory https://github.com/BNDong.png https://github.com/BNDong/Cnblogs-Theme-SimpleMemory CSS #563d7c 300 256 67 \"🍭 Cnblogs theme / Basic theme : SimpleMemory\"\nuikit uikit https://github.com/uikit.png https://github.com/uikit/uikit CSS #563d7c 14876 2128 144 \"A lightweight and modular front-end framework for developing fast and powerful web interfaces\"\nBlackrockDigital startbootstrap-sb-admin-2 https://github.com/BlackrockDigital.png https://github.com/BlackrockDigital/startbootstrap-sb-admin-2 CSS #563d7c 7083 4238 166 \"A free, open source, Bootstrap admin theme created by Start Bootstrap\"\ntheme-next hexo-theme-next https://github.com/theme-next.png https://github.com/theme-next/hexo-theme-next CSS #563d7c 3901 1230 248 \"Elegant and powerful theme for Hexo.\"\nmicrosoft azuredevopslabs https://github.com/microsoft.png https://github.com/microsoft/azuredevopslabs CSS #563d7c 200 146 19 \"Learn how you can plan smartly, collaborate better, and ship faster with a set of modern development services with Azure DevOps.\"\nTencent weui.js https://github.com/Tencent.png https://github.com/Tencent/weui.js CSS #563d7c 2546 837 42 \"A lightweight javascript library for WeUI.\"\ndaneden animate.css https://github.com/daneden.png https://github.com/daneden/animate.css CSS #563d7c 61860 13095 738 \"🍿 A cross-browser library of CSS animations. As easy to use as an easy thing.\"\nkitian616 jekyll-TeXt-theme https://github.com/kitian616.png https://github.com/kitian616/jekyll-TeXt-theme CSS #563d7c 833 788 65 \"💎 🐳 A super customizable Jekyll theme for personal site, team site, blog, project, documentation, etc.\"", "trendingProjectsCount": 26, "type": "markup", "aceMode": "css", "codemirrorMode": "css", "codemirrorMimeType": "text/css", "tmScope": "source.css", "repos": 4446834, "id": "CSS" }, "githubBigQuery": { "repos": 808537, "users": 505671, "id": "CSS" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/css3", "monaco": "css", "codeMirror": "css", "pygmentsHighlighter": { "filename": "css.py", "fileExtensions": [ "css" ], "id": "CSS" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 48, "commitCount": 418, "sampleCount": 2, "example": [ "/*!\n * Bootstrap v2.3.1\n *\n * Copyright 2012 Twitter, Inc\n * Licensed under the Apache License v2.0\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Designed and built with all the love in the world @twitter by @mdo and @fat.\n */\n.clearfix{*zoom:1;}.clearfix:before,.clearfix:after{display:table;content:\"\";line-height:0;}\n.clearfix:after{clear:both;}\n.hide-text{font:0/0 a;color:transparent;text-shadow:none;background-color:transparent;border:0;}\n.input-block-level{display:block;width:100%;min-height:30px;-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box;}\narticle,aside,details,figcaption,figure,footer,header,hgroup,nav,section{display:block;}\naudio,canvas,video{display:inline-block;*display:inline;*zoom:1;}\naudio:not([controls]){display:none;}\nhtml{font-size:100%;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%;}\na:focus{outline:thin dotted #333;outline:5px auto -webkit-focus-ring-color;outline-offset:-2px;}\na:hover,a:active{outline:0;}\nsub,sup{position:relative;font-size:75%;line-height:0;vertical-align:baseline;}\nsup{top:-0.5em;}\nsub{bottom:-0.25em;}\nimg{max-width:100%;width:auto\\9;height:auto;vertical-align:middle;border:0;-ms-interpolation-mode:bicubic;}\n#map_canvas img,.google-maps img{max-width:none;}\nbutton,input,select,textarea{margin:0;font-size:100%;vertical-align:middle;}\nbutton,input{*overflow:visible;line-height:normal;}\nbutton::-moz-focus-inner,input::-moz-focus-inner{padding:0;border:0;}\nbutton,html input[type=\"button\"],input[type=\"reset\"],input[type=\"submit\"]{-webkit-appearance:button;cursor:pointer;}\nlabel,select,button,input[type=\"button\"],input[type=\"reset\"],input[type=\"submit\"],input[type=\"radio\"],input[type=\"checkbox\"]{cursor:pointer;}\ninput[type=\"search\"]{-webkit-box-sizing:content-box;-moz-box-sizing:content-box;box-sizing:content-box;-webkit-appearance:textfield;}\ninput[type=\"search\"]::-webkit-search-decoration,input[type=\"search\"]::-webkit-search-cancel-button{-webkit-appearance:none;}\ntextarea{overflow:" ], "url": "https://github.com/atom/language-css" }, "helloWorldCollection": [ "/* Hello World in CSS */\nbody:before {\n content: \"Hello World\";\n}\n" ], "leachim6": { "filepath": "c/CSS.css", "fileExtensions": [ "css" ], "example": [ "body::before {\n content: \"Hello World\";\n}\n" ], "id": "CSS" }, "indeedJobs": { "2017": 16898, "query": "css developer" }, "linkedInSkill": { "2018": 2871891, "id": "css" }, "meetup": { "memberCount": 608659, "groupCount": 963, "url": "https://www.meetup.com/topics/css" }, "fileType": "text", "wordRank": 3840, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nHTML, XHTML & CSS for Dummies|2008|Ed Tittel|2557278|3.55|109|14", "isbndb": "year|publisher|title|authors|isbn13\n2005|O'Reilly Media|Head First Html With CSS & XHTML|Eric Freeman and Elisabeth Freeman and Elisabeth Robson|9780596101978\n2010|O'Reilly Media|CSS Cookbook, 3rd Edition (Animal Guide)|Christopher Schmitt|9780596155933\n2010|Course Technology, Cengage Learning|Blended Html, Xhtml, and CSS|Henry Bojack|9780538746335\n2006|Apress|Pro CSS Techniques (Expert's Voice)|Rubin, Dan and Lloyd, Ian and Croft, Jeffrey|9781590597323\n2004|Peachpit Press|DHTML and CSS Advanced: Visual QuickPro Guide|Teague, Jason Cranford|9780321266910\n2004|Wiley|HTML, XHTML, and CSS Bible (Bible) 3rd Edition|Pfaffenberger, Bryan and Schafer, Steven M. and White, Chuck and Karow, Bill|9780764557392\n2004|Wrox|Beginning Web Programming with HTML, XHTML, and CSS (Wrox Beginning Guides)|Duckett, Jon|9780764570780\n2009|McGraw-Hill Education|HTML, XHTML & CSS QuickSteps|Hart-Davis, Guy|9780071633178\n2017|Independently published|Programming: Python Programming, JAVA Programming, HTML and CSS Programming for Beginners|Academy, iCode|9781520676081\n2010|Sams Publishing|Sams Teach Yourself Web Publishing with HTML and CSS in One Hour a Day: Includes New HTML5 Coverage|Lemay, Laura and Colburn, Rafe|9780672331367\n20061017|O'Reilly Media, Inc.|CSS Cookbook|Christopher Schmitt|9780596554682\n2017|Packt Publishing|Enduring CSS|Frain, Ben|9781787284531\n2014|Apress|CSS Quick Syntax Reference|Olsson, Mikael|9781430264910\n20071018|Springer Nature|Beginning HTML with CSS and XHTML|Craig Cook; David Schultz|9781430203506\n2015|Apress|Beginning CSS Preprocessors: With SASS, Compass.js and Less.js|Prabhu, Anirudh|9781484213476\n2008|Apress|The Essential Guide to CSS and HTML Web Design (Essentials)|Grannell, Craig|9781430204794\n2011|Apress|Pro CSS for High Traffic Websites (Expert's Voice in Web Design)|Kennedy, Antony and de Leon, Inayaili|9781430232896\n2013|Apress|CSS for Windows 8 App Development (Expert's Voice in Windows 8)|Foster, Jeremy|9781430249849\n2020|Packt Publishing|Responsive Web Design with HTML5 and CSS: Develop future-proof responsive websites using the latest HTML5 and CSS techniques, 3rd Edition|Frain, Ben|9781839219795\n2022|SitePoint|Tailwind CSS|Gerchev, Ivaylo|9781098140991\n2020|Independently published|Coding for Kids Ages 9-15: Simple HTML, CSS and JavaScript lessons to get you started with Programming from Scratch|Mather, Bob|9798644382446\n2020|Apress|Modern CSS: Master the Key Concepts of CSS for Modern Web Development|Attardi, Joe|9781484262948\n2014|Adobe Press|CSS Animations and Transitions for the Modern Web|Bradley, Steven|9780133980547\n2013|O'Reilly Media|CSS Text: Styling Your Words|Meyer, Eric A.|9781449373740\n2021|Independently published|Coding for Absolute Beginners: Master the Basics of Computer Programming with Python, Java, SQL, C, C++, C#, HTML, and CSS|Warner, Andrew|9798543586372\n2014|Sams Publishing|HTML, CSS and JavaScript All in One, Sams Teach Yourself: Covering HTML5, CSS3, and jQuery|Meloni, Julie C.|9780133795189\n2011|For Dummies|HTML, XHTML and CSS For Dummies|Tittel, Ed and Noble, Jeff|9780470916599\n2019|Manning|Web Design Playground: HTML & CSS The Interactive Way|McFedries, Paul|9781638350590\n2015|No Starch Press|Build an HTML5 Game: A Developer's Guide with CSS and JavaScript|Bunyan, Karl|9781593275754\n2014|O'Reilly Media|Learning PHP, MySQL, JavaScript, CSS & HTML5: A Step-by-Step Guide to Creating Dynamic Websites|Nixon, Robin|9781491949467\n2012|Cengage Learning|New Perspectives on Blended HTML and CSS Fundamentals: Introductory|Bojack, Henry and Scollard, Sharon|9781285414652\n2016|CreateSpace Independent Publishing Platform|Programming: Computer Programming For Beginners: Learn The Basics Of HTML5, JavaScript & CSS (Coding, C Programming, Java Programming, Web Design, JavaScript, Python, HTML and CSS)|Connor, Joseph|9781541006225\n2017|CreateSpace Independent Publishing Platform|Computer Programming For Beginners: Learn The Basics of Java, SQL, C, C++, C#, Python, HTML, CSS and Javascript|Alvin, Cooper|9781981497805\n2011|New Riders|CSS for Print Designers|Graffam, J. D.|9780321765888\n2017|Apress|CSS Mastery: Advanced Web Standards Solutions|Collison, Simon and Budd, Andy and Moll, Cameron|9781430223986\n2017|Independently published|HTML & CSS For Beginners: Your Step by Step Guide to Easily HtmL & Css Programming in 7 Days|Academy, iCode|9781520561400\n2010|Mike Murach & Associates|Murach's HTML, XHTML, and CSS|Anne Boehm|9781890774578\n2009|Apress|AdvancED CSS|Lewis, Joe and Moscovitz, Meitar|9781430219330\n2006|O'Reilly Media|CSS Cookbook (Cookbooks (O'Reilly))|Schmitt, Christopher|9780596527419\n2015|McGraw Hill|CSS & CSS3: 20 Lessons to Successful Web Development: 20 Lessons to Successful Web Development [ENHANCED EBOOK]|Nixon, Robin|9780071850216\n2008|Wrox|Beginning Web Programming with HTML, XHTML, and CSS|Duckett, Jon|9780470259313\n2008|For Dummies|HTML, XHTML, and CSS All-in-One Desk Reference For Dummies|Harris, Andy and McCulloh, Chris|9780470186275\n2005-07-01T00:00:01Z|Teora USA, LLC|HTML, XHTML, CSS and XML by Example: A Practical Guide (By Example Series)|Teodoru Gugoiu|9781594960376\n2018|Apress|CSS Framework Alternatives: Explore Five Lightweight Alternatives to Bootstrap and Foundation with Project Examples|Shenoy, Aravind and Prabhu, Anirudh|9781484233993\n2017|Chapman and Hall/CRC|Introduction to Web Interaction Design: With HTML and CSS|Macaulay, Michael|9781138911857\n2008|Apress|HTML and CSS Web Standards Solutions: A Web Standardistas' Approach|Persson, Nicklas and Murphy, Christopher|9781430216063\n2007|Apress|Beginning HTML with CSS and XHTML: Modern Guide and Reference (Beginning: from Novice to Professional)|Cook, Craig and Schultz, David|9781590597477\n2009|Wrox|Beginning JavaScript and CSS Development with jQuery|York, Richard|9780470227794\n2018|Independently published|HTML, CSS & JavaScript for Complete Beginners: A Step by Step Guide to Learning HTML5, CSS3 and the JavaScript Programming Language|Hawramani, Ikram|9781790591848\n2007|Sybex|Mastering Integrated HTML and CSS|DeBolt, Virginia|9780470097540\n2007|Thomson Course Technology|New Perspectives on Blended HTML, XHTML, and CSS|Bojack, Henry|9781423906513\n2009|Apress|Getting StartED with CSS|Powers, David|9781430225430\n2003|Wiley|JavaScript: A Programmer's Companion from Basic through DHTML, CSS and DOM|Koch, Stefan|9780470847046\n2020-02-28T00:00:01Z|Elluminet Press|HTML & CSS for Beginners: Learn the Fundamentals of Computer Programming (1) (Essential Coding)|Foster, Jo|9781913151140\n2001|Prentice Hall|Essential CSS and DHTML for Web Professionals (2nd Edition)|Livingston, Dan|9780130649959\n2015|CreateSpace Independent Publishing Platform|Html & CSS Programming: The Ultimate guide on How you can write Html and CSS in Under 10 Hours|Dawson, Ted|9781519536709\n2019-09-03T00:00:01Z|Independently published|You Are The Css To My Html: Size 6 x 9 inch - 120 Pages - Lined (Ruled) Notebook/Journal|Journal, Programming and Coding Lovers|9781690768128\n43014|Packt Publishing|Mastering CSS|Rich Finelli|9781787120570\n2013|lulu.com|Html & Css Programming Guide|Ramasamy, Venkatesh|9781304699787\n20160613|O'Reilly Media, Inc.|Table Layout in CSS|Eric A. Meyer|9781491930489\n2015-08-21T00:00:01Z|Lulu.com|CSS Programming Professional Made Easy|Key, Sam|9781329461710\n2019|Independently published|Source Code: Path to Programming CSS|Society, Source Code|9781090804709\n20160912|Springer Nature|ASP.NET MVC with Entity Framework and CSS|Lee Naylor|9781484221372\n2021|Jacob Parker|HTML & CSS: The Simplified Beginners Guide to build your websites and Easily Html & CSS Programming in 7 Days|Parker, Jacob|9781803060545\n2008T|Wiley|Beginning Web Programming With Html, Xhtml, And Css|Jon Duckett|9788126516971\n2015|CreateSpace Independent Publishing Platform|Python Programming In A Day & CSS Programming Professional Made Easy|Key, Sam|9781511454568\n2015|CreateSpace Independent Publishing Platform|C++ Programming Professional Made Easy & CSS Programming Professional Made Easy|Key, Sam|9781517222819\n2014|Tsinghua University Press|HTML 5 and CSS 3 programming from basic to applied (with DVD-ROM disc 1)(Chinese Edition)|ZHU HONG TAO . ZHAO XI LAI|9787302317999\n20110223|Hachette|Css|Fabien Basmaison; Antoine Cailliau|9782822409711\n2007|Eyrolles|Css 2|Raphaël Goetter|9782212850734\n20160726|Springer Nature|CSS Mastery|Andy Budd; Emil Björklund|9781430258643\n2007|Wiley & Sons, Incorporated, John|Beginning Css|Richard York|9780470175071\n20150604|O'Reilly Media, Inc.|CSS Secrets|Lea Verou|9781449372767\n20130821|O'Reilly Media, Inc.|CSS Text|Eric A. Meyer|9781449373771\n20181011|O'Reilly Media, Inc.|CSS Master|Tiffany B Brown|9781492071013\n20160113|O'Reilly Media, Inc.|CSS Floating|Eric A. Meyer|9781491929612\n20181022|O'Reilly Media, Inc.|Modern CSS|Craig Buckler; Ilya Bodrov-Krukowski; Claudio Ribeiro; Tiffany B Brown; David Attard; Ahmed Bouchefr|9781492069973\n20130821|O'Reilly Media, Inc.|CSS Text|Eric A. Meyer|9781449373788\n20210815|O'Reilly Media, Inc.|CSS Master|Tiffany B Brown|9781098129484\n20160113|O'Reilly Media, Inc.|CSS Floating|Eric A. Meyer|9781491929599\n20200515|Springer Nature|Architecting CSS|Martine Dowden; Michael Dowden|9781484257500\n20150604|O'Reilly Media, Inc.|CSS Secrets|Lea Verou|9781449372774\n20091215|O'Reilly Media, Inc.|CSS Cookbook|Christopher Schmitt|9781449389055\n20091215|O'Reilly Media, Inc.|CSS Cookbook|Christopher Schmitt|9781449382940\n2017|Createspace Independent Publishing Platform|Html And Css|Micheal Knapp|9781542829908\n20160413|O'Reilly Media, Inc.|Positioning in CSS|Eric A. Meyer|9781491930328\n20130912|O'Reilly Media, Inc.|Jump Start CSS|Louis Lazaris|9781457192258\n20130912|O'Reilly Media, Inc.|Jump Start CSS|Louis Lazaris|9781457192265\n20180308|Simon & Schuster|CSS in Depth|Keith Grant|9781638355861\n20180402|O'Reilly Media, Inc.|CSS Pocket Reference|Eric Meyer|9781492033349\n20170525|O'Reilly Media, Inc.|Flexbox in CSS|Estelle Weyl|9781491981436\n2017|CreateSpace Independent Publishing Platform|Html & Css For Beginners|iCode Academy|9781535236102\n2009|Prentice Hall|CSS Fundamentals [With DVD]|Montoya and Christian|9780137043835\n2022-04-22|Elluminet Press|HTML& CSS for Beginners|Jo Foster|9781913151706\n20071222|Springer Nature|Beginning CSS Web Development|Simon Collison|9781430202257\n20210125|ClydeBank Media|HTML & CSS QuickStart Guide|David DuRocher|9781636100029\n11/2021|Mike Murach & Associates|Murach's HTML and CSS|Zak Ruvalcaba, Anne Boehm|9781943872886\n20210505|O'Reilly Media, Inc.|Modern CSS with Tailwind|Noel Rappin|9781680508574\n20181022|O'Reilly Media, Inc.|The Advanced CSS Collection|Craig Buckler; Ilya Bodrov-Krukowski; Claudio Ribeiro; Tiffany B Brown; David Attard; Ahmed Bouchefr|9781492069898\n20100325|Springer Nature|Getting StartED with CSS|David Powers|9781430225447\n2019|Anak Hebat Indonesia|Buku Sakti Html, Css & Javascript|Adam Saputra, S.Si.|9786232443723", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2016|An Empirical Study on the Use of CSS Preprocessors|10.1109/SANER.2016.18|22|1|D. Mazinanian and Nikolaos Tsantalis|c064a3f1e0d9d086baa50433435f884905e15177\n2018|CSS Preprocessing: Tools and Automation Techniques|10.3390/info9010017|3|0|R. Queirós|6f85bbca627498fa404f6f705b3000ca0155c989" }, "cssa": { "title": "CSSA", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c3b2ecf2395dd45de8657a8d40a41e2a98b8dad9" ], "country": [ "Germany" ], "originCommunity": [ "University of Bonn" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1314", "centralPackageRepositoryCount": 0 }, "cst": { "title": "CST", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7acf7d85dfea678b8f3f2c5dfd3fe277655ef84b" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6272", "wordRank": 4662, "centralPackageRepositoryCount": 0 }, "csv": { "title": "CSV", "appeared": 1972, "type": "dataNotation", "standsFor": "comma-separated values", "fileExtensions": [ "csv" ], "example": [ "Year,Make,Model,Length\n1997,Ford,E350,2.34\n2000,Mercury,Cougar,2.38" ], "wikipedia": { "example": [ "Year;Make;Model;Length\n1997;Ford;E350;2,34\n2000;Mercury;Cougar;2,38" ], "related": [ "tsv", "ascii", "unicode", "utf-8", "fortran", "html", "xml", "excel-app", "unix", "emacs-editor", "awk" ], "summary": "In computing, a comma-separated values (CSV) file stores tabular data (numbers and text) in plain text. Each line of the file is a data record. Each record consists of one or more fields, separated by commas. The use of the comma as a field separator is the source of the name for this file format. The CSV file format is not standardized. The basic idea of separating fields with a comma is clear, but that idea gets complicated when the field data may also contain commas or even embedded line-breaks. CSV implementations may not handle such field data, or they may use quotation marks to surround the field. Quotation does not solve everything: some fields may need embedded quotation marks, so a CSV implementation may include escape characters or escape sequences. In addition, the term \"CSV\" also denotes some closely related delimiter-separated formats that use different field delimiters. These include tab-separated values and space-separated values. A delimiter that is not present in the field data (such as tab) keeps the format parsing simple. These alternate delimiter-separated files are often even given a .csv extension despite the use of a non-comma field separator. This loose terminology can cause problems in data exchange. Many applications that accept CSV files have options to select the delimiter character and the quotation character.", "pageId": 501906, "dailyPageViews": 56, "created": 2004, "backlinksCount": 1438, "revisionCount": 1207, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/Comma-separated_values" }, "githubLanguage": { "fileExtensions": [ "csv" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "none", "repos": 9, "id": "CSV" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/csv", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "csvpp": { "title": "CSV++", "appeared": 2016, "type": "dataNotation", "reference": [ "http://www.johnmyleswhite.com/notebook/2016/09/23/no-juice-for-you-csv-format-it-just-makes-you-more-awful/" ], "related": [ "csv" ] }, "csvw": { "title": "CSVw", "appeared": 2014, "type": "dataValidationLanguage", "creators": [ "Ivan Herman" ], "description": "The CSV on the Web Working Group has developed standard ways to express useful metadata about CSV files and other kinds of tabular data.", "reference": [ "https://www.w3.org/TR/tabular-data-primer/" ], "standsFor": "CSV on the Web", "country": [ "Various" ], "originCommunity": [ "CSV on the Web Working Group", "CSV on the Web Community Group" ], "example": [ "{\n \"@context\": \"http://www.w3.org/ns/csvw\",\n \"url\": \"countries.csv\",\n \"tableSchema\": {\n \"aboutUrl\": \"http://example.org/country/{code}\",\n \"columns\": [{\n \"titles\": \"country\",\n \"name\": \"code\"\n },{\n \"titles\": \"country group\"\n },{\n \"titles\": \"name (en)\",\n \"lang\": \"en\"\n },{\n \"titles\": \"name (fr)\",\n \"lang\": \"fr\"\n },{\n \"titles\": \"name (de)\",\n \"lang\": \"de\"\n },{\n \"titles\": \"latitude\",\n \"datatype\": \"number\"\n },{\n \"titles\": \"longitude\",\n \"datatype\": \"number\"\n }]\n }\n}" ], "githubRepo": { "firstCommit": 2014, "stars": 145, "forks": 53, "subscribers": 54, "created": 2014, "updated": 2022, "description": "Documents produced by the CSV on the Web Working Group", "issues": 35, "url": "https://github.com/w3c/csvw" }, "repoStats": { "firstCommit": 2014, "commits": 2468, "committers": 29, "files": 1737 } }, "ct": { "title": "cT", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/02f9fa25ea213983601a5f855221ee3d42da3616" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2777", "wordRank": 2358, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2020|CRC Press|3D Image Reconstruction for CT and PET: A Practical Guide with Python (Focus Series in Medical Physics and Biomedical Engineering)|Panetta, Daniele and Camarlinghi, Niccolo|9780367219970" }, "ctalk-lang": { "title": "ctalk-lang", "appeared": 1989, "type": "pl", "description": "The CTalk programming language: a strategic evolution of APL", "reference": [ "http://kiwi.emse.fr/JJG/INTALK/ctalk.txt" ], "country": [ "France" ], "originCommunity": [ "École des Mines de Saint-Étienne" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// When working with the CTalk interpreter,\n// every result is printed\n2+3;\n// = 5\n2*3+5*10;\n// = 56\n// Variables are implicitely declared when\n// they are used for the first time\na=2; b=3; a+b;\n// = 2\n// = 3\n// = 5" ] }, "ctalk": { "title": "ctalk", "appeared": 2006, "type": "pl", "creators": [ "Robert Kiesling" ], "description": "Ctalk is a compact object oriented language that works closely with C. That means you can use Ctalk for GUI, network, client-server, and systems programs as well as traditional object oriented simulations.", "website": "https://sourceforge.net/projects/ctalk/", "country": [ "United States" ], "originCommunity": [ "https://github.com/ctalk" ] }, "ctan-pm": { "title": "ctan-pm", "appeared": 1998, "type": "packageManager", "website": "https://ctan.org/", "country": [ "United States" ], "originCommunity": [ "https://tug.org/" ], "domainName": { "registered": 1998, "awisRank": { "2022": 46714 }, "name": "ctan.org" }, "packageCount": 5649, "packageAuthors": 2588, "forLanguages": [ "tex" ] }, "ctr": { "title": "ctr", "appeared": 2017, "type": "pl", "website": "https://ctr-lang.com", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/ctr-lang" ], "domainName": { "registered": 2018, "name": "ctr-lang.com" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n14470252|Show HN: Ctr – The CSS Framework|https://ctr-lang.com/|2017-06-02 14:45:42 UTC|1496414742|artisin|0|5", "twitter": "https://twitter.com/ctr_lang" }, "cubase": { "title": "Steinberg Cubase", "appeared": 1989, "type": "application", "country": [ "Germany" ], "originCommunity": [ "Steinberg Media Technologies GmbH" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Steinberg_Cubase" } }, "cube": { "title": "CUBE", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ea5a280fe493c01cfaf461860c47c20f41264295" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5101", "wordRank": 7860, "centralPackageRepositoryCount": 0 }, "cuda": { "title": "CUDA", "appeared": 2007, "type": "pl", "website": "https://developer.nvidia.com/cuda-zone", "documentation": [ "https://docs.nvidia.com/cuda/" ], "standsFor": "Compute Unified Device Architecture", "originCommunity": [ "Nvidia" ], "releaseNotesUrl": "https://docs.nvidia.com/cuda/cuda-toolkit-release-notes/index.html", "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "printf" ] ], "wikipedia": { "example": [ "import numpy\nfrom pycublas import CUBLASMatrix\nA = CUBLASMatrix( numpy.mat([[1,2,3]],[[4,5,6]],numpy.float32) )\nB = CUBLASMatrix( numpy.mat([[2,3]],[4,5],[[6,7]],numpy.float32) )\nC = A*B\nprint C.np_mat()" ], "related": [ "linux", "c", "fortran", "opengl", "opencl", "llvmir", "python", "perl", "java", "ruby", "lua", "haskell", "r", "matlab", "idl", "mathematica", "common-lisp", "f-sharp" ], "summary": "CUDA is a parallel computing platform and application programming interface (API) model created by Nvidia. It allows software developers and software engineers to use a CUDA-enabled graphics processing unit (GPU) for general purpose processing – an approach termed GPGPU (General-Purpose computing on Graphics Processing Units). The CUDA platform is a software layer that gives direct access to the GPU's virtual instruction set and parallel computational elements, for the execution of compute kernels. The CUDA platform is designed to work with programming languages such as C, C++, and Fortran. This accessibility makes it easier for specialists in parallel programming to use GPU resources, in contrast to prior APIs like Direct3D and OpenGL, which required advanced skills in graphics programming. Also, CUDA supports programming frameworks such as OpenACC and OpenCL. When it was first introduced by Nvidia, the name CUDA was an acronym for Compute Unified Device Architecture, but Nvidia subsequently dropped the use of the acronym.", "pageId": 7933386, "dailyPageViews": 1966, "created": 2006, "backlinksCount": 444, "revisionCount": 1315, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/CUDA" }, "githubLanguage": { "fileExtensions": [ "cu", "cuh" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nrapidsai cudf https://github.com/rapidsai.png https://github.com/rapidsai/cudf Cuda #3A4E3A 1931 274 187 \"cuDF - GPU DataFrame Library\"\nDeepGraphLearning graphvite https://github.com/DeepGraphLearning.png https://github.com/DeepGraphLearning/graphvite Cuda #3A4E3A 433 47 285 \"A general and high-performance graph embedding system for various applications\"", "trendingProjectsCount": 3, "type": "programming", "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-c++src", "tmScope": "source.cuda-c++", "repos": 18135, "id": "Cuda" }, "githubBigQuery": { "repos": 4379, "users": 3764, "id": "Cuda" }, "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "cu", "cuh" ], "id": "CUDA" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2017, "committerCount": 3, "commitCount": 25, "sampleCount": 2, "example": [ "#include \n#include \n\n/**\n * CUDA Kernel Device code\n *\n * Computes the vector addition of A and B into C. The 3 vectors have the same\n * number of elements numElements.\n */\n__global__ void\nvectorAdd(const float *A, const float *B, float *C, int numElements)\n{\n int i = blockDim.x * blockIdx.x + threadIdx.x;\n\n if (i < numElements)\n {\n C[i] = A[i] + B[i];\n }\n}\n\n/**\n * Host main routine\n */\nint\nmain(void)\n{\n // Error code to check return values for CUDA calls\n cudaError_t err = cudaSuccess;\n\n // Launch the Vector Add CUDA Kernel\n int threadsPerBlock = 256;\n int blocksPerGrid =(numElements + threadsPerBlock - 1) / threadsPerBlock;\n vectorAdd<<>>(d_A, d_B, d_C, numElements);\n err = cudaGetLastError();\n\n if (err != cudaSuccess)\n {\n fprintf(stderr, \"Failed to launch vectorAdd kernel (error code %s)!\\n\", cudaGetErrorString(err));\n exit(EXIT_FAILURE);\n }\n\n // Reset the device and exit\n err = cudaDeviceReset();\n\n return 0;\n}" ], "url": "https://github.com/harrism/sublimetext-cuda-cpp" }, "helloWorldCollection": [ "// Hello world in CUDA\n\n#include \n \nconst int N = 16; \nconst int blocksize = 16; \n \n__global__ \nvoid hello(char *a, int *b) \n{\n\ta[threadIdx.x] += b[threadIdx.x];\n}\n \nint main()\n{\n\tchar a[N] = \"Hello \\0\\0\\0\\0\\0\\0\";\n\tint b[N] = {15, 10, 6, 0, -11, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};\n \n\tchar *ad;\n\tint *bd;\n\tconst int csize = N*sizeof(char);\n\tconst int isize = N*sizeof(int);\n \n\tprintf(\"%s\", a);\n \n\tcudaMalloc( (void**)&ad, csize ); \n\tcudaMalloc( (void**)&bd, isize ); \n\tcudaMemcpy( ad, a, csize, cudaMemcpyHostToDevice ); \n\tcudaMemcpy( bd, b, isize, cudaMemcpyHostToDevice ); \n\t\n\tdim3 dimBlock( blocksize, 1 );\n\tdim3 dimGrid( 1, 1 );\n\thello<<>>(ad, bd);\n\tcudaMemcpy( a, ad, csize, cudaMemcpyDeviceToHost ); \n\tcudaFree( ad );\n\tcudaFree( bd );\n\t\n\tprintf(\"%s\\n\", a);\n\treturn EXIT_SUCCESS;\n}" ], "leachim6": { "filepath": "c/Cuda.cu", "fileExtensions": [ "cu" ], "example": [ "#include \n\n__global__ void hello_world(){\n printf(\"Hello World\\n\");\n}\n\nint main() {\n hello_world<<<1,1>>>();\n return 0;\n}\n" ], "id": "Cuda" }, "indeedJobs": { "2017": 483, "query": "cuda engineer" }, "linkedInSkill": { "2018": 28572, "id": "cuda" }, "officialBlogUrl": [ "https://developer.nvidia.com/blog/tag/cuda/" ], "faqPageUrl": [ "https://developer.nvidia.com/cuda-faq" ], "downloadPageUrl": [ "https://developer.nvidia.com/cuda-downloads" ], "meetup": { "memberCount": 9400, "groupCount": 32, "url": "https://www.meetup.com/topics/cuda" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCuda by Example: An Introduction to General-Purpose Gpu Programming|2010|Jason Sanders|12911195|4.03|131|13\nProfessional Cuda C Programming|2014|John Cheng|39965022|4.14|7|0", "isbndb": "year|publisher|title|authors|isbn13\n2010|Addison-Wesley Professional|CUDA by Example: An Introduction to General-Purpose GPU Programming|Sanders / Kandrot, Jason|9780131387683\n2013|Pearson|Cuda Handbook|Nicholas Wilt|9780133261493\n2014|Machinery Industry Press|CUDA Programming: A Developers Guide to Parallel Computing with GPUs(Chinese Edition)|[ MEI ] KU KE ( Shane Cook )|9787111448617\n2010|Addison-Wesley Professional|CUDA by Example: An Introduction to General-Purpose GPU Programming|Sanders, Jason and Kandrot, Edward|9780132180139\n2019-09-27T00:00:01Z|Packt Publishing|Learn CUDA Programming: A beginner's guide to GPU programming and parallel computing with CUDA 10.x and C/C++|Han, Jaegeun and Sharma, Bharatkumar|9781788996242\n2018|Packt Publishing|Hands-On GPU Programming with Python and CUDA: Explore high-performance parallel computing with CUDA|Tuomanen, Dr. Brian|9781788993913\n2014|Wrox|Professional CUDA C Programming|Cheng, John and Grossman, Max and McKercher, Ty|9781118739327\n2014|Wrox|Professional CUDA C Programming|Cheng, John and Grossman, Max and McKercher, Ty|9781118739310\n2013|Addison-Wesley Professional|The CUDA Handbook: A Comprehensive Guide to GPU Programming|Wilt, Nicholas Wilt|9780321809469\n2013|Morgan Kaufmann|CUDA Fortran for Scientists and Engineers: Best Practices for Efficient CUDA Fortran Programming|Ruetsch, Gregory and Fatica, Massimiliano|9780124169708\n2012|Morgan Kaufmann|CUDA Programming: A Developer's Guide to Parallel Computing with GPUs (Applications of Gpu Computing)|Cook, Shane|9780124159884\n2011|Morgan Kaufmann|CUDA Application Design and Development|Farber, Rob|9780123884329\n2013|Addison-Wesley Professional|CUDA Handbook, The: A Comprehensive Guide to GPU Programming|Wilt, Nicholas|9780133261509\n2012|Morgan Kaufmann|CUDA Programming: A Developer's Guide to Parallel Computing with GPUs (Applications of Gpu Computing)|Cook, Shane|9780124159334\n2011|Morgan Kaufmann|CUDA Application Design and Development|Farber, Rob|9780123884268\n2018|Apress|Deep Belief Nets in C++ and CUDA C: Volume 2: Autoencoding in the Complex Domain|Masters, Timothy|9781484236468\n2012|LAP LAMBERT Academic Publishing|Image Processing Using CUDA: Designing an object oriented framework for CUDA based image processing|Shete, Pritam and Bose, Surojit Kumar|9783659135569\n2016|Createspace Independent Publishing Platform|Cuda Winner|Charles Brown|9781540660251\n2016|Createspace Independent Publishing Platform|Cuda For Newbies|Dylan Skinner|9781540604323\n2015|Addison-Wesley Longman, Incorporated|Cuda For Engineers|Duane Storti|9780134177519\n2010|Pearson|CUDA by Example|Jason Sanders and Edward Kandrot|9780132180146\n2019-09-27|Packt Publishing|Learn CUDA Programming|Jaegeun Han and Bharatkumar Sharma|9781788991292\n20151102|Pearson Technology Group|CUDA for Engineers|Duane Storti; Mete Yurtoglu|9780134177557\n2014-09-02|Wiley Professional Development (P&T)|Professional CUDA C Programming|John Cheng, Max Grossman, Ty McKercher|9781118739273\n20220602|Cambridge University Press|Programming in Parallel with CUDA Programming in Parallel with CUDA|Richard Ansorge|9781108858885\n09/2013|Elsevier S & T|CUDA Fortran for Scientists and Engineers: Best Practices for Efficient CUDA Fortran Programming|Ruetsch, Gregory; Fatica, Massimiliano|9780124169722\n20180119|Taylor & Francis|GPU Parallel Program Development Using CUDA|Tolga Soyata|9781498750806\n27-11-2018|Packt Publishing|Hands-On GPU Programming with Python and CUDA|Dr. Brian Tuomanen|9781788995221\n|Wrox|Nvidia Gpu Programming: Massively Parallel Programming With Cuda|Cook and Shane|9780470939055\n2013|Addison-wesley|The Cuda Handbook: A Comprehensive Guide To Gpu Programming|Wilt, Nicholas , 1970-|9780133261516\n20180704|Springer Nature|Deep Belief Nets in C and CUDA C: Volume 3|Timothy Masters|9781484237212\n20180423|Springer Nature|Deep Belief Nets in C and CUDA C: Volume 1|Timothy Masters|9781484235911\n2019-01-23|LAP LAMBERT Academic Publishing|Novel Open Source Morphology Using GPU Processing With LTU- CUDA|Jagannathan Gnanasekaran|9786139444151", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|CUDA by Example: An Introduction to General-Purpose GPU Programming|10.12694/SCPE.V11I4.663|1084|118|Jie Cheng|64ce52ec9f550ddd980e209ca68ff38947cf9061\n2012|accULL: An OpenACC Implementation with CUDA and OpenCL Support|10.1007/978-3-642-32820-6_86|84|2|Ruymán Reyes and I. López-Rodríguez and J. Fumero and F. Sande|871d9641582562f9a83ed785ce3051f3e9e95483\n2011|GPU programming in a high level language: compiling X10 to CUDA|10.1145/2212736.2212744|59|8|D. Cunningham and R. Bordawekar and V. Saraswat|c0f1c45ef7c9fb9751fdcc268daac62b70a7bd78\n2009|GPU-accelerated SART reconstruction using the CUDA programming environment|10.1117/12.811559|49|5|B. Keck and H. Hofmann and H. Scherl and M. Kowarschik and J. Hornegger|e7b73201f2763e2e7b6d828b6dfa95fdbe31ba17\n2016|CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications|10.1007/978-3-319-42432-3_29|37|4|M. Joldes and J. Muller and V. Popescu and W. Tucker|1f324e5b66a3710250b44db80506fd8fde4c712f\n2012|Overview and comparison of OpenCL and CUDA technology for GPGPU|10.1109/APCCAS.2012.6419068|34|1|Ching-Lung Su and Po-Yu Chen and Chun-Chieh Lan and Lung-Sheng Huang and Kuo-Hsuan Wu|f88d8ee763f8fc5e80a59be045926f6df13ac9fc\n2017|BARRACUDA: binary-level analysis of runtime RAces in CUDA programs|10.1145/3062341.3062342|25|7|Ariel Eizenberg and Yuanfeng Peng and Toma Pigli and William Mansky and Joseph Devietti|069794b44b81c8b0651c8ea39594a91cd6081142\n2013|Efficient compilation of CUDA kernels for high-performance computing on FPGAs|10.1145/2514641.2514652|22|0|Alexandros Papakonstantinou and Karthik Gururaj and J. Stratton and Deming Chen and J. Cong and W. Hwu|f24f326226d8143a1ff0afed7042edcd85534a3b\n2011|Evolving CUDA PTX programs by quantum inspired linear genetic programming|10.1145/2001858.2002026|14|0|L. F. Cupertino and C. D. Silva and D. M. Dias and M. Pacheco and C. Bentes|78c1cb63859f9ea84c772c8ec4fc72c7791a2a7c\n2013|CUDA Expression Templates for Electromagnetic Applications on GPUs [EM Programmer's Notebook]|10.1109/MAP.2013.6735497|12|0|A. Breglia and A. Capozzoli and C. Curcio and A. Liseno|becd4d7bad6d6b316e755b4038fa3cccd00662f0\n2014|C2CU : A CUDA C Program Generator for Bulk Execution of a Sequential Algorithm|10.1007/978-3-319-11194-0_14|11|0|Daisuke Takafuji and K. Nakano and Yasuaki Ito|827cf47256651fc955ce880efc65e8292d445401\n2014|Parallelized Seeded Region Growing Using CUDA|10.1155/2014/856453|9|1|Seongjin Park and Jeongjin Lee and Hyunna Lee and Juneseuk Shin and Jinwook Seo and K. Lee and Y. Shin and B. H. Kim|9c2bc31d176bbea810a7c1b654054271efd75135\n2020|Porting a Legacy CUDA Stencil Code to oneAPI|10.1109/IPDPSW50202.2020.00070|9|0|Steffen Christgau and T. Steinke|8a91d5e27422f66ecbf4d24965484a7a778e74f9\n2020|Computer vision algorithms acceleration using graphic processors NVIDIA CUDA|10.1007/s10586-020-03090-6|9|0|Mouna Afif and Yahia Said and M. Atri|e3adb20131eedbbdb31befa59e40a1d32a3c4847\n2015|SciPAL: Expression Templates and Composition Closure Objects for High Performance Computational Physics with CUDA and OpenMP|10.1145/2686886|8|0|S. Kramer and J. Hagemann|ad752065baa739eac4144fc98ce595cd6a68dfa2\n2019|Real-time moving human detection using HOG and Fourier descriptor based on CUDA implementation|10.1007/s11554-019-00935-1|7|0|Haythem Bahri and Marwa Chouchene and F. Sayadi and Mohamed Atri|5eea36b60acc51b215442d4e04875d97066b59b6\n2011|Using a commercial graphical processing unit and the CUDA programming language to accelerate scientific image processing applications|10.1117/12.872217|7|0|R. Broussard and R. Ives|af5e6a48632822ddff4d961f97a79bfedb58d4aa\n2018|Efficient 2D Convolution Filters Implementations on Graphics Processing Unit Using NVIDIA CUDA|10.5815/IJIGSP.2018.08.01|6|0|Mouna Afif and Yahia Said and Mohamed Atri|29958dcd1f577c4961d495c203871028c8b23538\n2016|Breast Cancer Prediction by Logistic Regression with CUDA Parallel Programming Support|10.4172/2572-4118.1000111|5|0|Aless and R. Peretti and F. Amenta|d28520dd4a74a1768a205fc0cedaae33a2a81758\n2018|Efficient implementation of integrall image algorithm on NVIDIA CUDA|10.1109/ASET.2018.8379824|3|0|Mouna Afif and Yahia Said and Mohamed Atri|92787e77b59c0a25b8b39d18f33981a12cd50748\n2014|Document clustering using Multi-Objective Genetic Algorithms with parallel programming based on CUDA|10.5220/0005057502800287|3|0|Jung Song Lee and Soon-cheol Park and Jong-Joo Lee and Han-hee Ham|4d06b455d105dd62d35197dc7b5df463f7a25ca4\n2015|Programming in CUDA for Kepler and Maxwell Architecture|10.22456/2175-2745.56384|3|1|E. Clua and M. Zamith|a3f9bb343703d6cb8a5f772bc99fa0c9013b1ecd\n2018|Research on Matrix Multiplication Based on the Combination of OpenACC and CUDA|10.1007/978-981-13-7025-0_10|2|0|Yuexing Wang|ad94df1c7457f50fde21feda7b646a3d681c10b0\n2016|A Performance Study of Random Neural Network as Supervised Learning Tool Using CUDA|10.6138/JIT.2016.17.4.20141014D|2|0|S. Basterrech and J. Janousek and V. Snášel|c175a68fbf783a77d34357ae0977ecf1824aaf5c\n2017|GPU accelerated foreground segmentation using CodeBook model and shadow removal using CUDA|10.1109/CCAA.2017.8229924|2|0|Praveen Gudivaka and N. Mishra and A. Agrawal|088708e87e9e34445bcccd414ab4b729acd9219c\n2021|Impact of CUDA and OpenCL on Parallel and Distributed Computing|10.1109/ICEEE52452.2021.9415927|2|0|A. Asaduzzaman and Alec Trent and S. Osborne and C. Aldershof and F. Sibai|b8dd58407502f25fdc07b2ae83659e247c4b1f9b\n2019|Cuda Parallelization of Commit Framework for Efficient Microstructure-Informed Tractography|10.1109/ISBI.2019.8759098|1|0|Erick Hernandez-Gutierrez and Alonso Ramirez-Manzanares and J. Marroquín and Mario Ocampo-Pineda and Alessandro Daducci|65c7d25ad189d1d58232eb304035f22f0ee3c59e\n2019|Detecting Undefined Behaviors in CUDA C|10.1109/ACCESS.2019.2954143|1|0|Wentao Li and Jianhua Sun and Hao Chen|00add03c6fa715baf0ad2798848ffc1817bf6a7e\n2014|A Compiler Translate Directive-Based Language to Optimized CUDA|10.1109/HPCC.2014.162|1|0|Feng Li and Hong An and Weihao Liang and Xiaoqiang Li and Yichao Cheng and Xia Jiang|2b948c35fdb64183cc0a88fc9a84960187a15d6d" }, "cuecat": { "title": "CueCat", "appeared": 2000, "type": "barCodeFormat", "wikipedia": { "url": "https://en.wikipedia.org/wiki/CueCat" }, "isbndb": "" }, "cuelang": { "title": "Cue", "appeared": 2018, "type": "dataNotation", "creators": [ "Marcel van Lohuizen" ], "website": "https://cuelang.org/", "webRepl": [ "https://cuelang.org/play" ], "country": [ "United Kingdom and United States and Switzerland" ], "originCommunity": [ "https://github.com/cue-lang" ], "domainName": { "registered": 2018, "awisRank": { "2022": 1108581 }, "name": "cuelang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "#Spec: {\n kind: string\n\n name: {\n first: !=\"\" // must be specified and non-empty\n middle?: !=\"\" // optional, but must be non-empty when specified\n last: !=\"\"\n }\n\n // The minimum must be strictly smaller than the maximum and vice versa.\n minimum?: int & minimum\n}\n\n// A spec is of type #Spec\nspec: #Spec\nspec: {\n knid: \"Homo Sapiens\" // error, misspelled field\n\n name: first: \"Jane\"\n " ], "githubRepo": { "firstCommit": 2018, "stars": 3148, "forks": 188, "subscribers": 49, "created": 2019, "updated": 2022, "description": "CUE has moved to https://github.com/cue-lang/cue", "issues": 1, "url": "https://github.com/cuelang/cue" }, "repoStats": { "firstCommit": 2018, "commits": 1527, "committers": 63, "files": 1421 }, "twitter": "https://twitter.com/cue_lang", "isbndb": "" }, "culler-fried-system": { "title": "Culler-Fried System", "appeared": 1961, "type": "pl", "creators": [ "Glenn Culler", "Burton Fried" ], "description": "System for interactive mathematics by Glen Culler and Burton Fried of Thompson Ramo Wooldridge Inc.", "country": [ "United States" ], "originCommunity": [ "Thompson Ramo Wooldridge Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=393" }, "cullinet": { "title": "Cullinet", "appeared": 1968, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Cullinane Corporation" ], "wikipedia": { "related": [ "mark-iv", "model-204", "powerbuilder", "linux", "cobol", "ibm-rpg" ], "summary": "Cullinet was a software company whose products included the database management system IDMS and the integrated software package Goldengate. In 1989, the company was bought by Computer Associates. Cullinet was headquartered at 400 Blue Hill Drive in Westwood, Massachusetts.", "created": 2005, "backlinksCount": 22, "pageId": 1973261, "revisionCount": 157, "dailyPageViews": 14, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/Cullinet" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "cuneiform": { "title": "cuneiform", "appeared": 2015, "type": "pl", "website": "http://www.cuneiform-lang.org", "country": [ "European Union" ], "originCommunity": [ "BiobankCloud" ], "domainName": { "registered": 2015, "name": "cuneiform-lang.org" }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 203, "forks": 15, "subscribers": 13, "created": 2014, "updated": 2022, "description": "Cuneiform distributed programming language", "issues": 8, "url": "https://github.com/joergen7/cuneiform/" }, "repoStats": { "firstCommit": 2014, "commits": 553, "committers": 11, "files": 11 }, "leachim6": { "filepath": "c/Cuneiform.cfl", "fileExtensions": [ "cfl" ], "example": [ "def greet() -> \nin Bash *{\n out=\"Hello World\"\n}*\n\n( greet()|out );\n" ], "id": "Cuneiform" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n11025942|Show HN: Cuneiform – A Functional Workflow Language|http://www.cuneiform-lang.org/|2016-02-03 11:45:56 UTC|1454499956|joergen7|10|39" }, "cupid": { "title": "CUPID", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2f7456398ed58b2945cdf27f5a86644742ae9a2b", "https://dsf.berkeley.edu/papers/pacific75-cupid.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "hopl": "https://hopl.info/showlanguage.prx?exp=676", "centralPackageRepositoryCount": 0 }, "cupit-2": { "title": "CuPit-2", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/837acdd862a919346283c00f450caea87a779960" ], "country": [ "Germany" ], "originCommunity": [ "Karlsruhe Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7207", "centralPackageRepositoryCount": 0 }, "curl": { "title": "Curl", "appeared": 1998, "type": "pl", "creators": [ "Steve Ward" ], "website": "http://www.curl.com", "country": [ "Japan", "United States" ], "originCommunity": [ "Curl, Inc", "Sumisho Computer Systems Corp", "SCSK Corporation" ], "domainName": { "registered": 1997, "awisRank": { "2022": 1053325 }, "name": "curl.com" }, "visualParadigm": false, "hasMultipleInheritance": { "example": "", "value": true }, "wikipedia": { "example": [ "{poem || wraps entire poem\n {stanza || first verse here in any language\n }\n {stanza || another verse here in any language\n }\n }" ], "related": [ "linux", "html", "javascript", "lisp", "java", "csharp", "css", "groovy" ], "summary": "Curl is a reflective object-oriented programming language for interactive web applications whose goal is to provide a smoother transition between formatting and programming. It makes it possible to embed complex objects in simple documents without needing to switch between programming languages or development platforms. The Curl implementation initially consisted of just an interpreter, but a compiler was added later. Curl combines text markup (as in HTML), scripting (as in JavaScript), and heavy-duty computing (as in Java, C#, or C++) within one unified framework. It is used in a range of internal enterprise, B2B, and B2C applications. Curl programs may be compiled into Curl applets, that are viewed using the Curl RTE, a runtime environment with a plugin for web browsers. Currently, it is supported on Microsoft Windows, Linux, and macOS. Curl supports \"detached applets\", which is a web deployed applet which runs on the user's desktop independent of a browser window much as in Silverlight 3 and Adobe AIR.", "pageId": 42537, "dailyPageViews": 110, "created": 2002, "backlinksCount": 102, "revisionCount": 197, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Curl_(programming_language)" }, "tiobe": { "id": "Curl" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8042", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2003|Charles River Media|Practical Guide to Curl (Programming Series)|Hanegan, Kevin|9781584502883\n2002|John Wiley &Sons|Curl Programming Bible|Damle, Nikhil|9780764549427", "semanticScholar": "" }, "curly": { "title": "Curly", "appeared": 2021, "type": "pl", "creators": [ "jenra" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/curly-lang/curly-lang" ], "githubRepo": { "firstCommit": 2021, "stars": 31, "forks": 2, "subscribers": 4, "created": 2021, "updated": 2022, "description": "The Curly programming language (now in Rust!)", "issues": 2, "url": "https://github.com/curly-lang/curly-lang" }, "repoStats": { "firstCommit": 2021, "commits": 465, "committers": 5, "files": 61 } }, "curry": { "title": "Curry", "appeared": 1990, "type": "pl", "creators": [ "Michael Hanus", "Sergio Antoy" ], "country": [ "Germany" ], "originCommunity": [ "University of Kiel" ], "related": [ "haskell" ], "influencedBy": [ "haskell" ], "visualParadigm": false, "hasSemanticIndentation": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "insert x ys = x : ys\n insert x (y:ys) = y : insert x ys" ], "related": [ "c", "haskell", "prolog" ], "summary": "Curry is an experimental functional logic programming language, based on the Haskell language. It merges elements of functional and logic programming, including constraint programming integration. It is nearly a superset of Haskell, lacking support mostly for overloading using type classes, which some implementations provide anyway as a language extension, such as the Münster Curry Compiler.", "pageId": 302187, "created": 2003, "backlinksCount": 53, "revisionCount": 126, "dailyPageViews": 51, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Curry_(programming_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "curry" ], "aceMode": "haskell", "tmScope": "source.curry", "repos": 4, "id": "Curry" }, "githubBigQuery": { "repos": 1, "users": 1, "id": "Curry" }, "leachim6": { "filepath": "c/Curry.curry", "fileExtensions": [ "curry" ], "example": [ "-- \"Hello World\" demo for the Tcl/Tk library\n\nimport Tk\n\nmain = runWidget \"Hello\"\n (TkCol [] [TkLabel [TkText \"Hello World\"],\n TkButton tkExit [TkText \"Stop\"]])\n" ], "id": "Curry" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Curry", "rijuRepl": { "example": [ "main :: IO ()\nmain = putStrLn \"Hello, world!\"\n" ], "id": "https://riju.codes/curry" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2005|Association For Computing Machinery (acm)|Wcflp '05: Proceedings Of The Acm Sigplan 2005 Workshop On Curry And Functional Logic Programming, September 29, 2005, Tallinn, E|Acm Special Interest Group On Programmin and N/a|9781595930699" }, "curv": { "title": "curv", "appeared": 2016, "type": "pl", "creators": [ "Doug Moen" ], "description": "Curv is a programming language for creating art using mathematics. It’s a 2D and 3D geometric modelling tool that supports full colour, animation and 3D printing.", "website": "http://www.curv3d.org/", "reference": [ "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/curv3d" ], "domainName": { "registered": 2018, "name": "curv3d.org" }, "githubRepo": { "firstCommit": 2016, "stars": 1030, "forks": 69, "subscribers": 30, "created": 2017, "updated": 2022, "description": "a language for making art using mathematics", "issues": 29, "url": "https://github.com/curv3d/curv" }, "repoStats": { "firstCommit": 2016, "commits": 3954, "committers": 25, "files": 1557 }, "isbndb": "" }, "cuscus": { "title": "cuscus", "appeared": 2019, "type": "pl", "creators": [ "Mariana Marasoiu", "Detlef Nauck", "Alan F. Blackwell" ], "description": "We present Cuscus, a tool for data visualisation that is informed by ethnographic fieldwork across different professional sectors. Cuscus allows end-users to create novel visualisations by defining visual properties in a spreadsheet. We also report on user studies in the contexts of data journalism and business analytics, and discuss further extensions to this new interaction paradigm.", "reference": [ "https://www.semanticscholar.org/paper/Cuscus%3A-An-End-User-Programming-Tool-for-Data-Marasoiu-Nauck/bdcea9a40abd143a1b53d702ef7fd31b8022e101" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge", "Applied Research" ] }, "cusip": { "title": "Committee on Uniform Security Identification Procedures", "appeared": 1968, "type": "schema", "standsFor": "Committee on Uniform Security Identification Procedures", "country": [ "United States" ], "originCommunity": [ "Committee on Uniform Security Identification Procedures" ], "wikipedia": { "example": [ "algorithm Cusip-Check-Digit(cusip) is\n Input: an 8-character CUSIP\n\n sum := 0\n for 1 ≤ i ≤ 8 do\n c := the ith character of cusip\n if c is a digit then\n v := numeric value of the digit c\n else if c is a letter then\n p := ordinal position of c in the alphabet (A=1, B=2...)\n v := p + 9\n else if c = \"*\" then\n v := 36\n else if c = \"@\" then\n v := 37\n else if c = \"#\" then\n v := 38\n end if\n if i is even then\n v := v × 2\n end if\n\n sum := sum + int ( v div 10 ) + v mod 10\n repeat\n\n return (10 - (sum mod 10)) mod 10\nend function" ], "summary": "A CUSIP is a nine-character alphanumeric code that identifies a North American financial security for the purposes of facilitating clearing and settlement of trades. The CUSIP was adopted as an American National Standard under Accredited Standards X9.6. The CUSIP system is owned by the American Bankers Association and is operated by S&P Global Market Intelligence. The operating body, CUSIP Global Services (CGS), also serves as the national numbering agency (NNA) for North America, and the CUSIP serves as the National Securities Identification Number (NSIN) for products issued from both the United States and Canada. In its role as the NNA, CUSIP Global Services (CGS) also assigns all US-based ISINs.", "created": 2004, "backlinksCount": 40, "pageId": 1083873, "revisionCount": 290, "dailyPageViews": 233, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/CUSIP" }, "centralPackageRepositoryCount": 0 }, "cvl": { "title": "CVL", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8baa5abf530e18801a7565645644e983a4b72415" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3587", "centralPackageRepositoryCount": 0 }, "cweb": { "title": "CWEB", "appeared": 1987, "type": "textMarkup", "creators": [ "Donald Knuth" ], "website": "http://www-cs-faculty.stanford.edu/~uno/cweb.html", "country": [ "Netherlands" ], "originCommunity": [ "Stanford University" ], "example": [ "\\datethis\n@*Intro. This program generates clauses for the transition relation\nfrom time $t$ to time $t+1$ in Conway's Game of Life, assuming that\nall of the potentially live cells at time $t$ belong to a pattern\nthat's specified in |stdin|. The pattern is defined by one or more\nlines representing rows of cells, where each line has `\\..' in a\ncell that's guaranteed to be dead at time~$t$, otherwise it has `\\.*'.\nThe time is specified separately as a command-line parameter.\n\nThe Boolean variable for cell $(x,y)$ at time $t$ is named by its\nso-called ``xty code,'' namely by the decimal value of~$x$, followed\nby a code letter for~$t$, followed by the decimal value of~$y$. For\nexample, if $x=10$ and $y=11$ and $t=0$, the variable that indicates\nliveness of the cell is \\.{10a11}; and the corresponding variable\nfor $t=1$ is \\.{10b11}.\n\nUp to 19 auxiliary variables are used together with each xty code,\nin order to construct clauses that define the successor state.\nThe names of these variables are obtained by appending one of\nthe following two-character combinations to the xty code:\n\\.{A2}, \\.{A3}, \\.{A4},\n\\.{B1}, \\.{B2}, \\.{B3}, \\.{B4},\n\\.{C1}, \\.{C2}, \\.{C3}, \\.{C4},\n\\.{D1}, \\.{D2},\n\\.{E1}, \\.{E2},\n\\.{F1}, \\.{F2},\n\\.{G1}, \\.{G2}.\nThese variables are derived from the Bailleux--Boufkhad method\nof encoding cardinality constraints:\nThe auxiliary variable \\.{A$k$} stands for the condition\n``at least $k$ of the eight neighbors are alive.'' Similarly,\n\\.{B$k$} stands for ``at least $k$ of the first four neighbors\nare alive,'' and \\.{C$k$} accounts for the other four neighbors.\nCodes \\.D, \\.E, \\.F, and~\\.G refer to pairs of neighbors.\nThus, for instance, \\.{10a11C2} means that at least two of the\nlast four neighbors of cell $(10,11)$ are alive.\n\nThose auxiliary variables receive values by means of up to 77 clauses per cell.\nFor example, if $u$ and~$v$ are the neighbors of cell~$z$ that correspond\nto a pairing of type~\\.D, there are six clauses\n$$\\bar u d_1,\\quad\n \\bar v d_1,\\quad" ], "wikipedia": { "example": [ "% This file is part of CWEB.\n % This program by Silvio Levy and Donald E. Knuth\n % is based on a program by Knuth.\n % It is distributed WITHOUT ANY WARRANTY, express or implied.\n % Version 3.64 --- January 2002\n \n % Copyright (C) 1987,1990,1993,2000 Silvio Levy and Donald E. Knuth \n \n % Permission is granted to make and distribute verbatim copies of this\n % document provided that the copyright notice and this permission notice\n % are preserved on all copies.\n \n % Permission is granted to copy and distribute modified versions of this\n % document under the conditions for verbatim copying, provided that the\n % entire resulting derived work is given a different name and distributed\n % under the terms of a permission notice identical to this one." ], "related": [ "tex", "c", "java", "pascal" ], "summary": "CWEB is a computer programming system created by Donald Knuth and Silvio Levy as a follow-up to Knuth's WEB literate programming system, using the C programming language (and to a lesser extent the C++ and Java programming languages) instead of Pascal. Like WEB, it consists of two primary programs: CTANGLE, which produces compilable C code from the source texts, and CWEAVE, which produces nicely-formatted printable documentation using TeX.", "pageId": 87398, "created": 2002, "backlinksCount": 94, "revisionCount": 73, "dailyPageViews": 31, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/CWEB" }, "githubLanguage": { "fileExtensions": [ "w" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 425, "id": "CWeb" }, "githubBigQuery": { "repos": 53, "users": 53, "id": "CWeb" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1939", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "cx": { "title": "cx", "appeared": 2015, "type": "pl", "website": "http://cx-lang.org", "country": [ "Finland" ], "originCommunity": [ "https://github.com/cx-language" ], "domainName": { "registered": 2021, "name": "cx-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n8915977|The Cx programming language: digital hardware design for developers|http://cx-lang.org/|2015-01-20 08:32:26 UTC|1421742746|jclis|47|106" }, "cyber": { "title": "Cyber", "appeared": 2022, "type": "pl", "description": "Cyber is a new language for fast, efficient, and concurrent scripting.", "website": "https://cyberscript.dev/", "hasImports": { "example": "import m 'math'", "value": true }, "hasStrings": { "example": "'World'", "value": true }, "hasForEachLoops": { "example": "for worlds each w:\n print 'Hello, {w}!'", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasFunctions": { "example": "func fib(n int) int:\n coyield\n if n < 2:\n return n\n return fib(n - 1) + fib(n - 2)", "value": true }, "hasPrintDebugging": { "example": "print '{res} {count}'", "value": true }, "hasAssignment": { "example": "count = 0", "value": true }, "hasLineComments": { "example": "-- Counts iterations.", "value": true }, "hasIntegers": { "example": "count = 0", "value": true }, "hasWhileLoops": { "example": "while fiber.status() != #done:\n res = coresume fiber\n count += 1", "value": true }, "example": [ "import m 'math'\n\nworlds = ['World', '世界', 'दुनिया']\nworlds.append(m.random())\nfor worlds each w:\n print 'Hello, {w}!'\n\nfunc fib(n int) int:\n coyield\n if n < 2:\n return n\n return fib(n - 1) + fib(n - 2)\n\ncount = 0 -- Counts iterations.\nfiber = coinit fib(30)\nwhile fiber.status() != #done:\n res = coresume fiber\n count += 1\nprint '{res} {count}'" ], "githubRepo": { "stars": 272, "forks": 7, "subscribers": 10, "created": 2022, "updated": 2023, "description": "Fast and concurrent scripting.", "issues": 10, "url": "https://github.com/fubark/cyber" }, "repoStats": { "firstCommit": 2022, "commits": 866, "committers": 8, "files": 309 } }, "cybil": { "title": "CYBIL", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Control Data Corporation" ], "wikipedia": { "related": [ "pascal" ], "summary": "Cybil (short for the Cyber Implementation Language of the Control Data Network Operating System) was a Pascal-like language developed at Control Data Corporation. Cybil was used as the implementation language for the NOS/VE operating system on the CDC Cyber series and was also used to write the eOS operating system for the ETA10 supercomputer in the 1980s.", "pageId": 32669131, "created": 2011, "backlinksCount": 6, "revisionCount": 21, "dailyPageViews": 4, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Cybil_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1941", "fileType": "text", "centralPackageRepositoryCount": 0 }, "cycl": { "title": "CYCL", "appeared": 1988, "type": "pl", "website": "https://cyc.com/", "reference": [ "https://semanticscholar.org/paper/fc1584ebf311e8343c91dcc9ad8e5ef19d815bda" ], "country": [ "United States" ], "originCommunity": [ "Cycorp, Inc" ], "wikipedia": { "example": [ "(#$relationAllExists #$biologicalMother #$ChordataPhylum #$FemaleAnimal)" ], "summary": "CycL in computer science and artificial intelligence is an ontology language used by Doug Lenat's Cyc artificial intelligence project. Ramanathan V. Guha was instrumental in the design of early versions of the language. There is a close variant of CycL known as MELD. The original version of CycL was a frame language, but the modern version is not. Rather, it is a declarative language based on classical first-order logic, with extensions for modal operators and higher order quantification. CycL is used to represent the knowledge stored in the Cyc Knowledge Base, available from Cycorp. The source code written in CycL released with the OpenCyc system is licensed as open source, to increase its usefulness in supporting the semantic web.", "backlinksCount": 32, "pageId": 87136, "dailyPageViews": 45, "created": 2002, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/CycL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1546", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "cyclone": { "title": "Cyclone", "appeared": 2001, "type": "pl", "website": "http://cyclone.thelanguage.org", "country": [ "United States" ], "originCommunity": [ "AT&T Labs" ], "domainName": { "name": "cyclone.thelanguage.org" }, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "printf" ] ], "wikipedia": { "example": [ "char *itoa(int i)\n {\n char buf[20], *z;\n sprintf(buf,\"%d\",i);\n z = buf;\n return z;\n }" ], "related": [ "c", "rust", "ml" ], "summary": "The Cyclone programming language is intended to be a safe dialect of the C language. Cyclone is designed to avoid buffer overflows and other vulnerabilities that are possible in C programs, without losing the power and convenience of C as a tool for system programming. Cyclone development was started as a joint project of AT&T Labs Research and Greg Morrisett's group at Cornell in 2001. Version 1.0 was released on May 8, 2006.", "pageId": 7645, "created": 2002, "backlinksCount": 28, "revisionCount": 133, "dailyPageViews": 43, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Cyclone_(programming_language)" }, "leachim6": { "filepath": "c/Cyclone.cyc", "fileExtensions": [ "cyc" ], "example": [ "#include \nint main() {\n printf(\"Hello World\\n\");\n return 0;\n}\n" ], "id": "Cyclone" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3312", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Cyclone (programming Language)|Frederic P. Miller|9786132847225" }, "cycript": { "title": "Cycript", "appeared": 2008, "type": "pl", "website": "http://www.cycript.org/", "reference": [ "https://git.saurik.com/cycript.git" ], "country": [ "United States" ], "originCommunity": [ "SaurikIT, LLC" ], "domainName": { "registered": 2009, "awisRank": { "2022": 5229542 }, "name": "cycript.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubLanguage": { "fileExtensions": [ "cy" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "javascript", "codemirrorMode": "javascript", "codemirrorMimeType": "text/javascript", "tmScope": "source.js", "repos": 70, "id": "Cycript" }, "githubBigQuery": { "repos": 66, "users": 49, "id": "Cycript" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 103, "commitCount": 1133, "sampleCount": 1, "example": [ "(function(utils) {\n\t// Load C functions declared in utils.loadFuncs\n\tvar shouldLoadCFuncs = true;\n\t// Expose the C functions to cycript's global scope\n\tvar shouldExposeCFuncs = true;\n\t// Expose C constants to cycript's global scope\n\tvar shouldExposeConsts = true;\n\t// Expose functions defined here to cycript's global scope\n\tvar shouldExposeFuncs = true;\n\t// Which functions to expose\n\tvar funcsToExpose = [\"exec\", \"include\", \"sizeof\", \"logify\", \"apply\", \"str2voidPtr\", \"voidPtr2str\", \"double2voidPtr\", \"voidPtr2double\", \"isMemoryReadable\", \"isObject\", \"makeStruct\"];\n\t\n\t// C functions that utils.loadFuncs loads\n\tvar CFuncsDeclarations = [\n\t\t// \n\t\t\"void *calloc(size_t num, size_t size)\",\n\t\t// \n\t\t\"char *strcpy(char *restrict dst, const char *restrict src)\",\n\t\t\"char *strdup(const char *s1)\",\n\t\t\"void* memset(void* dest, int ch, size_t count)\",\n\t\t// \n\t\t\"FILE *fopen(const char *, const char *)\",\n\t\t\"int fclose(FILE *)\",\n\t\t\"size_t fread(void *restrict, size_t, size_t, FILE *restrict)\",\n\t\t\"size_t fwrite(const void *restrict, size_t, size_t, FILE *restrict)\",\n\t\t// \n\t\t\"mach_port_t mach_task_self()\",\n\t\t\"kern_return_t task_for_pid(mach_port_name_t target_tport, int pid, mach_port_name_t *tn)\",\n\t\t\"kern_return_t mach_vm_protect(vm_map_t target_task, mach_vm_address_t address, mach_vm_size_t size, boolean_t set_maximum, vm_prot_t new_protection)\",\n\t\t\"kern_return_t mach_vm_write(vm_map_t target_task, mach_vm_address_t address, vm_offset_t data, mach_msg_type_number_t dataCnt)\",\n\t\t\"kern_return_t mach_vm_read(vm_map_t target_task, mach_vm_address_t address, mach_vm_size_t size, vm_offset_t *data, mach_msg_type_number_t *dataCnt)\",\n\t];\n\t\n\t/*\n\t\tReplacement for eval that can handle @encode etc.\n\t\t\n\t\tUsage:\n\t\t\tcy# utils.exec(\"@encode(void *(int, char))\")\n\t\t\t@encode(void*(int,char))\n\t*/\n\tutils.exec = function(str) {\n\t\tvar mkdir = @encode(int (const char *, int))(dlsym(RTLD_DEFAULT, \"mkdir\"));\n\t\tvar tempnam = @encode(char *(const char *, const char *))(dlsym(R" ], "url": "https://github.com/atom/language-javascript" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "cymbal": { "title": "Cymbal", "appeared": 1999, "type": "pl", "reference": [ "https://www.semanticscholar.org/topic/Fourth-generation-programming-language/173316" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2720", "centralPackageRepositoryCount": 0 }, "cypher": { "title": "Cypher Query Language", "appeared": 2011, "type": "queryLanguage", "description": "Cypher is a declarative, SQL-inspired language for describing patterns in graphs visually using an ascii-art syntax. It allows us to state what we want to select, insert, update or delete from our graph data without requiring us to describe exactly how to do it. A language with neo4j.", "website": "https://neo4j.com/developer/cypher-query-language/", "country": [ "Various" ], "originCommunity": [ "Neo4j" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "keywords": [ "ALL", "AND", "AS", "ASC", "ASCENDING", "BY", "CALL", "CASE", "CONTAINS", "CREATE", "DELETE", "DESC", "DESCENDING", "DETACH", "DISTINCT", "ELSE", "END", "ENDS", "EXISTS", "IN", "IS", "LIMIT", "MANDATORY", "MATCH", "MERGE", "NOT", "ON", "ON", "OPTIONAL", "OR", "ORDER", "REMOVE", "RETURN", "SET", "SKIP", "STARTS", "THEN", "UNION", "UNWIND", "WHEN", "WHERE", "WITH", "XOR", "YIELD" ], "wikipedia": { "example": [ "MATCH (start:Content)-[:RELATED_CONTENT]->(content:Content)\nWHERE content.source = 'user'\nOPTIONAL MATCH (content)-[r]-()\nDELETE r, content" ], "related": [ "sql", "sparql" ], "summary": "Cypher is a declarative graph query language that allows for expressive and efficient querying and updating of a property graph. Cypher is a relatively simple but still very powerful language. Very complicated database queries can easily be expressed through Cypher. This allows users to focus on their domain instead of getting lost in database access.Cypher was largely an invention of Andrés Taylor while working for Neo4j, Inc.(formerly Neo Technology) in 2011. Cypher was originally intended to be used with the graph database Neo4j, but was opened up through the openCypher project in October 2015.", "created": 2014, "pageId": 41583056, "backlinksCount": 43, "revisionCount": 49, "dailyPageViews": 79, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Cypher_Query_Language" }, "monaco": "cypher", "codeMirror": "cypher", "pygmentsHighlighter": { "filename": "graph.py", "fileExtensions": [ "cyp", "cypher" ], "id": "Cypher" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "cyphertext": { "title": "CypherText", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1b803488a827569d8c45348736083497cbabbf72" ], "country": [ "United States" ], "originCommunity": [ "The Cyphernetics Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=500", "centralPackageRepositoryCount": 0 }, "cython": { "title": "Cython", "appeared": 2007, "type": "pl", "website": "http://cython.org", "documentation": [ "https://cython.readthedocs.io/en/latest/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/sagemath" ], "domainName": { "awisRank": { "2022": 331707 }, "name": "cython.org" }, "supersetOf": [ "python" ], "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "wikipedia": { "example": [ "In [1]: %load_ext Cython\n\nIn [2]: %%cython\n ...: def f(n):\n ...: a = 0\n ...: for i in range(n):\n ...: a += i\n ...: return a\n ...: \n ...: cpdef g(int n):\n ...: cdef int a = 0, i\n ...: for i in range(n):\n ...: a += i\n ...: return a\n ...: \n\nIn [3]: %timeit f(1000000)\n42.7 ms ± 783 µs per loop (mean ± std. dev. of 7 runs, 10 loops each)\n\nIn [4]: %timeit g(1000000)\n74 µs ± 16.6 ns per loop (mean ± std. dev. of 7 runs, 10000 loops each)" ], "related": [ "python", "c", "linux", "pyrex", "sagemath", "xml", "scipy", "pandas", "scikit-learn" ], "summary": "Cython is a superset of the Python programming language, designed to give C-like performance with code which is mostly written in Python. Cython is a compiled language that generates CPython extension modules. These extension modules can then be loaded and used by regular Python code using the import statement. Cython is written in Python and works on Windows, macOS, and Linux, producing source files compatible with CPython 2.6, 2.7, and 3.3 through 3.7.", "pageId": 18384111, "dailyPageViews": 270, "created": 2008, "backlinksCount": 81, "revisionCount": 234, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Cython" }, "githubLanguage": { "fileExtensions": [ "pyx", "pxd", "pxi" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "python", "codemirrorMimeType": "text/x-cython", "tmScope": "source.cython", "aliases": [ "pyrex" ], "repos": 698, "id": "Cython" }, "githubBigQuery": { "repos": 580, "users": 528, "id": "Cython" }, "pygmentsHighlighter": { "filename": "python.py", "fileExtensions": [ "pyx", "pxd", "pxi" ], "id": "Cython" }, "linguistGrammarRepo": { "firstCommit": 2009, "lastCommit": 2017, "committerCount": 2, "commitCount": 8, "url": "https://github.com/textmate/cython.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCython: A Guide for Python Programmers|2014|Kurt W Smith|41956423|3.97|29|4\nLearning Cython Programming|2013|Philip Herron|26395008|3.91|11|3\nLearning Cython Programming - Second Edition||Philip Herron|49631594|0.0|0|0\nLearning Cython Programming Second Edition||Philip Herron|49565025|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|Learning Cython Programming|Herron, Philip|9781783280797\n20150121|O'Reilly Media, Inc.|Cython|Kurt W. Smith|9781491901755\n20150121|O'Reilly Media, Inc.|Cython|Kurt W. Smith|9781491901762\n2013-09-25|Packt Publishing|Learning Cython Programming|Philip Herron|9781783280803\n22-02-2016|Packt Publishing|Learning Cython Programming|Philip Herron|9781785289125\n2016|Packt Publishing|Learning Cython Programming - Second Edition|Herron and Philip|9781783551675", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|A Cython Interface to EPICS Channel Access for High-level Python Applications|10.18429/JACOW-PCAPAC2016-WEUIPLCO04|1|0|J. Chrin|9a750962554912a666a93ac4b4592958b2552c68" }, "cytosol": { "title": "cytosol", "appeared": 2020, "type": "pl", "creators": [ "tiatomee" ], "githubRepo": { "firstCommit": 2020, "stars": 33, "forks": 3, "subscribers": 2, "created": 2020, "updated": 2022, "description": "A programming language somewhat resembling cellular processes.", "issues": 0, "url": "https://github.com/cuddlefishie/cytosol" }, "repoStats": { "firstCommit": 2020, "commits": 59, "committers": 4, "files": 83 } }, "d-data-language-specification": { "title": "D data language specification", "appeared": 1994, "type": "queryLanguage", "country": [ "United Kingdom" ], "originCommunity": [ "IBM" ], "wikipedia": { "related": [ "csharp" ], "summary": "D is a set of prescriptions for what Christopher J. Date and Hugh Darwen believe a relational database management system ought to be like. It is proposed in their paper The Third Manifesto, first published in 1994 and elaborated on in several books since then.", "created": 2005, "backlinksCount": 47, "pageId": 3077431, "revisionCount": 106, "dailyPageViews": 23, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/D_%28data_language_specification%29" }, "centralPackageRepositoryCount": 0 }, "d": { "title": "D", "appeared": 2001, "type": "pl", "creators": [ "Walter Bright", "Andrei Alexandrescu" ], "website": "https://dlang.org", "documentation": [ "https://dlang.org/documentation.html" ], "fileExtensions": [ "d" ], "country": [ "United States" ], "originCommunity": [ "Digital Mars" ], "domainName": { "registered": 2010, "awisRank": { "2022": 264915 }, "name": "dlang.org" }, "releaseNotesUrl": "https://dlang.org/changelog/", "visualParadigm": false, "hasPointers": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasTemplates": { "example": "template TCopy(T)\n{\n void copy(out T to, T from)\n {\n to = from;\n }\n}\nint i;\nTCopy!(int).copy(i, 3);", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/+ A comment\n+/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "// 0[0-7_]+", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F_]+", "value": true }, "hasFloats": { "example": "// 0[xX]([0-9a-fA-F_]*\\.[0-9a-fA-F_]+|[0-9a-fA-F_]+)[pP][+\\-]?[0-9_]+[fFL]?[i]?", "value": true }, "hasIntegers": { "example": "// (0|[1-9][0-9_]*)([LUu]|Lu|LU|uL|UL)?", "value": true }, "hasBinaryNumbers": { "example": "// 0[Bb][01_]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ], [ "/+", "+/" ] ], "printToken": [ [ "printf" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "1 import std.stdio, std.algorithm, std.range, std.string;\n 2 \n 3 void main()\n 4 {\n 5 dstring[][dstring] signs2words;\n 6 \n 7 foreach(dchar[] w; lines(File(\"words.txt\")))\n 8 {\n 9 w = w.chomp().toLower();\n10 immutable key = w.dup.sort().release().idup;\n11 signs2words[key] ~= w.idup;\n12 }\n13 \n14 foreach(words; signs2words)\n15 if(words.length > 1)\n16 writefln(words.join(\" \"));\n17 }" ], "related": [ "freebsd", "linux", "c", "csharp", "eiffel", "java", "python", "minid", "vala", "swift", "genie", "ruby", "assembly-language", "llvmir", "cil", "eclipse-editor", "visual-studio-editor", "emacs-editor", "vim-editor", "textmate-editor", "visual-studio-code-editor", "gdb", "utf-8" ], "summary": "The D programming language is an object-oriented, imperative, multi-paradigm system programming language created by Walter Bright of Digital Mars and released in 2001. Bright was joined in the design and development effort in 2007 by Andrei Alexandrescu. Though it originated as a re-engineering of C++, D is a distinct language, having redesigned some core C++ features while also taking inspiration from other languages, notably Java, Python, Ruby, C#, and Eiffel. D's design goals attempt to combine the performance and safety of compiled languages with the expressive power of modern dynamic languages. Idiomatic D code is commonly as fast as equivalent C++ code, while being shorter and memory-safe. Type inference, automatic memory management and syntactic sugar for common types allow faster development, while bounds checking, design by contract features and a concurrency-aware type system help reduce the occurrence of bugs.", "pageId": 243881, "dailyPageViews": 1008, "created": 2003, "backlinksCount": 708, "revisionCount": 1343, "appeared": 2001, "fileExtensions": [ "d" ], "url": "https://en.wikipedia.org/wiki/D_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "d", "di" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "d", "codemirrorMode": "d", "codemirrorMimeType": "text/x-d", "tmScope": "source.d", "aliases": [ "Dlang" ], "repos": 13224, "id": "D" }, "githubBigQuery": { "repos": 7198, "users": 5871, "id": "D" }, "codeMirror": "d", "pygmentsHighlighter": { "filename": "d.py", "fileExtensions": [ "d", "di" ], "id": "D" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2018, "committerCount": 7, "commitCount": 113, "sampleCount": 9, "example": [ "unittest\n{\n}\n" ], "url": "https://github.com/textmate/d.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/Pure-D/serve-d\nwrittenIn d", "https://github.com/d-language-server/dls\nwrittenIn d" ], "projectEuler": { "memberCount": { "2019": 228, "2022": 243 }, "id": "D" }, "helloWorldCollection": [ "// Hello World in D\n\nimport std.stdio;\n\nvoid main()\n{\n writefln(\"Hello World!\");\n}\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:D", "quineRelay": "D", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nint square(int num) {\n return num * num;\n}\n" ], "id": "D" }, "rijuRepl": { "example": [ "import std.stdio;\n\nvoid main()\n{\n writeln(\"Hello, world!\");\n}\n" ], "id": "https://riju.codes/d" }, "tryItOnline": "d", "officialBlogUrl": [ "https://dlang.org/blog/" ], "faqPageUrl": [ "https://dlang.org/articles/faq.html" ], "downloadPageUrl": [ "https://dlang.org/download.html" ], "meetup": { "memberCount": 1445, "groupCount": 7, "url": "https://www.meetup.com/topics/dpl" }, "tiobe": { "currentRank": 26, "id": "D" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3173", "packageRepository": [ "https://code.dlang.org/" ], "twitter": "https://twitter.com/d_programming", "ubuntuPackage": "gdc", "gdbSupport": true, "fileType": "text", "wordRank": 158, "isbndb": "year|publisher|title|authors|isbn13\n2010|Addison-Wesley Professional|The D Programming Language|Alexandrescu, Andrei|9780321635365\n2014|Packt Publishing|D Cookbook|Ruppe, Adam D.|9781783287215", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2016|Implementation of a Compressible-Flow Simulation Code in the D Programming Language|10.4028/www.scientific.net/AMM.846.54|32|1|P. Jacobs and R. Gollan|4a2307395444e248678c23e1fec141fc94adf8e7\n2005|Incorporation Of A 3 D Interactive Graphics Programming Language Into An Introductory Engineering Course|10.18260/1-2--14454|11|0|J. Snook and V. Lohani and J. Lo and Kishore Sirvole and Jennifer Mullins and J. Kaeli and H. Griffin|373be4fc8edbef8d94f798f1421f3220a7d1b906\n2020|Origins of the D programming language|10.1145/3386323|6|1|W. Bright and Andrei Alexandrescu and M. Parker|fe48fe677461e2e7c9ff850ab12123ef684715d3\n2013|Parallelizing power system contingency analysis using D programming language|10.1109/PESMG.2013.6672115|5|0|S. Khaitan and J. McCalley|785686884b47bed2f4bb0574477b46ef204752fc" }, "d2": { "title": "D2", "appeared": 1995, "type": "textMarkup", "description": "D2 is a domain-specific language (DSL) that stands for Declarative Diagramming. Declarative, as in, you write in text what you want diagrammed, we generate it.", "website": "https://d2-lang.com/", "reference": [ "https://news.ycombinator.com/item?id=32652291" ], "standsFor": "Declarative Diagramming", "country": [ "United States" ], "originCommunity": [ "Terrastruct, Inc" ], "related": [ "dot" ], "example": [ "aws: {\n load_balancer -> api\n api -> db\n}\ngcloud: {\n auth -> db\n}\n\ngcloud -> aws\n\nexplanation: |md\n # Why do we use AWS?\n - It has more uptime than GCloud\n - We have free credits\n| {\n near: aws\n}" ] }, "d3": { "title": "D3.js", "appeared": 2011, "type": "library", "creators": [ "Mike Bostock" ], "website": "https://d3js.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/d3" ], "domainName": { "registered": 2011, "awisRank": { "2017": 54728, "2022": 77077 }, "name": "d3js.org" }, "related": [ "observable-lang" ], "githubRepo": { "firstCommit": 2010, "stars": 101774, "forks": 23126, "subscribers": 3814, "created": 2010, "updated": 2022, "description": "Bring data to life with SVG, Canvas and HTML. :bar_chart::chart_with_upwards_trend::tada:", "issues": 3, "url": "https://github.com/d3/d3" }, "wikipedia": { "example": [ "// Data\n var countriesData = [\n { name:\"Ireland\", income:53000, life: 78, pop:6378, color: \"black\"},\n { name:\"Norway\", income:73000, life: 87, pop:5084, color: \"blue\" },\n { name:\"Tanzania\", income:27000, life: 50, pop:3407, color: \"grey\" }\n ];\n// Create SVG container\n var svg = d3.select(\"#hook\").append(\"svg\")\n .attr(\"width\", 120)\n .attr(\"height\", 120)\n .style(\"background-color\", \"#D0D0D0\");\n// Create SVG elements from data \n svg.selectAll(\"circle\") // create virtual circle template\n .data(countriesData) // bind data\n .enter() // for each row in data...\n .append(\"circle\") // bind circle & data row such that... \n .attr(\"id\", function(d) { return d.name }) // set the circle's id according to the country name\n .attr(\"cx\", function(d) { return d.income / 1000 }) // set the circle's horizontal position according to income \n .attr(\"cy\", function(d) { return d.life }) // set the circle's vertical position according to life expectancy \n .attr(\"r\", function(d) { return d.pop / 1000 *2 }) // set the circle's radius according to country's population \n .attr(\"fill\", function(d) { return d.color }); // set the circle's color according to country's color" ], "related": [ "javascript", "svg", "css", "actionscript", "html", "json", "csv", "geojson", "jquery" ], "summary": "D3.js (or just D3 for Data-Driven Documents) is a JavaScript library for producing dynamic, interactive data visualizations in web browsers. It makes use of the widely implemented SVG, HTML5, and CSS standards. It is the successor to the earlier Protovis framework. In contrast to many other libraries, D3.js allows great control over the final visual result. Its development was noted in 2011, as version 2.0.0 was released in August 2011.D3.js is used on hundreds of thousands of websites. Some popular uses include creating interactive graphics for online news websites, information dashboards for viewing data, and producing maps from GIS map making data. In addition, the exportable nature of SVG enables graphics created by D3 to be used in print publications.", "pageId": 36177168, "created": 2012, "backlinksCount": 92, "revisionCount": 351, "dailyPageViews": 275, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/D3.js" }, "twitter": "https://twitter.com/d3js_org", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "d4-programming-language": { "title": "D4", "appeared": 2001, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "Softwise Inc" ], "wikipedia": { "related": [ "csharp", "sql", "pascal", "xml" ], "summary": "Dataphor is an open-source truly-relational database management system (RDBMS) and its accompanying user interface technologies, which together are designed to provide highly declarative software application development. The Dataphor Server has its own storage engine or it can be a virtual, or federated, DBMS, meaning that it can utilize other database engines for storage. Dataphor has been praised for its adherence to relational principles, more closely so than any SQL product.", "created": 2005, "backlinksCount": 25, "pageId": 891533, "revisionCount": 44, "dailyPageViews": 7, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/D4_%28programming_language%29" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Parallel implementation of 2D Daubechies - D4 transform in a cluster|10.1109/ICCIT.2010.5711087|2|0|Jaumin Ajdari and F. Hoxha|cce4eb47cf2e6dd45d757e101cd51b73a1b64379" }, "d4": { "title": "D4", "appeared": 2001, "type": "queryLanguage", "reference": [ "https://en.wikipedia.org/wiki/Dataphor#Languages" ], "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Parallel implementation of 2D Daubechies - D4 transform in a cluster|10.1109/ICCIT.2010.5711087|2|0|Jaumin Ajdari and F. Hoxha|cce4eb47cf2e6dd45d757e101cd51b73a1b64379" }, "dad": { "title": "DAD", "appeared": 2015, "type": "pl", "creators": [ "Scott Ambler", "Mark Lines" ], "reference": [ "https://www.pmi.org/disciplined-agile/process/introduction-to-dad", "https://www.proyectum.com/sistema/blog/disciplined-agile-delivery-dad/" ], "country": [ "Canada" ], "wikipedia": { "summary": "Disciplined agile delivery (DAD) is the software development portion of the Disciplined Agile Toolkit. DAD enables teams to make simplified process decisions around incremental and iterative solution delivery. DAD builds on the many practices espoused by advocates of agile software development, including scrum, agile modeling, lean software development, and others.", "url": "https://en.wikipedia.org/wiki/Disciplined_agile_delivery" }, "wordRank": 4524, "centralPackageRepositoryCount": 0 }, "dafny": { "title": "Dafny", "appeared": 2009, "type": "pl", "creators": [ "K. Rustan M. Leino" ], "website": "https://www.microsoft.com/en-us/research/project/dafny-a-language-and-program-verifier-for-functional-correctness/", "originCommunity": [ "Microsoft" ], "writtenIn": [ "csharp" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "print" ] ], "githubRepo": { "stars": 1714, "forks": 206, "subscribers": 76, "created": 2016, "updated": 2022, "firstCommit": 2009, "description": "Dafny is a verification-aware programming language", "issues": 550, "url": "https://github.com/Microsoft/dafny" }, "repoStats": { "firstCommit": 2009, "commits": 6823, "committers": 125, "files": 4188 }, "wikipedia": { "example": [ "datatype List = Nil | Link(data:int,next:List)\n\nfunction sum(l:List): int {\n match l\n case Nil => 0\n case Link(d,n) => d + sum(n)\n}\n\npredicate isNatList(l:List) {\n match l\n case Nil => true\n case Link(d,n) => d >= 0 && isNatList(n)\n}\n\nghost method NatSumLemma(l:List, n:int)\nrequires isNatList(l) && n == sum(l)\nensures n >= 0 \n{\n match l\n case Nil =>\n // Discharged Automatically\n case Link(data,next) => {\n // Apply Inductive Hypothesis\n NatSumLemma(next,sum(next));\n // Check what known by Dafny\n assert data >= 0;\n }\n}" ], "related": [ "csharp", "spec-sharp", "spark", "idris", "agda" ], "summary": "Dafny is an imperative compiled language that targets C# and supports formal specification through preconditions, postconditions, loop invariants and loop variants. The language combines ideas primarily from the Functional and Imperative paradigms, and includes limited support for Object-Oriented Programming. Features include generic classes, dynamic allocation, inductive datatypes and a variation of separation logic known as implicit dynamic frames for reasoning about side effects. Dafny was created by Rustan Leino at Microsoft Research after his previous work on developing ESC/Modula-3, ESC/Java, and Spec#. Dafny is been used widely in teaching and features regularly in software verification competitions (e.g. VSTTE'08, VSCOMP'10, COST'11, and VerifyThis'12). Dafny was designed to provide a simple introduction to formal specification and verification and has been used widely in teaching. Dafny follows in the lineage of many previous tools, including SPARK/Ada, ESC/Java, Spec#, Whiley, Why3 and Frama-C. Such tools rely on the use of automated theorem proving to discharge proof obligations unlike, for example, those based on dependent types (e.g. Idris, Agda) which require more human intervention. Dafny builds on the Boogie intermediate language which uses the Z3 automated theorem prover for discharging proof obligations.", "pageId": 56073623, "created": 2018, "backlinksCount": 4, "revisionCount": 2, "dailyPageViews": 1, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Dafny_(programming_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "dfy" ], "interpreters": [ "dafny" ], "aceMode": "text", "tmScope": "text.dfy.dafny", "repos": 157, "id": "Dafny" }, "githubBigQuery": { "repos": 1, "users": 1, "id": "Dafny" }, "helloWorldCollection": [ "// Hello world in Dafny\n\nmethod Main() {\n print \"Hello, World!\\n\";\n}" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Dafny", "quineRelay": "Dafny", "rijuRepl": { "example": [ "method Main() {\n print \"Hello, world!\\n\";\n}\n" ], "id": "https://riju.codes/dafny" }, "tryItOnline": "dafny", "ubuntuPackage": "dafny", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2022|Apress|Introducing Software Verification with Dafny Language: Proving Program Correctness|Sitnikovski, Boro|9781484279786", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|The Dafny Integrated Development Environment|10.4204/EPTCS.149.2|52|2|K. Leino and Valentin Wüstholz|53a027ff333e4eb1d9f76152ce294922f5cbacfd\n2012|Developing verified programs with Dafny|10.1145/2402676.2402682|42|5|K. Leino|e294024f911de532d86a69a28b319e6f0bb1aadb\n2017|Accessible Software Verification with Dafny|10.1109/MS.2017.4121212|27|1|K. Leino|07fa56cf259459a785328c33115a92071eaf450a\n2012|Developing verified programs with Dafny|10.1145/2402676.2402682|9|0|K. Leino|2538a75fca5da05594c6eb3ee6dc6fedd64262df\n2016|Tactics for the Dafny Program Verifier|10.1007/978-3-662-49674-9_3|8|0|G. Grov and V. Tumas|c83cffd0168388dd5e6eb8ee32b7ac58ce3ce6be\n2015|Automatic verification of Dafny programs with traits|10.1145/2786536.2786542|6|0|Reza Ahmadi and K. Leino and J. Nummenmaa|f635d2bc6f0bec27f421d25e9bcbbf359e997ddb\n2017|Automating Proof Steps of Progress Proofs: Comparing Vampire and Dafny|10.29007/5zjp|4|0|Sylvia Grewe and Sebastian Erdweg and M. Mezini|7c630bfc43ed8e908b4786b590ec44bd181eae41\n2017|A Tutorial on Using Dafny to Construct Verified Software|10.4204/EPTCS.237.1|2|0|P. Lucio|6ccb9ac2ce28800d64389e1a2d947ffae5e75adc\n2018|Towards progressive program verification in Dafny|10.1145/3264637.3264649|2|0|Ismael Figueroa and Bruno García and Paul Leger|145b3453b2df6f00fb93275acdef2958235cdc00\n2019|An Assertional Proof of Red–Black Trees Using Dafny|10.1007/s10817-019-09534-y|2|0|R. Peña|9b5c59696f3cc11c0f40b071560be0c10ebd6c02\n2016|Mechanised Verification Patterns for Dafny|10.1007/978-3-319-48989-6_20|1|0|G. Grov and Yuhui Lin and V. Tumas|6ee1f76da9b91f0d493e28afdfa796a48781fc25" }, "dag": { "title": "DAG", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1eed4238c3034e9a093bd4d9efe934031a4c6ed1" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5678", "centralPackageRepositoryCount": 0 }, "daisy-systems": { "title": "Daisy Systems", "appeared": 1983, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Daisy Systems Corporation" ], "wikipedia": { "related": [ "unix", "vhdl" ], "summary": "Daisy Systems Corporation incorporated in 1981 in Mountain View, California, was a computer-aided engineering, company, a pioneer in the electronic design automation (EDA) industry. It was a manufacturer of computer hardware and software for EDA, including schematic capture, logic simulation, parameter extraction and other tools for printed circuit board design and semiconductor chip layout. In mid-1980s, it had a subsidiary in Germany, Daisy Systems GmbH and one in Israel. The company merged with Cadnetix Corporation of Boulder, Colorado in 1988, with the resulting company then known officially as Daisy/Cadnetix, Inc. with the trade name DAZIX. It filed for protection under Chapter 11 of the Federal Bankruptcy Code in 1990 and was acquired by Intergraph later that year. Intergraph incorporated DAZIX into its EDA business unit, which was later spun off as an independent subsidiary named VeriBest, Inc. VeriBest was ultimately acquired by Mentor Graphics in late 1999. Daisy Systems was founded by Aryeh Finegold and David Stamm; its original investors were Fred Adler and Oak Investment Partners. Daisy along with Valid Logic Systems and Mentor Graphics, collectively known as DMV, added front end design to the existing computer-aided design aspects of computer automation.", "created": 2004, "backlinksCount": 18, "pageId": 1008360, "revisionCount": 74, "dailyPageViews": 18, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Daisy_Systems" }, "centralPackageRepositoryCount": 0 }, "dak": { "title": "Dak", "appeared": 2022, "type": "pl", "creators": [ "Naitik Shah" ], "description": "Dak is a Lisp like language that transpiles to JavaScript.", "website": "https://www.daklang.com/", "webRepl": [ "https://www.daklang.com/tour/functions/" ], "country": [ "Dubai" ], "originCommunity": [ "https://github.com/daaku/dak/issues" ], "compilesTo": [ "javascript" ], "example": [ "; Functions are varied and colorful.\n\n; Simple function:\n(fn add [a b]\n (+ a b))\n(prn (add 40 1))\n\n; Async function:\n(fn@ add-promises [a b]\n (+ @a @b))\n(prn @(add-promises (Promise.resolve 40) (Promise.resolve 2)))\n\n; Generator function:\n(fn* powers [n count]\n (let [current 1]\n (for [i 0 count]\n (yield (*= current n)))))\n(for-of [v (powers 2 5)]\n (prn v))\n\n; Async generator function:\n(fn@* foo [a b]\n (yield (inc @a))\n (yield (inc @b)))\n(for@ [v (foo (Promise.resolve 41) (Promise.resolve -43))]\n (prn v))\n\n; Exported function:\n(fn ^:export plus [a b]\n (+ a b))\n\n; Exported default function:\n(fn ^:export ^:default [a b]\n (- a b))\n\n; Declaration syntax:\n(fn ^:decl TheClass [a]\n (set this.answer a))\n(prn (TheClass. 42))\n\n; Explicit return is available:\n(fn until [a]\n (while true\n (if (= (++ a) 42)\n (return :boom))))\n(prn :returned (until 40))\n\n; Yield & Yield* are available:\n(fn* it [a]\n (yield (++ a))\n (yield* [(++ a) (++ a)]))\n(for-of [v (it 39)]\n (prn \"it:\" v))" ], "githubRepo": { "stars": 70, "forks": 1, "subscribers": 2, "created": 2022, "updated": 2023, "description": "Dak is a Lisp like language that transpiles to JavaScript.", "issues": 17, "url": "https://github.com/daaku/dak" }, "repoStats": { "firstCommit": 2022, "commits": 575, "committers": 2, "files": 86 } }, "dale": { "title": "Dale", "appeared": 2013, "type": "pl", "creators": [ "tomhrr" ], "website": "https://github.com/tomhrr/dale/", "fileExtensions": [ "dt" ], "country": [ "Unknown" ], "hasGarbageCollection": { "example": "", "value": false }, "hasImports": { "example": "", "value": true }, "hasPointers": { "example": "", "value": true }, "hasBitWiseOperators": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasManualMemoryManagement": { "example": "", "value": true }, "hasFunctionOverloading": { "example": "", "value": true }, "hasNamespaces": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": true }, "hasReferences": { "example": "", "value": true }, "githubRepo": { "stars": 965, "forks": 48, "subscribers": 22, "created": 2013, "updated": 2022, "description": "Lisp-flavoured C", "url": "https://github.com/tomhrr/dale/" }, "repoStats": { "firstCommit": 2013, "commits": 1346, "committers": 12, "files": 1400 } }, "dalvik-bytecode": { "title": "dalvik-bytecode", "appeared": 2008, "type": "bytecode", "description": "Dalvik bytecode format is still used as a distribution format, but no longer at runtime in newer Android versions", "reference": [ "https://source.android.com/devices/tech/dalvik/dalvik-bytecode.html" ], "fileExtensions": [ "dex" ], "centralPackageRepositoryCount": 0 }, "daml-oil": { "title": "DAML+OIL", "appeared": 2001, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Defense Advanced Research Projects Agency" ], "wikipedia": { "related": [ "owl" ], "summary": "DAML+OIL is a successor language to DAML and OIL that combines features of both. In turn, it was superseded by Web Ontology Language (OWL). DAML stands for DARPA Agent Markup Language. OIL stands for Ontology Inference Layer or Ontology Interchange Language. The DAML program ended in early 2006.", "backlinksCount": 18, "pageId": 1768517, "dailyPageViews": 8, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/DAML+OIL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7646", "centralPackageRepositoryCount": 0 }, "daml": { "title": "DARPA Agent Markup Language", "appeared": 1999, "type": "xmlFormat", "standsFor": "DARPA Agent Markup Language", "country": [ "United States" ], "originCommunity": [ "Defense Advanced Research Projects Agency" ], "wikipedia": { "summary": "The DARPA Agent Markup Language (DAML) was the name of a US funding program at the US Defense Advanced Research Projects Agency (DARPA) started in 1999 by then-Program Manager James Hendler, and later run by Murray Burke, Mark Greaves and Michael Pagels. The program focused on the creation of machine-readable representations for the Web. One of the Investigators working on the program was Tim Berners-Lee and to a great degree through his influence, working with the program managers, the effort worked to create technologies and demonstrations for what is now called the Semantic Web and this in turn led to the growth of Knowledge Graph technology. A primary outcome of the DAML program was the DAML language, an agent markup language based on RDF. This language was then followed by an extension entitled DAML+OIL which included researchers outside of the DARPA program in the design. The 2002 submission of the DAML+OIL language to the World Wide Web Consortium (W3C) captures the work done by DAML contractors and the EU/U.S. ad hoc Joint Committee on Markup Languages. This submission was the starting point for the language (later called OWL) to be developed by W3C's web ontology working group, WebOnt. DAML+OIL was a syntax, layered on RDF and XML, that could be used to describe sets of facts making up an ontology. DAML+OIL had its roots in three main languages - DAML, as described above, OIL (Ontology Inference Layer) and SHOE, an earlier US research project. A major innovation of the languages was to use RDF and XML for a basis, and to use RDF namespaces to organize and assist with the integration of arbitrarily many different and incompatible ontologies. Articulation ontologies can link these competing ontologies through codification of analogous subsets in a neutral point of view, as is done in the Wikipedia. Current ontology research derived in part from DAML is leading toward the expression of ontologies and rules for reasoning and action. Much of the work in DAML has now been incorporated into RDF Schema, the OWL and their successor languages and technologies including schema.org", "backlinksCount": 42, "pageId": 53832, "dailyPageViews": 12, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/DARPA_Agent_Markup_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7645", "semanticScholar": "" }, "damn": { "title": "DAMN", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/65c0c8b85bc5b98ff90e4b5e98d7f6dd80efb37e" ], "country": [ "United States" ], "originCommunity": [ "The University of Michigan" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7617", "wordRank": 5728, "centralPackageRepositoryCount": 0 }, "daonode": { "title": "daonode", "appeared": 2011, "type": "pl", "creators": [ "Simeon Chaos" ], "website": "https://pythonhosted.org/daot/", "country": [ "Unknown" ], "originCommunity": [ "http://groups.google.com/group/daot" ], "githubRepo": { "stars": 26, "forks": 2, "subscribers": 6, "created": 2013, "updated": 2015, "description": " functional logic solver and compiler", "url": "https://github.com/chaosim/daonode" }, "repoStats": { "firstCommit": 2013, "commits": 159, "committers": 3, "files": 82 } }, "dap-algol": { "title": "DAP-Algol", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/43d9c448077545ba246bf7c6c54898547d99dbc8" ], "country": [ "England" ], "originCommunity": [ "University of Liverpool" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6138", "centralPackageRepositoryCount": 0 }, "dap-fortran": { "title": "DAP FORTRAN", "appeared": 1975, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "International Computers Limited" ], "wikipedia": { "example": [ "C Multiply vector by matrix\n REAL M(,), V(), R()\n R = SUM(M*MATR(A))\n\nC Converge to a Laplace potential in an area\n REAL P(,), OLD_P(,)\n LOGICAL INSIDE(,)\n DO 1 K = 1, ITERATIONS\n OLD_P = P\n P(INSIDE) = 0.25*(P(,+)+P(,-)+P(+,)+P(-,))\n IF (MAX(ABS(P-OLD_P)) .LT. EPS) RETURN\n 1 CONTINUE" ], "summary": "DAP FORTRAN was an extension of the non IO parts of FORTRAN with constructs that supported parallel computing for the ICL Distributed Array Processor (DAP). The DAP had a Single Instruction Multiple Data (SIMD) architecture with 64x64 single bit processors. DAP FORTRAN had the following major features: It had matrix and vector operations. Assignments could be performed under a logical mask so only some elements in the target of an assignment were changed. On the negative side - operations were performed using the size of the underlying hardware i.e. on a 64x64 matrix or 64 element vector.In a declaration either one or two extents could be omitted as in: The omitted dimension was taken as 64, the size of one side of the DAP. The speed of arithmetic operations depended strongly on the number of bits in the value. INTEGER*n reserved 8n bits where n is 1 to 8, and REAL*n reserved 8n bits where n is 3 to 8. LOGICAL reserved a single bit. However, DAP FORTRAN fell between two conflicting objectives. It needed to effectively exploit the DAP facilities. But also had to be accessible to the scientific computing community whose primary language, with a design closely tied to serial architectures, was FORTRAN. The dialect used was ICL's 2900-series FORTRAN which was based on an early version of the FORTRAN 77 standard and had mismatches with both FORTRAN 77 and the older FORTRAN 66 standard. DAP FORTRAN was significantly different from either standard FORTRAN and the machine was not capable of accepting or optimising standard FORTRAN programs. On the other hand, compared with other contemporary languages which were by design extensible (notably ALGOL-68), FORTRAN was less than well suited to this task. The result was noticeably inelegant and did require a great deal of new learning. Operationally, there was an overhead to transfer computational data into and out of the array, and problems which did not fit the 64x64 matrix imposed additional complexity to handle the boundaries (65x65 was perhaps the worst case!) – but for problems which suited the architecture, it could outperform the current Cray pipeline architectures by two orders of magnitude. A later version of the DAP used Fortran-Plus instead which was based on FORTRAN 77 and had more flexible indexing. In particular it automatically mapped user sized arrays onto the underlying hardware.", "created": 2007, "backlinksCount": 25, "pageId": 10334221, "revisionCount": 18, "dailyPageViews": 2, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/DAP_FORTRAN" }, "hopl": "https://hopl.info/showlanguage.prx?exp=753", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "daplex": { "title": "Daplex", "appeared": 1979, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Computer Corporation of America" ], "wikipedia": { "example": [ "Type EMPLOYEE is entity\nName: string\nSSN: integer\nADDRESS: string\nSALARY: Float\nend entity;" ], "summary": "Daplex is a computer language introduced in 1981 by David Shipman of the Computer Corporation of America. Daplex was designed for creating distributed database systems and can be used as a global query language.", "created": 2007, "backlinksCount": 10, "pageId": 11305281, "revisionCount": 23, "dailyPageViews": 3, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/Daplex" }, "centralPackageRepositoryCount": 0 }, "darcs-patch": { "title": "Darcs Advanced Revision Control System", "appeared": 2003, "type": "application", "description": "Darcs is a distributed version control system created by David Roundy.", "reference": [ "https://en.wikipedia.org/wiki/Darcs" ], "standsFor": "Darcs Advanced Revision Control System", "country": [ "United States" ], "originCommunity": [ "https://www.gnu.org/software/gnu-arch/" ], "githubLanguage": { "fileExtensions": [ "darcspatch", "dpatch" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "none", "aliases": [ "dpatch" ], "id": "Darcs Patch" }, "pygmentsHighlighter": { "filename": "diff.py", "fileExtensions": [ "dpatch", "darcspatch" ], "id": "Darcs Patch" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "darkbasic": { "title": "DarkBASIC", "appeared": 2000, "type": "pl", "website": "https://www.thegamecreators.com/", "reference": [ "https://github.com/TheGameCreators/Dark-Basic-Pro" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/TheGameCreators" ], "wikipedia": { "summary": "The Game Creators Ltd (formerly Dark Basic Software Limited) is a British software house based in Macclesfield, England, which specialises in software for video game development. The company was established in March 1999 through a partnership between programmers Lee Bamber and Richard Vanner.", "created": 2004, "backlinksCount": 61, "pageId": 51331094, "revisionCount": 368, "dailyPageViews": 9, "url": "https://en.wikipedia.org/wiki/DarkBASIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1947", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "darklang": { "title": "darklang", "appeared": 2019, "type": "pl", "description": "A language built for deployless backends", "website": "https://darklang.com/", "country": [ "United States" ], "originCommunity": [ "https://github.com/darklang" ], "domainName": { "registered": 2017, "awisRank": { "2022": 2044732 }, "name": "darklang.com" }, "hasTypedHoles": { "example": "", "value": true } }, "dart-pm": { "title": "dart-pm", "appeared": 2011, "type": "packageManager", "website": "https://pub.dartlang.org/", "country": [ "United States" ], "originCommunity": [ "Google" ], "domainName": { "name": "pub.dartlang.org" }, "packageCount": 2751, "forLanguages": [ "dart" ] }, "dart": { "title": "Dart", "appeared": 2011, "type": "pl", "creators": [ "Lars Bak" ], "website": "http://www.dartlang.org", "documentation": [ "https://dart.dev/guides" ], "fileExtensions": [ "dart" ], "originCommunity": [ "Google" ], "domainName": { "registered": 2011, "awisRank": { "2022": 338917 }, "name": "dartlang.org" }, "releaseNotesUrl": "https://dart.dev/guides/whats-new", "hasComments": { "example": "// Hi\n/* Assume address is not null. */", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasImports": { "example": "import 'file-system.dart';\nimport 'dart:math' as math;", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasInheritance": { "example": "", "value": true }, "hasAsyncAwait": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "as", "assert", "async", "await", "break", "case", "catch", "class", "const", "continue", "covariant", "default", "deferred", "do", "dynamic", "else", "enum", "export", "extends", "external", "factory", "false", "final", "finally", "for", "get", "if", "implements", "import", "in", "is", "library", "new", "null", "operator", "part", "rethrow", "return", "set", "static", "super", "switch", "sync", "this", "throw", "true", "try", "typedef", "var", "void", "while", "with", "yield" ], "wikipedia": { "example": [ "// Import the math library to get access to the sqrt function.\nimport 'dart:math' as math;\n\n// Create a class for Point.\nclass Point {\n\n // Final variables cannot be changed once they are assigned.\n // Create two instance variables.\n final num x, y;\n\n // A constructor, with syntactic sugar for setting instance variables.\n Point(this.x, this.y);\n\n // A named constructor with an initializer list.\n Point.origin()\n : x = 0,\n y = 0;\n\n // A method.\n num distanceTo(Point other) {\n var dx = x - other.x;\n var dy = y - other.y;\n return math.sqrt(dx * dx + dy * dy);\n }\n\n // Example of Operator Overloading\n Point operator +(Point other) => new Point(x + other.x, y + other.y);\n}\n\n// All Dart programs start with main().\nvoid main() {\n // Instantiate point objects.\n var p1 = new Point(10, 10);\n var p2 = new Point.origin();\n var distance = p1.distanceTo(p2);\n print(distance);\n}" ], "related": [ "csharp", "erlang", "javascript", "smalltalk", "strongtalk", "c", "android", "ios", "eclipse-editor", "linux", "sublime-editor", "emacs-editor", "vim-editor", "visual-studio-code-editor", "algol", "ruby", "self", "coffeescript", "elm", "fantom", "go", "haxe", "opa", "typescript" ], "summary": "Dart is a general-purpose programming language originally developed by Google and later approved as a standard by Ecma (ECMA-408). It is used to build web, server and mobile applications, and for Internet of Things (IoT) devices. It is open-source software under a permissive free software license (modified BSD license). Dart is an object-oriented, class defined, single inheritance language using a C-style syntax that transcompiles optionally into JavaScript. It supports interfaces, mixins, abstract classes, reified generics, optional typing, and a sound type system.", "pageId": 33033735, "dailyPageViews": 389, "created": 2011, "backlinksCount": 614, "revisionCount": 763, "appeared": 2011, "fileExtensions": [ "dart" ], "url": "https://en.wikipedia.org/wiki/Dart_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "dart" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nlohanidamodar flutter_ui_challenges https://github.com/lohanidamodar.png https://github.com/lohanidamodar/flutter_ui_challenges Dart #00B4AB 913 252 401 \"Trying to replicate various app UIs in flutter\"\nFilledStacks flutter-tutorials https://github.com/FilledStacks.png https://github.com/FilledStacks/flutter-tutorials Dart #00B4AB 735 217 156 \"The repo contains the source code for all the tutorials on the FilledStacks Youtube channel.\"\nalibaba flutter-go https://github.com/alibaba.png https://github.com/alibaba/flutter-go Dart #00B4AB 16608 2283 1293 \"flutter 开发者帮助 APP，包含 flutter 常用 140+ 组件的demo 演示与中文文档\"\nmobxjs mobx.dart https://github.com/mobxjs.png https://github.com/mobxjs/mobx.dart Dart #00B4AB 763 73 95 \"MobX for the Dart language. Hassle-free, reactive state-management for your Dart and Flutter apps.\"\nflutter flutter https://github.com/flutter.png https://github.com/flutter/flutter Dart #00B4AB 74265 9095 2535 \"Flutter makes it easy and fast to build beautiful mobile apps.\"\nxuelongqy flutter_easyrefresh https://github.com/xuelongqy.png https://github.com/xuelongqy/flutter_easyrefresh Dart #00B4AB 1101 167 206 \"A widget provided to the flutter scroll component pull-refresh and push-load.\"\niampawan GDG-DevFest-App https://github.com/iampawan.png https://github.com/iampawan/GDG-DevFest-App Dart #00B4AB 364 91 228 \"An App Template For GDG DevFest\"\nhuextrat TheGorgeousLogin https://github.com/huextrat.png https://github.com/huextrat/TheGorgeousLogin Dart #00B4AB 834 226 87 \"Login page built with @flutter 😍\"\nfelangel bloc https://github.com/felangel.png https://github.com/felangel/bloc Dart #00B4AB 2455 446 237 \"A predictable state management library that helps implement the BLoC design pattern\"\nasjqkkkk flutter-todos https://github.com/asjqkkkk.png https://github.com/asjqkkkk/flutter-todos Dart #00B4AB 692 98 474 \"📝 全面而又精美的Flutter Todo-List app, 除了适合日常使用，作为flutter的实践项目也是超级合适的哟！\"\nOpenFlutter flutter_screenutil https://github.com/OpenFlutter.png https://github.com/OpenFlutter/flutter_screenutil Dart #00B4AB 1010 106 125 \"Flutter screen adaptation, font adaptation, get screen information\"\ndevefy Flutter-Story-App-UI https://github.com/devefy.png https://github.com/devefy/Flutter-Story-App-UI Dart #00B4AB 414 148 106 \nleisim hive https://github.com/leisim.png https://github.com/leisim/hive Dart #00B4AB 325 20 154 \"Lightweight and blazing fast key-value database written in pure Dart.\"\nflutter plugins https://github.com/flutter.png https://github.com/flutter/plugins Dart #00B4AB 7934 3259 534 \"Plugins for Flutter, including FlutterFire, maintained by the Flutter team\"\nSh1d0w multi_image_picker https://github.com/Sh1d0w.png https://github.com/Sh1d0w/multi_image_picker Dart #00B4AB 410 84 63 \"Flutter plugin that allows you to display multi image picker on iOS and Android. 👌🔝🎉\"\nmdanics fluttergram https://github.com/mdanics.png https://github.com/mdanics/fluttergram Dart #00B4AB 786 218 46 \"A fully functional Instagram clone written in Flutter using Firebase / Firestore\"\nflutter samples https://github.com/flutter.png https://github.com/flutter/samples Dart #00B4AB 3985 1004 368 \"A collection of Flutter examples and demos.\"\nflutter flutter_web https://github.com/flutter.png https://github.com/flutter/flutter_web Dart #00B4AB 4411 299 279 \"Bring your Flutter code to web browsers\"\nbrianegan flutter_architecture_samples https://github.com/brianegan.png https://github.com/brianegan/flutter_architecture_samples Dart #00B4AB 3791 646 171 \"TodoMVC for Flutter\"\nmemspace zefyr https://github.com/memspace.png https://github.com/memspace/zefyr Dart #00B4AB 772 137 55 \"Soft and gentle rich text editing for Flutter applications.\"\nduytq94 flutter-chat-demo https://github.com/duytq94.png https://github.com/duytq94/flutter-chat-demo Dart #00B4AB 413 152 67 \"This is the demo for chat app by Flutter\"\npeng8350 flutter_pulltorefresh https://github.com/peng8350.png https://github.com/peng8350/flutter_pulltorefresh Dart #00B4AB 748 119 115 \"a widget provided to the flutter scroll component drop-down refresh and pull up load.\"\ntheyakka fluro https://github.com/theyakka.png https://github.com/theyakka/fluro Dart #00B4AB 1703 148 143 \"Fluro is a Flutter routing library that adds flexible routing options like wildcards, named parameters and clear route definitions.\"\nMarcioQuimbundo uber_clone https://github.com/MarcioQuimbundo.png https://github.com/MarcioQuimbundo/uber_clone Dart #00B4AB 363 166 36 \npauldemarco flutter_blue https://github.com/pauldemarco.png https://github.com/pauldemarco/flutter_blue Dart #00B4AB 834 288 67 \"Bluetooth plugin for Flutter\"", "trendingProjectsCount": 26, "type": "programming", "interpreters": [ "dart" ], "aceMode": "dart", "codemirrorMode": "dart", "codemirrorMimeType": "application/dart", "tmScope": "source.dart", "repos": 737948, "id": "Dart" }, "githubBigQuery": { "repos": 5727, "users": 3075, "id": "Dart" }, "monaco": "dart", "codeMirror": "dart", "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "dart" ], "id": "Dart" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 26, "commitCount": 1555, "sampleCount": 1, "example": [ "import 'dart:math' as math;\n\nclass Point {\n num x, y;\n\n Point(this.x, this.y);\n\n num distanceTo(Point other) {\n var dx = x - other.x;\n var dy = y - other.y;\n return math.sqrt(dx * dx + dy * dy);\n }\n}\n\nvoid main() {\n var p = new Point(2, 3);\n var q = new Point(3, 4);\n print('distance from p to q = ${p.distanceTo(q)}');\n}\n" ], "url": "https://github.com/dart-atom/dartlang" }, "languageServerProtocolProject": [ "https://github.com/dart-lang/sdk\nwrittenIn dart", "https://github.com/natebosch/dart_language_server\nwrittenIn dart" ], "projectEuler": { "memberCount": { "2019": 22, "2022": 54 }, "id": "Dart" }, "helloWorldCollection": [ "// Hello world in Dart\n\nmain() {\n print('Hello world!');\n}" ], "leachim6": { "filepath": "d/Dart.dart", "fileExtensions": [ "dart" ], "example": [ "main() {\n print('Hello World');\n}\n" ], "id": "Dart" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Dart", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nint square(int num) {\n return num * num;\n}\n\nint main(List args) {\n return square(int.fromEnvironment(\"input\"));\n}\n" ], "id": "Dart" }, "rijuRepl": { "example": [ "void main() {\n print('Hello, world!');\n}\n" ], "id": "https://riju.codes/dart" }, "tryItOnline": "dart", "indeedJobs": { "2022": 208, "query": "dart developer" }, "stackOverflowSurvey": { "2021": { "users": 4965, "medianSalary": 32986, "fans": 7018, "percentageUsing": 0.06 } }, "officialBlogUrl": [ "https://news.dartlang.org/" ], "faqPageUrl": [ "https://dart.dev/faq" ], "downloadPageUrl": [ "https://dart.dev/get-dart" ], "subreddit": [ { "memberCount": { "2022": 35109 }, "url": "https://reddit.com/r/dartlang" } ], "tiobe": { "currentRank": 22, "id": "Dart" }, "pypl": "Dart", "packageRepository": [ "https://pub.dartlang.org/" ], "twitter": "https://twitter.com/dart_lang", "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2014|Apress|Dart for Absolute Beginners|Kopec, David|9781430264811\n2014|Apress|Web Programming with Dart|Belchin, Moises and Juberias, Patricia|9781484205570\n2014|Packt Publishing|Learning Dart|Balbaert, Ivo and Ridjanovic, Dzenan|9781849697422\n2014|Apress|Dart for Absolute Beginners|Kopec, David|9781430264828\n2015|Apress|Web Programming with Dart|Belchin, Moises and Juberias, Patricia|9781484205563\n2021|Packt Publishing|Flutter Cookbook: Over 100 proven techniques and solutions for app development with Flutter 2.2 and Dart|Alessandria, Simone and Kayfitz, Brian|9781838827373\n2021|Bowker|Dart Apprentice (First Edition): Beginning Programming with Dart|Tutorial Team, raywenderlich and Sande, Jonathan and Galloway, Matt|9781950325320\n2015|Addison-Wesley Professional|Dart Programming Language, The|Bracha, Gilad|9780133429954\n2019|Packt Publishing|Flutter for Beginners: An introductory guide to building cross-platform mobile applications with Flutter and Dart 2|Biessek, Alessandro|9781788990523\n2014|Packt Publishing|Mastering Dart|Akopkokhyants, Sergey|9781783989577\n2014|Packt Publishing|Learning Dart|Balbaert, Ivo and Ridjanovic, Dzenan|9781849697439\n2019|Apress|Quick Start Guide to Dart Programming: Create High-Performance Applications for the Web and Mobile|Sinha, Sanjib|9781484255629\n2014|Packt Publishing|Dart Cookbook|Balbaert, Ivo|9781783989638\n2015|Addison-Wesley Professional|The Dart Programming Language|Bracha, Gilad|9780321927705\n2019|Apress|Introducing Dart Sass: A Practical Introduction to the Replacement for Sass, Built on Dart|Libby, Alex|9781484243725\n2015|Packt Publishing|Dart By Example|Mitchell, Davy|9781785289798\n2019|Apress|Quick Start Guide to Dart Programming: Create High-Performance Applications for the Web and Mobile|Sinha, Sanjib|9781484255612\n2014|Packt Publishing|Dart Cookbook|Balbaert, Ivo|9781783989621\n2015|Packt Publishing|Dart By Example|Mitchell, Davy|9781785282478\n2014|Pragmatic Bookshelf|Dart 1 for Everyone: Fast, Flexible, Structured Code for the Modern Web|Strom, Chris|9781941222256\n2021|De Gruyter Oldenbourg|Modern App Development with Dart and Flutter 2: A Comprehensive Introduction to Flutter (de Gruyter Stem)|Meiller, Dieter|9783110721270\n20150525|Packt Publishing|Dart Essentials|Martin Sikora|9781783989614\n2013|Apress|Beginning Dart|Dylan McClung|9781430257974\n20130115|Simon & Schuster|Dart in Action|Chris Buckett|9781638352846\n20150925|Packt Publishing|Learning Dart - Second Edition|Ivo Balbaert; Dzenan Ridjanovic|9781785288531\n2019||Learn Dart The Hard Way|Sanjib Sinha|9781074723538\n20210920|De Gruyter|App-Entwicklung mit Dart und Flutter 2|Dieter Meiller|9783110753172\n20200505|De Gruyter|Moderne App-Entwicklung mit Dart und Flutter|Dieter Meiller|9783110690705\n2021|Walter De Gruyter Gmbh & Co Kg|Modern App Development With Dart And Flutter 2|Dieter Meiller|9783110721331\n20210621|De Gruyter|Modern App Development with Dart and Flutter 2|Dieter Meiller|9783110721607", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Spicing Up Dart with Side Effects|10.1145/2742694.2747873|8|2|E. Meijer and K. Millikin and Gilad Bracha|a3cd2932e0511bc9603395791a8f14e1fb78ecda\n2016|Type unsoundness in practice: an empirical study of Dart|10.1145/2989225.2989227|6|0|Gianluca Mezzetti and Anders Møller and Fabio Strocco|0675029b48e3d49abde25b71de11681d952c4c65\n2015|Message safety in Dart|10.1145/2816707.2816711|5|0|Erik Ernst and Anders Møller and Mathias Schwarz and Fabio Strocco|1220a095ecabbd68b84112990be1f7363adda3f0\n2020|A Freights Status Management System Based on Dart and Flutter Programming Language|10.1088/1742-6596/1530/1/012020|3|0|Ghusoon Idan Arb and K. Al-Majdi|6a772efe74fee9b0c1f8194e3337666a80b11e8f\n2020|JAVA and DART programming languages: conceptual comparison|10.11591/IJEECS.V17.I2.PP845-849|2|0|A. M. Hassan|4aa90271fcb9625127f1aa3c280ecee1d40a35ea\n2014|Ensuring that your dart will hit the mark: An introduction to dart contracts|10.1109/IRI.2014.7051913|1|0|Patrice Chalin|e42a5d2cb0beb083db8236809b3105f98ad274eb" }, "dartcvl": { "title": "DartCVL", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/457813ea039d6085ef591679bdca0f83c24f89fd" ], "country": [ "United States" ], "originCommunity": [ "Dartmouth College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3606", "centralPackageRepositoryCount": 0 }, "dartmouth-basic": { "title": "Dartmouth BASIC", "appeared": 1964, "type": "pl", "creators": [ "John G. Kemeny", "Thomas E. Kurtz" ], "country": [ "United States" ], "originCommunity": [ "Dartmouth College" ], "wikipedia": { "example": [ "5 LET S = 0 \n10 MAT INPUT V \n20 LET N = NUM \n30 IF N = 0 THEN 99 \n40 FOR I = 1 TO N \n45 LET S = S + V(I) \n50 NEXT I \n60 PRINT S/N \n70 GO TO 5 \n99 END" ], "related": [ "algol", "basic", "microsoft-basic", "true-basic", "act-iii", "algol-60", "ascii", "hp-time-shared-basic", "basic-plus", "altair-basic" ], "summary": "Dartmouth BASIC is the original version of the BASIC programming language. It is so named because it was designed and implemented at Dartmouth College by John Kemény and Thomas Kurtz. It was developed as part of the Dartmouth Time Sharing System (DTSS) and was one of the first programming languages intended to be used interactively. Several versions were produced at Dartmouth over the years, all implemented as compile and go compilers. They were implemented by teams of undergraduate programmers working for Kemény and Kurtz. The first version ran on 1 May 1964, and it was opened to general users in June; upgrades followed, culminating in the seventh release in 1979. Dartmouth also introduced a dramatically updated version known as Structured BASIC (or SBASIC) in 1975, which added various structured programming concepts. SBASIC formed the basis of the ANSI-standard Standard BASIC efforts in the early 1980s. Most dialects of BASIC, notably Microsoft BASIC (MS BASIC), can trace their history to the Fifth Edition. In contrast to the Dartmouth compilers, most other BASICs were written as interpreters. They also lack some of the more advanced features, notably the matrix math commands. Cutting these features allowed these versions to run in the very small main memory of early microcomputers. By the early 1980s, tens of millions of home computers were running some variant of the MS interpreter. It became the de facto standard for BASIC, which led to the abandonment of the ANSI SBASIC efforts. Kemény and Kurtz later left Dartmouth to develop and promote a version of SBASIC known as True BASIC. Many of the early computer games of the mainframe computer era trace their history to Dartmouth BASIC and the DTSS system. A selection of these were collected, in HP 2000 versions, in the People's Computer Company book What to do after you hit Return. Many of the original source listings in BASIC Computer Games and related works also trace their history to Dartmouth BASIC.", "created": 2004, "backlinksCount": 126, "pageId": 516845, "revisionCount": 301, "dailyPageViews": 42, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/Dartmouth_BASIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1948", "centralPackageRepositoryCount": 0, "isbndb": "" }, "das": { "title": "DAS", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2001472c3f06a65c3397aeca442ab5045cca0620" ], "country": [ "United States" ], "originCommunity": [ "Martin Company" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1949", "wordRank": 6584, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1999|Design of an EEG-based Brain-Computer Interface (BCI) from Standard Components running in Real-time under Windows - Entwurf eines EEG-basierten Brain-Computer Interfaces (BCI) mit Standardkomponenten, das unter Windows in Echtzeit arbeitet|10.1515/bmte.1999.44.1-2.12|57|0|C. Guger and A. Schlogl and D. Walterspacher and G. Pfurtscheller|e3f17f3d326739345fccb0a86f79af7b8f702cb2\n2019|Das Contract - A Visual Domain Specific Language for Modeling Blockchain Smart Contracts|10.1007/978-3-030-37933-9_10|8|0|Marek Skotnica and R. Pergl|bd656c8502ad57404a10148e6e7a7638ae4dd6f9\n2017|Desenvolvimento e validação de uma prova de avaliação das competências iniciais de programação|10.17013/RISTI.25.66-81|7|1|Joana Costa and G. Miranda|fc93d46c6c37bf654b2cff3c60bfe3f38d12a0ca\n2016|Entre o rádio e a televisão: gênese e transformações das novelas brasileiras|10.30962/EC.1309|1|0|Eduardo Vicente and R. Soares|700fcbc77eb41a2b6db50b1c238f415bf0b48ff4\n2020|Apresentação das Mecânicas de um Jogo Desenvolvido com Arcade|10.14210/cotb.v11n1.p600-603|1|0|Vítor Augusto Ueno Otto and Alisson Reinaldo Flores and Manuela Helena Weidmann and Kauan Claudio Elias and Ricardo De la Rocha Ladeira and Aldelir Fernando Luiz and Adriano Pessini|abb20cac2d920370ecbdd5c58b960706a6a6ae0e" }, "dashrep": { "title": "Dashrep", "appeared": 2011, "type": "pl", "creators": [ "Richard Fobes" ], "description": "Dashrep™, the text-manipulation programming language that is powerful and fast, yet simple", "website": "http://www.dashrep.org/", "country": [ "United States" ], "originCommunity": [ "www.solutionscreative.com" ], "example": [ "animal-type:\ndolphin\n----\ncharacteristic-for-dolphin:\ntalkative\n----\nstart-here:\nThe animal-type is characteristic-for\nfenambee animal-type amenn no-space .\n----" ], "githubRepo": { "stars": 4, "forks": 0, "subscribers": 3, "created": 2011, "updated": 2022, "description": "Dashrep is a versatile descriptive programming language based on hyphenated phrases being successively expanded into replacement text. It is a much more flexible alternative to using a template language.", "url": "https://github.com/cpsolver/Dashrep-language" }, "repoStats": { "firstCommit": 2011, "commits": 2760, "committers": 1, "files": 1944 } }, "dasl": { "title": "Distributed Application Specification Language", "appeared": 1999, "type": "pl", "standsFor": "Distributed Application Specification Language", "country": [ "United States" ], "originCommunity": [ "Sun Microsystems" ], "wikipedia": { "summary": "The DASL Programming Language (Distributed Application Specification Language) is a high-level, strongly typed programming language originally developed at Sun Microsystems Laboratories between 1999 and 2003 as part of the Ace Project. The goals of the project were to enable rapid development of web-based applications based on Sun's J2EE architecture, and to eliminate the steep learning curve of platform-specific details. DASL defines an application as a domain model with one or more logical presentation models, where a logical presentation model consists of a choreography of the domain model objects described in a set of forms with attached actions. DASL generates the graphical user interface directly from the logical presentation. DASL is unique among modern application programming languages in its ability to generate a modern graphic user interface for an application without requiring the programmer to define the user interface explicitly, while allowing the programmer to control the look and feel of the generated graphic user interface. The DASL language is partially declarative and partially procedural. Description of object/data structures and persistence, and the description of the logical presentation, are declarative. Basic object constraints and behavior are declarative, while additional object behaviors are specified procedurally as methods. Queries can be defined either declaratively or by writing methods. The language and development environment are a practical realization of the model-driven architecture (MDA) approach. The programmer uses DASL to produce the platform-independent model or PIM, and the language code generators automatically produce and deploy the platform-specific model or PSM. New PSMs may be introduced by writing new code generators.", "pageId": 9216093, "created": 2007, "backlinksCount": 12, "revisionCount": 54, "dailyPageViews": 10, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Distributed_Application_Specification_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "dasm": { "title": "Dasm", "appeared": 1988, "type": "assembly", "website": "https://dasm-assembler.github.io/", "country": [ "United States and Germany and Canada" ], "originCommunity": [ "https://github.com/dasm-assembler/" ], "domainName": { "awisRank": { "2022": 7232296 }, "name": "dasm-assembler.github.io" }, "githubRepo": { "firstCommit": 2019, "stars": 148, "forks": 25, "subscribers": 15, "created": 2019, "updated": 2022, "description": "Macro assembler with support for several 8-bit microprocessors", "issues": 43, "url": "https://github.com/dasm-assembler/dasm" }, "repoStats": { "firstCommit": 2019, "commits": 316, "committers": 25, "files": 364 }, "pygmentsHighlighter": { "filename": "asm.py", "fileExtensions": [ "dasm16", "dasm" ], "id": "DASM16" } }, "dat-protocol": { "title": "dat-protocol", "appeared": 2013, "type": "protocol", "creators": [ "Max Ogden" ], "website": "https://dat.foundation/", "country": [ "Germany and United Kingdom" ], "originCommunity": [ "https://github.com/dat-ecosystem" ], "domainName": { "registered": 2019, "name": "dat.foundation" }, "githubRepo": { "firstCommit": 2013, "stars": 8232, "forks": 495, "subscribers": 320, "created": 2013, "updated": 2022, "description": ":floppy_disk: peer-to-peer sharing & live syncronization of files via command line [ DEPRECATED - More info on active projects and modules at https://dat-ecosystem.org/ ] ", "issues": 105, "url": "https://github.com/datproject/dat" }, "repoStats": { "firstCommit": 2013, "commits": 2270, "committers": 101, "files": 73 }, "isbndb": "", "semanticScholar": "" }, "data-access-language": { "title": "Data Access Language", "appeared": 1990, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "related": [ "sql", "unix", "pl-sql", "transact-sql", "hypercard" ], "summary": "Data Access Language, or simply DAL, was a SQL-like language and application programming interface released by Apple Computer in 1990 to provide unified client/server access to database management systems. It was known for poor performance and high costs, something Apple did little to address over its short lifetime, before it was sold off in 1994. DAL is used as the native SQL dialect of the PrimeBase SQL server, as well as the now-defunct Butler SQL.", "created": 2005, "backlinksCount": 7, "pageId": 1919898, "revisionCount": 42, "dailyPageViews": 7, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Data_Access_Language" }, "centralPackageRepositoryCount": 0 }, "data-general-business-basic": { "title": "Data General Business Basic", "appeared": 1970, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Data General Corporation" ], "wikipedia": { "related": [ "basic", "cobol", "b32-business-basic", "unix" ], "summary": "Data General Business Basic was a BASIC interpreter (based on MAI Basic Four's version) developed by Data General for their Nova minicomputer in the 1970s, and later ported to the Data General Eclipse MV and AViiON computers. Most business applications for the Nova were developed in Business Basic. Business Basic was an integer-only language inspired by COBOL, and contained powerful string-handling functions and the ability to manipulate indexed files very quickly. It also provided full control over the display screen, with cursor positioning, attribute setting, and region-blanking commands. Business Basic could interface to Data General's INFOS II database, and make calls directly to the operating system. A lock server gave multiple concurrent users efficient access to database records. Small business programs could be developed and debugged rapidly with Business Basic because of the interactive nature of the interpreter, but the language did not provide many structured programming features, and as programs grew larger, maintenance became a problem. There was limited memory space for Business Basic programs on the Nova, and programmers often resorted to tricks such as self-modifying programs, which was easy to program in Business Basic, but complicated to debug. The original version of the language was \"double precision\", i.e. 32-bit (and so each integer used two 16-bit Nova words). When Data General ported the language to the MV line, they included two copies of the language, one \"double precision\", and one \"triple precision\". Unfortunately the two were incompatible with each other in subtle ways. Although Data General improved the language in some ways, such as adding multiple-line IF THEN ELSE END IF statements, they failed to lift many of the constraints of the language on the MV machines, such as a 9,999 line maximum, 384 variable limit, and maximum of 16 open files.", "created": 2004, "backlinksCount": 13, "pageId": 647720, "revisionCount": 16, "dailyPageViews": 5, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Data_General_Business_Basic" }, "centralPackageRepositoryCount": 0 }, "data-text": { "title": "DATA-TEXT", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/35fb45dcb19b7c25d2621c13651e6b6ac0091820" ], "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=579", "centralPackageRepositoryCount": 0 }, "databus": { "title": "DATABUS", "appeared": 1972, "type": "pl", "reference": [ "http://www.rpdms.com/datapoint.html" ], "country": [ "United States" ], "originCommunity": [ "Datapoint Corporation" ], "wikipedia": { "summary": "Programming Language for Business or PL/B is a business-oriented programming language originally called DATABUS and designed by Datapoint in 1972[2] as an alternative to COBOL because Datapoint's 8-bit computers could not fit COBOL into their limited memory, and because COBOL did not at the time have facilities to deal with Datapoint's built-in keyboard and screen.", "backlinksCount": 13, "pageId": 80737, "dailyPageViews": 61, "url": "https://en.wikipedia.org/wiki/Programming_Language_for_Business" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1952", "centralPackageRepositoryCount": 0 }, "dataflex": { "title": "Dataflex", "appeared": 1982, "type": "pl", "reference": [ "http://www.dataflex.wiki/index.php/DataFlex" ], "country": [ "United States" ], "originCommunity": [ "Data Access Worldwide" ], "wikipedia": { "dailyPageViews": 33, "url": "https://en.wikipedia.org/wiki/DataFlex" }, "leachim6": { "filepath": "d/DataFlex", "example": [ "/tela\n\nHello World\n\n/*\n\nclearscreen\n\npage tela\n" ], "id": "DataFlex" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2448", "centralPackageRepositoryCount": 0 }, "datafun": { "title": "datafun", "appeared": 2015, "type": "pl", "creators": [ "Michael Arntzenius" ], "description": "It's a simple, pure, and total functional language that generalizes Datalog. Datafun's superpower is that it can concisely and declaratively express and compute fixed points of monotone maps on semilattices.", "website": "http://www.rntz.net/datafun/", "reference": [ "http://www.rntz.net/files/datafun.pdf" ], "country": [ "United Kingdom and Canada" ], "originCommunity": [ "University of Birmingham" ], "githubRepo": { "firstCommit": 2015, "stars": 330, "forks": 15, "subscribers": 41, "created": 2015, "updated": 2022, "description": "Research on integrating datalog & lambda calculus via monotonicity types", "issues": 2, "url": "https://github.com/rntz/datafun" }, "repoStats": { "firstCommit": 2015, "commits": 2219, "committers": 5, "files": 393 }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "datalisp": { "title": "Datalisp", "appeared": 2020, "type": "pl", "creators": [ "ilmu" ], "description": "Canonical S-expressions and logic programming for metaprogramming.", "website": "http://datalisp.is" }, "datalog": { "title": "Datalog", "appeared": 1977, "type": "pl", "reference": [ "http://www.learndatalogtoday.org/", "http://datalog.sourceforge.net/datalog.html", "https://percival.jake.tl/" ], "country": [ "United States", "Italy" ], "originCommunity": [ "University of Maryland" ], "related": [ "datomic" ], "hasLineComments": { "example": "% A comment", "value": true }, "hasComments": { "example": "% A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "%" ] ], "example": [ "parent(john, douglas). % store some data\nparent(john, douglas)? % run a query" ], "wikipedia": { "example": [ "ancestor(X,Y) :- parent(X,Y).\n ancestor(X,Y) :- parent(X,Z),ancestor(Z,Y)." ], "related": [ "prolog", "java", "owl", "c", "python", "ruby", "lua", "clojure", "racket", "tcl", "haskell", "dot-ql", "rdf", "sparql" ], "summary": "Datalog is a declarative logic programming language that syntactically is a subset of Prolog. It is often used as a query language for deductive databases. In recent years, Datalog has found new application in data integration, information extraction, networking, program analysis, security, and cloud computing. Its origins date back to the beginning of logic programming, but it became prominent as a separate area around 1977 when Hervé Gallaire and Jack Minker organized a workshop on logic and databases. David Maier is credited with coining the term Datalog.", "pageId": 968357, "dailyPageViews": 160, "created": 2004, "backlinksCount": 87, "revisionCount": 376, "url": "https://en.wikipedia.org/wiki/Datalog" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Datalog", "hopl": "https://hopl.info/showlanguage.prx?exp=3793", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1985|Cygnus|Datalog 2|R. Porkess|9780948506000\n20151113|Springer Nature|Datalog and Logic Databases|Sergio Greco; Cristian Molinaro|9783031018541\n20151101|Morgan & Claypool Publishers|Datalog and Logic Databases|Sergio Greco; Cristian Molinaro|9781627051149", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1989|What you Always Wanted to Know About Datalog (And Never Dared to Ask)|10.1109/69.43410|659|70|S. Ceri and G. Gottlob and L. Tanca|fa1570dc4e7853c2c6d0ff21a1ac8327e4ebe4b5\n1997|Disjunctive datalog|10.1145/261124.261126|517|36|Thomas Eiter and G. Gottlob and H. Mannila|d445c88e0333ba617771cf24e71691eac85a483c\n2006|codeQuest: Scalable Source Code Queries with Datalog|10.1007/11785477_2|211|10|Elnar Hajiyev and M. Verbaere and O. Moor|95816cc9b43d53d23cce83c42e648699156aa031\n2010|Dedalus: Datalog in Time and Space|10.1007/978-3-642-24206-9_16|138|15|P. Alvaro and William R. Marczak and Neil Conway and J. Hellerstein and D. Maier and R. Sears|bc2a9f8ca02b809230a6b6e0c670c5837a73d011\n2013|SociaLite: Datalog extensions for efficient social network analysis|10.1109/ICDE.2013.6544832|101|16|Jiwon Seo and Stephen Guo and M. Lam|94057235c4bdea2c4df6304ed98ca23e77749893\n1999|Workflow, transactions and datalog|10.1145/303976.304005|77|10|A. Bonner|e601c809f7bc8dbaee66cdd5666c0898dd070fbd\n2016|From Datalog to flix: a declarative language for fixed points on lattices|10.1145/2908080.2908096|72|11|Magnus Madsen and Ming-Ho Yee and O. Lhoták|50e8b66fad4dd05e1e5e776ffc08b2d4c80b5a3f\n2010|The Disjunctive Datalog System DLV|10.1007/978-3-642-24206-9_17|69|4|Mario Alviano and Wolfgang Faber and N. Leone and S. Perri and G. Pfeifer and G. Terracina|fb0aed07aedabb52489e7b2cf3766b00691d7225\n2010|Dyna: Extending Datalog for Modern AI|10.1007/978-3-642-24206-9_11|61|1|Jason Eisner and N. Filardo|8b3bfe03e36ab65d48655813586b43fc8ca3e9b0\n2005|CodeQuest: querying source code with datalog|10.1145/1094855.1094884|39|4|Elnar Hajiyev and M. Verbaere and O. Moor and K. Volder|df5328296c7c57b4bfefb20e97ece73dae86ad1b\n2011|Functional description of geoprocessing services as conjunctive datalog queries|10.1007/s10707-009-0093-4|34|5|D. Fitzner and J. Hoffmann and E. Klien|0e4370dbc008651b01fb96a0a1f761a78a685aa7\n2015|SociaLite: An Efficient Graph Query Language Based on Datalog|10.1109/TKDE.2015.2405562|34|3|Jiwon Seo and Stephen Guo and M. Lam|f61c359ecc37e9efeef3e3582170d2b13e753027\n2008|A Theoretical Framework for the Declarative Debugging of Datalog Programs|10.1007/978-3-540-88594-8_8|33|0|R. Caballero and Y. García-Ruiz and F. Sáenz-Pérez|02addce453fcfe5e5b73cfafa4f470d81ce461a9\n2019|Synthesizing Datalog Programs Using Numerical Relaxation|10.24963/ijcai.2019/847|32|2|X. Si and Mukund Raghothaman and K. Heo and M. Naik|6a2106628da2710b7a79f35f66dfd1cc015f14ae\n2012|Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues|10.1017/S1471068412000257|30|5|Mario Alviano and Wolfgang Faber and N. Leone and M. Manna|c5002f1933d1bdf9fbe36a92e92cfcda2f434739\n2016|Datafun: a functional Datalog|10.1145/2951913.2951948|22|2|Michael Arntzenius and N. Krishnaswami|9bc736e2d6e8cf97b0aff0d5cb448fe601bf3bab\n2015|Datalog and Logic Databases|10.2200/S00648ED1V01Y201505DTM041|20|1|S. Greco and Cristian Molinaro|87f8328daeb5f9a46a7e98d8065b8d180fe34615\n2012|Datalog in Academia and Industry|10.1007/978-3-642-32925-8|10|1|P. Barceló and R. Pichler|eb88ca35cacb9e17983fd1d11915c90e58cc8dbe\n2020|Fixpoints for the masses: programming with first-class Datalog constraints|10.1145/3428193|8|0|Magnus Madsen and O. Lhoták|4f982bf2c66f2c454fa66699b5546576b7d2dcad\n2017|Pipelined Bottom-Up Evaluation of Datalog Programs: The Push Method|10.1007/978-3-319-74313-4_4|7|0|Stefan Brass and H. Stephan|6707e67733af705f3fc2f383a96a702bae150091\n2018|Stratified Negation in Limit Datalog Programs|10.24963/ijcai.2018/259|7|0|M. Kaminski and B. C. Grau and Egor V. Kostylev and B. Motik and I. Horrocks|9da8b2dbb33ef494fc202131bff91fd052380a45\n2018|A Fuzzy Datalog Deductive Database System|10.1109/TFUZZ.2018.2806923|7|0|Pascual Julián-Iranzo and F. Sáenz-Pérez|cc3b9486bb908b6672f25d723011316603971f85\n2020|Generative Datalog with Continuous Distributions|10.1145/3375395.3387659|7|0|Martin Grohe and Benjamin Lucien Kaminski and J. Katoen and P. Lindner|090c51bb1dd57916289b2cce38c13336544f39bf\n2020|Formulog: Datalog for SMT-based static analysis|10.1145/3428209|7|1|Aaron Bembenek and M. Greenberg and Stephen Chong|dcaddf07fa88f656ee815db9fccaf35b6c004dd6\n2015|Debugging of wrong and missing answers for datalog programs with constraint handling rules|10.1145/2790449.2790522|6|0|R. Caballero and Y. García-Ruiz and F. Sáenz-Pérez|8f4a2fbd0542a13b5301ffb770a38d3afa4164fa\n2019|Declarative Programming for Microcontrollers - Datalog on Arduino|10.1007/978-3-030-46714-2_9|6|0|Mario Wenzel and Stefan Brass|146aa8fd69bdcc9cbb970cc2d2b638196930b333\n2018|SolverBlox: algebraic modeling in datalog|10.1145/3191315.3191322|5|0|Conrado Borraz-Sánchez and D. Klabjan and E. Pasalic and M. Aref|8d5b48a00215f42bca10a2b6c4bc902d2e78ade1\n2006|Datalog as a pointcut language in aspect-oriented programming|10.1145/1176617.1176664|4|0|Elnar Hajiyev and Neil Ongkingco and Pavel Avgustinov and O. Moor and D. Sereni and J. Tibble and M. Verbaere|2b2d76ca65a6412ddcb7692b7e73b89d33e5f1e6\n2016|Precise complexity guarantees for pointer analysis via Datalog with extensions*|10.1017/S1471068416000405|3|0|K. T. Tekle and Yanhong A. Liu|e07a2804422ff6f66ba866d9380278c94143a3b1\n2016|From Datalog to flix: a declarative language for fixed points on lattices|10.1145/2980983.2908096|3|0|MadsenMagnus and YeeMing-Ho and LhotákOndřej|b493eeb971c48cf9973a551e240d805f65e7a542\n2016|DatalogRA: datalog with recursive aggregation in the spark RDD model|10.1145/2960414.2960417|2|0|Marek Rogala and J. Hidders and J. Sroka|1deb70b80cdbc0b1847816d0a945e202c3d0755e\n2021|A process framework for inducing and explaining Datalog theories|10.1007/s11634-020-00422-7|2|0|Mark Gromowski and M. Siebers and Ute Schmid|3acdc461e5a20e4ceed01b88c67e90825f0c8b3f\n2015|Extending Datalog Intelligence|10.1007/978-3-319-22002-4_1|1|0|B. Kimelfeld|a88be1d7f844ed52bfb37e0da7bb948f504b4ba8\n2010|Informing Datalog through Language Intelligence - A Personal Perspective|10.1007/978-3-642-24206-9_10|1|0|V. Dahl|93740c09536c6d9cdeecd5ff86bc51e552fb97e8\n2020|A Counterexample-Guided Debugger for Non-recursive Datalog|10.1007/978-3-030-64437-6_17|1|0|Van-Dang Tran and H. Kato and Zhenjiang Hu|48cf4ae27adb305e54448a18bef1e2f9d5cd3f14\n2021|Integrity Constraints for Microcontroller Programming in Datalog|10.1007/978-3-030-82472-3_12|1|0|Stefan Brass and Mario Wenzel|6148460c9227b477a438c739f7b615a88b533b23" }, "datan": { "title": "DATAN", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/70f1f9f2ca6218727b962a31051accd4c14b54b4" ], "country": [ "United States" ], "originCommunity": [ "The Boeing Company" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7662", "centralPackageRepositoryCount": 0 }, "datapackage": { "title": "Data Package", "appeared": 2007, "type": "jsonFormat", "creators": [ "Paul Walsh", "Rufus Pollock" ], "reference": [ "https://specs.frictionlessdata.io/data-package/" ], "country": [ "United Kingdom" ], "originCommunity": [ "Open Knowledge Foundation" ] }, "datapoint-dasl": { "title": "Datapoint's Advanced Systems Language", "appeared": 1982, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Datapoint" ], "aka": [ "DASL" ], "country": [ "United States" ], "originCommunity": [ "Datapoint Corporation" ], "wikipedia": { "related": [ "pascal", "c", "assembly-language" ], "summary": "DASL (Datapoint's Advanced Systems Language) was a programming language and compiler proprietary to Datapoint. Primarily influenced by Pascal with some C touches, it was created in the early 1980s by Gene Hughes. The compiler output was assembly language, which was typically processed through a peep-hole optimizer before the assembler and linker. Reflecting its name, DASL was used for systems programming, mainly by the vendor itself.", "created": 2004, "backlinksCount": 5, "pageId": 457504, "revisionCount": 28, "dailyPageViews": 4, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Datapoint%27s_Advanced_Systems_Language" }, "centralPackageRepositoryCount": 0 }, "datascript": { "title": "datascript", "appeared": 2014, "type": "queryLanguage", "country": [ "Germany" ], "originCommunity": [ "https://www.patreon.com/tonsky" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "(require '[datascript.core :as d])\n\n;; Implicit join, multi-valued attribute\n\n(let [schema {:aka {:db/cardinality :db.cardinality/many}}\n conn (d/create-conn schema)]\n (d/transact! conn [ { :db/id -1\n :name \"Maksim\"\n :age 45\n :aka [\"Max Otto von Stierlitz\", \"Jack Ryan\"] } ])\n (d/q '[ :find ?n ?a\n :where [?e :aka \"Max Otto von Stierlitz\"]\n [?e :name ?n]\n [?e :age ?a] ]\n @conn))\n\n;; => #{ [\"Maksim\" 45] }\n\n\n;; Destructuring, function call, predicate call, query over collection" ], "githubRepo": { "firstCommit": 2014, "stars": 4793, "forks": 280, "subscribers": 153, "created": 2014, "updated": 2022, "description": "Immutable database and Datalog query engine for Clojure, ClojureScript and JS", "issues": 75, "url": "https://github.com/tonsky/DataScript" }, "repoStats": { "firstCommit": 2014, "commits": 686, "committers": 70, "files": 99 } }, "datatrieve": { "title": "DATATRIEVE", "appeared": 1970, "type": "queryLanguage", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "summary": "DATATRIEVE is a database query and report writer tool from Hewlett-Packard. It runs on the OpenVMS operating system, as well as several PDP-11 operating systems. DATATRIEVE's command structure is nearly plain English, and it is an early example of a Fourth Generation Language (4GL). It works against flat files, indexed files, and databases. Such data files are delimited using record definitions stored in the Common Data Dictionary (CDD), or in RMS files. DATATRIEVE is used at many OpenVMS installations. DATATRIEVE was developed in the late 1970s and early 1980s by a team of software engineers at DEC's Central Commercial Engineering facilities in Merrimack and Nashua, New Hampshire, under database architect Jim Starkey. Many of the project's engineers went on to highly visible careers in database management and other software disciplines. DATATRIEVE adopted the wombat as its notional mascot; the program's help file responded to “HELP WOMBAT” with factual information about real world wombats.", "pageId": 2214310, "created": 2005, "backlinksCount": 7, "revisionCount": 38, "dailyPageViews": 6, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/DATATRIEVE" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5188", "fileType": "text", "centralPackageRepositoryCount": 0 }, "dataweave": { "title": "DataWeave", "appeared": 2014, "type": "pl", "description": "DataWeave is the MuleSoft expression language for accessing and transforming data received through a Mule app. DataWeave is tightly integrated with Mule runtime, which runs the scripts and expressions in your Mule app.", "reference": [ "https://docs.mulesoft.com/mule-runtime/4.1/dataweave" ], "country": [ "Argentina" ], "originCommunity": [ "https://github.com/mulesoft-labs/" ], "githubLanguage": { "fileExtensions": [ "dwl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.data-weave", "repos": 1326, "id": "DataWeave" }, "githubBigQuery": { "repos": 9, "users": 9, "id": "DataWeave" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2017, "committerCount": 1, "commitCount": 14, "sampleCount": 5, "example": [ "%dw 2.0\nvar number = 1234\nfun foo(func,name=\"Mariano\") = func(name)\ninput payload application/test arg=\"value\"\noutput application/json\n---\n{\n foo: \"bar\"\n}" ], "url": "https://github.com/mulesoft-labs/data-weave-tmLanguage" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "datev": { "title": "datev", "appeared": 2017, "type": "pl", "creators": [ "Markus Voelter", "Sergej Koˇsˇcejev" ], "description": "A Domain-Specific Language for Payroll Calculations", "website": "http://www.datev.de/", "documentation": [ "https://voelter.de/data/pub/PayrollDSL.pdf" ], "reference": [ "https://link.springer.com/chapter/10.1007/978-3-030-73758-0_4" ], "country": [ "Germany" ], "originCommunity": [ "DATEV eG" ], "domainName": { "name": "datev.de" }, "writtenIn": [ "mps", "kernel" ], "twitter": "https://twitter.com/datev?lang=en", "isOpenSource": false }, "datomic": { "title": "Datomic", "appeared": 2012, "type": "queryLanguage", "description": "Datomic's query and rules system is an extended form of Datalog. Datalog is a deductive query system, typically consisting of: A database of facts; A set of rules for deriving new facts from existing facts; a query processor that, given some partial specification of a fact or rule: finds all matching facts.", "website": "https://docs.datomic.com/on-prem/query/query.html", "country": [ "United States" ], "originCommunity": [ "Cognitect, Inc" ], "related": [ "edn", "datalog" ], "example": [ "[:find ?e \n :where [?e :age 42]]" ], "semanticScholar": "" }, "dax": { "title": "DAX", "appeared": 2009, "type": "queryLanguage", "description": "Data Analysis Expressions (DAX) is a formula expression language used in Analysis Services, Power BI, and Power Pivot in Excel. DAX formulas include functions, operators, and values to perform advanced calculations and queries on data in related tables and columns in tabular data models.", "website": "https://docs.microsoft.com/en-us/dax/dax-overview", "standsFor": "Data analysis expressions", "aka": [ "msdax" ], "originCommunity": [ "Microsoft" ], "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "keywords": [ "VAR", "RETURN", "NOT", "EVALUATE", "DATATABLE", "ORDER", "BY", "START", "AT", "DEFINE", "MEASURE", "ASC", "DESC", "IN", "BOOLEAN", "DOUBLE", "INTEGER", "DATETIME", "CURRENCY", "STRING" ], "example": [ "EVALUATE\n ( FILTER ( 'DimProduct', [SafetyStockLevel] < 200 ) )\nORDER BY [EnglishProductName] ASC" ], "wikipedia": { "related": [ "excel-app" ], "summary": "Data Analysis Expressions (DAX) is the native formula and query language for Microsoft PowerPivot, Power BI Desktop and SQL Server Analysis Services (SSAS) Tabular models. DAX includes some of the functions that are used in Excel formulas with additional functions that are designed to work with relational data and perform dynamic aggregation. It is, in part, an evolution of the Multidimensional Expression (MDX) language developed by Microsoft for Analysis Services multidimensional models (often called cubes) combined with Excel formula functions. It is designed to be simple and easy to learn, while exposing the power and flexibility of PowerPivot and SSAS tabular models.", "created": 2012, "backlinksCount": 14, "pageId": 37774833, "revisionCount": 30, "dailyPageViews": 76, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Data_analysis_expressions" }, "monaco": "msdax", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2018|Apress|Beginning DAX with Power BI: The SQL Pro’s Guide to Better Business Intelligence|Seamark, Philip|9781484234778\n20191210|Springer Nature|Pro DAX with Power BI|Philip Seamark; Thomas Martens|9781484248973\n20220524|Springer Nature|Up and Running with DAX for Power BI|Alison Box|9781484281888", "semanticScholar": "" }, "dbase": { "title": "DBase", "appeared": 1979, "type": "application", "website": "http://www.dbase.com/", "country": [ "United States" ], "originCommunity": [ "dBase, LLC" ], "domainName": { "registered": 1995, "awisRank": { "2022": 824464 }, "name": "dbase.com" }, "wikipedia": { "example": [ "i = 2\n myMacro = \"i + 10\"\n i = &myMacro\n * comment: i now has the value 12" ], "related": [ "c", "clipper", "foxpro", "xbase", "sql", "jet-propulsion-laboratory-display-information-system", "assembly-language", "shapefile", "excel-app", "emacs-editor", "visual-foxpro" ], "summary": "dBase (also stylized dBASE) was one of the first database management systems for microcomputers, and the most successful in its day. The dBase system includes the core database engine, a query system, a forms engine, and a programming language that ties all of these components together. dBase's underlying file format, the .dbf file, is widely used in applications needing a simple format to store structured data. dBase was originally published by Ashton-Tate for microcomputer operating system CP/M in 1980, and later ported to Apple II and IBM PC computers running DOS. On the PC platform, in particular, dBase became one of the best-selling software titles for a number of years. A major upgrade was released as dBase III, and ported to a wider variety of platforms, adding UNIX, and VMS. By the mid-1980s, Ashton-Tate was one of the \"big three\" software publishers in the early business software market, the others being Lotus Development and WordPerfect. Starting in the mid-1980s, several companies produced their own variations on the dBase product and especially the dBase programming language. These included FoxBASE+ (later renamed FoxPro), Clipper, and other so-called xBase products. Many of these were technically stronger than dBase, but could not push it aside in the market. This changed with the disastrous introduction of dBase IV, whose design and stability were so poor that many users switched to other products. At the same time, there was growing use of IBM-invented SQL (Structured Query Language) in database products. Another factor was user adoption of Microsoft Windows on desktop computers. The shift toward SQL and Windows put pressure on the makers of xBase products to invest in major redesign to provide new capabilities. In spite of growing pressure to evolve, in the early 1990s xBase products constituted the leading database platform for implementing business applications. The size and impact of the xBase market did not go unnoticed, and within one year, the three top xBase firms were acquired by larger software companies. Borland purchased Ashton-Tate, Microsoft bought Fox Software, and Computer Associates acquired Nantucket. However, by the following decade most of the original xBase products had faded from prominence and several disappeared. Products known as dBase still exist, owned by dBase LLC.", "pageId": 209537, "dailyPageViews": 205, "created": 2003, "backlinksCount": 163, "revisionCount": 669, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/DBase" }, "leachim6": { "filepath": "d/dBase.dbf", "fileExtensions": [ "dbf" ], "example": [ "? \"Hello World\"\n" ], "id": "dBase" }, "twitter": "https://twitter.com/dbaseworld", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe dBASE Language Handbook: Quicksilver, Clipper, Dbxl, dBASE III, dBASE III Plus, dBASE IV, and FoxBase+|1989|David M. Kalman|1790125|1.00|1|0\ndBASE Programming|1992|Robert A. Wray|3491721|0.0|0|0\ndBASE PLUS 10 Language Reference||dBase Llc|51609878|0.0|0|0\nObject-Oriented dBASE Programming for dBASE for Windows and dBASE V with Disk|1994|Jeff Winchell|21032735|0.0|0|0\ndBASE for Windows for Dummies|1994|Scott D. Palmer|4227742|1.00|1|0\nThe dBASE III programming handbook|1986|Cary N. Prague|10955845|0.0|0|0" }, "dbml": { "title": "dbml", "appeared": 2019, "type": "textMarkup", "website": "https://www.dbml-lang.org/", "domainName": { "name": "dbml-lang.org" }, "example": [ "Table users {\n id integer\n username varchar\n role varchar\n created_at timestamp\n}\nTable posts {\n id integer [primary key]\n title varchar\n body text [note: 'Content of the post']\n user_id integer\n status post_status\n created_at timestamp\n}\nEnum post_status {\n draft\n published\n private [note: 'visible via URL only']\n}" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n20856347|Show HN: DBML – simple DSL language to document database schemas|2019-09-02 02:26:46 UTC|1567391206|huy|16|57" }, "dc": { "title": "Dc", "appeared": 1978, "type": "pl", "standsFor": "desk calculator", "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "example": [ "#!/usr/bin/perl\n\nmy ($g,$e,$m) = map { \"\\U$_\" } @ARGV;\ndie \"$0 gen exp mod\\n\" unless $m;\n\nprint `echo $g $e $m | dc -e '\n# Hex input and output\n16dio\n# Read m, e and g from stdin on one line\n?SmSeSg\n\n# Function z: return g * top of stack\n[lg*]sz\n\n# Function Q: remove the top of the stack and return 1\n[sb1q]sQ\n\n# Function X(e): recursively compute g^e % m\n# It is the same as Sm^Lm%, but handles arbitrarily large exponents.\n# Stack at entry: e\n# Stack at exit: g^e % m\n# Since e may be very large, this uses the property that g^e % m == \n#\tif( e == 0 )\n#\t\treturn 1\n#\tx = (g^(e/2)) ^ 2\n#\tif( e % 2 == 1 )\n#\t\tx *= g\n#\treturn x %\n[\n\td 0=Q\t\t# return 1 if e==0 (otherwise, stack: e)\n\td 2% Sa\t\t# Store e%2 in a (stack: e)\n\t2/\t\t# compute e/2\n\tlXx\t\t# call X(e/2)\n\td*\t\t# compute X(e/2)^2\n\tLa1=z\t\t# multiply by g if e%2==1\n\tlm %\t\t# compute (g^e) % m\n] SX\n\nle\t# Load e from the register\nlXx\t# compute g^e % m\np\t# Print the result\n'`;" ], "related": [ "reverse-polish-notation", "unix", "c" ], "summary": "dc (desk calculator) is a cross-platform reverse-polish calculator which supports arbitrary-precision arithmetic. It is one of the oldest Unix utilities, predating even the invention of the C programming language. Like other utilities of that vintage, it has a powerful set of features but terse syntax. Traditionally, the bc calculator program (with infix notation) was implemented on top of dc. This article provides some examples in an attempt to give a general flavour of the language; for a complete list of commands and syntax, one should consult the man page for one's specific implementation.", "pageId": 562904, "created": 2004, "backlinksCount": 23, "revisionCount": 149, "dailyPageViews": 36, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/Dc_(computer_program)" }, "leachim6": { "filepath": "d/Dc.dc", "fileExtensions": [ "dc" ], "example": [ "[Hello World\n]n\n" ], "id": "Dc" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Dc", "rijuRepl": { "example": [ "[Hello, world!] p\n" ], "id": "https://riju.codes/dc" }, "tryItOnline": "dc", "hopl": "https://hopl.info/showlanguage.prx?exp=1957", "fileType": "text", "wordRank": 1109, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|DC motors and servo-motors controlled by Raspberry Pi 2B|10.1051/MATECCONF/201712502025|8|1|Michal Šustek and Miroslav Marcaník and P. Tomášek and Z. Úředníček|00cfa6b13303c9215862b4198f17f6b6a369f94f\n2011|Performance evaluation of brushless DC permanent magnet motor using Finite Element Method|10.1109/IEMDC.2011.5994767|5|0|T. Akinaga and C. Pompermaier and F. Kalluf and M. V. Ferreira da Luz|fb4df742060b2ed18b57058a5962bc9dbb7fd515\n2015|750-kW interleaved buck converter dc supply control implementation in a low-cost FPGA|10.1109/APEC.2015.7104755|4|0|Yusi Liu and C. Farnell and Shamim Ahmed and J. Balda and H. Mantooth|b943d45c558d6a1794db4a8f7befc88ecac39b42\n2017|The implementation of a measurement system for brushless DC motor parameters|10.1080/15435075.2017.1350184|4|0|Tze-Yee Ho and Fang-Ta Liu and Guan-Wei Ho and Yan Lin|c6c59cce13eab1d9ff0649916a0abfd2ace70f16\n2005|DESAIN KONTROL PID DENGAN METODA TUNING DIRECT SYNTHESIS UNTUK PENGATURAN KECEPATAN MOTOR DC|10.20885/.V10I4.101|3|0|R. Gozali|842a57ba5b29fe69a5609757b0c3e6dcad59b886\n2012|DC power supply system for intelligent server|10.1109/ISPACS.2012.6473488|3|0|Ching-Chang Wong and Chih-Cheng Liu and K. Hou|dd85c42f66f13d41bd23bdf9600e07562b364c5c\n2012|A VIRTUAL INSTRUMENT FOR DC POWER FLOW SOLUTION USING LABVIEW LANGUAGE|10.15598/AEEE.V10I2.589|3|0|S. Souag and F. Benhamida|1be57a8be838d4ae7f0070586a61ee75b9a6c5e9\n2007|Real-time flatness-based control of a DC motor|10.1109/ICECS.2007.4511210|2|0|S. Bouallègue and M. Ayadi and Joseph Haggège and M. Benrejeb|dc978411c84c6379d3dda852c000a464f53f034a\n2011|Control of brushless DC motor with an AVR microcontroller|10.1109/CECNET.2011.5768671|2|0|Xu Wuxiong|d4e8b67a578eb25b82a03d1fdb51dc73ce159a1c\n2013|Comparison of DC and MC/DC Code Coverages|10.15546/AEEI-2013-0050|2|0|Zalán Szűgyi and Zalán Porkoláb|62ec8cbcd5e43695e73aa238ce5f2dcb1d8d6d68\n2015|Design and PLC Implementation for Speed Control of DC Motor using Fuzzy Logic|10.22061/JECEI.2016.392|2|0|J. Monfared and M. Fazeli and Y. Lotfi|671b11a158a8a4e642e668891410d9a516a878e0\n2020|Application of DC motor as speed and direction control|10.5281/ZENODO.3713354|2|0|B. Mohapatra and R. Mohapatra|4f7751806dcc1b45ddd5df23dc0d03d7196f63ce\n1991|DC Resistivity Inversion Using General-purpose Optimisation Software|10.1071/EG991265|1|0|N. Merrick|d3608334e45e147d6a57bdb24a09a6236a0a2c56\n2015|A brushless DC motor speed control system based on DSP controller|10.1109/ICAMECHS.2015.7287163|1|0|Songming Cao and Yong Liu and Ming Hu and Xin Fu|e28056c26f1163659fba3fb15b27f2d47ad5a175\n2020|Kendali Kecepatan Motor DC Penguat Terpisah Berbeban Berbasis Arduino|10.24036/jtev.v6i2.108395|1|0|Dio Taufiq Arif and Aswardi Aswardi|5c56716c594dc0662b336ca54c34b733ece038bb\n2016|Real Time Speed Control of DC Motor by Programming the Fuzzy Controller in C Language|10.25130/tjes.23.3.10|1|0|Abdelelah K. M. and A. A. Abdul Fatah|b42d57a69acd0326e3f21b1d6ec0800886bbe059\n2014|DC Optimal Power Flow Formulation Using the Power Transmission Distribution Factors—A DIgSILENT Programming Language Application|10.1007/978-3-319-12958-7_5|1|0|Victor Hinojosa-Mateus and Leonardo Pérez-Andrades and J. Ilic|bd5623b333b6306c9b68fa7fc58a98f5a018c095\n2019|Sentence Compression via DC Programming Approach|10.1007/978-3-030-21803-4_35|1|0|Yi-Shuai Niu and Xiwei Hu and Yu You and Faouzi Mohamed Benammour and Hu Zhang|0bd97fdccad428dc2adc3ef35f9cf723aaa22113" }, "dcalgol": { "title": "Data Communications ALGOL", "appeared": 1970, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Burroughs_large_systems" ], "originCommunity": [ "Burroughs Corporation" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "example": [ "BEGIN\nARRAY DCREC [0:0];\nMESSAGE BUSTER;\nQUEUE PRIMARY;\nINTEGER I1;\nPOINTER P1;\n\nALLOCATE (BUSTER, 8);\nBUSTER [0] := 0;\nI1 := DCWRITE (BUSTER, PRIMARY); %Initialize Primary Queue\nALLOCATE (BUSTER, 9);\nBUSTER [0] := 0 & 4 [47:8] & 1 [31:1] & 1 [30:1] & 1 [29:1] \n& 1 [28:1] & 1 [27:1] & 1 [26:1] & 1 [25:1] & 472 [22:23];\nI1 := DCWRITE (BUSTER); %Station Inquiry\nRESIZE (DCREC, SIZE (BUSTER) + 10, DISCARD);\nREPLACE P1:DCREC [1] BY POINTER (BUSTER [1], 8) FOR (SIZE (BUSTER) - \n1) * 6;\nWHILE MYSELF.TASKVALUE = 0 DO\n DISPLAY (\"HELLO WORLD\"); %Duh\nEND." ], "hopl": "https://hopl.info/showlanguage.prx?exp=1958" }, "dcat": { "title": "Data Catalog Vocabulary", "appeared": 2014, "type": "schema", "website": "https://www.w3.org/TR/vocab-dcat-2/", "wikipedia": { "summary": "Data Catalog Vocabulary (DCAT) is an RDF vocabulary designed to facilitate interoperability between data catalogs published on the Web. By using DCAT to describe datasets in catalogs, publishers increase discoverability and enable applications to consume metadata from multiple catalogs. It enables decentralized publishing of catalogs and facilitates federated dataset search across catalogs. Aggregated DCAT metadata can serve as a manifest file to facilitate digital preservation.The original DCAT vocabulary was developed at DERI, further developed by W3C's eGov Interest Group, then brought onto the Recommendation Track by W3C's \"Government Linked Data\" Working Group. DCAT is the foundation for open dataset descriptions in the European Union public sector and was adapted by the ISA programme of the European Commission.As DCAT is extensible, more specific extensions have been created in the statistical and geodata domains.", "backlinksCount": 14, "pageId": 40011015, "dailyPageViews": 17, "url": "https://en.wikipedia.org/wiki/Data_Catalog_Vocabulary" } }, "dda": { "title": "DDA", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b04b06cb21e0ab8636d5fdcc3d7cd73f6905b8f2" ], "country": [ "United States" ], "originCommunity": [ "Bell Telephone Laboratories" ], "wikipedia": { "summary": "DDA may refer to: Dda (DNA-dependent ATPase), a DNA helicase Delhi Development Authority, the planning agency for Delhi, India Demand-driven acquisition, a model of library collection development Digital differential analyzer, a digital implementation of a differential analyzer Digital differential analyzer (graphics algorithm), a method of drawing lines on a computer screen Disability Discrimination Act 1992, Australian legislation Disability Discrimination Act 1995, UK legislation Discontinuous Deformation Analysis, an analysis procedure used in physics and engineering Discrete dipole approximation, method for computing scattering of radiation by particles of arbitrary shape Division on Dynamical Astronomy, a branch of the American Astronomical Society Doha Development Agenda of the World Trade Organization Dual Dynamic Acceleration, an Intel technology for increasing single-threaded performance on multi-core processors Dutch Dakota Association, a Dutch organisation dedicated to preserving and operating classic aircraft Dynamic difficulty adjustment or dynamic game difficulty balancing, a method of automatically adjusting video game difficulty based on player ability", "backlinksCount": 18, "pageId": 824995, "dailyPageViews": 56, "created": 2004, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/DDA" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4137", "centralPackageRepositoryCount": 0 }, "ddfcsv": { "title": "DDF", "appeared": 2016, "type": "dataNotation", "description": "DDF is a data model for collaborative harmonization of multidimensional statistics.", "reference": [ "https://open-numbers.github.io/ddf.html" ], "example": [ "ddf--datapoints--population--by--geo--year.csv\nddf--datapoints--gdp--gdp_per_cap--by--geo--year--gender.csv \nddf--datapoints--population--by--geo-usa-swe--year.csv \nddf--datapoints--population--by--geo--year-2000.csv \nddf--datapoints--population--by--geo-ukr--year-2001.csv" ] }, "ddfql": { "title": "ddfql", "appeared": 2016, "type": "queryLanguage", "reference": [ "https://docs.google.com/document/d/1olFm-XXjWxQ4LrTCfM42an6LbjbIgnt__V1DZxSmnuQ/edit#" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/open-numbers/" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "{\n \"select\": {\n \"key\": [\"geo\", \"year\"],\n \"value\": [\n \"population\", \"life_expectancy\", \"gdp_per_cap\", \"gov_type\"\n]\n },\n \"from\": \"datapoints\",\n \"where\": {\n \"$or\": [\n{ // implicit $and\n \"geo\": \"$geo\",\n \"year\": { \"$eq\": 2015 },\n },\n{ \"population\": { \"$gt\": 100000 } },\n{ \"gdp_per_cap\": { \"$gt\": 1000 } },\n{ \"$and\": [ // explicit $and\n{ \"$and\": [ { \"geo\": “$geo” } ], // redundant and\n{ \"gdp_per_cap\": { \"$gt\": 400, \"$lt\": 500 } },\n{ \"life_expectancy\": { \"$gt\": 30, \"$lt\": 70 } }\n]}\n]\n },\n \"order_by\": [\"life_expectancy\", \"population\"],\n \"join\": {\n \"$geo\": {\n key: \"geo\",\n where: {\n \"is--country\": true,\n \"latitude\": { \"$lte\": 0 }, \n }\n }\n },\n \"language\": \"en\"\n}" ] }, "ddml": { "title": "DDML", "appeared": 1999, "type": "xmlFormat", "standsFor": "Document Definition Markup Language", "country": [ "Various" ], "originCommunity": [ "http://www.xml.org/xml-dev/" ], "example": [ "\n\n\n\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n\n" ], "wikipedia": { "summary": "Document Definition Markup Language (DDML) is an XML schema language proposed in 1999 by various contributors from the xml-dev electronic mailing list. It was published only as a W3C Note, not a Recommendation, and never found favor with developers. DDML began as XSchema, a reformulation of XML DTDs as full XML documents, so that elements and attributes, rather than declarations, could be used to describe a schema. As development continued, the name was changed to DDML, reflecting a shift away from the goal of replicating all DTD functionality, in order to concentrate on providing a robust framework for describing basic element/attribute hierarchy. DDML offered no datatypes or functionality beyond what DTDs already provided, so there was not much advantage to using DDML instead of DTDs. DDML did, however, inform the development of the next generation of XML-based schema languages, including the more successful XML Schema and RELAX NG.", "backlinksCount": 6, "pageId": 2165201, "dailyPageViews": 5, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Document_Definition_Markup_Language" }, "isbndb": "" }, "de-bruijn-index-notation": { "title": "De Bruijn index", "appeared": 1972, "type": "notation", "creators": [ "Nicolaas Govert de Bruijn" ], "reference": [ "http://alexandria.tue.nl/repository/freearticles/597619.pdf" ], "country": [ "Netherlands" ], "originCommunity": [ "Technical University Eindhoven" ], "example": [ "λ λ λ 3 1 (2 1)" ], "wikipedia": { "summary": "In mathematical logic, the de Bruijn index is a tool invented by the Dutch mathematician Nicolaas Govert de Bruijn for representing terms of lambda calculus without naming the bound variables. Terms written using these indices are invariant with respect to α-conversion, so the check for α-equivalence is the same as that for syntactic equality. Each de Bruijn index is a natural number that represents an occurrence of a variable in a λ-term, and denotes the number of binders that are in scope between that occurrence and its corresponding binder. The following are some examples: The term λx. λy. x, sometimes called the K combinator, is written as λ λ 2 with De Bruijn indices. The binder for the occurrence x is the second λ in scope. The term λx. λy. λz. x z (y z) (the S combinator), with de Bruijn indices, is λ λ λ 3 1 (2 1). The term λz. (λy. y (λx. x)) (λx. z x) is λ (λ 1 (λ 1)) (λ 2 1). See the following illustration, where the binders are coloured and the references are shown with arrows. De Bruijn indices are commonly used in higher-order reasoning systems such as automated theorem provers and logic programming systems.", "backlinksCount": 34, "pageId": 10314482, "dailyPageViews": 46, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/De_Bruijn_index" } }, "deacon": { "title": "DEACON", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/96f1a64d58658ccf3a1f5125df0b9ff12ac9dc5f" ], "country": [ "United States" ], "originCommunity": [ "General Electric Company" ], "hopl": "https://hopl.info/showlanguage.prx?exp=395", "centralPackageRepositoryCount": 0 }, "deb": { "title": "Deb file format", "appeared": 2003, "type": "binaryDataFormat", "country": [ "United States" ], "originCommunity": [ "The Debian Project" ], "wikipedia": { "summary": "deb is the format, as well as extension of the software package format for the Linux distribution Debian and its derivatives.", "backlinksCount": 285, "pageId": 457906, "dailyPageViews": 149, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Deb_(file_format)" } }, "debl": { "title": "DEBL", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6155a509ed45841d2568e042ea74060e8d0495ef" ], "country": [ "United States" ], "originCommunity": [ "Kansas State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6859", "centralPackageRepositoryCount": 0, "isbndb": "" }, "debuma": { "title": "DeBuMa", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0cb2e8ab928524dc542610e0eb7cf008d8c0a7fd" ], "country": [ "France" ], "originCommunity": [ "Parc Scientifique Georges Besse II", "Electronique Serge Dassault ESD" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4565", "centralPackageRepositoryCount": 0 }, "dec64": { "title": "dec64", "appeared": 2009, "type": "numeralSystem", "website": "http://dec64.com/", "country": [ "United States" ], "originCommunity": [ "https://github.com/douglascrockford" ], "domainName": { "registered": 2009, "name": "dec64.com" } }, "decision-model-notation": { "title": "Decision Model & Notation", "appeared": 2015, "type": "notation", "description": "Decision Model and Notation (DMN) is an industry standard for modeling and executing decisions that are determined by business rules.", "aka": [ "DMN" ], "visualParadigm": true }, "declare": { "title": "DECLARE", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/020edfebcf2f3629af67aa517d48118377a40c4d" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3735", "wordRank": 9348, "centralPackageRepositoryCount": 0 }, "dedukti": { "title": "dedukti", "appeared": 2009, "type": "pl", "website": "https://deducteam.github.io", "country": [ "France" ], "originCommunity": [ "https://github.com/Deducteam" ], "domainName": { "name": "deducteam.github.io" }, "hasComments": { "example": "(; This is a comment ;)", "value": true }, "hasMultiLineComments": { "example": "(; A comment\n;)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "(;", ";)" ] ], "example": [ "Nat: Type.\nzero: Nat.\nsucc: Nat -> Nat.\ndef plus: Nat -> Nat -> Nat.\n[ n ] plus zero n --> n\n[ n ] plus n zero --> n\n[ n, m ] plus (succ n) m --> succ (plus n m)\n[ n, m ] plus n (succ m) --> succ (plus n m)." ], "githubRepo": { "firstCommit": 2009, "stars": 155, "forks": 18, "subscribers": 16, "created": 2017, "updated": 2022, "description": "Implementation of the λΠ-calculus modulo rewriting", "issues": 35, "url": "https://github.com/Deducteam/Dedukti" }, "repoStats": { "firstCommit": 2009, "commits": 2766, "committers": 58, "files": 575 } }, "deesel": { "title": "Deesel", "appeared": 2005, "type": "pl", "supersetOf": [ "java" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Deesel" }, "centralPackageRepositoryCount": 0 }, "definite-clause-grammar-notation": { "title": "Definite clause grammar", "appeared": 1980, "type": "grammarLanguage", "example": [ "sentence --> noun_phrase, verb_phrase.\nnoun_phrase --> det, noun.\nverb_phrase --> verb, noun_phrase.\ndet --> [the].\ndet --> [a].\nnoun --> [cat].\nnoun --> [bat].\nverb --> [eats]." ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Definite_clause_grammar" } }, "del": { "title": "DEL", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c43895c6149ec74ea83a97822c1f17127bfbd21f" ], "country": [ "United States" ], "originCommunity": [ "Stanford University", "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2356", "wordRank": 2117, "centralPackageRepositoryCount": 0 }, "delirium": { "title": "Delirium", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9f9e8c86c0f51436d2534d0160849e238ed3c7a9" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1618", "centralPackageRepositoryCount": 0, "isbndb": "" }, "delphi": { "title": "Delphi", "appeared": 1995, "type": "pl", "website": "https://www.embarcadero.com/products/delphi", "documentation": [ "https://ml4ai.github.io/delphi/" ], "reference": [ "http://delphi.wikia.com/wiki/Delphi_File_Extensions" ], "aka": [ "Embarcadero Delphi" ], "country": [ "United States" ], "originCommunity": [ "Idera, Inc." ], "releaseNotesUrl": "https://edn.embarcadero.com/article/40775", "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "{ A comment\n}", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "{", "}" ] ], "printToken": [ [ "WriteLn" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "procedure TForm1.ShowSomethingOnCreate;\nbegin\n Label1.Text := 'Hello World!';\nend;" ], "related": [ "object-pascal", "pascal", "ia-32", "ios", "android", "linux", "mercurial", "turbo-pascal", "x86-isa", "assembly-language", "java", "uml", "xml", "cil", "php", "visual-basic", "oxygene", "free-pascal" ], "summary": "Embarcadero Delphi is an integrated development environment (IDE) for desktop, mobile, web, and console applications. It's also an event driven language. Delphi's compilers use their own Object Pascal dialect of Pascal and generate native code for several platforms: Windows (x86 and x64), OS X (32-bit only), iOS (32 and 64-bit), Android and Linux (64-bit Intel). Delphi, part of RAD Studio, includes a code editor with Code Insight (code completion), Error Insight (real-time error-checking), and other features; refactoring; a visual forms designer for both VCL (native Windows) and FMX (cross-platform, partially native per platform); an integrated debugger for all platforms including mobile; source control (SVN, git, and Mercurial); and support for third-party plugins. It has strong database support. It is not unusual for a Delphi project of a million lines to compile in a few seconds – one benchmark gave 170,000 lines per second. It is under active development, with (in 2016) releases every six months, with new platforms being added approximately every second release. Delphi was originally developed by Borland as a rapid application development tool for Windows as the successor of Turbo Pascal. Delphi added full object-orientation to the existing language, and since then the language has grown and supports many other modern language features, including generics and anonymous methods, as well as unusual features such as inbuilt string types and native COM support. Delphi and its C++ counterpart, C++Builder, share many core components, notably the IDE, the Visual Component Library (VCL), and much of the RTL, and are compatible with each other: C++Builder 6 and onwards can consume Delphi-language files and C++ in the one project, and packages compiled with C++Builder written in C++ can be used from within Delphi. In 2007, the products were released jointly as RAD Studio. RAD Studio is a shared host for Delphi and C++Builder, and can be purchased with either or both. In 2006, Borland’s developer tools section was transferred from Borland to a wholly owned subsidiary known as CodeGear, which was sold to Embarcadero Technologies in 2008. In 2015, Embarcadero was purchased by Idera Software, but the Embarcadero mark was retained for the developer tools division.", "pageId": 349208, "dailyPageViews": 765, "created": 2018, "backlinksCount": 303, "revisionCount": 3, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Delphi_(programming_language)" }, "githubBigQuery": { "repos": 240, "users": 213, "id": "Delphi" }, "pygmentsHighlighter": { "filename": "pascal.py", "fileExtensions": [ "pas", "dpr" ], "id": "Delphi" }, "projectEuler": { "memberCount": { "2019": 482, "2022": 481 }, "id": "Delphi" }, "helloWorldCollection": [ "// Hello World in Delphi\nProgram Hello_World;\n\n{$APPTYPE CONSOLE}\n\nBegin\n WriteLn('Hello World');\nEnd.\n" ], "leachim6": { "filepath": "d/Delphi.pas", "fileExtensions": [ "pas" ], "example": [ "program HelloWorld;\n{$APPTYPE CONSOLE}\n\nbegin\n\tWriteLn('Hello World');\nend." ], "id": "Delphi" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Delphi", "indeedJobs": { "2017": 181, "query": "delphi engineer" }, "stackOverflowSurvey": { "2021": { "users": 1731, "medianSalary": 46704, "fans": 975, "percentageUsing": 0.02 } }, "officialBlogUrl": [ "https://blogs.embarcadero.com/" ], "eventsPageUrl": [ "https://www.embarcadero.com/events" ], "faqPageUrl": [ "https://www.embarcadero.com/products/delphi/faq" ], "downloadPageUrl": [ "https://www.embarcadero.com/products/delphi/starter/free-download" ], "subreddit": [ { "memberCount": { "2017": 1085, "2022": 3238 }, "url": "https://reddit.com/r/delphi" } ], "meetup": { "memberCount": 2368, "groupCount": 24, "url": "https://www.meetup.com/topics/delphi" }, "tiobe": { "currentRank": 9, "id": "Delphi/Object Pascal" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1963", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1995|Sams|Teach Yourself Database Programming With Delphi in 21 Days (Sams Teach Yourself)|Gurewich, Nathan and Gurewich, Ori|9780672308512\n1995|John Wiley & Sons Inc|Delphi Programming for Dummies|Rubenking, Neil J.|9781568842004\n1998|Sams Publishing|Sams Teach Yourself Delphi 4 in 21 Days|Reisdorph, Kent|9780672312861\n1997|Waite Group Pr|Delphi 3 Superbible|Brent, Gary and Bagdazian, Richard and Tendon, Steve|9781571690272\n2004|Oxford University Press|Introducing Delphi Programming: Theory through Practise|Barrow, John and Gelderblom, Helene and Miller, Linda|9780195781359\n2003|Red Globe Press|Mastering Delphi Programming (Macmillan Master Series)|Buchanan, William J|9780333918975\n1997||Programming in Delphi|Rick Kitto|9780968279045\n1996|Coriolis Group|KickAss Delphi Programming: Cutting-edge Delphi Programming with an Attitude|Taylor, Don and Mischel, Jim and Penman, John and Goggin, Terence|9781576100448\n1996|M & T Books|Programming Delphi Custom Components|Fred Bulback|9781558514577\n2001|Wordware Publishing, Inc.|Tomes of Delphi: Alogrithm and Data Structure (Wordware Delphi Developer's Library)|Bucknall, Julian|9781556227363\n2005|Jones & Bartlett Learning|INSIDE DELPHI 2006 (W/CD) (Wordware Delphi Developer's Library)|Ivan Hladni|9781598220032\n2014|Nepeta Enterprises|Coding in Delphi|Hodges, Nick|9781941266038\n1997|Coriolis Group|High Performance Delphi 3 Programming|Mischel, Jim and Penman, John and Goggin, Terence and Taylor, Don and Shemitz, Jon|9781576101797\n1995|Sams|Teach Yourself Borland Delphi in 21 Days (Sams Teach Yourself)|Wozniewicz, Andrew|9780672304705\n1999|Sams Publishing|Delphi 5 Developer's Guide (Developer's Guide)|Teixeira, Steve and Pacheco, Xavier|9780672317811\n2001|Wordware Publishing, Inc.|The Tomes of Delphi: Developer's Guide to Troubleshooting (Wordware Delphi Developer's Library)|Shannon, Clay|9781556228162\n1991|Tsinghua University|Delphi 6 Programming Guidance|Zhang Chun Lin Bian Zhu|9787302053880\n2000|Wordware Publishing, Inc.|Advanced Delphi Developer's Guide to Ado with CDR|Federov, Alex|9781556227585\n1997|John Wiley & Sons Inc|Delphi 3 for Dummies|Rubenking, Neil J.|9780764501791\n2000|China Press|Delphi Mode Programming (with Cd-rom)|Liu Yi|9787111149491\n1996|John Wiley & Sons Inc|Delphi 32-bit Programming Secrets (the Secrets Series)|Tom Swan and Jeff Cogswell|9781568846903\n1991|Unknown|21 Century College Computer Course Planning Materials: Delphi 2007 Programming Tutorial|Yang Sheng Quan ?liu Bai Lin|9787302219712\n1997|SIGS|Visual Object-Oriented Programming Using Delphi With CD-ROM (SIGS: Advances in Object Technology, Series Number 14)|Wiener, Richard and Wiatrowski, Claude A.|9780136186380\n2018|Packt Publishing|Delphi High Performance: Build fast Delphi applications using concurrency, parallel programming and memory management|Gabrijelcic, Primoz|9781788625456\n2018|Packt Publishing|Delphi Cookbook: Recipes to master Delphi for IoT integrations, cross-platform, mobile and server-side development, 3rd Edition|Spinetti, Daniele and Teti, Daniele|9781788623186\n2020-02-24T00:00:01Z|Dark Neon|The Little Book Of Delphi Programming: Learn To Program with Object Pascal|Collingbourne, Huw|9781913132095\n2020|Packt Publishing|Delphi GUI Programming with FireMonkey: Unleash the full potential of the FMX framework to build exciting cross-platform apps with Embarcadero Delphi|Magni, Andrea|9781788621236\n2019-11-26T00:00:01Z|Packt Publishing|Mastering Delphi Programming: A Complete Reference Guide: Learn all about building fast, scalable, and high performing applications with Delphi|Gabrijelčič, Primož|9781838989118\n1995|Sybex Inc|Mastering Delphi|Cantu, Marco|9780782117394\n2020-10-29T00:00:01Z|Packt Publishing|Delphi GUI Programming with FireMonkey: Unleash the full potential of the FMX framework to build exciting cross-platform apps with Embarcadero Delphi|Magni, Andrea|9781788624176\n2005|Sybex|Mastering Borland Delphi 2005|Marco Cantu'|9780782143423\n2021|Independently published|Object Pascal Handbook Delphi 10.4 Sydney Edition: The Complete Guide to the Object Pascal programming language for Delphi 10.4 Sydney|Cantu, Marco|9798554519963\n2019|Packt Publishing|Delphi Programming Projects: Build a range of exciting projects by exploring cross-platform development and microservices|Duarte, William|9781789135237\n2019|Packt Publishing|Mastering Delphi Programming: A Complete Reference Guide: Learn all about building fast, scalable, and high performing applications with Delphi|Gabrijelčič, Primož|9781838983918\n2019|Packt Publishing|Hands-On Design Patterns with Delphi: Build applications using idiomatic, extensible, and concurrent design patterns in Delphi|Gabrijelčič, Primož|9781789342437\n2019|Apress|Introducing Delphi ORM: Object Relational Mapping Using TMS Aurelius|Kouraklis, John|9781484250136\n2001|Addison Wesley|Programming and Problem Solving with Delphi|Kerman, Mitchell C.|9780201708448\n2003|Sybex|Mastering Delphi 7|Cant?, Marco and Cantù, Marco|9780782142013\n2000|O'Reilly Media|Delphi in a Nutshell: A Desktop Quick Reference (In a Nutshell (O'Reilly))|Lischner, Ray|9781565926592\n2019-05-03T00:00:01Z|Packt Publishing|Delphi Programming Projects: Build a range of exciting projects by exploring cross-platform development and microservices|Duarte, William|9781789130553\n2020|Apress|Delphi Quick Syntax Reference: A Pocket Guide to the Delphi and Object Pascal Language|Kouraklis, John|9781484261118\n2005|Oxford University Press|Introducing Delphi Programming: Theory through Practice|Barrow, John and Miller, Linda and Malan, Katherine and Gelderblom, Helene|9780195789119\n1995|Sams|Delphi Programming Unleashed/Book and Disk|Calvert, Charles|9780672304996\n1996|Hungry Minds Inc|Delphi Programming for Dummies|Rubenking, Neil J.|9781568846217\n1995|Waite Group Pr|Borland Delphi How-To: The Definitive Delphi Problem Solver|Frerking, Gary and Niddery, Wayne and Wallace, Nathan|9781571690197\n2001|Sybex|Mastering Delphi 6|Cant?, Marco|9780782128741\n2000|Macmillan Technical Publishing|Delphi COM Programming|Harmon, Eric|9781578702213\n2000|Wordware Publishing, Inc.|Learn Object Pascal with Delphi|Rachele, Warren|9781556227196\n1997|Sybex Inc|Mastering Delphi 3|Cantu, Marco|9780782120523\n1996|McGraw-Hill Osborne Media|Delphi in Depth|Anderson, Loy and Fung, Joseph and Lynnworth, Ann and Ostroff, Mark and Rudy, Martin and Vivrette, Robert and Jensen, Cary|9780078822117\n2000-02-07T00:00:01Z|Wordware Publishing, Inc.|Delphi Graphics And Game Programming Exposed! With DirectX|Ayres, John|9781556226373\n1997|Wordware|The Tomes of Delphi 3: Win32 Core Api|Diehl, Larry and Dorcas, Phil and Harrison, Kenneth and Mathes, Rod and Reza, Ovais and Tobin, Mike and Ayres, John|9781556225567\n2001|Wordware Publishing, Inc.|Tomes of KYLIX: The Linux API (Wordware Delphi Developer's Library)|Stephens, Glenn|9781556228230\n1996|John Wiley & Sons Inc|Delphi 2: A Developer's Guide|Kellen, Vince and Todd, Bill and Novak, Ray and Saenz, Brad|9781558514768\n1996|Sams|Teach Yourself Delphi 2 in 21 Days (Sams Teach Yourself)|Osier, Dan and Grobman, Steve and Batson, Steve|9780672308635\n1997|Que Pub|Special Edition Using Delphi 3 (Using ... (Que))|Miller, Todd and Powell, David and Bouchereau, Roland and Bucknall, Julian and Curtis, Bill and Frolich, Scott and Hecht, Joe C. and Krause, Chaim and Pritchard, Mark and Rice, Noel and Rider, J. W. and Sarafinchan, Quentin and Schafer, Stephen A. and Uber, Eric|9780789711182\n1997|Prentice Hall Ptr|Delphi 3: User Interface Design|Kovach, Warren and Dubois, Ludovic|9780136179603\n1995|Sams|Delphi Developer's Guide/Book and Cd-Rom (Sams Developer's Guide)|Pacheco, Xavier and Teixeira, Steve|9780672307041\n1996|Springer|Essential Delphi 2.0 Fast: How to Develop Applications in Delphi 2.0 (Essential Series)|Cowell, John|9783540760269\n2003-09-30T00:00:01Z|Anaya Multimedia-Anaya Interactiva|Delphi 7 y Kylix 3 / Delphi 7 and Kylix 3 (Programacion / Programming) (Spanish Edition)|Charte, Francisco|9788441515666\n2006||Mastering Delphi 7|Sybex|9788176567534\n2003|ANAYA MULTIMEDIA|Delphi 7 (Guías Prácticas) (Spanish Edition)|Charte, Francisco|9788441515543\n1995|Coriolis Group|Delphi Programming EXplorer: Master Cutting-Edge Visual Software Development for Windows|Duntemann, Jeff and Mischel, Jim and Taylor, Don|9781883577254\n2001|Optimax Pub|Web Programming With Delphi (delphi Programming)|Andrew J. Wozniewicz|9781931097178\n||Hello Delphi: An Introduction To Programming With Borland Delphi For Windows|Joy and Janet E.|9780964816022\n20030204|Springer Nature|Mastering Delphi Programming|William Buchanan|9781137173560\n2000|China Press|Delphi 7 Programming|Wang Chun Hong|9787810820547\n2010||Delphi Programming Language: Free Software Programmed In Delphi, Quake Army Knife, Ares Galaxy, Inno Setup, Dev-c]+, Openwire, Apophysis|Books Llc and Books and LLC|9781158022229\n30-06-2016|Packt Publishing|Delphi Cookbook|Daniele Teti|9781785280504\n1997|Wordware Publishing Inc.,u.s.|Microsoft Directx 2 Games Programming With Delphi (advanced Delphi Series)|David Bowden|9781556225574\n1996|Apress|Instant Delphi 32 Programming|Dave Jewell|9781874416838\n1996|John Wiley & Sons|Delphi Programming Problem Solver|Neil J. Rubenking|9781568847955\n1991|Mechanical Industry Press|Delphi Practical Programming Techniques|Zhu Bian Zhang Wei Dong|9787111178743\n20161026|Springer Nature|MVVM in Delphi|John Kouraklis|9781484222140\n26-02-2018|Packt Publishing|Delphi High Performance|Primoz Gabrijelcic|9781788621243\n2000|Tsinghua University Press. Beijing Jiaotong University Press|Delphi Database Programming(chinese Edition)|Hou Tai Ping Tong Ai Hong|9787810823289\n20200804|Springer Nature|Delphi Quick Syntax Reference|John Kouraklis|9781484261125\n20000316|O'Reilly Media, Inc.|Delphi in a Nutshell|Ray Lischner|9781449337315\n20000316|O'Reilly Media, Inc.|Delphi in a Nutshell|Ray Lischner|9781449369521\n2007|Machinery Industry Press|Delphi Programming Tutorial Examples(chinese Edition)|Sun An Yue|9787111207306\n1991|Unknown|Delphi 7 High-level Programming Paradigm|Long Qi Ming Liu Bin Deng Bian Zhu|9787302092582\n1996|Sams|Programming Internet Applications With Delphi 32|Sams Development Group|9781575210605\n2003|Charles River Media, Inc.|Delphi Programming With Com And Activex|Ponamarev, V.|9781584502548\n2003|Pearson Education|Programming And Problem Solving With Delphi|Mitchell C. Kerman|9780321204417\n1996|John Wiley & Sons Inc|Learn Delphi 2 Database Programming Today|Jeff Cogswell|9781568848358\n1995|John Wiley & Sons|Developing Windows Applications Using Delphi|Paul Penrod|9780471110170\n20061122|Springer Nature|.NET 2.0 for Delphi Programmers|Jon Shemitz|9781430201748\n2004|A-list|Advanced Delphi X Programming And Engineering|Peter Darakhvelidze and Evgeny Markov|9781931769280", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2016|Lessons Learned from Teaching Scratch as an Introduction to Object-oriented Programming in Delphi|10.1080/18117295.2016.1189215|6|0|Sukie van Zyl and E. Mentz and M. Havenga|f9a8b9efda4ed17f7540bbb926b9b97ef9d8d6be\n2014|Application of Case-based Teaching in Higher Vocational Computer CoursesA Case Study of Delphi Programming|10.2991/SCICT-14.2014.64|3|0|Guanqun Liu and Qiufen Yang and Rong Fan|355a997fe0a41d33880d49948719f481b0e636fa\n2011|Performance Comparison of Managed C# and Delphi Prism in Visual Studio and Unmanaged Delphi 2009 and C++ Builder 2009 Languages|10.5120/3070-4199|1|0|Abdulkadir Karacı|8443a676d13766bfde31808be4a689855d8e8a8d" }, "delta-prolog": { "title": "Delta Prolog", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5c88c036f4ffeb61968da0195021bc8f3fbdc9c0" ], "country": [ "Canada and Portugal" ], "originCommunity": [ "Institut national de la recherche scientifique", "Instituto Desenvolvimento de Novas Tecnologias" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4200", "centralPackageRepositoryCount": 0, "isbndb": "" }, "dem": { "title": "DEM", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d508974a9295a80d5459edc1cd929595e5e336e2" ], "country": [ "Japan" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4669", "wordRank": 8231, "centralPackageRepositoryCount": 0 }, "demeter": { "title": "DEMETER", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/10adc5d7b2d0930aaf506af64b370da9e68ac894" ], "country": [ "United States" ], "originCommunity": [ "Rutgers, The State University of New Jersey" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1965", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2004|Specifying the Law of Demeter and C++ programming guidelines with FCL|10.1109/SCAM.2004.22|6|0|Daqing Hou and H. Hoover and P. Rudnicki|9c82e406b6ce7331d4a3104842eee921323bd761" }, "demos": { "title": "DEMOS", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/47abc3f8f307569df6ae6b628e9934c99028c288" ], "country": [ "Canada" ], "originCommunity": [ "University of Calgary" ], "wikipedia": { "related": [ "unix", "freebsd", "ios", "linux", "android", "solaris" ], "summary": "DEMOS (Dialogovaya Edinaya Mobilnaya Operatsionnaya Sistema: Russian: Диалоговая Единая Мобильная Операционная Система, ДЕМОС, lit. 'Interactive Unified Portable Operating System') was a Unix-like operating system developed in the Soviet Union. It was derived from BSD.", "backlinksCount": 30, "pageId": 4336844, "dailyPageViews": 14, "created": 2006, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/DEMOS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6332", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "dendral": { "title": "Dendral", "appeared": 1965, "type": "application", "creators": [ " Edward Feigenbaum", "Bruce G. Buchanan", "Joshua Lederberg", "Carl Djerassi" ], "description": "Considered the first expert system because it automated the decision-making process and problem-solving behavior of organic chemists", "writtenIn": [ "lisp" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Dendral" } }, "deno": { "title": "Deno", "appeared": 2018, "type": "compiler", "creators": [ "Ryan Dahl" ], "website": "https://deno.land/", "documentation": [ "https://deno.land/manual@v1.27.1/introduction" ], "country": [ "United States" ], "originCommunity": [ "Deno Land Inc" ], "domainName": { "registered": 2018, "awisRank": { "2022": 71476 }, "name": "deno.land" }, "writtenIn": [ "rust" ], "related": [ "javascript", "typescript" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "console.log" ] ], "stringToken": [ [ "\"" ] ], "example": [ "// Imports `serve` from the remote Deno standard library, using URL.\nimport { serve } from \"https://deno.land/std@v0.21.0/http/server.ts\";\n\n// `serve` function returns an asynchronous iterator, yielding a stream of requests\nfor await (const req of serve({ port: 8000 })) {\n req.respond({ body: \"Hello, World!\\n\" });\n}" ], "gource": "https://www.youtube.com/watch?v=cV1CEnfKtdI", "githubRepo": { "firstCommit": 2018, "stars": 84234, "forks": 4546, "subscribers": 1540, "created": 2018, "updated": 2022, "description": "A modern runtime for JavaScript and TypeScript.", "issues": 924, "url": "https://github.com/denoland/deno" }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Deno_(software)" }, "leachim6": { "filepath": "d/Deno.ts", "fileExtensions": [ "ts" ], "example": [ "console.log(\"Hello World\");\n" ], "id": "Deno" }, "subreddit": [ { "memberCount": { "2022": 8226 }, "url": "https://reddit.com/r/Deno" } ], "twitter": "https://twitter.com/deno_land", "isbndb": "year|publisher|title|authors|isbn13\n2021|Packt Publishing|Deno Web Development: Write, test, maintain, and deploy JavaScript and TypeScript web applications using Deno|Santos, Alexandre Portela dos|9781800201149\n20200916|Springer Nature|Introducing Deno|Fernando Doglio|9781484261972", "semanticScholar": "" }, "dependent-ml": { "title": "DML", "appeared": 2005, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Boston University", "Carnegie Mellon University" ], "wikipedia": { "related": [ "ats" ], "summary": "Dependent ML is an experimental functional programming language proposed by Hongwei Xi (Xi 2007) and Frank Pfenning. Dependent ML extends ML by a restricted notion of dependent types: types may be dependent on static indices of type Nat (natural numbers). Dependent ML employs a constraint theorem prover to decide a strong equational theory over the index expressions. DML's types are not dependent on runtime values - there is still a phase distinction between compilation and execution of the program. By restricting the generality of full dependent types type checking remains decidable, but type inference becomes undecidable. Dependent ML has been superseded by ATS and is no longer under active development.", "created": 2005, "backlinksCount": 19, "pageId": 1951390, "revisionCount": 35, "dailyPageViews": 10, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Dependent_ML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1681", "centralPackageRepositoryCount": 0 }, "dern": { "title": "Dern", "appeared": 2008, "type": "pl", "description": "A platform independent programming language in standard C99. It is a dialect of Lisp with influences from Scheme, Emacs Lisp and C. Runs in Amiga, Haiku, Plan9, Unix, Windows and almost anything between.", "website": "https://octaspire.io/dern-manual.html", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/octaspire" ], "githubRepo": { "firstCommit": 2017, "stars": 23, "forks": 0, "subscribers": 1, "created": 2017, "updated": 2022, "description": "Programming language", "issues": 1, "url": "https://github.com/octaspire/dern" }, "repoStats": { "firstCommit": 2017, "commits": 870, "committers": 1, "files": 327 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n14073664|Show HN: Octaspire Dern – Programming language|2017-04-09 18:35:42 UTC|1491762942|octaspire|15|47", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "descartes": { "title": "Descartes", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b1e382625105bb88a32268134edbcf8d5ce5b217" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4354", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Model-Based Self-Aware Performance and Resource Management Using the Descartes Modeling Language|10.1109/TSE.2016.2613863|46|4|Nikolaus Huber and Fabian Brosig and Simon Spinner and Samuel Kounev and Manuel Bähr|8d5be262a6b469fa6ce94db09cbdabb5ecdce488\n1998|How to reconcile formal specifications and automatic programming: the Descartes system|10.1109/APSEC.1998.733579|3|0|J. Lucas and Jean-Luc Dormoy and Bruno Ginoux and Claudia Jimenez-Dominguez and Laurent Pierre|fc18bb3d1cdcfc05e4290c8b1de18b72bb90012f\n2016|Automatic parallel programming using the descartes specification language|10.1109/IACS.2016.7476068|1|0|N. Sakhnini and Venkata N. Inukollu and J. E. Urban|e23d50c20b37ef78b607d5a819d791627b0a621a" }, "descript": { "title": "Descript", "appeared": 2018, "type": "pl", "creators": [ "Jakob Hain" ], "website": "https://jakobeha.github.io/", "reference": [ "https://bitbucket.org/jakobeha/descript-ocaml/src/master/" ], "cheatSheetUrl": [ "https://bitbucket.org/jakobeha/descript-ocaml/src/master/docs/Summary.md" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "isOpenSource": true }, "descriptran": { "title": "DESCRIPTRAN", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1ebc80a4d292ec6971a98f1e1113b2a483cc5197" ], "country": [ "United States" ], "originCommunity": [ "Northwestern University", "Argonne National Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6610", "centralPackageRepositoryCount": 0 }, "desktop": { "title": "desktop", "appeared": 2008, "type": "application", "reference": [ "https://wiki.archlinux.org/index.php/desktop_entries#File_example" ], "country": [ "United States" ], "originCommunity": [ "Arch Linux" ], "example": [ "[Desktop Entry]\n\n# The type as listed above\nType=Application\n\n# The version of the desktop entry specification to which this file complies\nVersion=1.0\n\n# The name of the application\nName=jMemorize\n\n# A comment which can/will be used as a tooltip\nComment=Flash card based learning tool\n\n# The path to the folder in which the executable is run\nPath=/opt/jmemorise\n\n# The executable of the application, possibly with arguments.\nExec=jmemorize\n\n# The name of the icon that will be used to display this entry\nIcon=jmemorize\n\n# Describes whether this application needs to be run in a terminal or not\nTerminal=false\n\n# Describes the categories in which this entry should be shown\nCategories=Education;Languages;Java; " ], "githubLanguage": { "fileExtensions": [ "desktop", "desktopin", "service" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.desktop", "id": "desktop" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2014, "committerCount": 7, "commitCount": 27, "sampleCount": 1, "example": [ "# http://standards.freedesktop.org/desktop-entry-spec/latest/apa.html\n\n[Desktop Entry]\nVersion=1.0\nType=Application\nName=Foo Viewer\nComment=The best viewer for Foo objects available!\nTryExec=fooview\nExec=fooview %F\nIcon=fooview\nMimeType=image/x-foo;\nActions=Gallery;Create;\n\n[Desktop Action Gallery]\nExec=fooview --gallery\nName=Browse Gallery\n\n[Desktop Action Create]\nExec=fooview --create-new\nName=Create a new Foo!\nIcon=fooview-new" ], "url": "https://github.com/Mailaender/desktop.tmbundle.git" }, "fileType": "text", "wordRank": 1680, "centralPackageRepositoryCount": 0 }, "desmos": { "title": "Desmos", "appeared": 2011, "type": "pl", "creators": [ "Eli Luberoff" ], "website": "https://www.desmos.com/calculator", "country": [ "United States" ], "originCommunity": [ "Desmos Studio, PBC" ], "related": [ "latex" ], "visualParadigm": true, "assignmentToken": [ [ "=", "->" ] ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Desmos_(graphing)" }, "subreddit": [ { "memberCount": { "2022": 8897 }, "url": "https://reddit.com/r/desmos" } ] }, "detab-65": { "title": "DETAB/65", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e6a87f05bae73e2ecc09239311b8b79187a16074" ], "country": [ "United States" ], "originCommunity": [ "General Electric" ], "hopl": "https://hopl.info/showlanguage.prx?exp=197", "centralPackageRepositoryCount": 0 }, "detab-x": { "title": "DETAB-X", "appeared": 1960, "type": "pl", "description": "An Improved Business-Oriented Computer Language", "reference": [ "https://www.rand.org/content/dam/rand/pubs/research_memoranda/2007/RM3273.pdf" ], "country": [ "United States" ], "originCommunity": [ "RAND Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3038" }, "detap": { "title": "DETAP", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/35becaf9549c1a6bca62558a41ed3956dbe4bc66" ], "country": [ "United States" ], "originCommunity": [ "Harris Trust And Savings Bank" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4427", "centralPackageRepositoryCount": 0 }, "deva": { "title": "Deva", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/be06c92da85c747485a60a9cda9b2dd299b0612f" ], "country": [ "Germany" ], "originCommunity": [ "Berlin Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1723", "centralPackageRepositoryCount": 0 }, "devicetree": { "title": "Devicetree", "appeared": 2009, "type": "dataNotation", "website": "https://www.devicetree.org/", "country": [ "England" ], "originCommunity": [ "Linaro Limited" ], "domainName": { "registered": 2009, "awisRank": { "2022": 11082616 }, "name": "devicetree.org" }, "example": [ "soc {\n #address-cells = <1>;\n #size-cells = <1>;\n serial@4600 {\n compatible = \"ns16550\";\n reg = <0x4600 0x100>;\n clock-frequency = <0>;\n interrupts = <0xA 0x8>;\n interrupt-parent = <&ipic>;\n };" ], "pygmentsHighlighter": { "filename": "devicetree.py", "fileExtensions": [ "dts", "dtsi" ], "id": "Devicetree" } }, "devil": { "title": "DEVIL", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5eab2aa7f9c00db214e1335c2c19033dbf68f831" ], "country": [ "China" ], "originCommunity": [ "University of Electronic Science and Technology", "CoreTek Systems, Inc" ], "wikipedia": { "related": [ "opengl" ], "summary": "Developer's Image Library or DevIL started by Denton Woods, is a cross-platform image library which aims to provide a common API for different image file formats. It consists of three parts: the main library (IL), the utility library (ILU) and the utility toolkit (ILUT), mirroring the corresponding parts of OpenGL (although the OpenGL Utility Toolkit is not part of the OpenGL specification).It was originally called OpenIL; the name was changed at a request from Silicon Graphics, Inc.DevIL currently supports 43 file formats for reading and 17 for writing; among those with read-write support are BMP, DDS, JPEG, PCX, PNG, raw, TGA, and TIFF. The actual supported formats depend on compilation settings, in particular, external libraries like libjpeg and libpng.On June 9, 2010, Woods announced that he had submitted a request to change the licensing terms from the GNU LGPL to a BSD license. According to the website (as well as the source repository), DevIL is still licensed under the terms of the LGPL. DevIl is listed in the directory of the Free Software Foundation as Free Software.", "backlinksCount": 12, "pageId": 6578391, "dailyPageViews": 6, "created": 2006, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/DevIL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6202", "wordRank": 5117, "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2006|Exceptions and aspects: the devil is in the details|10.1145/1181775.1181794|156|10|F. C. Filho and N. Cacho and E. Figueiredo and R. Maranhão and Alessandro F. Garcia and C. M. F. Rubira|a93ab39d949957ae2632678a5f5ca48e64147f1a\n2001|Improving driver robustness: an evaluation of the Devil approach|10.1109/DSN.2001.941399|24|1|L. Réveillère and Gilles Muller|afca09994caae6a8f852bc4e28b6608c7651e740\n2001|Dealing with Hardware in Embedded Software: A General Framework Based on the Devil Language|10.1145/384197.384214|12|0|Fabrice Mérillon and Gilles Muller|7f5b0ad8eb2eb18f5be281b5597cd671cdb0b179" }, "dex": { "title": "dex", "appeared": 2018, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Google" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "example": [ ":p x = 1. -- let binding\n y = (z = 2.; z + 1.) -- let binding of a nested let expression\n .. -- escaped cosmetic line break\n x + y -- body of let expression" ], "githubRepo": { "firstCommit": 2018, "stars": 1232, "forks": 83, "subscribers": 53, "created": 2019, "updated": 2022, "description": "Research language for array processing in the Haskell/ML family", "issues": 152, "url": "https://github.com/google-research/dex-lang" }, "repoStats": { "firstCommit": 2018, "commits": 3922, "committers": 55, "files": 255 }, "isbndb": "" }, "dexterity": { "title": "Dexterity", "appeared": 1991, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Great Plains Software", "Microsoft" ], "wikipedia": { "dailyPageViews": 12, "url": "https://en.wikipedia.org/wiki/Dexterity_programming_language" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2022|Adaptive Motion Cueing Algorithm Based on Fuzzy Logic Using Online Dexterity and Direction Monitoring|10.1109/JSYST.2021.3059285|4|0|Mohammad Reza Chalak Qazani and Houshyar Asadi and M. Rostami and Shady M. K. Mohamed and C. Lim and S. Nahavandi|d3c58cb9e84450f0a017b604c736899598e26680" }, "dexvis": { "title": "dexvis", "appeared": 2012, "type": "application", "creators": [ "Patrick Martin" ], "description": "Dex : The Data Explorer -- A data visualization tool written in Java/Groovy/JavaFX capable of powerful ETL and publishing web visualizations.", "website": "http://dexvis.net/", "reference": [ "https://dexvis.wordpress.com/2012/11/19/261/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/PatMartin" ], "domainName": { "registered": 2016, "name": "dexvis.net" }, "githubRepo": { "firstCommit": 2016, "stars": 1281, "forks": 314, "subscribers": 127, "created": 2016, "updated": 2022, "description": "Dex : The Data Explorer -- A data visualization tool written in Java/Groovy/JavaFX capable of powerful ETL and publishing web visualizations.", "issues": 4, "url": "https://github.com/PatMartin/Dex" } }, "dfl": { "title": "DFL", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fed70fb81dbdd31cc9e896ee8380fce0dc51a344" ], "country": [ "United States" ], "originCommunity": [ "Indian Institute of Science", "State University of New York", "Case Western Reserve University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2826", "centralPackageRepositoryCount": 0 }, "dfns": { "title": "dfns", "appeared": 2014, "type": "pl", "description": "The dfns language is a functionally oriented, lexically scoped dialect of APL.", "website": "http://dfns.dyalog.com/", "reference": [ "http://dfns.dyalog.com/n_contents.htm" ], "country": [ "United Kingdom" ], "originCommunity": [ "Dyalog Ltd" ], "domainName": { "name": "dfns.dyalog.com" } }, "dgraph": { "title": "dgraph", "appeared": 2015, "type": "application", "website": "https://dgraph.io", "country": [ "United States" ], "originCommunity": [ "https://github.com/dgraph-io" ], "domainName": { "awisRank": { "2022": 224762 }, "name": "dgraph.io" }, "related": [ "graphql-plus-minus" ], "githubRepo": { "firstCommit": 2015, "stars": 18175, "forks": 1370, "subscribers": 376, "created": 2015, "updated": 2022, "description": "Native GraphQL Database with graph backend", "issues": 114, "url": "https://github.com/dgraph-io/dgraph" }, "twitter": "https://twitter.com/dgraphlabs" }, "dhall": { "title": "Dhall", "appeared": 2017, "type": "dataNotation", "website": "https://dhall-lang.org/", "webRepl": [ "https://dhall-lang.org/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/dhall-lang" ], "domainName": { "awisRank": { "2022": 4422660 }, "name": "dhall-lang.org" }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "example": [ "-- ./company.dhall\n\nlet Prelude =\n https://prelude.dhall-lang.org/v19.0.0/package.dhall sha256:eb693342eb769f782174157eba9b5924cf8ac6793897fc36a31ccbd6f56dafe2\n\nlet companyName = \"Example Dot Com\"\n\nlet User = { name : Text, account : Text, age : Natural }\n\nlet users\n : List User\n = [ { name = \"John Doe\", account = \"john\", age = 23 }\n , { name = \"Jane Smith\", account = \"jane\", age = 29 }\n , { name = \"William Allen\", account = \"bill\", age = 41 }\n ]\n\nlet toEmail = \\(user : User) -> \"${user.account}@example.com\"\n\nlet Bio = { name : Text, age : Natural }\n\nlet toBio = \\(user : User) -> user.(Bio)\n\nlet companySize = Prelude.List.length User users\n\nlet greetingPage =\n ''\n \n Welcome to ${companyName}!\n \n

Welcome to our humble company of ${Natural/show companySize} people!

\n \n \n ''\n\nin { emails = Prelude.List.map User Text toEmail users\n , bios = Prelude.List.map User Bio toBio users\n , greetingPage = greetingPage\n }" ], "githubRepo": { "firstCommit": 2017, "stars": 3577, "forks": 162, "subscribers": 67, "created": 2017, "updated": 2022, "description": "Maintainable configuration files", "issues": 127, "url": "https://github.com/dhall-lang/dhall-lang" }, "repoStats": { "firstCommit": 2017, "commits": 1062, "committers": 93, "files": 3696 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "dhall" ], "aceMode": "haskell", "codemirrorMode": "haskell", "codemirrorMimeType": "text/x-haskell", "tmScope": "source.haskell", "repos": 817, "id": "Dhall" }, "githubBigQuery": { "repos": 60, "users": 46, "id": "Dhall" }, "rijuRepl": { "example": [ "{ output = \"Hello, world!\" }" ], "id": "https://riju.codes/dhall" }, "twitter": "https://twitter.com/dhall_lang", "isbndb": "" }, "diagram": { "title": "DIAGRAM", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7b773624063af98bf0bfb75c705e489f736aa7f8" ], "country": [ "United States" ], "originCommunity": [ "SRI International" ], "wikipedia": { "related": [ "uml", "drakon", "ladder-logic" ], "summary": "A diagram is a symbolic representation of information according to some visualization technique. Diagrams have been used since ancient times, but became more prevalent during the Enlightenment. Sometimes, the technique uses a three-dimensional visualization which is then projected onto a two-dimensional surface. The word graph is sometimes used as a synonym for diagram.", "backlinksCount": 500, "pageId": 598669, "dailyPageViews": 981, "created": 2004, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Diagram" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7795", "wordRank": 6435, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2021|Books on Demand|PLC Controls with Ladder Diagram (LD): IEC 61131-3 and introduction to Ladder programming|Antonsen, Tom Mejer|9788743033349\n1999|Ec & M Books|Fundamentals Of Ladder Diagram Programming|Ryan G., Ph.d. Rosandich and Ryan G. Rosandich|9780872887190\n2021|Bod – Books On Demand|Plc Controls With Ladder Diagram (ld), Monochrome|Tom Mejer Antonsen|9788743033356\n||An Introduction to Programmable Controllers & Ladder Diagram Programming|Dingle and Brian|9780946796229", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1985|A State Transition Diagram Language for Visual Programming|10.1109/MC.1985.1662976|140|1|R. Jacob|0597b2d56f2d2b264a8115f1767dde8f31545fbd\n2016|Automatic builder of class diagram (ABCD): an application of UML generation from functional requirements|10.1002/spe.2384|37|1|W. Karaa and Zeineb Ben Azzouz and Aarti Singh and N. Dey and A. Ashour and H. Ghézala|27ebd755bf47e8c4ff91fc68a1097f5a91aa0f5f\n2002|Verification of a controller for a flexible manufacturing line written in Ladder Diagram via model-checking|10.1109/ACC.2002.1024580|32|2|O. D. Smet and O. Rossi|d46fc40c93c2541054306701fd0bcaa4e324e06a\n1999|Implementation of ladder diagram for programmable controller using FPGA|10.1109/ETFA.1999.813150|25|0|I. Miyazawa and T. Nagao and M. Fukagawa and Y. Itoh and T. Mizuya and T. Sekiguchi|adfdd754dd2ba7fcc9ae81553a3758ba7841c797\n2016|Source Code Metrics for Programmable Logic Controller (PLC) Ladder Diagram (LD) Visual Programming Language|10.1145/2897695.2897699|11|0|L. Kumar and R. Jetley and A. Sureka|618ca6fdf62b40cdf1a8e70b9bab213421c960a6\n2006|A Transformation Algorithm of Ladder Diagram into Instruction List Based on AOV Digraph and Binary Tree|10.1109/TENCON.2006.343937|10|0|Ge Fen and Wu Ning|d88b342910cb02b67cdabf8918764a36bb733758\n1988|Ladder diagram and sequential function chart languages in programmable controllers|10.1109/PROCCE.1988.82231|9|0|R. Wareham|a4e89354f1e2f110e3014c3801b09c3f4b2b8546\n2005|Green: a pedagogically customizable round-tripping UML class diagram Eclipse plug-in|10.1145/1117696.1117720|9|1|Carl Alphonce and Blake Martin|34a7f34606924e947e53109d0aa42247a3e14ed6\n2014|Formal design methodology for transforming ladder diagram to Petri nets|10.1007/S00170-014-5715-9|8|0|J. Quezada and J. Medina and E. Flores and J. C. Seck Tuoh and N. Hernández|3861de6cccf4fd00c5bd7f8474df96a857732b48\n1988|Block diagram compilation and graphical editing of DSP algorithms in the QuickSig system|10.1109/ISCAS.1988.15107|7|0|M. Karjalainen and S. Helle|120d842e3e1c1ee539165e0a5bac8db0226e2113\n2013|Parameterized activity cycle diagram and its application|10.1145/2501593|7|0|B. Choi and D. Kang and Taesik Lee and Arwa A. Jamjoom and M. Abulkhair|bac653da8443e29275243c70fc526611d747d8d6\n1976|A computer-aided flow diagram teaching system|10.1145/800107.803497|6|0|Elliot B. Koffman and F. Friedman|b241d680483cbbba1aacc6b95bc67c5e94be32b1\n1977|Correctness of Recursive Flow Diagram Programs|10.1007/3-540-08353-7_183|6|0|J. Goguen and J. Meseguer|2fa61c839e7a6fba1c2092d32c8c3261c4fcdd53\n1966|Digital computer simulation of sampled-data communication systems using the block diagram compiler: Blodib|10.1002/J.1538-7305.1966.TB04213.X|5|0|R. Golden|b3acd1db5d75f69cf5544e4e1757f47a9eb222d9\n2005|Recursive method to obtain the parametric representation of a generic Feynman diagram|10.1103/PhysRevD.72.106006|5|0|I. González and I. Schmidt|e6204b17fb27c322260911e179295df8b2d719c7\n1996|Network-based programming language education environment based on a modular program diagram|10.1109/MMEE.1996.570294|5|1|Y. Miyadera and A. Tsuchiya and T. Yaku and Hideaki Konya|864e0b1bcc98c314179b64ad1e9f884571c20ab3\n2015|Programming of sequential control systems using functional block diagram language|10.1016/J.IFACOL.2015.07.056|5|0|M. Wciślik and K. Suchenia and M. Łaskawski|908be54288c093123ec950ddbbc3f37cda568189\n2016|Bloqqi: modular feature-based block diagram programming|10.1145/2986012.2986026|5|0|Niklas Fors and G. Hedin|38ad8c8c4dcd8d1203bf02753cb038eac9b986d0\n2009|Using Sequence Diagram to Support Aspect-Oriented Programming in MDA|10.1109/IHMSC.2009.98|4|1|Jingjun Zhang and Yuejuan Chen and Guangyuan Liu and Hui Li|a6d4678a606c42094d227d1dda07f67c9087a7ec\n2020|HADDOCK: A Language and Architecture for Decision Diagram Compilation|10.1007/978-3-030-58475-7_31|4|0|R. Gentzel and L. Michel and W. V. Hoeve|31c67052f52b4e85c5c52fd38a7bb85e038449e8\n1982|Abstract Algorithms and Diagram Closure|10.1007/978-1-4613-8177-8_3|3|1|C. C. Elgot|65591e5ebe47d0d5ea8f5f783304342b8f49f636\n2013|Petri net versus Ladder Diagram for controlling a process automation|10.1109/ATEE.2013.6563402|3|0|V. Năvrăpescu and I. Deaconu and A. Chirilă and A. Deaconu|3ddb1c6ed599146723942d72b10dda2af14215d0\n2017|Improving Diagram Assessment in Mooshak|10.1007/978-3-319-97807-9_6|3|0|Helder Correia and J. P. Leal and J. C. Paiva|769884133350ca286897aa5b9eb4829e51f22958\n2003|Programming of Sequential System in Ladder Diagram Language|10.1016/S1474-6670(17)33711-4|3|0|Wcislik Miroslaw|fd76d4f102d4493d2a6fa6ba280d7c474020963e\n2014|Islay3D—A Programming Environment for Authoring Interactive 3D Animations in Terms of State-Transition Diagram|10.4236/JSEA.2014.73019|3|0|Dan Kwong and Michitoshi Niibori and S. Okamoto and M. Kamada and T. Yonekura|a348e2cef4b8748183735010093eedc9beadde22" }, "dialog": { "title": "DIALOG", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1118f15be453b020b5c64609fffbaef3f9f63f59" ], "country": [ "United States" ], "originCommunity": [ "Johns Hopkins University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=251", "wordRank": 6475, "centralPackageRepositoryCount": 0 }, "diamag": { "title": "DIAMAG", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/35d04f33d3fd8dfc66bf5a0e9ae545f94ee0a4a3" ], "country": [ "France" ], "originCommunity": [ "Institut de Mathématiques Appliquées" ], "hopl": "https://hopl.info/showlanguage.prx?exp=396", "centralPackageRepositoryCount": 0 }, "diana": { "title": "DIANA", "appeared": 1980, "type": "ir", "standsFor": "Descriptive Intermediate Attributed Notation for Ada", "country": [ "United States" ], "wikipedia": { "related": [ "ada", "pl-sql", "idl-sl" ], "summary": "DIANA, the Descriptive Intermediate Attributed Notation for Ada, is an intermediate language used to represent the semantics of an Ada program. It was originally designed as an interface between the front end (syntactic analysis) and middle (semantic analysis) of the compiler on the one hand and the back end (code generation and optimization) on the other. It is also used as an internal representation by other language tools. DIANA is also used by PL/SQL, which is based on Ada. DIANA is an abstract data type; its concrete implementations are defined using the IDL specification language. DIANA descends from TCOL and AIDA, earlier representations of Ada programs. The Ada-0 subset of Ada at Karlsruhe (1980) was first using AIDA, but later AIDA got replaced by DIANA. The full Karlsruhe Ada compilation system used DIANA as well and the IDL External Representation for marshalling between the middle-end and the code generating back-end.", "pageId": 15679342, "dailyPageViews": 3, "created": 2008, "backlinksCount": 9, "revisionCount": 25, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/DIANA_(intermediate_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=949", "fileType": "text", "wordRank": 8178, "centralPackageRepositoryCount": 0 }, "dibol": { "title": "Digital Interactive Business Oriented Language", "appeared": 1970, "type": "pl", "standsFor": "Digital Interactive Business Oriented Language", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "related": [ "basic", "fortran", "cobol" ], "summary": "DiBOL or Digital's Business Oriented Language is a general-purpose, procedural, imperative programming language, designed for use in Management Information Systems (MIS) software development. It has a syntax similar to FORTRAN and BASIC, along with BCD arithmetic. It shares the COBOL program structure of data and procedure divisions.", "pageId": 598142, "dailyPageViews": 13, "created": 2004, "backlinksCount": 22, "revisionCount": 74, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/DIBOL" }, "tiobe": { "id": "DiBOL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=503", "fileType": "text", "centralPackageRepositoryCount": 0 }, "dice": { "title": "DICE", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3f6f82075776ff6dc6b83a396300b229b1170fe2" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7212", "wordRank": 8892, "centralPackageRepositoryCount": 0 }, "diet": { "title": "DIET", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/467c6a614597f2e6d8b3f7b224401bfe95959780" ], "country": [ "Canada" ], "originCommunity": [ "University of Toronto", "Toronto General Hospital" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7390", "wordRank": 1839, "centralPackageRepositoryCount": 0 }, "diff": { "title": "Diff", "appeared": 1974, "type": "unixApplication", "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "related": [ "edscript", "patch", "context-diff", "unified-diff" ], "wikipedia": { "example": [ "--- /path/to/original\ttimestamp\n+++ /path/to/new\ttimestamp\n@@ -1,3 +1,9 @@\n+This is an important\n+notice! It should\n+therefore be located at\n+the beginning of this\n+document!\n+\n This part of the\n document has stayed the\n same from version to\n@@ -5,16 +11,10 @@\n be shown if it doesn't\n change. Otherwise, that\n would not be helping to\n-compress the size of the\n-changes.\n-\n-This paragraph contains\n-text that is outdated.\n-It will be deleted in the\n-near future.\n+compress anything.\n\n It is important to spell\n-check this dokument. On\n+check this document. On\n the other hand, a\n misspelled word isn't\n the end of the world.\n@@ -22,3 +22,7 @@\n this paragraph needs to\n be changed. Things can\n be added after it.\n+\n+This paragraph contains\n+important new additions\n+to this document." ], "related": [ "unix", "grep", "emacs-editor", "regex", "c", "bourne-shell", "fortran", "modula-2", "lisp", "isbn", "doi" ], "summary": "In computing, the diff utility is a data comparison tool that calculates and displays the differences between two files. Unlike edit distance notions used for other purposes, diff is line-oriented rather than character-oriented, but it is like Levenshtein distance in that it tries to determine the smallest set of deletions and insertions to create one file from the other. The diff command displays the changes made in a standard format, such that both humans and machines can understand the changes and apply them: given one file and the changes, the other file can be created. Typically, diff is used to show the changes between two versions of the same file. Modern implementations also support binary files. The output is called a \"diff\", or a patch, since the output can be applied with the Unix program patch. The output of similar file comparison utilities are also called a \"diff\"; like the use of the word \"grep\" for describing the act of searching, the word diff became a generic term for calculating data difference and the results thereof.", "pageId": 79673, "dailyPageViews": 223, "created": 2018, "backlinksCount": 257, "revisionCount": 1, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Diff_utility" }, "githubLanguage": { "fileExtensions": [ "diff", "patch" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "diff", "codemirrorMode": "diff", "codemirrorMimeType": "text/x-diff", "tmScope": "source.diff", "aliases": [ "udiff" ], "id": "Diff" }, "githubBigQuery": { "repos": 561, "users": 477, "id": "Diff" }, "codeMirror": "diff", "pygmentsHighlighter": { "filename": "diff.py", "fileExtensions": [ "diff", "patch" ], "id": "Diff" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2017, "committerCount": 10, "commitCount": 81, "sampleCount": 1, "example": [ "diff --git a/lib/linguist.rb b/lib/linguist.rb\nindex d472341..8ad9ffb 100644\n--- a/lib/linguist.rb\n+++ b/lib/linguist.rb\n" ], "url": "https://github.com/textmate/diff.tmbundle" }, "fileType": "text", "wordRank": 2959, "centralPackageRepositoryCount": 0 }, "differential-datalog": { "title": "Differential Datalog", "appeared": 2018, "type": "pl", "creators": [ "Leonid Ryzhyk" ], "description": "DDlog is a programming language for incremental computation. It is well suited for writing programs that continuously update their output in response to input changes. A DDlog programmer does not write incremental algorithms; instead they specify the desired input-output mapping in a declarative manner.", "documentation": [ "https://github.com/vmware/differential-datalog/blob/master/doc/tutorial/tutorial.md" ], "reference": [ "https://github.com/vmware/differential-datalog/blob/master/doc/language_reference/language_reference.md", "https://twitter.com/vmwopensource" ], "aka": [ "DDlog" ], "country": [ "United States" ], "originCommunity": [ "VMware, Inc" ], "versions": { "2021": [ "1.2.3" ] }, "writtenIn": [ "java", "c", "python" ], "githubRepo": { "firstCommit": 2018, "stars": 1186, "forks": 103, "subscribers": 23, "created": 2018, "updated": 2022, "description": "DDlog is a programming language for incremental computation. It is well suited for writing programs that continuously update their output in response to input changes. A DDlog programmer does not write incremental algorithms; instead they specify the desired input-output mapping in a declarative manner.", "issues": 131, "url": "https://github.com/vmware/differential-datalog" }, "repoStats": { "firstCommit": 2018, "commits": 2136, "committers": 44, "files": 1073 }, "isOpenSource": true }, "digital-command-language": { "title": "DIGITAL Command Language", "appeared": 1997, "type": "pl", "originCommunity": [ "Digital Equipment Corporation" ], "example": [ "$! Compiling with VAXC is said to work, but it requires the usual cruft\n$! (vaxcrtl and all), and to avoid hair we don't supply said cruft here.\n$ CC/DECC/PREFIX=all VMSBACKUP.C/DEFINE=(HAVE_MT_IOCTLS=0,HAVE_UNIXIO_H=1)\n$ CC/DECC/PREFIX=all DCLMAIN.C\n$! Probably we don't want match as it probably doesn't implement VMS-style\n$! matching, but I haven't looking into the issues yet.\n$ CC/DECC/PREFIX=all match\n$ LINK/exe=VMSBACKUP.EXE -\nvmsbackup.obj,dclmain.obj,match.obj,sys$input/opt\nidentification=\"VMSBACKUP4.1.1\"\n" ], "wikipedia": { "example": [ "$ i = 1\n$ variable'i' = \"blue\"\n$ i = 2 \n$ variable'i' = \"green\"\n$ j = 1\n$ color = variable'j'\n$ rainbow'color' = \"red\"\n$ color = variable'i'\n$ rainbow'color' = \"yellow\"" ], "related": [ "powershell", "fortran", "unix", "isbn" ], "summary": "DIGITAL Command Language (DCL) is the standard command language adopted by most of the operating systems (OSs) that were sold by the former Digital Equipment Corporation (which was acquired by Compaq, which was in turn acquired by Hewlett-Packard). DCL had its roots in the IAS, TOPS-20, and RT-11 OSs and was implemented as a standard across most of Digital's OSs, notably RSX-11, but took its most powerful form in the OpenVMS OS. Written when the programming language Fortran was in heavy use, DCL is a scripting language supporting several datatypes, including strings, integers, bit arrays, arrays and booleans, but not floating point numbers. Access to OpenVMS system services (kernel API) is through lexical functions, which perform the same as their compiled language counterparts and allow scripts to get information on system state. DCL includes IF-THEN-ELSE, access to all the Record Management Services (RMS) file types including stream, indexed, and sequential, but unfortunately lacks a DO-WHILE or other looping construct, requiring users to make do with IF and GOTO-label statements instead. DCL is available for other operating systems as well, including VCL and VX/DCL for Unix, VCL for Unix, MS-DOS, OS/2 and Windows, and PC-DCL and Accelr8 DCL Lite for Windows. DCL is the basis of the XLNT language, implemented on Windows by an interpreter-IDE-WSH engine combination with CGI capabilities distributed by Advanced System Concepts Inc. from 1997.", "pageId": 532369, "created": 2004, "backlinksCount": 65, "revisionCount": 103, "dailyPageViews": 39, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/DIGITAL_Command_Language" }, "githubLanguage": { "fileExtensions": [ "com" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "aliases": [ "dcl" ], "repos": 3602, "id": "DIGITAL Command Language" }, "githubBigQuery": { "repos": 3829, "users": 3459, "id": "DIGITAL Command Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "digraf": { "title": "DIGRAF", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6e03008fd772a8e717428cc96f9451daa26d513d" ], "country": [ "United States" ], "originCommunity": [ "University of Colorado" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7875", "centralPackageRepositoryCount": 0 }, "dinkc": { "title": "Dink Smallwood", "appeared": 1998, "type": "pl", "creators": [ "Seth Robinson" ], "country": [ "Japan" ], "originCommunity": [ "Robinson Technologies" ], "wikipedia": { "related": [ "linux", "android", "c" ], "summary": "Dink Smallwood is an action role-playing video game, developed by Robinson Technologies, at the time consisting of Seth Robinson, Justin Martin, and Greg Smith. It was first released in 1998 before being released as freeware on October 17, 1999. Mitch Brink composed several of the game's music tracks, while others are MIDI forms of classical music, such as Debussy's \"Reverie\". The game has a small but constant fan following that continues to develop add-ons for the game more than a decade after its release. The game is also notable for its humorous dialogue and surrealistic themes in various scenes between the gameplay.", "pageId": 1320860, "created": 2004, "backlinksCount": 35, "revisionCount": 261, "dailyPageViews": 42, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Dink_Smallwood" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "dinnerbell": { "title": "DinnerBell", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c4d4708cf45e4db1d3ab22406b2bf22ca5709bae" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1970", "centralPackageRepositoryCount": 0 }, "dino": { "title": "DINO", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b531d1cac6ef5d6f778524425c60378980eeef2b" ], "country": [ "United States" ], "originCommunity": [ "University of Colorado" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1162", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|The DINO Parallel Programming Language|10.1016/0743-7315(91)90107-K|127|4|M. Rosing and Bobby Schnabel and R. P. Weaver|a7cfd45541f035caf89c632ee7d9e060febb4221\n1990|The DINO User's Manual|10.21236/ada606429|2|0|T. Derby and E. Eskow and R. Neves and M. Rosing and R. Schnabel and R. P. Weaver|69a2741ed0f33042ed824f2434c43c48b421ca93" }, "dio": { "title": "dio", "appeared": 2020, "type": "pl", "website": "https://diolang.com/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/eiuadc/dio/" ], "domainName": { "registered": 2020, "name": "diolang.com" }, "example": [ "for v in [5, 8, 32, 9, 14]\n{\n //itoa is defined as itoa(u64 val) u8[23]\n puts(itoa(v))\n}" ] }, "dipe-r": { "title": "Dipe-R", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f23ad20f1838dbd960011ced50e996a71c837a7f" ], "country": [ "Netherlands" ], "originCommunity": [ "Maastricht University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7844", "centralPackageRepositoryCount": 0, "isbndb": "" }, "diplans": { "title": "Diplans", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5186688cf810b225600dccbf1a5704f3555728ae" ], "country": [ "United States" ], "originCommunity": [ "Coordination Technology, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7929", "centralPackageRepositoryCount": 0 }, "disc": { "title": "DISC", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1ac5efbf674df1a0068f66f056b08b1fe8a0e1ff" ], "country": [ "Italy" ], "originCommunity": [ "University of Naples Federico II" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7307", "wordRank": 2355, "centralPackageRepositoryCount": 0 }, "dispel": { "title": "DISPEL", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fed46d5459af5962e0320c7b62dbc0d3f0b2e29d" ], "country": [ "United States" ], "originCommunity": [ "Hewlett-Packard" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2817", "centralPackageRepositoryCount": 0, "isbndb": "" }, "displayport-standard": { "title": "DisplayPort", "appeared": 2006, "type": "standard", "originCommunity": [ "VESA" ], "wikipedia": { "dailyPageViews": 2950, "url": "https://en.wikipedia.org/wiki/DisplayPort" } }, "distributed-processes": { "title": "Distributed Processes", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4b328006a699106fa809cc610b799a2d03bc77a4" ], "country": [ "United States" ], "originCommunity": [ "University of Southern California" ], "hopl": "https://hopl.info/showlanguage.prx?exp=800", "centralPackageRepositoryCount": 0 }, "distributed-smalltalk": { "title": "Distributed Smalltalk", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7228e95d9491f32f6f9c182c3704bd823b2479ee" ], "hopl": "https://hopl.info/showlanguage.prx?exp=895", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ditran": { "title": "DITRAN", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ff13489135ed8163941bb2a3cd05a095daaf1d69" ], "country": [ "United States" ], "originCommunity": [ "University of Wiscon" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2759", "centralPackageRepositoryCount": 0 }, "ditroff-ffortid": { "title": "DITROFF/FFORTID", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1338c33cb63a6ad0800f8433b621e2b81d1c6bda" ], "country": [ "Israel" ], "originCommunity": [ "Israel Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5669", "centralPackageRepositoryCount": 0 }, "ditroff": { "title": "DITROFF", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e6144b0d28f0e491941b35a2a2f483703cc046ef" ], "country": [ "United States and Israel" ], "originCommunity": [ "University of California, Los Angeles", "Hebrew University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5644", "centralPackageRepositoryCount": 0 }, "dixy": { "title": "Dixy", "appeared": 2017, "type": "dataNotation", "githubRepo": { "stars": 27, "forks": 1, "subscribers": 3, "created": 2017, "updated": 2023, "description": "Data format based on dictionaries", "issues": 3, "url": "https://github.com/kuyawa/Dixy" }, "repoStats": { "firstCommit": 2017, "commits": 10, "committers": 1, "files": 12 } }, "django": { "title": "Django", "appeared": 2005, "type": "library", "country": [ "United States" ], "originCommunity": [ "Django Software Foundation" ], "wikipedia": { "related": [ "python", "regex", "html", "xml", "json", "nginx-config", "postgresql", "mysql", "sqlite", "mongodb", "jython", "ruby", "perl", "php", "erlang", "isbn" ], "summary": "Django ( JANG-goh) is a free and open-source web framework, written in Python, which follows the model-view-template (MVT) architectural pattern. It is maintained by the Django Software Foundation (DSF), an independent organization established as a 501(c)(3) non-profit. Django's primary goal is to ease the creation of complex, database-driven websites. Django emphasizes reusability and \"pluggability\" of components, rapid development, and the principle of don't repeat yourself. Python is used throughout, even for settings files and data models. Django also provides an optional administrative create, read, update and delete interface that is generated dynamically through introspection and configured via admin models. Some well-known sites that use Django include the Public Broadcasting Service, Instagram, Mozilla, The Washington Times, Disqus, Bitbucket, and Nextdoor. It was used on Pinterest, but later the site moved to a framework built over Flask.", "pageId": 2247376, "dailyPageViews": 821, "created": 2005, "backlinksCount": 449, "revisionCount": 1048, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Django_(web_framework)" }, "codeMirror": "django", "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2014, "committerCount": 6, "commitCount": 40, "url": "https://github.com/textmate/python-django.tmbundle" }, "leachim6": { "filepath": "d/Django.py", "fileExtensions": [ "py" ], "example": [ "from django.http import HttpResponse\n\ndef index(request):\n return HttpResponse(\"Hello World\")" ], "id": "Django" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "djangoql": { "title": "djangoql", "appeared": 2017, "type": "pl", "creators": [ "Denis Stebunov" ], "country": [ "Russia and Ukraine amd Lithuania and Serbia" ], "originCommunity": [ "https://github.com/ivelum" ], "githubRepo": { "firstCommit": 2017, "stars": 763, "forks": 81, "subscribers": 45, "created": 2017, "updated": 2022, "description": "Advanced search language for Django", "issues": 21, "url": "https://github.com/ivelum/djangoql" }, "repoStats": { "firstCommit": 2017, "commits": 327, "committers": 27, "files": 65 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n14050326|Show HN: DjangoQL – Advanced search language for Django|2017-04-06 13:35:01 UTC|1491485701|stebunovd|0|8" }, "djot": { "title": "Djot", "appeared": 2022, "type": "textMarkup", "creators": [ "John MacFarlane" ], "description": " A light markup language", "website": "https://djot.net", "webRepl": [ "https://djot.net/playground/" ], "documentation": [ "https://github.com/jgm/djot/blob/main/README.md" ], "reference": [ "https://htmlpreview.github.io/?https://github.com/jgm/djot/blob/master/doc/syntax.html" ], "fileExtensions": [ "dj" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/jgm/djot/issues" ], "domainName": { "name": "djot.net" }, "usesSemanticVersioning": true, "versions": { "2022": [ "0.2.0" ] }, "writtenIn": [ "lua" ], "influencedBy": [ "commonmark" ], "successorOf": [ "commonmark" ], "multiLineCommentTokens": [ [ "{%", "%}" ] ], "example": [ "_italic_\n*bold*\n`code`\nH~2~O\n20^th^\n{=highlighted=}\n{+underlined+}\n{-strikethrough-}\n$`p = mv`\n\n$$`E = K + U`\n\nStart a new paragraph with a blank line.\n\n> A blockquote\n\n{% look like this\nand can span multiple lines %}\n\n# Horizontal lines:\n***\n---\n\nVerbatim blocks:\n\n```\n$ tree\n.\n├── aa\n│ └── foo.txt\n├── bb\n│ └── bar.txt\n└── c.png\n```\n\n```myLang\nfunc say-hello(nm) {\n print(\"hello ${nm}!\");\n}\n```\n\nLinks:\n\n[read more](https://example.com)\n[read this too][foo bar]\n[one more link][]\n\n\n![beautiful skyline](clouds.jpg)\n![coastal shores][shore]\n![lush forests][]\n\n[shore]: the-beach.jpg\n[lush forests]: pines.jpg\n\n# Tables\n\n| Name | Size | Color |\n| --- | --- | --- |\n| lime | small | green |\n| orange | medium | orange |\n| grapefruit | large | yellow or pink |" ], "githubRepo": { "firstCommit": 2022, "stars": 773, "forks": 25, "subscribers": 20, "created": 2022, "updated": 2022, "description": "A light markup language", "issues": 58, "url": "https://github.com/jgm/djot" }, "repoStats": { "firstCommit": 2022, "commits": 470, "committers": 19, "files": 16 }, "isOpenSource": true }, "dkim-standard": { "title": "DomainKeys Identified Mail", "appeared": 2004, "type": "standard", "website": "https://mipassoc.org/", "reference": [ "https://www.rfc-editor.org/info/rfc6376" ], "country": [ "United States" ], "originCommunity": [ "Mutual Internet Practices Association" ], "domainName": { "name": "mipassoc.org" }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/DomainKeys_Identified_Mail" } }, "dllup": { "title": "dllup", "appeared": 2015, "type": "textMarkup", "creators": [ "Daniel Lawrence Lu" ], "website": "http://www.dllu.net/programming/dllup/", "country": [ "United States" ], "originCommunity": [ "https://github.com/dllu" ], "domainName": { "name": "dllu.net" }, "example": [ "===\n\n# Introduction\n\n**dllup** is a lightweight markup language..." ], "githubRepo": { "firstCommit": 2015, "stars": 6, "forks": 1, "subscribers": 1, "created": 2021, "updated": 2022, "description": "my markup language", "issues": 0, "url": "https://github.com/dllu/dllup" }, "repoStats": { "firstCommit": 2015, "commits": 12, "committers": 4, "files": 17 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9196157|Show HN: Dllup markup language – Lightweight markup for mathy blogs|2015-03-13 08:40:22 UTC|1426236022|dllu|1|2" }, "dlp": { "title": "DLP", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/94a4c1af2a17e7d0ef65683b541e9ef8ae3d6a51" ], "country": [ "United States" ], "originCommunity": [ "Brandeis University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1680", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20110628|Springer Nature|DLP and Extensions|John L. Nazareth|9783642567612\n2001|Springer|Dlp And Extensions: An Optimization Model And Decision Support System|John L. Nazareth|9783540411147\n1992|Wiley|Dlp - A Language For Distributed Logic Programming: Design, Semantics And Implementation (wiley Series In Parallel Computing)|Anton Eli?ns|9780471931171" }, "dlvm": { "title": "dlvm", "appeared": 2017, "type": "ir", "creators": [ "Chris Lattner" ], "description": "Modern Compiler Infrastructure for Deep Learning Systems", "website": "http://dlvm.org/", "reference": [ "https://dlvm-team.github.io/" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana-Champaign", "Purdue University" ], "domainName": { "registered": 2022, "awisRank": { "2017": 17839534 }, "name": "dlvm.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// Dimension-erased functions are flexible because input shapes are dynamic.\n// They may be slower and less optimized than their shape-specialized counterparts.\n\n// f(x, w, b) = dot(x, w) + pad(b, at: 0)\nfunc @f: (<_ x _ x f32>, <_ x _ x f32>, <_ x f32>) -> <_ x _ x f32> {\n'entry(%x: <_ x _ x f32>, %w: <_ x _ x f32>, %b: <_ x f32>):\n %0.0 = dot %x: <_ x _ x f32>, %w: <_ x _ x f32>\n %0.1 = padShape %b: <_ x f32> at 0\n %0.2 = add %0.0: <_ x _ x f32>, %0.1: <1 x _ x f32>\n return %0.2: <_ x _ x f32>\n}" ], "githubRepo": { "firstCommit": 2010, "stars": 0, "forks": 0, "subscribers": 2, "created": 2017, "updated": 2017, "description": "The Swift Programming Language", "issues": 0, "url": "https://github.com/dlvm-team/swift" }, "repoStats": { "firstCommit": 2010, "commits": 67857, "committers": 769, "files": 14310 }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "dm-1": { "title": "DM-1", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/03ea9c17f5f1d9952f9529914222eb6d82a4b3bd" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5333", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "dm": { "title": "DM", "appeared": 1994, "type": "pl", "description": "DM is a programming language for the creation of multi-user worlds. By `world' I mean a virtual multi-media environment where people assume personae through which they interact with one another and computer-controlled objects. This could take the form of a competitive game, a role-playing adventure, a discussion board, or something we haven't even imagined.", "website": "http://www.byond.com/docs/guide/", "reference": [ "http://www.byond.com/developer" ], "fileExtensions": [ "dm", "dmf" ], "country": [ "Unknown" ], "originCommunity": [ "BYOND Software" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "mob\n verb\n smile()\n world << \"[usr] grins.\"\n giggle()\n world << \"[usr] giggles.\"\n cry()\n world << \"[usr] cries \\his heart out.\"" ], "githubLanguage": { "fileExtensions": [ "dm" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "c_cpp", "tmScope": "source.dm", "aliases": [ "byond" ], "repos": 2108, "id": "DM" }, "githubBigQuery": { "repos": 394, "users": 338, "id": "DM" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2016, "committerCount": 1, "commitCount": 24, "sampleCount": 1, "example": [ "// This is a single line comment.\n/*\n\tThis is a multi-line comment\n*/\n\n// Pre-processor keywords\n\n#define PI 3.1415\n\n#if PI == 4\n\n#define G 5\n\n#elif PI == 3\n\n#define I 6\n\n#else\n\n#define K 7\n\n#endif\n\n\nvar/GlobalCounter = 0\nvar/const/CONST_VARIABLE = 2\nvar/list/MyList = list(\"anything\", 1, new /datum/entity)\nvar/list/EmptyList[99] // creates a list of 99 null entries\nvar/list/NullList = null\n\n/*\n\tEntity Class\n*/\n\n/datum/entity\n\tvar/name = \"Entity\"\n\tvar/number = 0\n\n/datum/entity/proc/myFunction()\n\tworld.log << \"Entity has called myFunction\"\n\n/datum/entity/New()\n\tnumber = GlobalCounter++\n\n/*\n\tUnit Class, Extends from Entity\n*/\n\n/datum/entity/unit\n\tname = \"Unit\"\n\n/datum/entity/unit/New()\n\t..() // calls the parent's proc; equal to super() and base() in other languages\n\tnumber = rand(1, 99)\n\n/datum/entity/unit/myFunction()\n\tworld.log << \"Unit has overriden and called myFunction\"\n\n// Global Function\n/proc/ReverseList(var/list/input)\n\tvar/list/output = list()\n\tfor(var/i = input.len; i >= 1; i--) // IMPORTANT: List Arrays count from 1.\n\t\toutput += input[i] // \"+= x\" is \".Add(x)\"\n\treturn output\n\n// Bitflags\n/proc/DoStuff()\n\tvar/bitflag = 0\n\tbitflag |= 8\n\treturn bitflag\n\n/proc/DoOtherStuff()\n\tvar/bitflag = 65535 // 16 bits is the maximum amount\n\tbitflag &= ~8\n\treturn bitflag\n\n// Logic\n/proc/DoNothing()\n\tvar/pi = PI\n\tif(pi == 4)\n\t\tworld.log << \"PI is 4\"\n\telse if(pi == CONST_VARIABLE)\n\t\tworld.log << \"PI is [CONST_VARIABLE]!\"\n\telse\n\t\tworld.log << \"PI is approximety [pi]\"\n\n#undef PI // Undefine PI" ], "url": "https://github.com/PJB3005/atomic-dreams" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:DM", "fileType": "text", "wordRank": 7101, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2009|Apress|Pro SpringSource dm Server (Expert's Voice in Open Source)|Mak, Gary and Rubio, Daniel|9781430216407" }, "dmap": { "title": "DMAP", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/64d26992737da7d0f2364a30843a2227b04b5d07" ], "country": [ "United States" ], "originCommunity": [ "PRC Information Sciences Company" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1619", "centralPackageRepositoryCount": 0 }, "dml": { "title": "DML", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/112d5503d113d43d2d0ae99e3b7996d7a1fd7a02" ], "country": [ "Sweden" ], "originCommunity": [ "Linköping University" ], "wikipedia": { "summary": "DML may refer to: Demonstrated Master Logistician, a certification bestowed by the International Society of Logistics (SOLE) Data manipulation language, a family of computer languages used by computer programs or database users to retrieve, insert, delete and update data in a database Dimensional Markup language, is an XML format definition tailored to the needs of dimensional results for discrete manufacturing Devonport Management Limited, owner of Her Majesty's Naval Base Devonport Dragon Models Limited, a Hong Kong-based company that manufactures plastic model assembly kits Dennis Miller Live, an HBO television talk-comedy show with Dennis Miller Distributed mode loudspeaker, a speaker technology developed by Cambridge-based company called NXT Definitive Media Library, in ITIL Service Transition Doctor of Modern Languages, an academic degree focusing on multiple modern languages and cultures", "backlinksCount": 14, "pageId": 898565, "dailyPageViews": 18, "created": 2004, "url": "https://en.wikipedia.org/wiki/DML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1681", "centralPackageRepositoryCount": 0 }, "dna": { "title": "DNA", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c2aae6c6547b40d4099b7b015ad2bee84bc99858" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6682", "wordRank": 2958, "centralPackageRepositoryCount": 0 }, "dns": { "title": "DNS", "appeared": 1985, "type": "protocol", "creators": [ "Paul Mockapetris" ], "standsFor": "Domain Name System", "country": [ "United States" ], "originCommunity": [ "Stanford Research Institute" ], "wikipedia": { "summary": "The Domain Name System (DNS) is a hierarchical and decentralized naming system for computers, services, or other resources connected to the Internet or a private network. It associates various information with domain names assigned to each of the participating entities. Most prominently, it translates more readily memorized domain names to the numerical IP addresses needed for locating and identifying computer services and devices with the underlying network protocols. By providing a worldwide, distributed directory service, the Domain Name System has been an essential component of the functionality of the Internet since 1985. The Domain Name System delegates the responsibility of assigning domain names and mapping those names to Internet resources by designating authoritative name servers for each domain. Network administrators may delegate authority over sub-domains of their allocated name space to other name servers. This mechanism provides distributed and fault-tolerant service and was designed to avoid a single large central database. The Domain Name System also specifies the technical functionality of the database service that is at its core. It defines the DNS protocol, a detailed specification of the data structures and data communication exchanges used in the DNS, as part of the Internet Protocol Suite. The Internet maintains two principal namespaces, the domain name hierarchy and the Internet Protocol (IP) address spaces. The Domain Name System maintains the domain name hierarchy and provides translation services between it and the address spaces. Internet name servers and a communication protocol implement the Domain Name System. A DNS name server is a server that stores the DNS records for a domain; a DNS name server responds with answers to queries against its database. The most common types of records stored in the DNS database are for Start of Authority (SOA), IP addresses (A and AAAA), SMTP mail exchangers (MX), name servers (NS), pointers for reverse DNS lookups (PTR), and domain name aliases (CNAME). Although not intended to be a general purpose database, DNS has been expanded over time to store records for other types of data for either automatic lookups, such as DNSSEC records, or for human queries such as responsible person (RP) records. As a general purpose database, the DNS has also been used in combating unsolicited email (spam) by storing a real-time blackhole list (RBL). The DNS database is traditionally stored in a structured text file, the zone file, but other database systems are common.", "backlinksCount": 1658, "pageId": 8339, "dailyPageViews": 3154, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Domain_Name_System" }, "isbndb": "year|publisher|title|authors|isbn13\n1998|O'Reilly & Associates|DNS and BIND|Paul Albitz and Cricket Liu|9781565925120\n1996|O'Reilly Media|DNS and BIND (A Nutshell Handbook)|Albitz, Paul and Liu, Cricket|9781565922365\n2006|O'Reilly Media|DNS and BIND (5th Edition)|Liu, Cricket and Albitz, Paul|9780596100575\n1994|Oreilly & Associates Inc|DNS and BIND|Allen, Paul; Liu, Cricket|9781565920101\n20060526|O'Reilly Media, Inc.|DNS and BIND|Cricket Liu; Paul Albitz|9780596553401\n20060526|O'Reilly Media, Inc.|DNS and BIND|Cricket Liu; Paul Albitz|9780596550004", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2016|DNS Protection against Spoofing and Poisoning Attacks|10.1109/ICISCE.2016.279|11|0|M. Hussain and Hai Jin and Z. Hussien and Z. Abduljabbar and Salah H. Abbdal and Ayad Ibrahim|6e8aca84ef8ab5cc2d681b68ae5d2831fd7928ab\n2017|Enc-DNS-HTTP: Utilising DNS Infrastructure to Secure Web Browsing|10.1155/2017/9479476|6|0|M. Hussain and Hai Jin and Z. Hussien and Z. Abduljabbar and Salah H. Abbdal and Ayad Ibrahim|34db0be8a10576ba43ca998d82003358a1e13ff7" }, "docker": { "title": "Docker", "appeared": 2013, "type": "application", "website": "http://docker.io", "country": [ "United States" ], "originCommunity": [ "Docker, Inc." ], "domainName": { "registered": 2012, "awisRank": { "2022": 346011 }, "name": "docker.io" }, "related": [ "dockerfile" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Docker_(software)" }, "subreddit": [ { "url": "https://www.reddit.com/r/docker/" } ], "twitter": "https://twitter.com/docker" }, "dockerfile": { "title": "Dockerfile", "appeared": 2013, "type": "pl", "website": "https://docs.docker.com/engine/reference/builder/", "country": [ "United States" ], "originCommunity": [ "Docker, Inc." ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "githubLanguage": { "fileExtensions": [ "dockerfile" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nkelseyhightower nocode https://github.com/kelseyhightower.png https://github.com/kelseyhightower/nocode Dockerfile #384d54 30957 2658 905 \"The best way to write secure and reliable applications. Write nothing; deploy nowhere.\"\nlaradock laradock https://github.com/laradock.png https://github.com/laradock/laradock Dockerfile #384d54 8174 2745 183 \"PHP development environment that runs on Docker.\"\ndotnet dotnet-docker https://github.com/dotnet.png https://github.com/dotnet/dotnet-docker Dockerfile #384d54 1800 703 73 \"Docker images for .NET Core and the .NET Core Tools.\"\nmicrosoft vscode-dev-containers https://github.com/microsoft.png https://github.com/microsoft/vscode-dev-containers Dockerfile #384d54 247 65 56 \"A repository of development container definitions for the VS Code Remote - Containers extension\"\nnodejs docker-node https://github.com/nodejs.png https://github.com/nodejs/docker-node Dockerfile #384d54 4780 1071 106 \"Official Docker Image for Node.js 🐳 🐢 🚀\"\nmicrosoft mssql-docker https://github.com/microsoft.png https://github.com/microsoft/mssql-docker Dockerfile #384d54 800 377 24 \"Official Microsoft repository for SQL Server in Docker resources\"\njessfraz dockerfiles https://github.com/jessfraz.png https://github.com/jessfraz/dockerfiles Dockerfile #384d54 8891 1560 145 \"Various Dockerfiles I use on the desktop and on servers.\"\nGoogleCloudPlatform cloud-builders-community https://github.com/GoogleCloudPlatform.png https://github.com/GoogleCloudPlatform/cloud-builders-community Dockerfile #384d54 458 303 28 \"Community-contributed images for Google Cloud Build\"\nnginxinc docker-nginx https://github.com/nginxinc.png https://github.com/nginxinc/docker-nginx Dockerfile #384d54 1585 891 35 \"Official NGINX Dockerfiles\"\namancevice docker-superset https://github.com/amancevice.png https://github.com/amancevice/docker-superset Dockerfile #384d54 537 297 26 \"Docker image for AirBnB's Superset\"\ncnych kubernetes-learning https://github.com/cnych.png https://github.com/cnych/kubernetes-learning Dockerfile #384d54 400 151 59 《从Docker到Kubernetes进阶课程》在线文档\nnicolaka netshoot https://github.com/nicolaka.png https://github.com/nicolaka/netshoot Dockerfile #384d54 1168 173 69 \"a Docker + Kubernetes network trouble-shooting swiss-army container\"", "trendingProjectsCount": 13, "type": "programming", "filenames": [ "Containerfile", "Dockerfile" ], "aceMode": "dockerfile", "codemirrorMode": "dockerfile", "codemirrorMimeType": "text/x-dockerfile", "tmScope": "source.dockerfile", "aliases": [ "Containerfile" ], "repos": 339978, "id": "Dockerfile" }, "githubBigQuery": { "repos": 26335, "users": 19957, "id": "Dockerfile" }, "monaco": "dockerfile", "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2017, "committerCount": 11, "commitCount": 52, "sampleCount": 1, "example": [ "# This file describes the standard way to build Docker, using docker\ndocker-version 0.4.2\nfrom\tubuntu:12.04\nmaintainer\tSolomon Hykes \n# Build dependencies\nrun\tapt-get install -y -q curl\nrun\tapt-get install -y -q git\n# Install Go\nrun\tcurl -s https://go.googlecode.com/files/go1.1.1.linux-amd64.tar.gz | tar -v -C /usr/local -xz\nenv\tPATH\t/usr/local/go/bin:/usr/local/bin:/usr/local/sbin:/usr/bin:/usr/sbin:/bin:/sbin\nenv\tGOPATH\t/go\nenv\tCGO_ENABLED 0\nrun\tcd /tmp && echo 'package main' > t.go && go test -a -i -v\n# Download dependencies\nrun\tPKG=github.com/kr/pty REV=27435c699;\t\t git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV\nrun\tPKG=github.com/gorilla/context/ REV=708054d61e5; git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV\nrun\tPKG=github.com/gorilla/mux/ REV=9b36453141c;\t git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV\n# Run dependencies\nrun\tapt-get install -y iptables\n# lxc requires updating ubuntu sources\nrun\techo 'deb http://archive.ubuntu.com/ubuntu precise main universe' > /etc/apt/sources.list\nrun\tapt-get update\nrun\tapt-get install -y lxc\nrun\tapt-get install -y aufs-tools\n# Upload docker source\nadd\t. /go/src/github.com/dotcloud/docker\n# Build the binary\nrun\tcd /go/src/github.com/dotcloud/docker/docker && go install -ldflags \"-X main.GITCOMMIT '??' -d -w\"\nenv\tPATH\t/usr/local/go/bin:/go/bin:/usr/local/bin:/usr/local/sbin:/usr/bin:/usr/sbin:/bin:/sbin\ncmd\t[\"docker\"]" ], "url": "https://github.com/asbjornenge/Docker.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/rcjsuen/dockerfile-language-server-nodejs\nwrittenIn typescript" ], "twitter": "https://twitter.com/docker", "fileType": "text", "centralPackageRepositoryCount": 0 }, "docopt": { "title": "docopt", "appeared": 2012, "type": "pl", "creators": [ "Vladimir Keleshev" ], "description": "Command-line interface description language", "website": "http://docopt.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/docopt" ], "domainName": { "registered": 2012, "awisRank": { "2022": 2604235 }, "name": "docopt.org" }, "githubRepo": { "firstCommit": 2012, "stars": 7638, "forks": 561, "subscribers": 168, "created": 2012, "updated": 2022, "description": "Pythonic command line arguments parser, that will make you smile", "issues": 253, "url": "https://github.com/docopt/docopt" }, "repoStats": { "firstCommit": 2012, "commits": 462, "committers": 37, "files": 31 }, "semanticScholar": "" }, "doe-macsyma": { "title": "DOE Macsyma", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a77ab50f5daa2f9e64a49fb203e3635f3c57eac2" ], "country": [ "United States" ], "originCommunity": [ "Paradigm Associates, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3621", "centralPackageRepositoryCount": 0 }, "dog": { "title": "The Dog Programming Language", "appeared": 2011, "type": "pl", "website": "https://www.media.mit.edu/projects/the-dog-programming-language/overview/", "reference": [ "http://salmanahmad.com/files/Dog-UIST2013.pdf" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "leachim6": { "filepath": "d/Dog", "example": [ "Day 1\n Awake\n food Recipe \"Hello World\"\n Bowl food\n Eat food\n Outside\n Walk\n Poop food\n Run\n Inside\n Sleep\nEndOf Day 1\n" ], "id": "Dog" } }, "dogescript": { "title": "Dogescript", "appeared": 2013, "type": "pl", "creators": [ "Zach Bruggeman" ], "website": "http://dogescript.io", "country": [ "Various" ], "originCommunity": [ "https://github.com/dogescript" ], "domainName": { "awisRank": { "2022": 7328617 }, "name": "dogescript.io" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "console.loge" ] ], "stringToken": [ [ "\"" ] ], "example": [ "quiet\n wow \n such language\n very syntax\n github recognized wow\nloud\n\nsuch language much friendly\n rly friendly is true\n plz console.loge with 'such friend, very inclusive'\n but\n plz console.loge with 'no love for doge'\n wow\nwow\n\nmodule.exports is language" ], "githubRepo": { "firstCommit": 2013, "stars": 1327, "forks": 100, "subscribers": 28, "created": 2013, "updated": 2022, "description": "wow so syntax very doge much future", "issues": 8, "url": "https://github.com/dogescript/dogescript" }, "repoStats": { "firstCommit": 2013, "commits": 500, "committers": 36, "files": 633 }, "githubLanguage": { "fileExtensions": [ "djs" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 35, "id": "Dogescript" }, "githubBigQuery": { "repos": 26, "users": 22, "id": "Dogescript" }, "leachim6": { "filepath": "d/DogeScript.djs", "fileExtensions": [ "djs" ], "example": [ "shh such hello dogescript very next-gen wow difficulty\n\nplz console.loge with \"Hello World\"\n" ], "id": "DogeScript" }, "rijuRepl": { "example": [ "plz console.loge with \"Hello, world!\"\n" ], "id": "https://riju.codes/dogescript" }, "twitter": "https://twitter.com/dogescript", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "doh": { "title": "DNS over HTTPS", "appeared": 2018, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Google", "Mozilla Foundation" ], "related": [ "dns" ], "wikipedia": { "summary": "DNS over HTTPS (DoH) is a protocol for performing remote Domain Name System (DNS) resolution via the HTTPS protocol. A goal of the method is to increase user privacy and security by preventing eavesdropping and manipulation of DNS data by man-in-the-middle attacks by using the HTTPS protocol to encrypt the data between the DoH client and the DoH-based DNS resolver. Encryption by itself does not protect privacy, encryption is simply a method to obfuscate the data. By March of 2018, Google and the Mozilla Foundation had started testing versions of DNS over HTTPS. In February 2020, Mozilla launched a version of Firefox that encrypts domain names by default for US-based users.In addition to improving security, another goal of DNS over HTTPS is to improve performance: testing of ISP DNS resolvers has shown that many often have slow response times, a problem that is exacerbated by the need to potentially have to resolve many hostnames when loading a single web page.", "backlinksCount": 48, "pageId": 56903929, "dailyPageViews": 299, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/DNS_over_HTTPS" }, "semanticScholar": "" }, "doi": { "title": "DOI", "appeared": 2000, "type": "schema", "description": "The DOI system provides a technical and social infrastructure for the registration and use of persistent interoperable identifiers, called DOIs, for use on digital networks.", "website": "https://www.doi.org/", "documentation": [ "https://www.doi.org/factsheets/DOIProxy.html" ], "standsFor": "Digital Object Identifier", "country": [ "Switzerland" ], "originCommunity": [ "International Organization for Standardization" ], "domainName": { "registered": 1999, "awisRank": { "2022": 13813 }, "name": "doi.org" }, "example": [ "https://doi.org/10.1000/182" ], "wikipedia": { "created": 2004, "revisionCount": 910, "dailyPageViews": 4196, "url": "https://en.wikipedia.org/wiki/Digital_object_identifier" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "dojo": { "title": "Dojo", "appeared": 2005, "type": "pl", "creators": [ "Alex Russal" ], "website": "https://dojotoolkit.org/", "documentation": [ "https://dojotoolkit.org/documentation/" ], "originCommunity": [ "https://dojotoolkit.org/community/" ], "compilesTo": [ "javascript" ], "writtenIn": [ "javascript" ], "githubRepo": { "stars": 15000, "forks": 550, "subscribers": 164, "url": "https://github.com/dojo/dojo" }, "repoStats": { "firstCommit": 2007, "commits": 5364, "committers": 156, "files": 1338 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Dojo_Toolkit" }, "isOpenSource": true }, "dokuwiki": { "title": "DokuWiki", "appeared": 2004, "type": "wikiMarkup", "website": "https://www.dokuwiki.org/", "country": [ "United States and Germany" ], "originCommunity": [ "https://github.com/splitbrain" ], "domainName": { "registered": 2005, "awisRank": { "2022": 151201 }, "name": "dokuwiki.org" }, "example": [ "DokuWiki supports **bold**, //italic//, __underlined__ and ''monospaced'' texts.\nOf course you can **__//''combine''//__** all these." ], "wikipedia": { "summary": "DokuWiki is a wiki application licensed under GPLv2 and written in the PHP programming language. It works on plain text files and thus does not need a database. Its syntax is similar to the one used by MediaWiki.", "backlinksCount": 112, "pageId": 806169, "dailyPageViews": 203, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/DokuWiki" }, "rijuRepl": { "example": [ "Hello, world!\n" ], "id": "https://riju.codes/dokuwiki" }, "twitter": "https://twitter.com/dokuwiki", "isbndb": "" }, "dolittle": { "title": "Dolittle", "appeared": 1952, "type": "pl", "website": "http://dolittle.eplang.jp/", "country": [ "Japan" ], "nativeLanguage": "Japanese", "originCommunity": [ "Osaka Electro-Communication University" ], "domainName": { "name": "dolittle.eplang.jp" }, "wikipedia": { "example": [ "かめ太＝タートル！作る。\n カメ＝タートル！　作る。\n 時計＝タイマー！　作る　0.1秒　間隔　500回　回数。 時計！　「かめ太！　１０　歩く」　実行。\n 左＝ボタン！”左”作る。 左：動作＝「かめ太！　２０　左回り」。\n 右＝ボタン！”右”作る。 右：動作＝「かめ太！　10　右回り」。" ], "related": [ "logo", "arduino", "java" ], "summary": "Dolittle (Japanese ドリトル doritoru) is a programming language developed at the Osaka Electro-Communication University . Unlike the majority of programming languages it uses keywords based on Japanese and written in Japanese script. It is named after the character Dr Dolittle. It is easier for learners whose native language is Japanese to make early progress in understanding programming.", "pageId": 40592324, "created": 2013, "backlinksCount": 5, "revisionCount": 21, "dailyPageViews": 13, "appeared": 1952, "url": "https://en.wikipedia.org/wiki/Dolittle_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "dollar-sign": { "title": "$", "appeared": 1983, "type": "pl", "description": "The $ language is the simplest form of functional programming, consisting as it does in the iterative application of a simple substitution rule on well-formed strings of the language.", "reference": [ "https://semanticscholar.org/paper/9d8ff3bef2cbc659ff5de49241ee4815c253136d" ], "country": [ "United States" ], "originCommunity": [ "Prime Computer, Inc." ], "hopl": "https://hopl.info/showlanguage.prx?exp=4350", "centralPackageRepositoryCount": 0 }, "dolphin": { "title": "DOLPHIN", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c1c5c489ced26f97c21c4858b0e05c49211d8f96" ], "country": [ "England" ], "originCommunity": [ "Lancaster University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8489", "centralPackageRepositoryCount": 0 }, "domino": { "title": "domino", "appeared": 1989, "type": "pl", "description": "A packet transaction is a block of code written in an imperative language called Domino.", "website": "http://web.mit.edu/domino/", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology", "University of Washington", "Barefoot Networks", "Microsoft Research", "Stanford University" ] }, "doml": { "title": "DOML", "appeared": 2017, "type": "dataNotation", "standsFor": "Data Oriented Markup Language", "country": [ "Australia" ], "originCommunity": [ "https://github.com/DOML-Lang" ], "example": [ "# Version 0.3\n// Construct a new Color\nTest = Color() {\n RGB = 255, 64, 128,\n}\n\n// Constructors do exist\n// the parameter names are purely for your own merit, they will check if its possible however (will be possible on most systems)\nTheSame = Color::Normalized(r: 1, g: 0.25, b: 0.5) {\n Name = \"Bob\"\n}\n\n// You can also just declare an object without scoping it\nOther = Color()\nOther.Name = \"X\"\n\n// You can declare random other values\nMyValue = 2\n\n// You can also edit the original Test at any point EITHER by doing\nTest.R = 50\n// Or by doing\nTest.{\n G = 128\n}\n\n// You can declare arrays like\nArrayObject = []Color {\n ::Normalized(0.95, 0.55, 0.22){\n Name = \"Other\", // Trailing commas are always allowed\n },\n // You can still do an empty construction\n ::() {\n RGB = 50, 25, 125,\n },\n // And thus you can leave out the ::()\n {\n RGB = 50, 25, 125,\n },\n}\n\n// You can also copy objects by doing\nNewObj = Other\n\n// Or can do something like\nNewObj.Name = ArrayObject[0].Name\n\n// You can also declare arrays inside object definitions\nMyTags = Tags() {\n // Note: all have to be of the same type\n SetTags = [\"Hello\", \"Other\", \"bits\", \"bobs\", \"kick\"]\n Name = MyTags.GetTags[0] // And indexing them works like you would think\n}\n\n// You can declare dictionaries like\n// Dictionaries within objects can also be created similarly\nMyDictionary = [String : Color] {\n { \n \"Bob\" : Color::Normalized(0.5, 1.2, 3.5) {\n Name = \"Bob's Color\"\n }\n },\n}\n// No need to keep classes around in this example\n# Deinit all" ], "githubRepo": { "firstCommit": 2017, "stars": 4, "forks": 1, "subscribers": 2, "created": 2017, "updated": 2021, "description": "The specification document for DOML", "issues": 7, "url": "https://github.com/DOML-Lang/DOML" }, "repoStats": { "firstCommit": 2017, "commits": 117, "committers": 2, "files": 13 } }, "doodle": { "title": "DOODLE", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d08a137a91f83ccc251181f0d4bd9fda6cc62381" ], "country": [ "Canada" ], "originCommunity": [ "University of Toronto" ], "wikipedia": { "summary": "A doodle is a drawing made while a person's attention is otherwise occupied. Doodles are simple drawings that can have concrete representational meaning or may just be composed of random and abstract lines, generally without ever lifting the drawing device from the paper, in which case it is usually called a \"scribble\". Doodling and scribbling are most often associated with young children and toddlers, because their lack of hand–eye coordination and lower mental development often make it very difficult for any young child to keep their coloring attempts within the line art of the subject. Despite this, it is not uncommon to see such behaviour with adults, in which case it is generally done jovially, out of boredom. Typical examples of doodling are found in school notebooks, often in the margins, drawn by students daydreaming or losing interest during class. Other common examples of doodling are produced during long telephone conversations if a pen and paper are available. Popular kinds of doodles include cartoon versions of teachers or companions in a school, famous TV or comic characters, invented fictional beings, landscapes, geometric shapes, patterns, textures, or phallic scenes.", "backlinksCount": 255, "pageId": 90298, "dailyPageViews": 585, "created": 2002, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/Doodle" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5549", "centralPackageRepositoryCount": 0, "isbndb": "" }, "dopl": { "title": "DOPL", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5140aca1a5134d5f0bee46e28ef32c179960ab9f", "https://doi.org/10.1093/comjnl/25.2.176" ], "country": [ "Australia" ], "originCommunity": [ "University of Western Australia" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5984", "centralPackageRepositoryCount": 0 }, "dot-product-equation": { "title": "Dot Product Equation", "appeared": 1773, "type": "equation", "creators": [ "Joseph-Louis Lagrange" ], "equation": "a·b = sum(i = 1, i < n, i++, ai * b1)", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Dot_product" } }, "dot-ql": { "title": ".QL", "appeared": 2007, "type": "pl", "website": "https://www.semmle.com", "country": [ "England" ], "originCommunity": [ "Semmle Inc" ], "wikipedia": { "example": [ "1 from Class c, int numOfMethods\n2 where numOfMethods = count(Method m| m.getDeclaringType()=c \n3 and m.hasModifier(\"public\"))\n4 and numOfMethods > 10\n5 select c.getPackage(), c, numOfMethods" ], "related": [ "datalog", "sql", "java" ], "summary": ".QL (pronounced \"dot-cue-el\") is an object-oriented query language used to retrieve data from relational database management systems. It is reminiscent of the standard query language SQL and the object-oriented programming language Java. .QL is an object-oriented variant of a logical query language called Datalog. Hierarchical data can therefore be naturally queried in .QL in a recursive manner. Queries written in .QL are optimised, compiled into SQL and can then be executed on any major relational database management system. .QL query language is being used in SemmleCode to query a relational representation of Java programs. .QL is developed at Semmle Limited and is based on the company's proprietary technology.", "created": 2007, "backlinksCount": 39, "pageId": 11537140, "revisionCount": 24, "dailyPageViews": 59, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/.QL" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "dot": { "title": "DOT", "appeared": 2007, "type": "textMarkup", "documentation": [ "https://graphviz.org/doc/info/lang.html" ], "aka": [ "Graphviz DOT" ], "country": [ "United States" ], "originCommunity": [ "AT&T Labs Research" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ " // The graph name and the semicolons are optional\ngraph graphname {\n a -- b -- c;\n b -- d;\n}" ], "wikipedia": { "example": [ "digraph g {\n\tnode [shape=plaintext];\n\tA1 -> B1;\n\tA2 -> B2;\n\tA3 -> B3;\n\t\n\tA1 -> A2 [label=f];\n\tA2 -> A3 [label=g];\n\tB2 -> B3 [label=\"g'\"];\n\tB1 -> B3 [label=\"(g o f)'\" tailport=s headport=s];\n\n\t{ rank=same; A1 A2 A3 }\n\t{ rank=same; B1 B2 B3 } \n}" ], "related": [ "javascript", "java", "python", "google-cloud", "actionscript", "svg" ], "summary": "DOT is a plain text graph description language. DOT graphs are typically files with the file extension gv or dot. The extension gv is preferred to avoid confusion with the extension dot used by early (pre-2007) versions of Microsoft Word. Various programs can process DOT files. Some, such as dot, neato, twopi, circo, fdp, and sfdp, can read a DOT file and render it in graphical form. Others, such as gvpr, gc, acyclic, ccomps, sccmap, and tred, read DOT files and perform calculations on the represented graph. Finally, others, such as lefty, dotty, and grappa, provide an interactive interface. The GVedit tool combines a text editor with noninteractive image viewer. Most programs are part of the Graphviz package or use it internally.", "pageId": 571341, "dailyPageViews": 312, "created": 2004, "backlinksCount": 44, "revisionCount": 268, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/DOT_(graph_description_language)" }, "githubLanguage": { "fileExtensions": [ "dot", "gv" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.dot", "repos": 27831, "id": "Graphviz (DOT)" }, "githubBigQuery": { "repos": 68, "users": 67, "id": "Graphviz (DOT)" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/dot", "pygmentsHighlighter": { "filename": "graphviz.py", "fileExtensions": [ "gv", "dot" ], "id": "Graphviz" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2015, "committerCount": 8, "commitCount": 47, "sampleCount": 2, "example": [ "/* \n Huffman Tree DOT graph.\n\n DOT Reference : http://www.graphviz.org/doc/info/lang.html\n http://en.wikipedia.org/wiki/DOT_language\n Timestamp : 1415989074 \n Phrase : 'OH GOD WHY IS LINGUIST SO ANAL ABOUT THIS STUFF'\n\n Generated on http://huffman.ooz.ie/\n*/\n\ndigraph G {\n edge [label=0];\n graph [ranksep=0];\n T [shape=record, label=\"{{T|4}|000}\"];\n S [shape=record, label=\"{{S|5}|001}\"];\n SPACE [shape=record, label=\"{{SPACE|9}|01}\"];\n A [shape=record, label=\"{{A|3}|1000}\"];\n H [shape=record, label=\"{{H|3}|1001}\"];\n U [shape=record, label=\"{{U|3}|1010}\"];\n L [shape=record, label=\"{{L|2}|10110}\"];\n N [shape=record, label=\"{{N|2}|10111}\"];\n I [shape=record, label=\"{{I|4}|1100}\"];\n O [shape=record, label=\"{{O|4}|1101}\"];\n G [shape=record, label=\"{{G|2}|11100}\"];\n F [shape=record, label=\"{{F|2}|11101}\"];\n GF [label=4];\n W [shape=record, label=\"{{W|1}|111100}\"];\n Y [shape=record, label=\"{{Y|1}|111101}\"];\n B [shape=record, label=\"{{B|1}|111110}\"];\n D [shape=record, label=\"{{D|1}|111111}\"];\n BD [label=2];\n WYBD [label=4];\n GFWYBD [label=8];\n 47 -> 18 -> 9 -> T;\n 29 -> 13 -> 6 -> A;\n 7 -> U;\n 4 -> L;\n 16 -> 8 -> I;\n GFWYBD -> GF -> G;\n WYBD -> 2 -> W;\n BD -> B;9 -> S [label=1];\n 18 -> SPACE [label=1];\n 6 -> H [label=1];\n 13 -> 7 -> 4 -> N [label=1];\n 8 -> O [label=1];\n GF -> F [label=1];\n 2 -> Y [label=1];\n 47 -> 29 -> 16 -> GFWYBD -> WYBD -> BD -> D [label=1];\n}" ], "url": "https://github.com/textmate/graphviz.tmbundle" }, "jupyterKernel": [ "https://github.com/laixintao/jupyter-dot-kernel" ], "fileType": "text", "wordRank": 2930, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|Inductive Synthesis of Dot Expressions|10.1007/BFb0019359|7|0|A. Brazma|a1520814a1aff34ac9ea7a16d9d9c64250c8c09d\n2011|Model Development of Quantum Dot Devices for γ Radiation Detection Using Block Diagram Programming|10.1115/1.4004313|2|0|I. Mahmoud and M. S. Eltokhy and H. A. Konber|f119557bdc00629d096c6371491dad70ab121040\n2020|ιDOT: a DOT calculus with object initialization|10.1145/3428276|2|0|Ifaz Kabir and Yufeng Li and O. Lhoták|034a622c61502bd23bea51fa4f6e276bb13608b2\n2011|Block diagram modeling of quantum dot infrared photodetectors|10.1117/1.3626209|1|0|M. S. Eltokhy and I. Mahmoud and H. A. Konber|6477630862ef4abf2fba888a17f9f3961db93374" }, "dowl": { "title": "DOWL", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/60f515ae444bfce78bfad09de0a50be993482c60" ], "country": [ "Germany" ], "originCommunity": [ "University of Karlsruhe" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1724", "centralPackageRepositoryCount": 0 }, "dpp": { "title": "D++", "appeared": 1999, "type": "pl", "creators": [ "Daniel Smith" ], "website": "http://www.pagemac.com/dpp/home", "reference": [ "https://www.pagemac.com/dpp/docs" ], "fileExtensions": [ "dpp", "dpl" ], "country": [ "United States" ], "originCommunity": [ "https://www.pagemac.com" ], "keywords": [ "continue", "do", "else", "endif", "exit_do", "exit_for", "exit_function", "for", "function", "if", "loop", "newvar", "next", "return", "step", "then", "to", "until", "var", "while" ] }, "dprl": { "title": "DPRL", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/513ca41a1562dc246f207e32f657b481302eb1bc" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3791", "centralPackageRepositoryCount": 0 }, "draco-programming-language": { "title": "Draco", "appeared": 1987, "type": "pl", "creators": [ "Chris Gray" ], "country": [ "United States" ], "originCommunity": [ "https://web.archive.org/web/20090221030835/http://www.graysage.com/" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "writeln" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "pascal", "c" ], "summary": "Draco was a shareware programming language created by Chris Gray. First developed for CP/M sytems, Amiga version followed in 1987.Although Draco, a blend of Pascal and C, was well suited for general purpose programming, its uniqueness as a language was its main weak point. Gray used Draco for the Amiga to create a port of Peter Langston's game Empire.", "created": 2004, "backlinksCount": 16, "pageId": 507348, "revisionCount": 46, "dailyPageViews": 6, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/Draco_(programming_language)" }, "leachim6": { "filepath": "d/Draco.d", "fileExtensions": [ "d" ], "example": [ "proc main()void:\n writeln(\"Hello World\");\ncorp;\n" ], "id": "Draco" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1317", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1984|The Draco Approach to Constructing Software from Reusable Components|10.1109/TSE.1984.5010280|399|9|J. Neighbors|4716cdaebfe504ea8d4a3bea19bd3d281a0577c4\n2018|Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco|10.1109/TVCG.2018.2865240|154|21|Dominik Moritz and Chenglong Wang and Greg L. Nelson and Halden Lin and Adam M. Smith and Bill Howe and Jeffrey Heer|8db0faf2764f8b578c5d702989d437ff8bea9f14" }, "draconian": { "title": "draconian", "appeared": 2021, "type": "pl", "isDead": true, "creators": [ "Hextanium" ], "country": [ "United States" ], "githubRepo": { "firstCommit": 2021, "stars": 1, "forks": 0, "subscribers": 1, "created": 2021, "updated": 2022, "description": "A crisp language focused on making code equally easy to both read and type.", "issues": 0, "url": "https://github.com/TechnoDrive/draconian" } }, "dragonbasic": { "title": "DragonBASIC", "appeared": 2003, "type": "pl", "creators": [ "Ulrich Hecht" ], "reference": [ "https://dokumen.tips/documents/dragon-basic-gba-development-basicpdf-dragon-basic-is-an-implementation-of.html?page=1" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/uli/" ], "githubRepo": { "firstCommit": 2015, "stars": 26, "forks": 6, "subscribers": 6, "created": 2015, "updated": 2022, "description": "Dragon BASIC compiler for Game Boy Advance", "issues": 19, "url": "https://github.com/uli/dragonbasic" }, "repoStats": { "firstCommit": 2015, "commits": 878, "committers": 1, "files": 413 }, "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/DragonBASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "dragoon": { "title": "DRAGOON", "appeared": 1989, "type": "pl", "website": "https://www.txtspa.it", "reference": [ "https://semanticscholar.org/paper/4bd892cb6ffc5113e117e70524779584d904c873" ], "country": [ "Italy" ], "originCommunity": [ "TXT S.p.A" ], "domainName": { "name": "txtspa.it" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1473", "centralPackageRepositoryCount": 0 }, "drakon": { "title": "DRAKON", "appeared": 1996, "type": "pl", "creators": [ "Stepan Mitkin" ], "website": "https://drakon-editor.com/", "country": [ "Russia" ], "originCommunity": [ "Soviet space program" ], "domainName": { "registered": 2015, "name": "drakon-editor.com" }, "githubRepo": { "firstCommit": 2014, "stars": 287, "forks": 51, "subscribers": 41, "created": 2014, "updated": 2022, "description": "DRAKON Editor", "issues": 40, "url": "https://github.com/stepan-mitkin/drakon_editor" }, "repoStats": { "firstCommit": 2014, "commits": 175, "committers": 9, "files": 633 }, "wikipedia": { "example": [ "The word \"наглядность\" (pronounced approximately as \"naa-glya-dno-st-th\") refers to a quality of concept or idea being easy to imagine and understand, and may be translated as \"clarity\" as well." ], "related": [ "uml", "perl", "tcl", "linux", "c", "csharp", "d", "erlang", "go", "java", "javascript", "lua", "processing", "python", "verilog", "isbn" ], "summary": "DRAKON is an algorithmic visual programming language developed within the Buran space project following ergonomic design principles. The language provides a uniform way to represent flowcharts of any complexity that are easy to read and understand. The DRAKON Editor, which was released in September 2011, is an implementation of the language available in the public domain. It can be used for creating documentation, or for creating visual programs that can be converted to source code in other languages. Unlike UML's philosophy, DRAKON language philosophy is based on being augmented if needed, by using a hybrid language, which can be illustrated as \"incrustating code snippets from text language used into shape DRAKON requires\". This way, DRAKON stays an all-way simple visual language per se, that can be used as an augmentation for a programmer, who is interested in making own project code easier for support or other long-term needs, i.e. improving ergonomics of coding process or to make code easy to review and understand. Name DRAKON is Russian acronym for \"Дружелюбный Русский Алгоритмический [язык], Который Обеспечивает Наглядность\", which translates\"Friendly Russian algorithmic [language] that provides illustrativeness (or clarity)\". The word \"наглядность\" (pronounced approximately as \"naa-glya-dno-st-th\") refers to a quality of concept or idea being easy to imagine and understand, and may be translated as \"clarity\" as well. It is to note, that DRAKON language can be used both as modelling\\\"markup\" language (which is considered a standalone \"pure DRAKON\" program making) and as programming language (as part of a hybrid language). Integration of stricter, \"academic\" variant of a markup language into programming, which any DRAKON-(programming language used) provides, supposedly (as intended by initial philosophy of DRAKON development) adds syntactic sugar to such extent users of different text programming language can comprehend each other's input into the overall project and criticize it upon necessity.", "pageId": 9912359, "dailyPageViews": 130, "created": 2007, "backlinksCount": 71, "revisionCount": 208, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/DRAKON" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "dreamlisp": { "title": "dreamlisp", "appeared": 2019, "type": "pl", "website": "http://www.jsloop.net/2019/12/dreamlisp-lisp-dialect-in-objective-c.html", "githubRepo": { "firstCommit": 2019, "subscribers": 1, "created": 2020, "updated": 2021, "description": "DreamLisp Programming Language Interpreter", "stars": 4, "forks": 0, "issues": 0, "url": "https://github.com/jsloop42/dreamlisp" }, "repoStats": { "firstCommit": 2019, "commits": 367, "committers": 2, "files": 147 } }, "dribble": { "title": "Dribble", "appeared": 2003, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4fc2642d0c499a0149feedf3b4d159ab22a7a6f0" ], "country": [ "The Netherlands and United Kingdom" ], "originCommunity": [ "Utrecht University", "University of Liverpool" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7801", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|Verifying Dribble Agents|10.1007/978-3-642-11355-0_15|4|0|Doan Thu Trang and B. Logan and N. Alechina|57b90483026c1d2d01db57cc17017d6b8b8e4619" }, "drl": { "title": "DRL", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a2595355729916d84cefd997452ab772d58fea84" ], "country": [ "Spain" ], "originCommunity": [ "University of Malaga" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2784", "centralPackageRepositoryCount": 0 }, "drol": { "title": "DROL", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f4bb81bfb4fddab02c09fd8b2db0cf03236d0893" ], "country": [ "Japan" ], "originCommunity": [ "Keio University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6279", "centralPackageRepositoryCount": 0 }, "drupal": { "title": "Drupal", "appeared": 2000, "type": "application", "website": "https://www.drupal.org", "country": [ "Various" ], "originCommunity": [ "Drupal community" ], "domainName": { "registered": 2001, "awisRank": { "2022": 6109 }, "name": "drupal.org" }, "wikipedia": { "related": [ "php", "gettext", "twig", "html", "wordpress", "mysql" ], "summary": "Drupal is a free and open source content-management framework written in PHP and distributed under the GNU General Public License. Drupal provides a back-end framework for at least 2.3% of all web sites worldwide – ranging from personal blogs to corporate, political, and government sites. Systems also use Drupal for knowledge management and for business collaboration. As of November 2017, the Drupal community is composed of more than 1.3 million members, including 109,000 users actively contributing, resulting in more than 39,000 free modules that extend and customize Drupal functionality, over 2,500 free themes that change the look and feel of Drupal, and at least 1,180 free distributions that allow users to quickly and easily set up a complex, use-specific Drupal in fewer steps. The standard release of Drupal, known as Drupal core, contains basic features common to content-management systems. These include user account registration and maintenance, menu management, RSS feeds, taxonomy, page layout customization, and system administration. The Drupal core installation can serve as a simple Web site, a single- or multi-user blog, an Internet forum, or a community Web site providing for user-generated content. Drupal also describes itself as a Web application framework. When compared with notable frameworks Drupal meets most of the generally accepted feature requirements for such web frameworks. Although Drupal offers a sophisticated API for developers, basic Web-site installation and administration of the framework require no programming skills. Drupal runs on any computing platform that supports both a Web server capable of running PHP and a database to store content and configuration.", "pageId": 166004, "dailyPageViews": 882, "created": 2003, "backlinksCount": 947, "revisionCount": 2995, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Drupal" }, "linkedInSkill": { "2018": 164174, "id": "drupal" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nDrupal For Dummies|2009|Lynn Beighley|9208672|3.45|66|12" }, "dscript": { "title": "Dimensional Script", "appeared": 2012, "type": "notation", "website": "http://www.dscript.org/", "reference": [ "http://dscript.org/dscript.pdf" ], "standsFor": "Dimensional Script", "country": [ "China" ], "originCommunity": [ "www.wonderlabsstudio.com" ], "domainName": { "registered": 2012, "awisRank": { "2022": 2686436 }, "name": "dscript.org" } }, "dsd": { "title": "Document Structure Description", "appeared": 2000, "type": "xmlFormat", "website": "https://www.brics.dk/DSD/", "reference": [ "https://www.brics.dk/DSD/dsd.html" ], "country": [ "United States and Denmark" ], "originCommunity": [ "AT&T Labs Research", "QinetiQ Ltd" ], "example": [ "\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n" ], "wikipedia": { "summary": "Document Structure Description, or DSD, is a schema language for XML, that is, a language for describing valid XML documents. It's an alternative to DTD or the W3C XML Schema. An example of DSD in its simplest form: This says that element named \"foo\" in the XML namespace \"http://example.com\" may have two attributes, named \"first\" and \"second\". A \"foo\" element may not have any character data. It must contain one subelement, named \"bar\", also in the \"http://example.com\" namespace. A \"bar\" element is not allowed any attributes, character data or subelements. One XML document that would be valid according to the above DSD would be: ", "backlinksCount": 9, "pageId": 1545534, "dailyPageViews": 8, "url": "https://en.wikipedia.org/wiki/Document_Structure_Description" } }, "dsl-90": { "title": "DSL/90", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7b1b71170ef1dcbc470c6d16b8bb13f4f2559ad1" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=253", "centralPackageRepositoryCount": 0 }, "dslx": { "title": "dslx", "appeared": 2020, "type": "pl", "description": "DSLX is a domain specific, functional language to build hardware that can also run effectively as host software. The DSL targets the XLS compiler (by conversion to XLS IR) to enable flows for FPGAs and ASICs (note that other frontends will become available in the future). DSLX mimics Rust, while being an immutable expression-based dataflow DSL with hardware-oriented features; e.g. arbitrary bitwidths, entirely fixed size objects, fully analyzeable call graph, etc. To avoid arbitrary new syntax/semantics choices the DSL mimics Rust where it is reasonably possible; for example, integer conversions all follow the same semantics as Rust.", "reference": [ "https://google.github.io/xls/dslx_reference/" ], "country": [ "United States" ], "originCommunity": [ "Google" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "fn cast_to_array(x: u6) -> u2[3] {\n x as u2[3]\n}\n\nfn cast_from_array(a: u2[3]) -> u6 {\n a as u6\n}\n\nfn concat_arrays(a: u2[3], b: u2[3]) -> u2[6] {\n a ++ b\n}\n\ntest cast_to_array {\n let a_value: u6 = u6:0b011011;\n let a: u2[3] = cast_to_array(a_value);\n let a_array = u2[3]:[1, 2, 3];\n let _ = assert_eq(a, a_array);\n // Note: converting back from array to bits gives the original value.\n let _ = assert_eq(a_value, cast_from_array(a));\n\n let b_value: u6 = u6:0b111001;\n let b_array: u2[3] = u2[3]:[3, 2, 1];\n let b: u2[3] = cast_to_array(b_value);\n let _ = assert_eq(b, b_array);\n let _ = assert_eq(b_value, cast_from_array(b));\n\n // Concatenation of bits is analogous to concatenation of their converted\n // arrays. That is:\n //\n // convert(concat(a, b)) == concat(convert(a), convert(b))\n let concat_value: u12 = a_value ++ b_value;\n let concat_array: u2[6] = concat_value as u2[6];\n let _ = assert_eq(concat_array, concat_arrays(a_array, b_array));\n\n // Show a few classic \"endianness\" example using 8-bit array values.\n let x = u32:0xdeadbeef;\n let _ = assert_eq(x as u8[4], u8[4]:[0xde, 0xad, 0xbe, 0xef]);\n let y = u16:0xbeef;\n let _ = assert_eq(y as u8[2], u8[2]:[0xbe, 0xef]);\n\n ()\n}" ] }, "dss": { "title": "dss", "appeared": 2018, "type": "pl", "website": "https://dss-lang.com", "domainName": { "registered": 2021, "name": "dss-lang.com" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n17536341|DSS – Deterministic StyleSheets|https://dss-lang.com/|2018-07-15 18:21:30 UTC|1531678890|octosphere|0|1" }, "dsym": { "title": "dsym", "appeared": 2011, "type": "binaryDataFormat", "description": "On Apple platforms, debug symbols are optionally emitted during the build process as dSYM file(s). Apple uses the term \"symbolicate\" to refer to the replacement of addresses in diagnostic files with human readable values. If you are distributing your app via the App Store, or conducting a beta test using Test Flight, you will be given the option of including the dSYM file when uploading your archive to iTunes Connect. In the submission dialog, check “Include app symbols for your application…”. Uploading your dSYM file is necessary to receive crash reports collected from TestFlight users and customers who have opted to share diagnostic data.", "reference": [ "https://developer.apple.com/library/archive/technotes/tn2151/_index.html#//apple_ref/doc/uid/DTS40008184-CH1-INTRODUCTION" ], "country": [ "United States" ], "originCommunity": [ "Apple" ] }, "dtd": { "title": "DTD", "appeared": 1996, "type": "grammarLanguage", "standsFor": "document type definition", "country": [ "Switzerland" ], "originCommunity": [ "International Organization for Standardization" ], "wikipedia": { "example": [ "\n\n \n \n \n \n \n]>\n\n \n Fred Bloggs\n 2008-11-27\n Male\n \n" ], "related": [ "xml", "html" ], "summary": "A document type definition (DTD) is a set of markup declarations that define a document type for an SGML-family markup language (SGML, XML, HTML). A Document Type Definition (DTD) defines the legal building blocks of an XML document. It defines the document structure with a list of legal elements and attributes. A DTD can be declared inline inside an XML document, or as an external reference. XML uses a subset of SGML DTD. As of 2009, newer XML namespace-aware schema languages (such as W3C XML Schema and ISO RELAX NG) have largely superseded DTDs. A namespace-aware version of DTDs is being developed as Part 9 of ISO DSDL. DTDs persist in applications that need special publishing characters, such as the XML and HTML Character Entity References, which derive from larger sets defined as part of the ISO SGML standard effort.", "pageId": 8537, "dailyPageViews": 235, "created": 2001, "backlinksCount": 72, "revisionCount": 583, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Document_type_definition" }, "pygmentsHighlighter": { "filename": "html.py", "fileExtensions": [ "dtd" ], "id": "DTD" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nInside XML DTDs: Scientific and Technical|1999|Simon St. Laurent|2097228|3.00|4|0\nXML Programming Success in a Day: Beginner's Guide to Fast, Easy, and Efficient Learning of XML Programming (XML, XML Programming, Programming, XML Guide, ... XSL, DTD's, Schemas, HTML5, JavaScript)|2015|Sam Key|45569772|3.22|18|3", "isbndb": "", "semanticScholar": "" }, "dtrace": { "title": "DTrace", "appeared": 2005, "type": "pl", "description": "DTrace is a comprehensive dynamic tracing framework created by Sun Microsystems for troubleshooting kernel and application problems on production systems in real time.", "website": "http://dtrace.org/", "country": [ "United States" ], "originCommunity": [ "Sun Microsystems" ], "domainName": { "registered": 2010, "awisRank": { "2022": 6607140 }, "name": "dtrace.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "printf" ] ], "stringToken": [ [ "\"" ] ], "example": [ "# Syscall count by syscall\ndtrace -n 'syscall:::entry { @num[probefunc] = count(); }'\n# Syscall count by process\ndtrace -n 'syscall:::entry { @num[pid,execname] = count(); }'" ], "wikipedia": { "example": [ "# New processes with arguments\ndtrace -n 'proc:::exec-success { trace(curpsinfo->pr_psargs); }'\n\n# Files opened by process\ndtrace -n 'syscall::open*:entry { printf(\"%s %s\",execname,copyinstr(arg0)); }'\n\n# Syscall count by program\ndtrace -n 'syscall:::entry { @num[execname] = count(); }'\n\n# Syscall count by syscall\ndtrace -n 'syscall:::entry { @num[probefunc] = count(); }'\n\n# Syscall count by process\ndtrace -n 'syscall:::entry { @num[pid,execname] = count(); }'\n\n# Disk size by process\ndtrace -n 'io:::start { printf(\"%d %s %d\",pid,execname,args[0]->b_bcount); }'\n\n# Pages paged in by process\ndtrace -n 'vminfo:::pgpgin { @pg[execname] = sum(arg0); }'" ], "related": [ "solaris", "freebsd", "linux", "c", "assembly-language", "java", "erlang", "javascript", "perl", "php", "python", "ruby", "tcl", "mysql", "postgresql" ], "summary": "DTrace is a comprehensive dynamic tracing framework created by Sun Microsystems for troubleshooting kernel and application problems on production systems in real time. Originally developed for Solaris, it has since been released under the free Common Development and Distribution License (CDDL) and has been ported to several other Unix-like systems. DTrace can be used to get a global overview of a running system, such as the amount of memory, CPU time, filesystem and network resources used by the active processes. It can also provide much more fine-grained information, such as a log of the arguments with which a specific function is being called, or a list of the processes accessing a specific file. In 2010, Oracle Corporation acquired Sun Microsystems. In October 2011, Oracle announced the porting of DTrace to Linux, but for several years only an unofficial DTrace port to Linux was available, with no changes in licensing terms.In August 2017, Oracle released DTrace kernel code under the GPLv2+ license, and user space code under GPLv2 and UPL licensing. In September 2018 Microsoft announced that they had ported DTrace from FreeBSD to Windows.In September 2016 the OpenDTrace effort began on github with both code and comprehensive documentation of the system's internals. The OpenDTrace effort maintains the original CDDL licensing for the code from OpenSolaris with additional code contributions coming under a BSD 2 Clause license. The goal of OpenDTrace is to provide an OS agnostic, portable implementation of DTrace that is acceptable to all consumers, including macOS, FreeBSD, OpenBSD, NetBSD, and Linux as well as embedded systems.", "pageId": 1179136, "created": 2004, "backlinksCount": 92, "revisionCount": 300, "dailyPageViews": 141, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/DTrace" }, "githubLanguage": { "fileExtensions": [ "d" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "dtrace" ], "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-csrc", "tmScope": "source.c", "aliases": [ "dtrace-script" ], "repos": 534, "id": "DTrace" }, "githubBigQuery": { "repos": 2080, "users": 1907, "id": "DTrace" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 23, "commitCount": 359, "sampleCount": 3, "example": [ "/*\n * This software is in the public domain.\n *\n * $Id: counts.d 10510 2005-08-15 01:46:19Z kateturner $\n */\n\n#pragma D option quiet\n\nself int tottime;\nBEGIN {\n\ttottime = timestamp;\n}\n\nphp$target:::function-entry\n\t@counts[copyinstr(arg0)] = count();\n}\n\nEND {\n\tprintf(\"Total time: %dus\\n\", (timestamp - tottime) / 1000);\n\tprintf(\"# calls by function:\\n\");\n\tprinta(\"%-40s %@d\\n\", @counts);\n}\n\n" ], "url": "https://github.com/textmate/c.tmbundle" }, "leachim6": { "filepath": "d/DTrace.d", "fileExtensions": [ "d" ], "example": [ "#!/usr/sbin/dtrace -qs\nBEGIN {\n\tprintf(\"Hello World\");\n\texit(0);\n}\n" ], "id": "DTrace" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAdvanced Apple Debugging & Reverse Engineering: Exploring Apple code through LLDB, Python and DTrace||Derek Selander|56926999|5.00|2|0\nAdvanced Apple Debugging & Reverse Engineering Second Edition: Exploring Apple code through LLDB, Python and DTrace||raywenderlich.com Team|60459566|0.0|0|0", "isbndb": "" }, "dts": { "title": "TypeScript Type Declarations", "appeared": 2012, "type": "headerLang", "description": "TypeScript .d.ts files are declaration files that contain only type information. These files don't produce .js outputs; they are only used for typechecking.", "reference": [ "https://microsoft.github.io/TypeScript-New-Handbook/chapters/type-declarations/" ], "fileExtensions": [ "d.ts" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "subsetOf": [ "typescript" ], "related": [ "typescript" ] }, "dual": { "title": "DUAL", "appeared": 1953, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1afd58a10da82c0b8fe5b6b54d6efc53d8857efe" ], "country": [ "United States" ], "originCommunity": [ "Los Alamos National Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4664", "wordRank": 2702, "centralPackageRepositoryCount": 0 }, "dub-pm": { "title": "dub-pm", "appeared": 2012, "type": "packageManager", "creators": [ "Sönke Ludwig" ], "website": "https://code.dlang.org/", "reference": [ "https://dub.pm/package-format-json" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/dlang" ], "domainName": { "name": "code.dlang.org" }, "githubRepo": { "firstCommit": 2012, "stars": 603, "forks": 228, "subscribers": 60, "created": 2012, "updated": 2022, "description": "Package and build management system for D", "issues": 526, "url": "https://github.com/dlang/dub" }, "packageCount": 1498, "forLanguages": [ "d" ] }, "duel": { "title": "DUEL", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0627fd0f54b81b4f4fa96a61db19b508ab9e3af1" ], "country": [ "United States" ], "originCommunity": [ "Princeton University" ], "pygmentsHighlighter": { "filename": "webmisc.py", "fileExtensions": [ "duel", "jbst" ], "id": "Duel" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5445", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Round-Robin Duel Discriminative Language Models|10.1109/TASL.2011.2174225|27|1|T. Oba and Takaaki Hori and A. Nakamura and A. Ito|caeaf086c7388b1f37637e15c4080d34bb6c4939" }, "duro": { "title": "duro", "appeared": 2003, "type": "queryLanguage", "website": "http://duro.sourceforge.net/", "country": [ "Unknown" ], "originCommunity": [ "https://sourceforge.net/p/duro/mailman/duro-devel/" ], "domainName": { "name": "duro.sourceforge.net" }, "githubRepo": { "firstCommit": 2003, "stars": 12, "forks": 1, "subscribers": 4, "created": 2015, "updated": 2020, "description": "Relational Database Management System", "issues": 0, "url": "https://github.com/rehartmann/durodbms" }, "repoStats": { "firstCommit": 2003, "commits": 1399, "committers": 8, "files": 386 } }, "durra": { "title": "Durra", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/13d6d658818345f60be02d6efd287996627fcb99" ], "country": [ "Switzerland" ], "originCommunity": [ "Eidgenössische Technische Hochschule Zürich" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1217", "centralPackageRepositoryCount": 0, "isbndb": "" }, "dvi-standard": { "title": "Digital Visual Interface", "appeared": 1999, "type": "standard", "originCommunity": [ "Digital Display Working Group" ], "wikipedia": { "dailyPageViews": 1473, "url": "https://en.wikipedia.org/wiki/Digital_Visual_Interface" } }, "dwg": { "title": ".dwg", "appeared": 1982, "type": "binaryDataFormat", "description": "Autodesk estimates that in 1998 there were in excess of two billion DWG files in existence.", "country": [ "United States" ], "originCommunity": [ "Autodesk", "Open Design Alliance", "others" ], "wikipedia": { "related": [ "autocad-app", "dxf" ], "summary": "DWG (from drawing) is a proprietary binary file format used for storing two- and three- dimensional design data and metadata. It is the native format for several CAD packages including DraftSight, AutoCAD, IntelliCAD (and its variants), Caddie and Open Design Alliance compliant applications. In addition, DWG is supported non-natively by many other CAD applications. The .bak (drawing backup), .dws (drawing standards), .dwt (drawing template) and .sv$ (temporary automatic save) files are also DWG files.", "created": 2004, "backlinksCount": 170, "pageId": 641111, "dailyPageViews": 368, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/.dwg" }, "centralPackageRepositoryCount": 0 }, "dxf": { "title": "AutoCAD DXF", "appeared": 1982, "type": "application", "country": [ "United States" ], "originCommunity": [ "Autodesk" ], "wikipedia": { "related": [ "autocad-app", "dwg", "ascii" ], "summary": "AutoCAD DXF (Drawing Interchange Format, or Drawing Exchange Format) is a CAD data file format developed by Autodesk for enabling data interoperability between AutoCAD and other programs. DXF was originally introduced in December 1982 as part of AutoCAD 1.0, and was intended to provide an exact representation of the data in the AutoCAD native file format, DWG (Drawing), for which Autodesk for many years did not publish specifications. Because of this, correct imports of DXF files have been difficult. Autodesk now publishes the DXF specifications as a PDF on its website. Versions of AutoCAD from Release 10 (October 1988) and up support both ASCII and binary forms of DXF. Earlier versions support only ASCII. As AutoCAD has become more powerful, supporting more complex object types, DXF has become less useful. Certain object types, including ACIS solids and regions, are not documented. Other object types, including AutoCAD 2006's dynamic blocks, and all of the objects specific to the vertical market versions of AutoCAD, are partially documented, but not well enough to allow other developers to support them. For these reasons many CAD applications use the DWG format which can be licensed from Autodesk or non-natively from the Open Design Alliance. DXF coordinates are always without dimensions so that the reader or user needs to know the drawing unit or has to extract it from the textual comments in the sheets.", "pageId": 2754, "created": 2001, "backlinksCount": 274, "revisionCount": 409, "dailyPageViews": 307, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/AutoCAD_DXF" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "dylan": { "title": "Dylan", "appeared": 1992, "type": "pl", "website": "http://opendylan.org", "webRepl": [ "https://play.opendylan.org/" ], "documentation": [ "https://opendylan.org/documentation/" ], "country": [ "United Kingdom" ], "originCommunity": [ "Apple" ], "domainName": { "registered": 2004, "awisRank": { "2017": 4149488, "2022": 5393679 }, "name": "opendylan.org" }, "visualParadigm": false, "hasMultipleDispatch": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasMultipleInheritance": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasMacros": { "example": "define macro table\n { table(?table-class:expression, ?table-contents) }\n => { let ht = make(?table-class); ?table-contents; ht; }\n { table(?rest:*) } => { table(, ?rest); }\n\n table-contents:\n { } => { }\n { ?key:expression => ?value:expression, ... }\n => { ht[?key] := ?value; ... }\nend macro table\n", "value": true }, "lineCommentToken": [ [ "//" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "local", "in", "end", "below", "until", "from", "then", "for", "use", "case", "elseif", "else", "by", "cleanup", "finally", "when", "begin", "above", "select", "let", "if", "otherwise", "signal", "afterwards", "unless", "while", "define", "rename", "create", "to", "export" ], "wikipedia": { "example": [ "define method turn-blue (w :: )\n w.color := $blue;\nend method;" ], "related": [ "algol", "scheme", "eulisp", "lasso", "python", "ruby", "common-lisp", "unix", "java", "smalltalk" ], "summary": "Dylan is a multi-paradigm programming language that includes support for functional and object-oriented programming, and is dynamic and reflective while providing a programming model designed to support efficient machine code generation, including fine-grained control over dynamic and static behaviors. It was created in the early 1990s by a group led by Apple Computer. A concise and thorough overview of the language may be found in the Dylan Reference Manual. Dylan derives from Scheme and Common Lisp and adds an integrated object system derived from the Common Lisp Object System (CLOS). In Dylan, all values (including numbers, characters, functions, and classes) are first-class objects. Dylan supports multiple inheritance, polymorphism, multiple dispatch, keyword arguments, object introspection, pattern-based syntax extension macros, and many other advanced features. Programs can express fine-grained control over dynamism, admitting programs that occupy a continuum between dynamic and static programming and supporting evolutionary development (allowing for rapid prototyping followed by incremental refinement and optimization). Dylan's main design goal is to be a dynamic language well-suited for developing commercial software. Dylan attempts to address potential performance issues by introducing \"natural\" limits to the full flexibility of Lisp systems, allowing the compiler to clearly understand compilable units (i.e., libraries). Although deriving much of its semantics from Scheme and other Lisps—some implementations were in fact initially built within existing Lisp systems—Dylan has an ALGOL-like syntax rather than a Lisp-like prefix syntax.", "pageId": 8741, "dailyPageViews": 73, "created": 2002, "backlinksCount": 91, "revisionCount": 299, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Dylan_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "dylan", "dyl", "intr", "lid" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "dylan", "codemirrorMimeType": "text/x-dylan", "tmScope": "source.dylan", "repos": 150, "id": "Dylan" }, "githubBigQuery": { "repos": 112, "users": 67, "id": "Dylan" }, "codeMirror": "dylan", "pygmentsHighlighter": { "filename": "dylan.py", "fileExtensions": [ "dylan", "dyl", "intr" ], "id": "Dylan" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2011, "committerCount": 5, "commitCount": 20, "url": "https://github.com/textmate/dylan.tmbundle" }, "helloWorldCollection": [ "module:\t\t\thello-world\nauthor:\t\t\tHomer\ncopyright:\t\t(c) 1994 Homer\nversion:\t\t1.0\n\n// Hello World in DYLAN\n\ndefine method main (#rest args)\n princ(\"Hello world!\");\nend;\n\nmain();\n" ], "leachim6": { "filepath": "d/Dylan.dl", "fileExtensions": [ "dl" ], "example": [ "define method main (#rest args)\n princ(\"Hello World\");\nend;\n\nmain();\n" ], "id": "Dylan" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Dylan", "rijuRepl": { "example": [ "Module: main\n\ndefine function main\n (name :: , arguments :: )\n format-out(\"Hello, world!\\n\");\n exit-application(0);\nend function main;\n\nmain(application-name(), application-arguments());" ], "id": "https://riju.codes/dylan" }, "tiobe": { "id": "Dylan" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1682", "fileType": "text", "wordRank": 9298, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1996|Addison-Wesley|Dylan Programming: An Object-Oriented and Dynamic Language|Keene, Sonya E. and Mathews, Robert O. and Withington, P. Tucker and Mathews, robert|9780201479768", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1996|Programming in Dylan|10.1007/978-1-4471-0929-7|17|0|I. Craig|2775ffcfb9963960af95dbdb1929d7fc20131f90" }, "dynamo-pm": { "title": "dynamo-pm", "appeared": 2013, "type": "packageManager", "website": "https://dynamopackages.com/", "country": [ "United States" ], "originCommunity": [ "Autodesk, Inc" ], "domainName": { "registered": 2013, "awisRank": { "2022": 3407091 }, "name": "dynamopackages.com" }, "packageCount": 1494, "packageAuthors": 620, "packageInstallCount": 1554909, "forLanguages": [ "dynamo-visual-language" ] }, "dynamo-visual-language": { "title": "Dynamo", "appeared": 2011, "type": "visual", "creators": [ "Ian Keough" ], "website": "https://dynamobim.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/DynamoDS" ], "domainName": { "registered": 2013, "awisRank": { "2022": 238266 }, "name": "dynamobim.org" }, "roadmap": "https://dynamobim.org/roadmap/", "githubRepo": { "firstCommit": 2011, "stars": 1254, "forks": 556, "subscribers": 193, "created": 2012, "updated": 2022, "description": "Open Source Graphical Programming for Design", "issues": 247, "url": "https://github.com/DynamoDS/Dynamo" }, "repoStats": { "firstCommit": 2011, "commits": 34493, "committers": 239, "files": 9618 }, "packageRepository": [ "https://dynamopackages.com/" ], "twitter": "https://twitter.com/dynamobim", "isOpenSource": true, "isbndb": "" }, "dynamo": { "title": "DYNAMO", "appeared": 1959, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology", "IBM" ], "wikipedia": { "related": [ "assembly-language", "isbn", "doi" ], "summary": "DYNAMO (DYNAmic MOdels) is a discontinued a simulation language and accompanying graphical notation developed within the system dynamics analytical framework. It was originally for industrial dynamics but was soon extended to other applications, including population and resource studies and urban planning.DYNAMO was initially developed under the direction of Jay Wright Forrester in the late 1950s, by Dr. Phyllis Fox, Alexander L. Pugh III, Grace Duren, and others at the M.I.T. Computation Center. The earliest versions were written in assembly language for the IBM 704, then for the IBM 709 and IBM 7090. DYNAMO II was written in AED-0, an extended version of Algol 60. Dynamo II/F, in 1971, generated portable FORTRAN code and both Dynamo II/F and Dynamo III improved the system's portability by being written in FORTRAN.DYNAMO was used for the system dynamics simulations of global resource-depletion reported in the Club of Rome's Limits to Growth. Originally designed for batch processing on mainframe computers, it was made available on minicomputers in the late 1970s, and became available as \"micro-Dynamo\" on personal computers in the early 1980s. The language went through several revisions from DYNAMO II up to DYNAMO IV in 1983, but has since fallen into disuse.", "pageId": 26064582, "created": 2010, "backlinksCount": 28, "revisionCount": 114, "dailyPageViews": 26, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/DYNAMO_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=61", "fileType": "text", "centralPackageRepositoryCount": 0 }, "dystal": { "title": "DYSTAL", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/825ec2cdb3b9961d3a7457c8e3a4aaa2231bb5e3" ], "country": [ "United States" ], "originCommunity": [ "Brown University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=401", "centralPackageRepositoryCount": 0 }, "dyvil": { "title": "dyvil", "appeared": 2014, "type": "pl", "description": "Dyvil is a multi-paradigm, general purpose programming language that is based on Java and the JVM. It is a compiled, statically and strongly typed language that supports object-oriented, functional and imperative programming styles. The language features many high-level constructs as well as an extensible and expressive syntax, making it highly useful for both rapid and safe prototyping, and the creation of domain-specific languages.", "website": "https://reddit.com/r/Dyvil", "country": [ "Germany" ], "originCommunity": [ "https://github.com/Dyvil" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "'" ] ], "githubRepo": { "stars": 55, "forks": 2, "subscribers": 5, "created": 2014, "updated": 2022, "firstCommit": 2014, "description": "The Dyvil programming language", "issues": 47, "url": "https://github.com/Dyvil/Dyvil" }, "repoStats": { "firstCommit": 2014, "commits": 4593, "committers": 5, "files": 928 }, "leachim6": { "filepath": "d/Dyvil.dyv", "fileExtensions": [ "dyv" ], "example": [ "class Dyvil\n{\n\tstatic func main(args: [String]) = print 'Hello World'\n}\n" ], "id": "Dyvil" }, "tryItOnline": "dyvil", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "e": { "title": "E", "appeared": 1997, "type": "pl", "creators": [ "Mark S. Miller" ], "description": "E is an object-oriented programming language for secure distributed computing.", "website": "http://erights.org/", "country": [ "United States" ], "originCommunity": [ "Combex, Inc." ], "domainName": { "registered": 1998, "awisRank": { "2022": 11154366 }, "name": "erights.org" }, "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "example": [ "def factorial(n :int) :int {\n if (n == 1) {\n return 1\n } else if (n > 0) {\n return n * factorial(n-1)\n } else {\n throw(\"invalid argument to factorial: \"+n)\n }\n}", "# E snippet from\n# http://wiki.erights.org/wiki/Walnut/Distributed_Computing/Promises\nwhen (tempVow) -> {\n #...use tempVow\n} catch prob {\n #.... report problem\n} finally {\n #....log event\n}\n" ], "wikipedia": { "example": [ "def makeMint(name) :any {\n def [sealer, unsealer] := makeBrandPair(name)\n def mint {\n to makePurse(var balance :(int >= 0)) :any {\n def decr(amount :(0..balance)) :void {\n balance -= amount\n }\n def purse {\n to getBalance() :int { return balance }\n to sprout() :any { return mint.makePurse(0) }\n to getDecr() :any { return sealer.seal(decr) }\n to deposit(amount :int, src) :void {\n unsealer.unseal(src.getDecr())(amount)\n balance += amount\n }\n }\n return purse\n }\n }\n return mint\n }" ], "related": [ "gnu-e", "joule", "java", "python", "pascal" ], "summary": "E is an object-oriented programming language for secure distributed computing, created by Mark S. Miller, Dan Bornstein, and others at Electric Communities in 1997. E is mainly descended from the concurrent language Joule and from Original-E, a set of extensions to Java for secure distributed programming. E combines message-based computation with Java-like syntax. A concurrency model based on event loops and promises ensures that deadlock can never occur.", "pageId": 1377046, "created": 2005, "backlinksCount": 75, "revisionCount": 104, "dailyPageViews": 77, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/E_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "e" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "rune" ], "aceMode": "text", "tmScope": "none", "repos": 354, "id": "E" }, "githubBigQuery": { "repos": 304, "users": 291, "id": "E" }, "leachim6": { "filepath": "e/E.e", "fileExtensions": [ "e" ], "example": [ "println(\"Hello World\")\n" ], "id": "E" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:E", "hopl": "https://hopl.info/showlanguage.prx?exp=1990", "fileType": "text", "wordRank": 82, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "eagle": { "title": "Eagle", "appeared": 1988, "type": "application", "country": [ "United States" ], "originCommunity": [ "Autodesk, Inc." ], "wikipedia": { "related": [ "linux", "postscript", "xml", "arduino", "kicad" ], "summary": "EAGLE is a scriptable electronic design automation (EDA) application with schematic capture, printed circuit board (PCB) layout, auto-router and computer-aided manufacturing (CAM) features. EAGLE stands for Easily Applicable Graphical Layout Editor (German: Einfach Anzuwendender Grafischer Layout-Editor) and is developed by CadSoft Computer GmbH. The company was acquired by Autodesk Inc. in 2016.", "backlinksCount": 476, "pageId": 1470123, "created": 2005, "revisionCount": 337, "dailyPageViews": 177, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/EAGLE_(program)" }, "githubLanguage": { "fileExtensions": [ "sch", "brd" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "xml", "codemirrorMode": "xml", "codemirrorMimeType": "text/xml", "tmScope": "text.xml", "id": "Eagle" }, "githubBigQuery": { "repos": 2082, "users": 1788, "id": "Eagle" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 12, "commitCount": 97, "sampleCount": 2, "example": [ "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n current-count = counts.get(word) or 0\n counts.set(word, current-count + 1)\n consume(counts.entries()).sort(compare) where\n compare({w1, c1}, {w2, c2}) = c2 - c1" ], "githubRepo": { "stars": 473, "forks": 11, "subscribers": 17, "created": 2014, "updated": 2017, "description": "Programming language compiling to JavaScript", "url": "https://github.com/breuleux/earl-grey" }, "repoStats": { "firstCommit": 2014, "commits": 556, "committers": 3, "files": 83 }, "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "eg" ], "id": "Earl Grey" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8150346|Show HN: The Earl Grey language – pattern matching, macros, compiles to JS|2014-08-07 22:01:22 UTC|1407448882|breuleux|1|5" }, "eas-e": { "title": "EAS-E", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8478e796108ca2dc235e12f803a320de139e7c07" ], "country": [ "United States" ], "originCommunity": [ "Baruch College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3815", "centralPackageRepositoryCount": 0 }, "ease": { "title": "Ease", "appeared": 1991, "type": "pl", "creators": [ "Steven Ericsson-Zenith" ], "country": [ "United States and France" ], "originCommunity": [ "Yale University", "École des Mines de Paris - Université PSL", "Pierre", "Marie Curie University", "The Sorbonne" ], "wikipedia": { "related": [ "csp", "occam" ], "summary": "Ease is a general purpose parallel programming language. It is designed by Steven Ericsson-Zenith, a researcher at Yale University, the Institute for Advanced Science & Engineering in Silicon Valley, California, the Ecole Nationale Supérieure des Mines de Paris, and the Pierre and Marie Curie University, the science department of the Sorbonne.The book Process Interaction Models is the Ease language specification. Ease combines the process constructs of communicating sequential processes (CSP) with logically shared data structures called contexts. Contexts are parallel data types that are constructed by processes and provide a way for processes to interact. The language includes two process constructors. A cooperation includes an explicit barrier synchronization and is written: ∥ P ( ) ∥ Q ( ) ; {\\displaystyle \\parallel P()\\parallel Q();} If one process finishes before the other, then it will wait until the other processes are finished. A subordination creates a process that shares the contexts that are in scope when created and finishes when complete (it does not wait for other processes) and is written: / / P ( ) ; {\\displaystyle {\\big /}\\!\\!/P();} Subordinate processes stop if they attempt to interact with a context that has completed because the parent process has stopped. This enables speculative processes to be created that will finish if their result is not needed. Powerful replication syntax allows multiple processes to be created. For example, ∥ i f o r n : P ( i ) ; {\\displaystyle \\parallel {i}\\;{for}\\;{n}:P(i);} creates n synchronized processes each with a local constant i. Processes cannot share local variables and cooperate in the construction of shared contexts. Certain context types, called resources, ensure call-reply semantics. There are four functions upon contexts: read (context, variable) – copies a value from the shared context to the variable. write (context, expression) – copies the value of expression to the shared context. put (context, name) – moves the value bound to name to the shared context. The value of name is subsequently undefined. get (context, name) – moves a value from context and binds it to name. The value is removed from the context.Context types are Singletons, Bags or Streams and can be subscripted arrays. Ease has a semiotic definition. This means that it accounts for the effect the language has on the programmer and how they develop algorithms. The language was designed to ease the developing of parallel programs.", "pageId": 1968693, "created": 2005, "backlinksCount": 11, "revisionCount": 66, "dailyPageViews": 9, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Ease_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3593", "fileType": "text", "wordRank": 4819, "centralPackageRepositoryCount": 0 }, "easl": { "title": "EASL", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/97db08d658408470b03edcb4f9f8f178d1fa6bbc" ], "country": [ "United States" ], "originCommunity": [ "Aerospace Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5147", "centralPackageRepositoryCount": 0 }, "easy-english": { "title": "EASY ENGLISH", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/696566ce25e5828798dc711e72fd2a06db5b6fd1" ], "country": [ "United States" ], "originCommunity": [ "University of Pennsylvania" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4750", "centralPackageRepositoryCount": 0 }, "easy": { "title": "Easy Programming Language", "appeared": 2004, "type": "pl", "country": [ "China" ], "originCommunity": [ "The Easy Programming Language Company" ], "wikipedia": { "summary": "Easy Programming Language (EPL, Chinese: 易语言) is a Chinese programming language, featuring a full Chinese environment. Its community may be the largest of all non-English-based programming languages. EPL is somewhat popular in China, considering the difficulties of adopting English for most Chinese speakers.", "pageId": 42016798, "created": 2004, "backlinksCount": 8, "revisionCount": 21, "dailyPageViews": 17, "url": "https://en.wikipedia.org/wiki/Easy_Programming_Language" }, "fileType": "text", "wordRank": 621, "centralPackageRepositoryCount": 0 }, "easybuild": { "title": "Easybuild", "appeared": 2014, "type": "application", "creators": [ "Kenneth Hoste" ], "description": "EasyBuild is a software build and installation framework that allows you to manage (scientific) software on High Performance Computing (HPC) systems in an efficient way.", "website": "http://easybuilders.github.io/easybuild/", "country": [ "Various" ], "originCommunity": [ "https://github.com/easybuilders/" ], "githubRepo": { "stars": 377, "forks": 137, "subscribers": 34, "created": 2012, "updated": 2022, "description": "EasyBuild - building software with ease", "issues": 93, "firstCommit": 2012, "url": "https://github.com/easybuilders/easybuild" }, "githubLanguage": { "fileExtensions": [ "eb" ], "trendingProjectsCount": 0, "type": "data", "group": "Python", "aceMode": "python", "codemirrorMode": "python", "codemirrorMimeType": "text/x-python", "tmScope": "source.python", "id": "Easybuild" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 13, "commitCount": 415, "sampleCount": 1, "example": [ "# not really (there's an EB_bzip2 easyblock), but fine for use in unit tests\neasyblock = 'ConfigureMake'\n\nname = 'bzip2'\nversion = '1.0.6'\n\nhomepage = 'http://www.bzip.org/'\ndescription = \"\"\"bzip2 is a freely available, patent free, high-quality data compressor. It typically\ncompresses files to within 10% to 15% of the best available techniques (the PPM family of statistical\ncompressors), whilst being around twice as fast at compression and six times faster at decompression.\"\"\"\n\ntoolchain = {'name': 'GCC', 'version': '4.9.2'}\ntoolchainopts = {'pic': True}\n\nsources = [SOURCE_TAR_GZ]\nsource_urls = ['http://www.bzip.org/%(version)s']\n\nbuilddependencies = [('gzip', '1.6')]\n\nmoduleclass = 'tools'\n" ], "url": "https://github.com/MagicStack/MagicPython" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "easylanguage": { "title": "EasyLanguage", "appeared": 1995, "type": "pl", "country": [ "United States" ], "originCommunity": [ "TradeStation Group, Inc" ], "wikipedia": { "related": [ "pascal" ], "summary": "EasyLanguage is a proprietary programming language that was developed by TradeStation and built into its electronic trading platform. It is used to create custom indicators for financial charts and also to create algorithmic trading strategies for the markets. External DLL's can be referenced using EasyLanguage which greatly extends its functionality. The language was intended to allow creation of custom trading strategies by traders without specialized computer training. Commands consist mostly of regular English words, which makes EasyLanguage easier to learn than more complex programming languages.Example: Plain English: \"If the close is greater than the high of 1 day ago, then buy 100 shares at market.\" EasyLanguage: \"if the Close > the High of 1 day ago then Buy 100 shares next bar at market;\"", "backlinksCount": 8, "pageId": 8648665, "created": 2006, "revisionCount": 38, "dailyPageViews": 18, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/EasyLanguage" }, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011|Wiley|TradeStation Made Easy!: Using EasyLanguage to Build Profits with the World's Most Popular Trading Software|Sunny J. Harris|9780471353539" }, "easytrieve": { "title": "Easytrieve", "appeared": 1969, "type": "pl", "country": [ "United States" ], "originCommunity": [ "CA Technologies" ], "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "example": [ "FILE PERSNL FB(150 1800) } LIBRARY DEFINITION\n NAME 17 8 A \n PERSNR 9 5 N\n ABTL 98 3 N\n SUMME 94 4 P 2\nJOB INPUT PERSNL NAME SUM-PERS } ACTIVITY DEFINITION\n PRINT PAYRPT\n REPORT PAYRPT LINESIZE 80\n TITLE 01 'PERSONALREPORT BEISPIEL1'\n LINE 01 ABTL NAME PERSNR SUMME" ], "related": [ "unix", "linux" ], "summary": "Easytrieve is a Report generator product of CA Technologies. Easytrieve Classic and Easytrieve Plus are two available versions of this programming languages primarily designed to generate reports and are used by large corporations operating in mainframe (z/OS, z/VM, z/VSE), UNIX, Linux, and Microsoft Windows environments", "created": 2009, "backlinksCount": 15, "pageId": 21771340, "revisionCount": 63, "dailyPageViews": 21, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Easytrieve" }, "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "ezt", "mac" ], "id": "Easytrieve" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5189", "centralPackageRepositoryCount": 0 }, "ebg": { "title": "ebg", "appeared": 1999, "type": "pl", "description": "EBG is a lazy, higher order functional programming language with a Hindley-Milner type system, modules, separate compilation, algebraic types, pattern matching, and an interface to Java based on the ob ject-oriented model of program execution.", "reference": [ "https://arxiv.org/pdf/1804.07271.pdf" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "ebnf": { "title": "EBNF", "appeared": 1977, "type": "grammarLanguage", "creators": [ "Niklaus Wirth" ], "standsFor": "extended Backus-Naur form", "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "wikipedia": { "example": [ "function application = list( symbol, { expression } );" ], "related": [ "pascal", "xml", "regex" ], "summary": "In computer science, extended Backus-Naur form (EBNF) is a family of metasyntax notations, any of which can be used to express a context-free grammar. EBNF is used to make a formal description of a formal language which can be a computer programming language. They are extensions of the basic Backus–Naur form (BNF) metasyntax notation. The earliest EBNF was originally developed by Niklaus Wirth incorporating some of the concepts (with a different syntax and notation) from Wirth syntax notation. However, many variants of EBNF are in use. The International Organization for Standardization has adopted an EBNF standard (ISO/IEC 14977). This article uses EBNF as specified by the ISO for examples applying to all EBNFs. Other EBNF variants use somewhat different syntactic conventions.", "pageId": 71289, "dailyPageViews": 244, "backlinksCount": 50, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Extended_Backus–Naur_form" }, "githubLanguage": { "fileExtensions": [ "ebnf" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "codemirrorMode": "ebnf", "codemirrorMimeType": "text/x-ebnf", "tmScope": "source.ebnf", "repos": 0, "id": "EBNF" }, "codeMirror": "ebnf", "pygmentsHighlighter": { "filename": "parsers.py", "fileExtensions": [ "ebnf" ], "id": "EBNF" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2016, "committerCount": 2, "commitCount": 42, "sampleCount": 4, "example": [ "(*\n Source: https://github.com/io7m/jsom0\n License: ISC\n*)\n\ndigit_without_zero =\n \"1\" | \"2\" | \"3\" | \"4\" | \"5\" | \"6\" | \"7\" | \"8\" | \"9\" ;\n\ndigit =\n \"0\" | digit_without_zero ;\n\npositive =\n digit_without_zero , { digit } ;\n\nnatural =\n \"0\" | positive ;\n\nreal =\n [ \"-\" ] , digit , [ \".\" , { digit } ] ;\n\n" ], "url": "https://github.com/sanssecours/EBNF.tmbundle" }, "hopl": "https://hopl.info/showlanguage.prx?exp=755", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ec": { "title": "eC", "appeared": 2004, "type": "pl", "creators": [ "Jérôme Jacovella-St-Louis" ], "website": "http://ec-lang.org/", "standsFor": "Ecere C", "country": [ "Canada" ], "originCommunity": [ "Ecere Corporation" ], "domainName": { "registered": 2014, "awisRank": { "2022": 5961071 }, "name": "ec-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "PrintLn" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "githubRepo": { "stars": 298, "forks": 90, "subscribers": 47, "created": 2011, "updated": 2022, "description": "Ecere SDK (eC Language, Ecere IDE, Cross platform GUI, graphics, and more) — http://ec-lang.org — ", "issues": 7, "url": "https://github.com/ecere/ecere-sdk/" }, "repoStats": { "firstCommit": 2011, "commits": 7491, "committers": 20, "files": 5837 }, "wikipedia": { "example": [ "import \"ecere\"\n\nclass HelloForm : Window\n{\n caption = \"My First eC Application\";\n borderStyle = sizable;\n clientSize = { 304, 162 };\n hasClose = true;\n\n Label label\n {\n this, position = { 10, 10 }, font = { \"Arial\", 30 },\n caption = \"Hello, World!!\"\n };\n};\n\nHelloForm hello { };" ], "related": [ "c", "python", "llvmir", "linux", "freebsd", "android", "javascript", "wasm" ], "summary": "eC (Ecere C) is an object-oriented programming language, defined as a super-set of the C language. eC was initially developed as part of the Ecere Cross-platform Software Development Kit project. The goals of the language are to provide object-oriented constructs, reflection, properties and dynamic modules on top of the C language while maintaining C compatibility and optimal native performance.eC currently relies on GCC or Clang to perform the final steps of compilation, using C as an intermediate language. There are, however, plans to integrate directly with LLVM to skip the intermediate C files.eC is available as part of the ecere-sdk package in Debian/Ubuntu and other derived Linux distributions. A Windows installer also bundling MinGW-w64 is available from the main website. The free and open-source SDK including the eC compiler can also be built for a number of other platforms, including OS X, FreeBSD and Android.It is also possible to deploy eC applications to the web by compiling them to JavaScript through Emscripten, or to WebAssembly through Binaryen.", "pageId": 48971282, "created": 2016, "backlinksCount": 23, "revisionCount": 76, "dailyPageViews": 22, "appeared": 2004, "fileExtensions": [ "ec", "eh" ], "url": "https://en.wikipedia.org/wiki/EC_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ec", "eh" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.c.ec", "repos": 139, "id": "eC" }, "githubBigQuery": { "repos": 920, "users": 894, "id": "eC" }, "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "ec", "eh" ], "id": "eC" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2015, "committerCount": 2, "commitCount": 12, "sampleCount": 1, "example": [ "import \"ide\"\n\nclass Designer : DesignerBase\n{\n ~Designer()\n {\n if(GetActiveDesigner() == this)\n {\n SetActiveDesigner(null);\n }\n if(classDesigner)\n delete classDesigner;\n }\n\n // *** DesignerBase Implementation ***\n\n void ModifyCode()\n {\n codeEditor.ModifyCode();\n }\n\n void UpdateProperties()\n {\n codeEditor.DesignerModifiedObject();\n }\n\n void CodeAddObject(Instance instance, ObjectInfo * object)\n {\n codeEditor.AddObject(instance, object);\n }\n\n void SheetAddObject(ObjectInfo object)\n {\n codeEditor.sheet.AddObject(object, object.name, typeData, true); //className, true);\n }\n\n void AddToolBoxClass(Class _class)\n {\n ((IDEWorkSpace)master).toolBox.AddControl(_class);\n }\n\n void AddDefaultMethod(Instance instance, Instance classInstance)\n {\n Class _class = instance._class;\n Method defaultMethod = null;\n\n for( ; _class; _class = _class.base)\n {\n Method method;\n int minID = MAXINT;\n for(method = (Method)_class.methods.first; method; method = (Method)((BTNode)method).next)\n {\n if(method.type == virtualMethod)\n {\n if(!method.dataType)\n method.dataType = ProcessTypeString(method.dataTypeString, false);\n if(method.vid < minID && (instance == classInstance || (method.dataType.thisClass && eClass_IsDerived(classInstance._class, method.dataType.thisClass.registered))))\n {\n defaultMethod = method;\n minID = method.vid;\n }\n }\n }\n if(defaultMethod)\n break;\n }\n codeEditor.AddMethod(defaultMethod);\n }\n\n bool ObjectContainsCode(ObjectInfo object)\n {\n // Confirmation if control contains code\n if(object.instCode)\n {\n MembersInit members;\n if(object.instCode.members)\n {\n for(members = object.instCode.members->first; members; members = members.next)\n {\n if(members.type == methodMembersInit)\n {\n //if(!Code_IsFunctionEmpty(members.function))\n {\n return true;\n }\n }\n }\n }\n }\n return false;\n }\n\n void DeleteObject(ObjectInfo object)\n {\n if(codeEditor)\n codeEditor.DeleteObject(object);\n }\n\n void RenameObject(ObjectInfo object, const char * name)\n {\n if(object && (name || !object.classDefinition))\n codeEditor.RenameObject(object, name);\n }\n\n bool FindObject(Instance * object, const char * string)\n {\n ObjectInfo classObject;\n for(classObject = codeEditor.classes.first; classObject; classObject = classObject.next)\n {\n ObjectInfo check;\n if(classObject.name && !strcmp(string, classObject.name))\n {\n *object = classObject.instance;\n break;\n }\n for(check = classObject.instances.first; check; check = check.next)\n {\n if(check.name && !strcmp(string, check.name))\n {\n *object = check.instance;\n break;\n }\n }\n if(check)\n return true;\n }\n return false;\n }\n\n void SelectObjectFromDesigner(ObjectInfo object)\n {\n codeEditor.SelectObjectFromDesigner(object);\n }\n\n borderStyle = sizable;\n isActiveClient = true;\n hasVertScroll = true;\n hasHorzScroll = true;\n hasClose = true;\n hasMaximize = true;\n hasMinimize = true;\n text = $\"Designer\";\n menu = Menu { };\n anchor = Anchor { left = 300, right = 150, top = 0, bottom = 0 };\n\n ToolBox toolBox;\n CodeEditor codeEditor;\n\n Menu fileMenu { menu, $\"File\", f };\n MenuItem fileSaveItem\n {\n fileMenu, $\"Save\", s, ctrlS;\n bool NotifySelect(MenuItem selection, Modifiers mods)\n {\n return codeEditor.MenuFileSave(selection, mods);\n }\n };\n MenuItem fileSaveAsItem\n {\n fileMenu, $\"Save As...\", a;\n bool NotifySelect(MenuItem selection, Modifiers mods)\n {\n return codeEditor.MenuFileSaveAs(selection, mods);\n }\n };\n bool debugClosing;\n\n bool OnClose(bool parentClosing)\n {\n if(!parentClosing)\n {\n if(codeEditor && codeEditor.inUseDebug && !debugClosing)\n {\n debugClosing = true;\n closing = false;\n if(CloseConfirmation(false))\n {\n visible = false;\n if(modifiedDocument)\n OnFileModified({ modified = true }, null);\n }\n debugClosing = false;\n return false;\n }\n if(codeEditor && !codeEditor.closing && !debugClosing)\n {\n if(!codeEditor.visible)\n {\n if(!codeEditor.Destroy(0))\n return false;\n else\n codeEditor = null;\n }\n else\n {\n visible = false;\n return false;\n }\n }\n }\n return true;\n }\n\n bool OnActivate(bool active, Window previous, bool * goOnWithActivation, bool direct)\n {\n if(active)\n {\n codeEditor.EnsureUpToDate();\n codeEditor.fixCaret = true;\n /*\n if(classDesigner)\n classDesigner.Activate();\n */\n }\n return true;\n }\n\n bool OnKeyHit(Key key, unichar ch)\n {\n return codeEditor.sheet.OnKeyHit(key, ch);\n }\n\n watch(modifiedDocument)\n {\n fileSaveItem.disabled = !modifiedDocument && codeEditor.fileName;\n };\n\n // *** METHODS ACCESSED FROM PROPERTY SHEET/TOOLBOX/CODE EDITOR ***\n void Reset()\n {\n if(classDesigner)\n {\n classDesigner.Reset();\n classDesigner.SelectObject(null, null);\n classDesigner.Destroy(0);\n delete classDesigner;\n }\n }\n\n void FillToolBox()\n {\n if(this && classDesigner)\n classDesigner.ListToolBoxClasses(this);\n }\n\n void SelectObject(ObjectInfo object, Instance instance)\n {\n ClassDesignerBase classDesigner = this.classDesigner;\n#ifdef _DEBUG\n if(instance && instance._class.module.application != codeEditor.privateModule)\n printf(\"warning: SelectObject: instance._class.module.application != codeEditor.privateModule\\n\");\n#endif\n if(!classDesigner || !instance || classDesigner._class != (Class)eInstance_GetDesigner(instance))\n {\n if(classDesigner)\n {\n classDesigner.SelectObject(null, null);\n classDesigner.Destroy(0);\n classDesigner = null;\n delete this.classDesigner;\n }\n if(instance)\n {\n this.classDesigner = classDesigner = eInstance_New(eInstance_GetDesigner(instance));\n incref classDesigner;\n //if(!classDesigner.parent)\n {\n classDesigner.parent = this;\n classDesigner.anchor = Anchor { left = 0, right = 0, top = 0, bottom = 0 };\n }\n classDesigner.Create();\n }\n }\n // Call class editor SelectObject\n if(classDesigner)\n classDesigner.SelectObject(object, instance);\n }\n\n void AddObject()\n {\n // Call class editor AddObject\n if(classDesigner)\n classDesigner.AddObject();\n if(visible)\n Activate();\n else\n codeEditor.Activate();\n }\n\n void CreateObject(Instance instance, ObjectInfo object, bool isClass, Instance iclass)\n {\n subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance);\n\n // Call class editor CreateObject\n if(designerClass)\n designerClass.CreateObject(this, instance, object, isClass, iclass);\n }\n\n void ::PostCreateObject(Instance instance, ObjectInfo object, bool isClass, Instance iclass)\n {\n subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance);\n\n // Call class editor PostCreateObject\n if(designerClass)\n designerClass.PostCreateObject(instance, object, isClass, iclass);\n }\n\n void ::DroppedObject(Instance instance, ObjectInfo object, bool isClass, Instance iclass)\n {\n subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance);\n\n // Call class editor PostCreateObject\n if(designerClass)\n designerClass.DroppedObject(instance, object, isClass, iclass);\n }\n\n void PrepareTestObject(Instance instance)\n {\n subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance);\n if(designerClass)\n designerClass.PrepareTestObject(this, instance);\n }\n\n void ::DestroyObject(Instance instance)\n {\n subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance);\n if(designerClass)\n designerClass.DestroyObject(instance);\n }\n\n void ::FixProperty(Property prop, Instance instance)\n {\n subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance);\n if(designerClass)\n designerClass.FixProperty(prop, instance);\n }\n}\n" ], "url": "https://github.com/ecere/ec.tmbundle" }, "leachim6": { "filepath": "e/Ec.ec", "fileExtensions": [ "ec" ], "example": [ "class HelloWorldApp : Application\n{\n void Main()\n {\n PrintLn(\"Hello World\");\n }\n}\n" ], "id": "Ec" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:EC", "rijuRepl": { "example": [ "class Main : Application\n{\n void Main()\n {\n PrintLn(\"Hello, world!\");\n }\n}\n" ], "id": "https://riju.codes/ec" }, "tryItOnline": "ec", "fileType": "text", "wordRank": 4684, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2006|Springer|Early Nutrition And Its Later Consequences: New Opportunities: Perinatal Programming Of Adult Health - Ec Supported Research (advances In Experimental Medicine And Biology)|Berthold Koletzko and Margaret Ashwell and Peter Dodds and Hans Akerblom|9781402035340\n2006|Springer|Early Nutrition and its Later Consequences: New Opportunities: Perinatal Programming of Adult Health - EC Supported Research (Advances in Experimental Medicine and Biology Book 569)|Abdelghani Bellouquid; Marcello Delitala|9781402035357" }, "ecl": { "title": "ECL", "appeared": 2000, "type": "pl", "website": "http://hpccsystems.com/", "country": [ "United States" ], "originCommunity": [ "LexisNexis Risk Solutions Group" ], "domainName": { "registered": 2010, "awisRank": { "2022": 1525012 }, "name": "hpccsystems.com" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "stars": 521, "forks": 285, "subscribers": 49, "created": 2011, "updated": 2023, "description": "HPCC Systems (High Performance Computing Cluster) is an open source, massive parallel-processing computing platform for big data processing and analytics.", "issues": 484, "url": "https://github.com/hpcc-systems/HPCC-Platform" }, "repoStats": { "firstCommit": 2011, "commits": 35093, "committers": 172, "files": 13257 }, "wikipedia": { "example": [ "D := DATASET([{'ECL'},{'Declarative'},{'Data'},{'Centric'},{'Programming'},{'Language'}],{STRING Value;});" ], "related": [ "linux", "prolog", "pascal", "sql", "clarion" ], "summary": "ECL is a declarative, data centric programming language designed in 2000 to allow a team of programmers to process big data across a high performance computing cluster without the programmer being involved in many of the lower level, imperative decisions.", "pageId": 31108124, "dailyPageViews": 1, "created": 2012, "backlinksCount": 19, "revisionCount": 1, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/ECL,_data-centric_programming_language_for_Big_Data" }, "githubLanguage": { "fileExtensions": [ "ecl", "eclxml" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "ecl", "codemirrorMimeType": "text/x-ecl", "tmScope": "source.ecl", "repos": 234, "id": "ECL" }, "githubBigQuery": { "repos": 25, "users": 25, "id": "ECL" }, "codeMirror": "ecl", "pygmentsHighlighter": { "filename": "ecl.py", "fileExtensions": [ "ecl" ], "id": "ECL" }, "linguistGrammarRepo": { "sampleCount": 1, "example": [ "/* \n * Multi-line comment\n */\n#option ('slidingJoins', true);\n\nnamesRecord :=\n RECORD\nstring20 surname;\nstring10 forename;\ninteger2 age;\ninteger2 dadAge;\ninteger2 mumAge;\n END;\n\nnamesRecord2 :=\n record\nstring10 extra;\nnamesRecord;\n end;\n\nnamesTable := dataset('x',namesRecord,FLAT);\nnamesTable2 := dataset('y',namesRecord2,FLAT);\n\ninteger2 aveAgeL(namesRecord l) := (l.dadAge+l.mumAge)/2;\ninteger2 aveAgeR(namesRecord2 r) := (r.dadAge+r.mumAge)/2;\n\n// Standard join on a function of left and right\noutput(join(namesTable, namesTable2, aveAgeL(left) = aveAgeR(right)));\n\n//Several simple examples of sliding join syntax\noutput(join(namesTable, namesTable2, left.age >= right.age - 10 and left.age <= right.age +10));\noutput(join(namesTable, namesTable2, left.age between right.age - 10 and right.age +10));\noutput(join(namesTable, namesTable2, left.age between right.age + 10 and right.age +30));\noutput(join(namesTable, namesTable2, left.age between (right.age + 20) - 10 and (right.age +20) + 10));\noutput(join(namesTable, namesTable2, aveAgeL(left) between aveAgeR(right)+10 and aveAgeR(right)+40));\n\n//Same, but on strings. Also includes age to ensure sort is done by non-sliding before sliding.\noutput(join(namesTable, namesTable2, left.surname between right.surname[1..10]+'AAAAAAAAAA' and right.surname[1..10]+'ZZZZZZZZZZ' and left.age=right.age));\noutput(join(namesTable, namesTable2, left.surname between right.surname[1..10]+'AAAAAAAAAA' and right.surname[1..10]+'ZZZZZZZZZZ' and left.age=right.age,all));\n\n//This should not generate a self join\noutput(join(namesTable, namesTable, left.age between right.age - 10 and right.age +10));\n" ], "url": "https://github.com/hpcc-systems/ecl-tmLanguage" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ECL", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n||Ecl Programming Language|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133156937" }, "eclectic-csp": { "title": "Eclectic CSP", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/71054b0b78376f269dbd080e05fc1f808331080a" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Oxford" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5426", "centralPackageRepositoryCount": 0 }, "eclipse-command-language": { "title": "Eclipse Command Language", "appeared": 2008, "type": "pl", "reference": [ "https://www.eclipse.org/rcptt/documentation/userguide/ecl/" ], "aka": [ "ecl" ], "country": [ "Canada" ], "originCommunity": [ "Eclipse Foundation" ], "hasLineComments": { "example": "% A comment", "value": true }, "hasComments": { "example": "% A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "lineCommentToken": [ [ "%" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "keywords": [ "__compressed__", "after", "all", "and", "any", "as", "atmost", "before", "beginc", "best", "between", "case", "cluster", "compressed", "compression", "const", "counter", "csv", "default", "descend", "embed", "encoding", "encrypt", "end", "endc", "endembed", "endmacro", "enum", "escape", "except", "exclusive", "expire", "export", "extend", "fail", "few", "fileposition", "first", "flat", "forward", "from", "full", "function", "functionmacro", "group", "grouped", "heading", "hole", "ifblock", "import", "in", "inner", "interface", "internal", "joined", "keep", "keyed", "last", "left", "limit", "linkcounted", "literal", "little_endian", "load", "local", "locale", "lookup", "lzw", "macro", "many", "maxcount", "maxlength", "min", "skew", "module", "mofn", "multiple", "named", "namespace", "nocase", "noroot", "noscan", "nosort", "not", "noxpath", "of", "onfail", "only", "opt", "or", "outer", "overwrite", "packed", "partition", "penalty", "physicallength", "pipe", "prefetch", "quote", "record", "repeat", "retry", "return", "right", "right1", "right2", "rows", "rowset", "scan", "scope", "self", "separator", "service", "shared", "skew", "skip", "smart", "soapaction", "sql", "stable", "store", "terminator", "thor", "threshold", "timelimit", "timeout", "token", "transform", "trim", "type", "unicodeorder", "unordered", "unsorted", "unstable", "update", "use", "validate", "virtual", "whole", "width", "wild", "within", "wnotrim", "xml", "xpath" ], "githubLanguage": { "fileExtensions": [ "ecl" ], "trendingProjectsCount": 0, "type": "programming", "group": "prolog", "aceMode": "prolog", "tmScope": "source.prolog.eclipse", "repos": 0, "id": "ECLiPSe" }, "githubBigQuery": { "repos": 24, "users": 24, "id": "Ecl" }, "monaco": "ecl", "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2018, "committerCount": 10, "commitCount": 63, "sampleCount": 1, "example": [ ":- lib(ic).\n\n/**\n * Question 1.11\n * vabs(?Val, ?AbsVal)\n */\nvabs(Val, AbsVal):-\n\tAbsVal #> 0,\n\t(\n\t\tVal #= AbsVal\n\t;\n\t\tVal #= -AbsVal\n\t),\n\tlabeling([Val, AbsVal]).\n\n/**\n * vabsIC(?Val, ?AbsVal)\n */\nvabsIC(Val, AbsVal):-\n\tAbsVal #> 0,\n\tVal #= AbsVal or Val #= -AbsVal,\n\tlabeling([Val, AbsVal]).\n\n/**\n * Question 1.12\n */\n% X #:: -10..10, vabs(X, Y).\n% X #:: -10..10, vabsIC(X, Y).\n\n/**\n * Question 1.13\n * faitListe(?ListVar, ?Taille, +Min, +Max)\n */\nfaitListe([], 0, _, _):-!.\nfaitListe([First|Rest], Taille, Min, Max):-\n\tFirst #:: Min..Max,\n\tTaille1 #= Taille - 1,\n\tfaitListe(Rest, Taille1, Min, Max).\n\n/**\n * Question 1.14\n * suite(?ListVar)\n */\nsuite([Xi, Xi1, Xi2]):-\n\tcheckRelation(Xi, Xi1, Xi2).\nsuite([Xi, Xi1, Xi2|Rest]):-\n\tcheckRelation(Xi, Xi1, Xi2),\n\tsuite([Xi1, Xi2|Rest]).\n\n/**\n * checkRelation(?Xi, ?Xi1, ?Xi2)\n */\ncheckRelation(Xi, Xi1, Xi2):-\n\tvabs(Xi1, VabsXi1),\n\tXi2 #= VabsXi1 - Xi.\n\n/**\n * Question 1.15\n * checkPeriode(+ListVar).\n */\n% TODO Any better solution?\ncheckPeriode(ListVar):-\n\tlength(ListVar, Length),\n\tLength < 10.\ncheckPeriode([X1, X2, X3, X4, X5, X6, X7, X8, X9, X10|Rest]):-\n\tX1 =:= X10,\n\tcheckPeriode([X2, X3, X4, X5, X6, X7, X8, X9, X10|Rest]).\n% faitListe(ListVar, 18, -9, 9), suite(ListVar), checkPeriode(ListVar). => 99 solutions\n\n\n/**\n * Tests\n */\n/*\nvabs(5, 5). => Yes\nvabs(5, -5). => No\nvabs(-5, 5). => Yes\nvabs(X, 5).\nvabs(X, AbsX). \nvabsIC(5, 5). => Yes\nvabsIC(5, -5). => No\nvabsIC(-5, 5). => Yes\nvabsIC(X, 5).\nvabsIC(X, AbsX).\n\nfaitListe(ListVar, 5, 1, 3). => 243 solutions\nfaitListe([_, _, _, _, _], Taille, 1, 3). => Taille = 5 !!!!!!!!!!!!!!!!\n\nfaitListe(ListVar, 18, -9, 9), suite(ListVar). => 99 solutions\n*/" ], "url": "https://github.com/alnkpa/sublimeprolog" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "eclipse-editor": { "title": "Eclipse", "appeared": 2001, "type": "editor", "country": [ "Canada" ], "originCommunity": [ "The Eclipse Foundation" ], "wikipedia": { "related": [ "c", "java", "linux", "solaris", "ada", "abap", "csharp", "cobol", "d", "fortran", "haskell", "javascript", "julia", "lasso", "lua", "perl", "php", "prolog", "python", "r", "ruby", "rails", "rust", "scala", "clojure", "groovy", "scheme", "erlang", "latex", "mathematica", "smalltalk", "visual-studio-editor", "uml", "sysml", "bpmn", "android", "jquery", "vala" ], "summary": "Eclipse is an integrated development environment (IDE) used in computer programming, and is the most widely used Java IDE. It contains a base workspace and an extensible plug-in system for customizing the environment. Eclipse is written mostly in Java and its primary use is for developing Java applications, but it may also be used to develop applications in other programming languages via plug-ins, including Ada, ABAP, C, C++, C#, COBOL, D, Fortran, Haskell, JavaScript, Julia, Lasso, Lua, NATURAL, Perl, PHP, Prolog, Python, R, Ruby (including Ruby on Rails framework), Rust, Scala, Clojure, Groovy, Scheme, and Erlang. It can also be used to develop documents with LaTeX (via a TeXlipse plug-in) and packages for the software Mathematica. Development environments include the Eclipse Java development tools (JDT) for Java and Scala, Eclipse CDT for C/C++, and Eclipse PDT for PHP, among others. The initial codebase originated from IBM VisualAge. The Eclipse software development kit (SDK), which includes the Java development tools, is meant for Java developers. Users can extend its abilities by installing plug-ins written for the Eclipse Platform, such as development toolkits for other programming languages, and can write and contribute their own plug-in modules. Since the introduction of the OSGi implementation (Equinox) in version 3 of Eclipse, plug-ins can be plugged-stopped dynamically and are termed (OSGI) bundlesEclipse software development kit (SDK) is free and open-source software, released under the terms of the Eclipse Public License, although it is incompatible with the GNU General Public License. It was one of the first IDEs to run under GNU Classpath and it runs without problems under IcedTea.", "pageId": 216958, "created": 2003, "backlinksCount": 1350, "revisionCount": 1707, "dailyPageViews": 1892, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Eclipse_(software)" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "ecmascript": { "title": "ECMAScript", "appeared": 1997, "type": "pl", "creators": [ "Brendan Eich" ], "documentation": [ "https://262.ecma-international.org/5.1/" ], "country": [ "Switzerland" ], "originCommunity": [ "Ecma International" ], "visualParadigm": false, "wikipedia": { "example": [ "var readWikiArticle = (content) => {\n //Read article!\n}" ], "related": [ "javascript", "actionscript", "jscript", "qtscript", "self", "hypertalk", "awk", "c", "perl", "python", "java", "scheme", "json", "regex", "csharp" ], "summary": "ECMAScript (or ES) is a trademarked scripting-language specification standardized by Ecma International in ECMA-262 and ISO/IEC 16262. It was created to standardize JavaScript, so as to foster multiple independent implementations. JavaScript has remained the best-known implementation of ECMAScript since the standard was first published, with other well-known implementations including JScript and ActionScript. ECMAScript is commonly used for client-side scripting on the World Wide Web, and it is increasingly being used for writing server applications and services using Node.js.", "created": 2003, "backlinksCount": 1269, "pageId": 188515, "revisionCount": 1547, "dailyPageViews": 1310, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/ECMAScript" }, "projectEuler": { "memberCount": { "2022": 2478 }, "id": "ECMAScript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2179", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|Packt Publishing|Learning Ecmascript 6|Prusty, Narayan|9781785884443\n2016|No Starch Press|Understanding ECMAScript 6: The Definitive Guide for JavaScript Developers|Zakas, Nicholas C.|9781593277987\n2015|Packt Publishing|Learning ECMAScript 6|Prusty, Narayan|9781785886539\n2018|Apress|Beginning Functional JavaScript: Uncover the Concepts of Functional Programming with EcmaScript 8|Aravinth, Anto and Machiraju, Srikanth|9781484240878\n2018|Manning Publications|Get Programming with JavaScript Next: New features of ECMAScript 2015, 2016, and beyond|Isaacks, J.D.|9781617294204\n2018-12-06T00:00:01Z|Apress|Beginning Functional JavaScript: Uncover the Concepts of Functional Programming with EcmaScript 8|Aravinth, Anto and Machiraju, Srikanth|9781484240861\n2017-03-10T00:00:01Z|Apress|Beginning Functional JavaScript: Functional Programming with JavaScript Using EcmaScript 6|Aravinth, Anto|9781484226551\n30-03-2018|Packt Publishing|ECMAScript Cookbook|Ross Harrison|9781788625630\n26-02-2018|Packt Publishing|Learn ECMAScript|Narayan Prusty; MEHUL MOHAN|9781788629621", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2020|Static Analysis for ECMAScript String Manipulation Programs|10.3390/app10103525|8|0|Vincenzo Arceri and Isabella Mastroeni and Sunyi Xu|fc2f20fff5ad9c164eeb4737a071559b00ac792a\n2018|EMME: a formal tool for ECMAScript Memory Model Evaluation|10.1007/978-3-319-89963-3_4|5|0|Cristian Mattarei and C. Barrett and S. Guo and Bradley S. Nelson and Ben Smith|3d0221e45832df2c861f3b7725ed70d094bea075\n2005|An ECMAScript compiler for the .NET framework|10.1109/ENC.2005.10|2|0|Cesar Lopez-Nataren and Elisa Viso-Gurovich|4782285f0f6c14d1a3f4e7e0fde023f765aa6423" }, "eco-editor": { "title": "eco-editor", "appeared": 2012, "type": "editor", "description": "Eco is a prototype editor for editing composed languages. It is not feature complete, it is not intended for production, and it does have bugs. Eco is distributed under a BSD/MIT license.", "website": "https://soft-dev.org", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/softdevteam" ], "domainName": { "name": "soft-dev.org" }, "githubRepo": { "firstCommit": 2012, "stars": 48, "forks": 11, "subscribers": 10, "created": 2015, "updated": 2022, "description": "Editor for language composition", "issues": 3, "url": "https://github.com/softdevteam/eco" } }, "ecological-metadata-language": { "title": "Ecological Metadata Language", "appeared": 1997, "type": "xmlFormat", "reference": [ "https://knb.ecoinformatics.org/external//emlparser/docs/index.html" ], "aka": [ "eml" ], "country": [ "United States" ], "originCommunity": [ "Ecological Society of America", "Knowledge Network for Biocomplexity" ], "wikipedia": { "summary": "Ecological Metadata Language (EML) is a metadata standard developed by and for the ecology discipline. It is based on prior work done by the Ecological Society of America and others, including the Knowledge Network for Biocomplexity. EML is a set of XML schema documents that allow for the structural expression of metadata. It was developed specifically to allow researchers to document a typical data set in the ecological sciences. EML is largely designed to describe digital resources, however, it may also be used to describe non-digital resources such as paper maps and other non-digital media. The Knowledge Network for Biocomplexity project has developed a software client specifically to address this need. Morpho is data management software intended for generating metadata in EML format. Morpho is part of the DataONE Investigator Toolkit, and therefore intended to facilitate data sharing and reuse among ecologists and environmental scientists.", "pageId": 2987821, "created": 2005, "backlinksCount": 10, "revisionCount": 16, "dailyPageViews": 8, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Ecological_Metadata_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ecr": { "title": "Embedded Crystal", "appeared": 2016, "type": "template", "description": "Embedded Crystal (ECR) is a template language for embedding Crystal code into other text, that includes but is not limited to HTML. The template is read and transformed at compile time and then embedded into the binary.", "website": "https://manas.tech", "reference": [ "https://crystal-lang.org/api/0.22.0/ECR.html" ], "country": [ "Argentina" ], "originCommunity": [ "Manas Technology Solutions" ], "domainName": { "name": "manas.tech" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# greeting.ecr\n<%- if @name -%>\nGreeting, <%= @name %>!\n<%- else -%>\nGreeting!\n<%- end -%>\n\nGreeting.new(nil).to_s #=> Greeting!" ], "githubRepo": { "stars": 17909, "forks": 1367, "subscribers": 416, "created": 2012, "updated": 2022, "description": "The Crystal Programming Language", "issues": 1520, "url": "https://github.com/crystal-lang/crystal/" }, "repoStats": { "firstCommit": 2012, "commits": 15519, "committers": 602, "files": 2191 }, "githubLanguage": { "fileExtensions": [ "ecr" ], "trendingProjectsCount": 0, "type": "markup", "group": "HTML", "aceMode": "text", "codemirrorMode": "htmlmixed", "codemirrorMimeType": "text/html", "tmScope": "text.html.ecr", "aliases": [ "ecr" ], "repos": 287, "id": "HTML+ECR" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 47, "commitCount": 320, "sampleCount": 1, "example": [ "<% if @name %>\n Greeting, <%= @name %>!\n<% else %>\n Greeting!\n<% end %>" ], "url": "https://github.com/atom-crystal/language-crystal" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ecsharp": { "title": "ecsharp", "appeared": 2008, "type": "pl", "website": "http://ecsharp.net/", "country": [ "Canada" ], "originCommunity": [ "https://david.loyc.net" ], "domainName": { "registered": 2014, "name": "ecsharp.net" }, "githubRepo": { "firstCommit": 2008, "stars": 149, "forks": 24, "subscribers": 11, "created": 2014, "updated": 2022, "description": "Home of LoycCore, the LES language of Loyc trees, the Enhanced C# parser, the LeMP macro preprocessor, and the LLLPG parser generator.", "issues": 32, "url": "https://github.com/qwertie/ecsharp" }, "repoStats": { "firstCommit": 2008, "commits": 1660, "committers": 8, "files": 938 } }, "ect": { "title": "ECT", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ec95c43c281fd93c42eda6d97caa1010daec2cc4" ], "country": [ "Canada and Australia" ], "originCommunity": [ "McMaster University", "IP Computer Consultants" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3700", "centralPackageRepositoryCount": 0 }, "ed-editor": { "title": "ed", "appeared": 1973, "type": "editor", "creators": [ "Ken Thompson" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "writtenIn": [ "c" ], "influencedBy": [ "qed-editor" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Ed_(text_editor)" } }, "eden": { "title": "Eden", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c2f28b26c6d27ef0cedb34aea0c69f73a39d461a" ], "country": [ "Germany and Spain" ], "originCommunity": [ "Philipps-Universit at Marburg", "Universidad Computense de Madrid" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1137", "wordRank": 9084, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2005|Parallel functional programming in Eden|10.1017/S0956796805005526|182|30|R. Loogen and Yolanda Ortega-Mallén and Ricardo Peña-Marí|ede8317bfa5ee979a459b3bb524d2c95a4940e0e\n1997|The Eden coordination model for distributed memory systems|10.1109/HIPS.1997.582964|53|2|Silvia Breitinger and R. Loogen and Yolanda Ortega-Mallén and Ricardo Peña-Marí|92e81e8223cc0e2b862fae6c8544396efadc4365\n2011|Eden - Parallel Functional Programming with Haskell|10.1007/978-3-642-32096-5_4|24|4|R. Loogen|32feaf7dc73338e84c7e0ce92bb50f8a160a245b\n1998|Implementing Eden - or: Dreams Become Reality|10.1007/3-540-48515-5_7|19|1|Ulrike Klusik and Yolanda Ortega-Mallén and Ricardo Peña-Marí|c2f28b26c6d27ef0cedb34aea0c69f73a39d461a\n1996|Eden - The Paradise of Functional Concurrent Programming|10.1007/3-540-61626-8_93|16|0|Silvia Breitinger and R. Loogen and Yolanda Ortega-Mallén and Ricardo Peña-Marí|a3552ac914fb639548f80f4bd8cd209d153e1493\n2002|Stochastic Process Algebras Meet Eden|10.1007/3-540-47884-1_3|9|0|Natalia López and M. Núñez and F. Rubio|907bc9dd105c66f61ced4625fecfa66465ccf66c\n2005|Preprocessing eden with template haskell|10.1007/11561347_24|6|1|S. Priebe|3bb1a42f126ea6c904ba92e9c8b8f8dd63c499a9\n2003|Dynamic Chunking in Eden|10.1007/978-3-540-27861-0_7|2|0|J. Berthold|2925389aab59da2267a472547be2b78876a9176f" }, "edge-side-includes": { "title": "Edge Side Includes", "appeared": 2001, "type": "pl", "country": [ "United States and New Zealand" ], "originCommunity": [ "Akamai Technologies, Inc", "Art Technology Group", "BEA Systems, Inc", "Digital Island", "FatWire Software", "Vignette Corporation" ], "wikipedia": { "example": [ "" ], "related": [ "xml", "ssi" ], "summary": "Edge Side Includes or ESI is a small markup language for edge level dynamic web content assembly. The purpose of ESI is to tackle the problem of web infrastructure scaling. It is an application of edge computing. It is fairly common for websites to have generated content. It could be because of changing content like catalogs or forums, or because of personalization. This creates a problem for caching systems. To overcome this problem a group of companies (Akamai, Art Technology Group, BEA Systems, Circadence Corporation, Digital Island, Inc., Interwoven, Inc., Open Market, whose ESI-related technology is now owned by FatWire Software, Oracle Corporation and Vignette Corporation) developed the ESI specification and submitted it to the W3C for approval. The proposal editor was Mark Nottingham. ESI Language Specification 1.0 was submitted to the World Wide Web Consortium (W3C) for approval in August 2001. The W3C has acknowledged receipt, but has not accepted the proposal.ESI is implemented by some content delivery networks, such as Akamai, and by some caching proxy servers such as Varnish, Squid and Mongrel ESI, although many do not implement the complete specification. Akamai also adds additional features to the version they support.", "created": 2005, "backlinksCount": 11, "pageId": 2854471, "revisionCount": 100, "dailyPageViews": 69, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Edge_Side_Includes" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "edgedb": { "title": "edgedb", "appeared": 2017, "type": "database", "website": "https://edgedb.com", "country": [ "United States" ], "originCommunity": [ "https://github.com/edgedb" ], "domainName": { "registered": 2014, "awisRank": { "2022": 571163 }, "name": "edgedb.com" }, "githubRepo": { "firstCommit": 2008, "stars": 7989, "forks": 225, "subscribers": 90, "created": 2017, "updated": 2022, "description": "A next-generation graph-relational database.", "issues": 237, "url": "https://github.com/edgedb/edgedb" }, "repoStats": { "firstCommit": 2008, "commits": 8435, "committers": 117, "files": 1033 } }, "edgelisp": { "title": "edgelisp", "appeared": 2008, "type": "pl", "creators": [ "Manuel Simoni" ], "website": "http://manuel.github.com/edgelisp/repl.html", "country": [ "Austria" ], "originCommunity": [ "https://github.com/manuel" ], "githubRepo": { "firstCommit": 2008, "stars": 119, "forks": 5, "subscribers": 8, "created": 2008, "updated": 2022, "description": "A Lisp->JavaScript compiler", "issues": 0, "url": "https://github.com/manuel/edgelisp" }, "repoStats": { "firstCommit": 2008, "commits": 613, "committers": 1, "files": 29 } }, "edgeql": { "title": "edgeql", "appeared": 2017, "type": "queryLanguage", "description": "EdgeQL is the primary language of EdgeDB. It is used to define, mutate, and query data.", "website": "https://www.edgedb.com", "reference": [ "https://www.edgedb.com/showcase/edgeql" ], "country": [ "United States" ], "originCommunity": [ "EdgeDB Inc" ], "domainName": { "name": "edgedb.com" }, "example": [ "SELECT User FILTER User.name = 'John';" ] }, "edh": { "title": "Đ", "appeared": 2019, "type": "pl", "creators": [ "Compl Yue" ], "description": "Edh is a dynamically & strongly typed, procedural (thus imperative), value-oriented (i.e. immutable first, yet with non-traditional Object constructs), interpreted programming language, that parasitic on GHC and heavily relying on the Haskell implementation of Software Transactional Memory for unified intuition of concurrency and data-consistency.", "website": "https://github.com/e-wrks/edh", "aka": [ "edh" ], "country": [ "China" ], "originCommunity": [ "https://github.com/e-wrks" ], "example": [ "method satExample() or ({generator _ ()\n for x1 from [true, false] do\n for x2 from [true, false] do\n # ...\n for xN from [true, false] do\n yield formula (\n x1, x2,\n # ...,\n xn\n )\n})" ], "githubRepo": { "firstCommit": 2019, "stars": 27, "subscribers": 5, "created": 2020, "updated": 2020, "description": "Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++", "forks": 5, "issues": 0, "url": "https://github.com/e-wrks/edh" }, "repoStats": { "firstCommit": 2020, "commits": 1446, "committers": 2, "files": 156 } }, "edina": { "title": "Edina", "appeared": 2022, "type": "pl", "creators": [ "Cerus" ], "description": "First look at Edina, a simple Forth-like compiled language", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wl5snx/first_look_at_edina_a_simple_forthlike_compiled/" ], "country": [ "Germany" ], "originCommunity": [ "https://cerus.dev" ], "githubRepo": { "firstCommit": 2022, "stars": 9, "forks": 0, "subscribers": 0, "created": 2022, "updated": 2022, "description": "Edina - A simple stack-oriented compiled programming language.", "issues": 0, "url": "https://github.com/cerus/edina" }, "repoStats": { "firstCommit": 2022, "commits": 42, "committers": 2, "files": 124 } }, "edinburgh-imp": { "title": "Edinburgh IMP", "appeared": 2002, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Edinburgh" ], "wikipedia": { "related": [ "algol", "imp" ], "summary": "Edinburgh IMP is a development of ATLAS Autocode, initially developed around 1966-1969 at Edinburgh University, Scotland. IMP was a general-purpose programming language which was used heavily for systems programming. Expressively, IMP is extremely similar to Algol and includes all the Algol-style block structure, reserved keywords, and datatypes such as arrays and records. It adds to Algol-style languages a string type (akin to a flex array of char) and built-in operators for string manipulation and character handling. IMP provides significant control over the storage mapping of data, plus commands for addressing within parts of words. Most IMP compilers offer compiler-generated run-time checks and a backtrace facility by default, even in production code. IMP allows the programmer to inline machine language instructions in the IMP source code. Early IMP compilers were developed for the English Electric KDF9, ICL System 4, UNIVAC 1108, IBM 360, DEC PDP-9, DEC PDP-15 and CTL Modular One computers. IMP was used to implement the EMAS operating system. In later years a version of IMP called IMP77 was developed by Peter Robertson within the Computer Science department at Edinburgh which was a portable compiler that brought IMP to even more platforms. In 2002 the IMP77 language was resurrected by the Edinburgh Computer History Project for Intel x86 hardware running DOS, Windows and Linux and is once again in use by Edinburgh graduates and ex-pats. The diverged IMP and IMP77 were later consolidated into a single language with the introduction of the IMP80 standard supported by implementations from the Edinburgh Regional Computer Centre. IMP80 has also been ported to several platforms including Intel and was actively in use into the 1990s. Edinburgh IMP is unrelated to the later IMP extensible syntax programming language developed by Irons for the CDC 6600, which was the main language used by the NSA for many years.", "pageId": 953419, "created": 2004, "backlinksCount": 20, "revisionCount": 44, "dailyPageViews": 9, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Edinburgh_IMP" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "edinburgh-lcf": { "title": "Edinburgh LCF", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fc7a2878a4edea597992902e84b2adea9bbc758d" ], "country": [ "Poland" ], "originCommunity": [ "Polish Academy of Sciences" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8177", "centralPackageRepositoryCount": 0 }, "edison": { "title": "Edison", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/669fd00160e4015f9d0e7fa073b81ea2eb2515de" ], "country": [ "France" ], "originCommunity": [ "Institut de Recherche Polytechnique" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1684", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|W. W. Norton & Company|The Big Switch: Rewiring the World, from Edison to Google|Carr, Nicholas|9780393062281\n2009|W. W. Norton & Company|The Big Switch: Rewiring the World, from Edison to Google|Carr, Nicholas|9780393333947\n30-05-2017|Packt Publishing|Intel Edison Projects|Avirup Basu|9781787283626\n20151103|O'Reilly Media, Inc.|Getting Started with Intel Edison|Stephanie Moyerman|9781457187575\n20151103|O'Reilly Media, Inc.|Getting Started with Intel Edison|Stephanie Moyerman|9781457187551" }, "edje-data-collection": { "title": "Edje Data Collection", "appeared": 2010, "type": "jsonFormat", "description": "An Edje Data Collection, it's a plain text file (normally identified with the .edc extension), consisting of instructions for the Edje Compiler.", "reference": [ "https://phab.enlightenment.org/w/edjebasics/" ], "country": [ "Various" ], "originCommunity": [ "Enlightenment development team" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubLanguage": { "fileExtensions": [ "edc" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-c++src", "tmScope": "source.c++", "repos": 30865, "id": "Edje Data Collection" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 11, "commitCount": 21, "sampleCount": 1, "example": [ "// https://raw.githubusercontent.com/billiob/terminology/master/data/themes/mild.edc\n/* overlay to default to make theme easier on the eyes, less effects */\n\n#ifndef BG_COLOR\n#define BG_COLOR 48 48 48 255\n#endif\n\n#ifndef BG_COLOR_TRANSLUCENT\n#define BG_COLOR_TRANSLUCENT 48 48 48 200\n#endif\n\n#ifndef BELL_OVERLAY_COLOR\n#define BELL_OVERLAY_COLOR 220 220 220 16\n#endif\n\n\ncollections {\n group { name: \"terminology/background\";\n\n#ifndef INHERIT_PROVIDE_OWN_COLORS\n color_classes {\n#include \"default_colors.in.edc\"\n }\n#endif\n\n images {\n image: \"bg_bevel.png\" COMP;\n image: \"bg_shine.png\" COMP;\n image: \"bg_glint.png\" COMP;\n image: \"bg_led_base.png\" COMP;\n image: \"bg_led.png\" COMP;\n image: \"bg_led_strobe.png\" COMP;\n image: \"pm_shadow.png\" COMP;\n image: \"pm_overlay.png\" COMP;\n image: \"pm_fill.png\" COMP;\n image: \"tab_bg_l0.png\" COMP;\n image: \"tab_bg_l1.png\" COMP;\n image: \"tab_bg_r0.png\" COMP;\n image: \"tab_bg_r1.png\" COMP;\n image: \"tab_shad_l0.png\" COMP;\n image: \"tab_shad_l1.png\" COMP;\n image: \"tab_shad_r0.png\" COMP;\n image: \"tab_shad_r1.png\" COMP;\n }\n sounds {\n sample { name: \"bell\" LOSSY 64;\n source: \"bell.wav\";\n }\n }\n\n script {\n public message(Msg_Type:type, id, ...) {\n new r, g, b, a, v;\n\n if ((type != MSG_INT) || (id != 1)) return;\n\n v = (getarg(2) * 255) / 100;\n\n custom_state(PART:\"base\", \"default\", 0.0);\n get_state_val(PART:\"base\", STATE_COLOR, r, g, b, a);\n set_state_val(PART:\"base\", STATE_COLOR, r, g, b, v);\n set_state(PART:\"base\", \"custom\", 0.0);\n\n custom_state(PART:\"fade\", \"default\", 0.0);\n get_state_val(PART:\"fade\", STATE_COLOR, r, g, b, a);\n set_state_val(PART:\"fade\", STATE_COLOR, r, g, b, v);\n set_state(PART:\"fade\", \"custom\", 0.0);\n }\n }\n\n pa" ], "url": "https://github.com/textmate/json.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "edn": { "title": "EDN", "appeared": 2012, "type": "dataNotation", "documentation": [ "https://learnxinyminutes.com/docs/edn/#:~:text=Extensible%20Data%20Notation%20(EDN)%20is,restricted%20to%20data%2C%20no%20code." ], "standsFor": "Extensible Data Notation", "aka": [ "edn" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/edn-format" ], "hasBooleans": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "hasLists": { "example": "", "value": true }, "hasMaps": { "example": "", "value": true }, "hasSets": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "example": [ "{:a 1, \"foo\" :bar, [1 2 3] four}" ], "githubRepo": { "firstCommit": 2012, "stars": 2351, "forks": 96, "subscribers": 99, "created": 2012, "updated": 2022, "description": "Extensible Data Notation", "issues": 25, "url": "https://github.com/edn-format/edn" }, "repoStats": { "firstCommit": 2012, "commits": 29, "committers": 4, "files": 1 }, "githubLanguage": { "fileExtensions": [ "edn" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "clojure", "codemirrorMode": "clojure", "codemirrorMimeType": "text/x-clojure", "tmScope": "source.clojure", "repos": 0, "id": "edn" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 36, "commitCount": 149, "sampleCount": 1, "example": [ "[{:db/id #db/id [db.part/db]\n :db/ident :object/name\n :db/doc \"Name of a Solar System object.\"\n :db/valueType :db.type/string\n :db/index true\n :db/cardinality :db.cardinality/one\n :db.install/_attribute :db.part/db}\n {:db/id #db/id [db.part/db]\n :db/ident :object/meanRadius\n :db/doc \"Mean radius of an object.\"\n :db/index true\n :db/valueType :db.type/double\n :db/cardinality :db.cardinality/one\n :db.install/_attribute :db.part/db}\n {:db/id #db/id [db.part/db]\n :db/ident :data/source\n :db/doc \"Source of the data in a transaction.\"\n :db/valueType :db.type/string\n :db/index true\n :db/cardinality :db.cardinality/one\n :db.install/_attribute :db.part/db}]\n[{:db/id #db/id [db.part/tx]\n :db/doc \"Solar system objects bigger than Pluto.\"}\n {:db/id #db/id [db.part/tx]\n :data/source \"http://en.wikipedia.org/wiki/List_of_Solar_System_objects_by_size\"}\n {:db/id #db/id [db.part/user]\n :object/name \"Sun\"\n :object/meanRadius 696000.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Jupiter\"\n :object/meanRadius 69911.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Saturn\"\n :object/meanRadius 58232.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Uranus\"\n :object/meanRadius 25362.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Neptune\"\n :object/meanRadius 24622.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Earth\"\n :object/meanRadius 6371.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Venus\"\n :object/meanRadius 6051.8}\n {:db/id #db/id [db.part/user]\n :object/name \"Mars\"\n :object/meanRadius 3390.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Ganymede\"\n :object/meanRadius 2631.2}\n {:db/id #db/id [db.part/user]\n :object/name \"Titan\"\n :object/meanRadius 2576.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Mercury\"\n :object/meanRadius 2439.7}\n {:db/id #db/id [db.part/user]\n :object/name \"Callisto\"\n :object/meanRadius 2410.3}\n {:db/id #db/id [db.part/user]\n :object/name \"Io\"\n :object/meanRadius 1821.5}\n {:db/id #db/id [db.part/user]\n :object/name \"Moon\"\n :object/meanRadius 1737.1}\n {:db/id #db/id [db.part/user]\n :object/name \"Europa\"\n :object/meanRadius 1561.0}\n {:db/id #db/id [db.part/user]\n :object/name \"Triton\"\n :object/meanRadius 1353.4}\n {:db/id #db/id [db.part/user]\n :object/name \"Eris\"\n :object/meanRadius 1163.0}]" ], "url": "https://github.com/atom/language-clojure" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011|MC GRAW HILL INDIA|Parallel Programming In C With Mpi And Open Mp, 1St Edn|QUINN|9780070582019\n2009|Vikas Publication House Pvt Ltd|Business Mathematics - 2Nd Edn [Paperback] [Jan 01, 2009] Q. Zameeruddin|Q Zameeruddin|9788125928416\n20150219|Pearson International Content|eBook Business Information Systems, 5 edn|Paul Bocij; Andrew Greasley; Simon Hickie|9780273736462" }, "edsac-initial-orders": { "title": "EDSAC Initial Orders", "appeared": 1948, "type": "assembly", "creators": [ "David Wheeler", "Maurice Wilkes", "Stanley Gill" ], "reference": [ "https://en.wikipedia.org/wiki/EDSAC" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3411" }, "edscript": { "title": "ed script", "appeared": 1973, "type": "diffFormat", "description": "diff can produce commands that direct the ed text editor to change the first file into the second file. These are often called \"ed scripts\".", "related": [ "ed-editor" ], "example": [ "a\ned is the standard Unix text editor.\nThis is line number two.\n.\n2i\n \n.\n,l" ] }, "edsim": { "title": "EDSIM", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/20ece707a8fd8cb19c2f549eeb71808fc90c6d54" ], "country": [ "United Kingdom" ], "originCommunity": [ "Leicester Polytechnic" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4918", "centralPackageRepositoryCount": 0 }, "educe-star": { "title": "EDUCE*", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5e020341bdacbcdbb98368ca5323dcafea3ca64e" ], "country": [ "Germany" ], "originCommunity": [ "European Computer-Industry Research Centre GmbH" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3563", "centralPackageRepositoryCount": 0 }, "educe": { "title": "EDUCE", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/11c77949d14b4f18113f154e34145405fa5d8e92" ], "country": [ "Germany" ], "originCommunity": [ "European Computer-Industry Research Centre GmbH" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3562", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1986|On the evaluation strategy of EDUCE|10.1145/16894.16890|54|0|J. Bocca|11c77949d14b4f18113f154e34145405fa5d8e92" }, "eex": { "title": "EEX", "appeared": 2012, "type": "template", "description": "EEx stands for Embedded Elixir. It allows you to embed Elixir code inside a string in a robust way.", "website": "https://hexdocs.pm/eex/EEx.html", "reference": [ "https://github.com/elixir-lang/elixir/commits/master/lib/eex/lib/eex.ex" ], "country": [ "Various" ], "originCommunity": [ "Elixir Team" ], "example": [ "<%= if true do %>\n It is obviously true\n<% else %>\n This will never appear\n<% end %>" ], "githubLanguage": { "fileExtensions": [ "eex", "htmlheex", "htmlleex" ], "trendingProjectsCount": 0, "type": "markup", "group": "HTML", "aceMode": "text", "codemirrorMode": "htmlmixed", "codemirrorMimeType": "text/html", "tmScope": "text.html.elixir", "aliases": [ "eex", "heex", "leex" ], "repos": 34, "id": "HTML+EEX" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2018, "committerCount": 47, "commitCount": 278, "sampleCount": 1, "example": [ "

Listing Books

\n \n
\n \n \n \n \n \n \n \n\n<%= for book <- @books do %>\n \n <%# comment %>\n \n \n \n \n \n \n<% end %>\n
TitleSummary
<%= book.title %><%= book.content %><%= link \"Show\", to: book_path(@conn, :show, book) %><%= link \"Edit\", to: book_path(@conn, :edit, book) %><%= link \"Delete\", to: book_path(@conn, :delete, book), method: :delete, data: [confirm: \"Are you sure?\"] %>
\n \n
\n \n<%= link \"New book\", to: book_path(@conn, :new) %>" ], "url": "https://github.com/elixir-lang/elixir-tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "eff": { "title": "eff", "appeared": 2012, "type": "pl", "website": "https://www.eff-lang.org/", "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "domainName": { "registered": 2012, "name": "eff-lang.org" }, "githubRepo": { "firstCommit": 2012, "stars": 751, "forks": 39, "subscribers": 32, "created": 2012, "updated": 2022, "description": "A functional programming language based on algebraic effect handlers", "issues": 5, "url": "https://github.com/matijapretnar/eff" }, "repoStats": { "firstCommit": 2012, "commits": 2493, "committers": 24, "files": 392 }, "isbndb": "" }, "efl": { "title": "EFL", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/be7e15ab76865c4841a910d157ab5c43627ee7c6" ], "country": [ "United States" ], "originCommunity": [ "Bell Laboratories" ], "supersetOf": [ "ratfor" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1996", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Implementing Mobile-Assisted Language Learning (MALL) in an EFL Context: Iranian EFL Teachers' Perspectives on Challenges and Affordances.|10.29140/JALTCALL.V9N2.153|41|3|Reza Dashtestani|c137596e08d39acb9ba869fab7ef0460b3320bbd\n2014|The EFL Students' Problems in Answering the Test of English as a Foreign Language (TOEFL): A Study in Indonesian Context|10.4304/TPLS.4.12.2581-2587|38|12|M. Mahmud|75021186636a2785d2a85829f0d0ccca3c997124\n2015|Mobile-assisted language learning: effects on EFL vocabulary learning|10.1504/IJMC.2015.070060|20|1|Yen-Hui Wang and Steve Kuang-Hsun Shih|ca09a1cae98aa87dcd2a268493b1b18e323cb639\n2016|THE IMPACT OF E-LEARNING ON IMPROVING IRANIAN EFL LEARNERS’ LANGUAGE SKILLS: DECREASING LEARNING ANXIETY|10.4314/JFAS.V8I3S.180|9|0|M. A. J. Shahi|074d871bde90aa9be8eaf462a0d0b283bd92cd7e\n2015|Investigating the Relationship between Iranian EFL Teachers’ Autonomy and Their Neuro-Linguistic Programming|10.5539/ELT.V8N7P68|7|1|Ehsan Hosseinzadeh and Abdollah Baradaran|e94330a78777ac571360d87c5efcd9ea63a64dd9\n2015|Bridging the gap between education and employment: English language instruction in EFL contexts|10.3726/978-3-0351-0842-2|6|1|R. Al-Mahrooqi and C. Denman|0a148cc70c310f80a20e583f24ba11380f519352\n2017|Translation Skill in Language Learning/ Teaching: EFL Learners’ Point of View|10.5755/J01.SAL.0.29.14580|5|1|Elisabet Titik Murtisari|2f7ada11abe2a375daa06ef3dd31802c931fc5d7\n2020|The EFL-YouTube remix: Empowering multimodal and computational literacies for EFL purposes|10.1080/1051144X.2020.1826220|5|2|Volker Eisenlauer|32130b4157cf6f72f92462b257024466b2446cc8\n1978|The programming language EFL|10.1145/1053417.806435|4|0|S. Feldman|be7e15ab76865c4841a910d157ab5c43627ee7c6\n2017|In-service EFL Teacher Development for Technology Integration in Communicative Language Teaching|10.24203/AJEEL.V5I2.4465|3|0|Thooptong Kwangsawad|3e37036dc042a38bf9cfa935202d2ec638fc51d4" }, "egel": { "title": "egel", "appeared": 2016, "type": "interpreter", "description": "Egel An interpreter for eager untyped combinator rewriting implemented in C++.", "website": "https://egel-lang.github.io/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/egel-lang" ], "domainName": { "name": "egel-lang.github.io" }, "githubRepo": { "firstCommit": 2016, "stars": 68, "forks": 4, "subscribers": 2, "created": 2016, "updated": 2022, "description": "The Egel Programming Language", "issues": 2, "url": "https://github.com/egel-lang/egel" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Egel", "tryItOnline": "egel", "twitter": "https://twitter.com/egel_language", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "egison": { "title": "Egison", "appeared": 2013, "type": "pl", "creators": [ "Satoshi Egi" ], "website": "https://www.egison.org/", "fileExtensions": [ "egi" ], "country": [ "Japan" ], "originCommunity": [ "University of Tokyo" ], "hasPatternMatching": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "keywords": [ "as", "integer", "list", "matchAll", "multiset", "set", "with" ], "example": [ "-- Extract all twin primes from the infinite list of prime numbers with pattern matching!\ndef twinPrimes :=\n matchAll primes as list integer with\n | _ ++ $p :: #(p + 2) :: _ -> (p, p + 2)" ], "githubRepo": { "stars": 854, "forks": 33, "subscribers": 44, "description": "The Egison Programming Language", "created": 2013, "updated": 2022, "url": "https://github.com/egison/egison/" }, "repoStats": { "firstCommit": 2013, "commits": 3810, "committers": 33, "files": 348 } }, "egl": { "title": "EGL", "appeared": 2008, "type": "pl", "standsFor": "Enterprise Generation Language", "originCommunity": [ "IBM" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "SysLib.writeStdout" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "1 package com.mycompany.ui;\n 2 \n 3 import com.mycompany.services.Employee;\n 4 import com.mycompany.services.EmployeeService;\n 5 import dojo.widgets.DojoGrid;\n 6 import dojo.widgets.DojoGridColumn;\n 7 \n 8 handler EmployeeView type RUIhandler { initialUI = [ grid ], \n 9 onConstructionFunction = start, \n10 cssFile = \"main.css\" }\n11 \n12 grid DojoGrid { behaviors = [ ], headerBehaviors = [ ], columns = [\n13 new DojoGridColumn { displayName = \"First Name\", name = \"FIRSTNAME\" },\n14 new DojoGridColumn { displayName = \"Last Name\", name = \"LASTNAME\" },\n15 new DojoGridColumn { displayName = \"Salary\", name = \"SALARY\" }\n16 ] };\n17 \n18 function start()\n19 svc EmployeeService { };\n20 call svc.getEmployees () returning to displayEmployees;\n21 end\n22 \n23 function displayEmployees(retResult Employee [ ] in)\n24 grid.data = retResult as any [ ];\n25 end\n26 \n27 end" ], "related": [ "java", "cobol", "c", "uml", "javascript", "jvm", "linux", "systemz", "soap", "ibm-rpg" ], "summary": "EGL (Enterprise Generation Language), originally developed by IBM and now available as the EDT (EGL Development Tools) Open Source project under the Eclipse Public License (EPL), is a programming technology designed to meet the challenges of modern, multi-platform application development by providing a common language and programming model across languages, frameworks, and runtime platforms. The language borrows concepts familiar to anyone using statically typed languages like Java, COBOL, C, etc. However, it borrows the concept of stereotype from Unified Modeling Language (UML) that is not typically found in statically typed programming languages. In a nutshell, EGL is a higher-level, universal application development language. EGL is similar in syntax to other common languages so it can be learned by application developers with similar previous programming background. EGL application development abstractions shield programmers from the technical interfaces of systems and middleware allowing them to focus on building business functionality. EGL applications and services are written, tested and debugged at the EGL source level, and once they are satisfactorily functionally tested they can be compiled into COBOL, Java, or JavaScript code to support deployment of business applications that can run in any of the following environments: Platforms with a Java virtual machine, such as Microsoft Windows, Linux, and UNIX, for example in the context of a Java EE servlet container (IBM WebSphere Application Server, Apache Tomcat, GlassFish) IBM System z: CICS Transaction Server, IMS, z/OS Batch, UNIX System Services, WebSphere Application Server, z/VSE, Linux IBM System i: IBM i5/OS, IBM WebSphere Application Server, Apache Tomcat, Integrated Web Application Server for i Web browsers supporting JavaScript, such as Internet Explorer, Firefox, and Safari, for Ajax rich web applications", "pageId": 1205107, "dailyPageViews": 26, "created": 2004, "backlinksCount": 14, "revisionCount": 104, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/EGL_(programming_language)" }, "leachim6": { "filepath": "e/Egl.egl", "fileExtensions": [ "egl" ], "example": [ "program HelloWorld\n function main()\n SysLib.writeStdout(\"Hello World\");\n end\nend\n" ], "id": "Egl" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:EGL", "tiobe": { "id": "EGL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7930", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nIBM Rational Business Developer with EGL|2008|Ben Margolis|6568310|2.00|2|0" }, "egs4": { "title": "EGS4", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0a787bf91ff0e9c5b89d78e7b929744142e61c58" ], "country": [ "Canada" ], "originCommunity": [ "The National Research Council Canada" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7898", "centralPackageRepositoryCount": 0 }, "eiffel": { "title": "Eiffel", "appeared": 1986, "type": "pl", "creators": [ "Bertrand Meyer" ], "website": "https://dev.eiffel.com/Main_Page", "documentation": [ "https://www.eiffel.org/documentation" ], "reference": [ "https://www.eiffel.org/doc/eiffel/Eiffel_programming_language_syntax" ], "fileExtensions": [ "e" ], "country": [ "Various" ], "originCommunity": [ "Eiffel Software" ], "domainName": { "registered": 2001, "awisRank": { "2022": 2460343 }, "name": "eiffel.org" }, "releaseNotesUrl": "https://www.eiffel.org/doc/eiffelstudio/EiffelStudio_release_notes", "hasPointers": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasMultipleInheritance": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "-- 0[cC][0-7]+", "value": true }, "hasHexadecimals": { "example": "-- 0[xX][a-fA-F0-9]+", "value": true }, "hasFloats": { "example": "-- ([0-9]+\\.[0-9]*)|([0-9]*\\.[0-9]+)", "value": true }, "hasIntegers": { "example": "-- [0-9]+", "value": true }, "hasBinaryNumbers": { "example": "-- 0[bB][01]+", "value": true }, "lineCommentToken": [ [ "--" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 39, "forks": 24, "subscribers": 13, "created": 2016, "updated": 2023, "description": "Public mirror of https://svn.eiffel.com/eiffelstudio-public/trunk, see https://github.com/EiffelSoftware/libraries for libraries", "issues": 3, "url": "https://github.com/EiffelSoftware/EiffelStudio" }, "repoStats": { "firstCommit": 1993, "commits": 97200, "committers": 107, "files": 73291 }, "wikipedia": { "example": [ "class\n HELLO_WORLD\ncreate\n make\nfeature\n make\n do\n print (\"Hello, world!\")\n end\nend" ], "related": [ "freebsd", "linux", "solaris", "ada", "simula", "z-notation", "csharp", "d", "java", "lisaac", "racket", "ruby", "sather", "scala", "algol", "pascal", "visual-studio-editor", "isbn", "smalltalk", "c", "cil", "java-bytecode" ], "summary": "Eiffel is an object-oriented programming language designed by Bertrand Meyer (an object-orientation proponent and author of Object-Oriented Software Construction) and Eiffel Software. Meyer conceived the language in 1985 with the goal of increasing the reliability of commercial software development; the first version becoming available in 1986. In 2005, Eiffel became an ISO-standardized language. The design of the language is closely connected with the Eiffel programming method. Both are based on a set of principles, including design by contract, command–query separation, the uniform-access principle, the single-choice principle, the open–closed principle, and option–operand separation. Many concepts initially introduced by Eiffel later found their way into Java, C#, and other languages. New language design ideas, particularly through the Ecma/ISO standardization process, continue to be incorporated into the Eiffel language.", "pageId": 9838, "dailyPageViews": 240, "created": 2001, "backlinksCount": 262, "revisionCount": 909, "appeared": 1986, "fileExtensions": [ "e" ], "url": "https://en.wikipedia.org/wiki/Eiffel_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "e" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "eiffel", "codemirrorMode": "eiffel", "codemirrorMimeType": "text/x-eiffel", "tmScope": "source.eiffel", "repos": 913, "id": "Eiffel" }, "githubBigQuery": { "repos": 721, "users": 653, "id": "Eiffel" }, "codeMirror": "eiffel", "pygmentsHighlighter": { "filename": "eiffel.py", "fileExtensions": [ "e" ], "id": "Eiffel" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2011, "committerCount": 4, "commitCount": 13, "sampleCount": 3, "example": [ "note\n\tdescription: \"Git checkout command.\"\n\tauthor: \"Olivier Ligot\"\n\nclass\n\tGIT_CHECKOUT_COMMAND\n\ninherit\n\tGIT_COMMAND\n\ncreate\n\tmake,\n\tmake_master\n\nfeature {NONE} -- Initialization\n\n\tmake (a_branch: STRING)\n\t\t\t-- Checkout the branch `a_branch'.\n\t\tdo\n\t\t\tinitialize\n\t\t\targuments.force_last (a_branch)\n\t\t\tbranch := a_branch\n\t\tensure\n\t\t\tbranch_set: branch = a_branch\n\t\tend\n\n\tmake_master\n\t\t\t-- Checkout the master branch.\n\t\tdo\n\t\t\tmake (\"master\")\n\t\tend\n\nfeature -- Access\n\n\tbranch: STRING\n\t\t\t-- Branch to checkout\n\n\tname: STRING = \"checkout\"\n\t\t\t-- Git subcommand name\n\nend\n" ], "url": "https://github.com/textmate/eiffel.tmbundle" }, "helloWorldCollection": [ "note \"Hello World in Eiffel\"\nclass HELLO\ncreate run\nfeature run\n do\n print (\"Hello World!%N\")\n end\nend\n" ], "leachim6": { "filepath": "e/Eiffel.eiff", "fileExtensions": [ "eiff" ], "example": [ "indexing \"Hello World in Eiffel , from http://roesler-ac.de/wolfram/hello.htm#Eiffel\"\n\nclass HELLO\n\ncreation\n\trun\n\nfeature\n\n\trun is\n\t\tlocal\n\t\t\tio : BASIC_IO;\n\t\tdo\n\t\t\t!!io;\n\t\t\tio.put_string(\"Hello World\");\n\t\t\tio.put_newline\n\t\tend; -- run\nend; -- class HELLO\n" ], "id": "Eiffel" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Eiffel", "officialBlogUrl": [ "https://www.eiffel.org/blogs" ], "downloadPageUrl": [ "https://www.eiffel.org/downloads" ], "tiobe": { "id": "Eiffel" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1220", "twitter": "https://twitter.com/eiffel_language", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1995|Addison-Wesley|Object-Oriented Programming in Eiffel (International Computer Science Series)|Thomas, Peter G. and Weedon, Raymond A.|9780201593877\n1991|Prentice Hall|Eiffel : The Language (PRENTICE HALL OBJECT-ORIENTED SERIES)|Meyer, Bertrand|9780132479257\n1995|Palgrave HE UK|Eiffel Object-Oriented Programming|Tyrrell, A.J.|9780333645543\n2008|Pearson|An Object-Oriented Introduction to Computer Science Using Eiffel|Wiener, Richard|9780131838727\n1997|Prentice Hall|Object Technology for Scientific Computing: Object-Oriented Numerical Software in Eiffel and C (Prentice Hall Object-Oriented Series)|Dubois, Paul F.|9780132678087\n2008|Pearson|Object-Oriented Introduction to Data Structures Using Eiffel|Wiener, Richard|9780131855885\n1997|Addison-Wesley|Object-Oriented Programming in Eiffel (2nd Edition) (International Computer Science Series)|Thomas, P. and Weedon, Ray|9780201331318\n2000|Prentice Hall|Windows Programming Made Easy: Using Object Technology, COM, and the Windows Eiffel Library|Maughan, Glenn and Simon, Raphael|9780130289773\n20151230|Bloomsbury UK|Eiffel Object-Oriented Programming|A.J. Tyrrell|9781349138753\n1995|Prentice Hall|Object Oriented Programming In Eiffel|Robert Rist and Robert Terwilliger|9780132059312", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2001|The .NET Contract Wizard: adding Design by Contract to languages other than Eiffel|10.1109/TOOLS.2001.941655|48|1|Karine Arnout and Raphael Simon|d83b6439361c65f0fcbdf2b4e0226c3ff6a67549\n2011|A Refactoring Constraint Language and Its Application to Eiffel|10.1007/978-3-642-22655-7_13|31|3|F. Steimann and Christian Kollee and Jens Henning von Pilgrim|4b697347a0c3bb777507afb2f16dde238e71df10\n1990|Eiffel Linda: an object-oriented Linda dialect|10.1145/122193.122199|25|0|Robert Jellinghaus|acd7766cd77fa70b7816831ef6fd7d31a196cd92\n1994|From MooZ to Eiffel - A Rigorous Approach to System Development|10.1007/3-540-58555-9_102|9|0|Virgínia A. O. Cordeiro and A. Sampaio and S. Meira|91e08ceefe330c9604955973bef08d4f0c7f869b\n2011|Automated Translation of Java Source Code to Eiffel|10.1007/978-3-642-21952-8_4|8|0|Marco Trudel and M. Oriol and Carlo A. Furia and M. Nordio|eb6ea3708feb35cbed41eda76ccd62d1f7b4b364\n2009|Cameo: an alternative model of concurrency for Eiffel|10.1007/s00165-008-0096-1|6|0|P. Brooke and R. Paige|725ab15b853bb5b7306a601539f839a4f1d3c8e8\n1994|FLOO: A Strong Coupling Between Eiffel Language and 02 DBMS|10.1142/9789812831163_0014|4|0|R. Chignoli and J. Farré and Philippe Lahire and R. Rousseau|7c1d2e732791df18daf2efb61bcd0670036359c7\n1997|Eiffel in Lehre und Forschung –  Erfahrungen und Perspektiven|10.1007/s002870050078|2|0|Michael Rybe and Stefan Leboch|11390a69d1e7f4daadbedc5cc6680768fba27438\n1999|Experiences Teaching Eiffel as a First Programming Language to Economy Students|10.1109/TOOLS.1999.10060|2|0|G. Dedene|99bbe1714f80e75a7cdb280280fb3cc797ed8f97\n2012|Bertrand Meyer: Software Engineering and the Eiffel Programming Language|10.1109/MC.2012.299|2|1|C. Severance|b0bbfedfd5d842a7da41b1c171c41221d568761c\n2018|Mapping Event-B Machines into Eiffel Programming Language|10.1007/978-3-030-14687-0_23|2|0|V. Rivera and Jooyoung Lee and M. Mazzara|443e48249684dc85951aec996bbad84f729b727a\n2018|Translation from Event-B into Eiffel|10.18255/1818-1015-2018-6-623-636|1|0|Sofia Reznikova and V. Rivera and Joo Young Lee and M. Mazzara|99272bfe795dd435d057c7aa2255fe5f8c340584" }, "ejs": { "title": "EJS", "appeared": 2010, "type": "template", "creators": [ "Tj Holowaychuk" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://apex.sh" ], "example": [ "<% if (user) { %>\n

<%= user.name %>

\n<% } %>" ], "githubRepo": { "firstCommit": 2010, "stars": 4441, "forks": 540, "subscribers": 140, "created": 2010, "updated": 2022, "description": "Embedded JavaScript templates for node", "issues": 104, "url": "https://github.com/tj/ejs" }, "repoStats": { "firstCommit": 2010, "commits": 228, "committers": 35, "files": 50 }, "githubLanguage": { "fileExtensions": [ "ejs", "ect", "ejst", "jst" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "ejs", "tmScope": "text.html.js", "repos": 92857, "id": "EJS" }, "githubBigQuery": { "repos": 614, "users": 560, "id": "EJS" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2016, "committerCount": 3, "commitCount": 5, "sampleCount": 2, "example": [ "<% include parts/depend %>\n\n
\n <% if (user.primaryAccount == \"teacher\") { %>\n <% include teacher/sidebar %>\n <% include teacher/dashboard %>\n <% } else if (user.primaryAccount == \"student\") { %>\n <% include student/sidebar %>\n <% include student/dashboard %>\n <% } else { %>\n

There seems to be a problem

\n <% } %>\n
" ], "url": "https://github.com/gregory-m/ejs-tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "el1": { "title": "EL1", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/802f3d84796555ba85fb34cb529d4b6d6abd932e" ], "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=640", "centralPackageRepositoryCount": 0 }, "elan": { "title": "ELAN", "appeared": 1974, "type": "pl", "website": "http://www.cs.ru.nl/elan/", "country": [ "Germany" ], "originCommunity": [ "Technical University of Berlin" ], "wikipedia": { "related": [ "algol-68", "basic" ], "summary": "ELAN is an educational programming language for learning and teaching systematic programming. It was developed in 1974 by C.H.A. Koster and a group at the Technical University of Berlin as an alternative to BASIC in teaching, and approved for use in secondary schools in Germany by the \"Arbeitskreis Schulsprache\". It is in use in a number of schools in Germany, Belgium, the Netherlands, and Hungary for informatics teaching in secondary education, and used at the Radboud University Nijmegen in the Netherlands for teaching systematic programming to students from various disciplines and in teacher courses. The language design focuses strongly on structured programming, and has a special construction for stepwise refinement, allowing students to focus on top-down design, and bottom-up coding.", "pageId": 1179492, "created": 2004, "backlinksCount": 10, "revisionCount": 29, "dailyPageViews": 6, "appeared": 1974, "url": "https://en.wikipedia.org/wiki/ELAN_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Elan", "hopl": "https://hopl.info/showlanguage.prx?exp=1319", "fileType": "text", "centralPackageRepositoryCount": 0 }, "elastic-query-dsl": { "title": "Elasticsearch Query DSL", "appeared": 2010, "type": "queryLanguage", "reference": [ "https://www.elastic.co/guide/en/elasticsearch/reference/current/query-dsl.html" ], "country": [ "United States" ], "originCommunity": [ "Elasticsearch B.V" ], "centralPackageRepositoryCount": 0 }, "election-markup-language": { "title": "Election Markup Language", "appeared": 2001, "type": "xmlFormat", "description": "Election Markup Language (EML) is an XML-based standard to support end to end management of election processes.", "reference": [ "https://wiki.oasis-open.org/election" ], "aka": [ "eml" ], "country": [ "United States" ], "originCommunity": [ "Organization for the Advancement of Structured Information Standards" ], "wikipedia": { "related": [ "xml" ], "summary": "Election Markup Language (EML) is an XML-based standard to support end to end management of election processes.", "pageId": 16008334, "created": 2008, "backlinksCount": 44, "revisionCount": 60, "dailyPageViews": 11, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Election_Markup_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "electre": { "title": "Electre", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/24eb832e47cfb757728e03d9c2197c6b61a33485", "https://academic.oup.com/comjnl/article/29/3/229/579943" ], "country": [ "France" ], "originCommunity": [ "Le Laboratoire des Sciences du Numérique de Nantes" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5953", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Sistem Pendukung Keputusan Penerimaan Anggota Himpunan Mahasiswa Jurusan Teknik Informatika dengan Menggunakan Metode Electre (Studi Kasus : Sekolah Tinggi Teknologi Adisutjipto YOGYAKARTA)|10.28989/COMPILER.V3I2.78|3|0|D. Corry and Yuliani Indrianingsih|45b94f225dcc8e1eeb74db10bb2c560c3f1a18f1\n2019|RANCANG BANGUN APLIKASI SISTEM PENDUKUNG KEPUTUSAN SELEKSI PEMILIHAN DESTINASI PARIWISATA SUMATERA BARAT MENGGUNAKAN METODE ELECTRE|10.24036/TIP.V12I1.178|2|1|Dony Novaliendry and Yuli Pusparani|4f8f85772e2dbd11e7691e265d2cbe777ced201e\n2018|Sistem Pendukung Keputusan Penentuan Alternatif Produk Terbaik dengan Metode Elemination Et Choix Traduisant Realita ( Electre )|10.33022/IJCS.V6I1.10|1|0|Elmi Rahmawati and Novi Herpina|a79666ade6c970c63eefd574e25ecda6d3c6bd1b\n2020|Implementation of the Electre (Elimination Et Choix Traduisan La Realite) Method in a Healthy Food Menu Decision Support System for Toddlers in the Sasak Area Health Center Pasisie Using the Php And Databse Mysql Programming Language|10.35134/KOMTEKINFO.V7I1.1194|1|0|Mardison Mardison and Syafrika Deni Rizki and L. Rani and Agung Ramadhanu and R. Witri|3144f67d9059167b99ac70b9c5fd369e38955e4b" }, "elegance": { "title": "elegance", "appeared": 2017, "type": "pl", "creators": [ "Nathan Merrill" ], "description": "Elegance Objected oriented language aiming for high type-safety and readability.", "country": [ "United States" ], "originCommunity": [ "https://github.com/nathanmerrill/" ], "githubRepo": { "stars": 1, "forks": 0, "subscribers": 1, "created": 2017, "updated": 2018, "firstCommit": 2017, "issues": 0, "url": "https://github.com/nathanmerrill/elegance" }, "repoStats": { "firstCommit": 2017, "commits": 4, "committers": 2, "files": 47 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "elegant": { "title": "Elegant", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5a22b9fce6f88c8631e4db672964f70fa3ce1b4a" ], "country": [ "The Netherlands" ], "originCommunity": [ "Philips Research Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3313", "wordRank": 6109, "centralPackageRepositoryCount": 0 }, "elena": { "title": "elena", "appeared": 2013, "type": "pl", "creators": [ "Alex Rakov" ], "website": "http://elenalang.sourceforge.net/", "reference": [ "https://news.ycombinator.com/item?id=24222038" ], "country": [ "Germany" ], "originCommunity": [ "ELENA Language Project" ], "domainName": { "name": "elenalang.sourceforge.net" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "writeLine" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2013, "stars": 81, "forks": 8, "subscribers": 9, "created": 2013, "updated": 2019, "description": "ELENA is a dynamic object-oriented programming language. It features message dispatching, mixins and a script engine", "issues": 87, "url": "https://github.com/ELENA-LANG/elena-lang" }, "repoStats": { "firstCommit": 2013, "commits": 6099, "committers": 11, "files": 1462 }, "leachim6": { "filepath": "e/Elena.elena", "fileExtensions": [ "elena" ], "example": [ "public program\n[\n console writeLine(\"Hello World\").\n]\n" ], "id": "Elena" }, "twitter": "https://twitter.com/elena_language" }, "elf": { "title": "Extensible Linking Format", "appeared": 1999, "type": "binaryExecutable", "standsFor": "Extensible Linking Format", "country": [ "United States" ], "originCommunity": [ "Unix System Laboratories" ], "wikipedia": { "related": [ "unix", "x86-isa", "ascii", "linux", "solaris", "freebsd", "sparc", "mips", "powerpc", "arm", "risc-v", "coff", "preferred-executable-format", "android", "atmel-avr", "ia-32" ], "summary": "In computing, the Executable and Linkable Format (ELF, formerly named Extensible Linking Format), is a common standard file format for executable files, object code, shared libraries, and core dumps. First published in the specification for the application binary interface (ABI) of the Unix operating system version named System V Release 4 (SVR4), and later in the Tool Interface Standard, it was quickly accepted among different vendors of Unix systems. In 1999, it was chosen as the standard binary file format for Unix and Unix-like systems on x86 processors by the 86open project. By design, ELF is flexible, extensible, and cross-platform, not bound to any given central processing unit (CPU) or instruction set architecture. This has allowed it to be adopted by many different operating systems on many different hardware platforms.", "pageId": 9914, "dailyPageViews": 625, "created": 2001, "backlinksCount": 194, "revisionCount": 570, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Executable_and_Linkable_Format" }, "tryItOnline": "elf", "fileType": "binary", "centralPackageRepositoryCount": 0 }, "elfe": { "title": "ELFE", "appeared": 2003, "type": "pl", "creators": [ "Christophe de Dinechin" ], "description": "ELFE is a very simple and small programming language specifcally designed for everyday programming, notably for the Internet of Things.", "country": [ "France" ], "originCommunity": [ "https://dinechin.org" ], "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "invoke \"sensor.corp.net\",\n last_temperature := temperature\n every 1s,\n check_temperature temperature\n check_temperature T:real ->\n writeln \"Measuring temperature \", T, \" from process \", process_id\n if abs(T - last_temperature) >= 1.0 then\n reply\n temperature_changed T, last_temperature\n last_temperature := T\ntemperature_changed new_temp, last_temp ->\n writeln \"Temperature changed from \", last_temp, \" to \", new_temp" ], "githubRepo": { "firstCommit": 2003, "stars": 90, "forks": 9, "subscribers": 22, "created": 2015, "updated": 2021, "description": "Extensible Language for Everyday", "issues": 8, "url": "https://github.com/c3d/elfe" }, "repoStats": { "firstCommit": 2003, "commits": 3048, "committers": 19, "files": 265 } }, "elixir": { "title": "Elixir", "appeared": 2011, "type": "pl", "creators": [ "José Valim" ], "website": "https://elixir-lang.org", "documentation": [ "https://elixir-lang.org/docs.html", "https://devdocs.io/elixir~1.5/" ], "fileExtensions": [ "ex", "exs" ], "country": [ "United States" ], "originCommunity": [ "The Elixir Team" ], "domainName": { "awisRank": { "2017": 99108, "2022": 141656 }, "name": "elixir-lang.org" }, "writtenIn": [ "elixir" ], "visualParadigm": false, "canDoShebang": { "example": "#!/usr/bin/env elixir", "value": true }, "canWriteToDisk": { "example": "File.write!(\"helloworld.txt\", \"Hello, world!\\n\")", "value": true }, "hasComments": { "example": "# this is a comment", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasImports": { "example": "# Alias the module so it can be called as Bar instead of Foo.Bar\nalias Foo.Bar, as: Bar\n\n# Require the module in order to use its macros\nrequire Foo\n\n# Import functions from Foo so they can be called without the `Foo.` prefix\nimport Foo\n\n# Invokes the custom code defined in Foo as an extension point\nuse Foo", "value": true }, "hasAssignment": { "example": "name = \"John\"", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasConditionals": { "example": "if true do\n IO.puts(\"Hello world\")\nend", "value": true }, "hasDefaultParameters": { "example": "def multiply(a, b \\\\ 1) do\n a * b\nend", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasMessagePassing": { "example": "send(pid, :ping)", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "~r/integer: \\d+/", "value": true }, "hasPointers": { "example": "", "value": false }, "hasUnitsOfMeasure": { "example": "", "value": false }, "hasLists": { "example": "my_list = [1, 2, 3, 4, 5]", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "# 0o[0-7]+", "value": true }, "hasHexadecimals": { "example": "# 0x[\\da-fA-F]+", "value": true }, "hasFloats": { "example": "# \\d(_?\\d)*\\.\\d(_?\\d)*([eE][-+]?\\d(_?\\d)*)?", "value": true }, "hasIntegers": { "example": "# \\d(_?\\d)*", "value": true }, "hasBinaryNumbers": { "example": "# 0b[01]+", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasMaps": { "example": "%{key: \"value\"}", "value": true }, "hasSingleDispatch": { "example": "", "value": true }, "hasMultipleDispatch": { "example": "", "value": false }, "hasRangeOperators": { "example": "1..3", "value": true }, "hasPolymorphism": { "example": "https://hexdocs.pm/elixir/Protocol.html", "value": true }, "hasMacros": { "example": "# https://hexdocs.pm/elixir/Macro.html\ndefmodule Example do\n defmacro macro_inspect(value) do\n IO.inspect(value)\n value\n end\n def fun_inspect(value) do\n IO.inspect(value)\n value\n end\nend", "value": true }, "hasStreams": { "example": "https://hexdocs.pm/elixir/Stream.html", "value": true }, "hasPipes": { "example": "\"Elixir\" |> String.graphemes() |> Enum.frequencies()", "value": true }, "hasAnonymousFunctions": { "example": "fn -> IO.puts(\"hello world\") end", "value": true }, "hasScientificNotation": { "example": "1.23e45", "value": true }, "hasInfixNotation": { "example": "seven = 3 + 4", "value": true }, "hasMultilineStrings": { "example": "template = \"\"\"\nThis is the first line.\nThis is the second line.\nThis is the third line.\n\"\"\"", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasRunTimeGuards": { "example": "def abs(number) when number > 0, do: number\ndef abs(number), do: -number", "value": true }, "hasPatternMatching": { "example": "def fib(0), do: 1\ndef fib(1), do: 1\ndef fib(n) when n >= 2, do: fib(n-1) + fib(n-2)", "value": true }, "hasExceptions": { "example": "raise \"oops, something went wrong\"", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasUnicodeIdentifiers": { "example": "δ = 0.00001", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "IO.puts" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "after", "and", "catch", "do", "else", "end", "false", "fn", "in", "nil", "not", "or", "rescue", "true", "when" ], "gource": "https://www.youtube.com/watch?v=qhkwG5OKyHk", "githubRepo": { "stars": 20394, "forks": 2911, "subscribers": 680, "created": 2011, "updated": 2022, "firstCommit": 2011, "description": "Elixir is a dynamic, functional language designed for building scalable and maintainable applications", "issues": 20, "url": "https://github.com/elixir-lang/elixir" }, "repoStats": { "firstCommit": 2011, "commits": 20722, "committers": 1457, "files": 679 }, "wikipedia": { "example": [ "task = Task.async fn -> perform_complex_action() end\nother_time_consuming_action()\nTask.await task" ], "related": [ "erlang", "ruby", "clojure", "lfe", "unicode", "utf-8" ], "summary": "Elixir is a functional, concurrent, general-purpose programming language that runs on the Erlang virtual machine (BEAM). Elixir builds on top of Erlang and shares the same abstractions for building distributed, fault-tolerant applications. Elixir also provides a productive tooling and an extensible design. The latter is supported by compile-time metaprogramming with macros and polymorphism via protocols. Elixir is used by companies such as E-MetroTel, Pinterest and Moz. Elixir is also used for web development, by companies such as Bleacher Report, Discord, and Inverse, and for building embedded systems. The community organizes yearly events in United States, Europe and Japan as well as minor local events and conferences.", "pageId": 38202780, "dailyPageViews": 413, "created": 2013, "backlinksCount": 283, "revisionCount": 197, "appeared": 2011, "fileExtensions": [ "ex", "exs" ], "url": "https://en.wikipedia.org/wiki/Elixir_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ex", "exs" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nphoenixframework phoenix_live_view https://github.com/phoenixframework.png https://github.com/phoenixframework/phoenix_live_view Elixir #6e4a7e 2197 180 90 \"Rich, real-time user experiences with server-rendered HTML\"\nelixir-lang elixir https://github.com/elixir-lang.png https://github.com/elixir-lang/elixir Elixir #6e4a7e 15832 2267 174 \"Elixir is a dynamic, functional language designed for building scalable and maintainable applications\"\nelixir-ecto ecto https://github.com/elixir-ecto.png https://github.com/elixir-ecto/ecto Elixir #6e4a7e 4322 1019 44 \"A database wrapper and language integrated query for Elixir\"\nphoenixframework phoenix https://github.com/phoenixframework.png https://github.com/phoenixframework/phoenix Elixir #6e4a7e 14194 1801 136 \"Productive. Reliable. Fast.\"\nabsinthe-graphql absinthe https://github.com/absinthe-graphql.png https://github.com/absinthe-graphql/absinthe Elixir #6e4a7e 2846 280 49 \"The GraphQL toolkit for Elixir\"\nderekkraan horde https://github.com/derekkraan.png https://github.com/derekkraan/horde Elixir #6e4a7e 569 44 32 \"Horde is a distributed Supervisor and Registry backed by DeltaCrdt\"\nadriankumpf teslamate https://github.com/adriankumpf.png https://github.com/adriankumpf/teslamate Elixir #6e4a7e 136 15 44 \"A self-hosted data logger for your Tesla 🚘\"\npoanetwork blockscout https://github.com/poanetwork.png https://github.com/poanetwork/blockscout Elixir #6e4a7e 639 229 30 \"Blockchain explorer for Ethereum based network and a tool for inspecting and analyzing EVM based blockchains.\"\nchrismccord phoenix_live_view_example https://github.com/chrismccord.png https://github.com/chrismccord/phoenix_live_view_example Elixir #6e4a7e 273 91 10", "trendingProjectsCount": 10, "type": "programming", "filenames": [ "mix.lock" ], "interpreters": [ "elixir" ], "aceMode": "elixir", "tmScope": "source.elixir", "repos": 89242, "id": "Elixir" }, "githubBigQuery": { "repos": 6816, "users": 4594, "id": "Elixir" }, "monaco": "elixir", "pygmentsHighlighter": { "filename": "erlang.py", "fileExtensions": [ "ex", "eex", "exs" ], "id": "Elixir" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2022, "committerCount": 55, "commitCount": 294, "sampleCount": 1, "example": [ "%{\"cowboy\": {:hex, :cowboy, \"1.0.0\"},\n \"cowlib\": {:hex, :cowlib, \"1.0.1\"},\n \"hackney\": {:hex, :hackney, \"0.14.3\"},\n \"hound\": {:hex, :hound, \"0.6.0\"},\n \"httpoison\": {:hex, :httpoison, \"0.5.0\"},\n \"idna\": {:hex, :idna, \"1.0.1\"},\n \"phoenix\": {:hex, :phoenix, \"0.10.0\"},\n \"plug\": {:hex, :plug, \"0.11.1\"},\n \"poison\": {:hex, :poison, \"1.3.1\"},\n \"ranch\": {:hex, :ranch, \"1.0.0\"}}\n" ], "url": "https://github.com/elixir-editors/elixir-tmbundle" }, "languageServerProtocolProject": [ "https://github.com/elixir-lsp/elixir-ls\nwrittenIn elixir" ], "projectEuler": { "memberCount": { "2019": 129, "2022": 173 }, "id": "Elixir" }, "helloWorldCollection": [ "# Hello world in Elixir\n\ndefmodule HelloWorld do\n IO.puts \"Hello, World!\"\nend" ], "leachim6": { "filepath": "e/Elixir.exs", "fileExtensions": [ "exs" ], "example": [ "#!/usr/bin/env elixir\nIO.puts \"Hello World\"\n" ], "id": "Elixir" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Elixir", "quineRelay": "Elixir", "rijuRepl": { "example": [ "IO.puts(\"Hello, world!\")\n" ], "id": "https://riju.codes/elixir" }, "tryItOnline": "elixir", "indeedJobs": { "2017": 214, "query": "elixir developer" }, "stackOverflowSurvey": { "2021": { "users": 1438, "medianSalary": 80077, "fans": 3374, "percentageUsing": 0.02 } }, "officialBlogUrl": [ "https://elixir-lang.org/blog/" ], "downloadPageUrl": [ "https://elixir-lang.org/install.html" ], "subreddit": [ { "memberCount": { "2022": 23468 }, "url": "https://reddit.com/r/elixir" } ], "meetup": { "memberCount": 44835, "groupCount": 211, "url": "https://www.meetup.com/topics/elixir" }, "tiobe": { "id": "Elixir" }, "packageRepository": [ "https://hex.pm/" ], "twitter": "https://twitter.com/elixirlang", "ubuntuPackage": "elixir", "jupyterKernel": [ "https://github.com/pprzetacznik/IElixir" ], "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2016|Packt Publishing|Learning Elixir|Ballou, Kenny|9781785881749\n2016|Pragmatic Bookshelf|\"Programming Elixir 1.2: Functional |> Concurrent |> Pragmatic |> Fun\"|Thomas, Dave|9781680501667\n2016|Pragmatic Bookshelf|\"Programming Elixir 1.3: Functional |> Concurrent |> Pragmatic |> Fun\"|Thomas, Dave|9781680502008\n2018|Pragmatic Bookshelf|\"Programming Elixir ≥ 1.6: Functional |> Concurrent |> Pragmatic |> Fun\"|Thomas, Dave|9781680502992\n2016|Manning Publications|The Little Elixir & OTP Guidebook|Tan Wei Hao, Benjamin|9781633430112\n2015|Packt Publishing|Elixir Cookbook|Pereira, Paulo A|9781784397517\n2015|Manning|Elixir in Action|Juric, Saša|9781617292019\n2022|Pragmatic Bookshelf|Programming Phoenix LiveView: Interactive Elixir Web Programming Without Writing Any JavaScript|Tate, Bruce A. and DeBenedetto, Sophie|9781680508215\n2016|Packt Publishing|Learning Elixir|Ballou, Kenny|9781785883477\n2016|Apress|Erlang and Elixir for Imperative Programmers|Loder, Wolfgang|9781484223949\n2018|Packt Publishing|Phoenix Web Development: Create rich web applications using functional programming techniques with Phoenix and Elixir|Voloz, Mike and Richey, Brandon|9781787284777\n20180314|Pragmatic Bookshelf|Adopting Elixir|Ben Marx; Jose Valim; Bruce Tate|9781680505849\n20161222|O'Reilly Media, Inc.|Introducing Elixir|Simon St. Laurent; J. David Eisenberg|9781491956854\n20151216|O'Reilly Media, Inc.|Introducing Elixir|Laurent, Simon St.; Eisenberg, J. David|9781449369996\n20140910|O'Reilly Media, Inc.|Introducing Elixir|Simon St. Laurent|9781449369972\n30-07-2018|Packt Publishing|Mastering Elixir|Andre Albuquerque; Daniel Caixinha|9781788472241\n20190416|Pragmatic Bookshelf|Programming Ecto: Build Database Apps in Elixir for Scalability and Performance|Wilson, Darin and Meadows-Jonsson, Eric|9781680502824\n20220622|Pragmatic Bookshelf|Programmer Passport: Elixir|Bruce Tate|9781680509625\n20191202|Pragmatic Bookshelf|Designing Elixir Systems With OTP|James Edward Gray II; Bruce A. Tate|9781680507379\n20210725|Pragmatic Bookshelf|Concurrent Data Processing in Elixir|Svilen Gospodinov|9781680508963\n20180327|Pragmatic Bookshelf|Craft GraphQL APIs in Elixir with Absinthe|Bruce Williams; Ben Wilson|9781680505931\n20220106|Pragmatic Bookshelf|Build a Weather Station with Elixir and Nerves|Alexander Koutmos; Bruce Tate; Frank Hunleth|9781680509472\n20220802|Pragmatic Bookshelf|Build a Binary Clock with Elixir and Nerves|Frank Hunleth; Bruce Tate|9781680509236\n20190117|Pragmatic Bookshelf|Property-Based Testing with PropEr, Erlang, and Elixir|Fred Hebert|9781680506549\n20191202|Pragmatic Bookshelf|Designing Elixir Systems With OTP|James Edward Gray II; Bruce A. Tate|9781680507379\n20210120|Pragmatic Bookshelf|Genetic Algorithms in Elixir|Sean Moriarity|9781680507942\n20221025|Pragmatic Bookshelf|Exploring Graphs With Elixir|Tony Hammond|9781680508406\n20210330|Pragmatic Bookshelf|Testing Elixir|Andrea Leopardi; Jeffrey Matthias|9781680507829\n20150129|Pragmatic Bookshelf|Metaprogramming Elixir|Chris McCord|9781680500417\n20180201|Pragmatic Bookshelf|Learn Functional Programming with Elixir|Ulisses Almeida|9781680502459\n20180101|Pragmatic Bookshelf|Functional Web Development with Elixir, OTP, and Phoenix|Lance Halvorsen|9781680502435", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2016|Elixir programming language evaluation for IoT|10.1109/ISCE.2016.7797392|6|0|Geovane Fedrecheski and L. Costa and M. Zuffo|bb548cf88bde14637e67dce390ed5c4b1e339d11\n2020|A Gradual Type System for Elixir|10.1145/3427081.3427084|2|0|Mauricio Cassola and Agustín Talagorria and Alberto Pardo and Marcos Viera|2f7b1940b91bc5a13cc44e0dc6ff0fa26298de3d\n2017|An Elixir library for programming concurrent and distributed embedded systems|10.1145/3079368.3079383|1|0|Humberto Rodríguez-Avila and E. G. Boix and W. Meuter|8b499715223c14b95dcbac77fdf03c0bb285a833" }, "ella-programming-language": { "title": "ELLA", "appeared": 1979, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Royal Signals", "Radar Establishment" ], "wikipedia": { "example": [ "MAC ZIP = ([INT n]TYPE t: vector1 vector2) -> [n][2]t:\n [INT k = 1..n](vector1[k], vector2[k]).\n \nMAC TRANSPOSE = ([INT n][INT m]TYPE t: matrix) -> [m][n]t:\n [INT i = 1..m] [INT j = 1..n] matrix[j][i].\n\nMAC INNER_PRODUCT{FN * = [2]TYPE t -> TYPE s, FN + = [2]s -> s}\n = ([INT n][2]t: vector) -> s:\n IF n = 1 THEN *vector[1]\n ELSE *vector[1] + INNER_PRODUCT {*,+} vector[2..n]\n FI.\n\nMAC MATRIX_MULT {FN * = [2]TYPE t->TYPE s, FN + = [2]s->s} =\n([INT n][INT m]t: matrix1, [m][INT p]t: matrix2) -> [n][p]s:\nBEGIN\n LET transposed_matrix2 = TRANSPOSE matrix2.\nOUTPUT [INT i = 1..n][INT j = 1..p]\n INNER_PRODUCT{*,+}ZIP(matrix1[i],transposed_matrix2[j])\nEND.\n\nTYPE element = NEW elt/(1..20),\n product = NEW prd/(1..1200).\n\nFN PLUS = (product: integer1 integer2) -> product:\n ARITH integer1 + integer2.\n\nFN MULT = (element: integer1 integer2) -> product:\n ARITH integer1 * integer2.\n\nFN MULT_234 = ([2][3]element:matrix1, [3][4]element:matrix2) ->\n [2][4]product: \n MATRIX_MULT{MULT,PLUS}(matrix1, matrix2).\n\nFN TEST = () -> [2][4]product:\n( LET m1 = ((elt/2, elt/1, elt/1),\n (elt/3, elt/6, elt/9)), \n m2 = ((elt/6, elt/1, elt/3, elt/4), \n (elt/9, elt/2, elt/8, elt/3),\n (elt/6, elt/4, elt/1, elt/2)).\n OUTPUT\n MULT_234 (m1, m2)\n).\n\nCOM test: just displaysignal MOC" ], "summary": "ELLA is a Hardware description language and support toolset. Developed by the Royal Signals and Radar Establishment during the 1980s and 1990s. Includes tools to perform: design transformation symbolic simulations formal verificationELLA is a winner of the 1989 Queen's Award for Technological Achievement.", "created": 2008, "backlinksCount": 102, "pageId": 20547508, "revisionCount": 16, "dailyPageViews": 10, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/ELLA_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=847", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ellie": { "title": "Ellie", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8973ce38ee75623a295673e8fc9d31deb089e490" ], "country": [ "Denmark" ], "originCommunity": [ "University of Copenhagen" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1549", "centralPackageRepositoryCount": 0 }, "elliott-algol": { "title": "Elliott ALGOL", "appeared": 1962, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Elliott Brothers (London) Ltd" ], "wikipedia": { "related": [ "algol-60" ], "summary": "Elliott ALGOL was an ALGOL 60 compiler for the Elliott 803 computer. It was implemented by Tony Hoare and others. It differed slightly from the reference version of Algol, particularly in the supported character set. First released in February 1962, it is believed to be the first implementation of an ALGOL 60 compiler in a commercial context and was an unexpectedly popular product for the company.", "created": 2004, "backlinksCount": 15, "pageId": 948969, "revisionCount": 32, "dailyPageViews": 4, "appeared": 1962, "url": "https://en.wikipedia.org/wiki/Elliott_ALGOL" }, "centralPackageRepositoryCount": 0 }, "ellpack": { "title": "ELLPACK", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5f2f5231986487943b25266a308b1bc73e68ab19" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6930", "centralPackageRepositoryCount": 0, "isbndb": "" }, "elm-packages-pm": { "title": "Elm Packages", "appeared": 2012, "type": "packageManager", "website": "https://package.elm-lang.org/", "country": [ "United States and France" ], "originCommunity": [ "https://github.com/elm" ], "domainName": { "name": "package.elm-lang.org" }, "packageCount": 594, "forLanguages": [ "elm" ] }, "elm": { "title": "Elm", "appeared": 2012, "type": "pl", "creators": [ "Evan Czaplicki" ], "website": "http://elm-lang.org", "webRepl": [ "http://elm-lang.org/try" ], "documentation": [ "https://elm-lang.org/docs" ], "fileExtensions": [ "elm" ], "country": [ "United States and France" ], "originCommunity": [ "https://github.com/elm" ], "domainName": { "registered": 2011, "awisRank": { "2017": 111935, "2022": 272317 }, "name": "elm-lang.org" }, "roadmap": "https://github.com/elm/compiler/blob/master/roadmap.md", "compilesTo": [ "javascript" ], "writtenIn": [ "haskell" ], "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "{- A comment\n-}", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "-- _?\\d+\\.(?=\\d+)", "value": true }, "hasIntegers": { "example": "-- _?\\d+", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "{-", "-}" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 6875, "forks": 630, "subscribers": 208, "created": 2012, "updated": 2022, "firstCommit": 2012, "description": "Compiler for Elm, a functional language for reliable webapps.", "issues": 281, "url": "https://github.com/elm-lang/elm-compiler" }, "repoStats": { "firstCommit": 2012, "commits": 5817, "committers": 119, "files": 226 }, "wikipedia": { "example": [ "-- This is a single line comment\n\n{- This is a multi-line comment.\n It can span multiple lines.\n-}\n\n{- It is possible to {- nest -} multi-line comments -}\n\n-- Here we define a value named ''greeting''. The type is inferred as a String.\ngreeting =\n \"Hello World!\"\n\n -- It is best to add type annotations to top-level declarations.\nhello : String\nhello =\n \"Hi there.\"\n\n-- Functions are declared the same way, with arguments following the function name.\nadd x y =\n x + y\n\n-- Again, it is best to add type annotations.\nhypotenuse : Float -> Float -> Float\nhypotenuse a b =\n sqrt (a^2 + b^2)\n\n-- Functions are also curried; here we've curried the multiplication \n-- infix operator with a `2`\nmultiplyBy2 : number -> number\nmultiplyBy2 =\n (*) 2\n\n-- If-expressions are used to branch on values\nabsoluteValue : number -> number\nabsoluteValue number =\n if number < 0 then negate number else number\n\n -- Records are used to hold values with named fields\nbook : { title : String, author : String, pages : Int }\nbook =\n { title = \"Steppenwolf\"\n , author = \"Hesse\"\n , pages = 237 \n }\n\n-- Record access is done with `.`\ntitle : String\ntitle =\n book.title\n\n-- Record access `.` can also be used as a function\nauthor : String\nauthor =\n .author book\n\n-- We can create entirely new types with the `type` keyword.\n-- The following value represents a binary tree.\ntype Tree a\n = Empty\n | Node a (Tree a) (Tree a)\n\n-- It is possible to inspect these types with case-expressions.\ndepth : Tree a -> Int\ndepth tree =\n case tree of\n Empty ->\n 0\n\n Node value left right ->\n 1 + max (depth left) (depth right)" ], "related": [ "haskell", "standard-ml", "ocaml", "f-sharp", "vuejs", "javascript", "typescript" ], "summary": "Elm is a domain-specific programming language for declaratively creating web browser-based graphical user interfaces. Elm is purely functional, and is developed with emphasis on usability, performance, and robustness. It advertises \"no runtime exceptions in practice,\" made possible by the Elm compiler's static type checking.", "pageId": 37552825, "dailyPageViews": 268, "created": 2012, "backlinksCount": 54, "revisionCount": 395, "appeared": 2012, "fileExtensions": [ "elm" ], "url": "https://en.wikipedia.org/wiki/Elm_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "elm" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "elm", "codemirrorMode": "elm", "codemirrorMimeType": "text/x-elm", "tmScope": "source.elm", "repos": 19905, "id": "Elm" }, "githubBigQuery": { "repos": 2864, "users": 2094, "id": "Elm" }, "codeMirror": "elm", "pygmentsHighlighter": { "filename": "elm.py", "fileExtensions": [ "elm" ], "id": "Elm" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 19, "commitCount": 295, "sampleCount": 3, "example": [ "\nmain = asText (qsort [3,9,1,8,5,4,7])\n\nqsort lst =\n case lst of\n x:xs -> qsort (filter ((>=)x) xs) ++ [x] ++ qsort (filter ((<)x) xs)\n [] -> []\n\n\n{---------------------\n\nQuickSort works as follows:\n - Choose a pivot element which be placed in the \"middle\" of the sorted list.\n In our case we are choosing the first element as the pivot.\n - Gather all of the elements less than the pivot (the first filter).\n We know that these must come before our pivot element in the sorted list.\n Note: ((>=)x) === (\\y -> (>=) x y) === (\\y -> x >= y)\n - Gather all of the elements greater than the pivot (the second filter).\n We know that these must come after our pivot element in the sorted list.\n - Run `qsort` on the lesser elements, producing a sorted list that contains\n only elements less than the pivot. Put these before the pivot.\n - Run `qsort` on the greater elements, producing a sorted list. Put these\n after the pivot.\n\nNote that choosing a bad pivot can have bad effects. Take a sorted list with\nN elements. The pivot will always be the lowest member, meaning that it does\nnot divide the list very evenly. The list of lessers has 0 elements\nand the list of greaters has N-1 elemens. This means qsort will be called\nN times, each call looking through the entire list. This means, in the worst\ncase, QuickSort will make N^2 comparisons.\n\n----------------------}\n" ], "url": "https://github.com/elm-community/Elm.tmLanguage" }, "languageServerProtocolProject": [ "https://github.com/elm-tooling/elm-language-server\nwrittenIn elm" ], "projectEuler": { "memberCount": { "2022": 4 }, "id": "Elm" }, "helloWorldCollection": [ "-- Hello world in Elm\n\nimport Text\n\nmain = Text.plainText \"Hello, world!\"" ], "leachim6": { "filepath": "e/Elm.elm", "fileExtensions": [ "elm" ], "example": [ "import Html exposing (text)\n\nmain =\n text \"Hello World\"\n" ], "id": "Elm" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Elm", "rijuRepl": { "example": [ "module Main exposing (..)\n\noutput : String\noutput = \"Hello, world!\"\n" ], "id": "https://riju.codes/elm" }, "indeedJobs": { "2017": 127, "query": "elm engineer" }, "officialBlogUrl": [ "https://elm-lang.org/news" ], "faqPageUrl": [ "https://faq.elm-community.org/" ], "tiobe": { "id": "Elm" }, "packageRepository": [ "https://package.elm-lang.org/" ], "twitter": "https://twitter.com/elmlang", "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2019||Practical Elm For A Busy Developer|Alex S. Korban|9780473484309\n20190702|O'Reilly Media, Inc.|Programming Elm|Jeremy Fairbank|9781680507171\n2018-03-30|Packt Publishing|Elm Web Development|Ajdin Imsirovic|9781788292375\n20200404|Manning Publications|Elm in Action|Richard Feldman|9781638355885\n20180821|Springer Nature|Web Applications with Elm|Wolfgang Loder|9781484226100", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|Model-View-Update-Communicate: Session Types meet the Elm Architecture|10.4230/DARTS.6.2.13|5|2|S. Fowler|0c500a3661fe5ef06e09ccc26e9252863d499ca6\n2018|Using Elm to Introduce Algebraic Thinking to K-8 Students|10.4204/EPTCS.270.2|4|0|Curtis D'Alves and Tanya Bouman and Christopher W. Schankula and J. Hogg and Levin Noronha and Emily Horsman and R. Siddiqui and C. Anand|9b5288f0d7cbdc8481abb055574008c8e34dd1c2" }, "elmol": { "title": "ELMOL", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/762bbc4cae42780f9ea71ba4174a74067249d618" ], "country": [ "United States" ], "originCommunity": [ "St. Olaf College" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4100", "centralPackageRepositoryCount": 0 }, "elpa-pm": { "title": "Emacs Lisp Package Archive", "appeared": 2016, "type": "packageManager", "website": "https://elpa.gnu.org/", "country": [ "United States" ], "originCommunity": [ "Free Software Foundation, Inc" ], "domainName": { "name": "elpa.gnu.org" }, "gitRepo": "https://git.savannah.gnu.org/cgit/emacs/elpa.git", "packageCount": 215, "forLanguages": [ "emacs-lisp" ] }, "elpi": { "title": "Elpi", "appeared": 2014, "type": "pl", "creators": [ "Enrico Tassi" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/LPCIC" ], "githubRepo": { "firstCommit": 2014, "url": "https://github.com/LPCIC/elpi" }, "pygmentsHighlighter": { "filename": "elpi.py", "fileExtensions": [ "elpi" ], "id": "Elpi" } }, "elvish": { "title": "Elvish", "appeared": 2013, "type": "pl", "creators": [ "Qi Xiao" ], "description": "Elvish is an expressive programming language and a versatile interactive shell, combined into one seamless package. It runs on Linux, BSDs, macOS and Windows.", "website": "https://elv.sh/", "webRepl": [ "https://try.elv.sh/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/elves" ], "domainName": { "registered": 2018, "awisRank": { "2022": 5087910 }, "name": "elv.sh" }, "example": [ "if $true { echo good } else { echo bad }" ], "githubRepo": { "firstCommit": 2013, "stars": 4768, "forks": 275, "subscribers": 109, "created": 2013, "updated": 2022, "description": "Elvish = Expressive Programming Language + Versatile Interactive Shell", "issues": 260, "url": "https://github.com/elves/elvish" }, "repoStats": { "firstCommit": 2013, "commits": 6343, "committers": 88, "files": 911 }, "rijuRepl": { "example": [ "echo \"Hello, world!\"" ], "id": "https://riju.codes/elvish" }, "twitter": "https://twitter.com/elvishshell", "isbndb": "" }, "elymas": { "title": "elymas", "appeared": 2012, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "quuxLogic Solutions GmbH" ], "githubRepo": { "firstCommit": 2012, "stars": 180, "forks": 12, "subscribers": 14, "created": 2013, "updated": 2022, "description": "A programming language I can like. Unholy and full of magic.", "issues": 0, "url": "https://github.com/Drahflow/Elymas" }, "repoStats": { "firstCommit": 2012, "commits": 589, "committers": 4, "files": 229 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9795314|Show HN: Self-hosted stack-based programming language|2015-06-28 22:11:16 UTC|1435529476|Drahflow|23|86" }, "em": { "title": "Em", "appeared": 2020, "type": "textMarkup", "standsFor": "Easy Markup", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/peter-fa" ], "example": [ "This is an optional HTML title.\n\n.p\nThis is a paragraph.\n\n.p\nThis is a paragraph. It ends\nhere.\n\n.p\nThis is a paragraph. It\nends\nhere.\n\n.l\nThis is a list item.\n\nThis is a list item.\n\nThis is a list item.\n\n\n.p\nThis is a paragraph. #This word\nis italic.\n\n.p\nThis is a paragraph. @This word\nis bold.\n\n.p\nThis is a paragraph. #{These words}\nare italic.\n\n.p\nThis is a paragraph. @{These words}\nare bold.\n" ], "githubRepo": { "firstCommit": 2020, "stars": 0, "forks": 0, "subscribers": 1, "created": 2020, "updated": 2020, "description": "Easy Markup is a lightweight markup language.", "issues": 0, "url": "https://github.com/peter-fa/em" }, "repoStats": { "firstCommit": 2020, "commits": 4, "committers": 1, "files": 9 } }, "emacs-editor": { "title": "Emacs", "appeared": 1976, "type": "editor", "creators": [ "Richard Stallman", "Guy Steele", "Dave Moon" ], "reference": [ "https://www.jwz.org/doc/emacs-timeline.html" ], "country": [ "Various" ], "originCommunity": [ "Free Software Foundation, Inc." ], "wikipedia": { "related": [ "lisp", "c", "org", "teco", "vi-editor", "unix", "java", "emacs-lisp", "linux", "rust", "ruby", "lua", "common-lisp", "swi-prolog", "spice-lisp", "lispworks", "haskell", "eclipse-editor", "sublime-editor", "latex", "ghostscript", "perl", "python", "vim-editor", "isbn" ], "summary": "Emacs is a family of text editors that are characterized by their extensibility. The manual for the most widely used variant, GNU Emacs, describes it as \"the extensible, customizable, self-documenting, real-time display editor\". Development of the first Emacs began in the mid-1970s, and work on its direct descendant, GNU Emacs, continues actively as of 2018. Emacs has over 10,000 built-in commands (many of which are macros themselves) and its user interface allows the user to combine these commands into macros to automate work. Implementations of Emacs typically feature a dialect of the Lisp programming language that provides a deep extension capability, allowing users and developers to write new commands and applications for the editor. Extensions have been written to manage email, files, outlines, and RSS feeds, as well as clones of ELIZA, Pong, Conway's Life, Snake and Tetris.The original EMACS was written in 1976 by Carl Mikkelsen, David A. Moon and Guy L. Steele Jr. as a set of Editor MACroS for the TECO editor. It was inspired by the ideas of the TECO-macro editors TECMAC and TMACS.The most popular, and most ported, version of Emacs is GNU Emacs, which was created by Richard Stallman for the GNU Project. XEmacs is a variant that branched from GNU Emacs in 1991. GNU Emacs and XEmacs use similar Lisp dialects and are for the most part compatible with each other. Emacs is, along with vi, one of the two main contenders in the traditional editor wars of Unix culture. Emacs is among the oldest free & open source projects still under development.", "pageId": 18933234, "created": 2001, "backlinksCount": 986, "revisionCount": 1936, "dailyPageViews": 605, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/Emacs" }, "subreddit": [ { "memberCount": { "2022": 60293 }, "url": "https://reddit.com/r/emacs" } ], "packageRepository": [ "https://melpa.org/" ], "fileType": "na", "isOpenSource": true }, "emacs-lisp": { "title": "Emacs Lisp", "appeared": 1985, "type": "pl", "creators": [ "Richard Stallman" ], "documentation": [ "https://www.gnu.org/software/emacs/manual/html_mono/elisp.html" ], "aka": [ "emacslisp" ], "country": [ "United States" ], "originCommunity": [ "GNU Project" ], "isLisp": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "(defun switch-to-next-window-in-split ()\n (set-window-buffer (next-window) (other-buffer)))\n\n(advice-add 'split-window-vertically :before #'switch-to-next-window-in-split)" ], "related": [ "lisp", "common-lisp", "emacs-editor", "c", "unix", "bourne-shell", "perl", "scheme" ], "summary": "Emacs Lisp is a dialect of the Lisp programming language used as a scripting language by Emacs (a text editor family most commonly associated with GNU Emacs and XEmacs). It is used for implementing most of the editing functionality built into Emacs, the remainder being written in C (as is the Lisp interpreter itself). Emacs Lisp is also referred to as Elisp, although there is also an older, unrelated Lisp dialect with that name. Users of Emacs commonly write Emacs Lisp code to customize and extend Emacs. Other options include the \"Customize\" feature that's been in GNU Emacs since version 20. Itself written in Emacs Lisp, Customize provides a set of preferences pages allowing the user to set options and preview their effect in the running Emacs session. When the user saves their changes, Customize simply writes the necessary Emacs Lisp code to the user's config file, which can be set to a special file that only Customize uses, to avoid the possibility of messing up the users own file. Emacs Lisp can also function as a scripting language, much like the Unix Bourne shell or Perl, by calling Emacs in \"batch mode\". In this way it may be called from the command line or via an executable file, and its editing functions, such as buffers and movement commands are available to the program just as in the normal mode. No user interface is presented when Emacs is started in batch mode; it simply executes the passed-in script and exits, displaying any output from the script.", "pageId": 10392, "dailyPageViews": 85, "created": 2002, "backlinksCount": 154, "revisionCount": 262, "appeared": 1985, "fileExtensions": [ "el", "elc" ], "url": "https://en.wikipedia.org/wiki/Emacs_Lisp" }, "githubLanguage": { "fileExtensions": [ "el", "emacs", "emacsdesktop" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nsyl20bnr spacemacs https://github.com/syl20bnr.png https://github.com/syl20bnr/spacemacs \"Emacs Lisp\" #c065db 18408 4533 255 \"A community-driven Emacs distribution - The best editor is neither Emacs nor Vim, it's Emacs *and* Vim!\"\nhlissner doom-emacs https://github.com/hlissner.png https://github.com/hlissner/doom-emacs \"Emacs Lisp\" #c065db 3698 571 244 \"An Emacs configuration for the stubborn martian vimmer\"\npurcell emacs.d https://github.com/purcell.png https://github.com/purcell/emacs.d \"Emacs Lisp\" #c065db 5135 1768 69 \"An Emacs configuration bundle with batteries included\"\nbbatsov prelude https://github.com/bbatsov.png https://github.com/bbatsov/prelude \"Emacs Lisp\" #c065db 4207 1636 35 \"Prelude is an enhanced Emacs 25.1+ distribution that should make your experience with Emacs both more pleasant and more powerful.\"\nKivy-CN Stanford-CS-229-CN https://github.com/Kivy-CN.png https://github.com/Kivy-CN/Stanford-CS-229-CN \"Emacs Lisp\" #c065db 2019 565 123 \"A Chinese Translation of Stanford CS229 notes 斯坦福机器学习CS229课程讲义的中文翻译\"\nemacs-lsp lsp-mode https://github.com/emacs-lsp.png https://github.com/emacs-lsp/lsp-mode \"Emacs Lisp\" #c065db 1763 221 88 \"Emacs client/library for the Language Server Protocol\"\nmanateelazycat snails https://github.com/manateelazycat.png https://github.com/manateelazycat/snails \"Emacs Lisp\" #c065db 160 12 55 \"A modern, easy-to-expand fuzzy search framework\"\nmelpa melpa https://github.com/melpa.png https://github.com/melpa/melpa \"Emacs Lisp\" #c065db 1850 1717 28 \"Recipes and build machinery for the biggest Emacs package repo\"\njwiegley use-package https://github.com/jwiegley.png https://github.com/jwiegley/use-package \"Emacs Lisp\" #c065db 2763 182 48 \"A use-package declaration for simplifying your .emacs\"\nemacs-mirror emacs https://github.com/emacs-mirror.png https://github.com/emacs-mirror/emacs \"Emacs Lisp\" #c065db 2058 610 28 \"Mirror of GNU Emacs\"", "trendingProjectsCount": 11, "type": "programming", "filenames": [ ".abbrev_defs", ".emacs", ".emacs.desktop", ".gnus", ".spacemacs", ".viper", "Cask", "Project.ede", "_emacs", "abbrev_defs" ], "aceMode": "lisp", "codemirrorMode": "commonlisp", "codemirrorMimeType": "text/x-common-lisp", "tmScope": "source.emacs.lisp", "aliases": [ "elisp", "emacs" ], "repos": 1305, "id": "Emacs Lisp" }, "githubBigQuery": { "repos": 16754, "users": 12880, "id": "Emacs Lisp" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "el" ], "id": "EmacsLisp" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 1, "commitCount": 101, "sampleCount": 3, "example": [ "(print \"Dude!\")\n" ], "url": "https://github.com/Alhadis/language-emacs-lisp" }, "leachim6": { "filepath": "e/EmacsLisp.el", "fileExtensions": [ "el" ], "example": [ "(message \"Hello World\")\n" ], "id": "EmacsLisp" }, "quineRelay": "Emacs Lisp", "replit": "https://repl.it/languages/elisp", "tryItOnline": "emacs-lisp", "tiobe": { "id": "Emacs Lisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2009", "packageRepository": [ "https://elpa.gnu.org/" ], "ubuntuPackage": "emacs25", "fileType": "text", "isOpenSource": true, "isbndb": "", "semanticScholar": "" }, "emberjs-framework": { "title": "emberjs-framework", "appeared": 2011, "type": "framework", "website": "https://emberjs.com/", "country": [ "United States" ], "originCommunity": [ "https://github.com/emberjs" ], "domainName": { "registered": 2011, "awisRank": { "2022": 186897 }, "name": "emberjs.com" }, "githubRepo": { "firstCommit": 2011, "stars": 22215, "forks": 4287, "subscribers": 890, "created": 2011, "updated": 2022, "description": "Ember.js - A JavaScript framework for creating ambitious web applications", "issues": 429, "url": "https://github.com/emberjs/ember.js" }, "languageServerProtocolProject": [ "https://github.com/emberwatch/ember-language-server\nwrittenIn typescript" ], "twitter": "https://twitter.com/emberjs" }, "emberscript": { "title": "EmberScript", "appeared": 2012, "type": "pl", "creators": [ "Michael Ficarra", "Gordon L. Hempton" ], "website": "http://emberscript.com/", "country": [ "Various" ], "originCommunity": [ "https://github.com/ghempton/ember-script/issues" ], "domainName": { "registered": 2012, "name": "emberscript.com" }, "githubRepo": { "firstCommit": 2012, "stars": 358, "forks": 28, "subscribers": 11, "created": 2012, "updated": 2022, "description": "Ember-infused CoffeeScript", "issues": 28, "url": "https://github.com/ghempton/ember-script" }, "repoStats": { "firstCommit": 2012, "commits": 749, "committers": 35, "files": 82 }, "githubLanguage": { "fileExtensions": [ "em", "emberscript" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "coffee", "codemirrorMode": "coffeescript", "codemirrorMimeType": "text/x-coffeescript", "tmScope": "source.coffee", "repos": 206, "id": "EmberScript" }, "githubBigQuery": { "repos": 459, "users": 417, "id": "EmberScript" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 30, "commitCount": 332, "sampleCount": 1, "example": [ "class App.FromNowView extends Ember.View\n tagName: 'time'\n template: Ember.Handlebars.compile '{{view.output}}'\n output: ~>\n return moment(@value).fromNow()\n\n didInsertElement: ->\n @tick()\n\n tick: ->\n f = ->\n @notifyPropertyChange 'output'\n @tick()\n\n nextTick = Ember.run.later(this, f, 1000)\n @set 'nextTick', nextTick\n\n willDestroyElement: ->\n nextTick = @nextTick\n Ember.run.cancel nextTick\n\nEmber.Handlebars.helper 'fromNow', App.FromNowView\n\n" ], "url": "https://github.com/atom/language-coffee-script" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "emerald-lang": { "title": "emerald-lang", "appeared": 2019, "type": "pl", "creators": [ "Zach Perkitny" ], "description": "Emerald is an object oriented language that uses prototypal based inheritance.", "website": "https://emeraldlang.github.io/emerald/", "country": [ "United States" ], "originCommunity": [ "https://github.com/emeraldlang" ], "githubRepo": { "firstCommit": 2019, "stars": 22, "subscribers": 5, "created": 2019, "updated": 2022, "description": "Emerald is an object oriented language that uses prototypal based inheritance.", "forks": 1, "issues": 0, "url": "https://github.com/emeraldlang/emerald" }, "repoStats": { "firstCommit": 2019, "commits": 33, "committers": 4, "files": 109 } }, "emerald": { "title": "Emerald", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c58d5d68aff6a596c5aade80fe87c2ea9074d8f2" ], "country": [ "United States and Denmark" ], "originCommunity": [ "University of Washington", "Digital Equipment Corporation", "University of Arizona", "Copenhagen University" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "stdout.putString" ] ], "leachim6": { "filepath": "e/Emerald.m", "fileExtensions": [ "m" ], "example": [ "const main <- object mainProgram\n initially\n\t\tstdout.putString[\"Hello World\\n\"]\n\tend initially\nend mainProgram" ], "id": "Emerald" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1320", "wordRank": 9032, "centralPackageRepositoryCount": 0 }, "emesh": { "title": "emesh", "appeared": 2014, "type": "esolang", "country": [ "Israel" ], "originCommunity": [ "https://github.com/mohawkgroup" ], "githubRepo": { "firstCommit": 2014, "stars": 11, "forks": 1, "subscribers": 1, "created": 2014, "updated": 2016, "description": "Toy programming language written in javascript", "issues": 0, "url": "https://github.com/Alexander-0x80/Emesh" }, "repoStats": { "firstCommit": 2014, "commits": 20, "committers": 1, "files": 16 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8594742|Show HN: I have written a toy language in JavaScript|2014-11-12 10:19:23 UTC|1415787563|rootdiver|2|10", "isbndb": "" }, "emfatic": { "title": "emfatic", "appeared": 2004, "type": "pl", "description": "Emfatic is a language designed to represent EMF Ecore models in a textual form.", "website": "https://www.eclipse.org/epsilon/doc/articles/emfatic/", "country": [ "Canada" ], "originCommunity": [ "Eclipse Foundation, Inc" ], "example": [ "package test;\n\ndatatype D1 : int;\n\npackage P {\n datatype D2 : int;\n}\n\nclass C {\n attr D1 d1;\n attr P.D2 d2;\n attr ecore.EString s1;\n attr String s2;\n}" ], "semanticScholar": "" }, "emily": { "title": "Emily", "appeared": 1970, "type": "os", "creators": [ "Wilfred J. Hansen" ], "reference": [ "https://digital.library.unt.edu/ark:/67531/metadc1028926/m2/1/high_res_d/4721186.pdf" ], "country": [ "United States" ], "originCommunity": [ "Argonne National Laboratory" ], "announcementMethod": "dissertation" }, "emma": { "title": "EMMA", "appeared": 1999, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c84c4829ca2fa76a51b5cef9d0445826d9be58a4" ], "country": [ "Austria" ], "originCommunity": [ "University of Vienna" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8297", "wordRank": 8306, "centralPackageRepositoryCount": 0 }, "emojicode": { "title": "Emojicode", "appeared": 2016, "type": "pl", "creators": [ "Theo Weidmann" ], "website": "http://www.emojicode.org/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/emojicode" ], "domainName": { "registered": 2015, "awisRank": { "2022": 1439176 }, "name": "emojicode.org" }, "githubRepo": { "stars": 2756, "forks": 163, "subscribers": 49, "created": 2015, "updated": 2022, "firstCommit": 2016, "description": "😀😜🔂 World’s only programming language that’s bursting with emojis", "issues": 13, "url": "https://github.com/emojicode/emojicode" }, "repoStats": { "firstCommit": 2016, "commits": 1399, "committers": 26, "files": 3975 }, "leachim6": { "filepath": "e/Emojicode.emojic", "fileExtensions": [ "emojic" ], "example": [ "🏁 🍇\n 😀 🔤Hello World🔤❗️\n🍉\n" ], "id": "Emojicode" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Emojicode", "rijuRepl": { "example": [ "🏁 🍇\n 😀 🔤Hello, world!🔤❗️\n🍉\n" ], "id": "https://riju.codes/emojicode" }, "tryItOnline": "emojicode", "twitter": "https://twitter.com/real_emojicode", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nEmojicode Programming for Kids: Learn Programming Basics in 30 Days or Less Using Cool Emojis||Avery Meyers|66410277|0.0|0|0\nEmojicode Programming for Parents: Teach your Children Programming Basics in 30 Days or Less Using Emojis||Avery Meyers|65715065|0.0|0|0", "semanticScholar": "" }, "emoticon": { "title": "emoticon", "appeared": 2004, "type": "esolang", "country": [ "Scotland, United Kingdom" ], "originCommunity": [ "https://www.teuton.org" ], "leachim6": { "filepath": "e/Emoticon.emoticon", "fileExtensions": [ "emoticon" ], "example": [ "Hello World :Q S::P :P\n" ], "id": "Emoticon" }, "replit": "https://repl.it/languages/emoticon", "esolang": "https://esolangs.org/wiki/Emoticon", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Emoticon Smoothed Language Models for Twitter Sentiment Analysis|10.1609/aaai.v26i1.8353|251|10|Kun Liu and Wu-Jun Li and M. Guo|e66869e7e045eefa34dd8f8021304b1904f452b5\n2011|Robogotchi, on emoticon robot|10.1109/ICCSN.2011.6014856|3|0|E. Kuantama and Leonardy Setyawan and J. Darma|c9b40468ba5223197679d1b63ff448e43ae6c14c" }, "empirical": { "title": "empirical", "appeared": 2019, "type": "pl", "website": "https://www.empirical-soft.com/", "country": [ "United States" ], "originCommunity": [ "Empirical Software Solutions, LLC" ], "domainName": { "registered": 2018, "name": "empirical-soft.com" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n19969390|Show HN: Empirical – a language for time-series analysis|2019-05-21 12:13:54 UTC|1558440834|chrisaycock|29|111", "isbndb": "year|publisher|title|authors|isbn13\n20120202|Springer Nature|Empirical Software Engineering and Verification|Cédric Bonnafé|9783642252310\n2015|John Wiley & Sons|Repeated Measures Design For Empirical Researchers|J. P. Verma|9781119052692\n1992|Springer|The Psychology Of Expertise: Cognitive Research And Empirical Ai|Editor-robert R. Hoffman|9780387976860\n1996|Intellect Ltd|Empirical Studies Of Programmers: Sixth Workshop (human-computer Interaction Series)|Gray, Wayne D.|9781567502626\n2016|Chapman and Hall/CRC|Empirical Research in Software Engineering: Concepts, Analysis, and Applications|Malhotra, Ruchika|9781498719735" }, "emu": { "title": "emu", "appeared": 2019, "type": "pl", "website": "https://calebwin.github.io/emu/", "country": [ "United States" ], "originCommunity": [ "https://github.com/banyan-team" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n20030491|Show HN: Emu – language for numerical computing embedded in Rust|2019-05-28 14:36:19 UTC|1559054179|calebwin|0|1" }, "encore": { "title": "Encore", "appeared": 2014, "type": "pl", "creators": [ "Stephan Brandauer", "Elias Castegren", "Dave Clarke" ], "website": "https://stw.gitbooks.io/the-encore-programming-language/content/", "country": [ "Sweden" ], "originCommunity": [ "Uppsala universitet" ], "githubRepo": { "firstCommit": 2014, "stars": 40, "forks": 27, "subscribers": 14, "created": 2014, "updated": 2022, "description": "The Encore compiler.", "issues": 68, "url": "https://github.com/parapluu/encore" }, "repoStats": { "firstCommit": 2014, "commits": 2068, "committers": 45, "files": 1377 } }, "energese-notation": { "title": "Energy Systems Language", "appeared": 1950, "type": "notation", "country": [ "United States" ], "originCommunity": [ "United States Atomic Energy Commission" ], "wikipedia": { "summary": "The Energy Systems Language, also referred to as Energese, Energy Circuit Language, or Generic Systems Symbols, was developed by the ecologist Howard T. Odum and colleagues in the 1950s during studies of the tropical forests funded by the United States Atomic Energy Commission. They are used to compose energy flow diagrams in the field of systems ecology.", "dailyPageViews": 28, "pageId": 3237181, "created": 2005, "backlinksCount": 268, "revisionCount": 122, "appeared": 1950, "url": "https://en.wikipedia.org/wiki/Energy_Systems_Language" }, "fileType": "paper", "centralPackageRepositoryCount": 0 }, "energy-momentum-equation": { "title": "Energy Momentum Equation", "appeared": 1928, "type": "equation", "creators": [ "Paul Dirac" ], "equation": "E^2=(pc)^2 + (m0c^2)^2", "related": [ "mass-energy-equation" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Energy–momentum" } }, "english-programming-language": { "title": "english-programming-language", "appeared": 1973, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Microdata_Corporation" ], "country": [ "United States" ], "originCommunity": [ "Microdata Corporation" ], "centralPackageRepositoryCount": 0 }, "eno": { "title": "eno", "appeared": 2018, "type": "pl", "website": "https://eno-lang.org", "country": [ "Unknown" ], "originCommunity": [ "https://lurk.org" ], "domainName": { "registered": 2018, "name": "eno-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n17772865|The Eno notation language|https://eno-lang.org/|2018-08-16 08:17:44 UTC|1534407464|tosh|32|89" }, "enso-lang": { "title": "enso", "appeared": 2011, "type": "pl", "creators": [ "Alex Loh" ], "website": "https://web.archive.org/web/20191101145248/http://enso-lang.org/", "oldName": "luna", "country": [ "United States" ], "originCommunity": [ "University of Texas at Austin" ], "domainName": { "registered": 2011, "name": "enso-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n2515436|Enso Programming Model|http://enso-lang.org/blog/2011/05/04/6/|2011-05-04 21:45:56 UTC|1304545556|joelangeway|0|1" }, "enso": { "title": "Enso", "appeared": 2015, "type": "pl", "creators": [ "Wojciech Danilo" ], "description": "Enso is an award-winning interactive programming language with dual visual and textual representations.", "website": "https://enso.org/", "oldName": "luna", "country": [ "United States", "Poland" ], "originCommunity": [ "https://github.com/enso-org" ], "domainName": { "registered": 2001, "awisRank": { "2022": 3110066 }, "name": "enso.org" }, "related": [ "luna" ], "visualParadigm": true, "githubRepo": { "firstCommit": 2019, "stars": 5578, "forks": 205, "subscribers": 93, "created": 2016, "updated": 2022, "description": "Hybrid visual and textual functional programming.", "issues": 26, "url": "https://github.com/enso-org/enso" }, "repoStats": { "firstCommit": 2019, "commits": 4761, "committers": 55, "files": 6221 }, "isbndb": "" }, "enterprise-mashup-markup-language": { "title": "Enterprise Mashup Markup Language", "appeared": 2001, "type": "pl", "country": [ "United States" ], "originCommunity": [ "JackBe Corporation" ], "wikipedia": { "example": [ "" ], "related": [ "xml", "eclipse-editor", "json", "javascript", "jruby", "groovy", "xquery", "html", "xpath" ], "summary": "EMML, or Enterprise Mashup Markup Language, is an XML markup language for creating enterprise mashups, which are software applications that consume and mash data from variety of sources, often performing logical or mathematical operations as well as presenting data. Mashed data produced by enterprise mashups are presented in graphical user interfaces as mashlets, widgets, or gadgets. EMML can also be considered a declarative mashup domain-specific language (DSL). A mashup DSL eliminates the need for complex, time-consuming, and repeatable procedural programming logic to create enterprise mashups. EMML also provides a declarative language for creating visual tools for enterprise mashups. The primary benefits of EMML are mashup design portability and interoperability of mashup solutions. These benefits are expected to accelerate the adoption of enterprise mashups by creating transferable skills for software developers and reducing vendor lock-in. The introduction of EMML is expected to help accelerate the trend toward the integration of Web-based applications and service-oriented architecture (SOA) technologies. Bank of America was a high-profile early supporter of EMML. Other prominent early supporters included Hewlett-Packard, Capgemini, Adobe Systems, and Intel.", "created": 2009, "backlinksCount": 22, "pageId": 23983698, "revisionCount": 194, "dailyPageViews": 5, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Enterprise_Mashup_Markup_Language" }, "centralPackageRepositoryCount": 0 }, "entropy": { "title": "Entropy", "appeared": 2021, "type": "esolang", "creators": [ "Daniel Temkin" ], "description": "Entropy is a language where data decays the more it's used.", "website": "https://entropy-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://danieltemkin.com" ], "domainName": { "registered": 2021, "name": "entropy-lang.org" }, "rijuRepl": { "example": [ "Program MyNamespace MyProgram [\n\tprint \"Hello, world!\\n\";\n]\n" ], "id": "https://riju.codes/entropy" } }, "envoy-app": { "title": "envoy-app", "appeared": 2017, "type": "application", "website": "https://www.envoyproxy.io/", "country": [ "Various" ], "originCommunity": [ "https://github.com/envoyproxy" ], "domainName": { "registered": 2017, "awisRank": { "2022": 157866 }, "name": "envoyproxy.io" } }, "epigram": { "title": "Epigram", "appeared": 2004, "type": "pl", "creators": [ "Conor McBride" ], "reference": [ "http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.115.9718&rep=rep1&type=pdf" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of London" ], "hasDependentTypes": { "example": "", "value": true }, "wikipedia": { "example": [ "plus x y <= rec x {\n plus x y <= case x {\n plus zero y => y\n plus (suc x) y => suc (plus x y)\n }\n}" ], "related": [ "linux", "agda", "idris", "coq", "haskell", "dependent-ml" ], "summary": "Epigram is a functional programming language with dependent types. Epigram also refers to the IDE usually packaged with the language. Epigram's type system is strong enough to express program specifications. The goal is to support a smooth transition from ordinary programming to integrated programs and proofs whose correctness can be checked and certified by the compiler. Epigram exploits the propositions as types principle, and is based on intuitionistic type theory. The Epigram prototype was implemented by Conor McBride based on joint work with James McKinna. Its development is continued by the Epigram group in Nottingham, Durham, St Andrews and Royal Holloway in the UK. The current experimental implementation of the Epigram system is freely available together with a user manual, a tutorial and some background material. The system has been used under Linux, Windows and Mac OS X. It is currently unmaintained, and version 2, which was intended to implement Observational Type Theory, was never officially released, however there exists a GitHub mirror, last updated in 2012. The design of Epigram and Epigram 2 have inspired the development of other systems such as Agda, Idris and Coq.", "pageId": 1933143, "created": 2005, "backlinksCount": 31, "revisionCount": 87, "dailyPageViews": 23, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Epigram_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Epigram", "hopl": "https://hopl.info/showlanguage.prx?exp=8173", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011||Epigram (programming Language)|Kn Tr Benoit|9786136777214", "semanticScholar": "" }, "epilog": { "title": "EPILOG", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c984a7d29a8f3bc5104eb1e91a8b27e0d9e75184" ], "country": [ "Portugal" ], "originCommunity": [ "University of Porto" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1078", "centralPackageRepositoryCount": 0 }, "epsilon": { "title": "epsilon", "appeared": 1967, "type": "pl", "description": "EOL is an imperative programming language for creating, querying and modifying EMF models. You can think of it as a mixture of Javascript and OCL, combining the best of both worlds. As such, it provides all the usual imperative features found in Javascript (e.g. statement sequencing, variables, for and while loops, if branches etc.) and all the nice features of OCL such as those handy collection querying functions.", "website": "https://www.eclipse.org/epsilon/doc/eol/", "fileExtensions": [ "eol" ], "country": [ "Canada" ], "originCommunity": [ "Eclipse Foundation, Inc" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "var m : new Model;\n\nm.name = \"m\";\n\n// Create five packages\nfor (i in 1.to(5)){\n var package : Package = new Package;\n package.name = \"p\" + i;\n package.package = m;\n\n // Create three classes in each package\n for (j in 1.to(3)) {\n \n var class : Class = new Class;\n class.name = \"c\" + i + \"\" + j;\n class.isAbstract = false;\n class.package = package;\n \n }\n \n}\n\n// Assign random supertypes to the classes created\nfor (c in Class.allInstances) {\n c.extends = Class.allInstances.random();\n}" ], "twitter": "https://twitter.com/eclipseepsilon" }, "eql": { "title": "EqL", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/158477446b9c783644ba866c7c067ec35e4d8678" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1479", "centralPackageRepositoryCount": 0 }, "eqlog": { "title": "EQLog", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c946a2375e4d29dcf4b687397b72265bf3c06980" ], "country": [ "United States" ], "originCommunity": [ "SRI International" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1222", "centralPackageRepositoryCount": 0 }, "eqn": { "title": "eqn", "appeared": 1974, "type": "textMarkup", "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "related": [ "troff", "tex", "latex" ], "example": [ "sum from { k = 1 } to N { k sup 2 }" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Eqn_(software)" } }, "eqs": { "title": "EQS", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fb8cd8b41cfa06f850fe10f69111538f42f3a1f7" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7794", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1994|SAGE Publications, Inc|Structural Equation Modeling with EQS and EQS/WINDOWS: Basic Concepts, Applications, and Programming|Byrne, Barbara|9780803950924\n1994|SAGE Publications, Inc|Structural Equation Modeling with EQS and EQS/WINDOWS: Basic Concepts, Applications, and Programming|Byrne, Barbara|9780803950917\n20130415|Taylor & Francis|Structural Equation Modeling With EQS|Barbara M. Byrne; Barbara M. Byrne|9781135809676\n20151015|SAGE Publications, Ltd. (UK)|Introduction to Structural Equation Modeling Using IBM SPSS Statistics and EQS|Niels J. Blunch|9781473943292" }, "equate": { "title": "EQUATE", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0827806c39dae4a387761685230689ab16a23a45" ], "country": [ "United States" ], "originCommunity": [ "Cornell University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7630", "centralPackageRepositoryCount": 0 }, "erb": { "title": "ERB", "appeared": 2004, "type": "template", "description": "eRuby (Embedded Ruby) is a templating system that embeds Ruby into a text document.", "country": [ "Various" ], "originCommunity": [ "https://github.com/ruby" ], "example": [ "
    \n<% 4.times do %>\n\n
  • list item
    • \n\n<% end %>\n
" ], "wikipedia": { "example": [ "class ERBExample\n attr_accessor:variable1\n \n # using bind to access class variables\n def render()\n renderer.result(binding)\n end\n\n def initialize(variable1)\n @variable1 = variable1\n end\n\n # Expose private binding() method.\n def get_binding\n binding()\n end\nend\n\nexample = ERBExample.new(variable1)\nrenderer = ERB.new(template)\nputs output = renderer.result(example.get_binding)" ], "related": [ "html", "asp", "java-server-pages", "php", "rails", "xml", "perl", "java", "linux", "haml", "rdoc" ], "summary": "eRuby (Embedded Ruby) is a templating system that embeds Ruby into a text document. It is often used to embed Ruby code in an HTML document, similar to ASP, JSP and PHP. The templating system of eRuby combines the ruby code and the plain text to provide flow control and variable substitution, thus making it easy to maintain.The View module of the rails is responsible to display the response or output on a browser. In its simplest form, a view can be a piece of HTML code which has some static content. For most applications, just having static content may not be enough. Many Rails applications will require dynamic content created by the controller (action method) to be displayed in their view. This is made possible by using Embedded Ruby to generate templates which can contain dynamic content. Embedded Ruby allows ruby code to be embedded in a view document. This code gets replaced with proper value resulted from the execution of the code at run time. But, by having the ability to embed code in a view document, we risk bridging the clear separation present in the MVC frame. It is thus the responsibility of the developer to make sure that there is a clear separation of responsibility among the model, view and controller modules of his/her application.", "pageId": 3883199, "created": 2006, "backlinksCount": 94, "revisionCount": 148, "dailyPageViews": 36, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/ERuby" }, "githubLanguage": { "fileExtensions": [ "erb", "erbdeface", "rhtml" ], "trendingProjectsCount": 0, "type": "markup", "group": "HTML", "aceMode": "text", "codemirrorMode": "htmlembedded", "codemirrorMimeType": "application/x-erb", "tmScope": "text.html.erb", "aliases": [ "erb", "rhtml", "html+ruby" ], "repos": 276, "id": "HTML+ERB" }, "pygmentsHighlighter": { "filename": "templates.py", "id": "ERB" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 76, "commitCount": 458, "sampleCount": 2, "example": [ "<% provide(:title, @header) %>\n<% present @users do |user_presenter| %>\n\t
\n\t\t

<%= @header %>

\n\t
\n\n\t
\n\t\t
\n\t\t\t<%= will_paginate %>\n\t\t
\n\t
\n\t
\n\t\t
\n\t\t\t
\n\t\t\t\t
Name
\n\t\t\t\t
Email
\n\t\t\t\t
Chords
\n\t\t\t\t
Keys
\n\t\t\t\t
Tunings
\n\t\t\t\t
Credits
\n\t\t\t\t
Prem?
\n\t\t\t\t
Since?
\n\t\t\t
\n\n\t\t\t<% if @users == [] %>\n\t\t\t\t
\n\t\t\t\t\t
No Users
\n\t\t\t\t
\n\t\t\t<% else %>\n\t\t\t\t<%= render @users %>\n\t\t\t<% end %>\n\t\t
\n\t
\n\t
\n\t\t
\n\t\t\t<%= will_paginate %>\n\t\t
\n\t
\n<% end %>" ], "url": "https://github.com/atom/language-ruby" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "erg": { "title": "erg", "appeared": 2022, "type": "pl", "creators": [ "Shunsuke Shibayama" ], "description": "erg: A Python-compatible statically typed language written in Rust", "website": "http://erg-lang.github.io/", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wo9u8j/erg_a_pythoncompatible_statically_typed_language/" ], "country": [ "China and Japan" ], "originCommunity": [ "https://github.com/erg-lang" ], "githubRepo": { "firstCommit": 2022, "stars": 1864, "forks": 41, "subscribers": 20, "created": 2022, "updated": 2022, "description": "A statically typed language that can deeply improve the Python ecosystem", "issues": 20, "url": "https://github.com/erg-lang/erg" }, "repoStats": { "firstCommit": 2022, "commits": 2883, "committers": 25, "files": 1251 } }, "erlang": { "title": "Erlang", "appeared": 1986, "type": "pl", "creators": [ "Joe Armstrong", "Robert Virding", "Mike Williams" ], "website": "https://www.erlang.org", "documentation": [ "https://www.erlang.org/docs" ], "fileExtensions": [ "erl", "hrl" ], "country": [ "Sweden" ], "originCommunity": [ "Ericsson" ], "domainName": { "registered": 1998, "awisRank": { "2022": 123213 }, "name": "erlang.org" }, "releaseNotesUrl": "https://www.erlang.org/news", "visualParadigm": false, "hasStrings": { "example": "\"hello world\"", "value": true }, "canDoShebang": { "example": "#!/usr/bin/env escript", "value": true }, "hasComments": { "example": "% hello world program", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasDirectives": { "example": "-define(TIMEOUT, 200).\n...\ncall(Request) ->\n server:call(refserver, Request, ?TIMEOUT).\n-undef(Macro).", "value": true }, "hasImports": { "example": "-include(\"my_records.hrl\").\n-include(\"incdir/my_records.hrl\").\n-include(\"/home/user/proj/my_records.hrl\").\n-include(\"$PROJ_ROOT/my_records.hrl\").\n-include_lib(\"kernel/include/file.hrl\").", "value": true }, "hasExports": { "example": "-export([start/0, codeswitch/1]).", "value": true }, "hasMacros": { "example": "-define(Const, Replacement).\n-define(Func(Var1,...,VarN), Replacement).", "value": true }, "hasLineComments": { "example": "% A comment", "value": true }, "hasMessagePassing": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasFloats": { "example": "% [+-]?\\d+.\\d+", "value": true }, "hasIntegers": { "example": "% [+-]?(?:[2-9]|[12][0-9]|3[0-6])#[0-9a-zA-Z]+", "value": true }, "lineCommentToken": [ [ "%" ] ], "printToken": [ [ "io:format" ] ], "keywords": [ "after", "and", "andalso", "begin", "bnot", "bor", "bsl", "bsr", "bxor", "case", "catch", "cond", "div", "end", "fun", "if", "let", "not", "of", "or", "orelse", "receive", "rem", "try", "when", "xor" ], "wikipedia": { "example": [ "%% Second version\n -module(counter).\n -export([start/0, codeswitch/1]).\n\n start() -> loop(0).\n\n loop(Sum) ->\n receive\n {increment, Count} ->\n loop(Sum+Count);\n reset ->\n loop(0);\n {counter, Pid} ->\n Pid ! {counter, Sum},\n loop(Sum);\n code_switch ->\n ?MODULE:codeswitch(Sum)\n end.\n\n codeswitch(Sum) -> loop(Sum)." ], "related": [ "prolog", "smalltalk", "plex", "f-sharp", "clojure", "rust", "scala", "opa", "elixir", "dart", "oz", "java", "ascii", "occam", "csp", "lfe", "lisp" ], "summary": "Erlang ( ER-lang) is a general-purpose, concurrent, functional programming language, as well as a garbage-collected runtime system. The term Erlang is used interchangeably with Erlang/OTP, or OTP, which consists of the Erlang runtime system, a number of ready-to-use components mainly written in Erlang, and a set of design principles for Erlang programs. The Erlang runtime system is known for its designs that are well suited for systems with the following characteristics: Distributed Fault-tolerant Soft real-time, Highly available, non-stop applications Hot swapping, where code can be changed without stopping a system. The Erlang programming language is known for the following properties: Immutable data Pattern matching Functional programming The sequential subset of the Erlang language supports eager evaluation, single assignment, and dynamic typing. It was originally a proprietary language within Ericsson, developed by Joe Armstrong, Robert Virding and Mike Williams in 1986, but was released as open source in 1998. Erlang/OTP is supported and maintained by the OTP product unit at Ericsson.", "pageId": 9646, "dailyPageViews": 857, "created": 2001, "backlinksCount": 605, "revisionCount": 1311, "appeared": 1986, "fileExtensions": [ "erl", "hrl" ], "url": "https://en.wikipedia.org/wiki/Erlang_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "erl", "appsrc", "es", "escript", "hrl", "xrl", "yrl" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nemqx emqx https://github.com/emqx.png https://github.com/emqx/emqx Erlang #B83998 4937 943 140 \"EMQ X Broker - Scalable Distributed MQTT Message Broker for IoT in 5G Era\"\nrabbitmq rabbitmq-server https://github.com/rabbitmq.png https://github.com/rabbitmq/rabbitmq-server Erlang #B83998 6212 1921 158 \"Open source multi-protocol messaging broker\"", "trendingProjectsCount": 3, "type": "programming", "filenames": [ "Emakefile", "rebar.config", "rebar.config.lock", "rebar.lock" ], "interpreters": [ "escript" ], "aceMode": "erlang", "codemirrorMode": "erlang", "codemirrorMimeType": "text/x-erlang", "tmScope": "source.erlang", "repos": 28645, "id": "Erlang" }, "githubBigQuery": { "repos": 14920, "users": 9214, "id": "Erlang" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/erlang", "codeMirror": "erlang", "pygmentsHighlighter": { "filename": "erlang.py", "fileExtensions": [ "erl", "hrl", "es", "escript" ], "id": "Erlang" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2018, "committerCount": 9, "commitCount": 51, "sampleCount": 10, "example": [ "#!/usr/bin/env escript\n-export([main/1]).\n\nmain([]) -> io:format(\"Hello, World!~n\").\n" ], "url": "https://github.com/textmate/erlang.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/erlang/sourcer\nwrittenIn erlang" ], "projectEuler": { "memberCount": { "2019": 614, "2022": 618 }, "id": "Erlang" }, "helloWorldCollection": [ "%% Hello World in Erlang\n\n-module(hello).\n\n-export([hello/0]).\n\nhello() ->\n io:format(\"Hello World!~n\", []).\n" ], "leachim6": { "filepath": "e/Erlang.erl", "fileExtensions": [ "erl" ], "example": [ "-module(erlang_hw).\n-export([start/0]).\n\nstart() ->\n io:format(\"Hello World~n\")." ], "id": "Erlang" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Erlang", "quineRelay": "Erlang", "compilerExplorer": { "example": [ "-module(square).\n-export([square/1]).\n\nsquare(A) -> A*A.\n" ], "id": "Erlang" }, "rijuRepl": { "example": [ "-module(main).\n-export([main/0]).\n\nmain() ->\n io:fwrite(\"Hello, world!\\n\").\n" ], "id": "https://riju.codes/erlang" }, "indeedJobs": { "2017": 183, "query": "erlang engineer" }, "linkedInSkill": { "2018": 12535, "id": "erlang" }, "stackOverflowSurvey": { "2021": { "users": 651, "medianSalary": 80077, "fans": 1379, "percentageUsing": 0.01 } }, "officialBlogUrl": [ "https://www.erlang.org/blog" ], "faqPageUrl": [ "https://www.erlang.org/faq/introduction.html" ], "downloadPageUrl": [ "https://www.erlang.org/downloads" ], "subreddit": [ { "memberCount": { "2017": 6019, "2022": 9057 }, "url": "https://reddit.com/r/erlang" } ], "meetup": { "memberCount": 104319, "groupCount": 306, "url": "https://www.meetup.com/topics/erlang-programming" }, "tiobe": { "currentRank": 49, "id": "Erlang" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1728", "packageRepository": [ "https://hex.pm/" ], "twitter": "https://twitter.com/erlang_org", "ubuntuPackage": "erlang", "jupyterKernel": [ "https://github.com/robbielynch/ierlang", "https://github.com/filmor/ierl" ], "fileType": "text", "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Erlang|2007|Joe Armstrong|794755|3.97|643|34\nERLANG Programming|2009|Francesco Cesarini|4891279|4.06|190|10\nConcurrent Programming ERLANG|1995|Joe Armstrong|794756|4.00|15|2\nIntroducing Erlang: Getting Started in Functional Programming|2012|Simon St. Laurent|21537283|3.95|41|4\nERLANG and Elixir for Imperative Programmers||Wolfgang Loder|52899452|3.00|1|0\nConcurrent Programming in ERLANG|1993|Joe Armstrong|2594672|4.50|2|1", "isbndb": "year|publisher|title|authors|isbn13\n2012|Springer|Handbook of Neuroevolution Through Erlang|Sher, Gene I.|9781461444626\n2004|Acm Press|Erlang '04: Proceedings Of The Acm Sigplan 2004 Erlang Workshop : September 22-22, 2004, Snowbird, Utah, Usa|Acm Sigplan Erlang Workshop (2004 : Snowbird, Utah)|9781581139181\n2012|Springer|Handbook of Neuroevolution Through Erlang|Sher, Gene I.|9781461444633\n2010|Manning Publications|Erlang and OTP in Action|Martin Logan and Eric Merritt and Richard Carlsson|9781933988788\n2009|O'Reilly Media|Erlang Programming: A Concurrent Approach to Software Development|Cesarini, Francesco and Thompson, Simon|9780596518189\n2016|Apress|Erlang and Elixir for Imperative Programmers|Loder, Wolfgang|9781484223949\n1996|Prentice Hall|Concurrent Programming in Erlang (2nd Edition)|Virding, Robert and Wikstrom, Claes and Williams, Mike|9780135083017\n1993|Prentice Hall|Concurrent Programming in Erlang|Armstrong, Joe and Virding, Robert and Williams, Mike|9780132857925\n2017|O'reilly Media, Inc.|Introducing Erlang|Simon St. Laurent|9781491973349\n|Shroff Publishers & Distributors Pvt Ltd|Programming Erlang||9789351104674\n20170306|O'Reilly Media, Inc.|Introducing Erlang|Simon St. Laurent|9781491973325\n20090611|O'Reilly Media, Inc.|Erlang Programming|Francesco Cesarini; Simon Thompson|9780596555856\n||Erlang Programming Language: Erlang, Ejabberd, Mnesia, Couchdb, Wings 3d, Open Telecom Platform, Rabbitmq, Tsung, Yaws|Books and LLC|9781155181370\n20090611|O'Reilly Media, Inc.|Erlang Programming|Francesco Cesarini|9780596551018\n2013||Études For Erlang|J. David Eisenberg|9781449366452\n|Acm Press|Erlang '05: proceedings of the ACM SIGPLAN 2005 Erlang Workshop : September 25, 2005, Tallinn, Estonia|Acm Sigplan Erlang Workshop (4th : 2005 : Tallinn, Estonia)|9781595930668\n20120605|O'Reilly Media, Inc.|Building Web Applications with Erlang|Zachary Kessin|9781449320652\n20101115|Simon & Schuster|Erlang and OTP in Action|Eric Merritt; Martin Logan; Richard Carlsson|9781638354260\n20120605|O'Reilly Media, Inc.|Building Web Applications with Erlang|Zachary Kessin|9781449320669\n2011||Articles On Erlang Programming Language, Including|Hephaestus Books|9781242972508\n2019|Addison-wesley Professional|Building Scalable Applications With Erlang (developer's Library)|Jerry Jackson|9780321636461\n20130113|Random House Publishing Services|Learn You Some Erlang for Great Good!|Fred Hebert|9781593275044\n2011-09-22|LAP LAMBERT Academic Publishing|Research and implementation of Lobby System in Erlang|Wilson Tuladhar and Yury Dorofeev and Yeli Zhu|9783846503676", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1990|ERLANG - an experimental telephony programming language|10.1109/ISS.1990.765711|46|1|J. Armstrong and S. R. Virding|85e842b75d9c9330fb9bf425dacbf2eceb2fcc38\n2012|A Domain-Specific Language for Scripting Refactorings in Erlang|10.1007/978-3-642-28872-2_34|43|1|Huiqing Li and S. Thompson|eb67b9e9396f66bcd693eb27032e3cfa00eae54a\n2009|Erlang for concurrent programming|10.1145/1467247.1467263|36|4|J. Larson|b482d10ebb7784e249a8726ba6506b92a043bb5a\n2010|Programming language support to context-aware adaptation: a case-study with Erlang|10.1145/1808984.1808991|36|2|C. Ghezzi and Matteo Pradella and G. Salvaneschi|0a7250626ba4fd978f400cf9aacc0de623b63c13\n2012|Handbook of Neuroevolution Through Erlang|10.1007/978-1-4614-4463-3|29|0|Gene I. Sher|d00b0d3d92a057b5eca17c97b0d5225da4864a1f\n2016|A Reversible Semantics for Erlang|10.1007/978-3-319-63139-4_15|25|3|Naoki Nishida and Adrián Palacios and G. Vidal|f863d757999ecc375533e08aa7d13be71d2b502c\n2017|InterSCSimulator: Large-Scale Traffic Simulation in Smart Cities Using Erlang|10.1007/978-3-319-91587-6_15|22|3|E. Santana and Nelson Lago and Fabio Kon and D. Milojicic|6c95a1826fb9ddcca4956cff60c9cb01059ec132\n2012|Drop the phone and talk to the physical world: Programming the internet of things with Erlang|10.1109/SESENA.2012.6225763|19|0|A. Sivieri and L. Mottola and G. Cugola|d6b1666dd2e995bb901e0f75af99d3b2e7d69218\n2016|An Erlang Implementation of Multiparty Session Actors|10.4204/EPTCS.223.3|18|0|S. Fowler|e64ba877ad7f75090095fc5dd5760a2b288a7962\n2018|Functional Federated Learning in Erlang (ffl-erl)|10.1007/978-3-030-16202-3_10|17|0|G. Ulm and Emil Gustavsson and M. Jirstrand|18d663d6163b8fa1beba7aff99a80bdaa5590819\n2012|eJason: An Implementation of Jason in Erlang|10.1007/978-3-642-38700-5_1|14|0|Álvaro Fernández Díaz and Clara Benac Earle and Lars-Åke Fredlund|89545ea3c22a8376ffc758a8041341a0b4b2957c\n2013|Multicore profiling for Erlang programs using percept2|10.1145/2505305.2505311|14|0|Huiqing Li and S. Thompson|1b6688abd714ee5e466b3283cf15c3f347e23b0f\n2012|On Using Erlang for Parallelization - Experience from Parallelizing Dialyzer|10.1007/978-3-642-40447-4_19|12|0|Stavros Aronis and Konstantinos Sagonas|632de998f5b85a5bf3ba03529158f62287d2d925\n2005|Using the Erlang language for multi-agent systems implementation|10.1109/IAT.2005.141|12|0|A. Stefano and C. Santoro|3d1d62ef159b0dbbab39d482aabb6156aae59309\n2008|Erlang for Concurrent Programming|10.1145/1454456.1454463|11|2|J. Larson|3cdb7cad5cb98fbcf786583929b9dcf3d95e8f22\n2007|Programming distributed erlang applications: pitfalls and recipes|10.1145/1292520.1292527|10|1|Hans Svensson and Lars-Åke Fredlund|489333bd8f4bd37bd040a21da14f18bc630e7102\n2014|BEAMJIT: a just-in-time compiling runtime for Erlang|10.1145/2633448.2633450|7|1|Frej Drejhammar and L. Rasmusson|e44ca98cf46a2e19ff517736f3225994ba7f695d\n2019|Evaluation of JADE multi-agent system and Erlang holonic control implementations for a manufacturing cell|10.1080/0951192X.2019.1571231|6|0|K. Kruger and A. Basson|f9dcd0c7e647f9dfcd3eec1cd29918ebc9523d90\n2009|Programming Erlang - Software for a Concurrent World by Joe Armstrong, Pragmatic Bookshelf, 2007, p. 536. ISBN-10: 193435600X|10.1017/S0956796809007163|5|0|K. Sankar|d41eac81e1e3d68dcf422586e1c9db9b3058f78e\n2019|Playing with Bisimulation in Erlang|10.1007/978-3-030-21485-2_6|5|1|I. Lanese and D. Sangiorgi and G. Zavattaro|6af114c50b40a55e904ce80740322b0bce2398b5\n2016|Debugging Meets Testing in Erlang|10.1007/978-3-319-41135-4_10|4|0|S. Tamarit and A. Riesco and Enrique Martin-Martin and R. Caballero|a625b26fee4b262b6d5902d16805f2feb85c64a1\n1995|Implementation of the real-time functional language Erlang on a massively parallel platform, with applications to telecommunications services|10.1007/BFb0046731|4|0|Beshar Zuhdy and P. Fritzson and Kent Engström|b250b2d633a2d34134a0c489f92ecd501705e4db\n2007|Learning programming with erlang|10.1145/1292520.1292534|4|2|F. Huch|2a561bb28b376ccdc97c3f667e9764909833a6d9\n2017|Towards an Isabelle/HOL formalisation of core Erlang|10.1145/3123569.3123576|4|0|J. Harrison|0349abfb8b685437e2aefb04825d31cbb53d4d98\n2011|Teaching concurrency-oriented programming with Erlang|10.1145/1953163.1953223|4|0|Ariel Ortiz|b7a37dd3f2752f5d3be6769a246fe1ad1131c9fb\n2018|Typing the wild in Erlang|10.1145/3239332.3242766|3|1|Nachiappan Valliappan and John Hughes|b34337c00ef07089528ca34c121a40b47cbfe307\n2016|ValiErlang: A Structural Testing Tool for Erlang Programs|10.1145/2993288.2993300|2|0|Alexandre P. Oliveira and P. Souza and S. Souza|3ebd35c684490a4d778dd9b67471214cd0d69c0e\n2016|Polymorphic Types in Erlang Function Specifications|10.1007/978-3-319-29604-3_12|2|0|F. J. López-Fraguas and Manuel Montenegro and J. Rodríguez-Hortalá|62f656c97d2e48eea9706f197d87189c7ec50572\n2018|An Evaluation of Erlang for Implementing Standby Redundancy in a Manufacturing Station Controller|10.1007/978-3-030-03003-2_25|2|0|G. Hawkridge and A. Basson and K. Kruger|c59ec7d32a839649fe9ae5fd18d264191031ce20\n2018|Implementation and Evaluation of IEC 61499 Basic Function Blocks in Erlang|10.1109/ETFA.2018.8502470|2|0|Laurin Prenzel and Julien Provost|72e5b8c00df2832cb92aff55edc8605f15a6ba84\n2018|Towards Green Computing in Erlang|10.24193/SUBBI.2018.1.05|2|0|A. Mezsaros and G. Nagy and István Bozó and M. Tóth|d206d0330c653ae31ae8a68abff521b2263bf298\n2012|An Extension to Computing Elements in Erlang for Actor Based Concurrent Programming|10.1109/ISORCW.2012.28|2|0|Kang Lianghuan and Cao Donggang|a4cae1617168d2a31c9b56abb4dbb8f77fa824b0\n2017|Structuring Erlang BEAM control flow|10.1145/3123569.3123572|1|0|D. Lukács and M. Tóth|294db656bf16be7ffa8d33511c022478227cfa05\n2012|Erlang meets WSNs: A functional approach to WSN programming|10.1109/PerComW.2012.6197575|1|0|A. Sivieri|4b7c6c6f993e598a0250f651724086cf78a890e1\n2020|A Proof Assistant Based Formalisation of Core Erlang|10.1007/978-3-030-57761-2_7|1|0|Péter Bereczky and D'aniel Horp'acsi and S. Thompson|453d42665878ac1b5787cd46c1c2321db69f7cb0\n2021|Bidirectional typing for Erlang|10.1145/3471871.3472966|1|0|Nithin Vadukkumchery Rajendrakumar and Annette Bieniusa|2dae5bb95f2ba11afa4ffc598c1ce663a7a29331\n2012|Supporting cloud computing using Erlang Programming Language|10.1109/TELFOR.2012.6419488|1|1|Abd El-Fattah Hussein and O. Ibrahim|7d8e01ca6dda72b0d179099826a30a65effc5953" }, "errol": { "title": "ERROL", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/48f6e19e8b2381515f7be4c58fa4f4ca1457c712" ], "country": [ "Israel" ], "originCommunity": [ "Technion or Israel Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5623", "centralPackageRepositoryCount": 0 }, "esc-p": { "title": "ESC/P", "appeared": 1992, "type": "pl", "country": [ "Japan" ], "originCommunity": [ "Seiko Epson Corporation" ], "wikipedia": { "related": [ "postscript" ], "summary": "ESC/P, short for Epson Standard Code for Printers and sometimes styled Escape/P, is a printer control language developed by Epson to control computer printers. It was mainly used in dot matrix printers and some inkjet printers, and is still widely used in many receipt printers. During the era of dot matrix printers, it was also used by other manufacturers (e.g., NEC), sometimes in modified form. At the time, it was a popular mechanism to add formatting to printed text, and was widely supported in software.", "backlinksCount": 24, "pageId": 11237296, "dailyPageViews": 45, "created": 2007, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/ESC/P" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5581", "centralPackageRepositoryCount": 0 }, "escapade-programming-language": { "title": "Escapade", "appeared": 1977, "type": "pl", "reference": [ "https://www.seomastering.com/wiki/Escapade_(programming_language)" ], "country": [ "Unknown" ], "originCommunity": [ "https://squishedmosquito.com" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Escapade_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "eskew": { "title": "eskew", "appeared": 2019, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://willbanders.dev" ], "githubRepo": { "firstCommit": 2019, "stars": 2, "subscribers": 1, "created": 2019, "updated": 2021, "description": "A stack inspired language made for RacketCon 2019", "forks": 0, "issues": 0, "url": "https://github.com/WillBAnders/Eskew" }, "repoStats": { "firstCommit": 2019, "commits": 2, "committers": 2, "files": 2 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n20437816|Show HN: Eskew – stack inspired language for RacketCon 2019|2019-07-15 03:04:16 UTC|1563159856|WillBAnders|0|2" }, "esoteric-reaction": { "title": "Esoteric Reaction", "appeared": 2020, "type": "esolang", "country": [ "Unknown" ], "originCommunity": [ "https://bigyihsuan.github.io" ], "example": [ " \t ::= | \n ::= | | " ], "githubRepo": { "stars": 3, "forks": 0, "subscribers": 1, "created": 2020, "updated": 2022, "description": "Esolang using chemical \"formulas\" as code", "issues": 0, "url": "https://github.com/bigyihsuan/EsotericReaction" }, "repoStats": { "firstCommit": 2020, "commits": 62, "committers": 1, "files": 43 } }, "esp": { "title": "ESP", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/70dfc73359dada4cf06a4c5b00a4849957bef079" ], "country": [ "Japan" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1080", "centralPackageRepositoryCount": 0 }, "espol": { "title": "Executive Systems Problem Oriented Language", "appeared": 1967, "type": "pl", "standsFor": "Executive Systems Problem Oriented Language", "country": [ "United States" ], "originCommunity": [ "Burroughs Corporation" ], "supersetOf": [ "algol-60" ], "wikipedia": { "related": [ "algol-60", "newp" ], "summary": "This article is about the programming language. For the university, see Escuela Superior Politecnica del Litoral.ESPOL (short for Executive Systems Problem Oriented Language) was a superset of ALGOL 60 that provided capabilities of what would later be known as Mohols, machine oriented high order languages, such as interrupting a processor on a multiprocessor system (the Burroughs large systems were multiprocessor processor systems). ESPOL was used to write the MCP (Master Control Program) on Burroughs computer systems from the B5000 to the B6700. The single-pass compiler for ESPOL could compile over 250 lines per second. ESPOL was superseded by NEWP.", "pageId": 949062, "created": 2004, "backlinksCount": 22, "revisionCount": 39, "dailyPageViews": 17, "appeared": 1967, "url": "https://en.wikipedia.org/wiki/Executive_Systems_Problem_Oriented_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=506", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "esterel": { "title": "Esterel", "appeared": 1980, "type": "pl", "country": [ "France" ], "originCommunity": [ "Ecole des Mines de Paris", "INRIA" ], "wikipedia": { "example": [ "module ABRO:\ninput A, B, R;\noutput O;\n\nloop\n [ await A || await B ];\n emit O\neach R\n\nend module" ], "related": [ "c", "vhdl", "verilog" ], "summary": "Esterel is a synchronous programming language for the development of complex reactive systems. The imperative programming style of Esterel allows the simple expression of parallelism and preemption. As a consequence, it is well suited for control-dominated model designs. The development of the language started in the early 1980s, and was mainly carried out by a team of Ecole des Mines de Paris and INRIA led by Gérard Berry. Current compilers take Esterel programs and generate C code or hardware (RTL) implementations (VHDL or Verilog). The language is still under development, with several compilers out. The commercial version of Esterel is the development environment Esterel Studio. The company that commercialize it (Synfora) initiated a normalization process with the IEEE in April 2007 however the working group (P1778) dissolved March 2011. The Esterel v7 Reference Manual Version v7 30 – initial IEEE standardization proposal is publicly available.", "pageId": 1285078, "dailyPageViews": 50, "created": 2004, "backlinksCount": 31, "revisionCount": 133, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Esterel" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1081", "jupyterKernel": [ "https://github.com/abingham/jupyter-elm-kernel" ], "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSynchronous Programming of Reactive Systems with Esterel and Synccharts|2011|Luigi Zaffalon|21150707|0.0|0|0" }, "eta": { "title": "eta", "appeared": 2017, "type": "pl", "website": "http://eta-lang.org", "country": [ "India" ], "originCommunity": [ "https://github.com/typelead" ], "domainName": { "registered": 2016, "awisRank": { "2022": 1711219 }, "name": "eta-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n13374878|Eta – A powerful language for building scalable systems on the JVM|http://eta-lang.org/|2017-01-11 16:05:16 UTC|1484150716|psibi|161|282", "twitter": "https://twitter.com/eta_lang" }, "etc": { "title": "ETC", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2bce48117d8589af931d1610338fa3b2599bf2d1" ], "country": [ "United States" ], "originCommunity": [ "Bell Telephone Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=547", "wordRank": 1603, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "ethereum-vm": { "title": "Ethereum Virtual Machine", "appeared": 2015, "type": "vm", "reference": [ "https://github.com/ethereum/wiki/wiki/Ethereum-Virtual-Machine-(EVM)-Awesome-List" ], "country": [ "Canada" ], "originCommunity": [ "Ethereum Foundation" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "ethernet": { "title": "Ethernet", "appeared": 1973, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Ethernet" } }, "etoys": { "title": "Etoys", "appeared": 1996, "type": "pl", "creators": [ "Alan Kay" ], "country": [ "United States" ], "originCommunity": [ "Disney" ], "wikipedia": { "related": [ "squeak", "logo", "smalltalk", "hypercard", "starlogo", "scratch", "lisp", "python" ], "summary": "Etoys is a child-friendly computer environment and object-oriented prototype-based programming language for use in education. Etoys is a media-rich authoring environment with a scripted object model for many different objects that runs on different platforms and is free and open source.", "pageId": 4052771, "dailyPageViews": 31, "created": 2006, "backlinksCount": 28, "revisionCount": 99, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Etoys_(programming_language)" }, "tiobe": { "id": "Etoys" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "etruscan-numerals": { "title": "Etruscan numerals", "appeared": -700, "type": "numeralSystem", "originCommunity": [ "Ancient Greeks" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Etruscan_numerals" } }, "etude": { "title": "Etude", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9b252dd0d831f73359ce3f1d0030c625e0652eb7" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7571", "centralPackageRepositoryCount": 0 }, "euboea": { "title": "euboea", "appeared": 2018, "type": "pl", "isDead": true, "githubRepo": { "firstCommit": 2018, "stars": 44, "forks": 3, "subscribers": 1, "created": 2018, "updated": 2019, "description": "Euboea is blazingly fast and small programming language compiled JIT to Machine code.", "issues": 2, "url": "https://github.com/KrzysztofSzewczyk/Euboea" } }, "euclid": { "title": "Euclid", "appeared": 1970, "type": "pl", "creators": [ "Butler Lampson" ], "country": [ "Canada" ], "originCommunity": [ "Xerox PARC", "University of Toronto" ], "wikipedia": { "related": [ "pascal", "mesa", "turing" ], "summary": "Euclid is an imperative programming language for writing verifiable programs. It was designed by Butler Lampson and associates at the Xerox PARC lab in the mid-1970s. The implementation was led by Ric Holt at the University of Toronto and James Cordy was the principal programmer for the first implementation of the compiler. It was originally designed for the Motorola 6809 microprocessor. It was considered innovative for the time; the compiler development team had a $2 million budget over 2 years and was commissioned by the Defense Advanced Research Projects Agency of the U.S. Department of Defense and the Canadian Department of National Defence. It was used for a few years at I. P. Sharp Associates, MITRE Corporation, SRI International and various other international institutes for research in systems programming and secure software systems. Euclid is descended from the Pascal programming language. Functions in Euclid are closed scopes, may not have side effects, and must explicitly declare imports. Euclid also disallows gotos, floating point numbers, global assignments, nested functions and aliases, and none of the actual parameters to a function can refer to the same thing. Euclid implements modules as types. Descendants of Euclid include the Mesa programming language, the Concurrent Euclid programming language and the Turing programming language.", "pageId": 827385, "created": 2004, "backlinksCount": 15, "revisionCount": 26, "dailyPageViews": 12, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Euclid_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=756", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "euclidean-geometry": { "title": "Euclidean geometry", "appeared": -300, "type": "notation", "wikipedia": { "summary": "Euclidean geometry is a mathematical system attributed to Alexandrian Greek mathematician Euclid, which he described in his textbook on geometry: the Elements. Euclid's method consists in assuming a small set of intuitively appealing axioms, and deducing many other propositions (theorems) from these. Although many of Euclid's results had been stated by earlier mathematicians, Euclid was the first to show how these propositions could fit into a comprehensive deductive and logical system. The Elements begins with plane geometry, still taught in secondary school (high school) as the first axiomatic system and the first examples of formal proof. It goes on to the solid geometry of three dimensions. Much of the Elements states results of what are now called algebra and number theory, explained in geometrical language.For more than two thousand years, the adjective \"Euclidean\" was unnecessary because no other sort of geometry had been conceived. Euclid's axioms seemed so intuitively obvious (with the possible exception of the parallel postulate) that any theorem proved from them was deemed true in an absolute, often metaphysical, sense. Today, however, many other self-consistent non-Euclidean geometries are known, the first ones having been discovered in the early 19th century. An implication of Albert Einstein's theory of general relativity is that physical space itself is not Euclidean, and Euclidean space is a good approximation for it only over short distances (relative to the strength of the gravitational field).Euclidean geometry is an example of synthetic geometry, in that it proceeds logically from axioms describing basic properties of geometric objects such as points and lines, to propositions about those objects, all without the use of coordinates to specify those objects. This is in contrast to analytic geometry, which uses coordinates to translate geometric propositions into algebraic formulas.", "backlinksCount": 1284, "pageId": 9417, "dailyPageViews": 1084, "appeared": 1951, "url": "https://en.wikipedia.org/wiki/Euclidean_geometry" }, "isbndb": "" }, "euler": { "title": "Euler", "appeared": 1965, "type": "pl", "country": [ "United States and Switzerland" ], "originCommunity": [ "Stanford University", "ETH Zurich" ], "wikipedia": { "related": [ "algol-60" ], "summary": "Euler is a programming language created by Niklaus Wirth and Helmut Weber, conceived as an extension and generalization of ALGOL 60. The designers' goal was to create a language: which was simpler, and yet more flexible, than ALGOL 60 that was a useful programming language processed with reasonable efficiency that can be defined with rigorous formalityAvailable sources indicate that Euler was operational by 1965.", "pageId": 908540, "created": 2004, "backlinksCount": 11, "revisionCount": 37, "dailyPageViews": 21, "appeared": 1965, "url": "https://en.wikipedia.org/wiki/Euler_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Euler", "hopl": "https://hopl.info/showlanguage.prx?exp=256", "fileType": "text", "centralPackageRepositoryCount": 0 }, "eulers-equation": { "title": "Euler's Equation", "appeared": 1748, "type": "equation", "creators": [ "Leonhard Euler" ], "equation": "e^(ix) = cos(x) + i*sin(x)\nWhen x = π:\n eiπ + 1 = 0", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Euler%27s_formula" } }, "eulisp": { "title": "EuLisp", "appeared": 1985, "type": "pl", "documentation": [ "https://henry.github.io/EuLisp/", "https://people.bath.ac.uk/masrjb/Sources/eunotes.html" ], "country": [ "United States" ], "originCommunity": [ "https://henry.github.io" ], "hasMultipleInheritance": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "(defmodule hanoi\n (syntax (syntax-0)\n import (level-0)\n export (hanoi))\n\n;;;-------------------------------------------------\n;;; Tower definition\n;;;-------------------------------------------------\n(defconstant *max-tower-height* 10)\n\n(defclass ()\n ((id reader: tower-id keyword: id:)\n (blocks accessor: tower-blocks)))\n\n(defun build-tower (x n)\n (labels ((loop (i res)\n (if (= i 0) res\n (loop (- i 1) (cons i res)))))\n ((setter tower-blocks) x (loop n ()))\n x))\n\n(defmethod generic-print ((x ) (s ))\n (sformat s \"#\" (tower-id x) (tower-blocks x)))\n\n;;;-------------------------------------------------\n;;; Access to tower blocks\n;;;-------------------------------------------------\n(defgeneric push (x y))\n\n(defmethod push ((x ) (y ))\n (let ((blocks (tower-blocks x)))\n (if (or (null? blocks) (< y (car blocks)))\n ((setter tower-blocks) x (cons y blocks))\n (error \n (fmt \"cannot push block of size ~a on tower ~a\" y x)))))\n\n(defgeneric pop (x))\n\n(defmethod pop ((x ))\n (let ((blocks (tower-blocks x)))\n (if blocks\n (progn\n ((setter tower-blocks) x (cdr blocks))\n (car blocks))\n (error \n (fmt \"cannot pop block from empty tower ~a\" x)))))\n\n;;;-------------------------------------------------\n;;; Move n blocks from tower x1 to tower x2 using x3 as buffer\n;;;-------------------------------------------------\n(defgeneric move (n x1 x2 x3))\n\n(defmethod move ((n ) (x1 ) (x2 ) (x3 ))\n (if (= n 1)\n (progn\n (push x2 (pop x1))\n (print x1 nl x2 nl x3 nl nl))\n (progn\n (move (- n 1) x1 x3 x2)\n (move 1 x1 x2 x3)\n (move (- n 1) x3 x2 x1))))\n\n;;;-------------------------------------------------\n;;; Initialize and run the 'Towers of Hanoi'\n;;;-------------------------------------------------\n(defun hanoi ()\n (let ((x1 (make id: 0))\n (x2 (make id: 1))\n (x3 (make id: 2)))\n (build-tower x1 *max-tower-height*)\n (build-tower x2 0)\n (build-tower x3 0)\n (print x1 nl x2 nl x3 nl nl)\n (move *max-tower-height* x1 x2 x3)))\n\n(hanoi)\n\n;;;-------------------------------------------------\n) ;; End of module hanoi\n;;;-------------------------------------------------" ], "related": [ "lisp", "linux", "common-lisp", "scheme", "t", "standard-ml", "haskell", "dylan", "islisp", "interlisp", "lisp-machine-lisp", "le-lisp", "emacs-lisp", "autolisp", "openlisp", "picolisp", "newlisp", "racket", "guile", "clojure", "arc", "lfe" ], "summary": "EuLisp is a statically and dynamically scoped Lisp dialect developed by a loose formation of industrial and academic Lisp users and developers from around Europe. The standardizers intended to create a new Lisp \"less encumbered by the past\" (compared to Common Lisp), and not so minimalist as Scheme. Another objective was to integrate the object-oriented programming paradigm well. It is a third-generation programming language.", "created": 2006, "backlinksCount": 59, "pageId": 4158686, "revisionCount": 71, "dailyPageViews": 14, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/EuLisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1139", "centralPackageRepositoryCount": 0 }, "eumel": { "title": "EUMEL", "appeared": 1979, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "Bielefeld University" ], "wikipedia": { "related": [ "elan", "powerpc" ], "summary": "EUMEL (pronounced oimel for Extendable Multi User Microprocessor ELAN System and also known as L2 for Liedtke 2) is an operating system which began as a run-time environment for the ELAN programming language. It was created in 1979 by Jochen Liedtke at the University of Bielefeld. EUMEL initially ran on the 8-bit Z80 processor, and was later ported to many different architectures. EUMEL is based on a virtual machine using a bitcode and achieves remarkable performance and functionality. Z80-based EUMEL systems provide full multi-user multi-tasking operation with virtual memory management and complete isolation of one process against all others. These systems usually execute ELAN programs faster than equivalent programs written in languages such as BASIC, Pascal, or Cobol and compiled into Z80 machine language on other operating systems. One of the main features of EUMEL is that it is persistent, using a fixpoint/restart logic. This means that if the power fails you only lose a couple of minutes of work: upon restart you continue working from the previous fixpoint with all program state fully intact. This is also known as orthogonal persistence. EUMEL was followed by L3 and later L4.", "backlinksCount": 92, "pageId": 1432156, "dailyPageViews": 8, "created": 2005, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/Eumel" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3459", "centralPackageRepositoryCount": 0, "isbndb": "" }, "euphoria": { "title": "Euphoria", "appeared": 1993, "type": "pl", "creators": [ "Jeremy Cowgar", "Robert Craig", "Matt Lewis", "Derek Parnell" ], "website": "http://openeuphoria.org", "standsFor": "End User Programming Hierarchial Objects for Robust Interpreted Applications", "fileExtensions": [ "e", "ex", "exw", "edb" ], "country": [ "Canada" ], "originCommunity": [ "Rapid Deployment Software" ], "domainName": { "registered": 2007, "awisRank": { "2017": 1210678 }, "name": "openeuphoria.org" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "puts" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2006, "stars": 55, "forks": 18, "subscribers": 15, "created": 2018, "updated": 2022, "description": "The Euphoria programming language (https://openeuphoria.org/)", "issues": 1, "url": "https://github.com/OpenEuphoria/euphoria" }, "repoStats": { "firstCommit": 2006, "commits": 6590, "committers": 33, "files": 859 }, "wikipedia": { "example": [ "global function replace_item( object old, object new, sequence group )\n integer pos\n -- Code begins --\n pos = find( old, group )\n if pos > 0 then\n group[pos] = new\n end if\n return group\nend function" ], "related": [ "linux", "freebsd", "c", "basic", "ascii", "lua", "python", "rebol", "ruby" ], "summary": "Euphoria is a programming language originally created by Robert Craig of Rapid Deployment Software in Toronto, Ontario, Canada. Initially developed (though not publicly released) on the Atari ST, the first commercial release was for the 16-bit DOS platform and was proprietary. In 2006, with the release of version 3, Euphoria became open-source software. The openEuphoria Group continues to administer and develop the project. In December 2010, the openEuphoria Group released version 4 of openEuphoria along with a new identity and mascot for the project. OpenEuphoria is currently available for Windows, Linux, macOS and three flavors of *BSD. Euphoria is a general-purpose high-level imperative-procedural interpreted language. A translator generates C source code and the GNU compiler collection (GCC) and Open Watcom compilers are supported. Alternatively, Euphoria programs may be bound with the interpreter to create stand-alone executables. A number of graphical user interface (GUI) libraries are supported including Win32lib and wrappers for wxWidgets, GTK+ and IUP. Euphoria has a simple built-in database and wrappers for a variety of other databases.", "pageId": 9647, "dailyPageViews": 25, "created": 2001, "backlinksCount": 34, "revisionCount": 266, "appeared": 1993, "fileExtensions": [ "e", "ex", "exw", "edb" ], "url": "https://en.wikipedia.org/wiki/Euphoria_(programming_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "e", "ex" ], "interpreters": [ "eui", "euiw" ], "aceMode": "text", "tmScope": "source.euphoria", "repos": 75, "id": "Euphoria" }, "githubBigQuery": { "repos": 47, "users": 46, "id": "Euphoria" }, "projectEuler": { "memberCount": { "2019": 3, "2022": 8 }, "id": "Euphoria" }, "helloWorldCollection": [ "-- Hello World in Euphoria\n\nputs(1, \"Hello World!\\n\")\n" ], "leachim6": { "filepath": "e/Euphoria.ex", "fileExtensions": [ "ex" ], "example": [ "puts(1, \"Hello World\")\n" ], "id": "Euphoria" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Euphoria", "rijuRepl": { "example": [ "puts(1, \"Hello, world!\\n\")\n" ], "id": "https://riju.codes/euphoria" }, "tiobe": { "id": "Euphoria" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2020", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "eurisko": { "title": "Eurisko", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4e047dd2a91dd7d9342a819b91722c2148afcab5" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "wikipedia": { "related": [ "doi", "isbn" ], "summary": "Eurisko (Gr., I discover) is a discovery system written by Douglas Lenat in RLL-1, a representation language itself written in the Lisp programming language. A sequel to Automated Mathematician, it consists of heuristics, i.e. rules of thumb, including heuristics describing how to use and change its own heuristics. Lenat was frustrated by Automated Mathematician's constraint to a single domain and so developed Eurisko; his frustration with the effort of encoding domain knowledge for Eurisko led to Lenat's subsequent (and, as of 2014, continuing) development of Cyc. Lenat envisions ultimately coupling the Cyc knowledgebase with the Eurisko discovery engine.", "backlinksCount": 60, "pageId": 463838, "dailyPageViews": 26, "created": 2004, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/Eurisko" }, "hopl": "https://hopl.info/showlanguage.prx?exp=806", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "eva": { "title": "Eva", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8e4b65512b8ed7b71622ffb614fe691f51b6c49f" ], "country": [ "France" ], "originCommunity": [ "Faculté des Sciences et Technologies l'Université de Lille" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2021", "wordRank": 8312, "centralPackageRepositoryCount": 0 }, "eve": { "title": "Eve", "appeared": 2016, "type": "pl", "website": "http://witheve.com/", "webRepl": [ "http://play.witheve.com/#/examples/quickstart.eve" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/witheve" ], "domainName": { "registered": 2014, "awisRank": { "2017": 1167011, "2022": 2683795 }, "name": "witheve.com" }, "writtenIn": [ "typescript" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// People older than 30\n[#person age > 30]\n// The same as above\n[#person age]\nage > 30\n// Also the same as above\npeople = [#person]" ], "githubRepo": { "stars": 7057, "forks": 257, "subscribers": 200, "created": 2013, "updated": 2022, "firstCommit": 2016, "description": "Better tools for thought", "issues": 76, "url": "https://github.com/witheve/Eve" }, "repoStats": { "firstCommit": 2016, "commits": 3250, "committers": 45, "files": 71 }, "twitter": "https://twitter.com/with_eve", "fileType": "text", "wordRank": 5008, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "everparse3d": { "title": "EverParse3D", "appeared": 2022, "type": "idl", "creators": [ "Nikhil Swamy", "Tahina Ramananandro", "Aseem Rastogi", "Irina Spiridonova", "Haobin Ni", "Dmitry Malloy", "Juan Vazquez", "Michael Tang", "Omar Cardona", "Arti Gupta" ], "description": "Addressing this need, we present EverParse3D, a parser generator for binary message formats that yields performant C code backed by fully automated formal proofs of memory safety, arithmetic safety, functional correctness, and even double-fetch freedom to prevent certain kinds of time-of check/time-of-use errors. This allows systems developers to specify their message formats declaratively and to integrate correct-by-construction C code into their applications, eliminating several classes of bugs. EverParse3D has been in use in the Windows kernel for the past year. Applied primarily to the Hyper-V network virtualization stack, the formats of nearly 100 different messages spanning four protocols have been specified in EverParse3D and the resulting formally proven parsers have replaced prior handwritten code.", "reference": [ "https://www.microsoft.com/en-us/research/publication/hardening-attack-surfaces-with-formally-proven-binary-format-parsers/" ], "originCommunity": [ "Microsoft" ], "compilesTo": [ "c" ], "related": [ "protobuf", "flatbuffers" ], "example": [ "typedef struct _OrderedPair {\n UINT32 fst;\n UINT32 snd { fst <= snd };\n } OrderedPair;" ], "semanticScholar": "" }, "ex-editor": { "title": "ex", "appeared": 1978, "type": "editor", "creators": [ "Bill Joy" ], "country": [ "United Kingdom" ], "originCommunity": [ "Queen Mary College, London" ], "writtenIn": [ "c" ], "influencedBy": [ "ed-editor" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Ex_(text_editor)" } }, "exapt": { "title": "EXAPT", "appeared": 1967, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "Technical Universities of Berlin", "Aachen AEG", "Siemens" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2022" }, "excel-app": { "title": "Microsoft Excel", "appeared": 1987, "type": "application", "website": "http://office.microsoft.com/en-us/excel", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "keywords": [ "ABS", "ACCRINT", "ACCRINTM", "ACOS", "ACOSH", "ACOT", "ACOTH", "ADDRESS", "AGGREGATE", "AMORDEGRC", "AMORLINC", "AND", "ARABIC", "AREAS", "ASC", "ASIN", "ASINH", "ATAN", "ATAN2", "ATANH", "AVEDEV", "AVERAGE", "AVERAGEA", "AVERAGEIF", "AVERAGEIFS", "BAHTTEXT", "BASE", "BESSELI", "BESSELJ", "BESSELK", "BESSELY", "BETA.DIST", "BETA.INV", "BETADIST", "BETAINV", "BIN2DEC", "BIN2HEX", "BIN2OCT", "BINOM.DIST", "BINOM.DIST.RANGE", "BINOM.INV", "BINOMDIST", "BITAND", "BITLSHIFT", "BITOR", "BITRSHIFT", "BITXOR", "CALL", "CEILING", "CEILING.MATH", "CEILING.PRECISE", "CELL", "CHAR", "CHIDIST", "CHIINV", "CHISQ.DIST", "CHISQ.DIST.RT", "CHISQ.INV", "CHISQ.INV.RT", "CHISQ.TEST", "CHITEST", "CHOOSE", "CLEAN", "CODE", "COLUMN", "COLUMNS", "COMBIN", "COMBINA", "COMPLEX", "CONCAT", "CONCATENATE", "CONFIDENCE", "CONFIDENCE.NORM", "CONFIDENCE.T", "CONVERT", "CORREL", "COS", "COSH", "COT", "COTH", "COUNT", "COUNTA", "COUNTBLANK", "COUNTIF", "COUNTIFS", "COUPDAYBS", "COUPDAYS", "COUPDAYSNC", "COUPNCD", "COUPNUM", "COUPPCD", "COVAR", "COVARIANCE.P", "COVARIANCE.S", "CRITBINOM", "CSC", "CSCH", "CUBEKPIMEMBER", "CUBEMEMBER", "CUBEMEMBERPROPERTY", "CUBERANKEDMEMBER", "CUBESET", "CUBESETCOUNT", "CUBEVALUE", "CUMIPMT", "CUMPRINC", "DATE", "DATEDIF", "DATEVALUE", "DAVERAGE", "DAY", "DAYS", "DAYS360", "DB", "DBCS", "DCOUNT", "DCOUNTA", "DDB", "DEC2BIN", "DEC2HEX", "DEC2OCT", "DECIMAL", "DEGREES", "DELTA", "DEVSQ", "DGET", "DISC", "DMAX", "DMIN", "DOLLAR", "DOLLARDE", "DOLLARFR", "DPRODUCT", "DSTDEV", "DSTDEVP", "DSUM", "DURATION", "DVAR", "DVARP", "EDATE", "EFFECT", "ENCODEURL", "EOMONTH", "ERF", "ERF.PRECISE", "ERFC", "ERFC.PRECISE", "ERROR.TYPE", "EUROCONVERT", "EVEN", "EXACT", "EXP", "EXPON.DIST", "EXPONDIST", "F.DIST", "F.DIST.RT", "F.INV", "F.INV.RT", "F.TEST", "FACT", "FACTDOUBLE", "FALSE", "FDIST", "FILTER", "FILTERXML", "FIND,FINDBs", "FINV", "FISHER", "FISHERINV", "FIXED", "FLOOR", "FLOOR.MATH", "FLOOR.PRECISE", "FORECAST", "FORECAST.ETS", "FORECAST.ETS.CONFINT", "FORECAST.ETS.SEASONALITY", "FORECAST.ETS.STAT", "FORECAST.LINEAR", "FORMULATEXT", "FREQUENCY", "FTEST", "FV", "FVSCHEDULE", "GAMMA", "GAMMA.DIST", "GAMMA.INV", "GAMMADIST", "GAMMAINV", "GAMMALN", "GAMMALN.PRECISE", "GAUSS", "GCD", "GEOMEAN", "GESTEP", "GETPIVOTDATA", "GROWTH", "HARMEAN", "HEX2BIN", "HEX2DEC", "HEX2OCT", "HLOOKUP", "HOUR", "HYPERLINK", "HYPGEOM.DIST", "HYPGEOMDIST", "IF", "IFERROR", "IFNA", "IFS", "IMABS", "IMAGINARY", "IMARGUMENT", "IMCONJUGATE", "IMCOS", "IMCOSH", "IMCOT", "IMCSC", "IMCSCH", "IMDIV", "IMEXP", "IMLN", "IMLOG10", "IMLOG2", "IMPOWER", "IMPRODUCT", "IMREAL", "IMSEC", "IMSECH", "IMSIN", "IMSINH", "IMSQRT", "IMSUB", "IMSUM", "IMTAN", "INDEX", "INDIRECT", "INFO", "INT", "INTERCEPT", "INTRATE", "IPMT", "IRR", "ISBLANK", "ISERR", "ISERROR", "ISEVEN", "ISFORMULA", "ISLOGICAL", "ISNA", "ISNONTEXT", "ISNUMBER", "ISO.CEILING", "ISODD", "ISOWEEKNUM", "ISPMT", "ISREF", "ISTEXT", "JIS", "KURT", "LARGE", "LCM", "LEFT,LEFTBs", "LEN,LENBs", "LINEST", "LN", "LOG", "LOG10", "LOGEST", "LOGINV", "LOGNORM.DIST", "LOGNORM.INV", "LOGNORMDIST", "LOOKUP", "LOWER", "MATCH", "MAX", "MAXA", "MAXIFS", "MDETERM", "MDURATION", "MEDIAN", "MID,MIDBs", "MIN", "MINA", "MINIFS", "MINUTE", "MINVERSE", "MIRR", "MMULT", "MOD", "MODE", "MODE.MULT", "MODE.SNGL", "MONTH", "MROUND", "MULTINOMIAL", "MUNIT", "N", "NA", "NEGBINOM.DIST", "NEGBINOMDIST", "NETWORKDAYS", "NETWORKDAYS.INTL", "NOMINAL", "NORM.DIST", "NORM.INV", "NORM.S.DIST", "NORM.S.INV", "NORMDIST", "NORMINV", "NORMSDIST", "NORMSINV", "NOT", "NOW", "NPER", "NPV", "NUMBERVALUE", "OCT2BIN", "OCT2DEC", "OCT2HEX", "ODD", "ODDFPRICE", "ODDFYIELD", "ODDLPRICE", "ODDLYIELD", "OFFSET", "OR", "PDURATION", "PEARSON", "PERCENTILE", "PERCENTILE.EXC", "PERCENTILE.INC", "PERCENTRANK", "PERCENTRANK.EXC", "PERCENTRANK.INC", "PERMUT", "PERMUTATIONA", "PHI", "PHONETIC", "PI", "PMT", "POISSON", "POISSON.DIST", "POWER", "PPMT", "PRICE", "PRICEDISC", "PRICEMAT", "PROB", "PRODUCT", "PROPER", "PV", "QUARTILE", "QUARTILE.EXC", "QUARTILE.INC", "QUOTIENT", "RADIANS", "RAND", "RANDARRAY", "RANDBETWEEN", "RANK", "RANK.AVG", "RANK.EQ", "RATE", "RECEIVED", "REGISTER.ID", "REPLACE,REPLACEBs", "REPT", "RIGHT,RIGHTBs", "ROMAN", "ROUND", "ROUNDDOWN", "ROUNDUP", "ROW", "ROWS", "RRI", "RSQ", "RTD", "SEARCH,SEARCHBs", "SEC", "SECH", "SECOND", "SEQUENCE", "SERIESSUM", "SHEET", "SHEETS", "SIGN", "SIN", "SINGLE", "SINH", "SKEW", "SKEW.P", "SLN", "SLOPE", "SMALL", "SORT", "SORTBY", "SQRT", "SQRTPI", "STANDARDIZE", "STDEV", "STDEV.P", "STDEV.S", "STDEVA", "STDEVP", "STDEVPA", "STEYX", "SUBSTITUTE", "SUBTOTAL", "SUM", "SUMIF", "SUMIFS", "SUMPRODUCT", "SUMSQ", "SUMX2MY2", "SUMX2PY2", "SUMXMY2", "SWITCH", "SYD", "T", "T.DIST", "T.DIST.2T", "T.DIST.RT", "T.INV", "T.INV.2T", "T.TEST", "TAN", "TANH", "TBILLEQ", "TBILLPRICE", "TBILLYIELD", "TDIST", "TEXT", "TEXTJOIN", "TIME", "TIMEVALUE", "TINV", "TODAY", "TRANSPOSE", "TREND", "TRIM", "TRIMMEAN", "TRUE", "TRUNC", "TTEST", "TYPE", "UNICHAR", "UNICODE", "UNIQUE", "UPPER", "VALUE", "VAR", "VAR.P", "VAR.S", "VARA", "VARP", "VARPA", "VDB", "VLOOKUP", "WEBSERVICE", "WEEKDAY", "WEEKNUM", "WEIBULL", "WEIBULL.DIST", "WORKDAY", "WORKDAY.INTL", "XIRR", "XNPV", "XOR", "YEAR", "YEARFRAC", "YIELD", "YIELDDISC", "YIELDMAT", "Z.TEST", "ZTEST" ], "wikipedia": { "example": [ "\n\n \n \n \n Name\n Example\n \n \n Value\n 123\n \n
\n \n" ], "related": [ "android", "ios", "vba", "visual-basic", "ooxml", "xml", "csv", "dbase", "mysql", "c", "fortran", "python", "javascript" ], "summary": "Microsoft Excel is a spreadsheet developed by Microsoft for Windows, macOS, Android and iOS. It features calculation, graphing tools, pivot tables, and a macro programming language called Visual Basic for Applications. It has been a very widely applied spreadsheet for these platforms, especially since version 5 in 1993, and it has replaced Lotus 1-2-3 as the industry standard for spreadsheets. Excel forms part of Microsoft Office.", "pageId": 20268, "dailyPageViews": 3977, "created": 2001, "backlinksCount": 2892, "revisionCount": 3519, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Microsoft_Excel" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "exec-2": { "title": "EXEC 2", "appeared": 1970, "type": "pl", "reference": [ "http://bitsavers.org/pdf/ibm/370/VM_SP/Release_1/SX24-5124-0_VM_SP_EXEC_2_Language_Reference_Summary_Jul80.pdf" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "related": [ "cms-exec", "rexx" ], "summary": "EXEC 2 is an interpreted, command procedure control, computer scripting language used by the EXEC 2 Processor supplied with the IBM Virtual Machine/System Product (VM/SP) operating system.EXEC 2 is similar to EXEC with the following enhancements: There is no 8-byte restriction on token length. Statements can be up to 255 characters long. EXEC 2 can issue commands to subcommand environments as well as CMS and CP. EXEC 2 has additional built-in functions. EXEC 2 commands may include subroutines and functions. EXEC 2 has extra debugging facilities. CMS programs can manipulate EXEC 2 variables.", "pageId": 9424829, "created": 2007, "backlinksCount": 17, "revisionCount": 19, "dailyPageViews": 7, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/EXEC_2" }, "hopl": "https://hopl.info/showlanguage.prx?exp=757", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "executable-json": { "title": "Executable JSON", "appeared": 2013, "type": "pl", "creators": [ "Todd Davies" ], "website": "https://gist.github.com/Todd-Davies/7666505#file-executable-json", "country": [ "United Kingdom" ], "originCommunity": [ "http://todddavies.co.uk" ], "example": [ "[\n {\"x\":9},\n {\"y\":3},\n [\"print The value of x is: $x\"],\n [\"print The value of x is: $y\"],\n [\"print Now lets add x and y\"],\n [\"add $z $x $y\"],\n [\"print The answer is: $z\"],\n [\"print Now lets subtract y from x\"],\n [\"sub $z $x $y\"],\n [\"print The answer is: $z\"],\n [\"print Now lets divide x by y\"],\n [\"div $z $x $y\"],\n [\"print The answer is: $z\"],\n [\"print Now lets multiply x by y\"],\n [\"mul $z $x $y\"],\n [\"print The answer is: $z\"],\n {\"myMethod\":\n {\n \"params\": [\n \"p1\",\n \"p2\"\n ],\n \"body\": [\n {\"nestedMethod\":\n {\n \"params\": [\n \"p1\"\n ],\n \"body\": [\n [\"print Methods can be nested, and arguments can be trickled down.\"],\n [\"print The result was: $p1\"]\n ]\n }\n },\n [\"print You passed me: $p1 and $p2\"],\n [\"print Lets add them and pass the result into another method!\"],\n [\"add $p2 $p1 $p2\"],\n [\"!nestedMethod $p2\"]\n ]\n }\n },\n [\"!myMethod $x $y\"]\n]" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n6804341|Show HN: A programming language with a JSON parsable syntax|2013-11-26 21:26:30 UTC|1385501190|todd-davies|0|3" }, "exel": { "title": "EXEL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5627284cb9ae4f45cbb26e00fe98eeb27b42d2d6" ], "country": [ "France" ], "originCommunity": [ "Sorbonne University Pierre", "Marie Curie Campus", "Thomson-CSF" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4154", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "exfat": { "title": "ExFAT", "appeared": 2006, "type": "filesystem", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "ntfs", "linux", "fat", "freebsd", "android" ], "summary": "exFAT (Extended File Allocation Table) is a Microsoft file system introduced in 2006 and optimized for flash memory such as USB flash drives and SD cards. It is proprietary and Microsoft owns patents on several elements of its design.exFAT can be used where NTFS is not a feasible solution (due to data-structure overhead), but a greater file-size limit than the standard FAT32 file system (i.e. 4 GiB) is required. exFAT has been adopted by the SD Card Association as the default file system for SDXC cards larger than 32 GiB.", "backlinksCount": 541, "pageId": 7121456, "created": 2006, "revisionCount": 896, "dailyPageViews": 748, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/ExFAT" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "exkited": { "title": "exkited", "appeared": 2018, "type": "template", "creators": [ "Brandon Barber" ], "website": "https://exkited.com", "country": [ "United States" ], "originCommunity": [ "https://exkited.com" ], "domainName": { "registered": 2020, "name": "exkited.com" }, "example": [ "\n
\n <@ return data.title @> // A 'data' object may be passed rendering.\n
\n <@\n let result = '';\n for(let x=0;x<10;x++) {\n for(let i=0;i<4;i++) {\n for(let j=0;j<4;j++){\n result += `
@{i+j}
`;\n }\n }\n }\n return result;\n @>\n
\n <@ return data.prices.reduce((accum, val) => accum += val) / data.prices.length; @>\n
\n
\n <@\n switch(data.dayIdx) {\n case 0:\n return 'Sunday';\n case 1:\n return 'Monday';\n case 2:\n return 'Tuesday';\n case 3:\n return 'Wednesday';\n case 4:\n return 'Thursday';\n case 5:\n return 'Friday';\n case 6:\n return 'Saturday';\n }\n @>\n
\n" ], "githubRepo": { "firstCommit": 2018, "stars": 4, "subscribers": 1, "created": 2018, "updated": 2019, "description": "A minimalistic templating language that lets you generate markup with JavaScript.", "forks": 0, "issues": 0, "url": "https://github.com/maelswarm/exkited" }, "repoStats": { "firstCommit": 2018, "commits": 19, "committers": 2, "files": 12 } }, "expect": { "title": "Expect", "appeared": 1990, "type": "pl", "website": "http://core.tcl.tk/expect/index", "country": [ "Various" ], "originCommunity": [ "www.tcl.tk/community/coreteam" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# Assume $remote_server, $my_user_id, $my_password, and $my_command were read in earlier\n# in the script.\n# Open a telnet session to a remote server, and wait for a username prompt.\nspawn telnet $remote_server\nexpect \"username:\"\n# Send the username, and then wait for a password prompt.\nsend \"$my_user_id\\r\"\nexpect \"password:\"\n# Send the password, and then wait for a shell prompt.\nsend \"$my_password\\r\"\nexpect \"%\"\n# Send the prebuilt command, and then wait for another shell prompt.\nsend \"$my_command\\r\"\nexpect \"%\"\n# Capture the results of the command into a variable. This can be displayed, or written to disk.\nset results $expect_out(buffer)\n# Exit the telnet session, and wait for a special end-of-file character.\nsend \"exit\\r\"\nexpect eof" ], "wikipedia": { "example": [ "#timeout is a predefined variable in expect which by default is set to 10 sec\n#spawn_id is another default variable in expect.\n#It is good practice to close spawn_id handle created by spawn command\nset timeout 60\nspawn ssh $user@machine\nwhile {1} {\n expect {\n\n eof {break}\n \"The authenticity of host\" {send \"yes\\r\"}\n \"password:\" {send \"$password\\r\"}\n \"*\\]\" {send \"exit\\r\"}\n }\n}\nwait\nclose $spawn_id" ], "related": [ "tcl", "unix", "regex", "python", "ruby", "perl" ], "summary": "Expect, an extension to the Tcl scripting language written by Don Libes, is a program to automate interactions with programs that expose a text terminal interface. Expect was originally written in 1990 for Unix systems, but has since become available for Microsoft Windows and other systems.", "pageId": 1161030, "created": 2004, "backlinksCount": 52, "revisionCount": 273, "dailyPageViews": 198, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Expect" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1622", "fileType": "text", "wordRank": 2323, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20170525|World Scientific Publishing|Expect The Unexpected: A First Course In Biostatistics|Raluca Balan; Gilles Lamothe|9789813209084\n2015|Apress|Windows 10 Primer: What to Expect from Microsoft's New Operating System|Halsey, Mike|9781484210468\n2021|World Scientific Publishing Company|Expect the Unexpected: A First Course in Biostatistics (Second Edition)|Raluca Balan|9789813209060" }, "explan": { "title": "EXPLAN", "appeared": 1994, "type": "pl", "description": "A programming language for complex visual stimuli presentation.", "reference": [ "https://semanticscholar.org/paper/df957eb6ec852649f00907d520742acc3178920a" ], "country": [ "Italy" ], "originCommunity": [ "Datitalia Processing" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6701", "centralPackageRepositoryCount": 0, "isbndb": "" }, "explor": { "title": "EXPLOR", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/597c70028c7bb1956a558d0f856cb61e476feff4" ], "country": [ "United States" ], "originCommunity": [ "Bell Laboratories", "University of California,Santa Cruz" ], "influencedBy": [ "fortran" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4101", "centralPackageRepositoryCount": 0, "isbndb": "" }, "explorer": { "title": "Explorer", "appeared": 2020, "type": "visual", "screenshot": "https://pldb.com/screenshots/explorer.png", "demoVideo": [ "https://www.youtube.com/watch?v=0l2QWH-iV3k" ], "creators": [ "Hannah Ritchie", "Breck Yunits", "Shahid Ahmad" ], "description": "Programs are encoded as TSVs so are easy to read+write from a spreadsheet IDE, code, or plain text editor.", "reference": [ "https://github.com/owid/owid-grapher/tree/master/explorer" ], "aka": [ "Hannah" ], "originCommunity": [ "Our World In Data" ], "related": [ "6gunz" ], "influencedBy": [ "treesheets" ], "visualParadigm": true, "hasTernaryOperators": { "example": "", "value": false }, "example": [ "selection\tCanada~India\t\t\t\ntitle\tPopulation of different countries\t\t\t\nsubtitle\tHow many people live in each country?\t\t\t\ntype\tDiscreteBar\t\t\t\nhasMapTab\ttrue\t\t\t\nhideControls\ttrue\t\t\t\nySlugs\tPopulation\t\t\t\ntable\t\t\t\t\n\tCountry\tPopulation\tYear\tMapleleafsInFlag\n\tCanada\t32000000\t2020\t1\n\tIndia\t1000000000\t2020\t0\n\tFrance\t50000000\t2020\t0\ncolumns\t\t\t\t\n\tslug\ttype\tname\tnotes\n\tCountry\tEntityName\tCountry\tUnreviewed\n\tPopulation\tNumeric\tPopulation\tUnreviewed\n\tYear\tYear\tYear\tUnreviewed\n\tMapleleafsInFlag\tNumeric\tMapleleafsInFlag\tUnreviewed" ], "isOpenSource": true }, "express": { "title": "EXPRESS", "appeared": 2004, "type": "dataNotation", "country": [ "Switzerland" ], "originCommunity": [ "International Organization for Standardization" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "example": [ "SCHEMA Family;\n\nENTITY Person\n ABSTRACT SUPERTYPE OF (ONEOF (Male, Female));\n name: STRING;\n mother: OPTIONAL Female;\n father: OPTIONAL Male;\nEND_ENTITY;\n\nENTITY Female\n SUBTYPE OF (Person);\nEND_ENTITY;\n\nENTITY Male\n SUBTYPE of (Person);\nEND_ENTITY;\n\nEND_SCHEMA;" ], "wikipedia": { "summary": "EXPRESS is a standard data modeling language for product data. EXPRESS is formalized in the ISO Standard for the Exchange of Product model STEP (ISO 10303), and standardized as ISO 10303-11.", "backlinksCount": 454, "pageId": 8075592, "dailyPageViews": 168, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/EXPRESS_(data_modeling_language)" }, "leachim6": { "filepath": "e/Express.js", "fileExtensions": [ "js" ], "example": [ "const express = require('express')\nconst app = express()\n\napp.get('/', (_, res) => res.send(\"Hello World\"))\n\napp.listen(8080)\n" ], "id": "Express" } }, "expresso": { "title": "expresso", "appeared": 2012, "type": "pl", "creators": [ "Tim Williams" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/willtim/Expresso" ], "example": [ "let sqmag = {x, y} -> x*x + y*y" ], "githubRepo": { "firstCommit": 2012, "stars": 291, "forks": 15, "subscribers": 17, "created": 2012, "updated": 2022, "description": "A simple expressions language with polymorphic extensible row types.", "issues": 6, "url": "https://github.com/willtim/Expresso" }, "repoStats": { "firstCommit": 2012, "commits": 78, "committers": 9, "files": 22 }, "semanticScholar": "" }, "ext": { "title": "Extended file system", "appeared": 1992, "type": "filesystem", "country": [ "United States" ], "originCommunity": [ "The Linux Foundation" ], "wikipedia": { "related": [ "linux", "ext2", "ext3", "ext4" ], "summary": "The extended file system, or ext, was implemented in April 1992 as the first file system created specifically for the Linux kernel. It has metadata structure inspired by the traditional Unix File System (UFS) and was designed by Rémy Card to overcome certain limitations of the MINIX file system. It was the first implementation that used the virtual file system (VFS), for which support was added in the Linux kernel in version 0.96c, and it could handle file systems up to 2 gigabytes (GB) in size.ext was the first in the series of extended file systems. In 1993 it was superseded by both ext2 and xiafs, which competed for a time, but ext2 won because of its long-term viability: ext2 remedied issues with ext, such as the immutability of inodes and fragmentation.", "pageId": 986581, "created": 2004, "backlinksCount": 169, "revisionCount": 89, "dailyPageViews": 82, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Extended_file_system" }, "fileType": "text", "wordRank": 5470, "centralPackageRepositoryCount": 0 }, "ext2": { "title": "Ext2", "appeared": 1993, "type": "filesystem", "country": [ "United States" ], "originCommunity": [ "The Linux Foundation" ], "wikipedia": { "related": [ "linux", "ext", "ext3", "ext4" ], "summary": "The ext2 or second extended file system is a file system for the Linux kernel. It was initially designed by Rémy Card as a replacement for the extended file system (ext). Having been designed according to the same principles as the Berkeley Fast File System from BSD, it was the first commercial-grade filesystem for Linux.The canonical implementation of ext2 is the \"ext2fs\" filesystem driver in the Linux kernel. Other implementations (of varying quality and completeness) exist in GNU Hurd, MINIX 3, some BSD kernels, in MiNT, and as third-party Microsoft Windows and macOS drivers. ext2 was the default filesystem in several Linux distributions, including Debian and Red Hat Linux, until supplanted more recently by ext3, which is almost completely compatible with ext2 and is a journaling file system. ext2 is still the filesystem of choice for flash-based storage media (such as SD cards and USB flash drives) because its lack of a journal increases performance and minimizes the number of writes, and flash devices have a limited number of write cycles. However, recent Linux kernels support a journal-less mode of ext4 which provides benefits not found with ext2.", "pageId": 39194, "created": 2002, "backlinksCount": 322, "revisionCount": 489, "dailyPageViews": 141, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Ext2" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nDeveloper Experience Linux Ext2 Filesystem Japanese Edition||Nina Petipa|50330336|0.0|0|0" }, "ext3": { "title": "Ext3", "appeared": 2001, "type": "filesystem", "country": [ "United States" ], "originCommunity": [ "The Linux Foundation" ], "wikipedia": { "related": [ "linux", "ext2", "ext4" ], "summary": "ext3, or third extended filesystem, is a journaled file system that is commonly used by the Linux kernel. It used to be the default file system for many popular Linux distributions. Stephen Tweedie first revealed that he was working on extending ext2 in Journaling the Linux ext2fs Filesystem in a 1998 paper, and later in a February 1999 kernel mailing list posting. The filesystem was merged with the mainline Linux kernel in November 2001 from 2.4.15 onward. Its main advantage over ext2 is journaling, which improves reliability and eliminates the need to check the file system after an unclean shutdown. Its successor is ext4.", "pageId": 39195, "created": 2002, "backlinksCount": 325, "revisionCount": 789, "dailyPageViews": 191, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Ext3" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ext4": { "title": "Ext4", "appeared": 2008, "type": "filesystem", "country": [ "United States" ], "originCommunity": [ "The Linux Foundation" ], "wikipedia": { "related": [ "linux", "freebsd", "ext3", "ext2", "android" ], "summary": "The ext4 or fourth extended filesystem is a journaling file system for Linux, developed as the successor to ext3.", "pageId": 5767923, "created": 2006, "backlinksCount": 330, "revisionCount": 779, "dailyPageViews": 425, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Ext4" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "extempore": { "title": "Extempore", "appeared": 2011, "type": "pl", "description": "Extempore is a programming language and runtime environment designed to support cyberphysical programming, where a human programmer operates as an active agent in the world.", "website": "https://extemporelang.github.io/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/extemporelang" ], "domainName": { "awisRank": { "2022": 11830198 }, "name": "extemporelang.github.io" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "xtm" ], "id": "xtlang" } }, "extended-ml": { "title": "Extended ML", "appeared": 1985, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Edinburgh" ], "wikipedia": { "related": [ "standard-ml" ], "summary": "Extended ML is a wide-spectrum language covering both specification and implementation and based on the ML programming language. It extends the syntax of ML to include axioms, which need not be executable but can rigorously specify the behavior of the program. With this addition the language can be used for stepwise refinement, proceeding gradually from an initial formal specification to eventually yield an executable Standard ML program. Correctness of the final executable SML program with respect to the original specification can then be established by proving the correctness of each of the refinement steps. Extended ML is used for research into and teaching of formal program development and specification, and research into automatic program verification. Extended ML is neither related to the programming language Extensible ML (other than being similarly derived from ML), nor to the specification language eXtensible Markup Language.", "created": 2004, "backlinksCount": 9, "pageId": 957110, "revisionCount": 29, "dailyPageViews": 4, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Extended_ML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1140", "fileType": "text", "centralPackageRepositoryCount": 0 }, "extended-pascal": { "title": "Extended Pascal", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f5a9c81e0085af8b4f9d3da8aa4df8883057e1e8" ], "country": [ "United States" ], "originCommunity": [ "North Carolina State University" ], "supersetOf": [ "pascal" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1685", "centralPackageRepositoryCount": 0 }, "extensible-embeddable-language": { "title": "Extensible Embeddable Language", "appeared": 2005, "type": "pl", "creators": [ "David Olofson" ], "country": [ "Sweden" ], "originCommunity": [ "https://github.com/olofson" ], "wikipedia": { "example": [ "export function main\n{\n print(\"Recursion test 1:\\n\");\n \n procedure recurse(arg)\n {\n print(\"arg = \", arg, \"\\n\");\n if arg\n recurse(arg - 1);\n }\n \n recurse(10);\n \n print(\"Recursion test 2; Mutual Recursion:\\n\");\n \n procedure mrecurse2(arg);\n \n procedure mrecurse1(arg)\n {\n print(\"arg = \", arg, \"\\n\");\n if arg\n mrecurse2(arg);\n }\n \n procedure mrecurse2(arg)\n {\n mrecurse1(arg - 1);\n };\n \n mrecurse1(10);\n \n print(\"Recursion test 2; Mutual Recursion with Function Reference:\\n\");\n \n procedure mrrecurse1(arg, fn)\n {\n print(\"arg = \", arg, \"\\n\");\n if arg\n fn(arg, fn);\n }\n \n local mrr2 = procedure (arg, fn)\n {\n mrrecurse1(arg - 1, fn);\n };\n \n mrrecurse1(10, mrr2);\n \n print(Recursion tests done.\\n);\n return 0;\n}" ], "related": [ "lua", "c", "pascal" ], "summary": "The Extensible Embeddable Language (EEL) is a scripting and programming language in development by David Olofson. EEL is intended for scripting in realtime systems with cycle rates in the kHz range, such as musical synthesizers and industrial control systems, but also aspires to be usable as a platform independent general purpose programming language.", "created": 2006, "backlinksCount": 13, "pageId": 6848938, "revisionCount": 30, "dailyPageViews": 5, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Extensible_Embeddable_Language" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "extran": { "title": "EXTRAN", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8d307ce18adc9aaba810b77c6ee677128dc7321e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5474", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "ez": { "title": "EZ", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fab2ddbaf0a5ceaa0fe2e264cde5308307b1097f" ], "country": [ "United States" ], "originCommunity": [ "Princeton University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1082", "wordRank": 8555, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2007-10-30|Packt Publishing|Managing eZ Publish Web Content Management Projects|Martin Bauer|9781847191724\n2009-10-20|Packt Publishing|eZ Publish 4: Enterprise Web Sites Step-by-Step|Francesco Fullone and Francesco Trucchia|9781904811640\n20091020|Packt Publishing|eZ Publish 4: Enterprise Web Sites Step-by-Step|Francesco Fullone; Francesco Trucchia|9781847190505" }, "ezhil": { "title": "Ezhil", "appeared": 2007, "type": "pl", "creators": [ "Muthu Annamalai" ], "website": "http://ezhillang.org", "country": [ "United States" ], "originCommunity": [ "Google scholar" ], "domainName": { "registered": 2021, "name": "ezhillang.org" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "booleanTokens": [ [ "True", "False" ] ], "wikipedia": { "example": [ "நிரல்பாகம் yin(radius, color1, color2)\n #turtle_width(3)\n turtle_color(\"black\")\n turtle_fill(True)\n turtle_circle(radius/2., 180)\n turtle_circle(radius, 180)\n turtle_left(180)\n turtle_circle( -1*radius/2.0 , 180 )\n turtle_color(color1)\n turtle_fill(True)\n turtle_color(color2)\n turtle_left(90)\n turtle_up()\n turtle_forward(radius*0.375)\n turtle_right(90)\n turtle_down()\n turtle_circle(radius*0.125)\n turtle_left(90)\n turtle_fill(False)\n turtle_up()\n turtle_backward(radius*0.375)\n turtle_down()\n turtle_left(90)\nமுடி\n\nநிரல்பாகம் main()\n #turtle_reset()\n yin(200, \"white\", \"black\")\n yin(200, \"black\", \"white\")\n turtle_ht()\n pause( \"Done! Hit enter to quit\", 5)\nமுடி\n\nmain()" ], "related": [ "linux", "logo", "basic", "python" ], "summary": "Ezhil, in Tamil language script (எழில்), is a compact, open source, interpreted, programming language, originally designed to enable native-Tamil speaking students, K-12 age-group to learn computer programming, and enable learning numeracy and computing, outside of linguistic expertise in predominately English language-based computer systems. In the Ezhil programming language, Tamil keywords and language-grammar are chosen to easily enable the native Tamil speaker write programs in the Ezhil system. Ezhil allows easy representation of computer program closer to the Tamil language logical constructs equivalent to the conditional, branch and loop statements in modern English based programming languages. Ezhil is the first freely available programming language in the Tamil language and one of many known non-English-based programming languages. The language was officially announced in July 2009, while it has been developed since late 2007.", "pageId": 39845825, "dailyPageViews": 19, "created": 2013, "backlinksCount": 7, "revisionCount": 53, "appeared": 2007, "fileExtensions": [ "n" ], "url": "https://en.wikipedia.org/wiki/Ezhil_(programming_language)" }, "pygmentsHighlighter": { "filename": "ezhil.py", "fileExtensions": [ "n" ], "id": "Ezhil" }, "helloWorldCollection": [ "# Hello world in Ezhil\n\nபதிப்பி \"வணக்கம்!\"\nபதிப்பி \"உலகே வணக்கம்\"\nபதிப்பி \"******* நன்றி!. *******\"\nexit()" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Ezhil", "rijuRepl": { "example": [ "பதிப்பி \"வணக்கம், உலகமே!\"\n" ], "id": "https://riju.codes/ezhil" }, "twitter": "https://twitter.com/ezhillang", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "f-prime": { "title": "F Prime", "appeared": 2017, "type": "library", "creators": [ "Timothy Canham" ], "description": "F' - A flight software and embedded systems framework", "website": "https://nasa.github.io/fprime/", "aka": [ "F'" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/nasa/" ], "githubRepo": { "firstCommit": 2017, "stars": 8970, "forks": 1144, "subscribers": 272, "created": 2017, "updated": 2022, "description": "F' - A flight software and embedded systems framework", "issues": 95, "url": "https://github.com/nasa/fprime" } }, "f-script": { "title": "F-Script", "appeared": 2009, "type": "pl", "creators": [ "Philippe Mougin" ], "website": "https://github.com/pmougin/F-Script", "country": [ "United States" ], "originCommunity": [ "https://github.com/pmougin" ], "githubRepo": { "firstCommit": 2009, "stars": 113, "forks": 58, "subscribers": 9, "created": 2009, "updated": 2022, "issues": 2, "url": "https://github.com/pmougin/f-script" }, "repoStats": { "firstCommit": 2009, "commits": 13, "committers": 2, "files": 442 }, "wikipedia": { "related": [ "x86-isa", "smalltalk", "apl" ], "summary": "F-Script is an object-oriented scripting programming language for Apple's macOS operating system developed by Philippe Mougin. F-Script is an interactive language based on Smalltalk, using macOS's native Cocoa API.", "pageId": 899874, "created": 2004, "backlinksCount": 43, "revisionCount": 56, "dailyPageViews": 14, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/F-Script_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5441", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "f-sharp": { "title": "F#", "appeared": 2005, "type": "pl", "creators": [ "Don Syme" ], "website": "http://fsharp.org", "documentation": [ "https://learn.microsoft.com/en-us/dotnet/fsharp/" ], "reference": [ "https://docs.microsoft.com/en-us/dotnet/fsharp/language-reference/index" ], "aka": [ "f#", "fsharp" ], "fileExtensions": [ "fs", "fsi", "fsx", "fsscript" ], "country": [ "United Kingdom" ], "originCommunity": [ "Microsoft Research" ], "domainName": { "awisRank": { "2017": 443419, "2022": 560999 }, "name": "fsharp.org" }, "releaseNotesUrl": "https://github.com/dotnet/fsharp/blob/main/release-notes.md", "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasDocComments": { "example": "/// Adds 2 numbers\nlet rec add x y =\n x + y", "value": true }, "hasDirectives": { "example": "#if VERSION1\nlet function1 x y =\n printfn \"x: %d y: %d\" x y\n x + 2 * y\n#else\nlet function1 x y =\n printfn \"x: %d y: %d\" x y\n x - 2*y\n#endif\n// Line directives as source maps can be used when compiling to F#:\n#line 25 \"C:\\\\Projects\\\\MyProject\\\\MyProject\\\\Script1\"", "value": true }, "hasImports": { "example": "open module-or-namespace-name\nopen System.IO\nopen List\nopen Seq", "value": true }, "hasNamespaces": { "example": "namespace Widgets\ntype MyWidget1 =\n member this.WidgetName = \"Widget1\"\nmodule WidgetsModule =\n let widgetName = \"Widget2\"", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasUnitsOfMeasure": { "example": "// https://fsharpforfunandprofit.com/posts/units-of-measure/\n[] type N = kg m/sec^2\n\nlet force1 = 5.0 \nlet force2 = 5.0\n\nforce1 = force2 // true", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "// 0[oO][0-7][0-7_]*[uU]?[yslLn]?", "value": true }, "hasHexadecimals": { "example": "// 0[xX][\\da-fA-F][\\da-fA-F_]*[uU]?[yslLn]?[fF]?", "value": true }, "hasFloats": { "example": "// -?\\d[\\d_]*(.[\\d_]*)?([eE][+\\-]?\\d[\\d_]*)[fFmM]?", "value": true }, "hasIntegers": { "example": "// \\d[\\d_]*[uU]?[yslLnQRZINGmM]?", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01][01_]*[uU]?[yslLn]?", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "(*", "*)" ] ], "printToken": [ [ "printfn" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "and", "atomic", "as", "assert", "asr", "base", "begin", "break", "checked", "component", "const", "constraint", "constructor", "continue", "class", "default", "delegate", "do", "done", "downcast", "downto", "elif", "else", "end", "exception", "eager", "event", "external", "extern", "false", "finally", "for", "fun", "function", "fixed", "functor", "global", "if", "in", "include", "inherit", "inline", "interface", "internal", "land", "lor", "lsl", "lsr", "lxor", "lazy", "let", "match", "member", "mod", "module", "mutable", "namespace", "method", "mixin", "new", "not", "null", "of", "open", "or", "object", "override", "private", "parallel", "process", "protected", "pure", "public", "rec", "return", "static", "sealed", "struct", "sig", "then", "to", "true", "tailcall", "trait", "try", "type", "upcast", "use", "val", "void", "virtual", "volatile", "when", "while", "with", "yield" ], "wikipedia": { "example": [ "/// A simple prime number detector\nlet isPrime (n:int) =\n let bound = int (sqrt (float n))\n seq {2 .. bound} |> Seq.forall (fun x -> n % x <> 0)\n\n// We are using async workflows\nlet primeAsync n =\n async { return (n, isPrime n) }\n\n/// Return primes between m and n using multiple threads\nlet primes m n =\n seq {m .. n}\n |> Seq.map primeAsync\n |> Async.Parallel\n |> Async.RunSynchronously\n |> Array.filter snd\n |> Array.map fst\n\n// Run a test\nprimes 1000000 1002000\n |> Array.iter (printfn \"%d\")" ], "summary": "F# (pronounced F sharp) is a strongly typed, multi-paradigm programming language that encompasses functional, imperative, and object-oriented programming methods. F# is most often used as a cross-platform Common Language Infrastructure (CLI) language, but it can also generate JavaScript and graphics processing unit (GPU) code. F# is developed by the F# Software Foundation, Microsoft and open contributors. An open source, cross-platform compiler for F# is available from the F# Software Foundation. F# is also a fully supported language in Visual Studio and Xamarin Studio. Other tools supporting F# development include Mono, MonoDevelop, SharpDevelop, MBrace and WebSharper. Plug-ins supporting F# exist for many widely used editors, most notably the Ionide extension for Atom and Visual Studio Code, and integrations for other editors such as Vim, Emacs, and Sublime Text. F# is member of the ML language family and originated as a .NET Framework implementation of a core of the programming language OCaml, It has also been influenced by C#, Python, Haskell, Scala, and Erlang.", "pageId": 239964, "dailyPageViews": 619, "created": 2003, "backlinksCount": 429, "revisionCount": 714, "appeared": 2005, "fileExtensions": [ "fs", "fsi", "fsx", "fsscript" ], "url": "https://en.wikipedia.org/wiki/F_Sharp_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "fs", "fsi", "fsx" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ndotnet fsharp https://github.com/dotnet.png https://github.com/dotnet/fsharp F# #b845fc 1919 476 39 \"The F# compiler, FSharp.Core library, and tools for F#\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "codemirrorMode": "mllike", "codemirrorMimeType": "text/x-fsharp", "tmScope": "source.fsharp", "aliases": [ "fsharp" ], "id": "F#" }, "githubBigQuery": { "repos": 5877, "users": 3845, "id": "F#" }, "monaco": "fsharp", "pygmentsHighlighter": { "filename": "dotnet.py", "fileExtensions": [ "fs", "fsi" ], "id": "F#" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2017, "committerCount": 6, "commitCount": 347, "sampleCount": 8, "example": [ "module Sample\n\nopen System\n\ntype Foo =\n {\n Bar : string\n }\n\ntype Baz = interface end\n\nlet Sample1(xs : int list) : string =\n xs\n |> List.map (fun x -> string x)\n |> String.concat \",\"\n" ], "url": "https://github.com/fsprojects/atom-fsharp" }, "projectEuler": { "memberCount": { "2019": 1199, "2022": 1245 }, "id": "F#" }, "helloWorldCollection": [ "(* Hello World in F# *)\n\nprintf \"Hello World!\\n\"" ], "leachim6": { "filepath": "f/FSharp.fs", "fileExtensions": [ "fs" ], "example": [ "printfn \"Hello World\"\n" ], "id": "FSharp" }, "quineRelay": "F#", "compilerExplorer": { "example": [ "module Program\n\nlet square num = num * num\n" ], "id": "F#" }, "rijuRepl": { "example": [ "printfn \"Hello, world!\"\n" ], "id": "https://riju.codes/fsharp" }, "replit": "https://repl.it/languages/fsharp", "stackOverflowSurvey": { "2021": { "users": 804, "medianSalary": 81037, "fans": 2157, "percentageUsing": 0.01 } }, "faqPageUrl": [ "https://forums.fsharp.org/" ], "meetup": { "memberCount": 37224, "groupCount": 128, "url": "https://www.meetup.com/topics/f-programming" }, "tiobe": { "id": "F#" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3716", "packageRepository": [ "https://www.nuget.org/" ], "ubuntuPackage": "fsharp", "jupyterKernel": [ "https://github.com/fsprojects/IfSharp" ], "fileType": "text", "isOpenSource": true, "isbndb": "", "semanticScholar": "" }, "f": { "title": "F", "appeared": 1996, "type": "pl", "country": [ "United States" ], "originCommunity": [ "The Fortran Company" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "program main\n ! Insert code here\nend program main" ], "related": [ "f-sharp", "fstar", "fortran" ], "summary": "F is a modular, compiled, numeric programming language, designed for scientific programming and scientific computation. F was developed as a modern Fortran, thus making it a subset of Fortran 95. It combines both numerical and data abstraction features from these languages. F is also backwards compatible with Fortran 77, allowing calls to Fortran 77 programs. F was first included in the g95 compiler.", "pageId": 1283488, "created": 2004, "backlinksCount": 18, "revisionCount": 59, "dailyPageViews": 52, "url": "https://en.wikipedia.org/wiki/F_(programming_language)" }, "leachim6": { "filepath": "f/F.f95", "fileExtensions": [ "f95" ], "example": [ "program hello\n print *, \"Hello World\"\nend program hello\n" ], "id": "F" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:F", "hopl": "https://hopl.info/showlanguage.prx?exp=3460", "fileType": "text", "wordRank": 213, "centralPackageRepositoryCount": 0 }, "fable-lang": { "title": "Fable", "appeared": 2012, "type": "pl", "description": "Fable is a compiler that brings F# into the JavaScript ecosystem", "website": "https://fable.io/", "country": [ "Various" ], "originCommunity": [ "https://github.com/fable-compiler" ], "domainName": { "registered": 2012, "awisRank": { "2022": 1587455 }, "name": "fable.io" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "printfn" ] ], "example": [ "type Face =\n | Ace | King | Queen | Jack\n | Number of int\ntype Color =\n | Spades | Hearts | Diamonds | Clubs\ntype Card =\n | Face * Color\nlet aceOfHearts = Ace, Hearts\nlet tenOfSpades = (Number 10), Spades\nmatch card with\n| Ace, Hearts -> printfn \"Ace Of Hearts!\"\n| _, Hearts -> printfn \"A lovely heart\"\n| (Number 10), Spades -> printfn \"10 of Spades\"\n| _, (Diamonds|Clubs) -> printfn \"Diamonds or clubs\"\n// Warning:\n// Incomplete pattern matches on this expression.\n// For example, the value '(_,Spades)' may indicate\n// a case not covered by the pattern(s)." ], "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Fable II: Design of a modular robot for creative learning|10.1109/ICRA.2015.7140060|14|4|Moises Pacheco and Rune Fogh and H. Lund and D. Christensen|c80b749e59a1554af30e0aa2df59ae2a0827e2e7" }, "fable": { "title": "Fable", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/65a0e53cfd0a4aea51c16ad8693ce8d39734c2ef" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4401", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Fable II: Design of a modular robot for creative learning|10.1109/ICRA.2015.7140060|14|4|Moises Pacheco and Rune Fogh and H. Lund and D. Christensen|c80b749e59a1554af30e0aa2df59ae2a0827e2e7" }, "fac": { "title": "FAC", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fe9de20529284c3ae862ef594f92101bf154afad" ], "country": [ "Unknown" ], "originCommunity": [ "GTE Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1223", "centralPackageRepositoryCount": 0 }, "facelets": { "title": "Facelets", "appeared": 2005, "type": "template", "country": [ "United States" ], "originCommunity": [ "https://javaee.github.io" ], "wikipedia": { "example": [ "\n \n \n \n \n" ], "related": [ "java", "xml", "java-server-pages" ], "summary": "In computing, Facelets is an open-source Web template system under the Apache license and the default view handler technology (aka view declaration language) for JavaServer Faces (JSF). The language requires valid input XML documents to work. Facelets supports all of the JSF UI components and focuses completely on building the JSF component tree, reflecting the view for a JSF application. Although both JSP and JSF technologies have been improved to work better together, Facelets eliminates the issues noted in Hans Bergsten's article \"Improving JSF by Dumping JSP\"Facelets draws on some of the ideas from Apache Tapestry, and is similar enough to draw comparison. The project is conceptually similar to Tapestry's, which treats blocks of HTML elements as framework components backed by Java classes. Facelets also has some similarities to the Apache Tiles framework with respect to support templating as well as composition. Facelets was originally created by Jacob Hookom in 2005 as a separate, alternative view declaration language for JSF 1.1 and JSF 1.2 that both used JSP as the default view declaration language. Starting from JSF 2.0, Facelets has been promoted by the JSF expert group to be the default view declaration language. JSP has been deprecated as a legacy fall back.", "backlinksCount": 21, "pageId": 20234648, "created": 2008, "revisionCount": 129, "dailyPageViews": 28, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Facelets" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "fact-lang": { "title": "FaCT", "appeared": 2017, "type": "pl", "creators": [ "Deian Stefan" ], "description": "FaCT is a domain-specific language that aids you in writing constant-time code for cryptographic routines that need to be free from timing side channels. This is the compiler for the Flexible and Constant Time cryptographic programming language. Real-world cryptographic code is often written in a subset of C intended to execute in constant-time, thereby avoiding timing side channel vulnerabilities. This C subset eschews structured programming as we know it: if-statements, looping constructs, and procedural abstractions can leak timing information when handling sensitive data. The resulting obfuscation has led to subtle bugs, even in widely-used high-profile libraries like OpenSSL. To address the challenge of writing constant-time cryptographic code, we present FaCT, a crypto DSL that provides high-level but safe language constructs. The FaCT compiler uses a secrecy type system to automatically transform potentially timing-sensitive high-level code into low-level, constant-time LLVM bitcode. We develop the language and type system, formalize the constant-time transformation, and present an empirical evaluation that uses FaCT to implement core crypto routines from several open-source projects including OpenSSL, libsodium, and curve25519-donna. Our evaluation shows that FaCT's design makes it possible to write \\emph{readable}, high-level cryptographic code, with \\emph{efficient}, \\emph{constant-time} behavior.", "reference": [ "https://ranjitjhala.github.io/static/fact_dsl.pdf" ], "aka": [ "FACT" ], "country": [ "United States and Germany and France and Spain" ], "originCommunity": [ "University of California San Diego", "Stanford University", "PI for Security and Privacy", "Inria Sophia Antipolis", "IMDEA Software Institute" ], "subsetOf": [ "c" ], "example": [ "void\nswap_conditional(secret mut uint64[5] a, secret mut uint64[5] b, secret uint64 swapi) {\n if (swapi == 1) {\n for (uint32 i from 0 to 5) {\n secret uint64 x = a[i];\n a[i] = b[i];\n b[i] = x;\n }\n }\n}" ], "githubRepo": { "firstCommit": 2016, "stars": 92, "forks": 11, "subscribers": 15, "created": 2016, "updated": 2022, "description": "Flexible and Constant Time Programming Language", "issues": 1, "url": "https://github.com/PLSysSec/FaCT" }, "repoStats": { "firstCommit": 2016, "commits": 1206, "committers": 20, "files": 86 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|DeFacto: Language-Parametric Fact Extraction from Source Code|10.1007/978-3-642-00434-6_17|14|1|H. Basten and P. Klint|a25ddb85adfff458d4829bcbf16db3d64fce7517" }, "fact": { "title": "Fully Automated Compiling Technique", "appeared": 1959, "type": "pl", "description": "FACT is an early discontinued computer programming language, created by the Datamatic Division of Minneapolis Honeywell for its model 800 series business computers in 1959. FACT was an acronym for \"Fully Automated Compiling Technique\". It was an influence on the design of the COBOL programming language.", "standsFor": "Fully Automated Compiling Technique", "country": [ "United States" ], "originCommunity": [ "Computer Sciences Corporation", "Honeywell" ], "wikipedia": { "example": [ "L 1 PAGE-HEADING BATCH NO. ^ IN ERROR PAGE ^\nL 2 COLUMN-HEADING EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS\nL 3 ERROR-LINE ^ .^ ^ .^ ^ .^ ^ .^ ^ .^ ^ .^ ^ .^ ^ .^\nL 4 BOND-HEADING BOND ORDERS EMP. NO. NAME DATE BOND PAGE ^\nL 5 BONDORDER-LINE ^ ^ ^- ^- ^ . ^\nL 6 DEL-HEADING TERMINATIONS EMP. NO. DATE NAME BOND CR. TOTALS.. GROSS TAX FICA INSUR RET PAGE ^\nL 7 DELETIONS-LINE ^ ^- ^- ^ ^ . ^ . ^ . ^ . ^ . ^ . ^\nL 8 ERROR-HEADING ERRORS... EMP. NO. DATE TYPE PAGE ^\nL 9 ERROR-LINE ^ ^- ^- ^ ^\nL 10 TITLE-LINE PLACE CHECK FORM IN PRINTER\nL 12 1PAYLINE ^ ^/ ^/ ^ .^ ^/ ^/ ^\nL 13 2PAYLINE . ^ . ^ . ^ .^ . ^\nL 14 3PAYLINE ^ $****. ^ . ^ . ^" ], "related": [ "cobol" ], "summary": "FACT is an early discontinued computer programming language, created by the Datamatic Division of Minneapolis Honeywell for its model 800 series business computers in 1959. FACT was an acronym for \"Fully Automated Compiling Technique\". It was an influence on the design of the COBOL programming language. Some of the design of FACT was based on the linguistic project Basic English, developed about 1925 by C.K. Ogden. The software was actually designed by Computer Sciences Corporation (Fletcher Jones, Roy Nutt, and Robert L. Patrick) under contract to Richard Clippinger of Honeywell.", "pageId": 20497946, "created": 2008, "backlinksCount": 10, "revisionCount": 40, "dailyPageViews": 7, "appeared": 1959, "url": "https://en.wikipedia.org/wiki/FACT_(computer_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=68", "fileType": "text", "wordRank": 854, "centralPackageRepositoryCount": 0 }, "factor": { "title": "Factor", "appeared": 2003, "type": "pl", "creators": [ "Slava Pestov" ], "website": "https://factorcode.org/", "reference": [ "https://docs.google.com/document/d/17IddUbocCQhmx_mCcycij6Dmmn-c0ReZqLWzY-idt-Q/edit" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/factor" ], "domainName": { "registered": 2005, "awisRank": { "2017": 2667281, "2022": 3422932 }, "name": "factorcode.org" }, "hasComments": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasMacros": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 1282, "forks": 159, "subscribers": 61, "created": 2009, "updated": 2022, "firstCommit": 2007, "description": "Factor programming language", "issues": 622, "url": "https://github.com/factor/factor" }, "repoStats": { "firstCommit": 2007, "commits": 39334, "committers": 293, "files": 11375 }, "wikipedia": { "example": [ ": make-html ( string -- xml )\n dup\n \n <->\n

<->

\n \n XML> ;" ], "related": [ "linux", "joy", "forth", "lisp", "self", "java", "scheme", "c", "java-bytecode", "reverse-polish-notation", "xml", "opengl", "postgresql", "sqlite", "objective-c", "fortran", "smalltalk" ], "summary": "Factor is a stack-oriented programming language created by Slava Pestov. Factor is dynamically typed and has automatic memory management, as well as powerful metaprogramming features. The language has a single implementation featuring a self-hosted optimizing compiler and an interactive development environment. The Factor distribution includes a large standard library.", "pageId": 891398, "dailyPageViews": 44, "created": 2004, "backlinksCount": 63, "revisionCount": 238, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Factor_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "factor" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ ".factor-boot-rc", ".factor-rc" ], "aceMode": "text", "codemirrorMode": "factor", "codemirrorMimeType": "text/x-factor", "tmScope": "source.factor", "repos": 201, "id": "Factor" }, "githubBigQuery": { "repos": 111, "users": 110, "id": "Factor" }, "codeMirror": "factor", "pygmentsHighlighter": { "filename": "factor.py", "fileExtensions": [ "factor" ], "id": "Factor" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 124, "commitCount": 28257, "url": "https://github.com/slavapestov/factor" }, "projectEuler": { "memberCount": { "2019": 48, "2022": 50 }, "id": "Factor" }, "leachim6": { "filepath": "f/Factor.factor", "fileExtensions": [ "factor" ], "example": [ "USING: io ;\n\"Hello World\" print\n\n" ], "id": "Factor" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Factor", "rijuRepl": { "example": [ "IN: main\nUSE: io\n\n\"Hello, world!\" print\n" ], "id": "https://riju.codes/factor" }, "tryItOnline": "factor", "tiobe": { "id": "Factor" }, "twitter": "https://twitter.com/factorbuilds", "fileType": "text", "wordRank": 2090, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Factor: a dynamic stack-based programming language|10.1145/1899661.1869637|5|1|Sviatoslav Pestov, Daniel Ehrenberg, Joe Groff|400959dbf2be521e3cc123628e0124afcf3a8caf\n2017|An Introduction to Factor||1|0|Zackery L. Arnold|97fc83ee9c977255abffbfc1b2356f59facd8aa0" }, "fad": { "title": "FAD", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0e6b41ec5c8ff1a4ef6cfd8e86fc3f53bccfe8b1" ], "country": [ "France and United States" ], "originCommunity": [ "Inria", "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1322", "centralPackageRepositoryCount": 0 }, "falcon": { "title": "Falcon", "appeared": 2003, "type": "pl", "creators": [ "Giancarlo Niccolai" ], "website": "http://falconpl.org", "fileExtensions": [ "ftd", "fal", "fam" ], "country": [ "Italy" ], "originCommunity": [ "https://github.com/falconpl" ], "domainName": { "registered": 2005, "awisRank": { "2017": 6927367, "2022": 6280562 }, "name": "falconpl.org" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "directive lang=fr_FR // uses 5 characters ISO language code\n\n > i\"Bonjour à tout le monde!\"" ], "related": [ "perl", "lua", "smalltalk", "php", "lisp", "python", "ruby", "unicode", "xml", "postgresql", "sqlite", "json", "regex", "linux", "solaris" ], "summary": "Falcon is an open source, multi-paradigm programming language. Design and implementation is led by Giancarlo Niccolai, a native of Bologna, Italy and Information Technology graduate from Pistoia. Falcon translates computer source code to virtual machine instructions for evaluation. The virtual machine is intended to be both a stand-alone interpreter as well as for integration in third-party embedding applications. A core design consideration for the Falcon programming language is to provide acceptably high performing scripting plug-ins to multi threaded data acquisition, reporting and dispersion applications. As programming languages go, Falcon design leans more towards conciseness of code and expressiveness than general readability. The Falcon implementation does provide facilities for source level documentation and this documentation may become important as the mixed paradigm potential of Falcon scripting attempts to meet the problems faced with programming in the large.", "pageId": 21628757, "dailyPageViews": 57, "created": 2009, "backlinksCount": 66, "appeared": 2003, "fileExtensions": [ "ftd", "fal", "fam" ], "url": "https://en.wikipedia.org/wiki/Falcon_(programming_language)" }, "helloWorldCollection": [ "// Hello World in Falcon\n\n> \"Hello World!\"" ], "leachim6": { "filepath": "f/Falcon.fal", "fileExtensions": [ "fal" ], "example": [ "#!/usr/bin/env falcon\n\n> \"Hello World\"\n" ], "id": "Falcon" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Falcon", "tiobe": { "id": "Falcon" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7122", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "false": { "title": "False", "appeared": 1993, "type": "pl", "creators": [ "Wouter Van Oortmerssen" ], "website": "http://www.strlen.com/false-language/", "country": [ "United States" ], "originCommunity": [ "http://strlen.com" ], "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "example": [ "{ writes all prime numbers between 0 and 100 }\n99 9[1-$][$@$@$@$@/*=[1-$$[%1-$@]?0[$.' ,]?]?]#" ], "leachim6": { "filepath": "f/False.f", "fileExtensions": [ "f" ], "example": [ "\"Hello World\n\"\n" ], "id": "False" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:FALSE", "rijuRepl": { "example": [ "\"Hello, world!\"\n" ], "id": "https://riju.codes/false" }, "tryItOnline": "false", "wordRank": 2392, "centralPackageRepositoryCount": 0 }, "family-basic": { "title": "Family BASIC", "appeared": 1984, "type": "pl", "country": [ "Japan" ], "originCommunity": [ "Nintendo Co., Ltd", "Sharp Corporation", "Hudson Soft Co., Ltd" ], "wikipedia": { "related": [ "basic", "microsoft-basic" ], "summary": "Family BASIC or Famicom BASIC is the consumer product for programming Nintendo's Family Computer video game console of Japan. Family BASIC was launched on June 21, 1984 to consumers in Japan by Nintendo, in cooperation with Hudson Soft and Sharp Corporation. A second version titled Family BASIC V3 was released on February 21, 1985, with greater memory and new features.", "created": 2005, "backlinksCount": 274, "pageId": 2043253, "revisionCount": 118, "dailyPageViews": 64, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Family_BASIC" }, "centralPackageRepositoryCount": 0 }, "fancy": { "title": "Fancy", "appeared": 2010, "type": "pl", "website": "http://www.fancy-lang.org/", "country": [ "Germany" ], "originCommunity": [ "https://github.com/bakkdoor/fancy/issues" ], "domainName": { "registered": 2010, "name": "fancy-lang.org" }, "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2010, "stars": 260, "forks": 25, "subscribers": 14, "created": 2010, "updated": 2022, "description": "Fancy is a dynamic, object-oriented programming language inspired by Smalltalk, Ruby, Io and Erlang that runs on the Rubinius VM.", "issues": 5, "url": "https://github.com/bakkdoor/fancy" }, "repoStats": { "firstCommit": 2010, "commits": 2993, "committers": 17, "files": 332 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Fancy_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "fy", "fancypack" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "Fakefile" ], "aceMode": "text", "tmScope": "source.fancy", "repos": 27, "id": "Fancy" }, "githubBigQuery": { "repos": 113, "users": 108, "id": "Fancy" }, "pygmentsHighlighter": { "filename": "ruby.py", "fileExtensions": [ "fy", "fancypack" ], "id": "Fancy" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2017, "committerCount": 6, "commitCount": 37, "url": "https://github.com/fancy-lang/fancy-tmbundle" }, "leachim6": { "filepath": "f/Fancy.fy", "fileExtensions": [ "fy" ], "example": [ "\"Hello World\" println \n" ], "id": "Fancy" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Fancy", "fileType": "text", "wordRank": 6823, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1984|Reston Pub. Co|Fancy Programming In Ibm Pc Basic|Gabriel Cuellar|9780835918602\n1984|Workman Publishing Company|Digital Deli: The Comprehensive, User-Lovable Menu of Computer Lore, Culture, Lifestyles and Fancy|Lunch Group|9780894805912" }, "fantom": { "title": "Fantom", "appeared": 2005, "type": "pl", "website": "http://www.fantom.org", "documentation": [ "https://docs.fantom.foundation/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/fantom-lang" ], "domainName": { "registered": 2003, "awisRank": { "2022": 3280615 }, "name": "fantom.org" }, "runsOnVm": [ "jvm" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "echo" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "// Hello from Fantom!\nclass HelloWorld\n{\n static Void main()\n {\n echo(\"Hello, World!\")\n }\n}" ], "related": [ "csharp", "java", "scala", "ruby", "erlang", "javascript", "boo", "ceylon", "gosu", "groovy", "kotlin" ], "summary": "Fantom is a general purpose object-oriented programming language created by Brian and Andy Frank that runs on the Java Runtime Environment (JRE), JavaScript, and the .NET Common Language Runtime (CLR) (.NET support is considered \"prototype\" status). Its primary design goal is to provide a standard library API that abstracts away the question of whether the code will ultimately run on the JRE or CLR. Like C# and Java, Fantom uses a curly brace syntax. The language supports functional programming through closures and concurrency through the Actor model. Fantom takes a \"middle of the road\" approach to its type system, blending together aspects of both static and dynamic typing.", "pageId": 18969637, "dailyPageViews": 60, "created": 2008, "backlinksCount": 49, "revisionCount": 145, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Fantom_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "fan" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.fan", "repos": 176, "id": "Fantom" }, "githubBigQuery": { "repos": 38, "users": 36, "id": "Fantom" }, "pygmentsHighlighter": { "filename": "fantom.py", "fileExtensions": [ "fan" ], "id": "Fantom" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 2, "commitCount": 14, "sampleCount": 2, "example": [ "/*\n * Author: Robert Koeninger\n * License: WTFPL (http://www.wtfpl.net/)\n */\n\nmixin Expr\n{\n abstract Obj? eval()\n}\n\nclass Constant : Expr\n{\n Obj? value\n\n new make(Obj? value) { this.value = value }\n override Obj? eval() { value }\n}\n\nenum class Op\n{\n plus,\n minus\n}\n\nclass Infix : Expr\n{\n Op op\n Expr left\n Expr right\n\n new make(Op op, Expr left, Expr right)\n {\n this.op = op\n this.left = left\n this.right = right\n }\n\n override Obj? eval()\n {\n switch (op)\n {\n case Op.plus:\n return (Int)left.eval() + (Int)right.eval()\n case Op.minus:\n return (Int)left.eval() - (Int)right.eval()\n default:\n throw Err(\"undefined Op\")\n }\n }\n}\n" ], "url": "https://github.com/rkoeninger/sublime-fantom" }, "leachim6": { "filepath": "f/Fantom.fan", "fileExtensions": [ "fan" ], "example": [ "// Hello from Fantom!\nclass HelloWorld {\n static Void main() {\n echo(\"Hello World\")\n }\n}\n" ], "id": "Fantom" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Fantom", "tryItOnline": "fantom", "tiobe": { "id": "Fantom" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "fap": { "title": "FORTRAN assembly program", "appeared": 1959, "type": "assembly", "reference": [ "http://bitsavers.org/pdf/ibm/7090/C28-6235-2_7090_FAP.pdf" ], "standsFor": "FORTRAN assembly program", "aka": [ "FAP" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3357", "isbndb": "" }, "far": { "title": "FAR", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c9b0a41c947611f98f2a8ab5ea04c15bbbf68720" ], "country": [ "United States" ], "originCommunity": [ "Oregon State University", "Hewlett-Packard" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5682", "wordRank": 860, "centralPackageRepositoryCount": 0, "isbndb": "" }, "faradays-induction-equation": { "title": "Faraday's Induction Equation", "appeared": 1831, "type": "equation", "equation": "∇xE=-(dB/dt)", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Faraday%27s_law_of_induction" } }, "farcaster": { "title": "Farcaster", "appeared": 2021, "type": "protocol", "creators": [ "Dan Romero", "Varun Srinivasan" ], "description": "Farcaster is a decentralized social network built on top of Ethereum. The Layer 1 blockchain manages user identities, while a Layer 2 network propagates updates between users. It offers: Secure, memorable, and human-readable user identifiers like @alice. Real-time settlement and propagation of changes between users. Decentralized access to all data on the network at reasonable costs.", "country": [ "United States" ], "originCommunity": [ "https://github.com/farcasterxyz" ], "influencedBy": [ "activity-pub", "ssb" ], "githubRepo": { "stars": 1335, "forks": 66, "subscribers": 32, "created": 2022, "updated": 2023, "description": "Specification of the Farcaster Protocol", "issues": 7, "url": "https://github.com/farcasterxyz/protocol" }, "repoStats": { "firstCommit": 2022, "commits": 141, "committers": 16, "files": 13 } }, "fardlang": { "title": "Fardlang", "appeared": 2022, "type": "esolang", "creators": [ "CompilingCoder", "JustCoding123", "zplusfour", "Hg0428" ], "website": "https://github.com/Sarang0218/ResearchAndDevFor_Fardlang", "country": [ "South Korea and United States" ], "originCommunity": [ "https://github.com/Sarang0218" ], "example": [ "# hehe fard dis is a fardy comment\nmath = 3\nfards? math == 3\n fard \"equals\"\nfarded" ], "githubRepo": { "firstCommit": 2022, "stars": 5, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "issues": 0, "url": "https://github.com/Sarang0218/ResearchAndDevFor_Fardlang" }, "repoStats": { "firstCommit": 2022, "commits": 4, "committers": 2, "files": 24765 }, "isOpenSource": true }, "fast-fourier-transform-equation": { "title": "Fast Fourier Transform Equation", "appeared": 1965, "type": "equation", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Fast_Fourier_transform" } }, "fasta-format": { "title": "FASTA", "appeared": 2004, "type": "textDataFormat", "country": [ "United States" ], "originCommunity": [ "National Center for Biotechnology Information", "University of Virginia" ], "wikipedia": { "example": [ ">SEQUENCE_1\nMTEITAAMVKELRESTGAGMMDCKNALSETNGDFDKAVQLLREKGLGKAAKKADRLAAEG\nLVSVKVSDDFTIAAMRPSYLSYEDLDMTFVENEYKALVAELEKENEERRRLKDPNKPEHK\nIPQFASRKQLSDAILKEAEEKIKEELKAQGKPEKIWDNIIPGKMNSFIADNSQLDSKLTL\nMGQFYVMDDKKTVEQVIAEKEKEFGGKIKIVEFICFEVGEGLEKKTEDFAAEVAAQL\n>SEQUENCE_2\nSATVSEINSETDFVAKNDQFIALTKDTTAHIQSNSLQSVEELHSSTINGVKFEEYLKSQI\nATIGENLVVRRFATLKAGANGVVNGYIHTNGRVGVVIAAACDSAEVASKSRDLLRQICMH" ], "related": [ "ascii", "fastq-format", "r", "python", "ruby", "perl" ], "summary": "In bioinformatics, FASTA format is a text-based format for representing either nucleotide sequences or peptide sequences, in which nucleotides or amino acids are represented using single-letter codes. The format also allows for sequence names and comments to precede the sequences. The format originates from the FASTA software package, but has now become a standard in the field of bioinformatics.The simplicity of FASTA format makes it easy to manipulate and parse sequences using text-processing tools and scripting languages like the R programming language, Python, Ruby, and Perl.", "pageId": 468001, "dailyPageViews": 453, "created": 2004, "backlinksCount": 98, "revisionCount": 315, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/FASTA_format" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/fasta", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "fastq-format": { "title": "FASTQ", "appeared": 2000, "type": "textDataFormat", "country": [ "United Kingdom" ], "originCommunity": [ "Wellcome Trust Sanger Institute" ], "example": [ "@SEQ_ID\nGATTTGGGGTTCAAAGCAGTATCGATCAAATAGTAAATCCATTTGTTCAACTCACAGTTT\n+\n!''*((((***+))%%%++)(%%%%).1***-+*''))**55CCF>>>>>>CCCCCCC65" ], "wikipedia": { "example": [ "sed -e 'n;n;n;y/!\"#$%&'\\''()*+,-.\\/0123456789:;<=>?@ABCDEFGHIJKL/▁▁▁▁▁▁▁▁▂▂▂▂▂▃▃▃▃▃▄▄▄▄▄▅▅▅▅▅▆▆▆▆▆▇▇▇▇▇██████/' myfile.fastq # add -i to save the result to the same input file" ], "related": [ "ascii", "fasta-format" ], "summary": "FASTQ format is a text-based format for storing both a biological sequence (usually nucleotide sequence) and its corresponding quality scores. Both the sequence letter and quality score are each encoded with a single ASCII character for brevity. It was originally developed at the Wellcome Trust Sanger Institute to bundle a FASTA formatted sequence and its quality data, but has recently become the de facto standard for storing the output of high-throughput sequencing instruments such as the Illumina Genome Analyzer.", "pageId": 22431652, "created": 2009, "backlinksCount": 39, "revisionCount": 227, "dailyPageViews": 424, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/FASTQ_format" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "fasttrack-scripting-host": { "title": "FastTrack Scripting Host", "appeared": 2006, "type": "pl", "country": [ "Denmark" ], "originCommunity": [ "FastTrack Software" ], "wikipedia": { "related": [ "login", "csharp", "powershell", "vbscript" ], "summary": "FastTrack Automation Studio (formerly known as FastTrack Scripting Host) – often referred to as just FastTrack – is a scripting language for Windows IT System Administrators. The product’s goal is to handle any kind of scripting that might be required to automate processes with Microsoft Windows networks. The web site of the product is located at www.fasttrackscript.com.", "created": 2012, "backlinksCount": 9, "pageId": 36682239, "revisionCount": 59, "dailyPageViews": 3, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/FastTrack_Scripting_Host" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "fat": { "title": "FAT", "appeared": 1977, "type": "filesystem", "standsFor": "File Allocation Table", "aka": [ "FAT32 FAT16 FAT12" ], "country": [ "United States" ], "originCommunity": [ "Microsoft", "IBM", "NCR Corporation", "Seattle Computer Products", "Compaq Computer Corporation", "Digital Research, Inc", "Novell, Inc", "Caldera, Inc" ], "wikipedia": { "related": [ "exfat", "ntfs", "linux", "freebsd", "ext4", "ascii", "x86-assembly", "rexx", "java", "android" ], "summary": "File Allocation Table (FAT) is a computer file system architecture and a family of industry-standard file systems utilizing it. The FAT file system is a continuing standard which borrows source code from the original, legacy file system and proves to be simple and robust. It offers useful performance even in lightweight implementations, but cannot deliver the same performance, reliability and scalability as some modern file systems. It is, however, supported for compatibility reasons by nearly all currently developed operating systems for personal computers and many mobile devices and embedded systems, and thus is a well-suited format for data exchange between computers and devices of almost any type and age from 1981 up to the present. Originally designed in 1977 for use on floppy disks, FAT was soon adapted and used almost universally on hard disks throughout the DOS and Windows 9x eras for two decades. As disk drives evolved, the capabilities of the file system have been extended accordingly, resulting in three major file system variants: FAT12, FAT16 and FAT32. The FAT standard has also been expanded in other ways while generally preserving backward compatibility with existing software. With the introduction of more powerful computers and operating systems, as well as the development of more complex file systems for them, FAT is no longer the default file system for usage on Microsoft Windows computers.FAT file systems are still commonly found on floppy disks, flash and other solid-state memory cards and modules (including USB flash drives), as well as many portable and embedded devices. FAT is the standard file system for digital cameras per the DCF specification.", "pageId": 53045, "created": 2001, "backlinksCount": 1884, "revisionCount": 3163, "dailyPageViews": 1568, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/File_Allocation_Table" }, "fileType": "text", "wordRank": 1690, "centralPackageRepositoryCount": 0 }, "faust": { "title": "FAUST", "appeared": 2002, "type": "pl", "website": "http://faust.grame.fr", "country": [ "France" ], "originCommunity": [ "Centre national de création musicale" ], "domainName": { "name": "faust.grame.fr" }, "wikipedia": { "related": [ "linux", "unix", "c", "max", "haskell" ], "summary": "FAUST (Functional AUdio STream) is a domain-specific purely functional programming language for implementing signal processing algorithms in the form of libraries, audio plug-ins, or standalone applications. A FAUST program denotes a signal processor: a mathematical function that is applied to some input signal and then fed out.", "pageId": 4532356, "created": 2006, "backlinksCount": 76, "revisionCount": 107, "dailyPageViews": 30, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/FAUST_(programming_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "dsp" ], "aceMode": "text", "tmScope": "source.faust", "repos": 199, "id": "Faust" }, "githubBigQuery": { "repos": 22, "users": 21, "id": "Faust" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:FAUST", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "fawlty": { "title": "Fawlty", "appeared": 2006, "type": "pl", "description": "Fawlty Language is an IDL8 (Interactive Data Language) compatible compiler. Fawlty Language is a closed source, but freely usable IDL clone for Linux, Windows and Mac OS X.", "website": "http://www.flxpert.hu/fl/", "reference": [ "https://bitbucket.org/fawlty/fl/issues" ], "country": [ "United States" ], "originCommunity": [ "Harris Geospatial Solutions, Inc" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "fay": { "title": "fay", "appeared": 2012, "type": "pl", "creators": [ "Chris Done" ], "website": "https://github.com/faylang/fay/wiki", "country": [ "Australia and Sweden and United States" ], "originCommunity": [ "https://github.com/faylang/" ], "compilesTo": [ "javascript" ], "example": [ "{-# LANGUAGE EmptyDataDecls #-}\nmodule Hello where\n\nimport FFI\n\ndata Event\n\nalert :: String -> Fay ()\nalert = ffi \"alert(%1)\"\n\nsetBodyHtml :: String -> Fay ()\nsetBodyHtml = ffi \"document.body.innerHTML = %1\"\n\naddWindowEvent :: String -> (Event -> Fay ()) -> Fay ()\naddWindowEvent = ffi \"window.addEventListener(%1, %2)\"\n\ngreet :: Event -> Fay ()\ngreet event = do\n putStrLn \"The document has loaded\"\n setBodyHtml \"Hello HTML!\"\n\nmain :: Fay ()\nmain = do\n putStrLn \"Hello Console!\"\n alert \"Hello Alert!\"\n addWindowEvent \"load\" greet" ], "githubRepo": { "firstCommit": 2012, "stars": 1274, "forks": 89, "subscribers": 69, "created": 2012, "updated": 2022, "description": "A proper subset of Haskell that compiles to JavaScript", "issues": 24, "url": "https://github.com/faylang/fay" }, "repoStats": { "firstCommit": 2012, "commits": 1159, "committers": 51, "files": 524 }, "twitter": "https://twitter.com/fayhaskell", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "fcl": { "title": "FCL", "appeared": 1989, "type": "pl", "standsFor": "Flow chart language", "country": [ "Denmark" ], "originCommunity": [ "Copenhagen University", "Technical University of Denmark", "DIKU", "Computer Resources International A/S" ], "related": [ "dot" ], "example": [ "(n)\n(init)\n\ninit: x1 = 1\n x2 = 1\n\nfib: x1 = x1 + x2\n\n t = x1\n x1 = x2\n x2 = t\n\n n = -(n 1)\n\n if >(n 2) then fib else exit\nexit: return x2" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Flow_chart_language" } }, "fcpu": { "title": "FCPU", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f1011b3210e0b85e05584878a9bca716956f1271" ], "country": [ "Sweden" ], "originCommunity": [ "Saab-Scania AB" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7921", "centralPackageRepositoryCount": 0 }, "fe": { "title": "fe", "appeared": 2019, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "https://rxi.github.io/" ], "githubRepo": { "firstCommit": 2019, "stars": 848, "forks": 51, "subscribers": 27, "created": 2019, "updated": 2022, "description": "A tiny, embeddable language implemented in ANSI C", "issues": 6, "url": "https://github.com/rxi/fe" }, "repoStats": { "firstCommit": 2019, "commits": 15, "committers": 2, "files": 13 }, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1985|FE — A multi-interface form system|10.1002/J.1538-7305.1985.TB00046.X|5|0|R. M. Prichard|f2ddf25659fc9ab291c17efb99e08425f25545c1\n2014|Evaluation of Crack Tip Stress Field Using Combination of Advanced Implementation of Over-Deterministic Method and FE Analysis|10.4028/www.scientific.net/KEM.627.273|3|0|J. Sobek and T. Pail and V. Veselý|6bcafd5b73bdd71486eae7a2aa9f36e3f47c618e" }, "feel": { "title": "Friendly Enough Expression Language", "appeared": 2015, "type": "queryLanguage", "description": "FEEL defines a syntax for expressing conditions that input data should be evaluated against", "reference": [ "https://docs.camunda.org/manual/7.11/reference/dmn11/feel/" ], "standsFor": "Friendly Enough Expression Language", "country": [ "Germany" ], "originCommunity": [ "Camunda" ], "hasBooleans": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true } }, "felix": { "title": "Felix", "appeared": 2001, "type": "pl", "creators": [ "John Skaller" ], "website": "http://felix-lang.github.io/felix/", "emailList": [ "https://groups.google.com/g/felix-language" ], "reference": [ "http://web.archive.org/web/20080415185225/http://felix-lang.org/" ], "country": [ "Australia" ], "originCommunity": [ "felix-language@googlegroups.com" ], "hasPointers": { "example": "var x = 1;\n&x <- 2;", "value": true }, "hasGenerics": { "example": "// generics\nfun g (x) => f (f x);\nprintln$ g 1, g \"hello\";\nprintln$ _map f (1,\"hello\",2.0);", "value": true }, "hasPolymorphism": { "example": "// overloads\nfun f (x:double) => x +42.1;\nfun f (x:int) => x + 1;\nfun f (x:string) => x + \"!\";", "value": true }, "hasPatternMatching": { "example": "match x with\n | Some x => println$ x; \n | None => println \"NONE\";\n endmatch;", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "// 0[0-7_]+([tTsSiIlLvV]|ll|LL|([iIuU])(8|16|32|64))?", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F_]+([tTsSiIlLvV]|ll|LL|([iIuU])(8|16|32|64))?", "value": true }, "hasFloats": { "example": "// 0[xX]([0-9a-fA-F_]*\\.[0-9a-fA-F_]+|[0-9a-fA-F_]+)[pP][+\\-]?[0-9_]+[lLfFdD]?", "value": true }, "hasIntegers": { "example": "// (0|[1-9][0-9_]*)([tTsSiIlLvV]|ll|LL|([iIuU])(8|16|32|64))?", "value": true }, "hasBinaryNumbers": { "example": "// 0[Bb][01_]+([tTsSiIlLvV]|ll|LL|([iIuU])(8|16|32|64))?", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "_", "_deref", "all", "as", "assert", "attempt", "call", "callback", "case", "caseno", "cclass", "code", "compound", "ctypes", "do", "done", "downto", "elif", "else", "endattempt", "endcase", "endif", "endmatch", "enum", "except", "exceptions", "expect", "finally", "for", "forall", "forget", "fork", "functor", "goto", "ident", "if", "incomplete", "inherit", "instance", "interface", "jump", "lambda", "loop", "match", "module", "namespace", "new", "noexpand", "nonterm", "obj", "of", "open", "parse", "raise", "regexp", "reglex", "regmatch", "rename", "return", "the", "then", "to", "type", "typecase", "typedef", "typematch", "typeof", "upto", "when", "whilst", "with", "yield" ], "example": [ "#import \nfun abs_div(a:int, b:int when b!=0)\n expect result >=0\n=>\n abs(a/b)\n;\nprint (abs_div(2,4)); print \"\\n\";" ], "githubRepo": { "firstCommit": 2001, "stars": 685, "forks": 44, "subscribers": 41, "created": 2010, "updated": 2022, "description": "The Felix Programming Language", "issues": 37, "url": "https://github.com/felix-lang/felix" }, "repoStats": { "firstCommit": 2001, "commits": 8487, "committers": 59, "files": 3142 }, "pygmentsHighlighter": { "filename": "felix.py", "fileExtensions": [ "flx", "flxh" ], "id": "Felix" }, "leachim6": { "filepath": "f/Felix.flx", "fileExtensions": [ "flx" ], "example": [ "println$ \"Hello World\";\n" ], "id": "Felix" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n5007674|Felix - a fast scripting language|http://felix-lang.org|2013-01-04 14:17:49 UTC|1357309069|nmcfarl|83|107", "centralPackageRepositoryCount": 0, "isbndb": "" }, "femtolisp": { "title": "femtolisp", "appeared": 2008, "type": "pl", "creators": [ "Jeff Bezanson" ], "reference": [ "https://en.wikipedia.org/wiki/Julia_(programming_language)#Implementation" ], "country": [ "United States" ], "originCommunity": [ "Julia Computing Inc" ], "githubRepo": { "firstCommit": 2008, "stars": 1388, "forks": 110, "subscribers": 69, "created": 2012, "updated": 2022, "description": "a lightweight, robust, scheme-like lisp implementation", "issues": 22, "url": "https://github.com/JeffBezanson/femtolisp" }, "repoStats": { "firstCommit": 2008, "commits": 300, "committers": 15, "files": 112 } }, "fen-notation": { "title": "Forsyth-Edwards Notation", "appeared": 1883, "type": "notation", "example": [ "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1" ], "wikipedia": { "example": [ "rnbqkbnr/pp1ppppp/8/2p5/4P3/5N2/PPPP1PPP/RNBQKB1R b KQkq - 1 2" ], "summary": "Forsyth–Edwards Notation (FEN) is a standard notation for describing a particular board position of a chess game. The purpose of FEN is to provide all the necessary information to restart a game from a particular position. FEN is based on a system developed by Scottish newspaper journalist David Forsyth. Forsyth's system became popular in the 19th century; Steven J. Edwards extended it to support use by computers. FEN is an integral part of the Portable Game Notation for chess games, since FEN is used to define initial positions other than the standard one. FEN does not represent sufficient information to decide whether a draw by threefold repetition may be legally claimed or a draw offer may be accepted; for that, a different format such as Extended Position Description is needed.", "pageId": 258696, "dailyPageViews": 109, "backlinksCount": 78, "url": "https://en.wikipedia.org/wiki/Forsyth–Edwards_Notation" }, "fileType": "paper", "centralPackageRepositoryCount": 0 }, "fenix-project": { "title": "Fenix Project", "appeared": 2006, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Hammer Technologies" ], "wikipedia": { "related": [ "linux" ], "summary": "Fenix Project is the codename for a GNU project to create a free compiler for a scripting language derived from the one created by Hammer Technologies for the game development suite DIV Games Studio. However, several features have been added which make it incompatible with most games programmed with DIV Games Studio.", "created": 2006, "backlinksCount": 21, "pageId": 3662506, "revisionCount": 68, "dailyPageViews": 9, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Fenix_Project" }, "centralPackageRepositoryCount": 0 }, "fennel": { "title": "Fennel", "appeared": 2016, "type": "pl", "creators": [ "Calvin Rose" ], "website": "https://fennel-lang.org/", "country": [ "Various" ], "originCommunity": [ "https://lists.sr.ht/%7Etechnomancy/fennel" ], "domainName": { "registered": 2018, "awisRank": { "2022": 1619996 }, "name": "fennel-lang.org" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "; -?\\d+\\.\\d+", "value": true }, "hasIntegers": { "example": "; -?\\d+", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "example": [ ";; Sample: read the state of the keyboard and move the player accordingly\n(local dirs {:up [0 -1] :down [0 1] :left [-1 0] :right [1 0]})\n(each [key delta (pairs dirs)]\n (when (love.keyboard.isDown key)\n (let [[dx dy] delta\n [px py] player\n x (+ px (* dx player.speed dt))\n y (+ py (* dy player.speed dt))]\n (: world :move player x y))))" ], "githubRepo": { "firstCommit": 2016, "stars": 1699, "forks": 96, "subscribers": 44, "created": 2016, "updated": 2022, "description": "Lua Lisp Language", "issues": 8, "url": "https://github.com/bakpakin/fennel" }, "repoStats": { "firstCommit": 2016, "commits": 1893, "committers": 80, "files": 157 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "fnl" ], "interpreters": [ "fennel" ], "aceMode": "text", "tmScope": "source.fnl", "repos": 207, "id": "Fennel" }, "githubBigQuery": { "repos": 12, "users": 12, "id": "Fennel" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "fnl" ], "id": "Fennel" }, "leachim6": { "filepath": "f/Fennel.fnl", "fileExtensions": [ "fnl" ], "example": [ "(print \"Hello World\")\n" ], "id": "Fennel" }, "isbndb": "" }, "ferite": { "title": "Ferite", "appeared": 2000, "type": "pl", "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Console.println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Ferite" }, "leachim6": { "filepath": "f/Ferite.fe", "fileExtensions": [ "fe" ], "example": [ "uses \"console\";\nConsole.println( \"Hello World\" );\n" ], "id": "Ferite" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Ferite", "centralPackageRepositoryCount": 0 }, "fern": { "title": "Fern", "appeared": 2022, "type": "pl", "creators": [ "Spencer Comin" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/Spencer-Comin/Fern/issues" ], "githubRepo": { "firstCommit": 2022, "stars": 5, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "description": "A toy programming language built with LLVM and Prolog", "issues": 0, "url": "https://github.com/Spencer-Comin/Fern" }, "repoStats": { "firstCommit": 2022, "commits": 28, "committers": 2, "files": 24 } }, "ferret": { "title": "ferret", "appeared": 2017, "type": "pl", "creators": [ "Nurullah Akkaya" ], "website": "http://ferret-lang.org", "country": [ "North Cyprus" ], "originCommunity": [ "Near East University" ], "domainName": { "registered": 2017, "name": "ferret-lang.org" }, "example": [ ";;; lazy-sum.clj\n(defn positive-numbers\n ([]\n (positive-numbers 1))\n ([n]\n (cons n (lazy-seq (positive-numbers (inc n))))))\n\n(println (->> (positive-numbers)\n (take 5)\n (apply +)))\n" ], "githubRepo": { "firstCommit": 2015, "stars": 1008, "forks": 43, "subscribers": 39, "created": 2016, "updated": 2022, "description": "Ferret is a free software lisp implementation for real time embedded control systems.", "issues": 12, "url": "https://github.com/nakkaya/ferret" }, "repoStats": { "firstCommit": 2015, "commits": 1645, "committers": 10, "files": 8 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n14951116|Ferret – A free software Clojure implementation|http://ferret-lang.org/|2017-08-07 20:45:21 UTC|1502138721|greydius|79|266" }, "fetlang": { "title": "fetlang", "appeared": 2017, "type": "esolang", "description": "A nsfw esolang.", "country": [ "United States" ], "originCommunity": [ "https://dagans.dev" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 1432, "forks": 40, "subscribers": 51, "created": 2017, "updated": 2022, "firstCommit": 2017, "description": "Fetish-themed programming language", "issues": 9, "url": "https://github.com/Property404/fetlang" }, "repoStats": { "firstCommit": 2017, "commits": 296, "committers": 13, "files": 107 }, "leachim6": { "filepath": "f/Fetlang.fet", "fileExtensions": [ "fet" ], "example": [ "Make slave scream \"Hello World\"\n" ], "id": "Fetlang" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "feynman-diagram": { "title": "Feynman diagram", "appeared": 1948, "type": "notation", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Feynman_diagram" } }, "ffmpeg": { "title": "FFmpeg", "appeared": 2000, "type": "application", "creators": [ "Fabrice Bellard", "Bobby Bingham" ], "website": "https://ffmpeg.org/", "writtenIn": [ "c" ], "githubRepo": { "firstCommit": 2000, "stars": 33406, "forks": 10426, "subscribers": 1333, "created": 2011, "updated": 2023, "description": "Mirror of https://git.ffmpeg.org/ffmpeg.git", "issues": 3, "url": "https://github.com/FFmpeg/FFmpeg" }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/FFmpeg" } }, "fhir": { "title": "Fast Healthcare Interoperability Resources", "appeared": 2011, "type": "standard", "description": "FHIR builds on previous data format standards from HL7, like HL7 version 2.x and HL7 version 3.x. But it is easier to implement because it uses a modern web-based suite of API technology, including a HTTP-based RESTful protocol, HTML and Cascading Style Sheets for user interface integration, a choice of JSON, XML or RDF for data representation, and Atom for results.", "country": [ "United States" ], "originCommunity": [ "Health Level Seven International" ], "wikipedia": { "summary": "Fast Healthcare Interoperability Resources (FHIR, pronounced \"fire\") is a draft standard describing data formats and elements (known as \"resources\") and an application programming interface (API) for exchanging electronic health records. The standard was created by the Health Level Seven International (HL7) health-care standards organization. FHIR builds on previous data format standards from HL7, like HL7 version 2.x and HL7 version 3.x. But it is easier to implement because it uses a modern web-based suite of API technology, including a HTTP-based RESTful protocol, HTML and Cascading Style Sheets for user interface integration, a choice of JSON, XML or RDF for data representation, and Atom for results. One of its goals is to facilitate interoperation between legacy health care systems, to make it easy to provide health care information to health care providers and individuals on a wide variety of devices from computers to tablets to cell phones, and to allow third-party application developers to provide medical applications which can be easily integrated into existing systems. FHIR provides an alternative to document-centric approaches by directly exposing discrete data elements as services. For example, basic elements of healthcare like patients, admissions, diagnostic reports and medications can each be retrieved and manipulated via their own resource URLs. FHIR was supported at an American Medical Informatics Association meeting by many EHR vendors which value its open and extensible nature.", "backlinksCount": 29, "pageId": 37083126, "dailyPageViews": 232, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Fast_Healthcare_Interoperability_Resources" } }, "fibonacci-notation": { "title": "Liber Abaci", "appeared": 1202, "type": "notation", "description": "The Arabic numeral system as presented in Liber Abaci.", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Liber_Abaci" } }, "fibonacci": { "title": "Fibonacci", "appeared": 1991, "type": "pl", "creators": [ "Antonio Albano", "Giorgio Ghelli", "and Renzo Orsini" ], "description": "Fibonacci is an object-oriented database programming language characterized by static and strong typing, and by new mechanisms for modeling databases in terms of objects with roles, classes, and associations.", "reference": [ "https://dl.acm.org/doi/pdf/10.5555/615224.615227", "https://semanticscholar.org/paper/3b9aa468a7bd9d75811680a3a3db1a42b73dbdf7" ], "country": [ "Italy" ], "originCommunity": [ "Università di Pisa" ], "hasComments": { "example": "(* query examples *)", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "example": [ "let john = role Person\n private\n let address = var (\"Darwin road, 123 - London\") ;5\n methods\n Name = \"John Daniels\";\n BirthYear = 1967;\n Age = currentYear() - me.BirthYear;\n Address = at (address);\n modAddress (newAddress: String) =\n if stringLength(newAddress) <= 0\n then failwith \"incorrect address\"\n else address := newAddress\n Introduce = \"My name is \" & me.Name &\n \"and I was born in \" ~ intToString(me.BirthYear);\nend; " ], "hopl": "https://hopl.info/showlanguage.prx?exp=5759", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20200505|World Scientific Publishing|\"Mathematics Of Harmony As A New Interdisciplinary Direction And \"\"Golden\"\" Paradigm Of Modern Science - Volume 1: The Golden Section, Fibonacci Numbers, Pascal Triangle, And Platonic Solids\"|Alexey Stakhov|9789811206382\n20141011|Emereo|Fibonacci number 81 Success Secrets - 81 Most Asked Questions On Fibonacci number - What You Need To Know|Lois Mckay|9781488805868" }, "fickle": { "title": "Fickle", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/67bae061383a7fb5669e201c7d4800919e1b35ed" ], "country": [ "Italy and United Kingdom" ], "originCommunity": [ "Universit`a di Genova", "Imperial College", "Universit`a di Torino", "Universit`a del Piemonte Orientale" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6554", "centralPackageRepositoryCount": 0 }, "figlet-font": { "title": "FIGlet Font", "appeared": 1991, "type": "application", "reference": [ "https://en.wikipedia.org/wiki/FIGlet" ], "country": [ "Unknown" ], "originCommunity": [ "http://www.figlet.org" ], "githubLanguage": { "fileExtensions": [ "flf" ], "type": "data", "aceMode": "text", "tmScope": "source.figfont", "aliases": [ "FIGfont" ], "id": "FIGlet Font" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 2, "commitCount": 51, "sampleCount": 1, "example": [ "flf2a$ 6 5 76 15 14 1 16271 39\nIvrit (Hebrew) Unicode font assembled by John Cowan \nLatin chars from Standard by G. Chappell & Ian Chai\nHebrew chars from Jerusalem by Gedaliah Friedenberg \n Use \"ilhebrew.flc\" for Hebrew keyboard mapping\n Use \"ushebrew.flc\" for U.S.-style keyboard mapping (\"febrew\" script)\n Use \"8859-8.flc\" for ISO 8859-8 text\n Or use UTF-8\nWARNING! FIGfonts aren't bidirectional; this is strictly right-to-left \n (by default) even for the Latin characters.\nfiglet release 2.2 -- November 1996\n\nModified by Paul Burton 12/96 to include new parameter\nsupported by FIGlet and FIGWin. May also be slightly modified for better use\nof new full-width/kern/smush alternatives, but default output is NOT changed.\n $@\n $@\n $@\n $@\n $@\n $@@\n _ @\n | |@\n | |@\n |_|@\n (_)@\n @@\n _ _ @\n ( | )@\n V V @\n $ @\n $ @\n @@\n _ _ @\n _| || |_ @\n |_ .. _|@\n |_ _|@\n |_||_| @\n @@\n _ @\n | | @\n / __)@\n \\__ \\@\n ( /@\n |_| @@\n _ __@\n (_)/ /@\n / / @\n / /_ @\n /_/(_)@\n @@\n ___ @\n ( _ ) @\n / _ \\/\\@\n | (_> <@\n \\___/\\/@\n @@\n _ @\n ( )@\n |/ @\n $ @\n $ @\n @@\n __@\n / /@\n | | @\n | | @\n | | @\n \\_\\@@\n __ @\n \\ \\ @\n | |@\n | |@\n | |@\n /_/ @@\n @\n __/\\__@\n \\ /@\n /_ _\\@\n \\/ @\n @@\n @\n _ @\n _| |_ @\n |_ _|@\n |_| @\n @@\n @\n @\n @\n _ @\n ( )@\n |/ @@\n @\n @\n _____ @\n |_____|@\n $ @\n @@\n @\n @\n @\n _ @\n (_)@\n @@\n __@\n / /@\n / / @\n / / @\n /_/ @\n @@\n ___ @\n / _ \\ @\n | | | |@\n | |_| |@\n \\___/ @\n @@\n _ @\n / |@\n | |@\n | |@\n |_|@\n @@\n ____ @\n |___ \\ @\n __) |@\n / __/ @\n |_____|@\n @@\n _____ @\n |___ / @\n |_ \\ @\n ___) |@\n |____/ @\n @@\n _ _ @\n | || | @\n | || |_ @\n |__ _|@\n |_| @\n @@\n ____ @\n | ___| @\n |___ \\ @\n ___) |@\n |____/ @\n @@\n __ @\n / /_ @\n | '_ \\ @\n | (_)" ], "url": "https://github.com/Alhadis/language-fontforge" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "filebench-wml": { "title": "Filebench WML", "appeared": 2011, "type": "pl", "creators": [ "Vasily Tarasov" ], "description": "Filebench is a file system and storage benchmark that can generate a large variety of workloads. Unlike typical benchmarks it is extremely flexible and allows to specify application's I/O behavior using its extensive Workload Model Language (WML).", "website": "https://github.com/filebench/filebench/wiki", "reference": [ "https://github.com/filebench/filebench/wiki/Workload-model-language" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/filebench" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "#\n# CDDL HEADER START\n#\n# The contents of this file are subject to the terms of the\n# Common Development and Distribution License (the \"License\").\n# You may not use this file except in compliance with the License.\n#\n# You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE\n# or http://www.opensolaris.org/os/licensing.\n# See the License for the specific language governing permissions\n# and limitations under the License.\n#\n# When distributing Covered Code, include this CDDL HEADER in each\n# file and include the License file at usr/src/OPENSOLARIS.LICENSE.\n# If applicable, add the following below this CDDL HEADER, with the\n# fields enclosed by brackets \"[]\" replaced with your own identifying\n# information: Portions Copyright [yyyy] [name of copyright owner]\n#\n# CDDL HEADER END\n#\n#\n# Copyright 2009 Sun Microsystems, Inc. All rights reserved.\n# Use is subject to license terms.\n#\n\nset $dir=/tmp\nset $nfiles=1000\nset $meandirwidth=20\nset $meanfilesize=16k\nset $iosize=1m\nset $nthreads=1\n\nset mode quit firstdone\n\ndefine fileset name=bigfileset,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth,prealloc=100,paralloc\ndefine fileset name=destfiles,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth\n\ndefine process name=filereader,instances=1\n{\n thread name=filereaderthread,memsize=10m,instances=$nthreads\n {\n flowop openfile name=openfile1,filesetname=bigfileset,fd=1\n flowop readwholefile name=readfile1,fd=1,iosize=$iosize\n flowop createfile name=createfile2,filesetname=destfiles,fd=2\n flowop writewholefile name=writefile2,fd=2,srcfd=1,iosize=$iosize\n flowop closefile name=closefile1,fd=1\n flowop closefile name=closefile2,fd=2\n }\n}\n\necho \"Copyfiles Version 3.0 personality successfully loaded\"\n" ], "githubRepo": { "stars": 257, "forks": 96, "subscribers": 22, "created": 2016, "updated": 2022, "description": "File system and storage benchmark that uses a custom language to generate a large variety of workloads.", "issues": 68, "firstCommit": 2011, "url": "https://github.com/filebench/filebench" }, "repoStats": { "firstCommit": 2011, "commits": 223, "committers": 14, "files": 136 }, "githubLanguage": { "fileExtensions": [ "f" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 566, "id": "Filebench WML" }, "githubBigQuery": { "repos": 19, "users": 16, "id": "Filebench WML" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "filetab-d": { "title": "filetab-d", "appeared": 1978, "type": "pl", "description": "Variant of Filetab for x86 and PDP-11. A decision based language which was unusual in that it consisted predominantly of matrices. Users included developers writing insurance software at a company in Manchester.", "reference": [ "https://en.wikipedia.org/wiki/Filetab" ], "country": [ "United States" ], "originCommunity": [ "National Computing Centre" ] }, "filetab": { "title": "FILETAB", "appeared": 1966, "type": "pl", "country": [ "United States" ], "originCommunity": [ "National Computing Centre" ], "wikipedia": { "summary": "Filetab is a decision table-based computer programming language widely used in business in the 1960s and 1970s.", "backlinksCount": 24, "pageId": 3582692, "dailyPageViews": 7, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Filetab" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1609", "isbndb": "" }, "filterscript": { "title": "Filterscript", "appeared": 2012, "type": "pl", "description": "A subset of RenderScript", "example": [ "#pragma version(1)\n#pragma rs java_package_name(foo)\n\nint __attribute__((kernel)) root(uint32_t ain) {\n return 0;\n}\n\nvoid __attribute__((kernel)) in_only(uint32_t ain) {\n}\n\nint __attribute__((kernel)) out_only() {\n return 0;\n}\n\nint __attribute__((kernel)) everything(uint32_t ain, uint32_t x, uint32_t y) {\n return 0;\n}" ], "githubLanguage": { "fileExtensions": [ "fs" ], "trendingProjectsCount": 0, "type": "programming", "group": "RenderScript", "aceMode": "text", "tmScope": "none", "repos": 0, "id": "Filterscript" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "firebase": { "title": "Firebase Realtime Database", "appeared": 2011, "type": "database", "description": "Cloud-hosted real-time document-oriented database", "country": [ "United States" ], "originCommunity": [ "Google" ] }, "firefox": { "title": "Firefox", "appeared": 2004, "type": "webBrowser", "website": "https://www.mozilla.org/en-US/firefox/new/", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Firefox" } }, "firrtl": { "title": "firrtl", "appeared": 2015, "type": "ir", "website": "https://www.chisel-lang.org/firrtl/", "country": [ "United States and China" ], "originCommunity": [ "https://github.com/freechipsproject" ], "githubRepo": { "firstCommit": 2015, "stars": 539, "forks": 159, "subscribers": 62, "created": 2015, "updated": 2022, "description": "Flexible Intermediate Representation for RTL", "issues": 251, "url": "https://github.com/freechipsproject/firrtl" }, "repoStats": { "firstCommit": 2015, "commits": 4196, "committers": 116, "files": 522 } }, "fish": { "title": "fish", "appeared": 2005, "type": "pl", "website": "http://fishshell.com/", "documentation": [ "https://fishshell.com/docs/2.3/index.html" ], "standsFor": "friendly interactive shell", "country": [ "Various" ], "originCommunity": [ "https://github.com/fish-shell" ], "domainName": { "registered": 2010, "awisRank": { "2022": 183077 }, "name": "fishshell.com" }, "releaseNotesUrl": "https://fishshell.com/docs/current/relnotes.html", "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "echo" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2005, "stars": 19123, "forks": 1569, "subscribers": 268, "created": 2012, "updated": 2022, "description": "The user-friendly command line shell.", "issues": 460, "url": "https://github.com/fish-shell/fish-shell" }, "repoStats": { "firstCommit": 2005, "commits": 17585, "committers": 970, "files": 1905 }, "wikipedia": { "example": [ "string replace --regex '.*?\\.(.*)' '$1' a.b.c #b.c\nstring replace --regex '.*\\.(.*)' '$1' a.b.c #c\nstring replace --regex '(.*)\\..*' '$1' a.b.c #a.b\nstring replace --regex '(.*?)\\..*' '$1' a.b.c #a" ], "related": [ "bash", "z-shell" ], "summary": "The friendly interactive shell (fish) is a Unix shell that attempts to be more interactive and user-friendly than those with a longer history (i.e. most other Unix shells) or those formulated as function-compatible replacements for the aforementioned (e.g. zsh, the Falstad shell). The design goal of fish is to give the user a rich set of powerful features in a way that is easy to discover, remember, and use. fish is considered an \"exotic shell\", in that its syntax derives from neither the Bourne shell (ksh, bash, zsh) nor the C shell (csh, tcsh). Also unlike previous shells, which disable certain features by default to save system resources, fish enables all features by default.", "created": 2005, "pageId": 1889847, "backlinksCount": 38, "revisionCount": 226, "dailyPageViews": 62, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Friendly_interactive_shell" }, "githubLanguage": { "fileExtensions": [ "fish" ], "trendingProjectsCount": 0, "type": "programming", "group": "Shell", "interpreters": [ "fish" ], "aceMode": "text", "tmScope": "source.fish", "repos": 0, "id": "fish" }, "pygmentsHighlighter": { "filename": "shell.py", "fileExtensions": [ "fish", "load" ], "id": "Fish" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2014, "committerCount": 2, "commitCount": 16, "sampleCount": 3, "example": [ "\nfunction eval -S -d \"Evaluate parameters as a command\"\n\n\t# If we are in an interactive shell, eval should enable full\n\t# job control since it should behave like the real code was\n\t# executed. If we don't do this, commands that expect to be\n\t# used interactively, like less, wont work using eval.\n\n\tset -l mode\n\tif status --is-interactive-job-control\n\t\tset mode interactive\n\telse\n\t\tif status --is-full-job-control\n\t\t\tset mode full\n\t\telse\n\t\t\tset mode none\n\t\tend\n\tend\n\tif status --is-interactive\n\t\tstatus --job-control full\n\tend\n\n\techo \"begin; $argv ;end eval2_inner <&3 3<&-\" | . 3<&0\n\tset -l res $status\n\n\tstatus --job-control $mode\n\treturn $res\nend\n" ], "url": "https://github.com/l15n/fish-tmbundle" }, "leachim6": { "filepath": "f/Fish.fish", "fileExtensions": [ "fish" ], "example": [ "#!/usr/bin/env fish\necho \"Hello World\"\n" ], "id": "Fish" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Fish", "rijuRepl": { "example": [ "echo \"Hello, world!\"\n" ], "id": "https://riju.codes/fish" }, "tryItOnline": "fish", "indeedJobs": { "2022": 1, "query": "fish developer" }, "officialBlogUrl": [ "https://fishshell.com/blog/index.html" ], "faqPageUrl": [ "https://fishshell.com/docs/current/faq.html" ], "fileType": "text", "wordRank": 1563, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1990|HarperPerennial|When Do Fish Sleep? and Other Imponderables of Everyday Life|David Feldman|9780060920111", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1999|Programming in FISh|10.1007/s100090050037|23|3|C. Jay|85dfbb3dcd3d87ec608b2cdc76d9194b3bdc1bf9\n1997|Do the Fish Really Need Remote Control? A Proposal for Self-Active Objects in Oberon|10.1007/3-540-62599-2_41|14|1|J. Gutknecht|7a1834c14d7dd5a0ec4bf9e570f08c5ad62803cc\n2019|Automatic System to Fish Feeder and Water Turbidity Detector Using Arduino Mega|10.1088/1742-6596/1339/1/012013|5|0|H. Hendri and S. Enggari and Mardison and M. R. Putra and L. N. Rani|fc19165adfdb5eb3694cafbc7d31ecb015b71820\n2009|Design Approach to Fish Data Identification Tag via RFID|10.1109/ICFCC.2009.62|4|0|T. Hla and Z. M. Aung|09d110c338041ace56cd3c118c8ef1f93dad2607\n2018|Simulation of drying process of secondary products of fish cutting and description of the main processes of heat and moisture transfer in the model|10.20914/2310-1202-2018-2-125-129|1|0|O. Dvoryaninova and A. Sokolov|29ac77f1078bcc7ff310332ccd408d2227b63d0e\n2021|IoT-Based Monitoring and Design of Automatic Fish Drying Equipment Using Fuzzy Logic|10.1088/1755-1315/704/1/012042|1|0|Y. Alvinika and D. Setyohadi and M. Sulistyoningsih|e4845a128784ca237943106acc0c3daa4ac9da3d" }, "fishlang": { "title": "><>", "appeared": 2009, "type": "esolang", "country": [ "Unknown" ], "originCommunity": [ "https://esolangs.org" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "leachim6": { "filepath": "#/><>", "example": [ "\"Hello World\"r\\\n o;!?l<\n" ], "id": "><>" }, "rijuRepl": { "example": [ "\"Hello, world!\"r\\\n o;!?l<\n" ], "description": "Stack-based, reflective, two-dimensional esoteric programming language", "fileExtensions": [ "fish" ], "gitRepo": "https://gist.github.com/anonymous/6392418", "id": "https://riju.codes/fishlang" }, "esolang": "https://esolangs.org/wiki/Fish" }, "fizz": { "title": "fizz", "appeared": 2017, "type": "pl", "description": "fizz is an experimental language and runtime environment for the exploration of cognitive architectures and combined Machine Learning (ML) and Machine Reasoning (MR) solutions. It is based primarily on symbolic programming and fuzzy formal logic and it features a distributed (as in heterogeneous computer cluster), concurrent, asynchronous and responsive inference engine.", "website": "https://f1zz.org/", "country": [ "United States" ], "originCommunity": [ "https://f1zz.org" ], "domainName": { "registered": 2017, "name": "f1zz.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "// Code ----------------------------------------------------------------------------------------------------------------------------------\n\nis.tree { // test if a term is a valid binary tree\n\n (nil)^ :- true;\n (n(_,_,:l,:r))^ :- #is.tree(:l), #is.tree(:r);\n (_) :- false;\n\n}\n\nbtr.length { // how many nodes is there on a binary tree\n\n (nil,0)^ :- true;\n (n(_,_,:l,:r),:n) :- #btr.length(:l,:l.n),\n #btr.length(:r,:r.n),\n sum(:l.n,:r.n,1,:n);\n\n}" ] }, "fjolnir": { "title": "Fjölnir", "appeared": 1986, "type": "pl", "creators": [ "Snorri Agnarsson" ], "country": [ "Iceland" ], "originCommunity": [ "University of Iceland" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ ";; Hello world in Fjölnir\n\n\"hello\" < main\n{\n main ->\n stef(;)\n stofn\n skrifastreng(;\"Hello, world!\"),\n stofnlok\n}\n*\n\"GRUNNUR\"\n;" ], "summary": "Fjölnir (also Fjolnir or Fjoelnir) is a programming language developed by professor Snorri Agnarsson of computer science at Háskóli Íslands (University of Iceland) that was mostly used in the 1980s. The source files usually have the extension fjo or sma.", "pageId": 3236625, "dailyPageViews": 17, "created": 2005, "backlinksCount": 20, "revisionCount": 29, "appeared": 1980, "fileExtensions": [ "fjo", "fjv", "sma", "ein" ], "url": "https://en.wikipedia.org/wiki/Fjölnir_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "fjs": { "title": "fjs", "appeared": 2013, "type": "pl", "creators": [ "Mark Hahn" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/mark-hahn/fjs/issues" ], "githubRepo": { "firstCommit": 2013, "stars": 48, "forks": 5, "subscribers": 5, "created": 2013, "updated": 2022, "description": "FORTH-like language for Javascript / Node", "issues": 0, "url": "https://github.com/mark-hahn/fjs" }, "repoStats": { "firstCommit": 2013, "commits": 19, "committers": 2, "files": 12 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n5810347|Show HN: A new language that merges FORTH and Javascript|2013-06-02 22:23:23 UTC|1370211803|mchahn|4|10" }, "fl": { "title": "FL", "appeared": 1989, "type": "pl", "creators": [ "John Backus" ], "standsFor": "Function Level", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "related": [ "fp", "j", "ml", "c" ], "summary": "FL (short for Function Level) is a functional programming language created at the IBM Almaden Research Center by John Backus, John Williams, and Edward Wimmers in the 1980s and documented in a report from 1989. FL was designed as a successor of Backus' earlier FP language, providing specific support for what Backus termed function-level programming. FL is a dynamically typed strict functional programming language with throw and catch exception semantics much like in ML. Each function has an implicit history argument which is used for doing things like strictly functional input/output (I/O), but is also used for linking to C code. For doing optimization, there exists a type-system which is an extension of Hindley–Milner type inference. Many of the language’s innovative ideas have since been implemented in Kenneth E. Iverson’s J language.", "pageId": 2857297, "created": 2004, "backlinksCount": 19, "revisionCount": 44, "dailyPageViews": 14, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/FL_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1144", "fileType": "text", "wordRank": 1468, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "flacc": { "title": "FLACC", "appeared": 1977, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Chion Corporation" ], "wikipedia": { "related": [ "algol-68", "watfiv" ], "summary": "FLACC is an implementation of the ALGOL 68 programming language. Chris Thomson and Colin Broughton founded Chion Corporation which developed and marketed FLACC (Full Language Algol 68 Checkout Compiler). This compiler and run-time system conformed exactly to the Revised Report, ran on IBM 370 and compatible mainframes, and included debugging features derived from WATFIV. It was released in 1977. Chris was a student of Barry J. Mailloux. Barry studied at Amsterdam's Mathematisch Centrum from 1966 under Adriaan van Wijngaarden. Barry's work on the Algol 68 language established the University of Alberta as a center for Algol 68-related activity. According to Thomson decade later: You know, we only ever got 22 copies installed, and less than 5 of those in North America. Even though it ran on 370's under MVS, CMS and MTS, and was cheap and reliable. Talk about a marketing disaster.", "created": 2005, "backlinksCount": 8, "pageId": 3508682, "revisionCount": 27, "dailyPageViews": 3, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/FLACC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4343", "centralPackageRepositoryCount": 0 }, "flagship": { "title": "flagship", "appeared": 1986, "type": "pl", "website": "http://www.flagship.de/", "country": [ "Germany" ], "originCommunity": [ "multisoft Datentechnik" ], "domainName": { "awisRank": { "2022": 11801152 }, "name": "flagship.de" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "example": [ "** File: hello1.prg // your first program\n? \"Hello world!\" // similar to printf(\"\\nHello world!\")\nwait // wait for user prompt before closing the application\n\n** File: hello2.prg // your second application\nset color to \"W+/B\" // set color white on blue\n@ 5,10 TO 9,30 // draw box\n@ 7,12 SAY \"hello world\" // print text on given coordinates\nkey = inkey(5) // wait for key press within 5 seconds\n\n** File: dbf1.prg // handles available/creates new database\n#include \"fspreset.fh\" // converts all file names to lower case\nPARAMETER par1 // accepts command-line parameters \ndbname := IF(EMPTY(par1), \"mydbf1\", par1) // set default if required \nIF .NOT. FILE(dbname + \".dbf\") // database available?\n DBCREATE(dbname, {{\"Name\", \"C\", 25, 0}, ; // not yet, so\n {\"Address\", \"C\", 30, 0}, ; // create a new\n {\"Born\", \"D\", 8, 0}, ; // database, here\n {\"Note\", \"M\", 10, 0}} ) // with 4 fields\nENDIF\nUSE (dbname) SHARED // open the given database or mydbf1.dbf\nIF !USED() // check the success\n ? \"sorry, cannot open\", dbname\n QUIT // abort the execution\nENDIF\nBROWSE () // browse/edit\nQUIT // exit back to command line" ], "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|6Genesis Flagship Program: Building the Bridges Towards 6G-Enabled Wireless Smart Society and Ecosystem|10.1109/LATINCOM.2018.8613209|69|4|M. Katz and Marja Matinmikko-Blue and M. Latva-aho|043b0f74aae98fe9a3c6a434d30aec743222502d\n1989|Hope+ on Flagship|10.1007/978-1-4471-3166-3_20|15|0|Iain B. Robertson|7ec09052fcd3a29949f2d56b0673608d2d260e2b" }, "flame-ir": { "title": "flame-ir", "appeared": 2015, "type": "ir", "description": "An intermediate representation (IR) in static single assignment (SSA) form. This type of IR is favored by state-of-the-art optimizing compilers such as LLVM and GCC. Flame IR is designed from the ground up with the express intent of making it as suitable as possible for a wide range of optimizations and analyses. Flame is a collection of C# libraries for building tools that read, analyze, optimize and write managed languages.", "website": "https://github.com/jonathanvdc/flame", "country": [ "Canada" ], "originCommunity": [ "McGill University" ], "githubRepo": { "firstCommit": 2017, "stars": 45, "forks": 4, "subscribers": 4, "created": 2015, "updated": 2022, "description": "A compiler framework for managed code.", "issues": 4, "url": "https://github.com/jonathanvdc/flame" }, "repoStats": { "firstCommit": 2017, "commits": 6120, "committers": 2, "files": 463 } }, "flang": { "title": "FLANG", "appeared": 1988, "type": "pl", "reference": [ "https://link.springer.com/chapter/10.1007%2FBFb0013535" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/llvm" ], "wikipedia": { "backlinksCount": 3, "url": "https://en.wikipedia.org/wiki/FLANG" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5420", "semanticScholar": "" }, "flapjax": { "title": "Flapjax", "appeared": 2006, "type": "pl", "website": "http://www.flapjax-lang.org/", "country": [ "United States" ], "originCommunity": [ "Brown University" ], "domainName": { "registered": 2006, "awisRank": { "2022": 4305541 }, "name": "flapjax-lang.org" }, "wikipedia": { "related": [ "javascript", "haskell" ], "summary": "Flapjax is a programming language built on JavaScript. It provides a spreadsheet-like reactive programming, dataflow computing style, termed functional reactive programming, making it easy to create reactive web pages without the burden of callbacks and potentially inconsistent mutation. Flapjax can be viewed in two ways: either as a library, for use in regular JavaScript programs, or as a new language that the compiler converts into generic JavaScript. In either case, the resulting programs can be run in a regular web browser. Flapjax comes with persistent storage and a simple application programming interface (API) that masks the complexity of using Ajax, and sharing and access control (AC) for server data.It is free and open-source software released under a 3-clause BSD license. The Flapjax compiler is written in the language Haskell.", "created": 2006, "backlinksCount": 10, "pageId": 7458589, "revisionCount": 39, "dailyPageViews": 7, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Flapjax" }, "centralPackageRepositoryCount": 0 }, "flare": { "title": "Flare", "appeared": 2001, "type": "pl", "creators": [ "Dmitriy Myshkin", "Eliezer Yudkowsky", "Mike Li", "Michael Baj", "Richard Walker" ], "description": "Flare is a proposal for the first \"annotative\" programming language. In dialects of LISP, both the program and the program data are represented as lists. In Flare, the program, program data, and ideally the program state, are all represented as well-formed XML. Because XML is annotative (additional sub-elements can be easily added to any parent element without destroying the structural integrity of existing data) and extensible (new sub-element types can be easily created), these properties are shared by Flare objects and Flare programs. This fundamental idiom enables a wide variety of new patterns, and should enable significantly greater modularity, cleanness, ease of adaptation, and so on.", "website": "https://flarelang.sourceforge.net", "originCommunity": [ "Singularity Institute for Artificial Intelligence" ], "influencedBy": [ "xml", "python", "java", "cpp", "eiffel", "common-lisp", "scheme", "perl", "haskell" ], "example": [ "\n Bob\n 2\n 2\n 35.23\n" ] }, "flatbuffers": { "title": "FlatBuffers", "appeared": 2014, "type": "idl", "website": "https://google.github.io/flatbuffers/", "originCommunity": [ "Google" ], "githubRepo": { "firstCommit": 2014, "stars": 18105, "forks": 2826, "subscribers": 641, "created": 2014, "updated": 2022, "description": "FlatBuffers: Memory Efficient Serialization Library", "issues": 166, "url": "https://github.com/google/flatbuffers" }, "repoStats": { "firstCommit": 2014, "commits": 3108, "committers": 690, "files": 1707 }, "semanticScholar": "" }, "flatline": { "title": "Flatline", "appeared": 2013, "type": "pl", "description": "Flatline is a lispy language for the specification of values to be extracted or generated from an input dataset, using a finite sliding window of input rows.", "website": "http://bigmlcom.github.io/flatline", "country": [ "United States" ], "originCommunity": [ "BigML Inc" ], "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "example": [ "(if (missing? \"00000\") (random-value \"000000\") (f \"000000\"))" ], "githubRepo": { "firstCommit": 2013, "stars": 26, "forks": 14, "subscribers": 13, "created": 2013, "updated": 2022, "description": "Documentation, examples and utilities for Flatlline, BigML's dataset transformation and generation language", "issues": 0, "url": "https://github.com/bigmlcom/flatline" }, "repoStats": { "firstCommit": 2013, "commits": 84, "committers": 5, "files": 22 }, "pygmentsHighlighter": { "filename": "dsls.py", "id": "Flatline" } }, "flavors": { "title": "Flavors", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "lisp-machine-lisp", "common-lisp" ], "summary": "Flavors, an early object-oriented extension to Lisp developed by Howard Cannon at the MIT Artificial Intelligence Laboratory for the Lisp machine and its programming language Lisp Machine Lisp, was the first programming language to include mixins. Symbolics used it for its Lisp machines, and eventually developed it into New Flavors; both the original and new Flavors were message passing OO models. It was hugely influential in the development of the Common Lisp Object System (CLOS).Implementations of Flavors are also available for Common Lisp.New Flavors replaced message sending with calling generic functions. Flavors offers :before and :after daemons with the default method combination (called :daemon).", "pageId": 1332640, "created": 2004, "backlinksCount": 36, "revisionCount": 62, "dailyPageViews": 27, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Flavors_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=898", "fileType": "text", "centralPackageRepositoryCount": 0 }, "fleck": { "title": "fleck", "appeared": 2019, "type": "pl", "creators": [ "Chris McCormick" ], "country": [ "United States" ], "originCommunity": [ "https://mccormick.cx" ], "example": [ "(println \"Hello world!\")" ], "githubRepo": { "firstCommit": 2019, "stars": 478, "forks": 14, "subscribers": 7, "created": 2019, "updated": 2022, "description": "A LISP that runs wherever Bash is", "issues": 1, "url": "https://github.com/chr15m/flk" }, "repoStats": { "firstCommit": 2019, "commits": 113, "committers": 5, "files": 36 } }, "flengpp": { "title": "FLENG++", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d9499c6534640032d0eecbfd660ddd3e430a1007" ], "country": [ "United States" ], "originCommunity": [ "University of Tokyo" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4198", "centralPackageRepositoryCount": 0 }, "flex-lang": { "title": "Flex language", "appeared": 1967, "type": "pl", "creators": [ "Alan Kay" ], "country": [ "United States" ], "originCommunity": [ "University of Utah" ], "wikipedia": { "related": [ "smalltalk" ], "summary": "In computing, the FLEX language was developed by Alan Kay in the late 1960s while exploring ideas that would later evolve into the Smalltalk programming language.", "pageId": 38916706, "created": 2013, "backlinksCount": 4, "revisionCount": 5, "dailyPageViews": 14, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/Flex_(language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "flex": { "title": "FLEX", "appeared": 1987, "type": "grammarLanguage", "creators": [ "Vern Paxson" ], "website": "https://github.com/westes/flex", "documentation": [ "https://www.di.uminho.pt/~prh/FlexTutorial.pdf", "https://www.geeksforgeeks.org/flex-fast-lexical-analyzer-generator/" ], "reference": [ "https://github.com/babyraging/yash" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "githubRepo": { "firstCommit": 1987, "stars": 2618, "forks": 454, "subscribers": 72, "created": 2013, "updated": 2022, "description": "The Fast Lexical Analyzer - scanner generator for lexing in C and C++", "issues": 154, "url": "https://github.com/westes/flex" }, "repoStats": { "firstCommit": 1987, "commits": 2579, "committers": 68, "files": 293 }, "wikipedia": { "example": [ "%{\n#include \"y.tab.h\"\n%}\n\ndigit [0-9]\nletter [a-zA-Z]\n\n%%\n\"+\" { return PLUS; }\n\"-\" { return MINUS; }\n\"*\" { return TIMES; }\n\"/\" { return SLASH; }\n\"(\" { return LPAREN; }\n\")\" { return RPAREN; }\n\";\" { return SEMICOLON; }\n\",\" { return COMMA; }\n\".\" { return PERIOD; }\n\":=\" { return BECOMES; }\n\"=\" { return EQL; }\n\"<>\" { return NEQ; }\n\"<\" { return LSS; }\n\">\" { return GTR; }\n\"<=\" { return LEQ; }\n\">=\" { return GEQ; }\n\"begin\" { return BEGINSYM; }\n\"call\" { return CALLSYM; }\n\"const\" { return CONSTSYM; }\n\"do\" { return DOSYM; }\n\"end\" { return ENDSYM; }\n\"if\" { return IFSYM; }\n\"odd\" { return ODDSYM; }\n\"procedure\" { return PROCSYM; }\n\"then\" { return THENSYM; }\n\"var\" { return VARSYM; }\n\"while\" { return WHILESYM; }\n{letter}({letter}|{digit})* {\n yylval.id = strdup(yytext);\n return IDENT; }\n{digit}+ { yylval.num = atoi(yytext);\n return NUMBER; }\n[ \\t\\n\\r] /* skip whitespace */\n. { printf(\"Unknown character [%c]\\n\",yytext[0]);\n return UNKNOWN; }\n%%\n\nint yywrap(void){return 1;}" ], "related": [ "bison", "yacc", "c", "ratfor", "pl-0" ], "summary": "Flex (fast lexical analyzer generator) is a free and open-source software alternative to lex. It is a computer program that generates lexical analyzers (also known as \"scanners\" or \"lexers\"). It is frequently used as the lex implementation together with Berkeley Yacc parser generator on BSD-derived operating systems (as both lex and yacc are part of POSIX), or together with GNU bison (a version of yacc) in *BSD ports and in Linux distributions. Unlike Bison, flex is not part of the GNU Project and is not released under the GNU General Public License.", "pageId": 376795, "dailyPageViews": 80, "created": 2003, "backlinksCount": 12, "revisionCount": 253, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/Flex_(lexical_analyser_generator)" }, "rijuRepl": { "example": [ "%{\n#include \n%}\n\n%%\n%%\n\nint yywrap() {\n printf(\"Hello, world!\\n\");\n return 1;\n}\n\nint main() {\n yylex();\n return 0;\n}\n" ], "id": "https://riju.codes/flex" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2033", "fileType": "text", "wordRank": 9114, "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Flex 2|2007|Chafic Kazoun|559921|3.31|35|4\nProgramming Flex 3|2008|Chafic Kazoun|2557355|3.44|9|1", "isbndb": "year|publisher|title|authors|isbn13\n2010|Adobe Developer Library|Flex 4 Cookbook: Real-world recipes for developing Rich Internet Applications (Cookbooks (O'Reilly))|Joshua Noble and Todd Anderson and Garth Braithwaite and Marco Casario and Rich Tretola and David Tucker|9780596805616\n2008|Adobe Press|Adobe Flex 3: Training from the Source|Tapper, Jeff and Labriola, Michael and Boles, Matthew and Talbot, James|9780321529183\n2007|Apress|Foundation ActionScript 3.0 with Flash CS3 and Flex|McSharry, Sean and YardFace, Gerald and Webster, Steve|9781590598153\n2008|Adobe Developer Library|Learning Flex 3: Getting up to Speed with Rich Internet Applications (Adobe Developer Library)|Cole, Alaric|9780596517328\n20080514|O'Reilly Media, Inc.|Programming Flex 3|Kazoun, Chafic; Lott, Joey|9780596516215\n2010|Adobe Developer Library|Getting Started with Flex 4|Stallons, Jeanette and Shorten, Andrew and Genovese, Vince|9780596804114\n2008|Apress|Creating Mashups with Adobe Flex and AIR (Friends of Ed Abobe Learning Library)|Korhonen, Chris and Hassoun, David|9781590599365\n2007|Adobe Developer Library|Programming Flex 2: The Comprehensive Guide to Creating Rich Internet Applications with Adobe Flex|Chafic Kazoun and Joey Lott|9780596526894\n2008|Addison-Wesley Professional|Creating Visual Experiences with Flex 3.0|Sanchez, Juan and McIntosh, Andy|9780321545374\n2022|SYS-CON Media|Rich Internet Applications with Adobe Flex and Java : Secrets of the Masters|Fain, Yakov; Rasputnis, Victor; Tartakovsky, Anatole|9780977762224\n20070309|O'Reilly Media, Inc.|Apollo for Adobe Flex Developers Pocket Guide|Mike Chambers; Rob Dixon; Jeff Swartz|9780596551643\n20091109|Springer Nature|Foundation ActionScript 3.0 for Flash and Flex|Darren Richardson; Paul Milbourne|9781430219194\n20070510|Springer Nature|The Essential Guide to Flex 2 with ActionScript 3.0|Charles Brown|9781430203360\n2007|Apress|Foundation Flex for Developers: Data-Driven Applications with PHP, ASP.NET, ColdFusion, and LCDS|Jacobs, Sas|9781590598948\n2009|O'Reilly Media|flex & bison: Text Processing Tools|Levine, John|9780596155971\n2007|PHI|Compiler Design Using FLEX and YACC|Das, Vinu V.|9788120332515\n2010|New Riders|Effortless Flex 4 Development|Ullman, Larry|9780131389489\n2011|Adobe Press|Adobe Flex 4.5 Fundamentals: Training from the Source|Labriola, Michael and Tapper, Jeff|9780132788908\n2006|Adobe Developer Library|ActionScript 3.0 Cookbook: Solutions for Flash Platform and Flex Application Developers|Lott, Joey and Schall, Darron and Peters, Keith|9780596526955\n2010|Adobe Press|Adobe Flex 4: Training from the Source, Volume 1|Labriola, Michael and Tapper, Jeff and Boles, Matthew|9780321694423\n2011|Addison-Wesley Professional|Developing Flex 4 Components: Using ActionScript & MXML to Extend Flex and AIR Applications|Jones, Mike|9780321604132\n2009|Packt Publishing|Flex 3 with Java|Kore, Satish|9781847195357\n2008|Addison-Wesley Professional|Creating Visual Experiences with Flex 3.0|Sanchez, Juan and McIntosh, Andy|9780132701952\n2009|Apress|Foundation ActionScript 3.0 for Flash and Flex (Foundations)|Richardson, Darren and Milbourne, Paul|9781430219187\n2009|Packt Publishing|Flex 3 with Java|Kore, Satish|9781847195340\n2010|Adobe Developer Library|Learning Flex 4: Getting Up to Speed with Rich Internet Application Design and Development (Adobe Developer Library)|Cole, Alaric and Robison, Elijah|9780596805630\n2009|Apress|Beginning Java and Flex: Migrating Java, Spring, Hibernate and Maven Developers to Adobe Flex (Expert's Voice in Web Development)|di Pisa, Filippo|9781430223856\n2010|Artima Inc|Flex 4 Fun|Haase, Chet|9780981531625\n2009|Apress|Foundation XML and E4X for Flash and Flex (Foundations)|Jacobs, Sas|9781430216346\n2008|Apress|The Essential Guide to Flex 3 (Essentials)|Brown, Charles|9781590599501\n2007|Wrox|Professional Adobe Flex 2 (Programmer to Programmer)|Tretola, Rich and Barber, Simon and Erickson, Renaun|9780470102671\n2007|Adobe Developer Library|Apollo for Adobe Flex Developers Pocket Guide|Chambers, Mike and Dixon, Rob and Swartz, Jeff|9780596513917\n2008|Adobe Developer Library|Getting Started with Flex 3: An Adobe Developer Library Pocket Guide for Developers (Pocket Reference (O'Reilly))|Herrington, Jack D. and Kim, Emily|9780596520649\n2010|Apress|AdvancED Flex 4|Tiwari, Shashank and Elrom, Elad and Schulze, Charlie|9781430224846\n20090805|O'Reilly Media, Inc.|flex & bison|John Levine|9781449379278\n20080226|Springer Nature|Flex Solutions|Marco Casario|9781430204244\n20090805|O'Reilly Media, Inc.|flex & bison|John Levine|9781449391973\n2007|O'reilly|Programming Flex 2|Kazoun, Chafic.|9780596526894\n20101102|O'Reilly Media, Inc.|Learning Flex 4|Alaric Cole; Elijah Robison|9781449396671\n20070416|O'Reilly Media, Inc.|Programming Flex 2|Chafic Kazoun; Joey Lott|9780596554897\n20080513|O'Reilly Media, Inc.|Flex 3 Cookbook|Joshua Noble; Todd Anderson|9780596550677\n20081123|Springer Nature|AdvancED Flex 3|Shashank Tiwari; Elad Elrom|9781430210283\n20080919|O'Reilly Media, Inc.|Programming Flex 3|Chafic Kazoun; Joey Lott|9781449391089\n|Addison-wesley|Flex on Rails: building rich Internet applications with Adobe Flex 3 and Rails 2|Hillerson, Tony.|9780321574305\n20070530|O'Reilly Media, Inc.|Flex Early Evaluation: Assessing Flex and Your Project Needs|Anthony Franco|9780596514419\n20091031|Simon & Schuster|Hello! Flex 4|Peter Armstrong|9781638354352\n20100511|O'Reilly Media, Inc.|Flex 4 Cookbook|Joshua Noble; Todd Anderson; Garth Braithwaite; Marco Casario; Rich Tretola|9781449390594\n20070921|O'Reilly Media, Inc.|Flex 3 Early Evaluation: Assessing Flex and Your Project Needs|The EffectiveUI Team|9780596515911\n20080302|Springer Nature|Foundation Flex for Developers|Sas Jacobs|9781430204442\n20101114|Simon & Schuster|Flex 4 in Action|Dan Orlando; Joel Hooks; Tariq Ahmed|9781638351399\n20080805|Springer Nature|AdvancED Flex Application Development|Chris Charlton; R Blank; Omar Gonzalez; Hasan Otuome|9781430204428\n20080311|Springer Nature|Foundation Flex for Designers|Greg Goralski; Lordalex Leon|9781430204343\n20110110|Pearson Technology Group|Developing Flex 4 Components|Mike E. Jones|9780321604576\n20100316|O'Reilly Media, Inc.|Enterprise Development with Flex|Yakov Fain; Victor Rasputnis; Anatole Tartakovsky|9781449388737\n20120530|Simon & Schuster|Flex Mobile in Action|Jonathan Campos|9781638352723\n20070228|O'Reilly Media, Inc.|Introduction to Flex 2|Roger Braunstein|9780596550035\n20100402|Springer Nature|Beginning Java and Flex|Filippo di Pisa|9781430223863\n20080624|O'Reilly Media, Inc.|Getting Started with Flex 3|Jack D. Herrington; Emily Kim; Adobe Development Team|9781449390815\n2009|Addison-wesley|Flex On Rails: Building Rich Internet Applications With Adobe Flex 3 And Rails 2|Hillerson, Tony.|9780321543370\n04/2007|O'Reilly Media, Inc.|Programming Flex 2: The Comprehensive Guide to Creating Rich Internet Applications with Adobe Flex|Kazoun, Chafic; Lott, Joey|9780596515249\n09/2008|O'Reilly Media, Inc.|Programming Flex 3: The Comprehensive Guide to Creating Rich Internet Applications with Adobe Flex|Kazoun, Chafic; Lott, Joey|9780596155360\n20110824|O'Reilly Media, Inc.|Developing iOS Applications with Flex 4.5|Rich Tretola|9781449315801\n20110509|O'Reilly Media, Inc.|Developing Android Applications with Flex 4.5|Rich Tretola|9781449310134\n20110824|O'Reilly Media, Inc.|Developing iOS Applications with Flex 4.5|Rich Tretola|9781449315252\n20080125|O'Reilly Media, Inc.|Agile Enterprise Application Development with Flex|The EffectiveUI Team|9780596514402\n20110509|O'Reilly Media, Inc.|Developing Android Applications with Flex 4.5|Rich Tretola|9781449310332\n20080828|Springer Nature|The Essential Guide to Flex 3|Charles Brown|9781430205661\n20080125|O'Reilly Media, Inc.|Agile Enterprise Application Development with Flex|The EffectiveUI Team; Tony Hillerson|9781449391171\n20140316|Emereo|Adobe Flex 77 Success Secrets - 77 Most Asked Questions On Adobe Flex - What You Need To Know|Timothy Sosa|9781488538452\n20090221|Springer Nature|Foundation XML and E4X for Flash and Flex|Sas Jacobs|9781430216353\n20080731|Springer Nature|Foundation ActionScript 3.0 with Flash CS3 and Flex|Sean McSharry; Gerald YardFace; Steve Webster|9781430201960\n05/2008|O'Reilly Media, Inc.|Flex 3 Cookbook: Code-Recipes, Tips, and Tricks for RIA Developers|Noble, Joshua; Anderson, Todd|9780596153847\n10/2006|O'Reilly Media, Inc.|ActionScript 3.0 Cookbook: Solutions for Flash Platform and Flex Application Developers|Lott, Joey; Schall, Darron; Peters, Keith|9780596510060\n05/2010|O'Reilly Media, Inc.|Flex 4 Cookbook: Real-world recipes for developing Rich Internet Applications|Noble, Joshua; Anderson, Todd; Braithwaite, Garth; Casario, Marco; Tretola, Rich|9781449391232\n06/2008|O'Reilly Media, Inc.|Getting Started with Flex 3: An Adobe Developer Library Pocket Guide for Developers|Herrington, Jack D.; Kim, Emily; Team, Adobe Development|9780596154271\n11/2010|O'Reilly Media, Inc.|Learning Flex 4: Getting Up to Speed with Rich Internet Application Design and Development|Alaric Cole; Elijah Robison|9781449301873", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|Building flexible real-time systems using the Flex language|10.1109/2.76288|136|5|K. Kenny and Kwei-Jay Lin|e6c9858bfa280739f6090c994f8f376fab0d4de8\n1988|Expressing and maintaining timing constraints in FLEX|10.1109/REAL.1988.51105|96|0|Kwei-Jay Lin and S. Natarajan|ae40cd68c188a5157ff9507c45d8375ab147a969\n1991|Flex : A Language for Programming Flexible Real-Time Systems|10.1007/978-1-4615-4016-8_10|14|0|Kwei-Jay Lin and J. Liu and K. Kenny and S. Natarajan|79607cc3eb1890aea08fe98fa5a6096bf74300aa\n2010|Game E-Learning Code Master Dengan Konsep Mmorpg Menggunakan Adobe Flex 3|10.21512/COMTECH.V1I2.2365|3|0|Fredy Purnomo and Monika Leslivania and D. Daniel and Lisye Mareta Cahya|0d097a44bbd9a06ebb6a0695233344ea3caa6e8d" }, "flexbuffers": { "title": "flexbuffers", "appeared": 2014, "type": "idl", "description": "A schemaless binary encoding. This is a binary format that can be used in conjunction with FlatBuffers (by storing a part of a buffer in FlexBuffers format), or also as its own independent serialization format.", "reference": [ "https://google.github.io/flatbuffers/flatbuffers_internals.html" ], "country": [ "United States" ], "originCommunity": [ "Google" ], "related": [ "flatbuffers" ] }, "flexml": { "title": "FleXML", "appeared": 2001, "type": "pl", "country": [ "France" ], "originCommunity": [ "École normale supérieure de Lyon" ], "wikipedia": { "related": [ "c", "yacc", "xml", "perl" ], "summary": "FleXML is an XML transformation language originally developed by Kristofer Rose. It allows a programmer to specify actions in C programming language or C++, and associate those actions with element definitions in an XML DTD. It is similar in philosophy to Yacc and the Lex programming tool in that it is a syntax-directed driver; one could establish the analogies Yacc:LR(1) grammar::Lex:Regular grammar::FleXML::XML. The implementation is in Perl. A programmer supplied action file is input to FleXML; the output is a file suitable for input to Flex lexical analyser.", "created": 2005, "backlinksCount": 8, "pageId": 1660966, "revisionCount": 17, "dailyPageViews": 3, "url": "https://en.wikipedia.org/wiki/FleXML" }, "centralPackageRepositoryCount": 0 }, "flic": { "title": "FLIC", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/66e4059997c3f09b65fc65f630cac128c2521aa8" ], "country": [ "United Kingdom" ], "originCommunity": [ "University College London" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3531", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "flix": { "title": "Flix", "appeared": 2016, "type": "pl", "creators": [ "Magnus Madsen" ], "website": "https://flix.dev/", "country": [ "Denmark" ], "originCommunity": [ "https://github.com/flix" ], "githubRepo": { "stars": 1645, "forks": 112, "subscribers": 20, "created": 2015, "updated": 2023, "description": "The Flix Programming Language", "issues": 457, "url": "https://github.com/flix/flix" }, "repoStats": { "firstCommit": 2014, "commits": 8297, "committers": 68, "files": 942 } }, "floorplan": { "title": "floorplan", "appeared": 2019, "type": "pl", "description": "In this paper we introduce Floorplan, a declarative language for specifying memory layouts at a high level. Constraints formerly implemented by describing how to compute locations are, in Floorplan, defined declaratively using explicit layout constructs.", "reference": [ "https://cronburg.com/papers/floorplan19.pdf" ], "country": [ "United States" ], "originCommunity": [ "Tufts University" ] }, "flora": { "title": "Flora", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6e627842de1712e960c3289af9894ee75f404d13" ], "country": [ "France" ], "originCommunity": [ "National Institute for Research in Digital Science and Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2836", "centralPackageRepositoryCount": 0 }, "floral": { "title": "Floral", "appeared": 2020, "type": "pl", "isDead": true, "githubRepo": { "url": "https://github.com/euppal/floral" } }, "floscript": { "title": "FloScript", "appeared": 2013, "type": "pl", "creators": [ "Samuel Smith" ], "country": [ "United States" ], "originCommunity": [ "ProSapien LLC" ], "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2013, "stars": 149, "forks": 33, "subscribers": 19, "created": 2013, "updated": 2021, "description": "Automated Reasoning Engine and Flow Based Programming Framework ", "issues": 0, "url": "https://github.com/ioflo/ioflo" }, "repoStats": { "firstCommit": 2013, "commits": 1231, "committers": 13, "files": 221 }, "pygmentsHighlighter": { "filename": "floscript.py", "fileExtensions": [ "flo" ], "id": "FloScript" } }, "flow-matic": { "title": "FLOW-MATIC", "appeared": 1955, "type": "pl", "creators": [ "Grace Hopper" ], "country": [ "United States" ], "originCommunity": [ "Remington Rand" ], "wikipedia": { "example": [ "(0) INPUT INVENTORY FILE-A PRICE FILE-B ; OUTPUT PRICED-INV FILE-C UNPRICED-INV\n FILE-D ; HSP D .\n (1) COMPARE PRODUCT-NO (A) WITH PRODUCT-NO (B) ; IF GREATER GO TO OPERATION 10 ;\n IF EQUAL GO TO OPERATION 5 ; OTHERWISE GO TO OPERATION 2 .\n (2) TRANSFER A TO D .\n (3) WRITE-ITEM D .\n (4) JUMP TO OPERATION 8 .\n (5) TRANSFER A TO C .\n (6) MOVE UNIT-PRICE (B) TO UNIT-PRICE (C) .\n (7) WRITE-ITEM C .\n (8) READ-ITEM A ; IF END OF DATA GO TO OPERATION 14 .\n (9) JUMP TO OPERATION 1 .\n(10) READ-ITEM B ; IF END OF DATA GO TO OPERATION 12 .\n(11) JUMP TO OPERATION 1 .\n(12) SET OPERATION 9 TO GO TO OPERATION 2 .\n(13) JUMP TO OPERATION 2 .\n(14) TEST PRODUCT-NO (B) AGAINST ; IF EQUAL GO TO OPERATION 16 ;\n OTHERWISE GO TO OPERATION 15 .\n(15) REWIND B .\n(16) CLOSE-OUT FILES C ; D .\n(17) STOP . (END)" ], "related": [ "arith-matic", "math-matic", "cobol" ], "summary": "FLOW-MATIC, originally known as B-0 (Business Language version 0), was the first English-like data processing language. It was developed for the UNIVAC I at Remington Rand under Grace Hopper during the period from 1955 until 1959. It had a strong influence on the development of COBOL.", "pageId": 82760, "dailyPageViews": 81, "created": 2002, "backlinksCount": 32, "revisionCount": 83, "appeared": 1955, "url": "https://en.wikipedia.org/wiki/FLOW-MATIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=27", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "flow": { "title": "Flow", "appeared": 2014, "type": "pl", "description": "Javascript with static type checking.", "website": "https://flow.org/", "webRepl": [ "https://flow.org/try/" ], "documentation": [ "https://flow.org/en/docs/" ], "country": [ "United States" ], "originCommunity": [ "Facebook" ], "domainName": { "registered": 2002, "awisRank": { "2022": 431104 }, "name": "flow.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// @flow\nfunction square(n: number): number {\n return n * n;\n}\n\nsquare(\"2\"); // Error!" ], "githubRepo": { "firstCommit": 2014, "stars": 21761, "forks": 1848, "subscribers": 404, "created": 2014, "updated": 2022, "description": "Adds static typing to JavaScript to improve developer productivity and code quality.", "issues": 2478, "url": "https://github.com/facebook/flow" }, "repoStats": { "firstCommit": 2014, "commits": 18174, "committers": 994, "files": 13927 }, "twitter": "https://twitter.com/flowtype", "isbndb": "year|publisher|title|authors|isbn13\n2012|LAP LAMBERT Academic Publishing|Mathemaical Modelling of Blood Flow in the Internal Carotid Artery: Modelling and Simulation of Blood Flow in the Internal Carotid artery for Optimum Human Health|Tivde, Tertsegha|9783659137389\n2006|Apress|Expert Spring MVC and Web Flow (Expert's Voice in Java)|Yates, Colin and Ladd, Seth and Devijver, Steven and Davison, Darren|9781590595848\n2010|Springer-Verlag New York, LLC|Hardware/Software Co-Design for Data Flow Dominated Embedded Systems|Niemann and Ralf and Marwedel and Peter|9781441950642\n2012|Apress|Pro Spring MVC: With Web Flow (Expert's Voice in Spring)|Deinum, Marten and Serneels, Koen and Yates, Colin and Ladd, Seth and Vervaet, Erwin and Vanfleteren, Christophe|9781430241560\n2012|Springer Vieweg|SynDEVS Co-Design Flow: A Hardware / Software Co-Design Flow Based on the Discrete Event System Specification Model of Computation|Molter, H. Gregor|9783658003968\n2010|Springer|Reasoning About Program Transformations: Imperative Programming And Flow Of Data|Jean-francois Collard|9781441929815\n2020|Apress|The Common Lisp Condition System: Beyond Exception Handling with Control Flow Mechanisms|\"Herda, Michał \"\"phoe\"\"\"|9781484261330\n2014|Springer|Traffic and Granular Flow '13|Mohcine Chraibi|9783319106298\n2012|Springer|Traffic Flow Dynamics: Data, Models and Simulation|Treiber, Martin and Kesting, Arne|9783642324604\n2012|LAP LAMBERT Academic Publishing|A Network Model: Minimum Cost Network Flow Problem (MCNFP): Mathematical Analysis of Minimum Cost Network Flow Problem|Uddin, Md. Farhad|9783659104077\n1992|Transportation Research Board|Highway Capacity and Traffic Flow (Transportation Research Record)||9780309054041\n2008|Elsevier Science|Information Flow and Knowledge Sharing (Volume 2) (Capturing Intelligence, Volume 2)|Correa da Silva, Flavio Soares and Agusti-Cullell, Jaume|9780444529350\n1995|Wiley|Finite Element Modeling of Environmental Problems: Surface and Subsurface Flow and Transport||9780471956624\n2013|Springer|Fire Flow Water Consumption in Sprinklered and Unsprinklered Buildings: An Assessment of Community Impacts (SpringerBriefs in Fire)|Code Consultants Inc.|9781461481096", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|The synchronous data flow programming language LUSTRE|10.1109/5.97300|1868|193|N. Halbwachs and P. Caspi and P. Raymond and D. Pilaud|cd14bffcea4165b8bda586a79c328267099f70d6\n1999|JFlow: practical mostly-static information flow control|10.1145/292540.292561|1200|83|A. Myers|c9d0cf3a81cac18b4c4a8201402571c31f13058a\n1996|A Sound Type System for Secure Flow Analysis|10.3233/JCS-1996-42-304|1126|93|D. Volpano and C. Irvine and Geoffrey Smith|0fda9bbccd6908637e2ead1cef69f091bfda75d4\n1974|First version of a data flow procedure language|10.1007/3-540-06859-7_145|700|28|J. Dennis|cb6e21774d8940a414fd39ba3e5b09def0b579c8\n1998|Secure information flow in a multi-threaded imperative language|10.1145/268946.268975|493|42|Geoffrey Smith and D. Volpano|2271ab97994a37d035edbd6baf77c0e8907afec8\n2004|A high‐level programming‐language implementation of topology optimization applied to steady‐state Navier–Stokes flow|10.1002/nme.1468|337|14|L. H. Olesen and F. Okkels and H. Bruus|33e77cced5da5548270b583492eb5709559bcd6f\n2011|Secure information flow by self-composition†|10.1017/S0960129511000193|315|23|G. Barthe and P. D’Argenio and Tamara Rezk|b556236c69b042af8c1d77c66e4ec4bf5fd1a689\n2007|A static analysis for quantifying information flow in a simple imperative language|10.3233/jcs-2007-15302|189|13|D. Clark and Sebastian Hunt and P. Malacaria|d1698a71ceb10ed18edd784fd5f38db793ccac45\n2011|Caisson: a hardware description language for secure information flow|10.1145/1993498.1993512|106|17|Xun Li and Mohit Tiwari and J. Oberg and Vineeth Kashyap and F. Chong and T. Sherwood and B. Hardekopf|09dce8e6947261600ec145f4544ede7ae5dc437e\n2015|Precise, dynamic information flow for database-backed applications|10.1145/2908080.2908098|57|6|Jean Yang and Travis Hance and Thomas H. Austin and Armando Solar-Lezama and C. Flanagan and Stephen Chong|270ce1140e9695c79e7ff0acdf6f3b5fcf4f3600\n2014|Quantifying Information Flow for Dynamic Secrets|10.1109/SP.2014.41|48|1|Piotr Mardziel and M. Alvim and M. Hicks and Michael R. Clarkson|689825bef9e1015da2cceed309a6de884e45e902\n1973|A data flow language for operating systems programming|10.1145/800021.808289|40|1|P. Kosinski|6f50450244f1f91afab9ce876f69ffa4d0450714\n2013|Swift/T: scalable data flow programming for many-task applications|10.1145/2442516.2442559|40|2|J. Wozniak and Timothy G. Armstrong and M. Wilde and D. Katz and E. Lusk and Ian T Foster|a5138319f40cd58c0fbe08a5fb513be0c0642f8e\n2016|Developed generalised unified power flow controller model in the Newton–Raphson power-flow analysis using combined mismatches method|10.1049/IET-GTD.2015.1247|34|0|S. Kamel and F. Jurado and Zhe Chen and M. Abdel-Akher and Mohamed Ebeed|5766b568c060417e2173d0cc3f7abb235b513d03\n2012|Flexible dynamic information flow control in the presence of exceptions*|10.1017/S0956796816000241|34|5|D. Stefan and David Mazières and John C. Mitchell and Alejandro Russo|cc328b7ef7dd05cc89c5a058b0d7b2db69ec806e\n1988|A Programming Language for Discrete Event Production Systems Based on Production Flow Schema and Mark Flow Graph|10.9746/SICETR1965.24.183|24|0|P. Miyagi and K. Hasegawa and K. Takahashi|69c8c0948896ad8afc717b7cfeac9206190d2d7d\n1994|VIPERS: a data flow visual programming environment based on the Tcl language|10.1145/192309.192361|21|3|Massimo Bernini and M. Mosconi|9aa8df179b2f6b3c252657a8813850e22d2fe7e9\n1985|Omega—A Data Flow Analysis Tool for the C Programming Language|10.1109/TSE.1985.232542|20|1|C. Wilson and L. Osterweil|a17b956678ab4e32f2246a425d92d2d0c9d9035a\n2014|FlowR: aspect oriented programming for information flow control in ruby|10.1145/2577080.2577090|17|1|Thomas Pasquier and J. Bacon and B. Shand|88725c499c0b425fcaaf36de32cdd287386a9870\n2010|Language-based replay via data flow cut|10.1145/1882291.1882322|13|0|Ming Wu and Fan Long and Xi Wang and Zhilei Xu and Haoxiang Lin and Xuezheng Liu and Zhenyu Guo and Huayang Guo and Lidong Zhou and Zheng Zhang|34ce7b7b03cbe75d8803e2c1cd1626cd60251758\n1981|The data flow programming language CAJOLE - an informal introduction|10.1145/947864.947867|13|0|C. Hankin and H. Glaser|653798784585ee159dd25fa50017d0f99a88ea8e\n1997|BDL-A Nondeterministic Data Flow Programming Language with Backtracking|10.1109/VL.1997.626610|9|1|Andy Schürr|8a74a3871d6fad745eec83c2bab8222dd4f8281a\n1990|IDF: A graphical data flow programming language for image processing and computer vision|10.1109/ICSMC.1990.142126|8|0|N. Hunt|e9a89e9b2e73df8300010609a9f57367201de05c\n2009|Not-so-free data flow in a visual data flow programming language|10.1109/ICCSIT.2009.5234876|3|0|M. Marttila-Kontio and Risto T. Honkanen|6ba2dc2bdf18d732e26fad12bef375f2af5e36ff\n1997|BDL-a nondeterministic data flow programming language with backtracking|10.1109/VL.1997.626610|2|0|A. Schurr|9be8d906cf0af3bd0e193100b2c4c2b0536b1a66" }, "flow9": { "title": "Flow9", "appeared": 2010, "type": "pl", "creators": [ "Dmitry Solomennikov" ], "description": "The flow programming language, a safe, functional strongly-typed programming language", "website": "https://flow9.org/", "reference": [ "https://news.ycombinator.com/item?id=19769410" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/area9innovation" ], "domainName": { "registered": 2017, "name": "flow9.org" }, "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasImports": { "example": "import runtime;", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "includeToken": [ [ "import" ] ], "keywords": [ "import", "require", "export", "forbid", "native", "if", "else", "cast", "unsafe", "switch", "default" ], "example": [ "import runtime;\n\nmain() {\n\tprintln(\"Hello world\");\n}" ], "githubRepo": { "firstCommit": 2018, "stars": 535, "forks": 30, "subscribers": 57, "created": 2018, "updated": 2022, "description": "Platform for safe, easy and productive programming of complex, multi-platform apps with a modern user interface", "issues": 41, "url": "https://github.com/area9innovation/flow9" }, "repoStats": { "firstCommit": 2018, "commits": 11518, "committers": 204, "files": 6776 }, "monaco": "flow9" }, "flowchart-fun": { "title": "flowchart.fun", "appeared": 2021, "type": "textMarkup", "creators": [ "Rob Gordon" ], "description": "flowchart.fun is a lightweight application to generate flowcharts and diagrams from text.", "website": "https://flowchart.fun/", "country": [ "Cananda" ], "originCommunity": [ "https://github.com/tone-row" ], "related": [ "dot" ], "githubRepo": { "firstCommit": 2021, "stars": 2536, "forks": 182, "subscribers": 32, "created": 2021, "updated": 2022, "description": "Easily generate flowcharts and diagrams from text ⿻", "issues": 6, "url": "https://github.com/tone-row/flowchart-fun" }, "repoStats": { "firstCommit": 2021, "commits": 1098, "committers": 13, "files": 345 } }, "flowcode": { "title": "Flowcode", "appeared": 2002, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Matrix Technology Solutions Ltd" ], "wikipedia": { "related": [ "pic-microcontroller", "atmel-avr", "arduino", "c", "blockly" ], "summary": "Flowcode is a Microsoft Windows-based development environment commercially produced by Matrix TSL for programming embedded devices based on PIC, AVR (including Arduino) and ARM technologies using graphical programming styles (such as flowcharts) and imperative programming styles (through C and Pseudocode). It is currently in its eighth revision. Flowcode is dedicated to simplifying complex functionality such as Bluetooth, Mobile Phones Communications, USB communications etc. by using pre-developed dedicated component libraries of functions. This is achieved by dragging virtual representations of hardware onto a visual panel, providing access to associated libraries. Flowcode is therefore ideal for speeding up software development times and allowing those with little programming experience to get started and help with projects. This makes it appropriate for the formal teaching of principles of programming microcontrollers .. Flowcode allows the user to develop and view their program using four different visual modes. These are the Flowchart view, the Blocks view (a graphical programming paradigm inspired by Blockly), the C code view and the Pseudocode view. Flowcode also has compatibility with Solidworks.There is a large and helpful online community based at the Matrix user forums. There is also a dedicated Wiki.", "created": 2013, "backlinksCount": 20, "pageId": 38557302, "revisionCount": 29, "dailyPageViews": 28, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/Flowcode" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "flowgorithm": { "title": "Flowgorithm", "appeared": 2014, "type": "visual", "screenshot": "https://pldb.com/screenshots/flowgorithm.png", "description": "Flowgorithm is a free beginner's programming language that is based on simple graphical flowcharts.", "website": "http://www.flowgorithm.org/", "country": [ "Italy" ], "originCommunity": [ "http://robatz.altervista.org" ], "domainName": { "registered": 2014, "awisRank": { "2022": 474372 }, "name": "flowgorithm.org" }, "related": [ "dot", "scratch" ], "subreddit": [ { "memberCount": { "2022": 220 }, "url": "https://reddit.com/r/flowgorithm" } ], "twitter": "https://twitter.com/flowgorithm" }, "flowlog": { "title": "flowlog", "appeared": 2014, "type": "pl", "description": "We present Flowlog, a tierless language for programming SDN controllers. In contrast to languages with different abstractions for each program tier---the control-plane, data-plane, and controller state---Flowlog provides a unified abstraction for all three tiers. Flowlog is reminiscent of both SQL and rule-based languages such as Cisco IOS and JunOS; unlike these network configuration languages, Flowlog supports programming with mutable state. We intentionally limit Flowlog’s expressivity to enable built-in verification and proactive compilation despite the integration of controller state. To compensate for its limited expressive power, Flowlog enables the reuse of external libraries through callouts. Flowlog proactively compiles essentially all forwarding behavior to switch tables. For rules that maintain controller state or generate fresh packets, the compiler instructs switches to send the minimum amount of necessary traffic to the controller. Given that Flowlog programs can be stateful, this process is non-trivial. We have successfully used Flowlog to implement real network applications. We also compile Flowlog programs to Alloy, a popular verification tool. With this we have verified several properties, including program-correctness properties that are topology-independent, and have found bugs in our own programs.", "reference": [ "https://cs.brown.edu/~sk/Publications/Papers/Published/nfsk-flowlog-tierless/" ], "country": [ "United States" ], "originCommunity": [ "Brown University" ], "example": [ "TABLE stolen(switchid );\nREMOTE TABLE get_time(int );" ] }, "flownet": { "title": "FlowNet", "appeared": 1993, "type": "protocol", "creators": [ "Erann Gat", "Mike Ciholas" ], "description": "Ethernet alternative. Like ATM, FlowNet is a switched network based on fixed-size cells. Unlike ATM, FlowNet cells are large--800 bytes instead of 53. This allows room for a 14-byte Ethernet header plus an additional QoS extension. The QoS extension header is 18 bytes, making the full FlowNet header 32 bytes long. The remaining 768 bytes (=256+512) are data payload. FlowNet interoperates with Ethernet through a simple bridge device.", "reference": [ "https://flownet.com/gat/fnlj.html" ], "country": [ "United States" ], "originCommunity": [ "https://rongarret.info" ], "related": [ "ethernet" ] }, "flownote": { "title": "flownote", "appeared": 2019, "type": "pl", "website": "https://gitter.im/flownote/community", "country": [ "United States" ], "originCommunity": [ "https://github.com/Emblem21-OpenSource" ], "githubRepo": { "firstCommit": 2019, "stars": 6, "forks": 1, "subscribers": 4, "created": 2019, "updated": 2019, "description": "FlowNote lets developers create, organize, and reason about event-oriented applications with a simple flow-based language.", "issues": 18, "url": "https://github.com/Emblem21-OpenSource/flownote" }, "repoStats": { "firstCommit": 2019, "commits": 142, "committers": 3, "files": 107 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n19440418|Show HN: Preview of FlowNote, a language for flow-based paradigms|2019-03-20 09:40:14 UTC|1553074814|FlowNote|0|1" }, "flua": { "title": "flua", "appeared": 2012, "type": "pl", "creators": [ "Eduard Urbach" ], "website": "http://flua-lang.org", "country": [ "Japan or Korea" ], "originCommunity": [ "https://github.com/akyoto/flua/issues" ], "domainName": { "name": "flua-lang.org" }, "githubRepo": { "firstCommit": 2008, "stars": 15, "forks": 2, "subscribers": 3, "created": 2010, "updated": 2018, "description": ":gem: Programming language abstracting existing ones.", "issues": 0, "url": "https://github.com/akyoto/flua" }, "repoStats": { "firstCommit": 2008, "commits": 1005, "committers": 5, "files": 1210 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n4208695|Flua programming language in development (Alpha)|http://flua-lang.org/|2012-07-06 17:18:50 UTC|1341595130|blitzprog|0|1" }, "flutter-framework": { "title": "Flutter", "appeared": 2017, "type": "framework", "country": [ "United States" ], "originCommunity": [ "Google" ], "wikipedia": { "summary": "Flutter is an open-source mobile application development framework created by Google. It is used to develop applications for Android and iOS, as well as being the primary method of creating applications for Google Fuchsia.", "backlinksCount": 488, "pageId": 54699721, "dailyPageViews": 534, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Flutter_(software)" }, "leachim6": { "filepath": "f/Flutter.dart", "fileExtensions": [ "dart" ], "example": [ "import 'package:flutter/widgets.dart';\n\nvoid main() {\n runApp(\n Text(\n 'Hello World',\n textDirection: TextDirection.ltr,\n ),\n );\n}\n" ], "id": "Flutter" } }, "flux-lang": { "title": "flux-lang", "appeared": 2006, "type": "pl", "description": "A Language for Programming High-Performance Servers", "website": "https://www.usenix.org/legacy/event/usenix06/tech/full_papers/burns/burns_html/flux-usenix-06.html", "reference": [ "http://static.usenix.org/legacy/events/usenix06/tech/full_papers/burns/burns.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of Massachusetts Amherst" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "flux": { "title": "FLUX", "appeared": 2014, "type": "pl", "creators": [ "Paul O’Shannessy" ], "description": "Application Architecture for Building User Interfaces", "website": "https://facebook.github.io/flux/", "documentation": [ "https://fluxcd.io/flux/", "https://docs.influxdata.com/flux/v0.x/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/fluxcd" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// concrete node signatures\nListen ()\n => (int socket);\n\nReadRequest (int socket)\n => (int socket, bool close, image_tag *request);\n\nCheckCache (int socket, bool close, image_tag *request)\n => (int socket, bool close, image_tag *request);\n\n// omitted for space:\n// ReadInFromDisk, StoreInCache\nCompress (int socket, bool close, image_tag *request, __u8 *rgb_data)\n => (int socket, bool close, image_tag *request);\nWrite (int socket, bool close, image_tag *request)\n => (int socket, bool close, image_tag *request);\nComplete (int socket, bool close, image_tag *request) => ();\n\n// source node\nsource Listen => Image;\n\n// abstract node\nImage = ReadRequest -> CheckCache -> Handler -> Write -> Complete;\n\n// predicate type & dispatch\ntypedef hit TestInCache;\nHandler:[_, _, hit] = ;\nHandler:[_, _, _] =\nReadInFromDisk -> Compress -> StoreInCache;\n\n// error handler\nhandle error ReadInFromDisk => FourOhFor;\n\n// atomicity constraints\natomic CheckCache:{cache};\natomic StoreInCache:{cache};\natomic Complete:{cache};\n\n" ], "githubRepo": { "firstCommit": 2014, "stars": 17320, "forks": 3604, "subscribers": 651, "created": 2014, "updated": 2022, "description": "Application Architecture for Building User Interfaces", "issues": 6, "url": "https://github.com/facebook/flux" }, "repoStats": { "firstCommit": 2014, "commits": 553, "committers": 148, "files": 174 }, "githubLanguage": { "fileExtensions": [ "fx", "flux" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 187, "id": "FLUX" }, "githubBigQuery": { "repos": 853, "users": 792, "id": "FLUX" }, "fileType": "text", "wordRank": 8630, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2002|Auerbach Publications|Dynamic Software Development: Managing Projects in Flux|Wells, Timothy|9780849312922\n24-05-2016|Packt Publishing|Flux Architecture|Adam Boduch|9781786462442\n19910330|World Scientific Publishing|Quantum Flux Parametron|Goto Eiichi|9789814335850\n2005|Springer|Flux Corrected Transport : Principles, Algorithms, and Applications|Dimitri Kuzmin and Rainald Lohner and Stefan Turek|9783540237303\n2018-08-15|LAP LAMBERT Academic Publishing|Compromise programming approach to welding flux optimization|Ayobami Allu and Ademola Adeyeye|9786139902316\n2015-03-16|LAP LAMBERT Academic Publishing|Structural Optimization and Thermal modeling of Flux Switching Machine|Noman Nisar|9783659456046\n19860801|World Scientific Publishing|Dc Flux Parametron: A New Approach To Josephson Junction Logic|Goto Eiichi|9789814415484", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|The Flux OS Toolkit: reusable components for OS implementation|10.1109/HOTOS.1997.595175|33|1|B. Ford and Kevin Van Maren and J. Lepreau and Stephen Clawson and Bart Robinson and J. Turner|c095e97446a2d5fc80987fd1fa3f47473e7ef609\n2001|Addressing the Qualification Problem in FLUX|10.1007/3-540-45422-5_21|11|0|Yves Martin and M. Thielscher|af74892a58f20de60ad97b84660c46ca1f5ab3f1\n2008|A Systems Biology Tool for Flux Analysis of Metabolic Pathways|10.1038/NPRE.2008.1868.1|11|3|Karthik Raman and N. Chandra|67612c8394c692cc730023a2164e06a58794aa45\n2009|Performance analysis of a neural flux observer for a bearingless induction machine with divided windings|10.1109/COBEP.2009.5347749|7|0|V. F. Victor and J. de Paiva and A. Salazar and A. Maitelli|f30af40fff21025cb31d011acde2c269e1f807b3\n2013|Optimization of Flux Cored Arc Welding Process Parameter Using Genetic and Memetic Algorithms|10.1515/jmsp-2012-0040|7|0|T. Kannan and N. Murugan and B. N. Sreeharan|c6c8f562c37a83778f8affbd7cee43c4d922af6b\n2003|Controlling Semi-automatic Systems with FLUX|10.1007/978-3-540-24599-5_49|4|0|M. Thielscher|1af49ef9f5f1c3547b5226b70410e8fb25a356b0\n2009|The Online Determination of Bubble Surface Area Flux Using the CiDRA GH-100 Sonar Gas Holdup Meter|10.3182/20091014-3-CL-4011.00029|4|1|P. Amelunxen and P. Rothman|2ba01d39c6bce9645490e572503ded5e691c3502\n2011|An Online Provenance Service for Distributed Metabolic Flux Analysis Workflows|10.1109/ECOWS.2011.20|4|0|T. Dalman and M. Weitzel and W. Wiechert and Bernd Freisleben and K. Nöh|e29ddd92236a12db847aabe078e81eaf17cb0ed1\n1996|Flux density models for the switched reluctance machine|10.1109/IAS.1996.560169|2|0|M. Hassanin and M. Alrifai and D. Torrey and F. Ahmed and M.H. Shaker El-Markabi|c0d970df70fb1358f6bae8d427e469f7f6fd3f36\n2013|Development of a computer code for neutronic calculations of a hexagonal lattice of nuclear reactor using the flux expansion nodal method|10.2298/NTRP1303237M|2|0|M. Mohammadnia and A. Pazirandeh and M. Sedighi|98213afe42876fdf95449b769732907bdfd3b539\n2010|Handling negative disjunction constraints (or_not_holds) in FLUX|10.1109/ICCAE.2010.5451264|1|0|Yisong Liu and Zhihua Yin and Huijuan Zhu and Lili Wang|f2f79cf3e0fad6eb8fe7d154b19985cdef4271ae" }, "fm-standard": { "title": "FM broadcasting", "appeared": 1950, "type": "standard", "wikipedia": { "summary": "FM broadcasting is a method of radio broadcasting using frequency modulation (FM) technology. Invented in 1933 by American engineer Edwin Armstrong, wide-band FM is used worldwide to provide high-fidelity sound over broadcast radio. FM broadcasting is capable of better sound quality than AM broadcasting (under normal listening conditions), the chief competing radio broadcasting technology, so it is used for most music broadcasts. Theoretically wideband AM can offer equally good sound quality, provided the reception conditions are ideal. FM radio stations use the VHF frequencies. The term \"FM band\" describes the frequency band in a given country which is dedicated to FM broadcasting.", "backlinksCount": 19683, "pageId": 1607203, "dailyPageViews": 906, "appeared": 1950, "url": "https://en.wikipedia.org/wiki/FM_broadcasting" } }, "fmj": { "title": "fmj", "appeared": 2003, "type": "pl", "description": "Full Metal Jacket is very different from other programming languages. It's intrinsically parallel, with no flow of control, and has no variables. Programs are composed almost entirely with the mouse rather than keyboard, and type inference and other checks take place while you edit your program. There are a few other visual dataflow languages out there, but Full Metal Jacket is simpler than them, and has a cleaner design. Full Metal Jacket is general-purpose, though it might in due course find a niche. Some adjustment will be needed by programmers who are most comfortable with imperative programming languages, such as Java or C. To master dataflow, they will have to change they way they think. They should regard this as a worthwhile challenge which will make them better programmers. Functional programmers might have a slightly easier time.", "website": "http://www.fmjlang.co.uk/fmj/FMJ.html", "reference": [ "http://www.fmjlang.co.uk/fmj/fmj2.pdf" ], "country": [ "United States" ], "originCommunity": [ "http://www.fmjlang.co.uk" ], "centralPackageRepositoryCount": 0 }, "fml-lang": { "title": "FML", "appeared": 2012, "type": "pl", "creators": [ "Joe Groff" ], "description": "fml is an optimizing, function-oriented, array programming language. Unlike other array programming languages, it aims to have a less symbol-heavy but still concise syntax, and non-strict semantics that allow for high-level optimization. Note that fml is not: meant for serious use always faster than systems languages like C/C++/etc. always more expressive than general-purpose languages like Python, Javascript, etc. suitable for cryptography, real-time, or low-level applications that require fine control of time and space complexity", "reference": [ "https://gist.github.com/jckarter/2839239" ], "standsFor": "Function Manipulation Language", "country": [ "United States" ], "originCommunity": [ "https://duriansoftware.com" ], "hasComments": { "example": "# This is a line comment\n\n###\nThis is a block comment\n###", "value": true }, "hasDirectives": { "example": "# Directives are special lines that have syntax and semantics of their own. Directives all start with a name of the form .foo; new directives may be added by future versions of the language.\n.import math.constants\narea = x * math.constants.Pi, ^ 2\n.from math.constants import Pi, E\narea = x sq, * Pi\npolar = a * [E ^ [b * 0+j1]]", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasMultiLineComments": { "example": "###\nA comment\n###", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "###" ] ], "example": [ "pad = x flip[stitch] 0, stitch 0, flip[cat] 0, cat 0\nlife = pad, neighborhoods[3 3], [ravel, [sum in?: [x @ 4, + 3; 3]]]/2\n\n[0 1 0 1\n 0 1 1 0\n 0 0 1 0\n 0 0 0 0] replicate[life]-times[5]\n###\n[0 1 0 1\n 0 1 1 0\n 0 0 1 0\n 0 0 0 0\n\n 0 1 0 0\n 0 1 0 1\n 0 1 1 0\n 0 0 0 0\n\n 0 0 1 0\n 1 1 0 0\n 0 1 1 0\n 0 0 0 0\n\n 0 1 0 0\n 1 0 0 0\n 1 1 1 0\n 0 0 0 0\n\n 0 0 0 0\n 1 0 1 0\n 1 1 0 0\n 0 1 0 0]\n###" ] }, "fml": { "title": "Fuzzy Markup Language", "appeared": 2004, "type": "xmlFormat", "standsFor": "Fuzzy Markup Language", "country": [ "Italy" ], "originCommunity": [ "University of Salerno" ], "wikipedia": { "example": [ "\n\t\n ........\n\t\n\t\t\n\t\t \n\t\t\t \n\t\t\t \n\t\t\t \t\n\t\t\n\t\n\t\n\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n \n\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\n\t\t\n\t\n\t\n\t\t\n \t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\t\n\t\t\n\t\n\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\n\t\t\n\t\n\t..........\n" ], "related": [ "xml" ], "summary": "Fuzzy Markup Language (FML) is a specific purpose markup language based on XML, used for describing the structure and behavior of a fuzzy system independently of the hardware architecture devoted to host and run it.", "pageId": 35890194, "dailyPageViews": 13, "created": 2012, "backlinksCount": 18, "revisionCount": 63, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Fuzzy_markup_language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "fo": { "title": "fo", "appeared": 2018, "type": "pl", "creators": [ "Alex Browne" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/albrow/fo/issues" ], "githubRepo": { "firstCommit": 2018, "stars": 1180, "forks": 29, "subscribers": 27, "created": 2018, "updated": 2022, "description": "An experimental language which adds functional programming features to Go.", "issues": 15, "url": "https://github.com/albrow/fo" }, "repoStats": { "firstCommit": 2018, "commits": 112, "committers": 4, "files": 237 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17294548|Show HN: Fo: An experimental language which adds generics on top of Go|2018-06-12 15:58:46 UTC|1528819126|polymathist|124|165" }, "foaf": { "title": "FOAF", "appeared": 2007, "type": "xmlFormat", "reference": [ "http://xmlns.com/foaf/spec/" ], "country": [ "Various" ], "originCommunity": [ "http://rdfweb.org/mailman/listinfo/rdfweb-dev" ], "example": [ "@prefix rdf: .\n@prefix rdfs: .\n@prefix foaf: .\n\n<#JW>\n a foaf:Person ;\n foaf:name \"James Wales\" ;\n foaf:mbox ;\n foaf:homepage ;\n foaf:nick \"Jimbo\" ;\n foaf:depiction ;\n foaf:interest ;\n foaf:knows [\n a foaf:Person ;\n foaf:name \"Angela Beesley\"\n ] .\n\n\n rdfs:label \"Wikimedia\" ." ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/FOAF" } }, "focal": { "title": "Formulating On-Line Calculations in Algebraic Language", "appeared": 1968, "type": "pl", "creators": [ "Richard Merrill" ], "standsFor": "Formulating On-Line Calculations in Algebraic Language", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "FOCAL15 V6B\n*01.10 ASK \"IN WHAT YEAR WERE YOU BORN?\", YEAR\n*01.20 SET YEAROFFOCAL=YEAR-1969+1\n*01.30 IF (YEAROFFOCAL) 02.10,02.10,01.40\n*01.40 TYPE \"YOU WERE BORN IN THE YEAR \",YEAROFFOCAL,\" OF FOCAL!\",!\n*01.50 GOTO 01.10\n*02.10 TYPE \"YOU ARE TOO OLD FOR FOCAL, POPS\",!\n*02.20 GOTO 01.10\n*GO\nIN WHAT YEAR WERE YOU BORN?:1969\nYOU WERE BORN IN THE YEAR 1.0000 OF FOCAL\nIN WHAT YEAR WERE YOU BORN?:1950\nYOU ARE TOO OLD FOR FOCAL, POPS\nIN WHAT YEAR WERE YOU BORN?:" ], "related": [ "joss", "basic", "mumps" ], "summary": "FOCAL is an interpreted programming language resembling JOSS. The name is an acronym for Formulating On-Line Calculations in Algebraic Language. Largely the creation of Richard Merrill, FOCAL was initially written for and had its largest impact on the Digital Equipment Corporation's (DEC's) PDP-8 computers. Merrill wrote the original (1968) and classic FOCAL-69 interpreters for the PDP-8. Digital itself described FOCAL as \"a JOSS-like language.\" Like early versions of BASIC, FOCAL was a complete programming environment in itself, requiring no operating system. As in MUMPS, most commands could be, and in practice were, abbreviated to a single letter of the alphabet. Creative choices of words were used to make each command uniquely defined by its leading character. Digital made available several European-language versions in which the command words were translated into the target language.", "pageId": 1170592, "created": 2004, "backlinksCount": 51, "revisionCount": 96, "dailyPageViews": 18, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/FOCAL_(programming_language)" }, "leachim6": { "filepath": "f/Focal.fc", "fileExtensions": [ "fc" ], "example": [ "0.1.0.1 TYPE \"HELLO WORLD\" , !\n" ], "id": "Focal" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:FOCAL", "tryItOnline": "focal", "hopl": "https://hopl.info/showlanguage.prx?exp=406", "fileType": "text", "wordRank": 9081, "centralPackageRepositoryCount": 0, "isbndb": "" }, "focus": { "title": "FOCUS", "appeared": 1997, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Information Builders Inc" ], "wikipedia": { "related": [ "mathematica", "sql", "ibm-rpg" ], "summary": "FOCUS is a fourth-generation programming language (4GL) computer programming language and development environment that is used to build database queries. Produced by Information Builders Inc., it was originally developed for data handling and analysis on the IBM mainframe. Subsequently versions for minicomputers and such as the VAX and other platforms were implemented. FOCUS was later extended to personal computers and (in 1997) to the World Wide Web: the WebFOCUS product.", "pageId": 867853, "created": 2004, "backlinksCount": 40, "revisionCount": 83, "dailyPageViews": 49, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/FOCUS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2041", "fileType": "text", "wordRank": 1230, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1992|Wiley|Micro Focus Workbench: Developing Mainframe COBOL Applications on the PC|Jatich, Alida and Nowak, Phil|9780471556114\n2002|Course Technology PTR|Focus On Mod Programming in Quake III Arena (The Premier Press Game Development Series)|Holmes, Shawn|9781931841566\n2014|Richard Stegman|Focus on Object-Oriented Programming With C++|Richard Stegman|9781499513813\n2012|PUP Department of Computer Science|Start Concurrent: An Introduction to Problem Solving in Java with a Focus on Concurrency, 2013 Edition|Wittman, Barry and Mathur, Aditya and Korb, Tim|9781557536723" }, "foil": { "title": "File Oriented Interpretive Language", "appeared": 1967, "type": "pl", "standsFor": "File Oriented Interpretive Language", "country": [ "United States" ], "originCommunity": [ "University of Michigan" ], "wikipedia": { "example": [ ":START COUNT=0\n TY Enter the number of times you want to repeat the statement:\n ACCEPT\n MAX=NUMBER.(1)\n :LOOP\n TY This loop has run #COUNT times it will terminate when it runs #MAX times\n IF COUNT>= λx = `x + 3`" ], "githubRepo": { "stars": 76, "forks": 15, "subscribers": 9, "created": 2011, "updated": 2013, "description": "A programming language", "url": "https://github.com/texodus/forml/" }, "repoStats": { "firstCommit": 2011, "commits": 327, "committers": 14, "files": 57 } }, "forms-3": { "title": "FORMS/3", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a074a04c61f097ee9ad13f9061aee95d1dd0c01f" ], "country": [ "United States" ], "originCommunity": [ "Oregon State University", "Hewlett-Packard", "Oregon Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2046", "centralPackageRepositoryCount": 0 }, "formula": { "title": "Formula language", "appeared": 1989, "type": "pl", "description": "Formula language is a simple, easy-to-use programming language that can be found in many Lotus products -- such as Lotus 1-2-3 and Lotus Notes. Formula language has been integrated into Lotus Notes since its inception in 1989 and has included numerous enhancements over the years.", "website": "https://www.ibm.com/support/knowledgecenter/en/SSVRGU_9.0.1/basic/H_NOTES_FORMULA_LANGUAGE.html", "reference": [ "https://searchdomino.techtarget.com/tutorial/What-is-Lotus-Formula-language" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "example": [ "FIELD NewDate:=@Today\nFIELD OldDate:=@DeleteField;" ], "wikipedia": { "related": [ "icon", "lisp", "lotusscript" ], "summary": "The Formula language is a scripting language used by Lotus Notes. It is often referred to as @Formula language (pronounced at-formula) because many language elements start with the @-character. Here is an example of a selection formula: SELECT @NoteId = \"NT0050D26\" It was created by Ray Ozzie during the early development of Lotus Notes. He borrowed the compiler and decompiler from the Lotus 1-2-3 spreadsheet, but unlike the spreadsheet language Formula Language was designed primarily for string and list processing, not numerical processing. It was originally a Functional programming language with unique text list-handling features inspired by Ray Ozzie's prior use of Icon and Lisp. The Formula language engine was rewritten by Damien Katz for Notes and Domino 6. New features were added to the language, such as looping and dynamic execution, and performance was improved.The Formula language has two parts: @Functions for calculations and simple logic @Commands for performing actions in the user interface@Functions can be used in several places throughout Lotus Notes. The most important uses are: to select documents to show to the user in a view (a kind of index) or to select documents for further processing. In this case, the formula will evaluate to a 'true' (selected) or 'false' value (not selected) for each document. to provide default values for fields, to transform the data entered by the user (like stripping off redundant spaces) and to validate this data. to get a list of values from a Notes database or even from a relational database (using ODBC). This may be used to provide a user with a list of values to choose from. to process a set of documents. The formula is placed in an agent, a program or macro that can be started by a user or by the Notes server according to a schedule. When the agent is triggered, the formula executes for each selected document (this a very limited form of a loop). This is an efficient way of changing lots of documents, if the logic is not too complicated. In case of complicated changes, LotusScript is used.@Commands are like menu commands: they perform actions in the Lotus Notes client. Examples of actions are: opening a Notes database creating an e-mail putting the cursor in a specific data-entry field closing a window starting an agent@Commands are primarily used in formulas that are triggered by user action, such as in button formulas. It is possible to combine them with @Functions, for example by making execution of an @command conditional on a field value.", "pageId": 343386, "created": 2003, "backlinksCount": 10, "revisionCount": 22, "dailyPageViews": 10, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Formula_language" }, "fileType": "text", "wordRank": 3630, "centralPackageRepositoryCount": 0 }, "forte-4gl": { "title": "Forte 4GL", "appeared": 1994, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Forté Inc" ], "wikipedia": { "example": [ "begin\n ...\n raise UsageException();\n ...\nexception\n when e : UsageException do\n task.ErrMgr.Clear();\n ...\n else\n ...\n raise;\nend;" ], "related": [ "java" ], "summary": "Forté 4GL was a proprietary application server that was developed by Forté Software and used for developing scalable, highly available, enterprise applications.", "created": 2006, "backlinksCount": 11, "pageId": 3995907, "revisionCount": 70, "dailyPageViews": 11, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Forte_4GL" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "forth": { "title": "Forth", "appeared": 1970, "type": "pl", "creators": [ "Charles H. Moore" ], "documentation": [ "https://www.forth.com/starting-forth/" ], "country": [ "United States" ], "originCommunity": [ "National Radio Astronomy Observatory" ], "hasComments": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasPostfixNotation": { "example": "\\ Multiplies 25 and 10 and then adds 50 to result\n25 10 * 50 +", "value": true }, "isCaseSensitive": { "example": "", "value": false }, "hasLineComments": { "example": "\\ A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasHexadecimals": { "example": "\\ (\\$[0-9A-F]+)", "value": true }, "hasIntegers": { "example": "\\ (\\#|%|&|\\-|\\+)?[0-9]+", "value": true }, "lineCommentToken": [ [ "\\" ] ], "printToken": [ [ "." ] ], "wikipedia": { "example": [ "hex\ncreate AKey 61 c, 8A c, 63 c, D2 c, FB c,\n: test cr 0 DO rc4_byte . LOOP cr ;\nAKey 5 rc4_init\n2C F9 4C EE DC 5 test \\ output should be: F1 38 29 C9 DE" ], "related": [ "lisp", "apl", "factor", "postscript", "rpl", "rebol", "reverse-polish-notation", "freebsd", "c", "linux", "unix", "atmel-avr", "msp430", "ascii", "joy" ], "summary": "Forth is an imperative stack-based computer programming language and environment originally designed by Charles \"Chuck\" Moore. Language features include structured programming, reflection (the ability to modify the program structure during program execution), concatenative programming (functions are composed with juxtaposition) and extensibility (the programmer can create new commands). Although not an acronym, the language's name is sometimes spelled with all capital letters as FORTH, following the customary usage during its earlier years. A procedural programming language without type checking, Forth features both interactive execution of commands (making it suitable as a shell for systems that lack a more formal operating system) and the ability to compile sequences of commands for later execution. Some Forth implementations (usually early versions or those written to be extremely portable) compile threaded code, but many implementations today generate optimized machine code like other language compilers. Forth is used in the Open Firmware boot loader, in space applications, such as the Philae spacecraft and other embedded systems which involve interaction with hardware. The bestselling 1986 DOS game Starflight, from Electronic Arts, was written with a custom Forth. The free software Gforth implementation is actively maintained, as are several commercially supported systems.", "pageId": 11012, "dailyPageViews": 392, "created": 2001, "backlinksCount": 454, "revisionCount": 1239, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Forth_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "fth", "4th", "f", "for", "forth", "fr", "frt", "fs" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "forth", "codemirrorMode": "forth", "codemirrorMimeType": "text/x-forth", "tmScope": "source.forth", "repos": 1537, "id": "Forth" }, "githubBigQuery": { "repos": 1910, "users": 1694, "id": "Forth" }, "codeMirror": "forth", "pygmentsHighlighter": { "filename": "forth.py", "fileExtensions": [ "frt", "fs" ], "id": "Forth" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2016, "committerCount": 1, "commitCount": 3, "sampleCount": 16, "example": [ ": HELLO ( -- )\n .\" Hello Forth (fth)!\" ; \n\nHELLO\n\n" ], "url": "https://github.com/textmate/forth.tmbundle" }, "projectEuler": { "memberCount": { "2019": 56, "2022": 63 }, "id": "Forth" }, "helloWorldCollection": [ "' Hello world in Forth\n\n.\" Hello World\" CR" ], "leachim6": { "filepath": "f/Forth.fth", "fileExtensions": [ "fth" ], "example": [ ".( Hello World)\n" ], "id": "Forth" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Forth", "quineRelay": "Forth", "rijuRepl": { "example": [ ".\" Hello, world!\" CR\n" ], "id": "https://riju.codes/forth" }, "replit": "https://repl.it/languages/forth", "indeedJobs": { "2022": 0, "query": "forth developer" }, "tiobe": { "id": "Forth" }, "hopl": "https://hopl.info/showlanguage.prx?exp=182", "packageRepository": [ "https://theforth.net/" ], "ubuntuPackage": "gforth", "jupyterKernel": [ "https://github.com/jdfreder/iforth", "https://github.com/hcchengithub/peforth" ], "fileType": "text", "wordRank": 3664, "isbndb": "year|publisher|title|authors|isbn13\n2007|BookSurge Publishing|Forth Programmer's Handbook (3rd Edition)|Elizabeth D. Rather and Edward K. Conklin|9781419675492\n1984|Melbourne House|Advanced Spectrum Forth|Don Thomasson|9780861611423\n2019|Independently published|Forth Application Techniques (6th Edition): Programming Course|Rather, Elizabeth D. and Ouverson, Marlin|9781095075791\n1982|H.W. Sams|FORTH programming (The Blacksburg continuing education series)|Scanlon, Leo J|9780672220074\n1982|Osborne/McGraw-Hill|Discover FORTH: Learning and programming the FORTH language|Hogan, Thom|9780931988790\n1990|Academic Press|Embedded Controller Forth For The 8051 Family|Payne, William H.|9780125475709\n1987|Addison Wesley Publishing Company|Pocket Guide to Forth (Addison-Wesley Programming Pocket Guides)|Baker, Linda and Derick, Mitch|9780201101034", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|The evolution of Forth|10.1145/154766.155369|38|1|E. D. Rather and Donald R. Colburn and C. H. Moore|1b2340b9390b6dc5cdc8c096911bc03475979076\n1994|Linear logic and permutation stacks—the Forth shall be first|10.1145/181993.181999|15|0|H. Baker|83973246777647cd403e99c00be26fa7ca4d5f97\n1998|A FPGA based Forth microprocessor|10.1109/FPGA.1998.707903|12|0|P. Leong and P. Tsang and T. K. Lee|a9270804707a5b1040f3a64c77dc147d0faab425\n1987|An architecture for the direct execution of the Forth programming language|10.1145/36206.36182|12|0|J. Hayes and M. Fraeman and Robert L. Williams and T. Zaremba|24e3c75a5c95a5f26f255bbd087f0adfdce27125\n1997|Forth as a robotics language: part two|10.1145/261353.261355|8|0|P. Frenger|0c8aae2657ee12881da92ca30aa483c06016587b\n2001|Close encounters of the forth kind|10.1145/375431.375415|7|0|P. Frenger|60f7e62ade006525f97a545450dee1207b6cc9b6\n2004|Forth and AI revisited: BRAIN.FORTH|10.1145/1052883.1052885|7|0|P. Frenger|8e119f4b290c4692ff71185d83cf07656b6cacd9\n2003|The JOY of forth|10.1145/944579.944583|6|0|P. Frenger|e8b16a28d9a205e7fbc00de0a05499b603ecdf3f\n1985|FORTH -A good programming environment for laboratory automation? I. Introduction to the language|10.1016/0165-9936(85)87085-0|6|0|D. Zollinger and M. Bos|e24f4142970cdefc9a2dcb83ed5d661d1e8868a1\n1996|A whirlwind tour of FORTH resources|10.1145/242604.242615|4|0|P. Frenger|2b4b2b336202fc3b072343b124a16e205e5bed04\n2004|Embed with Forth|10.1145/1026474.1026476|4|0|P. Frenger|6c0552cd3f75492fcb5deeef40ee5a9698055dbd\n2003|Evaluating Forth in the Windows environment|10.1145/844091.844095|2|0|P. Frenger|a3b049835038a430eb62d6fa757ef7bd216caefc\n2004|A Formal Model of Forth Control Words in the Pi-Calculus|10.3217/jucs-010-09-1272|2|0|J.F. Power and D. Sinclair|88852427183db1802a8a444f2777bc74b5cc7cd0\n2005|Forth sorts fruit down under|10.1145/1089851.1089853|2|0|P. Frenger|d59a56e2664d9b1ce25d4b3e98a263395ce65805\n2016|Real-time multi-task simulation in Forth|10.1109/FRUCT-ISPIT.2016.7561503|2|0|S. Baranov|2b7027db923cc7f75683733021204e0e5361a2c7\n1987|The FORTH Programming Language for Control Systems: Potential Advantages|10.1177/002029408702000402|1|0|C. McCurdy|ff662aa6d90c57a82096bec9062d649895ec9965" }, "forthnet-pm": { "title": "forthnet-pm", "appeared": 2010, "type": "packageManager", "website": "https://theforth.net/", "country": [ "Germany" ], "originCommunity": [ "Wodni & Pelc GmbH" ], "domainName": { "registered": 2010, "name": "theforth.net" }, "packageCount": 35, "forLanguages": [ "forth" ] }, "forthscript": { "title": "ForthScript", "appeared": 2020, "type": "pl", "creators": [ "Yuriy Zamyatin" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/ForthScriptLang" ], "githubRepo": { "firstCommit": 2020, "stars": 16, "forks": 0, "subscribers": 2, "created": 2020, "updated": 2022, "description": "Forthscript programming language interpreter", "issues": 0, "url": "https://github.com/ForthScriptLang/forthscript" }, "repoStats": { "firstCommit": 2020, "commits": 243, "committers": 7, "files": 102 } }, "fortran-77": { "title": "FORTRAN 77", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1b67ac6722bc65c2cae0dc2c255386f395d28437" ], "country": [ "United States" ], "originCommunity": [ "Amoco Research Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=807", "centralPackageRepositoryCount": 0 }, "fortran-8x": { "title": "Fortran 8x", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d4ed28510d8a11c56dbc1626072f3674436b2ca8" ], "country": [ "United States" ], "originCommunity": [ "McDonnell Douglas Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2758", "centralPackageRepositoryCount": 0 }, "fortran-90": { "title": "Fortran 90", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d896513025079fa1e7a8d6aa44843c39bbf2b6ff" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Liverpool" ], "supersetOf": [ "fortran-77" ], "hasPointers": { "example": "type real_list_t\n real :: sample_data(100)\n type (real_list_t), pointer :: next => null ()\nend type\n\ntype (real_list_t), target :: my_real_list\ntype (real_list_t), pointer :: real_list_temp\n\nreal_list_temp => my_real_list\ndo\n read (1,iostat=ioerr) real_list_temp%sample_data\n if (ioerr /= 0) exit\n allocate (real_list_temp%next)\n real_list_temp => real_list_temp%next\nend do", "value": true }, "hopl": "https://hopl.info/showlanguage.prx?exp=1627", "centralPackageRepositoryCount": 0 }, "fortran-cep": { "title": "FORTRAN CEP", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/55f2e8b3f7f7cc45e9515329b3fb61e6c4f74db3" ], "country": [ "Italy" ], "originCommunity": [ "Università di Pisa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8214", "centralPackageRepositoryCount": 0 }, "fortran-d": { "title": "Fortran D", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/31b56b490ea4f2ecb8948f143ed31666a68488b1" ], "country": [ "United States" ], "originCommunity": [ "Center for Research on Parallel Computation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1628", "centralPackageRepositoryCount": 0 }, "fortran-ii": { "title": "FORTRAN II", "appeared": 1958, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e4618d3c2734f71ed34f1f97a440060e95f74d77" ], "country": [ "United States" ], "originCommunity": [ "University of California, Riverside" ], "hopl": "https://hopl.info/showlanguage.prx?exp=28", "centralPackageRepositoryCount": 0 }, "fortran-iii": { "title": "FORTRAN III", "appeared": 1958, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Fortran#FORTRAN_III" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2051" }, "fortran-iv": { "title": "FORTRAN IV", "appeared": 1962, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Fortran#FORTRAN_IV" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=160" }, "fortran-m": { "title": "Fortran M", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a6156d35c6e4249c6ab847d5642a0a7631ab2c59" ], "country": [ "United States" ], "originCommunity": [ "Argonne National Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1686", "centralPackageRepositoryCount": 0 }, "fortran": { "title": "Fortran", "appeared": 1957, "type": "pl", "creators": [ "John Backus" ], "documentation": [ "https://people.ucsc.edu/~dlee79/2019/fall/am129_209/chapters/chapt02/ch02_fortran_basic.html" ], "emailList": [ "https://gcc.gnu.org/mailman/listinfo/fortran" ], "spec": "https://www.iso.org/obp/ui/#iso:std:iso-iec:1539:-1:ed-4:v1:en", "reference": [ "https://en.wikipedia.org/wiki/Fortran_95_language_features" ], "fileExtensions": [ "f", "for", "f90", "f95", "f03", "f08", "f15" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "visualParadigm": false, "hasReservedWords": { "example": "C Keywords are specifically NOT reserved words. http://fortranwiki.org/fortran/show/Keywords. http://rsusu1.rnd.runnet.ru/develop/fortran/prof77/node46.html", "value": false }, "hasComments": { "example": "C\nC Lines that begin with 'C' (in the first or 'comment' column) are comments\nC", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "x = 2.0\ny = x + X", "value": true }, "hasPrintDebugging": { "example": "C Hello World in Fortran\n\n PROGRAM HELLO\n WRITE (*,100)\n STOP\n 100 FORMAT (' Hello World! ' /)\n END", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": false }, "hasModules": { "example": "module constants \nimplicit none \n\n real, parameter :: pi = 3.1415926536 \n real, parameter :: e = 2.7182818285 \n \ncontains \n subroutine show_consts() \n print*, \"Pi = \", pi \n print*, \"e = \", e \n end subroutine show_consts \n \nend module constants \n\n\nprogram module_example \nuse constants \nimplicit none \n\n real :: x, ePowerx, area, radius \n x = 2.0\n radius = 7.0\n ePowerx = e ** x\n area = pi * radius**2 \n \n call show_consts() \n \n print*, \"e raised to the power of 2.0 = \", ePowerx\n print*, \"Area of a circle with radius 7.0 = \", area \n \nend program module_exampl", "value": true }, "hasLineComments": { "example": "C A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "isCaseSensitive": { "example": "", "value": false }, "hasFixedPoint": { "example": "", "value": false }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "C" ], [ "!" ] ], "printToken": [ [ "print" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "'" ] ], "keywords": [ "ACCESS", "ACTION", "ADVANCE", "ALLOCATABLE", "ALLOCATE", "ASSIGN", "ASSIGNMENT", "BACKSPACE", "BLANK", "BLOCK", "CALL", "CASE", "CHARACTER", "CLOSE", "COMMON", "COMPLEX", "CONTAINS", "CONTINUE", "CYCLE", "DATA", "DEALLOCATE", "DEFAULT", "DELIM", "DIMENSION", "DIRECT", "DO", "DOUBLE", "ELSE", "ELSEWHERE", "END", "ENDFILE", "ENTRY", "EOR", "EQUIVALENCE", "ERR", "EXIST", "EXIT", "EXTERNAL", "FILE", "FMT", "FORM", "FORMAT", "FORMATTED", "FUNCTION", "GO", "IF", "IMPLICIT", "IN", "INOUT", "INQUIRE", "INTEGER", "INTENT", "INTERFACE", "INTRINSIC", "IOLENGTH", "10STAT", "KIND", "LEN", "LOGICAL", "MODULE", "NAME", "NAMED", "NAMELIST", "NEXTREC", "NML", "NONE", "NULLIFY", "NUMBER", "ONLY", "OPEN", "OPENED", "OPERATOR", "OPTIONAL", "OUT", "PAD", "PARAMETER", "PAUSE", "POINTER", "POSITION", "PRECISION", "PRINT", "PRIVATE", "PROCEDURE", "PROGRAM", "PUBLIC", "READ", "READWRITE", "REAL", "REC", "RECl", "RECURSIVE", "RESULT", "RETURN", "REWIND", "SAVE", "SELECT", "SEQUENCE", "SEQUENTIAL", "SIZE", "STAT", "STATUS", "STOP", "SUBROUTINE", "TARGET", "THEN", "TO", "TYPE", "UNFORMATTED", "UNIT", "USE", "WHERE", "WHILE", "WRITE" ], "wikipedia": { "example": [ "program average\n\n ! Read in some numbers and take the average\n ! As written, if there are no data points, an average of zero is returned\n ! While this may not be desired behavior, it keeps this example simple\n\n implicit none\n\n real, dimension(:), allocatable :: points\n integer :: number_of_points\n real :: average_points=0., positive_average=0., negative_average=0.\n\n write (*,*) \"Input number of points to average:\"\n read (*,*) number_of_points\n\n allocate (points(number_of_points))\n\n write (*,*) \"Enter the points to average:\"\n read (*,*) points\n\n ! Take the average by summing points and dividing by number_of_points\n if (number_of_points > 0) average_points = sum(points) / number_of_points\n\n ! Now form average over positive and negative points only\n if (count(points > 0.) > 0) then\n positive_average = sum(points, points > 0.) / count(points > 0.)\n end if\n\n if (count(points < 0.) > 0) then\n negative_average = sum(points, points < 0.) / count(points < 0.)\n end if\n\n deallocate (points)\n\n ! Print result to terminal\n write (*,'(a,g12.4)') 'Average = ', average_points\n write (*,'(a,g12.4)') 'Average of positive points = ', positive_average\n write (*,'(a,g12.4)') 'Average of negative points = ', negative_average\n\nend program average" ], "related": [ "speedcoding", "algol-58", "basic", "c", "chapel", "cms-2", "pl-i", "pact-i", "mumps", "ratfor", "assembly-language", "laning-and-zierler-system", "1620sps", "ucsd-pascal", "watfiv", "ascii", "modula-2", "ada", "mortran", "ratfiv", "jcl", "simscript", "f" ], "summary": "Fortran (; formerly FORTRAN, derived from Formula Translation) is a general-purpose, imperative programming language that is especially suited to numeric computation and scientific computing. Originally developed by IBM in the 1950s for scientific and engineering applications, Fortran came to dominate this area of programming early on and has been in continuous use for over half a century in computationally intensive areas such as numerical weather prediction, finite element analysis, computational fluid dynamics, computational physics, crystallography and computational chemistry. It is a popular language for high-performance computing and is used for programs that benchmark and rank the world's fastest supercomputers. Fortran encompasses a lineage of versions, each of which evolved to add extensions to the language while usually retaining compatibility with prior versions. Successive versions have added support for structured programming and processing of character-based data (FORTRAN 77), array programming, modular programming and generic programming (Fortran 90), high performance Fortran (Fortran 95), object-oriented programming (Fortran 2003) and concurrent programming (Fortran 2008).", "pageId": 11168, "dailyPageViews": 2052, "created": 2001, "backlinksCount": 1961, "revisionCount": 2816, "appeared": 1957, "fileExtensions": [ "f", "for", "f90", "f95", "f03", "f08", "f15" ], "url": "https://en.wikipedia.org/wiki/Fortran" }, "githubLanguage": { "fileExtensions": [ "f", "f77", "for", "fpp" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nxianyi OpenBLAS https://github.com/xianyi.png https://github.com/xianyi/OpenBLAS Fortran #4d41b1 2879 794 62 \"OpenBLAS is an optimized BLAS library based on GotoBLAS2 1.13 BSD version.\"\nE3SM-Project E3SM https://github.com/E3SM-Project.png https://github.com/E3SM-Project/E3SM Fortran #4d41b1 117 76 2 \"Energy Exascale Earth System Model source code.\"", "trendingProjectsCount": 3, "type": "programming", "group": "Fortran", "aceMode": "text", "codemirrorMode": "fortran", "codemirrorMimeType": "text/x-fortran", "tmScope": "source.fortran", "repos": 29127, "id": "Fortran" }, "githubBigQuery": { "repos": 2820, "users": 2446, "id": "Fortran" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/fortran77", "codeMirror": "fortran", "pygmentsHighlighter": { "filename": "fortran.py", "fileExtensions": [ "f03", "f90", "F03", "F90" ], "id": "Fortran" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 6, "commitCount": 67, "sampleCount": 5, "example": [ "! Codes/HYCOM/hycom/ATLb2.00/src_2.0.01_22_one/\n real onemu, twomu\n data onemu/0.0098/\n data twomu/1./\n data threemu/0.e9/\n end\n" ], "url": "https://github.com/textmate/fortran.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/hansec/fortran-language-server\nwrittenIn python" ], "projectEuler": { "memberCount": { "2019": 444, "2022": 464 }, "id": "Fortran" }, "helloWorldCollection": [ "C Hello World in Fortran\n\n PROGRAM HELLO\n WRITE (*,100)\n STOP\n 100 FORMAT (' Hello World! ' /)\n END\n" ], "leachim6": { "filepath": "f/Fortran.f90", "fileExtensions": [ "f90" ], "example": [ "print *,'Hello World'\nend\n" ], "id": "Fortran" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Fortran", "compilerExplorer": { "example": [ "! Type your code here, or load an example.\nreal function square(x)\n implicit none\n real, intent(in) :: x\n square = x * x\n return\nend function square\n" ], "id": "Fortran" }, "rijuRepl": { "example": [ " PROGRAM hello\n PRINT *, \"Hello, world!\"\n END PROGRAM hello\n" ], "id": "https://riju.codes/fortran" }, "indeedJobs": { "2017": 447, "query": "fortran engineer" }, "linkedInSkill": { "2018": 148352, "id": "fortran" }, "officialBlogUrl": [ "https://fortran-lang.org/en/news/" ], "faqPageUrl": [ "http://www.faqs.org/faqs/fortran-faq/" ], "subreddit": [ { "memberCount": { "2017": 1573, "2022": 6269 }, "url": "https://reddit.com/r/fortran" } ], "tiobe": { "currentRank": 32, "id": "Fortran" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8", "gdbSupport": true, "jupyterKernel": [ "https://github.com/sourceryinstitute/jupyter-CAF-kernel" ], "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nFortran 90/95 For Scientists And Engineers|1997|Stephen J. Chapman|1130565|4.07|41|3\nFortran 95/2003 for Scientists and Engineers|2007|Stephen J. Chapman|1175133|4.13|30|0\nFORTRAN 77 for Engineers and Scientists with an Introduction to FORTRAN 90|1995|Larry R. Nyhoff|5152402|2.38|8|0\nStructured FORTRAN 77 for Engineers and Scientists|1983|Delores M. Etter|3960231|3.89|9|1\nProgramming In Fortran: Structured Programming With Fortran Iv And Fortran 77||Vladimir Zwass|4868017|5.00|1|1\nFORTRAN 77 for engineers and scientists|1985|Larry R. Nyhoff|2864205|4.33|3|1\nSchaum's Outline of Programming with FORTRAN Including Structured FORTRAN|1978|Seymour Lipschutz|1475892|0.0|0|0\nFortran 77 Programming: With An Introduction To Fortran 90 Standard|1990|T.M.R. Ellis|1315546|4.50|2|0", "isbndb": "year|publisher|title|authors|isbn13\n2007|McGraw-Hill Education|Fortran 95/2003 for Scientists & Engineers|Chapman, Stephen|9780073191577\n2015|Springer|Introduction to Programming with Fortran: With Coverage of Fortran 90, 95, 2003, 2008 and 77|Chivers, Ian|9783319177007\n1996|Pearson|FORTRAN 90 for Engineers and Scientists|Nyhoff, Larry and Leestma, Sanford|9780135197295\n2015|Springer|Guide to Fortran 2008 Programming|Brainerd, Walter S.|9781447167587\n2004|Oxford University Press|Fortran 95/2003 Explained (Numerical Mathematics and Scientific Computation)|Metcalf, Michael and Reid, John and Cohen, Malcolm|9780198526933\n1994|McGraw-Hill Education|Schaum's Outline of Programming With Fortran 77 (Schaum's Outlines)|Mayo, Willam and Cwiakala, Martin|9780070411555\n1974|R. D. Irwin|Basic Fortran Iv Programming (irwin-dorsey Information Processing Series)|Donald H Ford|9780256015805\n2010|Cambridge University Press|Object-Oriented Programming via Fortran 90/95|Akin, Ed|9780521524087\n1978|The MIT Press|A FORTRAN Coloring Book|Kaufman, Roger|9780262610261\n1990|Oxford University Press|Fortran 90 Explained (Oxford science publications)|Metcalf, Michael and Reid, John|9780198537724\n1988|McGraw-Hill College|Fortran 77: A Structured, Disciplined Style|Davis, Gordon B.|9780070159051\n1980|Addison-Wesley|Fortran 77: Featuring Structured Programming (3rd Edition)|Meissner, Loren P.|9780201054996\n1995|Gulf Professional Publishing|Fortran Programs for Chemical Process Design, Analysis, and Simulation|Coker PhD, A. Kayode|9780884152804\n1993|O'Reilly Media|Migrating to Fortran 90 (Nutshell Handbooks)|Kerrigan, James|9781565920491\n1981|Wadsworth Pub Co|Applied Fortran 77: Featuring Structured Programming|Roy Ageloff and Richard Mojena|9780534009618\n1997|The MIT Press|Fortran 95 Handbook (Scientific and Engineering Computation)|Adams, Jeanne C. and Brainerd, Walter S. and Martin, Jeanne T. and Smith, Brian T. and Wagener, Jerrold L.|9780262510967\n1961|John Wiley & Sons Inc|Guide to Fortran Programming|McCracken, Daniel D.|9780471582120\n2019|Chapman and Hall/CRC|Fortran 2018 with Parallel Programming|Ray, Subrata|9780367218430\n1974|Wiley|A Simplified Guide To Fortran Programming|Daniel D Mccracken|9780471582922\n1974|Holden-Day|Fortran IV programming and applications (Holden-Day computer and information sciences series)|Sass, C. Joseph|9780816274734\n1988|McGraw-Hill Education - Europe|Programming with Fortran 77|Ram Kumar|9780074518595\n1978|Wiley|Advanced Programming Techniques: A Second Course in Programming Using Fortran|Hughes, Charles E. and Pfleeger, Charles P. and Rose, Lawrence L.|9780471026112\n20090114|Taylor & Francis|Classical Fortran|Michael Kupferschmid|9781420059144\n1968|Heinemann|Fortran programming;: A complete course in writing Fortran programs|Watters, John|9780435778002\n2014|Springer|Introduction to Modern Fortran for the Earth System Sciences (Springerbriefs in Earth System Sciences)|Chirila, Dragos B. and Lohmann, Gerrit|9783642370090\n1982|Boyd & Fraser Pub. Co|Structured Fortran 77 Programming (boyd & Fraser Computer Science Series)|Seymour V Pollack|9780878350957\n1981|Reston, Va. : Reston, 1981.|Structured FORTRAN with WATFIV|John B. Moore and Leo Makela|9780835971041\n1972|The MIT Press|A Primer for FORTRAN IV|Selfridge, Oliver|9780262690355\n1979|Heinemann Educational Books - Secondary Division|Programming in Standard FORTRAN 77|Balfour FIMA FBCS, A. and Marwick MBCS, D.H.|9780435774868\n1998|Wiley|Computing for Scientists: Principles of Programming with Fortran 90 and C++|Barlow, R. J. and Barnett, A. R. and Barnett, AR|9780471951148\n1982|Mcgraw-hill|Computer Programming In Fortran And Other Languages|P. V. Rao|9780070965690\n1978|McGraw-Hill|Schaum's Outline of Programming with FORTRAN Including Structured FORTRAN|Lipschutz, Seymour and Poe, Arthur|9780070379848\n1979|John Wiley & Sons Inc|Introduction To Business Data Processing With Basic, Fortran And Cobol Programming|Donald Keith Caver|9780471030911\n2019|Springer|Numerical Methods of Mathematics Implemented in Fortran (Forum for Interdisciplinary Mathematics)|Sujit Kumar Bose|9789811371141\n|Springer-verlag|Lancelot: A Fortran Package For Large-scale Nonlinear Optimization (release A)|Conn, A. R. (andrew R.)|9783642081392\n1980|Winthrop Publishers|Fundamentals Of Fortran Programming|Robert C Nickerson|9780876263013\n1994|Wiley|Fortran 90 and Engineering Computation|Schick, William and Silverman, Gordon|9780471585121\n1978|Little Brown & Co|Programming For Poets: A Gentle Introduction Using Fortran With Watfiv (his Programming For Poets Series)|Richard Walter Conway and James Archer|9780876267226\n1983|Prentice Hall|Fundamental Computer Programming Using FORTRAN 77|Grout, Jarrell C.|9780133351415\n2013|Machinery Industry Press|Fortran Programming Definitive Guide(chinese Edition)|Bai Hai Bo|9787111421146\n1974|Prentice Hall Ptr|Elementary Computer Programming In Fortran Iv|Boris W. Boguslavsky|9780879092511\n1998|Springer|On Systems Analysis and Simulation of Ecological Processes with Examples in CSMP, FST and FORTRAN||9780792355267\n1994|Oxford University Press|An Introduction To Fortran 90 For Scientific Computing|James M. Ortega|9780195172133\n1981|Hayden Book Co|Fortran With Style: Programming Proverbs (hayden Computer Programming Series)|Henry F Ledgard|9780810456822\n1978|HarperCollins|Fortran 77 Programming|Brainerd, Walter S.|9780060423940\n2000|Mcgraw Hill Text|Fortran Iv Programming|Ledley|9780070369733\n1989|Wiley|Essentials of FORTRAN 77|Shelley, John|9780471923787\n1977|W. C. Brown Co|Business Programming In Fortran Iv|Nesa L'abbe Wu|9780697081230\n1980|Rinehart Press|Elements Of Fortran Iv Programming|Wilson T Price|9780030895029\n1970|Imprint unknown|Standard Fortran programming manual (Computer standards series)||9780850120219\n1988|Oxford [england] ; Blackwell Scientific Publications, 1988.|An Introduction To Programming In Fortran 77|J.S. Morgan and J.L. Schonfelder|9780632017485\n2005|Springer|Developing Statistical Software in Fortran 95 (Statistics and Computing)|Lemmon, David R. and Schafer, Joseph L.|9780387281230\n1975|Intext Educational Publishers|An introduction to FORTRAN IV programming: A general approach|Murrill, Paul W|9780700224692\n1969|Holt, Rinehart And Winston|Elements Of Basic Fortran Iv Programming: As Implemented On The Ibm 1130/1800 Computers|Price, Wilson T.|9780030765605\n1988|Bernard Babani (publishing) Ltd|Programming In Fortran 77 (bernard Babani Publishing Radio And Electronics Books) (bernard Babani Publishing Radio & Electronics Books)|Noel Kantaris|9780859341950\n1998|Springer|On Systems Analysis And Simulation Of Ecological Processes With Examples In Csmp, Fst And Fortran (current Issues In Production Ecology)|P.A. Leffelaar|9780792355250\n2019-08-22T00:00:01Z|Independently published|Abstracting Away the Machine: The History of the FORTRAN Programming Language (FORmula TRANslation)|Lorenzo, Mark Jones|9781082395949\n2018|Springer|Introduction to Programming with Fortran|Chivers, Ian and Sleightholme, Jane|9783319755021\n2004|Prentice-Hall of India Pvt.Ltd|Computer Programming in Fortran 77: An Introduction to Fortran 90|V. Rajaram|9788120311725\n1995-05-01T00:00:01Z|McGraw-Hill|Schaum's Outline of Theory and Problems of Programming With Fortran 90 (Schaum's Outlines)|Mayo, William E. and Cwiakala, Martin|9780070411562\n2013|Morgan Kaufmann|CUDA Fortran for Scientists and Engineers: Best Practices for Efficient CUDA Fortran Programming|Ruetsch, Gregory and Fatica, Massimiliano|9780124169708\n2017|McGraw-Hill Higher Education|Fortran for Scientists & Engineers|Chapman, Stephen|9781260029857\n2019|Pearson|FORTRAN 77 for Engineers and Scientists with an Introduction to FORTRAN 90 (4th Edition)|Nyhoff, Larry and Leestma, Sanford|9780133630039\n1998-09-09T00:00:01Z|Wiley|Computing for Scientists: Principles of Programming with Fortran 90 and C++|Barlow, R. J. and Barnett, A. R. and Barnett, AR|9780471955962\n2011|Oxford University Press|Modern Fortran Explained (Numerical Mathematics and Scientific Computation)|Metcalf, Michael and Reid, John and Cohen, Malcolm|9780199601424\n2012-02-09T00:00:01Z|Springer|Introduction to Programming with Fortran: With Coverage of Fortran 90, 95, 2003, 2008 and 77|chivers, ian and Sleightholme, Jane|9780857292322\n2018-08-31T00:00:01Z|Springer|Introduction to Programming with Fortran|Chivers, Ian and Sleightholme, Jane|9783319755014\n1997|McGraw-Hill Science/Engineering/Math|FORTRAN 90/95 for Scientists and Engineers|Chapman, Stephen J.|9780070119383\n1999|Pearson|Introduction to FORTRAN 90 (ESource Series)|Nyhoff, Larry R. and Leestma, Sanford|9780130131461\n2015|Springer|Introduction to Programming with Fortran: With Coverage of Fortran 90, 95, 2003, 2008 and 77|Chivers, Ian and Sleightholme, Jane|9783319177014\n1990-07-01T00:00:01Z|Addison-Wesley|Fortran 77 Programming: With an Introduction to the Fortran 90 Standard (International Computer Science Series)|Ellis, T. M. R.|9780201416381\n2019|CreateSpace Independent Publishing Platform|Programming with Visual Studio: Fortran & Python & C++|Rapado, Miguel A. and Moreno, Belen and Hernandez, Juan A.|9781727581539\n1994-05-31T00:00:01Z|Addison Wesley|Fortran 90 Programming (International Computer Science Series)|Ellis, T.M.R. and Phillips, Ivor R. and Lahey, Thomas M.|9780201544466\n1990|O'Reilly Media|UNIX for FORTRAN Programmers (Nutshell Handbooks)|Loukides, Mike|9780937175514\n1972|Wiley|A guide to Fortran IV programming|McCracken, Daniel D|9780471582816\n1996|Pearson|Introduction to FORTRAN 90 for Engineers and Scientists|Nyhoff, Larry R. and Leestma, Sanford|9780135052150\n2016|Springer|Guide to Fortran 2008 Programming|Brainerd, Walter S.|9781447168898\n2008|Springer|Introduction to Programming with Fortran: with coverage of Fortran 90, 95, 2003 and 77|Chivers, Ian and Sleightholme, Jane|9781846280535\n1995|Springer|Upgrading to Fortran 90|Redwine, Cooper|9780387979953\n2009|Springer|Guide to Fortran 2003 Programming|Brainerd, Walter S.|9781848825437\n1995|Springer|Programmer's Guide to Fortran 90|Brainerd, Walter S. and Goldberg, Charles H. and Adams, Jeanne C.|9780387945705\n1996|Addison-Wesley|Fortran|Koffman, Elliot B. and Friedman, Frank L.|9780201590623\n2009|Springer|Guide to Fortran 2003 Programming|Brainerd, Walter S.|9781848825420\n1992-12T|Benjamin-Cummings Pub Co|Structured Fortran 77 for Engineers and Scientists|Etter, D.M.|9780805317756\n1983|Cambridge University Press|Illustrating FORTRAN|Alcock, Donald G.|9780521288101\n2018|Oxford University Press|Introduction to Computational Economics Using Fortran|Fehr, Hans and Kindermann, Fabian|9780198804390\n2004-08-15T00:00:01Z|Prentice-Hall of India Pvt.Ltd|Computer Programming in Fortran 90 and 95|V. Rajaram|9788120311817\n1980|Wiley|Principles of Fortran 77 Programming|Wagener, Jerrold L.|9780471044741\n1980|Barnes & Noble|Programming in Fortran: Structured Programming With Fortran IV and Fortran 77 (The Barnes & Noble outline series)|Zwass, Vladimir|9780064601948\n1993|The MIT Press|The High Performance Fortran Handbook (Scientific and Engineering Computation)|Koelbel, Charles H. and Loveman, David and Schreiber, Robert S. and Jr., Guy Lewis Steele and Zosel, Mary|9780262610940\n2017-03-26T00:00:01Z|CreateSpace Independent Publishing Platform|Fortran Crash Course: Step by Step Guide to Mastering Fortran Programming|PG Wizard Books|9781544955353\n1987|Wiley|High-Resolution Computer Graphics using FORTRAN 77|Angell, Ian O. and Griffith, Gareth H.|9780470207734\n1996|Springer|Fortran 95 Language Guide|Gehrke, Wilhelm|9783540760627\n1988|Wiley|FORTRAN Tools for VAX/VMS and MS-DOS|Jones, Russell K. and Crabtree, Tracy|9780471619765\n1995|Wiley|Programming in Fortran 90: A First Course for Engineers and Scientists|Smith, I. M.|9780471941859\n2015|Lulu.com|Fortran Programming success in a day|Key, Sam|9781329427396\n1983|William C Brown Pub|ANSI Fortran IV With Fortran 77 Extensions: A Structured Programming Approach|Cole, J. W. Perry|9780697081728\n1974-12-01T00:00:01Z|Pearson College Div|Ten Statement Fortran Plus Fortran IV: Sensible, Modular, and Structured Programming With Watfor and Watfiv|Kennedy, Michael|9780139033858\n1995|Pws Pub Co|FORTRAN 90|Meissner, Loren P.|9780534933722\n1973|Wiley|Fortran codes for mathematical programming: linear, quadratic and discrete|Land, A. H|9780471512707\n1972|Cambridge University Press|Fortran Techniques with Special Reference to Non-numerical Applications|Day, A. Colin|9780521097192\n1964|Wiley|Numerical Methods and Fortran Programming|Daniel D McCracken, william Dorn|9780471582854\n1975|Pearson College Div|Watfiv: Fortran Programming With the Watfiv Compiler|Moore, John B.|9780879098766\n1983-01-01T00:00:01Z|Addison-Wesley|A Structured Approach to Fortran 77 Programming (International computer science series)|Ellis, T. M. R.|9780201137903\n1978T|W. C. Brown|ANSI Fortran IV: A structured programming approach|Cole, J. W. Perry|9780697081254\n1985-02-01T00:00:01Z|Scott Foresman & Co|Fundamentals of Fortran 77 Programming: A Structured Approach|Nickerson, Robert C.|9780673390394\n1976|Harcourt Brace Jovanovich|Simplified ANSI FORTRAN IV programming||9780155810402\n1994|Oxford University Press|An Introduction to Fortran for Scientific Computing|Ortega, James M.|9780030031281\n2000|Springer|Introducing Fortran 95|Chivers, Ian and Sleightholme, Jane|9781852332761\n1995|Wiley|Advanced Scientific Fortran|Willé, David R.|9780471953838\n1979|Elsevier Science|Programming in Standard Fortran 77|Balfour, Alexander|9780444194657\n1977T|Addison-Wesley Pub. Co|Problem solving and structured programming in FORTRAN (Addison-Wesley series in computer science and information processing)|Friedman, Frank L|9780201019674\n1984-03-01T00:00:01Z|West Group|Fortran for Humans|Didday, Rich and Page, Rex|9780314778871\n1972T|McGraw-Hill|A short course in basic Fortran IV programming based on the IBM System/360 and System/370|Lee, Robert M|9780070369986\n1978|Science Research Associates|FORTRAN programming using structured flowcharts|Haskell, Richard E|9780574211354\n1990T|Addison-Wesley|Problem solving and structured programming in FORTRAN 77|Koffman, Elliot B|9780201512168\n1987|Benjamin/Cummings Pub. Co|Structured FORTRAN 77 for engineers and scientists|Etter, D. M|9780805324952\n1975|Harcourt Brace Jovanovich|FORTRAN programming: A spiral approach, with WATFOR/WATFIV and standard FORTRAN|Kreitzberg, Charles B|9780155280120\n1973|Intext Educational Publishers|Fortran IV programming for engineers and scientists|Murrill, Paul W|9780700224197\n1998|Cambridge University Press|Fundamentals of Engineering Programming with C and Fortran|Myler, Harley R.|9780521620635\n1989|Wiley|FORTRAN and The Art of PC Programming|Ward, Tim and Bromhead, Eddie|9780471922537\n1988|Wiley|Computing for Engineers and Scientists with FORTRAN 77|McCracken, Daniel D. and Salmon, William I.|9780471625520\n1995|Wiley|Fortran 90 for Engineers|Etter, Delores M.|9780805364651\n1993|The MIT Press|The High Performance Fortran Handbook|Koelbel, Charles|9780262111850\n1985|Little, Brown|Fundamentals of FORTRAN 77 programming: A structured approach (Little, Brown computer systems series)|Nickerson, Robert C|9780316606530\n1976T|Wadsworth Pub. Co|Applied Fortran IV programming|Sturgul, John R|9780534004408\n1992|W H Freeman & Co|Fortran for the '90s: Problem Solving for Scientists and Engineers|Edgar, Stacey L.|9780716782476\n1997|Pws Pub Co|Contemporary Computing for Engineers and Scientists Using Fortran 90|Forsythe, Chester|9780534931391\n1981-06-01T00:00:01Z|Sheridan House Inc|Programming With Fortran 77|Ashcroft, J.|9780246115737\n1981|Prentice-Hall|Structured programming in FORTRAN|Hill, Louis A|9780138546120\n1977|Springer|FORTRAN Programming: A Supplement for Calculus Courses (Universitext)|Fuller, W. R.|9780387902838\n1976|Hodder & Stoughton Ltd|Computer Science Studies: Computer Programming - Fortran (Teach Yourself S.)|A.S. Radford|9780340194959\n1992|McGraw-Hill College|Fortran For Today and Tomorrow|Pressman, Michael H. and Pressman, Michael|9780697044839\n1976T|American Elsevier Pub. Co|JCL and advanced Fortran programming (Methods in geomathematics)|Ramdén, H. Å|9780444414151\n1989|Brooks/Cole Pub Co|Fortran 77 P.D.Q. (Brooks/Cole Brief Programming Guides)|Boyle, Thomas A.|9780534099367\n1978|Addison Wesley Publishing Company|An Introduction to Programming and Applications with FORTRAN|Hull, T. E.|9780201030662\n1973|Prentice-Hall|Problems for a computer-oriented calculus course,: With an appendix on elementary FORTRAN programming|Allen, Richard C|9780137164233\n2004|China Electric Power Press Pub. Date :2004-1-2|Fortran 95 programming|PENG GUO LUN|9787508310626\n2018|Independently published|Programming in Vienna Fortran|NASA, National Aeronautics and Space Administration|9781729236505\n1972|prentice Hall|A Fortran programming course,|James, Edward|9780133297485\n1987T|McGraw-Hill Book Company|Theory and problems of Programming with Fortran (including Structured Fortran) S|Lipschutz, Seymour; Poe, Arthur|9780070990333\n1970|Prentice-Hall|A Fortran programming course|James, Edward|9780133297300\n1971T|Harcourt Brace Jovanovich|Simplified FORTRAN IV programming|Silver, Gerald A|9780155810495\n1977|Wadsworth Pub. Co|Applied FORTRAN programming: With standard FORTRAN, WATFOR, WATFIV, and structured WATFIV|Merchant, Michael J|9780534004972\n2019|Independently published|\"Fortran Programming Notebook: A Fortran Programming Notebook|Journal|Diary For Daily Use\"|LLC Publishing, Sanders Industries|9781691114672\n1985|Course Technology Ptr|Structured Programming Using Fortran 77|McKeown, Patrick G.|9780155844117\n1980|McGraw-Hill|Structured FORTRAN WATFIV-S programming|Tremblay, Jean-Paul|9780070651715\n2019|Chapman and Hall/CRC|Fortran 2018 with Parallel Programming|Ray, Subrata|9781000546859\n1981-11-03T00:00:01Z|Financial Times Prentice Hall (a Pearson Education company)|Pocket Guide to Fortran (Programming Pocket Guides)|Ridler, Philip F.|9780273016830\n1978|Pitman|Principles of programming: An introduction with Fortran|James, Edward B|9780273012214\n1970|McGraw-Hill|Fortran programming, programs, and schematic storage maps|Mochel, Myron G|9780070426351\n1971T|Harrap|Introduction to FORTRAN programming, (Engineering science monographs)|Liddell, Heather Mary|9780245505225\n1983|Boyd & Fraser Pub Co|Structured Fortran 77 Programming With Hewlett-Packard Computers|Pollack, Seymour V.|9780878351305\n1972|National Computing Centre|Standard Fortran programming manual (Computers and the professional)|National Computing Centre Limited|9780850120639\n1969|Chapman & Hall|A course on programming in FORTRAN IV (Science paperbacks)|Calderbank, Valerie Joyce|9780412206405\n1975|Prentice-hall|Ten Statement Fortran Plus Fortran Iv: Sensible, Modular, And Structured Programming With Watfor And Watfiv, Second Edition, [by] Michael Kenndy, Martin B. Solomon : Instructor's Manual|Bowdon, Edward K|9780139034275\n2012|LAP LAMBERT Academic Publishing|Analytical Derivatives and Lone Pair Description Using FSGO: Evaluation and FORTRAN Programming of The First and Second Derivatives|Oftadeh, Mohsen|9783848434916\n1995|Springer|Introducing Fortran 90|Chivers, I. D. (ian David) , 1952-|9783540199403\n||Fortran Programming Language Family: Fortran, Watfiv, Fortress, Dap Fortran, Ratfor, High Performance Fortran, Industrial Real-time Fortran|Books and LLC|9781155741505\n1980|Sterling Swift Pub Co|Fortran Programming|Donald D. Spencer|9780892180424\n1977|Camelot Pub. Co|Fortran Programming|Donald D Spencer|9780892180066\n1969|Wiley|Fortran Programming|Stuart, Fredric.|9780471834779\n1977|Camelot Pub. Co|Fortran Programming|Donald D Spencer|9780892180073\n1982/11/01|London ; Academic Press, 1982.|FORTRAN optimization|Michael Metcalf|9780124924802\n2009-01-14|CRC Press|Classical Fortran|Michael Kupferschmid|9781439894873\n20111205|Cambridge University Press|Modern Fortran|Norman S. Clerman; Walter Spector|9781107385108\n||Fortran Programming|Jamison and Robert|9781114456150\n1971|John Wiley & Sons Inc|Fortran Programming|Fredric Stuart|9780471834663\n20201007|Simon & Schuster|Modern Fortran|Milan Curcic|9781638350057\n1969|John Wiley & Sons|Introduction To Fortran Ii And Fortran Iv Programming|D.k. Carver|9780471138600\n||Introduction To Fortran 2 And Fortran 4 Programming|Carver and D K|9781114362185\n1969|Wiley, Us|Introduction To Fortran Ii And Fortran Iv Programming|Carver and D K.|9780471138617\n2003|Iuniverse Inc|Fortran Programming Guide|Sun Microsystems Inc.|9780595732012\n2007|Sun Microsystems Inc|Fortran Programming Guide|Sun Microsystems Inc|9780595352302\n||Fortran Programming Guide|Sun Microsystems Inc|9780595286478\n20180823|Oxford University Press Academic UK|Modern Fortran Explained|Michael Metcalf; John Reid; Malcolm Cohen|9780192539878\n2005|Iuniverse Inc|Fortran Programming Guide|Sun Microsystems Inc.|9780595353279\n2005|Iuniverse Inc|Fortran Programming Guide|Inc. Sun Microsystems|9780595285129\n2005|Iuniverse Inc|Fortran Programming Guide|Sun Microsystems Inc.|9780595353026\n2004|Iuniverse Inc|Fortran Programming Guide|Inc. Sun Microsystems|9780595284900\n1988|Springer Berlin Heidelberg|Fortran 77 -- Strukturiert|Werner Junginger|9783642719028\n1979|Addison-wesley|Programming In Fortran|William F. Schallert and Carol R. Clark|9780201067163\n||Programming Language Fortran||9780726255137\n1972|University Of Birmingham, Computer Centre|Programming In Fortran|Burkhardt, Diana.|9780704400054\n2003|Iuniverse Inc|Fortran Programming Guide|Sun Microsystems Inc.|9780595732340\n1976|Reston Pub. Co|Fortran Iv Programming|V. Thomas Dock|9780879092795\n2004|Iuniverse Inc|Fortran Programming Guide|Sun Microsystems Inc.|9780595286751\n1972|Reston Pub. Co|Fortran Iv Programming|V. Thomas Dock|9780879092719\n2018||Modern Fortran Explained|Michael Metcalf and John Ker Reid and Malcolm Cohen|9780191850028\n20121206|Springer Nature|Introducing Fortran 95|Ian Chivers; Jane Sleightholme|9781447104032\n1982|William C Brown Pub|Ansi Fortran Iv And Fortran 77: Programming With Business Applications|Nesa L'abbe Wu|9780697081537\n1972|Wadsworth Pub. Co|Applied Fortran Iv Programming|John R Sturgul|9780534001285\n1975|Addison-wesley|Basic Fortran Iv Programming|Jeremiah J. Healy|9780201028270\n1999|Alfred Waller|Programming In Fortran 90|Morgan and J. S. and Schonfelder and J. L.|9781872474069\n1966|Prentice Hall|Computer Programming Fortran Iv|Decima M. Anderson|9780131648227\n1971|Wiley|Watfor/watfiv Fortran Programming|Fredric Stuart|9780471834717\n2000|China Press|Fortran Programming Tutorial (2)|Wang Zhao Rong. Yao Quan Zhu|9787560604831\n1981|Homewood: Irwin|Essentials Of Fortran Programming|Malley and John C. and & Ralph M. Stair and Jr.|9780256023886\n1993|Mcgraw-hill Osborne Media|Fortran Programming For Windows|L. John Ribar|9780078819087\n1969|Sams|Comprehensive Standard Fortran Programming|Haag Jn|9780810458123\n1974|Winthrop Publishers, Incorporated|Fundamentals Of Fortran Programming|Robert C. Nickerson|9780876263006\n1972|National Computing Centre|Standard Fortran Programming Manual|National Computing Centre Limited|9780850121032\n1989|Halsted Press|Programming With Fortran 77|R.s. Dhaliwal|9788122400946\n1984|Richard D Irwin|Essentials Of Fortran Programming|Unknown|9780256023909\n1981|Prentice Hall|Business Programming In Fortran Iv And Ansi Fortran: A Structured Approach|Asad S. O. Khailany|9780131076075\n1981|Random House Electronic Pub|Computer Programming In Fortran|Arthur S. Radford|9780679103783\n1973|Scott, Foresman|Linear Programming With Fortran|Carvel S Wolfe|9780673077974\n1973|Science Research Associates|Fortran Programming And Watfiv|James L Parker and Marilyn Bohl|9780574170705\n1982|Little, Brown|Fundamentals Of Fortran Programming|Robert C Nickerson|9780316606448\n1995|Mcgraw-hill Education - Europe|Programming With Fortran 77|Mayo|9780071135320\n1980|Blackwell Publishers|Standard Fortran Programming Manual||9780850122398\n1978|New York : McGraw-Hill, c1978.|Introduction to FORTRAN IV|Hammond and Robert H.|9780070258976\n20120618|Cambridge University Press|Modern Fortran in Practice|Arjen Markus|9781139506328\n2/1/1979|St. Paul : West Pub. Co., c1979.|Structured FORTRAN IV programming|Dock and V. Thomas|9780829902495\n1984|Addison-wesley|Fortran 77 Featuring Structured Programming|Loren P. Meissner|9780075823285\n1969|Mcgraw-hill Book Company|Computer Usage: 360 Fortran Programming.|Computer Usage Co. and Inc. Staff; Eric A. Weiss|9780070123816\n||Simplified Guide to FORTRAN Programming|McCracken and McRacke|9780471582939\n2000|Higher Education Press|Fortran Language Programming(chinese Edition)|Tan Hao Qiang Tian Shu Qing|9787040007589\n||Basic Fortran Programming Rev Edition|Harvill and John B|9781114482616\n2003||Programming In Fortran 90/95|Dhall|9780536707154\n1980|Prentice-hall|Structured Fortran With Watfiv-s|Paul Cress|9780138547523\n1985|Thomson Learning|Fundamental Programming With Fortran 77|J. Denbigh Starkey|9780314778055\n||Introduction To Fortran 4 Programming|Dimitry and Donald L|9781114370715\n1984|University Press Of America|Elementary Fortran Iv Microeconomics Programs|Siegfried B.y. Ayatey|9780819139504\n2009|China Electric Power Press Pub. Date :2009-8-1|Fortran 952003 Programming - Third Edition|(mei )cha Pu Man (chapman.s.j. )|9787508386706\n1982|Harcourt College Pub|Fortran Programming: A Spiral Approach|Charles B. Kreitzberg|9780155280151\n1978|Chinese University Press|Course On Programming In Fortran|Hung, Hing Sum. and Loh, Shiu-chang|9789622011687\n1979|Heinemann Educational Publishers|Programming In Standard Fortran 77|A; Marwick, David Balfour|9780435774851\n1975/12/01|Englewood Cliffs, N.J. : Prentice-Hall, [1975]|FORTRAN programming for civil engineers|Richard H. McCuen|9780133294170\n|Melbourne : Longman Cheshire, 1989.|Computer Programming In Fortran 77||9780582711853\n1979|Wadsworth Pub Co|The Abc's Of Fortran Programming|Michael J. Merchant|9780534006341\n2019|Crc Press,|Fortran 2018 With Parallel Programming|Ray, Subrata|\n2019|Taylor & Francis Group|Fortran 2018 With Parallel Programming|Subrata Ray|9781000542028\n2012|Springer Science & Business Media|Introduction To Programming With Fortran|Ian Chivers and Jane Sleightholme|9780857292339\n1965|Prentice-hall, Inc.|Fortran Iv: Programming And Computing|James T. Golden|9780133297553\n1996|John Wiley & Sons Inc|Advanced Fortran Programming For Windows|Templeman|9780471956853\n1974|Prentice-hall (india)|Computer Programming In Fortran Iv|V Rajaraman|9780876920077\n2006|Springer Science & Business Media|Introduction To Programming With Fortran|Ian Chivers and Jane Sleightholme|9781846280542\n|Dubuque, Iowa : W.c. Brown, [1973]|Business Programming In Fortran Iv||9780697081063\n20150903|Springer Nature|Guide to Fortran 2008 Programming|Walter S. Brainerd|9781447167594\n09/2013|Elsevier S & T|CUDA Fortran for Scientists and Engineers: Best Practices for Efficient CUDA Fortran Programming|Ruetsch, Gregory; Fatica, Massimiliano|9780124169722\n1981|Addison Wesley Publishing Company|Problem Solving & Structured Programming In Fortran|Elliot B. Koffman and Frank L. Friedman|9780201024654\n1980|Reston Pub Co|Elementary Computer Programming In Fortran Iv|Boris W. Boguslavsky|9780835916486\n2004|Iuniverse Inc|Fortran 95 Interval Arithmetic Programming Reference|Sun Microsystems Inc.|9780595286560\n1971|Mcgraw Hill Text|Fortran Iv Programming: A Concise Exposition.|Anthony. Ralston|9780070511644\n1990|Wiley|Efficient Fortran Programming (wiley Professional Computing)|Anton Kruger|9780471528944\n1973|Houghton Mifflin School|Programming Business Applications In Fortran Iv|Phillip T. May|9780395140475\n1985|Prentice Hall Ptr|Linear Programming With Basic And Fortran|Carvel Wolfe|9780835940825\n|Springer International Publishing :|Introduction To Programming With Fortran: With Coverage Of Fortran 90, 95, 2003, 2008 And 77|Chivers, Ian (author.)|9783319177007\n1982|Pearson College Div|Introduction To Programming Using Fortran 77|Glen A. Gibson|9780134935515\n1990|Tsinghua University Press, China|Fortran Language - Fortran77 Structured Programming (paperback)|Tan Hao Qiang Tian Shu Qing|9787302006237\n1978|Prentice Hall Ptr|Introduction To Engineering Including Fortran Programming|L. S. Fletcher; Terry E. Shoup|9780135018583\n1981|Engineering Press|Fortran Programming With Applications To Engineering|Jack B Evett|9780910554329\n2005|Iuniverse Inc|Fortran 95 Interval Arithmetic Programming Reference|Sun Microsystems Inc.|9780595353361\n1999||Modern Programming With Digital Visual Fortran|Brainerd and Walter and Hendrickson and Dick and Green and Ron|9781555582197\n1984|Prentice Hall|Programming With Fortran Iv (qpi Series)|Byron S. Gottfried|9780137296996\n1967|John Wiley & Sons Ltd|Mathematics And Computing: With Fortran Programming|Dorn and William S.; Greenberg and H. J.|9780471219156\n1979|Brady|Programming Fortran 77: A Structured Approach|Hume and J.n.p. and Holt and R.c.|9780835956710\n20200109|Oxford University Press Academic UK|Introduction to Computational Economics Using Fortran|Hans Fehr; Maurice Hofmann; Fabian Kindermann|9780192590640\n1993/06/01|Amer Computer Pr|Programming Byte by Byte Structured Fortran|Bijan Mashaw|9780934433082\n2004|Iuniverse Inc|Fortran 95 Interval Arithmetic Programming Reference|Sun Microsystems Inc.|9780595286843\n1973|Addison-wesley Publishing Company|Simplified Fortran Programming: With Companion Problems,|Lisa And Judah Rosenblatt|9780201065114\n1983|Chapman & Hall|Course In Programming In Fortran Iv|V. J. Calderbank|9780412237904\n2005|Iuniverse Inc|Fortran 95 Interval Arithmetic Programming Reference|Inc. Sun Microsystems|9780595285228\n1981|Hayden Book Co|Basic Fortran (hayden Computer Programming Series)|James S Coan|9780810451681\n1987|Clarendon Press|Fortran 8X Explained (Oxford science publications)|Michael Metcalf and John K. Reid|9780198537311\n1/1/1985|New York : Macmillan ; c1985.|FORTRAN 77 for engineers and scientists|Larry Nyhoff and Sanford Leestma|9780023886201\n1967|New York, Holt, Rinehart and Winston, 1967.|Fortran programming for the behavioural sciences|Donald J Veldman|9780030659409\n20180308|Oxford University Press Academic UK|Introduction to Computational Economics Using Fortran|Hans Fehr; Fabian Kindermann|9780192526571\n1967|John Wiley & Sons Inc|Introduction To Numerical Methods And Fortran Programming|Thomas Richard Mccalla|9780471581253\n1995|Addison Wesley Publishing Company|C Fortran 90 Programming 58043 & 54446 Pkg|T M Ellis|9780201461497\n1969|Chapman & Hall|A Course On Programming In Fortran Iv|Valerie Joyce Calderbank|9780412092503\n1969|Computer Systems (aust.)|Basic Fortran Iv Programming [version Ibm 360|John Markus. Blatt|9780130614575\n1983|Little, Brown & Company|Programming Byte By Byte: Structured Fortran 77|Bijan Mashaw|9780316549097\n1989|Halsted Pr|Programming With Fortran 77: A Structures Approach|Ranjit S. Dhaliwal|9780470213568\n1994|Saunders College Pub.|Introduction To Fortran 90 For Scientific Computing|Ortega, James M.|9780030101984\n1979|Allyn & Bacon|Introduction To Computer Programming For Chemists: Fortran|Thomas L Isenhour|9780205058976\n2015|Createspace Independent Publishing Platform|Fortran Programming Success In A Day: Beginners Guide To Fast, Easy And Efficient Learning Of Fortran Programming|Sam Key|9781514602423\n1972||A Guide To Fortran Programming And Uniwaft|Thomas A Reid|9780959945201\n1979|Prentice Hall|Fortran Computer Programming For Statistics: A Manual|Richard C. Fegan; Susan L. Brosche|9780133293265\n1975|Allyn And Bacon|Fundamentals Of Fortran Programming: With Watfor/watfiv|Terry M Walker|9780205048854\n2011||Articles On Fortran Programming Language Family, Including|Hephaestus Books|9781242974243\n1983|Financial Times Management|Pocket Guide: Fortran 77 (pocket Programming Guide)|Ulive Page|9780273019732\n1987|Addison Wesley Publishing Company|Pocket Guide To... Fortran (programming Pocket Guides)|P. Ridler and Philip Ridler|9780201077469\n1983|Henry Holt & Co|Programming the IBM Personal Computer: Fortran 77|Robert A. Rouse|9780030636684\n1980|Winthrop Publishers|Top-down, Modular Programming In Fortran With Watfiv|R Chattergy|9780876268797\n2012|Cambridge University Press|Fundamentals Of Engineering Programming With C And Fortran|Harley R. Myler|9781139175029\n1989|Chapman & Hall|Programming In Fortran (chapman And Hall Computing Series)|Valerie Joyce Calderbank|9780412305009\n1989|Chapman & Hall|Programming In Fortran (chapman And Hall Computing Series)|Valerie Joyce Calderbank|9780412305108\n1987|Lawrence Erlbaum Associates, Inc|Programming For The Social Sciences: Algorithm & Fortran 77|Lehman|9780898599787\n1968|Goodyear|Introduction To Fortran Iv Programming: Using Watfor Compiler|John M Blatt|9780876204382\n1981|Pearson College Div|Computing: A Problem-solving Approach With Fortran 77|T. Ray Nanney|9780131652095\n1983|Chapman And Hall|A Course On Programming In Fortran (science Paperbacks)|Valerie Joyce Calderbank|9780412242700\n1987|Addison-wesley|Problem Solving And Structured Programming In Fortran 77|Elliot B Koffman|9780201115611\n1975|Westinghouse Learning Press|Computer Programming: An Individualized Course In Fortran Iv|Carl A Grame|9780882507828\n1986|Boyd & Fraser Pub. Co|Vax Fortran (the Boyd & Fraser Programming Language Series)|David G Weinman|9780878351725\n1986|Hutchinson|Scientific Programming: Using Fortran 77 (hutchinson Computer Studies Series)|William M Turner|9780091616014\n1983|William C Brown Pub|A Structured Approach To Fortran 77 Programming With Watfiv|C. Joseph Sass|9780205079186\n1975|Petrocelli/charter|Fortran Iv With Watfiv: A First Course In Programming|Graham M Campbell|9780884053064\n1975|Hayden Book Co|Programming Proverbs For Fortran Programmers (hayden Computer Programming Series)|Henry F Ledgard|9780810458208\n||Introduction To Fortran 90-95, Algorithms And Structured Programming|Robin Anthony Vowels|9780959638486\n1970|International Textbook Co|An Introduction To Fortran Iv Programming;: A General Approach|Paul W Murrill|9780700222667\n1972|Holt, R & W|Introduction To Fortran Iv Programming: A Self-paced Approach|Dickson and G|9780030880889\n1970-06|Mcgraw Hill Text|Fortran Iv Programming: Based On The Ibm System 1130|Robert V. Jamison|9780070322707\n1977|Holt, Rinehart And Winston|Computers, Their Impact And Use: Structured Programming In Fortran|Robert Emmett Lynch|9780030885259\n1972|Cambridge University Press|Fortran Techniques With Special Reference To Non-numerical Applications|A. Colin Day|9780521085496\n1975|Hayden Book Co|Fortran Fundamentals: A Short Course (hayden Computer Programming Series)|Jack Steingraber|9780810458604\n2001||Fortran 95 Interval Arithmetic Programming Reference - Japanese Language Version|Sun Microsystems Inc.|9781400530021\n1971|Auerbach|Fortran Iv With Watfiv;: A First Course In Programming|Graham M Campbell|9780877690672\n1984|Barrons Educational Series Inc|Computer Programming In Fortran The Easy Way (barron's Easy Way)|Lawrence S. Leff and Arlene Podos|9780812028003\n1972|Anaheim Pub Co|Introduction To Computer Programming-basic Fortran 4: A Practical Approach|William J. Keys and Thomas J. Cashman|9780882361512\n|Wiley|Digital Computing: Fortran Iv And Its Applications In Behavioral Science|Lehman, Richard S.|9780471524007\n1988|Blackwell Scientific Publications|An Introduction to Programming in Fortran 77 (Computer Science Texts)|J. L. Schonfelder and J. S. Morgan|9780632011841", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|The High Performance Fortran Handbook|10.1063/1.4823319|791|62|C. Koelbel and D. Loveman and R. Schreiber and G. Steele and M. Zosel|e6731a83852d4a41e7266b31eb32276538514e93\n1992|Programming in Vienna Fortran|10.1155/1992/258136|312|24|B. Chapman and P. Mehrotra and H. Zima|b83462be97a6abe11d6fc619c6f7d516f2af3976\n1995|Fortran M: A Language for Modular Parallel Programming|10.1006/jpdc.1995.1044|224|4|Ian T Foster and K. M. Chandy|a6156d35c6e4249c6ab847d5642a0a7631ab2c59\n2009|F2PY: a tool for connecting Fortran and Python programs|10.1504/IJCSE.2009.029165|204|9|Pearu Peterson|4990d2b5e21f09aab3853dcc1cecb8e352fd07f9\n2003|Object-oriented programming via Fortran 90/95|10.1017/CBO9780511530111|62|5|E. Akin|2f0678d064dfb69117ddd8d5e74e521559758a5c\n2014|OpenCoarrays: Open-source Transport Layers Supporting Coarray Fortran Compilers|10.1145/2676870.2676876|55|3|A. Fanfarillo and T. Burnus and V. Cardellini and S. Filippone and D. Nagle and D. Rouson|2b34906590cc30a403ab786b189ad3acfa8b0223\n2011|Modern Fortran Explained|10.1093/oso/9780198811893.001.0001|55|4|M. Metcalf and J. Reid and Malcolm Cohen|dcd889084d2cc3d344dc0f8d780d126b1f02bb85\n1899|An experiment comparing Fortran programming times with the software physics hypothesis|10.1145/1499799.1499927|33|0|R. D. Gordon and M. Halstead|279ffcb7eeba3b0c49e97b40474da69a6550183d\n2011|Implementation and Performance Evaluation of the HPC Challenge Benchmarks in Coarray Fortran 2.0|10.1109/IPDPS.2011.104|28|0|G. Jin and J. Mellor-Crummey and L. Adhianto and William N. Scherer and Chaoran Yang|a0ba323d58a1879fb877cc92293ed0f631317af4\n1964|FORTRAN vs. Basic FORTRAN: a programming language for informational processing on automatic data processing systems|10.1145/364888.876694|23|0|S. Gorn|decdb3f767c8f01e22323c2eec9f95f42a81bf83\n2015|Introduction to programming with Fortran - with coverage of Fortran 90, 95, 2003, and 77|10.1007/b137984|21|0|I. Chivers and J. Sleightholme|8d271c4cc16fb945842724ca643db4b61958b3b7\n2012|Modern Fortran in Practice|10.5860/choice.50-3308|20|3|A. Markus|46a2996de87826ddcf521db03f8e838a7bba4976\n1996|On parallel object oriented programming in Fortran 90|10.1145/240732.240742|15|0|C. Norton and V. Decyk and B. Szymanski|e92d269aec928aff306edcb1cd7bc81cf3106c41\n1975|On extending Fortran control structures to facilitate structured programming|10.1145/987316.987320|14|0|L. Meissner|a766af23f9f729cdbbed698f6cbbb0a1827cba54\n2006|Introduction to Programming with Fortran|10.1007/978-3-319-75502-1|12|1|I. Chivers and J. Sleightholme|7d299d93a5e89892168c7251972e6e722c229cea\n1995|A Comparison of C++, FORTRAN 90 and Oberon-2 for Scientific Programming|10.1007/978-3-642-79958-7_103|11|0|Bernd Mösli|52f40ca6a6598c1dbedf83fa45d3b0f972914634\n1977|Teaching problem solving and structured programming in FORTRAN|10.1145/800104.803360|11|0|F. Friedman and Elliot B. Koffman|77b6e137a0f12af5cb3ec0c83e1bb9810f8db606\n2012|Introduction to Programming with Fortran|10.1007/978-0-85729-233-9|11|2|I. Chivers and J. Sleightholme|6ea9437fdde5f60c5ce03bcc7de3fc8698618299\n1978|A comparison of PASCAL and FORTRAN as introductory programming languages|10.1145/953422.953425|10|0|G. Nutt|631aa27149f2daf7d85253f96769a09a380944d1\n2002|Efficient parallel programming on scalable shared memory systems with High Performance Fortran|10.1002/cpe.649|10|0|S. Benkner and T. Brandes|53b26b8e6bbecfcf6f4cfd79167023035b5e19cf\n2013|Numerical Computing with Modern Fortran|10.1137/1.9781611973129|9|0|R. Hanson and T. Hopkins|daf758e2f494238f7369ffd67b5476a31e870798\n1995|Vienna Fortran 90 - An Advanced Data Parallel Language|10.1007/3-540-60222-4_104|8|0|S. Benkner|b0184143f4380bcba956cf37739cfb2b79764b63\n1975|Teaching structured programming in FORTRAN with IFTRAN|10.1145/800284.811158|7|0|William R. Bezanson|85b81c77157355c69dc66d87704b114fb79b038d\n1994|The Cray Research MPP Fortran Programming Model|10.1007/978-3-0348-8534-8_1|7|0|T. MacDonald and Z. Sekera|9e4bb3e613e502b9345e979e8bf202fd4db106ef\n2014|SPOT: A DSL for Extending Fortran Programs with Metaprogramming|10.1155/2014/917327|6|2|Songqing Yue and J. Gray|870ff05f103598190090abfde3276218ce78bc46\n2009|Guide to Fortran 2003 Programming|10.1007/978-1-84882-543-7|6|0|W. Brainerd|92437cc86aec82abe9003d7de5bfe52003c74553\n2011|ForOpenCL: transformations exploiting array syntax in Fortran for accelerator programming|10.1504/IJCSE.2013.052113|6|0|M. Sottile and C. Rasmussen and W. Weseloh and R. Robey and D. Quinlan and J. Overbey|1d12ce860badedaf289bd67534c1af5a44427851\n1984|Status of work toward revision of programming language Fortran|10.1145/1040943.1040946|6|0|J. Wagener|eb8f514ad41d7a0be76ce5c7c6b9dafa460b6f30\n2006|Generic programming in Fortran|10.1145/1111542.1111564|5|0|Martin Erwig and Zhe Fu and Ben Pflaum|b252d7ae875b3864f4101805ba64ee287b1417f3\n2015|Guide to Fortran 2008 Programming|10.1007/978-1-4471-6759-4|5|0|W. Brainerd|760a34beb9d7321cef88185a384ab7eb34da782a\n2015|Preliminary Implementation of Coarray Fortran Translator Based on Omni XcalableMP|10.1109/PGAS.2015.15|4|0|H. Iwashita and M. Nakao and M. Sato|3ab6cdb478dcf00ab41aebb01d149f7a2fd90672\n2020|History of coarrays and SPMD parallelism in Fortran|10.1145/3386322|4|0|J. Reid and Bill Long and Jon L. Steidel|27a343885943e58d59cf539ec1d01705dabc177e\n2001|Up-to-Date International Standards of the Fortran Programming Language|10.1023/A:1012710502032|3|0|A. Gorelik|486e3f45d22ce981b0c25470a4b765c3a539b1c3\n1982|The Fortran programming language: recent developments and a view of the future|10.1145/1040091.1040092|3|0|L. Meissner|677ab875d35a9b20493b4b9741c8123c7a7f8daf\n1989|Aftran: Array Fortran programming language|10.1109/PARBSE.1990.77218|2|0|G. A. Riccardi and U. Chandra and J. C. Vagi|6c2f56c3ca6fb4470da97f6a0d55f811b14768b7\n2007|Fortran programming language and Scientific Programming: 50 Years of mutual growth|10.1155/2007/979872|2|0|B. Szymanski|7a6ac390da0ff74c0318e1d937e138bd817c4b1a\n1982|The fortran programming language, recent developments and a view of the future|10.1109/MCS.1982.1103762|2|0|L. Meissner|1fe3c69dba68ef694a5ad378a160ad8f2772a1a3" }, "fortransit": { "title": "FORTRANSIT", "appeared": 1956, "type": "pl", "reference": [ "https://ieeexplore.ieee.org/document/4463961" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=407", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "fortress": { "title": "Fortress", "appeared": 2004, "type": "pl", "website": "http://projectfortress.java.net/", "country": [ "United States" ], "originCommunity": [ "Sun Labs" ], "domainName": { "name": "projectfortress.java.net" }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "wikipedia": { "example": [ "component hello\nexport Executable\nrun() = println(“Hello, World!”)\nend" ], "related": [ "fortran", "scala", "haskell", "scheme", "common-lisp", "java", "unicode", "standard-ml", "ascii", "emacs-editor", "latex", "x10", "chapel", "sisal" ], "summary": "Fortress is a discontinued experimental programming language for high-performance computing, created by Sun Microsystems with funding from DARPA's High Productivity Computing Systems project. One of the language designers was Guy L. Steele Jr., whose previous work includes Scheme, Common Lisp, and Java.", "pageId": 1822171, "dailyPageViews": 54, "created": 2005, "backlinksCount": 171, "revisionCount": 164, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Fortress_(programming_language)" }, "helloWorldCollection": [ "(* Hello World in Fortress *)\n\nexport Executable\nrun(args) = print \"Hello, world!\"\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Fortress", "tiobe": { "id": "Fortress" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8170", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2005|Parallel Programming and Parallel Abstractions in Fortress|10.1109/PACT.2005.34|35|0|G. Steele|2fb5a5cfe833a7c8a1c072ae50beb92f5631e7d5\n2006|Parallel programming and code selection in fortress|10.1145/1122971.1122972|19|0|G. Steele|b658729a9b7ba4ab68db8c38c467984649230670\n2009|Parsing Fortress syntax|10.1145/1596655.1596667|13|2|S. Ryu|b3aa9613a3e9fb7a1da38a1aa08d95a6984282dc\n2010|Generators-of-Generators Library with Optimization Capabilities in Fortress|10.1007/978-3-642-15291-7_4|10|0|Kento Emoto and Zhenjiang Hu and K. Kakehi and Kiminori Matsuzaki and M. Takeichi|aa59501d1da60d3df90d648cbb531feda99acaf3\n2011|Coq Mechanization of Featherweight Fortress with Multiple Dispatch and Multiple Inheritance|10.1007/978-3-642-25379-9_20|3|1|Jieung Kim and S. Ryu|ffc4aadeab17411ebe95ea93dc7946ce75694bda\n2016|Scalable framework for parsing: from Fortress to JavaScript|10.1002/spe.2380|3|0|S. Ryu|45aad1146bc018df0ce85cfdae156ebb5a91c498" }, "fossil-scm": { "title": "Fossil", "appeared": 2006, "type": "application", "website": "https://fossil-scm.org/", "country": [ "United States" ], "originCommunity": [ "http://www.hwaci.com" ], "domainName": { "registered": 2008, "awisRank": { "2022": 1273552 }, "name": "fossil-scm.org" }, "wikipedia": { "summary": "Fossil is a distributed version control system, bug tracking system and wiki software server for use in software development created by D. Richard Hipp.", "backlinksCount": 126, "pageId": 24323051, "dailyPageViews": 70, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Fossil_(software)" } }, "foundry": { "title": "foundry", "appeared": 2013, "type": "pl", "website": "http://foundry-lang.org", "reference": [ "https://www.scirp.org/pdf/JMMCE20090600001_35536531.pdf" ], "country": [ "Nigeria" ], "originCommunity": [ "Federal University of Technology" ], "domainName": { "name": "foundry-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n6024988|Foundry|http://foundry-lang.org/|2013-07-11 08:16:06 UTC|1373530566|MrBra|0|2", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|Mathematical Model for Optimizing Charge and Heel Levels in Steel Remelting Induction Furnace for Foundry Shop|10.4236/JMMCE.2009.86037|3|0|O. K. Abubakre and R. A. Muriana|78298a96a0f5a068490a9f48e12978015d5b4b7e" }, "fox": { "title": "fox", "appeared": 2017, "type": "pl", "description": "Fox is an ever-evolving experiment in declarativeness that strives to one day settle on a consistent syntax.", "website": "https://fox-lang.org/", "domainName": { "registered": 2021, "name": "fox-lang.org" }, "fileType": "text", "wordRank": 3222, "centralPackageRepositoryCount": 0 }, "foxpro": { "title": "FoxPRO", "appeared": 1992, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Fox Software" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "visual-foxpro", "dbase", "linux", "freebsd" ], "summary": "FoxPro was a text-based procedurally oriented programming language and database management system (DBMS), and it is also an object-oriented programming language, originally published by Fox Software and later by Microsoft, for MS-DOS, Windows, Macintosh, and UNIX. The final published release of FoxPro was 2.6. Development continued under the Visual FoxPro label, which in turn was discontinued in 2007. FoxPro was derived from FoxBase (Fox Software, Perrysburg, Ohio), which was in turn derived from dBase III (Ashton-Tate) and dBase II. dBase II was the first commercial version of a database program written by Wayne Ratliff, called Vulcan, running on CP/M. FoxPro is both a DBMS and a relational database management system (RDBMS), since it extensively supports multiple relationships between multiple DBF files (tables). However it lacks transactional processing. After they acquired Fox Software in its entirety in 1992, FoxPro was sold and supported by Microsoft. At that time there was an active worldwide community of FoxPro users and programmers. FoxPro 2.6 for UNIX (FPU26) has even been successfully installed on Linux and FreeBSD using the Intel Binary Compatibility Standard (ibcs2) support library.", "pageId": 7419372, "created": 2006, "backlinksCount": 71, "revisionCount": 236, "dailyPageViews": 244, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/FoxPro" }, "pygmentsHighlighter": { "filename": "foxpro.py", "fileExtensions": [ "PRG", "prg" ], "id": "FoxPro" }, "leachim6": { "filepath": "f/FoxPro.prg", "fileExtensions": [ "prg" ], "example": [ "? \"Hello World\"\n" ], "id": "FoxPro" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2056", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nVisual FoxPro Programming Basics|1995|Whil Hentzen|3539454|5.00|4|1\nProgramming Visual FoxPro 3.0|1995|Whil Hentzen|3307531|5.00|2|0\nProgrammer's Guide to FoxPro 2.6|1994|Howard Dickler|7215033|5.00|1|0\nFoxPro 2.6 for Windows for Dummies|1994|John Kaufeld|2391631|0.0|0|0\nVisual Foxpro 5 for Dummies|1997|Jim Keogh|1377516|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1990|Windcrest|FoxPro programming|Pinter, Les|9780830635252\n1998|Prima Pub|Visual Foxpro 6 Enterprise Edition|John Petersen and Ron Talmage and Rod Paddock|9780761513810\n1995|Sams|Visual Foxpro 3 Unleashed|Jim Booth and Jeb Long and Doug Norman and Menachem Bazian and Edward Jones and Christopher Buelow|9780672307584\n1993|Microsoft Press|Running Microsoft Foxpro For Windows|Sal Ricciardi|9781556155536\n2000|Hentzenwerke Publishing|Microsoft Office Automation with Visual FoxPro|Granor, Tamar and Martin, Della|9780965509305\n1994|Que Pub|Visual Foxpro Expert Solutions/book And Cd-rom|Miriam Liskin|9780789700759\n1991|M & T Books|Foxpro 2: A Developers Guide : Expert Guidance for Industrial-Strength Programming/Book and Disk (DBMS Magazine's Database Foundation Series)|Ahlo, Hamilton M. and Brown, Randy|9781558510845\n1998|Hentzenwerke Publishing|Advanced Object Oriented Programming with Visual FoxPro 6.0|Egger, Markus|9780965509381\n1996|Addison-Wesley Professional|Object Orientation in Visual Foxpro|Brentnall, Savannah|9780201479430\n2004|Sams Publishing|Visual FoxPro to Visual Basic .NET|Pinter, Les|9780672326493\n1995-12-01T00:00:01Z|Oracle Pr|Visual Foxpro Programming Basics|Stearns, Tom and Stearns, Leonard|9780078820922\n1995-05-01T00:00:01Z|Ziff Davis Pr|Programming Visual Foxpro 3.0/Book and Disk|Hentzen, Whil|9781562763251\n1996|Apress|The Revolutionary Guide to Foxpro Oop|Phelps, Will and Kramek, Andy and Grommes, Bob|9781874416401\n1997|John Wiley & Sons Inc|Building Visual Foxpro 5 Applications|Sosinsky, Barrie A. and Bryant, R. Lawrence|9780764580239\n1997|M & T Books|Visual Foxpro 5.0 for Windows: Developing an Application Framework (Teach Yourself)|King, Nelson|9781558515604\n1992|Windcrest|Foxpro 2.0 Applications Programming|Pinter, Les|9780830642687\n1995|Ventana Pr|The Visual Guide to Visual Foxpro 3.0: The Pictorial Companion to Windows Database Management & Programming (Visual Guides)|Sander, Ellen and Brentnall, Savannah and Gunn, John|9781566042277\n2003|Bpb Publications|Foxpro Interactive Programming And Projects|Dasgupta, Soma|9788176566742\n1993|TAB Books Inc|Microsoft FoxPro 2.5 Applications Programming|Pinter, Les|9780830645688\n1991|Unknown|Visual FoxPro 6.0 Programming|YU FEI ?CHEN WEI ZHU BIAN WANG XIAO YONG ?FANG HOU JIA FU ZHU BIAN|9787113086428\n2013|People Post Press|Visual FoxPro Programming Guide(Chinese Edition)|XIONG XIAO BING . GUI XUE QIN . JIAO CUI ZHEN ZHU|9787115299192\n1991|Unknown|Visual Foxpro programming guide-on exercises and answers to Beijing University Press,|HUANG JIAN HUA ?ZHANG XIN ZHU BIAN WANG ZHONG ZHUANG ?WAN FANG FU ZHU BIAN|9787563517862\n1992|Windcrest/mcgraw-hill|Foxpro Programming|Les Pinter|9780830625864\n||Visual Foxpro 3: Object-oriented Programming|Bard and Dick|9781558514225\n||Foxpro Power Programming|Schwartz and Alan|9781556158476\n||Programming Foxpro 2.5|Miriam Liskin|9788170295907\n1993|Macmillan Pub Co|Business Programming Using Foxpro|Sudesh M. Duggal|9780023305856\n1993|Windcrest|Microsoft Foxpro 2.5 Programming|Les Pinter|9780830643981\nJanuary 1994|Windcrest|Microsoft FoxPro 2.5 Applications Programming|Les Pinter|9780070501539\n1996|Mcgraw-hill Osborne Media|The Pinter Visual Foxpro Programming Handbook|Les Pinter and John Pinter|9780070501805\n1993|Que Pub|Creating Foxpro Applications: The Professional Programmer's Guide To Foxpro 2.5/book And Disk (programming Series)|George F., Iv Goley|9781565290938\n1992|Que Pub|Foxpro 2.0 Programmer's Reference (programming Series)|John L. Hawkins and Joseph A. Gotthelf and Bill House|9780880226769\n1993|Que Pub|Foxpro 2.5 Programmer's Reference (programming Series)|John L. Hawkins|9781565292109\n1996|Que|Special Edition Using Visual FoxPro 5|Michael P. Antonovich|9780789708854\n1993|Ziff Davis Pr|Pc Magazine Programming Foxpro 2.5/book And Disk|Miriam Liskin|9781562761646\n|Que|Foxpro For Windows Programming By Example With Disk|Que Corporation|9781565296442\n1996|Mis Pr|Teach Yourself...visual Foxpro 3.0 For The Mac|Nelson King|9781558284968\n1992|Pearson Education Ltd.|Pc Magazine Programming Foxpro 2.0/book And Disk|Miriam Liskin|9781562760380\n1992|Microtrend|Foxpro 2 Programming Guide (lance A. Leventhal Microtrend Series)|Michael P. Antonovich|9780915391486\n1993|Sybex Inc.|Foxpro Power Programming Guide And Accompanying Source Code Disk|Lewis Spence|9780782112160\n1993|Que Pub|Using Foxpro 2.6 For Windows/book And Disk (special Edition Using)|Lisa C. Slater and Steven E. Arnott|9781565299924\n1993|Mis Pr|Foxpro 2.5 For Windows: Developing Full-scale Applications/book And Disk|Nelson King|9781558282612\n2002|Hentzenwerke Publishing|MegaFox: 1002 Things You Wanted to Know About Extending Visual FoxPro|Marcia Akins and Andy Kramek and Rick Schummer and Steven P. Dingle|9781930919273\n|M & T Books|Foxpro 2.x: A Developer's Guide : Expert Guidance For Industrial-strength Programming|Jeff Winchell|9781558512887\n2002|Hentzenwerke Publishing|Webrad: Building Database Applications On The Web With Visual Foxpro And Web Connection|Harold Chattaway and Randy Pearson and Whil Hentzen|9781930919075\n1993|Brady|Foxpro Event-driven Programming: How To Build Multi-window Applications/book And Disk|Dick Bard|9781566860994\n1993|Microtrend|Foxpro 2.5 For Windows Programming Guide/book And Disk (lance A. Leventhal Microtrend Series)|Michael P. Antonovich|9780915391806\n1991|M & T Books|Foxpro 2: A Developer's Guide : Expert Guidance For Industrial-strength Programming (dbms Magazine's Database Foundation Series)|Hamilton M. Ahlo and Randy Brown|9781558510838" }, "fp": { "title": "FP", "appeared": 1977, "type": "pl", "creators": [ "John Backus" ], "standsFor": "Functional Programming", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "example": [ "insert-left \\f where \\f:〈x〉 = x\n and \\f:〈x1,x2,...,xn〉 = f:〈\\f:〈x1,...,xn-1〉,xn〉\n and \\f:〈 〉 = unit f" ], "related": [ "apl", "fl", "haskell", "j" ], "summary": "FP (short for function programming) is a programming language created by John Backus to support the function-level programming paradigm. This allows eliminating named variables. The language was introduced in Backus's 1977 Turing Award lecture, \"Can Programming Be Liberated from the von Neumann Style?\", subtitled \"a functional style and its algebra of programs.\" The paper sparked interest in functional programming research, eventually leading to modern functional languages, and not the function-level paradigm Backus had hoped. FP itself never found much use outside of academia. In the 1980s Backus created a successor language, FL, which remained a research project.", "pageId": 899253, "created": 2004, "backlinksCount": 32, "revisionCount": 94, "dailyPageViews": 35, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/FP_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:FP", "hopl": "https://hopl.info/showlanguage.prx?exp=759", "fileType": "text", "wordRank": 8320, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2017|CreateSpace Independent Publishing Platform|Functional-Light JavaScript: Balanced, Pragmatic FP in JavaScript|Simpson, Kyle|9781981672349\n2020||Practical Fp In Scala|Gabriel Volpe|9781714556793" }, "fp2": { "title": "FP2", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/55c376716c859d29eda5d2d94d961614bb694775" ], "country": [ "France" ], "originCommunity": [ "Instituto Politécnico Nacional de Grenoble" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1224", "centralPackageRepositoryCount": 0 }, "fp3": { "title": "fp", "appeared": 2022, "type": "pl", "creators": [ "Joona Piirainen" ], "reference": [ "https://dl.acm.org/doi/10.1145/359576.359579" ], "standsFor": "Functional Programming", "country": [ "Finland" ], "originCommunity": [ "https://japiirainen.com/" ], "hasConditionals": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasLists": { "example": "", "value": true }, "hasFunctionComposition": { "example": "/+∘α(bu + 1):<1,2,3,4,5,6,7,8,9,10>", "value": true }, "githubRepo": { "firstCommit": 2022, "stars": 56, "forks": 0, "description": "a programming language inspired by the fp language described in the 1977 Turing Award lecture by John Backus.", "url": "https://github.com/japiirainen/fp" }, "repoStats": { "firstCommit": 2022, "commits": 80, "committers": 4, "files": 105 }, "centralPackageRepositoryCount": 0 }, "fpgac": { "title": "FpgaC", "appeared": 1996, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "University of Toronto" ], "wikipedia": { "related": [ "handel-c" ], "summary": "FpgaC is a compiler for a subset of the C programming language, which produces digital circuits that will execute the compiled programs. The circuits may use FPGAs or CPLDs as the target processor for reconfigurable computing, or even ASICs for dedicated applications. FpgaC's goal is to be an efficient High Level Language (HLL) for reconfigurable computing, rather than a Hardware Description Language (HDL) for building efficient custom hardware circuits.", "created": 2006, "backlinksCount": 10, "pageId": 4378418, "revisionCount": 25, "dailyPageViews": 6, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/FpgaC" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "fpp": { "title": "Functional PHP Preprocessor", "appeared": 2018, "type": "pl", "creators": [ "Sascha-Oliver Prolic" ], "website": "https://github.com/prolic/fpp", "aka": [ "fpp" ], "fileExtensions": [ "fpp" ], "country": [ "Paraguay" ], "originCommunity": [ "https://www.sasaprolic.com/" ], "writtenIn": [ "php" ], "keywords": [ "namespace", "use", "data", "bool", "string", "float", "int", "enum", "uuid", "guid", "event", "command" ], "githubRepo": { "stars": 283, "forks": 26, "subscribers": 16, "created": 2016, "updated": 2021, "description": "Functional PHP Preprocessor - Generate Immutable Data Types", "url": "https://github.com/prolic/fpp" }, "repoStats": { "firstCommit": 2018, "commits": 614, "committers": 23, "files": 68 } }, "fractran": { "title": "FRACTRAN", "appeared": 1996, "type": "esolang", "creators": [ "John Conway" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge, Sidney Sussex College" ], "wikipedia": { "summary": "FRACTRAN is a Turing-complete esoteric programming language invented by the mathematician John Conway. A FRACTRAN program is an ordered list of positive fractions together with an initial positive integer input n. The program is run by updating the integer n as follows: for the first fraction f in the list for which nf is an integer, replace n by nf repeat this rule until no fraction in the list produces an integer when multiplied by n, then halt. In The Book of Numbers, John Conway and Richard Guy gave a formula for primes in FRACTRAN: ( 17 91 , 78 85 , 19 51 , 23 38 , 29 33 , 77 29 , 95 23 , 77 19 , 1 17 , 11 13 , 13 11 , 15 14 , 15 2 , 55 1 ) {\\displaystyle \\left({\\frac {17}{91}},{\\frac {78}{85}},{\\frac {19}{51}},{\\frac {23}{38}},{\\frac {29}{33}},{\\frac {77}{29}},{\\frac {95}{23}},{\\frac {77}{19}},{\\frac {1}{17}},{\\frac {11}{13}},{\\frac {13}{11}},{\\frac {15}{14}},{\\frac {15}{2}},{\\frac {55}{1}}\\right)} Starting with n=2, this FRACTRAN program generates the following sequence of integers: 2, 15, 825, 725, 1925, 2275, 425, 390, 330, 290, 770, ... (sequence A007542 in the OEIS) After 2, this sequence contains the following powers of 2: 2 2 = 4 , 2 3 = 8 , 2 5 = 32 , 2 7 = 128 , 2 11 = 2048 , 2 13 = 8192 , 2 17 = 131072 , 2 19 = 524288 , … {\\displaystyle 2^{2}=4,\\,2^{3}=8,\\,2^{5}=32,\\,2^{7}=128,\\,2^{11}=2048,\\,2^{13}=8192,\\,2^{17}=131072,\\,2^{19}=524288,\\,\\dots } (sequence A034785 in the OEIS) which are the prime powers of 2.", "pageId": 13408203, "dailyPageViews": 46, "created": 2007, "backlinksCount": 13, "revisionCount": 94, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/FRACTRAN" }, "tryItOnline": "fractran", "esolang": "https://esolangs.org/wiki/Fractran", "fileType": "text", "centralPackageRepositoryCount": 0 }, "frame": { "title": "frame", "appeared": 2013, "type": "pl", "website": "http://frame-lang.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/frame-lang" ], "domainName": { "registered": 2013, "name": "frame-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n10346885|The Frame Machine Languages – DSLs for Software Modeling|http://frame-lang.org/|2015-10-07 16:17:28 UTC|1444234648|iconjack|0|17", "twitter": "https://twitter.com/framelang", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2003|Modular specification of frame properties in JML|10.1002/cpe.713|77|4|Peter Müller and A. Poetzsch-Heffter and G. Leavens|6d31f77f6887ed604dac81ac486b8c8e486b2dcf\n1997|Making design patterns explicit in FACE: a frame work adaptive composition environment|10.1145/267895.267905|52|0|T. Meijler and S. Demeyer and Robert Engel|43f98150b641fb40e815d9bb48036514c8b8bbd8\n1996|An Extensible Frame work for the Development of Coordinated Applications|10.1007/3-540-61052-9_53|20|1|E. Denti and A. Natali and Andrea Omicini and M. Venuti|7dd86b77a4efefc714cdba716021bcf2546594e9\n2000|An Automated CAD System for Progressive Working of Irregular Shaped Metal Products and Lead Frame for Semiconductors|10.1007/S001700070032|9|0|J. C. Choi and Chuntae Kim and Junseok Yoon|fc24914ceb352c93dc18340d562029aa0245a162\n2015|Elasto-Plastic Stability Analysis of the Frame Structures Using the Tangent Modulus Approach|10.4028/www.scientific.net/AMM.725-726.869|5|0|S. Ćorić and S. Brčić and N. Vatin|81b5dc81f3db2b02c176c8df0cae6f2299ff4368\n2019|Application for GPON Frame Analysis|10.3390/ELECTRONICS8060700|5|0|M. Holik and T. Horváth and V. Oujezský|f949ec599ce0abc0c45f8dbc3357087c7192845a\n2008|Research on Technology of Variant Design for Main Frame of Tunnel Boring Machine Based on KBE|10.1109/ICINIS.2008.143|4|0|Zhang Zhi-qiang and Wu Qing-ming and Li Yong and Zong Chi and Zhou Chao|8d0aca736719d9fed88d18797f85ada3f2eb7116\n2017|Semantic Annotation of Software Requirements with Language Frame|10.21742/IJSESD.2017.4.2.01|4|0|Yeongsu Kim and Seung-Woo Lee and M. Dollmann and Michaela Geierhos|0ae55d4c089da1928db4bffd4aba6deefbbe69fc\n2010|The frame of DFL programming language|10.1109/FSKD.2010.5569650|4|0|Xiaofang Zhao|9bb432d61553ade1e6ac0b0bbf5157e55132ced5\n2016|Nonlinear stability analysis of the frame structures|10.5937/GRMK1603027C|3|1|Ćorić Stanko and Brčić Stanko|ad33e2a062e31bb41ac20306f077543451dd0443\n2009|LAIR: A Language for Automated Semantics-Aware Text Sanitization Based on Frame Semantics|10.1109/ICSC.2009.79|3|0|Steffen Hedegaard and Søren Houen and J. Simonsen|6ba2f4d586a8acd8e08070029dc28c5fa39c3eec\n1998|Dynamic programming as frame for efficient parsing|10.1109/SCCC.1998.730784|3|0|M. Ferro and Miguel A. Alonso and D. Souto|b5ba21c2f04812d4d97401f6742b1a0c6cacdd97" }, "framework-office-suite": { "title": "Framework office suite", "appeared": 1983, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Forefront Corporation" ], "wikipedia": { "related": [ "assembly-language", "c", "lisp", "dbase", "isbn" ], "summary": "Framework, launched in 1984, was the first office suite to run on the PC 8086 with the MS-DOS operating system. ValDocs, an even earlier integrated suite, actually comparable to the original Macintosh of 1984 and Apple Lisa of 1982 was produced by Epson, a complete integrated work station based on the previous Zilog Z80 processor and CP/M operating system with GUI and \"WYSIWYG\" typography on the monitor and printing. Framework offered all this however in the first all-in-one package to run on any PC platform. It was preceded by a few months by its close rival Lotus Symphony. Unlike other integrated products Framework was not created as \"plug-in\" modules with similar look and feel but as a single windowing workspace representing a desktop metaphor that could manage and outline \"Frames\" sharing a common underlying format. The initial release included about a dozen or so frame types (identified by a FRED function, @frametype). Frame types included containers which could be filled up with other frames, empty frames which could become other type of frames based on user input, formulas embedded in them or program output targeting them, word processor frames, flat-database frames and spreadsheet as well as graphic frames. Later versions included a frame type that can hold compiled executable code and the current version include an external type handled by separate applications running on the host operating system. Framework built-in interpreter, the FRED (Frame Editor) computer language, was based on Lisp and included an Eval function. It applied to all text and frame type across the product. Framework could be considered a predecessor to the present GUI window metaphor as well as integrated interpreters. The spreadsheet program was superior in its day, offering true 3D capability, where spreadsheets could form outline which can be \"opened\" to reveal a separate spreadsheet as well as other frame types—a feat of sheer convenient function never again seen and further enhanced in much later versions. Robert Carr and Marty Mazner founded Forefront Corporation to develop Framework in 1983. In July of that year, they approached Ashton-Tate to provide the capital and to later market the product. Together with a team of six other individuals, Carr and company released the original Framework. The product proved successful enough that in 1985, Ashton-Tate bought Forefront, a year sooner than planned. The original team, now working for Ashton-Tate, continued to enhance the product producing Framework II (1985), Framework III (1988-1989) and finally in 1991, the last Ashton-Tate's version, Framework IV. Beginning with Framework II, the company also produced Framework II Runtime and Framework II Developer's Toolkit. These products allowed application developers to create business applications using the built-in FRED programming language. Although Ashton-Tate humorously advertised that \"Lotus uses Framework\", Framework failed to gain more than a fraction of the market share needed to become a workplace standard. Lotus 1-2-3 was able to successfully capture most of the spreadsheet market and after a number of setbacks regarding Ashton-Tate's flag product, dBASE, Borland bought Ashton-Tate and later sold Framework to Selections & Functions, Inc. Present versions include the FrameworkPascal compiler which extend Framework with Windows API. Framework works on most versions of Microsoft Windows. Framework 7 was the last version which can be run on Windows 95/98/ME or on DOS. Framework 8 and 9 only run on Windows XP. Beginning with Framework V (Framework 5), Selections and Functions introduced only a few features - mainly features required to prevent the office suite from becoming out-of-date. For example, Framework VII (Framework 7) introduced long file names, the Euro symbol and the ability to display pictures in Framework. Framework VIII (Framework 8) introduced the ability to display JPEG and .BMP files and to load such files into Framework databases. Of particular importance, all of the Selections and Functions' versions of Framework added the ability to share \"cut and paste\" (memory buffer data) between Windows and Framework. For detailed feature lists and screen shots see the Framework homepage listed below. Selections and Functions is nevertheless still selling Framework - although no price is available publicly. Programmers at Work (ISBN 0-914845-71-3) credits Robert Carr as the designer and principal developer of Framework.", "created": 2003, "backlinksCount": 16, "pageId": 326113, "revisionCount": 76, "dailyPageViews": 16, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Framework_%28office_suite%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2057", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "fran": { "title": "FRAN", "appeared": 1997, "type": "pl", "description": "Dialect of Haskell for interactive programming of animation.", "country": [ "United States" ], "originCommunity": [ "Microsoft", "Yale University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3754", "semanticScholar": "" }, "frank-lang": { "title": "Frank", "appeared": 2017, "type": "pl", "creators": [ "Sam Lindley", "Conor McBride", "Craig McLaughlin", "Lukas Convent" ], "website": "https://github.com/frank-lang/frank/", "fileExtensions": [ "fk" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/frank-lang/" ], "githubRepo": { "stars": 229, "forks": 8, "subscribers": 25, "created": 2016, "updated": 2022, "description": "Franck compiler", "url": "https://github.com/frank-lang/frank/" }, "repoStats": { "firstCommit": 2016, "commits": 320, "committers": 9, "files": 168 } }, "frank": { "title": "FRANK", "appeared": 1985, "type": "pl", "reference": [ "https://dl.acm.org/doi/abs/10.1145/988304.988309" ], "country": [ "Canada" ], "originCommunity": [ "University of Manitoba" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1148", "wordRank": 2537, "isbndb": "" }, "free-pascal": { "title": "Free Pascal", "appeared": 1997, "type": "pl", "country": [ "Various" ], "originCommunity": [ "https://www.delorie.com/bin/cvsweb.cgi/djgpp/" ], "hasOperatorOverloading": { "example": "", "value": true }, "wikipedia": { "related": [ "object-pascal", "assembly-language", "pascal", "turbo-pascal", "delphi", "objective-c", "linux", "powerpc", "arm", "sparc", "x86-isa", "ios", "elf", "freebsd", "solaris", "android", "atmel-avr", "jvm", "mips", "ipf", "visual-studio-code-editor", "morfik" ], "summary": "Free Pascal Compiler (FPC) is a compiler for the closely related programming language dialects, Pascal and Object Pascal. It is free software released under the GNU General Public License, with exception clauses that allow for static linking against its runtime libraries and packages for any purpose in combination with any other software license. It supports its own Object Pascal dialect as well as the dialects of several other Pascal family compilers to a certain extent, including those of Turbo Pascal, Delphi, and some historical Macintosh compilers. The dialect is selected on a per-unit (module) basis, and more than one dialect can be used per program. It follows a write once, compile anywhere philosophy, and is available for many CPU architectures and operating systems (see Targets). It supports inline assembly language and includes an internal assembler capable of parsing several dialects such as AT&T and Intel style. Separate projects exist to facilitate developing cross-platform graphical user interface (GUI) applications, the most prominent one being the Lazarus integrated development environment (IDE).", "created": 2004, "backlinksCount": 255, "pageId": 638429, "revisionCount": 749, "dailyPageViews": 127, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Free_Pascal" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "freebasic": { "title": "FreeBASIC", "appeared": 2004, "type": "pl", "creators": [ "Andre Victor" ], "country": [ "Various" ], "originCommunity": [ "The FreeBASIC Development Team" ], "hasPointers": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "wikipedia": { "example": [ "Dim As Vector Ptr player = New Vector()\n\n*player = Type(100, 100)\nPrint player->getX\nPrint player->getY\n\nDelete player\n\nSleep 'Prevents the program window from closing instantly" ], "related": [ "freebsd", "linux", "quickbasic", "c", "basic", "opengl" ], "summary": "FreeBASIC is a multiplatform, free/open source (GPL) BASIC compiler for Microsoft Windows, protected-mode MS-DOS (DOS extender), Linux, FreeBSD and Xbox. The Xbox version is no longer maintained.According to its official Web site, FreeBASIC provides syntax compatibility with programs originally written in Microsoft QuickBASIC (QB). Unlike QuickBASIC, however, FreeBASIC is a command line only compiler, unless users manually install an external integrated development environment (IDE) of their choice. IDEs specifically made for FreeBASIC include FBide and FbEdit.", "created": 2005, "backlinksCount": 157, "pageId": 1443566, "revisionCount": 468, "dailyPageViews": 156, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/FreeBASIC" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "bi", "bas" ], "aceMode": "text", "codemirrorMode": "vb", "codemirrorMimeType": "text/x-vb", "tmScope": "source.vbnet", "aliases": [ "fb" ], "repos": 535, "id": "FreeBasic" }, "githubBigQuery": { "repos": 41, "users": 41, "id": "FreeBasic" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:FreeBASIC", "centralPackageRepositoryCount": 0, "isbndb": "" }, "freebsd": { "title": "FreeBSD", "appeared": 1993, "type": "os", "country": [ "United States" ], "originCommunity": [ "The FreeBSD Project" ], "wikipedia": { "dailyPageViews": 885, "url": "https://en.wikipedia.org/wiki/FreeBSD" }, "centralPackageRepositoryCount": 0 }, "freefem": { "title": "Freefem", "appeared": 2000, "type": "pl", "website": "https://freefem.org/", "country": [ "France" ], "originCommunity": [ "Université Pierre et Marie Curie", "Université Paris City" ], "domainName": { "registered": 2000, "awisRank": { "2022": 547407 }, "name": "freefem.org" }, "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "nuEdge", "N", "rfind", "endl", "ARGV", "bordermeasure", "BoundaryEdge", "precision", "fixed", "mpiBAND", "ndof", "mpiLAND", "mpiBXOR", "mpiLOR", "showbase", "qf1pE", "nt", "z", "qfnbpE", "InternalEdge", "P", "qf1pTlump", "n", "false", "m", "imax", "nuTriangle", "version", "qfV2", "true", "length", "qf1pElump", "adj", "nv", "ndofK", "volume", "x", "mpiMIN", "UMFPACK", "qfV5", "sum", "binary", "showpos", "qf4pE", "searchMethod", "mpiCommWorld", "area", "qf2pT4P1", "lenEdge", "quantile", "CG", "min", "default", "noshowpos", "qf2pE", "y", "Crout", "notaregion", "find", "nTonEdge", "max", "tellp", "whoinElement", "re", "FILE", "qf5pT", "measure", "qf5pE", "scientific", "mpisize", "qf9pT", "cout", "im", "qfV1", "qf3pE", "mpirank", "imin", "label", "hTriangle", "pi", "qf2pT", "diag", "qf1pT", "l1", "mpiPROD", "LU", "qf7pT", "unused", "flush", "edgeOrientation", "mpiSUM", "good", "mpiLXOR", "linfty", "mpiMAX", "sparsesolver", "ffind", "l2", "region", "mpiUndefined", "mpiAnySource", "be", "append", "qfV1lump", "verbosity", "Cholesky", "LINE", "GMRES", "setw", "noshowbase", "cin", "nbe" ], "pygmentsHighlighter": { "filename": "freefem.py", "fileExtensions": [ "edp" ], "id": "Freefem" } }, "freemarker": { "title": "FreeMarker", "appeared": 2000, "type": "template", "aka": [ "FreeMarker2" ], "country": [ "Various" ], "originCommunity": [ "https://freemarker.apache.org/mailing-lists.html" ], "wikipedia": { "example": [ "\n\n

Hello Joe! You have the following messages:\n

Tim: Please don't forget to bring the conference papers!

\n

Cindy: Can you give me a visit this afternoon?

\n

Richard: Don't forget the papers this time!

\n

\n\n" ], "related": [ "java", "html", "java-server-pages", "apache-velocity", "thymeleaf" ], "summary": "FreeMarker is a free Java-based template engine, originally focusing on dynamic web page generation with MVC software architecture. However, it is a general purpose template engine, with no dependency on servlets or HTTP or HTML, and is thus often used for generating source code, configuration files or e-mails.", "backlinksCount": 6, "pageId": 1866752, "created": 2005, "revisionCount": 123, "dailyPageViews": 31, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Apache_FreeMarker" }, "githubLanguage": { "fileExtensions": [ "ftl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "ftl", "tmScope": "text.html.ftl", "aliases": [ "ftl" ], "repos": 5703, "id": "FreeMarker" }, "githubBigQuery": { "repos": 3564, "users": 3002, "id": "FreeMarker" }, "monaco": "freemarker2", "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2015, "committerCount": 7, "commitCount": 25, "sampleCount": 2, "example": [ "<#ftl strip_text=true />\n\n<#macro page title>\n \n \n \n ${title}\n <@metaTags />\n \n \n <#nested />\n <@footer />\n \n \n\n\n\n<#---\n Default meta tags\n-->\n<#macro metaTags>\n <#compress>\n \n \n \n \n \n\n\n<#macro footer>\n

This page is using FreeMarker v${.version}

\n\n" ], "url": "https://github.com/freemarker/FreeMarker.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "frege": { "title": "Frege", "appeared": 2011, "type": "pl", "website": "https://github.com/Frege/frege", "documentation": [ "http://www.frege-lang.org/doc/fregedoc.html" ], "country": [ "Switzerland and Germany and United States" ], "originCommunity": [ "https://github.com/Frege" ], "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "{- A comment\n-}", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "{-", "-}" ] ], "githubRepo": { "firstCommit": 2011, "stars": 3546, "forks": 146, "subscribers": 154, "created": 2012, "updated": 2022, "description": "Frege is a Haskell for the JVM. It brings purely functional programing to the Java platform.", "issues": 45, "url": "https://github.com/frege/frege" }, "repoStats": { "firstCommit": 2011, "commits": 3352, "committers": 50, "files": 409 }, "wikipedia": { "example": [ "{-- \n This program displays the\n current time on standard output\n every other second.\n -}\n \nmodule examples.CommandLineClock where\n\ndata Date = native java.util.Date where\n native new :: () -> IO (MutableIO Date) -- new Date()\n native toString :: Mutable s Date -> ST s String -- d.toString()\n\n--- 'IO' action to give us the current time as 'String'\ncurrent :: IO String\ncurrent = do\n d <- Date.new () -- reads system timer, hence IO\n d.toString\n\nmain args = \n forever do\n current >>= print -- print formatted date\n print \"\\r\" -- followed by carriage return\n stdout.flush -- make sure it's shown\n Thread.sleep 999L -- wait 0.999 seconds" ], "related": [ "haskell", "jvm", "java", "java-bytecode", "linux", "unix", "eclipse-editor" ], "summary": "Frege is a non-strict, purely functional programming language for the Java virtual machine in the spirit of Haskell. It is considered a Haskell dialect or simply \"a\" Haskell for the Java virtual machine. Frege has a strong static type system with type inference. Higher rank types are supported, though type annotations are required for that. Frege programs are compiled to Java bytecode and run in a Java virtual machine. Existing Java classes and methods can be used seamlessly from Frege after their types have been properly declared. The language was designed by Ingo Wechsung, who named it after the German mathematician, logician and philosopher Gottlob Frege. (This language is unrelated to the Frege Program Prover.)", "pageId": 35111228, "dailyPageViews": 31, "backlinksCount": 11, "appeared": 2011, "fileExtensions": [ "fr" ], "url": "https://en.wikipedia.org/wiki/Frege_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "fr" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "haskell", "tmScope": "source.haskell", "repos": 223, "id": "Frege" }, "githubBigQuery": { "repos": 160, "users": 142, "id": "Frege" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 13, "commitCount": 463, "sampleCount": 4, "example": [ "{-- \n This program displays the\n current time on stdandard output\n every other second.\n -}\n \nmodule examples.CommandLineClock where\n\ndata Date = native java.util.Date where\n native new :: () -> IO (MutableIO Date) -- new Date()\n native toString :: Mutable s Date -> ST s String -- d.toString()\n\n--- 'IO' action to give us the current time as 'String'\ncurrent :: IO String\ncurrent = do\n d <- Date.new ()\n d.toString\n\n{- \n \"java.lang.Thread.sleep\" takes a \"long\" and\n returns nothing, but may throw an InterruptedException.\n This is without doubt an IO action.\n \n public static void sleep(long millis)\n throws InterruptedException\n \n Encoded in Frege:\n - argument type long Long\n - result void ()\n - does IO IO ()\n - throws ... throws ....\n \n-}\n-- .... defined in frege.java.Lang\n-- native sleep java.lang.Thread.sleep :: Long -> IO () throws InterruptedException\n\n \nmain args = \n forever do\n current >>= print\n print \"\\r\"\n stdout.flush\n Thread.sleep 999\n " ], "url": "https://github.com/atom-haskell/language-haskell" }, "projectEuler": { "memberCount": { "2019": 2, "2022": 3 }, "id": "Frege" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Frege", "twitter": "https://twitter.com/fregelang", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "frenetic": { "title": "Frenetic", "appeared": 2011, "type": "pl", "description": "Frenetic: a network programming language", "reference": [ "https://www.semanticscholar.org/paper/Frenetic%3A-a-network-programming-language-Foster-Harrison/089b10645ee63cd9c5bb4ab661141dd813408e15" ], "country": [ "United States" ], "originCommunity": [ "Cornell University", "Princeton University" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "fresco": { "title": "Fresco", "appeared": 1993, "type": "pl", "reference": [ "https://dl.acm.org/doi/10.5555/187621.187646" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1730", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "frink": { "title": "Frink", "appeared": 2001, "type": "pl", "website": "https://frinklang.org/", "country": [ "United States" ], "originCommunity": [ "https://futureboy.us/" ], "domainName": { "registered": 2014, "awisRank": { "2017": 6486149, "2022": 6494861 }, "name": "frinklang.org" }, "hasComments": { "example": "", "value": true }, "hasUnitsOfMeasure": { "example": "10 feet 12 feet 8 feet -> gallons", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "jvm", "java" ], "summary": "Frink is a computer programming language. It is, according to creator of the language, \"designed to make physical calculations simple, to help ensure that answers come out right, and to make a tool that's really useful in the real world. It tracks units of measure (feet, meters, kilograms, watts, etc.) through all calculations, allowing you to mix units of measure transparently, and helps you easily verify that your answers make sense.\"", "pageId": 54431028, "dailyPageViews": 8, "created": 2017, "backlinksCount": 6, "revisionCount": 11, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Frink_(programming_language)" }, "projectEuler": { "memberCount": { "2019": 14, "2022": 14 }, "id": "Frink" }, "helloWorldCollection": [ "// Hello World in Frink\n\nprintln[\"Hello World!\"]\n" ], "leachim6": { "filepath": "f/Frink.frink", "fileExtensions": [ "frink" ], "example": [ "println[\"Hello World\"]\n" ], "id": "Frink" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Frink", "twitter": "https://twitter.com/frinklang", "fileType": "text", "centralPackageRepositoryCount": 0 }, "frost": { "title": "Frost", "appeared": 2017, "type": "pl", "creators": [ "Ethan Nicholas" ], "website": "https://www.frostlang.org/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/ethannicholas/Frost/issues" ], "domainName": { "registered": 2019, "name": "frostlang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "Console.printLine" ] ], "example": [ "========================================================\nSimple version of the Unix `head` utility. Reads a file\nand outputs the first `count` lines from it to the\nstandard output stream.\n\n@param path the file to read\n@param count the number of lines to display\n========================================================\nmethod head(path:File, count:Int) {\n try {\n path.lines()[..count].apply(Console.printLine)\n }\n fail(error) {\n abort(error.message)\n }\n}\n\nmethod abort(msg:String) {\n Console.printLine(msg)\n System.exit(1)\n}\n\nmethod main(args:ListView) {\n if args.count != 3 {\n abort(\"usage: head \")\n }\n def count := args[2].asInt\n if count == null {\n abort(\"error: '\\{args[2]}' is not an integer\")\n }\n head(File(args[1]), count)\n}" ], "githubRepo": { "firstCommit": 2017, "stars": 36, "forks": 3, "subscribers": 3, "created": 2014, "updated": 2022, "description": "Frost is a powerful, general purpose, multi-paradigm programming language", "issues": 0, "url": "https://github.com/ethannicholas/Frost" }, "repoStats": { "firstCommit": 2017, "commits": 465, "committers": 3, "files": 1259 } }, "frtime": { "title": "frtime", "appeared": 2004, "type": "pl", "website": "https://docs.racket-lang.org/frtime/", "reference": [ "https://cs.brown.edu/people/ghcooper/thesis.pdf" ], "country": [ "United States" ], "originCommunity": [ "Brown University" ] }, "fructure-editor": { "title": "fructure-editor", "appeared": 2017, "type": "pl", "website": "https://fructure-editor.tumblr.com/", "country": [ "United States and United Kingdom" ], "originCommunity": [ "https://github.com/disconcision/fructure/graphs/contributors" ], "githubRepo": { "firstCommit": 2017, "stars": 354, "forks": 6, "subscribers": 9, "created": 2017, "updated": 2022, "description": "a structured interaction engine 🗜️ ⚗️", "issues": 16, "url": "https://github.com/disconcision/fructure" }, "repoStats": { "firstCommit": 2017, "commits": 310, "committers": 6, "files": 107 } }, "fsl": { "title": "Finite State Language", "appeared": 2016, "type": "pl", "description": "Finite State Language, or FSL (pronounced \"fossil,\") is a programming language to make complex Finite State Machines easy to create and maintain. Finite State Machines can help make your code simpler, easier to test, more provable, and easier to reason about.", "webRepl": [ "https://stonecypher.github.io/jssm-viz-demo/graph_explorer.html" ], "reference": [ "https://github.com/StoneCypher/jssm" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/StoneCypher/jssm/issues" ], "related": [ "dot" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "machine_name: \"Traffic light\";\n\nflow: down;\n\narrange [Green Yellow];\n\nOff 'Enable' -> Red;\n Red 'Next' => Green 'Next' => Yellow 'Next' => Red;\n\n[Red Yellow Green] ~> Off;\n\n// visual styling\n\nstate Red : { background-color: pink; corners: rounded; };\nstate Yellow : { background-color: lightyellow; corners: rounded; };\nstate Green : { background-color: lightgreen; corners: rounded; };\n\nstate Off : {\n background-color : steelblue;\n text-color : white;\n shape : octagon;\n linestyle : dashed;\n};" ] }, "fstar": { "title": "F*", "appeared": 2014, "type": "pl", "description": "F* is a dependently typed programming language and proof assistant. In practice, rather than a single language, the F* ecosystem is also a collection of domain-specific languages (DSLs). A common use of F* is to embed within it programming languages at different levels of abstraction or for specific programming tasks, and for the embedded language to be engineered with domain-specific reasoning, proof automation, and compilation backends.", "website": "https://www.fstar-lang.org/", "documentation": [ "http://www.fstar-lang.org/tutorial/" ], "country": [ "Unknown" ], "originCommunity": [ "Microsoft Research" ], "domainName": { "registered": 2014, "awisRank": { "2022": 3034670 }, "name": "fstar-lang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "printToken": [ [ "FStar.IO.print_string" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "attributes", "noeq", "unopteq", "andbegin", "by", "default", "effect", "else", "end", "ensures", "exception", "exists", "false", "forall", "fun", "function", "if", "in", "include", "inline", "inline_for_extraction", "irreducible", "logic", "match", "module", "mutable", "new", "new_effect", "noextract", "of", "open", "opaque", "private", "range_of", "reifiable", "reify", "reflectable", "requires", "set_range_of", "sub_effect", "synth", "then", "total", "true", "try", "type", "unfold", "unfoldable", "val", "when", "with", "not" ], "githubRepo": { "stars": 2263, "forks": 216, "subscribers": 84, "created": 2014, "updated": 2022, "firstCommit": 2014, "description": "A Proof-oriented Programming Language", "issues": 407, "url": "https://github.com/FStarLang/FStar" }, "repoStats": { "firstCommit": 2014, "commits": 39543, "committers": 205, "files": 5255 }, "wikipedia": { "related": [ "linux", "f-sharp", "ocaml", "standard-ml", "ml", "c", "javascript" ], "summary": "F* (pronounced F star) is a functional programming language inspired by ML and aimed at program verification. Its type system includes dependent types, monadic effects, and refinement types. This allows expressing precise specifications for programs, including functional correctness and security properties. The F* type-checker aims to prove that programs meet their specifications using a combination of SMT solving and manual proofs. Programs written in F* can be translated to OCaml, F#, and C for execution. Previous versions of F* could also be translated to JavaScript. The latest version of F* is written entirely in a common subset of F* and F#, and bootstraps in OCaml and F#. It is open source (under the Apache 2.0 License) and is under active development on GitHub.", "pageId": 38420593, "dailyPageViews": 53, "created": 2013, "backlinksCount": 21, "revisionCount": 50, "appeared": 2016, "fileExtensions": [ "fst" ], "url": "https://en.wikipedia.org/wiki/F*_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "fst", "fsti" ], "type": "programming", "aceMode": "text", "tmScope": "source.fstar", "aliases": [ "fstar" ], "repos": 250, "id": "F*" }, "githubBigQuery": { "repos": 31, "users": 28, "id": "F*" }, "pygmentsHighlighter": { "filename": "ml.py", "fileExtensions": [ "fst", "fsti" ], "id": "FStar" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 8, "commitCount": 28, "url": "https://github.com/FStarLang/atom-fstar" }, "leachim6": { "filepath": "f/FStar.fst", "fileExtensions": [ "fst" ], "example": [ "module Hello\n\nlet main = FStar.IO.print_string \"Hello World\\n\"" ], "id": "FStar" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Verified low-level programming embedded in F*|10.1145/3110261|104|9|Jonathan Protzenko and J. Zinzindohoué and Aseem Rastogi and T. Ramananandro and Peng Wang and Santiago Zanella Béguelin and Antoine Delignat-Lavaud and Catalin Hritcu and K. Bhargavan and C. Fournet and N. Swamy|56d2fcb2befda305a57b83e7f2e3d4865ee766b2" }, "ftp": { "title": "FTP", "appeared": 1971, "type": "protocol", "documentation": [ "https://www.rfc-editor.org/rfc/rfc959" ], "standsFor": "File Transfer Protocol", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "http", "smtp", "tls", "tcp", "udp", "unix", "linux", "ascii" ], "summary": "The File Transfer Protocol (FTP) is the standard network protocol used for the transfer of computer files between a client and server on a computer network. FTP is built on a client-server model architecture and uses separate control and data connections between the client and the server. FTP users may authenticate themselves with a clear-text sign-in protocol, normally in the form of a username and password, but can connect anonymously if the server is configured to allow it. For secure transmission that protects the username and password, and encrypts the content, FTP is often secured with SSL/TLS (FTPS). SSH File Transfer Protocol (SFTP) is sometimes also used instead; it is technologically different. The first FTP client applications were command-line programs developed before operating systems had graphical user interfaces, and are still shipped with most Windows, Unix, and Linux operating systems. Many FTP clients and automation utilities have since been developed for desktops, servers, mobile devices, and hardware, and FTP has been incorporated into productivity applications, such as web page editors.", "pageId": 53289, "dailyPageViews": 2685, "created": 2002, "backlinksCount": 1280, "revisionCount": 2802, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/File_Transfer_Protocol" }, "subreddit": [ { "memberCount": { "2022": 471 }, "url": "https://reddit.com/r/ftp" } ], "fileType": "na", "wordRank": 4060, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "fun": { "title": "Fun", "appeared": 2010, "type": "pl", "creators": [ "Marcus Westin" ], "description": "A programming language for the realtime web.", "website": "http://marcuswest.in/essays/fun-intro/", "country": [ "United States" ], "originCommunity": [ "http://marcuswest.in/" ], "example": [ "// Fun code\nlet user = Session.User\nlet myTasks = Query({ type: \"task\", owner: user.id })\n

\"Hello \" user.name \", these are your tasks matey:\"

\nfor (task in myTasks) {\n
\n \n if (task.completed) {\n \"Completed!\"\n } else {\n \n }\n
\n}\nlet markComplete = handler(task) {\n task.completed = true\n}\n

\"Create a new task\"

\n\n" ], "githubRepo": { "firstCommit": 2020, "stars": 7059, "forks": 274, "subscribers": 75, "created": 2020, "updated": 2022, "description": " htmx - high power tools for HTML", "issues": 114, "url": "https://github.com/bigskysoftware/htmx" }, "repoStats": { "firstCommit": 2020, "commits": 2275, "committers": 206, "files": 5166 } }, "http-2": { "title": "HTTP/2", "appeared": 2015, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Google", "Mozilla" ], "wikipedia": { "summary": "HTTP/2 (originally named HTTP/2.0) is a major revision of the HTTP network protocol used by the World Wide Web. It was derived from the earlier experimental SPDY protocol, originally developed by Google. HTTP/2 was developed by the Hypertext Transfer Protocol working group httpbis (where bis means \"second\") of the Internet Engineering Task Force. HTTP/2 is the first new version of HTTP since HTTP 1.1, which was standardized in RFC 2068 in 1997. The Working Group presented HTTP/2 to IESG for consideration as a Proposed Standard in December 2014, and IESG approved it to publish as Proposed Standard on February 17, 2015. The HTTP/2 specification was published as RFC 7540 in May 2015.The standardization effort was supported by Chrome, Opera, Firefox, Internet Explorer 11, Safari, Amazon Silk, and Edge browsers. Most major browsers had added HTTP/2 support by the end of 2015.According to W3Techs, as of February 2019, 33.1% of the top 10 million websites supported HTTP/2.HTTP/3 is the proposed successor (Internet Draft) to HTTP/2, that builds on it.", "backlinksCount": 409, "pageId": 35651791, "dailyPageViews": 1031, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/HTTP/2" } }, "http-3": { "title": "HTTP/3", "appeared": 2018, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Akamai" ], "wikipedia": { "summary": "HTTP/3 is the upcoming third major version of the Hypertext Transfer Protocol used to exchange binary information on the World Wide Web. HTTP/3 is based on previous RFC draft \"Hypertext Transfer Protocol (HTTP) over QUIC\". QUIC is an experimental transport layer network protocol initially developed by Google. On 28 October 2018 in a mailing list discussion, Mark Nottingham, Chair of the IETF HTTP and QUIC Working Groups, made the official request to rename HTTP-over-QUIC as HTTP/3 to \"clearly identify it as another binding of HTTP semantics to the wire protocol ... so people understand its separation from QUIC\" and pass its development from the QUIC Working Group to the HTTP Working Group after finalizing and publishing the draft. In the subsequent discussions that followed and stretched over several days, Nottingham's proposal was accepted by fellow IETF members, who in November 2018 gave their official seal of approval that HTTP-over-QUIC become HTTP/3.", "backlinksCount": 288, "pageId": 59036215, "dailyPageViews": -1, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/HTTP/3" } }, "http": { "title": "HTTP", "appeared": 1989, "type": "protocol", "documentation": [ "https://www.w3.org/Protocols/rfc2616/rfc2616.html" ], "country": [ "United States" ], "originCommunity": [ "The World Wide Web Consortium" ], "funFact": "http://http://http://@http://http://?http://#http:// is a legitimate URL", "wikipedia": { "example": [ "HTTP/1.1 200 OK\nDate: Mon, 23 May 2005 22:38:34 GMT\nContent-Type: text/html; charset=UTF-8\nContent-Encoding: UTF-8\nContent-Length: 138\nLast-Modified: Wed, 08 Jan 2003 23:11:55 GMT\nServer: Apache/1.3.3.7 (Unix) (Red-Hat/Linux)\nETag: \"3f80f-1b6-3e1cb03b\"\nAccept-Ranges: bytes\nConnection: close\n\n\n\n An Example Page\n\n\n Hello World, this is a very simple HTML document.\n\n" ], "related": [ "ftp", "smtp", "tls", "tcp", "udp", "url", "html", "css", "ascii", "gzip", "rest", "isbn" ], "summary": "The Hypertext Transfer Protocol (HTTP) is an application protocol for distributed, collaborative, and hypermedia information systems. HTTP is the foundation of data communication for the World Wide Web. Hypertext is structured text that uses logical links (hyperlinks) between nodes containing text. HTTP is the protocol to exchange or transfer hypertext. Development of HTTP was initiated by Tim Berners-Lee at CERN in 1989. Standards development of HTTP was coordinated by the Internet Engineering Task Force (IETF) and the World Wide Web Consortium (W3C), culminating in the publication of a series of Requests for Comments (RFCs). The first definition of HTTP/1.1, the version of HTTP in common use, occurred in RFC 2068 in 1997, although this was obsoleted by RFC 2616 in 1999 and then again by the RFC 7230 family of RFCs in 2014. A later version, the successor HTTP/2, was standardized in 2015, and is now supported by major web servers and browsers over TLS using ALPN extension where TLS 1.2 or newer is required.", "pageId": 13443, "dailyPageViews": 6702, "created": 2001, "backlinksCount": 1996, "revisionCount": 4080, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol" }, "githubLanguage": { "fileExtensions": [ "http" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "codemirrorMode": "http", "codemirrorMimeType": "message/http", "tmScope": "source.httpspec", "repos": 0, "id": "HTTP" }, "codeMirror": "http", "pygmentsHighlighter": { "filename": "textfmts.py", "id": "HTTP" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 1, "commitCount": 3, "url": "https://github.com/samsalisbury/Sublime-HTTP" }, "leachim6": { "filepath": "h/HTTP.py", "fileExtensions": [ "py" ], "example": [ "import http.server\nimport socketserver\nfrom http import HTTPStatus\n\n\nclass Handler(http.server.SimpleHTTPRequestHandler):\n def do_GET(self):\n self.send_response(HTTPStatus.OK)\n self.end_headers()\n self.wfile.write(b'Hello World')\n\n\nhttpd = socketserver.TCPServer(('', 8000), Handler)\nhttpd.serve_forever()" ], "id": "HTTP" }, "indeedJobs": { "2022": 771996, "query": "http developer" }, "fileType": "na", "wordRank": 4663, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nHTTP Developer's Handbook|2003|Chris Shiflett|1015229|3.78|18|1\nWhat Every Web Developer Should Know About HTTP (OdeToCode, #1)|2012|K. Scott Allen|26214178|4.07|351|29\nHTTP Programming Recipes for C# Bots|2007|Jeff Heaton|2344177|3.25|8|1", "isbndb": "year|publisher|title|authors|isbn13\n2013|Apress|Pro ASP.NET Web API: HTTP Web Services in ASP.NET (Expert's Voice in .NET)|Uurlu, Ali and Zeitler, Alexander and Kheyrollahi, Ali|9781430247265\n2018|Packt Publishing|Nginx HTTP Server: Harness the power of Nginx to make the most of your infrastructure and serve pages faster than ever before, 4th Edition|Fjordvald, Martin Bjerretoft and Nedelcu, Clement|9781788621977\n2013|Packt Publishing|Nginx HTTP Server Second Edition|Nedelcu, Clement|9781782162339\n2007-04-03T00:00:01Z|Heaton Research, Inc.|HTTP Programming Recipes for C# Bots|Heaton, Jeff|9780977320677\n2017|Packt Publishing|Mastering ASP.NET Web API: Build powerful HTTP services and make the most of the ASP.NET Core Web API platform|Pattankar, Mithun and Hurbuns, Malendra|9781786469380\n2017|Packt Publishing|Java 9 Programming Blueprints: Master features like Modular Programming, Java http 2.0, and REPL by building numerous applications|Lee, Jason|9781786460196\n2017|Packt Publishing|Java 9 Programming Blueprints: Master features like Modular Programming, Java http 2.0, and REPL by building numerous applications|Lee, Jason|9781786464446\n18-11-2015|Packt Publishing|Nginx HTTP Server|Clement Nedelcu|9781785285912\n2007|Heaton Research Incorporated|Http Programming Recipes For Java Bots|Jeff Heaton|9780977320660", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2020|Research of MQTT, CoAP, HTTP and XMPP IoT Communication protocols for Embedded Systems|10.1109/ET50336.2020.9238208|8|0|Neven Nikolov|09a8411e2926d5ed9245666df874d6af2fb0c787\n2019|Implementing ICN over P4 in HTTP Scenario|10.1109/HotICN48464.2019.9063219|3|0|Weiwei Feng and Xiaobin Tan and Yang Jin|88bb0732d3155a14f93c721f4db45eea260e3c3e" }, "httplang": { "title": "httplang", "appeared": 2015, "type": "pl", "country": [ "United States and Kazakhstan" ], "originCommunity": [ "https://github.com/f-prime" ], "githubRepo": { "firstCommit": 2015, "stars": 504, "forks": 26, "subscribers": 19, "created": 2015, "updated": 2021, "description": "A scripting langauge to do HTTP routines. ", "issues": 2, "url": "https://github.com/Max00355/HTTPLang" }, "repoStats": { "firstCommit": 2015, "commits": 49, "committers": 11, "files": 21 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9598443|Show HN: HTTPLang – a scripting language for making HTTP requests|2015-05-25 02:58:33 UTC|1432522713|max0563|8|44" }, "huginn": { "title": "huginn", "appeared": 2015, "type": "pl", "creators": [ "Marcin Konarski" ], "website": "https://huginn.org/", "country": [ "Poland" ], "originCommunity": [ "https://github.com/AmokHuginnsson/huginn/issues" ], "domainName": { "registered": 2017, "name": "huginn.org" }, "githubRepo": { "firstCommit": 2015, "stars": 41, "subscribers": 6, "created": 2015, "updated": 2022, "description": "Programming language with no quirks, so simple every child can master it.", "issues": 0, "forks": 1, "url": "https://github.com/AmokHuginnsson/huginn" }, "repoStats": { "firstCommit": 2015, "commits": 817, "committers": 1, "files": 162 }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Huginn", "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n16464458|Show HN: Huginn: programming language with no quirks ;)|2018-02-26 10:55:47 UTC|1519642547|MarcinKonarski|2|2" }, "hugo": { "title": "HUGO", "appeared": 1995, "type": "pl", "creators": [ "Juhana Leinonen" ], "website": "https://hugoif.github.io/", "documentation": [ "https://github.com/hugoif/hugo-by-example/blob/gh-pages/README.md" ], "reference": [ "http://ifwiki.org/index.php/Hugo", "https://en.wikipedia.org/wiki/Interactive_fiction#Software" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/hugoif" ], "githubRepo": { "firstCommit": 2021, "stars": 0, "forks": 0, "subscribers": 3, "created": 2021, "updated": 2021, "description": "Library contributions from the Hugo interactive fiction community", "issues": 0, "url": "https://github.com/hugoif/library-contributions" }, "repoStats": { "firstCommit": 2021, "commits": 31, "committers": 2, "files": 35 }, "hopl": "https://hopl.info/showlanguage.prx?exp=2099", "wordRank": 9966, "centralPackageRepositoryCount": 0 }, "hujson": { "title": "HuJSON", "appeared": 2019, "type": "dataNotation", "creators": [ "David Crawshaw" ], "reference": [ "https://nigeltao.github.io/blog/2021/json-with-commas-comments.html" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/tailscale" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "firstCommit": 2019, "stars": 401, "forks": 15, "subscribers": 28, "created": 2019, "updated": 2022, "description": "HuJSON: JSON for Humans (JWCC: JSON w/ comments and trailing commas)", "issues": 2, "url": "https://github.com/tailscale/hujson" }, "repoStats": { "firstCommit": 2019, "commits": 39, "committers": 10, "files": 21 } }, "humanhash-hash-function": { "title": "humanhash-hash-function", "appeared": 2011, "type": "hashFunction", "creators": [ "Zachary Voase" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/zacharyvoase/humanhash/issues" ], "githubRepo": { "firstCommit": 2011, "stars": 734, "forks": 33, "subscribers": 14, "created": 2011, "updated": 2022, "description": "Human-readable digests.", "issues": 10, "url": "https://github.com/zacharyvoase/humanhash" } }, "hummingbird-quickscript": { "title": "Hummingbird QuickScript", "appeared": 1990, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "Hummingbird Ltd" ], "wikipedia": { "summary": "Hummingbird Ltd. (previously NASDAQ: HUMC, TSX: HUM) is a subsidiary of OpenText and is a provider of enterprise software solutions including Exceed. Initially founded as a consulting business in 1984, Hummingbird moved into the connectivity market. Its enterprise content management (ECM) solutions focuses on the management of the life cycle of enterprise content. Hummingbird has 40 offices worldwide. Customers include IBM, NASA, Morgan Stanley, Boeing, The Walt Disney Company, and The Government of Canada.", "created": 2012, "backlinksCount": 21, "pageId": 3807709, "revisionCount": 8, "dailyPageViews": 1, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Hummingbird_QuickScript" }, "centralPackageRepositoryCount": 0 }, "hurl": { "title": "hurl", "appeared": 2020, "type": "application", "screenshot": "https://raw.githubusercontent.com/Orange-OpenSource/hurl/master/docs/assets/img/hurl-html-file.png", "photo": "https://raw.githubusercontent.com/Orange-OpenSource/hurl/master/docs/assets/img/hurl-html-report.png", "demoVideo": [ "https://hurl.dev/#also-an-http-test-tool" ], "creators": [ "Orange S.A" ], "description": "Hurl is a command line tool that runs HTTP requests defined in a simple plain text format. It can perform requests, capture values and evaluate queries on headers and body response. Hurl is very versatile: it can be used for both fetching data and testing HTTP sessions", "website": "https://hurl.dev/", "documentation": [ "https://hurl.dev/docs/manual.html" ], "reference": [ "https://hurl.dev/docs/running-tests.html" ], "cheatSheetUrl": [ "https://hurl.dev/docs/samples.html" ], "standsFor": "The name Hurl is a tribute to the awesome curl, with a focus on the HTTP protocol.", "country": [ "France" ], "originCommunity": [ "https://github.com/Orange-OpenSource" ], "domainName": { "name": "hurl.dev" }, "versions": { "2022": [ "2.0.1" ] }, "supersetOf": [ "curl" ], "related": [ "curl" ], "influencedBy": [ "curl" ], "githubRepo": { "firstCommit": 2020, "stars": 1980, "forks": 59, "subscribers": 21, "created": 2020, "updated": 2022, "description": "Hurl, run and test HTTP requests with plain text.", "issues": 51, "url": "https://github.com/Orange-OpenSource/hurl" }, "isOpenSource": true }, "hush": { "title": "Hush", "appeared": 2021, "type": "pl", "creators": [ "Gabriel Bastos" ], "website": "https://hush-shell.github.io/", "country": [ "Brazil" ], "originCommunity": [ "https://github.com/hush-shell/" ], "githubRepo": { "firstCommit": 2020, "stars": 552, "forks": 17, "subscribers": 10, "created": 2020, "updated": 2022, "description": "Hush is a unix shell based on the Lua programming language", "issues": 12, "url": "https://github.com/hush-shell/hush" }, "repoStats": { "firstCommit": 2020, "commits": 294, "committers": 7, "files": 224 } }, "huwcode": { "title": "HuwCode", "appeared": 2018, "type": "pl", "creators": [ "Huw Pritchard" ], "website": "https://huwdp.github.io/huwcode-documentation", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/huwdp/huwinterpreter/issues" ], "githubRepo": { "firstCommit": 2022, "stars": 10, "forks": 0, "subscribers": 1, "created": 2018, "updated": 2022, "description": "Huwinterpreter", "issues": 0, "url": "https://github.com/huwdp/huwinterpreter" }, "repoStats": { "firstCommit": 2022, "commits": 1063, "committers": 2, "files": 718 } }, "hxml": { "title": "HXML", "appeared": 2009, "type": "application", "description": "Haxe compiler arguments can be stored in a .hxml file and can be executed with haxe . In hxml it is possible to use newlines and comments which makes it easier to maintain Haxe build configurations. It is possible to supply more arguments after the hxml file, e.g. haxe build.hxml -debug.", "reference": [ "https://haxe.org/manual/compiler-usage-hxml.html" ], "country": [ "Unknown" ], "originCommunity": [ "Haxe Foundation" ], "hasLineComments": { "example": "", "value": true }, "example": [ "-cp src\n-dce full\n\n--each\n\n-js bin/homepage.js\n-main website.HomePage\n\n--next \n\n-js bin/gallery.js\n-main website.GalleryPage\n\n--next \n\n-js bin/contact.js\n-main website.ContactPage" ], "githubLanguage": { "fileExtensions": [ "hxml" ], "type": "data", "aceMode": "text", "tmScope": "source.hxml", "repos": 0, "id": "HXML" }, "pygmentsHighlighter": { "filename": "haxe.py", "fileExtensions": [ "hxml" ], "id": "Hxml" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2018, "committerCount": 4, "commitCount": 109, "sampleCount": 2, "example": [ "buildGlobal.hxml\n-lib mcover:2.1.1\n-D unittest\n-x TestMain\n--macro mcover.MCover.coverage(['checkstyle'], ['src'], ['checkstyle.reporter', 'checkstyle.Main'])\n\n--next\n-cmd neko run -s src -s test -p resources/static-analysis.txt\n-cmd neko run --default-config resources/default-config.json\n-cmd neko run -c resources/default-config.json" ], "url": "https://github.com/vshaxe/haxe-TmLanguage" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "hy": { "title": "Hy", "appeared": 2013, "type": "pl", "creators": [ "Paul Tagliamonte" ], "description": "A dialect of Lisp that's embedded in Python", "website": "http://hylang.org/", "documentation": [ "https://docs.hylang.org/en/stable/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/hylang" ], "domainName": { "registered": 2013, "awisRank": { "2022": 2391221 }, "name": "hylang.org" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "; 0[0-7]+j?", "value": true }, "hasHexadecimals": { "example": "; 0[xX][a-fA-F0-9]+", "value": true }, "hasFloats": { "example": "; -?\\d+\\.\\d+", "value": true }, "hasIntegers": { "example": "; -?\\d+", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "example": [ "(+ \"Hyllo \" \"World\" \"!\")" ], "githubRepo": { "firstCommit": 2012, "stars": 4282, "forks": 350, "subscribers": 122, "created": 2012, "updated": 2022, "description": "A dialect of Lisp that's embedded in Python", "issues": 68, "url": "https://github.com/hylang/hy" }, "repoStats": { "firstCommit": 2012, "commits": 3979, "committers": 203, "files": 163 }, "wikipedia": { "example": [ "=> (print \"Hy!\")\nHy!\n=> (defn salutationsnm [name] (print (+ \"Hy \" name \"!\")))\n=> (salutationsnm \"YourName\")\nHy YourName!" ], "related": [ "lisp", "ia-32", "clojure", "python", "jvm" ], "summary": "Hy (alternately, Hylang) is a programming language, a dialect of the language Lisp designed to interact with the language Python by translating expressions into Python's abstract syntax tree (AST). Hy was introduced at Python Conference (PyCon) 2013 by Paul Tagliamonte.Similar to Kawa's and Clojure's mapping of s-expressions onto the Java virtual machine (JVM), Hy is meant to operate as a transparent Lisp front end to Python's abstract syntax. Lisp allows operating on code as data (metaprogramming). Thus, Hy can be used to write domain-specific languages. Hy also allows Python libraries, including the standard library, to be imported and accessed alongside Hy code with a compiling step converting the data structure of both into Python's AST.", "pageId": 43723435, "created": 2015, "backlinksCount": 76, "revisionCount": 1, "dailyPageViews": 1, "appeared": 2013, "fileExtensions": [ "hy" ], "url": "https://en.wikipedia.org/wiki/Hy_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "hy" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "hy" ], "aceMode": "text", "tmScope": "source.hy", "aliases": [ "hylang" ], "repos": 398, "id": "Hy" }, "githubBigQuery": { "repos": 180, "users": 154, "id": "Hy" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "hy" ], "id": "Hy" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 30, "commitCount": 97, "sampleCount": 3, "example": [ ";; Fibonacci example in Hy.\n\n(defn fib [n]\n (if (<= n 2) n\n (+ (fib (- n 1)) (fib (- n 2)))))\n\n(if (= __name__ \"__main__\")\n (for [x [1 2 3 4 5 6 7 8]]\n (print (fib x))))\n" ], "url": "https://github.com/Slowki/hy.tmLanguage.git" }, "leachim6": { "filepath": "h/Hy.hy", "fileExtensions": [ "hy" ], "example": [ "(print \"Hello World\")\n" ], "id": "Hy" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Hy", "rijuRepl": { "example": [ "(print \"Hello, world!\")\n" ], "id": "https://riju.codes/hy" }, "tryItOnline": "hy", "jupyterKernel": [ "https://github.com/bollwyvl/hy_kernel/", "https://github.com/Calysto/calysto_hy" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "hybrid": { "title": "Hybrid", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2720feaa7fc5d25e99055f59254170fcd5f4a229" ], "country": [ "Switzerland" ], "originCommunity": [ "Institut für Angewandte Mathematik" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1327", "wordRank": 5023, "centralPackageRepositoryCount": 0 }, "hycom": { "title": "HyCom", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d8dc67e20d0e1d0bb056c435f5e1158c47c26dce" ], "country": [ "Argentina" ], "originCommunity": [ "Universidad Nacional de La Plata" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4133", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "hypac": { "title": "HYPAC", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3eaac487214223479c700972308cdc434957173a" ], "country": [ "United States" ], "originCommunity": [ "Bell Telephone Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7454", "centralPackageRepositoryCount": 0 }, "hyper-basic": { "title": "Hyper Basic", "appeared": 1985, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Hyper_Basic" }, "centralPackageRepositoryCount": 0 }, "hypercard": { "title": "HyperCard", "appeared": 1987, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Apple" ], "hasMessagePassing": { "example": "", "value": true }, "wikipedia": { "related": [ "hypertalk", "delphi", "visual-basic", "html", "javascript", "livecode", "applescript" ], "summary": "HyperCard was a piece of application software and a programming tool for Apple Macintosh and Apple IIGS computers. It was among the first successful hypermedia systems before the World Wide Web. HyperCard combined a flat-file database with a graphical, flexible, user-modifiable interface. HyperCard also included a built-in programming language called HyperTalk for manipulating data and the user interface. This combination of features – a database with simple form layout, flexible support for graphics, and ease of programming – led many people to use HyperCard for many different projects. Some people used HyperCard as a programming tool for rapid application development of applications and databases, others for building interactive applications with no database requirements, command and control systems, and many examples in the demoscene. HyperCard was originally released in 1987 for $49.95 and was included for free with all new Macs sold then. It was withdrawn from sale in March 2004 after its final update in 1998. HyperCard ran in the Classic Environment, but was not ported to Mac OS X.", "created": 2001, "backlinksCount": 469, "pageId": 13567, "revisionCount": 885, "dailyPageViews": 191, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/HyperCard" }, "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1988|Sybex|Understanding HyperCard|Harvey, Greg|9780895885067\n1988-08-01T00:00:01Z|Addison-Wesley|Hypercard Script Language Guide: The Hypertalk Language|Apple Computer Inc.|9780201176322\n1991|Prentice Hall Ptr|Multimedia Design With Hypercard|Wilson, Stephen|9780134888910\n1994|West Group|Hypercard Today|Susan K. Baumann and Steven L. Mandell|9780314027351\n1988|Mis Pr|Xcmd's For Hypercard|Gary Bond|9780943518855\n1994|Addison-wesley|Hypercard 2.2 In A Hurry|George Beekman|9780201408874\n2010|General Books Llc|Domain-specific Programming Languages: Hypercard|Books LLC|9781156443033\n1988|Compute|Compute!'s Quick And Easy Guide To Hypercard|Steven Anzovin|9780874551877\n1988|Bantam Dell Pub Group|Danny Goodman's Hypercard Developer's Guide (macintosh Performance Library)|Danny Goodman|9780553345766\n1989|Scott Foresman Trade|Hypercard Made Easy (scott, Foresman Macintosh Computer Books)|William B. Sanders|9780673385772\n1988|Sams|Hypertalk Programming/covers Hypercard Version 1.2 (hayden Macintosh Library Books)|Dan Shafer|9780672484391\n1995|Wadsworth Publishing Co Inc|Hypercard 2.3 in a Hurry : The Fast Track to Multimedia|George Beekman|9780534513009", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|The Effects of HyperCard Programming on Teacher Education Students' Problem-Solving Ability and Computer Anxiety.|10.1080/08886504.1997.10782197|43|0|Min Liu|6e4a33c1ea770653b2801f1e1a9909906ef6132a\n1991|The learnability of HyperCard as an object-oriented programming system|10.1080/01449299108924276|19|1|J. Nielsen and Ida Frehr and Hans Olav Nymand|db7b87e4485881a5286b41c91893ae84c394d530\n2013|On Developing HyperCard Stacks for the Study of Chinese Characters: KanjiCard|10.1558/CJ.V6I2.75-87|13|3|K. Nakajima|31ec9fa68971516070b0bc3e4c28783234c6b161\n1994|Case Study: The Use of a Hypercard Simulation to Aid in the Teaching of Laboratory Apparatus Operation|10.1080/0954730940310405|8|0|J. Waddick|b1656fa4d8f42d0483ada794730a126ecd70e64b\n1993|An interactive tutorial system for MC68000 assembly language using HyperCard|10.1145/152751.152756|7|0|W. Coey|437d2f3c6d061636e4defd2dd3c1e6f820d12e7d\n1989|Using HyperCard to rapidly prototype human-computer interfaces to CASE systems|10.1109/ICSMC.1989.71506|1|0|H. Sholl and R. Ammar and W.S. Weiss|d839842cc094ae03b6b324e1e490819253dae4d4" }, "hyperflow": { "title": "Hyperflow", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d4104df045c600c55e4d2995e360370967433c0f" ], "country": [ "United States" ], "originCommunity": [ "Washington University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5322", "centralPackageRepositoryCount": 0 }, "hyperfun": { "title": "HyperFun", "appeared": 1999, "type": "pl", "country": [ "Various" ], "originCommunity": [ "http://digitalmaterial.org" ], "wikipedia": { "backlinksCount": 15, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/HyperFun" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5289" }, "hyperlisp": { "title": "Hyperlisp", "appeared": 1971, "type": "pl", "reference": [ "http://www.nosuch.com/plum/cgi/showlist.cgi?sort=name&concise=yes" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6389", "centralPackageRepositoryCount": 0 }, "hyperlog": { "title": "Hyperlog", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0ae0a3e1d1ad90a90c349963745299f89d1eeda6" ], "country": [ "United Kingdom" ], "originCommunity": [ "King's College London" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7541", "centralPackageRepositoryCount": 0 }, "hyperscript-lang": { "title": "Hyperscript", "appeared": 2020, "type": "pl", "description": "_hyperscript is a small, open scripting language inspired by hypertalk", "website": "https://hyperscript.org/", "aka": [ "_hyperscript" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/bigskysoftware" ], "domainName": { "registered": 2020, "awisRank": { "2022": 2466144 }, "name": "hyperscript.org" }, "related": [ "hypertalk" ], "example": [ "\n\n\n\n\n\n
\n
\n\n
\n Do some stuff\n
" ], "githubRepo": { "firstCommit": 2020, "stars": 863, "forks": 58, "subscribers": 14, "created": 2020, "updated": 2022, "description": "a small scripting language for the web", "issues": 57, "url": "https://github.com/bigskysoftware/_hyperscript" }, "repoStats": { "firstCommit": 2020, "commits": 1670, "committers": 59, "files": 2760 } }, "hyperscript": { "title": "Hyperscript", "appeared": 2012, "type": "template", "creators": [ "Dominic Tarr" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/hyperhype" ], "example": [ "var h = require('hyperscript')\nh('div#page',\n h('div#header',\n h('h1.classy', 'h', { style: {'background-color': '#22f'} })),\n h('div#menu', { style: {'background-color': '#2f2'} },\n h('ul',\n h('li', 'one'),\n h('li', 'two'),\n h('li', 'three'))),\n h('h2', 'content title', { style: {'background-color': '#f22'} }),\n h('p',\n \"so it's just like a templating engine,\\n\",\n \"but easy to use inline with javascript\\n\"),\n h('p',\n \"the intention is for this to be used to create\\n\",\n \"reusable, interactive html widgets. \"))" ], "githubRepo": { "firstCommit": 2012, "stars": 2389, "forks": 112, "subscribers": 48, "created": 2013, "updated": 2022, "description": "Create HyperText with JavaScript.", "issues": 41, "url": "https://github.com/hyperhype/hyperscript" }, "repoStats": { "firstCommit": 2012, "commits": 157, "committers": 23, "files": 10 } }, "hypertalk": { "title": "HyperTalk", "appeared": 1987, "type": "pl", "creators": [ "Dan Winkler" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "put" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "on mouseUp \n select the clickLine\n put word 2 of the clickLine into linenum\n do line linenum of cd fld 1\n end mouseUp" ], "related": [ "pascal", "actionscript", "applescript", "ecmascript", "javascript", "lingo", "livecode", "sensetalk", "supertalk", "hypercard" ], "summary": "HyperTalk is a high-level, procedural programming language created in 1987 by Dan Winkler and used in conjunction with Apple Computer's HyperCard hypermedia program by Bill Atkinson. The main target audience of HyperTalk was beginning programmers, hence HyperTalk programmers were usually called authors, and the process of writing programs was called \"scripting\". HyperTalk scripts are fairly similar to written English, and use a logic structure similar to that of the Pascal programming language. It supports the basic control structures of procedural languages: repeat for/while/until, if/then/else, as well as function and message \"handler\" calls (a handler is a subroutine, a message handler is a procedure). Data types are transparent to the user, conversion happens transparently in the background between strings and numbers. There are no classes or data structures in the traditional sense; their place was taken by special string literals, or rather \"lists\" of \"items\" delimited by commas (in later versions the \"itemDelimiter\" property allowed choosing an arbitrary character). In the late 1980s Apple considered using HyperCard's HyperTalk scripting language as the standard language across the company and within its classic Mac OS operating system, and for interprocess communication between Apple and non-Apple products. The company did not oppose the development of imitations like SuperCard, and created a HyperTalk Standards Committee to avoid incompatibility between language variants. The case-insensitive language was interpreted at first, but gained just-in-time compilation with HyperCard 2.0.", "pageId": 78136, "dailyPageViews": 51, "created": 2002, "backlinksCount": 59, "revisionCount": 221, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/HyperTalk" }, "leachim6": { "filepath": "h/HyperTalk.ht", "fileExtensions": [ "ht" ], "example": [ "put \"Hello World\"\n" ], "id": "HyperTalk" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:HyperTalk", "tiobe": { "id": "HyperTalk" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1328", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nHypertalk for Educators: Introduction to Programming||Sharon Yoder|21028870|0.0|0|0\nHyperTalk programming: [includes version 1.1]|1988|Dan Shafer|4059088|0.0|0|0\nHyperCard Script Language Guide: The Hypertalk Language|1988|Apple Inc.|2172111|4.00|1|0\nHyperCard IIgs Script Language Guide: The Hypertalk Language|1991|Apple Inc.|3885477|0.0|0|0\nHypertalk and Hypertext: Programming the Interface Graphic in the Macintosh and Windows 3.......|1992|A.E. Stanley|3739749|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1988-08-01T00:00:01Z|Addison-Wesley|Hypercard Script Language Guide: The Hypertalk Language|Apple Computer Inc.|9780201176322\n1988-01-01T00:00:01Z|Sams|Hypertalk Programming/Includes Version 1.1 (Hayden Macintosh library books)|Shafer, Dan|9780672484261\n1992|Newtech (GB)|Hypertalk and Hypertext: Programming the Interface Graphic in the Macintosh and Windows 3.......|Stanley, A E|9780750605007\n1992|Intl Society For Technology In Educ|Hypertalk For Educators: Introduction To Programming|Sharon Yoder|9780924667954\n1988|Sams|Hypertalk Programming/covers Hypercard Version 1.2 (hayden Macintosh Library Books)|Dan Shafer|9780672484391", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|HyperTalk as an overture to CS1|10.1145/107004.107015|35|0|Elizabeth E. Katz and H. Porter|b3bdcee080a05baa8c11b7f778a339cc6f4b4173" }, "hyphy": { "title": "HyPhy", "appeared": 2008, "type": "pl", "website": "http://hyphy.org/w/index.php/HyPhy_Batch_Language", "country": [ "United States" ], "originCommunity": [ "University of California San Diego", "North Carolina State University" ], "example": [ "#profile START;s = 0;m = {5,1};for (k=0; k<250000; k=k+1){\ts = s + k;\tt = Random (0,5);\tm [t] = m [t] + 1;}#profile PAUSE;s2 = 0;for (k=1; k<10000; k=k+1){\ts2 = s2+1/k;}#profile _hyphy_profile_dump;stats \t\t\t= _hyphy_profile_dump[\"STATS\"];_profile_summer\t= {1,Rows(stats)};_profile_summer = _profile_summer[\"1\"] * stats;_instructions = _hyphy_profile_dump[\"INSTRUCTION\"];_indices\t = _hyphy_profile_dump[\"INSTRUCTION INDEX\"];fprintf (stdout, \"\\nTotal run time (seconds) : \", Format(_profile_summer[1]/1000000,15,6),\t\t\t\t \"\\nTotal number of steps : \", Format(_profile_summer[0],15,0), \"\\n\\n\");\t\t\t\t for (k=0; kIcarus is a minimum-viable type-safe imperative language designed to serve as a platform for exploring mutation and general side-effect control.", "country": [ "Australia" ], "originCommunity": [ "https://github.com/chrisosaurus/icarus/issues" ], "githubRepo": { "stars": 33, "forks": 2, "subscribers": 4, "created": 2015, "updated": 2020, "firstCommit": 2015, "description": "Programming language designed as an experiment to explore mutation and aliasing control", "issues": 1, "url": "https://github.com/mkfifo/icarus" }, "repoStats": { "firstCommit": 2015, "commits": 1827, "committers": 3, "files": 297 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "icd": { "title": "ICD-10-CM diagnosis", "appeared": 1983, "type": "schema", "standsFor": "ICD-10-CM diagnosis", "country": [ "Switzerland" ], "originCommunity": [ "World Health Organization" ], "wikipedia": { "summary": "ICD-10 is the 10th revision of the International Statistical Classification of Diseases and Related Health Problems (ICD), a medical classification list by the World Health Organization (WHO). It contains codes for diseases, signs and symptoms, abnormal findings, complaints, social circumstances, and external causes of injury or diseases. Work on ICD-10 began in 1983, became endorsed by the Forty-third World Health Assembly in 1990, and was first used by member states in 1994.Whilst WHO manages and publishes the base version of the ICD, several members states have modified it to better suit their needs. In the base classification, the code set allows for more than 14,000 different codes and permits the tracking of many new diagnoses compared to the preceding ICD-9. Through the use of optional sub-classifications ICD-10 allows for specificity regarding the cause, manifestation, location, severity and type of injury or disease. The adapted versions may differ in a number of ways, and some national editions have expanded the code set even further; with some going so far as to add procedure codes. ICD-10-CM, for example, has over 70,000 codes.The WHO provides detailed information regarding the ICD via its website – including an ICD-10 online browser and ICD training materials. The online training includes a support forum, a self learning tool and user guide.", "backlinksCount": 5935, "pageId": 13745451, "dailyPageViews": 1237, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/ICD-10" }, "semanticScholar": "" }, "icedcoffeescript": { "title": "IcedCoffeeScript", "appeared": 2009, "type": "pl", "creators": [ "Max Krohn" ], "website": "https://maxtaco.github.io/coffee-script/", "fileExtensions": [ "coffee" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/maxtaco/coffee-script/issues" ], "compilesTo": [ "javascript" ], "githubRepo": { "description": "IcedCoffeeScript", "stars": 732, "forks": 2000, "subscribers": 20, "created": 2009, "updated": 2019, "url": "https://github.com/maxtaco/coffee-script/" }, "repoStats": { "firstCommit": 2009, "commits": 8264, "committers": 201, "files": 279 } }, "ices-system": { "title": "Integrated Civil Engineering System", "appeared": 1961, "type": "standard", "reference": [ "https://mitpress.mit.edu/books/ices-system-design" ], "standsFor": "Integrated Civil Engineering System", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=226" }, "icetran": { "title": "ICETRAN", "appeared": 1965, "type": "pl", "description": "ENGINEERING PROGRAMS FOR ICES ARE WRITTEN IN ICETRAN AND ARE PROCESSED BY THE ICETRAN PRECOMPILER, WHICH GENERATES AN EQUIVALENT FORTRAN PROGRAM", "country": [ "United States" ], "originCommunity": [ "Computer Research Corporation" ], "compilesTo": [ "fortran" ], "hopl": "https://hopl.info/showlanguage.prx?exp=417" }, "ici": { "title": "Interactive C Interpreter", "appeared": 1980, "type": "pl", "website": "http://atrn.org/ici/", "documentation": [ "http://atrn.org/ici/documentation.html" ], "standsFor": "Interactive C Interpreter", "country": [ "Australia" ], "originCommunity": [ "Canon Information Systems Research" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "printf" ] ], "wikipedia": { "related": [ "c", "perl", "regex", "tcl" ], "summary": "ICI is a general purpose interpreted, computer programming language originally developed by Tim Long in the late 1980s. It has dynamic typing and flexible data types, with the basic syntax, flow control constructs and operators of C. It can be considered broadly similar to Perl, with which it is roughly contemporary. Like Perl, it also has tight integration with regular expressions. ICI is not an acronym.Primitive data types in ICI include integers, reals, strings, files, safe pointers, and regular expressions. Aggregate data types are arrays, sets, and associative tables. Sets can be heterogeneous, nested, and support the usual set operations: union, intersection, etc. The language supports subroutines and nested modules. All variables are lexically scoped at the subroutine or module level, but unlike most structured languages, ICI allows the current scope to be adjusted (Tcl also allows this, for example). ICI is not object-based, many object programming features can be emulated in the language by using a data structure inheritance feature called super-structures. To support application development, ICI has C-like file I/O and system interface support, as well as a high-level event trigger facility. The language also has a modest standard library of built-in functions. It is also notable for its generous license, which permits use for any purpose, including commercial and alteration and resale.", "pageId": 771935, "created": 2004, "backlinksCount": 13, "revisionCount": 50, "dailyPageViews": 5, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/ICI_(programming_language)" }, "leachim6": { "filepath": "i/ICI.ici", "fileExtensions": [ "ici" ], "example": [ "printf(\"Hello World\\n\");" ], "id": "ICI" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2104", "fileType": "text", "centralPackageRepositoryCount": 0 }, "icml": { "title": "ICML", "appeared": 2008, "type": "xmlFormat", "description": "Adobe InDesign file format.", "reference": [ "https://www.oreilly.com/library/view/xml-publishing-with/9781449397234/ar01s12.html", "https://helpx.adobe.com/incopy/using/using-incopy-workflow.html" ], "standsFor": "InCopy Markup Language", "fileExtensions": [ "icml" ], "originCommunity": [ "Adobe" ] }, "icon": { "title": "Icon", "appeared": 1977, "type": "pl", "creators": [ "Ralph Griswold" ], "website": "http://www.cs.arizona.edu/icon", "documentation": [ "https://www2.cs.arizona.edu/icon/" ], "country": [ "United States" ], "originCommunity": [ "The University of Arizona" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "# \\b([+-]?([2-9]|[12][0-9]|3[0-6])[rR][0-9a-zA-Z]+)\\b", "value": true }, "hasFloats": { "example": "# [+-]?[0-9]*\\.([0-9]*)([Ee][+-]?[0-9]*)?", "value": true }, "hasIntegers": { "example": "# \\b([+-]?[0-9]+[KMGTPkmgtp]?)\\b", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "write" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "procedure main()\n s := \"Mon Dec 8\"\n s ? write(Mdate() | \"not a valid date\")\n end\n # Define a matching function that returns\n # a string that matches a day month dayofmonth\n procedure Mdate()\n # Define some initial values\n static dates\n static days\n initial {\n days := [\"Mon\",\"Tue\",\"Wed\",\"Thr\",\"Fri\",\"Sat\",\"Sun\"]\n dates := [\"Jan\",\"Feb\",\"Mar\",\"Apr\",\"May\",\"Jun\",\n \"Jul\",\"Aug\",\"Sep\",\"Oct\",\"Nov\",\"Dec\"]\n }\n every suspend (retval <- tab(match(!days)) || # Match a day\n =\" \" || # Followed by a blank\n tab(match(!dates)) || # Followed by the month\n =\" \" || # Followed by a blank\n matchdigits(2) # Followed by at least 2 digits\n ) &\n (=\" \" | pos(0) ) & # Either a blank or the end of the string\n retval # And finally return the string\n end\n # Matching function that returns a string of n digits\n procedure matchdigits(n)\n suspend (v := tab(many(&digits)) & *v <= n) & v\n end" ], "related": [ "snobol", "algol", "python", "unicon", "c", "pascal", "java", "smalltalk", "clu" ], "summary": "Icon is a very high-level programming language featuring goal-directed execution and many facilities for managing strings and textual patterns. It is related to SNOBOL and SL5, string processing languages. Icon is not object-oriented, but an object-oriented extension called Idol was developed in 1996 which eventually became Unicon.", "pageId": 14801, "dailyPageViews": 50, "created": 2001, "backlinksCount": 82, "revisionCount": 184, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Icon_(programming_language)" }, "pygmentsHighlighter": { "filename": "unicon.py", "fileExtensions": [ "icon", "ICON" ], "id": "Icon" }, "helloWorldCollection": [ "# Hello world in Icon (http://www.cs.arizona.edu/icon/)\n\nprocedure main()\n write(\"Hello world\")\nend\n" ], "leachim6": { "filepath": "i/Icon.icn", "fileExtensions": [ "icn" ], "example": [ "procedure main()\n write(\"Hello World\");\nend" ], "id": "Icon" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Icon", "quineRelay": "Icon", "rijuRepl": { "example": [ "procedure main ()\n write(\"Hello, world!\")\nend\n" ], "id": "https://riju.codes/icon" }, "tryItOnline": "icon", "tiobe": { "id": "Icon" }, "hopl": "https://hopl.info/showlanguage.prx?exp=510", "ubuntuPackage": "icont", "fileType": "text", "wordRank": 2368, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1994|Wiley|The Icon Book: Visual Symbols for Computer Systems and Documentation|Horton, William|9780471599005\n1998|Peer To Peer Communications|Graphics Programming In Icon|Ralph E. Griswold and Gregg M. Townsend and Clinton L. Jeffery|9781573980098\n1983|Prentice-hall|The Icon Programming Language (prentice-hall Software Series)|Ralph E Griswold|9780134497778", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1981|Generators in Icon|10.1145/357133.357136|52|2|R. Griswold and D. R. Hanson and John T. Korb|58e38b184055909109cc30da6ce3f1a002eae242\n1980|A portable storage management system for the icon programming language|10.1002/spe.4380100607|27|3|D. R. Hanson|832ce1c8ffed3006738fe3df7ee22e017e3f09c9\n1979|The icon programming language: an overview|10.1145/988078.988082|21|1|R. Griswold and D. R. Hanson and John T. Korb|208d59a0d3972f13928d9faccdaa349e4994765a\n1983|Measuring the Performance and Behavior of Icon Programs|10.1109/TSE.1983.236299|20|0|Cary A. Coutant and R. Griswold and D. R. Hanson|44524266fe1762db18c784521cd02dc8937b812b\n1982|The Evaluation of Expressions in Icon|10.1145/69622.357184|15|1|R. Griswold|e407c3e678d961acc9762efc61b3169dbd4998f4\n1994|A framework for execution monitoring in icon|10.1002/spe.4380241104|13|2|C. Jeffery and R. Griswold|219ecaedc38688bb39af5bdc2ea87ee5c9c5ee9c\n1983|The implementation of generators and goal‐directed evaluation in icon|10.1002/spe.4380130605|11|0|S. Wampler and R. Griswold|8911415a3dc4dc4255c19aba2597eaabf3a1de10\n1990|String Scanning in the Icon Programming Language|10.1093/comjnl/33.2.98|11|0|R. Griswold|a160b5ee89bd7424acf5fe64b6487284484e2f1e\n1992|An optimizing compiler for the icon programming language|10.1002/spe.4380220803|11|1|Kenneth Walker and R. Griswold|ac4ad25831b1d1d26a4498610f070a7481f97bd3\n1993|History of the Icon programming language|10.1145/155360.155363|10|0|R. Griswold and Madge T. Griswold|b373998ddc18275d1204d3bc8506592c27441512\n1987|A recursive interpreter for the Icon programming language|10.1145/29650.29665|10|0|Janalee O'Bagy and R. Griswold|8cae0300ac4db01589d408e586210ef83b150ac5\n1993|The design and implementation of dynamic hashing for sets and tables in icon|10.1002/spe.4380230402|9|1|W. Griswold and Gregg M. Townsend|737ddd66e85e40fed99fb00ef0819dd08b617778\n2000|A new implementation of the Icon language|10.1002/(SICI)1097-024X(20000710)30:8%3C925::AID-SPE321%3E3.0.CO;2-V|9|1|T. Proebsting and Gregg M. Townsend|6d475fd00ff3a9ac0e4435261ed3de8df13067a7\n1983|Co-Expressions in Icon|10.1093/comjnl/26.1.72|6|0|S. Wampler and R. Griswold|9ed1304db28f6a53dbad488b8c40b6d878e00295\n1986|Logicon: An integration of prolog into icon|10.1002/spe.4380161005|6|1|G. Lapalme and S. Chapleau|9f925f796da32e45b2b92b568ed90d08c29aa9fd\n1984|Expression evaluation in the icon programming language|10.1145/800055.802034|5|0|R. Griswold|0f3d8f0d864c9faeefdd02beeadbfa759b969c17\n1988|Modeling software tools with ICON|10.1109/ICSE.1988.93701|4|0|O. Fonorow|877572d7c81d2113483a706f902edf318bf41c4a\n1979|The Icon programming language a new approach to high-level string processing|10.1145/800177.810019|2|0|R. Griswold|61791f3b783ed9743b793a191e09dd34e32c3cae\n1992|Garbage collection alternatives for icon|10.1002/spe.4380220804|1|1|M. Fernández and D. R. Hanson|08a9c225357dc043c45c147293488b402724e4c5" }, "icot": { "title": "ICOT", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9e1f1bef4907d151aeb963c5b8e495e38bff6505" ], "country": [ "South Korea" ], "originCommunity": [ "Chonbuk National University", "Seoul National University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5800", "centralPackageRepositoryCount": 0 }, "id": { "title": "Irvine Dataflow", "appeared": 1975, "type": "pl", "standsFor": "Irvine Dataflow", "country": [ "United States" ], "originCommunity": [ "University of California, Irvine" ], "wikipedia": { "example": [ "False? :: bool -> bool\n and :: bool -> bool -> bool" ], "related": [ "haskell" ], "summary": "Irvine Dataflow (Id) is a general-purpose parallel programming language, started at the University of California at Irvine in 1975 by Arvind and K. P. Gostelow. Arvind continued work with Id at MIT into the 1990s. The major subset of Id is a purely functional programming language with non-strict semantics. Features include: higher-order functions, a Milner-style statically type-checked polymorphic type system with overloading, user defined types and pattern matching, and prefix and infix operators. It led to the development of pH, a parallel dialect of Haskell. Id programs are fine grained implicitly parallel. The MVar synchronisation variable abstraction in Haskell is based on Id's M-structures.", "pageId": 15127771, "created": 2008, "backlinksCount": 13, "revisionCount": 20, "dailyPageViews": 9, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Id_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=812", "fileType": "text", "wordRank": 654, "centralPackageRepositoryCount": 0 }, "idio": { "title": "Idio", "appeared": 2015, "type": "pl", "creators": [ "Ian Fitchet" ], "website": "https://idio-lang.org/", "documentation": [ "https://idio-lang.org/docs/ref/" ], "githubRepo": { "firstCommit": 2015, "stars": 5, "forks": 0, "subscribers": 2, "created": 2020, "updated": 2022, "description": "The Idio Shell", "issues": 0, "url": "https://github.com/idio-lang/idio" }, "repoStats": { "firstCommit": 2015, "commits": 1518, "committers": 7, "files": 2998 }, "isOpenSource": true }, "idl-sl": { "title": "IDL specification language", "appeared": 1980, "type": "idl", "country": [ "United States and Canada" ], "originCommunity": [ "Carnegie Mellon University", "Queen's University" ], "wikipedia": { "related": [ "idl" ], "summary": "IDL (Interface Description Language) is a software interface description language (also referred to as Interface Descriptor Language) created by William Wulf and John Nestor of Carnegie Mellon University and David Lamb of Queen's University, Canada. Like other interface description languages, IDL defined interfaces in a language- and machine- independent way, allowing the specification of interfaces between components written in different languages, and possibly executing on different machines using remote procedure calls. The Karlsruhe Ada compilation system used IDL resp. DIANA and its predecessor AIDA, and for marshalling the vanilla IDL External Representation. BiiN's DBMS used IDL as well, and for marshalling a more compact binary IDL External Representation.", "pageId": 956653, "dailyPageViews": 15, "created": 2004, "backlinksCount": 13, "revisionCount": 32, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/IDL_specification_language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "idl": { "title": "IDL", "appeared": 1977, "type": "pl", "creators": [ "David Stern" ], "website": "http://www.exelisvis.com/ProductsServices/IDL.aspx", "documentation": [ "https://www.l3harrisgeospatial.com/docs/using_idl_home.html" ], "reference": [ "https://www.harrisgeospatial.com/Software-Technology/IDL" ], "standsFor": "Interactive Data Language", "country": [ "United States" ], "originCommunity": [ "L3Harris Geospatial Solutions, Inc" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "gdl", "pv-wave", "fortran", "c", "unix", "smalltalk", "matlab", "numpy", "python", "perl-data-language", "perl" ], "summary": "IDL, short for Interactive Data Language, is a programming language used for data analysis. It is popular in particular areas of science, such as astronomy, atmospheric physics and medical imaging. IDL shares a common syntax with PV-Wave and originated from the same codebase, though the languages have subsequently diverged in detail. There are also two free implementations, GNU Data Language (GDL) and Fawlty Language (FL).", "pageId": 512587, "dailyPageViews": 202, "created": 2004, "backlinksCount": 123, "revisionCount": 274, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/IDL_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "pro", "dlm" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "idl", "codemirrorMimeType": "text/x-idl", "tmScope": "source.idl", "repos": 2337, "id": "IDL" }, "githubBigQuery": { "repos": 5298, "users": 4557, "id": "IDL" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/idl", "codeMirror": "idl", "pygmentsHighlighter": { "filename": "idl.py", "fileExtensions": [ "pro" ], "id": "IDL" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2017, "committerCount": 2, "commitCount": 62, "sampleCount": 4, "example": [ "MODULE mg_analysis\nDESCRIPTION Tools for analysis\nVERSION 1.0\nSOURCE mgalloy\nBUILD_DATE January 18, 2011\n\nFUNCTION MG_ARRAY_EQUAL 2 2 KEYWORDS\nFUNCTION MG_TOTAL 1 1\n\n" ], "url": "https://github.com/mgalloy/idl.tmbundle" }, "helloWorldCollection": [ "IDL> ; Hello World in IDL (Interactive Data Language)\nIDL> print, \"Hello World\"\n" ], "leachim6": { "filepath": "i/IDL", "example": [ "print, \"Hello World\"\nend\n" ], "id": "IDL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:IDL", "tiobe": { "id": "IDL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=760", "jupyterKernel": [ "https://github.com/lstagner/idl_kernel" ], "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAn Introduction to Programming with IDL: Interactive Data Language|2005|Kenneth P. Bowman|786937|3.40|5|0\nIDL-- The Interactive Data Language: The Complete Data Analysis and Visualization Environment for Students [With *]||Research Systems|20631577|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2000|Fanning Software Consulting|IDL Programming Techniques, 2nd Edition|David W. Fanning|9780966238327\n2010|Kling Research And Software|Object Oriented Programming With Idl|Ronn Kling|9780967127057\n2001|Morgan Kaufmann|Practical IDL Programming|Gumley, Liam E.|9781558607002\n2001|Morgan Kaufmann|Practical IDL Programming|Gumley, Liam E.|9780080514444\n2007|Kling Research And Software, Inc|Idl Primer|Ronn Kling|9780967127033\n1997|Fanning Software Consulting|Idl Programming Techniques|David W. Fanning|9780966238303\n2000|Fanning Software Consulting|Idl Programming Techniques|Fanning, David W.|9780966238327", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|Flick: a flexible, optimizing IDL compiler|10.1145/258915.258921|110|9|E. Eide and Kevin Frei and B. Ford and J. Lepreau and G. Lindstrom|805279c8bdaaaf37f0e11fc856bb03a3d2fe7228\n1994|The Concert signature representation: IDL as intermediate language|10.1145/185084.185095|27|3|J. Auerbach and J. R. Russell|ee5472c86112e0f2e93b3b8ca9d8c09b8132217d\n2008|Mapping Semantics of CORBA IDL and GIOP to Open Core Protocol for Portability and Interoperability of SDR Waveform Components|10.1145/1403375.1403455|9|0|G. Gailliard and Hugues Balp and Michel Sarlotte and F. Verdier|762ce3309964bf2fee43667d413d621bdd2dcc9e\n1987|IDL as a data description language for a programming environment database|10.1145/39305.39312|6|0|T. Didriksen and A. Lie and R. Conradi|d57191ad1c5d414e920acb1d7f8d5c96433706f6\n2012|Research and Implement of Three-Dimensional Reconstruction Technology for Medical Images Based on IDL|10.1109/CSSS.2012.575|4|1|Lu Xiaoqi and L. Xin and Jia Dongzheng|00ed35c8b0fd007834d15a624c3a6461f1b221b2\n2018|proEQUIB: IDL Library for Plasma Diagnostics and Abundance Analysis|10.21105/joss.00899|4|0|Ashkbiz Danehkar|2364cde8f762d1900c63d67908b3c040352388e4\n2019|AtomNeb: IDL Library for Atomic Data of Ionized Nebulae|10.21105/joss.00898|4|0|Ashkbiz Danehkar|836d9f6001f4828648a988e9c2208f71121d7b37\n2013|Three Dimensional Visualization Toolbox for Medical Images Based on IDL|10.14257/IJSIP.2013.6.5.13|3|0|Minjun Tang and Feng Chen|a30cf24b5c12da20cd26d81068c04783d6f40b04\n2011|Using IDL to Visual Analyse the Point Clouds of the Surface of Crayfish|10.3968/J.ANS.1715787020110401.006|1|0|Yinwu Li and Guangsheng Zhao and Cheng Yang and Xiuwen Sun and Kui Huang|5956cb1a97b9d4524a994a4b29f88c22b5462292\n1999|Distributed programming with intermediate IDL|10.1145/329607.334745|1|1|Gary W. Smith and R. Volz|04ab7c78a1118f1ff9ab69ff6f09af0affd90d63" }, "idris": { "title": "Idris", "appeared": 2014, "type": "pl", "creators": [ "Edwin Brady" ], "website": "http://idris-lang.org", "documentation": [ "http://docs.idris-lang.org/en/latest/" ], "fileExtensions": [ "idr", "lidr" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of St Andrews" ], "domainName": { "registered": 2010, "awisRank": { "2017": 803360, "2022": 1726658 }, "name": "idris-lang.org" }, "writtenIn": [ "haskell" ], "hasDependentTypes": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "-- 0[xX][\\da-fA-F]+", "value": true }, "hasFloats": { "example": "-- \\d+[eE][+-]?\\d+", "value": true }, "hasIntegers": { "example": "-- \\d+", "value": true }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "putStrLn" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 3342, "forks": 663, "subscribers": 123, "created": 2011, "updated": 2022, "firstCommit": 2011, "description": "A Dependently Typed Functional Programming Language", "issues": 710, "url": "https://github.com/idris-lang/Idris-dev" }, "repoStats": { "firstCommit": 2011, "commits": 10140, "committers": 442, "files": 1643 }, "wikipedia": { "example": [ "total\npairAdd : Num a => Vect n a -> Vect n a -> Vect n a\npairAdd Nil Nil = Nil\npairAdd (x :: xs) (y :: ys) = x + y :: pairAdd xs ys" ], "related": [ "agda", "coq", "epigram", "haskell", "ml", "rust", "perl", "c", "javascript", "java", "jvm", "cil", "ocaml", "llvmir" ], "summary": "Idris is a general-purpose purely functional programming language with dependent types, strict or optional lazy evaluation and features such as a totality checker. Even before its possible usage for interactive theorem-proving, the focus of Idris is on general-purpose programming, like the purely functional Haskell, and with sufficient performance. The type system of Idris is similar to the one used by Agda and theorem-proving in it is similar to Coq, including tactics. In comparison, Idris has a priority on easy management of side-effects and support for implementing embedded domain specific languages. As of May 2017, Idris compiles to C (relying on a custom copying garbage collector using Cheney's algorithm) and JavaScript (both browser- and Node.js-based). There are also a number of third-party code generators for other platforms, including Java, JVM, CIL, OCaml, and a partial LLVM backend. The name Idris goes back to the character of the singing dragon in the 1970s UK kids' program Ivor the Engine.", "pageId": 39035048, "dailyPageViews": 123, "created": 2013, "backlinksCount": 38, "revisionCount": 109, "appeared": 2017, "fileExtensions": [ "idr", "lidr" ], "url": "https://en.wikipedia.org/wiki/Idris_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "idr", "lidr" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.idris", "repos": 1895, "id": "Idris" }, "githubBigQuery": { "repos": 301, "users": 219, "id": "Idris" }, "pygmentsHighlighter": { "filename": "haskell.py", "fileExtensions": [ "idr" ], "id": "Idris" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 6, "commitCount": 24, "sampleCount": 1, "example": [ "module Prelude.Char\n\nimport Builtins\n\nisUpper : Char -> Bool\nisUpper x = x >= 'A' && x <= 'Z'\n\nisLower : Char -> Bool\nisLower x = x >= 'a' && x <= 'z'\n\nisAlpha : Char -> Bool\nisAlpha x = isUpper x || isLower x\n\nisDigit : Char -> Bool\nisDigit x = (x >= '0' && x <= '9')\n\nisAlphaNum : Char -> Bool\nisAlphaNum x = isDigit x || isAlpha x\n\nisSpace : Char -> Bool\nisSpace x = x == ' ' || x == '\\t' || x == '\\r' ||\n x == '\\n' || x == '\\f' || x == '\\v' ||\n x == '\\xa0'\n\nisNL : Char -> Bool\nisNL x = x == '\\r' || x == '\\n'\n\ntoUpper : Char -> Char\ntoUpper x = if (isLower x)\n then (prim__intToChar (prim__charToInt x - 32))\n else x\n\ntoLower : Char -> Char\ntoLower x = if (isUpper x)\n then (prim__intToChar (prim__charToInt x + 32))\n else x\n\nisHexDigit : Char -> Bool\nisHexDigit x = elem (toUpper x) hexChars where\n hexChars : List Char\n hexChars = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9',\n 'A', 'B', 'C', 'D', 'E', 'F']\n" ], "url": "https://github.com/idris-hackers/idris-sublime.git" }, "projectEuler": { "memberCount": { "2019": 10, "2022": 11 }, "id": "Idris" }, "helloWorldCollection": [ "Hello world in Idris\n\n> main : IO ()\n> main = putStrLn \"Hello, World!\"" ], "leachim6": { "filepath": "i/Idris.idr", "fileExtensions": [ "idr" ], "example": [ "module Main\n\nmain : IO ()\nmain = putStrLn \"Hello World\"\n" ], "id": "Idris" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Idris", "rijuRepl": { "example": [ "module Main\n\nmain : IO ()\nmain = putStrLn \"Hello, world!\"\n" ], "id": "https://riju.codes/idris" }, "tryItOnline": "idris", "indeedJobs": { "2017": 1, "query": "idris developer" }, "officialBlogUrl": [ "https://www.idris-lang.org/category/news.html" ], "faqPageUrl": [ "https://docs.idris-lang.org/en/latest/faq/faq.html]" ], "tiobe": { "id": "Idris" }, "twitter": "https://twitter.com/idrislang", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20170313|Simon & Schuster|Type-Driven Development with Idris|Edwin Brady|9781638352242", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|IDRIS ---: systems programming meets full dependent types|10.1145/1929529.1929536|85|6|Edwin C. Brady|1baf62357fb0b8c60f735c27f89444d1492e62c5\n2016|Elaborator reflection: extending Idris in Idris|10.1145/2951913.2951932|31|4|D. Christiansen and Edwin C. Brady|38aafe4d16639f77be616c320ed12a9560430e7d\n2021|Idris 2: Quantitative Type Theory in Practice|10.4230/LIPIcs.ECOOP.2021.9|15|0|Edwin C. Brady|d670ad0f4a9448d3c0869a1519fed7fc97be60a2\n2019|A Dependently Typed Library for Static Information-Flow Control in Idris|10.1007/978-3-030-17138-4_3|4|1|Simon Gregersen and Søren Eller Thomsen and Aslan Askarov|ebf5c08847ffa8fe95ee857c4d11f0c3f47cf960\n2018|Edit-Time Tactics in Idris|10.14418/wes01.2.181|3|0|Joomy Korkut|991236ead6e9eee6b66081e7735b97cdb195914c\n2013|The Idris Programming Language - Implementing Embedded Domain Specific Languages with Dependent Types|10.1007/978-3-319-15940-9_4|3|0|Edwin C. Brady|e0f0d473b110fa75001ed13b5d2eaa1a374dd6f9\n2021|Idris 2: Quantitative Type Theory in Practice (Artifact)|10.4230/DARTS.7.2.10|1|0|Edwin C. Brady|c92b6092462563f3b3132f3a3285493d02aa906d\n2019|Building a Blockchain Simulation using the Idris Programming Language|10.1145/3299815.3314456|1|0|Qiutai Pan and X. Koutsoukos|97cab544a22c289edd423d0a71fcc73fb011fe87" }, "ids": { "title": "Integrated Data Store", "appeared": 1964, "type": "queryLanguage", "description": "Integrated Data Store (IDS) was an early network database management system largely used by industry, known for its high performance. IDS became the basis for the CODASYL Data Base Task Group standards.", "standsFor": "Integrated Data Store", "country": [ "United States" ], "originCommunity": [ "General Electric" ], "wikipedia": { "summary": "IDS may refer to:", "backlinksCount": 23, "pageId": 126675, "dailyPageViews": 26, "appeared": 1954, "url": "https://en.wikipedia.org/wiki/Integrated_Data_Store" }, "hopl": "https://hopl.info/showlanguage.prx?exp=199", "wordRank": 9965 }, "idyll": { "title": "idyll", "appeared": 2017, "type": "pl", "description": "Idyll is a markup language and toolkit for writing interactive articles. Idyll's reactive document model and standard component library decrease the amount of code needed to create high quality multimedia narratives. Idyll uses web standards to produce output that will load quickly in any web browser and is fully extensible. Idyll enables collaboration between programmers and journalists, researchers and designers. Those familiar with JavaScript can write custom components using tools like D3 or React.", "website": "https://idyll-lang.org/", "documentation": [ "https://idyll-lang.org/docs" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/idyll-lang" ], "domainName": { "registered": 2017, "awisRank": { "2022": 4392861 }, "name": "idyll-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "[meta\n title:\"How To: Tune a Guitar\"\n description:\"An interactive audio guide with guitars and a little music theory.\"\n twitterHandle:\"mathisonian\"\n shareImageUrl:\"https://mathisonian.github.io/idyll/how-to-tune-a-guitar/images/share.png\"\n shareImageWidth:\"1940\"\n shareImageHeight:\"970\"\n /]\n\n\n[Header\n title:\"Tune a Guitar\"\n authors:`[{\n name: \"Matthew Conlen\",\n link: \"https://twitter.com/mathisonian\"\n }, {\n name: \"Alex Kale\",\n link: \"https://github.com/kalealex\"\n }]` /]\n\n\n\n[var name:\"currentFrequency\" value:108 /]\n[var name:\"guitarState\" value:\"default\" /]\n[var name:\"fft\" value:` null ` /]\n[var name:\"waveform\" value:` null ` /]\n[var name:\"isInTune\" value:false /]\n\n[var name:\"clean\" value:false /]\n\n[var name:\"playRiff\" value:false /]\n[var name:\"playReference\" value:false /]\n[var name:\"detuneGuitar\" value:false /]\n[var name:\"autotuneGuitar\" value:false /]\n[var name:\"playNotes\" value:false /]\n[var name:\"playBeats\" value:false /]\n\n[var name:\"playScale\" value:false /]\n[var name:\"beatDiff\" value:5 /]\n\n[var name:\"tunerVisualization\" value:true /]\n\n[var name:\"targetNote\" value:\"E2\" /]\n[derived name:\"targetString\" value:`{ E2: 0, A2: 1, D3: 2, G3: 3, B3: 4, E4: 5 }[targetNote]` /]\n\n[Fixed]\n [Guitar\n src:\"images/svg/guitar.svg\"\n currentFrequency:currentFrequency\n state:guitarState\n targetNote:targetNote\n fft:fft\n waveform:waveform\n playRiff:playRiff\n isInTune:isInTune\n clean:clean\n detuneGuitar:detuneGuitar\n autotuneGuitar:autotuneGuitar\n playReference:playReference\n tunerVisualization:tunerVisualization\n playNotes:playNotes\n playScale:playScale\n playBeats:playBeats\n beatDiff:beatDiff\n /]\n[/Fixed]\n\n\n[section]\n# A Sad Guitar.\n\nTake a second and strum the guitar. It doesn't sound\nso good, does it?\n\nWe've just taken it out of storage and *it's all out of tune...*\n\n[/section]\n\n[section onEnterViewFully:`guitarState = 'headstock'; playScale = false;`]\n# Electric Tuner to the Rescue.\n\nTune the guitar using the tuner. Click and drag the tuning\nknobs on the right to tighten and loosen the strings.\n// Need a reward state to let them know when a string is in tune\n\n[Tuner selectedString:targetString currFreq:currentFrequency /]\n\n[conditional if:isInTune]\nGreat work, scroll on.\n[/conditional]\n\n[/section]\n\n[section onEnterViewFully:`guitarState = null; playScale = false; `]\n\n[conditional if:isInTune]\n\n# A Sigh of Relief.\n\nThat sounds so much better! What a difference a few hertz make. Go ahead and\nplay a little something.\n\n// audio clip of guitar shredding\n\n[div className:\"centered\"]\n[button onClick:`playRiff = true `]\n Play a lick.\n[/button]\n[/div]\n[/conditional]\n\n\n[conditional if:`!isInTune `]\n\n# Keep at it.\n// the text in this section should depend on whether or not the guitar is in tune\nThis doesn't sound in tune quite yet. Scroll back up and try to get all of the tuning knobs to turn green.\n\n[/conditional]\n\n[/section]\n\n[section onEnterViewFully:`guitarState = 'pickups'; playScale = true; `]\n# How does this thing work?\n\nGuitars generate noise through the vibration of their strings. On an electric guitar such as this one,\nmagnetic \"pick-ups\" convert those vibrations into an electrical signal which can then be sent to a tuner or an amplifier.\n\n\n[var name:\"waveInView\" value:false /]\n[WaveVisualizer\n waveform:waveform\n inView:waveInView\n onEnterView:`waveInView = true `\n onExitViewFully:`waveInView = false ` /]\n\nThis signal can be [visualized as a raw waveform](https://pudding.cool/2018/02/waveforms/), but\noften we want to visualize the frequency instead. The [fourier transform](https://jackschaedler.github.io/circles-sines-signals/dft_introduction.html) is a mathematical function\nthat reveals the audio frequencies hidden in that wave.\n\n[var name:\"freqInView\" value:false /]\n[FreqViz\n fft:fft\n inView:freqInView\n onEnterView:`freqInView = true `\n onExitViewFully:`freqInView = false ` /]\n\n\nStrum the guitar to see the frequency\nvisualized.\n\n[/section]\n\n[section onEnterViewFully:`guitarState = null; playReference = false; `]\n\n# Tuning by Ear.\n\nNow that we've tuned the guitar using a tuner, let's try to tune the guitar by ear.\nThis is more challenging, and it may take you time to master.\n\n[/section]\n\n[notification onEnterViewFully:` detuneGuitar = true; `]\nThe guitar is out of tune again!\n[/notification]\n\n[section onEnterViewFully:`guitarState = 'headstock'; playReference = true; tunerVisualization = false; `]\n# Match the Reference.\n\nWe'll start by tuning to a reference note. When you manipulate the tuners on the\nright the current note will be played, as will a reference note.\n\n[div className:\"centered\"]\n[button onClick:` clean = !clean `]\n [Display value:`clean ? \"Turn distortion on.\" : \"Turn distortion off.\" ` /]\n[/button]\n[/div]\n\nThis will be easier with a cleaner sound. Match the two\nsounds to get the guitar in tune.\n\n[/section]\n\n[section onEnterView:`playReference = false; autotuneGuitar = true; ` ]\n\n# Tuning Techniques.\n\n## Harmonic Intervals.\n// audio clip in text to illustrate intervals\n// guitar in tune here\n\nMost of the strings on a guitar are separated by an interval known as a *perfect fourth*.\n\n[div className:\"centered\"]\n[button className:\"interval\" onClick:` playNotes = 'E2:A2' `]\n♬ E2-A2\n[/button]\n[button className:\"interval\" onClick:` playNotes = 'A2:D3' `]\n♬ A2-D3\n[/button]\n[button className:\"interval\" onClick:` playNotes = 'D3:G3' `]\n♬ D3-G3\n[/button]\n[button className:\"interval\" onClick:` playNotes = 'B3:E4' `]\n♬ B3-E4\n[/button]\n[/div]\n\n The perfect fourth is beautifully resonant, but there's one pair of strings on a guitar which are not separated by a perfect fourth.\n\n The interval between the [equation]G[/equation] and [equation]B[/equation] strings is a *major third*. The major third sounds happy and uplifting.\n\n[div className:\"centered\"]\n[button className:\"interval\" onClick:` playNotes = 'G3:B3' `]\n♬ G3-B4\n[/button]\n[/div]\nThese intervals show up all the time in music, for example, the major third can be found the first two notes of [The Saints](https://en.wikipedia.org/wiki/ When_the_Saints_Go_Marching_In). The first two notes of [Amazing Grace](https://en.wikipedia.org/wiki/Amazing_Grace) form a perfect fourth.\n\nLearning to hear these intervals will help you tune your guitar without a tuner.\n\n## Find the beat.\n\n[p onEnterViewFully:` clean = true ` ]\nWhen two strings are played together, they produce a third higher frequency known as an overtone.\n[/p]\n\n// This overtune frequency is the least common multiple of the two component frequencies, which is amplified by the confluence of the two sound waves.\n\n// For the purpose of tuning a guitar by ear, you just need to recognize that when two strings are played together they result in a higher frequency. We can see this amplified overtone on the righthand side of the frequency visualizer.\n// show frequency visualizer here? trigger example?\n// However, when the two strings are not perfectly in tune, the overtone is amplified inconsistently over time.\n// This produces a rhythmic pulsing or \"beats\" in the overtone which you can hear if you listen carefully.\n\nWhen the two strings are not perfectly in tune, the overtone is inconsistent over time. This produces a wobbling, *a beat*, in the overtone which you can hear if you listen carefully.\n\nPlay notes with a [Dynamic value:beatDiff min:0 max:20 step:0.05 /] Hz difference:\n\n[div className:\"centered\"]\n [button onClick:` playBeats = true; ` ]\n Listen for the beats!\n [/button]\n [button onClick:` clean = !clean `]\n [Display value:`clean ? \"Turn distortion on.\" : \"Turn distortion off.\" ` /]\n [/button]\n[/div]\n\n// These beats also show up in the frequency visualizer.\n// here, an illustrative example of beats changing with intonation would be nice\n// will find audio file\n[var name:\"freq3InView\" value:false /]\n[FreqViz\n fft:fft\n inView:freq3InView\n showBeats:false\n onEnterView:`freq3InView = true `\n onExitViewFully:`freq3InView = false ` /]\n\nAs you get a pair of strings closer in tune, the beats will slow down until the overtone is perfectly amplified.\nListening for the slowing of these beats is a helpful cue for tuning.\n\n[/section]\n\n[section]\n\n# Practice makes perfect.\n\nTry tuning the guitar by listening for the relationships between adjacent strings and the beats in the resultant overtone.\n\n[var name:\"vizMode\" value:0 /]\n[div className:\"centered\"]\n\n[button onClick:` vizMode = (vizMode + 1) % 3 `]\n [Display value:`[\"Show tuner\", \"Show wave\", \"Show frequencies\"][vizMode] ` /]\n[/button]\n[button onClick:` clean = !clean `]\n [Display value:`clean ? \"Add distortion\" : \"Remove distortion\" ` /]\n[/button]\n[button className:\"tune-action\" onClick:` autotuneGuitar = true `]\nTune Guitar\n[/button]\n[button className:\"tune-action\" onClick:` detuneGuitar = true `]\nDetune Guitar\n[/button]\n[/div]\n\n[div className:\"centered\"]\n[/div]\n\n\n[var name:\"freq2InView\" value:false /]\n[div style:`{display: vizMode === 0 ? 'block' : 'none'}`]\n[FreqViz\n fft:fft\n inView:freq2InView\n onEnterView:`freq2InView = true `\n onExitViewFully:`freq2InView = false ` /]\n[/div]\n\n[div style:`{display: vizMode === 1 ? 'block' : 'none'}`]\n [Tuner selectedString:targetString currFreq:currentFrequency /]\n[/div]\n\n\n[div style:`{display: vizMode === 2 ? 'block' : 'none'}`]\n [WaveVisualizer waveform:waveform inView:`vizMode === 2` /]\n[/div]\n\n\n\n\n[/section]\n\n\n[section]\n\n# About this.\n\nThis page was built using [Idyll](https://idyll-lang.org), a\nmarkup language for interactive documents. The guitar was\ncreated using [Sketch Interactive Export](https://github.com/mathisonian/sketch-interactive-export),\n [D3](http://d3js.org/), and a modified version of [Tone.js](https://tonejs.github.io/). Audio samples were\n provided by [freesound.org user SpeedY](https://freesound.org/people/SpeedY/).\n\nThis project\nis from the [Interactive Data Lab](https://idl.cs.washington.edu/) at the [University of Washington](https://www.cs.washington.edu/).\n\n[/section]\n\n\n[analytics google:\"UA-108267630-1\" /]" ], "githubRepo": { "firstCommit": 2017, "stars": 1892, "forks": 92, "subscribers": 27, "created": 2017, "updated": 2022, "description": "Create explorable explanations and interactive essays.", "issues": 46, "url": "https://github.com/idyll-lang/idyll" }, "repoStats": { "firstCommit": 2017, "commits": 2835, "committers": 48, "files": 1557 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n15204241|Idyll: Interactive Document Language|https://idyll-lang.github.io/|2017-09-08 21:55:53 UTC|1504907753|abhirag|18|195", "twitter": "https://twitter.com/idyll_lang", "isbndb": "" }, "ifo": { "title": "IFO", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/124de5e6ae6ef78bd0b144e8915e88a9275ced2a" ], "country": [ "United States" ], "originCommunity": [ "University of Southern California" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3810", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "ifps": { "title": "IFPS", "appeared": 1970, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Texas at Austin" ], "wikipedia": { "summary": "IFPS (Interactive Financial Planning System) was a financial modeling language created by professor Gerald R. Wagner and his students of the University of Texas at Austin in the late 1970s. IFPS was marketed by Execucom, an Austin-based company started by Wagner. The company was acquired by Comshare in 1991.IFPS was available for a variety of platforms, including IBM mainframes (VM/CMS), DEC VAX, various flavors of Unix, DOS-based PCs and Macintosh Computers (named \"Mindsight\"- running on two floppies). There were a number of versions, from about 1985, including optimization and a data area for storing data separately from models. IFPS seems to have been an important inspiration for the Javelin financial modeling application. Some parts of the IFPS approach were later used by Lotus's Improv- like the separation of model logic and data. Difference to spreadsheet software (Lotus 1-2-3 and later Excel): Mainframe and PC/Mac versions of IFPS completely separated the logic model (connections between variables) and the data. Both were bound together by data placeholder (like \"earnings in Year1\" in the logic model - to easily run scenarios . (Spreadsheet) columns were represented by Name1, Name2, name3 etc. The model logic was written in lines with placeholder- oriented text ( \"earnings=sales-costs\" etc.). Comment lines on the model could be included anywhere with //. IFPS mainframe versions also allowed to simulate stochastic events by providing a range of probability distributions. The IFPS approach made it easy to communicate complex models even to laymen and managers. IFPS was eventually out-competed by spreadsheets. IFPS was an essential financial model-development tool for long range planning and strategic planning, popular business practices in the 1980's. As an \"English-like\" language, IFPS made it very simple to express relationships among financial concepts without having to worry about sequential logic, as the program would figure out dependencies among variables. This allowed for simple creation of both financial and managerial accounting statements. I was fortunate to work with IFPS for over ten years as an analyst at Champlin Petroleum aka. Union Pacific Resources. I also attended seminars and conferences put on by Gerald Wagner and his team at EXECUCOM. I believe it was the rise of risk management in the commodity industries over \"assumption-based\" techniques like long range planning, rather than spreadsheets per se, which contributed to IFPS loss in popularity. [Edit by David Benepe]", "created": 2007, "backlinksCount": 6, "pageId": 13985611, "revisionCount": 22, "dailyPageViews": 10, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/IFPS" }, "centralPackageRepositoryCount": 0 }, "igor-pro": { "title": "IGOR Pro", "appeared": 1993, "type": "pl", "reference": [ "https://groups.google.com/forum/#!search/igor-pro/comp.sys.mac.scitech/1QMC8N6AyLw/1Vvaa5rZPBwJ" ], "country": [ "United States" ], "originCommunity": [ "WaveMetrics, Inc" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasFunctions": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "keywords": [ "override", "ThreadSafe", "MultiThread", "static", "Proc", "Picture", "Prompt", "DoPrompt", "macro", "window", "function", "end", "Structure", "EndStructure", "EndMacro", "Menu", "SubMenu" ], "wikipedia": { "related": [ "c" ], "summary": "IGOR Pro is a scientific data analysis software, numerical computing environment and programming language that runs on Windows or Mac operating systems. It is developed by WaveMetrics Inc., and was originally aimed at time series analysis, but has since then evolved and covers other applications such as curve fitting and image processing. It comes with a fully functional programming language and compiler, but many functions are also accessible through menus. IGOR Pro is primarily known for its graphics capabilities, and like Origin and other similar programs, is often used to generate plots for scientific and other publications. Other features include the possibility of extending the built-in functions with external operations (XOP) allowing data acquisition, manipulation and analysis features, communication with external devices and in principle any other task that can be programmed in C or C++.", "created": 2005, "backlinksCount": 29, "pageId": 2515207, "revisionCount": 68, "dailyPageViews": 39, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/IGOR_Pro" }, "githubLanguage": { "fileExtensions": [ "ipf" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.igor", "aliases": [ "igor", "igorpro" ], "repos": 146, "id": "IGOR Pro" }, "githubBigQuery": { "repos": 80, "users": 48, "id": "IGOR Pro" }, "pygmentsHighlighter": { "filename": "igor.py", "fileExtensions": [ "ipf" ], "id": "Igor" }, "linguistGrammarRepo": { "sampleCount": 2, "example": [ "#pragma rtGlobals=3\n\nStrConstant myConstString=\"abcd\"\n// some comment\nconstant myConst=123\n\nStructure struct1\n\tstring str\n\tvariable var\nEndStructure\n\nstatic Structure struct2\n\tstring str\n\tvariable var\nEndStructure\n\n#include \"someFile\"\n\n#ifdef NOT_DEFINED\n\t// conditional compilation\n#endif\n" ], "url": "https://github.com/byte-physics/language-igor" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "iif": { "title": "Intuit Interchange Format", "appeared": 2004, "type": "textDataFormat", "standsFor": "Intuit Interchange Format", "country": [ "United States" ], "originCommunity": [ "Intuit Inc" ], "wikipedia": { "summary": "The IIF file format, Intuit Interchange Format is a proprietary text file used by Intuit's Quickbooks software for importing and exporting lists and transactions. As of 2004, QuickBooks can also import data using the XML-based qbXML file exchange format. The MIME‑types associated with .iif files are application/qbooks, application/qbookspro, and text/iif.", "backlinksCount": 6, "pageId": 9632310, "dailyPageViews": 16, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Intuit_Interchange_Format" } }, "iikuse": { "title": "iikuse", "appeared": 2010, "type": "esolang", "description": "I find constructed languages like Lojban and Ithkuil terribly interesting, but they are a bit too complex for me to actually pick up. So, being a programmer and a fan of FORTH, I decided to make a toy constructed language combining postfix notation and predicate logic.", "reference": [ "http://firstchurchofspacejesus.blogspot.com/2010/06/iikuse-toy-conlang-with-postfix.html" ], "country": [ "Unknown" ], "originCommunity": [ "http://firstchurchofspacejesus.blogspot.com" ], "example": [ "me i kusin - I saw it\nvi i kuduk - s/he will make it\nme vi i kudun kusis - I see that s/he made it\nvi me vi i kudun kusis vi i kudun kudis kuses - s/he says that the fact that I saw that s/he made it means that s/he made it\nme vi i.i.kuse kolos kases kalas koas - s/he and I belong to the set of i.i.kuse speakers.\nme vi i.i.kuse kolos kasen kalas koas - s/he and I belong to the set of former i.i.kuse speakers.\nme vi i.i.kuse kolos kases kalas koan - s/he and I used to belong to the set of i.i.kuse speakers." ] }, "iitran": { "title": "IITRAN", "appeared": 1969, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Illinois Institute of Technology" ], "wikipedia": { "related": [ "pl-i" ], "summary": "IITRAN is a discontinued programming language created in the mid-1960s. It was designed as a first language for students, and its syntax resembled that of PL/I. The name derives from Illinois Institute of Technology, where it was developed. The IITRAN language was initially implemented on an IBM System/360 DOS system. In the early 1970s, the IBM platform proved to be too small for the IIT environment and the hardware was upgraded. A new version was developed for the Univac 1108 platform. The language itself did not change but with the new hardware, a new implementation of the IITran software was developed. IITRAN was designed and developed in response to the increasing demand for a computer language which would meet the following specifications: It should be clear, concise, and easily learned, even for those who have had no previous experience with computers or mathematics; It should bear as close a resemblance as possible to the English language; It should be free of awkward restrictions and limitations; It should be consistent with mathematical and logical foundations; It should allow processing of a great number of individual programs in a very short time; It should serve as a computational tool for students of science and engineering; It should process a clear, easily understood, set of diagnostic error messages.(Bauer, p. V) There was a Spanish language version of IITRAN at IIT as well. It utilized Spanish keywords rather than English ones. For example the keyword read was replaced by leer.", "created": 2004, "backlinksCount": 7, "pageId": 586692, "revisionCount": 29, "dailyPageViews": 3, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/IITRAN" }, "hopl": "https://hopl.info/showlanguage.prx?exp=419", "centralPackageRepositoryCount": 0 }, "ikarus": { "title": "Ikarus Scheme implementation", "appeared": 2007, "type": "pl", "creators": [ "Abdulaziz Ghuloum" ], "documentation": [ "https://marcomaggi.github.io/docs/ikarus" ], "country": [ "United States" ], "originCommunity": [ "Indiana University" ], "wikipedia": { "related": [ "scheme", "c", "llvmir", "c--" ], "summary": "Ikarus Scheme is a free software optimizing incremental compiler for R6RS Scheme that compiles directly to the x86 architecture. Ikarus is the first public implementation of a large part of the R6RS Scheme standard.", "created": 2007, "backlinksCount": 12, "pageId": 14471916, "dailyPageViews": 6, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Ikarus_(Scheme_implementation)" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "ilbm": { "title": "ILBM", "appeared": 1985, "type": "binaryDataFormat", "country": [ "United States" ], "originCommunity": [ "Electronic Arts Inc" ], "wikipedia": { "summary": "Interleaved Bitmap (ILBM) is an image file format conforming to the Interchange File Format (IFF) standard. The format originated on the Amiga platform, and on IBM-compatible systems, files in this format or the related PBM (Planar Bitmap) format are typically encountered in games from late 1980s and early 1990s that were either Amiga ports or had their graphical assets designed on Amiga machines.A characteristic feature of the format is that it stores bitmaps in the form of interleaved bit planes, which gives the format its name; this reflects the way the Amiga graphics hardware natively reads graphics data from memory. A simple form of compression is supported to make ILBM files more compact.On the Amiga, these files are not associated with a particular file extension, though as they started being used on PC systems where extensions are systematically used, they employed a .lbm or occasionally a .bbm extension.", "backlinksCount": 152, "pageId": 265643, "dailyPageViews": 39, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/ILBM" } }, "ilu": { "title": "ILU", "appeared": 1994, "type": "pl", "reference": [ "https://ftp.icm.edu.pl/packages/ILU/2.0b1/manual-html/manual_19.html" ], "standsFor": "Inter-Language Unification", "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3631", "centralPackageRepositoryCount": 0 }, "ilx": { "title": "ILX", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7292709040051fdb1cc384fce8e3802525853cf0" ], "country": [ "United Kingdom" ], "originCommunity": [ "Microsoft Research" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3717", "centralPackageRepositoryCount": 0, "isbndb": "" }, "imac-machine": { "title": "IMac", "appeared": 1998, "type": "computingMachine", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/IMac" } }, "image": { "title": "IMAGE", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/519889ea68679493348a9b067600eebaa4598c9c" ], "country": [ "Canada" ], "originCommunity": [ "The Communications Research Centre Canada" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4135", "wordRank": 376, "centralPackageRepositoryCount": 0 }, "imaginary-number-equation": { "title": "Imaginary Number Equation", "appeared": 1572, "type": "equation", "equation": "i^2 = −1" }, "imandra": { "title": "Imandra Protocol Language", "appeared": 2017, "type": "pl", "website": "https://docs.imandra.ai/ipl/", "reference": [ "https://marketplace.visualstudio.com/items?itemName=aestheticintegration.ipl-vscode" ], "country": [ "United Kingdom" ], "originCommunity": [ "Aesthetic Integration Limited" ] }, "imap-protocol": { "title": "IMAP", "appeared": 1986, "type": "protocol", "standsFor": "Internet Message Access Protocol", "country": [ "United States" ], "originCommunity": [ "University of Stanford" ], "wikipedia": { "summary": "In computing, the Internet Message Access Protocol (IMAP) is an Internet standard protocol used by email clients to retrieve email messages from a mail server over a TCP/IP connection. IMAP is defined by RFC 3501. IMAP was designed with the goal of permitting complete management of an email box by multiple email clients, therefore clients generally leave messages on the server until the user explicitly deletes them. An IMAP server typically listens on port number 143. IMAP over SSL (IMAPS) is assigned the port number 993. Virtually all modern e-mail clients and servers support IMAP, which along with the earlier POP3 (Post Office Protocol) are the two most prevalent standard protocols for email retrieval. Many webmail service providers such as Gmail, Outlook.com and Yahoo! Mail also provide support for either IMAP or POP3.", "backlinksCount": 634, "pageId": 14837, "dailyPageViews": 697, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Internet_Message_Access_Protocol" }, "isbndb": "year|publisher|title|authors|isbn13\n2000|O'Reilly Media|Managing IMAP|Mullet, Dianna and Mullet, Kevin|9780596000127" }, "imba": { "title": "Imba", "appeared": 2014, "type": "pl", "description": "Imba is a Web programming language that's fast in two ways: Imba's time-saving syntax with built-in tags and styles results in less typing and switching files so you can build things fast. Imba's groundbreaking memoized DOM is an order of magnitude faster than virtual DOM libraries, so you can build fast things.", "website": "https://imba.io/", "country": [ "Norway and United States" ], "originCommunity": [ "https://github.com/imba/" ], "domainName": { "registered": 2013, "awisRank": { "2022": 1540067 }, "name": "imba.io" }, "compilesTo": [ "javascript" ], "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "tag app-canvas\n\tprop dpr = window.devicePixelRatio\n\tprop state = {}\n\n\tdef draw e\n\t\tlet path = e.#path ||= new Path2D\n\t\tlet ctx = $canvas.getContext('2d')\n\t\tpath.lineTo(e.x * dpr,e.y * dpr)\n\t\tctx.lineWidth = state.stroke * dpr\n\t\tctx.strokeStyle = state.color\n\t\tctx.stroke(path)\n\t\n\tdef resized e\n\t\t$canvas.width = offsetWidth * dpr\n\t\t$canvas.height = offsetHeight * dpr\n\n\t\n\t\t" ], "githubRepo": { "firstCommit": 2015, "stars": 5674, "forks": 170, "subscribers": 107, "created": 2014, "updated": 2022, "description": "🐤 The friendly full-stack language", "issues": 56, "url": "https://github.com/imba/imba" }, "repoStats": { "firstCommit": 2015, "commits": 3635, "committers": 42, "files": 1010 }, "isbndb": "" }, "imf": { "title": "imf", "appeared": 2008, "type": "textDataFormat", "reference": [ "https://www.loc.gov/preservation/digital/formats/fdd/fdd000393.shtml" ], "aka": [ "EML" ], "country": [ "United States" ], "originCommunity": [ "Qualcomm Inc" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "imp-lang": { "title": "imp-lang", "appeared": 2019, "type": "pl", "description": "The vision is of an emacs-y live self-modifying environment for working with structured data across multiple devices. The big moving parts are: a versioned relational database; an extensible GUI; a pure programming language built around relations; an interpreter with fast incremental view maintenance.", "website": "https://scattered-thoughts.net/writing/imp-intro/", "webRepl": [ "https://scattered-thoughts.net/imp" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/jamii/imp/issues" ], "example": [ "let colors = \"apples\" x \"red\" | \"apples\" x \"green\" | \"oranges\" x \"orange\" in\nlet fancy = \"red\" x \"scarlet\" | \"red\" x \"crimson\" | \"green\" x \"emerald\" in\n\"apples\" colors fancy" ], "semanticScholar": "" }, "imp": { "title": "IMP", "appeared": 1968, "type": "pl", "creators": [ "Edgar T. Irons" ], "country": [ "United States" ], "originCommunity": [ "National Security Agency" ], "wikipedia": { "example": [ " ::= ABS ( ) ::= DEWOP(214B,AREG1(1,13),A)" ], "related": [ "edinburgh-imp", "algol" ], "summary": "IMP is an early systems programming language that was developed by Edgar T. Irons in the late 1960s through early 1970s. Unlike most other systems programming languages, IMP was an extensible syntax programming language. Even though its designer refers to the language as \"being based on ALGOL\", IMP excludes many defining features of that language, while supporting a very non-ALGOL-like one: syntax extensibility. A compiler for IMP existed as early as 1965 and was used for programming the CDC 6600 time-sharing system, which was in use at the Institute for Defense Analyses since 1967. Although the compiler is slower than comparable ones for non-extensible languages, it has been used for practical production work. IMP compilers were developed for the CDC-6600, Cray, PDP-10 and PDP-11 computers. Important IMP versions were IMP65, IMP70, and IMP72.", "pageId": 859608, "created": 2004, "backlinksCount": 6, "revisionCount": 36, "dailyPageViews": 9, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/IMP_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "imp72": { "title": "IMP72", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d592594e5a882a2b22a0af49af441957813ef7ce" ], "country": [ "United States" ], "originCommunity": [ "Yale University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3923", "centralPackageRepositoryCount": 0 }, "impala": { "title": "Impala", "appeared": 2012, "type": "queryLanguage", "website": "https://impala.apache.org", "country": [ "United States" ], "originCommunity": [ "The Apache Software Foundation" ], "domainName": { "name": "impala.apache.org" }, "githubRepo": { "firstCommit": 2011, "stars": 833, "forks": 387, "subscribers": 67, "created": 2016, "updated": 2022, "description": "Apache Impala", "issues": 4, "url": "https://github.com/apache/impala" }, "repoStats": { "firstCommit": 2011, "commits": 11901, "committers": 298, "files": 6066 }, "wikipedia": { "related": [ "java", "sql", "pig", "aws" ], "summary": "Apache Impala is an open source massively parallel processing (MPP) SQL query engine for data stored in a computer cluster running Apache Hadoop. Impala has been described as the open-source equivalent of Google F1, which inspired its development in 2012.", "backlinksCount": 174, "pageId": 40147148, "created": 2013, "revisionCount": 62, "dailyPageViews": 120, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/Apache_Impala" }, "twitter": "https://twitter.com/apacheimpala", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013-12-24|Packt Publishing|Learning Cloudera Impala|Avkash Chauhan|9781783281282" }, "impl": { "title": "Industrial Modeling and Programming Language", "appeared": 2019, "type": "pl", "description": "IMPL is both a structure- and semantic-based machine-coded proprietary software language (closed-source) built upon the computer programming language Fortran to model and solve large-scale discrete, nonlinear and dynamic (DND) optimization and estimation problems found in the batch and continuous process industries such as oil and gas, petrochemicals, specialty and bulk chemicals, pulp and paper, energy, agro-industrial, mining and minerals, food and beverage just to name a few. The structures are based on modeling the superstructure (network, routings, flowsheet, etc.) with units, operations, ports and states (UOPSS) and the semantics (extent, magnitude, capacity, concentration, etc.) are based on quantity, logic and quality phenomenological (QLQP) variables for flows, holdups, yields, startups, setups, switchovers, shutdowns, densities, components, properties and conditions. Most community- and commercial-based MILP and NLP solvers are connected to IMPL to solve design, planning, scheduling, operations and process coordinating optimization problems as well as data reconciliation and parameter estimation problems with diagnostics of observability, redundancy and variability. Examples detailed in the chapter include industrial applications of poultry production planning with batch-lines, lubes sequence-dependent grade changeover sequencing and gasoline blend scheduling optimization with a user-directed heuristic to solve MINLP problems as MILP logistics with nominal quality cuts to approximate the nonlinearities from the blending. To summarize, IMPL may be considered as a confluence with the scientific disciplines of applied engineering, management and operations, computer science, information and communication technologies, statistics and now data science where optimization is known as decision science i.e., the science of decision-making.", "reference": [ "https://www.gurobi.com/products/optimization-modeling-language-resources-support/impl/" ], "standsFor": "Industrial Modeling and Programming Language", "country": [ "United States" ], "originCommunity": [ "Gurobi Optimization, LLC" ] }, "ina-jo": { "title": "Ina Jo", "appeared": 1985, "type": "pl", "reference": [ "http://www.dtic.mil/docs/citations/ADA173218", "https://apps.dtic.mil/sti/citations/ADA109317" ], "country": [ "United States" ], "originCommunity": [ "System Development Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1152", "centralPackageRepositoryCount": 0 }, "inc": { "title": "INC", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/92921ae8638264a64f1f10db439f98c53ea3e1a3" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5390", "wordRank": 1238, "centralPackageRepositoryCount": 0 }, "inchi": { "title": "International Chemical Identifier", "appeared": 2005, "type": "textDataFormat", "country": [ "United Kingdom" ], "originCommunity": [ "InChI Trust" ], "wikipedia": { "summary": "The IUPAC International Chemical Identifier (InChI IN-chee or ING-kee) is a textual identifier for chemical substances, designed to provide a standard way to encode molecular information and to facilitate the search for such information in databases and on the web. Initially developed by IUPAC (International Union of Pure and Applied Chemistry) and NIST (National Institute of Standards and Technology) from 2000 to 2005, the format and algorithms are non-proprietary. The continuing development of the standard has been supported since 2010 by the not-for-profit InChI Trust, of which IUPAC is a member. The current software version is 1.05 and was released in January 2017. Prior to 1.04, the software was freely available under the open-source LGPL license, but it now uses a custom license called IUPAC-InChI Trust License.", "backlinksCount": 17126, "pageId": 1995749, "dailyPageViews": 202, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/International_Chemical_Identifier" } }, "incipit": { "title": "Incipit", "appeared": 2021, "type": "textMarkup", "creators": [ "Lucas de Sena" ], "description": "The ‘Incipit Markup Language’ (or ‘Incipit’, for short) is a plain text markup language that uses Unicode characters and the structure of the text itself to format documents.", "country": [ "Brazil" ], "originCommunity": [ "https://github.com/phillbush/incipit/issues" ], "example": [ ".Enumeration incipit.\nEach enumeration item can have a incipit colon, which will be explained\non the “§ Incipit” section below. The incipit colon is a colon\ndescribing the topic of the item.\n\nThe following is an example of enumeration.\n• (A) First item:\n This is the first item of a labeled enumeration.\n This item also contains an incipit colon.\n• (B) Second item:\n This is the second item of a labeled enumeration.\n It also contains an incipit colon.\n• (C) Third item.\n • First subitem of third item.\n • Second subitem of third item.\n • Third subitem of third item.\n • Fourth subitem of third item.\n• (D) Fourth item." ], "githubRepo": { "firstCommit": 2021, "stars": 8, "forks": 0, "subscribers": 3, "created": 2021, "updated": 2021, "description": "the incipit plain text markup language, and some troff macro packages", "issues": 0, "url": "https://github.com/phillbush/incipit" }, "repoStats": { "firstCommit": 2021, "commits": 26, "committers": 2, "files": 11 } }, "indental": { "title": "Indental", "appeared": 2017, "type": "dataNotation", "description": "This space-sensitive database format is designed to store a dictionary of elements, accessible by name. The parser is a mere 50 lines, and allows for human-readable data structures for static sites such as Oscean, also see Tablatal. In the Indental file, an unindented line declares the key to a new root node, children lines can associate either parameters or lists to their parent node, a line divided with a colon will associate a value to a parameter to the parent node, and a sequence of equally indented lines will append to a list.", "website": "https://wiki.xxiivv.com/#indental", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/XXIIVV" ], "domainName": { "name": "wiki.xxiivv.com" }, "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "NAME\n KEY : VALUE\n LIST\n ITEM1\n ITEM2", "{NAME:{KEY:VALUE,LIST:[ITEM1,ITEM2])}" ], "semanticScholar": "" }, "infer": { "title": "INFER", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/27184821d21e662cbd0c1526995ff8499fc01419" ], "country": [ "United States" ], "originCommunity": [ "Indiana University" ], "wikipedia": { "related": [ "prolog", "owl", "axiom" ], "summary": "Inferences are steps in reasoning, moving from premises to logical consequences. Charles Sanders Peirce divided inference into three kinds: deduction, induction, and abduction. Deduction is inference deriving logical conclusions from premises known or assumed to be true, with the laws of valid inference being studied in logic. Induction is inference from particular premises to a universal conclusion. Abduction is inference to the best explanation. Human inference (i.e. how humans draw conclusions) is traditionally studied within the field of cognitive psychology; artificial intelligence researchers develop automated inference systems to emulate human inference. Statistical inference uses mathematics to draw conclusions in the presence of uncertainty. This generalizes deterministic reasoning, with the absence of uncertainty as a special case. Statistical inference uses quantitative or qualitative (categorical) data which may be subject to random variations.", "backlinksCount": 851, "pageId": 317465, "dailyPageViews": 13, "created": 2004, "appeared": 1950, "url": "https://en.wikipedia.org/wiki/Infer" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2114", "centralPackageRepositoryCount": 0 }, "infiniband-standard": { "title": "InfiniBand", "appeared": 1999, "type": "standard", "country": [ "United States" ], "originCommunity": [ "InfiniBand Trade Association" ], "wikipedia": { "dailyPageViews": 474, "url": "https://en.wikipedia.org/wiki/InfiniBand" } }, "influxdb": { "title": "InfluxDB", "appeared": 2013, "type": "database", "description": "Time-series database management system", "country": [ "United States" ], "originCommunity": [ "InfluxData" ] }, "infolog": { "title": "INFOLOG", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3384de1923f2f90443f267225426d3678ca16540" ], "country": [ "Portugal" ], "originCommunity": [ "Universidade de Lisboa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7118", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "inform": { "title": "Inform", "appeared": 1993, "type": "pl", "creators": [ "Graham Nelson" ], "website": "http://inform7.com/", "documentation": [ "https://ganelson.github.io/inform-website/doc/" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://inform-fiction.org/" ], "domainName": { "registered": 2009, "awisRank": { "2022": 2240286 }, "name": "inform7.com" }, "hasSemanticIndentation": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "\"Hello Deductible\" by \"I.F. Author\"\n\nThe story headline is \"An Interactive Example\".\n\nThe Living Room is a room. \"A comfortably furnished living room.\"\nThe Kitchen is north of the Living Room.\nThe Front Door is south of the Living Room.\nThe Front Door is a door. The Front Door is closed and locked.\n\nThe insurance salesman is a man in the Living Room. The description is \"An insurance salesman in a tacky polyester suit. He seems eager to speak to you.\" Understand \"man\" as the insurance salesman.\n\nA briefcase is carried by the insurance salesman. The description is \"A slightly worn, black briefcase.\" Understand \"case\" as the briefcase.\n\nThe insurance paperwork is in the briefcase. The description is \"Page after page of small legalese.\" Understand \"papers\" or \"documents\" or \"forms\" as the paperwork.\n\nInstead of listening to the insurance salesman: \n\tsay \"The salesman bores you with a discussion of life insurance policies. From his briefcase he pulls some paperwork which he hands to you.\";\n\tmove the insurance paperwork to the player." ], "related": [ "linux", "z-machine", "basic", "tads", "isbn" ], "summary": "Inform is a programming language and design system for interactive fiction originally created in 1993 by Graham Nelson. Inform can generate programs designed for the Z-code or Glulx virtual machines. Versions 1 through 5 were released between 1993 and 1996. Around 1996, Nelson rewrote Inform from first principles to create version 6 (or Inform 6). Over the following decade, version 6 became reasonably stable and a popular language for writing interactive fiction. In 2006, Nelson released Inform 7 (briefly known as Natural Inform), a completely new language based on principles of natural language and a new set of tools based around a book-publishing metaphor.", "pageId": 227989, "dailyPageViews": 73, "created": 2003, "backlinksCount": 129, "revisionCount": 426, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Inform" }, "githubLanguage": { "fileExtensions": [ "ni", "i7x" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.inform7", "wrap": true, "aliases": [ "i7", "inform7" ], "repos": 1046854, "id": "Inform 7" }, "githubBigQuery": { "repos": 60, "users": 56, "id": "Inform 7" }, "pygmentsHighlighter": { "filename": "int_fiction.py", "fileExtensions": [ "ni", "i7x" ], "id": "Inform 7" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 2, "commitCount": 29, "sampleCount": 2, "example": [ "\"Test Case\" by Andrew Plotkin.\n\nInclude Trivial Extension by Andrew Plotkin.\n\nVolume 1 - overview\n\nChapter - setting the scene\n\nThe Kitchen is a room.\n\n[Comment: this kitchen is modelled after the one in Zork, although it lacks the detail to establish this to the player.]\n\nSection - the kitchen table\n\nThe spicerack is a container in the Kitchen.\n\nTable of Spices\nName Flavor\n\"cinnamon\" 5\n\"nutmeg\" 4\n\"szechuan pepper\" 8\n\nThe description of the spicerack is \"It's mostly empty.\"\n\nChapter - a character\n\nA purple cow called Gelett is in the Kitchen.\n\n[This comment spans multiple lines..\n\n...and this line contains [nested square[] brackets]...\n\n...which is legal in Inform 7.]\n\nInstead of examining Gelett:\n say \"You'd rather see than be one.\"\n\nInstead of examining Gelett:\n say \"You'd rather see than be one.\"\n\nCheck smelling Gelett:\n say \"This text contains several lines.\n\nA blank line is displayed as a paragraph break,\nbut a simple line break is not.\";\n stop the action.\n\nSection - cow catching\n\nGelett has a number called the mooness.\n\nInstead of taking Gelett:\n increment the mooness of Gelett;\n if the mooness of Gelett is one:\n say \"Gelett moos once.\";\n else:\n say \"Gelett moos [mooness of Gelett in words] times.\";\n\nVolume 2 - the turn cycle\n\nEvery turn:\n say \"A turn passes[one of][or] placidly[or] idly[or] tediously[at random].\"\n" ], "url": "https://github.com/erkyrath/language-inform7" }, "helloWorldCollection": [ "! \"Hello world\" in Inform\n[ Main;\n print \"Hello world^\";\n];\n" ], "leachim6": { "filepath": "i/Inform.inform", "fileExtensions": [ "inform" ], "example": [ "\"Hello World\" by \"I.F. Author\"\n\nThe world is a room.\n\nWhen play begins, say \"Hello World\"\n" ], "id": "Inform" }, "tiobe": { "id": "Inform" }, "fileType": "text", "wordRank": 5526, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010|Cengage Learning PTR|Creating Interactive Fiction with Inform 7|Reed, Aaron|9781435455061\n2010|Cengage Learning|Creating Interactive Fiction With Inform 7, 1st Edition|Aaron Reed|9781435456044", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|\"Risk tells us who, but not what or how\"\" empirical assessment of the complexity of criminogenic needs to inform correctional programming\"|10.1111/1745-9133.12116|83|7|F. Taxman and Michael Caudy|4f30eee81fca9b7245fb56614b9fb17dbca51e51\n2018|Dyadic Team Interaction and Shared Cognition to Inform Human-Robot Teaming|10.1177/1541931218621028|5|0|Mustafa Demir and Nathan J. Mcneese and N. Cooke|e945025d277c504177381151cd1660f7978a42f6\n2010|Experience report: using hackage to inform language design|10.1145/1863523.1863531|5|3|J. Garrett Morris|66b79681c5df7796e575a514a517fe374126bd7c\n2021|Using Text Mining Tools to Inform Search Term Generation: An Introduction for Librarians|10.1353/pla.2021.0032|2|0|B. McGowan|97449aa1701fa6d6b3e5a4b6d4f228d82d83c279\n2020|Utilizing Web Scraping and Natural Language Processing to Better Inform Pedagogical Practice|10.1109/FIE44824.2020.9274270|1|0|Stephanie J. Lunn and Jia Zhu and Monique S. Ross|a95e90c6c9c5753339e93548eebdcde1ea5b27e2" }, "information-algebra": { "title": "Information Algebra", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7dca3656a5e3fc381ecd68eeb1e0fd4d90992076" ], "country": [ "United States" ], "originCommunity": [ "System Development Corporation", "Honeywell International Inc", "RAND Corporation", "IBM", "United States Navy", "National Cash Register Corporation", "General Electric Company" ], "wikipedia": { "summary": "The term \"information algebra\" refers to mathematical techniques of information processing. Classical information theory goes back to Claude Shannon. It is a theory of information transmission, looking at communication and storage. However, it has not been considered so far that information comes from different sources and that it is therefore usually combined. It has furthermore been neglected in classical information theory that one wants to extract those parts out of a piece of information that are relevant to specific questions. A mathematical phrasing of these operations leads to an algebra of information, describing basic modes of information processing. Such an algebra involves several formalisms of computer science, which seem to be different on the surface: relational databases, multiple systems of formal logic or numerical problems of linear algebra. It allows the development of generic procedures of information processing and thus a unification of basic methods of computer science, in particular of distributed information processing. Information relates to precise questions, comes from different sources, must be aggregated, and can be focused on questions of interest. Starting from these considerations, information algebras (Kohlas 2003) are two-sorted algebras ( Φ , D ) {\\displaystyle (\\Phi ,D)\\,} , where Φ {\\displaystyle \\Phi \\,} is a semigroup, representing combination or aggregation of information, D {\\displaystyle D\\,} is a lattice of domains (related to questions) whose partial order reflects the granularity of the domain or the question, and a mixed operation representing focusing or extraction of information.", "backlinksCount": 25, "pageId": 5259526, "dailyPageViews": 9, "created": 2006, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Information_algebra" }, "hopl": "https://hopl.info/showlanguage.prx?exp=164", "centralPackageRepositoryCount": 0 }, "information-processing-language": { "title": "Information Processing Language", "appeared": 1954, "type": "pl", "standsFor": "Information Processing Language", "aka": [ "ipl" ], "country": [ "United States" ], "originCommunity": [ "RAND Corporation", "Carnegie Institute of Technology" ], "wikipedia": { "related": [ "assembly-language", "lisp" ], "summary": "Information Processing Language (IPL) is a programming language created by Allen Newell, Cliff Shaw, and Herbert A. Simon at RAND Corporation and the Carnegie Institute of Technology at about 1956. Newell had the job of language specifier-application programmer, Shaw was the system programmer, and Simon took the job of application programmer-user. The language includes features intended to help with programs that perform simple problem solving actions such as lists, dynamic memory allocation, data types, recursion, functions as arguments, generators, and cooperative multitasking. IPL invented the concept of list processing, albeit in an assembly-language style.", "created": 2003, "backlinksCount": 51, "pageId": 303031, "revisionCount": 93, "dailyPageViews": 50, "appeared": 1956, "url": "https://en.wikipedia.org/wiki/Information_Processing_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=13", "centralPackageRepositoryCount": 0 }, "information-theory-equation": { "title": "Information Theory Equation", "appeared": 1948, "type": "equation", "creators": [ "Claude Shannon" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Entropy_(information_theory)" } }, "informix": { "title": "IBM Informix-4GL", "appeared": 1985, "type": "queryLanguage", "description": "It includes embedded SQL, a report writer language, a form language, and a limited set of imperative capabilities (functions, if and while statements, and supports arrays etc.). The language is particularly close to a natural language and is easy to learn and use.", "originCommunity": [ "IBM" ], "example": [ "SELECT UNIQUE city, state, zipcode, sname\nFROM customer, state\nWHERE customer.state = state.code" ], "wikipedia": { "related": [ "java" ], "summary": "Informix-4GL is a 4GL programming language developed by Informix during the mid-1980s.", "pageId": 252830, "created": 2003, "backlinksCount": 17, "revisionCount": 105, "dailyPageViews": 29, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/IBM_Informix-4GL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3472", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAdvanced Informix-4gl Programming|1995|Art Taylor|4510392|0.0|0|0\nBuilding Datablades for Informix Universal Server [With Contains Informix Datablades Developer's Kit]||Michael Keeler|20855954|0.0|0|0" }, "infusion-framework": { "title": "infusion-framework", "appeared": 2007, "type": "framework", "website": "http://fluidproject.org/infusion.html", "reference": [ "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/fluid-project" ], "githubRepo": { "firstCommit": 2007, "stars": 130, "forks": 97, "subscribers": 21, "created": 2011, "updated": 2022, "description": "Infusion is a web framework that supports inclusive design.", "issues": 13, "url": "https://github.com/fluid-project/infusion" } }, "ingres": { "title": "Ingres database", "appeared": 1974, "type": "database", "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Ingres_(database)" } }, "ini": { "title": "Ini", "appeared": 1987, "type": "dataNotation", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasComments": { "example": "# a '#' or ';' character indicates\n; a comment", "value": true }, "hasEscapeCharacters": { "example": "; \\\" \\\\ \\n \\t \\b\n[section \"subsection with \\\"quotes\\\"\"]", "value": true }, "hasAssignment": { "example": "[branch \"master\"]\nremote = origin\nmerge = refs/heads/master", "value": true }, "isCaseSensitive": { "example": "[subsections \"areCaseSensitive\"]", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ], [ ";" ] ], "example": [ "; last modified 1 April 2001 by John Doe\n[owner]\nname = John Doe\norganization = Acme Widgets Inc.\n\n[database]\n; use IP address in case network name resolution is not working\nserver = 192.0.2.62 \nport = 143\nfile = \"payroll.dat\"" ], "wikipedia": { "example": [ "GetPrivateProfileString(\"owner\", \"name\", ... , \"c:\\\\programs\\\\oldprogram\\\\dbsettings.ini\");" ], "related": [ "xml", "linux", "unix", "php", "unicode", "c", "json", "yaml" ], "summary": "The INI file format is an informal standard for configuration files for some platforms or software. INI files are simple text files with a basic structure composed of sections, properties, and values. In MS-DOS and 16-bit Windows platforms up through Windows ME, the INI file served as the primary mechanism to configure operating system and installed applications features, such as device drivers, fonts, startup launchers, and things that needed to be initialized in booting Windows. INI files were also generally used by applications to store their individual settings. Starting with Windows NT, Microsoft favored the use of the registry, and began to steer developers away from using INI files for configuration. All subsequent versions of Windows have used the Windows Registry for system configuration, and applications built on the .NET Framework use special XML .config files. The APIs still exist in Windows, however, and developers may still use them. The name \"INI file\" comes from the commonly used filename extension .INI, which stands for \"initialization\". Other common initialization file extensions are .CFG, .conf, and .TXT, especially CONFIG.SYS and 'config.txt' occurrences. Linux and Unix systems also use a similar file format for system configuration. In addition, platform-agnostic software may use this file format for configuration. It is human-readable and simple to parse, so it is a usable format for configuration files that do not require much greater complexity. For example, the platform-agnostic PHP uses the INI format for its \"php.ini\" configuration file in both Windows and Linux systems. Desktop.ini files determine how a folder is displayed by Windows, such as the icon used by that folder.", "pageId": 1908172, "dailyPageViews": 546, "created": 2005, "backlinksCount": 74, "revisionCount": 437, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/INI_file" }, "githubLanguage": { "fileExtensions": [ "ini", "cfg", "dof", "lektorproject", "prefs", "pro", "properties", "url" ], "trendingProjectsCount": 0, "type": "data", "filenames": [ ".coveragerc", ".flake8", ".pylintrc", "buildozer.spec", "pylintrc" ], "aceMode": "ini", "codemirrorMode": "properties", "codemirrorMimeType": "text/x-properties", "tmScope": "source.ini", "aliases": [ "dosini" ], "repos": 13, "id": "INI" }, "githubBigQuery": { "repos": 1, "users": 1, "id": "INI" }, "antlr": "https://github.com/afucher/yaip", "monaco": "ini", "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "ini", "cfg", "inf", ".editorconfig", "service", "socket", "device", "mount", "automount", "swap", "target", "path", "timer", "slice", "scope" ], "id": "INI" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2013, "committerCount": 6, "commitCount": 26, "sampleCount": 6, "example": [ "title=Mindstorms\nisbn=0465046290\nauthor=Seymour Papert\npubmonth=198001\nsubject=children computers powerful ideas LOGO education\nurl=http://www.papert.org/" ], "url": "https://github.com/textmate/ini.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "ink-lang": { "title": "ink-lang", "appeared": 2019, "type": "pl", "creators": [ "Linus Lee" ], "website": "https://dotink.co", "country": [ "United States" ], "originCommunity": [ "https://github.com/thesephist/ink/issues" ], "domainName": { "registered": 2019, "awisRank": { "2022": 6765719 }, "name": "dotink.co" }, "example": [ "std := load('std')\n\nlog := std.log\n\nlisten('0.0.0.0:8080', evt => (\n evt.type :: {\n 'error' -> log('Error: ' + evt.message)\n 'req' -> (evt.end)({\n status: 200\n headers: {'Content-Type': 'text/plain'}\n body: 'Hello, World!'\n })\n }\n))" ], "githubRepo": { "firstCommit": 2019, "stars": 489, "forks": 7, "subscribers": 7, "created": 2019, "updated": 2022, "description": "Ink is a minimal programming language inspired by modern JavaScript and Go, with functional style.", "issues": 1, "url": "https://github.com/thesephist/ink" }, "repoStats": { "firstCommit": 2019, "commits": 373, "committers": 1, "files": 52 }, "twitter": "https://twitter.com/thesephist" }, "ink": { "title": "ink", "appeared": 2015, "type": "esolang", "creators": [ "Joseph Humfrey" ], "description": "Ink is inkle's scripting language for writing interactive narrative, both for text-centric games as well as more graphical games that contain highly branching stories.", "website": "http://www.inklestudios.com/ink", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/inkle" ], "example": [ "- I looked at Monsieur Fogg \n* ... and I could contain myself no longer.\n 'What is the purpose of our journey, Monsieur?'\n 'A wager,' he replied.\n * * 'A wager!'[] I returned.\n He nodded. \n * * * 'But surely that is foolishness!'\n * * * 'A most serious matter then!'\n - - - He nodded again.\n * * * 'But can we win?'\n 'That is what we will endeavour to find out,' he answered.\n * * * 'A modest wager, I trust?'\n 'Twenty thousand pounds,' he replied, quite flatly.\n * * * I asked nothing further of him then[.], and after a final, polite cough, he offered nothing more to me. <>\n * * 'Ah[.'],' I replied, uncertain what I thought.\n - - After that, <>\n* ... but I said nothing[] and <> \n- we passed the day in silence.\n- -> END " ], "githubRepo": { "firstCommit": 2015, "stars": 3218, "forks": 411, "subscribers": 117, "created": 2016, "updated": 2022, "description": "inkle's open source scripting language for writing interactive narrative.", "issues": 288, "url": "https://github.com/inkle/ink" }, "repoStats": { "firstCommit": 2015, "commits": 1517, "committers": 74, "files": 146 }, "leachim6": { "filepath": "i/Ink.ink", "fileExtensions": [ "ink" ], "example": [ "Hello World\n" ], "id": "Ink" }, "rijuRepl": { "example": [ "std := load('../../../opt/ink/std')\nstr := load('../../../opt/ink/str')\n\nlog := std.log\n\nlog('Hello, world!')\n" ], "id": "https://riju.codes/ink" }, "twitter": "https://twitter.com/inklestudios", "fileType": "text", "wordRank": 3033, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "inko": { "title": "inko", "appeared": 2015, "type": "pl", "creators": [ "Yorick Peterse" ], "description": "Inko is a gradually typed, interpreted, object-oriented programming language drawing inspiration from languages such as Smalltalk, Self, Ruby, Erlang and Rust.", "website": "http://inko-lang.org/", "country": [ "The Netherlands" ], "originCommunity": [ "https://gitlab.com/inko-lang/" ], "domainName": { "registered": 2016, "awisRank": { "2022": 4855507 }, "name": "inko-lang.org" }, "githubRepo": { "stars": 170, "forks": 16, "subscribers": 10, "created": 2015, "updated": 2022, "firstCommit": 2015, "description": "Inko is a statically-typed, safe, object-oriented programming language for writing concurrent programs. This is a read-only mirror of https://gitlab.com/inko-lang/inko", "issues": 24, "url": "https://github.com/YorickPeterse/inko" }, "repoStats": { "firstCommit": 2015, "commits": 2054, "committers": 7, "files": 317 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17702237|Show HN: Inko – A safe and concurrent object-oriented programming language|2018-08-06 22:14:06 UTC|1533593646|YorickPeterse|45|95", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "inmagic": { "title": "INMAGIC", "appeared": 1983, "type": "pl", "reference": [ "http://support.inmagic.com/Web/DBTWandWPP900/DBTextWorksv9UsersManual.pdf" ], "country": [ "United States" ], "originCommunity": [ "Inmagic, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4524", "centralPackageRepositoryCount": 0 }, "inno-setup": { "title": "Inno Setup", "appeared": 1997, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://jrsoftware.org/" ], "wikipedia": { "related": [ "delphi", "ia-32", "ini", "pascal", "unicode" ], "summary": "Inno Setup is a free software script-driven installation system created in Delphi by Jordan Russell. The first version was released in 1997.", "backlinksCount": 27, "pageId": 5715341, "created": 2006, "revisionCount": 231, "dailyPageViews": 54, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Inno_Setup" }, "githubLanguage": { "fileExtensions": [ "iss", "isl" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ndocker toolbox https://github.com/docker.png https://github.com/docker/toolbox \"Inno Setup\" #ccc 2137 698 94 \"The Docker Toolbox\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "tmScope": "source.inno", "repos": 178157, "id": "Inno Setup" }, "githubBigQuery": { "repos": 3719, "users": 3409, "id": "Inno Setup" }, "linguistGrammarRepo": { "sampleCount": 1, "example": [ "; Basic setup script for the Inno Setup installer builder. For more\n; information on the free installer builder, see www.jrsoftware.org.\n;\n; This script was contributed by Tim Peters.\n; It was designed for Inno Setup 2.0.19 but works with later versions as well.\n\n[Setup]\nAppName=Expat\nAppId=expat\nAppVersion=2.1.0\nAppVerName=Expat 2.1.0\nAppCopyright=Copyright 1998-2012 Thai Open Source Software Center, Clark Cooper, and the Expat maintainers\nAppPublisher=The Expat Developers\nAppPublisherURL=http://www.libexpat.org/\nAppSupportURL=http://www.libexpat.org/\nAppUpdatesURL=http://www.libexpat.org/\nUninstallDisplayName=Expat XML Parser 2.1.0\nVersionInfoVersion=2.1.0\n\nDefaultDirName={pf}\\Expat 2.1.0\nUninstallFilesDir={app}\\Uninstall\n\nCompression=lzma\nSolidCompression=yes\nSourceDir=..\nOutputDir=win32\nDisableStartupPrompt=yes\nAllowNoIcons=yes\nDisableProgramGroupPage=yes\nDisableReadyPage=yes\n\n[Files]\nFlags: ignoreversion; Source: win32\\bin\\Release\\xmlwf.exe; DestDir: \"{app}\\Bin\"\nFlags: ignoreversion; Source: win32\\MANIFEST.txt; DestDir: \"{app}\"\nFlags: ignoreversion; Source: Changes; DestDir: \"{app}\"; DestName: Changes.txt\nFlags: ignoreversion; Source: COPYING; DestDir: \"{app}\"; DestName: COPYING.txt\nFlags: ignoreversion; Source: README; DestDir: \"{app}\"; DestName: README.txt\nFlags: ignoreversion; Source: doc\\*.html; DestDir: \"{app}\\Doc\"\nFlags: ignoreversion; Source: doc\\*.css; DestDir: \"{app}\\Doc\"\nFlags: ignoreversion; Source: doc\\*.png; DestDir: \"{app}\\Doc\"\nFlags: ignoreversion; Source: win32\\bin\\Release\\*.dll; DestDir: \"{app}\\Bin\"\nFlags: ignoreversion; Source: win32\\bin\\Release\\*.lib; DestDir: \"{app}\\Bin\"\nFlags: ignoreversion; Source: expat.dsw; DestDir: \"{app}\\Source\"\nFlags: ignoreversion; Source: win32\\README.txt; DestDir: \"{app}\\Source\"\nFlags: ignoreversion; Source: bcb5\\*.bp*; DestDir: \"{app}\\Source\\bcb5\"\nFlags: ignoreversion; Source: bcb5\\*.mak; DestDir: \"{app}\\Source\\bcb5\"\nFlags: ignoreversion; Source: bcb5\\*.def; DestDir: \"{app}\\Source\\bcb5\"\nFlags: ignoreversion; Source: bcb5\\*.txt; DestDir: \"{app}\\Source\\bcb5\"\nFlags: ignoreversion; Source: bcb5\\*.bat; DestDir: \"{app}\\Source\\bcb5\"\nFlags: ignoreversion; Source: lib\\*.c; DestDir: \"{app}\\Source\\lib\"\nFlags: ignoreversion; Source: lib\\*.h; DestDir: \"{app}\\Source\\lib\"\nFlags: ignoreversion; Source: lib\\*.def; DestDir: \"{app}\\Source\\lib\"\nFlags: ignoreversion; Source: lib\\*.dsp; DestDir: \"{app}\\Source\\lib\"\nFlags: ignoreversion; Source: examples\\*.c; DestDir: \"{app}\\Source\\examples\"\nFlags: ignoreversion; Source: examples\\*.dsp; DestDir: \"{app}\\Source\\examples\"\nFlags: ignoreversion; Source: tests\\*.c; DestDir: \"{app}\\Source\\tests\"\nFlags: ignoreversion; Source: tests\\*.cpp; DestDir: \"{app}\\Source\\tests\"\nFlags: ignoreversion; Source: tests\\*.h; DestDir: \"{app}\\Source\\tests\"\nFlags: ignoreversion; Source: tests\\README.txt; DestDir: \"{app}\\Source\\tests\"\nFlags: ignoreversion; Source: tests\\benchmark\\*.c; DestDir: \"{app}\\Source\\tests\\benchmark\"\nFlags: ignoreversion; Source: tests\\benchmark\\*.ds*; DestDir: \"{app}\\Source\\tests\\benchmark\"\nFlags: ignoreversion; Source: tests\\benchmark\\README.txt; DestDir: \"{app}\\Source\\tests\\benchmark\"\nFlags: ignoreversion; Source: xmlwf\\*.c*; DestDir: \"{app}\\Source\\xmlwf\"\nFlags: ignoreversion; Source: xmlwf\\*.h; DestDir: \"{app}\\Source\\xmlwf\"\nFlags: ignoreversion; Source: xmlwf\\*.dsp; DestDir: \"{app}\\Source\\xmlwf\"\n\n[Messages]\nWelcomeLabel1=Welcome to the Expat XML Parser Setup Wizard\nWelcomeLabel2=This will install [name/ver] on your computer.%n%nExpat is an XML parser with a C-language API, and is primarily made available to allow developers to build applications which use XML using a portable API and fast implementation.%n%nIt is strongly recommended that you close all other applications you have running before continuing. This will help prevent any conflicts during the installation process.\n" ], "url": "https://github.com/idleberg/atom-language-innosetup" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "inquire": { "title": "INQUIRE", "appeared": 1969, "type": "queryLanguage", "reference": [ "https://www.ibm.com/docs/en/txseries/9.1?topic=SSAL2T_9.1.0/com.ibm.cics.tx.doc/reference/r_inquire_program.htm", "https://www.ibm.com/support/knowledgecenter/en/SSGMGV_3.1.0/com.ibm.cics.ts31.doc/dfha8/dfha8db.htm", "https://www.ibm.com/support/pages/history-cics-transaction-server" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4525", "wordRank": 8951, "centralPackageRepositoryCount": 0, "isbndb": "" }, "inscan": { "title": "Inscan", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c59c29522b274aceaa5f1a637c0f1d2734a981af" ], "country": [ "United States" ], "originCommunity": [ "Auerbach Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4749", "centralPackageRepositoryCount": 0 }, "insight": { "title": "INSIGHT", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/22488a9e23dce2625aa5dc8e99c42b610b1a6b3e" ], "country": [ "United States" ], "originCommunity": [ "Regenstrief Institute for Health Care" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1038", "wordRank": 4791, "centralPackageRepositoryCount": 0 }, "insitux": { "title": "Insitux", "appeared": 2021, "type": "pl", "creators": [ "Patrick Bowen" ], "website": "https://insitux.github.io/", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/phunanon/Insitux/issues" ], "githubRepo": { "firstCommit": 2021, "stars": 26, "forks": 4, "subscribers": 4, "created": 2021, "updated": 2022, "description": "An extensible scripting language made to be situated in tough spots like Roblox games.", "issues": 7, "url": "https://github.com/phunanon/Insitux" }, "repoStats": { "firstCommit": 2021, "commits": 384, "committers": 6, "files": 55 } }, "instruction-list": { "title": "Instruction list", "appeared": 2000, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "International Electrotechnical Commission" ], "wikipedia": { "summary": "Instruction List (IL) is one of the 5 languages supported by the IEC 61131-3 standard. It is designed for programmable logic controllers (PLCs). It is a low level language and resembles assembly. All of the languages share IEC61131 Common Elements. The variables and function call are defined by the common elements so different languages can be used in the same program. Program control (control flow) is achieved by jump instructions and function calls (subroutines with optional parameters). The file format has now been standardized to XML by PLCopen.", "backlinksCount": 16, "pageId": 3433425, "dailyPageViews": 56, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Instruction_list" }, "isbndb": "" }, "integer-basic": { "title": "Integer BASIC", "appeared": 1977, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "related": [ "hp-time-shared-basic", "applesoft-basic", "basic", "microsoft-basic", "altair-basic", "assembly-language" ], "summary": "Integer BASIC, written by Steve Wozniak, is the BASIC interpreter of the Apple I and original Apple II computers. Originally available on cassette, then included in ROM on the original Apple II computer at release in 1977, it was the first version of BASIC used by many early home computer owners.Integer BASIC was phased out in favor of Applesoft BASIC starting with the Apple II Plus in 1979. This was a licensed but modified version of Microsoft BASIC, which included the floating point support missing in Integer BASIC.", "created": 2003, "backlinksCount": 116, "pageId": 310928, "revisionCount": 153, "dailyPageViews": 32, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Integer_BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "integral-equation": { "title": "Integral Equation", "appeared": 1888, "type": "equation", "creators": [ "Isaac Newton" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Integral" }, "leachim6": { "filepath": "i/Integral", "example": [ "⌡Hello World\n" ], "id": "Integral" } }, "intellijidea-editor": { "title": "intellijidea-editor", "appeared": 2001, "type": "editor", "country": [ "Czech Republic" ], "originCommunity": [ "JetBrains s.r.o." ] }, "interactive": { "title": "INTERACTIVE", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1b920cb812e6dfddbb31240b039adbc668e3cbb0" ], "country": [ "United States" ], "originCommunity": [ "Northeastern University", "Oakland University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1039", "wordRank": 2226, "centralPackageRepositoryCount": 0 }, "interbase": { "title": "InterBase", "appeared": 1985, "type": "database", "description": "Relational database management system (RDBMS)", "country": [ "United States" ], "originCommunity": [ "Embarcadero Technologies" ] }, "intercal": { "title": "INTERCAL", "appeared": 1972, "type": "esolang", "country": [ "United States" ], "originCommunity": [ "Princeton University" ], "wikipedia": { "example": [ "DO ,1 <- #13\nPLEASE DO ,1 SUB #1 <- #238\nDO ,1 SUB #2 <- #108\nDO ,1 SUB #3 <- #112\nDO ,1 SUB #4 <- #0\nDO ,1 SUB #5 <- #64\nDO ,1 SUB #6 <- #194\nDO ,1 SUB #7 <- #48\nPLEASE DO ,1 SUB #8 <- #22\nDO ,1 SUB #9 <- #248\nDO ,1 SUB #10 <- #168\nDO ,1 SUB #11 <- #24\nDO ,1 SUB #12 <- #16\nDO ,1 SUB #13 <- #162\nPLEASE READ OUT ,1\nPLEASE GIVE UP" ], "related": [ "ascii", "utf-8", "c" ], "summary": "The Compiler Language With No Pronounceable Acronym, abbreviated INTERCAL, is an esoteric programming language that was created as a parody by Don Woods and James M. Lyon, two Princeton University students, in 1972. It satirizes aspects of the various programming languages at the time, as well as the proliferation of proposed language constructs and notations in the 1960s. There are two currently maintained versions of INTERCAL: C-INTERCAL, maintained by Eric S. Raymond, and CLC-INTERCAL, maintained by Claudio Calvelli.", "pageId": 15075, "dailyPageViews": 140, "created": 2001, "backlinksCount": 69, "revisionCount": 332, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/INTERCAL" }, "helloWorldCollection": [ "Hello World in Intercal\n\nDO ,1 <- #13\nPLEASE DO ,1 SUB #1 <- #234\nDO ,1 SUB #2 <- #112\nDO ,1 SUB #3 <- #112\nDO ,1 SUB #4 <- #0\nDO ,1 SUB #5 <- #64\nDO ,1 SUB #6 <- #194\nDO ,1 SUB #7 <- #48\nPLEASE DO ,1 SUB #8 <- #22\nDO ,1 SUB #9 <- #248\nDO ,1 SUB #10 <- #168\nDO ,1 SUB #11 <- #24\nDO ,1 SUB #12 <- #16\nDO ,1 SUB #13 <- #214\nPLEASE READ OUT ,1\nPLEASE GIVE UP" ], "leachim6": { "filepath": "i/Intercal.i", "fileExtensions": [ "i" ], "example": [ "DO ,1 <- #13\nPLEASE DO ,1 SUB #1 <- #238\nDO ,1 SUB #2 <- #108\nDO ,1 SUB #3 <- #112\nDO ,1 SUB #4 <- #0\nDO ,1 SUB #5 <- #64\nDO ,1 SUB #6 <- #194\nDO ,1 SUB #7 <- #48\nPLEASE DO ,1 SUB #8 <- #22\nDO ,1 SUB #9 <- #248\nDO ,1 SUB #10 <- #168\nDO ,1 SUB #11 <- #24\nDO ,1 SUB #12 <- #16\nDO ,1 SUB #13 <- #162\nPLEASE READ OUT ,1\nPLEASE GIVE UP\n" ], "id": "Intercal" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Intercal", "quineRelay": "INTERCAL", "rijuRepl": { "example": [ "DO ,1 <- #14\nPLEASE DO ,1 SUB #1 <- #238\nDO ,1 SUB #2 <- #108\nDO ,1 SUB #3 <- #112\nDO ,1 SUB #4 <- #0\nDO ,1 SUB #5 <- #64\nDO ,1 SUB #6 <- #194\nDO ,1 SUB #7 <- #48\nPLEASE DO ,1 SUB #8 <- #22\nDO ,1 SUB #9 <- #248\nDO ,1 SUB #10 <- #168\nDO ,1 SUB #11 <- #24\nDO ,1 SUB #12 <- #16\nPLEASE DO ,1 SUB #13 <- #162\nDO ,1 SUB #14 <- #52\nPLEASE READ OUT ,1\nPLEASE GIVE UP\n" ], "id": "https://riju.codes/intercal" }, "tryItOnline": "intercal", "tiobe": { "id": "INTERCAL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=585", "esolang": "https://esolangs.org/wiki/INTERCAL", "ubuntuPackage": "intercal", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "intercellas": { "title": "INTERCELLAS", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/88deb6145eec7b747cd2b2aa7e7658f5b191f0ef" ], "country": [ "Hungary" ], "originCommunity": [ "Hungarian Academy Of Sciences" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5819", "centralPackageRepositoryCount": 0 }, "interchange-file-format": { "title": "Interchange File Format", "appeared": 1985, "type": "binaryDataFormat", "country": [ "United States" ], "originCommunity": [ "Electronic Arts Inc", "Commodore International" ], "wikipedia": { "summary": "Interchange File Format (IFF), is a generic container file format originally introduced by the Electronic Arts company in 1985 (in cooperation with Commodore) in order to facilitate transfer of data between software produced by different companies. IFF files do not have any standard extension. On many systems that generate IFF files, file extensions are not important (the OS stores file format metadata separately from the file name). An .iff extension is commonly used for ILBM format files, which use the IFF container format. Resource Interchange File Format is a format developed by Microsoft and IBM in 1991 that is based on IFF, except the byte order has been changed to little-endian to match the x86 processor architecture. Apple's AIFF is a big-endian audio file format developed from IFF. The TIFF image file format is unrelated.", "backlinksCount": 381, "pageId": 66783, "dailyPageViews": 88, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Interchange_File_Format" } }, "intercons": { "title": "InterCONS", "appeared": 1995, "type": "pl", "reference": [ "https://ieeexplore.ieee.org/document/18018/" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5120", "centralPackageRepositoryCount": 0 }, "interleaved-notation": { "title": "Interleaved Notation", "appeared": 2022, "type": "pl", "photo": "https://michael.homer.nz/Publications/PAINT2022/InterleavedNotation-Homer2022/0.png", "creators": [ "Michael Homer" ], "description": "A two-dimensional notation for programs, comprising alternating rows of functions and operands with arguments and return values indicated by physical layout,and a tool for interactive live editing of programs in this notation.", "webRepl": [ "http://ecs.vuw.ac.nz/~mwh/demos/p22-2d-concat/" ], "spec": "https://michael.homer.nz/Publications/PAINT2022/InterleavedNotation-Homer2022.pdf", "reference": [ "https://dl.acm.org/doi/10.1145/3563836.3568722" ], "country": [ "New Zealand" ], "originCommunity": [ "Victoria University of Wellington" ], "announcementMethod": "paper", "related": [ "colorforth", "factor" ], "visualParadigm": true }, "interlisp-vax": { "title": "Interlisp-VAX", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e7644ab6dab1a2425c63d5b816f55d1942160ade" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6817", "centralPackageRepositoryCount": 0 }, "interlisp": { "title": "Interlisp", "appeared": 1966, "type": "pl", "creators": [ "Daniel G. Bobrow", "Warren Teitelman", "Ronald Kaplan" ], "country": [ "United States" ], "originCommunity": [ "Bolt, Beranek and Newman" ], "wikipedia": { "related": [ "common-lisp", "flavors", "sparc" ], "summary": "Interlisp (also seen with a variety of capitalizations) is a programming environment built around a version of the Lisp programming language. Interlisp development began in 1966 at Bolt, Beranek and Newman in Cambridge, Massachusetts with Lisp implemented for the DEC PDP-1 by Danny Bobrow and D. L. Murphy. In 1970 BBN LISP was designed, which ran on PDP-10 machines running the TENEX operating system. In 1973, when Danny Bobrow, Warren Teitelman and Ronald Kaplan moved from BBN to Xerox PARC, it was renamed Interlisp. Interlisp became a popular Lisp development tool for AI researchers at Stanford University and elsewhere in the DARPA community. Interlisp was notable for the integration of interactive development tools into the environment, such as a debugger, an automatic correction tool for simple errors (DWIM – \"do what I mean\"), and analysis tools.", "pageId": 353464, "created": 2003, "backlinksCount": 61, "revisionCount": 70, "dailyPageViews": 20, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/Interlisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=957", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nInterlisp: The Language and Its Usage|1986|Stephen H. Kaisler|5201959|4.00|1|0", "isbndb": "" }, "interpress": { "title": "Interpress", "appeared": 1986, "type": "textMarkup", "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "related": [ "postscript" ], "wikipedia": { "backlinksCount": 14, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Interpress" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1403", "isbndb": "" }, "interscript": { "title": "Interscript", "appeared": 1984, "type": "textMarkup", "reference": [ "http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/interscript/IntroductionToInterscript.pdf" ], "country": [ "United States" ], "originCommunity": [ "Xerox Data Systems" ], "supersetOf": [ "interpress" ], "wikipedia": { "backlinksCount": 6, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Interscript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5455", "semanticScholar": "" }, "intersystems-cache": { "title": "InterSystems Caché", "appeared": 1997, "type": "database", "description": "Object-oriented database management system", "country": [ "United States" ], "originCommunity": [ "InterSystems Corporation" ] }, "intuitionistic": { "title": "IPL", "appeared": 2013, "type": "pl", "creators": [ "Johan Georg Granström" ], "website": "http://intuitionistic.org/", "reference": [ "https://news.ycombinator.com/item?id=31964766" ], "standsFor": "Intuitionistic Programming Language", "country": [ "Switzerland" ], "originCommunity": [ "Google" ], "domainName": { "registered": 2013, "awisRank": { "2022": 10996600 }, "name": "intuitionistic.org" }, "githubRepo": { "firstCommit": 2013, "stars": 13, "forks": 0, "subscribers": 4, "created": 2015, "updated": 2022, "description": "Automatically exported from code.google.com/p/intuitionistic", "issues": 0, "url": "https://github.com/granstrom/intuitionistic" }, "repoStats": { "firstCommit": 2013, "commits": 17, "committers": 1, "files": 38 }, "isbndb": "" }, "invokator": { "title": "invokator", "appeared": 2004, "type": "pl", "creators": [ "Yann Orlarey" ], "website": "https://faust.grame.fr/", "reference": [ "http://functional-art.org/2017/slides/orlarey-farm17-slides.pdf" ], "country": [ "France" ], "originCommunity": [ "https://github.com/grame-cncm" ], "writtenIn": [ "cpp", "javascript" ], "githubRepo": { "firstCommit": 2004, "stars": 2013, "forks": 267, "subscribers": 88, "created": 2016, "updated": 2022, "description": "Functional programming language for signal processing and sound synthesis", "issues": 163, "url": "https://github.com/grame-cncm/faust" }, "repoStats": { "firstCommit": 2004, "commits": 14453, "committers": 183, "files": 3793 }, "tryItOnline": "https://faustide.grame.fr/", "hopl": "https://hopl.info/showlanguage.prx?exp=6393", "centralPackageRepositoryCount": 0 }, "io": { "title": "Io", "appeared": 2002, "type": "pl", "creators": [ "Steve Dekorte" ], "website": "https://iolanguage.org/", "documentation": [ "https://iolanguage.org/guide/guide.html" ], "reference": [ "https://news.ycombinator.com/item?id=8867575" ], "country": [ "United States and United Kingdom and Belarus" ], "originCommunity": [ "https://github.com/IoLanguage" ], "domainName": { "registered": 2009, "awisRank": { "2022": 9722355 }, "name": "iolanguage.org" }, "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasFloats": { "example": "// (\\d+\\.?\\d*|\\d*\\.\\d+)([eE][+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "// \\d+", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "print" ] ], "assignmentToken": [ [ ":=" ] ], "wikipedia": { "example": [ "factorial := method(n,\n if(n == 0, return 1)\n res := 1\n Range 1 to(n) foreach(i, res = res * i)\n)" ], "related": [ "smalltalk", "newtonscript", "self", "lua", "lisp", "python", "ioke" ], "summary": "Io is a pure object-oriented programming language inspired by Smalltalk, Self, Lua, Lisp, Act1, and NewtonScript. Io has a prototype-based object model similar to the ones in Self and NewtonScript, eliminating the distinction between instance and class. Like Smalltalk, everything is an object and it uses dynamic typing. Like Lisp, programs are just data trees. Io uses actors for concurrency. Remarkable features of Io are its minimal size and openness to using external code resources. Io is executed by a small, portable virtual machine.", "pageId": 323340, "created": 2003, "backlinksCount": 59, "revisionCount": 184, "dailyPageViews": 48, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Io_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "io" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "io" ], "aceMode": "io", "tmScope": "source.io", "repos": 2062, "id": "Io" }, "githubBigQuery": { "repos": 624, "users": 594, "id": "Io" }, "pygmentsHighlighter": { "filename": "iolang.py", "fileExtensions": [ "io" ], "id": "Io" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2014, "committerCount": 6, "commitCount": 33, "url": "https://github.com/textmate/io.tmbundle" }, "leachim6": { "filepath": "i/Io.Io", "fileExtensions": [ "Io" ], "example": [ "\"Hello World\\n\" print\n" ], "id": "Io" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Io", "rijuRepl": { "example": [ "\"Hello, world!\" println\n" ], "description": "Dynamic prototype-based programming language in the same realm as Smalltalk and Self", "fileExtensions": [ "io" ], "website": "https://iolanguage.org/", "gitRepo": "https://github.com/IoLanguage/io", "id": "https://riju.codes/io" }, "tryItOnline": "io", "hopl": "https://hopl.info/showlanguage.prx?exp=7112", "twitter": "https://twitter.com/iolanguage", "fileType": "text", "wordRank": 9022, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1991|Unknown|NET network programming with IO technology practice|KANG TING SHU WEI GONG FANG ?QIANG LI LUO TOU ZHU|9787121068379\n2021|Independently published|SIEMENS PLC PROGRAMMING FOR BEGINNERS: LEARN SIEMENS PLC PROGRAMMING WITH S7-300/400 Automating Project Examples inside TIA portal and Factory IO|Wicks, Daniel H|9798787338089", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|AC: composable asynchronous IO for native languages|10.1145/2048066.2048134|28|1|T. Harris and M. Abadi and R. Isaacs and R. McIlroy|87db7b1ed70e1d2b4585d1404aa827db19bd49cf\n2005|A hardware/software codesign approach for programmable IO devices|10.1145/1057661.1057739|1|0|K. Lin and Shih Hao Huang and S. Chen|43c44c32e9a55886a8142ae51dc7a1378e64ba33" }, "iode": { "title": "Iode", "appeared": 2015, "type": "pl", "creators": [ "Danilo Lekovic" ], "website": "https://danilolekovic.com/iode-lang/index.html", "country": [ "Canada" ], "originCommunity": [ "Simon Fraser University" ], "writtenIn": [ "d" ], "githubRepo": { "stars": 10, "forks": 0, "subscribers": 2, "created": 2015, "updated": 2020, "description": "a programming language", "url": "https://github.com/danilolekovic/iode-d" }, "repoStats": { "firstCommit": 2015, "commits": 153, "committers": 3, "files": 26 } }, "ioke": { "title": "Ioke", "appeared": 2008, "type": "pl", "creators": [ "Ola Bini" ], "website": "http://ioke.org", "documentation": [ "https://ioke.org/wiki/index.php/Main_Page" ], "reference": [ "https://ioke.org/wiki/index.php/Guide" ], "fileExtensions": [ "ik" ], "country": [ "Ecuador" ], "originCommunity": [ "https://github.com/olabini/ioke/issues/" ], "domainName": { "registered": 2008, "awisRank": { "2017": 12850561 }, "name": "ioke.org" }, "runsOnVm": [ "jvm" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 161, "forks": 24, "subscribers": 13, "created": 2010, "updated": 2022, "firstCommit": 2008, "description": "ioke is a new language for the JVM, based on Io and other languages.", "issues": 1, "url": "https://github.com/olabini/ioke" }, "repoStats": { "firstCommit": 2008, "commits": 3601, "committers": 19, "files": 631 }, "wikipedia": { "related": [ "io", "smalltalk", "lisp", "ruby", "jruby" ], "summary": "Ioke is a dynamic, strongly typed, prototype-based programming language targeting the Java Virtual Machine and the Common Language Runtime. It was designed by Ola Bini, a developer of JRuby. It has a very simple homoiconic syntax, somewhat similar to Io.", "pageId": 20148120, "dailyPageViews": 22, "created": 2008, "backlinksCount": 16, "revisionCount": 49, "appeared": 2008, "fileExtensions": [ "ik" ], "url": "https://en.wikipedia.org/wiki/Ioke_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ik" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "ioke" ], "aceMode": "text", "tmScope": "source.ioke", "repos": 17, "id": "Ioke" }, "githubBigQuery": { "repos": 41, "users": 39, "id": "Ioke" }, "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "ik" ], "id": "Ioke" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2009, "committerCount": 13, "commitCount": 1552, "sampleCount": 1, "example": [ "#!/usr/bin/env ioke\n\n\"Hello world.\" println\n" ], "url": "https://github.com/vic/ioke-outdated" }, "leachim6": { "filepath": "i/Ioke.ik", "fileExtensions": [ "ik" ], "example": [ "\"Hello World\" println\n" ], "id": "Ioke" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Ioke", "rijuRepl": { "example": [ "\"Hello, world!\" println\n" ], "id": "https://riju.codes/ioke" }, "tiobe": { "id": "Ioke" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012||Ioke (programming Language)|Timoteus Elmo|9786137118351", "semanticScholar": "" }, "ion-schema": { "title": "Ion Schema Language", "appeared": 2018, "type": "grammarLanguage", "reference": [ "https://amzn.github.io/ion-schema/docs/spec.html" ], "country": [ "United States" ], "originCommunity": [ "Amazon.com, Inc" ], "related": [ "ion" ], "example": [ "type::{\n name: Person,\n type: struct,\n fields: {\n title: {\n type: symbol,\n valid_values: [Mr, Mrs, Miss, Ms, Mx, Dr],\n },\n firstName: { type: string, occurs: required },\n middleName: string,\n lastName: { type: string, occurs: required },\n age: { type: int, valid_values: range::[0, 130] },\n },\n}" ], "semanticScholar": "" }, "ion": { "title": "Ion", "appeared": 2016, "type": "idl", "description": "Amazon Ion is a richly-typed, self-describing, hierarchical data serialization format offering interchangeable binary and text representations. The text format (a superset of JSON) is easy to read and author, supporting rapid prototyping. The binary representation is efficient to store, transmit, and skip-scan parse.", "reference": [ "https://amzn.github.io/ion-docs/" ], "aka": [ "Amazon Ion" ], "country": [ "United States" ], "originCommunity": [ "Amazon.com, Inc" ], "supersetOf": [ "json" ], "related": [ "protobuf" ], "hasBooleans": { "example": "null.bool\ntrue\nfalse", "value": true }, "hasComments": { "example": "", "value": true }, "hasStructs": { "example": "{ first : \"Tom\" , last: \"Riddle\" } // Structure with two fields\n{\"first\":\"Tom\",\"last\":\"Riddle\"} // The same value with confusing style\n{center:{x:1.0, y:12.5}, radius:3} // Nested struct", "value": true }, "hasFloats": { "example": "// http://amzn.github.io/ion-docs/docs/spec.html\n-0.12e4 // Type is float", "value": true }, "hasAssignment": { "example": "// A subset of symbols called identifiers can be denoted in text without single-quotes. ", "value": true }, "hasIntegers": { "example": "// http://amzn.github.io/ion-docs/docs/spec.html\nnull.int // A null int value\n0 // Zero. Surprise!\n-0 // ...the same value with a minus sign\n123 // A normal int\n-123 // Another negative int\n0xBeef // An int denoted in hexadecimal\n0b0101 // An int denoted in binary\n1_2_3 // An int with underscores\n0xFA_CE // An int denoted in hexadecimal with underscores\n0b10_10_10 // An int denoted in binary with underscores", "value": true }, "hasMultilineStrings": { "example": "( '''hello ''' // Sexp with one element\n '''world!''' )\n\n(\"hello world!\") // The exact same sexp value\n\n// This Ion value is a string containing three newlines. The serialized\n// form's first newline is escaped into nothingness.\n'''\\\nThe first line of the string.\nThis is the second line of the string,\nand this is the third line.\n'''", "value": true }, "hasNull": { "example": "null", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasBlobs": { "example": "// In the text format, blob values are denoted as RFC 4648-compliant Base64 text within two pairs of curly braces.\n// A valid blob value with one required padding character.\n{{ VG8gaW5maW5pdHkuLi4gYW5kIGJleW9uZCE= }}", "value": true }, "hasClobs": { "example": "// The clob type is similar to blob in that it holds uninterpreted binary data. The difference is that the content is expected to be text, so we use a text notation that’s more readable than Base64.\n// An Ion clob type is similar to the blob type except that the denotation in the Ion text format uses an ASCII-based string notation rather than a base64 encoding to denote its binary value. It is important to make the distinction that clob is a sequence of raw octets and string is a sequence of Unicode code points.\n// The string may only contain legal 7-bit ASCII character", "value": true }, "hasTimestamps": { "example": "// Timestamps represent a specific moment in time, always include a local offset, and are capable of arbitrary precision.\n2007-02-23T12:14Z // Seconds are optional, but local offset is not\n2007-01-01T00:00-00:00 // Happy New Year in UTC, unknown local offset", "value": true }, "hasDecimals": { "example": "null.decimal // A null decimal value\n0.123 // Type is decimal\n-0.12d4 // Type is decimal\n123_456.789_012 // Decimal with underscores\n-0d-1 // Decimal maintains precision: -0. != -0.0\n-0d0 // Negative zero decimal (distinct from positive zero)", "value": true }, "hasSymbols": { "example": "myvar2 // A different symbol\n'hi ho' // Symbol requiring quotes", "value": true }, "hasTypeAnnotations": { "example": "int32::12 // Suggests 32 bits as end-user type\n'my.custom.type' :: { x : 12 , y : -1 } // Gives a struct a user-defined type\n\n{ field: something::'another thing'::value } // Field's name must precede annotations of its value\n\njpeg :: {{ ... }} // Indicates the blob contains jpeg data\nbool :: null.int // A very misleading annotation on the integer null\n'' :: 1 // An empty annotation\nnull.symbol :: 1 // ERROR: type annotation cannot be null ", "value": true }, "hasLists": { "example": "null.list // A null list value\n[] // An empty list value\n[1, 2, 3] // List of three ints\n[ 1 , two ] // List of an int and a symbol\n[a , [b]] // Nested list\n[ 1.2, ] // Trailing comma is legal in Ion (unlike JSON)\n[ 1, , 2 ] // ERROR: missing element between commas", "value": true }, "hasSExpressions": { "example": "null.sexp // A null S-expression value\n() // An empty expression value\n(cons 1 2) // S-expression of three values\n([hello][there]) // S-expression containing two lists\n\n(a+-b) ( 'a' '+-' 'b' ) // Equivalent; three symbols\n(a.b;) ( 'a' '.' 'b' ';') // Equivalent; four symbols", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/* Ion supports comments. */\n// Here is a struct, which is similar to a JSON object\n{\n // Field names don't always have to be quoted\n name: \"Fido\",\n\n // This is an integer with a 'years' annotation\n age: years::4,\n\n // This is a timestamp with day precision\n birthday: 2012-03-01T,\n\n // Here is a list, which is like a JSON array\n toys: [\n // These are symbol values, which are like strings,\n // but get encoded as integers in binary\n ball,\n rope,\n ],\n\n // This is a decimal -- a base-10 floating point value\n weight: pounds::41.2,\n\n // Here is a blob -- binary data, which is\n // base64-encoded in Ion text encoding\n buzz: {{VG8gaW5maW5pdHkuLi4gYW5kIGJleW9uZCE=}},\n}" ], "isbndb": "year|publisher|title|authors|isbn13\n2008|Springer|Pumps, Transporters, and Ion Channels (Lecture Notes in Computer Science)||9780387500560" }, "ios": { "title": "iOS", "appeared": 2007, "type": "os", "website": "https://www.apple.com/ios/", "standsFor": "iOS operating system", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "related": [ "c", "objective-c", "swift", "android", "arm", "tls" ], "summary": "iOS (formerly iPhone OS) is a mobile operating system created and developed by Apple Inc. exclusively for its hardware. It is the operating system that presently powers many of the company's mobile devices, including the iPhone, iPad, and iPod Touch. It is the second most popular mobile operating system globally after Android. Originally unveiled in 2007 for the iPhone, iOS has been extended to support other Apple devices such as the iPod Touch (September 2007) and the iPad (January 2010). As of March 2018, Apple's App Store contains more than 2.1 million iOS applications, 1 million of which are native for iPads. These mobile apps have collectively been downloaded more than 130 billion times. The iOS user interface is based upon direct manipulation, using multi-touch gestures. Interface control elements consist of sliders, switches, and buttons. Interaction with the OS includes gestures such as swipe, tap, pinch, and reverse pinch, all of which have specific definitions within the context of the iOS operating system and its multi-touch interface. Internal accelerometers are used by some applications to respond to shaking the device (one common result is the undo command) or rotating it in three dimensions (one common result is switching between portrait and landscape mode). Apple has been significantly praised for incorporating thorough accessibility functions into iOS, enabling users with vision and hearing disabilities to properly use its products. Major versions of iOS are released annually. The current version, iOS 12, was released on September 17, 2018. It is available for all iOS devices with 64-bit processors; the iPhone 5S and later iPhone models, the iPad (2017), the iPad Air and later iPad Air models, all iPad Pro models, the iPad Mini 2 and later iPad Mini models, and the sixth-generation iPod Touch. On all recent iOS devices, the iOS regularly checks on the availability of an update, and if one is available, will prompt the user to permit its automatic installation.", "dailyPageViews": 6910, "pageId": 16161443, "created": 2008, "backlinksCount": 12985, "revisionCount": 5087, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/IOS" }, "linkedInSkill": { "2018": 501017, "id": "ios" }, "meetup": { "memberCount": 1440715, "groupCount": 2582, "url": "https://www.meetup.com/topics/ios-development" }, "fileType": "na", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe iOS 5 Developer's Cookbook: Core Concepts and Essential Recipes for iOS Programmers|2011|Erica Sadun|17296615|3.91|53|5\nDiving Into iOS (iOS App Development for Non-Programmers, #1)|2012|Kevin McNeish|21930775|3.71|48|9\niOS 7 Programming Cookbook|2013|Vandad Nahavandipoor|25533504|3.76|25|4\nProgramming iOS 7|2013|Matt Neuburg|26233323|4.06|32|2\nIOS 8 Swift Programming Cookbook: Solutions & Examples for IOS Apps|2014|Vandad Nahavandipoor|42349502|3.86|28|4\niOS 6 Programming Cookbook|2012|Vandad Nahavandipoor|21585065|3.74|19|2\nLearning iOS Game Programming|2010|Michael Daley|11343068|3.27|22|0\nMpls Configuration On Cisco Ios Software|2005|Umesh Lakshman|1439048|4.11|18|2\nProgramming iOS 6|2013|Matt Neuburg|24361956|4.04|24|1" }, "iota-and-jot": { "title": "Iota-and-jot", "appeared": 2001, "type": "esolang", "reference": [ "https://web.archive.org/web/20160823182917/http://semarch.linguistics.fas.nyu.edu/barker/Iota/" ], "aka": [ "jot" ], "country": [ "United States" ], "originCommunity": [ "New York University" ], "wikipedia": { "summary": "In formal language theory and computer science, Iota and Jot (from Greek iota ι, Hebrew yodh י, the smallest letters in those two alphabets) are languages, extremely minimalist formal systems, designed to be even simpler than other more popular alternatives, such as the lambda calculus and SKI combinator calculus.", "url": "https://en.wikipedia.org/wiki/Iota_and_Jot" }, "isbndb": "" }, "iota": { "title": "iota", "appeared": 1985, "type": "pl", "description": "A highly interactive programming system is presented which supports hierarchical and modular program development with abstraction mechanisms. By taking advantage of abstraction mechanisms, the system provides a \"truly modular\" environment, in which modules are constructed, debugged, verified, and compiled in a module-by-module fashion. Such an environment naturally requires system management of the information concerning ongoing program development, in the form of module databases. As a result, further problems arise as to how to modify the information in efficient and consistent ways. This paper discusses design objectives for modular programming systems by focusing on such issues as information management, interactive construction and modification of modules, separate processing, specification and verification, and supports for cooperative program development.", "reference": [ "https://ieeexplore.ieee.org/document/1701985/" ], "country": [ "Japan" ], "originCommunity": [ "Research Institute for Mathematical Sciences" ] }, "ip-pascal": { "title": "IP Pascal", "appeared": 1990, "type": "pl", "creators": [ "Scott Moore" ], "website": "https://web.archive.org/web/20190307061527/http://www.moorecad.com/ippas/", "country": [ "United States" ], "originCommunity": [ "https://scottmoore.consulting" ], "wikipedia": { "example": [ "program hello(input, output);\n uses gralib;\n var er: evtrec;\n begin\n bcolor(output, green);\n curvis(output, false);\n auto(output, false);\n page(output);\n fcolor(output, red);\n frect(output, 50, 50, maxxg(output)-50, maxyg(output)-50);\n fcolorg(output, maxint, maxint-(maxint div 3), maxint-maxint div 3);\n frect(output, 50, 50, 53, maxyg(output)-50);\n frect(output, 50, 50, maxxg(output)-50, 53);\n fcolorg(output, maxint div 2, 0, 0);\n frect(output, 52, maxyg(output)-53, maxxg(output)-50, maxyg(output)-50);\n frect(output, maxxg(output)-53, 52, maxxg(output)-50, maxyg(output)-50);\n font(output, font_sign);\n fontsiz(output, 100);\n binvis(output);\n fcolor(output, cyan);\n cursorg(output, maxxg(output) div 2-strsiz(output, 'hello, world') div 2+3,\n maxyg(output) div 2-100 div 2+3);\n writeln('hello, world');\n fcolor(output, blue);\n cursorg(output, maxxg(output) div 2-strsiz(output, 'hello, world') div 2,\n maxyg(output) div 2-100 div 2);\n writeln('hello, world');\n repeat event(input, er) until er.etype = etterm\n end." ], "related": [ "pascal", "csharp", "unicode", "utf-8", "java", "ucsd-pascal", "visual-basic", "turbo-pascal", "linux", "isbn" ], "summary": "IP Pascal is an implementation of the Pascal programming language using the IP portability platform, a multiple machine, operating system and language implementation system.", "backlinksCount": 133, "pageId": 2096603, "dailyPageViews": 18, "created": 2005, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/IP_Pascal" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6942", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ipad-machine": { "title": "IPad", "appeared": 2010, "type": "computingMachine", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/IPad" } }, "ipf": { "title": "Information Presentation Facility", "appeared": 1997, "type": "pl", "standsFor": "Information Presentation Facility", "country": [ "United States" ], "originCommunity": [ "IBM" ], "example": [ ".* This is a comment line\n:userdoc.\n:title.Endangered Mammals\n:h1 res=001.The Manatee\n\n:p.\nThe manatee has a broad flat tail and two flipper\nlike forelegs. There are no back legs.\nThe manatee's large upper lip is split in two and\ncan be used like fingers to place food into the\nmouth. Bristly hair protrudes from its lips,\nand almost buried in its hide are small eyes, with\nwhich it can barely see.\n\n:euserdoc." ], "wikipedia": { "example": [ ":lm margin=2.:font facename=Helv size=24x10.\n:p.:hp8.Welcome to PM123 !:ehp8.\n:font facename=Helv size=16x8.\n:p.:p.\nHello and welcome to the wonderful world of digital music on OS/2. First we\nmust congratulate you for choosing the best MPEG-audio player available for\nOS/2! PM123 has been in development since beginning of 1997 and has become\nthe most advanced player on OS/2. Some of you may have used the earlier\nbetas of PM123 and for your convenience, here are the new features in this\nrelease:\n.br\n:ul compact.\n:li. New skin options, allowing PM123 to be modified to just about anything. \n:li. Graphical :hp2.equalizer:ehp2., including pre-amplification and band mute.\n:li. Support for plugins, a :hp2.spectrum analyzer:ehp2. and :hp2.oscilloscope:ehp2. plugin.\n:li. :hp2.Playlist Manager:ehp2. for users, allowing easier managing of playlists.\n:li. Better HTTP streaming support: support for URLs in playlist, and M3Us for playlists.\n:li. Recursive directory adding.\n:li. Commandline and remote control of PM123.\n:li. General improvements in all parts of the player.\n:eul.\n.br\n.br\n:p." ], "related": [ "ibm-gml", "html", "free-pascal" ], "summary": "Information Presentation Facility (IPF) is a system for presenting online help and hypertext on IBM OS/2 systems. IPF also refers to the markup language that is used to create IPF content. The IPF language has its origins in BookMaster and Generalized Markup Language developed by IBM. The IPF language is very similar to the well-known HTML language, version 3.0, with a range of additional possibilities. Therefore, a trained user may use virtually any word processor when creating IPF documents. The IPF language consists of 45 basic commands. IPF files are compiled using the IPF Compiler (IPFC) into viewable INF or HLP files. IPF HLP files are distinct from the WinHelp HLP files that are prevalent in Windows. OS/2 contains a built in viewer, and there are other viewers available for other platforms.", "pageId": 8694762, "dailyPageViews": 17, "created": 2006, "backlinksCount": 31, "revisionCount": 27, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Information_Presentation_Facility" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ipfs": { "title": "InterPlanetary File System", "appeared": 2015, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "https://protocol.ai" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/InterPlanetary_File_System" }, "isbndb": "" }, "iphone-machine": { "title": "IPhone", "appeared": 2007, "type": "computingMachine", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/IPhone" } }, "ipl-v": { "title": "IPL-V", "appeared": 1957, "type": "pl", "reference": [ "https://semanticscholar.org/paper/695466edc64137140a793814e271e67339f9c2ee" ], "country": [ "United States" ], "originCommunity": [ "The Carnegie Mellon University College of Engineering", "RAND Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=265", "centralPackageRepositoryCount": 0 }, "iptables-rope": { "title": "IpTables Rope", "appeared": 2005, "type": "pl", "website": "https://web.archive.org/web/20190802032651/http://www.digitage.co.uk/rope", "country": [ "United Kingdom" ], "originCommunity": [ "Digitage Ltd" ], "wikipedia": { "related": [ "linux", "reverse-polish-notation" ], "summary": "Rope is a programming language that allows developers to write extensions to the Iptables/Netfilter components of Linux using a simple scripting language based on Reverse Polish notation. It is a scriptable Iptables match module, used to identify whether IP packets passed to it match a particular set of criteria or not. Rope started life as a project to make the \"string\" match module of Iptables stronger and evolved fairly quickly into an open-ended scriptable packet matching mechanism.", "created": 2005, "backlinksCount": 4, "pageId": 3299549, "revisionCount": 12, "dailyPageViews": 4, "url": "https://en.wikipedia.org/wiki/IpTables_Rope" }, "centralPackageRepositoryCount": 0 }, "iptscrae": { "title": "IPTSCRAE", "appeared": 1994, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Warner New Media" ], "wikipedia": { "example": [ "/\"\"s={n++{{\" \"n itoa&}{\" buzz\"}n 5%ifelse}{\" fizz\"}n 3%ifelse s+=}{101n>}while s logmsg" ], "related": [ "forth", "javascript", "java", "html" ], "summary": "Iptscrae is a stack-oriented scripting language used to give additional functionality to The Palace software and servers. Its name comes from the pronunciation of \"script\" in Pig Latin. [1] The language was created by Jim Bumgardner, who in turn was inspired by Forth, another stack-based language. Bumgardner chose this style of language because it is extremely easily to implement an interpreter, since there is no need to support parenthetical groupings or operator precedence. The name \"iptScrae\" was borrowed by Bumgardner from a former colleague and mentor, Kevin Bjorke, who came up with the name \"iptscray\" for a freeware Forth interpreter a few years previously. Bumgardner originally created Iptscrae for Idaho, an in-house multi-media authoring system, similar to HyperCard, which he created while an employee at Warner New Media. He then reused and modified the IptScrae compiler for the Palace project, which was developed in 1994. Although it is a scripting language, many have used it to provide additional functionality to many other programs and functions. Forums can be created with Iptscrae while embedding it with JavaScript, as many factions of Iptscrae fans have done in the past. It's fully possible to implement Iptscrae with other languages, even if they're not on the same dynamic principles. For example, Iptscrae has, in the past, been webbed together with Java, JavaScript, HTML, and other artificial languages, including other scripting languages, programming languages, specification languages, query languages, and markup languages to add more end-user interactions and commands to other programs, without sacrificing user-friendliness. In the past years, Iptscrae has even been utilized in computer peer groups through open-source language compilers, using not only transformation and hardware description languages, but also combining it with several other genres of computer languages to create an intertwined web of user-friendliness and application compatibility.", "pageId": 1603407, "created": 2005, "backlinksCount": 7, "revisionCount": 43, "dailyPageViews": 3, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/IPTSCRAE" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Iptscrae", "fileType": "text", "centralPackageRepositoryCount": 0 }, "ipv4": { "title": "IPv4", "appeared": 1984, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Defense Advanced Research Projects Agency" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/IPv4" } }, "iqf": { "title": "IQF", "appeared": 1975, "type": "pl", "reference": [ "https://apps.dtic.mil/dtic/tr/fulltext/u2/a043028.pdf" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4530", "centralPackageRepositoryCount": 0 }, "iqr": { "title": "iqr", "appeared": 1994, "type": "barCodeFormat", "website": "https://www.qrcode.com/en/codes/iqr.html", "country": [ "United States" ], "originCommunity": [ "Denso Wave Incorporated" ] }, "irc-log": { "title": "IRC chat logs", "appeared": 1988, "type": "application", "reference": [ "http://microformats.org/wiki/chat-examples" ], "country": [ "United States" ], "originCommunity": [ "https://microformats.org" ], "example": [ "12:06 Tantek: what does the datetime stamp represent?\n12:07 KevinMarks: in iRC, when it was said\n12:07 Tantek: is it a point in time *before* they started speaking?\n12:07 Tantek: or *after*?\n12:07 Tantek: or somewhere in the *middle*?\n12:07 KevinMarks: usually it is quantised to seconds\n12:07 KevinMarks: and it is time the msg was received\n12:07 Tantek: but the second they started typing or pressed return?\n12:08 KevinMarks: prssed return i think" ], "githubLanguage": { "fileExtensions": [ "irclog", "weechatlog" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "codemirrorMode": "mirc", "codemirrorMimeType": "text/mirc", "tmScope": "none", "aliases": [ "irc", "irc logs" ], "id": "IRC log" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ircis": { "title": "ircis", "appeared": 2019, "type": "esolang", "creators": [ "Arjun Nair" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/batman-nair/IRCIS/issues" ], "githubRepo": { "firstCommit": 2019, "stars": 101, "forks": 3, "subscribers": 3, "created": 2019, "updated": 2022, "description": "I Run Chars I See(IRCIS) - a 2d grid based esoteric programming language.", "issues": 0, "url": "https://github.com/batman-nair/IRCIS" }, "repoStats": { "firstCommit": 2019, "commits": 111, "committers": 2, "files": 71 } }, "isabelle-91": { "title": "Isabelle-91", "appeared": 1991, "type": "pl", "reference": [ "https://www.cl.cam.ac.uk/~lp15/Grants/holisa.html" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3664", "centralPackageRepositoryCount": 0 }, "isabelle-hol": { "title": "Isabelle/HOL", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0143b4c8e07bc855683a2ec9ba30895a3eb13208" ], "country": [ "Australia and Germany" ], "originCommunity": [ "University of Queensland", "Technische Universit at Berlin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3690", "centralPackageRepositoryCount": 0 }, "isabelle": { "title": "Isabelle", "appeared": 1986, "type": "pl", "description": "Isabelle is a generic proof assistant. It allows mathematical formulas to be expressed in a formal language and provides tools for proving those formulas in a logical calculus. Isabelle was originally developed at the University of Cambridge and Technische Universität München, but now includes numerous contributions from institutions and individuals worldwide.", "website": "http://isabelle.in.tum.de/", "reference": [ "https://books.google.com/books?id=xwdqCQAAQBAJ&dq=isabelle+language+proof&lr=" ], "fileExtensions": [ "ROOT" ], "country": [ "United Kingdom and Germany" ], "originCommunity": [ "University Of Cambridge", "Technische Universität München" ], "domainName": { "name": "isabelle.in.tum.de" }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "booleanTokens": [ [ "True", "False" ] ], "wikipedia": { "example": [ "theorem sqrt2_not_rational:\n \"sqrt (real 2) ∉ ℚ\"\nproof\n let ?x = \"sqrt (real 2)\"\n assume \"?x ∈ ℚ\"\n then obtain m n :: nat where\n sqrt_rat: \"¦?x¦ = real m / real n\" and lowest_terms: \"coprime m n\"\n by (rule Rats_abs_nat_div_natE)\n hence \"real (m^2) = ?x^2 * real (n^2)\" by (auto simp add: power2_eq_square)\n hence eq: \"m^2 = 2 * n^2\" using of_nat_eq_iff power2_eq_square by fastforce\n hence \"2 dvd m^2\" by simp\n hence \"2 dvd m\" by simp\n have \"2 dvd n\" proof-\n from ‹2 dvd m› obtain k where \"m = 2 * k\" ..\n with eq have \"2 * n^2 = 2^2 * k^2\" by simp\n hence \"2 dvd n^2\" by simp\n thus \"2 dvd n\" by simp\n qed\n with ‹2 dvd m› have \"2 dvd gcd m n\" by (rule gcd_greatest)\n with lowest_terms have \"2 dvd 1\" by simp\n thus False using odd_one by blast\nqed" ], "related": [ "standard-ml", "coq" ], "summary": "The Isabelle theorem prover is an interactive theorem prover, a Higher Order Logic (HOL) theorem prover. It is an LCF-style theorem prover (written in Standard ML), so it is based on a small logical core to ease logical correctness. Isabelle is generic: it provides a meta-logic (a weak type theory), which is used to encode object logics like first-order logic (FOL), higher-order logic (HOL) or Zermelo–Fraenkel set theory (ZFC). Isabelle's main proof method is a higher-order version of resolution, based on higher-order unification. Though interactive, Isabelle also features efficient automatic reasoning tools, such as a term rewriting engine and a tableaux prover, as well as various decision procedures. Isabelle has been used to formalize numerous theorems from mathematics and computer science, like Gödel's completeness theorem, Gödel's theorem about the consistency of the axiom of choice, the prime number theorem, correctness of security protocols, and properties of programming language semantics. The Isabelle theorem prover is free software, released under the revised BSD license. Isabelle was named by Lawrence Paulson after Gérard Huet's daughter.", "created": 2002, "backlinksCount": 32, "pageId": 161886, "revisionCount": 150, "dailyPageViews": 71, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Isabelle_(proof_assistant)" }, "githubLanguage": { "fileExtensions": [ "thy" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.isabelle.theory", "repos": 839, "id": "Isabelle" }, "githubBigQuery": { "repos": 137, "users": 115, "id": "Isabelle" }, "pygmentsHighlighter": { "filename": "theorem.py", "fileExtensions": [ "thy" ], "id": "Isabelle" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 1, "commitCount": 9, "sampleCount": 1, "example": [ "theory HelloWorld\nimports Main\nbegin\n\nsection{*Playing around with Isabelle*}\n\ntext{* creating a lemma with the name hello_world*}\nlemma hello_world: \"True\" by simp\n\n(*inspecting it*)\nthm hello_world\n\ntext{* defining a string constant HelloWorld *}\n\ndefinition HelloWorld :: \"string\" where\n \"HelloWorld \\ ''Hello World!''\"\n\n(*reversing HelloWorld twice yilds HelloWorld again*)\ntheorem \"rev (rev HelloWorld) = HelloWorld\"\n by (fact List.rev_rev_ident)\n\ntext{*now we delete the already proven List.rev_rev_ident lema and show it by hand*}\ndeclare List.rev_rev_ident[simp del]\nhide_fact List.rev_rev_ident\n\n(*It's trivial since we can just 'execute' it*)\ncorollary \"rev (rev HelloWorld) = HelloWorld\"\n apply(simp add: HelloWorld_def)\n done\n\ntext{*does it hold in general?*}\ntheorem rev_rev_ident:\"rev (rev l) = l\"\n proof(induction l)\n case Nil thus ?case by simp\n next\n case (Cons l ls)\n assume IH: \"rev (rev ls) = ls\"\n have \"rev (l#ls) = (rev ls) @ [l]\" by simp\n hence \"rev (rev (l#ls)) = rev ((rev ls) @ [l])\" by simp\n also have \"\\ = [l] @ rev (rev ls)\" by simp\n finally show \"rev (rev (l#ls)) = l#ls\" using IH by simp\n qed\n\ncorollary \"\\(l::string). rev (rev l) = l\" by(fastforce intro: rev_rev_ident)\n\nend\n" ], "url": "https://github.com/lsf37/Isabelle.tmbundle" }, "languageServerProtocolProject": [ "https://isabelle.in.tum.de/repos/isabelle/file/tip/src/Tools/VSCode\nwrittenIn scala" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|General Bindings and Alpha-Equivalence in Nominal Isabelle|10.2168/LMCS-8(2:14)2012|66|12|Christian Urban and C. Kaliszyk|94d0fe2a93092044729ef1ee299e081087600f4c\n2012|Smart Testing of Functional Programs in Isabelle|10.1007/978-3-642-28717-6_14|26|4|Lukas Bulwahn|21c3307d6cf498c37d3503a71d11d5aaf351eb55\n2011|A Formalization of the C99 Standard in HOL, Isabelle and Coq|10.1007/978-3-642-22673-1_28|14|0|R. Krebbers and F. Wiedijk|4f5516f1cc9d97769e44abc5ea6250e050174839\n2017|Isabelle Formalization of Set Theoretic Structures and Set Comprehensions|10.1007/978-3-319-72453-9_12|5|0|C. Kaliszyk and Karol Pak|4296acda45f0a0b7b92991c2bf9e41a81ba38af8" }, "isac": { "title": "ISAC", "appeared": 2003, "type": "pl", "reference": [ "http://www.ist.tugraz.at/isac/" ], "standsFor": "ISAbelle for Calculations in applied mathematics", "country": [ "United States" ], "originCommunity": [ "Ohio State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7034", "centralPackageRepositoryCount": 0 }, "isbl": { "title": "ISBL", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "example": [ "OS = ORDERS * SUPPLIERS\nLIST OS: NAME=\"Brooks\" % SNAME, ITEM, PRICE" ], "summary": "ISBL (Information Systems Base Language) is the relational algebra notation that was invented for PRTV, one of the earliest database management systems to implement E.F. Codd's relational model of data.", "created": 2006, "backlinksCount": 42, "pageId": 3946520, "revisionCount": 51, "dailyPageViews": 13, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/ISBL" }, "centralPackageRepositoryCount": 0 }, "isbn": { "title": "ISBN", "appeared": 1970, "type": "schema", "documentation": [ "https://isbndb.com/apidocs/v2" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://isbndb.com" ], "example": [ "978-3-16-148410-0" ], "wikipedia": { "dailyPageViews": 9882, "created": 2001, "revisionCount": 1814, "url": "https://en.wikipedia.org/wiki/International_Standard_Book_Number" }, "indeedJobs": { "2022": 53, "query": "isbn" }, "fileType": "text", "wordRank": 1659, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1600||Studyguide for Computing with C# and the .Net Framework by Gittleman, Arthur, ISBN 9781449615505 by Cram101 Textbook Reviews (2013-11-25) Paperback||9781449615505\n2012|Academic Internet Publishers|[Studyguide for Computational Physics: Problem Solving by Landau, Rubin H., ISBN 9783527406265] (By: Cram101 Textbook Reviews) [published: August, 2012]|Cram101 Textbook Reviews|9783527406265\n2011|Academic Internet Publishers|[(Studyguide for Game Graphics Programming by Sherrod, Allen, ISBN 9781584505167 )] [Author: Cram101 Textbook Reviews] [Jun-2011]||9781584505167", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2005|Programming in Prolog. Using the ISO Standard. by William F. Clocksin, Christopher S. Mellish, Springer-Verlag, 2003, ISBN 3-540-00678-8, xiii+299 pages|10.1017/S1471068405212449|63|9|Bart Demoen|858d3fae649025878f8a0282b1ad32f1ea0bd36f\n1995|Advanced methods in neural computing by Philip Wasserman, International Thomson Publishing (Van Nostrand Reinhold), USA, 1993, ISBN 0-442-00461-3|10.1017/S0269888900007372|33|3|M. Kubát|e53b6bbd1854f7640d509125f15b86506cc636c1\n1994|Learning in embedded systems by Leslie Pack Kaelbling, Bradford Books. MIT Press, USA, 1993, pp 176, $29.95, ISBN 0-262-11174-8|10.1017/S026988890000686X|8|0|Richard Wyatt|ab9daba7a5578ec7fd7a3417d9ecd3ecd504b870\n1995|Sparc® architecture, assembly language programming, & C : Richard P Paul Prentice-Hall Inc, Englewood Cliffs, NJ, USA (1994) ISBN 0 13 876889 7, £34.75, 448 pp|10.1016/0141-9331(95)90001-2|7|0|A. Ferrari|f9cd87f6ee12fd936a9591bc632128e9bc8323b5\n2011|Language Implementation Patterns: Create your own Domain-Specific and General Programming Languages, by Terence Parr, Pragmatic Bookshelf, http://www.pragprog.com, ISBN 9781934356456|10.1017/S0956796810000298|7|1|J. Hage|6a5634651c0e7c1c6dd5208a05cc4dbc87079072\n1982|The Programming Language Ada, Reference Manual. Proposed Standard Document, United States Department of Defense. Lecture Notes in Computer Science 106. Berlin-Heidelberg-New York, Springer-Verlag 1981. X, 243 S., DM 16,50, US $ 7.90. ISBN 3-540-10693-6|10.1002/ZAMM.19820620828|7|0|F. Grund|fa897d99a638939849958581ff049af0be4f7cac\n1994|Text generation - using discourse strategies and focus constraints to generate natural language text by Kathleen R. McKeown, Cambridge University Press, 1992, pp 246, £13.95, ISBN 0-521-43802-0|10.1017/S0269888900007153|5|0|Paul Holmes-Higgin|7a0f4acf832716ae713faa36325ab9fad90be704\n2010|Natural Language Processing with Python Steven Bird, Ewan Klein, and Edward Loper (University of Melbourne, University of Edinburgh, and BBN Technologies) Sebastopol, CA: O'Reilly Media, 2009, xx+482 pp; paperbound, ISBN 978-0-596-51649-9, $44.99; on-line free of charge at nltk.org/book|10.1162/coli_r_00022|5|0|Michael Elhadad|3fdfd78bcddf80986d1243527c97c4f7f5bf1476\n2011|Handbook of Natural Language Processing (second edition) Nitin Indurkhya and Fred J. Damerau (editors) (University of New South Wales; IBM Thomas J. Watson Research Center)Boca Raton, FL: CRC Press, 2010, xxxiii+678 pp; hardbound, ISBN 978-1-4200-8592-1, $99.95|10.1162/COLI_r_00048|5|2|Jochen L. Leidner|81acdb791c4bc258d5e306e49a982dd831053c33\n1991|Programming language concepts and paradigms : David A. Watt, (Prentice Hall, Hemel Hempstead, United Kingdom, 1990), Price £16.95 (paperback), ISBN 0-13-728866-2.|10.1016/0167-6423(91)90005-I|4|0|C. Lindsey|4e898612f08dc238449eb984909f7b50712bef8c\n2020|Fundamental Proof Methods in Computer Science: A Computer-Based Approach, by Arkoudas and Musser, The MIT Press, Cambridge, USA, ISBN 978-0-262-03553-8|10.1017/S1471068420000071|3|0|S. Bringsjord and Naveen Sundar Govindarajulu|16a9098cf310dcedc17b1016d89bc5c1081c08f2\n2009|Software Abstractions: Logic, Language, and Analysis by Daniel Jackson, The MIT Press, 2006, 366pp, ISBN 978-0262101141|10.1017/S0956796808006977|3|0|A. Sloane|3022320d769da813185d4fd63fb84c3832afeb30\n1995|Abstract Data Types in Standard ML by Harrison Rachel, John Wiley & Sons, 1993 212 pp, ISBN 0-471-93844-0.|10.1017/S0956796800001271|1|0|K. Mitchell|29e40acaa8d2b8652b0b83c93e053d4388a98ca9\n1998|European Computer Law. 1996. Transnational Publishers. Irvington-on-Hudson, NY. $225.00 (loose-leaf binder). ISBN 0-571050-23-X.|10.1177/027046769801800318|1|0|C. Babbage and Z. Sardar|306735f6bffd64183b170ba85977efe42f3751fa\n2002|Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo and Alberto Policriti, Springer-Verlag, 2001. Hardback: ISBN 0-387-95197-0, $24.50/$69.95, xviii+409 pages.|10.1017/S1471068402001503|1|0|A. Dovier|f68f408915d0db5d98264feaca331e3c8f22eff6\n2004|PERL PROGRAMMING FOR BIOLOGISTS, by D. Curtis Jamison, Wiley, Hoboken, 2003, ISBN 0-471-43059-5, ix + 191 pp. (Pbk, £27.95)|10.1017/S0263574704210943|1|0|A. Andrew|014606001ea7425a185967570b2c8711ed3fb42d\n2004|Programming Constraint Services: High level Programming of Standard and New Constraint Services by Christian Schulte, published in 2002 by Springer in the series Lecture Notes in Artificial Intelligence, vol. 2302, ISBN 3-540-43371-6, xii + 176 pages, paperback.|10.1017/S1471068403211935|1|0|F. Laburthe|c06c7dd186c9e96d3f6d51cb495dadb4fb9a8637\n1995|The Gödel programming language by Patricia Hill and John W. Lloyd, The MIT Press, 1994, pp 337, £40 50/$60.75, ISBN 0-262-08229-2|10.1017/S0269888900007360|1|0|Geraint A. Wiggins|27789167ca8aeb7c709557db8a4dd8911764e50e" }, "iscript": { "title": "iScript", "appeared": 2008, "type": "pl", "description": "Servertec has announced iScript, a platform independent scripting language written in Java, for creating scalable, server-side, object-oriented, n-Tier enterprise solutions. The iScript scripting language features platform independence, object-oriented architecture, web-server integration, support for Common Gateway Interface (CGI), dynamic content generator, static content preprocessor, make facility, just-in-time pcode generator and caching, Java API wrappers and open component API. Servertec will be releasing the iScript Developer Kit, which integrates the iScript scripting language, documentation and examples to the public. Web site developers can use this kit to create and maintain dynamic, data driven and static web sites. iScript preview release is available for free at http://www.servertec.com/. The final release of iScript is scheduled to ship in the second half of 1998. Final pricing details have yet to be announced.", "reference": [ "https://docs.kofax.com/ImageNow/en_US/7.0/iScript/iScript.htm", "https://static.lwn.net/2000/0113/a/servertec.html", "https://www.linuxjournal.com/article/2988" ], "country": [ "United States" ], "originCommunity": [ "Servertec Inc" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Iscript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8340", "centralPackageRepositoryCount": 0 }, "isetl": { "title": "ISETL", "appeared": 1989, "type": "pl", "creators": [ "Jacob T. Schwartz" ], "reference": [ "https://semanticscholar.org/paper/32550542f523856c16c49b66b1251485e7fe916e" ], "country": [ "United States" ], "originCommunity": [ "Clarkson University" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "wikipedia": { "example": [ "procedure factorial(n); -- calculates the factorial n!\n return if n = 1 then 1 else n * factorial(n - 1) end if;\nend factorial;" ], "related": [ "algol-60", "abc", "ada", "python" ], "summary": "SETL (SET Language) is a very high-level programming language based on the mathematical theory of sets. It was originally developed by (Jack) Jacob T. Schwartz at the New York University (NYU) Courant Institute of Mathematical Sciences in the late 1960s.", "created": 2014, "backlinksCount": 51, "pageId": 916963, "revisionCount": 4, "dailyPageViews": 1, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/ISETL_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2123", "centralPackageRepositoryCount": 0 }, "isis": { "title": "ISIS", "appeared": 1995, "type": "pl", "reference": [ "http://web.media.mit.edu/~stefan/isis/" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2124", "centralPackageRepositoryCount": 0 }, "islisp": { "title": "ISLISP", "appeared": 2007, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "International Organization for Standardization", "International Electrotechnical Commission" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "standard-output" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "common-lisp", "eulisp", "le-lisp", "scheme", "clos", "openlisp" ], "summary": "ISLISP (also capitalized as ISLisp) is a programming language in the LISP family standardized by ISO working group ISO/IEC JTC 1/SC 22/WG 16 (commonly referred to simply as SC22/WG16 or WG16). The primary output of this working group was an International Standard, ISO/IEC 13816:1997(E), published by ISO. The standard was updated in 2007 and republished as ISO/IEC 13816:2007(E). Although official publication was through ISO, versions of the ISLISP language specification are available that are believed to be in the public domain.The goal of this standardization effort was to define a small, core language to help bridge the gap between differing dialects of Lisp. It attempted to accomplish this goal by studying primarily Common Lisp, EuLisp, Le Lisp, and Scheme and standardizing only those features shared between them. From ISLISP.info: ISLISP has these design goals: Compatible with existing Lisp dialects where feasible. Provide basic functionality. Object-oriented. Designed with extensibility in mind. Gives priority to industrial needs over academic needs. Promotes efficient implementations and applications.ISLISP has separate function and variable namespaces (hence it is a Lisp-2). ISLISP's object system, ILOS, is for the most part a subset of CLOS.", "pageId": 6976849, "created": 2006, "backlinksCount": 50, "revisionCount": 63, "dailyPageViews": 17, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/ISLISP" }, "leachim6": { "filepath": "i/ISLISP.lisp", "fileExtensions": [ "lisp" ], "example": [ "(format (standard-output) \"Hello World\")\n" ], "id": "ISLISP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1690", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "iso-8601": { "title": "ISO 8601", "appeared": 1988, "type": "standard", "creators": [ "ISO Technical Committee TC 154" ], "description": "ISO 8601 is an international standard covering the worldwide exchange and communication of date and time-related data", "documentation": [ "https://curlie.org/Science/Reference/Standards/Individual_Standards/ISO/ISO_8601/" ], "spec": "https://www.iso.org/obp/ui/#iso:std:iso:8601:-1:ed-1:v1:en", "country": [ "Switzerland" ], "originCommunity": [ "International Organization for Standardization" ], "versions": { "2022": [ "2022" ] }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/ISO_8601" } }, "ispl": { "title": "ISPL", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/76b53866b945231f7dca461b90bf3459592430cf" ], "country": [ "United States" ], "originCommunity": [ "The Rand Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5339", "centralPackageRepositoryCount": 0 }, "isq": { "title": "International System of Quantities", "appeared": 2009, "type": "schema", "standsFor": "International System of Quantities", "country": [ "France" ], "originCommunity": [ "General Conference on Weights and Measures" ], "wikipedia": { "related": [ "si" ], "summary": "The International System of Quantities (ISQ) is a system based on seven base quantities: length, mass, time, electric current, thermodynamic temperature, amount of substance, and luminous intensity. Other quantities such as area, pressure, and electrical resistance are derived from these base quantities by clear, non-contradictory equations. The ISQ defines the quantities that are measured with the SI units and also includes many other quantities in modern science and technology. The ISQ is defined in the international standard ISO/IEC 80000, and was finalised in 2009 with the publication of ISO 80000-1. The 14 parts of ISO/IEC 80000 define quantities used in scientific disciplines such as mechanics (e.g., pressure), light, acoustics (e.g., sound pressure), electromagnetism, information technology (e.g., storage capacity), chemistry, mathematics (e.g., Fourier transform), and physiology.", "pageId": 11559418, "dailyPageViews": 94, "created": 2007, "backlinksCount": 95, "revisionCount": 104, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/International_System_of_Quantities" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "iswim": { "title": "ISWIM", "appeared": 1966, "type": "pl", "creators": [ "Peter Landin" ], "standsFor": "If you See What I Mean", "country": [ "United Kingdom" ], "originCommunity": [ "RAND Corporation" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "Print" ] ], "example": [ "Print `Hello world'" ], "wikipedia": { "related": [ "algol-60", "lisp", "haskell", "clean", "lucid", "krc", "hope", "miranda" ], "summary": "ISWIM is an abstract computer programming language (or a family of programming languages) devised by Peter J. Landin and first described in his article The Next 700 Programming Languages, published in the Communications of the ACM in 1966. The acronym stands for \"If you See What I Mean\" (also said to have stood for \"I See What You Mean\", but ISWYM was mistyped as ISWIM). Although not implemented, it has proved very influential in the development of programming languages, especially functional programming languages such as SASL, Miranda, ML, Haskell and their successors, and dataflow programming languages like Lucid.", "pageId": 233385, "created": 2003, "backlinksCount": 43, "revisionCount": 97, "dailyPageViews": 24, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/ISWIM" }, "hopl": "https://hopl.info/showlanguage.prx?exp=261", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "it": { "title": "IT", "appeared": 1955, "type": "pl", "creators": [ "Alan Perlis" ], "reference": [ "https://semanticscholar.org/paper/4c900bab884c013dfd26cb89c168d311785f8561" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=21", "wordRank": 16, "centralPackageRepositoryCount": 0 }, "iterm2": { "title": "Iterm2", "appeared": 1996, "type": "application", "description": "iTerm2 is a replacement for Terminal and the successor to iTerm. It works on Macs with macOS 10.14 or newer. iTerm2 brings the terminal into the modern age with features you never knew you always wanted.", "website": "https://iterm2.com/", "documentation": [ "https://iterm2.com/documentation.html" ], "originCommunity": [ "https://github.com/gnachman/iTerm2" ], "domainName": { "name": "iterm2.com" }, "releaseNotesUrl": "https://iterm2.com/news.html", "writtenIn": [ "c", "python" ], "githubRepo": { "stars": 12900, "forks": 1100, "updated": 2022, "firstCommit": 1996, "description": "iTerm2 is a terminal emulator for Mac OS X that does amazing things.", "url": "https://github.com/gnachman/iTerm2" }, "wikipedia": { "related": [ "git", "magit", "sourcetree" ], "pageId": 44296721, "dailyPageViews": 84, "url": "https://en.wikipedia.org/wiki/ITerm2" } }, "itl": { "title": "ITL", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d20fd425535a23d6d61ac4c4a35c925cbdb6cf18" ], "country": [ "United States" ], "originCommunity": [ "Rutgers University" ], "wikipedia": { "summary": "ITL can refer to: Imaging Technology Laboratory, part of the University of Arizona's Steward Observatory In the Labyrinth, a role-playing system built on The Fantasy Trip Inferential theory of learning Information Technology Limited, a British computer company of the 1980s (formerly CTL) Institute of Technology Law, National Chiao Tung University a law school in Taiwan Interval Temporal Logic, a temporal logic Islamic Tools and Libraries, a subproject of Arabeyes software which provides Hijri dates, Muslim prayer times and Qibla Italian lira, the former currency of Italy that had ISO 4217 code ITL Iterative test-last, opposite of iterative test-first software development process", "backlinksCount": 13, "pageId": 304387, "dailyPageViews": 17, "created": 2003, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/ITL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6831", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ivtran": { "title": "IVTRAN", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d9c12fda8236aa2cbb7993f1f357775e64562262" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=262", "centralPackageRepositoryCount": 0 }, "ixml": { "title": "Invisible XML", "appeared": 2020, "type": "grammarLanguage", "creators": [ "Steven Pemberton" ], "description": "Invisible XML is a language for describing the implicit structure of data, and a set of technologies for making that structure explicit as XML markup. It allows you to write a declarative description of the format of some text and then leverage that format to represent the text as structured information.", "website": "https://invisiblexml.org/", "reference": [ "https://news.ycombinator.com/item?id=32120230" ], "aka": [ "ixml" ], "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/invisibleXML" ], "domainName": { "registered": 2020, "awisRank": { "2022": 6592461 }, "name": "invisiblexml.org" }, "related": [ "xml" ], "example": [ "url: scheme, \":\", authority, path.\n\nscheme: letter+.\n\nauthority: \"//\", host.\nhost: sub++\".\".\nsub: letter+.\n\npath: (\"/\", seg)+.\nseg: fletter*.\n-letter: [\"a\"-\"z\"]; [\"A\"-\"Z\"]; [\"0\"-\"9\"].\n-fletter: letter; \".\"." ], "githubRepo": { "stars": 15, "forks": 6, "subscribers": 9, "created": 2020, "updated": 2022, "description": "Invisible XML", "issues": 7, "url": "https://github.com/invisiblexml/ixml/" }, "repoStats": { "firstCommit": 2020, "commits": 444, "committers": 5, "files": 859 } }, "izibasic": { "title": "Izibasic", "appeared": 2004, "type": "pl", "reference": [ "https://fr-m-wikipedia-org.translate.goog/wiki/Izibasic?_x_tr_sl=fr&_x_tr_tl=en&_x_tr_hl=en&_x_tr_pto=sc" ], "country": [ "United States" ], "originCommunity": [ "Palm, Inc" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Izibasic" }, "centralPackageRepositoryCount": 0 }, "j": { "title": "J", "appeared": 1990, "type": "pl", "creators": [ "Kenneth E. Iverson", "Roger Hui" ], "website": "http://www.jsoftware.com", "documentation": [ "https://www.jsoftware.com/help/learning/contents.htm" ], "reference": [ "https://aplwiki.com/wiki/Jsoftware" ], "country": [ "United States" ], "originCommunity": [ "Jsoftware Inc" ], "domainName": { "registered": 1996, "awisRank": { "2022": 2232128 }, "name": "jsoftware.com" }, "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "NB. A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "hasFloats": { "example": "NB. _?\\d+\\.(?=\\d+)", "value": true }, "hasIntegers": { "example": "NB. _?\\d+", "value": true }, "lineCommentToken": [ [ "NB." ] ], "printToken": [ [ "echo" ] ], "stringToken": [ [ "'" ] ], "gource": "https://www.youtube.com/watch?v=DJyQnlVf95E", "githubRepo": { "firstCommit": 2016, "stars": 536, "forks": 72, "subscribers": 38, "created": 2016, "updated": 2022, "description": "J engine source mirror", "issues": 125, "url": "https://github.com/jsoftware/jsource" }, "repoStats": { "firstCommit": 2016, "commits": 4574, "committers": 11, "files": 1177 }, "wikipedia": { "example": [ "3 |. 1 0 1 1 0 0 1 1 1 1 1 NB. rotate\n1 0 0 1 1 1 1 1 1 0 1" ], "related": [ "linux", "apl", "fp", "fl", "numpy", "supercollider", "ascii", "unix", "sql", "c", "unicode", "k", "q" ], "summary": "The J programming language, developed in the early 1990s by Kenneth E. Iverson and Roger Hui, is a synthesis of APL (also by Iverson) and the FP and FL function-level languages created by John Backus. To avoid repeating the APL special-character problem, J uses only the basic ASCII character set, resorting to the use of the dot and colon as inflections to form short words similar to digraphs. Most such \"primary\" (or \"primitive\") J words serve as mathematical symbols, with the dot or colon extending the meaning of the basic characters available. Also, many characters which in other languages often must be paired (such as [] {} \"\" `` or <>) are treated by J as stand-alone words or, when inflected, as single-character roots of multi-character words. J is a very terse array programming language, and is most suited to mathematical and statistical programming, especially when performing operations on matrices. It has also been used in extreme programming and network performance analysis. Like the original FP/FL languages, J supports function-level programming via its tacit programming features. Unlike most languages that support object-oriented programming, J's flexible hierarchical namespace scheme (where every name exists in a specific locale) can be effectively used as a framework for both class-based and prototype-based object-oriented programming. Since March 2011, J is free and open-source software under the GPLv3 license. One may also purchase source under a negotiated license.", "pageId": 73227, "dailyPageViews": 561, "created": 2002, "backlinksCount": 196, "revisionCount": 498, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/J_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ijs" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "jconsole" ], "aceMode": "text", "tmScope": "source.j", "repos": 468, "id": "J" }, "githubBigQuery": { "repos": 151, "users": 124, "id": "J" }, "pygmentsHighlighter": { "filename": "j.py", "fileExtensions": [ "ijs" ], "id": "J" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 4, "commitCount": 43, "sampleCount": 2, "example": [ "#!/bin/jconsole\necho 'Hello, GitHub!'\nexit ''\n" ], "url": "https://github.com/tikkanz/JSyntax" }, "projectEuler": { "memberCount": { "2019": 332, "2022": 2478 }, "id": "APL/J/K" }, "helloWorldCollection": [ "NB. Hello World in J\n'Hello World' 1!:2(2)" ], "leachim6": { "filepath": "j/J.ijs", "fileExtensions": [ "ijs" ], "example": [ "#!/opt/local/bin/jc\necho 'Hello World'\nexit ''\n" ], "id": "J" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:J", "rijuRepl": { "example": [ "echo 'Hello, world!'\n" ], "id": "https://riju.codes/j" }, "tryItOnline": "j", "tiobe": { "id": "J" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1558", "jupyterKernel": [ "https://github.com/martin-saurer/jkernel" ], "fileType": "text", "wordRank": 417, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n|Firewall|Programming In C [Paperback] [Jan 01, 2011] DIXIT J B| J. B. Dixit|9789380298399", "semanticScholar": "" }, "jacal": { "title": "JACAL", "appeared": 2008, "type": "pl", "reference": [ "https://github.com/barak/jacal" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2128", "centralPackageRepositoryCount": 0 }, "jacl": { "title": "JACL", "appeared": 1997, "type": "pl", "creators": [ "Ioi K. Lam", "Brian Smith" ], "description": "Jacl, pronunced “Jackal”, is a Tcl interpreter written in Java. You can use it for Java the same way Tcl is used for C — a scripting language to glue together modules written in a low level language.", "reference": [ "https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.444.4172&rep=rep1&type=pdf", "https://vmlanguages.is-research.de/jacl/" ], "country": [ "Germany" ], "originCommunity": [ "http://www.brainbyte.de/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8579", "centralPackageRepositoryCount": 0 }, "jade": { "title": "JADE", "appeared": 1996, "type": "pl", "country": [ "New Zealand" ], "originCommunity": [ "Jade Software Corporation" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "write" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "helloWorld();\n\nbegin\n write \"Hello, World!\";\nend;" ], "related": [ "java", "c", "pascal", "modula-2", "linc-4gl" ], "summary": "JADE is a proprietary object-oriented software development and deployment platform product from the New Zealand-based Jade Software Corporation, first released in 1996. It consists of the JADE programming language, IDE and debugger, integrated application server and object database management system. Designed as an end-to-end development environment to allow systems to be coded in one language from the database server down to the clients, it also provides APIs for other languages, including .NET Framework, Java, C/C++ and Web services. Although a free limited licence is available for development, using the JADE platform requires per-process fees to be paid.", "pageId": 5887624, "dailyPageViews": 84, "created": 2005, "backlinksCount": 33, "revisionCount": 172, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/JADE_(programming_language)" }, "codeMirror": "jade", "helloWorldCollection": [ "// Hello World in JADE\nwrite \"Hello World\";" ], "leachim6": { "filepath": "j/Jade.jade", "fileExtensions": [ "jade" ], "example": [ "helloWorld();\n\nbegin\n write \"Hello World\";\nend;" ], "id": "Jade" }, "tiobe": { "id": "JADE" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2130", "fileType": "text", "wordRank": 9715, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011|Morgan Kaufmann|GPU Computing Gems Jade Edition (Applications of GPU Computing Series)|Hwu, Wen-mei W.|9780123859631\n2016|CreateSpace Independent Publishing Platform|An Introduction to Object-Oriented Systems Development with JADE|Clarke, Bevan John|9781539106661\n2007|Wiley|Developing Multi-Agent Systems with JADE|Bellifemine, Fabio Luigi and Caire, Giovanni and Greenwood, Dominic|9780470057476\n2011|Morgan Kaufmann|GPU Computing Gems Jade Edition (Applications of GPU Computing Series)|Wen-mei W. Hwu|9780123859648" }, "jai": { "title": "JAI", "appeared": 2014, "type": "pl", "creators": [ "Jonathan Blow" ], "reference": [ "https://inductive.no/jai/", "https://github.com/Jai-Community/Jai-Community-Library/wiki", "https://twitter.com/Jonathan_Blow/status/1474203662134255618" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/Jai-Community/" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "Print" ] ], "stringToken": [ [ "\"" ] ], "example": [ "#import \"Basic\";\nmain :: () {\n print(\"Hello, World!\\n\");\n}" ], "wikipedia": { "summary": "Jonathan Blow (born 1971) is an American video game designer and programmer, who is best known as the creator of the independent video games Braid (2008) and The Witness (2016), both of which were released to critical acclaim. From 2001 to 2004, Blow wrote the Inner Product column for Game Developer Magazine. He was the primary host of the Experimental Gameplay Workshop each March at the Game Developers Conference, which has become a premier showcase for new ideas in video games. In addition, Blow was a regular participant in the Indie Game Jam. Blow is also a founding partner of the Indie Fund, an angel investor fund for independent game projects.", "pageId": 4018856, "created": 2016, "backlinksCount": 83, "revisionCount": 6, "dailyPageViews": 7, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/JAI_(programming_language)" }, "leachim6": { "filepath": "j/Jai.jai", "fileExtensions": [ "jai" ], "example": [ "#import \"Print\"\n\nmain::(){\n\n\tprint(\"Hello World\");\n\n}" ], "id": "Jai" }, "subreddit": [ { "memberCount": { "2022": 1507 }, "url": "https://reddit.com/r/Jai" } ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "jakt": { "title": "Jakt", "appeared": 2022, "type": "pl", "description": "Jakt is a memory-safe systems programming language. It currently transpiles to C++.", "country": [ "Various" ], "originCommunity": [ "https://github.com/SerenityOS/" ], "compilesTo": [ "cpp" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "example": [ "function main() {\n let x = (\"a\", 2, true)\n\n println(\"{}\", x.1)\n}" ], "githubRepo": { "firstCommit": 2022, "stars": 1671, "forks": 170, "subscribers": 28, "created": 2022, "updated": 2022, "description": "The Jakt Programming Language", "issues": 67, "url": "https://github.com/SerenityOS/jakt" }, "repoStats": { "firstCommit": 2022, "commits": 2372, "committers": 122, "files": 1232 }, "leachim6": { "filepath": "j/Jakt.jakt", "fileExtensions": [ "jakt" ], "example": [ "function main() {\n println(\"Hello World\")\n}\n" ], "id": "Jakt" }, "compilerExplorer": { "example": [ "function square(num: i32) -> i32 {\n return num * num\n}\n\nfunction main() {\n return square(num: 3)\n}\n" ], "id": "Jakt" }, "isbndb": "" }, "jal-compiler": { "title": "JAL compiler", "appeared": 2000, "type": "compiler", "country": [ "The Netherlands" ], "originCommunity": [ "Van Ooijen Technische Informatica" ], "githubRepo": { "stars": 21, "forks": 13, "subscribers": 13, "created": 2015, "updated": 2023, "description": "Automatically exported from code.google.com/p/jallib", "issues": 22, "url": "https://github.com/jallib/jallib" }, "wikipedia": { "example": [ "-- JAL 2.3\ninclude 16f877_bert--define the variables\nvar byte resist--define the pins\npin_a0_direction = input--variable resistor\npin_d7_direction = input--switch\npin_c2_direction = output--pwm led--enable pulse width modulation\nPWM_init_frequency (true, true)\n\nforever loop--convert analog on a0 to digital\n resist = ADC_read_low_res(0)\n\n -- run measurement through flash memory\n program_eeprom_write(2000,resist)\n program_eeprom_read(2000,resist)\n\n -- run measurement through data memory\n data_eeprom_write(10,resist)\n data_eeprom_read(10,resist)\n\n -- if the switch is pressed return random value\n if pin_d7 == high then\n resist = random_byte\n end if--send resistance to PC\n serial_sw_write(resist)\n delay_100ms(1)\n -- set actual PWM duty cycle\n PWM_Set_DutyCycle (resist, resist)\n\nend loop" ], "related": [ "pic-microcontroller" ], "summary": "JAL (Just Another Language) is a Pascal-like programming language and compiler that generates executable code for PIC microcontrollers. It is a free-format language with a compiler that runs on Linux, MS-Windows and MS-DOS (OSX support). It is configurable and extendable through the use of libraries and can even be combined with PIC assembly language.", "pageId": 2410974, "created": 2005, "backlinksCount": 16, "revisionCount": 78, "dailyPageViews": 7, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/JAL_(compiler)" }, "fileType": "na", "centralPackageRepositoryCount": 0 }, "jammy": { "title": "Jammy", "appeared": 2021, "type": "pl", "creators": [ "Mark" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/markpwns1/jammy/issues" ], "compilesTo": [ "lua" ], "writtenIn": [ "javascript" ], "githubRepo": { "firstCommit": 2021, "stars": 7, "forks": 0, "subscribers": 2, "created": 2021, "updated": 2021, "description": "A programming language specifically for doing game jams in Love2D", "issues": 0, "url": "https://github.com/markpwns1/jammy" }, "repoStats": { "firstCommit": 2021, "commits": 89, "committers": 3, "files": 28 } }, "janet": { "title": "janet", "appeared": 2018, "type": "pl", "creators": [ "Calvin Rose" ], "website": "https://janet-lang.org", "country": [ "Czech Republic and New Zealand and United States" ], "originCommunity": [ "https://github.com/janet-lang" ], "domainName": { "registered": 2018, "awisRank": { "2022": 3137783 }, "name": "janet-lang.org" }, "hasComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasLists": { "example": "", "value": true }, "hasAssignment": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "example": [ "import joy)\n\n(defn home [request]\n (joy/render :text \"You found joy!\"))\n\n(def routes [[:get \"/\" home]])\n\n(def app (joy/handler routes))\n\n(joy/server app 8000)" ], "githubRepo": { "stars": 2667, "forks": 185, "subscribers": 57, "created": 2017, "updated": 2023, "description": "A dynamic language and bytecode vm", "issues": 31, "url": "https://github.com/janet-lang/janet" }, "repoStats": { "firstCommit": 2017, "commits": 3737, "committers": 100, "files": 163 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "janet" ], "interpreters": [ "janet" ], "aceMode": "scheme", "codemirrorMode": "scheme", "codemirrorMimeType": "text/x-scheme", "tmScope": "source.janet", "repos": 88, "id": "Janet" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n19171121|Janet is a Lisp for scripting, or embedding in other programs|https://janet-lang.org/|2019-02-15 14:26:40 UTC|1550240800|rainygold|0|3" }, "jank": { "title": "Jank", "appeared": 2015, "type": "pl", "website": "https://jank-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/jank-lang" ], "githubRepo": { "firstCommit": 2015, "stars": 752, "forks": 9, "subscribers": 22, "created": 2014, "updated": 2022, "description": "A Clojure dialect on LLVM with gradual typing, a native runtime, and C++ interop", "issues": 0, "url": "https://github.com/jeaye/jank" }, "repoStats": { "firstCommit": 2015, "commits": 2989, "committers": 4, "files": 236 } }, "janus-lang": { "title": "Janus", "appeared": 1982, "type": "pl", "creators": [ "Christopher Lutz", "Howard Derby", "Tetsuo Yokoyama", "and Robert Glück" ], "reference": [ "https://semanticscholar.org/paper/6592f89ddba3ee5e85b2cf0ffaf31e01d78e66e5" ], "country": [ "United States" ], "originCommunity": [ "California Institute of Technology" ], "wikipedia": { "example": [ "procedure fib\n from i = 2\n do\n i += 1\n x1 <=> x2\n x1 -= x2\n loop\n until i = n" ], "related": [ "prolog" ], "summary": "Janus is a time-reversible programming language written at Caltech in 1982. The operational semantics of the language were formally specified, together with a program inverter and an invertible self-interpreter, in 2007 by Tetsuo Yokoyama and Robert Glück. A Janus inverter and interpreter is made freely available by the TOPPS research group at DIKU. Another Janus interpreter was implemented in Prolog in 2009. The below summarises the language presented in the 2007 paper. Janus is an imperative programming language with a global store (there is no stack or heap allocation). Janus is a reversible programming language, i.e. it supports deterministic forward and backward computation by local inversion.", "revisionCount": 9, "created": 2016, "backlinksCount": 4, "pageId": 50304039, "dailyPageViews": 11, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/Janus_(time-reversible_computing_programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1559", "centralPackageRepositoryCount": 0 }, "janus-programming-language": { "title": "Janus", "appeared": 1990, "type": "pl", "creators": [ "Ken Kahn" ], "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "wikipedia": { "related": [ "janus-programming-language", "janus-lang" ], "summary": "Janus is the two-faced Roman god of gates, doors, doorways, beginnings, and endings. Janus may also refer to:", "revisionCount": 8, "created": 2006, "backlinksCount": 18, "pageId": 16373, "dailyPageViews": 8, "appeared": 1950, "url": "https://en.wikipedia.org/wiki/Janus_(concurrent_constraint_programming_language)" }, "centralPackageRepositoryCount": 0 }, "jargon": { "title": "Jargon", "appeared": 1987, "type": "pl", "reference": [ "https://joewing.net/projects/jargon/" ], "wikipedia": { "summary": "Jargon is a type of language that is used in a particular context and may not be well understood outside that context. The context is usually a particular occupation (that is, a certain trade, profession, or academic field), but any in group can have jargon. The main trait that distinguishes jargon from the rest of a language is special vocabulary—including some words specific to it, and often different senses or meanings of words, that out groups would tend to take in another sense—therefore misunderstanding that communication attempt. Jargon is thus \"the technical terminology or characteristic idiom of a special activity or group\". Most jargon is technical terminology, involving terms of art or industry terms, with particular meaning within a specific industry. A main driving force in the creation of technical jargon is precision and efficiency of communication when a discussion must easily range from general themes to specific, finely differentiated details without circumlocution. A side-effect of this is a higher threshold for comprehensibility, which is usually accepted as a trade-off but is sometimes even used as a means of social exclusion (reinforcing ingroup-outgroup barriers) or social aspiration (when intended as a way of showing off). The philosopher Étienne Bonnot de Condillac observed in 1782 that \"every science requires a special language because every science has its own ideas\". As a rationalist member of the Enlightenment, he continued: \"It seems that one ought to begin by composing this language, but people begin by speaking and writing, and the language remains to be composed.\"Various kinds of language peculiar to ingroups can be named across a semantic field. Slang can be either culture-wide or known only within a certain group or subculture. Argot is slang or jargon purposely used to obscure meaning to outsiders. Conversely, a lingua franca is used for the opposite effect, helping communicators to overcome unintelligibility, as are pidgins and creole languages. For example, the Chinook Jargon was a pidgin. Although technical jargon's primary purpose is to aid technical communication, not to exclude outsiders by serving as an argot, it can have both effects at once and can provide a technical ingroup with shibboleths. For example, medieval guilds could use this as one means of informal protectionism. On the other hand, jargon that once was obscure outside a small ingroup can become generally known over time. For example, the terms bit, byte, and hexadecimal (which are terms from computing jargon) are now recognized by many people outside computer science.", "backlinksCount": 1136, "pageId": 49607, "dailyPageViews": 587, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/Jargon" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8581", "centralPackageRepositoryCount": 0 }, "jasmin": { "title": "Jasmin", "appeared": 1997, "type": "pl", "description": "Jasmin is an assembler for the Java Virtual Machine. It takes ASCII descriptions of Java classes, written in a simple assembler-like syntax using the Java Virtual Machine instruction set. It converts them into binary Java class files, suitable for loading by a Java runtime system.", "website": "http://jasmin.sourceforge.net/", "country": [ "United States" ], "originCommunity": [ "https://jasmin.sourceforge.net/" ], "domainName": { "name": "jasmin.sourceforge.net" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "stringToken": [ [ "\"" ] ], "githubLanguage": { "fileExtensions": [ "j" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "java", "tmScope": "source.jasmin", "repos": 74, "id": "Jasmin" }, "githubBigQuery": { "repos": 204, "users": 194, "id": "Jasmin" }, "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "j" ], "id": "Jasmin" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2014, "committerCount": 3, "commitCount": 12, "sampleCount": 8, "example": [ ".class public op2\n.super java/lang/Object\n;\n; standard initializer (calls java.lang.Object's initializer)\n;\n.method public ()V\naload_0\ninvokenonvirtual java/lang/Object/()V\nreturn\n.end method\n\n.method public static main([Ljava/lang/String;)V\n\n.limit locals 1\n.limit stack 5\nBeginGlobal:\n\t.line 2\n\t\tgetstatic\t\tjava/lang/System/out Ljava/io/PrintStream;\n\t\tldc\t\t0x1\n\t\tldc\t\t0x0\n\t\tiand\n\t\tinvokevirtual\t\tjava/io/PrintStream/println(Z)V\n\n\t.line 3\n\t\tgetstatic\t\tjava/lang/System/out Ljava/io/PrintStream;\n\t\tldc\t\t0x1\n\t\tldc\t\t0x0\n\t\tior\n\t\tinvokevirtual\t\tjava/io/PrintStream/println(Z)V\n\nEndGlobal:\nreturn\n.end method\n\n" ], "url": "https://github.com/atmarksharp/jasmin-sublime" }, "leachim6": { "filepath": "j/Jasmin.j", "fileExtensions": [ "j" ], "example": [ ".class public Jasmin\n.super java/lang/Object\n\n.method public static main([Ljava/lang/String;)V\n\t.limit stack 2\n\tgetstatic java/lang/System/out Ljava/io/PrintStream;\n\tldc \"Hello World\"\n\tinvokevirtual java/io/PrintStream/println(Ljava/lang/String;)V\n\treturn\t\n.end method\n" ], "id": "Jasmin" }, "rijuRepl": { "example": [ ".class public Main\n.super java/lang/Object\n\n.method public ()V\n aload_0\n invokenonvirtual java/lang/Object/()V\n return\n.end method\n\n.method public static main([Ljava/lang/String;)V\n .limit stack 2\n getstatic java/lang/System/out Ljava/io/PrintStream;\n ldc \"Hello, world!\"\n invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V\n return\n.end method\n" ], "id": "https://riju.codes/jasmin" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "jasmine": { "title": "jasmine", "appeared": 2008, "type": "library", "website": "https://jasmine.github.io/", "country": [ "United States" ], "originCommunity": [ "https://github.com/jasmine/jasmine" ], "domainName": { "awisRank": { "2022": 317709 }, "name": "jasmine.github.io" }, "githubRepo": { "firstCommit": 2008, "stars": 15387, "forks": 2265, "subscribers": 450, "created": 2008, "updated": 2022, "description": "Simple JavaScript testing framework for browsers and node.js", "issues": 31, "url": "https://github.com/jasmine/jasmine" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "jasper": { "title": "jasper", "appeared": 2014, "type": "pl", "creators": [ "Emanuel Rylke" ], "webRepl": [ "http://ema-fox.github.io/jasper/" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/ema-fox/jasper/issues" ], "example": [ "(+ 2 3)\n(map [+ 1 _] '(1 2 3))\n(let a 4 (map [+ 3 a _] '(1 2 3)))\n(alert \"Hello world!\")\n(map str '(1 2 3) '(foo bar baz))" ], "githubRepo": { "firstCommit": 2014, "stars": 3, "subscribers": 2, "created": 2014, "updated": 2021, "description": "compile to js lisp inspired by arc", "forks": 0, "issues": 0, "url": "https://github.com/ema-fox/jasper" }, "repoStats": { "firstCommit": 2014, "commits": 66, "committers": 1, "files": 7 }, "isbndb": "" }, "jass": { "title": "Just Another Scripting Syntax", "appeared": 2009, "type": "pl", "standsFor": "Just Another Scripting Syntax", "country": [ "United States" ], "originCommunity": [ "Blizzard Entertainment, Inc" ], "wikipedia": { "example": [ "function Trig_JASS_testPreloadExploit_Actions takes nothing returns nothing\n call PreloadGenEnd(\".\\\\redist\\\\miles\\\\Mp3enc.asi\")\nendfunction" ], "related": [ "java" ], "summary": "JASS and JASS2 (sometimes said to stand for Just Another Scripting Syntax) is a scripting language provided with an event-driven API created by Blizzard Entertainment. It is used extensively by their games Warcraft III (JASS2) and StarCraft (JASS) for scripting events in the game world. Map creators can use it in the Warcraft III World Editor and the Starcraft Editor to create scripts for triggers and AI (artificial intelligence) in custom maps and campaigns. Blizzard Entertainment has replaced JASS with Galaxy in Starcraft II.", "pageId": 3115483, "created": 2005, "backlinksCount": 89, "revisionCount": 241, "dailyPageViews": 30, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/JASS" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "java-bytecode": { "title": "Java Bytecode", "appeared": 1995, "type": "bytecode", "documentation": [ "https://docs.oracle.com/javase/specs/jvms/se7/html/" ], "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "0: iconst_2\n1: istore_1\n2: iload_1\n3: sipush 1000\n6: if_icmpge 44\n9: iconst_2\n10: istore_2\n11: iload_2\n12: iload_1\n13: if_icmpge 31\n16: iload_1\n17: iload_2\n18: irem\n19: ifne 25\n22: goto 38\n25: iinc 2, 1\n28: goto 11\n31: getstatic #84; // Field java/lang/System.out:Ljava/io/PrintStream;\n34: iload_1\n35: invokevirtual #85; // Method java/io/PrintStream.println:(I)V\n38: iinc 1, 1\n41: goto 2\n44: return" ], "related": [ "jvm", "java", "assembly-language", "c", "coldfusion", "jruby", "jython", "ruby", "python", "groovy", "scala", "ada", "clojure", "lisp", "javafx-script", "kotlin", "object-pascal", "free-pascal", "cil" ], "summary": "Java bytecode is the instruction set of the Java virtual machine (JVM).", "pageId": 38321273, "dailyPageViews": 302, "created": 2005, "backlinksCount": 175, "revisionCount": 373, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Java_bytecode" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "java-ee-version-history": { "title": "Java EE version history", "appeared": 1998, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ], "wikipedia": { "example": [ "@Entity\npublic class User {\n\n @Id\n @GeneratedValue(strategy = IDENTITY)\n private Integer id;\n \n @Size(min = 2, message=\"First name too short\")\n private String firstName;\n \n @Size(min = 2, message=\"Last name too short\")\n private String lastName;\n \n public Integer getId() {\n return id;\n }\n \n public void setId(Integer id) {\n this.id = id;\n }\n \n public String getFirstName() {\n return firstName;\n }\n\n public void setFirstName(String firstName) {\n this.firstName = firstName;\n }\n \n public String getLastName() {\n return lastName;\n }\n \n public void setLastName(String lastName) {\n this.lastName = lastName;\n }\n\n}" ], "related": [ "java-server-pages", "facelets", "java-ee-version-history" ], "summary": "Java Platform, Enterprise Edition (Java EE), formerly Java 2 Platform, Enterprise Edition (J2EE), currently Jakarta EE, is a set of specifications, extending Java SE 8 (i.e. not based on latest Java 11; while can also work with later it or later than Java 8) with specifications for enterprise features such as distributed computing and web services. Java EE applications are run on reference runtimes, that can be microservices or application servers, which handle transactions, security, scalability, concurrency and management of the components it is deploying. Java EE is defined by its specification. The specification defines APIs and their interactions. As with other Java Community Process specifications, providers must meet certain conformance requirements in order to declare their products as Java EE compliant. Examples of contexts in which Java EE referencing runtimes are used are: e-commerce, accounting, banking information systems.", "created": 2007, "backlinksCount": 322, "pageId": 42869, "revisionCount": 140, "dailyPageViews": 44, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Java_EE_version_history" }, "centralPackageRepositoryCount": 0 }, "java-properties": { "title": "Java Properties", "appeared": 1995, "type": "dataNotation", "aka": [ ".properties", "dot properties" ], "fileExtensions": [ "properties" ], "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "example": [ "# You are reading the \".properties\" entry.\n! The exclamation mark can also mark text as comments.\n# The key characters =, and : should be written with\n# a preceding backslash to ensure that they are properly loaded.\n# However, there is no need to precede the value characters =, and : by a backslash.\nwebsite = https://en.wikipedia.org/\nlanguage = English\n# The backslash below tells the application to continue reading\n# the value onto the next line.\nmessage = Welcome to \\\n Wikipedia!\n# Add spaces to the key\nkey\\ with\\ spaces = This is the value that could be looked up with the key \"key with spaces\".\n# Unicode\ntab : \\u0009\n# If you want your property to include a backslash, it should be escaped by another backslash\npath=c:\\\\wiki\\\\templates\n# However, some editors will handle this automatically" ], "related": [ "java", "unicode", "notepad-editor", "emacs-editor", "vim-editor", "ascii", "eclipse-editor", "perl", "xml", "yaml" ], "summary": ".properties is a file extension for files mainly used in Java related technologies to store the configurable parameters of an application. They can also be used for storing strings for Internationalization and localization; these are known as Property Resource Bundles. Each parameter is stored as a pair of strings, one storing the name of the parameter (called the key), and the other storing the value.", "created": 2006, "backlinksCount": 33, "pageId": 4952396, "revisionCount": 181, "dailyPageViews": 205, "url": "https://en.wikipedia.org/wiki/.properties" }, "githubLanguage": { "fileExtensions": [ "properties" ], "type": "data", "aceMode": "properties", "codemirrorMode": "properties", "codemirrorMimeType": "text/x-properties", "tmScope": "source.java-properties", "repos": 6363, "id": "Java Properties" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 21, "commitCount": 283, "sampleCount": 2, "example": [ "#\n# Licensed under the Apache License, Version 2.0 (the \"License\"); you\n# may not use this file except in compliance with the License. You may\n# obtain a copy of the License at\n#\n#\thttp://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n# implied. See the License for the specific language governing\n# permissions and limitations under the License.\n#\nDink:net/rptools/maptool/client/sound/dink.mp3\nClink:net/rptools/maptool/client/sound/clink.mp3\n" ], "url": "https://github.com/textmate/java.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "java-server-pages": { "title": "JSP", "appeared": 1999, "type": "template", "documentation": [ "https://docs.oracle.com/javaee/5/tutorial/doc/bnajo.html" ], "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ], "wikipedia": { "example": [ "The value of \"variable\" in the object \"javabean\" is ${javabean.variable}." ], "related": [ "html", "xml", "php", "asp", "java", "jvm", "apache-velocity", "java-ee-version-history", "thymeleaf" ], "summary": "JavaServer Pages (JSP) is a technology that helps software developers create dynamically generated web pages based on HTML, XML, or other document types. Released in 1999 by Sun Microsystems, JSP is similar to PHP and ASP, but it uses the Java programming language. To deploy and run JavaServer Pages, a compatible web server with a servlet container, such as Apache Tomcat or Jetty, is required.", "backlinksCount": 391, "pageId": 42910, "created": 2002, "revisionCount": 1033, "dailyPageViews": 549, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/JavaServer_Pages" }, "githubLanguage": { "fileExtensions": [ "jsp" ], "trendingProjectsCount": 0, "type": "programming", "group": "Java", "aceMode": "jsp", "codemirrorMode": "htmlembedded", "codemirrorMimeType": "application/x-jsp", "tmScope": "text.html.jsp", "aliases": [ "jsp" ], "repos": 729, "id": "Java Server Pages" }, "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "jsp" ], "id": "Java Server Page" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 21, "commitCount": 283, "url": "https://github.com/textmate/java.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2001|Apress|Beginning JSP Web Development|Jayson Falkner and John Timney and Casey Kochmer and Romin Irani and Perrumal Krishnaraj and Meeraj Moidoo Kunnumpurath and Sathya Narayana Panduranga and Ben Galbraith|9781861002099\n2000|Apress|Professional JSP : Using JavaServer Pages, Servlets, EJB, JNDI, JDBC, XML, XSLT, and WML|Karl Avedal and Danny Ayers and Timothy Briggs and George Gonchar and Naufal Khan and Peter Henderson and Mac Holden and Andre Lei and Dan Malks and Sameer Tyagi and Stephan Osmont and Paul Siegmann and Gert Van Damme and Steve Wilkinson and Stefan Zeiger and John Zukowski and Ari Halberstadt and Carl Burnham and John Timney and Tom Myers and Alexander Nakhimovsky|9781861003621\n2002|Prentice Hall Ptr|JSP and Java: The Complete Guide to Website Development|Taylor, Art|9780130918130\n2002|Random House|CodeNotes for J2EE: EJB, JDBC, JSP and Servlets|Brill, Gregory|9780679647270\n2014|Brainy Software|Servlet, JSP and Spring MVC: A Tutorial (A Tutorial series)|Kurniawan, Budi and Deck, Paul|9781771970020\n2002|Sams Publishing|MySQL and JSP Web Applications: Data-Driven Programming Using Tomcat and MySQL|Turner, James|9780672323096\n2003|Morgan Kaufmann|JSTL: Practical Guide for JSP Programmers (The Practical Guides)|Spielman, Sue|9780126567557\n2002|Picnic Time|JSP Examples and Best Practices|Patzer, Andrew|9781590590201\n2002|Apress|XML Programming: Web Applications and Web Services With JSP and ASP|Alexander Nakhimovsky and Tom Myers|9781590590034\n1999|Apress|Professional Java XML Programming with servlets and JSP|Myers, Thomas J.|9781861002853\n2002|New Riders Pub|JSP and Tag Libraries for Web Development|Da Silva, Wellington L. S. and Silva, Wellington and da Silva, Wellington L.S.|9780735710955\n1990|Krieger Pub Co|Structured Programming With Cobol and Jsp|Thompson, John B.|9780862382452\n2003||Murach's Java Servlets And Jsp ( B/cd -rom)|Andrea Steelman|9788173669231\n2000|McGraw-Hill Education|Oracle8i Java Component Programming With EJB, CORBA AND JSP (Oracle Press)|Morisseau-Leroy, Nirva and Solomon, Martin K. and Basu, Julie|9780072133349\n20040510|Springer Nature|Beginning JSP 2|Sathya Narayana Panduranga; Vikram Goyal; Peter den Haan; Krishnaraj Perrumal; Lance Lavandowska|9781430206934\n||Systems Programming with Jsp|Sanden and Bo and Sandben|9789144220918\n19920615|Bloomsbury UK|Program Design Using JSP|M. J. King; J. P. Pardoe|9781349220816\n1985|Brookfield Pub Co|Systems Programming With Jsp|Bo Sanden|9780862380540\n1996|Springer|JSP for Practical Program Design|K. Dudman|9780387915043\n06/2014|Mike Murach & Associates|Murach's Java Servlets and JSP|Joel Murach, Michael Urban|9781890774875\n1989|Krieger Pub Co|Structured Programming With Cobol And Jsp (polytechnic Series)|John B. Thompson|9780862381547\n10/2019|BPB Publications|Web Applications using JSP (Java Server Page)|P. Karthik|9789388176200\n20141201|McGraw-Hill Higher Education (US)|Oracle8i Java Component Programming With EJB, CORBA AND JSP|Morisseau-Leroy, Nirva; Solomon, Martin; Basu, Julie|9780072127379\n|Berkeley, Calif. : Osborne/mcgraw-hill, Cop. 2000|Oracle8i Java Component Programming With Ejb, Corba And Jsp||9780072127362\n|Berkeley, Calif. : Osborne/McGraw-Hill, cop. 2000|Oracle8i Java component programming with EJB, CORBA and JSP||9780072127355\n2002|Wiley|Mastering Jsp Custom Tags And Tag Libraries (java Open Source Library)|James Goodwill|9780471213031\n2000|Ibm|Servlet And Jsp Programming With Ibm Websphere Studio And Visualage For Java (ibm Redbook)|Ibm Redbooks|9780738416083\n2001|Sybex, Incorporated|Java Developer's Guide To E-commerce With Xml And Jsp (developer's Handbook Series)|William Brogden and Chris Minnick|9781402846465", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2008|GSP: Extending G-Code using JSP servlet technologies|10.1109/COASE.2008.4626499|1|0|S. Nagle and Jeff Wiegley|6d93074266b35df7da6f2c7cf06987235e670e2e" }, "java": { "title": "Java", "appeared": 1995, "type": "pl", "creators": [ "James Gosling" ], "website": "https://openjdk.org/", "devDocumentation": [ "https://openjdk.org/guide/" ], "ebook": "https://sd.blackball.lv/library/thinking_in_java_4th_edition.pdf", "emailList": [ "https://mail.openjdk.org/mailman/listinfo" ], "spec": "https://docs.oracle.com/javase/specs/", "aka": [ "OpenJDK" ], "country": [ "United States" ], "originCommunity": [ "Sun Microsystems" ], "releaseNotesUrl": "https://openjdk.org/projects/jdk-updates/", "proposals": "https://openjdk.org/jeps/0", "influencedBy": [ "c", "cpp" ], "visualParadigm": false, "hasSExpressions": { "example": "", "value": false }, "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasAssertStatements": { "example": "// By default, assertions are disabled\n// java –enableassertions Test\nint score = 10;\nassert score >= 10 : \" Below\";\nSystem.out.println(\"score is \"+score);", "value": true }, "hasGenerics": { "example": "List v = new ArrayList();\nv.add(\"test\");\nInteger i = v.get(0); // (type error) compilation-time error", "value": true }, "hasSingleDispatch": { "example": "", "value": true }, "hasPointers": { "example": "", "value": false }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasComments": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasImports": { "example": "import javax.swing.*;\nimport javax.swing.JOptionPane;\n// use fully qualified name without import:\njavax.swing.JOptionPane.showMessageDialog(null, \"Hi\");\n// There are 166 packages containing 3279 classes and interfaces in Java 5.\n// import java.io.*; Input-output classes.", "value": true }, "hasInterfaces": { "example": "interface MyInterface{ \n /* This is a default method so we need not\n * to implement this method in the implementation \n * classes \n */\n default void newMethod(){ \n System.out.println(\"Newly added default method\"); \n } \n /* Already existing public and abstract method\n * We must need to implement this method in \n * implementation classes.\n */\n void existingMethod(String str); \n} \npublic class Example implements MyInterface{ \n // implementing abstract method\n public void existingMethod(String str){ \n System.out.println(\"String is: \"+str); \n } \n public static void main(String[] args) { \n Example obj = new Example();\n \n //calling the default method of interface\n obj.newMethod(); \n //calling the abstract method of interface\n obj.existingMethod(\"Java 8 is easy to learn\"); \n \n } \n}", "value": true }, "hasIterators": { "example": "Iterator iter = list.iterator();\n//Iterator iter = list.iterator(); in J2SE 5.0\nwhile (iter.hasNext()) {\n System.out.print(iter.next());\n if (iter.hasNext())\n System.out.print(\", \");\n}", "value": true }, "hasMacros": { "example": "", "value": false }, "hasOperatorOverloading": { "example": "", "value": false }, "hasZeroBasedNumbering": { "example": "", "value": true }, "hasModules": { "example": "// Package = directory. Java classes can be grouped together in packages. A package name is the same as the directory (folder) name which contains the .java files. You declare packages when you define your Java program, and you name the packages you want to use from other libraries in an import statement.\n// The first statement, other than comments, in a Java source file, must be the package declaration.\n// Following the optional package declaration, you can have import statements, which allow you to specify classes from other packages that can be referenced without qualifying them with their package.\n// This source file must be Drawing.java in the illustration directory.\npackage illustration;\nimport java.awt.*;\npublic class Drawing {\n // ...\n}", "value": true }, "hasIncrementAndDecrementOperators": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasThreads": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "isCaseSensitive": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasInheritance": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "// 0[0-7_]+[lL]?", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F][0-9a-fA-F_]*[lL]?", "value": true }, "hasFloats": { "example": "// ([0-9][0-9_]*\\.([0-9][0-9_]*)?|\\.[0-9][0-9_]*)([eE][+\\-]?[0-9][0-9_]*)?[fFdD]?|[0-9][eE][+\\-]?[0-9][0-9_]*[fFdD]?|[0-9]([eE][+\\-]?[0-9][0-9_]*)?[fFdD]|0[xX]([0-9a-fA-F][0-9a-fA-F_]*\\.?|([0-9a-fA-F][0-9a-fA-F_]*)?\\.[0-9a-fA-F][0-9a-fA-F_]*)[pP][+\\-]?[0-9][0-9_]*[fFdD]?", "value": true }, "hasIntegers": { "example": "// 0|[1-9][0-9_]*[lL]?", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01][01_]*[lL]?", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "System.out.println" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "continue", "for", "new", "switch", "assert", "default", "goto", "package", "synchronized", "boolean", "do", "if", "private", "this", "break", "double", "implements", "protected", "throw", "byte", "else", "import", "public", "throws", "case", "enum", "instanceof", "return", "transient", "catch", "extends", "int", "short", "try", "char", "final", "interface", "static", "void", "class", "finally", "long", "strictfp", "volatile", "const", "float", "native", "super", "while", "_" ], "githubRepo": { "stars": 15796, "forks": 4503, "subscribers": 311, "created": 2018, "updated": 2023, "description": "JDK main-line development https://openjdk.org/projects/jdk", "issues": 311, "url": "https://github.com/openjdk/jdk" }, "repoStats": { "firstCommit": 2007, "commits": 76734, "committers": 1775, "files": 67099 }, "wikipedia": { "example": [ "// Hello.java (Java SE 5)\nimport javax.swing.*;\n\npublic class Hello extends JFrame {\n public Hello() {\n super(\"hello\");\n super.setDefaultCloseOperation(WindowConstants.EXIT_ON_CLOSE);\n super.add(new JLabel(\"Hello, world!\"));\n super.pack();\n super.setVisible(true);\n }\n\n public static void main(final String[] args) {\n new Hello();\n }\n}" ], "related": [ "javascript", "pizza", "ada", "csharp", "eiffel", "mesa", "modula-3", "oberon", "objective-c", "ucsd-pascal", "object-pascal", "beanshell", "chapel", "clojure", "ecmascript", "fantom", "gambas", "groovy", "hack", "jsharp", "kotlin", "php", "python", "scala", "seed7", "vala", "java-bytecode", "jvm", "c", "oak", "linux", "solaris", "arm", "eclipse-editor", "html", "http", "mime", "java-server-pages", "motif-software", "android", "xml", "java-ee-version-history" ], "summary": "Java is a general-purpose computer programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible. It is intended to let application developers \"write once, run anywhere\" (WORA), meaning that compiled Java code can run on all platforms that support Java without the need for recompilation. Java applications are typically compiled to bytecode that can run on any Java virtual machine (JVM) regardless of computer architecture. As of 2016, Java is one of the most popular programming languages in use, particularly for client-server web applications, with a reported 9 million developers. Java was originally developed by James Gosling at Sun Microsystems (which has since been acquired by Oracle Corporation) and released in 1995 as a core component of Sun Microsystems' Java platform. The language derives much of its syntax from C and C++, but it has fewer low-level facilities than either of them. The original and reference implementation Java compilers, virtual machines, and class libraries were originally released by Sun under proprietary licenses. As of May 2007, in compliance with the specifications of the Java Community Process, Sun relicensed most of its Java technologies under the GNU General Public License. Others have also developed alternative implementations of these Sun technologies, such as the GNU Compiler for Java (bytecode compiler), GNU Classpath (standard libraries), and IcedTea-Web (browser plugin for applets). The latest version is Java 9, released on September 21, 2017, and is one of the two versions currently supported for free by Oracle. Versions earlier than Java 8 are supported by companies on a commercial basis; e.g. by Oracle back to Java 6 as of October 2017 (while they still \"highly recommend that you uninstall\" pre-Java 8 from at least Windows computers).", "pageId": 15881, "dailyPageViews": 5242, "created": 2001, "backlinksCount": 11543, "revisionCount": 7818, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Java_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "java", "jav" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nxkcoding spring-boot-demo https://github.com/xkcoding.png https://github.com/xkcoding/spring-boot-demo Java #b07219 5022 1536 3876 \"spring boot demo 是一个用来深度学习并实战 spring boot 的项目，目前总共包含 59 个集成demo，已经完成 49 个。 该项目已成功集成 actuator(监控)、admin(可视化监控)、logback(日志)、aopLog(通过AOP记录web请求日志)、统一异常处理(json级别和页面级别)、freemarker(模板引擎)、thymeleaf(模板引擎)、Beetl(模板引擎)、Enjoy(模板引擎)、JdbcTemplate(通用JDBC操作数据库)、JPA(强大的ORM框架)、mybatis(强大的ORM框架)、通用Mapper(快速操作Mybatis)、PageHelper(通用的Mybatis分页插件)、mybatis-plus(快速操作M…\"\nhope-for hope-boot https://github.com/hope-for.png https://github.com/hope-for/hope-boot Java #b07219 2706 523 1757 🌱🚀一款现代化的脚手架项目。企业开发？接外包？赚外快？还是学习？这都能满足你，居家必备，值得拥有🍻整合Springboot2，单点登陆+tk.mybatis+shiro+redis+thymeleaf+maven+swagger前后端分离接口管理+代码生成+定时任务+数据库版本管理flyway+hutool工具包，等实用技术。\nalibaba spring-cloud-alibaba https://github.com/alibaba.png https://github.com/alibaba/spring-cloud-alibaba Java #b07219 8811 2415 1176 \"Spring Cloud Alibaba provides a one-stop solution for application development for the distributed solutions of Alibaba middleware.\"\nelunez eladmin https://github.com/elunez.png https://github.com/elunez/eladmin Java #b07219 3080 1123 744 \"项目基于 Spring Boot 2.1.0 、 Jpa、 Spring Security、redis、Vue的前后端分离的后台管理系统，项目采用分模块开发方式， 权限控制采用 RBAC，支持数据字典与数据权限管理，支持一键生成前后端代码，支持动态路由\"\nzhoutaoo SpringCloud https://github.com/zhoutaoo.png https://github.com/zhoutaoo/SpringCloud Java #b07219 1237 666 345 基于SpringCloud2.0的微服务开发脚手架，整合了spring-security-oauth2、apollo、eureka、feign、hystrix、springcloud-gateway、springcloud-bus等。治理方面引入elasticsearch、skywalking、springboot-admin、zipkin等，让项目开发快速进入业务开发，而不需过多时间花费在架构搭建上。持续更新中\nb3log solo https://github.com/b3log.png https://github.com/b3log/solo Java #b07219 11000 3050 1605 \"🎸 一款小而美的博客系统，专为程序员设计。\"\n2227324689 gpmall https://github.com/2227324689.png https://github.com/2227324689/gpmall Java #b07219 1404 531 1387 【咕泡学院实战项目】-基于SpringBoot+Dubbo构建的电商平台-微服务架构、商城、电商、微服务、高并发、kafka、Elasticsearch\njustauth JustAuth https://github.com/justauth.png https://github.com/justauth/JustAuth Java #b07219 4025 635 2866 \"💯 史上最全的整合第三方登录的开源库。目前已支持Github、Gitee、微博、钉钉、百度、Coding、腾讯云开发者平台、OSChina、支付宝、QQ、微信、淘宝、Google、Facebook、抖音、领英、小米、微软、今日头条、Teambition、StackOverflow、Pinterest、人人、华为、企业微信、酷家乐和Gitlab等第三方平台的授权登录。 Login, so easy!\"\nseaswalker spring-analysis https://github.com/seaswalker.png https://github.com/seaswalker/spring-analysis Java #b07219 4014 1560 1136 Spring源码阅读\ndengyuhan magnetW https://github.com/dengyuhan.png https://github.com/dengyuhan/magnetW Java #b07219 2748 571 1857 \"磁力搜网页版 - 磁力链接聚合搜索 - https://bt.biedian.me\"\nfrank-lam fullstack-tutorial https://github.com/frank-lam.png https://github.com/frank-lam/fullstack-tutorial Java #b07219 5473 1193 991 \"🚀 fullstack tutorial 2019，后台技术栈/架构师之路/全栈开发社区，春招/秋招/校招/面试\"\nAngel-ML angel https://github.com/Angel-ML.png https://github.com/Angel-ML/angel Java #b07219 5174 1295 941 \"A Flexible and Powerful Parameter Server for large-scale machine learning\"\nalibaba COLA https://github.com/alibaba.png https://github.com/alibaba/COLA Java #b07219 1054 348 314 \"Clean Object-oriented & Layered Architecture\"\napache skywalking https://github.com/apache.png https://github.com/apache/skywalking Java #b07219 10224 2942 742 \"APM, Application Performance Monitoring System\"\nhollischuang toBeTopJavaer https://github.com/hollischuang.png https://github.com/hollischuang/toBeTopJavaer Java #b07219 8122 1818 1939 \"To Be Top Javaer - Java工程师成神之路\"\nActiviti Activiti https://github.com/Activiti.png https://github.com/Activiti/Activiti Java #b07219 5681 4712 180 \"Activiti is a light-weight workflow and Business Process Management (BPM) Platform targeted at business people, developers and system admins. Its core is a super-fast and rock-solid BPMN 2 process engine for Java. It's open-source and distributed under the Apache license. Activiti runs in any Java application, on a server, on a cluster or in the…\"\nMisterBooo LeetCodeAnimation https://github.com/MisterBooo.png https://github.com/MisterBooo/LeetCodeAnimation Java #b07219 39935 6812 3065 \"Demonstrate all the questions on LeetCode in the form of animation.（用动画的形式呈现解LeetCode题目的思路）\"\nflowable flowable-engine https://github.com/flowable.png https://github.com/flowable/flowable-engine Java #b07219 2141 867 126 \"A compact and highly efficient workflow and Business Process Management (BPM) platform for developers, system admins and business users.\"\nZXZxin ZXBlog https://github.com/ZXZxin.png https://github.com/ZXZxin/ZXBlog Java #b07219 3358 865 333 记录各种学习笔记(算法、Java、数据库、并发......)\nCymChad BaseRecyclerViewAdapterHelper https://github.com/CymChad.png https://github.com/CymChad/BaseRecyclerViewAdapterHelper Java #b07219 18176 3805 361 \"BRVAH:Powerful and flexible RecyclerAdapter\"\ncrossoverJie cim https://github.com/crossoverJie.png https://github.com/crossoverJie/cim Java #b07219 3769 1134 278 \"📲cim(cross IM) 适用于开发者的分布式即时通讯系统\"\ncabaletta baritone https://github.com/cabaletta.png https://github.com/cabaletta/baritone Java #b07219 961 273 308 \"google maps for block game\"\nmacrozheng mall-learning https://github.com/macrozheng.png https://github.com/macrozheng/mall-learning Java #b07219 2149 965 719 \"mall学习教程，架构、业务、技术要点全方位解析。mall项目（20k+star）是一套电商系统，使用现阶段主流技术实现。 涵盖了SpringBoot2.1.3、MyBatis3.4.6、Elasticsearch6.2.2、RabbitMQ3.7.15、Redis3.2、Mongodb3.2、Mysql5.7等技术，采用Docker容器化部署。\"\nkeycloak keycloak https://github.com/keycloak.png https://github.com/keycloak/keycloak Java #b07219 4386 2167 199 \"Open Source Identity and Access Management For Modern Applications and Services\"\nhankcs HanLP https://github.com/hankcs.png https://github.com/hankcs/HanLP Java #b07219 14671 4174 518 \"自然语言处理 中文分词 词性标注 命名实体识别 依存句法分析 新词发现 关键词短语提取 自动摘要 文本分类聚类 拼音简繁\"", "trendingProjectsCount": 26, "type": "programming", "aceMode": "java", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-java", "tmScope": "source.java", "repos": 11529980, "id": "Java" }, "githubBigQuery": { "repos": 369548, "users": 216933, "id": "Java" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/java", "monaco": "java", "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "java" ], "id": "Java" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 21, "commitCount": 283, "sampleCount": 9, "example": [ "/**\n * Copyright (c) Rich Hickey. All rights reserved.\n * The use and distribution terms for this software are covered by the\n * Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n * which can be found in the file epl-v10.html at the root of this distribution.\n * By using this software in any fashion, you are agreeing to be bound by\n * \t the terms of this license.\n * You must not remove this notice, or any other, from this software.\n **/\n\n/* rich Apr 19, 2008 */\n\npackage clojure.lang;\n\nimport java.lang.ref.Reference;\nimport java.math.BigInteger;\nimport java.util.Map;\nimport java.util.concurrent.ConcurrentHashMap;\nimport java.lang.ref.SoftReference;\nimport java.lang.ref.ReferenceQueue;\n\npublic class Util{\nstatic public boolean equiv(Object k1, Object k2){\n\tif(k1 == k2)\n\t\treturn true;\n\tif(k1 != null)\n\t\t{\n\t\tif(k1 instanceof Number && k2 instanceof Number)\n\t\t\treturn Numbers.equal((Number)k1, (Number)k2);\n\t\telse if(k1 instanceof IPersistentCollection || k2 instanceof IPersistentCollection)\n\t\t\treturn pcequiv(k1,k2);\n\t\treturn k1.equals(k2);\n\t\t}\n\treturn false;\n}\n\nstatic public boolean equiv(long k1, long k2){\n\treturn k1 == k2;\n}\n\nstatic public boolean equiv(Object k1, long k2){\n\treturn equiv(k1, (Object)k2);\n}\n\nstatic public boolean equiv(long k1, Object k2){\n\treturn equiv((Object)k1, k2);\n}\n\nstatic public boolean equiv(double k1, double k2){\n\treturn k1 == k2;\n}\n\nstatic public boolean equiv(Object k1, double k2){\n\treturn equiv(k1, (Object)k2);\n}\n\nstatic public boolean equiv(double k1, Object k2){\n\treturn equiv((Object)k1, k2);\n}\n\nstatic public boolean equiv(boolean k1, boolean k2){\n\treturn k1 == k2;\n}\n\nstatic public boolean equiv(Object k1, boolean k2){\n\treturn equiv(k1, (Object)k2);\n}\n\nstatic public boolean equiv(boolean k1, Object k2){\n\treturn equiv((Object)k1, k2);\n}\n\nstatic public boolean equiv(char c1, char c2) {\n return c1 == c2;\n}\n\nstatic public boolean pcequiv(Object k1, Object k2){\n\tif(k1 instanceof IPersistentCollection)\n\t\treturn ((IPersistentCollection)k1).equiv(k2);\n\treturn ((IPersistentCollection)k2).equiv(k1);\n}\n\nstatic public boolean equals(Object k1, Object k2){\n\tif(k1 == k2)\n\t\treturn true;\n\treturn k1 != null && k1.equals(k2);\n}\n\nstatic public boolean identical(Object k1, Object k2){\n\treturn k1 == k2;\n}\n\nstatic public Class classOf(Object x){\n\tif(x != null)\n\t\treturn x.getClass();\n\treturn null;\n}\n\nstatic public int compare(Object k1, Object k2){\n\tif(k1 == k2)\n\t\treturn 0;\n\tif(k1 != null)\n\t\t{\n\t\tif(k2 == null)\n\t\t\treturn 1;\n\t\tif(k1 instanceof Number)\n\t\t\treturn Numbers.compare((Number) k1, (Number) k2);\n\t\treturn ((Comparable) k1).compareTo(k2);\n\t\t}\n\treturn -1;\n}\n\nstatic public int hash(Object o){\n\tif(o == null)\n\t\treturn 0;\n\treturn o.hashCode();\n}\n\nstatic public int hasheq(Object o){\n\tif(o == null)\n\t\treturn 0;\n\tif(o instanceof Number)\n\t\treturn Numbers.hasheq((Number)o);\n\telse if(o instanceof IHashEq)\n\t\treturn ((IHashEq)o).hasheq();\n\treturn o.hashCode();\n}\n\nstatic public int hashCombine(int seed, int hash){\n\t//a la boost\n\tseed ^= hash + 0x9e3779b9 + (seed << 6) + (seed >> 2);\n\treturn seed;\n}\n\nstatic public boolean isPrimitive(Class c){\n\treturn c != null && c.isPrimitive() && !(c == Void.TYPE);\n}\n\nstatic public boolean isInteger(Object x){\n\treturn x instanceof Integer\n\t\t\t|| x instanceof Long\n\t || x instanceof BigInt\n\t\t\t|| x instanceof BigInteger;\n}\n\nstatic public Object ret1(Object ret, Object nil){\n\t\treturn ret;\n}\n\nstatic public ISeq ret1(ISeq ret, Object nil){\n\t\treturn ret;\n}\n\nstatic public void clearCache(ReferenceQueue rq, ConcurrentHashMap> cache){\n\t\t//cleanup any dead entries\n\tif(rq.poll() != null)\n\t\t{\n\t\twhile(rq.poll() != null)\n\t\t\t;\n\t\tfor(Map.Entry> e : cache.entrySet())\n\t\t\t{\n Reference val = e.getValue();\n\t\t\tif(val != null && val.get() == null)\n\t\t\t\tcache.remove(e.getKey(), val);\n\t\t\t}\n\t\t}\n}\n\nstatic public RuntimeException runtimeException(String s){\n\treturn new RuntimeException(s);\n}\n\nstatic public RuntimeException runtimeException(String s, Throwable e){\n\treturn new RuntimeException(s, e);\n}\n\n/**\n * Throw even checked exceptions without being required\n * to declare them or catch them. Suggested idiom:\n *

\n * throw sneakyThrow( some exception );\n */\nstatic public RuntimeException sneakyThrow(Throwable t) {\n // http://www.mail-archive.com/javaposse@googlegroups.com/msg05984.html\n\tif (t == null)\n\t\tthrow new NullPointerException();\n\tUtil.sneakyThrow0(t);\n\treturn null;\n}\n\n@SuppressWarnings(\"unchecked\")\nstatic private void sneakyThrow0(Throwable t) throws T {\n\tthrow (T) t;\n}\n\n}\n\n" ], "url": "https://github.com/textmate/java.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/georgewfraser/vscode-javac\nwrittenIn java" ], "projectEuler": { "memberCount": { "2019": 27921, "2022": 29675 }, "id": "Java" }, "helloWorldCollection": [ "// Hello World in Java\n\nclass HelloWorld {\n static public void main( String args[] ) {\n System.out.println( \"Hello World!\" );\n }\n}\n" ], "leachim6": { "filepath": "j/Java.java", "fileExtensions": [ "java" ], "example": [ "public class Java {\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\"Hello World\");\n\t}\n}\n" ], "id": "Java" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Java", "quineRelay": "Java", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nclass Square {\n static int square(int num) {\n return num * num;\n }\n}" ], "id": "Java" }, "rijuRepl": { "example": [ "public class Main {\n public static void main(String[] args) {\n System.out.println(\"Hello, world!\");\n }\n}\n" ], "id": "https://riju.codes/java" }, "replit": "https://repl.it/languages/java", "indeedJobs": { "2017": 32645, "query": "java engineer" }, "linkedInSkill": { "2018": 5256079, "id": "java" }, "stackOverflowSurvey": { "2021": { "users": 29162, "medianSalary": 51888, "fans": 17222, "percentageUsing": 0.35 } }, "officialBlogUrl": [ "https://blogs.oracle.com/java/" ], "eventsPageUrl": [ "https://dev.java/community/events/" ], "downloadPageUrl": [ "https://www.oracle.com/java/technologies/downloads/" ], "subreddit": [ { "memberCount": { "2017": 77297, "2022": 266613 }, "url": "https://reddit.com/r/java" } ], "meetup": { "memberCount": 1162766, "groupCount": 2090, "url": "https://www.meetup.com/topics/java" }, "tiobe": { "currentRank": 3, "id": "Java" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2131", "pypl": "Java", "packageRepository": [ "https://search.maven.org/", "https://mvnrepository.com/popular" ], "twitter": "https://twitter.com/java", "ubuntuPackage": "openjdk-8-jdk", "jupyterKernel": [ "https://github.com/SpencerPark/IJava" ], "fileType": "text", "wordRank": 1489, "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nEffective Java Programming Language Guide|2001|Joshua Bloch|101316|4.48|5484|299", "isbndb": "year|publisher|title|authors|isbn13\n2017|Pearson|Java Software Solutions|Lewis, John and Loftus, William|9780134462028\n2011|Pearson|Data Structures and Other Objects Using Java|Main, Michael|9780132576246\n2013|Pearson|Building Java Programs (3rd Edition)|Reges, Stuart and Stepp, Marty|9780133360905\n2009|McGraw-Hill Education|Java Programming: From The Ground Up|Ralph Bravaco and Shai Simonson|9780073523354\n2011|Pearson|Java Software Solutions: Foundations of Program Design|Lewis, John and Loftus, William|9780132149181\n2014|O'Reilly Media|Java in a Nutshell: A Desktop Quick Reference|Evans, Benjamin J and Flanagan, David|9781449370824\n2003|Pearson|C++ for Java Programmers|Weiss, Mark|9780139194245\n2013|Cengage Learning|Java Programming|Farrell, Joyce|9781285081953\n2014|Manning Publications|Java 8 in Action: Lambdas, Streams, and functional-style programming|Urma, Raoul-Gabriel and Fusco, Mario and Mycroft, Alan|9781617291999\n2006|Pearson|Thinking in Java|Eckel, Bruce|9780131872486\n2017|Mike Murach & Associates|Murach's Java Programming (5th Edition)|Joel Murach|9781943872077\n2012|Pearson|Absolute Java (5th Edition)|Savitch, Walter and Mock, Kenrick|9780132830317\n2005|Pearson|Data Structures and Algorithms in Java|Drake, Peter|9780131469143\n2009|Wiley|Big Java: Compatible with Java 5, 6 and 7|Horstmann, Cay S.|9780470509487\n2017|Pearson|Java How to Program, Early Objects (Deitel: How to Program)|Deitel, Paul and Deitel, Harvey|9780134743356\n2014|Pearson|Introduction to Java Programming, Comprehensive Version plus MyLab Programming with Pearson eText -- Access Card Package (10th Edition)|Liang, Y. Daniel|9780133813463\n2000|Pearson|C for Java Programmers|Muldner, Tomasz|9780201702798\n2002|Sams|Sams Teach Yourself Java 2 in 24 Hours (3rd Edition) (Sams Teach Yourself...in 24 Hours (Paperback))|Cadenhead, Rogers|9780672324604\n2012|Wiley|Java Concepts: Early Objects|Horstmann, Cay S.|9781118431122\n2013|O'Reilly Media|RESTful Java with JAX-RS 2.0: Designing and Developing Distributed Web Services|Burke, Bill|9781449361341\n2005|Wiley|Java Concepts|Horstmann, Cay S.|9780471697046\n2014|Sybex|OCA: Oracle Certified Associate Java SE 8 Programmer I Study Guide: Exam 1Z0-808|Boyarsky, Jeanne and Scott Selikoff|9781118957400\n2014|Pearson|Intro to Java Programming, Comprehensive Version, Student Value Edition (10th Edition)|Liang, Y. Daniel|9780133593495\n2008|McGraw-Hill Science/Engineerin|Introduction to Programming with Java A Problem Solving Approach|John S. Dean and Raymond H. Dean|9780073047027\n2007|Wiley|Java Concepts for AP Computer Science|Horstmann, Cay S.|9780470181607\n2007|Cengage Learning|Java Programming Lab Manual: From Problem Analysis To Program Design, 3rd Edition|Mayfield, Blayne|9781423901884\n2004|O'Reilly Media|Java Threads: Understanding and Mastering Concurrent Programming|Scott Oaks and Henry Wong|9780596007829\n2005|Cengage Learning|Java Programming: Program Design Including Data Structures|Malik, D. S.|9781418835408\n2009|Prentice Hall|Java How to Program: Late Objects Version|Deitel, Paul|9780136123712\n2012|Prentice Hall|Introduction to Java Programming, Comprehensive Version Plus Myprogramminglab with Pearson Etext -- Access Card Package|Liang, Y Daniel|9780133050578\n08/24/2012|O'Reilly Media, Inc.|Java in a Nutshell|Flanagan, David|9780596007737\n2014|Pearson|Introduction to Java Programming, Brief Version Plus MyLab Programming with Pearson eText -- Access Card Package (10th Edition)|Liang, Y. Daniel|9780133813487\n2014|O'Reilly Media|Java 8 Lambdas: Functional Programming For The Masses|Warburton, Richard|9781449370770\n2013|O'Reilly Media|Java Network Programming|Harold, Elliotte Rusty|9781449357672\n2012|McGraw Hill|Java Programming: A Comprehensive Introduction|Schildt, Herbert and Skrien, Dale|9780078022074\n2004|Pearson|Addison-Wesley's Java Backpack Reference Guide|DePasquale, Peter|9780321304278\n2002|Manning|Bitter Java|Tate, Bruce A.|9781930110434\n2008|Pearson|Programming with Alice and Java|Lewis, John and DePasquale, Peter|9780321512093\n2006|Lulu.com|Java by Dissection|McDowell, Charlie|9781411652385\n2011|McGraw-Hill Education|Java The Complete Reference, 8th Edition|Schildt, Herbert|9780071606301\n2001|O'Reilly Media|Java Security (2nd Edition)|Oaks, Scott|9780596001575\n1996|Addison-Wesley Pub (Sd)|The Java Programming Language|Arnold, Ken and Gosling, James|9780201634556\n1998|O'Reilly Media|Java Swing (Java (O'Reilly))|Eckstein, Robert and Loy, Marc and Wood, Dave|9781565924550\n2002|Jones & Bartlett Learning|Fundamentals Of Computer Science Using Java|Hughes, David|9780763717612\n2017|Packt Publishing|Programming Kotlin: Get to grips quickly with the best Java alternative|Samuel, Stephen and Bocutiu, Stefan|9781787126367\n2017|Mercury Learning & Information|Computer Graphics Programming in OpenGL with Java|Gordon, V. Scott and Clevenger, John L.|9781683920274\n2016|Pearson|Building Java Programs: A Back to Basics Approach Plus MyLab Programming with Pearson eText -- Access Card Package|Reges, Stuart and Stepp, Marty|9780134448305\n2002|McGraw-Hill Osborne Media|Java 2: The Complete Reference, Fifth Edition|Schildt, Herbert|9780072224207\n2005|For Dummies|Beginning Programming with Java For Dummies|Burd, Barry A.|9780764588747\n2016|Packt Publishing|Neural Network Programming with Java: Create and unleash the power of neural networks by implementing professional Java code|Souza, Alan M.F. and Soares, Fabio M.|9781785880902\n2003|Prentice Hall|Object-Oriented Software Engineering: Using UML, Patterns and Java (2nd Edition)|Bruegge, Bernd and Dutoit, Allen H.|9780130471109\n1997|Addison-Wesley|The Java Programming Language (Java Series)|Arnold, Ken and Gosling, James|9780201310061\n2006|Wiley|Operating System Concepts with Java|Silberschatz, Abraham and Galvin, Peter B. and Gagne, Greg|9780471769071\n2012|O'Reilly Media|Programming Android: Java Programming for the New Generation of Mobile Devices|Mednieks, Zigurd and Dornin, Laird and Meike, G. Blake and Nakamura, Masumi|9781449316648\n2010|O'Reilly Media|Java: The Good Parts: Unearthing the Excellence in Java|Waldo, Jim|9780596803735\n1997|Butterworth-Heinemann|Software Development for Engineers, C/C++, Pascal, Assembly, Visual Basic, HTML, Java Script, Java DOS, Windows NT, UNIX|Buchanan, William|9780340700143\n2012|McGraw Hill|Java Programming (Oracle Press)|Sarang, Poornachandra|9780071633604\n2017|Pearson|Introduction to Java Programming and Data Structures, Comprehensive Version, Student Value Edition Plus MyLab Programming with Pearson eText - Access Card Package|Liang, Y. Daniel|9780134756431\n1999|O'Reilly Media|Java I/O (Java Series)|Harold, Elliotte Rusty|9781565924857\n2005|Addison-Wesley Professional|Java Puzzlers: Traps, Pitfalls, and Corner Cases|Bloch, Joshua and Gafter, Neal|9780321336781\n2004|Springer|Multimedia Introduction to Programming Using Java|Gries, David and Gries, Paul|9780387226811\n2002|Apress|Bug Patterns In Java|Allen, Eric|9781590590614\n2020|Sybex|OCP Oracle Certified Professional Java SE 11 Developer Complete Study Guide: Exam 1Z0-815, Exam 1Z0-816, and Exam 1Z0-817|Boyarsky, Jeanne and Selikoff, Scott|9781119619130\n1997|McGraw-Hill Osborne Media|Java Programmer's Reference|Schildt, Herbert and O'Neil, Joe|9780078823688\n2002|Sams|Java for the Web With Servlets, Jsp, and Ejb: A Developer's Guide to Scalable Solutions|Kurniawan, Budi|9780735711952\n2007|John Wiley and Sons|Java Concepts, Compatible with Java 5 and 6, 5th Edition|Horstmann, Cay S.|9780470105559\n2014|Pearson|MyLab Programming with Pearson eText -- Access Card -- for Intro to Java Programming, Comprehensive Version, 10/e|Liang, Y. and Liang, Y. Daniel|9780133762518\n2003|Course Technology|Data Structures Using Java|Malik, D. S.|9780619159504\n2010|Pearson Education|Introduction to Java Programming, Comprehensive: International Edition|Liang|9780132472753\n2006|Wiley|Concurrency: State Models and Java Programs|Magee, Jeff and Kramer, Jeff|9780470093559\n2000|O'Reilly Media|Learning Java (Java Series)|Knudsen, Jonathan and Niemeyer, Patrick|9781565927186\n2014|Pragmatic Bookshelf|Functional Programming in Java: Harnessing the Power Of Java 8 Lambda Expressions|Subramaniam, Venkat|9781937785468\n2005|Cengage Learning|Java Programming: Introductory Concepts and Techniques (Available Titles Skills Assessment Manager (SAM) - Office 2010)|Shelly, Gary B. and Cashman, Thomas J. and Starks, Joy L.|9781418859831\n2014|Addison-Wesley Professional|Java Language Specification, Java SE 8 Edition, The (Java Series)|Gosling, James and Joy, Bill and Steele Jr., Guy and Bracha, Gilad and Buckley, Alex|9780133900699\n2007|Chapman and Hall/CRC|A Practical Guide to Data Structures and Algorithms using Java (Chapman & Hall/CRC Applied Algorithms and Data Structures series)|Goldman, Sally. A and Goldman, Kenneth. J|9781584884552\n2015|DT EDITORIAL SERVICES|Java 8 Programming: Black Book|WILEY INDIA and WILEY INDIA and WILEY INDIA|9789351197584\n2011|Wrox|Java Programming 24-Hour Trainer|Fain, Yakov|9780470889640\n2004|Prentice Hall|Just Java 2 (6th Edition)|van der Linden, Peter|9780131482111\n2020|O'Reilly Media|Learning Java: An Introduction to Real-World Programming with Java|Loy, Marc and Niemeyer, Patrick and Leuck, Daniel|9781492056270\n1999|Sams|Java Thread Programming|Hyde, Paul|9780672315855\n2014|Apress|Beginning Java 8 APIs, Extensions and Libraries: Swing, JavaFX, JavaScript, JDBC and Network Programming APIs (Expert's Voice in Java)|Sharan, Kishori|9781430266617\n2003|Cambridge University Press|Java Frameworks and Components: Accelerate Your Web Application Development|Nash, Michael|9780521520591\n2001|Addison-Wesley Professional|Building Parsers with Java|Metsker, Steven John Metsker|9780201719628\n1996|Addison-Wesley|The Java Class Libraries: An Annotated Reference (Java Series) (v. 1)|Chan, Patrick and Lee, Rosanna|9780201634587\n2000|McGraw-Hill|Java 2 Programmer's Reference|ONeil, Joseph|9780072123548\n2007|Springer|Java for Bioinformatics and Biomedical Applications|Bal, Harshawardhan and Hujol, Johnny|9780387372372\n20130312|Springer Nature|Java kompakt|Matthias Hölzl; Allaithy Raed; Martin Wirsing|9783642285042\n2017|No Starch Press|Learn Java the Easy Way: A Hands-On Introduction to Programming|Payne, Bryson|9781593278052\n2018|Cengage Learning|Bundle: Java Programming, Loose-Leaf Version, 9th + MindTap Programming, 1 term (6 months) Printed Access Card|Farrell, Joyce|9781337756280\n20080514|O'Reilly Media, Inc.|Java Web Services: Up and Running|Kalin, Martin|9780596521127\n2012|O'Reilly Media|Clojure Programming: Practical Lisp for the Java World|Emerick, Chas and Carper, Brian and Grand, Christophe|9781449394707\n2011|Wiley-IEEE Press|Practical Database Programming with Java|Bai, Ying|9780470889404\n2015|Wrox|Java Programming: 24-Hour Trainer|Fain, Yakov|9781118951453\n2009|McGraw-Hill Higher Education|An Introduction to Object-Oriented Programming with Java|Wu, C. Thomas|9780071283687\n2007|McGraw-Hill Science/Engineering/Math|A Comprehensive Introduction to Object-Oriented Programming with Java|Wu, C|9780073317083\n2014|Pearson|MyLab Programming with Pearson eText -- Access Code Card -- for Java Software Solutions: Foundations of Program Design|Lewis, John and Lewis, John and Loftus, William|9780133781281\n2004|O'Reilly Media|Java Network Programming, Third Edition|Harold, Elliotte Rusty|9780596007218\n2000|Addison-Wesley|The Real-Time Specification for Java|Gosling, James and Bollella, Greg and Dibble, Peter and Furr, Steve and Turnbull, Mark|9780201703238\n1996|Waite Group Pr|Black Art of Java Game Programming|Fan, Joel and Tenitchi, Calin and Ries, Eric|9781571690432\n2000|Addison-Wesley|Advanced Programming for the Java 2 Platform|Austin, Calvin and Pawlan, Monica|9780201715019\n2000|Cambridge University Press|Fundamentals of OOP and Data Structures in Java|Wiener, Richard and Pinson, Lewis J.|9780521662208\n2017|For Dummies|Java For Dummies (For Dummies (Computers))|Burd, Barry|9781119235552\n2008|Pragmatic Bookshelf|Programming Groovy: Dynamic Productivity for the Java Developer (Pragmatic Programmers)|Subramaniam, Venkat|9781934356098\n2008|CRC Press|Java Programming Fundamentals: Problem Solving Through Object Oriented Analysis and Design|Nair, Premchand S.|9781420065473\n2004|McGraw-Hill Education|Java Demystified|Keogh, Jim|9780072254549\n2008|Prentice Hall|Introduction to Java Programming|Liang, Y. Daniel|9780136042587\n1997|Cambridge University Press|Modern Compiler Implementation in Java|Appel, Andrew W.|9780521583886\n2004|Prentice Hall|Small Java How To Program|Deitel, Harvey M. and Deitel, Paul J.|9780131486607\n2017|Manning Publications|Functional Programming in Java: How functional techniques improve your Java programs|Saumont, Pierre-Yves|9781617292736\n1999|Wiley|Mastering Enterprise JavaBeans and the Java 2 Platform, Enterprise Edition|Roman, Ed|9780471332299\n2003|Jones & Bartlett Publishers|Programming and Problem Solving with Java|Dale, Nell B. and Chip Weems and Mark R. Headington|9780763704902\n1996|Ventana Pr|Java Programming For The Internet: A Guide To Creating Dynamic, Interactive Internet Applications|Pratik R. Patel and Alan D. Hudson and Donald A. Ball|9781566043557\n2002|McGraw-Hill/OsborneMedia|Java Servlets Developer's Guide|Karl Moss and Michael Mueller and Lyssa Wald|9780072222623\n2019|Pearson|Mylab Programming with Pearson Etext -- Access Card -- For Introduction to Java Programming and Data Structures, Comprehensive Version|Liang, Y. Daniel|9780134672816\n2004|Morgan Kaufmann|Java Cryptography Extensions: Practical Guide for Programmers (The Practical Guides)|Weiss, Jason R.|9780127427515\n2001|O'Reilly Media|Java Programming with Oracle JDBC|Bales, Donald|9780596000882\n2004|Prentice Hall|Java Application Development on Linux|Albing, Carl|9780131436978\n2006|Jones & Bartlett Learning|Java Web Development Illuminated (Jones and Bartlett Illuminated (Paperback))|Qian, Kai|9780763734237\n2000|Que Pub|Platinum Edition Using Xhtml, Xml and Java 2|O'Donnell, Jim|9780789724731\n1996|Addison-Wesley|Hooked on Java: Creating Hot Web Sites With Java Applets|Van Hoff, Arthur and Shaio, Sami and Starbuck, Orca and Sun Microsystems, Inc.|9780201488371\n2012||Java Programming: A Comprehensive 1st Skrien|Herbert Schildt, Dale John Skrien|9780071310376\n1996|Addison-wesley Pub. Co.|Hooked On Java: Creating Hot Web Sites With Java Applets|Van Hoff, Arthur.|9780201852745\n2010|Apress|The Definitive Guide to Jython: Python for the Java Platform (Expert's Voice in Software Development)|Juneau, Josh and Baker, Jim and Wierzbicki, Frank and Soto Muoz, Leo and Ng, Victor and Ng, Alex and Baker, Donna L.|9781430225270\n1999|Wiley|Concurrency: State Models & Java Programs|Magee, Jeff and Kramer, Jeff|9780471987109\n2021|Oxford University Press|Programming in Java|Sachin Malhotra,Saurabh Chaudhary|9780198094852\n2002|O'Reilly Media|Learning Wireless Java|Qusay Mahmoud|9780596002435\n2007|Addison Wesley|Java Foundations: Introduction to Program Design and Data Structures|Lewis, John and DePasquale, Peter and Chase, Joseph|9780321429728\n2006|Springer|An Introduction to Network Programming with Java|Graba, Jan|9781846283802\n1997|O'Reilly Media|Java Virtual Machine (Java Series)|Downing, Troy and Meyer, Jon|9781565921948\n2002|Course Technology|Object-Oriented Application Development Using Java|Doke, E. Reed and Satzinger, John W. and Rebstock Williams, Susan|9780619035655\n2005|Lawrenceville Pr|A Guide To Programming in Java: Java 2 Platform Standard Edition 5|Brown, Beth|9781580030717\n2004|Wrox|Professional Java Tools for Extreme Programming: Ant, XDoclet, JUnit, Cactus, and Maven|Hightower, Richard and Onstine, Warner and Visan, Paul and Payne, Damon and Gradecki, Joseph D.|9780764556173\n2019|Pearson|Building Java Programs, Student Value Edition|Reges, Stuart and Stepp, Marty|9780135472118\n1999|Sams|Java 2 for Professional Developers|Morgan, Michael|9780672316975\n1999|Manning Publications|Java Network Programming, 2nd Edition|Hughes, Merlin and Hamner, Derek and Hughes, Merlin|9781884777493\n2007|Course Technology|Modern Software Development Using Java|Tymann, Paul T. and Schneider, G.Michael|9781423901235\n2002|O'Reilly Media|Java Management Extensions: Managing Java Applications with JMX|J. Steven Perry|9780596002459\n2014|Pearson|MyLab Programming with Pearson eText -- Access Card -- for Intro to Java Programming, Brief Version|Liang, Y. Daniel|9780133592689\n2004|Prentice Hall|Java Transaction Processing (Hewlett-Packard Professional Books): Design and Implementation|Mark Little and Jon Maron and Greg Pavlik and Jonathan Maron|9780130352903\n2003|IBM Press|Enterprise Java Programming with IBM WebSphere (2nd Edition)|Brown, Kyle and Craig, Gary and Hester, Greg and Pitt, David and Stinehour, Russell and Weitzel, Mark and Amsden, Jim and Jakab, Peter M. and Berg, Daniel|9780321185792\n2004|O'Reilly Media|Hardcore Java|Robert Simmons|9780596005689\n1999|Addison Wesley|Introduction to Programming Using Java: An Object-Oriented Approach: Java 2 Update|Arnow, David and Weiss, Gerald|9780201612721\n2009|Cengage Learning|Java Programming|Farrell, Joyce|9780324599510\n1997|O'Reilly Media|Java in a Nutshell: A Desktop Quick Reference for Java Programmers (In a Nutshell (O'Reilly))|Flanagan, David|9781565922624\n2007|Cengage Learning PTR|Beginning Java Game Programming Second Edition|Harbour, Jonathan S.|9781598634761\n2001|Prentice Hall Ptr|Java 3D API Jump-Start|Aaron E. Walsh and Doug Gehringer|9780130340764\n1999|Prentice Hall|Java 2 Programmer's Interactive Workbook|Chu, Kevin and Brower, Eric|9780130166388\n2005|Wiley-Interscience|Modern Multithreading : Implementing, Testing, and Debugging Multithreaded Java and C++/Pthreads/Win32 Programs|Carver, Richard H. and Tai, Kuo-Chung|9780471725046\n2015|Apress|Pro Java 8 Programming|Brett Spell, Terrill|9781484206423\n2006|Pragmatic Bookshelf|From Java to Ruby: Things Every Manager Should Know (Pragmatic Programmers)|Tate, Bruce A.|9780976694090\n2011|Addison-Wesley Professional|Starting Out with Java: From Control Structures Through Data Structures with Java Integrated Development Environment Resource Kit|Gaddis, Tony and Muganda, Godfrey|9780132757638\n1999|Springer|Essential Java 2 fast: How to develop applications and applets with Java 2 (Essential Series)|Cowell, John|9781852330712\n2008|Apress|Practical API Design: Confessions of a Java Framework Architect|Tulach, Jaroslav|9781430209737\n2003|For Dummies|Beginning Programming with Java For Dummies (For Dummies (Computers))|Burd, Barry A.|9780764526466\n2000|Coriolis Group|Java Black Book: The Java Book Programmers Turn To First|Holzner, Steven|9781576105313\n20200417|Pearson Education (US)|Introduction to Java Programming and Data Structures, Comprehensive Version|Y. Daniel Liang|9780136801504\n2017|Pearson|Java Software Solutions, Student Value Edition Plus MyLab Programming with Pearson eText - Access Card Package|Lewis, John and Loftus, William|9780134756387\n1998|Wiley|Client/Server Programming with Java and CORBA, 2nd Edition|Orfali, Robert and Harkey, Dan|9780471245780\n2012|Packt Publishing|Oracle Certified Associate, Java SE 7 Programmer Study Guide|M. Reese Richard|9781849687324\n2005|John Wiley & Sons|Concurrent And Real-time Programming In Java|Andrew Wellings|9780470011270\n2011|Oxford University Press|Programming in JAVA|Malhotra, Sachin and Choudhary, Saurabh|9780198063582\n1996|IDG Books|Java for Dummies|Aaron E. Walsh|9781568846415\n1998|Addison-Wesley|The Java Tutorial: Object-Oriented Programming for the Internet (2nd Edition)|Campione, Mary and Walrath, Kathy|9780201310078\n1999|Sams|Sams Teach Yourself Java 2 in 21 Days (Teach Yourself in 21 Days Series)|Lemay, Laura and Cadenhead, Rogers|9780672316388\n2005|Course Technology|Java Programming|Farrell, Joyce|9780619213190\n2012|McGraw-Hill Education TAB|Kinect Open Source Programming Secrets: Hacking the Kinect with OpenNI, NITE, and Java|Davison, Andrew|9780071783170\n2003|Wiley|MySQL and Java Developer's Guide|Mark Matthews and Jim Cole and Joseph D. Gradecki|9780471269236\n2013|Pearson|MyProgrammingLab with Pearson eText -- Access Card -- for Building Java Programs (MyProgrammingLab (Access Codes))|Reges, Stuart and Stepp, Marty|9780133379785\n1999|Prentice Hall|Java for Students 1.2|Bell, Doug and Parr, Mike|9780130109224\n1996|John Wiley & Sons Inc|Foundations of Java Programming for the World Wide Web|Walsh, Aaron E.|9781568848112\n2017|O'Reilly Media|Java Pocket Guide: Instant Help for Java Programmers|Liguori, Robert and Liguori, Patricia|9781491938690\n2001|Prentice Hall PTR|Core Java 2, Volume II: Advanced Features (5th Edition)|Horstmann, Cay and Cornell, Gary|9780130927385\n||Java|In Easy Steps|9780071077101\n2002|Prentice Hall|Java, Java, Java Object-Oriented Problem Solving (2nd Edition)|Morelli, Ralph|9780130333704\n2006|Sams Publishing|Agile Java Development with Spring, Hibernate and Eclipse|Hemrajani, Anil|9780672328961\n2002|Syngress|Programming Lego Mindstorms with Java (With CD-ROM)|Dario Laverde and Giulio Ferrari and Jurgen Stuber|9781928994558\n2007|AddisonWesley Professional|Eclipse Web Tools Platform: Developing Java Web Applications|Dai, Naci|9780321396853\n2001|O'Reilly Media|Java Programming with Oracle SQLJ|Price, Jason|9780596000875\n2016|Createspace Independent Publishing Platform|Java: The Ultimate Guide To Learn Java Programming And Computer Hacking (java For Beginners, Java For Dummies, Java Apps, Hacking) (html, Javascript, ... Developers, Coding, Css, Php) (volume 2)|Peter Hoffman and Matt Benton|9781523407811\n2003|John Wiley &Sons|Mastering AspectJ: Aspect-Oriented Programming in Java|Gradecki, Joseph D.|9780471431046\n2005|Addison Wesley|Starting Out with Java 5: Control Structures to Objects|Gaddis, Tony|9781576761717\n2008|I. K. International Pvt Ltd|Data Structures Through Java|Muniswamy|9788189866822\n2001|Prentice Hall|Weaving a Website: Programming in HTML, Java Script, Perl and Java|Anderson-Freed, Susan|9780130282200\n2006|Prentice Hall|Introduction to Java Programming (GOAL Series)|Liang, Y Daniel|9780132237383\n2002|Wiley|Java the UML Way: Integrating Object-Oriented Design and Programming|Lervik, Else and Havdal, Vegard B.|9780470843864\n2012|Apress|Pro JavaFX 2: A Definitive Guide to Rich Clients with Java Technology|Weaver, James and Gao, Weiqi and Chin, Stephen and Iverson, Dean and Vos, Johan|9781430268727\n2000|O'Reilly Media|Java Network Programming (Java (O'Reilly))|Harold, Elliotte Rusty|9781565928701\n2003|Sybex|Java Programming 10-Minute Solutions|Watson, Mark and Sybex|9780782142853\n1996|Mis Pr|Java Programming Basics|Au, Edith and Makower, Dave|9781558284692\n2002|Wrox|Beginning Java 2|Horton, Ivor|9780764543654\n2015|Kidware Software|Java For Kids: NetBeans 8 Programming Tutorial|Conrod, Philip and Tylee, Lou|9781937161880\n2018|Mercury Learning & Information|Computer Graphics Programming in OpenGL with JAVA|Gordon, V. Scott and Clevenger, John L.|9781683922193\n1999|Prentice Hall Ptr|Core Java 2 , Volume 2: Advanced Features (4th Edition)|Horstmann, Cay S. and Cornell, Gary|9780130819345\n2012|Pearson|MyProgrammingLab with Pearson eText -- Access Card -- for Absolute Java (5th Edition)|Pearson Education and Mock, Kenrick|9780132846387\n2007|Pragmatic Bookshelf|Rails for Java Developers|Halloway, Stuart and Gehtland, Justin|9780977616695\n1997|Computing McGraw-Hill|Advanced Java 1.1 Programming|Rice, Jeffrey C. and Salisbury, Irving|9780079130891\n2020|O'Reilly Media|Programming AWS Lambda: Build and Deploy Serverless Applications with Java|Chapin, John and Roberts, Mike|9781492041054\n2019|Springer|Fundamentals of Java Programming|Ogihara, Mitsunori|9783030077853\n2020|O'Reilly Media|Quarkus Cookbook: Kubernetes-Optimized Java Solutions|Bueno, Alex Soto and Porter, Jason|9781492062653\n1996|Sybex Inc|Mastering Java|Phillips, Ivan and Hsu, Goang-Tay and Sankar, Krishna and Ries, Eric and Rohaly, Tim and Zukowski, John and Vanhelsuwe, Laurence|9780782119350\n2002|Wiley|Java Database Programming Bible|O'Donahue, John|9780764549243\n2009|Springer|A Concise and Practical Introduction to Programming Algorithms in Java (Undergraduate Topics in Computer Science)|Nielsen, Frank|9781848823389\n2006|Lawrenceville Pr|A Guide to Programming in Java: Java 2 Platform Standard Edition 5|Brown, Beth|9781580030724\n2002|Pearson P T R|Java Web Services: For Experienced Programmers (Deitel Developers Series)|Deitel, Harvey M. and Deitel, Paul J. and Gadzik, J. P. and Lomeli, K. and Santry, S. E. and Zhang, S.|9780130461346\n2013|Kidware Software|Java For Kids - A Computer Programming Tutorial|Conrod, Philip and Tylee, Lou|9781937161606\n2003|Charles River Media|ANT: The Java Build Tool In Practice (Programming Series)|Matzke, Bernd|9781584502487\n2001|Pearson|On to Java (3rd Edition)|Winston, Patrick Henry and Narasimhan, Sundar|9780201725933\n2003|Apress|Java Regular Expressions: Taming the java.util.regex Engine|Mehran Habibi|9781590591079\n2000|Apress|Professional Java Programming|Spell, Brett|9781861003829\n1996|Osborne Mcgraw-Hill|The Java Handbook|Naughton, Patrick|9780078821998\n2003|Wiley, John & Sons, Incorporated|Java Testing Patterns|Andrew Glover and Kyle Brown and Jon Thomas and Matthew Young|9780471448464\n2020|Payload Media|Android Studio 4.0 Development Essentials - Java Edition: Developing Android Apps Using Android Studio 4.0, Java and Android Jetpack|Smyth, Neil|9781951442224\n2001|Wiley|Java In Telecommunications: Solutions For Next Generation Networks|Thomas C. Jepsen and Farooq Anjum and Ravi Raj Bhat and Douglas Tait|9780471498261\n2007|Apress|Pro Java 6 3D Game Development: Java 3D, JOGL, JInput and JOAL APIs (Expert's Voice in Java)|Davison, Andrew|9781590598177\n1998|Addison-Wesley|Understanding Object-Oriented Programming With Java|Budd, Timothy|9780201308815\n1999|Wiley|Computing Concepts with Java 2 Essentials|Horstmann, Cay S.|9780471346098\n2002|Manning Publications|Java 2 Micro Edition|White, James and Hemphill, David A and Hemphill, David|9781930110335\n2005|Charles River Media|Java Messaging (Programming Series)|Bruno, Eric|9781584504184\n2000|Apress|Beginning Java 2 - Jdk 1.3 Edition (Programmer to Programmer)|Horton, Ivor|9781861003669\n2000|Sybex Inc|The Complete Java 2 Certification Study Guide: Programmer's and Developers Exams (With CD-ROM)|Roberts, Simon and Heller, Philip and Ernest, Michael and Heller, Philip|9780782128253\n2003|Prentice Hall|Information Systems Programming with Java (2nd Edition)|Staugaard, Andrew|9780131018600\n2017|Packt Publishing|Mastering Concurrency Programming with Java 9 - Second Edition: Fast, reactive and parallel application development|Gonzalez, Javier Fernandez|9781785887949\n1999|McGraw-Hill Education|Java 2: The Complete Reference|Naughton, Patrick and Schildt, Herbert|9780072132878\n2001|Research & Education Association|Java Super Review w/ CD-ROM (Super Reviews Study Guides)|Rea and Staff of Research & Education Association and Randall Raus and Dr. Hang Lau|9780878913800\n1997|O'Reilly Media|Java in a Nutshell, Deluxe Edition (In a Nutshell (O'Reilly))|Flanagan, David|9781565923041\n2017|Pearson|MyLab Programming with Pearson eText -- Access Code Card -- for Java How to Program, Early Objects|Deitel, Paul and Deitel, Harvey|9780134752129\n1996|Sams|Teach Yourself Java in 21 Days (Teach Yourself (Teach Yourself))|Lemay, Laura and Perkins, Charles L.|9781575210308\n2014|Pragmatic Bookshelf|Learn to Program with Minecraft Plugins: Create Flaming Cows in Java Using CanaryMod|Hunt, Andy|9781941222942\n2021|Sybex|OCP Java SE 11 Developer Complete Certication Kit|Boyarsky, Jeanne and Selikoff, Scott|9781119784746\n2009|Apress|Learn Objective-C for Java Developers (Learn Series)|Bucanek, James|9781430223696\n1999|Iuniverse|Principles Of Object-oriented Programming In Java 1.1|James W. Cooper|9781583482186\n2002|Addison-Wesley|Java Data Objects|Roos, Robin M.|9780321123800\n1998|O'Reilly Media|Java Cryptography (Java Series)|Knudsen, Jonathan|9781565924024\n1998|McGraw-Hill|Schaum's Outlines of Programming with Java|Hubbard, John R.|9780071342100\n2019|Apress|Practical Microservices Architectural Patterns: Event-Based Java Microservices with Spring Boot and Spring Cloud|Binildas Christudas|9781484245019\n2003|Que Pub|Java 2 Developer Exam Cram 2: Exam Cx-310-252A and Cx-310-027|Trottier, Alain|9780789729927\n1997|Prentice Hall Ptr|JAVA JUMP START: A Beginner's Guide to Internet Programming|Enete, Noel|9780135658543\n2002|Sams Publishing|JXTA: Java P2P Programming|Brookshier, Daniel and Govoni, Darren and Krishnan, Navaneeth and Soto, Juan|9780672323669\n2016|Pearson|MyLab Programming with Pearson eText -- Access Card -- for Introduction to Java Programming, AP Version (1-year access)|Liang, Y. Daniel|9780134441160\n2018|CreateSpace Independent Publishing Platform|Java: Simple Beginner’s Guide to Java Programming (Tips and Tricks and Strategies of Java Programming) (Volume 1)|Laurence, Paul|9781718753914\n1999|Waite Group Pr|Java Programming for Linux|Meyers, Nathan|9781571691668\n2001|Apress|Professional WebObjects with Java|Thomas Termini and Pierce Wetter and Ben Galbraith and Jim Roepcke and Pero Maric and John Hopkins and Josh Flowers and Daniel Steinberg and Max Muller and Michael DeMann and Bernard Scholz|9781861004314\n2008|Morgan Kaufmann|Bluetooth Application Programming with the Java APIs Essentials Edition (The Morgan Kaufmann Series in Networking)|Thompson, Timothy J. and Kumar, C Bala and Kline, Paul J.|9780123743428\n2012|Pearson College Div|Introduction to Java Programming|Liang, Y. Daniel|9780133051469\n2008|Packt Publishing|Java EE 5 Development with NetBeans 6|Heffelfinger, David|9781847195463\n|Pearson Education Limited|Introduction to Java Programming and Data Structures, Comprehensive Version Plus Pearson Mylab Programming with Pearson Etext, Global Edition||9781292222028\n|Wrox Press|Professional Oracle 8i Java|Wrox Press Author Team|9781861004154\n2005|Sams Publishing|Java After Hours: 10 Projects You'll Never Do at Work|Holzner, Steven|9780672327476\n1999|Apress|Professional JavaScript with DHTML, ASP, CGI, FESI, Netscape Enterprise Server, Windows Script Host, LiveConnect and Java|Chirelli, Andrea and Li, Sing and Wilton, Paul and McFarlane, Nigel and Updegrave, Stuart and Wilcox, Mark and Wootton, Cliff and McFarlane, Nigel and James De Carli|9781861002709\n2001|Sams|Wireless Java Programming With J2me|Yu Feng and Jun Zhu|9780672321351\n2017|Cengage Learning|Java Programming, Loose-leaf Version|Farrell, Joyce|9781337685917\n1996|Computing McGraw-Hill|Web Site Programming With Java|Harms, David and Fiske, Barton C. and Rice, Jeffrey C.|9780079129864\n2002|Charles River Media|Java Programming Fundamentals (CYBERROOKIES SERIES)|Seefeld, Kimberly|9781584502210\n2000|Sams|Java Server Pages Application Development|Scott M. Stirling and Andre Lei and Ben Forta and Edwin Smith and Larry Kim and Roger Kerr and David Aden|9780672319396\n2000|Addison-wesley Professional|Ldap Programming With Java (paperback)|Rob Weltman and Tony Dahbura|9780768682144\n20041228|Cambridge University Press|COBOL Programmers Swing with Java|E. Reed Doke; Bill C. Hardgrave; Richard A. Johnson|9780511081507\n1999|Holt Software Associates Inc.|Programming Concepts in Java 2nd Edition w/ IBM's VisualAge for Java 2.0 Software||9780921598329\n2007|AddisonWesley Professional|Next Generation Java Testing: TestNG and Advanced Concepts|Beust, C\\Xe9dric|9780321503107\n20140328|O'Reilly Media, Inc.|Client-Server Web Apps with JavaScript and Java|Casimir Saternos|9781449369316\n2014|Apress|Pro JavaFX 8: A Definitive Guide to Building Desktop, Mobile, and Embedded Java Clients|Vos, Johan and Gao, Weiqi and Weaver, James and Chin, Stephen and Iverson, Dean|9781430265740\n1999|Sams|Pure Java 2|Litwak, Kenneth|9780672316548\n2021|McGraw-Hill Publishing Co.|Programming with Java|Bradley, Julia Case and Millspaugh, Anita|9780071123099\n2006|BrainySoftware|Java 5: A Beginner's Tutorial (BrainySoftware)|Kurniawan, Budi|9780975212851\n2002|Sams Publishing|Java 2 Unleashed|Potts, Stephen and Pestrikov, Alex|9780672323942\n2002|Sams Publishing|Java Media APIs: Cross-Platform Imaging, Media and Visualization|Terrazas PH.D., Alejandro and Ostuni PH.D., John and Barlow, Michael|9780672320941\n2002|Microsoft Press|C# for Java Developers (Pro-Developer)|Jones, Allen and Freeman, Adam|9780735617797\n2001|Pearson Education (US)|Understanding Object-Oriented Programming with Java|Timothy A. Budd|9780201787047\n2001|Addison-Wesley Professional|Programming Open Service Gateways with Java Embedded Server™ Technology|Mike Hendrickson and Chen, Kirk and Gong, Li|9780201711028\n2013|CreateSpace Independent Publishing Platform|Fundamentals of Object-Oriented Programming in Java|Mohan, Permanand|9781482587524\n2021|CENGAGE INDIA|Java Programming: Advanced Topics (GTU) (with CD)|WILLIAMS RICHARD H.|9788131508688\n2002|Course Technology|Java Programming, Second Edition|Farrell, Joyce|9780619016593\n2022|N/a|Java An Introduction to Problem Solving & Programming|Walter Savitch|9780273751427\n2003|O'Reilly Media|Java Extreme Programming Cookbook|Eric M. Burke and Brian M. Coyner|9780596003876\n2011|Course Technology|Java Programming From Problem Analysis To Program Design|Malik and D. S.|9781111577643\n2010|Packt Publishing|Google App Engine Java and GWT Application Development|Guermeur, Daniel and Unruh, Amy|9781849690447\n2002|Routledge|Java Programming for Engineers (Mechanical Engineering)|Sanchez, Julio|9780849308109\n2004|Wiley|Concurrent and Real-Time Programming in Java|Wellings, Andrew|9780470844373\n2021|Jones & Bartlet|A Laboratory Course for Programming with Java|Dale|9789380108186\n2014|Apress|Learn Java for Web Development: Modern Java Web Development|Layka, Vishal|9781430259848\n1999|Alpha|The Complete Idiot's Guide to Java 2|Morrison, Michael|9780789721310\n2004|O'Reilly Media|Java Threads: Understanding and Mastering Concurrent Programming|Scott Oaks and Henry Wong|9780448446257\n2012|Pearson College Div|Java + MyProgrammingLab Access Code: How to Program|Deitel, Paul and Deitel, Harvey|9780132940955\n2006|Apress|Pro EJB 3: Java Persistence API (Expert's Voice in Java)|Keith, Mike and Schincariol, Merrick|9781590596456\n2012|PUP Department of Computer Science|Start Concurrent: An Introduction to Problem Solving in Java with a Focus on Concurrency, 2013 Edition|Wittman, Barry and Mathur, Aditya and Korb, Tim|9781557536723\n2008|Packt Publishing|DWR Java AJAX Applications|Sami Salkosuo|9781847192936\n1999|Springer|Formal Syntax and Semantics of Java (Lecture Notes in Computer Science (1523))||9783540661580\n2004|Course Technology|Java Programs to Accompany Programming Logic and Design|Smith, Jo Ann|9780619160258\n2013|CreateSpace Independent Publishing Platform|Learning Java through Alice|Daly, Tebring and Wrigley, Eileen|9781491073933\n2002|Mc Press|Java for RPG Programmers|Coulthard, Phil and Farr, George|9781931182065\n2012|Pearson|MyProgrammingLab with Pearson eText -- Access Card -- for Introduction to Java Programming, Brief Version (MyProgrammingLab (Access Codes))|Liang, Y. Daniel|9780132991568\n2016|Apress|Beginning Robotics Programming in Java with LEGO Mindstorms|Lu, Wei|9781484220047\n1999|Charles River Media|Graphics Programming With Java Second Edition/Book and Cd-Rom (Graphics Series)|Stevens, Roger T.|9781886801912\n2016|CreateSpace Independent Publishing Platform|Java: The Guide to Master Java Programming Fast (Booklet) (Volume 2)|Hoffman, Andrew|9781532852701\n2013|Packt Publishing|BPEL and Java Cookbook|Laznik, Jurij|9781849689205\n2003|Mcgraw-hill (tx)|An Introduction To Object-oriented Programming With Java|C. Thomas Wu|9780071217705\n2001|Sams Publishing|Jython for Java Programmers|Bill, Robert|9780735711112\n2000|Manning Publications|Server-Based Java Programming|Neward, Ted|9781884777714\n2016-09-26|Wiley Global Education US|Big Java Late Objects|Cay S. Horstmann|9781119321071\n2000|O'Reilly Media|The Java Enterprise CD Bookshelf|O'Reilly Media, Inc.|9781565928503\n20170404|Pearson Technology Group|Introduction to Programming in Java|Robert Sedgewick; Kevin Wayne|9780134512396\n2011|BrainySoftware|Java 7: A Beginner's Tutorial|Kurniawan, Budi|9780980839616\n2000|Holt Software Assoc Inc|Introduction to Programming in Java|Hume, J. N. Patterson and Stephenson, Christine|9780921598398\n20100824|Pearson Technology Group|Java EE 6 Tutorial, The|Eric Jendrock; Ian Evans; Devika Gollapudi; Kim Haase; Chinmayee Srivathsa|9780137084265\n2001|McGraw-Hill Science/Engineering/Math|Objects Have Class: An Introduction to Programming with Java with CD-ROM and OLC|Poplawski, David A.|9780072505016\n2009|Pearson|Seam Framework: Experience the Evolution of Java EE (2nd Edition)|Yuan, Michael and Orshalick, Jacob and Heute, Thomas|9780137129393\n2004|Wiley|An Introduction to Programming and Object-Oriented Design Using Java|Ni?o, Jaime and Hosch, Frederick A.|9780471481676\n2016|CreateSpace Independent Publishing Platform|Learn Java 8 In a Week: A beginner's guide to Java Programming (Black Book)|Rathore, Mahavir DS|9781530669172\n2002|Jones & Bartlett Learning|Introduction To Cryptography With Java Applets|Bishop, David|9780763722074\n2017|Packt Publishing|Modular Programming in Java 9: Build large scale applications using Java modularity and Project Jigsaw|Kothagal, Koushik|9781787126909\n2015|机械工业出版社|Java Programming Language (Basic) (the original book version 10) - Java语言程序设计（基础篇）（原书第10版）|[美]Y.Daniel Liang|9787111506904\n1996|Coriolis Group|Java Programming EXplorer: Everything You Need to Develop Internet Applications with the Java Programming Language|Simkin, Steve and Bartlett, Neil and Leslie, Alex|9781883577810\n1998|Cambridge University Press|Java Gems: Jewels from Java Report|Dwight Deugo and Donald G. Firesmith|9780521648240\n2017|Addison-Wesley Professional|Effective Java|Joshua, Bloch|9780134686042\n1999|Coriolis Group|Java 2 Exam Cram Exam 310-025|William B. Brogden|9781576102916\n2010|Pearson Education|Introduction to Java Programming, Brief: International Edition|Liang, Y. Daniel|9780132473118\n1999|Coriolis Group|Java 2 Exam Prep (Exam: 310-025)|Brogden, Bill|9781576102619\n1999|Mc Pr Llc|Java Application Strategies For The As/400|Don Denoncourt|9781883884611\n2018|Packt Publishing|Developing Java Applications with Spring and Spring Boot|Oliveira, Claudio Eduardo de and Turnquist, Greg L. and Antonov, Alex|9781789534757\n2002|Prentice Hall|Practical Object-Oriented Development with UML and Java|Lee, Richard C. and Tepfenhart, William M.|9780130672384\n2019|Arcler Press|Java Programming Applications|Prudhomme, Gerard|9781774073193\n2000|Addison-Wesley|The Java 3D(TM) API Specification (2nd Edition)|Sowizral, Henry and Rushforth, Kevin and Deering, Michael|9780201710410\n20170830|Pearson Education (US)|Java Software Solutions|John Lewis; William Loftus|9780134544021\n2002|Apress|The Sun Certified Java Developer Exam with J2SE 1.4|Patterson, Jeremy and Habibi, Mehran and Camerlengo, Terry|9781590590300\n2019|Apress|Learn Java with Math: Using Fun Projects and Games|Dai, Ron|9781484252086\n2008|Pragmatic Bookshelf|Groovy Recipes: Greasing the Wheels of Java (Pragmatic Programmers)|Davis, Scott|9780978739294\n2004||Java Programming For Kids|Yakov Fain|9780971843950\n2001|Apress|Java XML Programmer's Reference|Eric Jung and Andrei Cioroianu and Dave Writz and Mohammad Akif and Steven Brodhead and James Hart|9781861005205\n2004-08-26|Wiley|Java 2 For Dummies|Barry Burd|9780764578496\n20150529|Pearson Education (US)|Starting Out with Java|Tony Gaddis|9780133957235\n2000|Morgan Kaufmann|Understanding SQL and Java Together: A Guide to SQLJ, JDBC, and Related Technologies (The Morgan Kaufmann Series in Data Management Systems)|Melton, Jim and Eisenberg, Andrew|9781558605626\n2003|Sams|Extreme Programming With Ant: Building and Deploying Java Applications With Jsp, Ejb, Xslt, Xdoclet, and Junit|Niemeyer, Glenn and Poteet, Jeremy|9780672325625\n2015|Packt Publishing|Learning Network Programming with Java|Reese, Richard|9781785882562\n1998|Wiley|Computer Graphics for Java Programmers|Ammeraal, Leen|9780471981428\n2014|Apress|Beginning Java 8 Games Development|Jackson, Wallace|9781484204153\n2017|Independently published|Programming: Python Programming, JAVA Programming, HTML and CSS Programming for Beginners|Academy, iCode|9781520676081\n2006|Wiley|Developing Java Software (third edition)|Winder, Russel and Roberts, Graham|9780470090251\n2004|ISTE Publishing Company|Java & Databases (Innovative Technology Series)||9781903996157\n2020|Apress|Beginning Quarkus Framework: Build Cloud-Native Enterprise Java Applications and Microservices|Koleoso, Tayo|9781484260319\n2000|John Wiley and Sons|(Wcs)Intro to Programming W/ Java|Nino|9780471399568\n2005|Heaton Research, Inc.|Introduction to Neural Networks with Java|Heaton, Jeff T|9780977320608\n2005|Charles River Media|Learning JAVA through Applications (Programming Series)|Jarc, Duane J|9781584503767\n20080212|Jones & Bartlett Learning|Programming and Problem Solving with Java|Nell Dale|9781449639808\n1999|Mcgraw-hill Education (ise Editions)|An Introduction To Object Oriented Programming With Java (mcgraw-hill International Editions)|C.thomas Wu|9780071168502\n2022|SYS-CON Media|Rich Internet Applications with Adobe Flex and Java : Secrets of the Masters|Fain, Yakov; Rasputnis, Victor; Tartakovsky, Anatole|9780977762224\n2002|Cengage Learning PTR|Java Programming for the Absolute Beginner|Russell, Joseph P.|9780761535225\n1999|Addison-Wesley Professional|Mr. Bunny's Big Cup o' Java|Egremont, Carlton|9780201615630\n2020|Apress|Spring Boot Persistence Best Practices: Optimize Java Persistence Performance in Spring Boot Applications|Anghel Leonard|9781484256268\n2019|Packt Publishing|Serverless Programming Cookbook: Practical solutions to building serverless applications using Java and AWS|Kanikathottu, Heartin|9781788623797\n2000|Morgan Kaufmann|Object-Oriented Implementation of Numerical Methods: An Introduction with Java & Smalltalk (The Morgan Kaufmann Series in Software Engineering and Programming)|Besset, Didier H.|9781558606791\n1998|Sams|Sams Teach Yourself Java 1.2 in 21 Days|Lemay, Laura and Cadenhead, Rogers|9781575213903\n2015|Cengage Learning|Java Programming|Farrell, Joyce|9781305480537\n2002|Muska & Lipman/Premier-Trade|Java Security|Ganguli, Madhushree|9781931841856\n2009||Java Programming|D. S. Malik|9781439040348\n2017|Apress|Pro Java Clustering and Scalability: Building Real-Time Apps with Spring, Cassandra, Redis, WebSocket and RabbitMQ|Acetozi, Jorge|9781484229859\n2000|Apress|Definitive Guide to Swing for Java 2, Second Edition|Zukowski, John|9781893115781\n2019|lulu.com|Reviewing Java|Maureau, Alex|9780557043552\n2007|Pearson|Introduction To Java Programming Comprehensive Version Custom Edition Sixth Edition|Y. Daniel Liang|9780558100117\n2017|CreateSpace Independent Publishing Platform|Computer Programming: 6 Books in 1: Beginner's Guide + Best Practices to Programming Code with Python, JavaScript and Java|Masterson, Charlie|9781548828547\n2002|Manning Publications|Java 3D Programming|Selman, Daniel|9781930110359\n1999|Course Technology Ptr (Sd)|Java Programming: Comprehensive|Farrell, Joyce M.|9780760010709\n2011|Pearson College Div|Java Software Solutions|Lewis and John/ Loftus|9780132783385\n20140226|Pearson Education (US)|Java Software Solutions|John Lewis; William Loftus|9780133795318\n2005|Virtualbookworm.com Publishing, Incorporated|Ant Java Notes: An Accelerated Intro Guide to the Java Ant Build Tool|A. T. Bell|9781589397385\n2016|CreateSpace Independent Publishing Platform|Android: Android Programming And Android App Development For Beginners: (Learn How To Program Android Apps, How To Develop Android Applications Through Java Programming, Android For Dummies)|Publishing, UpSkill|9781534746183\n1997|Sams|Maximum Java 1.1|Vanderburg, Glenn|9781575212906\n2000||Java Network Programming|E. Harold|9780765561947\n2006|Wiley|Developing Chemical Information Systems: An Object-Oriented Approach Using Enterprise Java|Li, Fan|9780471751571\n2007|Cengage Learning Ptr|Mobile 3d Graphics: Learning 3d Graphics With The Java Micro Edition|Claus Höfele|9781598632927\n20060516|O'Reilly Media, Inc.|Java I/O|Elliotte Rusty Harold|9781449390884\n2015-09-18|Packt Publishing|Java Hibernate Cookbook|Yogesh Prajapati|9781784391904\n2013|Springer|An Introduction to Network Programming with Java: Java 7 Compatible|Graba, Jan|9781447152545\n2021|Prentice Hall of India|Object Oriented Programming with C++ and Java [Oct 30, 2004] D. Samanta|Samanta|9788120316201\n2002|Apress|Beginning Java Web Services|Henry Bequet and Meeraj Kunnumpurath and Rhody, Sean and Andre Tost|9781861007537\n2007|New Age Publications (academic)|Internet And Java Programming|R. Krishnamoorty,prabhu R. Krishnamoorty|9788122413526\n2002|John Wiley &Sons|Java Web Services Programming|Mogha, Rashim|9780764549526\n2004|Sams Publishing|BEA WebLogic Workshop 8.1 Kick Start: Simplifying Java Web Applications and J2EE|Saganich Jr., Albert and Hardy, Tom and Kaye, Lawrence and Srivatsan, Sunila|9780672326226\n1996|Coriolis Group,U.S.|Kickass Java Programming: Cutting-Edge Java Techniques With an Attitude|Tonny Espeset|9781883577995\n2012|Jaico Publishing House|Introduction To Java Programming|K. Somasundaram|9788184954432\n2012|Wiley Global Education|Big Java Late Objects|Cay S. Horstmann|9781118214572\n2014|Addison-Wesley Professional|Java Tutorial, The: A Short Course on the Basics (Java Series)|Gallardo, Raymond and Hommel, Scott and Kannan, Sowmya and Gordon, Joni and Zakhour, Sharon Biocca|9780134034690\n2004|Springer|The JR Programming Language: Concurrent Programming in an Extended Java (The Springer International Series in Engineering and Computer Science (774))|Olsson, Ronald A. and Keen, Aaron W.|9781402080852\n1999|Prentice Hall Ptr|Core Java Media Framework|deCarmo, Linden|9780130115195\n1997|Charles River Media|Graphics Programming with Java|Stevens, Roger|9781886801622\n2014|Wspc|The Nonlinear Workbook: Chaos, Fractals, Cellular Automata, Genetic Algorithms, Gene Expression Programming, Support Vector Machine, Wavelets, Hidden ... Java And Symbolicc++ Programs|Steeb, Willi-Hans|9789814583473\n2002|BPB Publications|Learn Advanced Java Script Programming|Vijay Mukhi|9788170299370\n20070830|O'Reilly Media, Inc.|Darkstar: The Java Game Server|Brendan Burns|9780596514846\n1996|Prentice Hall Ptr|Java Programming For The Internet|Marc Loy|9780132707787\n2002|London ; Taylor & Francis, 2002.|Java Programming For Spatial Sciences|Jo Wood|9780203166178\n2004|iUniverse|First Course: Data Structures and Algorithms Using Java: Data Structures and Algorithms Using JAVA|Hill, Edward|9780595318964\n2017|Pearson Education Limited|Java Plus Myprogramminglab With Pearson Etext|Savitch and Walter J.|9781292184944\n2001|Wiley|Mobile Information Device Profile For Java 2 Microedition: Professional Developer's Guide (professional Developer's Guide Series)|C. Enrique Ortiz and Eric Gigu?re|9780471034650\n1999|Wiley|Programming Windows with Java and WFC|Krell, Bruce E.|9780764532726\n2011|Lulu.com|C For Java Programmers: A Primer|Charlie McDowell|9781257188796\n2009|China Water Power Press Pub. Date :2009-09|Java Case Programming Tutorials(chinese Edition)|Guo Zhen Min Sheng Gui Yong|9787508468280\n2002|Indianapolis, In : Wiley, 2002.|Wireless Java Programming For Enterprise Applications|Dan Harkey and Shan Appajodu and Mike Larkin|9780471218784\n2008|Prentice Hall|Java: Introduction To Problem Solving And Programming Value Package (includes Addison-wesley's Java Backpack Reference Guide)|Walter Savitch and Frank Carrano|9780135038253\n2007-02-15|Packt Publishing|Google Web Toolkit: GWT Java AJAX Programming|Prabhakar Chaganti|9781847191014\n20061107|Springer Nature|The Definitive Guide to Building Java Robots|Scott Preston|9781430200888\n2013|Cengage Learning|Bundle: Java Programming, 7th + Coursemate Printed Access Card|Joyce Farrell|9781285999722\n2002|Cengage Learning|Java With Object-oriented Programming (non-infotrac Version)|Paul S. Wang|9780534391447", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1998|Making the future safe for the past: adding genericity to the Java programming language|10.1145/286936.286957|594|44|Gilad Bracha and Martin Odersky and David Stoutamire and P. Wadler|7862ab20bf14ff78eb74c5b17fd52a4d498eaec2\n1998|Compatible genericity with run-time types for the Java programming language|10.1145/286936.286958|150|13|Robert Cartwright and G. Steele|fb892076f2b162d2c061bfefdad88158cf522b99\n2008|Session-Based Distributed Programming in Java|10.1007/978-3-540-70592-5_22|149|19|Raymond Hu and N. Yoshida and Kohei Honda|1c657b0b5a77b302493a69820540d418ba18ba47\n2004|Adding wildcards to the Java programming language|10.1145/967900.968162|137|13|Mads Torgersen and Erik Ernst and Christian Plesner Hansen and P. Ahé and Gilad Bracha and N. Gafter|cec77c48196c68ae617911e7b316612396ad27ec\n2000|Java programming for high-performance numerical computing|10.1147/SJ.391.0021|117|8|J. Moreira and S. Midkiff and Manish Gupta and Pedro V. Artigas and M. Snir and Richard D. Lawrence|e6ba2aae171aaadf0d4648cbd254f279c5b92566\n2014|Mining billions of AST nodes to study actual and potential usage of Java language features|10.1145/2568225.2568295|97|7|Robert Dyer and Hridesh Rajan and H. Nguyen and T. Nguyen|d5fd3931b0f0492bd543aac33c953aa541f2d03c\n2011|ContextJ: Context-oriented Programming with Java|10.11185/IMT.6.399|95|9|M. Appeltauer and R. Hirschfeld and M. Haupt and Hidehiko Masuhara|6472be8854d79560923461f32c36026ebc97f883\n2000|NaturalJava: a natural language interface for programming in Java|10.1145/325737.325845|93|5|D. Price and E. Riloff and J. Zachary and Brandon Harvey|a11513ce3256ebea0eec68b38acbd8275723050d\n2013|Maxine: An approachable virtual machine for, and in, java|10.1145/2400682.2400689|89|12|Christian Wimmer and M. Haupt and M. V. D. Vanter and Mick J. Jordan and L. Daynès and Doug Simon|3a54e9d683c172acf9d2a503754f1c68b7daf611\n1998|Java as first programming language: a critical evaluation|10.1145/292422.292440|87|6|Said Hadjerrouit|2f80cbad16b5945f2f5029012999aeff12efd51d\n2007|Keyword programming in Java|10.1007/s10515-008-0041-9|78|3|Greg Little and Rob Miller|6f6c15e91faf8afa4ad9b48c224350f1bf135054\n2007|Interface-based programming assignments and automatic grading of java programs|10.1145/1268784.1268805|64|7|Michael T. Helmick|48142625261b1cca94ab650a6ccf10706e830f49\n2017|Investigating Static Analysis Errors in Student Java Programs|10.1145/3105726.3106182|62|2|S. Edwards and Nischel Kandru and Mukund B. M. Rajagopal|f0552a483f71919a32365012de15051c206c00ad\n2001|Concurrent Programming: The Java Programming Language|10.12694/scpe.v4i2.230|62|5|G. Gagne|fcfd49bdf3cecf170a4bf5974bdfa2abcd250397\n2000|A Java programming tool for students with visual disabilities|10.1145/354324.354356|58|3|Ann C. Smith and J. Francioni and Sam D. Matzek|8892647a286cd2141d5d18c1a9b00fc2e1c58ff4\n2017|Understanding the use of lambda expressions in Java|10.1145/3133909|56|8|D. Mazinanian and Ameya Ketkar and Nikolaos Tsantalis and Danny Dig|f3047998ef0ab6ffffe617397cf8efe99bd34b80\n2014|LeakWatch: Estimating Information Leakage from Java Programs|10.1007/978-3-319-11212-1_13|50|4|Tom Chothia and Yusuke Kawamoto and Chris Novakovic|c72cea83ed4b4649251f54a83adc18124f42de55\n2014|DeltaJ 1.5: delta-oriented programming for Java 1.5|10.1145/2647508.2647512|50|5|J. Koscielny and Sönke Holthusen and I. Schaefer and Sandro Schulze and Lorenzo Bettini and F. Damiani|777b8c22184ce1b10a56730d594adae962f10cbc\n2008|Caching and incrementalisation in the java query language|10.1145/1449764.1449766|40|10|Darren Willis and David J. Pearce and J. Noble|1ef340939607eaf1361c9da010da9c3c12dcde42\n2015|Genetic Algorithms in Java Basics|10.1007/978-1-4842-0328-6|40|3|Lee Jacobson and B. Kanber|94ebd1b97887bd36ca54d93581ac83b2911157b4\n2012|Using mobile phone programming to teach Java and advanced programming to computer scientists|10.1145/2157136.2157292|39|5|D. Riley|d6b50fc7e13a1057b077ab3bd48f87271d9af8b8\n2002|Language-specific make technology for the Java programming language|10.1145/582419.582453|39|3|M. Dmitriev|c6db9561b9769a5fc1618e1fe29ee3b7851555a1\n2010|Programming Finite Elements in Java|10.1007/978-1-84882-972-5|34|2|G. Nikishkov|a8f6e0d60e1364333694ccc60cb04d5cf5f44374\n2011|Safe Parallel Programming with Session Java|10.1007/978-3-642-21464-6_8|30|0|Nicholas Ng and N. Yoshida and Olivier Pernet and Raymond Hu and Yiannos Kryftis|870662bb6c66a2069a7392e2ad2bb67f9a65dd94\n2012|A machine-checked, type-safe model of Java concurrency: language, virtual machine, memory model, and verified compiler|10.5445/KSP/1000028867|30|2|Andreas Lochbihler|c36ff13c201aa3caaa8ed1179b206023fdd194ed\n1997|The Case for Java as a Programming Language|10.1109/4236.585172|30|2|A. Hoff|2aed90d637971b96a891f79187f3e6e92736b925\n1998|Concurrent programming: the Java programming language|10.5860/choice.36-1006|30|1|Stephen J. Hartley|f3919013a32e7236f1235dc39b085e8fa3357be4\n2002|Evaluation of Assertion Support for the Java Programming Language|10.5381/jot.2002.1.3.a1|28|0|Reinhold Plösch|0e6ee9ce96b9f5aae32f1da6fbf21a44d7ee198b\n2010|Web-Based Multiplayer Online Role Playing Game (MORPG) for Assessing Students' Java Programming Knowledge and Skills|10.1109/DIGITEL.2010.20|22|0|Maiga Chang and Kinshuk|c6446458e72ce254305ef3cd4eeb0fc62c71cb4e\n2012|Modeling the Knowledge Domain of the Java Programming Language as an Ontology|10.1007/978-3-642-33642-3_16|21|1|Aggeliki Kouneli and G. Solomou and C. Pierrakeas and A. Kameas|3915703932e988d909d0a9251009fa6c5933290e\n1997|Improving the interactivity and functionality of Web-based radiology teaching files with the Java programming language.|10.1148/RADIOGRAPHICS.17.6.9397464|20|2|J. Eng|09501e85462489a754a1cab8eafd9ccb759f8234\n2003|Assessment of the Java programming language for use in high integrity systems|10.1145/844091.844099|19|1|J. Kwon and A. Wellings and S. King|90b925874632d2a11c9d3ada8c963e899e363c4e\n1998|Applications of JAVA programming language to database management|10.1145/273244.273254|13|0|Bradley F. Burton and V. Marek|e502374c91f0b196836e965cf0ac88002d642bb3\n1999|SQLJ Part 1: SQL routines using the Java programming language|10.1145/344816.344864|13|1|A. Eisenberg and Jim Melton|75aac5614558f08595d4b737c075e89e47040337\n2018|Comparison of garbage collectors in Java programming language|10.23919/MIPRO.2018.8400277|12|0|H. Grgic and B. Mihaljević and A. Radovan|090173690ad7bcf3c2d83f840db65872d0d66b5f\n2018|Java Programming Language|10.1007/978-3-030-02619-6_35|1|0|Gerard O'Regan|6bffc1a6dff69fc47734945adfc4e04775d3b139\n1996|Java Programming Language|10.32388/4ejcag|1|0|D. Friedel and Anthony P. Potts|6e0f1aacb150c00ef2c9ad638c7fa495332086fa" }, "javacc": { "title": "JavaCC", "appeared": 1996, "type": "grammarLanguage", "website": "https://javacc.org/", "country": [ "United States" ], "originCommunity": [ "Sun Microsystems, Inc" ], "domainName": { "registered": 2012, "awisRank": { "2017": 2362114 }, "name": "javacc.org" }, "wikipedia": { "related": [ "java", "yacc", "lex", "beanshell", "lucene-query-syntax", "antlr", "coco-r" ], "summary": "JavaCC (Java Compiler Compiler) is an open source parser generator and lexical analyzer generator written in the Java programming language. JavaCC is similar to yacc in that it generates a parser from a formal grammar written in EBNF notation. Unlike yacc, however, JavaCC generates top-down parsers. JavaCC can resolve choices based on the next k input tokens, and so can handle LL(k) grammars automatically; by use of \"lookahead specifications\", it can also resolve choices requiring unbounded look ahead. JavaCC also generates lexical analyzers in a fashion similar to lex. The tree builder that accompanies it, JJTree, constructs its trees from the bottom up. JavaCC is licensed under a BSD license.", "pageId": 402257, "dailyPageViews": 47, "created": 2003, "backlinksCount": 43, "revisionCount": 103, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/JavaCC" }, "linkedInSkill": { "2018": 528, "id": "javacc" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "javafx-script": { "title": "JavaFX Script", "appeared": 2005, "type": "pl", "website": "http://javafx.com/", "originCommunity": [ "Oracle" ], "domainName": { "registered": 1997, "name": "javafx.com" }, "wikipedia": { "example": [ "import javafx.ext.swing.*;\n \n var myFrame:SwingFrame = new SwingFrame();\n var myLabel:Label = new Label();\n \n myLabel.text = \"Hello World!\";\n myFrame.width = 200;\n myFrame.height = 50;\n myFrame.visible = true;\n myFrame.content = myLabel;" ], "related": [ "eclipse-editor", "java", "curl" ], "summary": "JavaFX Script is a scripting language designed by Sun Microsystems, forming part of the JavaFX family of technologies on the Java Platform. JavaFX targets the Rich Internet Application domain (competing with Adobe Flex and Microsoft Silverlight), specializing in rapid development of visually rich applications for the desktop and mobile markets. JavaFX Script works with integrated development environments such as NetBeans, Eclipse and IntelliJ IDEA. JavaFX is released under the GNU General Public License, via the Sun sponsored OpenJFX project.", "pageId": 11117691, "dailyPageViews": 27, "created": 2007, "backlinksCount": 33, "revisionCount": 196, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/JavaFX_Script" }, "tiobe": { "id": "JavaFX Script" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "javaml": { "title": "JavaML", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0244a8d6d45302ecf0c0c5ec47bfd0b10ba94c82" ], "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5562", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "javascript": { "title": "JavaScript", "appeared": 1995, "type": "pl", "creators": [ "Brendan Eich" ], "webRepl": [ "https://playcode.io/javascript/" ], "documentation": [ "https://developer.mozilla.org/en-US/docs/Web/JavaScript" ], "ebook": "https://eloquentjavascript.net/", "spec": "https://javascript.info/manuals-specifications", "reference": [ "https://www.w3schools.com/js/js_reserved.asp" ], "aka": [ "ECMAScript", "es6", "es5" ], "country": [ "United States" ], "originCommunity": [ "Netscape" ], "proposals": "https://github.com/tc39/proposals", "influencedBy": [ "java", "self", "scheme" ], "hasSExpressions": { "example": "", "value": false }, "hasSymbols": { "example": "// A symbol is a unique and immutable primitive value, often used as a unique key for object properties\npldb = Symbol()", "value": true }, "hasExports": { "example": "export function myFunction() {\n}", "value": true }, "hasEnums": { "example": "", "value": false }, "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasAccessModifiers": { "example": "", "value": false }, "hasAbstractTypes": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "", "value": false }, "hasImports": { "example": "import { helloWorld } from \"./helloWorld.js\";", "value": true }, "hasStatements": { "example": "let x = 3;", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "console.log(\"Hello World\".match(/\\w/))", "value": true }, "hasExpressions": { "example": "1 + 1", "value": true }, "hasAsyncAwait": { "example": "async doSomething => await somethingElse()", "value": true }, "hasBinaryOperators": { "example": "1 + 1", "value": true }, "hasMapFunctions": { "example": "[1,2.1].map(Math.round)", "value": true }, "hasPartialApplication": { "example": "const addNumbers = (num1, num2) => num1 + num2\nconst add5 = num => addNumbers(10, num)", "value": true }, "supportsBreakpoints": { "example": "if (false)\n debugger", "value": true }, "hasPointers": { "example": "", "value": false }, "hasIntegers": { "example": "80766866", "value": true }, "hasLists": { "example": "const list = [1,2,3]", "value": true }, "mergesWhitespace": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasPolymorphism": { "example": "\"a\" + \"b\"; 1 + 2", "value": true }, "hasSingleDispatch": { "example": "", "value": true }, "hasMultipleDispatch": { "example": "", "value": false }, "hasBitWiseOperators": { "example": "var x = 5 & 1;", "value": true }, "hasSourceMaps": { "example": "{\n version: 3,\n file: 'min.js',\n names: ['bar', 'baz', 'n'],\n sources: ['one.js', 'two.js'],\n sourceRoot: 'http://example.com/www/js/',\n mappings: 'CAAC,IAAI,IAAM,SAAUA,GAClB,OAAOC,IAAID;CCDb,IAAI,IAAM,SAAUE,GAClB,OAAOA'\n};", "value": true }, "hasProcessorRegisters": { "example": "", "value": false }, "hasDynamicProperties": { "example": "class Person {}\nconst person = new Person()\nperson.age = 50", "value": true }, "hasMagicGettersAndSetters": { "example": "// Can be implemented in ES6 using proxies:\n\"use strict\";\nif (typeof Proxy == \"undefined\") {\n throw new Error(\"This browser doesn't support Proxy\");\n}\nlet original = {\n \"foo\": \"bar\"\n};\nlet proxy = new Proxy(original, {\n get(target, name, receiver) {\n let rv = Reflect.get(target, name, receiver);\n if (typeof rv === \"string\") {\n rv = rv.toUpperCase();\n }\n return rv;\n }\n});\nconsole.log(`original.foo = ${original.foo}`); // \"original.foo = bar\"\nconsole.log(`proxy.foo = ${proxy.foo}`); // \"proxy.foo = BAR\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasMethodChaining": { "example": "\"hello world\".toString().substr(0, 1).length", "value": true }, "hasClasses": { "example": "class Person {}", "value": true }, "hasConditionals": { "example": "if (true)\n console.log(\"hi!\")", "value": true }, "hasComments": { "example": "", "value": true }, "hasLabels": { "example": "main:\nconsole.log(\"pldb\")", "value": true }, "hasConstructors": { "example": "class Person {\n constructor(name) {\n this._name = name\n }\n}\nnew Person(\"Jane\")", "value": true }, "hasConstants": { "example": "const one = 1", "value": true }, "hasDynamicTyping": { "example": "", "value": true }, "hasExceptions": { "example": "try {\n undefinedFn()\n} catch (err) {\n console.log(err)\n}", "value": true }, "hasFirstClassFunctions": { "example": "[2.0,1.1].map(Math.round)", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasGenerators": { "example": "function* fibonacci(limit) {\n let [prev, curr] = [0, 1];\n while (!limit || curr <= limit) {\n yield curr;\n [prev, curr] = [curr, prev + curr];\n }\n}\n// bounded by upper limit 10\nfor (let n of fibonacci(10)) {\n console.log(n);\n}\n// generator without an upper bound limit\nfor (let n of fibonacci()) {\n console.log(n);\n if (n > 10000) break;\n}\n// manually iterating\nlet fibGen = fibonacci();\nconsole.log(fibGen.next().value); // 1\nconsole.log(fibGen.next().value); // 1\nconsole.log(fibGen.next().value); // 2\nconsole.log(fibGen.next().value); // 3\nconsole.log(fibGen.next().value); // 5\nconsole.log(fibGen.next().value); // 8\n// picks up from where you stopped\nfor (let n of fibGen) {\n console.log(n);\n if (n > 10000) break;\n}", "value": true }, "hasDirectives": { "example": "\"use strict\";\n\"use asm\";", "value": true }, "hasAssignment": { "example": "var name = \"John\"", "value": true }, "hasImplicitTypeConversions": { "example": "console.log(\"hello \" + 2)", "value": true }, "hasInfixNotation": { "example": "const six = 2 + 2 + 2", "value": true }, "hasAnonymousFunctions": { "example": "(() => console.log(\"hello world\"))()", "value": true }, "hasMacros": { "example": "", "value": false }, "hasFunctionOverloading": { "example": "", "value": false }, "hasMultilineStrings": { "example": "const lines = `one\ntwo`", "value": true }, "hasMultipleInheritance": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasOperators": { "example": "1 + 1", "value": true }, "hasOperatorOverloading": { "example": "", "value": false }, "hasReferences": { "example": "", "value": true }, "hasPrintDebugging": { "example": "console.log(\"Hi\")", "value": true }, "hasInheritance": { "example": "class B {}\nclass A extends B {}", "value": true }, "letterFirstIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasSwitch": { "example": "var animal = \"dog\"\nswitch (animal) {\n case \"dog\": console.log(\"yay\"); break;\n case \"cat\": console.log(\"oh\"); break;\n}", "value": true }, "hasTernaryOperators": { "example": "let i = true ? 1 : 0", "value": true }, "hasWhileLoops": { "example": "let times = 10\nwhile (times) {times--}\nconsole.log(\"done\")", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasFunctions": { "example": "function helloWorld() {console.log(\"hi\")}", "value": true }, "hasMethods": { "example": "class Person {\n method1() {}\n method2() {}\n}", "value": true }, "hasIncrementAndDecrementOperators": { "example": "let i = 0\ni++\ni--", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasDefaultParameters": { "example": "function multiply(a, b = 1) {\n return a * b;\n}", "value": true }, "hasDestructuring": { "example": "const o = {p: 42, q: true};\nconst {p, q} = o;", "value": true }, "hasFunctionComposition": { "example": "function o(f, g) {\n return function(x) {\n return f(g(x));\n }\n}", "value": true }, "hasSets": { "example": "set = new Set()\nset.add(\"foo\")", "value": true }, "hasOctals": { "example": "// 0[oO]?[0-7]+n?\n0o464063622", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F]+n?\n0x4D06792", "value": true }, "hasFloats": { "example": "// (\\.[0-9]+|[0-9]+\\.[0-9]*|[0-9]+)([eE][-+]?[0-9]+)?\n80766866.0", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01]+n?\n0b100110100000110011110010010", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "console.log" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "\"" ], [ "'" ], [ "`" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "arguments", "await", "boolean", "break", "byte", "case", "catch", "char", "class", "const", "continue", "debugger", "default", "delete", "do", "double", "else", "enum", "eval", "export", "extends", "false", "final", "finally", "float", "for", "function", "goto", "if", "implements", "import", "in", "instanceof", "int", "interface", "let", "long", "native", "new", "null", "package", "private", "protected", "public", "return", "short", "static", "super", "switch", "synchronized", "this", "throw", "throws", "transient", "true", "try", "typeof", "var", "void", "volatile", "while", "with", "yield" ], "funFact": "The name Java in JavaScript was pure marketing: \"At the time, the dot-com boom had begun and Java was the hot new language, so Eich considered the JavaScript name a marketing ploy by Netscape\"", "wikipedia": { "example": [ "var minstake = 0.00000100; // valor base\n //-----------------------------------------\n var autorounds = 99; // n° de rolls\n //======================================================\n // if (profit > profit_max) {\n // error_title = \"Maximum profit exceeded\";\n // error_info = \"Maximum profit: \" + number_format(profit_max, devise_decimal);\n // error_value = \"Maximum profit exceeded - Maximum profit: \" + number_format(profit_max, devise_decimal);\n // error = true;\n // }\n // else if (amount > balance) {\n // error_title = \"Bet amount\";\n // error_info = \"Maximum bet: \" + number_format(balance, devise_decimal);\n // error_value = \"Bet amount - Maximum bet: \" + number_format(balance, devise_decimal);\n // error = true;\n // }\n var handbrake = 1.0000000; // valor lose pause game\n var autoruns = 1;\n // else if (amount > bet_max) {\n // error_title = \"Bet amount\";\n // error_info = \"Maximum bet: \" + number_format(bet_max, devise_decimal);\n // error_value = \"Bet amount - Maximum bet: \" + number_format(bet_max, devise_decimal);\n // error = true;\n // }\n // else if (amount < bet_min) {\n // error_title = \"Bet amount\";\n // error_info = \"Minimum bet: \" + number_format(bet_min, devise_decimal);\n // error_value = \"Bet amount - Minimum bet: \" + number_format(bet_min, devise_decimal);\n // error = true;\n // }\n function playnow() {\n if (autoruns > autorounds ) { console.log('Limit reached'); return; }\n document.getElementById('double_your_btc_bet_hi_button').click();\n setTimeout(checkresults, 1000);\n return;}\n function checkresults() {\n if (document.getElementById('double_your_btc_bet_hi_button').disabled === true) {\n setTimeout(checkresults, 1000);\n return;\n }\n var stake = document.getElementById('double_your_btc_stake').value * 1;\n var won = document.getElementById('double_your_btc_bet_win').innerHTML;\n if (won.match(/(\\d+\\.\\d+)/) !== null) { won = won.match(/(\\d+\\.\\d+)/)[0]; } else { won = false; }\n var lost = document.getElementById('double_your_btc_bet_lose').innerHTML;\n if (lost.match(/(\\d+\\.\\d+)/) !== null) { lost = lost.match(/(\\d+\\.\\d+)/)[0]; } else { lost = false; }\n if (won && !lost) { stake = minstake; console.log('Bet #' + autoruns + '/' + autorounds + ': Won ' + won + ' Stake: ' + stake.toFixed(8)); }\n if (lost && !won) { stake = lost * 2.1; console.log('Bet #' + autoruns + '/' + autorounds + ': Lost ' + lost + ' Stake: ' + stake.toFixed(8)); }\n if (!won && !lost) { console.log('Something went wrong'); return; }\n document.getElementById('double_your_btc_stake').value = stake.toFixed(8);\n autoruns++;\n if (stake >= handbrake) {\n document.getElementById('handbrakealert').play();\n console.log('Handbrake triggered! Execute playnow() to override');\n return;\n }\n setTimeout(playnow, 1000);\n return;\n }playnow()" ], "related": [ "java", "lua", "scheme", "perl", "self", "c", "python", "awk", "hypertalk", "actionscript", "coffeescript", "dart", "livescript", "objective-j", "opa", "perl-6", "qml", "typescript", "json", "ecmascript", "html", "regex", "pdf", "tcl", "c--", "vbscript", "jscript", "jquery", "npm-pm", "mongodb", "sql", "max", "unity-engine", "google-apps-script", "objective-c", "applescript", "visual-studio-editor", "asmjs", "processing", "oberon", "smalltalk", "scala", "racket", "llvmir", "fantom", "haxe", "clojure", "kotlin", "squeak", "wasm" ], "summary": "JavaScript (), often abbreviated as JS, is a high-level, dynamic, weakly typed, prototype-based, multi-paradigm, and interpreted programming language. Alongside HTML and CSS, JavaScript is one of the three core technologies of World Wide Web content production. It is used to make webpages interactive and provide online programs, including video games. The majority of websites employ it, and all modern web browsers support it without the need for plug-ins by means of a built-in JavaScript engine. Each of the many JavaScript engines represent a different implementation of JavaScript, all based on the ECMAScript specification, with some engines not supporting the spec fully, and with many engines supporting additional features beyond ECMA. As a multi-paradigm language, JavaScript supports event-driven, functional, and imperative (including object-oriented and prototype-based) programming styles. It has an API for working with text, arrays, dates, regular expressions, and basic manipulation of the DOM, but the language itself does not include any I/O, such as networking, storage, or graphics facilities, relying for these upon the host environment in which it is embedded. Initially only implemented client-side in web browsers, JavaScript engines are now embedded in many other types of host software, including server-side in web servers and databases, and in non-web programs such as word processors and PDF software, and in runtime environments that make JavaScript available for writing mobile and desktop applications, including desktop widgets. Although there are strong outward similarities between JavaScript and Java, including language name, syntax, and respective standard libraries, the two languages are distinct and differ greatly in design; JavaScript was influenced by programming languages such as Self and Scheme.", "pageId": 9845, "dailyPageViews": 4264, "created": 2001, "backlinksCount": 8982, "revisionCount": 6131, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/JavaScript" }, "githubLanguage": { "fileExtensions": [ "js", "_js", "bones", "cjs", "es", "es6", "frag", "gs", "jake", "javascript", "jsb", "jscad", "jsfl", "jslib", "jsm", "jspre", "jss", "jsx", "mjs", "njs", "pac", "sjs", "ssjs", "xsjs", "xsjslib" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nPavelDoGreat WebGL-Fluid-Simulation https://github.com/PavelDoGreat.png https://github.com/PavelDoGreat/WebGL-Fluid-Simulation JavaScript #f1e05a 6010 473 2246 \"Play with fluids in your browser (works even on mobile)\"\nyangshun tech-interview-handbook https://github.com/yangshun.png https://github.com/yangshun/tech-interview-handbook JavaScript #f1e05a 33598 4587 4242 \"💯 Materials to help you rock your next coding interview\"\nhaotian-wang google-access-helper https://github.com/haotian-wang.png https://github.com/haotian-wang/google-access-helper JavaScript #f1e05a 3644 1071 1332 谷歌访问助手破解版\nnondanee UnblockNeteaseMusic https://github.com/nondanee.png https://github.com/nondanee/UnblockNeteaseMusic JavaScript #f1e05a 5101 689 1660 \"Revive unavailable songs for Netease Cloud Music\"\nricklamers gridstudio https://github.com/ricklamers.png https://github.com/ricklamers/gridstudio JavaScript #f1e05a 5643 937 3362 \"Grid studio is a web-based spreadsheet application with full integration of the Python programming language.\"\namejiarosario dsa.js-data-structures-algorithms-javascript https://github.com/amejiarosario.png https://github.com/amejiarosario/dsa.js-data-structures-algorithms-javascript JavaScript #f1e05a 4576 334 2082 \"Data Structures and Algorithms explained and implemented in JavaScript\"\nbilibili flv.js https://github.com/bilibili.png https://github.com/bilibili/flv.js JavaScript #f1e05a 15970 2425 648 \"HTML5 FLV Player\"\noutline outline https://github.com/outline.png https://github.com/outline/outline JavaScript #f1e05a 5553 330 2038 \"The fastest wiki and knowledge base for growing teams. Beautiful, feature rich, markdown compatible and open source.\"\njamiebuilds the-super-tiny-compiler https://github.com/jamiebuilds.png https://github.com/jamiebuilds/the-super-tiny-compiler JavaScript #f1e05a 14459 1332 966 \"⛄️ Possibly the smallest compiler ever\"\nYvetteLau Blog https://github.com/YvetteLau.png https://github.com/YvetteLau/Blog JavaScript #f1e05a 1043 181 253 【前端进阶】优质博文\nalvarotrigo fullPage.js https://github.com/alvarotrigo.png https://github.com/alvarotrigo/fullPage.js JavaScript #f1e05a 27942 6580 805 \"fullPage plugin by Alvaro Trigo. Create full screen pages fast and simple\"\ndcloudio uni-app https://github.com/dcloudio.png https://github.com/dcloudio/uni-app JavaScript #f1e05a 12081 957 1600 \"uni-app 是使用 Vue 语法开发小程序、H5、App的统一框架\"\nwebtorrent webtorrent https://github.com/webtorrent.png https://github.com/webtorrent/webtorrent JavaScript #f1e05a 20280 1948 307 \"⚡️ Streaming torrent client for the web\"\nanswershuto learnVue https://github.com/answershuto.png https://github.com/answershuto/learnVue JavaScript #f1e05a 7570 1538 421 \"Vue.js 源码解析\"\ndate-fns date-fns https://github.com/date-fns.png https://github.com/date-fns/date-fns JavaScript #f1e05a 19569 803 836 \"⏳ Modern JavaScript date utility library ⌛️\"\nKickball awesome-selfhosted https://github.com/Kickball.png https://github.com/Kickball/awesome-selfhosted JavaScript #f1e05a 35277 2823 1495 \"This is a list of Free Software network services and web applications which can be hosted locally. Selfhosting is the process of locally hosting and managing applications instead of renting from SaaS providers.\"\nreact-ui-kit dribbble2react https://github.com/react-ui-kit.png https://github.com/react-ui-kit/dribbble2react JavaScript #f1e05a 1143 522 222 \"Transform Dribbble designs to React-Native code & YouTube video tutorials\"\njonasschmedtmann complete-javascript-course https://github.com/jonasschmedtmann.png https://github.com/jonasschmedtmann/complete-javascript-course JavaScript #f1e05a 2088 3077 198 \"Starter files, final projects and FAQ for my Complete JavaScript course\"\ngraphql graphql-js https://github.com/graphql.png https://github.com/graphql/graphql-js JavaScript #f1e05a 14679 1279 340 \"A reference implementation of GraphQL for JavaScript\"\nDIYgod RSSHub https://github.com/DIYgod.png https://github.com/DIYgod/RSSHub JavaScript #f1e05a 8818 1112 480 \"🍰 万物皆可 RSS\"\nqianguyihao Web https://github.com/qianguyihao.png https://github.com/qianguyihao/Web JavaScript #f1e05a 6166 1785 598 前端入门和进阶学习笔记，超详细的Web前端学习图文教程。从零开始学前端，做一个Web全栈工程师。持续更新...\nBinaryify NeteaseCloudMusicApi https://github.com/Binaryify.png https://github.com/Binaryify/NeteaseCloudMusicApi JavaScript #f1e05a 11486 2196 826 \"网易云音乐 Node.js API service\"\ntransloadit uppy https://github.com/transloadit.png https://github.com/transloadit/uppy JavaScript #f1e05a 20872 1051 498 \"The next open source file uploader for web browsers 🐶\"\ngchq CyberChef https://github.com/gchq.png https://github.com/gchq/CyberChef JavaScript #f1e05a 5890 818 424 \"The Cyber Swiss Army Knife - a web app for encryption, encoding, compression and data analysis\"\ngivanz VvvebJs https://github.com/givanz.png https://github.com/givanz/VvvebJs JavaScript #f1e05a 1848 443 616 \"Drag and drop website builder javascript library.\"", "trendingProjectsCount": 26, "type": "programming", "filenames": [ "Jakefile" ], "interpreters": [ "chakra", "d8", "gjs", "js", "node", "nodejs", "qjs", "rhino", "v8", "v8-shell" ], "aceMode": "javascript", "codemirrorMode": "javascript", "codemirrorMimeType": "text/javascript", "tmScope": "source.js", "aliases": [ "js", "node" ], "repos": 16046489, "id": "JavaScript" }, "githubBigQuery": { "repos": 1099879, "users": 566345, "id": "JavaScript" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/javascript", "monaco": "javascript", "codeMirror": "javascript", "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "js", "jsm", "mjs", "cjs" ], "id": "JavaScript" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 103, "commitCount": 1133, "sampleCount": 38, "example": [ "alert(\"dude!\")" ], "url": "https://github.com/atom/language-javascript" }, "projectEuler": { "memberCount": { "2019": 1818, "2022": 2478 }, "id": "ECMAScript" }, "helloWorldCollection": [ "// Hello world in JavaScript\nconsole.log(\"Hello World\");" ], "leachim6": { "filepath": "j/JavaScript.js", "fileExtensions": [ "js" ], "example": [ "console.log(\"Hello World\");\n" ], "id": "JavaScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:JavaScript", "quineRelay": "JavaScript", "rijuRepl": { "example": [ "console.log(\"Hello, world!\");\n" ], "id": "https://riju.codes/javascript" }, "replit": "https://repl.it/languages/javascript", "indeedJobs": { "2017": 25726, "query": "javascript developer" }, "linkedInSkill": { "2018": 3826705, "id": "javascript" }, "stackOverflowSurvey": { "2021": { "users": 53587, "medianSalary": 54049, "fans": 37008, "percentageUsing": 0.64 } }, "annualReportsUrl": [ "https://stateofjs.com/en-us/" ], "subreddit": [ { "memberCount": { "2017": 156874, "2022": 2113371 }, "url": "https://reddit.com/r/javascript" } ], "meetup": { "memberCount": 3151948, "groupCount": 5270, "url": "https://www.meetup.com/topics/javascript" }, "tiobe": { "currentRank": 6, "id": "JavaScript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2133", "pypl": "JavaScript", "packageRepository": [ "http://npmjs.org" ], "ubuntuPackage": "nodejs", "jupyterKernel": [ "https://github.com/n-riesco/ijavascript" ], "fileType": "text", "wordRank": 3002, "isOpenSource": true, "githubCopilotOptimized": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nEloquent JavaScript: A Modern Introduction to Programming|2010|Marijn Haverbeke|13787033|4.12|1721|141\nProfessional JavaScript for Web Developers|2005|Nicholas C. Zakas|130520|4.14|559|31", "isbndb": "year|publisher|title|authors|isbn13\n2014|Wiley|JavaScript and JQuery: Interactive Front-End Web Development|Duckett, Jon|9781118531648\n2010|Pearson|JavaScript by Example|Quigley, Ellie|9780137054893\n2005|McGraw Hill|JavaScript Demystified|Keogh, Jim|9780072261349\n2007|SitePoint|Simply JavaScript: Everything You Need to Learn JavaScript From Scratch|Yank, Kevin and Adams, Cameron|9780980285802\n2009|Prentice Hall|JavaScript for Programmers|Deitel, Paul J.|9780137001316\n2013|Manning|Secrets of the JavaScript Ninja|John Resig and Bear Bibeault|9781933988696\n2012|Addison-Wesley Professional|Effective JavaScript: 68 Specific Ways to Harness the Power of JavaScript (Effective Software Development Series)|Herman, David|9780321812186\n2008|O'Reilly Media|Head First JavaScript|Morrison, Michael|9780596527747\n2004|Prentice Hall|Mastering the Internet, Xhtml, and Javascript|Zeid, Ibrahim|9780131400863\n2018|Jones & Bartlett Learning|Web Programming with HTML5, CSS, and JavaScript|Dean, John|9781284091793\n2017|Jones And Bartlett Learning,|Web Programming With Html5, Css, And Javascript|Dean, John , 1962- (author.)|9781284091793\n2018|Independently published|Composing Software: An Exploration of Functional Programming and Object Composition in JavaScript|Elliott, Eric|9781661212568\n2014|Wiley|JavaScript and jQuery: Interactive Front-End Web Development|Duckett, Jon|9781118871652\n2009|Wrox|Beginning JavaScript|Wilton, Paul and McPeak, Jeremy|9780470525937\n2013|For Dummies|PHP, MySQL, JavaScript & HTML5 All-in-One For Dummies|Suehring, Steve and Valade, Janet|9781118213704\n2014|O'Reilly Media|Web Development with Node and Express: Leveraging the JavaScript Stack|Brown, Ethan|9781491949306\n2015|O'Reilly Media|JavaScript Cookbook: Programming the Web|Powers, Shelley|9781491901885\n2012|Sams Publishing|JavaScript in 24 Hours, Sams Teach Yourself (5th Edition)|Ballard, Phil|9780672336089\n2003|McGraw-Hill Education|How to Do Everything with JavaScript|Duffy, Scott|9780072228878\n2000|Wiley|Introduction to Interactive Programming on the Internet: Using HTML and JavaScript|Knuckles, Craig D.|9780471383666\n2005|Cengage Learning|HTML and JavaScript BASICS (BASICS Series)|Barksdale, Karl and Turner, E. Shane|9780619266257\n2010|Apress|Pro JavaScript with MooTools (Expert's Voice in Web Development)|Obcena, Mark|9781430230540\n2017|Sams Publishing|PHP, MySQL & JavaScript All in One, Sams Teach Yourself|Meloni, Julie|9780672337703\n2009|For Dummies|JavaScript & Ajax for Dummies|Harris, Andy|9780470417997\n2001|Crisp Pub Inc|Course ILT: Javascript Programming|Technology, Course|9780619068059\n2014|O'Reilly Media|Programming JavaScript Applications: Robust Web Architecture with Node, HTML5, and Modern JS Libraries|Elliott, Eric|9781491950296\n2016|Packt Publishing|Mastering JavaScript|Antani, Ved|9781785281341\n2007|Course Technology|JavaScript|Gosselin, Don|9781423901501\n2009|Wrox|Professional JavaScript Frameworks: Prototype,YUI, ExtJS, Dojo and MooTools|Orchard, Leslie M. and Pehlivanian, Ara and Koon, Scott and Jones, Harley|9780470384596\n2016|Packt Publishing|Mastering JavaScript Object-Oriented Programming|Chiarelli, Andrea|9781785889103\n2008|AddisonWesley Professional|Dojo: Using the Dojo JavaScript Library to Build Ajax Applications|Harmon, James E.|9780132358040\n2010|Apress|JavaScript for Absolute Beginners|McNavage, Terry|9781430272199\n2003|Course Technology PTR|Learn JavaScript In a Weekend, Second Edition|Ford, Jr., Jerry Lee|9781592000869\n2002|Cengage Learning PTR|JavaScript Programming for the Absolute Beginner|Harris, Andy|9780761534105\n2020|Addison-Wesley Professional|Modern JavaScript for the Impatient|Horstmann, Cay|9780136502142\n2012|O'Reilly Media|HTML5 and JavaScript Web Apps: Bridging the Gap Between the Web and the Mobile Web|Hales, Wesley|9781449320515\n2008|Adobe Developer Library|AIR for Javascript Developers Pocket Guide: Getting Started with Adobe AIR|Chambers, Mike and Dura, Daniel and Dura, Daniel and Hoyt, Kevin and Hoyt, Kevin and Georgita, Dragos|9780596518370\n2011|O'Reilly Media|Programming HTML5 Applications: Building Powerful Cross-Platform Environments in JavaScript|Kessin, Zachary|9781449399085\n2001|Sams|Pure JavaScript (2nd Edition)|R. Allen Wyke and Charlton Ting and Jason D. Gilliam and Sean Michaels|9780672321412\n2012|Packt Publishing|Getting Started with Meteor.js JavaScript Framework|Strack, Isaac|9781782160823\n20170302|Independent Publishers Group (Chicago Review Press)|JavaScript: Optimizing Native JavaScript|Robert C. Etheredge|9780986307652\n2007|Adobe Developer Library|Adobe Integrated Runtime (AIR) for JavaScript Developers Pocket Guide (Adobe Developer Library)|Chambers, Mike and Dura, Daniel and Hoyt, Kevin|9780596515195\n2011|friends of ED|Foundation HTML5 Animation with JavaScript|Lamberta, Billy and Peters, Keith|9781430236658\n2014|Apress|Scripting in Java: Integrating with Groovy and JavaScript|Sharan, Kishori|9781484207147\n2008|Pragmatic Bookshelf|Mastering Dojo: Javascript and Ajax Tools for Great Web Experiences (Pragmatic Programmers)|Riecke, Craig and Gill, Rawld and Russell, Alex|9781934356111\n2000|Sams|Javascript Unleashed||9780672317637\n2008|Apress|Foundation Website Creation with CSS, XHTML, and JavaScript|Jonathan Lane and Meitar Moscovitz and Joseph R. Lewis|9781430209911\n2017|Packt Publishing|Internet of Things Programming with JavaScript|Ramos, Ruben Oliva|9781785888564\n20180509|O'Reilly Media, Inc.|Learning PHP, MySQL & JavaScript|Robin Nixon|9781491979099\n1999|Sams|Sams Teach Yourself Javascript 1.3 in 24 Hours (Teach Yourself in 24 Hours)|Moncur, Michael|9780672314070\n2011|O'Reilly Media|Learning the iOS 4 SDK for JavaScript Programmers: Create Native Apps with Objective-C and Xcode|Goodman, Danny|9781449388454\n1999|Apress|Professional JavaScript with DHTML, ASP, CGI, FESI, Netscape Enterprise Server, Windows Script Host, LiveConnect and Java|Chirelli, Andrea and Li, Sing and Wilton, Paul and McFarlane, Nigel and Updegrave, Stuart and Wilcox, Mark and Wootton, Cliff and McFarlane, Nigel and James De Carli|9781861002709\n2000|Wrox|Beginning JavaScript (Programmer to Programmer)|Wilton, Paul|9780764544057\n2013|O'Reilly Media|DOM Enlightenment: Exploring JavaScript and the Modern DOM|Lindley, Cody|9781449342845\n20140328|O'Reilly Media, Inc.|Client-Server Web Apps with JavaScript and Java|Casimir Saternos|9781449369316\n2012|Apress|Learn HTML5 and JavaScript for iOS: Web Standards-based Apps for iPhone, iPad, and iPod touch|Preston, Scott|9781430240389\n2002|Prentice Hall PTR|Essential JavaScript for Web Professionals (2nd Edition)|Barrett, Dan and Brown, Micah and Lifingston, Dan|9780131001473\n2018|Pragmatic Bookshelf|3D Game Programming for Kids: Create Interactive Worlds with JavaScript|Strom, Chris|9781680502701\n1997|Peachpit Pr|Javascript for the World Wide Web (Visual QuickStart Guide)|Gesing, Ted and Schneider, Jeremy|9780201688146\n1997|Apress|Instant Javascript|McFarlane, Nigel and McFarlane|9781861001276\n2005|Adobe Pr|Adobe Illustrator Cs2 Official Javascript Reference|Adobe Systems|9780321412942\n2005|Adobe Pr|Adobe Golive Cs2 Official Javascript Reference|Adobe Systems|9780321409713\n2013|O'Reilly Media|JavaScript Testing with Jasmine: JavaScript Behavior-Driven Development|Hahn, Evan|9781449356378\n2004|McGraw-Hill|Teach Yourself Javascript|McBride, Mac|9780071435048\n2020|Packt Publishing|Mastering JavaScript Functional Programming: Write clean, robust, and maintainable web and server code using functional JavaScript, 2nd Edition|Kereki, Federico|9781839213069\n2001|Que Pub|Special Edition Using Javascript|McFedries, Paul|9780789725769\n2016|Packt Publishing|JavaScript Projects for Kids|Towaha, Syed Omar Faruk|9781785287176\n2014|Packt Publishing|Mastering JavaScript Design Patterns|Timms, Simon|9781783987986\n2016|CreateSpace Independent Publishing Platform|TypeScript: JavaScript Development Guide|Brown, Nicholas|9781539124771\n2011|Apress|HTML5 and JavaScript Projects (Expert's Voice in Web Development)|Meyer, Jeanine|9781430240327\n2012|Posts and Telecom Press|JavaScript Efficient Graphical Programming (Chinese Edition)|[Mei]RaffaeleCecco|9787115278814\n2020|BPB Publications|JavaScript for Modern Web Development: Building a Web Application Using HTML, CSS, and JavaScript (English Edition)|Ranjan, Alok and Sinha, Abhilasha and Battewad, Ranjit|9789389328721\n2017|Springer Nature|Beginning Functional JavaScript|Anto Aravinth|9781484226568\n1996|Hayden Books|Javascript for Macintosh|Shobe, Matt and Ritchey, Tim|9781568302782\n2015|Packt Publishing|Reactive Programming with JavaScript|Hayward, Jonathan|9781783558551\n2002|Sams Publishing|JavaScript Unleashed (4th Edition)|Wyke, R. Allen and Gilliam, Jason|9780672324314\n2020|Manning Publications|The Joy of JavaScript|Atencio, Luis|9781617295867\n2001|Wiley, John & Sons, Incorporated|Mastering Javascript Premium Edition|James Jaworski and Jamie Jaworski|9780782128192\n2012|O'Reilly Media|Node: Up and Running: Scalable Server-Side Code with JavaScript|Hughes-Croucher, Tom and Wilson, Mike|9781449398583\n2009|Packt Publishing|Drupal 6 JavaScript and jQuery|Butcher, Matt|9781847196163\n20140918|O'Reilly Media, Inc.|JavaScript & jQuery: The Missing Manual|David Sawyer McFarland|9781491948620\n1996|Ziff Davis|JavaScript 2.1 Manual of Style|Mark Johnson|9781562764234\n2011|Apress|Pro iOS Web Design and Development: HTML5, CSS3, and JavaScript with Safari|Picchi, Andrea and Willat, Carl|9781430232469\n2014|Apress|Pro TypeScript: Application-Scale JavaScript Development|Fenton, Steve|9781430267904\n2012|Apress|Pro Windows 8 Development with HTML5 and JavaScript (Expert's Voice in Microsoft)|Freeman, Adam|9781430244011\n2009|Sams|Sams Teach Yourself JavaScript and Ajax: Video Learning Starter Kit|Sams Publishing|9780672330377\n1996|New Riders|Inside Javascript|New Riders and Jill Bond|9780737215748\n2015|Pragmatic Bookshelf|Reactive Programming with RxJS: Untangle Your Asynchronous JavaScript Code|Mansilla, Sergi|9781680501292\n2019|Apress|JavaScript Frameworks for Modern Web Development: The Essential Frameworks, Libraries, and Tools to Learn Right Now|bin Uzayr, Sufyan and Cloud, Nicholas and Ambler, Tim|9781484249956\n2000|Charles River Media|Javascript CD Cookbook|Monroe, J Brook and Sadun, Erica|9781584500209\n2011|Packt Publishing|iPhone JavaScript Cookbook|Fernandez Montoro, Arturo|9781849691086\n2017|CreateSpace Independent Publishing Platform|Computer Programming: 6 Books in 1: Beginner's Guide + Best Practices to Programming Code with Python, JavaScript and Java|Masterson, Charlie|9781548828547\n2004|Unknown|An Introduction to Programming Using JavaScript (M150 Data, Computing and Information)||9780749257644\n1996|Wiley|JavaScript Sourcebook: Create Interactive JavaScript Programs for the World Wide Web|McComb, Gordon|9780471161851\n29-06-2016|Packt Publishing|Mastering JavaScript Design Patterns|Simon Timms|9781785880353\n2003|Apress|Practical Javascript for the Usable Web|Wilton, Paul and Williams, Stephen and Li, Sing|9781590591895\n2009|Prentice Hall Ptr|Javascript Fundamentals I And Ii Livelessons Bundle|Paul J. Deitel|9780137018253\n20061130|O'Reilly Media, Inc.|Prototype and Scriptaculous: Taking the Pain out of JavaScript|Chris Angus|9780596529192\n2019|Independently Published|Javascript|Ryan Turner|9781697517811\n20181114|Springer Nature|Full Stack JavaScript|Azat Mardan|9781484237182\n1998|McGraw-Hill Osborne Media|Javascript Annotated Archives|Frentzen, Jeff and Sobotka, Henry and McNair, Dewayne|9780078823640\n20180215|Springer Nature|Objektorientierte Programmierung mit JavaScript|Jörg Bewersdorff|9783658210779\n2015|Apress|JavaScript Quick Syntax Reference|Olsson, Mikael|9781430264941\n42726|Packt Publishing|TypeScript: Modern JavaScript Development|Remo H. Jansen|9781787287594\n2011|Apress|Pro JavaScript with MooTools: Laerning Advanced JavaScript Programming (Expert's Voice in Web Development)|Obcena, Mark|9781430230557\n2003|Adobe Pr|Extending Acrobat Forms With Javascript|Deubert, John|9780321172389\n20120113|Springer Nature|Foundation HTML5 Animation with JavaScript|Billy Lamberta; Keith Peters|9781430236665\n20120808|Springer Nature|Pro JavaScript for Web Apps|Adam Freeman|9781430244622\n2015|Apress|JavaScript Frameworks for Modern Web Dev|Ambler, Tim and Cloud, Nicholas|9781484206621\n2013|Apress|Expert JavaScript (Expert's Voice in Web Development)|Daggett, Mark E.|9781430260981\n2014|O'Reilly Media|Building Web Apps with Ember.js: Write Ambitious JavaScript|Cravens, Jesse and Brady, Thomas Q|9781449370923\n20140804|Pearson Education (US)|Introduction to JavaScript Programming with XML and PHP|Elizabeth Drake|9780133560107\n20150630|Packt Publishing|Getting Started with Meteor.js JavaScript Framework - Second Edition|Isaac Strack|9781785282270\n2011|Apress|Beginning iPhone and iPad Web Apps: Scripting with HTML5, CSS3, and JavaScript|Apers, Chris and Daniel Paterson|9781430230465\n2014|Apress|Beginning JavaScript Charts: With jqPlot, d3, and Highcharts (Expert's Voice in Web Development)|Nelli, Fabio|9781430262909\n2011|Apress|The Essential Guide to HTML5: Using Games to learn HTML5 and JavaScript (Essential Guide To...)|Meyer, Jeanine|9781430233848\n2013|Apress|Beginning Windows Store Application Development: HTML and JavaScript Edition (The Expert's Voice in Windows 8)|Isaacs, Scott and Burns, Kyle|9781430257806\n2020-11-10T00:00:01Z|Drip Digital|Learn JavaScript Quickly: A Complete Beginner’s Guide to Learning JavaScript, Even If You’re New to Programming (Crash Course With Hands-On Project)|Quickly, Code|9781951791476\n2014|O'Reilly Media|Head First JavaScript Programming: A Brain-Friendly Guide|Eric Freeman and Robson, Elisabeth|9781449340131\n2014|No Starch Press|JavaScript for Kids: A Playful Introduction to Programming|Morgan, Nick|9781593274085\n2019|O'Reilly Media|Programming TypeScript: Making Your JavaScript Applications Scale|Cherny, Boris|9781492037651\n2020|Addison-Wesley Professional|Modern JavaScript for the Impatient|Horstmann, Cay S.|9780136502159\n2012|Wrox|Professional JavaScript for Web Developers|Zakas, Nicholas C.|9781118026694\n2021|Packt Publishing|Interactive Dashboards and Data Apps with Plotly and Dash: Harness the power of a fully fledged frontend web framework in Python – no JavaScript required|Dabbas, Elias|9781800568914\n2014|No Starch Press|The Principles of Object-Oriented JavaScript|Zakas, Nicholas C.|9781593275402\n2010|O'Reilly Media|JavaScript Patterns: Build Better Applications with Coding and Design Patterns|Stefanov, Stoyan|9780596806750\n2014|O'Reilly Media|Head First JavaScript Programming: A Brain-Friendly Guide|Freeman, Eric and Robson, Elisabeth|9781449343965\n2012|O'Reilly Media|JavaScript Pocket Reference: Activate Your Web Pages (Pocket Reference (O'Reilly))|Flanagan, David|9781449316853\n2016|Que Publishing|JavaScript Absolute Beginner's Guide|Chinnathambi Kirupa|9780134498621\n2016|Manning Publications|Functional Programming in JavaScript: How to improve your JavaScript programs using functional techniques|Atencio, Luis|9781617292828\n2021|Packt Publishing|JavaScript from Beginner to Professional: Learn JavaScript quickly by building fun, interactive, and dynamic web apps, games, and pages|Svekis, Laurence Lars and Putten, Maaike van and Percival, Rob|9781800566774\n2020|Packt Publishing|Mastering JavaScript Functional Programming: Write clean, robust, and maintainable web and server code using functional JavaScript, 2nd Edition|Kereki, Federico|9781839217425\n2022|The MIT Press|Structure and Interpretation of Computer Programs: JavaScript Edition (MIT Electrical Engineering and Computer Science)|Abelson, Harold and Sussman, Gerald Jay|9780262367622\n2019|Candlewick|Get Coding 2! Build Five Computer Games Using HTML and JavaScript|Whitney, David|9781536210309\n2012|Addison-Wesley Professional|Effective JavaScript (Effective Software Development Series)|Herman, David|9780132902250\n2020|Independently published|Coding for Kids Ages 9-15: Simple HTML, CSS and JavaScript lessons to get you started with Programming from Scratch|Mather, Bob|9798644382446\n2010|Wiley|Learn JavaScript and Ajax with w3Schools|W3Schools and Refsnes, Hege and Refsnes, Stale and Refsnes, Kai Jim and Refsnes, Jan Egil|9780470611944\n2010|Pearson|JavaScript by Example|Quigley, Ellie|9780137084760\n2017-04-18T00:00:01Z|Maia LLC|Programming Fundamentals in JavaScript|Barzee, Rex A.|9780996246330\n2017|Make Community, LLC|Making Things Smart: Easy Embedded JavaScript Programming for Making Everyday Objects into Intelligent Machines|Williams, Gordon F.|9781680451894\n2020|Packt Publishing|Clean Code in JavaScript: Develop reliable, maintainable, and robust JavaScript|Padolsey, James|9781789957297\n2014|O'Reilly Media|JavaScript & jQuery: The Missing Manual (Missing Manuals)|McFarland, David Sawyer|9781491947074\n2014|O'Reilly Media|Learning Web App Development: Build Quickly with Proven JavaScript Techniques|Purewal, Semmy|9781449370190\n2019|Apress|Beginning Ethereum Smart Contracts Programming: With Examples in Python, Solidity, and JavaScript|Lee, Wei-Meng|9781484250860\n2019|Pearson|\"Introduction to JavaScript Programming The \"\"Nothing but a Browser\"\" Approach\"|Roberts, Eric|9780135245859\n2017|CreateSpace Independent Publishing Platform|Functional-Light JavaScript: Balanced, Pragmatic FP in JavaScript|Simpson, Kyle|9781981672349\n2019|Wrox|Professional JavaScript for Web Developers|Frisbie, Matt|9781119366577\n2013|Manning|Single Page Web Applications: JavaScript end-to-end|Mikowski, Michael and Powell, Josh|9781638351344\n2014|Microsoft Press|Exam Ref 70-480 Programming in HTML5 with JavaScript and CSS3 (MCSD)|Delorme, Rick|9780735676633\n2018|Apress|Learn JavaScript with p5.js: Coding for Visual Learners|Arslan, Engin|9781484234266\n2017|Apress|Introducing JavaScript Game Development: Build a 2D Game from the Ground Up|Stuart, Graeme|9781484232521\n2021|Apress|Beginning Machine Learning in the Browser: Quick-start Guide to Gait Analysis with JavaScript and TensorFlow.js|Suryadevara, Nagender Kumar|9781484268421\n2014|No Starch Press|JavaScript for Kids: A Playful Introduction to Programming|Morgan, Nick|9781593276591\n2011|O'Reilly Media|Head First HTML5 Programming: Building Web Apps with JavaScript|Freeman, Eric and Robson, Elisabeth|9781449390549\n2013|Addison-Wesley Professional|Web Game Developer's Cookbook, The: Using JavaScript and HTML5 to Develop Games (Game Design)|Burchard, Evan|9780133358674\n2016|Addison-Wesley Professional|Learning Node.js: A Hands-On Guide to Building Web Applications in JavaScript|Wandschneider, Marc|9780134663722\n2015|Packt Publishing|Mastering JavaScript Promises|Hussain, Muzzamil|9781783985500\n2019|Apress|JavaScript Data Structures and Algorithms: An Introduction to Understanding and Implementing Core Data Structure and Algorithm Fundamentals|Bae, Sammie|9781484239889\n2018|Sams Publishing|JavaScript in 24 Hours, Sams Teach Yourself|Ballard, Phil|9780135166956\n2017|Sams Publishing|PHP, MySQL & JavaScript All in One, Sams Teach Yourself|Meloni Julie C.|9780134439587\n2014|Sams Publishing|HTML, CSS and JavaScript All in One, Sams Teach Yourself: Covering HTML5, CSS3, and jQuery|Meloni, Julie C.|9780133795189\n2016|No Starch Press|Understanding ECMAScript 6: The Definitive Guide for JavaScript Developers|Zakas, Nicholas C.|9781593277987\n2020|Packt Publishing|Hands-On JavaScript High Performance: Build faster web apps using Node.js, Svelte.js, and WebAssembly|Scherer, Justin|9781838825867\n2019|Independently published|JavaScript Grammar|Sidelnikov, Greg|9781091212169\n2013-04-08T00:00:01Z|Microsoft Press|Training Guide: Programming in HTML5 with JavaScript and CSS3 (Microsoft Press Training Guide)|Johnson, Glenn|9780735674387\n1997|IDG Books Worldwide|JavaScript for Dummies, 2nd Edition|Emily A. Vander Veer|9780764502231\n2011|O'Reilly Media|JavaScript & jQuery: The Missing Manual|McFarland, David Sawyer|9781449399023\n2020|Black and White Line Ltd|JavaScript for beginners: The simplified for absolute beginner's guide to learn and understand computer programming coding with JavaScript step by step. Basics concepts and practice examples inside.|Python, Matthew|9781801257534\n2018|Packt Publishing|Learning JavaScript Data Structures and Algorithms: Write complex and powerful JavaScript code using the latest ECMAScript, 3rd Edition|Groner, Loiane|9781788624947\n2021|Ladoo Publishing LLC|Javascript: This book includes: Javascript Basics For Beginners + Javascript Front End Programming + Javascript Back End Programming|Vickler, Andy|9781955786010\n2012-12-11T00:00:01Z|Mike Murach & Associates|Murach's JavaScript and jQuery|Zak Ruvalcaba and Mike Murach|9781890774707\n2018|Manning Publications|JavaScript on Things: Hacking hardware for web developers|Gardner, Lyza Danger|9781617293863\n2020|Apress|Essential ASP.NET Web Forms Development: Full Stack Programming with C#, SQL, Ajax, and JavaScript|Beasley, Robert E.|9781484257845\n2017|Apress|Enhancing Adobe Acrobat DC Forms with JavaScript|Harder, Jennifer|9781484228937\n2019|Que Publishing|JavaScript Absolute Beginner's Guide|Chinnathambi, Kirupa|9780136204350\n2013|Pragmatic Bookshelf|Node.js the Right Way: Practical, Server-Side JavaScript That Scales|Wilson, Jim|9781937785734\n2011|O'Reilly Media|Head First HTML5 Programming: Building Web Apps with JavaScript|Robson, Elisabeth and Freeman, Eric|9781449319366\n2014|Packt Publishing|Learning JavaScript Data Structures and Algorithms|Groner, Loiane|9781783554874\n2021|Apress|Decoupled Django: Understand and Build Decoupled Django Architectures for JavaScript Front-ends|Gagliardi, Valentino|9781484271445\n2019-04-14T00:00:01Z|Independently published|JavaScript Programming: A Step-by-Step Guide for Absolute Beginners|Brian Jenkins|9781093985948\n2016|Apress|Making Games: With JavaScript|Pitt, Christopher|9781484224939\n2017|Packt Publishing|Mastering JavaScript Functional Programming: In-depth guide for writing robust and maintainable JavaScript code in ES8 and beyond|Kereki, Federico|9781787289734\n2013|Pragmatic Bookshelf|3D Game Programming for Kids: Create Interactive Worlds with JavaScript (Pragmatic Programmers)|Strom, Chris|9781937785444\n2018|Packt Publishing|Learn Blockchain Programming with JavaScript: Build your very own Blockchain and decentralized network with JavaScript and Node.js|Traub, Eric|9781789618822\n2013|O'Reilly Media|JavaScript Enlightenment: From Library User to JavaScript Developer|Lindley, Cody|9781449342883\n2015|No Starch Press|Build an HTML5 Game: A Developer's Guide with CSS and JavaScript|Bunyan, Karl|9781593275754\n2012|Apress|Foundation Game Design with HTML5 and JavaScript|van der Spuy, Rex|9781430247166\n2010|Cengage Learning|HTML and JavaScript BASICS|Barksdale, Karl and Turner, E. Shane|9780538742351\n2019|Packt Publishing|Advanced JavaScript: Speed up web development with the powerful features and benefits of JavaScript|Shute, Zachary|9781789803891\n2021|O'Reilly Media|JavaScript Cookbook: Programming the Web|Scott, Adam D. and MacDonald, Matthew and Powers, Shelley|9781492055754\n2018|Packt Publishing|Learn Blockchain Programming with JavaScript: Build your very own Blockchain and decentralized network with JavaScript and Node.js|Traub, Eric|9781789614848\n2013|Apress|Foundation Game Design with HTML5 and JavaScript|van der Spuy, Rex|9781430247173\n2022|Pragmatic Bookshelf|Programming Phoenix LiveView: Interactive Elixir Web Programming Without Writing Any JavaScript|Tate, Bruce A. and DeBenedetto, Sophie|9781680508215\n2019|Packt Publishing|The JavaScript Workshop: Learn to develop interactive web applications with clean and maintainable JavaScript code|Labrecque, Joseph and Love, Jahred and Rosenbaum, Daniel and Turner, Nick and Mehla, Gaurav and Hosford, Alonzo L. and Sloot, Florian and Kirkbride, Philip|9781838645885\n2015|Sams Publishing|JavaScript in 24 Hours, Sams Teach Yourself|Ballard Phil|9780134172170\n2013|Pearson|Introduction to JavaScript Programming with XML and PHP|Drake, Elizabeth|9780133068306\n2020|Apress|Essential ASP.NET Web Forms Development: Full Stack Programming with C#, SQL, Ajax, and JavaScript|Beasley, Robert E.|9781484257838\n2017|Packt Publishing|Object-Oriented JavaScript: Learn everything you need to know about object-oriented JavaScript (OOJS)|Antani, Ved and Stefanov, Stoyan|9781785884719\n2014-05-06T00:00:00.000Z|McGraw-Hill Education TAB|Programming the BeagleBone Black: Getting Started with JavaScript and BoneScript|Monk, Simon|9780071832120\n2007|Apress|Pro JavaScript Design Patterns: The Essentials of Object-Oriented JavaScript Programming|Diaz, Dustin and Harmes, Ross|9781590599082\n2017-11-29T00:00:01Z|Packt Publishing|Mastering JavaScript Functional Programming: In-depth guide for writing robust and maintainable JavaScript code in ES8 and beyond|Kereki, Federico|9781787287440\n2013|Pearson|Introduction to JavaScript Programming with XML and PHP (2-downloads)|Drake, Elizabeth|9780133251821\n2012|Sams Publishing|Sams Teach Yourself JavaScript in 24 Hours|Ballard, Phil and Moncur, Michael|9780133048315\n2016|Packt Publishing|Learning JavaScript Data Structures and Algorithms: Hone your skills by learning classic data structures and algorithms in JavaScript, 2nd Edition|Groner, Loiane|9781783553884\n2021|Packt Publishing|End-to-End Web Testing with Cypress: Explore techniques for automated frontend web testing with Cypress and JavaScript|Mwaura, Waweru|9781839215636\n2016|Manning Publications|Get Programming with JavaScript|Larsen, John|9781617293108\n2013|Microsoft Press|Training Guide Programming in HTML5 with JavaScript and CSS3 (MCSD) (Microsoft Press Training Guide)|Johnson, Glenn|9780735674349\n2018|Pragmatic Bookshelf|Node.js 8 the Right Way: Practical, Server-Side JavaScript That Scales|Wilson, Jim|9781680501957\n2018|Packt Publishing|Beginning API Development with Node.js: Build highly scalable, developer-friendly APIs for the modern web with JavaScript and Node.js|Nandaa, Anthony|9781789534177\n2016|CreateSpace Independent Publishing Platform|Programming: Computer Programming For Beginners: Learn The Basics Of HTML5, JavaScript & CSS (Coding, C Programming, Java Programming, Web Design, JavaScript, Python, HTML and CSS)|Connor, Joseph|9781541006225\n2016-06-22T00:00:01Z|CreateSpace Independent Publishing Platform|JavaScript: Learn JavaScript in 24 Hours or Less - A Beginner’s Guide To Learning JavaScript Programming Now (JavaScript, JavaScript Programming)|Dwight, Robert|9781534821859\n2014|Apress|Building JavaScript Games: for Phones, Tablets, and Desktop|Egges, Arjan|9781430265399\n2021|Microsoft Press|Begin to Code with JavaScript|Miles, Rob|9780136870630\n2014|O'Reilly Media|Test-Driven Development with Python: Obey the Testing Goat: Using Django, Selenium, and JavaScript|Percival, Harry|9781449364823\n2015|Apress|Advanced Game Design with HTML5 and JavaScript|van der Spuy, Rex|9781430258018\n2019|Packt Publishing|Advanced TypeScript Programming Projects: Build 9 different apps with TypeScript 3 and JavaScript frameworks such as Angular, React, and Vue|O'Hanlon, Peter|9781788991018\n2016|Packt Publishing|Mastering JavaScript Object-Oriented Programming|Chiarelli, Andrea|9781785888267\n2018|Apress|HTML5 and JavaScript Projects: Build on your Basic Knowledge of HTML5 and JavaScript to Create Substantial HTML5 Applications|Meyer, Jeanine|9781484238639\n2012|Wrox|Professional Node.js: Building Javascript Based Scalable Software|Teixeira, Pedro|9781118185469\n2014|Apress|Physics for JavaScript Games, Animation, and Simulations: with HTML5 Canvas|Dobre, Adrian and Ramtal, Dev|9781430263371\n2017|Packt Publishing|Object-Oriented JavaScript: Learn everything you need to know about object-oriented JavaScript (OOJS), 3rd Edition|Antani, Ved and Stefanov, Stoyan|9781785880568\n2011|Cengage Learning|Principles of Program Design: Problem-Solving with JavaScript (Logic and Design)|Addison, Paul|9781133387299\n2019-05-04T00:00:01Z|Independently published|Discover Functional JavaScript: An overview of Functional and Object Oriented Programming in JavaScript|Salcescu, Cristian|9781095338780\n2013|O'Reilly Media|Developing Backbone.js Applications: Building Better JavaScript Applications|Osmani, Addy|9781449328252\n2017|Apress|Pro TypeScript: Application-Scale JavaScript Development|Fenton, Steve|9781484232491\n2015|Make Community, LLC|JavaScript Robotics: Building NodeBots with Johnny-Five, Raspberry Pi, Arduino, and BeagleBone (Make)|Media, Backstop and Waldron, Rick|9781457186950\n2020|Packt Publishing|Hands-on JavaScript for Python Developers: Leverage your Python knowledge to quickly learn JavaScript and advance your web development career|Nagale, Sonyl|9781838641047\n2012|Wiley|Smashing Node.js: JavaScript Everywhere|Rauch, Guillermo|9781119962595\n2008|Packt Publishing|Object-Oriented JavaScript: Create scalable, reusable high-quality JavaScript applications and libraries|Stefanov, Stoyan|9781847194145\n2019|Apress|Beginning JavaScript: The Ultimate Guide to Modern JavaScript Development|Ferguson, Russ|9781484243954\n2014|Apress|Physics for JavaScript Games, Animation, and Simulations: with HTML5 Canvas|Dobre, Adrian and Ramtal, Dev|9781430263388\n2005|McGraw-Hill Education|JavaScript Demystified|Keogh, Jim|9780071471398\n2009|O'Reilly Media|Learning PHP, MySQL, and Javascript (Animal Guide)|Robin Nixon|9780596157135\n2015|Packt Publishing|Learning Three.js – the JavaScript 3D Library for WebGL - Second Edition: Create stunning 3D graphics in your browser using the Three.js JavaScript library|Dirksen, Jos|9781784391027\n2001|Que Pub|Javascript 1.5 by Example|Kingsley-Hughes, Adrian and Kingsley-Hughes, Kathie|9780789724991\n2012|McGraw-Hill Education|JavaScript The Complete Reference 3rd Edition|Powell, Thomas A. and Schneider, Fritz|9780071741217\n2015|CreateSpace Independent Publishing Platform|Javascript: Learn Javascript In A DAY! - The Ultimate Crash Course to Learning the Basics of the Javascript Programming Language In No Time ... Javascript Course, Javascript Development)|Acodemy|9781507587140\n2015|Packt Publishing|JavaScript Unlocked|Sheiko, Dmitry|9781785885068\n2021|Packt Publishing|Deno Web Development: Write, test, maintain, and deploy JavaScript and TypeScript web applications using Deno|Santos, Alexandre Portela dos|9781800201149\n2017|CreateSpace Independent Publishing Platform|Computer Programming For Beginners: Learn The Basics of Java, SQL, C, C++, C#, Python, HTML, CSS and Javascript|Alvin, Cooper|9781981497805\n2016-11-04T00:00:01Z|CreateSpace Independent Publishing Platform|JAVASCRIPT: Easy JavaScript Programming For Beginners. Your Step-By-Step Guide to Learning JavaScript Programming (JavaScript Series)|Alvaro, Felix|9781539929185\n2013|For Dummies|HTML5 Programming with JavaScript For Dummies|Mueller, John Paul|9781118431665\n2010|O'Reilly Media|JavaScript Cookbook|Powers, Shelley|9780596806132\n2015|Packt Publishing|JavaScript Concurrency|Boduch, Adam|9781785889233\n2017|Apress|Building Web Applications with Visual Studio 2017: Using .NET Core and Modern JavaScript Frameworks|Japikse, Philip and Kevin Grossnicklaus and Ben Dewey|9781484224786\n2021|Dr. Lucas J. Loan|JavaScript Crash Course: The Only Guide to Quickly Learn JavaScript, the Most Used Programming Language||9781801567824\n2021|Independently published|Javascript: This book includes : Javascript Basics For Beginners + Javascript Front End Programming + Javascript Back End Programming|Vickler, Andy|9798718960556\n2002|O'Reilly Media|JavaScript Pocket Reference (2nd Edition)|Flanagan, David|9780596004118\n2018|Packt Publishing|D3.js Quick Start Guide: Create amazing, interactive visualizations in the browser with JavaScript|Huntington, Matthew|9781789347746\n2019|Apress|Building Web Applications with .NET Core 2.1 and JavaScript: Leveraging Modern JavaScript Frameworks|Japikse, Philip and Grossnicklaus, Kevin and Dewey, Ben|9781484253526\n2009|Jones & Bartlett Learning|The JavaScript Programming Language|Toal, Ray and Dionisio, John David|9780763766580\n2019|Packt Publishing|Advanced TypeScript Programming Projects: Build 9 different apps with TypeScript 3 and JavaScript frameworks such as Angular, React, and Vue|O'Hanlon, Peter|9781789133042\n2010|Wrox|JavaScript 24-Hour Trainer|McPeak, Jeremy|9780470647837\n2010|O'Reilly Media|Closure: The Definitive Guide: Google Tools to Add Power to Your JavaScript|Bolin, Michael|9781449381875\n2017|Packt Publishing|JavaScript by Example: Learn modern web development with real-world applications|S, Dani Akash|9781788299008\n2010|Peachpit Press|The JavaScript Pocket Guide (Peachpit Pocket Guide)|Burdette, Lenny|9780321700957\n2013|Packt Publishing|JavaScript and JSON Essentials|Sriparasa, Sai Srinivas|9781783286041\n2002|Wiley|Making Use of JavaScript|Bhasin, Shweta|9780471219767\n2018|Independently published|Javascript for Beginners: The Simple Way to Start Programming|Connors, K.|9781723929762\n2013|Apress|Beginning JavaScript with DOM Scripting and Ajax: Second Editon|Ferguson, Russ and Heilmann, Christian|9781430250937\n2016|Packt Publishing|Mastering JavaScript Single Page Application Development|Klauzinski, Philip and Moore, John|9781785886447\n2016|Packt Publishing|JavaScript: Functional Programming for JavaScript Developers|Antani, Ved and Timms, Simon and Mantyla, Dan|9781787124660\n2015|Packt Publishing|Test-driven JavaScript Development|Gupta, Ravi Kumar and Singh, Harmeet and Prajapati, Hetal|9781785288746\n2011|For Dummies|HTML, CSS, and JavaScript Mobile Development For Dummies|Harrel, William|9781118026229\n2021|Cengage Learning|JavaScript for Web Warriors|Carey, Patrick and Vodnik, Sasha|9780357638033\n2020|MiraVista Press|Javascript: Optimizing Native Javascript: Designing, Programming, and Debugging Native JavaScript Applications|Etheredge, Robert C.|9781952433337\n2019-04-09T00:00:01Z|Pragmatic Bookshelf|Web Development with ReasonML: Type-Safe, Functional Programming for JavaScript Developers|Eisenberg, J. David|9781680506334\n2017|Packt Publishing|Build Applications with Meteor: Isomorphic JavaScript web development|Ganev, Dobrin|9781787124738\n2012|Apress|Pro Android Web Game Apps: Using HTML5, CSS3 and JavaScript|Bura, Juriy and Coates, Paul|9781430238195\n2017|Packt Publishing|Practical Internet of Things with JavaScript: Build standalone exciting IoT projects with Raspberry Pi 3 and JavaScript (ES5/ES6)|Ravulavaru, Arvind|9781788295598\n2013|Microsoft Press|JavaScript Step by Step (Step by Step Developer)|Suehring, Steve|9780735667310\n2013|Sams Publishing|jQuery and JavaScript in 24 Hours, Sams Teach Yourself|Dayley Brad|9780133414196\n1999|O'Reilly Media|JavaScript Application Cookbook: Programming JavaScript Applications|Bradenbaugh, Jerry|9781565925779\n2021|Hacktech Academy|Learn JavaScript Programming: 3 Books in 1 - The Best Beginner's Guide to Learn JavaScript and Master Front End & Back End Programming|Hacktech Academy|9781802350463\n2017|Packt Publishing|Building Web and Mobile ArcGIS Server Applications with JavaScript - Second Edition: Build exciting custom web and mobile GIS applications with the ArcGIS Server API for JavaScript|Pimpler, Eric and Lewin, Mark|9781787280359\n2018|Packt Publishing|Internet of Things with Raspberry Pi 3: Leverage the power of Raspberry Pi 3 and JavaScript to build exciting IoT projects|Rao, Maneesh|9781788620659\n2018|Pragmatic Bookshelf|Reactive Programming with RxJS 5: Untangle Your Asynchronous JavaScript Code|Mansilla, Sergi|9781680502473\n2020|Apress|Modern Programming Made Easy: Using Java, Scala, Groovy, and JavaScript|Davis, Adam L.|9781484255698\n2017|Packt Publishing|Learning D3.js 4 Mapping - Second Edition: Build cutting-edge maps and visualizations with JavaScript|Newton, Thomas and Villarreal, Oscar and Verspohl, Lars|9781787284258\n2017|Packt Publishing|Mastering Immutable.js: Better JavaScript development using immutable data|Boduch, Adam|9781788397247\n2018|Apress|The Essential Guide to HTML5: Using Games to Learn HTML5 and JavaScript|Meyer, Jeanine|9781484241554\n2017|Apress|Building a 2D Game Physics Engine: Using HTML5 and JavaScript|Tanaya, Michael and Chen, Huaming and Pavleas, Jebediah and Sung, Kelvin|9781484225837\n2015|Packt Publishing|JavaScript JSON Cookbook|Rischpater, Ray|9781785284359\n2010|Wrox|Professional XMPP Programming with JavaScript and jQuery|Moffitt, Jack|9780470540718\n2011|Springer|Guide to HTML, JavaScript and PHP: For Scientists and Engineers|Brooks, David R.|9780857294494\n2020-01-18T00:00:01Z|Apress|Modern Programming Made Easy: Using Java, Scala, Groovy, and JavaScript|Davis, Adam L.|9781484255681\n2015|Packt Publishing|Functional Programming in JavaScript|Mantyla, Dan|9781784398224\n2018|Apress|Front-End Reactive Architectures: Explore the Future of the Front-End using Reactive JavaScript Frameworks and Libraries|Mezzalira, Luca|9781484231807\n2018|Manning Publications|Get Programming with JavaScript Next: New features of ECMAScript 2015, 2016, and beyond|Isaacks, J.D.|9781617294204\n2014|Apress|JavaScript Creativity: Exploring the Modern Capabilities of JavaScript and HTML5|Hudson, Shane|9781430259459\n2018|Independently published|HTML, CSS & JavaScript for Complete Beginners: A Step by Step Guide to Learning HTML5, CSS3 and the JavaScript Programming Language|Hawramani, Ikram|9781790591848\n2014|Apress|Pro JavaScript Development: Coding, Capabilities, and Tooling|Odell, Den|9781430262695\n2011|Apress|JavaScript for Absolute Beginners|McNavage, Terry|9781430272182\n2015|Apress|Pro JavaScript Techniques: Second Edition|Paxton, John and Resig, John and Ferguson, Russ|9781430263920\n2017-09-07T00:00:01Z|CreateSpace Independent Publishing Platform|React: Quickstart Step-By-Step Guide To Learning React Javascript Library (React.js, Reactjs, Learning React JS, React Javascript, React Programming)|Lopez, Lionel|9781976210235\n2013|Packt Publishing|Learning Three.js: The JavaScript 3D Library for WebGL|Dirksen, Jos|9781782166283\n2010|McGraw-Hill Education|Plug-In JavaScript 100 Power Solutions|Nixon, Robin|9780071738620\n2016|Apress|Modern Programming Made Easy: Using Java, Scala, Groovy, and JavaScript|Davis, Adam L.|9781484224908\n2017-03-10T00:00:01Z|Apress|Beginning Functional JavaScript: Functional Programming with JavaScript Using EcmaScript 6|Aravinth, Anto|9781484226551\n2016|Packt Publishing|TypeScript: Modern JavaScript Development|Jansen, Remo H. and Vane, Vilic and Wolff, Ivo Gabe de|9781787289086\n2014|Packt Publishing|Building Web and Mobile ArcGIS Server Applications with JavaScript|Pimpler, Eric|9781849697965\n2017|CreateSpace Independent Publishing Platform|JavaScript: JavaScript Programming For Absolute Beginner's Ultimate Guide to JavaScript Coding, JavaScript Programs and JavaScript Language|Sullivan, William|9781978421868\n2006|Sams Publishing|Sams Teach Yourself JavaScript in 24 Hours (4th Edition)|Moncur, Michael|9780672328794\n2019-05-01T00:00:01Z|Independently published|JavaScript Programming Pattern: Looping intelligence|YAKUB, MOHMAD|9781096466093\n2017-09-25T00:00:01Z|CreateSpace Independent Publishing Platform|Javascript: Javascript Programming The Ultimate Beginners Guide|Hutten, Dennis|9781977650719\n2019-09-06T00:00:01Z|Apress|Beginning Ethereum Smart Contracts Programming: With Examples in Python, Solidity, and JavaScript|Lee, Wei-Meng|9781484250853\n2017|Independently published|React.js Book: Learning React JavaScript Library From Scratch|Sidelnikov, Greg|9781521546185\n2015|Chapman and Hall/CRC|Start Programming Using HTML, CSS, and JavaScript (Chapman & Hall/CRC Textbooks in Computing)|Fajfar, Iztok|9781498731447\n2013|Apress|JavaScript Programmer's Reference|Valentine, Thomas and Reid, Jonathan|9781430246305\n2017|MiraVista Press|JavaScript: Optimizing Native JavaScript: Designing, Programming, and Debugging Native JavaScript Applications|Etheredge, Robert C.|9780986307638\n2015|Packt Publishing|JavaScript Unlocked|Sheiko, Dmitry|9781785881572\n2002|Career Education|Programming the Web Using XHTML and JavaScript|Lagerstrom,Larry and Lagerstrom, Larry|9780072560312\n2018|Independently published|Learning JavaScript: The non-boring beginner's guide to modern (ES6+) JavaScript programming Vol 2: DOM manipulation|Emrich, Marco and Marit, Christin|9781983139147\n2013-08-12T00:00:01Z|Wiley|JavaScript Programming: Pushing the Limits|Raasch, Jon|9781118524565\n2014|Apress|Learn Unity3D Programming with UnityScript: Unity's JavaScript for Beginners|Suvak, Janine|9781430265863\n2005|Wrox|Professional JavaScript for Web Developers (Wrox Professional Guides)|Zakas, Nicholas C.|9780764579080\n2014|O'Reilly Media|Client-Server Web Apps with JavaScript and Java: Rich, Scalable, and RESTful|Saternos, Casimir|9781449369330\n2012|Microsoft Press|Start Here! Learn JavaScript|Suehring, Steve|9780735667358\n2016|Packt Publishing|Modern JavaScript Applications|Prusty, Narayan|9781785880278\n2015|Packt Publishing|JavaScript at Scale|Boduch, Adam|9781785284878\n2012|Apress|Foundation Website Creation with HTML5, CSS3, and JavaScript|Lewis, Joe and Lane, Jonathan and Moscovitz, Meitar and Barker, Tom|9781430237907\n2012|Apress|Pro Android Web Game Apps: Using HTML5, CSS3 and JavaScript|Bura, Juriy and Coates, Paul|9781430238201\n2016|Packt Publishing|Modular Programming with JavaScript|Seydnejad, Sasan|9781785880650\n2000|Cengage Learning|Internet Programming with VBScript and JavaScript (Web Warrior Series)|Kalata, Kate|9780619015237\n2018-12-05T00:00:01Z|Independently published|Learn GIS Programming with ArcGIS for Javascript API 4.x and ArcGIS Online: Learn GIS programming by building an engaging web map application, works on mobile or the web|Nasser, Hussein|9781731503930\n2014|Packt Publishing|JavaScript Mobile Application Development|Saleh, Hazem|9781783554171\n2016-11-29T00:00:01Z|CreateSpace Independent Publishing Platform|JavaScript: Beginner's Guide to Programming Code with JavaScript (JavaScript, Java, Python, Code, Programming Language, Programming, Computer Programming) (Volume 1)|Masterson, Charlie|9781540734235\n2013|Microsoft Press|Start Here! Build Windows 8 Apps with HTML5 and JavaScript|Esposito, Dino and Esposito, Francesco|9780735676183\n2015|CreateSpace Independent Publishing Platform|Javascript: The Ultimate guide for javascript programming (javascript for beginners, how to program, software development, basic javascript, browsers, ... Coding, CSS, Java, PHP) (Volume 7)|Hoffman, Stanley|9781518849121\n2015|Packt Publishing|Test-Driven JavaScript Development|Gupta, Ravi Kumar and Prajapati, Hetal and Singh, Harmeet|9781782174929\n2015|Chapman and Hall/CRC|Start Programming Using HTML, CSS, and JavaScript (Chapman & Hall/CRC Textbooks in Computing Book 17)|Fajfar, Iztok|9781498731454\n2021|BPB Publications|Decoding JavaScript: A Simple Guide for the Not-so-Simple JavaScript Concepts, Libraries, Tools, and Frameworks (English Edition)|Shah, Rushabh Mulraj|9789390684816\n2016|Packt Publishing|Mastering JavaScript Single Page Application Development|Klauzinski, Philip and Moore, John|9781785881640\n2008|Peachpit Press|JavaScript and Ajax for the Web: Visual QuickStart Guide (7th Edition)|Negrino, Tom and Smith, Dori|9780321564085\n2009|Wrox|Beginning JavaScript and CSS Development with jQuery|York, Richard|9780470227794\n2010|friendsofED|The Essential Guide to HTML5: Using Games to learn HTML5 and JavaScript|Meyer, Jeanine|9781430233831\n2012|Apress|Pro JavaScript Performance: Monitoring and Visualization (Expert's Voice in Web Development)|Barker, Tom|9781430247500\n2017|CreateSpace Independent Publishing Platform|JavaScript: Advanced Guide to Programming Code with JavaScript (Java, JavaScript, Python, Code, Programming Language, Programming, Computer Programming)|Masterson, Charlie|9781543055016\n2013|Apress|Windows 8 MVVM Patterns Revealed: covers both C# and JavaScript (Expert's Voice in Windows 8)|Ghoda, Ashish|9781430249092\n2011|Apress|HTML5 and JavaScript Projects (Expert's Voice in Web Development)|Meyer, Jeanine|9781430240334\n2008|Peachpit Press|JavaScript and Ajax for the Web: Visual QuickStart Guide|Negrino, Tom and Smith, Dori|9780132104272\n2016|Apress|Modern Programming Made Easy: Using Java, Scala, Groovy, and JavaScript|Davis, Adam L. L.|9781484224892\n2019|Independently published|Computer programming Javascript: step-by-step beginner’s guide on how to start to programm your first website using Javascript + practical exercises|Harris, Adam|9781704415956\n2012|Apress|Learn HTML5 and JavaScript for iOS: Web Standards-based Apps for iPhone, iPad, and iPod touch|Preston, Scott|9781430240396\n2017-09-15T00:00:01Z|CreateSpace Independent Publishing Platform|JavaScript-mancy: Object-Oriented Programming: Mastering the Arcane Art of Summoning Objects in JavaScript for C# Developers|González García, Jaime|9781976459238\n2012|Addison-Wesley Professional|Building Windows 8 Apps with JavaScript (Microsoft Windows Development Series)|Sells, Chris and Satrom, Brandon and Box, Don|9780133090581\n2012|O'Reilly Media|Mobile JavaScript Application Development: Bringing Web Programming to Mobile Devices|Kosmaczewski, Adrian|9781449327859\n2010|New Riders|Scriptin' with JavaScript and Ajax: A Designer's Guide (Voices That Matter)|Wyke-Smith, Charles|9780132104760\n2020|BPB Publications|JavaScript for Gurus: Use JavaScript programming features, techniques and modules to solve everyday problems (English Edition)|Preez, Ockert J. du|9789389423655", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2006|The application/json Media Type for JavaScript Object Notation (JSON)|10.17487/RFC4627|1178|151|D. Crockford|cc4e39f219e384df97109a36b80875791fdd8d30\n2014|The JavaScript Object Notation (JSON) Data Interchange Format|10.17487/RFC7158|625|107|T. Bray|d94aa2358423328344c291ef9cc8d943a52b2fd7\n2013|JSME: a free molecule editor in JavaScript|10.1186/1758-2946-5-24|176|14|B. Bienfait and P. Ertl|0f62cd120ccb58696dc3c5fc3846f5b3bf6c6e0b\n2013|Efficient construction of approximate call graphs for JavaScript IDE services|10.1109/ICSE.2013.6606621|98|9|Asger Feldthaus and Max Schäfer and Manu Sridharan and Julian T Dolby and F. Tip|c866a930fe71b77c8c99ec59088fd3cdf5af8558\n2015|DLint: dynamically checking bad coding practices in JavaScript|10.1145/2771783.2771809|62|5|Liang Gong and Michael Pradel and Manu Sridharan and Koushik Sen|641094f7b66d126a6decafbe57f0f0c05c31a886\n2016|Discovering bug patterns in JavaScript|10.1145/2950290.2950308|59|5|Quinn Hanam and Fernando Brito and Ali Mesbah|7915125f1b90cd43120cca127cfb71e1c565a8a6\n2017|A Survey of Dynamic Analysis and Test Generation for JavaScript|10.1145/3106739|56|3|Esben Andreasen and Liang Gong and Anders Møller and Michael Pradel and Marija Selakovic and Koushik Sen and Cristian-Alexandru Staicu|448f69b78819f2797715a685203cfa1d7ffa265b\n2017|An empirical study of code smells in JavaScript projects|10.1109/SANER.2017.7884630|40|2|Amir Saboury and Pooya Musavi and F. Khomh and G. Antoniol|e9e9cd100c3bbe03060b441336ca70b9e2b9ad04\n2019|BugsJS: a Benchmark of JavaScript Bugs|10.1109/ICST.2019.00019|40|3|Péter Gyimesi and Béla Vancsics and Andrea Stocco and D. Mazinanian and Árpád Beszédes and R. Ferenc and Ali Mesbah|10fd1629037821e6fc480506004b8d7d5ac986c8\n2015|Detecting JavaScript races that matter|10.1145/2786805.2786820|35|4|Erdal Mutlu and S. Tasiran and B. Livshits|1a6df344e298ddce54bd8c3c4a75311b5a65e786\n2016|Mobile Multi-agent Systems for the Internet-of-Things and Clouds Using the JavaScript Agent Machine Platform and Machine Learning as a Service|10.1109/FiCloud.2016.43|29|2|S. Bosse|29261bd6d9a190dc957c56c5105d8b948e60d387\n2009|AOJS: aspect-oriented javascript programming framework for web development|10.1145/1509276.1509285|27|4|H. Washizaki and A. Kubo and Tomohiko Mizumachi and Kazuki Eguchi and Y. Fukazawa and N. Yoshioka and Hideyuki Kanuka and T. Kodaka and Nobuhide Sugimoto and Yoichi Nagai and Rieko Yamamoto|0a8212fdfeafa2cf56915a1408c10f53e57ac16d\n2019|The Simplicity of Modern Audiovisual Web Cartography: An Example with the Open-Source JavaScript Library leaflet.js|10.1007/s42489-019-00006-2|23|0|Dennis Edler and M. Vetter|49eac0ffa1e47b77755050ea7eb76c38bb29291b\n2019|JStap: a static pre-filter for malicious JavaScript detection|10.1145/3359789.3359813|21|1|Aurore Fass and M. Backes and Ben Stock|3da8e277712210217587051e31bb1a6b673a6fec\n2019|A large-scale empirical study of code smells in JavaScript projects|10.1007/s11219-019-09442-9|15|1|David Johannes and F. Khomh and G. Antoniol|a777b5616c3b8efa8d76a8c511af57d2d32626a7\n2018|An extensible approach for taming the challenges of JavaScript dead code elimination|10.1109/SANER.2018.8330226|14|2|N. Obbink and I. Malavolta and Gian Luca Scoccia and P. Lago|3c60a80e69d3131a61a86759dad89edc6367f912\n2017|Refactoring Asynchrony in JavaScript|10.1109/ICSME.2017.83|13|0|Keheliya Gallaba and Quinn Hanam and Ali Mesbah and Ivan Beschastnikh|5e3b5966f3cf3b486415ac79c54adebb6b16a1aa\n1998|JavaScript as a first programming language for multimedia students|10.1145/282991.283557|11|0|Robert Ward and Martin Smith|7d12e9df3d0bd39263400a15be0a50d313019d86\n2021|Automated conformance testing for JavaScript engines via deep compiler fuzzing|10.1145/3453483.3454054|11|0|Guixin Ye and Zhanyong Tang and Shin Hwei Tan and Songfang Huang and Dingyi Fang and Xiaoyang Sun and Lizhong Bian and Haibo Wang and Zheng Wang|dd63c76b40d937dc3a7af3de5ba42232b858bd6c\n2019|Mining Rule Violations in JavaScript Code Snippets|10.1109/MSR.2019.00039|10|0|Uriel Campos and Guilherme Smethurst and João Pedro Moraes and R. Bonifácio and G. Pinto|a6eb1a84e2000b7f4184a5d9e1b6bee30b3befb6\n2018|Accelerated Mobile Pages from JavaScript as Accelerator Tool for Web Service on E-Commerce in the E-Business|10.11591/IJECE.V8I4.PP2399-2405|9|0|A. Wibowo and G. Aryotejo and M. Mufadhol|898b2a68db7bd851f1d8f66ae86d96f8d75ec945\n2011|ClojureScript: Functional Programming for JavaScript Platforms|10.1109/MIC.2011.148|9|3|M. McGranaghan|0222250a30698b39f08aff5247270abee7cf8ec0\n2018|Modern JavaScript frameworks: A Survey Study|10.1109/ZINC.2018.8448444|8|1|Sanja Delčev and D. Draskovic|910721d68ae9fc95295618b57419e6792ee37cfd\n2019|A Server-Side JavaScript Security Architecture for Secure Integration of Third-Party Libraries|10.1155/2019/9629034|8|1|N. V. Ginkel and Willem De Groef and F. Massacci and F. Piessens|d04471d1d78dfc41289e3b59cc1330b918038ef2\n2020|BUGSJS: a benchmark and taxonomy of JavaScript bugs|10.1002/stvr.1751|7|0|Péter Gyimesi and Béla Vancsics and Andrea Stocco and D. Mazinanian and Árpád Beszédes and R. Ferenc and Ali Mesbah|f4ef28993cc17a192b34e85e5a20e4ce64964c30\n2018|Sparse matrices on the web: characterizing the performance and optimal format selection of sparse matrix-vector multiplication in javascript and webassembly|10.1145/3237009.3237020|6|0|Prabhjot Sandhu and D. Herrera and L. Hendren|89428a2534ebfc5ae593c22587ca5991f5d33c56\n2021|JEST: N+1-Version Differential Testing of Both JavaScript Engines and Specification|10.1109/ICSE43902.2021.00015|6|0|Jihyeok Park and Seungmin An and Dongjun Youn and Gyeongwon Kim and S. Ryu|08dc259ab52194a9da5022decc8316149a397095\n2019|Evaluation and Comparison of Dynamic Call Graph Generators for JavaScript|10.5220/0007752904720479|5|0|Zoltán Herczeg and Gábor Lóki|1609a912a7c91c93bb7e616c406ea518b0f1028e\n2018|Automated refactoring of client-side JavaScript code to ES6 modules|10.1109/SANER.2018.8330227|4|0|Aikaterini Paltoglou and V. Zafeiris and E. A. Giakoumakis and N. A. Diamantidis|38354bce37c211c7eea6e24fc7772df9804eb648\n2020|JISET: JavaScript IR-based Semantics Extraction Toolchain|10.1145/3324884.3416632|4|0|Jihyeok Park and Jihee Park and Seungmin An and S. Ryu|7be6a84f7a69f8066483f2673dd383d84a243a6d\n2018|Lexicon Visualization Library and JavaScript for Scientific Data Visualization|10.1109/MCSE.2018.011111125|3|0|I. Tanyalcin and Carla Al Assaf and Julien Ferté and F. Ancien and Taushif Khan and G. Smits and M. Rooman and W. Vranken|cba224db4c4ee0364f79397d93b5dac19c95d31a\n2020|Industry Practice of JavaScript Dynamic Analysis on WeChat Mini-Programs|10.1145/3324884.3421842|3|1|Yi Liu and Jinhui Xie and Jianbo Yang and Shi-ze Guo and Yuetang Deng and Shuqing Li and Yechang Wu and Yepang Liu|c4354ff184c905cd9fc484a4bf33430df6f035dd\n2020|DRUIDJS — A JavaScript Library for Dimensionality Reduction|10.1109/VIS47514.2020.00029|3|0|René Cutura and Christoph Kralj and M. Sedlmair|86a55c10816bc81071b362a54bcee26b7e214ee2\n2019|Malicious JavaScript Detection using Statistical Language Model|10.31979/etd.nujz-hf4a|3|1|Anumeha Shah|2c31f7d6c21df7a7e4c26e191781081391953980\n2018|JSNVM: Supporting Data Persistence in JavaScript Using Non-Volatile Memory|10.1109/PADSW.2018.8644622|2|0|Hao Xu and Yanmin Zhu and Yuting Chen and Linpeng Huang and Tianyou Li and Pan Deng|354befad12d440787eb78b887b2852607b8e7c93\n2018|WebletScript: A Lightweight Distributed JavaScript Engine for Internet of Things|10.1109/GLOCOM.2018.8647204|2|1|Dong Li and Bin Huang and Li Cui and Zhiwei Xu|8104fe10fae101963ace0dcc69b1c512f61357c3\n2011|A Study on Visual Programming Extension of JavaScript|10.5120/2186-2762|2|1|A. Wajid and S. Kanwal and Pervez Sophia|448fb190f9ec0b291a769806db2ef045a0a0fd02\n2019|Interactive course for JavaScript in LMS Moodle|10.1109/ICETA48886.2019.9039987|2|0|P. Vostinár|25f4e1f7907e21f34444e8febf46ee0ddcd03543\n2019|JSAC: A Novel Framework to Detect Malicious JavaScript via CNNs over AST and CFG|10.1109/IJCNN.2019.8851760|2|0|Hongliang Liang and Yuxing Yang and Lu Sun and Lin Jiang|11b2227f1e7f453a000be07b2486e42866ded461\n2019|JSOptimizer: An Extensible Framework for JavaScript Program Optimization|10.1109/ICSE-Companion.2019.00069|2|0|Yi Liu|d7d32f464175e11c1e0694b5988aa185c662a5d4\n2002|JavaScript programming basics: a laboratory series for beginning programmers|10.1145/772938.772939|2|0|A. Brady and R. McDowell and Kelly Schultz|75ba8ef3c7565b889ee21a8765cc46ad67aa98d8\n2020|Analysis of WebAssembly as a Strategy to Improve JavaScript Performance on IoT Environments|10.5753/sbesc_estendido.2020.13102|2|0|F. Oliveira and J. Mattos|e72c81c91e2c3f3259a9a28f5157ed132c01f698\n2015|Teaching introductory programming with JavaScript in higher education|10.14794/ICAI.9.2014.1.339|2|0|Gyfizfi Horváth and L. Menyhárt|4990c9214aac6db1a71291f4d60d883a8f233fb3\n2019|JavaScript Development Environment for Programming Education Using Smartphones|10.1109/CANDARW.2019.00058|2|0|M. Uehara|90762afc573af09032204322796f24a795effb49\n2018|JavaScript Guidelines for JavaScript Programmers - A Comprehensive Guide for Performance Critical JS Programs|10.5220/0006918904310438|1|0|Gábor Lóki and Péter Gál|b232f8145c7e53a0df89fb4edc58a82f62d1a806\n2016|JavaScript language extension for non-professional programmers: Sharable own variables|10.1109/GCCE.2016.7800390|1|0|M. Oya and Ayumu Kashiwakura|568d2f0e2d7415523cce127ce25bab8b3dff455e\n2019|State-of-the-Art Javascript Language for Internet of Things|10.5753/sbesc_estendido.2019.8651|1|0|Fernando Luis Oliveira and J. Mattos|146ce6bb1be347a7afe095f0f8c6b4d9068b4572\n2019|Functional Programming Patterns in JavaScript|10.1007/978-981-13-8311-3_26|1|0|A. Sobolev and S. Zykov|7817b9bfa35c5ea2aad9e8c8050c5d23cc5705a8" }, "javascriptcore": { "title": "JavaScriptCore", "appeared": 2002, "type": "vm", "description": "The JavaScriptCore framework provides the ability to evaluate JavaScript programs from within Swift, Objective-C, and C-based apps. You can use also use JavaScriptCore to insert custom objects into the JavaScript environment.", "reference": [ "https://en.wikipedia.org/wiki/WebKit#JavaScriptCore" ], "inputLanguages": [ "javascript" ] }, "jaws-scripting-language": { "title": "JAWS Scripting Language", "appeared": 2008, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/JAWS_(screen_reader)" ], "aka": [ "JSL" ], "country": [ "United States" ], "originCommunity": [ "Freedom Scientific Inc" ], "wikipedia": { "summary": "JAWS Scripting Language is a proprietary programming language that facilitates the interoperability of the JAWS for Windows screen reading program with practically any application–both proprietary and off-the-shelf. The JAWS Scripting Language, or JSL is a compiled language, allowing for source code protection. \"JAWS scripting\" commonly also cumulatively refers to customization of JAWS through use of its built-in, user-editable utilities (called \"Managers\") or editing the configuration files directly, in combination with writing actual scripts. The scripting language is an API that exposes functionality including a combination of traditional JAWS scripting, MSAA Server direct scripting, and document object model scripting to ensure optimal performance of JAWS to end-users.", "created": 2008, "backlinksCount": 5, "pageId": 16873677, "revisionCount": 12, "dailyPageViews": 5, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/JAWS_Scripting_Language" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "jayfor": { "title": "jayfor", "appeared": 2014, "type": "pl", "creators": [ "Felix Angell" ], "website": "https://ark-lang.github.io/", "country": [ "Denmark and New Zealand and United Kingdom" ], "originCommunity": [ "https://github.com/ark-lang" ], "domainName": { "name": "ark-lang.github.io" }, "githubRepo": { "firstCommit": 2014, "stars": 676, "forks": 51, "subscribers": 42, "created": 2014, "updated": 2022, "description": "A compiled systems programming language written in Go using the LLVM framework", "issues": 45, "url": "https://github.com/freefouran/jayfor" }, "repoStats": { "firstCommit": 2014, "commits": 3483, "committers": 48, "files": 233 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8748769|Show HN: JAYFOR a compiled programming language written in C|2014-12-14 17:04:40 UTC|1418576680|freefouran|1|5" }, "jazz": { "title": "Jazz", "appeared": 2019, "type": "pl", "creators": [ "playXE" ], "country": [ "Uzbekistan" ], "originCommunity": [ "https://github.com/jazz-lang" ], "githubRepo": { "firstCommit": 2019, "stars": 86, "forks": 3, "subscribers": 7, "created": 2019, "updated": 2022, "description": "Jazz - modern and fast programming language.", "issues": 1, "url": "https://github.com/jazz-lang/Jazz" }, "repoStats": { "firstCommit": 2019, "commits": 209, "committers": 3, "files": 53 } }, "jbc": { "title": "jBC", "appeared": 1989, "type": "pl", "reference": [ "https://www.scribd.com/document/354474528/Jbc-language-JBC-Programmers-Reference-Guide" ], "country": [ "Switzerland" ], "originCommunity": [ "https://github.com/temenostech" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6861", "centralPackageRepositoryCount": 0 }, "jcard": { "title": "jcard", "appeared": 2014, "type": "jsonFormat", "reference": [ "https://en.wikipedia.org/wiki/VCard" ], "country": [ "United States" ], "originCommunity": [ "Versit Consortium" ], "example": [ "[\"vcard\",\n [\n [\"version\", {}, \"text\", \"4.0\"],\n [\"n\", {}, \"text\", [\"Gump\", \"Forrest\", \"\", \"Mr.\", \"\"]],\n [\"fn\", {}, \"text\", \"Forrest Gump\"],\n [\"org\", {}, \"text\", \"Bubba Gump Shrimp Co.\"],\n [\"title\", {} ,\"text\", \"Shrimp Man\"],\n [\"photo\", {\"mediatype\":\"image/gif\"}, \"uri\", \"http://www.example.com/dir_photos/my_photo.gif\"],\n [\"tel\", {\"type\":[\"work\", \"voice\"]}, \"uri\", \"tel:+1-111-555-1212\"],\n [\"tel\", {\"type\":[\"home\", \"voice\"]}, \"uri\", \"tel:+1-404-555-1212\"],\n [\"adr\",\n {\"label\":\"100 Waters Edge\\nBaytown, LA 30314\\nUnited States of America\", \"type\":\"work\", \"pref\":\"1\"},\n \"text\",\n [\"\", \"\", \"100 Waters Edge\", \"Baytown\", \"LA\", \"50505\", \"United States of America\"]\n ],\n [\"adr\",\n {\"label\":\"42 Plantation St.\\nBaytown, LA 30314\\nUnited States of America\", \"type\":\"home\"},\n \"text\",\n [\"\", \"\", \"42 Plantation St.\", \"Baytown\", \"LA\", \"30314\", \"United States of America\"]\n ],\n [\"email\", {}, \"text\", \"forrestgump@example.com\"],\n [\"rev\", {}, \"timestamp\", \"2008-04-24T19:52:43Z\"]\n ]\n]" ] }, "jcl": { "title": "JCL", "appeared": 1964, "type": "pl", "standsFor": "Job Control Language", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasLineComments": { "example": "", "value": true }, "wikipedia": { "example": [ "* $$ JOB JNM=NAME,DISP=K,CLASS=2\n\n[some JCL statements here]\n\n* $$ EOJ" ], "related": [ "unix", "assembly-language", "clist" ], "summary": "Job Control Language (JCL) is a name for scripting languages used on IBM mainframe operating systems to instruct the system on how to run a batch job or start a subsystem. More specifically, the purpose of JCL is to say which programs to run, using which files or devices for input or output, and at times to also indicate under what conditions to skip a step. There are two distinct IBM Job Control languages: one for the operating system lineage that begins with DOS/360 and whose latest member is z/VSE; and the other for the lineage from OS/360 to z/OS, the latter now including JES extensions, Job Entry Control Language (JECL). They share some basic syntax rules and a few basic concepts, but are otherwise very different.", "pageId": 391487, "dailyPageViews": 155, "created": 2003, "backlinksCount": 163, "revisionCount": 546, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/Job_Control_Language" }, "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "jcl" ], "id": "JCL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:JCL", "hopl": "https://hopl.info/showlanguage.prx?exp=2134", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPractical MVS JCL for Today's Programmer|1987|James G. Janossy|3713091|4.00|3|0\nZos JCL (Job Control Language)|2002|Gary DeWard Brown|23914799|4.00|4|1", "isbndb": "year|publisher|title|authors|isbn13\n1989|Mike Murach & Associates Inc|Dos/VSE JCL|Eckols, Steve and Milnes, Michele|9780911625509\n1989|Addison-Wesley|MVS JCL and Utilities: A Comprehensive Treatment|Trombetta, Michael and Finkelstein, Sue Carolyn|9780201083187\n1976T|American Elsevier Pub. Co|JCL and advanced Fortran programming (Methods in geomathematics)|Ramdén, H. Å|9780444414151\n20101001|De Gruyter|MVS/ESA JCL|Michael Winter|9783486599008\n1982|Cbi Pub Co|Jcl In A System 370 Environment (the Computer And Management Information Systems Series)|Barry L. Bateman|9780843616064", "semanticScholar": "" }, "jcof": { "title": "JCOF", "appeared": 2022, "type": "dataNotation", "creators": [ "Martin Dørum" ], "reference": [ "https://news.ycombinator.com/item?id=32109406" ], "standsFor": "JSON-like Compact Object Format", "country": [ "Norway" ], "originCommunity": [ "https://github.com/mortie/jcof/issues" ], "hasComments": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "", "value": false }, "example": [ "Programmer;\"age\"\"first-name\"\"full-time\"\"occupation\";\n{\"people\"[(0,iw\"Bob\"b\"Plumber\")(0,is\"Alice\"b,s0)(0,iA\"Bernard\"n,n)(0,iV\"El\"B,s0)]}" ], "githubRepo": { "firstCommit": 2022, "stars": 12, "forks": 1, "subscribers": 1, "created": 2022, "updated": 2022, "description": "An efficient drop-in replacement for JSON.", "issues": 0, "url": "https://github.com/mortie/jcof" }, "repoStats": { "firstCommit": 2022, "commits": 14, "committers": 1, "files": 18 } }, "jean": { "title": "JOSS Extended and Adapted for Nineteen-hundred", "appeared": 1960, "type": "pl", "standsFor": "JOSS Extended and Adapted for Nineteen-hundred", "country": [ "United Kingdom" ], "originCommunity": [ "University of Southampton" ], "wikipedia": { "related": [ "joss" ], "summary": "JEAN was a dialect of the JOSS programming language developed for and used on ICT 1900 series computers in the late 1960s and early 1970s; it was implemented under the MINIMOP operating system. It was used at the University of Southampton. JEAN was an acronym derived from \"JOSS Extended and Adapted for Nineteen-hundred\". It was operated from a Teletype terminal.", "pageId": 22203007, "created": 2009, "backlinksCount": 32, "revisionCount": 16, "dailyPageViews": 9, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/JEAN" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2135", "fileType": "text", "wordRank": 3321, "centralPackageRepositoryCount": 0 }, "jedit-editor": { "title": "jedit-editor", "appeared": 1998, "type": "editor", "website": "http://jedit.org/", "country": [ "Various" ], "originCommunity": [ "jEdit project" ] }, "jedlang": { "title": "jedlang", "appeared": 2015, "type": "pl", "creators": [ "James Edwards" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/incrediblesound/JedLang/issues" ], "githubRepo": { "firstCommit": 2015, "stars": 22, "forks": 2, "subscribers": 1, "created": 2015, "updated": 2019, "description": "my own language written by me", "issues": 0, "url": "https://github.com/incrediblesound/JedLang" }, "repoStats": { "firstCommit": 2015, "commits": 74, "committers": 4, "files": 35 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9216366|Show HN: JedLang, my first attempt at a language|2015-03-17 05:03:13 UTC|1426568593|jhedwards|8|59" }, "jeebox": { "title": "jeebox", "appeared": 2012, "type": "pl", "demoVideo": [ "https://www.youtube.com/watch?v=5gcKSCUKCRE" ], "creators": [ "Theodore H. Smith" ], "website": "http://jeebox.org/", "aka": [ "Speedie" ], "country": [ "Unknown" ], "originCommunity": [ "https://www.reddit.com/r/jeebox/" ], "domainName": { "registered": 2012, "name": "jeebox.org" }, "example": [ "You can %describe (anything, in: Jeebox)" ], "githubRepo": { "firstCommit": 2019, "stars": 1, "forks": 1, "subscribers": 2, "created": 2019, "updated": 2022, "description": "Clean extensible language for describing code, and human-language. ", "issues": 0, "url": "https://github.com/gamblevore/jeebox" }, "repoStats": { "firstCommit": 2019, "commits": 187, "committers": 4, "files": 88 } }, "jeeves": { "title": "Jeeves", "appeared": 2013, "type": "pl", "creators": [ "Jean Yang" ], "website": "http://projects.csail.mit.edu/jeeves/", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "githubRepo": { "stars": 338, "forks": 29, "subscribers": 36, "created": 2013, "updated": 2018, "description": "Python implementation of the Jeeves programming language.", "url": "https://github.com/jeanqasaur/jeeves" }, "repoStats": { "firstCommit": 2013, "commits": 638, "committers": 15, "files": 642 } }, "jekyll": { "title": "Jekyll", "appeared": 2008, "type": "application", "creators": [ "Tom Preston-Werner" ], "description": "Transforms your plain text into static websites and blogs.", "website": "https://jekyllrb.com/", "country": [ "Various" ], "originCommunity": [ "https://github.com/jekyll" ], "domainName": { "registered": 2009, "name": "jekyllrb.com" }, "related": [ "wordpress" ], "githubRepo": { "firstCommit": 2008, "stars": 45176, "forks": 9850, "subscribers": 1427, "created": 2008, "updated": 2022, "description": ":globe_with_meridians: Jekyll is a blog-aware static site generator in Ruby", "issues": 186, "url": "https://github.com/jekyll/jekyll" }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Jekyll_(software)" } }, "jet-propulsion-laboratory-display-information-system": { "title": "Jet Propulsion Laboratory Display Information System", "appeared": 1973, "type": "pl", "country": [ "United States" ], "originCommunity": [ "California Institute of Technology" ], "wikipedia": { "related": [ "fortran", "foxpro", "dbase" ], "summary": "The Jet Propulsion Laboratory Display Information System (or JPLDIS) is a file management program written in FORTRAN. JPLDIS is important because it was the inspiration and precursor to dBASE, arguably one of the most influential DBMS programs for early microcomputers.", "created": 2006, "backlinksCount": 8, "pageId": 4459851, "revisionCount": 42, "dailyPageViews": 4, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/Jet_Propulsion_Laboratory_Display_Information_System" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2139", "centralPackageRepositoryCount": 0 }, "jevko": { "title": "Jevko", "appeared": 2021, "type": "dataNotation", "website": "https://jevko.org/", "reference": [ "https://github.com/jevko/parsejevko.js" ], "country": [ "Poland" ], "originCommunity": [ "https://github.com/jevko" ], "domainName": { "registered": 2021, "name": "jevko.org" }, "related": [ "json", "xml" ], "example": [ "first name [John]\nlast name [Smith]\nis alive [true]\nage [27]\naddress [\n street address [21 2nd Street]\n city [New York]\n state [NY]\n postal code [10021-3100]\n]\nphone numbers [\n [\n type [home]\n number [212 555-1234]\n ]\n [\n type [office]\n number [646 555-4567]\n ]\n]\nchildren []\nspouse []" ], "twitter": "https://twitter.com/jevko1" }, "jflex": { "title": "JFlex", "appeared": 2003, "type": "grammarLanguage", "description": "JFlex is a lexical analyzer generator (also known as scanner generator) for Java, written in Java.", "website": "http://jflex.de/", "country": [ "Switzerland and Australia" ], "originCommunity": [ "https://github.com/jflex-de/" ], "domainName": { "awisRank": { "2022": 2163823 }, "name": "jflex.de" }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "firstCommit": 2003, "stars": 469, "forks": 101, "subscribers": 22, "created": 2015, "updated": 2022, "description": "The fast scanner generator for Java™ with full Unicode support", "issues": 49, "url": "https://github.com/jflex-de/jflex" }, "repoStats": { "firstCommit": 2003, "commits": 2496, "committers": 27, "files": 8186 }, "githubLanguage": { "fileExtensions": [ "flex", "jflex" ], "trendingProjectsCount": 0, "type": "programming", "group": "Lex", "aceMode": "text", "tmScope": "source.jflex", "repos": 2, "id": "JFlex" }, "githubBigQuery": { "repos": 39, "users": 38, "id": "JFlex" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2017, "committerCount": 1, "commitCount": 5, "sampleCount": 2, "example": [ "/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\n * Copyright (C) 1998-2015 Gerwin Klein *\n * All rights reserved. *\n * *\n * License: BSD *\n * *\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */\n\n/* Java 1.2 language lexer specification */\n\n/* Use together with unicode.flex for Unicode preprocesssing */\n/* and java12.cup for a Java 1.2 parser */\n\n/* Note that this lexer specification is not tuned for speed.\n It is in fact quite slow on integer and floating point literals, \n because the input is read twice and the methods used to parse\n the numbers are not very fast. \n For a production quality application (e.g. a Java compiler) \n this could be optimized */\n\n\nimport java_cup.runtime.*;\n\n%%\n\n%public\n%class Scanner\n%implements sym\n\n%unicode\n\n%line\n%column\n\n%cup\n%cupdebug\n\n%{\n StringBuilder string = new StringBuilder();\n \n private Symbol symbol(int type) {\n return new JavaSymbol(type, yyline+1, yycolumn+1);\n }\n\n private Symbol symbol(int type, Object value) {\n return new JavaSymbol(type, yyline+1, yycolumn+1, value);\n }\n\n /** \n * assumes correct representation of a long value for \n * specified radix in scanner buffer from start \n * to end \n */\n private long parseLong(int start, int end, int radix) {\n long result = 0;\n long digit;\n\n for (int i = start; i < end; i++) {\n digit = Character.digit(yycharat(i),radix);\n result*= radix;\n result+= digit;\n }\n\n return result;\n }\n%}\n\n/* main character classes */\nLineTerminator = \\r|\\n|\\r\\n\nInputCharacter = [^\\r\\n]\n\nWhiteSpace = {LineTerminator} | [ \\t\\f]\n\n/* comments */\nComment = {Tradi" ], "url": "https://github.com/jflex-de/jflex.tmbundle.git" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "jfugue": { "title": "JFugue", "appeared": 2002, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/JFugue" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/dmkoelle/jfugue/issues" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6394", "centralPackageRepositoryCount": 0 }, "ji": { "title": "ji", "appeared": 2019, "type": "pl", "reference": [ "https://observablehq.com/@elisk/ji" ], "country": [ "Israel" ], "originCommunity": [ "https://github.com/elis/ji/issues" ] }, "jingo": { "title": "Jingo", "appeared": 2020, "type": "pl", "creators": [ "Owez" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/Owez/jingo/issues" ], "githubRepo": { "firstCommit": 2021, "stars": 8, "forks": 0, "subscribers": 1, "created": 2020, "updated": 2022, "description": "A lightweight, high-level language designed for rapid prototyping", "issues": 2, "url": "https://github.com/Owez/jingo" }, "repoStats": { "firstCommit": 2021, "commits": 116, "committers": 1, "files": 21 } }, "jinja": { "title": "Jinja", "appeared": 2006, "type": "template", "creators": [ "Armin Ronacher" ], "website": "http://jinja.pocoo.org/", "documentation": [ "https://jinja.palletsprojects.com/en/3.1.x/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/pallets/jinja/issues/" ], "domainName": { "name": "jinja.pocoo.org" }, "githubRepo": { "firstCommit": 2007, "stars": 8593, "forks": 1492, "subscribers": 256, "created": 2010, "updated": 2022, "description": "A very fast and expressive template engine.", "issues": 40, "url": "https://github.com/pallets/jinja" }, "repoStats": { "firstCommit": 2007, "commits": 2881, "committers": 317, "files": 119 }, "wikipedia": { "example": [ "\n\n \n Value with <unsafe> data\n \n \n 1,\n 2,\n 3,\n 4,\n 5,\n 6\n \n" ], "related": [ "python", "django", "smarty", "unix", "isbn" ], "summary": "Jinja is a template engine for the Python programming language and is licensed under a BSD License created by Armin Ronacher. It is similar to the Django template engine but provides Python-like expressions while ensuring that the templates are evaluated in a sandbox. It is a text-based template language and thus can be used to generate any markup as well as sourcecode. The Jinja template engine allows customization of tags, filters, tests, and globals. Also, unlike the Django template engine, Jinja allows the template designer to call functions with arguments on objects. Jinja is Flask's default template engine.", "pageId": 4218966, "dailyPageViews": 106, "created": 2006, "backlinksCount": 34, "revisionCount": 63, "url": "https://en.wikipedia.org/wiki/Jinja_(template_engine)" }, "githubLanguage": { "fileExtensions": [ "jinja", "j2", "jinja2" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "django", "codemirrorMode": "django", "codemirrorMimeType": "text/x-django", "tmScope": "text.html.django", "aliases": [ "django", "html+django", "html+jinja", "htmldjango" ], "repos": 37267, "id": "HTML+Django" }, "githubBigQuery": { "repos": 981, "users": 701, "id": "Jinja" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2014, "committerCount": 6, "commitCount": 40, "sampleCount": 2, "example": [ "

Workers

\n\n\n \n \n \n \n \n \n \n\n{% for server_info in server_infos %}\n \n \n \n \n \n \n \n \n \n {% if not server_info['failed'] %}\n {% for worker in server_info['workers'] %}\n \n \n \n \n \n \n \n {% endfor %}\n {% endif %}\n{% endfor %}\n
Job serverIPFile descriptorClient IDFunctions
{{ server_info['hostport'][0] }}:{{ server_info['hostport'][1] }}\n {%- if server_info['failed'] -%} Not responding! {%- endif -%}\n
{{ worker['ip'] }}{{ worker['file_descriptor'] }}{{ worker['client_id'] }}\n {{ worker['tasks']|join(', ') }}\n
\n" ], "url": "https://github.com/textmate/python-django.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "jinx": { "title": "jinx", "appeared": 2016, "type": "pl", "creators": [ "JamesBoer" ], "website": "https://jamesboer.github.io/Jinx/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/JamesBoer/Jinx/issues" ], "domainName": { "registered": 2016, "name": "jamesboer.github.io" }, "githubRepo": { "firstCommit": 2016, "stars": 263, "forks": 8, "subscribers": 17, "created": 2016, "updated": 2022, "description": "Embeddable scripting language for real-time applications", "issues": 0, "url": "https://github.com/JamesBoer/Jinx" }, "repoStats": { "firstCommit": 2016, "commits": 573, "committers": 2, "files": 280 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n18818846|Jinx: Simple Embeddable Scripting Language|https://www.jinx-lang.org/|2019-01-03 20:15:10 UTC|1546546510|azhenley|2|2" }, "jis-x-0201": { "title": "JIS X 0201", "appeared": 1969, "type": "characterEncoding", "country": [ "Japan" ], "originCommunity": [ "The National Institute of Advanced Industrial Science and Technology" ], "wikipedia": { "related": [ "ascii", "unicode" ], "summary": "JIS X 0201, a Japanese Industrial Standard developed in 1969 (then called JIS C 6220 until the JIS category reform), was the first Japanese electronic character set to become widely used. It is either 7-bit encoding or 8-bit encoding, although 8-bit encoding is dominant for modern use. The full name of this standard is 7-bit and 8-bit coded character sets for information interchange (7ビット及び8ビットの情報交換用符号化文字集合). The first 96 codes comprise an ISO 646 variant, mostly following ASCII with some differences, while the second 96 character codes represent the phonetic Japanese katakana signs. Since the encoding does not provide any way to express hiragana or kanji, it is only capable of expressing simplified written Japanese. Nevertheless, it is possible to express, at least phonetically, the full range of sounds in the language. In the 1980s, this was acceptable for media such as text mode computer terminals, telegrams, receipts or other electronically handled data. JIS X 0201 was supplanted by subsequent encodings such as Shift JIS (which combines this standard and JIS X 0208) and later Unicode.", "created": 2005, "backlinksCount": 552, "pageId": 3230622, "dailyPageViews": 30, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/JIS_X_0201" }, "centralPackageRepositoryCount": 0 }, "jison-lex": { "title": "Jison Lex", "appeared": 2013, "type": "pl", "creators": [ "Zachary Carter" ], "country": [ "United States and The Netherlands and Germany" ], "originCommunity": [ "https://github.com/zaach/jison-lex/issues" ], "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "githubRepo": { "firstCommit": 2013, "stars": 50, "forks": 30, "subscribers": 6, "created": 2013, "updated": 2022, "description": "generates lexical analyzers. used by jison.", "issues": 20, "url": "https://github.com/zaach/jison-lex" }, "repoStats": { "firstCommit": 2013, "commits": 33, "committers": 6, "files": 8 }, "githubLanguage": { "fileExtensions": [ "jisonlex" ], "trendingProjectsCount": 0, "type": "programming", "group": "Lex", "aceMode": "text", "tmScope": "source.jisonlex", "repos": 0, "id": "Jison Lex" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 9, "commitCount": 131, "sampleCount": 2, "example": [ "\n%%\n\\n+ {yy.freshLine = true;}\n\\s+ {yy.freshLine = false;}\n\"y{\"[^}]*\"}\" {yytext = yytext.substr(2, yyleng - 3); return 'ACTION';}\n[a-zA-Z_][a-zA-Z0-9_-]* {return 'NAME';}\n'\"'([^\"]|'\\\"')*'\"' {return 'STRING_LIT';}\n\"'\"([^']|\"\\'\")*\"'\" {return 'STRING_LIT';}\n\"|\" {return '|';}\n\"[\"(\"\\]\"|[^\\]])*\"]\" {return 'ANY_GROUP_REGEX';}\n\"(\" {return '(';}\n\")\" {return ')';}\n\"+\" {return '+';}\n\"*\" {return '*';}\n\"?\" {return '?';}\n\"^\" {return '^';}\n\"/\" {return '/';}\n\"\\\\\"[a-zA-Z0] {return 'ESCAPE_CHAR';}\n\"$\" {return '$';}\n\"<>\" {return '$';}\n\".\" {return '.';}\n\"%%\" {return '%%';}\n\"{\"\\d+(\",\"\\s?\\d+|\",\")?\"}\" {return 'RANGE_REGEX';}\n/\"{\" %{if (yy.freshLine) { this.input('{'); return '{'; } else { this.unput('y'); }%}\n\"}\" %{return '}';%}\n\"%{\"(.|\\n)*?\"}%\" {yytext = yytext.substr(2, yyleng - 4); return 'ACTION';}\n. {/* ignore bad characters */}\n<> {return 'EOF';}" ], "url": "https://github.com/cdibbs/language-jison" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "jison": { "title": "Jison", "appeared": 2009, "type": "pl", "website": "http://zaa.ch/jison/", "documentation": [ "https://gerhobbelt.github.io/jison/docs/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/zaach/jison/issues" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "stars": 4136, "forks": 450, "subscribers": 108, "created": 2009, "updated": 2022, "firstCommit": 2009, "description": "Bison in JavaScript.", "issues": 156, "url": "https://github.com/zaach/jison" }, "repoStats": { "firstCommit": 2009, "commits": 709, "committers": 58, "files": 141 }, "githubLanguage": { "fileExtensions": [ "jison" ], "trendingProjectsCount": 0, "type": "programming", "group": "Yacc", "aceMode": "text", "tmScope": "source.jison", "repos": 0, "id": "Jison" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 9, "commitCount": 131, "sampleCount": 3, "example": [ "\n/* description: ClassyLang grammar. Very classy. */\n/*\n To build parser:\n\n $ ./bin/jison examples/classy.jison examples/classy.jisonlex\n\n*/\n\n\n/* author: Zach Carter */\n\n%right ASSIGN\n%left OR\n%nonassoc EQUALITY GREATER\n%left PLUS MINUS\n%left TIMES\n%right NOT\n%left DOT\n\n%%\n\npgm\n : cdl MAIN LBRACE vdl el RBRACE ENDOFFILE\n ;\n\ncdl\n : c cdl\n |\n ;\n\nc\n : CLASS id EXTENDS id LBRACE vdl mdl RBRACE\n ;\n\nvdl\n : VAR t id SEMICOLON vdl\n |\n ;\n\nmdl\n : t id LPAREN t id RPAREN LBRACE vdl el RBRACE mdl\n |\n ;\n\nt\n : NATTYPE\n | id\n ;\n\nid\n : ID\n ;\n\nel\n : e SEMICOLON el\n | e SEMICOLON\n ;\n\ne\n : NATLITERAL\n | NUL\n | id\n | NEW id\n | THIS\n | IF LPAREN e RPAREN LBRACE el RBRACE ELSE LBRACE el RBRACE\n | FOR LPAREN e SEMICOLON e SEMICOLON e RPAREN LBRACE el RBRACE\n | READNAT LPAREN RPAREN\n | PRINTNAT LPAREN e RPAREN\n | e PLUS e\n | e MINUS e\n | e TIMES e\n | e EQUALITY e\n | e GREATER e\n | NOT e\n | e OR e\n | e DOT id\n | id ASSIGN e\n | e DOT id ASSIGN e\n | id LPAREN e RPAREN\n | e DOT id LPAREN e RPAREN\n | LPAREN e RPAREN\n ;" ], "url": "https://github.com/cdibbs/language-jison" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "jisp": { "title": "Jisp", "appeared": 2014, "type": "pl", "creators": [ "Nelo Mitranim" ], "website": "https://mitranim.com/jisp/", "fileExtensions": [ "jisp" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/mitranim/jisp/issues" ], "keywords": [ "car", "head", "cdr", "tail", "init", "last", "let", "isa", "insta", "any", "prn" ], "githubRepo": { "stars": 125, "forks": 9, "subscribers": 6, "created": 2014, "updated": 2015, "description": "Lisp-style language that compiles to JavaScript", "url": "https://github.com/mitranim/jisp" }, "repoStats": { "firstCommit": 2014, "commits": 178, "committers": 1, "files": 58 } }, "jiyu": { "title": "jiyu", "appeared": 2019, "type": "pl", "isDead": true, "creators": [ "Josh Huelsman" ], "website": "https://jiyu.handmade.network/", "reference": [ "https://machinamentum.github.io/Jiyu-A-Programming-Language/" ], "country": [ "Unknown" ], "originCommunity": [ "https://handmade.network/p/114/jiyu/forums" ], "domainName": { "name": "jiyu.handmade.network" }, "example": [ "#clang_import\n\"\"\"\n#include \n\"\"\";\n\nfunc @metaprogram main(argc: int32, argv: **uint8) {\n printf(\"Hello, Sailor!\\n\");\n\n var file = fopen(\"myfile.txt\", \"wb\");\n fwrite(\"Hello, Pilot!\\n\".data, 1, 14, file);\n fclose(file);\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 44, "forks": 4, "subscribers": 4, "created": 2019, "updated": 2020, "description": "A compiler and programming language for fun.", "issues": 3, "url": "https://github.com/machinamentum/jiyu" }, "twitter": "https://twitter.com/machinamentum" }, "jlang": { "title": "JLang", "appeared": 2016, "type": "pl", "creators": [ "Joao Marcelo Brito" ], "website": "https://github.com/jmbrito01/jlang", "country": [ "Brazil" ], "originCommunity": [ "https://github.com/jmbrito01/jlang/issues" ], "example": [ "func test param {\n this.id = 0;\n ret this;\n}\nvar testObj = test();\ni = testObj.id;" ], "githubRepo": { "stars": 3, "forks": 0, "subscribers": 2, "created": 2016, "updated": 2016, "description": "Just another programming language", "url": "https://github.com/jmbrito01/jlang" }, "repoStats": { "firstCommit": 2016, "commits": 17, "committers": 1, "files": 27 } }, "jmap": { "title": "JMAP", "appeared": 2019, "type": "protocol", "website": "https://tools.ietf.org/html/rfc8620", "standsFor": "JSON Meta Application Protocol", "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ], "related": [ "json", "imap-protocol" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/JSON_Meta_Application_Protocol" } }, "jmespath": { "title": "JMESPath", "appeared": 2013, "type": "pl", "website": "https://jmespath.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/jmespath" ], "domainName": { "registered": 2013, "awisRank": { "2022": 662962 }, "name": "jmespath.org" }, "pygmentsHighlighter": { "filename": "jmespath.py", "fileExtensions": [ "jp" ], "id": "JMESPath" } }, "jmp": { "title": "JMP", "appeared": 1989, "type": "application", "cheatSheetUrl": [ "https://community.jmp.com/kvoqx44227/attachments/kvoqx44227/mastering-jmp/82/3/JMP%2014%20Quick%20Reference%20Card.pdf" ], "country": [ "United States" ], "originCommunity": [ "SAS Institute Inc" ], "related": [ "jsl" ], "wikipedia": { "summary": "JMP (pronounced \"jump\") is a suite of computer programs for statistical analysis developed by the JMP business unit of SAS Institute. It was launched in 1989 to take advantage of the graphical user interface introduced by the Macintosh. It has since been significantly rewritten and made available for the Windows operating system. JMP is used in applications such as Six Sigma, quality control, and engineering, design of experiments, as well as for research in science, engineering, and social sciences. The software can be purchased in any of five configurations: JMP, JMP Pro, JMP Clinical, JMP Genomics and the JMP Graph Builder App for the iPad. JMP can be automated with its proprietary scripting language, JSL. The software is focused on exploratory visual analytics, where users investigate and explore data. These explorations can also be verified by hypothesis testing, data mining, or other analytic methods. In addition, discoveries made through graphical exploration can lead to a designed experiment that can be both designed and analyzed with JMP.", "backlinksCount": 200, "pageId": 1979375, "dailyPageViews": 174, "appeared": 2019, "url": "https://en.wikipedia.org/wiki/JMP_(statistical_software)" }, "subreddit": [ { "memberCount": { "2022": 264 }, "url": "https://reddit.com/r/jmp" } ] }, "jmsl": { "title": "JMSL", "appeared": 1986, "type": "pl", "reference": [ "http://www.algomusic.com/jmsl/jmslhome.html" ], "country": [ "United States" ], "originCommunity": [ "Rockefeller University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6395", "centralPackageRepositoryCount": 0 }, "joe-e": { "title": "Joe-E", "appeared": 2004, "type": "pl", "creators": [ "David A. Wagner" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/davidwagner/joe-e/issues" ], "wikipedia": { "related": [ "java", "e" ], "summary": "Joe-E is a subset of the Java programming language intended to support programming according to object-capability discipline.The language is notable for being an early object-capability subset language. It has influenced later subset languages, such as ADsafe and Caja/Cajita, subsets of Javascript. It is also notable for allowing methods to be verified as functionally pure, based on their method signatures.The restrictions imposed by the Joe-E verifier include: Classes may not have mutable static fields, because these create global state. Catching out-of-memory exceptions is prohibited, because doing so allows non-deterministic execution. For the same reason, finally clauses are not allowed. Methods in the standard library may be blocked if they are deemed unsafe according to taming rules. For example, the constructor new File(filename) is blocked because it allows unrestricted access to the filesystem.Cup of Joe is slang for coffee, and so serves as a trademark-avoiding reference to Java. Thus, the name Joe-E is intended to suggest an adaptation of ideas from the E programming language to create a variant of the Java language. Waterken Server is written in Joe-E.", "created": 2009, "backlinksCount": 35, "pageId": 25161339, "revisionCount": 19, "dailyPageViews": 7, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Joe-E" }, "centralPackageRepositoryCount": 0 }, "join-java": { "title": "Join Java", "appeared": 2000, "type": "pl", "creators": [ "G. Stewart von Itzstein" ], "country": [ "Australia" ], "originCommunity": [ "University of South Australia" ], "wikipedia": { "example": [ "class ThreadExample {\n signal thread(SomeObject x) {\n //this code will execute in a new thread\n }\n }" ], "related": [ "java" ], "summary": "Join Java is a programming language based on the join-pattern that extends the standard Java programming language with the join semantics of the join-calculus. It was written at the University of South Australia within the Reconfigurable Computing Lab by Dr. Von Itzstein.", "created": 2005, "backlinksCount": 33, "pageId": 2225745, "revisionCount": 38, "dailyPageViews": 12, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Join_Java" }, "centralPackageRepositoryCount": 0 }, "joker": { "title": "joker", "appeared": 2018, "type": "pl", "website": "https://joker-lang.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/candid82/joker/issues" ], "domainName": { "registered": 2018, "name": "joker-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n19510165|Clojure dialect written in Go (Joker)|https://joker-lang.org/|2019-03-28 07:48:00 UTC|1553759280|tosh|1|17" }, "jolie": { "title": "Jolie", "appeared": 2006, "type": "pl", "creators": [ "Claudio Guidi", "Fabrizio Montesi" ], "website": "http://jolie-lang.org/", "standsFor": "Java Orchestration Language Interpreter Engine", "country": [ "Italy" ], "originCommunity": [ "University of Bologna" ], "domainName": { "registered": 2008, "awisRank": { "2022": 9779325 }, "name": "jolie-lang.org" }, "wikipedia": { "related": [ "java", "linux", "bpel", "xml", "c", "javascript" ], "summary": "Jolie (Java Orchestration Language Interpreter Engine) is an open-source programming language for developing distributed applications based on microservices. In the programming paradigm proposed with Jolie, each program is a service that can communicate with other programs by sending and receiving messages over a network. Jolie supports an abstraction layer that allows services to communicate using different mediums, ranging from TCP/IP sockets to local in-memory communications between processes.Jolie is currently supported by an interpreter implemented in the Java language, which can be run in multiple operating systems including Linux-based operating systems, OS X, and Windows. The language comes with formal semantics, meaning that the execution of Jolie programs is mathematically defined. For this reason, Jolie is used in research for the investigation of language-based techniques for the development of distributed systems, and it is also used for teaching at some Universities.The Jolie open source project was started by Fabrizio Montesi in 2006, as part of his studies at the University of Bologna. The project initially began as an implementation of the SOCK process calculus, a formal model proposed by Claudio Guidi et al. at the University of Bologna inspired by the CCS process calculus and the WS-BPEL programming language. Jolie extends SOCK with support for, e.g., tree-like data structures (inspired by XML, but with a syntax resembling that of C and Java), message types, typed session programming, integration with Java and JavaScript, code mobility, application containment, and web programming. A complete list of the project contributors is available at.The project is currently maintained by Fabrizio Montesi and its evolution is driven by Fabrizio Montesi and Claudio Guidi. Since it supports the orchestration of web services, Jolie is an alternative to XML-based orchestration languages such as WS-BPEL as it offers a concise (C-like) syntax for accessing XML-like data structures.", "pageId": 39210326, "created": 2013, "backlinksCount": 7, "revisionCount": 35, "dailyPageViews": 18, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Jolie_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ol", "iol" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "jolie" ], "aceMode": "text", "tmScope": "source.jolie", "repos": 129, "id": "Jolie" }, "githubBigQuery": { "repos": 16, "users": 15, "id": "Jolie" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2017, "committerCount": 6, "commitCount": 35, "sampleCount": 5, "example": [ "include \"common.iol\"\ninclude \"ui/swing_ui.iol\"\ninclude \"console.iol\"\n\noutputPort Exam {\nLocation: Location_Exam\nProtocol: sodep\nInterfaces: ExamInterface\n}\n\nmain\n{\n\tquestion.studentName = \"John\";\n\tquestion.examName = \"SPLG\";\n\tquestion.question = \"Random question\";\n\tmakeQuestion@Exam( question )( answer );\n\tshowYesNoQuestionDialog@SwingUI( \"Do you want to accept answer \" + answer + \" ?\" )( decision );\n\n\tmessage.studentName = \"John\";\n\tmessage.examName = \"SPLG\";\n\tif ( decision == 0 ) {\n\t\tpass@Exam( message )\n\t} else {\n\t\tfail@Exam( message )\n\t}\n}\n" ], "url": "https://github.com/fmontesi/language-jolie" }, "twitter": "https://twitter.com/jolielang", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "jonprl": { "title": "jonprl", "appeared": 2015, "type": "pl", "creators": [ "Jonathan Sterling" ], "website": "https://www.jonprl.org/", "country": [ "Denmark and United Kingdom and Australia and United States" ], "originCommunity": [ "https://github.com/jonsterling/JonPRL/issues" ], "domainName": { "registered": 2021, "name": "jonprl.org" }, "githubRepo": { "firstCommit": 2015, "stars": 107, "forks": 9, "subscribers": 18, "created": 2015, "updated": 2022, "description": "An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: https://github.com/redprl/sml-redprl]", "issues": 32, "url": "https://github.com/jonsterling/jonprl" }, "repoStats": { "firstCommit": 2015, "commits": 1179, "committers": 11, "files": 193 } }, "josie": { "title": "JOSIE", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4fefd3bc276c6d02fe2caf6e29594843f8a5e73e" ], "country": [ "United States" ], "originCommunity": [ "Price Water house Technology Centre" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7706", "centralPackageRepositoryCount": 0, "isbndb": "" }, "joss-ii": { "title": "JOSS II", "appeared": 1965, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/JOSS#JOSS-2_use" ], "country": [ "United States" ], "originCommunity": [ "RAND Corporation" ], "related": [ "joss" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1688" }, "joss": { "title": "JOSS", "appeared": 1966, "type": "pl", "creators": [ "Cliff Shaw" ], "standsFor": "JOHNNIAC Open Shop System", "country": [ "United States" ], "originCommunity": [ "RAND Corporation" ], "wikipedia": { "example": [ "Form 1: \" L(%.0f,%.0f) =\"\nForm 2: \" -L(%.0f,%.0f) =\"\nForm 3: \" %.0f\\n\"" ], "related": [ "algol-58", "basic", "telcomp", "focal", "mumps", "jean" ], "summary": "JOSS (an acronym for JOHNNIAC Open Shop System) was one of the very first interactive, time-sharing programming languages. JOSS I, developed by J. Clifford Shaw at RAND was first implemented, in beta form, on the JOHNNIAC computer in May 1963. The full implementation was deployed in January 1964, supporting five terminals and the final version, supporting ten terminals, was deployed in January 1965.JOSS was written in a symbolic assembly language called EasyFox (E and F in the US military's phonetic alphabet of that time). EasyFox was also developed by Cliff Shaw. JOSS was dubbed \"The Helpful Assistant\" for its conversational user interface. Originally green/black typewriter ribbons were used in its terminals with green being used for user input and black for the computer's response. Mathematically, JOSS was interesting because it stored all numbers as an integer and a decimal exponent. This means calculations were exact decimal values, as opposed to floating point calculations. One third plus one third plus one third was exactly one. Any command that was not understood elicited the response \"Eh?\" or \"SORRY\". JOSS II, was developed by Charles L. Baker, Joseph W. Smith, Irwin D. Greenwald, and G. Edward Bryan for the PDP-6 computer between 1964 and February 1966. Many variants of JOSS were developed and implemented on a variety of platforms. Some of these variants remained very similar to the original: TELCOMP, FOCAL, CAL, CITRAN, ISIS, PIL/I, JEAN (ICT 1900 series), AID (PDP-10); while others, such as MUMPS, developed in distinctive directions.", "pageId": 140643, "created": 2002, "backlinksCount": 52, "revisionCount": 99, "dailyPageViews": 26, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/JOSS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=200", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Joss Programming Language Family: Joss, Focal-69, Telcomp, Filecomp, Jean, Stringcomp, Citran, Algebraic Interpretive Dialogue|Books and LLC|9781157407027\n2017|Mcfarland & Company|Joss Whedon And Race: Critical Essays|Mary Ellen Iatropoulos|9780786470105" }, "joule": { "title": "Joule", "appeared": 1996, "type": "pl", "creators": [ "E. Dean Tribble" ], "country": [ "United States" ], "originCommunity": [ "Agorics" ], "wikipedia": { "example": [ "If amount <= balance\n • account withdraw: amount\n else\n • account report-bounce:\n end" ], "related": [ "e", "ascii", "unicode" ], "summary": "Joule is a concurrent dataflow programming language, designed for building distributed applications. It is so concurrent that the order of statements within a block is irrelevant to the operation of the block. Statements are executed whenever possible, based on their inputs. Everything in Joule happens by sending messages. There is no control flow. Instead, the programmer describes the flow of data, making it a dataflow programming language. It is considered the precursor to the E programming language.", "pageId": 502786, "created": 2004, "backlinksCount": 46, "revisionCount": 30, "dailyPageViews": 15, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Joule_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "jovial": { "title": "JOVIAL", "appeared": 1960, "type": "pl", "country": [ "United States" ], "originCommunity": [ "System Development Corporation" ], "hasFixedPoint": { "example": "", "value": true }, "wikipedia": { "related": [ "linux", "algol", "cms-2", "coral", "sympl", "algol-58", "powerpc", "sparc", "systemz", "c", "joss" ], "summary": "JOVIAL is a high-level computer programming language similar to ALGOL, but specialized for the development of embedded systems (specialized computer systems designed to perform one or a few dedicated functions, usually embedded as part of a complete device including mechanical parts).", "pageId": 224748, "dailyPageViews": 68, "created": 2003, "backlinksCount": 84, "revisionCount": 256, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/JOVIAL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:JOVIAL", "hopl": "https://hopl.info/showlanguage.prx?exp=83", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1976|Evaluation of ALGOL 68, JOVIAL J3B, PASCAL, SIMULA 67, and TACPOL vs. TINMAN Requirements for a Common High Order Programming Language.|10.21236/ada033893|3|0|J. Goodenough and C. McGowan and J. R. Kelly|be654e5389930136859ef4263619d9f59a5ee216\n1978|A brief description of JOVIAL|10.1145/960118.808384|2|0|T. Cheatham|faccafa74c9bf5d74363363a7d084ef094cba366\n1963|Jovial and its documentation|10.1145/366274.366297|2|0|C. Shaw|c6a73dc4d8d954b0b1b1be77a86d039f19f6c84c" }, "joy": { "title": "Joy", "appeared": 2001, "type": "pl", "creators": [ "Manfred von Thun" ], "country": [ "Australia" ], "originCommunity": [ "La Trobe University" ], "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "wikipedia": { "example": [ "DEFINE qsort ==\n [small]\n []\n [uncons [>] split]\n [enconcat]\n binrec." ], "related": [ "scheme", "fp", "factor", "forth", "unlambda", "c", "symbol" ], "summary": "The Joy programming language in computer science is a purely functional programming language that was produced by Manfred von Thun of La Trobe University in Melbourne, Australia. Joy is based on composition of functions rather than lambda calculus. It has turned out to have many similarities to Forth, due not to design but to a sort of parallel evolution and convergence. It was also inspired by the function-level programming style of Backus's FP.", "pageId": 696166, "created": 2003, "backlinksCount": 52, "revisionCount": 130, "dailyPageViews": 48, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Joy_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Joy", "tryItOnline": "joy", "hopl": "https://hopl.info/showlanguage.prx?exp=2137", "fileType": "text", "wordRank": 4281, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|CreateSpace Independent Publishing Platform|The Joy of PHP: A Beginner's Guide to Programming Interactive Web Applications with PHP and mySQL|Forbes, Alan|9781494267353\n2011|Manning Publications|The Joy of Clojure: Thinking the Clojure Way|Michael Fogus and Chris Houser|9781935182641\n1981|Pearson P T R|Real Time Programming: Neglected Topics (Addison-Wesley Series in Joy of Computing)|Foster, Caxton C.|9780201019377\n2020|Manning Publications|The Joy of JavaScript|Atencio, Luis|9781617295867" }, "joyce": { "title": "Joyce", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/893c99e56b097430b5d3363636d1d16bf5c04e9f" ], "country": [ "United States" ], "originCommunity": [ "Syracuse University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1330", "wordRank": 9629, "centralPackageRepositoryCount": 0 }, "joycep": { "title": "JOYCE+", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/120b5f6f632c86b55cb7bb8761af45f6a9d738b8" ], "country": [ "Colombia" ], "originCommunity": [ "University of Los Andes" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4203", "centralPackageRepositoryCount": 0, "isbndb": "" }, "jpeg-format": { "title": "JPEG", "appeared": 1992, "type": "binaryDataFormat", "country": [ "United States" ], "originCommunity": [ "Joint Photographic Experts Group", "IBM", "Mitsubishi Electric", "AT&T", "Canon Inc" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/JPEG" } }, "jpl": { "title": "JPL", "appeared": 1991, "type": "pl", "reference": [ "http://docs.prolifics.com/panther/html/dev_html/progjpl.htm" ], "country": [ "United States" ], "originCommunity": [ "Prolifics, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2138", "centralPackageRepositoryCount": 0, "isbndb": "" }, "jplace": { "title": "jplace", "appeared": 2012, "type": "jsonFormat", "description": "We have developed a unified format for phylogenetic placements, that is, mappings of environmental sequence data (e.g., short reads) into a phylogenetic tree. We are motivated to do so by the growing number of tools for computing and post-processing phylogenetic placements, and the lack of an established standard for storing them. The format is lightweight, versatile, extensible, and is based on the JSON format, which can be parsed by most modern programming languages.", "reference": [ "https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0031009" ], "country": [ "United States and Germany" ], "originCommunity": [ "Fred Hutchinson Cancer Research Center", "University of Washington", "Heidelberg Institute for Theoretical Studies" ], "example": [ "{\n“tree”: “((A:0.2{0},B:0.09{1}):0.7{2},C:0.5{3}){4};”,\n“placements”:\n[\n {“p”:\n [[1, −2578.16, 0.777385, 0.004132, 0.0006],\n [0, −2580.15, 0.107065, 0.000009, 0.0153]\n ],\n “n”: [“fragment1”, “fragment2”]\n },\n {“p”: [[2, −2576.46, 1.0, 0.003555, 0.000006]],\n “nm”: [[“fragment3”, 1.5], [“fragment4”, 2]]}\n],\n“metadata”:\n{“invocation”:\n “pplacer -c tiny.refpkg frags.fasta”\n},\n“version”: 3,“fields”:\n[“edge_num”, “likelihood”, “like_weight_ratio”,\n “distal_length”, “pendant_length”]\n}" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "jpp": { "title": "Visual J++", "appeared": 1996, "type": "pl", "originCommunity": [ "Microsoft" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Visual_J++" } }, "jq": { "title": "jq", "appeared": 2012, "type": "queryLanguage", "creators": [ "Stephen Dolan" ], "website": "https://stedolan.github.io/jq/", "reference": [ "https://jqplay.org/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/stedolan/jq/issues" ], "githubRepo": { "firstCommit": 2012, "stars": 22398, "forks": 1314, "subscribers": 314, "created": 2012, "updated": 2022, "description": "Command-line JSON processor", "issues": 737, "url": "https://github.com/stedolan/jq" }, "repoStats": { "firstCommit": 2012, "commits": 1495, "committers": 154, "files": 216 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "jq" ], "aceMode": "text", "tmScope": "source.jq", "repos": 60, "id": "jq" }, "githubBigQuery": { "repos": 39, "users": 36, "id": "jq" }, "projectEuler": { "memberCount": { "2022": 5 }, "id": "jq" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Jq", "rijuRepl": { "example": [ "\"Hello, world!\"\n" ], "id": "https://riju.codes/jq" }, "tryItOnline": "jq", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "jql": { "title": "JSON Query Language", "appeared": 2019, "type": "queryLanguage", "creators": [ "Jakub Martin" ], "country": [ "Poland" ], "originCommunity": [ "https://github.com/cube2222/jql/issues" ], "githubRepo": { "firstCommit": 2019, "stars": 863, "forks": 20, "subscribers": 11, "created": 2019, "updated": 2022, "description": "Easy JSON Query Processor with a Lispy syntax in Go", "issues": 1, "url": "https://github.com/cube2222/jql" }, "repoStats": { "firstCommit": 2019, "commits": 72, "committers": 3, "files": 21 }, "redditDiscussion": [ "https://www.reddit.com/r/golang/comments/ehnsz5/jql_json_query_processor_with_an_easier_lispy/" ], "isbndb": "" }, "jquery": { "title": "JQuery", "appeared": 2006, "type": "library", "website": "https://jquery.com", "country": [ "Various" ], "originCommunity": [ "https://jquery.org/team/" ], "domainName": { "registered": 2005, "awisRank": { "2022": 3091 }, "name": "jquery.com" }, "gource": "https://www.youtube.com/watch?v=xDfdTOgQsHo", "githubRepo": { "stars": 57443, "forks": 20765, "subscribers": 3226, "created": 2009, "updated": 2023, "description": "jQuery JavaScript Library", "issues": 83, "url": "https://github.com/jquery/jquery" }, "wikipedia": { "example": [ "$.ajax({\n type: 'POST',\n url: '/process/submit.php',\n data: {\n name : 'John',\n location : 'Boston',\n },\n}).done(function(msg) {\n alert('Data Saved: ' + msg);\n}).fail(function(xmlHttpRequest, statusText, errorThrown) {\n alert(\n 'Your form submission failed.\\n\\n'\n + 'XML Http Request: ' + JSON.stringify(xmlHttpRequest)\n + ',\\nStatus Text: ' + statusText\n + ',\\nError Thrown: ' + errorThrown);\n});" ], "related": [ "javascript", "html", "visual-studio-editor", "css", "json", "xml" ], "summary": "jQuery is a cross-platform JavaScript library designed to simplify the client-side scripting of HTML. It is free, open-source software using the permissive MIT License. Web analysis indicates that it is the most widely deployed JavaScript library by a large margin. jQuery's syntax is designed to make it easier to navigate a document, select DOM elements, create animations, handle events, and develop Ajax applications. jQuery also provides capabilities for developers to create plug-ins on top of the JavaScript library. This enables developers to create abstractions for low-level interaction and animation, advanced effects and high-level, themeable widgets. The modular approach to the jQuery library allows the creation of powerful dynamic web pages and Web applications. The set of jQuery core features—DOM element selections, traversal and manipulation—enabled by its selector engine (named \"Sizzle\" from v1.3), created a new \"programming style\", fusing algorithms and DOM data structures. This style influenced the architecture of other JavaScript frameworks like YUI v3 and Dojo, later stimulating the creation of the standard Selectors API. Microsoft and Nokia bundle jQuery on their platforms. Microsoft includes it with Visual Studio for use within Microsoft's ASP.NET AJAX and ASP.NET MVC frameworks while Nokia has integrated it into the Web Run-Time widget development platform.", "pageId": 7672626, "dailyPageViews": 886, "created": 2006, "backlinksCount": 892, "revisionCount": 1344, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/JQuery" }, "indeedJobs": { "2017": 9286, "query": "jquery developer" }, "linkedInSkill": { "2018": 1549390, "id": "jquery" }, "subreddit": [ { "url": "https://www.reddit.com/r/jquery/" } ], "meetup": { "memberCount": 463942, "groupCount": 670, "url": "https://www.meetup.com/topics/jquery" }, "twitter": "https://twitter.com/jquery", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\njQuery Cookbook: Solutions & Examples for jQuery Developers|2009|Cody Lindley|7365956|3.89|250|19\njQuery for Dummies|2010|Lynn Beighley|7417454|3.97|36|1" }, "jr": { "title": "JR", "appeared": 2004, "type": "pl", "reference": [ "https://semanticscholar.org/paper/002360dd2bb8897d8b420d5689db495b85e0e0c7" ], "country": [ "United States" ], "originCommunity": [ "University of California", "California Polytechnic State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8232", "wordRank": 4137, "centralPackageRepositoryCount": 0 }, "jruby": { "title": "JRuby", "appeared": 2001, "type": "pl", "country": [ "Various" ], "originCommunity": [ "https://github.com/jruby" ], "wikipedia": { "example": [ "//Example using JSR 233 Scripting for Java 6\nScriptEngineManager mgr = new ScriptEngineManager();\nScriptEngine rbEngine = mgr.getEngineByExtension(\"rb\");\ntry {\n rbEngine.eval(\"puts 'Hello World!'\");\n} catch (ScriptException ex) {\n ex.printStackTrace();\n}" ], "related": [ "java", "ruby", "jython", "c", "rails", "android", "java-bytecode", "yarv" ], "summary": "JRuby is an implementation of the Ruby programming language atop the Java Virtual Machine, written largely in Java. It is free software released under a three-way EPL/GPL/LGPL license. JRuby is tightly integrated with Java to allow the embedding of the interpreter into any Java application with full two-way access between the Java and the Ruby code (similar to Jython for the Python language). JRuby's lead developers are Charles Oliver Nutter and Thomas Enebo, with many current and past contributors including Ola Bini and Nick Sieger. In September 2006, Sun Microsystems hired Enebo and Nutter to work on JRuby full-time. In June 2007, ThoughtWorks hired Ola Bini to work on Ruby and JRuby.In July 2009, the JRuby developers left Sun to continue JRuby development at Engine Yard. In May 2012, Nutter and Enebo left Engine Yard to work on JRuby at Red Hat.", "created": 2005, "backlinksCount": 207, "pageId": 1948859, "revisionCount": 639, "dailyPageViews": 58, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/JRuby" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2014|Springer|JRuby Rails Web Application Development (SpringerBriefs in Computer Science)|Vohra, Deepak|9783319039343\n2008|O'reilly Media Inc.|Jruby Cookbook|Edelson, Justin.|9780596519803" }, "jscript": { "title": "JScript", "appeared": 1996, "type": "pl", "website": "https://msdn.microsoft.com/library/hbxc2t98.aspx", "fileExtensions": [ "js", "jse", "wsf", "wsc" ], "originCommunity": [ "Microsoft" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "WScript.Echo" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "javascript", "ecmascript", "asp", "vbscript", "visual-studio-editor", "json", "csharp" ], "summary": "JScript is Microsoft's dialect of the ECMAScript standard that is used in Microsoft's Internet Explorer. JScript is implemented as an Active Scripting engine. This means that it can be \"plugged in\" to OLE Automation applications that support Active Scripting, such as Internet Explorer, Active Server Pages, and Windows Script Host. It also means such applications can use multiple Active Scripting languages, e.g., JScript, VBScript or PerlScript. JScript was first supported in the Internet Explorer 3.0 browser released in August 1996. Its most recent version is JScript 9.0, included in Internet Explorer 9. JScript 10.0 is a separate dialect, also known as JScript .NET, which adds several new features from the abandoned fourth edition of the ECMAScript standard. It must be compiled for .NET Framework version 2 or version 4, but static type annotations are optional.", "pageId": 263872, "dailyPageViews": 187, "created": 2003, "backlinksCount": 719, "revisionCount": 351, "appeared": 1996, "fileExtensions": [ "js", "jse", "wsf", "wsc" ], "url": "https://en.wikipedia.org/wiki/JScript" }, "leachim6": { "filepath": "j/JScript.js", "fileExtensions": [ "js" ], "example": [ "WScript.Echo(\"Hello World\");" ], "id": "JScript" }, "tiobe": { "id": "JScript" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nJScript? .Net Programming|2001|Essam Ahmed|83357|3.00|1|1", "isbndb": "year|publisher|title|authors|isbn13\n2005|Anaya Multimedia-Anaya Interactiva|Programacion en Javascript actualizada a Javascript 1.3 y Jscript 5 / Updated Programming in JavaScript to JavaScript 1.3 and Jscript 5 (Guias Practicas) (Spanish Edition)|Alarcon, Jose Manuel|9788441510043\n2010||Javascript Programming Language Family: Actionscript, Ecmascript, Jscript, Jscript .net|Books and LLC|9781157376422\n20140321|Emereo|Jscript 118 Success Secrets - 118 Most Asked Questions On Jscript - What You Need To Know|Virginia Fields|9781488538797\n2009|Wiley & Sons, Incorporated, John|Microsoft Powershell, Vbscript And Jscript Bible|William R. Stanek and Jeffrey Rosen and James O'Neill|9780470478905", "semanticScholar": "" }, "jsf": { "title": "JSFuck", "appeared": 2012, "type": "esolang", "creators": [ "Martin Kleppe" ], "description": "JSFuck is an esoteric and educational programming style based on the atomic parts of JavaScript. It uses only six different characters to write and execute code.", "website": "http://www.jsfuck.com/", "country": [ "Germany" ], "originCommunity": [ "https://github.com/aemkei/jsfuck/issues" ], "domainName": { "registered": 2012, "awisRank": { "2022": 1419655 }, "name": "jsfuck.com" }, "githubRepo": { "firstCommit": 2012, "url": "https://github.com/aemkei/jsfuck" }, "repoStats": { "firstCommit": 2012, "commits": 236, "committers": 24, "files": 14 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/JSFuck" }, "rijuRepl": { "example": [ "[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![]\n+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(\n!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]\n+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!!\n[]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!\n![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!!\n[]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[\n])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!\n![]]+([][[]]+[])[+!![]]+(![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]\n]+(!![]+[])[+[]]])[!![]+!![]+[+[]]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![\n]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!!\n[]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[\n])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!\n![]+[])[+[]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[])[!![]+!![]+!![]])()[(![\n]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![\n]+[])[+[]]])[+!![]+[+[]]]+(+[]+[![]]+([]+[])[([]+[][(![]+[])[+[]]+(![]+[])[!![]+\n!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(!\n[]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![\n]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]\n+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]\n+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]\n+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]])[!![]+!![]+[+[]]]]([][(![]+[])[\n+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![]+[])[+[]]+(!\n[]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]\n+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][\n[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+\n[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]\n])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![\n]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!\n![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]\n+[])[+!![]]+([]+[])[(![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![\n]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]\n+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]\n+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]\n])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(\n![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![\n]]]+(![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([\n]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![\n]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]\n]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![\n]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[\n+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(!\n[]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]\n]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!!\n[]+[])[+!![]]+([][[]]+[])[+!![]]+(!![]+[])[(![]+[])[!![]+!![]+!![]]+([][[]]+[])[\n+[]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+\n!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!\n![]]]()+[])[!![]+!![]]]()[+!![]+[+[]]]+![]+(!![]+[])[(![]+[])[!![]+!![]+!![]]+([\n][[]]+[])[+[]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(\n!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!\n![]+!![]+!![]]]()+[])[!![]+!![]]]()[+!![]+[+[]]])()[([]+[][(![]+[])[+[]]+(![]+[]\n)[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[\n+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[\n])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+\n[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!!\n[]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])\n[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]](([]+[])[([![]]+[][[]])[+\n!![]+[+[]]]+(!![]+[])[+[]]+(![]+[])[+!![]]+(![]+[])[!![]+!![]]+([![]]+[][[]])[+!\n![]+[+[]]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[\n]]])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()))[+!![]+[+[]]]+(+!![])+(+!![])+\n(+[])+([]+[])[(![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[\n+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(!\n[]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]\n+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!!\n[]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[]\n)[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![]]])()\n+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]+(!![]+[][(![]\n+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][\n(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![]+[]\n)[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(![]\n+[])[+!![]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]](![]+[])+[])[+!![]]+(![]+[][\n(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+[+[\n]]]+(+(+!![]+[+!![]]+(+!![])+(!![]+!![])))[(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]\n+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([]+[])[([]+[\n][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!\n![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])\n[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[\n])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!!\n[]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+\n[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]][(\n[][[]]+[])[+!![]]+(![]+[])[+!![]]+([]+(+[])[([]+[][(![]+[])[+[]]+(![]+[])[!![]+!\n![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![\n]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]\n]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+\n[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+\n!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+\n(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]])[+!![]+[+!![]]]+(!![]+[])[!![]+!\n![]+!![]]]](!![]+!![]+!![]+[!![]+!![]+!![]+!![]])+(!![]+[])[+!![]]+(![]+[])[!![]\n+!![]]+([][[]]+[])[!![]+!![]]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![\n]]+(!![]+[])[+[]]][([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![\n]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])\n[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]\n]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])\n[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![\n]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+\n[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]\n+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([]+[])[(![]+[])[+[]]+(!![\n]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+\n[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+\n(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])\n[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!\n![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+\n[+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![]]]+(![]+[][(![]+[])[+[]]+(![]+[])[!![\n]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]\n+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[]\n)[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(!\n[]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(\n![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]\n]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![\n]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]\n+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+(!![]\n+[])[(![]+[])[!![]+!![]+!![]]+([][[]]+[])[+[]]+([][(!![]+[])[!![]+!![]+!![]]+([]\n[[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![\n]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]]()[+!![]+[+[]]]\n+![]+(!![]+[])[(![]+[])[!![]+!![]+!![]]+([][[]]+[])[+[]]+([][(!![]+[])[!![]+!![]\n+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[\n+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]]()[+!\n![]+[+[]]])()[([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])\n[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![\n]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!!\n[]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]\n+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][\n(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+\n(!![]+[])[+!![]]](([]+[])[([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[+[]]+(![]+[])[+!\n![]]+(![]+[])[!![]+!![]]+([![]]+[][[]])[+!![]+[+[]]]+([]+[][(![]+[])[+[]]+(![]+[\n])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(![]+[])[!![]+!![\n]+!![]]]()))[+!![]+[+[]]]+(!![]+!![]+!![]+!![])+(+!![])+([]+[])[(![]+[])[+[]]+(!\n![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+\n[+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]\n]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[\n])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+\n(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![\n]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![]]])())\n" ], "id": "https://riju.codes/jsf" } }, "jsgf": { "title": "JSGF", "appeared": 1998, "type": "pl", "website": "https://www.w3.org/TR/jsgf/", "country": [ "United States" ], "originCommunity": [ "Sun Microsystems, Inc" ], "pygmentsHighlighter": { "filename": "grammar_notation.py", "fileExtensions": [ "jsgf" ], "id": "JSGF" }, "semanticScholar": "" }, "jsharp": { "title": "J#", "appeared": 2002, "type": "pl", "website": "http://msdn2.microsoft.com/en-us/vjsharp/default.aspx", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "System.Console.Write" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "j", "java", "java-bytecode" ], "summary": "Visual J# (pronounced \"jay-sharp\") is an implementation of the J# programming language that was a transitional language for programmers of Java and Visual J++ languages, so they could use their existing knowledge and applications on .NET Framework. It was introduced in 2002 and discontinued in 2007, with support for the final release of the product continuing until October, 2017. J# worked with Java bytecode as well as source so it could be used to transition applications that used third-party libraries even if their original source code was unavailable. It was developed by the Hyderabad-based Microsoft India Development Center at HITEC City in India.", "pageId": 419765, "dailyPageViews": 154, "created": 2004, "backlinksCount": 180, "revisionCount": 288, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/J_Sharp" }, "leachim6": { "filepath": "j/J#.jsl", "fileExtensions": [ "jsl" ], "example": [ "package HelloWorld;\n\npublic class HelloWorld\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tSystem.Console.Write(\"Hello World\");\n\t}\n}\n" ], "id": "J#" }, "tiobe": { "id": "J#" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3718", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "jsil-compiler": { "title": "jsil-compiler", "appeared": 2010, "type": "compiler", "creators": [ "Kevin Gadd" ], "description": "JSIL is a compiler that transforms .NET applications and libraries from their native executable format - CIL bytecode - into standards-compliant, cross-browser JavaScript.", "website": "http://jsil.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/sq" ], "domainName": { "registered": 2011, "name": "jsil.org" }, "githubRepo": { "firstCommit": 2011, "stars": 1712, "forks": 249, "subscribers": 105, "created": 2011, "updated": 2022, "description": "CIL to Javascript Compiler", "issues": 381, "url": "https://github.com/sq/JSIL" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "jsl": { "title": "JSL", "appeared": 1989, "type": "pl", "reference": [ "https://support.sas.com/edu/schedules.html?crs=JSCR&ctry=US", "https://www.jmp.com/support/help/zh/15.2/index.shtml#page/jmp/comments.shtml#ww328600", "https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.433.6634&rep=rep1&type=pdf" ], "standsFor": "JMP Scripting Language", "country": [ "United States" ], "originCommunity": [ "JMP Statistical Discovery LLC" ], "related": [ "jmp", "r", "sas", "spss", "stata", "matlab" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "example": [ "a=\"Hello\"; b=\" \"; c=\"World\"; a||b||c;\n// \"Hello World\"" ] }, "jslt": { "title": "JSLT", "appeared": 2017, "type": "pl", "creators": [ "Lars Marius Garshol" ], "country": [ "Norway" ], "originCommunity": [ "https://github.com/schibsted" ], "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2017, "stars": 468, "forks": 101, "subscribers": 32, "created": 2018, "updated": 2022, "description": "JSON query and transformation language", "issues": 66, "url": "https://github.com/schibsted/jslt" }, "repoStats": { "firstCommit": 2017, "commits": 510, "committers": 15, "files": 178 }, "pygmentsHighlighter": { "filename": "jslt.py", "fileExtensions": [ "jslt" ], "id": "JSLT" } }, "jsml": { "title": "JSML", "appeared": 2001, "type": "xmlFormat", "standsFor": "Java Speech Markup Language", "country": [ "United States" ], "originCommunity": [ "Sun Microsystems, Inc" ], "wikipedia": { "summary": "Java Speech API Markup Language (JSML) is an XML-based markup language for annotating text input to speech synthesizers. JSML is used within the Java Speech API. JSML is an XML application and conforms to the requirements of well-formed XML documents. Java Speech API Markup Language is referred to as JSpeech Markup Language when describing the W3C documentation of the standard. Java Speech API Markup Language and JSpeech Markup Language identical apart from the change in name, which is made to protect Sun trademarks. JSML is primarily an XML text format used by Java applications to annotate text input to speech synthesizers. Elements of JSML provide speech synthesizer with detailed information on how to speak text in a naturalized fashion. JSML defines elements which define a document's structure, the pronunciation of certain words and phrases, features of speech such as emphasis and intonation, etc. JSML is designed in the Java fashion to be simple to learn and use, to be portable across different synthesizers and computing platforms, and although designed for use within is also applicable to a wide range of languages. An example of how JSML is defined is set out below: The W3C has developed a standard markup language called SSML, which is based on JSML but is not identical to it. This became a formal W3C recommendation in 2004.", "backlinksCount": 11, "pageId": 142383, "dailyPageViews": 3, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Java_Speech_Markup_Language" } }, "json-graph-format": { "title": "json-graph-format", "appeared": 2014, "type": "jsonFormat", "website": "http://jsongraphformat.info/", "aka": [ "jgf" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/jsongraph" ], "domainName": { "registered": 2015, "name": "jsongraphformat.info" }, "example": [ "{\n \"graph\": {\n \"directed\": false,\n \"type\": \"graph type\",\n \"label\": \"graph label\",\n \"metadata\": {\n \"user-defined\": \"values\"\n },\n \"nodes\": [\n {\n \"id\": \"0\",\n \"type\": \"node type\",\n \"label\": \"node label(0)\",\n \"metadata\": {\n \"user-defined\": \"values\"\n }\n },\n {\n \"id\": \"1\",\n \"type\": \"node type\",\n \"label\": \"node label(1)\",\n \"metadata\": {\n \"user-defined\": \"values\"\n }\n }\n ],\n \"edges\": [\n {\n \"source\": \"0\",\n \"relation\": \"edge relationship\",\n \"target\": \"1\",\n \"directed\": false,\n \"label\": \"edge label\",\n \"metadata\": {\n \"user-defined\": \"values\"\n }\n }\n ]\n }\n}" ], "githubRepo": { "firstCommit": 2014, "stars": 387, "forks": 35, "subscribers": 22, "created": 2014, "updated": 2022, "description": "A proposal for representing graph structure (nodes / edges) in JSON.", "issues": 5, "url": "https://github.com/jsongraph/json-graph-specification" }, "repoStats": { "firstCommit": 2014, "commits": 117, "committers": 12, "files": 22 } }, "json-graph-spec": { "title": "JSON Graph Spec", "appeared": 2013, "type": "jsonFormat", "creators": [ "Byron Ruth" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/bruth/json-graph-spec/issues" ], "example": [ "{\n \"nodes\": [{\n \"labels\": [\"Origin\"],\n \"props\": {\n \"name\": \"file.csv\",\n \"uri\": \"csv:///path/to/file.csv\"\n },\n \"match\": [\"uri\"]\n }, {\n \"labels\": [\"Element\"],\n \"props\": {\n \"name\": \"ArtistId\",\n \"uri\": \"csv:///path/to/file.csv/ArtistId\"\n },\n \"match\": [\"uri\"]\n }],\n \"rels\": [{\n \"start\": 0,\n \"end\": 1,\n \"type\": \"CONTAINS\"\n }]\n}" ], "githubRepo": { "firstCommit": 2013, "stars": 10, "forks": 2, "subscribers": 3, "created": 2013, "updated": 2022, "description": "JSON specification for representing a graph structure", "issues": 0, "url": "https://github.com/bruth/json-graph-spec" }, "repoStats": { "firstCommit": 2013, "commits": 5, "committers": 1, "files": 3 } }, "json-lambda": { "title": "JSON lambda", "appeared": 2017, "type": "queryLanguage", "creators": [ "Chris Done" ], "description": "jl (\"JSON lambda\") is a tiny functional language for querying and manipulating JSON.", "aka": [ "jl" ], "country": [ "England and Canada" ], "originCommunity": [ "https://chrisdone.com/" ], "writtenIn": [ "haskell" ], "example": [ "map (\\o -> { sha: o.sha, ps: map _.sha o.parents }) | filter (\\o -> length o.ps > 1)" ], "githubRepo": { "firstCommit": 2017, "stars": 466, "forks": 20, "subscribers": 7, "created": 2017, "updated": 2022, "description": "Functional sed for JSON", "issues": 5, "url": "https://github.com/chrisdone/jl" }, "repoStats": { "firstCommit": 2017, "commits": 113, "committers": 7, "files": 22 } }, "json-ld": { "title": "JSON-LD", "appeared": 2010, "type": "dataValidationLanguage", "creators": [ "Dave Longley" ], "website": "https://json-ld.org/", "standsFor": "JavaScript Object Notation for Linked Data", "country": [ "Various" ], "originCommunity": [ "https://www.w3.org/2018/json-ld-wg/" ], "domainName": { "registered": 2010, "awisRank": { "2022": 279817 }, "name": "json-ld.org" }, "githubRepo": { "firstCommit": 2010, "stars": 1425, "forks": 183, "subscribers": 64, "created": 2011, "updated": 2022, "description": "A JSON-LD Processor and API implementation in JavaScript", "issues": 118, "url": "https://github.com/digitalbazaar/jsonld.js" }, "repoStats": { "firstCommit": 2010, "commits": 2300, "committers": 46, "files": 76 }, "wikipedia": { "summary": "JSON-LD (JavaScript Object Notation for Linked Data), is a method of encoding Linked Data using JSON. It was a goal to require as little effort as possible from developers to transform their existing JSON to JSON-LD. This allows data to be serialized in a way that is similar to traditional JSON. It is a World Wide Web Consortium Recommendation. It was initially developed by the JSON for Linking Data Community Group before being transferred to the RDF Working Group for review, improvement, and standardization.", "backlinksCount": 259, "pageId": 34228206, "dailyPageViews": 307, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/JSON-LD" }, "githubLanguage": { "fileExtensions": [ "jsonld" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "javascript", "codemirrorMode": "javascript", "codemirrorMimeType": "application/json", "tmScope": "source.js", "repos": 0, "id": "JSONLD" }, "pygmentsHighlighter": { "filename": "data.py", "fileExtensions": [ "jsonld" ], "id": "JSON-LD" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 103, "commitCount": 1133, "sampleCount": 1, "example": [ "{\n \"@context\": {\n \"property\": \"http://example.com/vocab#property\"\n },\n \"@id\": \"../document-relative\",\n \"@type\": \"#document-relative\",\n \"property\": {\n \"@context\": {\n \"@base\": \"http://example.org/test/\"\n },\n \"@id\": \"../document-base-overwritten\",\n \"@type\": \"#document-base-overwritten\",\n \"property\": [\n {\n \"@context\": null,\n \"@id\": \"../document-relative\",\n \"@type\": \"#document-relative\",\n \"property\": \"context completely reset, drops property\"\n },\n {\n \"@context\": {\n \"@base\": null\n },\n \"@id\": \"../document-relative\",\n \"@type\": \"#document-relative\",\n \"property\": \"only @base is cleared\"\n }\n ]\n }\n}" ], "url": "https://github.com/atom/language-javascript" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "json-schema": { "title": "JSON Schema", "appeared": 2010, "type": "dataValidationLanguage", "creators": [ "Kris Zyp" ], "description": "JSON Schema is a vocabulary that allows you to annotate and validate JSON documents.", "website": "http://json-schema.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/json-schema-org" ], "domainName": { "registered": 2007, "awisRank": { "2022": 102032 }, "name": "json-schema.org" }, "related": [ "livr" ], "example": [ "{\n \"$id\": \"https://example.com/calendar.schema.json\",\n \"$schema\": \"https://json-schema.org/draft/2020-12/schema\",\n \"description\": \"A representation of an event\",\n \"type\": \"object\",\n \"required\": [ \"dtstart\", \"summary\" ],\n \"properties\": {\n \"dtstart\": {\n \"type\": \"string\",\n \"description\": \"Event starting time\"\n },\n \"dtend\": {\n \"type\": \"string\",\n \"description\": \"Event ending time\"\n },\n \"summary\": {\n \"type\": \"string\"\n },\n \"location\": {\n \"type\": \"string\"\n },\n \"url\": {\n \"type\": \"string\"\n },\n \"duration\": {\n \"type\": \"string\",\n \"description\": \"Event duration\"\n },\n \"rdate\": {\n \"type\": \"string\",\n \"description\": \"Recurrence date\"\n },\n \"rrule\": {\n \"type\": \"string\",\n \"description\": \"Recurrence rule\"\n },\n \"category\": {\n \"type\": \"string\"\n },\n \"description\": {\n \"type\": \"string\"\n },\n \"geo\": {\n \"$ref\": \"https://example.com/geographical-location.schema.json\"\n }\n }\n}" ], "githubRepo": { "firstCommit": 2010, "stars": 2623, "forks": 248, "subscribers": 108, "created": 2015, "updated": 2022, "description": "The JSON Schema I-D sources", "issues": 90, "url": "https://github.com/json-schema-org/json-schema-spec" }, "repoStats": { "firstCommit": 2010, "commits": 1903, "committers": 80, "files": 34 }, "isbndb": "" }, "json-script": { "title": "JSONScript", "appeared": 2016, "type": "pl", "creators": [ "Evgeny Poberezkin" ], "website": "https://www.jsonscript.org/", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/JSONScript" ], "domainName": { "registered": 2016, "name": "jsonscript.org" }, "githubRepo": { "firstCommit": 2015, "stars": 55, "forks": 4, "subscribers": 6, "created": 2015, "updated": 2022, "description": "Scripted processing of existing endpoints and services", "issues": 0, "url": "https://github.com/JSONScript/jsonscript" }, "repoStats": { "firstCommit": 2015, "commits": 105, "committers": 2, "files": 48 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n11745886|Show HN: JSONScript – Asynchronous scripting language using JSON format|2016-05-21 19:42:45 UTC|1463859765|epoberezkin|47|49" }, "json-stat": { "title": "JSON-stat", "appeared": 2011, "type": "jsonFormat", "creators": [ "Xavier Badosa" ], "description": "JSON-stat is a simple lightweight JSON dissemination format best suited for data visualization, mobile apps or open data initiatives, that has been designed for all kinds of disseminators.", "website": "https://json-stat.org/", "country": [ "Spain" ], "originCommunity": [ "https://github.com/jsonstat" ], "domainName": { "registered": 2011, "awisRank": { "2022": 9584417 }, "name": "json-stat.org" }, "example": [ "{\n \"version\" : \"2.0\",\n \"class\" : \"dataset\",\n \"href\" : \"https://json-stat.org/samples/oecd.json\",\n \"label\" : \"Unemployment rate in the OECD countries 2003-2014\",\n \"note\" : [ \"Most of the data in this dataset are taken from the individual contributions of national correspondents appointed by the OECD Secretariat with the approval of the authorities of Member countries. Consequently, these data have not necessarily been harmonised at international level.\" ],\n \"source\" : \"Economic Outlook No 92 - December 2012 - OECD Annual Projections\",\n \"updated\" : \"2012-11-27\",\n \"extension\" : {\n \"contact\" : \"EcoOutlook@oecd.org\",\n \"metadata\" : [\n {\n \"title\" : \"Economic Outlook Policy and other assumptions underlying the projections Box 1.2 in General assessment\",\n \"href\" : \"http://www.oecd.org/eco/economicoutlookanalysisandforecasts/EO92macroeconomicsituation.pdf\"\n },\n {\n \"title\" : \"Economic Outlook Sources and Methods\",\n \"href\" : \"http://www.oecd.org/document/22/0,3343,en_2649_34109_33702486_1_1_1_1,00.html\"\n },\n {\n \"title\" : \"Database inventory (forthcoming)\",\n \"href\" : \"http://www.oecd.org/eco/databaseinventory\"\n },\n {\n \"title\" : \"OECD Glossary\",\n \"href\" : \"http://stats.oecd.org/glossary/\"\n }\n ]\n },\n \"value\" : [5.943826289, 5.39663128, 5.044790587, 4.789362794, 4.379649386, 4.249093453, 5.592226603, 5.230660289, 5.099422942, 5.224336088, 5.50415003, 5.462866231, 4.278559338, 4.939707755, 5.152160612, 4.727182858, 4.399730726, 3.813933625, 4.776912506, 4.391591645, 4.143587245, 4.351345785, 4.695491708, 4.745323313, 8.158333333, 8.4, 8.483333333, 8.266666667, 7.466666667, 7.016666667, 7.891892855, 8.283171959, 7.175138783, 7.381153404, 7.689552898, 7.735442636, 7.594616751, 7.167833951, 6.748691501, 6.307841105, 6.049842626, 6.146014664, 8.284689299, 7.988900419, 7.453609598, 7.32358421, 7.169741525, 6.88122705, 9.5433848, 10.00149582, 9.224422554, 7.773166282, 7.150623348, 7.787221805, 10.80236438, 8.121579077, 7.104778251, 6.477468723, 6.78101031, 6.780198936, 7.818066527, 8.323638425, 7.922330988, 7.142271671, 5.316363283, 4.391669598, 6.675050668, 7.273107122, 6.723482523, 6.936394665, 7.242148075, 7.135151601, 5.344516646, 5.516904324, 4.793715416, 3.868296418, 3.669496447, 3.326692683, 5.821647379, 7.191696186, 7.313112408, 7.544640558, 7.357364231, 7.255659852, 10.03010116, 9.661753538, 7.899232972, 5.905173373, 4.659913473, 5.601684952, 13.87805579, 16.83438817, 12.4576855, 9.873121257, 9.116309666, 8.74566981, 9.017860131, 8.80435787, 8.368797468, 7.702632855, 6.850344695, 6.368216471, 8.269856093, 8.381534292, 7.774845319, 7.722836877, 7.962718148, 7.757742455, 8.503978378, 8.8650811, 8.882978134, 8.835277292, 8.009145174, 7.384897537, 9.129199553, 9.315864403, 9.202432489, 9.877166456, 10.66140443, 10.91985917, 9.134738857, 9.829230121, 10.69442137, 9.694756306, 8.310233377, 7.188163108, 7.429105355, 6.757338631, 5.752587233, 5.28775372, 5.524081118, 5.565600014, 9.712526535, 10.49281197, 9.849833119, 8.890878396, 8.276300402, 7.653084476, 9.460314273, 12.53058153, 17.65238747, 23.5737508, 26.6534591, 27.2364419, 5.860132523, 6.096400087, 7.185491402, 7.451740837, 7.35706148, 7.851089777, 10.0153875, 11.14448405, 10.92071597, 11.12538821, 11.09958634, 10.76358386, 3.352836045, 3.06335905, 2.590345651, 2.878830234, 2.301867378, 2.990597714, 7.241470693, 7.55861225, 7.058807671, 6.138731401, 5.393148124, 5.128315309, 4.739670964, 4.539966682, 4.341850838, 4.415526325, 4.571302023, 6.024123088, 11.81229736, 13.62078809, 14.51224844, 14.79227286, 14.73886731, 14.61076214, 13.28016732, 12.85704871, 11.29834866, 10.47596715, 9.147672881, 7.728344307, 9.476560711, 8.33683595, 7.110513831, 6.8731402, 7.359377644, 6.93094611, 8.444973801, 7.996760207, 7.708360512, 6.777043598, 6.110290905, 6.774113796, 7.800833899, 8.41234985, 8.438703909, 10.55546863, 11.42167502, 11.7584873, 5.25125, 4.717099486, 4.424423923, 4.129376275, 3.84841253, 3.979750388, 5.068375853, 5.058985674, 4.592622773, 4.399496241, 4.355894653, 4.286733019, 3.562065618, 3.67219364, 3.734708533, 3.450431799, 3.233335111, 3.15974989, 3.643064158, 3.715763348, 3.405129308, 3.378067785, 3.618601827, 3.397535556, 3.304883869, 3.710506994, 4.099797561, 4.242014975, 4.182611437, 4.14500326, 5.431987487, 5.778771292, 5.627283477, 6.078760003, 6.589474092, 6.658818611, 2.998805894, 3.695332444, 3.540173119, 3.550553518, 3.672170595, 3.949416134, 5.43621902, 5.373117407, 5.240905522, 5.036393758, 4.990182757, 4.897580596, 3.975713818, 4.894207123, 5.113659881, 4.20994586, 3.475695941, 3.018534226, 3.68444758, 4.383579198, 4.343866431, 5.163411369, 5.801548283, 6.10348765, 4.76074516, 4.018968583, 3.807106599, 3.840522581, 3.655294639, 4.160280272, 6.146341463, 6.537348623, 6.509125435, 6.938443309, 6.568824155, 6.048820957, 4.04172726, 4.186831741, 4.382939676, 3.392420144, 2.498729296, 2.565344859, 3.107969091, 3.521797592, 3.212318473, 3.098584692, 3.098584692, 3.003021166, 19.61702787, 18.97466246, 17.74593227, 13.84039072, 9.601554043, 7.117494731, 8.166610723, 9.622661542, 9.648757987, 10.05073744, 10.49463234, 10.66450371, 6.276549712, 6.666642728, 7.597516675, 7.637987286, 7.99012509, 7.607584033, 9.484363464, 10.81324061, 12.7097409, 15.52457602, 16.93137173, 16.62982306, 17.55389647, 18.22108629, 16.25634386, 13.3725907, 11.14262294, 9.507520125, 12.02516939, 14.37913326, 13.54138898, 13.69591839, 13.5763623, 12.97187212, 6.682102697, 6.291982582, 6.516689478, 5.945157013, 4.816202781, 4.368899066, 5.856004508, 7.240345922, 8.164977774, 8.529917685, 9.708595873, 9.847243093, 11.03816292, 10.54622939, 9.156961086, 8.511101588, 8.264570818, 11.33829871, 18.01195661, 20.06321219, 21.63712759, 25.04773498, 26.89014696, 26.78073067, 6.56574156, 7.373480411, 7.652096974, 7.053667613, 6.127066505, 6.183935584, 8.305635992, 8.372715009, 7.504247076, 7.651519753, 7.912693788, 7.604124855, 4.033356027, 4.31699694, 4.329724566, 3.941659077, 3.57509152, 3.341272685, 4.257833072, 4.44955058, 3.949110999, 3.863659425, 4.109877511, 3.999499419, 10.82310834, 10.58802629, 10.40296232, 10.01247258, 10.06182773, 10.74264555, 13.74762357, 11.65601928, 9.605142332, 9.014001387, 9.320782097, 8.651402638, 5.019884066, 4.768990278, 4.852538715, 5.450636437, 5.355104552, 5.708223236, 7.62507775, 7.861627732, 8.078635307, 8.027613742, 8.275155581, 8.036560522, 5.986539203, 5.523039996, 5.076780521, 4.617465075, 4.619105436, 5.800444743, 9.275245924, 9.627692959, 8.94612643, 8.091574662, 7.810715126, 7.514930043, 8.68886389, 8.942669403, 8.941482912, 8.233837469, 7.409607055, 7.436710115, 9.371745367, 9.891824566, 9.978460373, 11.11907575, 11.9135905, 11.99849464, 6.971079892, 6.859814025, 6.629153129, 6.100565063, 5.656171098, 5.982685271, 8.157564657, 8.320563893, 7.953121271, 7.970392182, 8.15379125, 8.004598637],\n \"status\" : {\"10\": \"e\", \"11\": \"e\", \"22\": \"e\", \"23\": \"e\", \"34\": \"e\", \"35\": \"e\", \"46\": \"e\", \"47\": \"e\", \"58\": \"e\", \"59\": \"e\", \"70\": \"e\", \"71\": \"e\", \"82\": \"e\", \"83\": \"e\", \"94\": \"e\", \"95\": \"e\", \"106\": \"e\", \"107\": \"e\", \"118\": \"e\", \"119\": \"e\", \"130\": \"e\", \"131\": \"e\", \"142\": \"e\", \"143\": \"e\", \"154\": \"e\", \"155\": \"e\", \"166\": \"e\", \"167\": \"e\", \"178\": \"e\", \"179\": \"e\", \"190\": \"e\", \"191\": \"e\", \"202\": \"e\", \"203\": \"e\", \"214\": \"e\", \"215\": \"e\", \"226\": \"e\", \"227\": \"e\", \"238\": \"e\", \"239\": \"e\", \"250\": \"e\", \"251\": \"e\", \"262\": \"e\", \"263\": \"e\", \"274\": \"e\", \"275\": \"e\", \"286\": \"e\", \"287\": \"e\", \"298\": \"e\", \"299\": \"e\", \"310\": \"e\", \"311\": \"e\", \"322\": \"e\", \"323\": \"e\", \"334\": \"e\", \"335\": \"e\", \"346\": \"e\", \"347\": \"e\", \"358\": \"e\", \"359\": \"e\", \"370\": \"e\", \"371\": \"e\", \"382\": \"e\", \"383\": \"e\", \"394\": \"e\", \"395\": \"e\", \"406\": \"e\", \"407\": \"e\", \"418\": \"e\", \"419\": \"e\", \"430\": \"e\", \"431\": \"e\"},\n \"id\" : [\"concept\", \"area\", \"year\"],\n \"size\" : [1, 36, 12],\n \"role\" :{\n \"time\" : [\"year\"],\n \"geo\" : [\"area\"],\n \"metric\" : [\"concept\"]\n },\n \"dimension\" : {\n \"concept\" : {\n \"label\" : \"indicator\",\n \"extension\" : {\n \"definition\" : {\n \"UNR\" : \"The OECD harmonised unemployment rate gives the number of unemployed persons as a percentage of the labour force (the total number of people employed plus unemployed).\"\n }\n },\n \"category\" : {\n \"label\" : {\n \"UNR\" : \"unemployment rate\"\n },\n \"unit\" : {\n \"UNR\" : {\n \"symbol\" : \"%\",\n \"decimals\" : 9\n }\n }\n }\n },\n \"year\" : {\n \"label\" : \"2003-2014\",\n \"category\" : {\n \"index\" : {\n \"2003\" : 0,\n \"2004\" : 1,\n \"2005\" : 2,\n \"2006\" : 3,\n \"2007\" : 4,\n \"2008\" : 5,\n \"2009\" : 6,\n \"2010\" : 7,\n \"2011\" : 8,\n \"2012\" : 9,\n \"2013\" : 10,\n \"2014\" : 11\n }\n }\n },\n \"area\" : {\n \"label\" : \"OECD countries, EU15 and total\",\n \"note\" : [ \"Except where otherwise indicated, data refer to the actual territory of the country considered.\" ],\n \"category\" : {\n \"index\" : {\n \"AU\" : 0,\n \"AT\" : 1,\n \"BE\" : 2,\n \"CA\" : 3,\n \"CL\" : 4,\n \"CZ\" : 5,\n \"DK\" : 6,\n \"EE\" : 7,\n \"FI\" : 8,\n \"FR\" : 9,\n \"DE\" : 10,\n \"GR\" : 11,\n \"HU\" : 12,\n \"IS\" : 13,\n \"IE\" : 14,\n \"IL\" : 15,\n \"IT\" : 16,\n \"JP\" : 17,\n \"KR\" : 18,\n \"LU\" : 19,\n \"MX\" : 20,\n \"NL\" : 21,\n \"NZ\" : 22,\n \"NO\" : 23,\n \"PL\" : 24,\n \"PT\" : 25,\n \"SK\" : 26,\n \"SI\" : 27,\n \"ES\" : 28,\n \"SE\" : 29,\n \"CH\" : 30,\n \"TR\" : 31,\n \"UK\" : 32,\n \"US\" : 33,\n \"EU15\" : 34,\n \"OECD\" : 35\n },\n \"label\" : {\n \"AU\" : \"Australia\",\n \"AT\" : \"Austria\",\n \"BE\" : \"Belgium\",\n \"CA\" : \"Canada\",\n \"CL\" : \"Chile\",\n \"CZ\" : \"Czech Republic\",\n \"DK\" : \"Denmark\",\n \"EE\" : \"Estonia\",\n \"FI\" : \"Finland\",\n \"FR\" : \"France\",\n \"DE\" : \"Germany\",\n \"GR\" : \"Greece\",\n \"HU\" : \"Hungary\",\n \"IS\" : \"Iceland\",\n \"IE\" : \"Ireland\",\n \"IL\" : \"Israel\",\n \"IT\" : \"Italy\",\n \"JP\" : \"Japan\",\n \"KR\" : \"Korea\",\n \"LU\" : \"Luxembourg\",\n \"MX\" : \"Mexico\",\n \"NL\" : \"Netherlands\",\n \"NZ\" : \"New Zealand\",\n \"NO\" : \"Norway\",\n \"PL\" : \"Poland\",\n \"PT\" : \"Portugal\",\n \"SK\" : \"Slovak Republic\",\n \"SI\" : \"Slovenia\",\n \"ES\" : \"Spain\",\n \"SE\" : \"Sweden\",\n \"CH\" : \"Switzerland\",\n \"TR\" : \"Turkey\",\n \"UK\" : \"United Kingdom\",\n \"US\" : \"United States\",\n \"EU15\" : \"Euro area (15 countries)\",\n \"OECD\" : \"total\"\n },\n \"note\" : {\n \"DE\" : [ \"Germany (code DE) was created 3 October 1990 by the accession of the Democratic Republic of Germany (code DDR) to the then Federal Republic of Germany (code DEW).\" ]\n },\n \"child\" : {\n \"EU15\" : [\"AT\", \"BE\", \"DE\", \"DK\", \"ES\", \"FI\", \"FR\", \"GR\", \"IE\", \"IT\", \"LU\", \"NL\", \"PT\", \"SE\", \"UK\"],\n \"OECD\" : [ \"EU15\", \"AU\", \"CA\", \"CL\", \"CZ\", \"DK\", \"EE\", \"HU\", \"IS\", \"IL\", \"JP\", \"KR\", \"MX\", \"NO\", \"NZ\", \"PL\", \"SK\", \"SI\", \"CH\", \"TR\", \"US\"]\n }\n }\n }\n }\n}" ], "githubRepo": { "firstCommit": 2013, "stars": 21, "forks": 1, "subscribers": 4, "created": 2013, "updated": 2021, "description": "JSON-stat GitHub Repository", "issues": 1, "url": "https://github.com/jsonstat/jsonstat" }, "repoStats": { "firstCommit": 2013, "commits": 27, "committers": 3, "files": 1 }, "twitter": "https://twitter.com/jsonstat" }, "json-url": { "title": "json->url", "appeared": 2017, "type": "jsonFormat", "creators": [ "Tim Bray" ], "description": "JSON→URL is a language-independent data interchange format for the JSON data model suitable for use within a URL/URI query string. It is defined by an open specification, though not through a standards body.", "website": "https://jsonurl.org", "webRepl": [ "https://jsonurl.org/#sandbox" ], "documentation": [ "https://github.com/jsonurl/specification" ], "reference": [ "https://www.textuality.com/", "https://www.rfc-editor.org/rfc/rfc8259" ], "country": [ "Canada" ], "originCommunity": [ "Textuality Services, Inc." ], "versions": { "2022": [ "v1.1.7" ] }, "githubRepo": { "stars": 15, "forks": 6, "subscribers": 4, "created": 2020, "updated": 2022, "description": "JSON->URL defines a text format for the JSON data model suitable for use within a URL/URI (as described by RFC3986). This repository holds the JavaScript reference implementation of JSON->URL.", "issues": 8, "url": "https://github.com/jsonurl/jsonurl-js" }, "repoStats": { "firstCommit": 2020, "commits": 529, "committers": 11, "files": 73 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/JSON%E2%86%92URL" }, "tryItOnline": "https://jsonurl.org/#sandbox", "isOpenSource": true }, "json-with-comments": { "title": "JSON with Comments", "appeared": 2001, "type": "dataNotation", "creators": [ "Muhammad Muzzammil" ], "reference": [ "https://plus.google.com/118095276221607585885/posts/RK8qyGVaGSr", "https://changelog.com/news/jsonc-is-a-superset-of-json-which-supports-comments-6LwR", "https://github.com/Microsoft/node-jsonc-parser" ], "aka": [ "jsonc" ], "country": [ "India" ], "originCommunity": [ "https://github.com/muhammadmuzzammil1998/jsonc/issues" ], "supersetOf": [ "json" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/*\n * JSLint's implementation of JSHint\n * The JSLint options and makeup of this file were created based on the documentation of JSLint by\n * Douglas Crockford: http://www.jslint.com/lint.html\n */\n\n{\n \"foobar\" : true, // Not checked in JSHint\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 167, "forks": 19, "subscribers": 4, "created": 2019, "updated": 2022, "description": "JSON with comments for Go!", "issues": 3, "url": "https://github.com/muhammadmuzzammil1998/jsonc" }, "repoStats": { "firstCommit": 2019, "commits": 47, "committers": 4, "files": 13 }, "githubLanguage": { "fileExtensions": [ "jsonc", "code-snippets", "sublime-build", "sublime-commands", "sublime-completions", "sublime-keymap", "sublime-macro", "sublime-menu", "sublime-mousemap", "sublime-project", "sublime-settings", "sublime-theme", "sublime-workspace", "sublime_metrics", "sublime_session" ], "type": "data", "group": "JSON", "filenames": [ ".babelrc", ".devcontainer.json", ".eslintrc.json", ".jscsrc", ".jshintrc", ".jslintrc", "api-extractor.json", "devcontainer.json", "jsconfig.json", "language-configuration.json", "tsconfig.json", "tslint.json" ], "aceMode": "javascript", "codemirrorMode": "javascript", "codemirrorMimeType": "text/javascript", "tmScope": "source.js", "aliases": [ "jsonc" ], "repos": 0, "id": "JSON with Comments" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 103, "commitCount": 1133, "sampleCount": 12, "example": [ "[\n\t{\n\t\t\"command\": \"haxe_run_build\"\n\t}\n]" ], "url": "https://github.com/atom/language-javascript" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "json": { "title": "JSON", "appeared": 2001, "type": "dataNotation", "creators": [ "Douglas Crockford" ], "website": "https://www.json.org/", "documentation": [ "https://www.json.org/json-en.html" ], "reference": [ "https://twobithistory.org/2017/09/21/the-rise-and-rise-of-json.html" ], "country": [ "United States" ], "originCommunity": [ "State Software" ], "domainName": { "registered": 2000, "awisRank": { "2022": 62633 }, "name": "json.org" }, "canWriteToDisk": { "example": "", "value": false }, "hasBooleans": { "example": "false", "value": true }, "hasComments": { "example": "", "value": false }, "hasMacros": { "example": "", "value": false }, "hasLineComments": { "example": "", "value": false }, "hasConditionals": { "example": "", "value": false }, "hasTernaryOperators": { "example": "", "value": false }, "hasMultiLineComments": { "example": "", "value": false }, "hasFloats": { "example": "2.3", "value": true }, "hasImports": { "example": "", "value": false }, "hasIntegers": { "example": "80766866", "value": true }, "hasMultilineStrings": { "example": "", "value": false }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasMaps": { "example": "{\"name\": \"Mary\"}", "value": true }, "hasLists": { "example": "[1, 2, 3]", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "wikipedia": { "example": [ "var y = {a: undefined};\n var ys = JSON.stringify(y,\n function (k, v){return (v === undefined) ? \"UNDEFINED\" : v});" ], "related": [ "javascript", "xml", "java", "http", "unicode", "utf-8", "ecmascript", "soap", "yaml", "csv", "protobuf", "gzip", "xpath", "css", "hocon", "s-expressions", "geojson" ], "summary": "In computing, JavaScript Object Notation or JSON ( JAY-sən), is an open-standard file format that uses human-readable text to transmit data objects consisting of attribute–value pairs and array data types (or any other serializable value). It is a very common data format used for asynchronous browser–server communication, including as a replacement for XML in some AJAX-style systems. JSON is a language-independent data format. It was derived from JavaScript, but as of 2017 many programming languages include code to generate and parse JSON-format data. The official Internet media type for JSON is application/json. JSON filenames use the extension .json. Douglas Crockford originally specified the JSON format in the early 2000s; two competing standards, RFC 7159 and ECMA-404, defined it in 2013. The ECMA standard describes only the allowed syntax, whereas the RFC covers some security and interoperability considerations. A restricted profile of JSON, known as I-JSON (short for \"Internet JSON\"), seeks to overcome some of the interoperability problems with JSON. It is defined in RFC 7493..", "pageId": 1575082, "dailyPageViews": 3994, "created": 2005, "backlinksCount": 1329, "revisionCount": 2473, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/JSON" }, "githubLanguage": { "fileExtensions": [ "json", "4DForm", "4DProject", "avsc", "geojson", "gltf", "har", "ice", "JSON-tmLanguage", "jsonl", "mcmeta", "tfstate", "tfstatebackup", "topojson", "webapp", "webmanifest", "yy", "yyp" ], "trendingProjectsCount": 0, "type": "data", "filenames": [ ".arcconfig", ".auto-changelog", ".c8rc", ".htmlhintrc", ".imgbotconfig", ".nycrc", ".tern-config", ".tern-project", ".watchmanconfig", "Pipfile.lock", "composer.lock", "mcmod.info" ], "aceMode": "json", "codemirrorMode": "javascript", "codemirrorMimeType": "application/json", "tmScope": "source.json", "aliases": [ "geojson", "jsonl", "topojson" ], "repos": 133, "id": "JSON" }, "githubBigQuery": { "repos": 6, "users": 6, "id": "JSON" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/json", "pygmentsHighlighter": { "filename": "data.py", "fileExtensions": [ "json", "Pipfile.lock" ], "id": "JSON" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 11, "commitCount": 21, "sampleCount": 14, "example": [ "{\n \"id\": 1,\n \"name\": \"Foo\",\n \"price\": 123,\n \"tags\": [\"Bar\",\"Eek\"],\n \"stock\": { \"warehouse\":300, \"retail\":20 }\n}" ], "url": "https://github.com/textmate/json.tmbundle" }, "languageServerProtocolProject": [ "https://www.npmjs.com/package/vscode-json-languageserver\nwrittenIn typescript" ], "leachim6": { "filepath": "j/JSON.json", "fileExtensions": [ "json" ], "example": [ "{ \"hello\": \"world\" }\n" ], "id": "JSON" }, "indeedJobs": { "2017": 5872, "query": "json developer" }, "linkedInSkill": { "2018": 335550, "id": "json" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2018|Apress|Beginning Reactive Programming with Swift: Using RxSwift, Amazon Web Services, and JSON with iOS and macOS|Feiler, Jesse|9781484236208\n2015|Createspace Independent Publishing Platform|Learn Json In A Day : The Ultimate Crash Course To Learning The Basics Of Json In No Time|Acodemy|9781519158413\n2015|Apress|Beginning JSON|SMITH, BEN|9781484202029\n2020|Bowker|MySQL & JSON A Practical Programming Guide: Second Edition|Stokes, David|9780578783246\n2017|Apress|XML and JSON Recipes for SQL Server: A Problem-Solution Approach|Grinberg, Alex|9781484231173\n2019|Independently published|Dan Gookin's Guide to XML and JSON Programming|Gookin, Dan|9781088918326\n2013|Packt Publishing|JavaScript and JSON Essentials|Sriparasa, Sai Srinivas|9781783286041\n2013|Packt Publishing|Developing RESTful Services with JAX-RS 2.0, WebSockets, and JSON|Kalali, Masoud and Mehta, Bhakti|9781782178132\n2015|Packt Publishing|JavaScript JSON Cookbook|Rischpater, Ray|9781785284359\n2021|Apress|Pro Power BI Theme Creation: JSON Stylesheets for Automated Dashboard Formatting|Aspin, Adam|9781484270684\n2013|Packt Publishing|Developing RESTful Services with JAX-RS 2.0, WebSockets, and JSON|Kalali, Masoud and Mehta, Bhakti|9781782178125\n20160518|Springer Nature|JSON Quick Syntax Reference|Wallace Jackson|9781484218631\n23-04-2018|Packt Publishing|JavaScript and JSON Essentials|Bruno Joseph D'mello; Sai Srinivas Sriparasa|9781788628761\n20190110|Springer Nature|Java XML and JSON|Jeff Friesen|9781484243305\n20160615|Springer Nature|Java XML and JSON|JEFF FRIESEN|9781484219164\n20140323|Emereo|JSON 296 Success Secrets - 296 Most Asked Questions On JSON - What You Need To Know|Laura Davenport|9781488539138\n|Packt Pub.|Developing RESTful services with JAX-RS 2.0, WebSockets, and JSON|Kalali, Masoud.|9781782178125", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Simplifying the interaction between cognitive models and task environments with the JSON Network Interface|10.3758/s13428-013-0425-z|16|4|Ryan M. Hope and M. Schoelles and Wayne D. Gray|0326b8861e0bda7a0657a2d9e835a727fb31d0b2\n2018|Keamanan RESTful Web Service Menggunakan JSON Web Token (JWT) HMAC SHA-512|10.22146/JNTETI.V7I2.417|14|3|Alam Rahmatulloh and Heni Sulastri and R. Nugroho|a380221c7055d96ade6226a5c4d9de49537025bf\n2019|Schemas and Types for JSON Data: From Theory to Practice|10.1145/3299869.3314032|10|0|M. Baazizi and Dario Colazzo and G. Ghelli and C. Sartiani|e17258d751b7e732b88d4255948baf0d67fce6f5\n2018|Survey on JSON Data Modelling|10.1088/1742-6596/1069/1/012101|7|0|Teng Lv and Ping Yan and Weimin He|923f14a6a5f78ef90794ffa5efe1121f512b9b58\n2017|Implementasi JSON untuk Minimasi Penggunaan Jumlah Kolom Suatu Tabel Pada Database PostgreSQL|10.21070/JOINCS.V1I1.802|5|1|M. A. Rosid|6b6d9197323171c9e0b36379319b941a133908fe\n2016|PENCARIAN INFORMASI DATA PESAWAT MENGGUNAKAN NOMOR REGISTRASI PESAWAT DENGAN MEMANFAATKAN DATABASE DAN JSON|10.28989/compiler.v5i2.172|2|0|Yulis Robert Latumaone and Haruno Sajati and Nurcahyani Dewi Retnowati|e798f6fedeb8929587cdb9440b0412f5d8fe5cd4\n2019|On Massive JSON Data Model and Schema|10.1088/1742-6596/1302/2/022031|2|0|Teng Lv and Ping Yan and Weimin He|100e2fa6c426a52e36078003a7001d324e1e099e\n2016|Implementation of AJAX and JSON to Improve Web Application Performance|10.26623/transformatika.v14i1.363|1|0|M. Z. Abdillah|316dba7d3e7a522ce0b326fa6535d370872b1f1f\n2019|A Survey on JSON Data Stores|10.4018/978-1-5225-8446-9.CH003|1|0|L. Irshad and Zongmin Ma and Li Yan|228bef45279542a6205efb8d7ba5624263936514\n2020|Research and Application of Data Exchange based on JSON|10.1109/IPEC49694.2020.9115155|1|0|Changxia Sun and Xia Zeng and Chengzhong Sun and Haiping Si and Yanling Li|d5be81bd9bc79273083731c53f7dbd079688095b" }, "json5": { "title": "JSON5", "appeared": 2012, "type": "dataNotation", "creators": [ "Aseem Kishore" ], "description": "The JSON5 Data Interchange Format (JSON5) is a superset of JSON that aims to alleviate some of the limitations of JSON by expanding its syntax to include some productions from ECMAScript 5.1.", "website": "https://json5.org/", "documentation": [ "https://json5.org/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/json5" ], "domainName": { "registered": 2011, "awisRank": { "2022": 1469395 }, "name": "json5.org" }, "supersetOf": [ "json" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "{\n // comments\n unquoted: 'and you can quote me on that',\n singleQuotes: 'I can use \"double quotes\" here',\n lineBreaks: \"Look, Mom! \\\nNo \\\\n's!\",\n hexadecimal: 0xdecaf,\n leadingDecimalPoint: .8675309, andTrailing: 8675309.,\n positiveSign: +1,\n trailingComma: 'in objects', andIn: ['arrays',],\n \"backwardsCompatible\": \"with JSON\",\n} " ], "githubRepo": { "firstCommit": 2012, "stars": 5161, "forks": 192, "subscribers": 78, "created": 2012, "updated": 2022, "description": "JSON5 — JSON for humans", "issues": 32, "url": "https://github.com/json5/json5" }, "repoStats": { "firstCommit": 2012, "commits": 649, "committers": 28, "files": 39 }, "githubLanguage": { "fileExtensions": [ "json5" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "javascript", "codemirrorMode": "javascript", "codemirrorMimeType": "application/json", "tmScope": "source.js", "repos": 0, "id": "JSON5" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 103, "commitCount": 1133, "sampleCount": 2, "example": [ "/*\n * The following is a contrived example, but it illustrates most of the features:\n */\n\n{\n foo: 'bar',\n while: true,\n\n this: 'is a \\\nmulti-line string',\n\n // this is an inline comment\n here: 'is another', // inline comment\n\n /* this is a block comment\n that continues on another line */\n\n hex: 0xDEADbeef,\n half: .5,\n delta: +10,\n to: Infinity, // and beyond!\n\n finally: 'a trailing comma',\n oh: [\n \"we shouldn't forget\",\n 'arrays can have',\n 'trailing commas too',\n ],\n}" ], "url": "https://github.com/atom/language-javascript" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "jsoniq": { "title": "JSONiq", "appeared": 2011, "type": "queryLanguage", "website": "http://www.jsoniq.org/", "country": [ "Unknown" ], "originCommunity": [ "https://groups.google.com/g/zorba-io-user" ], "domainName": { "registered": 2011, "name": "jsoniq.org" }, "supersetOf": [ "json" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "for $p in collection(\"persons\")\n return \n \n {$p(\"firstName\")}\n {$p(\"lastName\")}\n {$p(\"age\")}\n " ], "related": [ "xquery", "sql", "json", "xml", "isbn" ], "summary": "JSONiq is a query and functional programming language that is designed to declaratively query and transform collections of hierarchical and heterogeneous data in format of JSON, XML, as well as unstructured, textual data. JSONiq is an open specification published under the Creative Commons Attribution-ShareAlike 3.0 license. It is based on the XQuery language, with which it shares the same core expressions and operations on atomic types. JSONiq comes in two syntactical flavors, which both support JSON and XML natively. The JSONiq syntax (a superset of JSON) extended with XML support through a compatible subset of XQuery. The XQuery syntax (native XML support) extended with JSON support through a compatible subset (the JSONiq extension to XQuery) of the above JSONiq syntax.", "pageId": 40213347, "created": 2013, "backlinksCount": 11, "revisionCount": 14, "dailyPageViews": 6, "url": "https://en.wikipedia.org/wiki/JSONiq" }, "githubLanguage": { "fileExtensions": [ "jq" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "jsoniq", "codemirrorMode": "javascript", "codemirrorMimeType": "application/json", "tmScope": "source.jsoniq", "repos": 153, "id": "JSONiq" }, "githubBigQuery": { "repos": 423, "users": 386, "id": "JSONiq" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2016, "committerCount": 2, "commitCount": 108, "sampleCount": 2, "example": [ "(: Query for returning one database entry :) \n\nimport module namespace req = \"http://www.28msec.com/modules/http-request\";\nimport module namespace catalog = \"http://guide.com/catalog\";\n\nvariable $id := (req:param-values(\"id\"), \"London\")[1];\nvariable $part := (req:param-values(\"part\"), \"main\")[1];\n\ncatalog:get-data-by-key($id, $part)\n" ], "url": "https://github.com/wcandillon/language-jsoniq" }, "leachim6": { "filepath": "j/JSONiq", "example": [ "\"Hello World\"\n" ], "id": "JSONiq" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "jsonnet": { "title": "Jsonnet", "appeared": 2014, "type": "dataNotation", "creators": [ "Dave Cunningham" ], "website": "https://jsonnet.org/", "webRepl": [ "https://jsonnet.org/" ], "country": [ "United States" ], "originCommunity": [ "Google" ], "domainName": { "registered": 2015, "awisRank": { "2022": 1098488 }, "name": "jsonnet.org" }, "supersetOf": [ "json" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "// A function that returns an object.\nlocal Person(name='Alice') = {\n name: name,\n welcome: 'Hello ' + name + '!',\n};\n{\n person1: Person(),\n person2: Person('Bob'),\n}" ], "githubRepo": { "firstCommit": 2014, "url": "https://github.com/google/jsonnet" }, "repoStats": { "firstCommit": 2014, "commits": 1218, "committers": 147, "files": 4341 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "jsonnet", "libsonnet" ], "aceMode": "text", "tmScope": "source.jsonnet", "repos": 1430, "id": "Jsonnet" }, "githubBigQuery": { "repos": 190, "users": 104, "id": "Jsonnet" } }, "jsparagus": { "title": "jsparagus", "appeared": 2018, "type": "grammarLanguage", "description": "A JavaScript parser written in Rust", "githubRepo": { "stars": 386, "forks": 21, "subscribers": 17, "created": 2018, "updated": 2023, "description": "Experimental JS parser-generator project.", "issues": 110, "url": "https://github.com/mozilla-spidermonkey/jsparagus" }, "repoStats": { "firstCommit": 2018, "commits": 7125, "committers": 17, "files": 177 } }, "jspp": { "title": "JS++", "appeared": 2011, "type": "pl", "creators": [ "Roger Poon", "Anton Rapetov" ], "website": "https://onux.com/jspp/", "fileExtensions": [ "jspp" ], "country": [ "United Kingdom" ], "originCommunity": [ "Onux" ], "compilesTo": [ "javascript" ], "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasStrings": { "example": "", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasInheritance": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "console.log" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "auto", "break", "bool", "byte", "catch", "char", "class", "continue", "debugger", "delete", "do", "double", "else", "enum", "external", "false", "final", "finally", "float", "for", "foreach", "function", "if", "import", "in", "instanceof", "int", "interface", "long", "module", "new", "null", "override", "overwrite", "private", "protected", "property", "public", "return", "short", "signed", "string", "super", "switch", "static", "this", "true", "try", "typeid", "typeof", "undefined", "unsigned", "var", "virtual", "void", "while", "with", "yield" ], "wikipedia": { "example": [ "1 int x = 1; // declares the variable x with an \"internal type\" (JS++ type)\n2 var y = 2; // declares the variable y with an \"external type\" (JavaScript type)\n3 bool z = true; // declares the variable z with an \"internal type\" (JS++ type)" ], "url": "https://en.wikipedia.org/wiki/JS%2B%2B" } }, "jsx": { "title": "JSX", "appeared": 2013, "type": "template", "website": "http://reactjs.org", "reference": [ "https://en.wikipedia.org/wiki/React_(JavaScript_library)#JSX" ], "country": [ "United States" ], "originCommunity": [ "Facebook" ], "domainName": { "registered": 2013, "awisRank": { "2022": 2151 }, "name": "reactjs.org" }, "example": [ "class App extends React.Component {\n render() {\n return (\n
\n

Header

\n

Content

\n

Footer

\n
\n );\n }\n}" ], "githubLanguage": { "fileExtensions": [ "jsx" ], "trendingProjectsCount": 0, "id": "JSX" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 20, "commitCount": 298, "sampleCount": 1, "example": [ "'use strict';\n\nconst React = require('react')\n\nmodule.exports = React.createClass({\n render: function() {\n let {feeds, log} = this.props;\n\n log.info(feeds);\n return
\n

News Feed's

\n
    \n {feeds.map(function(feed) {\n return
  • \n {feed.data && feed.data.length > 0 ?\n {feed.name} ({feed.data.length})\n : 'feed.name' }\n
    • \n })}\n
\n
;\n }\n});" ], "url": "https://github.com/github-linguist/babel-sublime" }, "twitter": "https://twitter.com/reactjs", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "jsyn": { "title": "JSyn", "appeared": 2010, "type": "pl", "reference": [ "http://www.softsynth.com/jsyn/docs/compiling.php" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/philburk/jsyn/issues" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6396", "centralPackageRepositoryCount": 0 }, "judoscript": { "title": "Judoscript", "appeared": 2001, "type": "pl", "creators": [ "James Jianbo Huang" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/metaprgmr/Judoscript/issues" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "// print out information found inside HTML\ndo 'http://www.example.com' as sgml {\n : println 'Found a hyperlink:' , $_.href;\n

: println 'Found a paragraph tag.';\n TEXT: println 'Found some text:' , $_.length();\n}" ], "related": [ "python", "ruby", "perl", "smalltalk", "java" ], "summary": "Judoscript is one of several general purpose programming languages designed primarily for scripting on the Java platform. Its originator and primary developer is software engineer James Jianbo Huang.", "created": 2007, "backlinksCount": 12, "pageId": 13570551, "revisionCount": 31, "dailyPageViews": 4, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Judoscript" }, "leachim6": { "filepath": "j/JudoScript", "example": [ ". \"Hello World\";\n" ], "id": "JudoScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:JudoScript", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "juicy": { "title": "juicy", "appeared": 2017, "type": "pl", "creators": [ "Jonathan Avery" ], "description": "Juicy is a low-level, compiled, purely functional, highly generic language with inferred types and tail recursion.", "country": [ "New Zealand" ], "originCommunity": [ "https://github.com/GordianNaught/Juicy/issues" ], "githubRepo": { "stars": 8, "forks": 0, "subscribers": 2, "created": 2017, "updated": 2019, "firstCommit": 2017, "description": "Juicy Language Compiler", "issues": 0, "url": "https://github.com/GordianNaught/Juicy" }, "repoStats": { "firstCommit": 2017, "commits": 76, "committers": 2, "files": 55 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "jule": { "title": "Jule", "appeared": 2021, "type": "pl", "creators": [ "Mertcan Davulcu" ], "description": "Jule is the simple, efficient, statically typed and compiled system programming language.", "website": "https://jule.dev", "documentation": [ "https://jule.dev/pages/docs.html" ], "fileExtensions": [ ".jule" ], "country": [ "Turkey" ], "nativeLanguage": "false", "originCommunity": [ "Beykoz Okan University" ], "domainName": { "registered": 2022, "name": "jule.dev" }, "writtenIn": [ "go", "c", "cpp" ], "influencedBy": [ "c", "cpp", "rust", "go" ], "visualParadigm": false, "hasStrings": { "example": "\"Jule String Literal\"\n`Jule Raw String Literal`", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment\n/* A comment */", "value": true }, "hasMultiLineComments": { "example": "/*\n A multi line comment\n*/", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasPointers": { "example": "let ptr: *int = nil", "value": true }, "hasFunctions": { "example": "fn a_function() {\n // ...\n}", "value": true }, "hasFunctionOverloading": { "example": "", "value": false }, "hasMethods": { "example": "impl MyStruct {\n fn my_method(self) {}\n}", "value": true }, "hasMethodOverloading": { "example": "", "value": false }, "hasMaps": { "example": "let my_map: [int:str] = {\n 0: \"Key 0\",\n 1: \"Key 1\",\n 2: \"Key 2\",\n}", "value": true }, "hasTraits": { "example": "trait Person {\n fn get_full_name(self): str\n fn get_age(self): byte\n}", "value": true }, "hasGenerics": { "example": "fn generic_function[T](s: []T) {\n // ...\n}", "value": true }, "hasBooleans": { "example": "true false", "value": true }, "hasConstants": { "example": "const PI = 3.14159265359", "value": true }, "hasGarbageCollection": { "example": "", "value": false }, "hasNull": { "example": "nil", "value": true }, "hasAnonymousFunctions": { "example": "let anonymous = fn() {\n outln(\"Anonymous Function\")\n}\nanonymous()", "value": true }, "hasBreak": { "example": "break\nbreak a_label", "value": true }, "hasContinue": { "example": "continue\ncontinue a_label", "value": true }, "hasEnums": { "example": "enum ExitCode {\n Success = 0,\n Failure = 1\n}", "value": true }, "hasFloats": { "example": "3.14\n32.60\n032.60\n3.\n0.3\n1E2\n.12345E+6\n1.e+0\n0x1p-2\n0x2.p10\n0x1.Fp+0\n0X.8p-0\n0x1fffp-16\n0x15e-2", "value": true }, "hasIntegers": { "example": "12345\n0b0001010101\n0455\n0xDFF90", "value": true }, "hasStructs": { "example": "struct Employee {\n first_name: str\n last_name: str\n salary: f32\n}", "value": true }, "hasHexadecimals": { "example": "0xDFF90", "value": true }, "hasOctals": { "example": "0455", "value": true }, "hasDecimals": { "example": "12345", "value": true }, "hasBinaryNumbers": { "example": "0b0001010101", "value": true }, "hasVoidFunctions": { "example": "fn a_void_function() {\n // ...\n}", "value": true }, "hasScientificNotation": { "example": "1E2\n.12345E+6\n1.e+0\n0x15e-2\n0x2.p10\n0X.8p-0\n0x1.Fp+0\n0x1fffp-16\n0x1p-2", "value": true }, "hasPolymorphism": { "example": "", "value": false }, "hasGlobalScope": { "example": "", "value": true }, "hasValueReturnedFunctions": { "example": "fn get_pi(): f64 {\n ret 3.14159265359\n}", "value": true }, "hasDirectives": { "example": "", "value": true }, "hasBitWiseOperators": { "example": "& | ^ << >>", "value": true }, "hasOperatorOverloading": { "example": "", "value": false }, "hasUserDefinedOperators": { "example": "", "value": false }, "hasAssertStatements": { "example": "use std::debug\nuse std::debug::assert::{assert}\n\nfn main() {\n std::debug::ENABLE = true\n let x = 200\n assert(x < 200)\n}", "value": true }, "hasVariadicFunctions": { "example": "fn average(x: ...f64): f64 {\n // ...\n}", "value": true }, "hasUnaryOperators": { "example": "* & - + ^ !", "value": true }, "hasDependentTypes": { "example": "int uint uintptr", "value": true }, "hasFnArguments": { "example": "", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "canReadCommandLineArgs": { "example": "use std::os::{ARGS}\n\nfn main() {\n outln(ARGS)\n}", "value": true }, "hasForEachLoops": { "example": "for x, y in my_enumerable {\n // ...\n}", "value": true }, "hasForLoops": { "example": "// Jule has for loops with while-next iterations\nlet mut i = 0\nfor i < 10; i++ {\n // ...\n}", "value": true }, "hasWhileLoops": { "example": "for my_condition {\n // ...\n}", "value": true }, "hasDocComments": { "example": "// Documentation comment for a_function\nfn a_function() {}", "value": true }, "hasIfs": { "example": "", "value": true }, "hasIfElses": { "example": "", "value": true }, "hasDynamicSizedArrays": { "example": "let mut a_slice = [1, 2, 3, 4, 5, 6]\na_slice = append(a_slice, 7, 8, 9, 10)", "value": true }, "hasLabels": { "example": "a_label:", "value": true }, "hasGotos": { "example": "goto a_label", "value": true }, "hasRequiredMainFunction": { "example": "fn main() {}", "value": true }, "hasSelfOrThisWord": { "example": "self", "value": true }, "hasBoundedCheckedArrays": { "example": "let arr: [5]byte = ['a', 'b', 'c', 'd', 'e']", "value": true }, "hasTernaryOperators": { "example": "", "value": false }, "hasStatementTerminatorCharacter": { "example": ";", "value": true }, "hasStatements": { "example": "", "value": true }, "canUseQuestionMarksAsPartOfIdentifier": { "example": "", "value": false }, "hasThreads": { "example": "fn my_thread() {\n outln(\"Hello from thread\")\n}\n\nfn main() {\n co my_thread()\n}", "value": true }, "hasAssignment": { "example": "let mut x = 0\nx = 20", "value": true }, "hasTypeAnnotations": { "example": "let x: f64 = 89", "value": true }, "hasAccessModifiers": { "example": "pub", "value": true }, "hasAsyncAwait": { "example": "", "value": false }, "hasTryCatch": { "example": "", "value": false }, "hasMemberVariables": { "example": "", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": false }, "hasReservedWords": { "example": "", "value": true }, "hasSwitch": { "example": "match X {\n| Y: outln(\"X is Y\")\n| Z: outln(\"X is Z\")\n| A | B | C: outln(\"X is A, B, or C\")\n|: outln(\"X is not Y, Z, A, B and C\")\n}", "value": true }, "hasDuckTyping": { "example": "fn lock_object[T](obj: T) {\n obj.lock()\n}", "value": true }, "isLisp": { "example": "", "value": false }, "hasArraySlicingSyntax": { "example": "sliceable_expression[start_index:to_index]", "value": true }, "hasExplicitTypeCasting": { "example": "let x = (int)(3.14)", "value": true }, "hasManualMemoryManagement": { "example": "use std::mem::c::{malloc, free}\n\nfn main() {\n let mut ptr = malloc(8)\n free(ptr)\n ptr = nil\n}", "value": true }, "hasConditionals": { "example": "if BOOLEAN_EXPRESSION {\n outln(\"\"Condition is true)\n}", "value": true }, "hasIncrementAndDecrementOperators": { "example": "++\n--", "value": true }, "hasStaticTyping": { "example": "", "value": true }, "canWriteToDisk": { "example": "use std::fs::{open, O_WRONLY}\n\nfn main() {\n let (mut f, _) = open(\"myfile.txt\", O_WRONLY, 0)\n let bytes = ([]byte)(\"Text to write\")\n f.write(bytes)\n f.close()\n}", "value": true }, "hasStringConcatOperator": { "example": "+", "value": true }, "hasMultilineStrings": { "example": "`Multiline strings\nis available in Jule\nwith raw strings`", "value": true }, "hasImports": { "example": "use std::fs\nuse std::sys::{self, open, O_RDWR}\nuse std::math::*", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "outln" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "includeToken": [ [ "use" ] ], "keywords": [ "fn", "pub", "struct", "enum", "unsafe", "const", "let", "mut", "self", "match", "if", "else", "for", "in", "impl", "trait", "break", "continue", "goto", "cpp", "i8", "i16", "i32", "i64", "u8", "u16", "u32", "u64", "f32", "f64", "str", "int", "uint", "type", "any", "true", "false", "bool", "ret", "fall", "nil", "uintptr", "co" ], "example": [ "fn quicksort(mut s: []int) {\n if s.len <= 1 {\n ret\n }\n let mut i = 0\n for i < s.len-1; i++ {\n let (mut x, mut y) = &s[i], &s[i+1]\n unsafe {\n if *x > *y {\n *x, *y = *y, *x\n }\n }\n }\n quicksort(s[:i])\n quicksort(s[i+1:])\n}\n\nfn main() {\n let mut s = [1, 9, -2, 25, -24, 4623, 0, -1, 0xFD2]\n outln(s)\n quicksort(s)\n outln(s)\n}", "fn main() {\n outln(\"Hello World\")\n}", "use std::math::{PI}\n\ntrait Shape {\n fn area(self): int\n}\n\nstruct Rectangle {\n width: int\n height: int\n}\n\nimpl Shape for Rectangle {\n fn area(self): int {\n ret self.width * self.height\n }\n}\n\nstruct Circle {\n r: f32\n}\n\nimpl Shape for Circle {\n fn area(self): int {\n ret PI * self.r * self.r\n }\n}\n\nfn main() {\n let rect: Shape = Rectangle{90, 5}\n let circ: Shape = Circle{90.5}\n outln(rect.area())\n outln(circ.area())\n}" ], "githubRepo": { "firstCommit": 2021, "stars": 60, "forks": 9, "subscribers": 5, "created": 2021, "updated": 2022, "description": "Jule is the simple, efficient, statically typed and compiled system programming language.", "issues": 12, "url": "https://github.com/julelang/jule" }, "repoStats": { "firstCommit": 2021, "commits": 1847, "committers": 7, "files": 216 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "julia-lang": { "title": "Joyfully Universal Language for (Inline) Assembly", "appeared": 2016, "type": "pl", "description": "JULIA is an intermediate language that can compile to various different backends (EVM 1.0, EVM 1.5 and eWASM are planned). Because of that, it is designed to be a usable common denominator of all three platforms. It can already be used for “inline assembly” inside Solidity and future versions of the Solidity compiler will even use JULIA as intermediate language. It should also be easy to build high-level optimizer stages for JULIA.", "reference": [ "https://solidity.readthedocs.io/en/v0.4.21/julia.html" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/ethereum" ], "example": [ "{\n function power(base:u256, exponent:u256) -> result:u256\n {\n switch exponent\n case 0:u256 { result := 1:u256 }\n case 1:u256 { result := base }\n default:\n {\n result := power(mul(base, base), div(exponent, 2:u256))\n switch mod(exponent, 2:u256)\n case 1:u256 { result := mul(base, result) }\n }\n }\n}" ] }, "julia": { "title": "Julia", "appeared": 2012, "type": "pl", "creators": [ "Jeff Bezanson", "Alan Edelman", "Stefan Karpinski", "Viral B. Shah" ], "website": "http://julialang.org/", "documentation": [ "https://docs.julialang.org/en/v1/" ], "fileExtensions": [ "jl" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/JuliaLang" ], "domainName": { "awisRank": { "2022": 60667 }, "name": "julialang.org" }, "releaseNotesUrl": "https://docs.julialang.org/en/v1/NEWS/", "visualParadigm": false, "hasMacros": { "example": "# https://jkrumbiegel.com/pages/2021-06-07-macros-for-beginners/\nmacro show_value(variable)\n quote\n println(\"The \", $(string(variable)), \" you passed is \", $(esc(variable)))\n end\nend\n\n@show_value(orange)\n@show_value(apple)", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasMultipleDispatch": { "example": "collide_with(x::Asteroid, y::Asteroid) = ... # deal with asteroid hitting asteroid\ncollide_with(x::Asteroid, y::Spaceship) = ... # deal with asteroid hitting spaceship\ncollide_with(x::Spaceship, y::Asteroid) = ... # deal with spaceship hitting asteroid\ncollide_with(x::Spaceship, y::Spaceship) = ... # deal with spaceship hitting spaceship", "value": true }, "hasUnicodeIdentifiers": { "example": "δ = 0.00001", "value": true }, "hasComments": { "example": "# This is a comment", "value": true }, "hasMultiLineComments": { "example": "#=\nA comment.\n=#", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasIntegers": { "example": "80766866", "value": true }, "hasPrintDebugging": { "example": "print(\"hello world\")", "value": true }, "hasImports": { "example": "# Files and file names are mostly unrelated to modules; modules are associated only with module expressions.\n# One can have multiple files per module, and multiple modules per file:\nusing MyModule\nusing MyModule: x, p\nimport MyModule\nimport MyModule.x, MyModule.p\nimport MyModule: x, p\nmodule Foo\ninclude(\"file1.jl\")\ninclude(\"file2.jl\")\nend", "value": true }, "hasMixins": { "example": "# Including the same code in different modules provides mixin-like behavior.\nmodule Normal\ninclude(\"mycode.jl\")\nend\n\nmodule Testing\ninclude(\"safe_operators.jl\")\ninclude(\"mycode.jl\")\nend", "value": true }, "hasPipes": { "example": "[1,2,3] |> (y -> f(3, y))", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasModules": { "example": "module MyModule\nusing Lib\n\nusing BigLib: thing1, thing2\n\nimport Base.show\n\nexport MyType, foo\n\nstruct MyType\n x\nend\n\nbar(x) = 2x\nfoo(a::MyType) = bar(a.x) + 1\n\nshow(io::IO, a::MyType) = print(io, \"MyType $(a.x)\")\nend", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "# 0o[0-7]+((_[0-7]+)+)?", "value": true }, "hasHexadecimals": { "example": "# 0x[a-fA-F0-9]+((_[a-fA-F0-9]+)+)?", "value": true }, "hasFloats": { "example": "# (\\d+((_\\d+)+)?\\.(?!\\.)(\\d+((_\\d+)+)?)?|\\.\\d+((_\\d+)+)?)([eEf][+-]?[0-9]+)?", "value": true }, "hasBinaryNumbers": { "example": "# 0b[01]+((_[01]+)+)?", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "#=", "=#" ] ], "printToken": [ [ "print" ], [ "println" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "begin", "while", "if", "for", "try", "return", "break", "continue", "function", "macro", "quote", "let", "local", "global", "const", "do", "struct", "abstract", "typealias", "bitstype", "type", "immutable", "module", "baremodule", "using", "import", "export", "importall", "end", "else", "catch", "finally", "true", "false" ], "gource": "https://www.youtube.com/watch?v=n3chDPl19jI", "githubRepo": { "stars": 41515, "forks": 5100, "subscribers": 952, "created": 2011, "updated": 2023, "description": "The Julia Programming Language", "issues": 4420, "url": "https://github.com/JuliaLang/julia" }, "repoStats": { "firstCommit": 2009, "commits": 62820, "committers": 1731, "files": 1531 }, "wikipedia": { "example": [ "julia> p(x) = 2x^2 + 1; f(x, y) = 1 + 2p(x)y\njulia> println(\"Hello world!\", \" I'm on cloud \", f(0, 4), \" as Julia supports recognizable syntax!\")\nHello world! I'm on cloud 9 as Julia supports recognizable syntax!" ], "related": [ "c", "scheme", "llvmir", "fortran", "ia-32", "linux", "freebsd", "lisp", "lua", "mathematica", "wolfram", "matlab", "perl", "python", "r", "ruby", "regex", "unicode", "utf-8", "common-lisp", "dylan", "algol", "fortress", "html", "xml", "json", "arm", "powerpc" ], "summary": "Julia is a high-level dynamic programming language designed to address the needs of high-performance numerical analysis and computational science, without the typical need of separate compilation to be fast, while also being effective for general-purpose programming, web use or as a specification language. Distinctive aspects of Julia's design include a type system with parametric polymorphism and types in a fully dynamic programming language and multiple dispatch as its core programming paradigm. It allows concurrent, parallel and distributed computing, and direct calling of C and Fortran libraries without glue code. Julia is garbage-collected, uses eager evaluation and includes efficient libraries for floating-point calculations, linear algebra, random number generation, fast Fourier transforms and regular expression matching.", "pageId": 38455554, "dailyPageViews": 640, "created": 2012, "backlinksCount": 377, "revisionCount": 1075, "appeared": 2012, "fileExtensions": [ "jl" ], "url": "https://en.wikipedia.org/wiki/Julia_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "jl" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nJuliaLang julia https://github.com/JuliaLang.png https://github.com/JuliaLang/julia Julia #a270ba 23614 3524 510 \"The Julia Language: A fresh approach to technical computing.\"\nJuliaLang IJulia.jl https://github.com/JuliaLang.png https://github.com/JuliaLang/IJulia.jl Julia #a270ba 1780 298 38 \"Julia kernel for Jupyter\"", "trendingProjectsCount": 3, "type": "programming", "interpreters": [ "julia" ], "aceMode": "julia", "codemirrorMode": "julia", "codemirrorMimeType": "text/x-julia", "tmScope": "source.julia", "repos": 53507, "id": "Julia" }, "githubBigQuery": { "repos": 5895, "users": 2536, "id": "Julia" }, "monaco": "julia", "codeMirror": "julia", "pygmentsHighlighter": { "filename": "julia.py", "fileExtensions": [ "jl" ], "id": "Julia" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 21, "commitCount": 191, "sampleCount": 2, "example": [ "#!/usr/bin/env julia\n\n# From https://github.com/JoshCheek/language-sampler-for-fullpath/blob/b766dcdbd249ec63516f491390a75315e78cba95/julia/fullpath\nhelp_screen = \"\"\"\nusage: fullpath *[relative-paths] [-c]\n\n Prints the fullpath of the paths\n If no paths are given as args, it will read them from stdin\n\n If there is only one path, the trailing newline is omitted\n\n The -c flag will copy the results into your pasteboard\n\"\"\"\n\nhelp = false\ncopy = false\ndir = pwd()\npaths = []\n\nfor arg = ARGS\n if arg == \"-h\" || arg == \"--help\"\n help = true\n elseif arg == \"-c\" || arg == \"--copy\"\n copy = true\n elseif arg != \"\"\n push!(paths, arg)\n end\nend\n\nif help\n print(help_screen)\n exit()\nend\n\nfunction notempty(string)\n return !isempty(string)\nend\n\nif length(paths) == 0\n paths = filter(notempty, map(chomp, readlines()))\nend\n\nfunction print_paths(stream, paths)\n if length(paths) == 1\n path = paths[1]\n print(stream, \"$dir/$path\")\n else\n for path = paths\n println(stream, \"$dir/$path\")\n end\n end\nend\n\nif copy\n read, write, process = readandwrite(`pbcopy`)\n print_paths(write, paths)\n close(write)\nend\n\nprint_paths(STDOUT, paths)\n" ], "url": "https://github.com/JuliaEditorSupport/atom-language-julia" }, "languageServerProtocolProject": [ "https://github.com/JuliaEditorSupport/LanguageServer.jl\nwrittenIn julia" ], "projectEuler": { "memberCount": { "2019": 331, "2022": 700 }, "id": "Julia" }, "helloWorldCollection": [ "# Hello world in Julia\n\nprintln(\"Hello, World!\")" ], "leachim6": { "filepath": "j/Julia.jl", "fileExtensions": [ "jl" ], "example": [ "println(\"Hello World\")\n" ], "id": "Julia" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Julia", "quineRelay": "Julia", "rijuRepl": { "example": [ "println(\"Hello, world!\")\n" ], "id": "https://riju.codes/julia" }, "tryItOnline": "julia", "indeedJobs": { "2017": 85, "query": "julia engineer" }, "stackOverflowSurvey": { "2021": { "users": 1068, "medianSalary": 65228, "fans": 2445, "percentageUsing": 0.01 } }, "officialBlogUrl": [ "https://julialang.org/blog/" ], "eventsPageUrl": [ "https://discourse.julialang.org/c/community/events/56" ], "faqPageUrl": [ "https://discourse.julialang.org/faq" ], "downloadPageUrl": [ "https://julialang.org/downloads/" ], "subreddit": [ { "memberCount": { "2017": 3660, "2022": 20624 }, "url": "https://reddit.com/r/Julia" } ], "meetup": { "memberCount": 15211, "groupCount": 36, "url": "https://www.meetup.com/topics/julia" }, "tiobe": { "currentRank": 35, "id": "Julia" }, "pypl": "Julia", "packageRepository": [ "https://pkg.julialang.org/" ], "twitter": "https://twitter.com/julialanguage", "ubuntuPackage": "julia", "jupyterKernel": [ "https://github.com/JuliaLang/IJulia.jl" ], "fileType": "text", "wordRank": 7592, "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2020|SAV Publishing|The Little Book of Julia Algorithms: A workbook to develop fluency in Julia programming|Sengupta, Ahan and Lau, William|9781838173609\n2019|Independently published|Julia Programming for Operations Research|Kwon, Changhyun|9781798205471\n2017|Apress|Beginning Julia Programming: For Engineers and Scientists|Nagar, Sandeep|9781484231715\n2019|Apress|Julia Quick Syntax Reference: A Pocket Guide for Data Science Programming|Lobianco, Antonello|9781484251898\n2019-06-10T00:00:01Z|Packt Publishing|Julia High Performance: Optimizations, distributed computing, multithreading, and GPU programming with Julia 1.0 and beyond, 2nd Edition|Sengupta, Avik|9781788298117\n2019|McGraw-Hill Education TAB|Tanmay Teaches Julia for Beginners: A Springboard to Machine Learning for All Ages|Bakshi, Tanmay|9781260456646\n2019|Packt Publishing|Julia High Performance: Optimizations, distributed computing, multithreading, and GPU programming with Julia 1.0 and beyond, 2nd Edition|Sengupta, Avik|9781788292306\n2018|Packt Publishing|Julia Programming Projects: Learn Julia 1.x by building apps for data analysis, visualization, machine learning, and the web|Salceanu, Adrian|9781788297257\n2019|Packt Publishing|Julia 1.0 Programming Complete Reference Guide: Discover Julia, a high-performance language for technical computing|Balbaert, Ivo and Salceanu, Adrian|9781838824679\n2019|Packt Publishing|Julia 1.0 Programming Complete Reference Guide: Discover Julia, a high-performance language for technical computing|Balbaert, Ivo and Salceanu, Adrian|9781838822248\n2018|Packt Publishing|Julia Programming Projects: Learn Julia 1.x by building apps for data analysis, visualization, machine learning, and the web|Salceanu, Adrian|9781788292740\n2018|Packt Publishing|Julia 1.0 Programming: Dynamic and high-performance programming to build fast scientific applications, 2nd Edition|Balbaert, Ivo|9781788990059\n2019|McGraw-Hill Education TAB|Tanmay Teaches Julia for Beginners: A Springboard to Machine Learning for All Ages|Bakshi, Tanmay|9781260456639\n2018-11-29T00:00:01Z|Packt Publishing|Julia 1.0 Programming Cookbook: Over 100 numerical and distributed computing recipes for your daily data science workflow|Kaminski, Bogumil and Szufel, Przemyslaw|9781788998369\n2016|Packt Publishing|Julia High Performance|Sengupta, Avik|9781785887826\n2021|BPB Publications|Hands-On Julia Programming: An Authoritative Guide to the Production-Ready Systems in Julia (English Edition)|Dash, Sambit Kumar|9789391030889\n2018|Packt Publishing|Julia 1.0 Programming: Dynamic and high-performance programming to build fast scientific applications, 2nd Edition|Balbaert, Ivo|9781788999090\n2016|CreateSpace Independent Publishing Platform|Julia Programming for Operations Research: A Primer on Computing|Kwon, Changhyun|9781533328793\n2016|Packt Publishing|Julia Cookbook|Rohit, Jalem Raj|9781785882012\n2018|Packt Publishing|Julia 1.0 Programming Cookbook: Over 100 numerical and distributed computing recipes for your daily data science workflow|Kamiński, Bogumił and Szufel, Przemysław|9781788998826\n2017-11-27T00:00:01Z|Apress|Beginning Julia Programming: For Engineers and Scientists|Nagar, Sandeep|9781484231708\n2018|Springer|Numerical Linear Algebra: A Concise Introduction with MATLAB and Julia (Springer Undergraduate Mathematics Series)|Bornemann, Folkmar|9783319742229", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Optim: A mathematical optimization package for Julia|10.21105/JOSS.00615|198|8|P. K. Mogensen and A. N. Riseth|5b9beb63591876dc225ea00e04d77498fc28a5ea\n2017|Effective Extensible Programming: Unleashing Julia on GPUs|10.1109/TPDS.2018.2872064|78|4|Tim Besard and Christophe Foket and B. De Sutter|7d905f4b07f6eb91177edcf307bc80f9f5c1f33a\n2017|Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language|10.1145/3087604.3087611|61|5|C. Fieker and W. Hart and Tommy Hofmann and Fredrik Johansson|05272de903f0d6ce2bfe6651b53e9147d0d233a5\n2019|Julia for robotics: simulation and real-time control in a high-level programming language|10.1109/ICRA.2019.8793875|28|0|T. Koolen and R. Deits|dbae8cb7428e868cfacd210cda2cc50364f191be\n2016|ToQ.jl: A high-level programming language for D-Wave machines based on Julia|10.1109/HPEC.2016.7761616|27|3|D. O'Malley and V. Vesselinov|3b98415124b1d661f0c29f030d7f4ae67ca4978a\n2020|Gridap: An extensible Finite Element toolbox in Julia|10.21105/joss.02520|25|1|S. Badia and F. Verdugo|27276e58e2d6c5f44d02185534638e6519f9cae8\n2016|Systems Modeling and Programming in a Unified Environment Based on Julia|10.1007/978-3-319-47169-3_15|25|2|H. Elmqvist and T. Henningsson and M. Otter|9a2ebe28b9786c7a6afb0122b8228d084be23f3f\n2021|Makie.jl: Flexible high-performance data visualization for Julia|10.21105/joss.03349|19|1|S. Danisch and Julius Krumbiegel|725fcbf7514d2464e5540972dfa16ed7ebea9949\n2018|GaussianProcesses.jl: A Nonparametric Bayes Package for the Julia Language|10.18637/jss.v102.i01|13|1|Jamie Fairbrother and C. Nemeth and M. Rischard and Johanni Brea and Thomas Pinder|915aa124c64dc217b69b1c2e50a22c69e04a5c05\n2019|Illustrating the Benefits of Openness: A Large-Scale Spatial Economic Dispatch Model Using the Julia Language|10.3390/EN12061153|12|0|Jens Weibezahn and M. Kendziorski|a304837d021df72ccd0a7edeb69e049626ae9569\n2020|A New Kid on the Block: Application of Julia to Hartree-Fock Calculations.|10.1021/acs.jctc.0c00337|8|0|David L. Poole and Jorge L. Galvez Vallejo and M. Gordon|8d9735c0cb63af04356f32dc15ba2ac36e07fb64\n2019|Efficient Stochastic Programming in Julia|10.1287/ijoc.2022.1158|8|1|Martin Biel and M. Johansson|84694fa560d1eaf48e9a1a191709529c56561838\n2016|JuPOETs: a constrained multiobjective optimization approach to estimate biochemical model ensembles in the Julia programming language|10.1186/s12918-016-0380-2|8|1|D. Bassen and Michael Vilkhovoy and Mason Minot and J. Butcher and J. Varner|80405e5f33de6bea69c162c1e204e34c04ec7e85\n2014|Experimental Multi-threading Support for the Julia Programming Language|10.1109/HPTCDL.2014.11|7|0|T. Knopp|7d31348dd404654dd26031091125e56941e64b2e\n2020|BioStructures.jl: read, write and manipulate macromolecular structures in Julia|10.1093/bioinformatics/btaa502|6|0|Joe G. Greener and Joel Selvaraj and Ben Ward|9e75082cb736566d8ceb53dacdda6065b7fb3264\n2020|NetworkDynamics.jl - Composing and simulating complex networks in Julia|10.1063/5.0051387|6|0|Michael Q. Lindner and Lucas Lincoln and Fenja Drauschke and J. M. Koulen and Hannes Würfel and A. Plietzsch and F. Hellmann|9e7d4d08eee494f88042aa2829bac1cdd8f36910\n2021|MRIReco.jl: An MRI reconstruction framework written in Julia|10.1002/mrm.28792|6|0|T. Knopp and M. Grosser|0e7b3a418f2c49671b802fa3c5435860a520349a\n2020|Performance of Julia for High Energy Physics Analyses|10.1007/s41781-021-00053-3|6|2|M. Stanitzki and J. Strube|1cfdfc910076aee3a9798ef6552ac944dfccefe1\n2021|Metatheory.jl: Fast and Elegant Algebraic Computation in Julia with Extensible Equality Saturation|10.21105/joss.03078|4|0|Alessandro Cheli|46b544baa83079f1a59bdafc13e63a2583e27f57\n2021|EBIC.JL: an efficient implementation of evolutionary biclustering algorithm in Julia|10.1145/3449726.3463197|3|0|Pawel Renc and P. Orzechowski and A. Byrski and Jaroslaw Was and J. Moore|b288b373226d3145347f05d7ea9c13c590efdcb4\n2020|WordTokenizers.jl: Basic tools for tokenizing natural language in Julia|10.21105/joss.01956|3|0|Ayush Kaushal and Lyndon White and Mike Innes and Rohit Kumar|19a981faaf3c2be82298f214bf5b80a38c4ce0eb\n2020|The JuliaConnectoR: a functionally oriented interface for integrating Julia in R|10.18637/jss.v101.i06|2|0|S. Lenz and Maren Hackenberg and H. Binder|ca7fd29ec1460159815f8424f1dfb93177623efd\n2020|Archmodels.Jl: Estimating Arch Models in Julia|10.2139/ssrn.3551503|2|1|S. Broda and Marc S. Paolella|7f6b300bc93f948345a85689c297f8dcb685930a\n2021|Comparing Julia to Performance Portable Parallel Programming Models for HPC|10.1109/PMBS54543.2021.00016|2|0|Wei-Chen Lin and S. McIntosh-Smith|53aa513eb7efba2755658cff885056f45c83b361\n2019|Statistically significant performance testing of Julia scientific programming language|10.1088/1742-6596/1205/1/012017|2|0|M. N. Gevorkyan and A. V. Demidova and A. Korolkova and D. Kulyabov|7f1df9117e930987fde207b23ba3bf0dfc453f77\n2022|Plots.jl - a user extendable plotting API for the julia programming language|10.48550/arXiv.2204.08775|2|0|Simon Christ and D. Schwabeneder and Christopher Rackauckas|677154c1f6140ea18aea3674a258347a3f08d61a\n2020|Julia Programming Language Benchmark Using a Flight Simulation|10.1109/AERO47225.2020.9172277|2|0|R. Sells|3763cc8a899da4a106f0d84b6c1ed1496cb081fc\n2020|\"JlBox v1.0: A Julia based mixed-phase atmospheric chemistry\nbox-model\"|10.5194/gmd-2020-344|1|1|La-mei Huang and D. Topping|c6b7f380d0818a97e5e04e261c7bb66523c5c8e7\n2021|Rapid prototyping of evolution-driven biclustering methods in Julia|10.1145/3449726.3462739|1|0|Pawel Renc and P. Orzechowski and A. Byrski and Jaroslaw Was and J. Moore|b4eaa7e68500e18841d8ecbbaf75389e188f4cb3\n2021|RADIv1: a non-steady-state early diagenetic model for ocean sediments in Julia and MATLAB/GNU Octave|10.5194/gmd-2021-211|1|0|Olivier Sulpis and M. Humphreys and M. Wilhelmus and D. Carroll and W. Berelson and D. Menemenlis and Jack Middelburg and J. Adkins|9c31814ff2a9ccee98588ba2ff21ed496563356c\n2021|AuditoryStimuli.jl: A Julia package for generating real-time auditory stimuli|10.21105/joss.03613|1|0|R. Luke|6233b051235e6a0f44a8e15afc9258abd1247e66\n2020|Application of a numerical-analytical approach in the process of modeling differential equations in the Julia language|10.1088/1742-6596/1694/1/012026|1|0|A. V. Fedorov and A. O. Masolova and A. Korolkova and D. S. Kulyabov|d5379b60247a15e6009b5b4961c70fa90e892bd7\n2021|Julia Language in Computational Mechanics: A New Competitor|10.1007/s11831-021-09636-0|1|0|Lei Xiao and Gang Mei and Ning Xi and F. Piccialli|1ef389a28b48ff11e8da8bb26a79ce7c0853e841\n2019|The Usage of Julia Programming in Grounding Grids Simulations : An alternative to MATLAB and Python|10.1109/sipda47030.2019.8951702|1|0|Rodolfo A. R. Moura and M. Schroeder and S. J. S. Silva and E. Nepomuceno and P. H. N. Vieira and A. Lima|183303bc57f9f6b3c05c5828dd34a02b19a4784b\n2018|An Overview of the Julia Programming Language|10.1145/3277104.3277119|1|0|Tyler A. Cabutto and Sean P. Heeney and S. Ault and Guifen Mao and Jin Wang|3e62ce30a835230fa8d51c053e4bd2541cfc5fb8" }, "juliahub-pm": { "title": "JuliaHub Packages", "appeared": 2014, "type": "packageManager", "website": "https://juliahub.com/ui/Packages", "country": [ "Various" ], "originCommunity": [ "https://juliahub.com/products/overview/" ], "packageCount": 7820, "forLanguages": [ "julia" ] }, "juniper": { "title": "juniper", "appeared": 2016, "type": "pl", "creators": [ "Caleb Helbling" ], "description": "Juniper is a functional reactive programming language for the Arduino and other related platforms.", "website": "http://www.juniper-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/calebh/Juniper/issues" ], "domainName": { "registered": 2016, "name": "juniper-lang.org" }, "githubRepo": { "firstCommit": 2016, "stars": 49, "forks": 5, "subscribers": 5, "created": 2019, "updated": 2022, "description": "FRP (Functional Reactive Programming) for the Arduino and other microcontrollers", "issues": 3, "url": "https://github.com/calebh/Juniper" }, "repoStats": { "firstCommit": 2016, "commits": 190, "committers": 8, "files": 48 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "juno": { "title": "Juno", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f93f30709197d92646042966ada5501da9cf0d32" ], "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1153", "centralPackageRepositoryCount": 0 }, "jupyter-editor": { "title": "Project Jupyter", "appeared": 2014, "type": "editor", "website": "https://jupyter.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/jupyter/" ], "domainName": { "registered": 2014, "awisRank": { "2022": 12546 }, "name": "jupyter.org" }, "wikipedia": { "related": [ "julia", "python", "r", "haskell", "ruby", "json", "markdown", "html", "latex", "restructuredtext", "jquery", "maple", "mathematica", "sagemath", "mathematica-editor", "octave", "rstudio-editor", "scilab", "spyder-editor" ], "summary": "Project Jupyter ( ( listen)) is a nonprofit organization created to \"develop open-source software, open-standards, and services for interactive computing across dozens of programming languages.\" Spun-off from IPython in 2014 by Fernando Pérez, Project Jupyter supports execution environments in several dozen languages. Project Jupyter's name is a reference to the three core programming languages supported by Jupyter, which are Julia, Python and R, and also an homage to Galileo's notebooks recording the discovery of the moons of Jupiter. Project Jupyter has developed and supported the interactive computing products Jupyter Notebook, Jupyter Hub, and Jupyter Lab, the next-generation version of Jupyter Notebook.", "pageId": 57313979, "created": 2018, "backlinksCount": 17, "revisionCount": 45, "dailyPageViews": 477, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/Project_Jupyter" }, "fileType": "na", "centralPackageRepositoryCount": 0 }, "jupyter-notebook": { "title": "Jupyter Notebook", "appeared": 2014, "type": "jsonFormat", "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "githubLanguage": { "fileExtensions": [ "ipynb" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ndennybritz reinforcement-learning https://github.com/dennybritz.png https://github.com/dennybritz/reinforcement-learning \"Jupyter Notebook\" #DA5B0B 12487 4093 1355 \"Implementation of Reinforcement Learning Algorithms. Python, OpenAI Gym, Tensorflow. Exercises and Solutions to accompany Sutton's Book and David Silver's course.\"\nPierian-Data Complete-Python-3-Bootcamp https://github.com/Pierian-Data.png https://github.com/Pierian-Data/Complete-Python-3-Bootcamp \"Jupyter Notebook\" #DA5B0B 5658 20594 573 \"Course Files for Complete Python 3 Bootcamp Course on Udemy\"\nfengdu78 Data-Science-Notes https://github.com/fengdu78.png https://github.com/fengdu78/Data-Science-Notes \"Jupyter Notebook\" #DA5B0B 1043 357 644 数据科学的笔记以及资料搜集\nmml-book mml-book.github.io https://github.com/mml-book.png https://github.com/mml-book/mml-book.github.io \"Jupyter Notebook\" #DA5B0B 3148 696 519 \"Companion webpage to the book \"\"Mathematics For Machine Learning\"\"\"\nwesm pydata-book https://github.com/wesm.png https://github.com/wesm/pydata-book \"Jupyter Notebook\" #DA5B0B 9801 8258 375 \"Materials and IPython notebooks for \"\"Python for Data Analysis\"\" by Wes McKinney, published by O'Reilly Media\"\nGokuMohandas practicalAI https://github.com/GokuMohandas.png https://github.com/GokuMohandas/practicalAI \"Jupyter Notebook\" #DA5B0B 20319 3671 950 \"📚 A practical approach to machine learning.\"\ntensorflow examples https://github.com/tensorflow.png https://github.com/tensorflow/examples \"Jupyter Notebook\" #DA5B0B 1410 1203 413 \"TensorFlow examples\"\njackfrued Python-100-Days https://github.com/jackfrued.png https://github.com/jackfrued/Python-100-Days \"Jupyter Notebook\" #DA5B0B 58876 22244 6333 \"Python - 100天从新手到大师\"\nCyb3rWard0g ThreatHunter-Playbook https://github.com/Cyb3rWard0g.png https://github.com/Cyb3rWard0g/ThreatHunter-Playbook \"Jupyter Notebook\" #DA5B0B 1663 386 117 \"A Threat hunter's playbook to aid the development of techniques and hypothesis for hunting campaigns.\"\nfastai fastai_dev https://github.com/fastai.png https://github.com/fastai/fastai_dev \"Jupyter Notebook\" #DA5B0B 352 221 54 \"development of the next version of fastai\"\ndragen1860 TensorFlow-2.x-Tutorials https://github.com/dragen1860.png https://github.com/dragen1860/TensorFlow-2.x-Tutorials \"Jupyter Notebook\" #DA5B0B 1573 475 234 \"TensorFlow 2.x version's Tutorials and Examples, including CNN, RNN, GAN, Auto-Encoders, FasterRCNN, GPT, BERT examples, etc. TF 2.0版入门实例代码，实战教程。\"\naimacode aima-python https://github.com/aimacode.png https://github.com/aimacode/aima-python \"Jupyter Notebook\" #DA5B0B 3999 1856 89 \"Python implementation of algorithms from Russell And Norvig's \"\"Artificial Intelligence - A Modern Approach\"\"\"\npytorch vision https://github.com/pytorch.png https://github.com/pytorch/vision \"Jupyter Notebook\" #DA5B0B 4298 2064 305 \"Datasets, Transforms and Models specific to Computer Vision\"\njeffheaton t81_558_deep_learning https://github.com/jeffheaton.png https://github.com/jeffheaton/t81_558_deep_learning \"Jupyter Notebook\" #DA5B0B 1024 569 86 \"Washington University (in St. Louis) Course T81-558: Applications of Deep Neural Networks\"\nmahmoud awesome-python-applications https://github.com/mahmoud.png https://github.com/mahmoud/awesome-python-applications \"Jupyter Notebook\" #DA5B0B 9008 1627 328 \"💿 Free software that works great, and also happens to be open-source Python.\"\njantic DeOldify https://github.com/jantic.png https://github.com/jantic/DeOldify \"Jupyter Notebook\" #DA5B0B 7935 827 597 \"A Deep Learning based project for colorizing and restoring old images (and video!)\"\nKulbear deep-learning-coursera https://github.com/Kulbear.png https://github.com/Kulbear/deep-learning-coursera \"Jupyter Notebook\" #DA5B0B 4257 3374 134 \"Deep Learning Specialization by Andrew Ng on Coursera.\"\nguipsamora pandas_exercises https://github.com/guipsamora.png https://github.com/guipsamora/pandas_exercises \"Jupyter Notebook\" #DA5B0B 3224 2747 185 \"Practice your pandas skills!\"\napachecn Interview https://github.com/apachecn.png https://github.com/apachecn/Interview \"Jupyter Notebook\" #DA5B0B 4061 1377 454 \"Interview = 简历指南 + LeetCode + Kaggle\"\nhuseinzol05 Stock-Prediction-Models https://github.com/huseinzol05.png https://github.com/huseinzol05/Stock-Prediction-Models \"Jupyter Notebook\" #DA5B0B 857 402 121 \"Gathers machine learning and deep learning models for Stock forecasting including trading bots and simulations\"\nfchollet deep-learning-with-python-notebooks https://github.com/fchollet.png https://github.com/fchollet/deep-learning-with-python-notebooks \"Jupyter Notebook\" #DA5B0B 7940 3819 297 \"Jupyter notebooks for the code samples of the book \"\"Deep Learning with Python\"\"\"\ndsgiitr d2l-pytorch https://github.com/dsgiitr.png https://github.com/dsgiitr/d2l-pytorch \"Jupyter Notebook\" #DA5B0B 845 163 420 \"This project reproduces the book Dive Into Deep Learning (www.d2l.ai), adapting the code from MXNet into PyTorch.\"\nAzure Azure-Sentinel https://github.com/Azure.png https://github.com/Azure/Azure-Sentinel \"Jupyter Notebook\" #DA5B0B 267 88 31 \"Cloud-native SIEM for intelligent security analytics for your entire enterprise.\"\nultralytics yolov3 https://github.com/ultralytics.png https://github.com/ultralytics/yolov3 \"Jupyter Notebook\" #DA5B0B 2214 611 211 \"YOLOv3 in PyTorch > ONNX > CoreML > iOS\"\nudacity deep-reinforcement-learning https://github.com/udacity.png https://github.com/udacity/deep-reinforcement-learning \"Jupyter Notebook\" #DA5B0B 2580 1112 92 \"Repo for the Deep Reinforcement Learning Nanodegree program\"", "trendingProjectsCount": 26, "type": "markup", "filenames": [ "Notebook" ], "aceMode": "json", "codemirrorMode": "javascript", "codemirrorMimeType": "application/json", "tmScope": "source.json", "aliases": [ "IPython Notebook" ], "repos": 137996, "id": "Jupyter Notebook" }, "githubBigQuery": { "repos": 17210, "users": 13715, "id": "Jupyter Notebook" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 11, "commitCount": 21, "sampleCount": 1, "example": [ "{\n \"cells\": [\n {\n \"cell_type\": \"markdown\",\n \"metadata\": {},\n \"source\": [\n \"# Morphological image operations\\n\",\n \"\\n\",\n \"** Bird Counting **\\n\",\n \"\\n\",\n \"I've used some simple morphological image operations from scipy.morphology module.\\n\",\n \"\\n\",\n \"The goal was to count how many birds were in an image\\n\",\n \"\\n\",\n \"Here are the steps taken :\\n\",\n \"\\n\",\n \"1. Load the image as an ndimage matrix object\\n\",\n \"2. Filter all pixels for those with a color tone less than 100/255\\n\",\n \"3. Get a binary representation of the pixels that satisfy the condition in step 2\\n\",\n \"4. Apply some dilation and erosion in order to get rid of noise and isolate the birds\\n\",\n \"5. Count all contiguous areas\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 2,\n \"metadata\": {\n \"collapsed\": false,\n \"scrolled\": true\n },\n \"outputs\": [\n {\n \"name\": \"stdout\",\n \"output_type\": \"stream\",\n \"text\": [\n \"Original image:\\n\"\n ]\n },\n {\n \"data\": {\n \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAAV0AAADtCAYAAAAcNaZ2AAAABHNCSVQICAgIfAhkiAAAAAlwSFlz\\nAAALEgAACxIB0t1+/AAAIABJREFUeJzsvVusrVl23/Ubl/mttfc5dcqu6u60YycxAScGKSRCgKVE\\nOMgPQEMUbAkcQoQQTzxEPCCBUACDECgIkCMZkSdEBEQmxEmQIiwegoQfEiPidmwcx8E2sR2F2N3E\\nfa+qs/f65hxj8DDmPg6SXWXZUvPAnlKpTtU5a6+15jfnuPwv40hV8bye1/N6Xs/rq7P0/+sP8Lye\\n1/N6Xv9/Ws9B93k9r+f1vL6K6znoPq/n9bye11dxPQfd5/W8ntfz+iqu56D7vJ7X83peX8X1HHSf\\n1/N6Xs/rq7j8w35TRJ71ZM/reT2v5/VrWFUlv9z//9CgC/DDP/llqopMY7GoBBAyE1UlIgBDMKoK\\nM6NyAQVaVCYFqCpQVDhoYCogQAkuQokSLCAZGKsUUbAMAkHNWRlYQRagRVKIGGQiqhBKyeJJe9zv\\nqRRJZSIyQIPK4qLCEgDFgBKh6I9kFCJFhKEiiAZzJuKGFkQlIqC5QIwQZUiRoihJpiIoYfW0+/1V\\nC6RAqkgVQIglqAXzhMykqpgpIMLKoKawFIhiVvSPI6h0qqr/SSNkYgClLBRHQRNSQJPbbXEuZc7k\\ngzN4bzof3G48TlgrmUsIlDMCKFyU2DsyRElulF7xTFIEop//JDnEueVEJZiroAYiIAmlIJK4G3cO\\nMwJlMCvJLFYmyH5KoSBCVTFUmNnfL6chHlQuVg2GGhmJepC5QA1NowoKQWWCDBIhmSgHqxKXhUD/\\nXhajjNQbWnBLY1giUmQYJavPdComQUgiDKoAFYQbswaQiCg6C7GFfvAaub+HOgjv50YJJQIEUQUy\\n0RrIbjRF6Z/BIghUB" ], "url": "https://github.com/textmate/json.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "just": { "title": "Just", "appeared": 2021, "type": "pl", "description": "Just: A language like Make except not a build system", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/ljdj30/just_a_language_like_make_except_not_a_build/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/casey/just/issues" ] }, "juttle": { "title": "juttle", "appeared": 2014, "type": "pl", "website": "http://www.jut.io/play", "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "juttle" ], "id": "Juttle" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8735887|Show HN: Juttle language Playground|2014-12-11 17:17:13 UTC|1418318233|leakybucket|1|22" }, "juvix": { "title": "juvix", "appeared": 2017, "type": "pl", "creators": [ "Christopher Goes" ], "website": "https://juvix.org", "country": [ "Various" ], "originCommunity": [ "https://github.com/anoma/" ], "domainName": { "registered": 2017, "name": "juvix.org" }, "githubRepo": { "firstCommit": 2017, "stars": 301, "forks": 18, "subscribers": 34, "created": 2017, "updated": 2022, "description": "Juvix empowers developers to write code in a high-level, functional language, compile it to gas-efficient output VM instructions, and formally verify the safety of their contracts prior to deployment and execution.", "issues": 57, "url": "https://github.com/cryptiumlabs/juvix" }, "repoStats": { "firstCommit": 2021, "commits": 1212, "committers": 14, "files": 1544 } }, "jvm": { "title": "JVM", "appeared": 1994, "type": "vm", "standsFor": "Java Virtual Machine", "originCommunity": [ "Sun Microsystems" ], "wikipedia": { "related": [ "java-bytecode", "jruby", "jython", "ruby", "python", "clojure", "groovy", "scala", "kotlin", "android" ], "summary": "A Java virtual machine (JVM) is a virtual machine that enables a computer to run Java programs as well as programs written in other languages and compiled to Java bytecode. The JVM is detailed by a specification that formally describes what is required of a JVM implementation. Having a specification ensures interoperability of Java programs across different implementations so that program authors using the Java Development Kit (JDK) need not worry about idiosyncrasies of the underlying hardware platform. The JVM reference implementation is developed by the OpenJDK project as open source code and includes a JIT compiler called HotSpot. The commercially supported Java releases available from Oracle Corporation are based on the OpenJDK runtime.", "pageId": 16389, "created": 2002, "backlinksCount": 497, "revisionCount": 1210, "dailyPageViews": 918, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Java_virtual_machine" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "jython": { "title": "Jython", "appeared": 2001, "type": "pl", "country": [ "United States and United Kingdom" ], "originCommunity": [ "https://github.com/jython" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "python", "java", "c", "java-bytecode" ], "summary": "Jython is an implementation of the Python programming language designed to run on the Java platform. It is the successor of JPython.", "pageId": 390263, "created": 2003, "backlinksCount": 197, "revisionCount": 364, "dailyPageViews": 173, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Jython" }, "leachim6": { "filepath": "j/Jython.py", "fileExtensions": [ "py" ], "example": [ "print \"Hello World\"" ], "id": "Jython" }, "jupyterKernel": [ "https://github.com/fiber-space/jupyter-kernel-jsr223", "https://github.com/suvarchal/IJython" ], "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nJython for Java Programmers|2001|Robert Bill|1506585|2.33|3|0\nPython Programming with the Java� Class Libraries: A Tutorial for Building Web and Enterprise Applications with Jython|1996|Richard Hightower|774737|3.00|1|1\nThe Definitive Guide to Jython: Python for the Java Platform (Expert's Voice in Software Development)|2010|Jim Baker|40475508|5.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n2002|O'Reilly Media|Jython Essentials (O'Reilly Scripting)|Pedroni, Samuele and Rappin, Noel|9780596002473\n2001|Sams Publishing|Jython for Java Programmers|Bill, Robert|9780735711112\n2010|Springer|Scientific Data Analysis using Jython Scripting and Java (Advanced Information and Knowledge Processing)|Chekanov, Sergei V.|9781849962872\n2002|Addison-Wesley Professional|Python Programming with the Java¿ Class Libraries: A Tutorial for Building Web and Enterprise Applications with Jython|Hightower, Richard|9780201616163\n|John Wiley & Sons|Jython Programming||9780782140606\n20020321|O'Reilly Media, Inc.|Jython Essentials|Samuele Pedroni|9781449397906\n20020321|O'Reilly Media, Inc.|Jython Essentials|Samuele Pedroni; Noel Rappin|9781449397777", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Scientific Data Analysis using Jython Scripting and Java|10.1007/978-1-84996-287-2|19|0|S. Chekanov|80d69908e8742d29634f5367c36d0a15498a81ed\n2009|CSP as a Domain-Specific Language Embedded in Python and Jython|10.3233/978-1-60750-065-0-293|15|0|S. Mount and Mohammad Hammoudeh and Sam Wilson and R. Newman|4cfaf832b2ba26b30a584a5055361de505d6d5b8" }, "k-framework": { "title": "k-framework", "appeared": 2013, "type": "grammarLanguage", "creators": [ "(no author)" ], "website": "http://www.kframework.org/", "country": [ "Various" ], "originCommunity": [ "Runtime Verification Inc." ], "domainName": { "registered": 2013, "awisRank": { "2022": 4988305 }, "name": "kframework.org" }, "githubRepo": { "firstCommit": 2010, "stars": 330, "forks": 102, "subscribers": 33, "created": 2016, "updated": 2022, "description": "K Framework Tools 5.0", "issues": 103, "url": "https://github.com/runtimeverification/k" }, "repoStats": { "firstCommit": 2010, "commits": 19780, "committers": 165, "files": 6092 } }, "k": { "title": "K", "appeared": 1993, "type": "pl", "creators": [ "Arthur Whitney" ], "description": "K is like APL, but K restricts itself to the ASCII character set.", "country": [ "United States" ], "originCommunity": [ "Kx Systems" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "/ A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasHexadecimals": { "example": "/ [0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}", "value": true }, "hasFloats": { "example": "/ ([0-9]*[.]?[0-9]+|[0-9]+[.]?[0-9]*)[eE][+-]?[0-9]+[ef]?", "value": true }, "hasIntegers": { "example": "/ [0-9]+[ihtuv]", "value": true }, "hasBinaryNumbers": { "example": "/ [01]+b", "value": true }, "lineCommentToken": [ [ "/" ] ], "wikipedia": { "related": [ "scheme", "q", "apl", "sql", "j", "sql-92", "solaris", "linux" ], "summary": "K is a proprietary array processing language developed by Arthur Whitney and commercialized by Kx Systems. Since then, an open-source implementation known as Kona has also been developed. The language serves as the foundation for kdb+, an in-memory, column-based database, and other related financial products. The language, originally developed in 1993, is a variant of APL and contains elements of Scheme. Advocates of the language emphasize its speed, facility in handling arrays, and expressive syntax.", "pageId": 890956, "dailyPageViews": 113, "created": 2004, "backlinksCount": 42, "revisionCount": 221, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/K_(programming_language)" }, "pygmentsHighlighter": { "filename": "q.py", "fileExtensions": [ "k" ], "id": "K" }, "projectEuler": { "memberCount": { "2019": 332, "2022": 2478 }, "id": "APL/J/K" }, "helloWorldCollection": [ "/ Hello world in K\n\n\"Hello world!\"" ], "leachim6": { "filepath": "k/K.k", "fileExtensions": [ "k" ], "example": [ "\"Hello World\\n\"" ], "id": "K" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:K", "hopl": "https://hopl.info/showlanguage.prx?exp=2142", "fileType": "text", "wordRank": 381, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Label-Based Programming Language Semantics in K Framework with SDF|10.1109/SYNASC.2012.23|5|0|Denis Bogdanas|2d2c7913677cd28c7d2717cf08f5a812349e5d16" }, "kaffeine": { "title": "Kaffeine", "appeared": 2010, "type": "pl", "creators": [ "Jonah Fox" ], "website": "https://web.archive.org/web/20201111200507/http://learn-krft.studioamplify.com/kaffeine/", "fileExtensions": [ "k" ], "country": [ "Ireland" ], "originCommunity": [ "Studio Amplify" ], "githubRepo": { "stars": 182, "forks": 16, "subscribers": 10, "created": 2010, "updated": 2012, "description": "Extended Javascript for Pros", "url": "https://github.com/weepy/kaffeine" }, "repoStats": { "firstCommit": 2010, "commits": 235, "committers": 13, "files": 315 } }, "kaggle-app": { "title": "Kaggle", "appeared": 2010, "type": "application", "website": "https://www.kaggle.com/", "country": [ "Unknown" ], "originCommunity": [ "Google" ], "domainName": { "registered": 2009, "awisRank": { "2022": 1448 }, "name": "kaggle.com" }, "wikipedia": { "summary": "Kaggle is an online community of data scientists and machine learners, owned by Google LLC. Kaggle allows users to find and publish data sets, explore and build models in a web-based data-science environment, work with other data scientists and machine learning engineers, and enter competitions to solve data science challenges. Kaggle got its start by offering machine learning competitions and now also offers a public data platform, a cloud-based workbench for data science, and short form AI education. On 8 March 2017, Google announced that they were acquiring Kaggle.", "backlinksCount": 57, "pageId": 31663650, "dailyPageViews": 392, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Kaggle" } }, "kai": { "title": "kai", "appeared": 2016, "type": "pl", "description": "An expressive low level programming language", "website": "http://docs.kai-lang.org", "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/kai-language" ], "domainName": { "name": "docs.kai-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/* // github.com/kai-language/issues/116\n#test \"bitcast to struct\" {\n A :: struct {\n a: rawptr\n }\n x : rawptr = nil\n a := bitcast(A) x\n} */" ], "githubRepo": { "firstCommit": 2016, "stars": 68, "forks": 1, "subscribers": 4, "created": 2016, "updated": 2020, "description": "An expressive low level programming language", "issues": 37, "url": "https://github.com/kai-language/kai" }, "repoStats": { "firstCommit": 2016, "commits": 1003, "committers": 11, "files": 116 } }, "kail": { "title": "KAIL", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4eb4d775fe40d3582da9982196336ac06439f61a" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3764", "centralPackageRepositoryCount": 0 }, "kaitai": { "title": "kaitai", "appeared": 2016, "type": "idl", "creators": [ "Mikhail Yakshin" ], "description": "Kaitai Struct is a YAML-based declarative language used to describe various binary data structures, laid out in files or in memory: i.e. binary file formats, network stream packet formats, etc. The main idea is that a particular format is described in Kaitai Struct language (.ksy file) and then can be compiled with ksc into source files in one of the supported programming languages. These modules will include a generated code for a parser that can read described data structure from a file / stream and give access to it in a nice, easy-to-comprehend API.", "website": "http://kaitai.io/", "webRepl": [ "https://ide.kaitai.io/" ], "reference": [ "http://kaitai.io/" ], "fileExtensions": [ "ksy" ], "country": [ "Various" ], "originCommunity": [ "http://kaitai.io/" ], "domainName": { "registered": 2016, "awisRank": { "2022": 1411715 }, "name": "kaitai.io" }, "related": [ "protobuf" ], "example": [ "meta:\n id: tcp_segment\n endian: be\nseq:\n - id: src_port\n type: u2\n - id: dst_port\n type: u2\n - id: seq_num\n type: u4\n - id: ack_num\n type: u4" ], "githubRepo": { "firstCommit": 2016, "stars": 3040, "forks": 154, "subscribers": 93, "created": 2016, "updated": 2022, "description": "Kaitai Struct: declarative language to generate binary data parsers in C++ / C# / Go / Java / JavaScript / Lua / Perl / PHP / Python / Ruby", "issues": 449, "url": "https://github.com/kaitai-io/kaitai_struct" }, "repoStats": { "firstCommit": 2016, "commits": 943, "committers": 16, "files": 23 }, "twitter": "https://twitter.com/kaitai_io", "isbndb": "", "semanticScholar": "" }, "kakoune-editor": { "title": "Kakoune", "appeared": 2011, "type": "editor", "website": "http://kakoune.org", "country": [ "Australia" ], "originCommunity": [ "https://github.com/mawww/kakoune/issues" ], "githubRepo": { "stars": 8496, "forks": 672, "subscribers": 115, "created": 2011, "updated": 2022, "description": "mawww's experiment for a better code editor", "issues": 803, "url": "https://github.com/mawww/kakoune/" } }, "kal": { "title": "Kal", "appeared": 2012, "type": "pl", "description": "Kal is a highly readable, easy-to-use language that compiles to JavaScript.", "website": "http://rzimmerman.github.io/kal", "country": [ "United States" ], "originCommunity": [ "https://github.com/rzimmerman/kal/issues" ], "compilesTo": [ "javascript" ], "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "example": [ "task getUserFriends (userName)\n wait for user from db.users.findOne {name:userName}\n wait for friends from db.friends.find {userId:user.id}\n return friends" ], "githubRepo": { "stars": 394, "forks": 17, "subscribers": 26, "created": 2012, "updated": 2014, "description": "A powerful, easy-to-use, and easy-to-read programming language for the future.", "url": "https://github.com/rzimmerman/kal" }, "repoStats": { "firstCommit": 2012, "commits": 444, "committers": 6, "files": 47 }, "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "kal" ], "id": "Kal" }, "isbndb": "" }, "kaleidoquery": { "title": "Kaleidoquery", "appeared": 1998, "type": "pl", "reference": [ "https://pdfs.semanticscholar.org/fab9/29854929ffe94372fe0f69a252e476392c65.pdf" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Salford", "University of Manchester", "University of Central Lancashire" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4984", "centralPackageRepositoryCount": 0 }, "kaleidoscope": { "title": "Kaleidoscope", "appeared": 1994, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "wikipedia": { "example": [ "always: temperature = mercury.height / scale;\nalways: white rectangle( thermometer );\nalways: grey rectangle( mercury );\nalways: display number( temperature );\nwhile mouse.button = down do\n mercury.top = mouse.location.y;\nend while;" ], "summary": "The Kaleidoscope programming language is a constraint programming language embedding constraints into an imperative object-oriented language. It adds keywords always, once, and assert..during (formerly while..assert) to make statements about relational invariants. Objects have constraint constructors, which are not methods, to enforce the meanings of user-defined datatypes. There are three versions of Kaleidoscope which show an evolution from declarative to an increasingly imperative style. Differences between them are as follows.", "pageId": 4400159, "created": 2006, "backlinksCount": 6, "revisionCount": 19, "dailyPageViews": 8, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Kaleidoscope_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2143", "fileType": "text", "centralPackageRepositoryCount": 0 }, "kaleidoscope90": { "title": "Kaleidoscope'90", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/16ccfcac9ea24b4c1a8134b03f8eab667493a4d6" ], "country": [ "United States and Canada" ], "originCommunity": [ "University of Victoria", "University of Washington" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4182", "centralPackageRepositoryCount": 0 }, "kaleidoscope91": { "title": "Kaleidoscope'91", "appeared": 1991, "type": "pl", "reference": [ "https://pdfs.semanticscholar.org/b017/832ad395f70322f99152bc40504bcd290ea7.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4183", "centralPackageRepositoryCount": 0 }, "kalyn": { "title": "Kalyn", "appeared": 2020, "type": "pl", "creators": [ "Radon Rosborough" ], "website": "https://intuitiveexplanations.com/tech/kalyn", "country": [ "United States" ], "originCommunity": [ "https://github.com/radian-software/" ], "githubRepo": { "firstCommit": 2020, "stars": 117, "forks": 2, "subscribers": 2, "created": 2020, "updated": 2022, "description": "⚗️ Self-hosting compiler from a Haskell-like Lisp directly to x86-64, from scratch.", "issues": 20, "url": "https://github.com/radian-software/kalyn" }, "repoStats": { "firstCommit": 2020, "commits": 330, "committers": 2, "files": 80 }, "rijuRepl": { "example": [ "(import \"/opt/kalyn/Stdlib.kalyn\")\n\n(public def main (IO Empty)\n (print \"Hello, world!\\n\"))\n" ], "id": "https://riju.codes/kalyn" } }, "kamby": { "title": "Kamby", "appeared": 2022, "type": "pl", "creators": [ "Henrique Gogó" ], "description": "A small, embeddable and convenient language for who want to use and understand what is happening behind the scenes. The core is just ~400LOC and binary has just 20kb", "website": "https://kamby.org/", "webRepl": [ "https://kamby.org/" ], "reference": [ "https://news.ycombinator.com/item?id=32761113" ], "country": [ "Brazil" ], "originCommunity": [ "https://github.com/henriquegogo/kamby/issues" ], "influencedBy": [ "lisp" ], "example": [ "planet = [\n name := 'World'\n nick := 'Earth'\n]\n\n'Hello, ' + (planet :: {name})\n " ], "githubRepo": { "stars": 75, "forks": 2, "subscribers": 1, "created": 2022, "updated": 2023, "description": "Kamby Language", "issues": 4, "url": "https://github.com/henriquegogo/kamby" }, "repoStats": { "firstCommit": 2022, "commits": 92, "committers": 1, "files": 14 } }, "kami": { "title": "Kami", "appeared": 2022, "type": "textMarkup", "creators": [ "Katie Ampersand" ], "website": "https://crates.io/crates/kami-parser", "fileExtensions": [ "km" ], "country": [ "Unknown" ], "originCommunity": [ "https://ampersandia.net/" ], "example": [ "* Main list element\n** Sublist element" ], "githubRepo": { "firstCommit": 2022, "stars": 1, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "description": "Kami tries to be a machine-first human-also-first markup language.", "issues": 3, "url": "https://github.com/Lilith-In-Starlight/kami-parser" }, "repoStats": { "firstCommit": 2022, "commits": 81, "committers": 1, "files": 12 } }, "kamilalisp": { "title": "KamilaLisp", "appeared": 2021, "type": "pl", "creators": [ "Kamila Szewczyk" ], "website": "https://github.com/kspalaiologos/kamilalisp", "country": [ "Germany" ], "originCommunity": [ "https://github.com/kspalaiologos/kamilalisp/issues" ], "githubRepo": { "stars": 67, "forks": 5, "subscribers": 5, "created": 2021, "updated": 2023, "description": "A functional, flexible and concise Lisp.", "issues": 0, "url": "https://github.com/kspalaiologos/kamilalisp" }, "repoStats": { "firstCommit": 2021, "commits": 1288, "committers": 7, "files": 11603 } }, "kaml": { "title": "KAML", "appeared": 2018, "type": "dataNotation", "reference": [ "https://github.com/ISLEcode/KAML/blob/master/kaml-specifications.md#about" ], "standsFor": "KAML ain't markup language", "country": [ "Switzerland" ], "originCommunity": [ "https://github.com/ISLEcode" ], "supersetOf": [ "yaml", "json" ], "example": [ "title=\"KAML Example\" # A simple string\nauthor=Jean-Michel\\ Marcastel # Alternate string representation with escaped whitespaces\nnumber=1234 # Numeric value handled as a string" ], "githubRepo": { "stars": 3, "forks": 0, "subscribers": 2, "created": 2018, "updated": 2020, "description": "KAML ain't markup language", "issues": 0, "url": "https://github.com/ISLEcode/KAML" }, "repoStats": { "firstCommit": 2018, "commits": 59, "committers": 2, "files": 6 } }, "karel": { "title": "Karel", "appeared": 1981, "type": "pl", "creators": [ "Richard E. Pattis" ], "country": [ "United States" ], "originCommunity": [ "University of California, Irvine" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "WRITE" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "BEGINNING-OF-PROGRAM\n \n DEFINE turnRight AS\n BEGIN\n turnLeft;\n turnLeft;\n turnLeft;\n END\n \n BEGINNING-OF-EXECUTION\n ITERATE 3 TIMES\n BEGIN\n turnRight;\n move\n END\n turnoff\n END-OF-EXECUTION\n \nEND-OF-PROGRAM" ], "related": [ "pascal", "java", "javascript", "robomind" ], "summary": "Karel is an educational programming language for beginners, created by Richard E. Pattis in his book Karel The Robot: A Gentle Introduction to the Art of Programming. Pattis used the language in his courses at Stanford University, California. The language is named after Karel Čapek, a Czech writer who introduced the word robot.", "pageId": 1433925, "dailyPageViews": 91, "created": 2005, "backlinksCount": 27, "revisionCount": 205, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/Karel_(programming_language)" }, "leachim6": { "filepath": "k/Karel.kl", "fileExtensions": [ "kl" ], "example": [ "PROGRAM hello_world\nBEGIN\n WRITE(\"Hello World\", CR)\nEND hello_world\n" ], "id": "Karel" }, "hopl": "https://hopl.info/showlanguage.prx?exp=958", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1995|Wiley|Karel The Robot: A Gentle Introduction to the Art of Programming|Pattis, Richard E.|9780471597254\n2013|Dreamsongs Press|Karel J Robot: A Gentle Introduction to the Art of Object-Oriented Programming in Java|Bergin, Joseph and Stehlik, Mark and Roberts, Jim and Pattis, Richard|9780970579515\n2013|Software Tools|Beyond Karel J Robot: A Gentle Introduction to the Art of Object-Oriented Programming in Java, Volume 2|Bergin, Joseph|9780985154301\n1994|Wiley|Karel the Robot: A Gentle Introduction to the Art of Programming|Pattis, Richard E.|9780471089285\n2011||Karel (programming Language)|Jordan Naoum|9786136725284\n1994|John Wiley And Sons (wie)|Karel The Robot: Gentle Introduction To The Art Of Programming|Richard E. Pattis|9780471117339\n|John Wiley & Sons Inc|Concepts in Java 2, 2e with Karel C++ Set||9780471398080\n1995|Wiley|Mac Software To Accompany Karel The Robot: A Gentle Introduction To The Art Of Programming 2e|Richard E. Pattis|9780471107057\n1995|Wiley|Ibm Software To Accompany Karel The Robot: A Gentle Introduction To The Art Of Programming, Second Edition|Richard E. Pattis|9780471107026\n1994|John Wiley & Sons Inc|Karel The Robot - A Gentle Introduction To The Art Of Object Oriented Programming 2e Tm Pattis, Richard E.|Richard E. Pattis|9780471308362" }, "karl": { "title": "Knowledge Acquisition and Representation Language", "appeared": 1993, "type": "pl", "description": "Knowledge Acquisition and Representation Language", "reference": [ "https://ieeexplore.ieee.org/document/706055" ], "standsFor": "Knowledge Acquisition and Representation Language", "country": [ "Germany" ], "originCommunity": [ "University of Karlsruhe", "University of Applied Sciences Braunschweig" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4189", "wordRank": 7595 }, "kasaya": { "title": "kasaya", "appeared": 2018, "type": "application", "description": "A \"WYSIWYG\" (kind of) scripting language and runtime for browser automation", "reference": [ "https://news.ycombinator.com/item?id=22374991" ], "country": [ "Sri Lanka" ], "originCommunity": [ "https://github.com/syscolabs" ], "githubRepo": { "firstCommit": 2020, "stars": 1365, "forks": 39, "subscribers": 19, "created": 2018, "updated": 2020, "description": "A \"WYSIWYG\" (kind of) scripting language and runtime for browser automation", "issues": 17, "url": "https://github.com/AshanthaLahiru/kasaya" } }, "kate-editor": { "title": "kate-editor", "appeared": 2000, "type": "editor", "description": "Kate is a multi-document editor part of KDE since release 2.2. Being a KDE application, Kate ships with network transparency, as well as integration with the outstanding features of KDE. Choose it for viewing HTML sources from konqueror, editing configuration files, writing new applications or any other text editing task. You still need just one running instance of Kate.", "website": "https://kate-editor.org/", "country": [ "Germany" ], "originCommunity": [ "KDE e.V." ], "domainName": { "registered": 2005, "awisRank": { "2022": 412280 }, "name": "kate-editor.org" } }, "kate": { "title": "KATE", "appeared": 1979, "type": "pl", "reference": [ "https://www.semanticscholar.org/paper/Discussion-and-Correspondence-KATE%3A-A-for-Extending-Teskey/e6292f6b0b1033f1415cb4d044532cae3ae73dc5" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Kent" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6135", "wordRank": 5053, "centralPackageRepositoryCount": 0 }, "katex": { "title": "KaTeX", "appeared": 2013, "type": "textMarkup", "creators": [ "Emily Eisenberg" ], "description": "The fastest math typesetting library for the web.", "website": "https://katex.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/KaTeX" ], "domainName": { "awisRank": { "2022": 186120 }, "name": "katex.org" }, "hasLineComments": { "example": "% A comment", "value": true }, "hasComments": { "example": "% A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "%" ] ], "example": [ "% \\f is defined as #1f(#2) using the macro\n\\f\\relax{x} = \\int_{-\\infty}^\\infty\n \\f\\hat\\xi\\,e^{2 \\pi i \\xi x}\n \\,d\\xi" ], "githubRepo": { "firstCommit": 2013, "stars": 15539, "forks": 1061, "subscribers": 278, "created": 2013, "updated": 2022, "description": "Fast math typesetting for the web.", "issues": 341, "url": "https://github.com/Khan/KaTeX" }, "repoStats": { "firstCommit": 2013, "commits": 2311, "committers": 171, "files": 696 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "kaukatcr": { "title": "kaukatcr", "appeared": 2018, "type": "pl", "description": "Kaukatcr (pronounced “cowcatcher”[3]) is a stack-based language modeled loosely on Forth. It avoids tokenization by treating cell boundaries as word boundaries. Like Forth, any word that is neither a built-in nor found in the dictionary of defined functions will be treated as data and pushed onto the stack.", "reference": [ "https://github.com/enkiv2/misc/blob/master/ds-lib/kaukatcr.py" ], "country": [ "United States" ], "originCommunity": [ "https://www.lord-enki.net/" ] }, "kavascript": { "title": "KavaScript", "appeared": 2021, "type": "pl", "creators": [ "Maxime Chevalier-Boisvert" ], "website": "https://github.com/maximecb/kavascript/", "country": [ "Canada" ], "originCommunity": [ "https://github.com/maximecb/kavascript/issues" ], "writtenIn": [ "rust" ], "githubRepo": { "stars": 21, "forks": 2, "subscribers": 1, "created": 2021, "updated": 2022, "description": "Minimalistic dynamically-typed programming language for didactic purposes.", "url": "https://github.com/maximecb/kavascript/" }, "repoStats": { "firstCommit": 2021, "commits": 88, "committers": 2, "files": 11 } }, "kawa-scheme-implementation": { "title": "Kawa", "appeared": 1996, "type": "pl", "creators": [ "Per Bothner" ], "country": [ "United States" ], "originCommunity": [ "GNU Project" ], "wikipedia": { "example": [ "$ java -jar /path/to/kawa/kawa.jar [optional arguments] ..." ], "related": [ "lisp", "java", "scheme", "jvm" ], "summary": "Kawa is a language framework written in the programming language Java that implements the programming language Scheme, a dialect of Lisp, and can be used to implement other languages to run on the Java virtual machine (JVM). It is a part of the GNU Project. The name Kawa comes from the Polish word for coffee; a play on words, since Java is another familiar name for coffee.", "created": 2007, "backlinksCount": 62, "pageId": 12304060, "revisionCount": 82, "dailyPageViews": 29, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Kawa_%28Scheme_implementation%29" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "kayia": { "title": "kayia", "appeared": 1999, "type": "pl", "creators": [ "David Broderick" ], "description": "Kayia is a way to construct a “declarative reactive” language based on a labeled, directed graph of edges. The excitement that I have with Kayia is that I think it has the potential to give software construction “the arch”, or that missing abstraction mechanism that has been holding it back. That’s a bold statement but I am attempting to prove that, because of its ability to start from such fine elements, simply A|B, and its capacity to manage yet not obstruct constructions of those elements, we can get higher-resolution constructions with greater control at the same time.", "website": "https://kayia.com/", "reference": [ "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "country": [ "United States", "Czech Republic" ], "originCommunity": [ "https://kayia.com" ], "domainName": { "registered": 1999, "name": "kayia.com" } }, "kb": { "title": "KB", "appeared": 1990, "type": "pl", "description": "A knowledge representation package for Common Lisp", "reference": [ "https://repository.upenn.edu/cgi/viewcontent.cgi?article=1569&context=cis_reports" ], "country": [ "United States" ], "originCommunity": [ "University of Pennsylvania" ], "example": [ "(defconcept circle () (center radius)) " ], "hopl": "https://hopl.info/showlanguage.prx?exp=7724", "wordRank": 1795 }, "kee": { "title": "KEE", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1d83a0ebfe649e9eddc821eccf2a08bb5e857128" ], "country": [ "United States" ], "originCommunity": [ "IntelliCorp" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1154", "centralPackageRepositoryCount": 0 }, "kefir": { "title": "Kefir", "appeared": 2021, "type": "compiler", "description": "This repository contains implementation of C17 language compiler from scratch. No existing open source compiler infrastructure is being reused. The main priority is self-sufficiency of the project, compatibility with platform ABI and compliance with C17 language standard.", "website": "https://sr.ht/~jprotopopov/kefir/", "country": [ "Latvia" ], "originCommunity": [ "https://www.protopopov.lv" ], "inputLanguages": [ "c" ], "sourcehutRepo": "https://git.sr.ht/~jprotopopov/kefir" }, "kei": { "title": "kei", "appeared": 2019, "type": "pl", "creators": [ "Tiago Campos" ], "country": [ "Brazil and Belgium" ], "originCommunity": [ "https://github.com/caotic123/Kei/issues" ], "githubRepo": { "firstCommit": 2019, "stars": 127, "forks": 3, "subscribers": 4, "created": 2019, "updated": 2022, "description": "A small and expressive dependently typed language", "issues": 1, "url": "https://github.com/caotic123/Kei" }, "repoStats": { "firstCommit": 2019, "commits": 71, "committers": 4, "files": 14 }, "isbndb": "" }, "kek-nodal": { "title": "KEK-NODAL", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e2a012c154f63b24fdffe33d91ac9dc1666ffdb9" ], "country": [ "Japan" ], "originCommunity": [ "National Laboratory for High Energy Physics", "Hitachi", "Limited" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8054", "centralPackageRepositoryCount": 0 }, "keli": { "title": "keli", "appeared": 2018, "type": "pl", "creators": [ "Wong Jia Hau" ], "website": "https://keli-language.gitbook.io/doc/specification/", "reference": [ "https://news.ycombinator.com/item?id=24331635" ], "country": [ "Malaysia and Germany" ], "originCommunity": [ "https://github.com/KeliLanguage" ], "githubRepo": { "firstCommit": 2018, "stars": 167, "forks": 2, "subscribers": 8, "created": 2018, "updated": 2022, "description": "The compiler for Keli", "issues": 16, "url": "https://github.com/KeliLanguage/compiler" }, "repoStats": { "firstCommit": 2018, "commits": 224, "committers": 3, "files": 227 } }, "keras": { "title": "Keras", "appeared": 2015, "type": "library", "creators": [ "François Chollet" ], "website": "https://keras.io/", "country": [ "United States" ], "originCommunity": [ "https://github.com/keras-team" ], "domainName": { "registered": 2015, "awisRank": { "2022": 18794 }, "name": "keras.io" }, "githubRepo": { "firstCommit": 2015, "stars": 55548, "forks": 19130, "subscribers": 1946, "created": 2015, "updated": 2022, "description": "Deep Learning for humans", "issues": 346, "url": "https://github.com/keras-team/keras" }, "wikipedia": { "related": [ "python", "tensorflow", "ios", "android" ], "summary": "Keras is an open source neural network library written in Python. It is capable of running on top of TensorFlow, Microsoft Cognitive Toolkit, or Theano. Designed to enable fast experimentation with deep neural networks, it focuses on being user-friendly, modular, and extensible. It was developed as part of the research effort of project ONEIROS (Open-ended Neuro-Electronic Intelligent Robot Operating System), and its primary author and maintainer is François Chollet, a Google engineer. In 2017, Google's TensorFlow team decided to support Keras in TensorFlow's core library. Chollet explained that Keras was conceived to be an interface rather than a standalone machine-learning framework. It offers a higher-level, more intuitive set of abstractions that make it easy to develop deep learning models regardless of the computational backend used. Microsoft added a CNTK backend to Keras as well, available as of CNTK v2.0.", "created": 2016, "backlinksCount": 51, "pageId": 51650259, "dailyPageViews": 486, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/Keras" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "kerf": { "title": "kerf", "appeared": 2015, "type": "pl", "creators": [ "Kevin Lawler" ], "description": "Kerf is a columnar tick database and time-series language for Linux/OSX/BSD/iOS/Android. It is written in C and natively speaks JSON and SQL. Kerf can be used for trading platforms, feedhandlers, low-latency networking, high-volume analysis of realtime and historical data, logfile processing, and more.", "reference": [ "http://kerfsoftware.com/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/kevinlawler/kerf/issues" ], "example": [ "[100] + [0, 10, 20]" ], "githubRepo": { "firstCommit": 2015, "stars": 4, "forks": 0, "subscribers": 3, "created": 2022, "updated": 2022, "description": "Kerf", "issues": 0, "url": "https://github.com/kevinlawler/kerf" }, "repoStats": { "firstCommit": 2022, "commits": 6, "committers": 2, "files": 57 } }, "kermeta": { "title": "Kermeta", "appeared": 2012, "type": "pl", "website": "http://www.kermeta.org/index_k1_k2.html", "country": [ "France" ], "originCommunity": [ "Institut de recherche en informatique et systèmes aléatoires" ], "wikipedia": { "summary": "Kermeta is a modeling and programming language for metamodel engineering.", "backlinksCount": 19, "pageId": 7431140, "dailyPageViews": 5, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Kermeta" }, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|Model Driven Language Engineering with Kermeta|10.1007/978-3-642-18023-1_5|86|5|J. Jézéquel and Olivier Barais and F. Fleurey|b718dcceccbfbe30c5675d15008d85aaf4dcd9bc\n2013|Mashup of metalanguages and its implementation in the Kermeta language workbench|10.1007/s10270-013-0354-4|68|6|J. Jézéquel and B. Combemale and Olivier Barais and Monperrus Martin and François Fouquet|40fc24adb3e4376714f8b56cd9a000cb2716e108\n2010|Evaluation of Kermeta for solving graph-based problems|10.1007/s10009-010-0150-1|27|5|Naouel Moha and S. Sen and Cyril Faucher and Olivier Barais and J. Jézéquel|192d1e814012dd98d1a6c701ff26c8e9c469eebc" }, "kernel-e": { "title": "kernel-e", "appeared": 1994, "type": "pl", "reference": [ "http://www.erights.org/elang/kernel/index.html" ], "country": [ "United States" ], "originCommunity": [ "www.eros-os.org/pipermail/e-lang/" ] }, "kernel": { "title": "kernel", "appeared": 2009, "type": "pl", "description": "Kernel is a conservative, Scheme-like dialect of Lisp in which everything is a first-class object.", "website": "https://web.cs.wpi.edu/~jshutt/kernel.html", "reference": [ "https://bitbucket.org/AndresNavarro/klisp", "https://web.cs.wpi.edu/~jshutt/sink-01m10.tar.gz" ], "aka": [ "klisp" ], "country": [ "United States" ], "originCommunity": [ "Worcester Polytechnic Institute" ], "centralPackageRepositoryCount": 0 }, "kew": { "title": "kew", "appeared": 2004, "type": "pl", "reference": [ "https://sourceforge.net/p/kew/wiki/" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://duncanpierce.org/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8585", "centralPackageRepositoryCount": 0 }, "keykit": { "title": "KeyKit", "appeared": 1995, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Keykit" ], "country": [ "United States" ], "originCommunity": [ "AT&T" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6397", "centralPackageRepositoryCount": 0 }, "keysight-vee": { "title": "Agilent VEE", "appeared": 1991, "type": "pl", "website": "http://www.keysight.com/find/vee", "country": [ "United States" ], "originCommunity": [ "Keysight Technologies" ], "wikipedia": { "related": [ "labview", "matlab" ], "summary": "Keysight VEE is a graphical dataflow programming software development environment from Keysight Technologies for automated test, measurement, data analysis and reporting. VEE originally stood for Visual Engineering Environment and developed by HP designated as HP VEE; it has since been officially renamed to Keysight VEE. Keysight VEE has been widely used in various industries, serving the entire stage of a product lifecycle, from design, validation to manufacturing. It is optimized in instrument control and automation with test and measurement devices such as data acquisition instruments like digital voltmeters and oscilloscopes, and source devices like signal generators and programmable power supplies.", "pageId": 2282754, "dailyPageViews": 14, "created": 2016, "backlinksCount": 3, "revisionCount": 96, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Keysight_VEE" }, "tiobe": { "id": "Agilent VEE" }, "twitter": "https://twitter.com/keysight", "fileType": "text", "centralPackageRepositoryCount": 0 }, "khepri": { "title": "Khepri", "appeared": 2012, "type": "pl", "creators": [ "Matt Bierner" ], "website": "https://web.archive.org/web/20200122120931/http://khepri-lang.com/", "country": [ "United States" ], "originCommunity": [ "https://github.com/mattbierner/khepri/issues" ], "githubRepo": { "stars": 65, "forks": 3, "subscribers": 7, "created": 2012, "updated": 2015, "description": "ECMAScript derived programming language", "url": "https://github.com/mattbierner/khepri" }, "repoStats": { "firstCommit": 2012, "commits": 643, "committers": 1, "files": 31 } }, "ki": { "title": "ki", "appeared": 2014, "type": "pl", "website": "http://ki-lang.org", "country": [ "Italy" ], "originCommunity": [ "https://github.com/lantiga/ki/issues" ], "domainName": { "registered": 2014, "name": "ki-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n7897724|Ki – A lisp for your JavaScript|http://ki-lang.org/|2014-06-16 06:50:32 UTC|1402901432|threepointone|40|119", "isbndb": "" }, "kicad": { "title": "KiCad Legacy Layout", "appeared": 1992, "type": "application", "description": "KiCad writes all files in human readable ASCII. This makes manipulation by hand and scripting very easy.", "reference": [ "http://kicad-pcb.org/help/file-formats/d" ], "fileExtensions": [ "sch", "lib", "brd", "kicad_pcb", "kicad_wks", "kicad_mod" ], "country": [ "France" ], "originCommunity": [ "Instituts Universitaires de Technologie de Grenoble" ], "example": [ "(kicad_pcb (version 3)\n (host pcbnew \"(2013-02-20 BZR 3963)-testing\")\n (general\n (links 2)\n (no_connects 0)\n (area 57.924999 28.924999 74.075001 42.075001)\n (thickness 1.6)\n (drawings 5)\n (tracks 5)\n (zones 0)\n (modules 2)\n (nets 3)\n))" ], "wikipedia": { "related": [ "linux", "freebsd", "gerber-image", "eagle", "opengl", "java", "vrml" ], "summary": "KiCad (pronounced \"Key-CAD\") is a free software suite for electronic design automation (EDA). It facilitates the design of schematics for electronic circuits and their conversion to PCB designs. KiCad was originally developed by Jean-Pierre Charras. It features an integrated environment for schematic capture and PCB layout design. Tools exist within the package to create a bill of materials, artwork, Gerber files, and 3D views of the PCB and its components.", "created": 2007, "backlinksCount": 154, "pageId": 8853175, "revisionCount": 263, "dailyPageViews": 143, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/KiCad" }, "githubLanguage": { "fileExtensions": [ "brd" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.pcb.board", "id": "KiCad Legacy Layout" }, "githubBigQuery": { "repos": 1099, "users": 914, "id": "KiCad" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2018, "committerCount": 1, "commitCount": 25, "sampleCount": 1, "example": [ "PCBNEW-BOARD Version 1 date Fri Oct 19 11:53:05 2012\n\n# Created by Pcbnew(2012-05-21 BZR 3261)-stable\n\n$GENERAL\nencoding utf-8\nLayerCount 2\nLy 1FFF8001\nEnabledLayers 1FFF8001\nLinks 135\nNoConn 11\nDi 41844 16849 73060 58324\nNdraw 54\nNtrack 512\nNzone 0\nBoardThickness 630\nNmodule 51\nNnets 44\n$EndGENERAL\n\n$SHEETDESCR\nSheet A4 11700 8267\nTitle \"\"\nDate \"19 oct 2012\"\nRev \"\"\nComp \"\"\nComment1 \"\"\nComment2 \"\"\nComment3 \"\"\nComment4 \"\"\n$EndSHEETDESCR\n\n$SETUP\nInternalUnit 0.000100 INCH\nLayers 2\nLayer[0] Back signal\nLayer[15] Front signal\nTrackWidth 80\nTrackWidthList 200\nTrackWidthList 500\nTrackWidthList 1000\nTrackClearence 80\nZoneClearence 200\nTrackMinWidth 80\nDrawSegmWidth 80\nEdgeSegmWidth 150\nViaSize 270\nViaDrill 130\nViaMinSize 270\nViaMinDrill 130\nViaSizeList 310 160\nViaSizeList 370 200\nViaSizeList 420 250\nMicroViaSize 200\nMicroViaDrill 50\nMicroViasAllowed 0\nMicroViaMinSize 200\nMicroViaMinDrill 50\nTextPcbWidth 75\nTextPcbSize 300 400\nEdgeModWidth 80\nTextModSize 600 600\nTextModWidth 120\nPadSize 551 551\nPadDrill 150\nPad2MaskClearance 80\nPad2PasteClearanceRatio -0.12\nAuxiliaryAxisOrg 0 0\nPcbPlotParams (pcbplotparams (layerselection 284721153) (usegerberextensions true) (excludeedgelayer false) (linewidth 60) (plotframeref false) (viasonmask false) (mode 1) (useauxorigin false) (hpglpennumber 1) (hpglpenspeed 20) (hpglpendiameter 15) (hpglpenoverlay 0) (pscolor true) (psnegative false) (psa4output false) (plotreference false) (plotvalue false) (plotothertext true) (plotinvisibletext false) (padsonsilk false) (subtractmaskfromsilk false) (outputformat 1) (mirror false) (drillshape 1) (scaleselection 1) (outputdirectory \"\"))\n$EndSETUP\n\n$EQUIPOT\nNa 0 \"\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 1 \"/DC\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 2 \"/DD\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 3 \"/P0_0\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 4 \"/P0_1\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 5 \"/P0_2\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 6 \"/P0_3\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 7 \"/P0_4\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 8 \"/P0_5\"\nSt ~\n$EndEQUIPOT\n$EQUIPOT\nNa 9 \"" ], "url": "https://github.com/Alhadis/language-pcb" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "kid": { "title": "Kid templating language", "appeared": 1999, "type": "template", "country": [ "Germany and United States" ], "originCommunity": [ "https://sourceforge.net/projects/kid-template/lists/kid-template-discuss" ], "wikipedia": { "example": [ "\n \n title goes here\n \n \n

    \n
  • item goes here
    • \n
\n \n" ], "related": [ "xml", "python", "template-attribute-language", "php", "genshi" ], "summary": "Kid is a simple template engine for XML-based vocabularies written in Python. Kid claims to have many of the best features of XSLT, TAL, and PHP, but \"with much of the limitations and complexity stamped out\". Kid initially acted as the View component of the TurboGears framework in the framework's version 1.x implementation; however, the TurboGears project team has since replaced it with Genshi, citing perceived performance advantages.Kid is used by the Fedora Project in the repoview utility which creates a set of static HTML pages within a YUM repository.", "backlinksCount": 11, "pageId": 3738821, "created": 2006, "revisionCount": 46, "dailyPageViews": 5, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Kid_(templating_language)" }, "fileType": "text", "wordRank": 3435, "centralPackageRepositoryCount": 0 }, "kiev": { "title": "Kiev", "appeared": 2002, "type": "pl", "reference": [ "https://vmlanguages.is-research.de/kiev/" ], "country": [ "Unknown" ], "originCommunity": [ "https://web.archive.org/web/20020124064603/http://forestro.com/kiev/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6218", "centralPackageRepositoryCount": 0 }, "kilo-lisp": { "title": "kilo-lisp", "appeared": 2019, "type": "pl", "description": "Kilo LISP is a small interpreter for purely symbolic LISP. Its source consists of 25K bytes of comprehensible code (20KB C, 5KB LISP) and it runs in 64K bytes of memory. None the less it offers: lexical scoping, tail call elimination, macros, quasiquotation, variable-argument functions, constant-space garbage collection, image files, keyboard interrupt handling", "website": "https://www.t3x.org/klisp/index.html", "reference": [ "https://news.ycombinator.com/item?id=19415735" ], "aka": [ "klisp" ], "country": [ "Germany" ], "originCommunity": [ "https://www.t3x.org" ], "example": [ "((a . b) . c)\n(a . (b . c))\n((a . b) . (c . d))" ] }, "kima": { "title": "kima", "appeared": 2018, "type": "pl", "description": "A Programming Language with static types and (currently WIP) algebraic effects.", "website": "https://kima.xyz/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/ep3itg/does_a_language_have_to_be_especially_unique_to/" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://gitlab.com/kima-lang/Kima/-/issues" ], "domainName": { "registered": 2019, "name": "kima.xyz" }, "gitlabRepo": "https://gitlab.com/michalis_pardalos/Kima" }, "king-kong": { "title": "King Kong", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e91ee46c7fcce2eaf1f77cf74269d990a4d97c81" ], "country": [ "United States" ], "originCommunity": [ "The MITRE Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7715", "centralPackageRepositoryCount": 0 }, "kiss": { "title": "Keep It Short and Simple", "appeared": 1959, "type": "pl", "reference": [ "http://www.columbia.edu/cu/computinghistory/650.html" ], "standsFor": "Keep It Short and Simple", "country": [ "United States" ], "originCommunity": [ "Columbia University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=85", "wordRank": 4618 }, "kit": { "title": "Kit", "appeared": 2012, "type": "template", "description": "HTML template language from CodeKit", "website": "https://codekitapp.com/help/kit/", "reference": [ "https://www.hongkiat.com/blog/kit-language/" ], "country": [ "United States" ], "originCommunity": [ "https://codekitapp.com/about/" ], "example": [ "\n\n" ], "githubLanguage": { "fileExtensions": [ "kit" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "html", "codemirrorMode": "htmlmixed", "codemirrorMimeType": "text/html", "tmScope": "text.html.basic", "repos": 218, "id": "Kit" }, "githubBigQuery": { "repos": 67, "users": 59, "id": "Kit" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 51, "commitCount": 371, "sampleCount": 1, "example": [ "\n\n
\n\t

\n\t

\n\t\t\n\t

\n
" ], "url": "https://github.com/atom/language-html" }, "fileType": "text", "wordRank": 1359, "centralPackageRepositoryCount": 0 }, "kitlang": { "title": "kitlang", "appeared": 2018, "type": "pl", "creators": [ "Ben Morris" ], "description": "A magical, high performance programming language for game development.", "website": "https://www.kitlang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/kitlang" ], "domainName": { "name": "kitlang.org" }, "githubRepo": { "firstCommit": 2018, "stars": 990, "forks": 30, "subscribers": 39, "created": 2018, "updated": 2022, "description": "(INACTIVE) Kit: a magical, high performance programming language, designed for game development. Pre-alpha!", "issues": 19, "url": "https://github.com/kitlang/kit" }, "repoStats": { "firstCommit": 2018, "commits": 488, "committers": 13, "files": 382 }, "tryItOnline": "https://www.kitlang.org/playground.html", "twitter": "https://twitter.com/kitlanguage" }, "kitten": { "title": "kitten", "appeared": 2012, "type": "pl", "creators": [ "Jon Purdy" ], "description": "Kitten is a statically typed concatenative language with effect types.", "website": "http://kittenlang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/evincarofautumn/kitten/issues" ], "domainName": { "awisRank": { "2017": 6913255 }, "name": "kittenlang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "say" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2011, "stars": 978, "forks": 41, "subscribers": 70, "created": 2011, "updated": 2022, "description": "A statically typed concatenative systems programming language.", "issues": 65, "url": "https://github.com/evincarofautumn/kitten" }, "repoStats": { "firstCommit": 2011, "commits": 1140, "committers": 15, "files": 110 }, "leachim6": { "filepath": "k/Kitten.ktn", "fileExtensions": [ "ktn" ], "example": [ "\"Hello World\" say\n" ], "id": "Kitten" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Kitten", "rijuRepl": { "example": [ "\"Hello, world!\" say\n" ], "id": "https://riju.codes/kitten" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "kivy-lang": { "title": "kivy-lang", "appeared": 2010, "type": "pl", "description": "A meta language that look like QML in QT", "reference": [ "https://github.com/kivy/kivy/blob/master/kivy/data/style.kv" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/kivy" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "example": [ "#:kivy 1.0\nWidget:\n Button:\n text: \"Hello World\"\n Button:\n text: \"I'm another label\"\n pos: (200, 200)" ] }, "kixtart": { "title": "KiXtart", "appeared": 1991, "type": "pl", "website": "http://www.kixtart.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/kivy" ], "domainName": { "registered": 1999, "awisRank": { "2022": 8232032 }, "name": "kixtart.org" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "; Read value from registry\n$ProductID = ReadValue(\"HKEY_LOCAL_MACHINE\\Software\\Microsoft\\Windows NT\\CurrentVersion\",\"ProductId\")\n\n; Display result or error message\nIf @ERROR = 0\n ? \"ProductID=$ProductID\"\nElse\n ? \"Error reading product ID\"\nEndif\n?\n\n; Done\nExit @ERROR" ], "related": [ "isbn", "fasttrack-scripting-host", "autoit" ], "summary": "KiXtart is a closed source free-format scripting language for Windows. It is described as a logon script processor and enhanced batch scripting language by the official website. Its name is a portmanteau of \"kick start\".", "pageId": 1370630, "created": 2005, "backlinksCount": 21, "revisionCount": 70, "dailyPageViews": 27, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/KiXtart" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "kl-one": { "title": "KL-ONE", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/17a38462ce4d3d741f818b0161908b0656add2c3" ], "country": [ "Sweden" ], "originCommunity": [ "University of Gothenburg" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1156", "centralPackageRepositoryCount": 0 }, "kl0": { "title": "KL0", "appeared": 1982, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/KL0" ], "country": [ "Japan" ], "originCommunity": [ "Ministry of International Trade and Industry" ], "wikipedia": { "summary": "Kernel Language 0 (KL0) is a sequential logic programming language based on Prolog, used in the ICOT Fifth generation computer project.", "backlinksCount": 9, "pageId": 17178, "dailyPageViews": 6, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/KL0" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2146", "centralPackageRepositoryCount": 0 }, "kl1": { "title": "KL1", "appeared": 1988, "type": "pl", "reference": [ "https://www.researchgate.net/publication/220993099_Operating_System_PIMOS_and_Kernel_Language_KL1" ], "country": [ "Japan" ], "originCommunity": [ "The University of Tokyo" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1562", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "klaim": { "title": "Klaim", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3f6d4ffbb1e2d6ef633ce6bea8d2ae29de1dd551" ], "country": [ "Italy" ], "originCommunity": [ "Università di Firenze", "Università di Pisa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2922", "centralPackageRepositoryCount": 0, "isbndb": "" }, "klerer-may-system": { "title": "Klerer-May System", "appeared": 1964, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Columbia University" ], "wikipedia": { "summary": "The Klerer–May System is a programming language developed in the mid-1960s, oriented to numerical scientific programming, whose most notable feature is its two-dimensional syntax based on traditional mathematical notation. For input and output, the Klerer–May system used a Friden Flexowriter modified to allow half-line motions for subscripts and superscripts. The character set included digits, upper-case letters, subsets of 14 lower-case Latin letters and 18 Greek letters, arithmetic operators (+ − × / |) and punctuation (. , ( )), and eight special line-drawing characters (resembling ╲ ╱ ⎜ _ ⎨ ⎬ ˘ ⁔) used to construct multi-line brackets and symbols for summation, products, roots, and for multi-line division or fractions. The system was intended to be forgiving of input mistakes, and easy to learn; its reference manual was only two pages.The system was developed by Melvin Klerer and Jack May at Columbia University's Hudson Laboratories in Dobbs Ferry, New York, for the Office of Naval Research, and ran on GE-200 series computers.", "backlinksCount": 2, "pageId": 17186, "dailyPageViews": -1, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/Klerer–May_System" }, "hopl": "https://hopl.info/showlanguage.prx?exp=290" }, "klipa": { "title": "KLIPA", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2b42fa947dbd72233d95dee1f4085b2bf156fbf0" ], "country": [ "Poland" ], "originCommunity": [ "Polish Academy of Science" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2695", "centralPackageRepositoryCount": 0 }, "klisp": { "title": "klisp", "appeared": 1958, "type": "pl", "description": "Kilo LISP is a small interpreter for purely symbolic LISP. Its source consists of 25K bytes of comprehensible code (20KB C, 5KB LISP) and it runs in 64K bytes of memory.", "website": "http://t3x.org/klisp/index.html", "country": [ "Germany" ], "originCommunity": [ "https://t3x.org" ] }, "klong": { "title": "klong", "appeared": 2015, "type": "pl", "description": "A Simple Array Language. Klong is an array language, like K, but without the ambiguity. If you know K or APL, you may be disappointed by Klong. If you don't know any array languages, it might explode your brain. Use at your own risk!", "website": "http://t3x.org/klong/", "country": [ "Germany" ], "originCommunity": [ "https://t3x.org/klong/" ], "example": [ "{&/x!:\\2+!_x^1%2}" ] }, "kml": { "title": "KML", "appeared": 2007, "type": "xmlFormat", "standsFor": "Keyhole Markup Language", "country": [ "United States" ], "originCommunity": [ "Keyhole, Inc", "Google" ], "wikipedia": { "example": [ "\n\n\n\n New York City\n New York City\n \n -74.006393,40.714172,0\n \n\n\n" ], "related": [ "xml", "geo-ml", "collada" ], "summary": "Keyhole Markup Language (KML) is an XML notation for expressing geographic annotation and visualization within Internet-based, two-dimensional maps and three-dimensional Earth browsers. KML was developed for use with Google Earth, which was originally named Keyhole Earth Viewer. It was created by Keyhole, Inc, which was acquired by Google in 2004. KML became an international standard of the Open Geospatial Consortium in 2008. Google Earth was the first program able to view and graphically edit KML files. Other projects such as Marble have also started to develop KML support.", "pageId": 2139847, "dailyPageViews": 284, "created": 2005, "backlinksCount": 25456, "revisionCount": 364, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Keyhole_Markup_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|Addison-Wesley Professional|KML Handbook, The: Geographic Visualization for the Web|Wernecke, Josie|9780321606617" }, "knight": { "title": "Knight", "appeared": 2021, "type": "pl", "creators": [ "Sam Westerman" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/knight-lang" ], "githubRepo": { "firstCommit": 2021, "stars": 46, "forks": 5, "subscribers": 3, "created": 2021, "updated": 2022, "description": "The Knight Programming Language", "issues": 1, "url": "https://github.com/knight-lang/knight-lang" }, "repoStats": { "firstCommit": 2021, "commits": 149, "committers": 10, "files": 78 } }, "knitr": { "title": "Knitr", "appeared": 2012, "type": "template", "country": [ "United States" ], "originCommunity": [ "Iowa State University" ], "compilesTo": [ "latex" ], "wikipedia": { "example": [ "The Wilcoxon Sign test was applied as statistical comparison of the average of two dependent samples above. \n In this case then, the calculated P-value was 0.56 and hence greater than the significance (0.05 by default).\n This implies that \"H0: there is no difference between the \n results in data1 and data2\" must be accepted." ], "related": [ "r", "latex", "lyx-editor", "html", "markdown", "asciidoc", "restructuredtext", "sweave", "python", "perl", "coffeescript", "rstudio-editor" ], "summary": "knitr is an engine for dynamic report generation with R. It is a package in the statistical programming language R that enables integration of R code into LaTeX, LyX, HTML, Markdown, AsciiDoc, and reStructuredText documents. The purpose of knitr is to allow reproducible research in R through the means of Literate Programming. It is licensed under the GNU General Public License.knitr was inspired by Sweave and written with a different design for better modularization, so it is easier to maintain and extend. Sweave can be regarded as a subset of knitr in the sense that all features of Sweave are also available in knitr. Some of knitr's extensions include the R Markdown format (used in reports published on RPubs), caching, TikZ graphics and support to other languages such as Python, Perl, C++, Shell scripts and CoffeeScript, and so on. knitr is officially supported in the RStudio IDE for R, LyX, Emacs/ESS and the Architect IDE for data science.", "backlinksCount": 30, "pageId": 38393230, "created": 2013, "revisionCount": 44, "dailyPageViews": 48, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Knitr" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Dynamic Documents with R and knitr|10.1201/b15166|530|49|Yihui Xie|95a2b1b7093cf4d5910ad322bb5d1d4f7c5611a2" }, "knowledge-interchange-format": { "title": "Knowledge Interchange Format", "appeared": 1990, "type": "pl", "aka": [ "kif" ], "country": [ "United States" ], "originCommunity": [ "http://www-ksl.stanford.edu/knowledge-sharing/" ], "wikipedia": { "related": [ "postscript", "kqml" ], "summary": "Knowledge Interchange Format (KIF) is a computer language designed to enable systems to share and re-use information from knowledge-based systems. KIF is similar to frame languages such as KL-One and LOOM but unlike such language its primary role is not intended as a framework for the expression or use of knowledge but rather for the interchange of knowledge between systems. The designers of KIF likened it to PostScript. PostScript was not designed primarily as a language to store and manipulate documents but rather as an interchange format for systems and devices to share documents. In the same way KIF is meant to facilitate sharing of knowledge across different systems that use different languages, formalisms, platforms, etc. KIF has a declarative semantics. It is meant to describe facts about the world rather than processes or procedures. Knowledge can be described as objects, functions, relations, and rules. It is a formal language, i.e., it can express arbitrary statements in first order logic and can support reasoners that can prove the consistency of a set of KIF statements. KIF also supports non-monotonic reasoning. KIF was created by Michael Genesereth, Richard Fikes and others participating in the DARPA knowledge Sharing Effort.Although the original KIF group intended to submit to a formal standards body, that did not occur. A later version called Common Logic has since been developed for submission to ISO and has been approved and published. A variant called SUO-KIF is the language in which the Suggested Upper Merged Ontology is written.", "pageId": 5558061, "created": 2006, "backlinksCount": 40, "revisionCount": 40, "dailyPageViews": 14, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Knowledge_Interchange_Format" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ko": { "title": "ko", "appeared": 2018, "type": "pl", "creators": [ "Petar Maymounkov" ], "country": [ "The Netherlands and United States" ], "originCommunity": [ "https://github.com/kocircuit/kocircuit" ], "githubRepo": { "firstCommit": 2018, "stars": 305, "forks": 20, "subscribers": 17, "created": 2018, "updated": 2022, "description": "Ko: A generic type-safe language for concurrent, stateful, deadlock-free systems and protocol manipulations", "issues": 15, "url": "https://github.com/kocircuit/kocircuit" }, "repoStats": { "firstCommit": 2018, "commits": 423, "committers": 4, "files": 1843 }, "wordRank": 9241, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "koara": { "title": "koara", "appeared": 2016, "type": "textMarkup", "creators": [ "Andy Van Den Heuvel" ], "website": "https://web.archive.org/web/20160221081308/http://koara.io/projects", "country": [ "Belgium" ], "originCommunity": [ "https://github.com/koara" ], "domainName": { "name": "koara.io" }, "githubRepo": { "firstCommit": 2015, "stars": 3, "forks": 0, "subscribers": 3, "created": 2015, "updated": 2018, "description": "Koara parser written in Java", "issues": 0, "url": "https://github.com/koara/koara-java" }, "repoStats": { "firstCommit": 2015, "commits": 248, "committers": 1, "files": 36 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n10844780|Show HN: Koara – A modular lightweight markup language|2016-01-05 18:00:47 UTC|1452016847|codeaddslife|0|4", "packageRepository": [ "https://search.maven.org/artifact/io.koara/koara" ] }, "kodu-game-lab": { "title": "Kodu Game Lab", "appeared": 2009, "type": "pl", "website": "http://kodugamelab.com", "country": [ "United States" ], "originCommunity": [ "Microsoft's Future Social Experiences Labs" ], "domainName": { "registered": 2009, "awisRank": { "2022": 627900 }, "name": "kodugamelab.com" }, "wikipedia": { "related": [ "logo", "squeak", "microsoft-small-basic", "scratch", "robomind", "toontalk" ], "summary": "Kodu, originally named Boku, is a programming integrated development environment (IDE) by Microsoft's FUSE Labs. It runs on Xbox 360 and Microsoft Windows XP, Windows Vista, Windows 7, Windows 8 and Windows 10. It was released on the Xbox Live Marketplace on June 30, 2009. A Windows version is available to the general public for download from Microsoft's FUSE web portal.", "pageId": 13837554, "created": 2007, "backlinksCount": 89, "revisionCount": 217, "dailyPageViews": 98, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Kodu_Game_Lab" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "kogut": { "title": "kogut", "appeared": 2004, "type": "pl", "description": "Kogut is an experimental programming language which supports impurely functional programming and a non-traditional flavor of object-oriented programming. Its semantics is most similar to Scheme or Dylan, but the syntax looks more like ML or Ruby.", "website": "http://kokogut.sourceforge.net/kogut.html", "country": [ "Poland" ], "originCommunity": [ "https://sourceforge.net/p/kokogut/mailman/kokogut-users/" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "koi": { "title": "koi", "appeared": 2010, "type": "pl", "website": "http://thingsaaronmade.com/blog/introducing-koi.html", "country": [ "Canada" ], "originCommunity": [ "https://github.com/aarongough/koi/issues" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n1741367|Show HN: Koi - a programming language that teaches language implementation.|2010-09-29 22:20:14 UTC|1285798814|aarongough|12|70" }, "koka": { "title": "Koka", "appeared": 2012, "type": "pl", "creators": [ "Daan Leijen" ], "description": "A strongly typed functional-style language with effect types and handlers.", "website": "https://www.microsoft.com/en-us/research/project/koka/?from=http%3A%2F%2Fresearch.microsoft.com%2Fen-us%2Fprojects%2Fkoka", "webRepl": [ "https://rise4fun.com/koka/" ], "reference": [ "https://koka-lang.github.io/koka/doc/book.html" ], "country": [ "United States" ], "originCommunity": [ "Microsoft Research" ], "compilesTo": [ "c" ], "writtenIn": [ "haskell" ], "hasPrintDebugging": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasFunctions": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "// [0-9]+\\.[0-9]+([eE][\\-+]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "// [0-9]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "println" ] ], "keywords": [ "infix", "infixr", "infixl", "type", "cotype", "rectype", "alias", "struct", "con", "fun", "function", "val", "var", "external", "if", "then", "else", "elif", "return", "match", "private", "public", "private", "module", "import", "as", "include", "inline", "rec", "try", "yield", "enum", "interface", "instance" ], "example": [ "fun hello-ten()\n var i := 0\n while { i < 10 }\n println(\"hello\")\n i := i + 1" ], "githubRepo": { "stars": 2190, "forks": 111, "subscribers": 56, "created": 2016, "updated": 2022, "firstCommit": 2012, "description": "Koka language compiler and interpreter", "issues": 123, "url": "https://github.com/koka-lang/koka" }, "repoStats": { "firstCommit": 2012, "commits": 4654, "committers": 43, "files": 1645 }, "pygmentsHighlighter": { "filename": "haskell.py", "fileExtensions": [ "kk", "kki" ], "id": "Koka" }, "tryItOnline": "koka", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "komodo-editor": { "title": "komodo-editor", "appeared": 2007, "type": "editor", "country": [ "Canada" ], "originCommunity": [ "https://github.com/Komodo" ] }, "kona": { "title": "kona", "appeared": 2010, "type": "pl", "description": "Kona is the open-source implementation of the k3 programming language. k is a synthesis of APL and LISP. Although many of the capabilities come from APL, the fundamental data construct is quite different. In APL the construct is a multi-dimensional matrix-like array, where the dimension of the array can range from 0 to some maximum (often 9). In k, like LISP, the fundamental data construct is a list. Also, like LISP, the k language is ASCII-based, so you don't need a special keyboard.", "reference": [ "http://www.hakank.org/k/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/kevinlawler/kona/issues" ], "example": [ "factorial:{*/1+!:x}\nfib1:{(x(|+\\)\\1 1)[;1]}\nfib2:{x{x,+/-2#x}/!2}\nfib_rec:{:[x<2;1;_f[x-1]+_f[x-2]]}\nmaxsubsum:{|/0(0|+)\\x}\nprimes_to_n_sieve:{2_&{:[x@y;x&@[1,-1_ z#(1_ y#1),0;y;:;1];x]}/[x#1;2_!__ceil_sqrt x;x]}\nprimes_to_n_sieve2:{:[x<4;,2;r,1_&~|/x#'~!:'r: _f[_ _ceil _sqrt x]]}" ], "githubRepo": { "firstCommit": 2010, "stars": 1253, "forks": 135, "subscribers": 57, "created": 2010, "updated": 2022, "description": "Open-source implementation of the K programming language", "issues": 70, "url": "https://github.com/kevinlawler/kona" }, "repoStats": { "firstCommit": 2010, "commits": 1561, "committers": 49, "files": 86 }, "isbndb": "" }, "konna": { "title": "Konna", "appeared": 2021, "type": "pl", "description": "Konna, my programming language", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/rpe65y/konna_my_programming_language/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/eashanhatti/konna/issues" ] }, "konsolscript": { "title": "KonsolScript", "appeared": 2005, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "https://sourceforge.net/p/konsolscript/feature-requests/" ], "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "linux", "actionscript" ], "summary": "KonsolScript is a cross-platform scripting language used mostly for games. It is available for Windows and Linux Operating Systems. KonsolScript was developed during 2005 as the scripting language which is intentionally for the purpose writing games with KAGE (Alternative Game Engine). However, its interpreter, Quixie, can also be used as common gateway interface for serving web pages. KonsolScript's language design is greatly inspired by C programming language and VergeC, although its drawing API is inspired by ActionScript. Together with KAGE, KonsolScript was distributed as freeware until it was released as free software in SourceForge on April 2006. KonsolScript is licensed under GNU General Public License.", "created": 2010, "backlinksCount": 16, "pageId": 27845558, "revisionCount": 25, "dailyPageViews": 2, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/KonsolScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:KonsolScript", "centralPackageRepositoryCount": 0 }, "korn-shell": { "title": "Korn shell", "appeared": 1983, "type": "pl", "website": "http://www.kornshell.org/", "aka": [ "ksh" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/att" ], "domainName": { "registered": 2005, "name": "kornshell.org" }, "hasHereDocs": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "echo" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "c", "unix", "bourne-shell", "emacs-editor", "vi-editor", "bash", "motif-software", "tcl", "arexx" ], "summary": "KornShell (ksh) is a Unix shell which was developed by David Korn at Bell Labs in the early 1980s and announced at USENIX on July 14, 1983. The initial development was based on Bourne shell source code. Other early contributors were Bell Labs developers Mike Veach and Pat Sullivan, who wrote the Emacs and vi-style line editing modes' code, respectively. KornShell is backward-compatible with the Bourne shell and includes many features of the C shell, inspired by the requests of Bell Labs users.", "pageId": 17213, "dailyPageViews": 66, "created": 2016, "backlinksCount": 20, "revisionCount": 351, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/KornShell" }, "leachim6": { "filepath": "k/KSH.ksh", "fileExtensions": [ "ksh" ], "example": [ "#!/bin/ksh\necho \"Hello World\"\n" ], "id": "KSH" }, "rijuRepl": { "example": [ "echo \"Hello, world!\"\n" ], "id": "https://riju.codes/ksh" }, "subreddit": [ { "memberCount": { "2022": 1839 }, "url": "https://reddit.com/r/ksh" } ], "tiobe": { "id": "Korn shell" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3481", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "kotlin": { "title": "Kotlin", "appeared": 2011, "type": "pl", "creators": [ "Andrey Breslav" ], "website": "https://kotlinlang.org", "documentation": [ "https://kotlinlang.org/docs/home.html", "https://devdocs.io/kotlin/" ], "reference": [ "https://steve-yegge.blogspot.co.nz/2017/05/why-kotlin-is-better-than-whatever-dumb.html", "https://engineering.fb.com/2022/10/24/android/android-java-kotlin-migration/" ], "cheatSheetUrl": [ "https://www.ekito.fr/people/wp-content/uploads/2016/11/Kotlin-Cheat-Sheet-by-ekito-1.2.pdf" ], "fileExtensions": [ "kt", "kts" ], "originCommunity": [ "JetBrains" ], "domainName": { "registered": 2013, "awisRank": { "2017": 17837, "2022": 10352 }, "name": "kotlinlang.org" }, "releaseNotesUrl": "https://kotlinlang.org/docs/releases.html", "proposals": "https://github.com/Kotlin/KEEP", "runsOnVm": [ "jvm" ], "visualParadigm": false, "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasAssignment": { "example": "table = HashMap()", "value": true }, "hasComments": { "example": "", "value": true }, "hasTernaryOperators": { "example": "// Since if statements are expressions\nprintln(if (true) true else false)", "value": true }, "hasImports": { "example": "import foo.Bar // Bar is now accessible without qualification\nimport foo.* // everything in 'foo' becomes accessible\nimport bar.Bar as bBar // bBar stands for 'bar.Bar'", "value": true }, "hasInterfaces": { "example": "interface Named {\n val name: String\n}\ninterface Person : Named {\n val firstName: String\n val lastName: String\n \n override val name: String get() = \"$firstName $lastName\"\n}", "value": true }, "hasMacros": { "example": "", "value": false }, "hasOperatorOverloading": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "as", "as?", "break", "class", "continue", "do", "else", "false", "for", "fun", "if", "in", "!in", "interface", "is", "!is", "null", "object", "package", "return", "super", "this", "throw", "true", "try", "typealias", "val", "var", "when", "while", "by", "catch", "constructor", "delegate", "dynamic", "field", "file", "finally", "get", "import", "init", "param", "property", "receiver", "set", "setparam", "where", "actual", "abstract", "annotation", "companion", "const", "crossinline", "data", "enum", "expect", "external", "final", "infix", "inline", "inner", "internal", "lateinit", "noinline", "open", "operator", "out", "override", "private", "protected", "public", "reified", "sealed", "suspend", "tailrec", "vararg", "field", "it", "+", "-", "*", "/", "%", "*", "=", "+=", "-=", "*=", "/=", "%=", "++", "--", "&&", "||", "!", "==", "!=", "===", "!==", "<", ">", "<=", ">=", "[", "]", "!!", "?.", "?:", "::", "..", ":", "?", "->;", "@", ";", "$", "_" ], "gource": "https://www.youtube.com/watch?v=cbmdwDfqfv0", "githubRepo": { "stars": 43795, "forks": 5411, "subscribers": 1447, "created": 2012, "updated": 2023, "description": "The Kotlin Programming Language. ", "issues": 147, "url": "https://github.com/JetBrains/kotlin" }, "repoStats": { "firstCommit": 2010, "commits": 163392, "committers": 1037, "files": 76303 }, "wikipedia": { "example": [ "// returns null if...\n // - foo() returns null,\n // - or if foo() is non-null, but bar() returns null,\n // - or if foo() and bar() are non-null, but baz() returns null.\n // vice versa, return value is non-null if and only if foo(), bar() and baz() are non-null\n foo()?.bar()?.baz()" ], "related": [ "jvm", "java-bytecode", "javascript", "java", "scala", "groovy", "csharp", "gosu", "swift", "llvmir", "android", "pascal", "perl", "eclipse-editor", "maven-pom", "emacs-editor" ], "summary": "Kotlin is a statically-typed programming language that runs on the Java virtual machine and also can be compiled to JavaScript source code or use the LLVM compiler infrastructure. Its primary development is from a team of JetBrains programmers based in Saint Petersburg, Russia. While the syntax is not compatible with Java, Kotlin is designed to interoperate with Java code and is reliant on Java code from the existing Java Class Library, such as the collections framework. As of Android Studio 3.0 (Beta version) Kotlin is a fully supported programming language on Android and lets the user choose between targeting Java 6- or Java 8-compatible bytecode.", "pageId": 41819039, "dailyPageViews": 1638, "created": 2014, "backlinksCount": 416, "revisionCount": 489, "appeared": 2011, "fileExtensions": [ "kt", "kts" ], "url": "https://en.wikipedia.org/wiki/Kotlin_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "kt", "ktm", "kts" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ngoogle iosched https://github.com/google.png https://github.com/google/iosched Kotlin #F18E33 19058 5939 894 \"The Google I/O 2019 Android App\"\ninorichi tachiyomi https://github.com/inorichi.png https://github.com/inorichi/tachiyomi Kotlin #F18E33 4268 601 327 \"Free and open source manga reader for Android\"\nchrisbanes tivi https://github.com/chrisbanes.png https://github.com/chrisbanes/tivi Kotlin #F18E33 2337 303 128 \"Tivi is a work-in-progress TV show tracking Android app, which connects to Trakt.tv. It is still in its early stages of development and currently only contains two pieces of UI. It is under heavy development.\"\ndbacinski Design-Patterns-In-Kotlin https://github.com/dbacinski.png https://github.com/dbacinski/Design-Patterns-In-Kotlin Kotlin #F18E33 3176 392 169 \"Design Patterns implemented in Kotlin\"\nKotlin kotlinx.coroutines https://github.com/Kotlin.png https://github.com/Kotlin/kotlinx.coroutines Kotlin #F18E33 5850 763 291 \"Library support for Kotlin coroutines\"\ngooglesamples android-architecture-components https://github.com/googlesamples.png https://github.com/googlesamples/android-architecture-components Kotlin #F18E33 14412 4418 391 \"Samples for Android Architecture Components.\"\nkizitonwose CalendarView https://github.com/kizitonwose.png https://github.com/kizitonwose/CalendarView Kotlin #F18E33 979 62 132 \"A highly customizable calendar library for Android, powered by RecyclerView.\"\ngooglesamples android-sunflower https://github.com/googlesamples.png https://github.com/googlesamples/android-sunflower Kotlin #F18E33 8355 1602 343 \"A gardening app illustrating Android development best practices with Android Jetpack.\"\ngooglesamples android-UniversalMusicPlayer https://github.com/googlesamples.png https://github.com/googlesamples/android-UniversalMusicPlayer Kotlin #F18E33 11093 3339 110 \"This sample shows how to implement an audio media app that works across multiple form factors and provide a consistent user experience on Android phones, tablets, Auto, Wear and Cast devices\"\nshadowsocks shadowsocks-android https://github.com/shadowsocks.png https://github.com/shadowsocks/shadowsocks-android Kotlin #F18E33 26014 10047 739 \"A shadowsocks client for Android\"\nhoodiearon fq-book https://github.com/hoodiearon.png https://github.com/hoodiearon/fq-book Kotlin #F18E33 1392 467 105 \"📖 《这本书能让你连接互联网》科学上网Freestyle，了解网络基础知识与实践蹭网操作\"\nandroid plaid https://github.com/android.png https://github.com/android/plaid Kotlin #F18E33 13763 2813 197 \"An Android app which provides design news & inspiration as well as being an example of implementing material design.\"\nJetBrains Exposed https://github.com/JetBrains.png https://github.com/JetBrains/Exposed Kotlin #F18E33 2964 267 94 \"Kotlin SQL Framework\"\nairbnb MvRx https://github.com/airbnb.png https://github.com/airbnb/MvRx Kotlin #F18E33 3188 217 92 \"MvRx: Android on Autopilot\"\nKotlinBy awesome-kotlin https://github.com/KotlinBy.png https://github.com/KotlinBy/awesome-kotlin Kotlin #F18E33 7695 852 180 \"A curated list of awesome Kotlin related stuff Inspired by awesome-java.\"\nJetBrains kotlin https://github.com/JetBrains.png https://github.com/JetBrains/kotlin Kotlin #F18E33 28954 3382 421 \"The Kotlin Programming Language\"\ncashapp sqldelight https://github.com/cashapp.png https://github.com/cashapp/sqldelight Kotlin #F18E33 2745 205 189 \"SQLDelight - Generates typesafe Kotlin APIs from SQL\"\nCypherpunkArmory UserLAnd https://github.com/CypherpunkArmory.png https://github.com/CypherpunkArmory/UserLAnd Kotlin #F18E33 1312 137 45 \"Main UserLAnd Repository\"\ngooglesamples android-dynamic-features https://github.com/googlesamples.png https://github.com/googlesamples/android-dynamic-features Kotlin #F18E33 401 129 36 \nInsertKoinIO koin https://github.com/InsertKoinIO.png https://github.com/InsertKoinIO/koin Kotlin #F18E33 4173 256 170 \"KOIN - a pragmatic lightweight dependency injection framework for Kotlin\"\neycorsican kitsunebi-android https://github.com/eycorsican.png https://github.com/eycorsican/kitsunebi-android Kotlin #F18E33 546 105 75 \"A fully-featured V2Ray client for Android.\"\nsanogueralorenzo Android-Kotlin-Clean-Architecture https://github.com/sanogueralorenzo.png https://github.com/sanogueralorenzo/Android-Kotlin-Clean-Architecture Kotlin #F18E33 767 146 59 \"Android Sample Clean Architecture App written in Kotlin\"\narturbosch detekt https://github.com/arturbosch.png https://github.com/arturbosch/detekt Kotlin #F18E33 2289 258 116 \"Static code analysis for Kotlin\"\nanthonycr Lightning-Browser https://github.com/anthonycr.png https://github.com/anthonycr/Lightning-Browser Kotlin #F18E33 1442 679 36 \"A lightweight Android browser with modern navigation\"\nkittinunf fuel https://github.com/kittinunf.png https://github.com/kittinunf/fuel Kotlin #F18E33 3012 316 88 \"The easiest HTTP networking library for Kotlin/Android\"", "trendingProjectsCount": 26, "type": "programming", "aceMode": "text", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-kotlin", "tmScope": "source.kotlin", "repos": 901474, "id": "Kotlin" }, "githubBigQuery": { "repos": 7829, "users": 5947, "id": "Kotlin" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/kotlin", "monaco": "kotlin", "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "kt", "kts" ], "id": "Kotlin" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 1, "commitCount": 6, "sampleCount": 1, "example": [ "package addressbook\n\nclass Contact(\n val name : String,\n val emails : List,\n val addresses : List,\n val phonenums : List\n)\n\nclass EmailAddress(\n val user : String,\n val host : String\n)\n\nclass PostalAddress(\n val streetAddress : String,\n val city : String,\n val zip : String,\n val state : USState?,\n val country : Country\n) {\n assert {(state == null) xor (country == Countries[\"US\"]) }\n}\n\nclass PhoneNumber(\n val country : Country,\n val areaCode : Int,\n val number : Long\n)\n\nobject Countries {\n fun get(id : CountryID) : Country = countryTable[id]\n \n private var table : Map? = null\n private val countryTable : Map\n get() {\n if (table == null) {\n table = HashMap()\n for (line in TextFile(\"countries.txt\").lines(stripWhiteSpace = true)) {\n table[line] = Country(line)\n }\n }\n return table\n }\n}\n\nclass Country(val name : String)" ], "url": "https://github.com/nishtahir/language-kotlin" }, "projectEuler": { "memberCount": { "2019": 80, "2022": 275 }, "id": "Kotlin" }, "helloWorldCollection": [ "// Hello world in Kotlin\n\nfun main(args : Array) {\n println(\"Hello, world!\")\n}" ], "leachim6": { "filepath": "k/Kotlin.kt", "fileExtensions": [ "kt" ], "example": [ "fun main() {\n println(\"Hello World\")\n}\n" ], "id": "Kotlin" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Kotlin", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nfun square(num: Int): Int = num * num\n" ], "id": "Kotlin" }, "rijuRepl": { "example": [ "println(\"Hello, world!\")\n" ], "id": "https://riju.codes/kotlin" }, "replit": "https://repl.it/languages/kotlin", "tryItOnline": "kotlin", "indeedJobs": { "2022": 5276, "query": "kotlin developer" }, "stackOverflowSurvey": { "2021": { "users": 6866, "medianSalary": 55071, "fans": 10691, "percentageUsing": 0.08 } }, "eventsPageUrl": [ "https://kotlinlang.org/community/events/" ], "faqPageUrl": [ "https://kotlinlang.org/docs/faq.html" ], "subreddit": [ { "memberCount": { "2017": 6987, "2022": 61654 }, "url": "https://reddit.com/r/Kotlin" } ], "meetup": { "memberCount": 33854, "groupCount": 138, "url": "https://www.meetup.com/topics/kotlin" }, "tiobe": { "currentRank": 48, "id": "Kotlin" }, "pypl": "Kotlin", "twitter": "https://twitter.com/kotlin", "jupyterKernel": [ "https://github.com/ligee/kotlin-jupyter" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nKotlin for Android Developers: Learn Kotlin the easy way while developing an Android App||Antonio Leiva|50360838|3.81|117|17\nProgramming Kotlin||Stephen Samuel|55025626|3.96|27|4\nKotlin Apprentice: Beginning Programming with Kotlin||raywenderlich.com Team|63806537|0.0|0|0\nReactive Programming in Kotlin: Design and build non-blocking, asynchronous Kotlin applications with RXKotlin, Reactor-Kotlin, Android, and Spring||Rivu Chakraborty|57362464|3.93|14|2\nProgramming Kotlin||Venkat Subramaniam|66381682|5.00|1|0\nKotlin Programming: The Big Nerd Ranch Guide||Matthew Mathias|58631045|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2019|Razeware LLC|Reactive Programming with Kotlin (First Edition): Learn Rx with RxJava, RxKotlin, and RXAndroid|Tutorial Team, raywenderlich and Sullivan, Alex|9781942878797\n2019|Packt Publishing|Mastering Kotlin: Learn advanced Kotlin programming techniques to build apps for Android, iOS, and the web|Ebel, Nate|9781838552367\n2018|Packt Publishing|Hands-On Serverless Applications with Kotlin: Develop scalable and cost-effective web applications using AWS Lambda and Kotlin|Trivedi, Hardik and Kulkarni, Ameya|9781788993708\n2017|Packt Publishing|Android Development with Kotlin: Enhance your skills for Android development using Kotlin|Moskala, Marcin and Wojda, Igor|9781787128989\n2017|Packt Publishing|Kotlin Blueprints: A practical guide to building industry-grade web, mobile, and desktop applications in Kotlin using frameworks such as Spring Boot and Node.js|Belagali, Ashish and Trivedi, Hardik and Chordiya, Akshay|9781788470421\n2018-06-25T00:00:01Z|Big Nerd Ranch Guides|Kotlin Programming: The Big Nerd Ranch Guide|Skeen, Josh and Greenhalgh, David|9780135161630\n2020|Payload Media|Android Studio 4.0 Development Essentials - Kotlin Edition: Developing Android Apps Using Android Studio 4.0, Kotlin and Android Jetpack|Smyth, Neil|9781951442200\n2019|Packt Publishing|Android Programming with Kotlin for Beginners: Build Android apps starting from zero programming experience with the new Kotlin programming language|Horton, John|9781789800883\n2022|BPB Publications|Kotlin In-Depth: A Guide to a Multipurpose Programming Language for Server-Side, Front-End, Android, and Multiplatform Mobile (English Edition)|Sedunov, Aleksei|9789391030636\n2021|Payload Media|Android Studio 4.2 Development Essentials - Kotlin Edition: Developing Android Apps Using Android Studio 4.2, Kotlin and Android Jetpack|Smyth, Neil|9781951442309\n2019-10-01T00:00:01Z|Razeware LLC|Kotlin Apprentice (Second Edition): Beginning Programming with Kotlin|Tutorial Team, raywenderlich and Galata, Irina and Shapiro, Ellen and Howard, Joe|9781950325009\n2019-04-30T00:00:01Z|Packt Publishing|Android Programming with Kotlin for Beginners: Build Android apps starting from zero programming experience with the new Kotlin programming language|Horton, John|9781789615401\n2019|Packt Publishing|Mastering Kotlin: Learn advanced Kotlin programming techniques to build apps for Android, iOS, and the web|Ebel, Nate|9781838555726\n2021|Big Nerd Ranch Guides|Kotlin Programming: The Big Nerd Ranch Guide (Big Nerd Ranch Guides)|Greenhalgh, David and Skeen, Josh|9780136870487\n2021|Manning|Functional Programming in Kotlin|Vermeulen, Marco and Bjarnason , Rúnar and Chiusano , Paul|9781638350972\n2017|Manning|Kotlin in Action|Jemerov, Dmitry and Isakova, Svetlana|9781638353690\n2021|Pragmatic Bookshelf|Programming DSLs in Kotlin|Subramaniam, Venkat|9781680507935\n2021|Razeware LLC|Kotlin Apprentice (Third Edition): Beginning Programming with Kotlin|Tutorial Team, raywenderlich and Galata, Irina and Gonda, Victoria and Howard, Joe and Shapiro, Ellen|9781950325375\n2021|Payload Media, Inc.|Android Studio Arctic Fox Essentials - Kotlin Edition: Developing Android Apps Using Android Studio 2020.31 and Kotlin|Smyth, Neil|9781951442347\n2021|Big Nerd Ranch Guides|Kotlin Programming: The Big Nerd Ranch Guide (Big Nerd Ranch Guides)|Greenhalgh, David and Skeen, Josh|9780136891055\n2018|Addison-Wesley Professional|Kotlin for Android App Development (Developer's Library)|Sommerhoff, Peter|9780134854229\n2021|Manning Publications|Functional Programming in Kotlin|Vermeulen, Marco and Bjarnason, Rúnar and Chiusano, Paul|9781617297168\n2019|Apress|Learn Kotlin for Android Development: The Next Generation Language for Modern Android Apps Programming|Späth, Peter|9781484244678\n2019|Packt Publishing|Learn Kotlin Programming: A comprehensive guide to OOP, functions, concurrency, and coroutines in Kotlin 1.3, 2nd Edition|Samuel, Stephen and Bocutiu, Stefan|9781789802351\n2019-05-30T00:00:01Z|Apress|Learn Kotlin for Android Development: The Next Generation Language for Modern Android Apps Programming|Späth, Peter|9781484244661\n2021|Wiley|Programming Kotlin Applications: Building Mobile and Server-Side Applications with Kotlin|McLaughlin, Brett|9781119696186\n2022|Razeware LLC|Functional Programming in Kotlin by Tutorials (First Edition): A Practical Approach to Writing Safer, More Reliable Apps|Tutorial Team, raywenderlich and Carli, Massimo|9781950325672\n2020|Payload Media|Android Studio 3.6 Development Essentials - Kotlin Edition: Developing Android 10 (Q) Apps Using Android Studio 3.6, Kotlin and Android Jetpack|Smyth, Neil|9781951442125\n2018|Razeware LLC|Kotlin Apprentice: Beginning Programming with Kotlin|raywenderlich.com Team and Galata, Irina and Howard, Joe and Lucas, Dick and Shapiro, Ellen|9781942878506\n2018|Payload Media, Inc.|Android Studio 3.2 Development Essentials - Kotlin Edition: Developing Android 9 Apps Using Android Studio 3.2, Kotlin and Android Jetpack|Smyth, Neil|9780960010929\n2018|Packt Publishing|Kotlin Programming By Example: Build real-world Android and web applications the Kotlin way|Adelekan, Iyanu|9781788474542\n2017-12-05T00:00:01Z|Packt Publishing|Reactive Programming in Kotlin: Design and build non-blocking, asynchronous Kotlin applications with RXKotlin, Reactor-Kotlin, Android, and Spring|Chakraborty, Rivu|9781788473026\n2018|Packt Publishing|Mastering High Performance with Kotlin: Overcome performance difficulties in Kotlin with a range of exciting techniques and solutions|Kucherenko, Igor|9781788998352\n2022|Springer|The First Line of Code: Android Programming with Kotlin|Guo, Lin|9789811917998\n2018|Packt Publishing|Kotlin Standard Library Cookbook: Master the powerful Kotlin standard library through practical code examples|Urbanowicz, Samuel|9781788837668\n2018|Packt Publishing|Kotlin Programming Cookbook: Explore more than 100 recipes that show how to build robust mobile and web applications with Kotlin, Spring Boot, and Android|Roy, Aanand Shekhar and Karanpuria, Rashi|9781788472142\n2021|Razeware LLC|Reactive Programming with Kotlin (Second Edition): Learn RX with RxJava, RxKotlin and RxAndroid|Tutorial Team, raywenderlich and Sullivan, Alex|9781950325252\n2018|CreateSpace Independent Publishing Platform|Easy Minecraft® Mod Programming: Learn to Code Minecraft® Mods with Kotlin|Norman, Michael D. and Norman, Isaac S.|9781984336927\n2020|BPB Publications|Kotlin In-Depth [Vol-I]: A Comprehensive Guide to Modern Multi-Paradigm Language (English Edition)|Sedunov, Aleksei|9789389328585\n2018-10-31T00:00:01Z|Packt Publishing|Hands-On Object-Oriented Programming with Kotlin: Build robust software with reusable code using OOP principles and design patterns in Kotlin|Khan, Abid and Kucherenko, Igor|9781789617726\n2018|Packt Publishing|Kotlin Quick Start Guide: Core features to get you ready for developing applications|Devcic, Marko|9781789342598\n2019-12-20T00:00:01Z|Independently published|Kotlin Programming Journal: Notebook For Kotlin Programming: Blank Ruled Notebook / Lined Journal Gift For Kotlin Programmers, 120 pages, 6x9 inches, Matte.|Publishing, Dascity|9781678586218\n2019|BPB Publications|Kotlin At a Glance|Saxena, Swati|9789388511490\n2016||Fundamental Kotlin|Miloš Vasić|9788692030703\n2021|Springer International Publishing AG|Beginners Guide To Kotlin Programming|John Hunt|9783030808921\n2019||Hands-on Reactive Programming With Kotlin|Abid. Roy Khan (aanand Shekhar. Iglesias, Juan Antonio Medina.)|9781789535013\n20180809|Pearson Technology Group|Kotlin Programming|Josh Skeen; David Greenhalgh|9780135162361\n20191114|O'Reilly Media, Inc.|Kotlin Cookbook|Ken Kousen|9781492046639\n23-02-2018|Packt Publishing|Functional Kotlin|Mario Arias; Rivu Chakraborty|9781788397360\n2019|Independently Published|Kotlin Programming|Bruce Herbert|9781099987274\n20190912|O'Reilly Media, Inc.|Programming Kotlin|Venkat Subramaniam|9781680507294\n||Kotlin For Beginners|Peter Sommerhoff|9781788625944\n2019|O'reilly Media|Head First Kotlin|Dawn Griffiths and David Griffiths|9781491996669\n2020|John Wiley & Sons|Programming Kotlin Applications|Brett McLaughlin|9781119696162\n20190213|O'Reilly Media, Inc.|Head First Kotlin|Dawn Griffiths; David Griffiths|9781491996645\n29-05-2019|Packt Publishing|Learn Kotlin Programming|Stephen Samuel; Stefan Bocutiu|9781789808742\n25-01-2018|Packt Publishing|Kotlin Programming Cookbook|Aanand Shekhar Roy; Rashi Karanpuria|9781788475211\n20210816|O'Reilly Media, Inc.|Java to Kotlin|Duncan McGregor; Nat Pryce|9781492082224\n20201209|Wiley Professional Development (P&T)|Programming Kotlin Applications|Brett McLaughlin|9781119696216\n20210323|O'Reilly Media, Inc.|Programming DSLs in Kotlin|Venkat Subramaniam|9781680508260\n28-03-2018|Packt Publishing|Kotlin Programming By Example|Iyanu Adelekan|9781788479783\n43074|Packt Publishing|Reactive Programming in Kotlin|Rivu Chakraborty|9781788470254\n30-07-2018|Packt Publishing|Kotlin Standard Library Cookbook|Samuel Urbanowicz|9781788834643\n20211206|O'Reilly Media, Inc.|Programming Android with Kotlin|Pierre-Olivier Laurence; Amanda Hinchman-Dominguez; G. Blake Meike; Mike Dunn|9781492062950\n20190421|Simon & Schuster|The Joy of Kotlin|Pierre-Yves Saumont|9781638350125\n2019-08-16|Independently Published|Kotlin Basics: The Ultimate Beginner's Guide To Learn Kotlin Programming Step By Step|Moaml Mohmmed|9781686750861\n20211008|Springer Nature|Beginner's Guide to Kotlin Programming|John Hunt|9783030808938\n20210518|Springer Nature|Learn to Program with Kotlin|Tim Lavers|9781484268155\n43047|Packt Publishing|Mastering Android Development with Kotlin|Milos Vasic|9781788474665\n29-01-2018|Packt Publishing|Hands-On Microservices with Kotlin|Juan Antonio Medina Iglesias|9781788473491\n20181112|Springer Nature|Learn Android Studio 3 with Kotlin|Ted Hagos|9781484239070\n21-01-2022|Packt Publishing|Kotlin Design Patterns and Best Practices|Alexey Soshin; Anton Arhipov|9781801816281\n2022-02-18|Payload Media, Inc.|Android Studio Bumble Bee Essentials - Kotlin Edition|Neil Smyth|9781951442408\n15-06-2018|Packt Publishing|Hands-On Design Patterns with Kotlin|Alexey Soshin|9781788999595\n20210615|O'Reilly Media, Inc.|Kotlin and Android Development featuring Jetpack|Michael Fazio|9781680508680\n20180625|Packt Publishing|Learning Kotlin by building Android Applications|Eunice Obugyei; Natarajan Raman|9781788471497\n29-09-2018|Packt Publishing|Hands-On Serverless Applications with Kotlin|Hardik Trivedi; Ameya Kulkarni|9781788991049\n2020-12-08|Payload Media, Inc.|Android Studio 4.1 Development Essentials - Kotlin Edition|Neil Smyth|9781951442248\n2020-04-30|Packt Publishing|Android Studio 3.6 Development Essentials - Kotlin Edition|Neil Smyth|9781800561045\n2020|Packt Publishing|Android Studio 4.0 Development Essentials - Kotlin Edition|Neil Smyth|9781800569065\n2020-04-01|Payload Media, Inc.|Android Studio 3.6 Development Essentials - Kotlin Edition|Neil Smyth|9781951442132\n2019-05-17|Packt Publishing|Android Studio 3.5 Development Essentials - Kotlin Edition|Neil Smyth|9781951442026\n2021-08-10|Packt Publishing|Android Studio 4.2 Development Essentials - Kotlin Edition|Neil Smyth|9781803245614\n44624|Packt Publishing|Simplifying Application Development with Kotlin Multiplatform Mobile|Róbert Nagy|9781801819657\n31-10-2018|Packt Publishing|Hands-On Object-Oriented Programming with Kotlin|Abid Khan; Igor Kucherenko|9781789619645\n30-11-2018|Packt Publishing|Kotlin for Enterprise Applications using Java EE|Raghavendra Rao K|9781788994392\n2021-10-18|Packt Publishing|Android Studio Arctic Fox Essentials - Kotlin Edition|Neil Smyth|9781803247830\n18-05-2018|Packt Publishing|Building Applications with Spring 5 and Kotlin|Milos Vasic|9781788473156\n2020||Android Studio 4. 0 Development Essentials - Kotlin Edition|Neil Smyth|9781800560437\n2020|Packt Publishing, Limited|Android Studio 3. 6 Development Essentials - Kotlin Edition|Neil Smyth|9781800567665\n20220524|Packt Publishing|Kickstart Modern Android Development with Jetpack and Kotlin|Catalin Ghita|9781801818216\n04/2020|BPB Publications|Cracking Kotlin Interview: Solutions to Your Basic to Advanced Programming Questions|Swati Saxena|9789389845266\n03/2020|BPB Publications|Kotlin In-depth [Vol-II]: A comprehensive guide to modern multi-paradigm language|Aleksei Sedunov|9789389423228", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|An empirical study on quality of Android applications written in Kotlin language|10.1007/s10664-019-09727-4|26|5|Bruno Góis Mateus and Matias Martinez|3b5a5ef67d8a888fa8dd00ab532ed2a8a80fbc49\n2019|Characterizing the transition to Kotlin of Android apps: a study on F-Droid, Play Store, and GitHub|10.1145/3340496.3342759|17|3|Riccardo Coppola and Luca Ardito and Marco Torchiano|390cadb4db85664b4db1b61db5808960e00a7b14\n2018|Are you still smelling it?: A comparative study between Java and Kotlin language|10.1145/3267183.3267186|16|3|Matheus Flauzino and Júlio Veríssimo and Ricardo Terra and Elder Cirilo and Vinicius H. S. Durelli and R. Durelli|0dd08a98d01a5f68f853ae074d83a120aa5bc649\n2018|A COMPARATIVE STUDY: JAVA VS KOTLIN PROGRAMMING IN ANDROID APPLICATION DEVELOPMENT|10.26483/IJARCS.V9I3.5978|16|1|Madhurima Banerjee and Subham Bose and A. Kundu and Madhuleena Mukherjee|b047262d0a95f9d910e5336703c08d1a78902e31\n2019|On the adoption, usage and evolution of Kotlin features in Android development|10.1145/3382494.3410676|11|0|B. Mateus and Matias Martinez|f4fb9104e6058762946c2552545b2394702c4652\n2018|Detecting anomalies in Kotlin code|10.1145/3236454.3236457|8|1|T. Bryksin and V. Petukhov and Kirill Smirenko and Nikita Povarov|72ba890c67e01159d2c7084e2f3ae1cc98c4eedf\n2020|Using Large-Scale Anomaly Detection on Code to Improve Kotlin Compiler|10.1145/3379597.3387447|5|0|T. Bryksin and V. Petukhov and Ilya Alexin and Stanislav Prikhodko and A. Shpilman and V. Kovalenko and Nikita Povarov|547b52a967ecb98837816e7a632693e25a5eac7d\n2019|ReduKtor: How We Stopped Worrying About Bugs in Kotlin Compiler|10.1109/ASE.2019.00038|4|0|Daniil Stepanov and M. Akhin and Mikhail A. Belyaev|ef7ce4364fe2a60ac0ab6217e60cffa1db3432f8\n2019|Kotlin language for science and Kmath library|10.1063/1.5130103|4|0|A. Nozik|d75ca59b9807de9fb3d75dd31b1d9bee84f5c621\n2020|Transitioning to Teaching Android With Kotlin and Jetpack Components|10.1145/3328778.3372603|2|1|A. Esakia|97bd27928eb288e20d6805be1b07353d31b7f68a\n2021|A Severity-Based Classification Assessment of Code Smells in Kotlin and Java Application|10.1007/s13369-021-06077-6|2|0|Aakanshi Gupta and Nidhi Kumari Chauhan|2ce7e53004edb91a387ee15c95544b11eb0f6d74\n2017|Spring Boot with Groovy, Scala, and Kotlin|10.1007/978-1-4842-2931-6_17|1|0|K. Reddy|b4a3369f3f6b3637dd3f1693eb6311bd81e2a7bd\n2021|How does Migrating to Kotlin Impact the Run-time Efficiency of Android Apps?|10.1109/SCAM52516.2021.00014|1|0|Michael Peters and Gian Luca Scoccia and I. Malavolta|c3b69c72401f6c217f5a4a64c0995e2cefed624c\n2021|Kotlin coroutines: design and implementation|10.1145/3486607.3486751|1|0|Roman Elizarov and Mikhail A. Belyaev and M. Akhin and Ilmir Usmanov|0113bac81892215e87a7fd47f89fa30dadabc9e8\n2020|Why did developers migrate Android Applications from Java to Kotlin|10.1109/TSE.2021.3120367|1|0|Matias Martinez and B. Mateus|a1c938db94cfd9b971081b8a7cc0ef677ba8b12d\n2020|Type-Centric Kotlin Compiler Fuzzing: Preserving Test Program Correctness by Preserving Types|10.1109/ICST49551.2021.00044|1|0|Daniil Stepanov and M. Akhin and Mikhail A. Belyaev|854efa7220f72835a789b2826eaaa4e4ec3b3c95" }, "kqml": { "title": "Knowledge Query and Manipulation Language", "appeared": 1993, "type": "queryLanguage", "standsFor": "Knowledge Query and Manipulation Language", "country": [ "United States" ], "originCommunity": [ "Defense Advanced Research Projects Agency" ], "wikipedia": { "related": [ "knowledge-interchange-format" ], "summary": "The Knowledge Query and Manipulation Language, or KQML, is a language and protocol for communication among software agents and knowledge-based systems. It was developed in the early 1990s part of the DARPA knowledge Sharing Effort, which was aimed at developing techniques for building large-scale knowledge bases which are shareable and reusable. While originally conceived of as an interface to knowledge based systems, it was soon repurposed as an Agent communication language.Work on KQML was led by Tim Finin of the University of Maryland, Baltimore County and Jay Weber of EITech and involved contributions from many researchers. The KQML message format and protocol can be used to interact with an intelligent system, either by an application program, or by another intelligent system. KQML's \"performatives\" are operations that agents perform on each other's knowledge and goal stores. Higher-level interactions such as contract nets and negotiation are built using these. KQML's \"communication facilitators\" coordinate the interactions of other agents to support knowledge sharing. Experimental prototype systems support concurrent engineering, intelligent design, intelligent planning, and scheduling. KQML is superseded by FIPA-ACL.", "pageId": 17216, "created": 2002, "backlinksCount": 12, "revisionCount": 40, "dailyPageViews": 9, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Knowledge_Query_and_Manipulation_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "krc": { "title": "KRC", "appeared": 1981, "type": "pl", "creators": [ "David Turner" ], "reference": [ "http://krc-lang.org/" ], "standsFor": "Kent Recursive Calculator", "country": [ "United Kingdom" ], "originCommunity": [ "University of Kent" ], "wikipedia": { "related": [ "bcpl", "c", "unix", "isbn" ], "summary": "KRC (Kent Recursive Calculator) is a lazy functional language developed by David Turner from November 1979 to October 1981 based on SASL, with pattern matching, guards and ZF expressions (now more usually called list comprehensions). Two implementations of KRC were written: David Turner's original one in BCPL running on EMAS, and Simon J. Croft's later one in C under Unix, and KRC was the main language used for teaching functional programming at the University of Kent at Canterbury (UK) from 1982 to 1985. The direct successor to KRC is Miranda, which includes a polymorphic type discipline based on that of Milner's ML.", "pageId": 17224, "created": 2002, "backlinksCount": 19, "revisionCount": 42, "dailyPageViews": 10, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/Kent_Recursive_Calculator" }, "hopl": "https://hopl.info/showlanguage.prx?exp=959", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "kris": { "title": "KRIS", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c34199349a86a336f43a1b21d43d13067fa0eb5b" ], "country": [ "Germany" ], "originCommunity": [ "Deutsches Forschungszentrum für Künstliche Intelligenz" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7714", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "krl-0": { "title": "KRL-0", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0a08cd2fe4f0ccd20ec555abe779c22e2ac1c202" ], "country": [ "United States" ], "originCommunity": [ "Xerox PARC", "Stanford University", "Yale University", "University of California San Diego", "University of California, Berkeley" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6835", "centralPackageRepositoryCount": 0 }, "krl": { "title": "KRL", "appeared": 1976, "type": "pl", "creators": [ "Daniel G. Bobrow", "Terry Winograd" ], "standsFor": "knowledge representation language", "country": [ "United States" ], "originCommunity": [ "Xerox PARC", "Stanford University" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "example": [ "ruleset sample {\n meta {\n name \"Hello World\"\n description <<\nHello world\n>>\n author \"Phil Windley\"\n }\n\n // just one rule\n rule hello {\n select when web pageview\n notify(\"Hello world!\", \"Just a note to say hello\");\n }\n}\n" ], "wikipedia": { "related": [ "kuka" ], "summary": "KRL is a knowledge representation language, developed by Daniel G. Bobrow and Terry Winograd while at Xerox PARC and Stanford University, respectively. It is a frame-based language. KRL was an attempt to produce a language which was nice to read and write for the engineers who had to write programs in it, processed like human memory, so you could have realistic AI programs, had an underlying semantics which was firmly grounded like logic languages, all in one, all in one language. And I think it - again, in hindsight - it just bogged down under the weight of trying to satisfy all those things at once.", "pageId": 17227, "created": 2002, "backlinksCount": 18, "revisionCount": 38, "dailyPageViews": 14, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/KRL_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "krl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 440, "id": "KRL" }, "githubBigQuery": { "repos": 30, "users": 18, "id": "KRL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=763", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n||Krl (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133170896" }, "krs": { "title": "KRS", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a83fe3e15a15b154c0198a9680f9ad3de81e55cb" ], "country": [ "Canada" ], "originCommunity": [ "University of Calgary" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2147", "centralPackageRepositoryCount": 0 }, "krypton": { "title": "KRYPTON", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5b5d9f7c71a30599b1b44687403ada7991614c33" ], "country": [ "United States" ], "originCommunity": [ "Fairchild Laboratory for Artificial Intelligence", "University of Toronto" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1157", "centralPackageRepositoryCount": 0 }, "ktexteditor-editor": { "title": "ktexteditor-editor", "appeared": 2014, "type": "editor", "creators": [ "Christoph Cullmann" ], "website": "https://invent.kde.org/frameworks/ktexteditor", "country": [ "Germany" ], "originCommunity": [ "KDE e.V." ], "githubRepo": { "firstCommit": 2014, "stars": 60, "forks": 19, "subscribers": 4, "created": 2015, "updated": 2022, "description": "KTextEditor Framework", "issues": 0, "url": "https://github.com/KDE/ktexteditor" } }, "kubernetes": { "title": "Kubernetes", "appeared": 2014, "type": "application", "website": "https://kubernetes.io", "country": [ "United States" ], "originCommunity": [ "Google" ], "gource": "https://www.youtube.com/watch?v=8ZSxYJ0IaTc", "githubRepo": { "stars": 98042, "forks": 35994, "subscribers": 3238, "created": 2014, "updated": 2023, "description": "Production-Grade Container Scheduling and Management", "issues": 2475, "url": "https://github.com/kubernetes/kubernetes" }, "wikipedia": { "dailyPageViews": 2560, "url": "https://en.wikipedia.org/wiki/Kubernetes" }, "subreddit": [ { "url": "https://www.reddit.com/r/kubernetes/" } ], "packageRepository": [ "https://docs.helm.sh/" ] }, "kuin": { "title": "Kuin", "appeared": 2016, "type": "pl", "country": [ "Japan" ], "originCommunity": [ "https://github.com/kuina" ], "githubRepo": { "firstCommit": 2016, "stars": 261, "forks": 17, "subscribers": 19, "created": 2016, "updated": 2022, "description": "Kuin Programming Language", "issues": 19, "url": "https://github.com/kuina/Kuin" }, "repoStats": { "firstCommit": 2016, "commits": 880, "committers": 10, "files": 625 }, "pygmentsHighlighter": { "filename": "kuin.py", "fileExtensions": [ "kn" ], "id": "Kuin" } }, "kuka": { "title": "KUKA Robot Language", "appeared": 2010, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "KUKA Robotics Corporation" ], "wikipedia": { "related": [ "pascal", "ascii", "rapid" ], "summary": "The KUKA Robot Language, also known as KRL, is a proprietary programming language similar to Pascal and used to control KUKA robots.", "pageId": 50540803, "dailyPageViews": 36, "created": 2016, "backlinksCount": 3, "revisionCount": 12, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/KUKA_Robot_Language" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/kuka", "fileType": "text", "centralPackageRepositoryCount": 0 }, "kumir": { "title": "kumir", "appeared": 2011, "type": "pl", "description": "KuMir, which is used in some Russian schools for education. KuMir\" is a game of words, literally “Kumir\" means “Idol\", but developers of this language say that this is abbreviature: “K\" - Set, “u\" - of Educational, “Mir\" - WORLDs (КуМир - Комплект Учебных МИРов).", "website": "https://www.niisi.ru/kumir/", "country": [ "Russia" ], "originCommunity": [ "https://github.com/a-a-maly/kumir2/issues" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2011, "stars": 11, "forks": 6, "subscribers": 2, "created": 2018, "updated": 2022, "description": "New home for Kumir2.", "issues": 23, "url": "https://github.com/a-a-maly/kumir2" }, "repoStats": { "firstCommit": 2011, "commits": 3785, "committers": 23, "files": 9027 }, "leachim6": { "filepath": "k/Kumir.kum", "fileExtensions": [ "kum" ], "example": [ "алг \nнач\n вывод \"Hello World\"\nкон\n" ], "id": "Kumir" } }, "kuroko": { "title": "Kuroko", "appeared": 2020, "type": "pl", "creators": [ "K. Lange" ], "website": "https://kuroko-lang.github.io/", "originCommunity": [ "https://github.com/kuroko-lang" ], "githubRepo": { "firstCommit": 2020, "stars": 300, "forks": 17, "subscribers": 7, "created": 2020, "updated": 2022, "description": "Dialect of Python with explicit variable declaration and block scoping, with a lightweight and easy-to-embed bytecode compiler and interpreter.", "issues": 5, "url": "https://github.com/kuroko-lang/kuroko" }, "repoStats": { "firstCommit": 2020, "commits": 1266, "committers": 4, "files": 443 } }, "kvikkalkul": { "title": "Kvikkalkul", "appeared": 2003, "type": "pl", "reference": [ "https://sv.wikipedia.org/wiki/Kvikkalkul" ], "country": [ "Sweden" ], "originCommunity": [ "Unknown" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2052", "centralPackageRepositoryCount": 0 }, "kvsapi": { "title": "kvsapi", "appeared": 2019, "type": "standard", "description": "This document describes the Key Value Storage (KVS) Application Program Interface (API) specification for SSD storage devices with Object Drive based Key Value Storage. It provides a set of APIs that are portable across multiple vendor SSD products.", "website": "https://www.snia.org/tech_activities/standards/curr_standards/kvsapi", "country": [ "United States" ], "originCommunity": [ "Storage Networking Industry Association" ] }, "kylix": { "title": "Kylix", "appeared": 2000, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Borland_Kylix" ], "country": [ "United States" ], "originCommunity": [ "Borland Software Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6042", "centralPackageRepositoryCount": 0 }, "kyma": { "title": "Kyma", "appeared": 1986, "type": "pl", "reference": [ "https://www.revolvy.com/page/Kyma-%28sound-design-language%29" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana-Champaign" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Kyma_(sound_design_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6400", "centralPackageRepositoryCount": 0 }, "l": { "title": "l", "appeared": 2013, "type": "pl", "website": "http://l-lang.org", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/mlemerre/l-lang/issues" ], "domainName": { "registered": 2013, "name": "l-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n16787913|TDOP / Pratt parser in pictures|http://l-lang.org/blog/TDOP---Pratt-parser-in-pictures/|2018-04-08 19:43:02 UTC|1523216582|fanf2|0|2" }, "l2": { "title": "l2", "appeared": 2017, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/murisi/L2/issues" ], "githubRepo": { "firstCommit": 2017, "stars": 127, "forks": 9, "subscribers": 8, "created": 2017, "updated": 2022, "description": "A minimalist type-inferred programming language with procedural macro support", "issues": 0, "url": "https://github.com/murisi/L2" }, "repoStats": { "firstCommit": 2017, "commits": 1492, "committers": 3, "files": 69 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n14510073|Show HN: L2: An experiment/programming language|2017-06-07 21:38:32 UTC|1496871512|murisitarusenga|0|2" }, "l6": { "title": "L6", "appeared": 1963, "type": "pl", "description": "Bell Telephone Laboratories' Low-Level Linked List Language L6 (pronounced “L-six”) is a new programming language for list structure manipulations. It contains many of the facilities which underlie such list processors as IPL, LISP, COMIT and SNOBOL, but permits the user to get much closer to machine code in order to write faster-running programs, to use storage more efficiently and to build a wider variety of linked data structures.", "reference": [ "https://dl.acm.org/citation.cfm?id=365792" ], "country": [ "United States" ], "originCommunity": [ "Bell Telephone Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=227", "fileType": "text", "centralPackageRepositoryCount": 0 }, "labtran": { "title": "LABTRAN", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/63cd2c71567ce68a860614381f5256bf1086aad4" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin System" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3701", "centralPackageRepositoryCount": 0 }, "labview": { "title": "LabVIEW G", "appeared": 1986, "type": "pl", "website": "http://www.ni.com/labview", "documentation": [ "https://www.ni.com/docs/en-US/bundle/labview/page/lvhelp/labview_help.html" ], "aka": [ "g" ], "country": [ "United States" ], "originCommunity": [ "National Instruments Corporation" ], "releaseNotesUrl": "https://www.ni.com/nl-nl/support/documentation/release-notes/product.labview.html", "visualParadigm": true, "hasFixedPoint": { "example": "", "value": true }, "wikipedia": { "related": [ "linux", "g-code", "unix", "matlab", "fortran", "c", "drakon", "simulink" ], "summary": "Laboratory Virtual Instrument Engineering Workbench (LabVIEW) is a system-design platform and development environment for a visual programming language from National Instruments. The graphical language is named \"G\"; not to be confused with G-code. Originally released for the Apple Macintosh in 1986, LabVIEW is commonly used for data acquisition, instrument control, and industrial automation on a variety of operating systems (OSs), including Microsoft Windows, various versions of Unix, Linux, and macOS. The latest versions of LabVIEW are LabVIEW 2017 and LabVIEW NXG 1.0, released in May 2017.", "pageId": 544733, "dailyPageViews": 556, "created": 2004, "backlinksCount": 354, "revisionCount": 1028, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/LabVIEW" }, "githubLanguage": { "fileExtensions": [ "lvproj", "lvclass", "lvlib" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "xml", "codemirrorMode": "xml", "codemirrorMimeType": "text/xml", "tmScope": "text.xml", "repos": 5849, "id": "LabVIEW" }, "githubBigQuery": { "repos": 357, "users": 165, "id": "LabVIEW" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 12, "commitCount": 97, "url": "https://github.com/textmate/xml.tmbundle" }, "projectEuler": { "memberCount": { "2019": 129, "2022": 134 }, "id": "LabVIEW" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LabVIEW", "indeedJobs": { "2017": 2012, "query": "labview engineer" }, "faqPageUrl": [ "https://www.ni.com/nl-nl/support/documentation/supplemental/06/labview-object-oriented-programming-faq.html" ], "subreddit": [ { "memberCount": { "2017": 1558, "2022": 5124 }, "url": "https://reddit.com/r/LabVIEW" } ], "meetup": { "memberCount": 548, "groupCount": 5, "url": "https://www.meetup.com/topics/labview" }, "tiobe": { "currentRank": 45, "id": "LabVIEW" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2657", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "ladder-logic": { "title": "Ladder Logic", "appeared": 1994, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "International Electrotechnical Commission" ], "visualParadigm": true, "wikipedia": { "example": [ "+--------+\n --------------------+ A + B +-----------\n | into C |\n +--------+\n Adder" ], "related": [ "sequential-function-chart", "basic", "c" ], "summary": "Ladder logic was originally a written method to document the design and construction of relay racks as used in manufacturing and process control. Each device in the relay rack would be represented by a symbol on the ladder diagram with connections between those devices shown. In addition, other items external to the relay rack such as pumps, heaters, and so forth would also be shown on the ladder diagram. See relay logic. Ladder logic has evolved into a programming language that represents a program by a graphical diagram based on the circuit diagrams of relay logic hardware. Ladder logic is used to develop software for programmable logic controllers (PLCs) used in industrial control applications. The name is based on the observation that programs in this language resemble ladders, with two vertical rails and a series of horizontal rungs between them. While ladder diagrams were once the only available notation for recording programmable controller programs, today other forms are standardized in IEC 61131-3 (For example, as an alternative to the graphical ladder logic form, there is also a more assembly language like format called Instruction list within the IEC 61131-3 standard.).", "pageId": 66251, "dailyPageViews": 468, "created": 2002, "backlinksCount": 83, "revisionCount": 513, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Ladder_logic" }, "tiobe": { "id": "Ladder Logic" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8317", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "lagoona": { "title": "Lagoona", "appeared": 1997, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of California, Riverside", "University of California, Irvine" ], "wikipedia": { "summary": "Lagoona is an experimental programming language developed by Michael Franz, a former student of Niklaus Wirth. It explores component-oriented programming with the use of stand-alone messages and message sets, message forwarding, and by de-emphasizing classes.", "pageId": 3154023, "created": 2005, "backlinksCount": 7, "dailyPageViews": 4, "url": "https://en.wikipedia.org/wiki/Lagoona_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2151", "fileType": "text", "centralPackageRepositoryCount": 0 }, "lain": { "title": "lain", "appeared": 2017, "type": "pl", "description": "Lain is both an inline scripting library that allows for complex templating of the wiki pages, and a programming language that exists at the core of the engine to load and parse content for each article.", "website": "https://wiki.xxiivv.com/#lain", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/XXIIVV" ], "domainName": { "name": "wiki.xxiivv.com" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "(add (sub 5 3) 2) ; Basic Math\n(λ (a b c) (concat a b c)) ; Lambda\n(def obj {:foo \"bar\"}) ; Creating object\n(join obj:foo) ; Reading object parameters\n(def _sidebar (dom:create \"sidebar\")) ; Creating DOM elements" ] }, "lambcalc": { "title": "lambcalc", "appeared": 2019, "type": "pl", "creators": [ "William Rutherford" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/WilliamRutherford/LambCalc/issues" ], "githubRepo": { "firstCommit": 2019, "stars": 2, "created": 2019, "updated": 2019, "description": "a Lambda Calculus Interpreter", "issues": 1, "forks": 0, "subscribers": 1, "url": "https://github.com/WilliamRutherford/LambCalc" }, "repoStats": { "firstCommit": 2019, "commits": 36, "committers": 2, "files": 16 } }, "lambda-obliv": { "title": "lambda-obliv", "appeared": 2020, "type": "pl", "description": "A Language for Probabilistically Oblivious Computation. An oblivious computation is one that is free of direct and indirect information leaks, e.g., due to observable differences in timing and memory access patterns. This paper presents λobliv, a core language whose type system enforces obliviousness. Prior work on type-enforced oblivious computation has focused on deterministic programs. λobliv is new in its consideration of programs that implement probabilistic algorithms, such as those involved in cryptography. λobliv employs a substructural type system and a novel notion of probability region to ensure that information is not leaked via the observed distribution of visible events. Probability regions support reasoning about probabilistic correlation and independence between values, and our use of probability regions is motivated by a source of unsoundness that we discovered in the type system of ObliVM, a language for implementing state of the art oblivious algorithms.", "reference": [ "https://dl.acm.org/doi/pdf/10.1145/3371118?download=true" ], "country": [ "United States" ], "originCommunity": [ "University of Vermont", "University of Maryland", "Citadel Securities" ] }, "lambda-prolog": { "title": "ΛProlog", "appeared": 1986, "type": "pl", "country": [ "France" ], "originCommunity": [ "École polytechnique" ], "wikipedia": { "related": [ "prolog" ], "summary": "λProlog, also written lambda Prolog, is a logic programming language featuring polymorphic typing, modular programming, and higher-order programming. These extensions to Prolog are derived from the higher-order hereditary Harrop formulas used to justify the foundations of λProlog. Higher-order quantification, simply typed λ-terms, and higher-order unification gives λProlog the basic supports needed to capture the λ-tree syntax approach to higher-order abstract syntax, an approach to representing syntax that maps object-level bindings to programming language bindings. Programmers in λProlog need not deal with bound variable names: instead various declarative devices are available to deal with binder scopes and their instantiations. Since 1986, λProlog has received numerous implementations. As of 2013, the language and its implementations are still actively being developed. The Abella theorem prover has been designed to provide an interactive environment for proving theorems about the declarative core of λProlog.", "created": 2006, "backlinksCount": 20, "pageId": 4723511, "revisionCount": 52, "dailyPageViews": 11, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/%CE%9BProlog" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "lambda-zero": { "title": "lambda-zero", "appeared": 2018, "type": "pl", "creators": [ "Chris Clark" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/clark800/lambda-zero/issues" ], "githubRepo": { "firstCommit": 2018, "stars": 65, "forks": 4, "subscribers": 5, "created": 2018, "updated": 2022, "description": "A minimalist pure lazy functional programming language", "issues": 4, "url": "https://github.com/clark800/lambda-zero" }, "repoStats": { "firstCommit": 2018, "commits": 1080, "committers": 4, "files": 150 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n16276222|Show HN: Lambda Zero – A minimalist pure lazy functional programming language|2018-01-31 18:31:53 UTC|1517423513|clark800|0|1", "isbndb": "" }, "lambda": { "title": "lambda", "appeared": 2013, "type": "plzoo", "description": "untyped λ-calculus, several evaluation strategies", "website": "http://plzoo.andrej.com/language/lambda.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "https://github.com/andrejbauer/plzoo/issues" ], "wordRank": 6539, "centralPackageRepositoryCount": 0 }, "lamderp": { "title": "lamderp", "appeared": 2013, "type": "pl", "creators": [ "James Keane" ], "website": "https://github.com/jameskeane/lamderp", "country": [ "Canada" ], "originCommunity": [ "https://github.com/jameskeane/lamderp/issues" ], "writtenIn": [ "python" ], "githubRepo": { "stars": 13, "forks": 0, "subscribers": 1, "created": 2013, "updated": 2013, "description": "Simple easy python lambda DSL", "url": "https://github.com/jameskeane/lamderp" }, "repoStats": { "firstCommit": 2013, "commits": 5, "committers": 1, "files": 5 } }, "lamdu-editor": { "title": "lamdu-editor", "appeared": 2011, "type": "editor", "creators": [ "Eyal Lotem", "Yair Chuchem" ], "description": "This project aims to create a next-generation, live programming environment that radically improves the programming experience.", "website": "https://lamdu.org", "reference": [ "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "country": [ "Israel" ], "originCommunity": [ "https://github.com/lamdu" ], "domainName": { "registered": 2015, "name": "lamdu.org" }, "githubRepo": { "firstCommit": 2011, "stars": 1798, "forks": 68, "subscribers": 56, "created": 2011, "updated": 2022, "description": "lamdu - towards the next generation IDE", "issues": 17, "url": "https://github.com/lamdu/lamdu" } }, "lamdu": { "title": "Lamdu", "appeared": 2011, "type": "pl", "creators": [ "Eyal Lotem", "Yair Chuchem" ], "website": "https://lamdu.org", "country": [ "Israel" ], "originCommunity": [ "https://github.com/lamdu" ], "githubRepo": { "firstCommit": 2011, "stars": 1798, "forks": 68, "subscribers": 56, "created": 2011, "updated": 2022, "description": "lamdu - towards the next generation IDE", "issues": 17, "url": "https://github.com/lamdu/lamdu" }, "repoStats": { "firstCommit": 2011, "commits": 11140, "committers": 27, "files": 450 } }, "lamina": { "title": "LAMINA", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/320c20d18cc4d1770e07df96c84cad64d92b1135" ], "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1405", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "lammps-format": { "title": "Large-scale Atomic/Molecular Massively Parallel Simulator Format", "appeared": 1995, "type": "application", "reference": [ "https://en.wikipedia.org/wiki/LAMMPS" ], "standsFor": "Large-scale Atomic/Molecular Massively Parallel Simulator Format", "country": [ "United States" ], "originCommunity": [ "Sandia National Laboratories", "Temple University" ], "example": [ "# 2d LJ crack simulation\n\ndimension 2\nboundary s s p\n\natom_style atomic\nneighbor 0.3 bin\nneigh_modify delay 5\n\n# create geometry\n\nlattice hex 0.93\nregion box block 0 100 0 40 -0.25 0.25\ncreate_box 5 box\ncreate_atoms 1 box\n\nmass 1 1.0\nmass 2 1.0\nmass 3 1.0\nmass 4 1.0\nmass 5 1.0\n\n# LJ potentials\n\npair_style lj/cut 2.5\npair_coeff * * 1.0 1.0 2.5\n\n# define groups\n\nregion 1 block INF INF INF 1.25 INF INF\ngroup lower region 1\nregion 2 block INF INF 38.75 INF INF INF\ngroup upper region 2\ngroup boundary union lower upper\ngroup mobile subtract all boundary\n\nregion leftupper block INF 20 20 INF INF INF\nregion leftlower block INF 20 INF 20 INF INF\ngroup leftupper region leftupper\ngroup leftlower region leftlower\n\nset group leftupper type 2\nset group leftlower type 3\nset group lower type 4\nset group upper type 5\n\n# initial velocities\n\ncompute new mobile temp\nvelocity mobile create 0.01 887723 temp new\nvelocity upper set 0.0 0.3 0.0\nvelocity mobile ramp vy 0.0 0.3 y 1.25 38.75 sum yes\n\n# fixes\n\nfix 1 all nve\nfix 2 boundary setforce NULL 0.0 0.0\n\n# run\n\ntimestep 0.003\nthermo 200\nthermo_modify temp new\n\nneigh_modify exclude type 2 3\n\n#dump 1 all atom 500 dump.crack\n\n#dump 2 all image 250 image.*.jpg type type &\n# zoom 1.6 adiam 1.5\n#dump_modify 2 pad 4\n\n#dump 3 all movie 250 movie.mpg type type &\n# zoom 1.6 adiam 1.5\n#dump_modify 3 pad 4\n\nrun 5000" ], "centralPackageRepositoryCount": 0 }, "lanai": { "title": "Lanai", "appeared": 2016, "type": "isa", "website": "https://github.com/llvm-mirror/llvm/tree/master/lib/Target/Lanai", "originCommunity": [ "Google" ], "fileType": "na", "centralPackageRepositoryCount": 0 }, "language-for-class-description": { "title": "Language for Class Description", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5ddcea747bb18a2a5038eee966987117da881993" ], "country": [ "United States" ], "originCommunity": [ "Case Western Reserve University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5346", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "language-h": { "title": "Language H", "appeared": 1962, "type": "pl", "country": [ "United States" ], "originCommunity": [ "NCR Corporation" ], "wikipedia": { "url": "https://en.m.wikipedia.org/wiki/Language_H" } }, "language-server-protocol": { "title": "LSP", "appeared": 2016, "type": "protocol", "website": "https://microsoft.github.io/language-server-protocol/", "reference": [ "https://langserver.org/" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Language_Server_Protocol" }, "isbndb": "" }, "laning-and-zierler-system": { "title": "Laning and Zierler system", "appeared": 1953, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "example": [ "1 x = 0,\n z = 1 - x2/2 + x4/2·3·4 - x6/2·3·4·5·6\n + x8/2·3·4·5·6·7·8 - x10/2·3·4·5·6·7·8·9·10," ], "related": [ "speedcoding", "punched-tape" ], "summary": "The Laning and Zierler system (sometimes called \"George\" by its users) was one of the first operating algebraic compilers, that is, a system capable of accepting mathematical formulae in algebraic notation and producing equivalent machine code (the term compiler had not yet been invented and the system was referred to as \"an interpretive program\"). It was implemented in 1952 for the MIT WHIRLWIND by J. Halcombe Laning and Neal Zierler. It is preceded by the UNIVAC A-2, IBM Speedcoding and a number of systems that were proposed but never implemented.", "created": 2005, "backlinksCount": 11, "pageId": 2732031, "revisionCount": 41, "dailyPageViews": 6, "appeared": 1952, "url": "https://en.wikipedia.org/wiki/Laning_and_Zierler_system" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "lap": { "title": "LAP", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c0af005399bcec5892b047197a3d8eb3efbe12de" ], "country": [ "France" ], "originCommunity": [ "Institut international de robotique et d'intelligence artificielle de Marseille" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4214", "wordRank": 8608, "centralPackageRepositoryCount": 0 }, "laravel-framework": { "title": "Laravel", "appeared": 2011, "type": "framework", "country": [ "Various" ], "originCommunity": [ "Laravel LLC" ], "wikipedia": { "summary": "Laravel is a free, open-source PHP web framework, created by Taylor Otwell and intended for the development of web applications following the model–view–controller (MVC) architectural pattern and based on Symfony. Some of the features of Laravel are a modular packaging system with a dedicated dependency manager, different ways for accessing relational databases, utilities that aid in application deployment and maintenance, and its orientation toward syntactic sugar.The source code of Laravel is hosted on GitHub and licensed under the terms of MIT License.", "backlinksCount": 362, "pageId": 41395046, "dailyPageViews": 721, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Laravel" } }, "larceny": { "title": "Larceny Scheme implementation", "appeared": 2017, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Oregon" ], "wikipedia": { "related": [ "scheme", "arm", "c", "sparc" ], "summary": "Larceny is an implementation of the Scheme programming language built around the Twobit optimizing compiler. Larceny offers several back-ends able to target native x86 and ARMv7 code. Petit Larceny is also available and emits C source code, which can then be further compiled to native code with an ordinary C compiler.Older versions (<0.98) included support for the SPARC architecture in Larceny, and for Microsoft's Common Language Runtime via Common Larceny.Larceny supports all major Scheme standards (R5RS, IEEE/ANSI, R6RS, and R7RS. The Larceny software is open source and available online.", "created": 2006, "backlinksCount": 61, "pageId": 8527916, "dailyPageViews": 5, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Larceny_(Scheme_implementation)" }, "centralPackageRepositoryCount": 0 }, "larch": { "title": "Larch", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/55c3a24de61631cc2d69e666ff82a778c33be462" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology", "Digital Equipment Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1158", "centralPackageRepositoryCount": 0 }, "laris": { "title": "LARIS", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/18ff465103f91d29e59496b9d73fb8a479093bb5" ], "country": [ "The Netherlands" ], "originCommunity": [ "Centrum Wiskunde & Informatica", "Philips Research", "Utrecht University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5683", "centralPackageRepositoryCount": 0, "isbndb": "" }, "larp": { "title": "LARP", "appeared": 2003, "type": "pl", "creators": [ "Marco Lavoie" ], "description": "LARP is an educational software for teaching algorithmic in structured programming using pseudo code and flowcharts. LARP's main advantage over traditional programming languages is its flexible and semi natural syntax, allowing one to formulate algorithms without the impediments of cryptic languages such as C++, Pascal or Java.", "website": "http://www.marcolavoie.ca/larp/en/default.htm", "country": [ "Canada" ], "originCommunity": [ "https://web.archive.org/web/20200220111251/http://larp.marcolavoie.ca/en/techsupport/bugs_suggestions.htm" ], "related": [ "flowgorithm" ], "visualParadigm": true, "example": [ "\\\\ Simple pseudo code\nSTART\n WRITE \"Enter a number\"\n READ N\n\n IF N < 0 THEN\n WRITE \"Negative number\"\n ELSE\n WRITE \"Positive number\"\n ENDIF\nEND" ], "isbndb": "" }, "lasp": { "title": "lasp", "appeared": 2015, "type": "pl", "website": "http://lasp-lang.org", "country": [ "Belgium" ], "originCommunity": [ "https://github.com/lasp-lang" ], "domainName": { "registered": 2015, "awisRank": { "2022": 3527510 }, "name": "lasp-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9671964|LASP: A Language for Distributed, Eventually Consistent Computations|http://lasp-lang.org|2015-06-06 19:41:59 UTC|1433619719|MCRed|27|103" }, "lass": { "title": "LASS", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/aabd21de2415ffe62a3982a599f5162b61ac2c09" ], "country": [ "Ireland" ], "originCommunity": [ "National Institute for Higher Education" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2823", "centralPackageRepositoryCount": 0, "isbndb": "" }, "lasso": { "title": "Lasso", "appeared": 1995, "type": "pl", "creators": [ "Kyle Jessup" ], "website": "http://www.lassosoft.com", "documentation": [ "https://docs.lassox.com/" ], "fileExtensions": [ "lasso", "LassoApp" ], "country": [ "Canada" ], "originCommunity": [ "LassoSoft Inc" ], "domainName": { "registered": 2005, "awisRank": { "2022": 12026019 }, "name": "lassosoft.com" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "true", "false" ] ], "wikipedia": { "example": [ "// Define type\ndefine bottles_of_beer => type {\n\n\t// Define internal data \n\tdata private bottles = 99\n\n\t// Define private methods\n\tprivate br => '
'\n\tprivate s => .bottles != 1 ? 's' | ''\n\t\n\t// Generate lyrics when object represented as a string\n\tpublic asstring => {\n\n\t\tlocal(out = '')\n\t\n\t\t// Use Lasso query syntax to generate the lyrics\n\t\n\n\t\twith n in 99 to 1 by -1 do {\n\t\t\t.bottles = #n\n\t\t\t#out += .bottles + ' bottle' + .s + ' of beer on the wall, ' + .br\n\t\t\t#out += .bottles + ' bottle' + .s + ' of beer; ' + .br\n\t\t\t.bottles--\n\t\t\t#out += 'Take one down, pass it around, ' + .br\n\t\t\t#out += .bottles + ' bottle' + .s + ' of beer on the wall. ' + (.br * 2) \n\t\t}\n\n\t\t// Return result\n\t\treturn #out\n\t}\n}\n\nbottles_of_beer" ], "related": [ "c", "linux", "dylan", "smalltalk", "scala", "html", "php", "python", "java", "sql", "unicode", "utf-8", "cfml", "applescript", "mysql", "eclipse-editor", "asp" ], "summary": "Lasso is an application server and server management interface used to develop internet applications and is a general-purpose, high-level programming language. Originally a web datasource connection tool, for Filemaker and later included in Apple Computer's FileMaker 4.0 and Claris Homepage as CDML, it has since evolved into a complex language used to develop and serve large-scale internet applications and web pages. Lasso includes a simple template system allowing code to control generation of HTML and other content types. Lasso is object-oriented and every value is an object. It also supports procedural programming through unbound methods. The language uses traits and multiple dispatch extensively. Lasso has a dynamic type system, where objects can be loaded and augmented at runtime, automatic memory management, a comprehensive standard library, and three compiling methodologies: dynamic (comparable to PHP-Python), just-in-time compilation (comparable to Java or .NET Framework), and pre-compiled (comparable to C). Lasso also supports Query Expressions, allowing elements within arrays and other types of sequences to be iterated, filtered, and manipulated using a natural language syntax similar to SQL. Lasso includes full Unicode character support in the standard string object, allowing it to serve and support multi-byte characters such as Japanese and Swedish, and supports transparent UTF-8 conversion when writing string data to the network or file system. Lasso is often used as a scripting language, and also used in a wide range of non-scripting contexts. Lasso code can be packaged into standalone executable programs called \"LassoApps\", in which folder structures are compiled into single files. The Lasso Server application server runs as a system service and receives requests from the web server through FastCGI. It then hands the request off to the appropriate Lasso Instance, which formulates the response. Multiple individual instances are supported, allowing one server to handle multiple sites, each as separate processes. The server uses a high performance IO-based green threading system designed for multi-core systems. Lasso can be compared to the server-side scripting languages PHP and Python, ColdFusion, Ruby, etc. Free for development, Lasso allows partial access to its source code, allowing developers to add or change major components of the language (for example, Ke Carlton's DS implementation of the Lasso Inline). Licensing comes in both SAS and stand-alone versions.", "pageId": 524247, "dailyPageViews": 35, "created": 2004, "backlinksCount": 35, "revisionCount": 429, "appeared": 1995, "fileExtensions": [ "lasso", "LassoApp" ], "url": "https://en.wikipedia.org/wiki/Lasso_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "lasso", "las", "lasso8", "lasso9" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nplotly dash-sample-apps https://github.com/plotly.png https://github.com/plotly/dash-sample-apps Lasso #999999 172 186 65 \"Apps hosted in the Dash Gallery\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "tmScope": "file.lasso", "aliases": [ "lassoscript" ], "repos": 464, "id": "Lasso" }, "githubBigQuery": { "repos": 435, "users": 388, "id": "Lasso" }, "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "lasso", "lasso[89]" ], "id": "Lasso" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2014, "committerCount": 1, "commitCount": 11, "sampleCount": 4, "example": [ "\n/**\n\ttrait_json_serialize\n\tObjects with this trait will be assumed to convert to json data\n\twhen its ->asString method is called\n*/\ndefine trait_json_serialize => trait {\n\trequire asString()\n}\n\ndefine json_serialize(e::bytes)::string => ('\"' + (string(#e)->Replace(`\\`, `\\\\`) & Replace('\\\"', '\\\\\"') & Replace('\\r', '\\\\r') & Replace('\\n', '\\\\n') & Replace('\\t', '\\\\t') & Replace('\\f', '\\\\f') & Replace('\\b', '\\\\b') &) + '\"')\ndefine json_serialize(e::string)::string => ('\"' + (string(#e)->Replace(`\\`, `\\\\`) & Replace('\\\"', '\\\\\"') & Replace('\\r', '\\\\r') & Replace('\\n', '\\\\n') & Replace('\\t', '\\\\t') & Replace('\\f', '\\\\f') & Replace('\\b', '\\\\b') &) + '\"')\ndefine json_serialize(e::json_literal)::string => (#e->asstring)\ndefine json_serialize(e::integer)::string => (#e->asstring)\ndefine json_serialize(e::decimal)::string => (#e->asstring)\ndefine json_serialize(e::boolean)::string => (#e->asstring)\ndefine json_serialize(e::null)::string => ('null')\ndefine json_serialize(e::date)::string => ('\"' + #e->format(#e->gmt ? '%QT%TZ' | '%Q%T') + '\"')\n/*\ndefine json_serialize(e::array)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; }\n\treturn('[' + #output + ']');\n}\ndefine json_serialize(e::staticarray)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; }\n\treturn('[' + #output + ']');\n}\n*/\ndefine json_serialize(e::trait_forEach)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; }\n\treturn('[' + #output + ']');\n}\ndefine json_serialize(e::map)::string => {\n\tlocal(output = with pr in #e->eachPair \n\t\t\t\t\tselect json_serialize(#pr->first->asString) + ': ' + json_serialize(#pr->second))\n\treturn '{' + #output->join(',') + '}'\n}\ndefine json_serialize(e::json_object)::string => {\n\tlocal(output) = '';\n\tlocal(delimit) = '';\n\t#e->foreachpair => { #output += #delimit + #1->first + ': ' + json_serialize(#1->second); #delimit = ', '; }\n\treturn('{' + #output + '}');\n}\ndefine json_serialize(e::trait_json_serialize) => #e->asString\ndefine json_serialize(e::any)::string => json_serialize('' + #e->serialize + '')\n\n// Bil Corry fixes for decoding json\ndefine json_consume_string(ibytes::bytes) => {\n\tlocal(obytes) = bytes;\n\tlocal(temp) = 0;\n\twhile((#temp := #ibytes->export8bits) != 34);\n\t\t#obytes->import8bits(#temp);\n\t\t(#temp == 92) ? #obytes->import8bits(#ibytes->export8bits); // Escape \\\n \t/while;\n\tlocal(output = string(#obytes)->unescape)\n\t//Replace('\\\\\"', '\\\"') & Replace('\\\\r', '\\r') & Replace('\\\\n', '\\n') & Replace('\\\\t', '\\t') & Replace('\\\\f', '\\f') & Replace('\\\\b', '\\b') &;\n\tif(#output->BeginsWith('') && #output->EndsWith(''));\n\t\tProtect;\n\t\t\treturn serialization_reader(xml(#output - '' - ''))->read\n\t\t/Protect;\n\telse( (#output->size == 16 or #output->size == 15) and regexp(`\\d{8}T\\d{6}Z?`, '', #output)->matches)\n\t\treturn date(#output, -Format=#output->size == 16?`yyyyMMdd'T'HHmmssZ`|`yyyyMMdd'T'HHmmss`)\n\t/if\n\treturn #output\n}\n\n// Bil Corry fix + Ke fix\ndefine json_consume_token(ibytes::bytes, temp::integer) => {\n\n\tlocal(obytes = bytes->import8bits(#temp) &,\n\t\tdelimit = array(9, 10, 13, 32, 44, 58, 93, 125)) // \\t\\r\\n ,:]}\n\n\twhile(#delimit !>> (#temp := #ibytes->export8bits))\n\t\t#obytes->import8bits(#temp)\n\t/while\n\n\t#temp == 125? // }\n\t\t#ibytes->marker -= 1\n//============================================================================\n//\tIs also end of token if end of array[]\n\t#temp == 93? // ]\n\t\t#ibytes->marker -= 1\n//............................................................................\t\t\n\n\tlocal(output = string(#obytes))\n\t#output == 'true'?\n\t\treturn true\n\t#output == 'false'?\n\t\treturn false\n\t#output == 'null'?\n\t\treturn null\n\tstring_IsNumeric(#output)?\n\treturn (#output >> '.')? decimal(#output) | integer(#output)\n\n\treturn #output\n}\n\n// Bil Corry fix\ndefine json_consume_array(ibytes::bytes)::array => {\n\tLocal(output) = array;\n\tlocal(delimit) = array( 9, 10, 13, 32, 44); // \\t\\r\\n ,\n\tlocal(temp) = 0;\n\tWhile((#temp := #ibytes->export8bits) != 93); // ]\n\t\tIf(#delimit >> #temp);\n\t\t\t// Discard whitespace\n\t\tElse(#temp == 34); // \"\n\t\t\t#output->insert(json_consume_string(#ibytes));\n\t\tElse(#temp == 91); // [\n\t\t\t#output->insert(json_consume_array(#ibytes));\n\t\tElse(#temp == 123); // {\n\t\t\t#output->insert(json_consume_object(#ibytes));\n\t\tElse;\n\t\t\t#output->insert(json_consume_token(#ibytes, #temp));\n\t\t\t(#temp == 93) ? Loop_Abort;\n\t\t/If;\n\t/While;\n\tReturn(#output);\n}\n\n// Bil Corry fix\ndefine json_consume_object(ibytes::bytes)::map => {\n\tLocal('output' = map,\n\t\t'delimit' = array( 9, 10, 13, 32, 44), // \\t\\r\\n ,\n\t\t'temp' = 0,\n\t\t'key' = null,\n\t\t'val' = null);\n\tWhile((#temp := #ibytes->export8bits) != 125); // }\n\t\tIf(#delimit >> #temp);\n\t\t\t// Discard whitespace\n\t\tElse((#key !== null) && (#temp == 34)); // \"\n\t\t\t#output->insert(#key = json_consume_string(#ibytes));\n\t\t\t#key = null;\n\t\tElse((#key !== null) && (#temp == 91)); // [\n\t\t\t#output->insert(#key = json_consume_array(#ibytes));\n\t\t\t#key = null;\n\t\tElse((#key !== null) && (#temp == 123)); // {\n\t\t\t#output->insert(#key = json_consume_object(#ibytes));\n\t\t\t#key = null;\n\t\tElse((#key !== null));\n\t\t\t#output->insert(#key = json_consume_token(#ibytes, #temp));\n\t\t\t#key = null;\n\t\tElse;\n\t\t\t#key = json_consume_string(#ibytes);\n\t\t\twhile(#delimit >> (#temp := #ibytes->export8bits));\n\t\t\t/while;\n\t\t\t#temp != 58 ? Loop_Abort;\n\t\t/If;\n\t/While;\n\n\tIf((#output >> '__jsonclass__') && (#output->Find('__jsonclass__')->isa('array')) && (#output->Find('__jsonclass__')->size >= 2) && (#output->Find('__jsonclass__')->First == 'deserialize'));\n\t\tReturn(#output->find('__jsonclass__')->Second->First);\n\tElse((#output >> 'native') && (#output >> 'comment') && (#output->find('comment') == 'http://www.lassosoft.com/json'));\n\t\tReturn(#output->find('native'));\n\t/If;\n\tReturn(#output);\n}\n\n// Bil Corry fix + Ke fix\ndefine json_deserialize(ibytes::bytes)::any => {\n\t#ibytes->removeLeading(bom_utf8);\n\n//============================================================================\n//\tReset marker on provided bytes\n\t#ibytes->marker = 0\n//............................................................................\t\t\n\t\n\tLocal(temp) = #ibytes->export8bits;\n\tIf(#temp == 91); // [\n\t\tReturn(json_consume_array(#ibytes));\n\tElse(#temp == 123); // {\n\t\tReturn(json_consume_object(#ibytes));\n\telse(#temp == 34) // \"\n\t\treturn json_consume_string(#ibytes)\n\t/If;\n}\n\ndefine json_deserialize(s::string) => json_deserialize(bytes(#s))\n\n/**! json_literal - This is a subclass of String used for JSON encoding.\n\n\tA json_literal works exactly like a string, but will be inserted directly\n\trather than being encoded into JSON. This allows JavaScript elements\n\tlike functions to be inserted into JSON objects. This is most useful\n\twhen the JSON object will be used within a JavaScript on the local page.\n\t[Map: 'fn'=Literal('function(){ ...})] => {'fn': function(){ ...}}\n**/\ndefine json_literal => type {\n\tparent string\n}\n\n/**! json_object - This is a subclass of Map used for JSON encoding.\n\n\tAn object works exactly like a map, but when it is encoded into JSON all\n\tof the keys will be inserted literally. This makes it easy to create a\n\tJavaScript object without extraneous quote marks.\n\tObject('name'='value') => {name: \"value\"}\n**/\ndefine json_object => type {\n\tparent map\n\tpublic onCreate(...) => ..onCreate(:#rest or (:))\n}\n\ndefine json_rpccall(method::string, params=map, id='', host='') => {\n\t#id == '' ? #host = Lasso_UniqueID;\n\t#host == '' ? #host = 'http://localhost/lassoapps.8/rpc/rpc.lasso';\n\tReturn(Decode_JSON(Include_URL(#host, -PostParams=Encode_JSON(Map('method' = #method, 'params' = #params, 'id' = #id)))));\n}\n" ], "url": "https://github.com/bfad/Sublime-Lasso" }, "helloWorldCollection": [ "// Hello world in Lasso\n\nHello world!" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lasso", "indeedJobs": { "2022": 142, "query": "lasso engineer" }, "officialBlogUrl": [ "http://www.lassosoft.com/Lasso-News" ], "tiobe": { "id": "Lasso" }, "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|The Lasso Problem and Uniqueness|10.1214/13-EJS815|433|61|R. Tibshirani|e6676264d3af3604ee25f931aae78448b924fcf2\n2013|Efficient block-coordinate descent algorithms for the Group Lasso|10.1007/s12532-013-0051-x|177|15|Zhiwei Qin and K. Scheinberg and D. Goldfarb|07ec2f2a0bd383d4bc86c7292a98c1de6b8b75ee\n2013|A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation|10.1080/10618600.2012.681238|89|10|N. A. Johnson|0b49d72cc98f30f2cded046d98ebeae7789fc8ef\n2016|Algorithms for Fitting the Constrained Lasso|10.1080/10618600.2018.1473777|81|10|Brian R. Gaines and Juhyun Kim and Hua Zhou|8331af696e9f758928ed1b962d9efa160284b8ec" }, "latex": { "title": "LaTeX", "appeared": 1985, "type": "textMarkup", "website": "http://latex-project.org/", "documentation": [ "https://www.latex-project.org/help/documentation/", "https://devdocs.io/latex/" ], "country": [ "United States" ], "originCommunity": [ "https://www.latex-project.org/about/team/" ], "domainName": { "registered": 1998, "awisRank": { "2022": 72488 }, "name": "latex-project.org" }, "hasComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasLineComments": { "example": "% A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "lineCommentToken": [ [ "%" ] ], "wikipedia": { "example": [ "\\documentclass{article}\n\\usepackage{amsmath}\n\\title{\\LaTeX}\n\n\\begin{document}\n \\maketitle\n \\LaTeX{} is a document preparation system for\n the \\TeX{} typesetting program. It offers\n programmable desktop publishing features and\n extensive facilities for automating most\n aspects of typesetting and desktop publishing,\n including numbering and cross-referencing,\n tables and figures, page layout,\n bibliographies, and much more. \\LaTeX{} was\n originally written in 1984 by Leslie Lamport\n and has become the dominant method for using\n \\TeX; few people write in plain \\TeX{} anymore.\n The current version is \\LaTeXe.\n\n % This is a comment, not shown in final output.\n % The following shows typesetting power of LaTeX:\n \\begin{align}\n E_0 &= mc^2 \\\\\n E &= \\frac{mc^2}{\\sqrt{1-\\frac{v^2}{c^2}}}\n \\end{align} \n\\end{document}" ], "related": [ "tex", "pdf", "xml", "css", "html", "xetex", "solaris", "freebsd", "linux", "postscript", "lyx-editor", "perl", "unix", "bibtex" ], "summary": "LaTeX (IPA: , LAH-tekh, also pronounced as , LAY-tekh, a shortening of Lamport TeX) is a document preparation system. When writing, the writer uses plain text as opposed to the formatted text found in WYSIWYG word processors like Microsoft Word, LibreOffice Writer and Apple Pages. The writer uses markup tagging conventions to define the general structure of a document (such as article, book, and letter), to stylise text throughout a document (such as bold and italics), and to add citations and cross-references. A TeX distribution such as TeX Live or MikTeX is used to produce an output file (such as PDF or DVI) suitable for printing or digital distribution. Within the typesetting system, its name is stylised as LaTeX. LaTeX is widely used in academia for the communication and publication of scientific documents in many fields, including mathematics, statistics, computer science, engineering, chemistry, physics, economics, linguistics, quantitative psychology, philosophy, and political science. It also has a prominent role in the preparation and publication of books and articles that contain complex multilingual materials, such as Tamil, Sanskrit and Greek. LaTeX uses the TeX typesetting program for formatting its output, and is itself written in the TeX macro language. LaTeX can be used as a standalone document preparation system or as an intermediate format. In the latter role, for example, it is sometimes used as part of a pipeline for translating DocBook and other XML-based formats to PDF. The typesetting system offers programmable desktop publishing features and extensive facilities for automating most aspects of typesetting and desktop publishing, including numbering and cross-referencing of tables and figures, chapter and section headings, the inclusion of graphics, page layout, indexing and bibliographies. Like TeX, LaTeX started as a writing tool for mathematicians and computer scientists, but from early in its development it has also been taken up by scholars who needed to write documents that include complex math expressions or non-Latin scripts, such as Arabic, Sanskrit and Chinese. LaTeX is intended to provide a high-level language that accesses the power of TeX in an easier way for writers. In short, TeX handles the layout side, while LaTeX handles the content side for document processing. LaTeX comprises a collection of TeX macros and a program to process LaTeX documents. Because the plain TeX formatting commands are elementary, it provides authors with ready-made commands for formatting and layout requirements such as chapter headings, footnotes, cross-references and bibliographies. LaTeX was originally written in the early 1980s by Leslie Lamport at SRI International. The current version is LaTeX2e (stylised as LaTeX2ε). LaTeX is free software and is distributed under the LaTeX Project Public License (LPPL).", "pageId": 18195, "dailyPageViews": 1540, "created": 2001, "backlinksCount": 2605, "revisionCount": 1914, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/LaTeX" }, "languageServerProtocolProject": [ "https://github.com/efoerster/texlab" ], "helloWorldCollection": [ "% Hello World! in LaTeX\n\\documentclass{article}\n\\begin{document}\nHello World!\n\\end{document}\n" ], "leachim6": { "filepath": "l/LaTeX.tex", "fileExtensions": [ "tex" ], "example": [ "\\documentclass{article}\n\\begin{document}\nHello World\n\\end{document}\n" ], "id": "LaTeX" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LaTeX", "hopl": "https://hopl.info/showlanguage.prx?exp=2157", "fileType": "text", "wordRank": 5960, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2016|Springer|More Math Into LaTeX|Grätzer, George|9783319237954\n2015|Packt Publishing|LaTeX Cookbook|Kottwitz, Stefan|9781784395148\n2003|Addison-Wesley Professional|Guide to LaTeX (4th Edition)|Kopka, Helmut and Daly, Patrick W.|9780321173850\n2017|Springer|LaTeX in 24 Hours: A Practical Guide for Scientific Writing|Datta, Dilip|9783319478319\n28-10-2015|Packt Publishing|LaTeX Cookbook|Stefan Kottwitz|9781784396305\n20220131|Springer Nature|Advanced LaTeX in Academia|Marco Öchsner; Andreas Öchsner|9783030889562\n|Springer International Publishing :|More Math Into LaTeX|Grätzer, George (author.)|9783319237954\n|Springer International Publishing :|Latex In 24 Hours: A Practical Guide For Scientific Writing|Datta, Dilip (author.)|9783319478319", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|An integrated platform for intuitive mathematical programming modeling using LaTeX|10.7717/peerj-cs.161|3|1|Charalampos P. Triantafyllidis and L. Papageorgiou|dc4b0f26004a18d579807090c02cc50ee0838d04\n2019|Development and Regression Modeling of Dirt Resistive Latex Façade Paint|10.3390/COATINGS9030150|2|0|Sheraz Ahmed Qureshi and A. Shafeeq and A. Ijaz and Muhammad Moeen Butt|57504ba030e18612a102bd6cbe08ae85cf986bc4\n2019|Development of a generator of practical tasks in higher mathematics using the Microsoft Office suite and LaTeX digital typesetting system|10.2991/iscde-19.2019.123|1|0|S. Mukhanov and A. Arkhangelsky and A. Mukhanova|9e5acf9a3b7bb1f7d10c3336314189348af433d3\n2019|Development and Statistical Modeling of Dirt Resistive Latex Façade Paint|10.20944/PREPRINTS201901.0076.V1|1|0|Sheraz Ahmad Qureshi and A. Shafeeq and A. Ijaz and Muhammad Moeen Butt|a0d5427c55e5e2e4fb24cf17ef229dfb2e0b2a1b\n2020|Reproducible Science with LaTeX|10.6339/21-JDS998|1|0|H. Bar and HaiYing Wang|4408ed3c457007ecfb5917c5e5aa1bde6e73bf38" }, "latino": { "title": "latino", "appeared": 2015, "type": "pl", "creators": [ "Primitivo R. Montero" ], "website": "https://lenguaje-latino.org/", "country": [ "Mexico" ], "nativeLanguage": "Spanish", "originCommunity": [ "https://github.com/lenguaje-latino" ], "domainName": { "registered": 2022, "awisRank": { "2017": 5444100 }, "name": "lenguaje-latino.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "escribir" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 11, "forks": 1, "subscribers": 1, "created": 2020, "updated": 2021, "firstCommit": 2015, "description": "Lenguaje de programación de código abierto para latinos y de habla hispana.", "issues": 0, "url": "https://github.com/primitivorm/latino" }, "repoStats": { "firstCommit": 2015, "commits": 1161, "committers": 33, "files": 389 }, "leachim6": { "filepath": "l/Latino.lat", "fileExtensions": [ "lat" ], "example": [ "escribir(\"Hello World\")\n" ], "id": "Latino" }, "fileType": "text", "wordRank": 7415, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "latte-js": { "title": "latte-js", "appeared": 2012, "type": "pl", "creators": [ "Sean Micklethwaite" ], "website": "https://web.archive.org/web/20181103105843/http://lattejs.com/", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/tehsenaus/latte-js/issues" ], "example": [ "for (x in y if (x.is('awesome')))" ], "githubRepo": { "stars": 16, "forks": 0, "subscribers": 1, "created": 2012, "updated": 2015, "description": "JavaScript + Milk & Sugar", "url": "https://github.com/tehsenaus/latte-js/" }, "repoStats": { "firstCommit": 2012, "commits": 73, "committers": 5, "files": 57 } }, "latte": { "title": "Latte", "appeared": 2008, "type": "template", "creators": [ "David Grudl" ], "website": "https://latte.nette.org", "country": [ "Czech Republic" ], "originCommunity": [ "https://github.com/nette" ], "domainName": { "name": "latte.nette.org" }, "githubRepo": { "firstCommit": 2008, "stars": 825, "forks": 94, "subscribers": 64, "created": 2012, "updated": 2022, "description": "☕ Latte: the safest & truly intuitive templates for PHP. Engine for those who want the most secure PHP sites.", "issues": 14, "url": "https://github.com/nette/latte" }, "repoStats": { "firstCommit": 2008, "commits": 2180, "committers": 59, "files": 635 }, "githubLanguage": { "fileExtensions": [ "latte" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "smarty", "codemirrorMode": "smarty", "codemirrorMimeType": "text/x-smarty", "tmScope": "text.html.smarty", "repos": 270, "id": "Latte" }, "githubBigQuery": { "repos": 26, "users": 24, "id": "Latte" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 8, "commitCount": 34, "sampleCount": 2, "example": [ "{**\n * @param string $basePath web base path\n * @param string $robots tell robots how to index the content of a page (optional)\n * @param array $flashes flash messages\n *}\n\n\n\n\t\n\t\n\t\n\t\n\t\n\t\n\n\t{ifset $title}{$title} › {/ifset}Translation report\n\n\t\n\t\n\t\n \n \n\t{block #head}{/block}\n\n\n\n\t\n\n\t{block #navbar}\n\t\t{include _navbar.latte}\n\t{/block}\n\n\t
\n\t\t
\n\t\t\t
\n\t\t\t\t{include _flash.latte, flash => $flash}\n\t\t\t
\n\t\t
\n\n\t\t{include #content}\n\t
\n\n\t
\n\t
\n\n\t\n\t{block #scripts}{/block}\n\n" ], "url": "https://github.com/textmate/php-smarty.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1997|Coriolis Group,u.s.|Latte Programming Explorer: The Best Way To Master Java Programming With Latte|Jeff Duntemann and Don Taylor|9781576100059\n1997|Coriolis Group,u.s.|Latte Programming Frontrunner: Hands-on Guide To Mastering Java Development With Latte|Jeff Duntemann|9781576100042\n1997||Kickass Latte Programming: Cutting-edge Java Techniques With An Attituded|Tonny Espeset|9781576100677" }, "laure": { "title": "LAURE", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ff67c4cc2bf1f1365c8eadb716cb4c988ff0c8b7" ], "country": [ "France" ], "originCommunity": [ "Bouygues S.A" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1637", "centralPackageRepositoryCount": 0 }, "lav-format": { "title": "lav-format", "appeared": 2004, "type": "textDataFormat", "description": "LAV is a plain-text file format for alignments of two DNA sequences. It is the only output format produced by the BLASTZ alignment program (though often converted to AXT format by post-processing programs), and is the default output format for BLASTZ's successor, LASTZ.", "website": "http://www.bx.psu.edu/miller_lab/dist/lav_format.html", "country": [ "United States" ], "originCommunity": [ "The Pennsylvania State University" ], "example": [ "#:lav\n d {\n \"lastz.v0.3 malus.fa aurantium.fa C=2 W=8 T=0 \n A C G T\n 91 -114 -31 -123\n -114 100 -125 -31\n -31 -125 100 -114\n -123 -31 -114 91\n O = 400, E = 30, K = 3000, L = 3000, M = 0\"\n }\n #:lav\n s {\n \"malus.fa\" 1 191411218 0 1\n \"aurantium.fa\" 1 90634903 0 1\n }\n h {\n \"> apple\"\n \"> orange\"\n }\n a {\n s 20643\n b 46566766 2083211\n e 46567353 2083795\n l 46566766 2083211 46566796 2083241 61\n l 46566797 2083245 46566814 2083262 78\n l 46566821 2083263 46567353 2083795 65\n }\n a {\n s 4233\n b 47246530 10635696\n e 47246660 10635826\n l 47246530 10635696 47246660 10635826 63\n }" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "lava": { "title": "Lava", "appeared": 2001, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "Institute for Secure Telecooperation" ], "visualParadigm": true, "wikipedia": { "related": [ "linux" ], "summary": "Lava is an experimental, visual object-oriented, interpreter-based programming language with an associated programming environment (Lava Programming Environment or LavaPE) that uses structure editors instead of text editors. Only comments, constants, and new identifiers may be entered as text. Declarations are represented in LavaPE as tree structures whose subtrees may be collapsed or expanded. The properties of the declared Lava entities can be edited through pop-up dialogs. Although executable code has a traditional text representation in LavaPE, it can be edited only as complete syntactic units, rather than character by character. If you insert a new syntactic construct, it will typically contain \"placeholders\" (syntactic variables) that can then be replaced by concrete constructs; the latter may in turn contain syntactic variables, etc. LavaPE provides a tool button for every type of syntactic construct, and a button is enabled only if it is syntactically correct to insert the associated construct at the selected place. Further characteristic properties of Lava and LavaPE include the following: It provides strict syntactic separation of interface (public) and implementation (private) sections of a Lava class. It distinguishes variable \"state objects\" from constant \"value objects\"; the latter cannot be modified any longer after creation/initialization. It supports \"virtual types\": type parameters of classes and packages (families of related classes). As a consequence, undermining of strong type checks by \"type casts\" is no longer required. It uses recursion and logical quantifiers instead of traditional loop constructs. It uses single assignment; i.e., a value can be assigned to a variable only once within the same branch of a function. It supports refactoring extensively via the LavaPE structure editors. It distinguishes between constituents (sub-objects) and object acquaintances (pointers to independent objects). Copying and deletion of complex objects is largely facilitated in this way. Since release 0.9.0, LavaPE completely prevents inadvertent access to uninitialized variables and null objects already at programming time by complete static initialization checks.Lava is open source software using the GPL license (see also Lava at the Free Software Foundation and at KDE-Apps.org). It currently runs on Microsoft Windows, Linux and Mac OS X platforms.", "pageId": 1982671, "created": 2005, "backlinksCount": 24, "revisionCount": 87, "dailyPageViews": 21, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Lava_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "lawvere": { "title": "Lawvere", "appeared": 2021, "type": "pl", "creators": [ "James Henri Haydon" ], "description": "Lawvere - a categorical programming language with effects", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/lls7q9/lawvere_a_categorical_programming_language_with/" ], "country": [ "Japan" ], "originCommunity": [ "https://github.com/jameshaydon/lawvere/issues" ], "githubRepo": { "firstCommit": 2020, "stars": 208, "forks": 5, "subscribers": 11, "created": 2020, "updated": 2022, "description": "A categorical programming language with effects", "issues": 9, "url": "https://github.com/jameshaydon/lawvere" }, "repoStats": { "firstCommit": 2020, "commits": 99, "committers": 5, "files": 75 } }, "lazarus-editor": { "title": "lazarus-editor", "appeared": 2012, "type": "editor", "website": "https://www.lazarus-ide.org/", "country": [ "United States" ], "originCommunity": [ "https://wiki.lazarus.freepascal.org/History" ], "gitRepo": "https://sourceforge.net/projects/lazarus/" }, "lazy-k": { "title": "Lazy K", "appeared": 2002, "type": "esolang", "description": "Lazy K is a garbage-collected, referentially transparent functional programming language, with a simple stream-based I/O system. What distinguishes Lazy K from other such languages is its almost total lack of other features.", "website": "https://tromp.github.io/cl/lazy-k.html", "reference": [ "http://lambda-the-ultimate.org/node/406" ], "aka": [ "lazyk" ], "country": [ "The Netherlands" ], "originCommunity": [ "https://tromp.github.io/" ], "quineRelay": "Lazy K", "rijuRepl": { "example": [ "K(S(S(S(S(S(S(SI`S`K(S(S`KS(S`KK(S`KS(S(S`KS(S`K`S(SI`KK)(S`KKK)))`K`K(SI`K0))))\n)`K(S`K`S(S`KS(S`K`SI(S`KK(S`K(S(S(SSS)(SS(SSI(SS0))))S(S`KSK))(SI`K(S`KSK))))))\n(S`KKK)))(SII)`K(SII(SII(S(S`KSK)I))))(S`K`S(S(S(SSS)(SS0))S)(SSSS))(SS(SS0))(S(\nSI(SS0))(SS(SS(SS(SS`S(SSS)(SS0))))))(SS(SS(SS(SSSSSS(SS0))))))`S(S(S(SS(SS0))(S\nS0))S))`K(SS0))`K(SS(SS(S(SSS)(SS(SS0))))))I(SSSSSS(SS0)))I(S(SI(SS0))(SS(SS(SS(\nSS`S(SSS)(SS0))))))(SS(S(S(S(SSS)(SS0))S)(SSSS(SS(SS0)))))(S(SSS)(S(SSS)(SS0)))`\nK0)\n" ], "id": "https://riju.codes/lazyk" }, "esolang": "https://esolangs.org/wiki/Lazy_K", "fileType": "text", "centralPackageRepositoryCount": 0 }, "lazyml": { "title": "Lazy ML", "appeared": 1980, "type": "pl", "country": [ "Sweden" ], "originCommunity": [ "Chalmers University of Technology" ], "wikipedia": { "example": [ "let rec fact 0 = 1 ||\n fact n = n*fact(n-1)" ], "related": [ "haskell", "ml" ], "summary": "Lazy ML (LML) is a functional programming language developed in the early 1980s by Lennart Augustsson and Thomas Johnsson at Chalmers University of Technology, prior to Miranda and Haskell. LML is a strongly typed, statically scoped implementation of ML, with lazy evaluation. The key innovation of LML was to demonstrate how to compile a lazy functional language. Until then, lazy languages had been implemented via interpreted graph reduction. LML compiled to G-machine code. LML is also notable as the language in which HBC, the Haskell B Compiler, was implemented.", "pageId": 15127519, "dailyPageViews": 8, "created": 2008, "backlinksCount": 37, "revisionCount": 19, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Lazy_ML" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "lc-3": { "title": "LC-3", "appeared": 2003, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Texas at Austin", "University of Illinois at Urbana–Champaign" ], "wikipedia": { "related": [ "assembly-language", "c", "x86-isa", "ascii" ], "summary": "Little Computer 3, or LC-3, is a type of computer educational programming language, an assembly language, which is a type of low-level programming language. It features a relatively simple instruction set, but can be used to write moderately complex assembly programs, and is a theoretically viable target for a C compiler. The language is less complex than x86 assembly but has many features similar to those in more complex languages. These features make it useful for beginning instruction, so it is most often used to teach fundamentals of programming and computer architecture to computer science and computer engineering students. The LC-3 was developed by Yale N. Patt at the University of Texas at Austin and Sanjay J. Patel at the University of Illinois at Urbana–Champaign. Their specification of the instruction set, the overall architecture of the LC-3, and a hardware implementation can be found in the second edition of their textbook. Courses based on the LC-3 and Patt and Patel's book are offered in many computer engineering and computer science departments.", "pageId": 9193341, "created": 2007, "backlinksCount": 16, "revisionCount": 124, "dailyPageViews": 84, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/LC-3" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "lcf": { "title": "LCF", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0368a48397529023005dbdf922cfba974c87d0c1" ], "country": [ "United States and Scotland" ], "originCommunity": [ "Stanford University", "University of Edinburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1178", "centralPackageRepositoryCount": 0 }, "lcl": { "title": "LCL", "appeared": 1991, "type": "pl", "reference": [ "https://link.springer.com/chapter/10.1007/978-1-4612-2704-5_5" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology", "Digital Equipment Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1638", "centralPackageRepositoryCount": 0 }, "ld-json": { "title": "JSON Lines", "appeared": 2013, "type": "dataNotation", "creators": [ "Ian Ward" ], "description": "JSON Lines is a convenient format for storing structured data that may be processed one record at a time. It works well with unix-style text processing tools and shell pipelines. It's a great format for log files. It's also a flexible format for passing messages between cooperating processes.", "website": "http://jsonlines.org/", "reference": [ "https://en.wikipedia.org/wiki/JSON_streaming" ], "aka": [ "newline-delimited JSON" ], "fileExtensions": [ "ldj", "jsonl" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/wardi/jsonlines/issues" ], "domainName": { "registered": 2013, "awisRank": { "2022": 519198 }, "name": "jsonlines.org" }, "related": [ "json" ], "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "example": [ "[\"Name\", \"Session\", \"Score\", \"Completed\"]\n[\"Gilbert\", \"2013\", 24, true]\n[\"Alexa\", \"2013\", 29, true]\n[\"May\", \"2012B\", 14, false]\n[\"Deloise\", \"2012A\", 19, true] " ], "githubRepo": { "firstCommit": 2013, "stars": 72, "forks": 24, "subscribers": 3, "created": 2013, "updated": 2022, "description": "Documentation for the JSON Lines text file format", "issues": 24, "url": "https://github.com/wardi/jsonlines" }, "repoStats": { "firstCommit": 2013, "commits": 103, "committers": 25, "files": 16 }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ldap": { "title": "Lightweight Directory Access Protocol", "appeared": 1997, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "University of Michigan", "Isode Limited", "Performance Systems International" ], "wikipedia": { "summary": "The Lightweight Directory Access Protocol (LDAP ) is an open, vendor-neutral, industry standard application protocol for accessing and maintaining distributed directory information services over an Internet Protocol (IP) network. Directory services play an important role in developing intranet and Internet applications by allowing the sharing of information about users, systems, networks, services, and applications throughout the network. As examples, directory services may provide any organized set of records, often with a hierarchical structure, such as a corporate email directory. Similarly, a telephone directory is a list of subscribers with an address and a phone number. LDAP is specified in a series of Internet Engineering Task Force (IETF) Standard Track publications called Request for Comments (RFCs), using the description language ASN.1. The latest specification is Version 3, published as RFC 4511 (a road map to the technical specifications is provided by RFC4510). A common use of LDAP is to provide a central place to store usernames and passwords. This allows many different applications and services to connect to the LDAP server to validate users.LDAP is based on a simpler subset of the standards contained within the X.500 standard. Because of this relationship, LDAP is sometimes called X.500-lite.", "backlinksCount": 647, "pageId": 18508, "dailyPageViews": 1402, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Lightweight_Directory_Access_Protocol" }, "isbndb": "", "semanticScholar": "" }, "ldl": { "title": "LDL", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/58783586641ab9296a391b580d6fae3bad00ad56" ], "country": [ "Israel" ], "originCommunity": [ "Technion" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1233", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ldl1": { "title": "LDL1", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e90830263f9c2f9cb62d466cb547d021d12cfe85" ], "country": [ "United States" ], "originCommunity": [ "MOC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1332", "centralPackageRepositoryCount": 0 }, "ldpl": { "title": "ldpl", "appeared": 2019, "type": "pl", "creators": [ "Martín del Río" ], "website": "https://www.ldpl-lang.org", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/Lartu/ldpl/issues" ], "domainName": { "name": "ldpl-lang.org" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# Hello There Example\ndata: \n name is number\n\nprocedure: \n display \"Hello there, what's your name?\"\n accept name\n display \"你好, \" name \"!\" crlf" ], "githubRepo": { "firstCommit": 2019, "stars": 128, "forks": 23, "subscribers": 12, "created": 2019, "updated": 2022, "description": "Compiled programming language for Unix systems, inspired by COBOL and designed to be expressive, fast, readable and easy to learn.", "issues": 11, "url": "https://github.com/Lartu/ldpl" }, "repoStats": { "firstCommit": 2019, "commits": 928, "committers": 37, "files": 73 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n19740700|LDPL – A simple programming language in the likeness of COBOL|https://www.ldpl-lang.org/|2019-04-24 17:25:24 UTC|1556126724|lartu|0|1" }, "le-lisp": { "title": "Le-Lisp", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/64fc9c227da975bc762a88a13668e924c26b1e05" ], "country": [ "France" ], "originCommunity": [ "Institut national de recherche en sciences et technologies du numérique", "Centre de Mathmatiques Appliques" ], "wikipedia": { "related": [ "lisp", "c", "x86-isa", "sparc", "powerpc", "mips", "unix", "linux", "freebsd", "solaris", "islisp", "openlisp", "interlisp", "lisp-machine-lisp", "scheme", "common-lisp", "t", "emacs-lisp", "autolisp", "picolisp", "eulisp", "newlisp", "racket", "guile", "clojure", "arc", "lfe" ], "summary": "Le Lisp (also Le_Lisp and Le-Lisp) is a programming language, a dialect of the language Lisp.It was developed at the French Institute for Research in Computer Science and Automation (INRIA), to be an implementation language for a very large scale integration (VLSI) workstation being designed under the direction of Jean Vuillemin. Le Lisp also had to run on various incompatible platforms (mostly running Unix operating systems) that were used by the project. The main goals for the language were to be a powerful post-Maclisp version of Lisp that would be portable, compatible, extensible, and efficient.Jérôme Chailloux led the Le Lisp team, working with Emmanuel St. James, Matthieu Devin, and Jean-Marie Hullot in 1980. The dialect is historically noteworthy as one of the first Lisp implementations to be available on both the Apple II and the IBM PC.", "backlinksCount": 44, "pageId": 1064127, "dailyPageViews": 10, "created": 2004, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/Le_Lisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1090", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "leaf": { "title": "leaf", "appeared": 2013, "type": "pl", "website": "https://web.archive.org/web/20190325180818/http://leaflang.org/", "country": [ "Unknown" ], "originCommunity": [ "https://groups.google.com/g/leaflang" ], "domainName": { "registered": 2020, "awisRank": { "2017": 17755617 }, "name": "leaflang.org" }, "gitRepo": "https://launchpad.net/leaflang", "subreddit": [ { "memberCount": { "2017": 8, "2022": 8 }, "url": "https://reddit.com/r/leaflang" } ], "twitter": "https://twitter.com/edaqa", "fileType": "text", "wordRank": 5029, "centralPackageRepositoryCount": 0 }, "lean": { "title": "Lean", "appeared": 2015, "type": "pl", "creators": [ "Leonardo de Moura" ], "website": "http://leanprover.github.io/", "documentation": [ "https://leanprover.github.io/documentation/" ], "country": [ "United States" ], "originCommunity": [ "Microsoft Research" ], "domainName": { "awisRank": { "2022": 540082 }, "name": "leanprover.github.io" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "#print" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2013, "stars": 2045, "forks": 217, "subscribers": 115, "created": 2013, "updated": 2022, "description": "Lean Theorem Prover", "issues": 58, "url": "https://github.com/leanprover/lean" }, "repoStats": { "firstCommit": 2013, "commits": 13761, "committers": 50, "files": 2908 }, "githubLanguage": { "fileExtensions": [ "lean", "hlean" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.lean", "repos": 1807, "id": "Lean" }, "githubBigQuery": { "repos": 265, "users": 233, "id": "Lean" }, "pygmentsHighlighter": { "filename": "theorem.py", "fileExtensions": [ "lean" ], "id": "Lean" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2016, "committerCount": 3, "commitCount": 17, "sampleCount": 2, "example": [ "/-\nCopyright (c) 2014 Microsoft Corporation. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\n\nModule: algebra.binary\nAuthors: Leonardo de Moura, Jeremy Avigad\n\nGeneral properties of binary operations.\n-/\n\nimport logic.eq\nopen eq.ops\n\nnamespace binary\n section\n variable {A : Type}\n variables (op₁ : A → A → A) (inv : A → A) (one : A)\n\n local notation a * b := op₁ a b\n local notation a ⁻¹ := inv a\n local notation 1 := one\n\n definition commutative := ∀a b, a * b = b * a\n definition associative := ∀a b c, (a * b) * c = a * (b * c)\n definition left_identity := ∀a, 1 * a = a\n definition right_identity := ∀a, a * 1 = a\n definition left_inverse := ∀a, a⁻¹ * a = 1\n definition right_inverse := ∀a, a * a⁻¹ = 1\n definition left_cancelative := ∀a b c, a * b = a * c → b = c\n definition right_cancelative := ∀a b c, a * b = c * b → a = c\n\n definition inv_op_cancel_left := ∀a b, a⁻¹ * (a * b) = b\n definition op_inv_cancel_left := ∀a b, a * (a⁻¹ * b) = b\n definition inv_op_cancel_right := ∀a b, a * b⁻¹ * b = a\n definition op_inv_cancel_right := ∀a b, a * b * b⁻¹ = a\n\n variable (op₂ : A → A → A)\n\n local notation a + b := op₂ a b\n\n definition left_distributive := ∀a b c, a * (b + c) = a * b + a * c\n definition right_distributive := ∀a b c, (a + b) * c = a * c + b * c\n end\n\n context\n variable {A : Type}\n variable {f : A → A → A}\n variable H_comm : commutative f\n variable H_assoc : associative f\n infixl `*` := f\n theorem left_comm : ∀a b c, a*(b*c) = b*(a*c) :=\n take a b c, calc\n a*(b*c) = (a*b)*c : H_assoc\n ... = (b*a)*c : H_comm\n ... = b*(a*c) : H_assoc\n\n theorem right_comm : ∀a b c, (a*b)*c = (a*c)*b :=\n take a b c, calc\n (a*b)*c = a*(b*c) : H_assoc\n ... = a*(c*b) : H_comm\n ... = (a*c)*b : H_assoc\n end\n\n context\n variable {A : Type}\n variable {f : A → A → A}\n variable H_assoc : associative f\n infixl `*` := f\n theorem assoc4helper (a b c d) : (a*b)*(c*d) = a*((b*c)*d) :=\n calc\n (a*b)*(c*d) = a*(b*(c*d)) : H_assoc\n ... = a*((b*c)*d) : H_assoc\n end\n\nend binary\n" ], "url": "https://github.com/leanprover/Lean.tmbundle" }, "leachim6": { "filepath": "l/Lean", "example": [ "#print \"Hello World\"" ], "id": "Lean" }, "tryItOnline": "lean", "fileType": "text", "wordRank": 8525, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|Pragmatic Bookshelf|Functional Programming Patterns in Scala and Clojure: Write Lean Programs for the JVM|Bevilacqua-Linn, Michael|9781937785475\n2009|CRC Press|Measuring and Improving Performance: Information Technology Applications in Lean Systems|Martin, James William|9781420084184\n2016|Apress|Lean Python: Learn Just Enough Python to Build Useful Tools|Gerrard, Paul|9781484223857\n2021|Apress|Lean Software Systems Engineering for Developers: Managing Requirements, Complexity, Teams, and Change Like a Champ|Durham, Doug and Michel, Chad|9781484269336", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|Exploring the role of human factors in lean management|10.1108/IJLSS-08-2017-0094|32|2|P. Gaiardelli and Barbara Resta and Stefano Dotti|12228cf77a74d25d79a94aa7959cd5649eb63ddf\n2019|Development of a Lean Computational Thinking Abilities Assessment for Middle Grades Students|10.1145/3287324.3287390|31|4|E. Wiebe and Jennifer E. London and Osman Aksit and Bradford W. Mott and K. Boyer and James C. Lester|62b302055f9ca5ecf4469c56c607f12eee205d1a\n2019|Lean management approach in hospitals: a systematic review|10.1108/IJLSS-05-2017-0051|22|3|Haleh Mousavi Isfahani and S. Tourani and H. Seyedin|65f5eacd03a677f40f3c0e6c695962e4b273458b\n2019|Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms|10.1137/1.9781611976021.3|20|0|Zaoxing Liu and Samson Zhou and Ori Rottenstreich and V. Braverman and J. Rexford|d9ed95f065d770e595f302be8334b64a1b0f961f\n2021|The Lean 4 Theorem Prover and Programming Language|10.1007/978-3-030-79876-5_37|18|1|L. D. Moura and Sebastian Ullrich|c4c0d6ffd70081d143b32be53b06fec1259b3ad8\n2001|lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic|10.1007/3-540-45744-5_55|8|0|J. S. Hodas and Naoyuki Tamura|c12f7f4af28822d01b449213cad8ac85ba5c4ba6\n2010|A lean specification for GADTs: system F with first-class equality proofs|10.1007/s10990-011-9065-0|4|1|Arie Middelkoop and A. Dijkstra and S. Swierstra|395df42520b2a07f04605515890a7eb0870fdd60\n2018|Using Agile Games to Invigorate Agile and Lean Software Development Learning in Classrooms|10.1007/978-981-13-2751-3_18|3|0|Rashina Hoda|b4e7e39b7a590d940e902e4c8c8a960df83a4f10\n2019|Built-In Lean Management Tools in Simulation Modeling|10.1109/WSC40007.2019.9004812|3|0|P. Pawlewski|03859bf77f8c4d21dfbb36cba377b3467f3a3100\n2018|NLP Lean Programming Framework: Developing NLP Applications More Effectively|10.18653/v1/N18-5001|1|0|Marc Schreiber and B. Kraft and Albert Zündorf|04c6990ea6520f1af4ddcacabc1042bd03681da5" }, "leap": { "title": "LEAP", "appeared": 1969, "type": "pl", "description": "An ALGOL-based associative language. A high level programming language for large, complex associative structures has been designed and implemented. The underlying data structure has been implemented using a hash-coding technique. The discussion includes a comparison with other work and examples of applications of the language.", "reference": [ "http://www.dtic.mil/dtic/tr/fulltext/u2/675037.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley", "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "algol-60" ], "summary": "LEAP is an extension to the ALGOL 60 programming language which provides an associative memory of triples. The three items in a triple denote the association that an Attribute of an Object has a specific Value. LEAP was created by Jerome Feldman (University of California Berkeley) and Paul Rovner (MIT Lincoln Lab) in 1967. LEAP was also implemented in SAIL.", "pageId": 911672, "created": 2004, "backlinksCount": 6, "revisionCount": 17, "dailyPageViews": 2, "appeared": 1967, "url": "https://en.wikipedia.org/wiki/LEAP_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=427", "fileType": "text", "centralPackageRepositoryCount": 0 }, "leazy": { "title": "Leazy", "appeared": 1990, "type": "compiler", "creators": [ "Jochen L. Leidner" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/jochenleidner/leazy/issues" ], "githubRepo": { "stars": 0, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "issues": 0, "url": "https://github.com/jochenleidner/leazy" } }, "leda": { "title": "Leda", "appeared": 1995, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Oregon State University" ], "visualParadigm": false, "githubRepo": { "stars": 6, "forks": 2, "subscribers": 5, "created": 2015, "updated": 2022, "description": "Leda: Multiparadigm Programming Language", "issues": 2, "url": "https://github.com/Henry/Leda/issues" }, "wikipedia": { "summary": "Leda is a multiparadigm programming language whose goal is to successfully mix imperative, object-oriented, functional, and logic-based programming features into one language. It is described in the book Multiparadigm Programming in Leda written by the principal designer Dr. Timothy Budd at Oregon State University.", "pageId": 2265357, "created": 2005, "backlinksCount": 11, "revisionCount": 28, "dailyPageViews": 7, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Leda_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1563", "fileType": "text", "centralPackageRepositoryCount": 0 }, "legol": { "title": "LEGOL", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/54cdc573b01f73c858f12ddcb5883d4d3375c488" ], "country": [ "England" ], "originCommunity": [ "London School of Economics and Political Science" ], "hopl": "https://hopl.info/showlanguage.prx?exp=645", "centralPackageRepositoryCount": 0 }, "lem-editor": { "title": "lem-editor", "appeared": 2015, "type": "editor", "country": [ "Japan" ], "originCommunity": [ "https://github.com/lem-project" ], "githubRepo": { "firstCommit": 2015, "stars": 1203, "forks": 85, "subscribers": 51, "created": 2015, "updated": 2022, "description": "Common Lisp editor/IDE with high expansibility", "issues": 62, "url": "https://github.com/cxxxr/lem" } }, "lemick": { "title": "Lemick", "appeared": 2004, "type": "pl", "creators": [ "Alexei Iliasov" ], "reference": [ "http://lemick.sourceforge.net/sintro.html" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://sourceforge.net/p/lemick/mailman/lemick-design/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8591", "centralPackageRepositoryCount": 0 }, "lemon": { "title": "lemon", "appeared": 2017, "type": "pl", "creators": [ "Zhicheng Wei" ], "website": "http://www.lemon-lang.org/", "country": [ "Singapore" ], "originCommunity": [ "https://github.com/lemon-lang" ], "domainName": { "registered": 2016, "name": "lemon-lang.org" }, "githubRepo": { "firstCommit": 2017, "stars": 489, "forks": 39, "subscribers": 23, "created": 2017, "updated": 2022, "description": "Lemon is open source, embeddable, lightweight programming language http://www.lemon-lang.org", "issues": 0, "url": "https://github.com/lemon-lang/lemon" }, "repoStats": { "firstCommit": 2017, "commits": 35, "committers": 2, "files": 107 } }, "leo-editor": { "title": "leo-editor", "appeared": 2013, "type": "editor", "creators": [ "vivainio2" ], "website": "https://leoeditor.com", "country": [ "United States and Canada" ], "originCommunity": [ "https://github.com/leo-editor" ], "domainName": { "registered": 2013, "awisRank": { "2022": 2845365 }, "name": "leoeditor.com" }, "githubRepo": { "firstCommit": 2008, "stars": 1363, "forks": 162, "subscribers": 49, "created": 2014, "updated": 2022, "description": "Leo is an Outliner, Editor, IDE and PIM written in 100% Python.", "issues": 7, "url": "https://github.com/leo-editor/leo-editor" } }, "leogo": { "title": "Leogo", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b74ed46ea1c409b76ff8dc48b7ed1f32c5db4da8" ], "country": [ "New Zealand" ], "originCommunity": [ "University of Canterbury", "Christchurch School of Medicine" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5767", "centralPackageRepositoryCount": 0 }, "leopard": { "title": "Leopard", "appeared": 2007, "type": "pl", "reference": [ "https://github.com/MajickTek/Leopard" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/MajickTek" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8593", "centralPackageRepositoryCount": 0 }, "les": { "title": "LES", "appeared": 2012, "type": "grammarLanguage", "creators": [ "David Piepgrass" ], "description": "LES is an interchange format for syntax trees, comparable to s-expressions but designed for languages in the Algol family such as C, C++, C#, Java, EcmaScript, Rust and Python. It can be described as “JSON for code”: just as XML/YAML/JSON are tree structures that assign no particular meaning to the data inside, likewise LES represents syntax trees without assigning any particular meaning to them.", "website": "http://loyc.net/les/", "reference": [ "http://loyc.net/origin.html" ], "standsFor": "Loyc Expression Syntax", "country": [ "Canada" ], "originCommunity": [ "https://github.com/qwertie/loyc.net/issues" ], "example": [ "@[#static]\nfn factorial(x::int)::int {\n var result = 1;\n for (; x > 1; x--) {\n result *= x;\n };\n return result;\n};" ] }, "lesk": { "title": "LESK", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ef2ae5b9ce93337cf4d0c413735b479deb9786de" ], "country": [ "Canada" ], "originCommunity": [ "University of Ottawa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3379", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Combination of information retrieval methods with LESK algorithm for Arabic word sense disambiguation|10.1007/s10462-011-9249-3|47|1|A. Zouaghi and L. Merhbene and M. Zrigui|c8a3201a5b8f0b88da93902adcca0985cfac015f" }, "lesma": { "title": "Lesma", "appeared": 2022, "type": "pl", "creators": [ "Alin Ali Hassan" ], "website": "https://lesma-lang.com/", "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/alinalihassan/Lesma/issues" ], "githubRepo": { "firstCommit": 2022, "stars": 9, "forks": 1, "subscribers": 1, "created": 2022, "updated": 2022, "description": "The Lesma Programming Language", "issues": 7, "url": "https://github.com/alinalihassan/Lesma" }, "repoStats": { "firstCommit": 2022, "commits": 770, "committers": 5, "files": 116 } }, "less": { "title": "Less", "appeared": 2009, "type": "stylesheetLanguage", "creators": [ "Alexis Sellier" ], "website": "http://lesscss.org", "webRepl": [ "https://playcode.io/less/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/less" ], "domainName": { "registered": 2009, "awisRank": { "2017": 102718, "2022": 210051 }, "name": "lesscss.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "#header {\n color: #333333;\n border-left: 1px;\n border-right: 3px;\n}\n#footer {\n color: #114411;\n border-color: #7d2717;\n}" ], "related": [ "javascript", "sass", "css", "ruby", "stylus" ], "summary": "Less (sometimes stylized as LESS) is a dynamic style sheet language that can be compiled into Cascading Style Sheets (CSS) and run on the client side or server side. Designed by Alexis Sellier, Less is influenced by Sass and has influenced the newer \"SCSS\" syntax of Sass, which adapted its CSS-like block formatting syntax. Less is open source. Its first version was written in Ruby; however, in the later versions, use of Ruby has been deprecated and replaced by JavaScript. The indented syntax of Less is a nested metalanguage, as valid CSS is valid Less code with the same semantics. Less provides the following mechanisms: variables, nesting, mixins, operators and functions; the main difference between Less and other CSS precompilers being that Less allows real-time compilation via less.js by the browser.", "pageId": 31294765, "dailyPageViews": 186, "created": 2011, "backlinksCount": 48, "revisionCount": 256, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Less_(stylesheet_language)" }, "githubLanguage": { "fileExtensions": [ "less" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "less", "codemirrorMode": "css", "codemirrorMimeType": "text/css", "tmScope": "source.css.less", "aliases": [ "less-css" ], "repos": 12105, "id": "Less" }, "githubBigQuery": { "repos": 2585, "users": 2276, "id": "Less" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/less", "monaco": "less", "pygmentsHighlighter": { "filename": "css.py", "fileExtensions": [ "less" ], "id": "LessCss" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 35, "commitCount": 309, "sampleCount": 1, "example": [ "@blue: #3bbfce;\n@margin: 16px;\n\n.content-navigation {\n border-color: @blue;\n color:\n darken(@blue, 9%);\n}\n\n.border {\n padding: @margin / 2;\n margin: @margin / 2;\n border-color: @blue;\n}\n" ], "url": "https://github.com/atom/language-less.git" }, "leachim6": { "filepath": "l/Less.less", "fileExtensions": [ "less" ], "example": [ "body::before {\n content: \"Hello World\"\n}\n" ], "id": "Less" }, "rijuRepl": { "example": [ "body:before {\n content: \"Hello, world!\";\n}\n" ], "id": "https://riju.codes/less" }, "fileType": "text", "wordRank": 535, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2019|Independently published|Manipulation Secrets: How To Manipulate Anyone In Less Than Five Minutes Using Speed Reading, Ethical Manipulation And Simple Mind Control Techniques ... Case Studies And DIY-Tests (DARK PSYCHOLOGY)|Lightman, Patrick|9781086014358\n2017|Packt Publishing|Game Development Patterns and Best Practices: Better games, less hassle|Doran, John P. and Casanova, Matt|9781787127838\n2002|Workman Publishing Company|How to Connect in Business in 90 Seconds or Less|Boothman, Nicholas|9780761125952\n2015|Pragmatic Bookshelf|Metaprogramming Elixir: Write Less Code, Get More Done (and Have Fun!)|McCord, Chris|9781680500417\n2010|Packt Publishing|OGRE 3D 1.7 Beginner's Guide (Learn by Doing: Less Theory, More Results)|Felix Kerger|9781849512480\n2018|Cambridge University Press|The Science of Strategic Conservation: Protecting More with Less|Messer, Kent D. and Allen III, William L.|9781316642184\n2004|Listen & Live Audio, Inc.|How to Make People Like You in 90 Seconds or Less|Boothman, Nicholas|9781593160425", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|tinySLAM: A SLAM algorithm in less than 200 lines C-language program|10.1109/ICARCV.2010.5707402|79|7|B. Steux and O. Hamzaoui|bfde965e330d488af0cfe87b13069c71970b2d2a\n2011|How to make ad hoc proof automation less ad hoc|10.1145/2034773.2034798|64|3|Georges Gonthier and Beta Ziliani and Aleksandar Nanevski and Derek Dreyer|b50d6b7724bdf8064ffee9f8456a4def48f07ef5\n2003|Pair Programming: More Learning And Less Anxiety In A First Programming Course|10.18260/1-2--11728|20|0|Jennifer Brougham and S. Freeman and Beverly K. Jaeger|abdbb5509d31d07c7e4d10c47812e38568cd4d59" }, "lever": { "title": "lever", "appeared": 2015, "type": "pl", "description": "A dynamically typed language built to absorb features from other languages.", "website": "http://leverlanguage.com/", "country": [ "Finland" ], "originCommunity": [ "https://github.com/cheery/lever/issues" ], "domainName": { "registered": 2015, "awisRank": { "2022": 9766630 }, "name": "leverlanguage.com" }, "githubRepo": { "stars": 121, "forks": 11, "subscribers": 13, "created": 2015, "updated": 2022, "firstCommit": 2014, "description": "A programming language in the Perl/Python/Ruby group", "issues": 1, "url": "https://github.com/cheery/lever" }, "repoStats": { "firstCommit": 2014, "commits": 694, "committers": 6, "files": 669 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "levy": { "title": "levy", "appeared": 2013, "type": "plzoo", "description": "call-by-push value, statically typed", "website": "http://plzoo.andrej.com/language/levy.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "https://github.com/andrejbauer/plzoo/issues" ], "wordRank": 9288, "centralPackageRepositoryCount": 0 }, "lex": { "title": "Lex", "appeared": 1975, "type": "grammarLanguage", "reference": [ "https://github.com/babyraging/yash" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/babyraging/yash/issues" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/*** Definition section ***/\n\n%{\n/* C code to be copied verbatim */\n#include \n%}\n\n%%\n /*** Rules section ***/\n\n /* [0-9]+ matches a string of one or more digits */\n[0-9]+ {\n /* yytext is a string containing the matched text. */\n printf(\"Saw an integer: %s\\n\", yytext);\n }\n\n.|\\n { /* Ignore all other characters. */ }\n\n%%\n/*** C Code section ***/\n\nint main(void)\n{\n /* Call the lexer, then quit. */\n yylex();\n return 0;\n}" ], "wikipedia": { "example": [ "Saw an integer: 123\nSaw an integer: 2\nSaw an integer: 6" ], "related": [ "yacc", "unix", "c", "regex", "bison", "ragel" ], "summary": "Lex is a computer program that generates lexical analyzers (\"scanners\" or \"lexers\"). Lex is commonly used with the yacc parser generator. Lex, originally written by Mike Lesk and Eric Schmidt and described in 1975, is the standard lexical analyzer generator on many Unix systems, and an equivalent tool is specified as part of the POSIX standard. Lex reads an input stream specifying the lexical analyzer and outputs source code implementing the lexer in the C programming language.", "pageId": 105985, "dailyPageViews": 178, "created": 2002, "backlinksCount": 280, "revisionCount": 304, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Lex_(software)" }, "githubLanguage": { "fileExtensions": [ "l", "lex" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "Lexer.x", "lexer.x" ], "aceMode": "text", "tmScope": "source.lex", "aliases": [ "flex" ], "repos": 2902, "id": "Lex" }, "githubBigQuery": { "repos": 12486, "users": 9501, "id": "Lex" }, "linguistGrammarRepo": { "sampleCount": 1, "example": [ "/*\n +----------------------------------------------------------------------+\n | Zend Engine |\n +----------------------------------------------------------------------+\n | Copyright (c) 1998-2012 Zend Technologies Ltd. (http://www.zend.com) |\n +----------------------------------------------------------------------+\n | This source file is subject to version 2.00 of the Zend license, |\n | that is bundled with this package in the file LICENSE, and is |\n | available through the world-wide-web at the following url: |\n | http://www.zend.com/license/2_00.txt. |\n | If you did not receive a copy of the Zend license and are unable to |\n | obtain it through the world-wide-web, please send a note to |\n | license@zend.com so we can mail you a copy immediately. |\n +----------------------------------------------------------------------+\n | Authors: Zeev Suraski |\n | Jani Taskinen |\n | Marcus Boerger |\n | Nuno Lopes |\n | Scott MacVicar |\n +----------------------------------------------------------------------+\n*/\n\n/* $Id$ */\n\n#include \n#include \"zend.h\"\n#include \"zend_globals.h\"\n#include \n#include \"zend_ini_scanner.h\"\n\n#if 0\n# define YYDEBUG(s, c) printf(\"state: %d char: %c\\n\", s, c)\n#else\n# define YYDEBUG(s, c)\n#endif\n\n#include \"zend_ini_scanner_defs.h\"\n\n#define YYCTYPE unsigned char\n/* allow the scanner to read one null byte after the end of the string (from ZEND_MMAP_AHEAD)\n * so that if will be able to terminate to match the current token (e.g. non-enclosed string) */\n#define YYFILL(n) { if (YYCURSOR > YYLIMIT) return 0" ], "url": "https://github.com/Alhadis/language-grammars" }, "hopl": "https://hopl.info/showlanguage.prx?exp=680", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|O’Reilly Media|Lex & Yacc|Doug Brown Doug and John R. Levine and Tony Mason and Tony Mason and Doug Brown|9781449385606\n28-09-2018|Packt Publishing|Hands-On Chatbot Development with Alexa Skills and Amazon Lex|Sam Williams|9781788992435" }, "lexon": { "title": "Lexon", "appeared": 2018, "type": "contractLanguage", "website": "http://lexon.tech/", "country": [ "Uruguay" ], "originCommunity": [ "https://gitlab.com/lexon-foundation" ], "domainName": { "registered": 2018, "name": "lexon.tech" }, "related": [ "solidity" ], "hasLineComments": { "example": "COMMENT A comment", "value": true }, "hasComments": { "example": "COMMENT A comment", "value": true }, "lineCommentToken": [ [ "COMMENT" ] ], "keywords": [ "lexon", "lex", "clause", "terms", "contracts", "may", "pay", "pays", "appoints", "into", "to" ], "example": [ "LEX Escrow.\n\nChapter: Pay In.\nA Payer pays an Amount into Escrow and appoints the Payee and the Arbiter.\n\nChapter: Pay Out.\nThe Arbiter or the Payer may pay the Escrow to the Payee.\n\nChapter: Pay Back.\nThe Arbiter or the Payee may pay the Escrow to the Payer." ], "monaco": "lexon" }, "lexx-editor": { "title": "LEXX", "appeared": 1985, "type": "editor", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "summary": "LEXX is a text editor which was possibly the first to use live parsing and colour syntax highlighting. It was written by Mike Cowlishaw of IBM around 1985. The name was chosen because he wrote it as a tool for lexicographers, during an assignment for Oxford University Press's second edition of the Oxford English Dictionary. The program ran (and still, in 2018, runs) on mainframes under VM/CMS. LEXX's design was based on several other editors written by the same author (such as STET) augmented by the ability to dynamically parse text and display colour on the new colour terminals that had recently became available (PC-based, and stand-alone such as the IBM 3279). LEXX uses dynamically-loaded parsers which assign classes of elements (tokens formed from character strings) to fonts and colors. It allows indention to be used to format and show the structure of the file being edited, and other formatting options allow (for example) the hiding of selected classes of text, such as tags. A collection of screenshots is available.LPEX ('Live Parsing Editor\") is a reimplemented derivative of the LEXX concept, originally produced for OS/2 and AIX. It now also runs on Windows, Linux, and the Java JVM.", "backlinksCount": 11, "pageId": 19663969, "dailyPageViews": 5, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/LEXX_(text_editor)" } }, "lezer": { "title": "lezer", "appeared": 2019, "type": "grammarLanguage", "creators": [ "Marijn Haverbeke" ], "website": "https://lezer.codemirror.net/", "country": [ "Germany" ], "originCommunity": [ "https://github.com/lezer-parser" ], "domainName": { "name": "lezer.codemirror.net" }, "githubRepo": { "firstCommit": 2019, "stars": 15, "subscribers": 1, "created": 2021, "updated": 2022, "description": "Dev utils and issues for the Lezer core packages", "issues": 9, "forks": 0, "url": "https://github.com/lezer-parser/lezer" }, "repoStats": { "firstCommit": 2020, "commits": 12, "committers": 1, "files": 4 }, "isbndb": "" }, "lfe": { "title": "LFE", "appeared": 2008, "type": "pl", "creators": [ "Robert Virding" ], "documentation": [ "http://docs.lfe.io/current/index.html" ], "reference": [ "https://lfe.io/" ], "standsFor": "Lisp Flavored Erlang", "country": [ "United States" ], "originCommunity": [ "https://github.com/lfe" ], "releaseNotesUrl": "http://docs.lfe.io/v0.7/classic-docs/release-notes.html", "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "(defun parse-args (flag)\n \"Given one or more command-line arguments, extract the passed values.\n\n For example, if the following was passed via the command line:\n\n $ erl -my-flag my-value-1 -my-flag my-value-2\n\n One could then extract it in an LFE program by calling this function:\n\n (let ((args (parse-args 'my-flag)))\n ...\n )\n In this example, the value assigned to the arg variable would be a list\n containing the values my-value-1 and my-value-2.\"\n (let ((`#(ok ,data) (init:get_argument flag)))\n (lists:merge data)))\n\n(defun get-pages ()\n \"With no argument, assume 'url parameter was passed via command line.\"\n (let ((urls (parse-args 'url)))\n (get-pages urls)))\n\n(defun get-pages (urls)\n \"Start inets and make (potentially many) HTTP requests.\"\n (inets:start)\n (plists:map\n (lambda (x)\n (get-page x)) urls))\n\n(defun get-page (url)\n \"Make a single HTTP request.\"\n (let* ((method 'get)\n (headers '())\n (request-data `#(,url ,headers))\n (http-options ())\n (request-options '(#(sync false))))\n (httpc:request method request-data http-options request-options)\n (receive\n (`#(http #(,request-id #(error ,reason)))\n (io:format \"Error: ~p~n\" `(,reason)))\n (`#(http #(,request-id ,result))\n (io:format \"Result: ~p~n\" `(,result))))))" ], "related": [ "erlang", "common-lisp", "scheme", "elixir", "hy", "lisp" ], "summary": "Lisp Flavored Erlang (LFE) is a functional, concurrent, general-purpose programming language and Lisp dialect built on top of Core Erlang and the Erlang Virtual Machine (BEAM). LFE builds on top of Erlang in order to provide a Lisp syntax for writing distributed, fault-tolerant, soft real-time, non-stop applications. LFE also extends Erlang to support meta-programming with Lisp macros and an improved developer experience with a feature-rich REPL. LFE is actively supported on all recent releases of Erlang; the oldest version of Erlang supported is R14.", "pageId": 41671035, "created": 2014, "backlinksCount": 33, "revisionCount": 54, "dailyPageViews": 37, "appeared": 2008, "fileExtensions": [ "lfe", "hrl" ], "url": "https://en.wikipedia.org/wiki/LFE_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "lfe" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "lisp", "codemirrorMode": "commonlisp", "codemirrorMimeType": "text/x-common-lisp", "tmScope": "source.lisp", "repos": 51, "id": "LFE" }, "githubBigQuery": { "repos": 15, "users": 14, "id": "LFE" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 6, "commitCount": 40, "sampleCount": 4, "example": [ ";; Copyright (c) 2013 Duncan McGreggor \n;;\n;; Licensed under the Apache License, Version 2.0 (the \"License\");\n;; you may not use this file except in compliance with the License.\n;; You may obtain a copy of the License at\n;;\n;; http://www.apache.org/licenses/LICENSE-2.0\n;;\n;; Unless required by applicable law or agreed to in writing, software\n;; distributed under the License is distributed on an \"AS IS\" BASIS,\n;; WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n;; See the License for the specific language governing permissions and\n;; limitations under the License.\n\n;; File : church.lfe\n;; Author : Duncan McGreggor\n;; Purpose : Demonstrating church numerals from the lambda calculus\n\n;; The code below was used to create the section of the user guide here:\n;; http://lfe.github.io/user-guide/recursion/5.html\n;;\n;; Here is some example usage:\n;;\n;; > (slurp '\"church.lfe\")\n;; #(ok church)\n;; > (zero)\n;; #Fun\n;; > (church->int1 (zero))\n;; 0\n;; > (church->int1 (three))\n;; 3\n;; > (church->int1 (five))\n;; 5\n;; > (church->int2 #'five/0)\n;; 5\n;; > (church->int2 (lambda () (get-church 25)))\n;; 25\n\n(defmodule church\n (export all))\n\n(defun zero ()\n (lambda (s)\n (lambda (x) x)))\n\n(defun one ()\n (lambda (s)\n (lambda (x)\n (funcall s x))))\n\n(defun two ()\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall s x)))))\n\n(defun three ()\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall s\n (funcall s x))))))\n\n(defun four ()\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall s\n (funcall s\n (funcall s x)))))))\n\n(defun five ()\n (get-church 5))\n\n(defun int-successor (n)\n (+ n 1))\n\n(defun church->int1 (church-numeral)\n \"\n Converts a called church numeral to an integer, e.g.:\n > (church->int1 (five))\n \"\n (funcall\n (funcall church-numeral #'int-successor/1) 0))\n\n(defun church->int2 (church-numeral)\n \"\n Converts a non-called church numeral to an integer, e.g.:\n > (church->int2 #'five/0)\n \"\n (funcall\n (funcall\n (funcall church-numeral) #'int-successor/1) 0))\n\n(defun church-successor (church-numeral)\n (lambda (s)\n (lambda (x)\n (funcall s\n (funcall\n (funcall church-numeral s) x)))))\n\n(defun get-church (church-numeral count limit)\n (cond ((== count limit) church-numeral)\n ((/= count limit)\n (get-church\n (church-successor church-numeral)\n (+ 1 count)\n limit))))\n\n(defun get-church (integer)\n (get-church (zero) 0 integer))\n" ], "url": "https://github.com/textmate/lisp.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LFE", "indeedJobs": { "2022": 0, "query": "lfe developer" }, "officialBlogUrl": [ "https://blog.lfe.io/" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "lg": { "title": "LG", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/863934afa9e8fd7021e1b4d8da8b408302bceeb0" ], "country": [ "Canada" ], "originCommunity": [ "University of Ottawa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4699", "wordRank": 3522, "centralPackageRepositoryCount": 0 }, "lgdf": { "title": "LGDF", "appeared": 1986, "type": "pl", "reference": [ "https://digitalcommons.ohsu.edu/cgi/viewcontent.cgi?article=1167&context=csetech" ], "country": [ "United States" ], "originCommunity": [ "University of North Florida", "University of Missouri-Rolla" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1235", "centralPackageRepositoryCount": 0 }, "li-chen-wang": { "title": "Li-Chen Wang", "appeared": 1976, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Homebrew Computer Club" ], "wikipedia": { "related": [ "tiny-basic", "processor-technology" ], "summary": "Dr. Li-Chen Wang (born 1935) is an American computer engineer, best known for his Palo Alto Tiny BASIC for Intel 8080-based microcomputers. He was a member of the Homebrew Computer Club and made significant contributions to the software for early microcomputer systems from Tandy Corporation and Cromemco.", "created": 2002, "backlinksCount": 24, "pageId": 118561, "revisionCount": 92, "dailyPageViews": 27, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/Li-Chen_Wang" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "liberty-basic": { "title": "Liberty BASIC", "appeared": 1992, "type": "pl", "creators": [ "Carl Gundel" ], "country": [ "United States" ], "originCommunity": [ "Shoptalk Systems" ], "wikipedia": { "example": [ "[multi]\n for i = 1 to 10\n res = 5 * i\n print res\n next i\nend" ], "related": [ "linux", "run-basic", "quickbasic", "smalltalk", "basic", "bbc-basic" ], "summary": "Liberty BASIC (LB) is a commercial computer programming language and integrated development environment (IDE). It has an interpreter, developed in Smalltalk, which recognizes its own dialect of the BASIC programming language. It runs on 16- and 32-bit Windows and OS/2.", "created": 2002, "backlinksCount": 105, "pageId": 53252, "revisionCount": 238, "dailyPageViews": 21, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Liberty_BASIC" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "libra": { "title": "Libra", "appeared": 2020, "type": "pl", "reference": [ "https://www.researchgate.net/publication/2274015_Relational_Programming_in_Libra" ], "country": [ "Australia" ], "originCommunity": [ "University of Adelaide" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8595", "centralPackageRepositoryCount": 0 }, "libsvm-format": { "title": "libsvm-format", "appeared": 2011, "type": "textDataFormat", "description": "[ :]*", "website": "https://www.csie.ntu.edu.tw/~cjlin/libsvm/", "reference": [ "https://www.csie.ntu.edu.tw/~cjlin/papers/libsvm.pdf" ], "country": [ "Taiwan" ], "originCommunity": [ "National Taiwan University" ], "example": [ "1 10:3.4 123:0.5 34567:0.231\n0.2 22:1 456:03" ], "centralPackageRepositoryCount": 0 }, "life": { "title": "LIFE", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/418ce5b267c6efbbaef687d0fc7ef6d7bf65ca68" ], "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1335", "wordRank": 200, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2000|Statistical Inference on Associated Fertility Life Parameters Using Jackknife Technique: Computational Aspects|10.1603/0022-0493-93.2.511|762|66|A. D. Maia and A. J. Luiz and C. Campanhola|2f04c9ccd405f255bff379b3499c66ebb13b967a\n2009|Using Second Life for Problem Based Learning in computer science programming|10.4101/JVWR.V2I1.419|44|3|M. Esteves and B. Fonseca and Leonel Morgado and P. Martins|1ca886d8da5fc5d78fb45f0eb42aa22ac3218eeb\n2008|The Life of a Logic Programming System|10.1007/978-3-540-89982-2_1|17|2|V. S. Costa|c83c85e8486aff6d99fb3f32625133448fe4d2c9\n2012|Bioclipse-R: integrating management and visualization of life science data with statistical analysis|10.1093/bioinformatics/bts681|13|0|O. Spjuth and V. Georgiev and L. Carlsson and Jonathan Alvarsson and Arvid Berg and Egon Willighagen and J. Wikberg and M. Eklund|bcc591b8061a0b7025af56bfa74c65d72cf31924\n2011|Is Life Unique?|10.3390/life2010106|12|0|D. L. Abel|bf56b973f0aa3d632ff694ca0856943b377911b8\n2017|Applying an MVC Framework for The System Development Life Cycle with Waterfall Model Extended|10.1088/1742-6596/824/1/012007|12|1|W. Hardyanto and A. Purwinarko and F. Sujito and Masturi and D. Alighiri|ada830f7f4b83b3cef19cf1a50f277e9bd9020ec\n2019|Introducing Programming Skills for Life Science Students|10.1002/bmb.21230|12|0|D. Mariano and Pedro M. Martins and Lucianna Helene Santos and R. de Melo-Minardi|d0d2ab7260941ffa844f09588085f2e5a7b365c0\n2008|A Review of Linden Scripting Language and Its Role in Second Life|10.1007/978-3-642-02276-0_5|11|0|R. Cox and P. S. Crowther|1c0b0784d03c8905f6e956bb84d239b2de5304f9\n2015|Artificial life programming in the robust-first attractor|10.7551/978-0-262-33027-5-ch097|7|0|D. Ackley and E. Ackley|fee8495b925e115d9e8553217f35f12e97dfea6b\n2016|The ulam Programming Language for Artificial Life|10.1162/ARTL_a_00212|6|0|D. Ackley and E. Ackley|83fd586cc03fd901a723ebb2829b84f451b2955e\n2014|Designing robotic avatars in Second Life - A tool to complement robotics education|10.1109/EDUCON.2014.6826228|4|0|C. Buiu and Mihai Gansari|3a65c1c0b1843d53050aff15384d694bdf3bdde8" }, "lift": { "title": "lift", "appeared": 2014, "type": "pl", "website": "https://www.lift-project.org/", "country": [ "Scotland and Germany" ], "originCommunity": [ "Universities of Edinburgh", "University of Münster" ], "domainName": { "registered": 2016, "name": "lift-project.org" }, "githubRepo": { "firstCommit": 2014, "stars": 202, "forks": 19, "subscribers": 19, "created": 2016, "updated": 2022, "description": "The Lift programming language and compiler", "issues": 5, "url": "https://github.com/lift-project/lift" }, "repoStats": { "firstCommit": 2014, "commits": 5318, "committers": 58, "files": 698 } }, "lighttpd-configuration-file": { "title": "Lighttpd configuration file", "appeared": 2003, "type": "configFormat", "reference": [ "http://lighttpd.net/" ], "country": [ "Germany" ], "originCommunity": [ "University of Applied Sciences" ], "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "lighttpd.conf" ], "id": "Lighttpd configuration file" } }, "ligo": { "title": "Ligo", "appeared": 2019, "type": "contractLanguage", "website": "https://ligolang.org/", "webRepl": [ "https://ide.ligolang.org/" ], "cheatSheetUrl": [ "https://ligolang.org/docs/api/cheat-sheet" ], "aka": [ "jsligo", "cameligo", "pascaligo", "reasonligo" ], "country": [ "France" ], "originCommunity": [ "https://www.marigold.dev/projects" ], "domainName": { "registered": 2019, "awisRank": { "2022": 5947641 }, "name": "ligolang.org" }, "related": [ "solidity", "pascal", "reason", "ocaml" ], "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "(*", "*)" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abs", "assert", "block", "Bytes", "case", "Crypto", "Current", "else", "failwith", "false", "for", "fun", "if", "in", "let", "let%entry", "let%init", "List", "list", "Map", "map", "match", "match%nat", "mod", "not", "operation", "Operation", "of", "record", "Set", "set", "sender", "skip", "source", "String", "then", "to", "true", "type", "with" ], "gitlabRepo": "https://gitlab.com/ligolang/ligo", "repoStats": { "firstCommit": 2016, "commits": 18425, "committers": 245, "files": 6439 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "religo" ], "group": "LigoLANG", "aceMode": "rust", "codemirrorMode": "rust", "codemirrorMimeType": "text/x-rustsrc", "tmScope": "source.religo", "repos": 0, "id": "CameLIGO" }, "monaco": "pascaligo" }, "lil-pl": { "title": "Lil", "appeared": 2022, "type": "pl", "description": "Lil is part of the technology that powers Decker, a multimedia creative tool inspired by HyperCard. Decker uses Lil for adding custom behavior to decks and the widgets within. Lil is designed to be learned in layers, but it is a richly multi-paradigm language which incorporates ideas from imperative, functional, declarative, and vector-oriented languages.", "website": "https://beyondloom.com/decker/lil.html", "webRepl": [ "https://beyondloom.com/decker/tour.html" ], "documentation": [ "https://beyondloom.com/decker/lil.html" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/JohnEarnest/Decker/issues" ], "related": [ "sql", "lua" ], "influencedBy": [ "hypercard" ], "hasStrings": { "example": "", "value": true }, "hasLists": { "example": "emptyList = ()", "value": true }, "example": [ "on mode a do # line comment\n r:()\n each x in a\n r[x]:1+r[x]\n end\n extract first key orderby value desc from r\nend\n\nmode[1,2,2,3,4,2,1]" ], "githubRepo": { "stars": 396, "forks": 21, "subscribers": 16, "created": 2022, "updated": 2023, "description": "A multimedia sketchpad", "issues": 2, "url": "https://github.com/JohnEarnest/Decker" }, "repoStats": { "firstCommit": 2022, "commits": 284, "committers": 8, "files": 156 } }, "lil": { "title": "Little Implementation Language", "appeared": 1974, "type": "pl", "creators": [ "P. J. Plauger" ], "website": "http://www.ultimate.com/phil/lil/lil.html", "standsFor": "Little Implementation Language", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "related": [ "unix", "pl360" ], "summary": "LIL, the Little Implementation Language, was a system programming language during the early days of Unix history on PDP-11 machines. It was written by P. J. Plauger of Bell Labs. LIL attempted to fill the gap between assemblers and machine-independent system implementation languages (such as the C programming language), by basically adding structured programming to the PDP-11 assembly language. LIL resembled PL360 with C-like flow control syntax. The LIL compiler \"lc\" was part of Fifth Edition Unix (1974), but was dropped by Sixth Edition Unix (1975). Plauger left Bell Labs in the same year. Plauger explains why LIL was abandoned in Bell Labs in favor of C: [1] ... LIL is, however, a failure. Its stiffest competition at Bell Labs is the language C, which is higher level, and machine independent. Every time it looked like C was too expensive to use for a particular project, LIL was considered. But almost every time, it proved easier (and more rewarding) to improve C, or its runtime support, or the hardware, than to invest time in yet another language. ... A machine independent language is always superior -- even for writing machine dependent code (it's easier to find trained programmers) -- so long as the overhead can be endured. It is clear now that writing straightforward code and then measuring it is the formula for the best end product. At worst there will be 5-15 per cent overhead, which is seldom critical. Once system writers become mature enough to recognize this basic truth, they gravitate naturally toward machine independent SILs. ... it looks like the little implementation language is an idea whose time as come -- and gone.", "pageId": 35320077, "dailyPageViews": 4, "created": 2012, "backlinksCount": 4, "revisionCount": 20, "appeared": 1974, "url": "https://en.wikipedia.org/wiki/Little_Implementation_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2386", "fileType": "text", "wordRank": 6582, "centralPackageRepositoryCount": 0 }, "lila-lang": { "title": "lila-lang", "appeared": 2019, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/codr7/lila/issues" ], "example": [ "fun fib(n:Int) (Int) {\n if {n.< 2} n {\n fib {n.- 1}\n fib {n.- 2}\n $.+ $\n }\n}" ], "githubRepo": { "firstCommit": 2019, "subscribers": 2, "created": 2019, "updated": 2019, "description": "a cleaner language based on Common Lisp", "stars": 3, "forks": 0, "issues": 0, "url": "https://github.com/codr7/lila" }, "repoStats": { "firstCommit": 2019, "commits": 182, "committers": 2, "files": 48 } }, "lila": { "title": "Lila", "appeared": 2017, "type": "pl", "reference": [ "https://iamronen.com/blog/2010/05/02/reading-lila-machine-language/", "https://www.semanticscholar.org/paper/Construction-of-an-ELL(1)-syntax-analyser-for-Ada-Craeynest-Vansteenkiste/b92d54ff36e3f65c79b77c98d2e545d772e02341" ], "country": [ "Belgium" ], "originCommunity": [ "Katholieke Universiteit" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2165", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1984|Construction of an ELL(1) syntax analyser for Ada with the compiler-generator LILA|10.1145/948415.948419|1|0|Dirk Craeynest and Geert Vansteenkiste and J. Lewi|b92d54ff36e3f65c79b77c98d2e545d772e02341" }, "lily": { "title": "Lily", "appeared": 2011, "type": "pl", "description": "An interpreted language with a focus on expressiveness and type safety", "website": "http://lily-lang.org", "webRepl": [ "http://lily-lang.org/intro-sandbox.html" ], "country": [ "Unknown" ], "originCommunity": [ "https://gitlab.com/FascinatedBox/lily/-/issues" ], "domainName": { "registered": 2016, "name": "lily-lang.org" }, "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "example": [ "scoped enum Color { Black, Blue, Cyan, Green, Magenta, Red, White, Yellow }\n\nclass Terminal(public var @foreground: Color, width_str: String)\n{\n public var @width = width_str.parse_i().unwrap_or(80)\n\n public define set_fg(new_color: Color) {\n @foreground = new_color\n }\n}\n\nvar terms = [Terminal(Color.White, \"A\"), Terminal(Color.Red, \"40\")]\n\nterms.each(|e| e.width += 20 )\n |> print" ], "githubRepo": { "firstCommit": 2011, "stars": 1079, "forks": 39, "subscribers": 32, "created": 2014, "updated": 2022, "description": "Interpreted language focused on expressiveness and type safety.", "issues": 0, "url": "https://github.com/FascinatedBox/lily" }, "gitlabRepo": "https://gitlab.com/FascinatedBox/lily", "repoStats": { "firstCommit": 2011, "commits": 5225, "committers": 28, "files": 195 }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lily", "tryItOnline": "lily", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2017|Independently published|The Lily and the Cross: A Ring and Crown Novel|de la Cruz, Melissa|9781973305514" }, "lilypond": { "title": "LilyPond", "appeared": 1996, "type": "pl", "website": "http://lilypond.org", "country": [ "Various" ], "originCommunity": [ "https://gitlab.com/lilypond" ], "domainName": { "registered": 1998, "awisRank": { "2022": 476694 }, "name": "lilypond.org" }, "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasFloats": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "wikipedia": { "example": [ "\\relative c' { f d f a d f e d cis a cis e a g f e }" ], "related": [ "scheme", "metafont", "postscript", "python", "linux", "freebsd", "musicxml", "pdf", "svg", "guile", "latex", "tex", "utf-8", "emacs-editor", "org", "mediawiki", "sibelius-software" ], "summary": "LilyPond is a computer program and file format for music engraving. One of LilyPond's major goals is to produce scores that are engraved with traditional layout rules, reflecting the era when scores were engraved by hand. LilyPond is cross-platform, and is available for several common operating systems; released under the terms of the GNU General Public License, LilyPond is free software.", "pageId": 169144, "dailyPageViews": 102, "created": 2003, "backlinksCount": 286, "revisionCount": 569, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/LilyPond" }, "githubLanguage": { "fileExtensions": [ "ly", "ily" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.lilypond", "repos": 2059, "id": "LilyPond" }, "githubBigQuery": { "repos": 298, "users": 263, "id": "LilyPond" }, "pygmentsHighlighter": { "filename": "lilypond.py", "fileExtensions": [ "ly" ], "id": "LilyPond" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2012, "committerCount": 4, "commitCount": 28, "url": "https://github.com/textmate/lilypond.tmbundle" }, "leachim6": { "filepath": "l/LilyPond.ly", "fileExtensions": [ "ly" ], "example": [ "\\markup { Hello World }\n" ], "id": "LilyPond" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lilypond", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "limbo": { "title": "Limbo", "appeared": 1995, "type": "pl", "creators": [ "Rob Pike" ], "website": "http://www.vitanuova.com/inferno/limbo.html", "documentation": [ "http://resibots.eu/limbo/" ], "country": [ "United States" ], "originCommunity": [ "https://groups.google.com/g/inferno-os" ], "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "printToken": [ [ "sys->print" ] ], "example": [ "Lock: module\n{\n\tPATH:\tcon \"/dis/lib/lock.dis\";\n\n\tSemaphore: adt {\n\t\tc: chan of int;\n\t\tobtain:\tfn(nil: self ref Semaphore);\n\t\trelease: fn(nil: self ref Semaphore);\n\t\tnew: fn(): ref Semaphore;\n\t};\n\t\n\tinit: fn();\n};" ], "wikipedia": { "example": [ "implement Command;\n \n include \"sys.m\";\n sys: Sys;\n \n\n \n init(Context, nil: list of string)\n {\n sys = load Sys Sys->PATH;\n print(\"Hello World!\\n\");\n }" ], "related": [ "c", "pascal", "csp", "alef", "newsqueak", "stackless-python", "go", "rust", "ada", "isbn" ], "summary": "Limbo is a programming language for writing distributed systems and is the language used to write applications for the Inferno operating system. It was designed at Bell Labs by Sean Dorward, Phil Winterbottom, and Rob Pike. The Limbo compiler generates architecture-independent object code which is then interpreted by the Dis virtual machine or compiled just before runtime to improve performance. Therefore all Limbo applications are completely portable across all Inferno platforms. Limbo's approach to concurrency was inspired by Hoare's communicating sequential processes (CSP), as implemented and amended in Pike's earlier Newsqueak language and Winterbottom's Alef.", "pageId": 236298, "dailyPageViews": 73, "created": 2003, "backlinksCount": 119, "revisionCount": 138, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Limbo_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "b", "m" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 529, "id": "Limbo" }, "githubBigQuery": { "repos": 367, "users": 360, "id": "Limbo" }, "pygmentsHighlighter": { "filename": "inferno.py", "fileExtensions": [ "b" ], "id": "Limbo" }, "helloWorldCollection": [ "Hello World in Limbo.\nLimbo is the programming language of the Inferno OS\n(from Lucent Bell Labs).\n\n\nimplement Cmd;\n\ninclude \"sys.m\";\ninclude \"draw.m\";\n\nCmd : module {\n init : fn (ctxt : ref Draw->Context, args : list of string);\n};\n\ninit(nil : ref Draw->Context, nil : list of string)\n{\n sys := load Sys Sys->PATH;\n sys->print(\"Hello World\\n\");\n}" ], "leachim6": { "filepath": "l/Limbo.b", "fileExtensions": [ "b" ], "example": [ "implement Hello;\n\ninclude \"sys.m\";\n\tsys: Sys;\ninclude \"draw.m\";\n\nHello: module\n{\n\tinit:\tfn(ctxt: ref Draw->Context, argv: list of string);\n};\n\ninit(ctxt: ref Draw->Context, argv: list of string)\n{\n\tsys = load Sys Sys->PATH;\n\tsys->print(\"Hello World\\n\");\n}\n" ], "id": "Limbo" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Limbo", "rijuRepl": { "example": [ "implement Cmd;\n\ninclude \"sys.m\";\ninclude \"draw.m\";\n\nCmd : module {\n init : fn (ctxt : ref Draw->Context, args : list of string);\n};\n\ninit(nil : ref Draw->Context, nil : list of string)\n{\n sys := load Sys Sys->PATH;\n sys->print(\"Hello, world!\\n\");\n}\n" ], "id": "https://riju.codes/limbo" }, "tiobe": { "id": "Limbo" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2166", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2003|Wiley|Inferno Programming with Limbo|Stanley-Marbell, Phillip|9780470843529\n1997|Academic P|Inferno Programming Using Limbo|Steven Breitstein|9780121298708\n20141219|Emereo|Limbo 48 Success Secrets - 48 Most Asked Questions On Limbo - What You Need To Know|Howard Beck|9781488826153", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|Programming in Limbo|10.1109/CMPCON.1997.584719|15|0|S. Dorward and R. Pike and P. Winterbottom|03c5c73f6c1fcd477a1ec80144fe1e14dbb9a2f5" }, "limdep": { "title": "LIMDEP", "appeared": 1980, "type": "pl", "reference": [ "http://www.limdep.com/features/capabilities/programming/programming_with_limdep_1.php" ], "country": [ "United States" ], "originCommunity": [ "Econometric Software, Inc." ], "wikipedia": { "summary": "LIMDEP is an econometric and statistical software package with a variety of estimation tools. In addition to the core econometric tools for analysis of cross sections and time series, LIMDEP supports methods for panel data analysis, frontier and efficiency estimation and discrete choice modeling. The package also provides a programming language to allow the user to specify, estimate and analyze models that are not contained in the built in menus of model forms.", "backlinksCount": 103, "pageId": 39119352, "dailyPageViews": 12, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/LIMDEP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2167", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "linc-4gl": { "title": "LINC 4GL", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Unisys Corporation" ], "wikipedia": { "related": [ "unix", "linux", "java", "asp", "cobol", "work-flow-language", "jade", "newp" ], "summary": "LINC (\"Logic and Information Network Compiler\") is a fourth-generation programming language, used mostly on Unisys computer systems.", "created": 2006, "backlinksCount": 50, "pageId": 4298516, "revisionCount": 126, "dailyPageViews": 15, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/LINC_4GL" }, "centralPackageRepositoryCount": 0 }, "lincoln-reckoner": { "title": "Lincoln Reckoner", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fdcb44164e2ba9bf6132ef5eec4412fe119b598a" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=229", "centralPackageRepositoryCount": 0 }, "lincos": { "title": "Lincos", "appeared": 1961, "type": "notation", "country": [ "United States" ], "originCommunity": [ "Search For Extraterrestrial Intelligence" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Lincos_language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3434", "semanticScholar": "" }, "linda": { "title": "Linda", "appeared": 1986, "type": "pl", "creators": [ "David Gelernter" ], "country": [ "United States" ], "originCommunity": [ "Scientific Computing Associates" ], "wikipedia": { "related": [ "tuple-space", "c", "fortran", "csharp", "erlang", "go", "java", "javascript", "lisp", "lua", "prolog", "python", "ruby", "swift", "ada", "doi" ], "summary": "In computer science, Linda is a model of coordination and communication among several parallel processes operating upon objects stored in and retrieved from shared, virtual, associative memory. It was developed by Sudhir Ahuja at AT&T Bell Laboratories in collaboration with David Gelernter and Nicholas Carriero at Yale University in 1986.", "pageId": 957598, "created": 2004, "backlinksCount": 33, "revisionCount": 156, "dailyPageViews": 68, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Linda_(coordination_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1159", "fileType": "text", "wordRank": 4710, "centralPackageRepositoryCount": 0 }, "linden-scripting-language": { "title": "Linden Scripting Language", "appeared": 2003, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Linden Research, Inc" ], "wikipedia": { "related": [ "linux", "linden-scripting-language", "opengl", "mysql", "csharp" ], "summary": "Second Life is an online virtual world, developed and owned by the San Francisco-based firm Linden Lab and launched on June 23, 2003. By 2013, Second Life had approximately one million regular users. In many ways, Second Life is similar to massively multiplayer online role-playing games; however, Linden Lab is emphatic that their creation is not a game: \"There is no manufactured conflict, no set objective\".The virtual world can be accessed freely via Linden Lab's own client programs or via alternative third-party viewers. Second Life users, also called residents, create virtual representations of themselves, called avatars, and are able to interact with places, objects and other avatars. They can explore the world (known as the grid), meet other residents, socialize, participate in both individual and group activities, build, create, shop, and trade virtual property and services with one another. The platform principally features 3D-based user-generated content. Second Life also has its own virtual currency, the Linden Dollar, which is exchangeable with real world currency.Second Life is intended for people aged 16 and over, with the exception of 13–15-year-old users, who are restricted to the Second Life region of a sponsoring institution (e.g., a school).Built into the software is a 3D modeling tool based on simple geometric shapes that allows residents to build virtual objects. There is also a procedural scripting language, Linden Scripting Language, which can be used to add interactivity to objects. Sculpted prims (sculpties), mesh, textures for clothing or other objects, animations, and gestures can be created using external software and imported. The Second Life terms of service provide that users retain copyright for any content they create, and the server and client provide simple digital rights management (DRM) functions. However, Linden Lab changed their terms of service in August 2013 to be able to use user-generated content for any purpose. The new terms of service prevent users from using textures from third-party texture services, as some of them pointed out explicitly.", "created": 2004, "backlinksCount": 1229, "pageId": 589192, "revisionCount": 239, "dailyPageViews": 21, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Linden_Scripting_Language" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "linearml": { "title": "LinearML", "appeared": 2010, "type": "pl", "creators": [ "Julien Verlaguet" ], "website": "https://github.com/pikatchu/LinearML", "fileExtensions": [ "lml" ], "country": [ "United States" ], "originCommunity": [ "Facebook" ], "githubRepo": { "stars": 401, "forks": 28, "subscribers": 25, "created": 2010, "updated": 2014, "description": "Functional language for parallel programming", "url": "https://github.com/pikatchu/LinearML" }, "repoStats": { "firstCommit": 2010, "commits": 237, "committers": 15, "files": 116 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n2310587|LinearML:a programming language designed to write efficient parallel programs.|https://github.com/pikatchu/LinearML/|2011-03-10 20:18:22 UTC|1299784702|primodemus|22|69" }, "lingo": { "title": "Lingo", "appeared": 1988, "type": "pl", "country": [ "United States" ], "originCommunity": [ "MacroMind" ], "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "smalltalk", "hypertalk", "javascript", "actionscript" ], "summary": "Lingo is a verbose object-oriented (OO) scripting language developed by John H. Thompson for use in Adobe Director (formerly Macromedia Director). Lingo is used to develop desktop application software, interactive kiosks, CD-ROMs and Adobe Shockwave content. Lingo is the primary programming language on the Adobe Shockwave platform, which dominated the interactive multimedia product market during the 1990s. Various graphic adventure games were developed with Lingo during the 1990s, including The Journeyman Project, Total Distortion, Mia's Language Adventure, Mia's Science Adventure, and the Didi & Ditto series. Hundreds of free online video games were developed using Lingo, and published on websites such as Miniclip and Shockwave.com. Lingo can be used to build user interfaces, to manipulate raster graphics, vector graphics and 3D computer graphics, and other data processing tasks. Lingo supports specialized syntax for image processing and 3D object manipulation. 3D meshes can also be created on the fly using Lingo.", "pageId": 493076, "dailyPageViews": 40, "created": 2004, "backlinksCount": 30, "revisionCount": 218, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/Lingo_(programming_language)" }, "helloWorldCollection": [ "Hello World in Lingo (Macromedia Director)\n\non startmovie\n alert \"Hello World\" \nend\n" ], "leachim6": { "filepath": "l/Lingo.lg4", "fileExtensions": [ "lg4" ], "example": [ "on startmovie\n alert \"Hello World\"\nend\n" ], "id": "Lingo" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lingo", "tiobe": { "id": "Lingo" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1640", "fileType": "text", "centralPackageRepositoryCount": 0 }, "lingua-graphica": { "title": "Lingua Graphica", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e0671ea9ef0e9e7a1384c635d3ef6b34b207f3ce" ], "country": [ "United States" ], "originCommunity": [ "Lockheed Artificial Intelligence Cente", "Lockheed Software Technology Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5100", "centralPackageRepositoryCount": 0 }, "link": { "title": "Link", "appeared": 2021, "type": "pl", "creators": [ "Lance Pollard" ], "fileExtensions": [ "link" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/teamtreesurf" ], "example": [ "save x, text 10 # create\nsave y, move x # move\nsave z, loan y # borrow\nsave w, read z # copy" ], "githubRepo": { "firstCommit": 2021, "stars": 2, "forks": 0, "subscribers": 1, "created": 2021, "updated": 2022, "description": "The Link Text Compiler", "issues": 0, "url": "https://github.com/teamdrumwork/base" }, "repoStats": { "firstCommit": 2021, "commits": 197, "committers": 1, "files": 186 } }, "linked-markdown": { "title": "Linked Markdown", "appeared": 2022, "type": "textMarkup", "creators": [ "Luis Cuende" ], "description": "The main intended use is writing legal agreements and law. A Linked Markdown file has a first sections containing definitions, and a second section containing Markdown. They are separated by three lines.", "website": "https://linked.md/", "country": [ "Nation3" ], "originCommunity": [ "https://nation3.org" ], "example": [ "Definition Name\n: Definition content.\n\n---\n\n# Markdown content\nAny Markdown _text_." ] }, "linker-script": { "title": "Linker Script", "appeared": 1991, "type": "application", "description": "ld combines a number of object and archive files, relocates their data and ties up symbol references. Usually the last step in compiling a program is to run ld. ld accepts Linker Command Language files written in a superset of AT&T’s Link Editor Command Language syntax, to provide explicit and total control over the linking process.", "reference": [ "https://www.eecs.umich.edu/courses/eecs373/readings/Linker.pdf" ], "country": [ "United States" ], "originCommunity": [ "Red Hat Inc", "Free Software Foundation, Inc" ], "example": [ "/*\n* link.ld\n*/\nOUTPUT_FORMAT(elf32-i386)\nENTRY(start)\nSECTIONS\n {\n . = 0x100000;\n .text : { *(.text) }\n .data : { *(.data) }\n .bss : { *(.bss) }\n }" ], "githubLanguage": { "fileExtensions": [ "ld", "lds", "x" ], "trendingProjectsCount": 0, "type": "data", "filenames": [ "ld.script" ], "aceMode": "text", "tmScope": "none", "id": "Linker Script" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "links-programming-language": { "title": "Links", "appeared": 2006, "type": "pl", "website": "http://www.links-lang.org", "country": [ "United Kingdom and France" ], "originCommunity": [ "https://github.com/links-lang" ], "domainName": { "name": "links-lang.org" }, "githubRepo": { "firstCommit": 2006, "stars": 273, "forks": 35, "subscribers": 15, "created": 2014, "updated": 2022, "description": "Links: Linking Theory to Practice for the Web", "issues": 158, "url": "https://github.com/links-lang/links" }, "repoStats": { "firstCommit": 2006, "commits": 4515, "committers": 49, "files": 959 }, "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Links_(programming_language)" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|On multi-language software development, cross-language links and accompanying tools: a survey of professional software developers|10.1186/s40411-017-0035-z|22|1|P. Mayer and Michael Kirsch and Minh Anh Le|e40edaa0f89ba5a3513a4e2ef381a47b9f627b14\n2004|LMNtal: A Language Model with Links and Membranes|10.1007/978-3-540-31837-8_6|17|0|K. Ueda and Norio Kato|e921e07c86f56c35ce08c0a2c08e09b776397370\n2005|The Query Language to XML Documents Connected by XLink Links|10.1007/s11086-005-0026-4|5|0|D. Lizorkin|7b857d2e8b597d4bd4724e092c32313b976792e3\n2016|Managing Traceability Links with MaTraca|10.1109/SANER.2016.16|2|0|A. Lozano and Carlos Noguera and V. Jonckers|cf8de0ee67a0900a85c2011b58f4a0c8e6ac5071\n2013|Application Camera Links on Xilinx FPGA|10.1109/FSKD.2013.6816365|1|0|Hua Cai and Huadong Yu and Jinkai Xu and G. Wang|98271340804fb7e790a2b5f6580125b39ad5d7a5" }, "links": { "title": "links", "appeared": 2016, "type": "pl", "website": "http://links-lang.org", "country": [ "United Kingdom" ], "originCommunity": [ "The University of Edinburgh" ], "domainName": { "registered": 2016, "name": "links-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n20696245|The Links Programming Language – Linking Theory to Practice for the Web|http://links-lang.org/|2019-08-14 15:01:51 UTC|1565794911|lelf|0|3", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|On multi-language software development, cross-language links and accompanying tools: a survey of professional software developers|10.1186/s40411-017-0035-z|22|1|P. Mayer and Michael Kirsch and Minh Anh Le|e40edaa0f89ba5a3513a4e2ef381a47b9f627b14\n2004|LMNtal: A Language Model with Links and Membranes|10.1007/978-3-540-31837-8_6|17|0|K. Ueda and Norio Kato|e921e07c86f56c35ce08c0a2c08e09b776397370\n2005|The Query Language to XML Documents Connected by XLink Links|10.1007/s11086-005-0026-4|5|0|D. Lizorkin|7b857d2e8b597d4bd4724e092c32313b976792e3\n2016|Managing Traceability Links with MaTraca|10.1109/SANER.2016.16|2|0|A. Lozano and Carlos Noguera and V. Jonckers|cf8de0ee67a0900a85c2011b58f4a0c8e6ac5071\n2013|Application Camera Links on Xilinx FPGA|10.1109/FSKD.2013.6816365|1|0|Hua Cai and Huadong Yu and Jinkai Xu and G. Wang|98271340804fb7e790a2b5f6580125b39ad5d7a5" }, "linktext": { "title": "LinkText", "appeared": 2022, "type": "pl", "description": "Preview of LinkText, A Data Modeling Language", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/ueggue/preview_of_linktext_a_data_modeling_language/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/tunebond" ] }, "linoleum": { "title": "Linoleum (L.in.oleum)", "appeared": 1996, "type": "pl", "creators": [ "Alessandro Ghignola" ], "website": "http://anynowhere.com/forum/4", "reference": [ "https://en.wikibooks.org/wiki/Linoleum", "https://www.reddit.com/r/programming/comments/cl0ep/linoleum_is_an_unstructured_untyped_procedural/", "https://hopl.info/showlanguage.prx?exp=5232" ], "standsFor": "Low-level INterfaced OverLanguage for Extremely Universal Machine-coding", "country": [ "Italy" ], "originCommunity": [ "AnyNowhere" ], "wikipedia": { "url": "https://web.archive.org/web/20160406133341/https://en.wikipedia.org/wiki/Linoleum_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8589", "centralPackageRepositoryCount": 0 }, "linotte": { "title": "Linotte", "appeared": 2005, "type": "pl", "creators": [ "cpc6128" ], "website": "http://langagelinotte.free.fr/", "country": [ "France" ], "nativeLanguage": "French", "originCommunity": [ "https://github.com/cpc6128/LangageLinotte/issues" ], "domainName": { "awisRank": { "2017": 5135243 }, "name": "langagelinotte.free.fr" }, "githubRepo": { "firstCommit": 2019, "stars": 29, "forks": 3, "subscribers": 4, "created": 2019, "updated": 2022, "description": "Code source officiel du langage de programmation Linotte - Langage de programmation en français simple créé dans le but de permettre aux enfants et aux personnes n'ayant pas une connaissance approfondie de l’informatique d’apprendre la programmation facilement.", "issues": 3, "url": "https://github.com/cpc6128/LangageLinotte" }, "repoStats": { "firstCommit": 2019, "commits": 523, "committers": 6, "files": 886 }, "wikipedia": { "example": [ "BonjourLeMonde:\n début\n affiche \"Bonjour le monde !\"" ], "related": [ "php", "java-server-pages" ], "summary": "Linotte is an interpreted 4th generation programming language. Linotte's syntax is in French. The language's goal is to allow French-speaking children and other francophones with little computer science experience to easily learn programming, with the slogan (in French) \"you know how to read a book, so you can write a computer program\".", "pageId": 47833395, "dailyPageViews": 8, "created": 2015, "backlinksCount": 4, "revisionCount": 6, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Linotte" }, "packageRepository": [ "https://bitbucket.org/metalm/langagelinotte/downloads/" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "linq": { "title": "LINQ", "appeared": 2007, "type": "queryLanguage", "originCommunity": [ "Microsoft" ], "wikipedia": { "example": [ "[Table(Name=\"Customers\")]\npublic class Customer\n{\n [Column(IsPrimaryKey = true)]\n public int CustID;\n\n [Column]\n public string CustName;\n}" ], "related": [ "csharp", "f-sharp", "sql", "haskell", "php", "javascript", "typescript", "actionscript", "xml", "oxygene", "nemerle" ], "summary": "Language Integrated Query (LINQ, pronounced \"link\") is a Microsoft .NET Framework component that adds native data querying capabilities to .NET languages, although ports exist for PHP (PHPLinq), JavaScript (linq.js), TypeScript (linq.ts), and ActionScript (ActionLinq) - but none of these ports are strictly equivalent to LINQ in C# for example (where it is a part of the language, not an external library, and where it often addresses a wider range of needs). LINQ extends the language by the addition of query expressions, which are akin to SQL statements, and can be used to conveniently extract and process data from arrays, enumerable classes, XML documents, relational databases, and third-party data sources. Other uses, which utilize query expressions as a general framework for readably composing arbitrary computations, include the construction of event handlers or monadic parsers. LINQ also defines a set of method names (called standard query operators, or standard sequence operators), along with translation rules used by the compiler to translate fluent-style query expressions into expressions using these method names, lambda expressions and anonymous types. Many of the concepts that LINQ has introduced were originally tested in Microsoft's Cω research project. LINQ was released as a major part of .NET Framework 3.5 on November 19, 2007.", "pageId": 13706337, "dailyPageViews": 184, "created": 2005, "backlinksCount": 234, "revisionCount": 679, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Language_Integrated_Query" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nLINQ For Dummies|2008|John Paul Mueller|6604665|3.50|4|1\nProgramming Microsoft® LINQ|2008|Paolo Pialorsi|3040440|3.69|13|0\nProgramming Reactive Extensions And Linq|2011|Jesse Liberty|16259917|2.70|20|1\nPro LINQ: Language Integrated Query in C# 2008|2007|Joseph C. Rattz Jr.|2276192|3.57|47|2\nLINQ Programming|2008|Joe Mayo|29240442|4.67|6|0\nProgramming Microsoft LINQ in .NET Framework 4|2010|Paolo Pialorsi|13317423|3.80|20|2\nPro Linq: Language Integrated Query in C# 2010|2010|Joseph C. Rattz Jr.|13086757|4.15|20|1", "isbndb": "year|publisher|title|authors|isbn13\n2008|Wrox|Professional LINQ|Klein, Scott|9780470041819\n2009|Wrox|Professional ADO.NET 3.5 with LINQ and the Entity Framework|Jennings, Roger|9780470182611\n20100101|Springer Nature|Pro LINQ in VB8|Joseph Rattz; Dennis Hayes|9781430216452\n20080902|Springer Nature|Pro LINQ Object Relational Mapping in C# 2008|Vijay P. Mehta|9781430205975\n2008|Sams Publishing|LINQ Unleashed: for C#|Kimmel, Paul|9780672329838\n2010|Microsoft Press|Programming Microsoft LINQ in .NET Framework 4 (Developer Reference)|Russo, Marco and Pialorsi, Paolo|9780735658837\n2008|Manning Publications|LINQ in Action|Fabrice Marguerie and Steve Eichert and Jim Wooley|9781933988160\n2021|Independently published|PROGRAMMING MICROSOFT LINQ NET CORE 5: Examples and Exercises in C#|Marcano, Anibal|9798499182307\n2008|Microsoft Press|Programming Microsoft® LINQ (PRO-Developer)|Paolo Pialorsi and Marco Russo|9780735624009\n2009|McGraw-Hill Education|LINQ Programming|Mayo, Joe|9780071597838\n2010|Addison-Wesley Professional|LINQ to Objects Using C# 4.0: Using and Extending LINQ to Objects and Parallel LINQ (PLINQ) (Addison-Wesley Microsoft Technology)|Magennis, Troy|9780321637178\n2010|AddisonWesley Professional|LINQ to Objects Using C# 4.0: Using and Extending LINQ to Objects and Parallel LINQ (PLINQ) (AddisonWesley Microsoft Technology)|Magennis, Troy|9780321637000\n2010|Microsoft Press|Programming Microsoft® LINQ in Microsoft .NET Framework 4 (Developer Reference)|Pialorsi, Paolo and Russo, Marco|9780735640573\n2011|Apress|Programming Reactive Extensions and LINQ (Expert's Voice in .NET)|Liberty, Jesse and Betts, Paul|9781430237471\n2007|Packt Publishing|LINQ Quickly|Kumar, N. Satheesh|9781847192547\n2011||Programming Microsoft Linq In Microsoft.net Framework 4 (with Cd )|Paolo Pialorsi and Marco Russo|9789350041840\n20081215|McGraw-Hill Professional|LINQ Programming|Joe Mayo|9780071597845\n2008|John Wiley & Sons, Ltd.|Professional Linq|Scott Klein|9780470285039\n20081008|Springer Nature|Pro LINQ|Joseph Rattz|9781430203827\n2007-11-16|Packt Publishing|LINQ Quickly|N Satheesh Kumar|9781847192554\n20080131|Simon & Schuster|LINQ in Action|Steve Eichert; James B. Wooley; Fabrice Marguerie|9781638354628\n20071224|Springer Nature|LINQ for Visual C# 2005|Fabio Claudio Ferracchiati|9781430202578\n20081011|Springer Nature|LINQ for Visual C# 2008|Fabio Claudio Ferracchiati|9781430215813\n20120201|Springer Nature|Programming Reactive Extensions and LINQ|Jesse Liberty; Paul Betts|9781430237488\n||Complete Practical Linq Tutorial In C#|Ilya Fofanov|9781800201255\n2008-12-06|Packt Publishing|WCF Multi-tier Services Development with LINQ|Mike Liu|9781847196620\n2008|John Wiley & Sons|Migrating To Linq To Sql In Thebeerhouse And Asp.net 2.0 Website Programming Problem Design Solution|Doug Parsons|9780470375013\n2010|Wiley, John & Sons, Incorporated|Linqifying Thebeerhouse: An N-tier Linq Web Application With Asp.net 2.0 Website Programming: Problem - Design - Solution|Lee Dumond|9781118035528" }, "linux-kernel-module": { "title": "Linux Kernel Module", "appeared": 1996, "type": "application", "description": "As of Linux kernel version 2.6, KO files are used in place of .O files and contain additional information that the kernel uses to load modules. The Linux program modpost can be used to convert O files into KO files.", "reference": [ "https://www.tldp.org/LDP/lkmpg/2.6/lkmpg.pdf" ], "fileExtensions": [ "ko" ], "country": [ "United States" ], "originCommunity": [ "Linux Kernel Organization, Inc" ], "example": [ "/*\n * hello−1.c − The simplest kernel module.\n */\n#include /* Needed by all modules */\n#include /* Needed for KERN_INFO */\nint init_module(void)\n{\n printk(KERN_INFO \"Hello world 1.\\n\");\n /*\n * A non 0 return means init_module failed; module can't be loaded.\n */\n return 0;\n}\nvoid cleanup_module(void)\n{\n printk(KERN_INFO \"Goodbye world 1.\\n\");\n}", "fs/mbcache.ko\nfs/mbcache.o" ], "githubLanguage": { "fileExtensions": [ "mod" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "none", "id": "Linux Kernel Module" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "linux": { "title": "Linux", "appeared": 1991, "type": "os", "country": [ "United States" ], "originCommunity": [ "Linux Kernel Organization, Inc" ], "releaseNotesUrl": "https://www.kernel.org/", "versions": { "1991": [ "0.01" ], "1994": [ "1.0.0" ], "1996": [ "2.0.0" ], "1999": [ "2.2.0" ], "2001": [ "2.4.0" ], "2003": [ "2.6.0" ], "2011": [ "3.0.0" ], "2015": [ "4.0.0" ], "2019": [ "5.0.0" ], "2022": [ "6.0.0" ] }, "wikipedia": { "related": [ "c", "assembly-language", "arc-isa", "arm", "hexagon", "mips", "nios", "powerpc", "risc-v", "sparc", "x86-isa", "android", "unix", "freebsd", "makefile", "ftp", "qt", "elf", "ada", "go", "fortran", "php", "perl", "java", "rust", "haskell", "llvmir", "basic", "visual-basic", "gambas", "freebasic", "quickbasic", "qb64", "sed", "grep", "emacs-lisp", "csharp", "vala", "scheme", "eclipse-editor", "vim-editor", "nano-editor", "emacs-editor", "mariadb", "mysql", "python", "ios", "opengl", "lisp" ], "summary": "Linux ( ( listen) LIN-əks) is a family of free and open-source software operating systems built around the Linux kernel. Typically, Linux is packaged in a form known as a Linux distribution (or distro for short) for both desktop and server use. The defining component of a Linux distribution is the Linux kernel, an operating system kernel first released on September 17, 1991, by Linus Torvalds. Many Linux distributions use the word \"Linux\" in their name. The Free Software Foundation uses the name GNU/Linux to refer to the operating system family, as well as specific distributions, to emphasize that most Linux distributions are not just the Linux kernel, and that they have in common not only the kernel, but also numerous utilities and libraries, a large proportion of which are from the GNU project. This has led to some controversy.Linux was originally developed for personal computers based on the Intel x86 architecture, but has since been ported to more platforms than any other operating system. Because of the dominance of the Linux kernel-based Android OS on smartphones, Linux has the largest installed base of all general-purpose operating systems. Linux is also the leading operating system on servers and other big iron systems such as mainframe computers, and the only OS used on TOP500 supercomputers (since November 2017, having before gradually eliminated all competitors). It is used by around 2.3% of desktop computers. The Chromebook, which runs the Linux kernel-based Chrome OS, dominates the US K–12 education market and represents nearly 20% of the sub-$300 notebook sales in the US. Linux also runs on embedded systems, i.e. devices whose operating system is typically built into the firmware and is highly tailored to the system. This includes TiVo and similar DVR devices, network routers, facility automation controls, televisions, video game consoles and smartwatches. Many smartphones and tablet computers run Android and other Linux derivatives.The development of Linux is one of the most prominent examples of free and open-source software collaboration. The underlying source code may be used, modified and distributed—commercially or non-commercially—by anyone under the terms of its respective licenses, such as the GNU General Public License. Some of the most popular and mainstream Linux distributions are Arch Linux, CentOS, Debian, Raspbian, Fedora, Gentoo Linux, Linux Mint, Mageia, openSUSE and Ubuntu, together with commercial distributions such as Red Hat Enterprise Linux and SUSE Linux Enterprise Server. Distributions include the Linux kernel, supporting utilities and libraries, many of which are provided by the GNU Project, and usually a large amount of application software to fulfil the distribution's intended use. Desktop Linux distributions include a windowing system, such as X11, Mir or a Wayland implementation, and an accompanying desktop environment such as GNOME or KDE Plasma; some distributions may also include a less resource-intensive desktop, such as LXDE or Xfce. Distributions intended to run on servers may omit all graphical environments from the standard install, and instead include other software to set up and operate a solution stack such as LAMP. Because Linux is freely redistributable, anyone may create a distribution for any intended use.", "dailyPageViews": 5655, "pageId": 6097297, "created": 2001, "backlinksCount": 17688, "revisionCount": 13108, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Linux" }, "linkedInSkill": { "2018": 3200714, "id": "linux" }, "subreddit": [ { "url": "https://www.reddit.com/r/kernel/" }, { "url": "https://www.reddit.com/r/linux/" } ], "meetup": { "memberCount": 979264, "groupCount": 2235, "url": "https://www.meetup.com/topics/linux" }, "fileType": "na", "wordRank": 882, "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Linux Programming Interface: A Linux and Unix System Programming Handbook|2010|Michael Kerrisk|10286833|4.59|403|25\nBeginning Linux Programming|1996|Neil Matthew|463869|3.76|131|8" }, "liquid": { "title": "Liquid", "appeared": 2008, "type": "template", "creators": [ "Tobias Lütke" ], "website": "https://shopify.github.io/liquid/", "documentation": [ "https://shopify.dev/api/liquid" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/Shopify" ], "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "githubRepo": { "firstCommit": 2008, "stars": 9596, "forks": 1257, "subscribers": 726, "created": 2008, "updated": 2022, "description": "Liquid markup language. Safe, customer facing template language for flexible web apps. ", "issues": 274, "url": "https://github.com/Shopify/liquid" }, "repoStats": { "firstCommit": 2008, "commits": 2366, "committers": 218, "files": 184 }, "githubLanguage": { "fileExtensions": [ "liquid" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nShopify Timber https://github.com/Shopify.png https://github.com/Shopify/Timber Liquid #ccc 871 352 6 \"The ultimate Shopify theme framework, built by Shopify.\"", "trendingProjectsCount": 2, "type": "markup", "aceMode": "liquid", "tmScope": "text.html.liquid", "repos": 11459, "id": "Liquid" }, "githubBigQuery": { "repos": 1018, "users": 947, "id": "Liquid" }, "monaco": "liquid", "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "liquid" ], "id": "liquid" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2015, "committerCount": 2, "commitCount": 2, "sampleCount": 2, "example": [ "

We have wonderful products!

\n
    \n
    \n
    \n {% for image in product.images %}\n {% if forloop.first %}\n \n \"{{product.title\n \n {% else %}\n \n \"{{product.title\n \n {% endif %}\n {% endfor %}\n
    \n\n

    {{ product.title }}

    \n\n
      \n
    • Vendor: {{ product.vendor | link_to_vendor }}
      • \n
    • Type: {{ product.type | link_to_type }}
      • \n
    \n\n {{ product.price_min | money }}{% if product.price_varies %} - {{ product.price_max | money }}{% endif %}\n\n
    \n
    \n\n \n\n
    \n\n
    \n
    \n
    \n\n
    \n {{ product.description }}\n
    \n
    \n\n \n
" ], "url": "https://github.com/bastilian/validcode-textmate-bundles" }, "indeedJobs": { "2022": 325, "query": "liquid engineer" }, "fileType": "text", "wordRank": 3533, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1998|Premier Pr|Create Web Animations With Microsoft Liquid Motion In A Weekend|Steven E. Callihan|9780761518228\n20100603|Ingram Publisher Services UK- Academic|High-Temperature Liquid Chromatography|Thorsten Teutenberg|9781849731096", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2008|Liquid Metal: Object-Oriented Programming Across the Hardware/Software Boundary|10.1007/978-3-540-70592-5_5|105|8|Shan Shan Huang and Amir Hormati and D. Bacon and R. Rabbah|1eaa543205c3fc0cb4685f2c7e8a631fa7776a74\n2009|A retention-time-shift-tolerant background subtraction and noise reduction algorithm (BgS-NoRA) for extraction of drug metabolites in liquid chromatography/mass spectrometry data from biological matrices.|10.1002/rcm.4041|65|1|P. Zhu and Wei Ding and W. Tong and A. Ghosal and K. Alton and S. Chowdhury|4d45be9b7542e9be2fc8460e9995cc79a2b94867\n1979|Simultaneous Multiwavelength Detection System for Liquid Chromatography|10.1093/CHROMSCI/17.4.225|26|0|L. Klatt|8d0d958c0655c5dbe8f219a8fa869f4773836d0c\n2000|Gibbs energy minimization in gas + liquid + solid systems|10.1002/(SICI)1096-987X(200003)21:4<247::AID-JCC1>3.0.CO;2-J|21|0|D. Ebel and M. Ghiorso and R. Sack and L. Grossman|b2e10a89654f9586ca3f24ed55a2399cd1a69ada\n2002|SCORES-II Design Tool for Liquid Rocket Engine Analysis|10.2514/6.2002-3990|17|0|J. Bradford and A. Crocker|a6895309bef561696b4aa659904cb916e5966fce\n2013|Seismic Response of Elevated Liquid Storage Tanks Using Double Concave Friction Pendulum Bearings with Tri-Linear Behavior|10.1260/1369-4332.16.2.315|9|0|M. Rabiei and F. Khoshnoudian|76e334b2f2fac58c0ff146b2d16f51ad63810821\n2011|Simulation, design and practical implementation of IMC tuned digital PID controller for liquid level control system|10.1109/NUICONE.2011.6153308|7|0|Sandip A. Mehta and Jatin Katrodiya and Bhargav Mankad|9e65fcce6a08a0dcd3bf6c3d1e166f5a26bf8786\n2010|Dynamic response of the U-tube liquid manometer with equal diameter columns|10.1088/1755-1315/12/1/012114|6|0|D. Zahariea|18bb53f207414631ee717ee0b62fd091f2d65b21\n2019|Performance of A Convolutional Neural Network in Screening Liquid Based Cervical Cytology Smears|10.4103/JOC.JOC_201_18|5|0|Parikshit Sanyal and Sanghita Barui and P. Deb and Harish Chander Sharma|b17feb9d51fb3740ed492f5edad6879bdb9a07eb\n2013|The Liquid Metal Blokus Duo Design|10.1109/FPT.2013.6718425|3|0|E. Altman and J. Auerbach and D. Bacon and Ioana Baldini and P. Cheng and Stephen J. Fink and R. Rabbah|113e0d3c608d8c04d411fd2b7bc8785467105efa\n2014|Design of Fuzzy Control System for Tank Liquid Level Based on WinCC and Matlab|10.1109/DCABES.2014.15|3|0|Zhu Jianjun|15daa30031da4aab3c0a9f4fc772ecfd514cb2eb\n2012|Research on three-dimensional modeling of liquid storage tank|10.1109/GIWRM.2012.6349618|1|0|Jin Han and Jing Wei and Zhi-hua Zhang and Xiaoyuan Dong|ad6ccaf0205c321802bfa645357c49346c11e406\n2015|Development of Simulator for LNG Carrier Liquid Cargo Handling|10.2991/CISIA-15.2015.223|1|0|J. Cao and X. K. Zhang and Q. He|ba32c26616468eb9235cce441281fbae15e8c751\n2017|AUTOMATIC LIQUID FILLING USING PROGRAMMABLE LOGIC CONTROLLER(PLC)|10.24128/IJRAER.2017.NO01ab|1|0|Vinod Jiddi|6ddde4bb612e0ec96413b4837c91d947a9e9fa6d\n2018|Simulation of Liquid Vapor Equilibrium in Batch Distillation Process from Cellulose (Bamboo)|10.11594/nstp.2018.0117|1|0|Sari Ni Ketut and D. Ernawati|124ebfbcc14bf6d5974a6d14fcc52336e8591b1f" }, "liquidity": { "title": "liquidity", "appeared": 2017, "type": "pl", "website": "http://www.liquidity-lang.org", "country": [ "France" ], "originCommunity": [ "OCamlProSAS" ], "domainName": { "registered": 2017, "awisRank": { "2022": 11967064 }, "name": "liquidity-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n15848561|Liquidity: high-level typed smart-contract language for Tezos|http://www.liquidity-lang.org/|2017-12-04 23:34:54 UTC|1512430494|petethomas|0|2", "isbndb": "" }, "lis": { "title": "Langage Implementation Systeme", "appeared": 1980, "type": "pl", "standsFor": "Langage Implementation Systeme", "country": [ "France" ], "originCommunity": [ "Groupe Bull" ], "wikipedia": { "related": [ "ada" ], "summary": "LIS (Language d'Implementation de Systèmes) was a system implementation programming language designed by Jean Ichbiah, who later designed Ada. LIS was used to implement the compiler for the Ada-0 subset of Ada at Karlsruhe on the BS2000 Siemens operating system. Later on the Karlsruhe Ada compilation system got rewritten in Ada-0 itself, which was easy, because LIS and Ada-0 are very close.", "pageId": 12073324, "created": 2007, "backlinksCount": 9, "revisionCount": 23, "dailyPageViews": 10, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/LIS_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=618", "fileType": "text", "centralPackageRepositoryCount": 0 }, "lisaac": { "title": "Lisaac", "appeared": 2003, "type": "pl", "website": "https://lisaac.org/", "reference": [ "https://en.bmstu.wiki/Lisaac" ], "country": [ "France" ], "originCommunity": [ "https://web.archive.org/web/20071111235238/http://isaacproject.u-strasbg.fr/community.html" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ ".print" ] ], "leachim6": { "filepath": "l/Lisaac.li", "fileExtensions": [ "li" ], "example": [ "// Hello World in Lisaac\n\nSection Header\n\t+ name\t\t:= HELLO_WORLD;\n\nSection Inherit\n\n\t- parent_object:OBJECT := OBJECT;\n\nSection Public\n\n\t- main <-\n\t(\n\t\t\"Hello World !\\n\".print;\n\t);\n" ], "id": "Lisaac" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lisaac", "rijuRepl": { "example": [ "Section Header\n + name := MAIN;\n\nSection Public\n - main <-\n (\n \"Hello, world!\\n\".print;\n );\n" ], "id": "https://riju.codes/lisaac" }, "centralPackageRepositoryCount": 0 }, "liseb": { "title": "LiSEB", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/31ccdcc8e9d4e4837298a321c255ad0f36b3ade7" ], "country": [ "Italy" ], "originCommunity": [ "Centre for Theoretical Medicine Studies University of Rome", "University of Milan" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2161", "centralPackageRepositoryCount": 0 }, "liso": { "title": "Liso", "appeared": 2014, "type": "dataNotation", "creators": [ "Olivier Breuleux" ], "description": "Implemention of O-Expressions idea in Racket.", "website": "http://breuleux.net/blog/liso.html", "reference": [ "http://breuleux.net/blog/oexprs.html" ], "aka": [ "o-expressions" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/breuleux/liso/issues" ], "compilesTo": [ "s-expressions" ], "writtenIn": [ "racket" ], "example": [ "@varsrec\n odd?[n] =\n @if n == 0:\n #f\n even?[n - 1]\n even?[n] =\n @if n == 0:\n #t\n odd?[n - 1]:\n even?[30]" ] }, "lisp-1-5": { "title": "LISP 1.5", "appeared": 1959, "type": "pl", "description": "The first version of LispLanguage to become popular.", "reference": [ "http://www.softwarepreservation.org/projects/LISP/book/LISP%201.5%20Programmers%20Manual.pdf" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/breuleux/liso/issues" ], "example": [ "cons (a (b c d))" ], "hopl": "https://hopl.info/showlanguage.prx?exp=31" }, "lisp-2": { "title": "LISP 2", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7a578a2bbf9a8d14a246ac8e6f46ee49b9a7dae7" ], "country": [ "United States" ], "originCommunity": [ "System Development Corporation and Information International, Inc" ], "wikipedia": { "related": [ "lisp", "algol" ], "summary": "For Lisp-2, Lisp systems with separate function namespaces, see Lisp-1 vs. Lisp-2LISP 2 was a programming language proposed in the 1960s as the successor to Lisp. It had largely Lisp-like semantics and Algol 60-like syntax. Today it is mostly remembered for its syntax, but in fact it had many features beyond those of early Lisps. Early Lisps had many limitations, including limited data types and slow numerics. Its use of fully parenthesized notation was also considered a problem. The inventor of Lisp, John McCarthy, expected these issues to be addressed in a later version, called notionally Lisp 2. Hence the name Lisp 1.5 for the successor to the earliest Lisp.Lisp 2 was a joint project of the System Development Corporation and Information International, Inc., and was intended for the IBM built AN/FSQ-32 military computer. Development later shifted to the IBM 360/67 and the Digital Equipment Corporation PDP-6. The project was eventually abandoned.", "backlinksCount": 16, "pageId": 13388339, "dailyPageViews": 8, "created": 2007, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/LISP_2" }, "hopl": "https://hopl.info/showlanguage.prx?exp=264", "centralPackageRepositoryCount": 0 }, "lisp-a": { "title": "LISP A", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5d8307589ab853e2e380acc1a228c50fbfd954dc" ], "country": [ "Sweden" ], "originCommunity": [ "Uppsala University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=330", "centralPackageRepositoryCount": 0 }, "lisp-machine-lisp": { "title": "Lisp Machine Lisp", "appeared": 1974, "type": "pl", "creators": [ "David A. Moon", "Richard Stallman", "Daniel Weinreb" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology", "Symbolics, Inc", "Lisp Machines, Inc", "Texas Instruments Incorporated" ], "wikipedia": { "related": [ "lisp", "interlisp", "common-lisp", "flavors" ], "summary": "Lisp Machine Lisp is a programming language, a dialect of the language Lisp. A direct descendant of Maclisp, it was initially developed in the mid to late 1970s as the system programming language for the Massachusetts Institute of Technology (MIT) Lisp machines. Lisp Machine Lisp was also the Lisp dialect with the most influence on the design of Common Lisp. Lisp Machine Lisp branched into three dialects. Symbolics named their variant ZetaLisp. Lisp Machines, Inc. and later Texas Instruments (with the TI Explorer) would share a common code base, but their dialect of Lisp Machine Lisp would differ from the version maintained at the MIT AI Lab by Richard Stallman and others.", "created": 2002, "backlinksCount": 74, "pageId": 47775, "revisionCount": 45, "dailyPageViews": 21, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/Lisp_Machine_Lisp" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "lisp": { "title": "Lisp", "appeared": 1958, "type": "pl", "creators": [ "John McCarthy" ], "documentation": [ "https://common-lisp.net/documentation" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "isLisp": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasHomoiconicity": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "PRINT" ] ], "wikipedia": { "example": [ "(defun -reverse (list)\n (let ((return-value '()))\n (dolist (e list) (push e return-value))\n return-value))" ], "related": [ "arc", "autolisp", "clojure", "common-lisp", "emacs-lisp", "eulisp", "interlisp", "islisp", "lfe", "newlisp", "portable-standard-lisp", "racket", "rpl", "scheme", "cadence-skill", "spice-lisp", "t", "information-processing-language", "clips", "clu", "cowsel", "dylan", "elixir", "falcon", "forth", "haskell", "io", "ioke", "javascript", "julia", "logo", "lua", "ml", "nim", "nu", "ops5", "perl", "pop-2", "pop-11", "python", "r", "ruby", "scala", "swift", "smalltalk", "tcl", "wolfram", "fortran", "s-expressions", "lisp-machine-lisp", "openlisp", "picolisp", "lisp-2", "multics", "acl2", "jvm", "yarv", "emacs-editor", "autocad-app", "lilypond", "algol", "flavors", "c", "xml" ], "summary": "Lisp (historically, LISP) is a family of computer programming languages with a long history and a distinctive, fully parenthesized prefix notation. Originally specified in 1958, Lisp is the second-oldest high-level programming language in widespread use today. Only Fortran is older, by one year. Lisp has changed since its early days, and many dialects have existed over its history. Today, the best known general-purpose Lisp dialects are Common Lisp and Scheme. Lisp was originally created as a practical mathematical notation for computer programs, influenced by the notation of Alonzo Church's lambda calculus. It quickly became the favored programming language for artificial intelligence (AI) research. As one of the earliest programming languages, Lisp pioneered many ideas in computer science, including tree data structures, automatic storage management, dynamic typing, conditionals, higher-order functions, recursion, the self-hosting compiler, and the read–eval–print loop. The name LISP derives from \"LISt Processor\". Linked lists are one of Lisp's major data structures, and Lisp source code is made of lists. Thus, Lisp programs can manipulate source code as a data structure, giving rise to the macro systems that allow programmers to create new syntax or new domain-specific languages embedded in Lisp. The interchangeability of code and data gives Lisp its instantly recognizable syntax. All program code is written as s-expressions, or parenthesized lists. A function call or syntactic form is written as a list with the function or operator's name first, and the arguments following; for instance, a function f that takes three arguments would be called as (f arg1 arg2 arg3).", "pageId": 18016, "dailyPageViews": 1517, "created": 2001, "backlinksCount": 1344, "revisionCount": 2307, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/Lisp_(programming_language)" }, "projectEuler": { "memberCount": { "2019": 1276, "2022": 1372 }, "id": "LISP" }, "leachim6": { "filepath": "l/Lisp.lsp", "fileExtensions": [ "lsp" ], "example": [ "; LISP\n(DEFUN hello ()\n (PRINT (LIST 'HELLO 'WORLD))\n)\n\n(hello)\n" ], "id": "Lisp" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lisp", "indeedJobs": { "2017": 112, "query": "lisp engineer" }, "linkedInSkill": { "2018": 19133, "id": "lisp" }, "stackOverflowSurvey": { "2021": { "users": 1096, "medianSalary": 75669, "fans": 1513, "percentageUsing": 0.01 } }, "subreddit": [ { "memberCount": { "2017": 12216, "2022": 34743 }, "url": "https://reddit.com/r/lisp" } ], "meetup": { "memberCount": 92994, "groupCount": 232, "url": "https://www.meetup.com/topics/lisp" }, "conference": [ "https://www.european-lisp-symposium.org The European Lisp Symposium" ], "tiobe": { "currentRank": 38, "id": "Lisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=14", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCommon LISP: The Language|1984|Guy L. Steele Jr.|1529534|4.28|78|3\nAn Introduction to Programming in Emacs Lisp||Robert J. Chassell|1162587|3.45|40|4\nParadigms of Artificial Intelligence Programming: Case Studies in Common LISP|1991|Peter Norvig|80981|4.33|439|9\nLISP Lore: A Guide to Programming the LISP Machine|1986|Hank Bromley|3724482|4.00|5|0\nLISP 1.5 Programmer's Manual|1962|John McCarthy|4019912|4.43|28|2\nLisp, Lore, and Logic: An Algebraic View of LISP Programming, Foundations, and Applications|1990|W. Richard Stark|812519|3.50|4|0", "isbndb": "year|publisher|title|authors|isbn13\n1995|Pearson|ANSI Common LISP|Graham, Paul|9780133708752\n1991|Morgan Kaufmann|Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp|Norvig, Peter|9781558601918\n1989|Springer|The Art of LISP Programming|Jones, Robin|9780387195681\n2012|O'Reilly Media|Clojure Programming: Practical Lisp for the Java World|Emerick, Chas and Carper, Brian and Grand, Christophe|9781449394707\n2004|Free Software Foundation|An Introduction to Programming in Emacs Lisp|Chassell, Robert J.|9781882114566\n1984|Assn For Computing Machinery|Acm Symposium On Lisp And Functional Programming, 1984|No Author|9780897911429\n1992|Assn For Computing Machinery|Acm Conference On Lisp And Functional Programming, 1992|Association For Computing Machinery|9780897914819\n2001|CMP|The AutoCADET's Guide to Visual LISP|Kramer, Bill|9781578200894\n2021|Apress|Programming Algorithms in Lisp: Writing Efficient Programs with Examples in ANSI Common Lisp|Domkin, Vsevolod|9781484264270\n2020|Apress|The Common Lisp Condition System: Beyond Exception Handling with Control Flow Mechanisms|\"Herda, Michał \"\"phoe\"\"\"|9781484261330\n2006|Lulu.com|Sketchy Lisp|Nils M Holm|9781411674486\n20160101|Springer Nature|Common Lisp Recipes|Edmund Weitz|9781484211762\n2012|Lulu.com|Let Over Lambda: 50 Years Of Lisp|Doug Hoyte|9781257130733\n2008|Free Software Foundation|An Introduction to Programming in Emacs Lisp|Robert J. Chassell|9781882114023\n2019|Pearson|Lisp (3rd Edition)|Winston, Patrick and Horn, Berthold|9780201083194\n1990-02-20T00:00:01Z|Springer|LISP, Lore, and Logic: An Algebraic View of LISP Programming, Foundations, and Applications|Stark, W. Richard|9780387970721\n1985|Wiley|Programming in Common LISP|Brooks, Rodney A.|9780471818885\n1995|W H Freeman & Co|The Elements of Artificial Intelligence Using Common Lisp|Tanimoto, Steven L.|9780716782698\n1984|Addison-Wesley|LISP|Winston, Patrick Henry|9780201083729\n2012|Apress|Practical Common Lisp (Expert's Voice in Programming Languages)|Seibel, Peter|9781430242901\n2020|Apress|The Common Lisp Condition System: Beyond Exception Handling with Control Flow Mechanisms|\"Michał \"\"phoe\"\" Herda\"|9781484261347\n2014|Morgan Kaufmann|Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp|Norvig, Peter|9780080571157\n1990|Springer|LISP, Lore, and Logic: An Algebraic View of LISP Programming, Foundations, and Applications|Stark, W. Richard|9780683300055\n2012|Springer|LISP Lore: A Guide to Programming the LISP Machine|Bromley, H. and Lamson, Richard|9780898382280\n1989-08-01T00:00:01Z|Addison-Wesley|Common Lisp Programming for Artificial Intelligence (International Computer Science Series)|Hasemer, Tony and Domingue, John|9780201175790\n1991-02-01T00:00:01Z|McGraw-Hill College|Programming Paradigms in Lisp (McGraw-Hill series in artificial intelligence)|Sangal, Rajeev|9780070546660\n2001-12-01T00:00:01Z|Free Software Foundation|An Introduction to Programming in Emacs Lisp|Chassell, Robert J.|9781882114436\n1987|Prentice Hall|The t Programming Language: A Dialect of Lisp|Stephen Slade|9780138819057\n1989|Springer|The Art of Lisp Programming|Jones, Robin and Maynard, Clive and Stewart, Ian|9783540195689\n2015|Springer|A Practical Introduction to Fuzzy Logic using LISP (Studies in Fuzziness and Soft Computing Book 327)|Argüelles Mendez, Luis|9783319231860\n2012|Springer|Computer Algebra with LISP and REDUCE: An Introduction to Computer-aided Pure Mathematics (Mathematics and Its Applications, 72)|Brackx, F. and Constales, D.|9789401055499\n1982T|Association for Computing Machinery|Conference Record of the 1982 ACM Symposium on LISP and Functional Programming||9780897910828\n2021|unknown|Lisp programming (Korean edition)||9788979148756\n2017|CreateSpace Independent Publishing Platform|Lisp (programming language): First Look|Blokdyk, Gerard|9781979912426\n2018|CreateSpace Independent Publishing Platform|Lisp (programming language): First Look|Blokdyk, Gerardus|9781983817557\n1991|De Gruyter|Software-Konstruktion mit LISP (Programmierung Komplexer Systeme / Programming Complex Syste)|Belli, Fevzi|9783110117868\n2020|Independently published|\"Lisp Programming Notebook: Notebook for Computer Programmers & Developers | Programming Languages: A Notebook for Computer Programmers and developers 6x9 inches with 120 White pages\"|Languages, Programming|9781656246073\n||Lisp Programming Language Family: Lisp, Logo, Autolisp, Common Lisp, Emacs Lisp, Dylan, Lisp Machine Lisp, Maclisp|Books and LLC|9781156778203\n1989|Delmar Pub|Lisp Programming|Bergwall Productions Inc|9780806411798\n2012|Springer Science & Business Media|Common Lisp Modules|Mark Watson|9781461231868\n||Lisp Programming Language: Lisp, Symbolics, Lisp Machine, Common Lisp, S-expression, Kent Pitman, Bill Schelter, Gerald Jay Sussman, Cdr Coding|Books and LLC|9781156778197\n20061101|Springer Nature|Practical Common Lisp|Peter Seibel|9781430200178\n2011|Springer|Lisp Lore: A Guide To Programming The Lisp Machine|H. Bromley|9781461291893\n2013-01-16|Springer|Lisp Lore: A Guide To Programming The Lisp Machine|H. Bromley|9781475756708\n20020509|Taylor & Francis|Advanced LISP Technology|B. Thagesen|9780203300879\n1984|Newnes Technical Books|LISP for micros|Oakey, Steve.|9780408014427\n20101015|Random House Publishing Services|Land of Lisp|Conrad Barski|9781593273491\n||An Introduction To Lisp|Peter Smith|9780862381875\n20210128|Springer Nature|Programming Algorithms in Lisp|Vsevolod Domkin|9781484264287\n20031204|Cambridge University Press|Lisp in Small Pieces|Christian Queinnec|9781139632485\n1983|Alfred Waller Ltd|Lisp Programming (computer Science Texts)|I. Danicic|9780632011810\n2012|Springer Science & Business Media|The Art Of Lisp Programming|Robin Jones and Clive Maynard and Ian Stewart|9781447117193\n2007|Goodheart-willcox Pub|Visual Lisp Programming: Principles And Techniques|Rod R. Rawls and Mark A. Hagen and Paul F. Richard|9781590708101\n2007|Goodheart-willcox Pub|Visual Lisp Programming: Principles And Techniques|Rod R. Rawls and Mark Hagen and Paul Richard|9781590708118\n2011||Articles On Lisp Programming Language, Including|Hephaestus Books|9781243305664\n1988|Wiley|An Introduction To Programming In Lisp|H. Wertz|9780471914907\n20141014|Emereo|LISP 246 Success Secrets - 246 Most Asked Questions On LISP - What You Need To Know|Edward Carver|9781488806179\n1994|Assn For Computing Machinery|Acm Conference On Lisp & Functional Programming 1994|Association for Computing Machinery|9780897916431\n2011||Articles On Lisp Programming Language Family, Including|Hephaestus Books|9781243316851\n2018|Emereo|Lisp (programming language) Complete Self-Assessment Guide|Gerardus Blokdyk|9780655127703\n1986|The Mit Press|Performance And Evaluation Of Lisp Systems (computer Systems Series)|Richard P. Gabriel|9780262571937\n1990|Natl Technical Information|Lisp Programming Language Artificial Intelligence Applications: March 1988-1990||9789993982715\n|Morgan Kaufman Publishers|Paradigms Of Artificial Intelligence Programming: Case Studies In Common Lisp|Norvig, Peter.|\n1991|Morgan Kaufmann Pub|Paradigms Of Artificial Intelligence Programming Case Studies In Common Lisp|Peter Norvig|9781558602304\n1986|Assn For Computing Machinery|Proceedings Of The 1986 Acm Conference On Lisp And Functional Programming|the Association for Computing Machinery and SIGPLAN and SIGACT and SIGART|9780897912006\n1989|Mit Pr|The Paralation Model Architecture Independent Parallel Programming †Lisp S/w Macintosh|Gary W. Sabot|9780262691284\n1990|New York : ACM Press, c1990.|Proceedings of the 1990 ACM Conference on LISP and Functional Programming|the Association for Computing Machinery and SIGPLAN and SIGACT and SIGART in cooperation with SIGSAM|9780897913683\n|New York, N.Y. : ACM Press, c1988.|Proceedings of the 1988 ACM Conference on Lisp and Functional Programming|the Association for Computing Machinery and SIGPLAN and SIGACT and SIGART|9780897912730\n1995|Springer|Vlisp A Verified Implementation Of Scheme: A Special Issue Of Lisp And Symbolic Computation, An International Journal Vol. 8, Nos. 1 & 2 March 1995|Guttman, Joshua D. and Wand, Mitchell.|9780792395669", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1977|Prolog - the language and its implementation compared with Lisp|10.1145/800228.806939|157|6|D. Warren and L. Pereira and Fernando C Pereira|57f796c1bb843b65ba45c42aa00c1068c529eae0\n1985|From Problems to Programs via Plans: The Content and Structure of Knowledge for Introductory LISP Programming|10.2190/WK8C-BYCF-VQ5C-E307|95|3|E. Soloway|3396bf7e5b877fe9bd921045021523dca0cbf224\n1989|A Parallel Lisp Language PaiLisp and Its Kernel Specification|10.1007/BFb0024150|38|0|Takayasu Ito and M. Matsui|cb80e839c67a7a28f1cc087daf8175f259fbfce7\n1899|The LISP 2 programming language and system|10.1145/1464291.1464362|32|1|P. Abrahams and J. Barnett and E. Book and Donna Firth and S. L. Kameny and C. Weissman and L. Hawkinson and Michael I. Levin and Robert A. Saunders|85827cf800d963c44edee1c79d9431cf46fdeef8\n1988|A graphical programming language interface for an intelligent LISP tutor|10.1145/57167.57173|29|3|B. Reiser and P. Friedmann and J. Gevins and D. Kimberg and M. Ranney|dbaac20183c16da10c00740c604f8bcc6323e2c6\n2019|Milestones from the Pure Lisp theorem prover to ACL2|10.1007/s00165-019-00490-3|16|1|J. S. Moore|9608e7fb5b37c9208fe8af63e10e83e029a23405\n1993|Analogies in an Intelligent Programming Environment for Learning LISP|10.1007/978-3-662-11334-9_19|12|0|G. Weber|a59e807afd0c3f61defdb7db0cd5741a3f8bb6ba\n1987|Book Review: The T Programming Language: A Dialect of Lisp by Stephen Slade, Prentice Hall, Inc. 1987|10.1145/35596.885636|12|0|Erik Urdang|5a945c97779914efddd223bc0d050a091dbe1273\n1994|Can Tracing Tools Contribute to Programming Proficiency? The LISP Evaluation Modeler|10.1080/1049482940040104|11|0|L. Mann and M. Linn and M. Clancy|ba96d0ab5f02616d5483975f3563ba0dd185143a\n2002|A Formal Pattern Language for Refactoring of Lisp Programs|10.1109/CSMR.2002.995803|9|0|A. Leitão|20a22ae8a26cb87ecf67b45c4839e0c987549e05\n2002|A formal pattern language for refactoring of Lisp programs|10.1109/CSMR.2002.995803|8|0|A.M. Leitdo|084719ac3394878b29380eb0e617babb4282d345\n1985|From lisp machine to language lab|10.3758/BF03200950|7|0|Hank Bromley and R. Jarvella and I. Lundberg|8034e045a43a4fe2d99633bfebd6ed526fedbc2d\n1997|Methodologies for teaching new programming languages: a case study teaching LISP|10.1145/299359.299373|7|0|A. Nicholson and K. M. Fraser|03dc300364b2809e0e0e8b719158a85debf67bf1\n2020|Evolution of Emacs Lisp|10.1145/3386324|5|1|Stefan Monnier and Michael Sperber|02529e1f4bdb2ed31b5437a5375f34e9b6023711\n2013|Lisping Copyleft: A Close Reading of the Lisp LGPL|10.5033/IFOSSLR.V5I1.75|4|0|E. Greenbaum|339b555a9d6164b7add5d88116475ff4b06c0c63\n1989|A language-only course in LISP with PC scheme|10.1145/65293.71220|3|0|K. Lambert|32d210767fbf267cf60b8273401c8e212fa42d9b\n1990|LISP as a second language: Functional aspects|10.2307/833351|3|0|P. Desain|dcb84f01de141a94db41c155b4bd970b5d6ba741\n2001|Programming at the end of the learning curve: Lisp scripting for image processing|10.1109/HCC.2001.995268|3|0|S. Tanimoto and Jeremy W. Baer|dbb19cacc908da52797ce699cd017d4f868e556b\n1987|A small lisp interpreter as a project in a programming language course|10.1145/36093.36097|3|0|T. McMillan|53efa86d2103a87349b6bfaed88abefea6ba6dce\n1990|An effective Lisp project for a programming languages course|10.1145/122153.122162|2|0|M. Meredith|bf94bffb48b0385e2241230a6630959834937843\n1988|The symbolic programming environment (SPE#8482;): a common Lisp development environment for Sun workstations|10.1145/1317250.1317251|2|0|Aaron Endelman and Steve Gadol|82d2f163fac3edf79be3c552332085532ab89518\n2017|The LISP 2 Project|10.1353/ahc.2017.0033|2|0|P. McJones|2542b5e02a37c4a14ce1274877cbefac495098e3\n2008|Programming in Lisp|10.1002/9780470316818.CH3|2|0|L. Tierney|59b941c01b3b90799f25915750195e2002a7c092\n1990|LISP, Lore, and Logic: An Algebraic View of LISP Programming, Foundations, and Applications|10.5860/choice.28-0344|2|0|W. R. Stark|519c91b4125277c48fe6108cea5c73fc9e4fcd8f\n1980|An Algorithm for Translating Lisp Programs into Reduction Language Programs|10.1007/3-540-09981-6_14|1|0|Alexis Koster|4b4930dac0835b0b396274c1ac1321560b807845" }, "lispme": { "title": "LispMe", "appeared": 2008, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/LispMe" ], "country": [ "Germany" ], "originCommunity": [ "http://www.lispme.de/lispme/index_en.html" ], "wikipedia": { "summary": "LispMe is an interpreter for the Scheme programming language developed by Fred Bayer for Palm OS PDAs. It is free software released under the GNU General Public License. It is reasonably close to standard Scheme but is not fully R5RS compliant. Scheme source programs can be stored in Palm OS memopad format while Scheme sessions, are stored in Palm OS PDB database files and can be interrupted and restarted. There is some support for Palm OS user interface primitives. LispMe also provides some database support. LispMe sessions can be given a \"starter icon\", which appears in the Applications menu, enabling the session to be run as a Palm Pilot application. The product ended development in August 2008, but is fairly complete and quite robust.", "backlinksCount": 4, "pageId": 1392960, "dailyPageViews": 3, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/LispMe" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3617", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "lisptalk": { "title": "Lisptalk", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/826c9c2c74251426de0eddf4869f299dae6cff69" ], "country": [ "China" ], "originCommunity": [ "Institute of Computing Technology Academia Sinica" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1408", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "lispworks": { "title": "LispWorks", "appeared": 1989, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Harlequin Ltd.", "Xanalys Ltd.", "LispWorks Ltd" ], "visualParadigm": false, "wikipedia": { "dailyPageViews": 20, "url": "https://en.wikipedia.org/wiki/LispWorks" }, "centralPackageRepositoryCount": 0 }, "lispyscript": { "title": "lispyscript", "appeared": 2012, "type": "pl", "creators": [ "Santosh Rajan" ], "description": "A javascript With Lispy Syntax And Macros!", "website": "http://lispyscript.com", "reference": [ "http://web.archive.org/web/20180123072250/http://lispyscript.com/" ], "country": [ "India" ], "originCommunity": [ "https://github.com/santoshrajan/lispyscript/issues" ], "domainName": { "registered": 2021, "name": "lispyscript.com" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ ";; test with and without the \"./\"\n;;(var k (require \"square.ls\"))\n;;(var k (require \"./square.ls\"))\n;; or test .ls files requiring .js files:\n;;(var k (require \"square.js\"))\n;;(var k (require \"./square.js\"))\n;; or test omitting .ls extensions:\n(var k (require \"square\"))\n;;(var k (require \"./square\"))\n(console.log (k 10))" ], "githubRepo": { "firstCommit": 2012, "stars": 565, "forks": 63, "subscribers": 38, "created": 2012, "updated": 2022, "description": "A javascript with Lispy syntax and macros", "issues": 18, "url": "https://github.com/santoshrajan/lispyscript" }, "repoStats": { "firstCommit": 2012, "commits": 271, "committers": 7, "files": 439 } }, "listdown": { "title": "listdown", "appeared": 2017, "type": "textMarkup", "githubRepo": { "url": "https://github.com/nkkollaw/listdown" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n15038282|Show HN: Listdown–A simple markup language for lists|2017-08-17 16:36:09 UTC|1502987769|nkkollaw|0|2" }, "lite-c": { "title": "Lite-C", "appeared": 2007, "type": "pl", "website": "http://www.3dgamestudio.de/litec.php", "country": [ "Germany" ], "originCommunity": [ "Conitec Datensysteme GmbH" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "void main()\n{\n level_load(\"\"); // open an empty level. you can use NULL instead of \"\"\n ENTITY* sphere = ent_create(\"sphere.mdl\",vector(0,0,0),NULL); // create sphere model at position (0,0,0)\n while(1) {\n sphere->pan += 1; // rotate the sphere with 1 degree per frame\n wait(1); // wait one frame\n }\n}" ], "related": [ "c", "opengl" ], "summary": "Lite-C is a programming language for multimedia applications and personal computer games, using a syntax subset of the C language with some elements of the C++ language. Its main difference to C is the native implementation of multimedia and computer game related objects like sounds, images, movies, GUI elements, 2D and 3D models, collision detection and rigid body physics. Lite-C executables are compiled instead of interpreted. Lite-C runs on 32-bit and 64-bit Windows XP or Vista operating systems. Lite-C claims to allow very fast programming with a minimum of code, and easy access to non-programmers. For this, the developer provides a 25-lesson workshop that especially deals with the game and multimedia related objects of the language. Lite-C supports the Windows API and the Component Object Model (COM); therefore OpenGL and DirectX programs can directly be written in lite-C. It has integrated the free A8 rendering engine.", "pageId": 10780425, "created": 2007, "backlinksCount": 7, "revisionCount": 46, "dailyPageViews": 13, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Lite-C" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "literate-agda": { "title": "Literate Agda", "appeared": 2009, "type": "pl", "reference": [ "https://link.springer.com/chapter/10.1007/978-3-642-04652-0_5" ], "country": [ "Sweden" ], "originCommunity": [ "Chalmers University" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "example": [ "\\documentclass{article}\n\n % The following packages are needed because unicode\n % is translated (using the next set of packages) to\n % latex commands. You may need more packages if you\n % use more unicode characters:\n\n \\usepackage{amssymb}\n \\usepackage{bbm}\n \\usepackage[greek,english]{babel}\n\n % This handles the translation of unicode to latex:\n\n \\usepackage{ucs}\n \\usepackage[utf8x]{inputenc}\n \\usepackage{autofe}\n\n % Some characters that are not automatically defined\n % (you figure out by the latex compilation errors you get),\n % and you need to define:\n\n \\DeclareUnicodeCharacter{8988}{\\ensuremath{\\ulcorner}}\n \\DeclareUnicodeCharacter{8989}{\\ensuremath{\\urcorner}}\n \\DeclareUnicodeCharacter{8803}{\\ensuremath{\\overline{\\equiv}}}\n\n % Add more as you need them (shouldn’t happen often).\n\n % Using “\\newenvironment” to redefine verbatim to\n % be called “code” doesn’t always work properly. \n % You can more reliably use:\n\n \\usepackage{fancyvrb}\n\n \\DefineVerbatimEnvironment\n {code}{Verbatim}\n {} % Add fancy options here if you like.\n\n \\begin{document}\n\n \\begin{code}\nmodule NatCat where\n\nopen import Relation.Binary.PropositionalEquality\n\n-- If you can show that a relation only ever has one inhabitant\n-- you get the category laws for free\nmodule\n EasyCategory\n (obj : Set)\n (_⟶_ : obj → obj → Set)\n (_∘_ : ∀ {x y z} → x ⟶ y → y ⟶ z → x ⟶ z)\n (id : ∀ x → x ⟶ x)\n (single-inhabitant : (x y : obj) (r s : x ⟶ y) → r ≡ s)\n where\n\n idʳ : ∀ x y (r : x ⟶ y) → r ∘ id y ≡ r\n idʳ x y r = single-inhabitant x y (r ∘ id y) r \n\n idˡ : ∀ x y (r : x ⟶ y) → id x ∘ r ≡ r\n idˡ x y r = single-inhabitant x y (id x ∘ r) r\n\n ∘-assoc : ∀ w x y z (r : w ⟶ x) (s : x ⟶ y) (t : y ⟶ z) → (r ∘ s) ∘ t ≡ r ∘ (s ∘ t)\n ∘-assoc w x y z r s t = single-inhabitant w z ((r ∘ s) ∘ t) (r ∘ (s ∘ t))\n\nopen import Data.Nat\n\nsame : (x y : ℕ) (r s : x ≤ y) → r ≡ s\nsame .0 y z≤n z≤n = refl\nsame .(suc m) .(suc n) (s≤s {m} {n} r) (s≤s s) = cong s≤s (same m n r s)\n\n≤-trans : ∀ x y z → x ≤ y → y ≤ z → x ≤ z\n≤-trans .0 y z z≤n s = z≤n\n≤-trans .(suc m) .(suc n) .(suc n₁) (s≤s {m} {n} r) (s≤s {.n} {n₁} s) = s≤s (≤-trans m n n₁ r s)\n\n≤-refl : ∀ x → x ≤ x\n≤-refl zero = z≤n\n≤-refl (suc x) = s≤s (≤-refl x)\n\nmodule Nat-EasyCategory = EasyCategory ℕ _≤_ (λ {x}{y}{z} → ≤-trans x y z) ≤-refl same\n \\end{code}\n\n \\end{document}" ], "githubLanguage": { "fileExtensions": [ "lagda" ], "trendingProjectsCount": 0, "type": "programming", "group": "Agda", "aceMode": "text", "tmScope": "none", "repos": 1840, "id": "Literate Agda" }, "pygmentsHighlighter": { "filename": "haskell.py", "fileExtensions": [ "lagda" ], "id": "Literate Agda" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "literate-coffeescript": { "title": "Literate CoffeeScript", "appeared": 2013, "type": "pl", "creators": [ "Jeremy Ashkenas" ], "description": "Besides being used as an ordinary programming language, CoffeeScript may also be written in “literate” mode. If you name your file with a .litcoffee extension, you can write it as a Markdown document — a document that also happens to be executable CoffeeScript code. The compiler will treat any indented blocks (Markdown’s way of indicating source code) as executable code, and ignore the rest as comments. Code blocks must also be separated from comments by at least one blank line.", "website": "https://coffeescript.org/#literate", "reference": [ "https://news.ycombinator.com/item?id=5277916" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/jashkenas/coffeescript/issues" ], "domainName": { "registered": 2009, "awisRank": { "2022": 383033 }, "name": "coffeescript.org" }, "hasSemanticIndentation": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2009, "stars": 16246, "forks": 2029, "subscribers": 521, "created": 2009, "updated": 2022, "description": "Unfancy JavaScript", "issues": 75, "url": "https://github.com/jashkenas/coffeescript" }, "repoStats": { "firstCommit": 2009, "commits": 5201, "committers": 276, "files": 458 }, "githubLanguage": { "fileExtensions": [ "litcoffee", "coffeemd" ], "trendingProjectsCount": 0, "type": "programming", "group": "CoffeeScript", "aceMode": "text", "tmScope": "source.litcoffee", "wrap": true, "aliases": [ "litcoffee" ], "repos": 7938, "id": "Literate CoffeeScript" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 30, "commitCount": 332, "sampleCount": 1, "example": [ "The **Scope** class regulates lexical scoping within CoffeeScript. As you\ngenerate code, you create a tree of scopes in the same shape as the nested\nfunction bodies. Each scope knows about the variables declared within it,\nand has a reference to its parent enclosing scope. In this way, we know which\nvariables are new and need to be declared with `var`, and which are shared\nwith external scopes.\n\nImport the helpers we plan to use.\n\n {extend, last} = require './helpers'\n\n exports.Scope = class Scope\n\nThe `root` is the top-level **Scope** object for a given file.\n\n @root: null\n\nInitialize a scope with its parent, for lookups up the chain,\nas well as a reference to the **Block** node it belongs to, which is\nwhere it should declare its variables, and a reference to the function that\nit belongs to.\n\n constructor: (@parent, @expressions, @method) ->\n @variables = [{name: 'arguments', type: 'arguments'}]\n @positions = {}\n Scope.root = this unless @parent\n\nAdds a new variable or overrides an existing one.\n\n add: (name, type, immediate) ->\n return @parent.add name, type, immediate if @shared and not immediate\n if Object::hasOwnProperty.call @positions, name\n @variables[@positions[name]].type = type\n else\n @positions[name] = @variables.push({name, type}) - 1\n\nWhen `super` is called, we need to find the name of the current method we're\nin, so that we know how to invoke the same method of the parent class. This\ncan get complicated if super is being called from an inner function.\n`namedMethod` will walk up the scope tree until it either finds the first\nfunction object that has a name filled in, or bottoms out.\n\n namedMethod: ->\n return @method if @method.name or !@parent\n @parent.namedMethod()\n\nLook up a variable name in lexical scope, and declare it if it does not\nalready exist.\n\n find: (name) ->\n return yes if @check name\n @add name, 'var'\n no\n\nReserve a variable name as originating from a function parameter for this\nscope. No `var` required for internal references.\n\n parameter: (name) ->\n return if @shared and @parent.check name, yes\n @add name, 'param'\n\nJust check to see if a variable has already been declared, without reserving,\nwalks up to the root scope.\n\n check: (name) ->\n !!(@type(name) or @parent?.check(name))\n\nGenerate a temporary variable name at the given index.\n\n temporary: (name, index) ->\n if name.length > 1\n '_' + name + if index > 1 then index - 1 else ''\n else\n '_' + (index + parseInt name, 36).toString(36).replace /\\d/g, 'a'\n\nGets the type of a variable.\n\n type: (name) ->\n return v.type for v in @variables when v.name is name\n null\n\nIf we need to store an intermediate result, find an available name for a\ncompiler-generated variable. `_var`, `_var2`, and so on...\n\n freeVariable: (name, reserve=true) ->\n index = 0\n index++ while @check((temp = @temporary name, index))\n @add temp, 'var', yes if reserve\n temp\n\nEnsure that an assignment is made at the top of this scope\n(or at the top-level scope, if requested).\n\n assign: (name, value) ->\n @add name, {value, assigned: yes}, yes\n @hasAssignments = yes\n\nDoes this scope have any declared variables?\n\n hasDeclarations: ->\n !!@declaredVariables().length\n\nReturn the list of variables first declared in this scope.\n\n declaredVariables: ->\n realVars = []\n tempVars = []\n for v in @variables when v.type is 'var'\n (if v.name.charAt(0) is '_' then tempVars else realVars).push v.name\n realVars.sort().concat tempVars.sort()\n\nReturn the list of assignments that are supposed to be made at the top\nof this scope.\n\n assignedVariables: ->\n \"#{v.name} = #{v.type.value}\" for v in @variables when v.type.assigned" ], "url": "https://github.com/atom/language-coffee-script" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "literate-haskell": { "title": "Literate Haskell", "appeared": 1991, "type": "pl", "description": "Haskell is one of the few languages that provides native features to support literate programming. In haskell, a literate program is one with the suffix .lhs rather than .hs. In a literate Haskell program, there are two ways to distinguish between code and non-code portions. You can either prepend all code with a > , (bird style) or surround lines of code with \\begin{code} and \\end{code} pairs (latex style). For those who know, use and love latex, the latter is the suggested way to go.", "reference": [ "https://www.haskell.org/onlinereport/literate.html" ], "country": [ "United States" ], "originCommunity": [ "https://www.haskell.org/community/" ], "githubLanguage": { "fileExtensions": [ "lhs" ], "trendingProjectsCount": 0, "type": "programming", "group": "Haskell", "aceMode": "text", "codemirrorMode": "haskell-literate", "codemirrorMimeType": "text/x-literate-haskell", "tmScope": "text.tex.latex.haskell", "aliases": [ "lhaskell", "lhs" ], "repos": 64984, "id": "Literate Haskell" }, "pygmentsHighlighter": { "filename": "haskell.py", "fileExtensions": [ "lhs" ], "id": "Literate Haskell" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 13, "commitCount": 463, "url": "https://github.com/atom-haskell/language-haskell" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "litescript": { "title": "LiteScript", "appeared": 2013, "type": "pl", "creators": [ "Lucio M. Tato" ], "website": "https://github.com/luciotato/LiteScript", "country": [ "Argentina" ], "originCommunity": [ "https://github.com/luciotato/LiteScript/issues" ], "compilesTo": [ "javascript" ], "writtenIn": [ "javascript" ], "githubRepo": { "stars": 145, "forks": 7, "subscribers": 12, "created": 2013, "updated": 2020, "description": "Compile-to-js and compile-to-c language, highly readable, keep it simple philosophy", "url": "https://github.com/luciotato/LiteScript" }, "repoStats": { "firstCommit": 2013, "commits": 158, "committers": 7, "files": 770 } }, "lithe": { "title": "Lithe", "appeared": 1982, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "wikipedia": { "example": [ "rule \"|\" \"|\" return int;\n {if i<0 then return -i else return i end}" ], "related": [ "smalltalk" ], "summary": "Lithe is an experimental programming language created in 1982 by David Sandberg at the University of Washington which allows the programmer to freely choose their own syntax. Lithe combines the ideas of syntax-directed translation and classes in a novel manner that results in a remarkably simple yet powerful language.", "pageId": 908572, "created": 2004, "backlinksCount": 5, "revisionCount": 17, "dailyPageViews": 5, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/Lithe_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=998", "fileType": "text", "centralPackageRepositoryCount": 0 }, "little-b": { "title": "Little b", "appeared": 2004, "type": "pl", "creators": [ "Aneil Mallavarapu" ], "website": "http://www.littleb.org/", "country": [ "United States" ], "originCommunity": [ "Harvard Medical School" ], "domainName": { "registered": 2021, "name": "littleb.org" }, "wikipedia": { "related": [ "linux", "lisp", "b", "c", "smalltalk" ], "summary": "Little b is a domain-specific programming language, more specifically, a modeling language, designed to build modular mathematical models of biological systems. It was designed and authored by Aneil Mallavarapu. Little b is being developed in the Virtual Cell Program at Harvard Medical School, headed by mathematician Jeremy Gunawardena. This language is based on Lisp and is meant to allow modular programming to model biological systems. It will allow more flexibility to facilitate rapid change that is required to accurately capture complex biological systems. The language draws on techniques from artificial intelligence and symbolic mathematics, and provides syntactic conveniences derived from object-oriented languages. The language was originally denoted with a lowercase b (distinguishing it from B, the predecessor to the widely used C programming language, but the name was eventually changed to \"little b\" to avoid confusion and to pay homage to Smalltalk, the first object-oriented programming language.", "pageId": 4740151, "created": 2006, "backlinksCount": 9, "revisionCount": 46, "dailyPageViews": 7, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Little_b_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "little-smalltalk": { "title": "Little Smalltalk", "appeared": 1987, "type": "pl", "reference": [ "https://rmod-files.lille.inria.fr/FreeBooks/LittleSmalltalk/ALittleSmalltalk.pdf", "https://semanticscholar.org/paper/dc7fbc7bb9673deed0e34479e9d480e2f1a72ac5" ], "country": [ "United States" ], "originCommunity": [ "Oregon State University" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Little_Smalltalk" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1336", "centralPackageRepositoryCount": 0 }, "little": { "title": "little", "appeared": 2016, "type": "pl", "creators": [ "Larry McVoy" ], "website": "http://www.little-lang.org", "country": [ "United States" ], "originCommunity": [ "https://www.little-lang.org/community.html" ], "domainName": { "registered": 2016, "name": "little-lang.org" }, "githubRepo": { "firstCommit": 2016, "stars": 216, "forks": 16, "subscribers": 10, "created": 2016, "updated": 2022, "description": "The Little Programming Language", "issues": 9, "url": "https://github.com/bitkeeper-scm/little-lang" }, "repoStats": { "firstCommit": 2016, "commits": 30, "committers": 11, "files": 18 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n11530097|Little: a tcl-based c-like scripting language|http://www.little-lang.org/index.html|2016-04-19 20:31:53 UTC|1461097913|cisstrd|57|101" }, "livecode": { "title": "LiveCode", "appeared": 2001, "type": "pl", "website": "https://livecode.org/", "oldName": "revolution", "country": [ "Scotland" ], "originCommunity": [ "LiveCode Ltd" ], "domainName": { "registered": 2012, "awisRank": { "2017": 2641722, "2022": 9510664 }, "name": "livecode.org" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "answer" ] ], "wikipedia": { "example": [ "put url \"binfile:picture.jpg\" into url \"ftp://john:passwd@ftp.example.net:2121/picture.jpg\"" ], "related": [ "linux", "android", "ios", "hypertalk", "hypercard", "sql" ], "summary": "LiveCode (formerly Revolution and MetaCard) is a cross-platform rapid application development runtime environment inspired by HyperCard. It features the Transcript (formerly MetaTalk) programming language which belongs to the family of xTalk scripting languages like HyperCard's HyperTalk. The environment was introduced in 2001. The \"Revolution\" development system was based on the MetaCard engine technology which Runtime Revolution later acquired from MetaCard Corporation in 2003. The platform won the Macworld Annual Editor's Choice Award for \"Best Development Software\" in 2004. \"Revolution\" was renamed \"LiveCode\" in the fall of 2010. \"LiveCode\" is developed and sold by Runtime Revolution Ltd., based in Edinburgh, Scotland. In March, 2015, the company was renamed \"LiveCode Ltd.\", to unify the company name with the product. In April 2013 a free/open source version 'LiveCode Community Edition 6.0' was published after a successful crowdfunding campaign at Kickstarter. The code base was re-licensed and made available as free and open source software with a version in April 2013. LiveCode runs on iOS, Android, OS X, Windows 95 through Windows 10, Raspberry Pi and several variations of Unix, including Linux, Solaris, and BSD. It can be used for mobile, desktop and server/CGI applications. The iOS (iPhone and iPad) version was released in December 2010. The first version to deploy to the Web was released in 2009. It is the most widely used HyperCard/HyperTalk clone, and the only one that runs on all major operating systems. A developer release of v.8 was announced in New York on March 12, 2015. This major enhancement to the product includes a new, separate development language, known as \"LiveCode Builder\", which is capable of creating new object classes called \"widgets\". In earlier versions, the set of object classes was fixed, and could only be enhanced via the use of ordinary procedural languages like C. The new language, which runs in its own IDE, is a departure from the transitional x-talk paradigm in that it permits typing of variables. But the two environments are fully integrated, and apart from the ability to create new objects, development in LiveCode proceeds in the normal way, within the established IDE. A second crowdfunding campaign to Bring HTML5 to LiveCode reached funding goals of nearly $400,000 USD on July 31, 2014. LiveCode developer release 8.0 DP4 (August 31, 2015) was the first to include a standalone deployment option to HTML5.", "pageId": 30890362, "dailyPageViews": 60, "created": 2003, "backlinksCount": 55, "revisionCount": 303, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/LiveCode" }, "projectEuler": { "memberCount": { "2022": 1 }, "id": "LiveCode" }, "helloWorldCollection": [ "-- Hello world in LiveCode (formerly called Revolution, formerly called Transcript)\n\nanswer \"Hello World!\"" ], "leachim6": { "filepath": "l/LiveCode", "example": [ "answer \"Hello World!\" \n" ], "id": "LiveCode" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LiveCode", "tiobe": { "id": "LiveCode" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Livecode for the Real Beginner||Mark Schonewille|52807550|3.00|1|1\nLiveCode Lite: Computer Programming Made Ridiculously Simple||Stephen Goldberg|55375098|3.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n2013|Economy-x-talk|Programming Livecode For The Real Beginner|Mark Schonewille|9789082074109\n2014|Packt Publishing|LiveCode Mobile Development Cookbook|Lavieri, Dr Edward|9781783558827\n2013|Packt Publishing|LiveCode Mobile Development Hotshot|Edward D. Lavieri Jr.|9781849697484\n2012|Packt Publishing|LiveCode Mobile Development Beginner's Guide|Holgate Colin|9781849692489\n2013-10-24|Packt Publishing|LiveCode Mobile Development HOTSHOT|Edward D Lavieri Jr.|9781849697491\n20120726|Packt Publishing|LiveCode Mobile Development Beginner's Guide|Colin Holgate|9781849692496\n20150529|Packt Publishing|LiveCode Mobile Development: Beginner's Guide - Second Edition|Colin Holgate; Joel Gerdeen|9781849699662", "semanticScholar": "" }, "livescript": { "title": "LiveScript", "appeared": 2011, "type": "pl", "creators": [ "Jeremy Ashkenas", "Satoshi Murakami", "George Zahariev" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/gkz/LiveScript/issues" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "# [0-9]+\\.[0-9]+([eE][0-9]+)?[fd]?(?:[a-zA-Z_]+)?", "value": true }, "hasIntegers": { "example": "# [0-9]+(~[0-9a-z]+)?(?:[a-zA-Z_]+)?", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "console.log" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "javascript", "haskell", "coffeescript", "f-sharp", "elixir" ], "summary": "LiveScript is a functional programming language that compiles to JavaScript. It was created by Jeremy Ashkenas—the creator of CoffeeScript—along with Satoshi Muramaki, George Zahariev, and many others. For a brief period in the 1990s, LiveScript was the name of JavaScript.", "pageId": 17731, "created": 2001, "backlinksCount": 27, "revisionCount": 53, "dailyPageViews": 35, "appeared": 2011, "fileExtensions": [ "ls" ], "url": "https://en.wikipedia.org/wiki/LiveScript_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ls", "_ls" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "Slakefile" ], "aceMode": "livescript", "codemirrorMode": "livescript", "codemirrorMimeType": "text/x-livescript", "tmScope": "source.livescript", "aliases": [ "live-script", "ls" ], "repos": 1905, "id": "LiveScript" }, "githubBigQuery": { "repos": 2273, "users": 1780, "id": "LiveScript" }, "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "ls" ], "id": "LiveScript" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2017, "committerCount": 40, "commitCount": 263, "sampleCount": 1, "example": [ "a = -> 1\nconst b = --> 2\nvar c = ~> 3\nd = ~~> 10_000_000km * 500ms\ne = (a) -> (b) ~> (c) --> (d, e) ~~> 5\ndashes-identifiers = ->\n a - a\n b -- c\n 1-1 1- -1\n a- a\n a -a\nunderscores_i$d = ->\n/regexp1/ and //regexp2//g\n'strings' and \"strings\" and \\strings\n([2 til 10] or [1 to 50])\n |> map (* 2)\n |> filter (> 5)\n |> fold (+)\n\nclass Class extends Anc-est-or\n (args) ->\n\ncopy = (from, to, callback) -->\n error, data <- read file\n return callback error if error?\n error <~ write file, data\n return callback error if error?\n callback()\n\n->\n~>\n~~>\n-->\n# Comment\n/* Comment */\n" ], "url": "https://github.com/paulmillr/LiveScript.tmbundle" }, "leachim6": { "filepath": "l/LiveScript.ls", "fileExtensions": [ "ls" ], "example": [ "console.log \"Hello World\"\n" ], "id": "LiveScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LiveScript", "rijuRepl": { "example": [ "console.log \"Hello, world!\"\n" ], "id": "https://riju.codes/livescript" }, "jupyterKernel": [ "https://github.com/p2edwards/jp-livescript" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "livr": { "title": "Livr", "appeared": 2012, "type": "dataValidationLanguage", "creators": [ "Viktor Turskyi" ], "website": "https://livr-spec.org/", "webRepl": [ "http://webbylab.github.io/livr-playground/" ], "standsFor": "Language Independent Validation Rules", "country": [ "United States" ], "originCommunity": [ "https://github.com/koorchik/LIVR/issues" ], "domainName": { "registered": 2013, "name": "livr-spec.org" }, "example": [ "{\n name: 'required',\n phone: {max_length: 10},\n address: {nested_object: {\n city: 'required',\n zip: ['required', 'positive_integer']\n }}\n}" ], "githubRepo": { "firstCommit": 2012, "stars": 277, "forks": 20, "subscribers": 16, "created": 2012, "updated": 2022, "description": "Language Independent Validation Rules Specification", "issues": 21, "url": "https://github.com/koorchik/LIVR" }, "repoStats": { "firstCommit": 2012, "commits": 251, "committers": 15, "files": 264 }, "semanticScholar": "" }, "lkif": { "title": "Legal Knowledge Interchange Format", "appeared": 2007, "type": "xmlFormat", "reference": [ "http://www.estrellaproject.org/?page_id=5" ], "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/RinkeHoekstra/lkif-core/issues" ], "wikipedia": { "summary": "The Legal Knowledge Interchange Format (LKIF) was developed in the European ESTRELLA project and was designed with the goal of becoming a standard for representing and interchanging policy, legislation and cases, including their justificatory arguments, in the legal domain. LKIF builds on and uses the Web Ontology Language (OWL) for representing concepts and includes a reusable basic ontology of legal concepts. The core of LKIF consists of a combination of OWL-DL and SWRL.LKIF was designed with two main roles in mind: the translation of legal knowledge bases written in different representation formats and formalisms and to be a knowledge representation formalism which could be part of larger architectures for developing legal knowledge systems.", "backlinksCount": 2, "pageId": 59057215, "dailyPageViews": -1, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Legal_Knowledge_Interchange_Format" } }, "llhd": { "title": "llhd", "appeared": 2016, "type": "hardwareDescriptionLanguage", "website": "http://llhd.io/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/envhl5/llhd_low_level_hardware_description/" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://grosser.science/" ], "domainName": { "registered": 2016, "name": "llhd.io" }, "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "example": [ "proc %Accumulator.always_comb.227.0 (i1$ %0, i16$ %1, i16$ %2) -> (i16$ %3) {\n%4:\n br %body\n%body:\n %direction = prb i1$ %0\n br %direction, %if_false, %if_true\n%check:\n wait %body, %0, %1, %2\n%if_true:\n %result = prb i16$ %2\n %increment = prb i16$ %1\n %5 = add i16 %result, %increment\n %6 = const time 0s 1e\n drv i16$ %3, %5, %6\n wait %7 for %6\n%if_false:\n %result1 = prb i16$ %2\n %increment1 = prb i16$ %1\n %8 = sub i16 %result1, %increment1\n %9 = const time 0s 1e\n drv i16$ %3, %8, %9\n wait %10 for %9\n%if_exit:\n br %check\n%7:\n br %if_exit\n%10:\n br %if_exit\n}\nproc %Accumulator.always_ff.228.0 (i1$ %0, i16$ %1) -> (i16$ %2) {\n%3:\n br %init\n%init:\n %clk = prb i1$ %0\n wait %check, %0\n%check:\n %clk1 = prb i1$ %0\n %4 = const i1 0\n %5 = eq i1 %clk, %4\n %6 = neq i1 %clk1, %4\n %posedge = and i1 %5, %6\n br %posedge, %init, %event\n%event:\n %next = prb i16$ %1\n %7 = const time 0s 1d\n drv i16$ %2, %next, %7\n br %3\n}\nentity @Accumulator (i1$ %clk, i1$ %direction, i16$ %increment) -> (i16$ %result) {\n %0 = const i16 0\n %next = sig i16 %0\n inst %Accumulator.always_comb.227.0 (i1$ %direction, i16$ %increment, i16$ %result) -> (i16$ %next)\n inst %Accumulator.always_ff.228.0 (i1$ %clk, i16$ %next) -> (i16$ %result)\n}" ] }, "lll": { "title": "Low Level Lisp", "appeared": 2014, "type": "pl", "description": "LLL is one of the original Ethereum smart contract programming languages and provides a different perspective and programming discipline when compared to the ubiquitous Solidity language. Lisp Like Language (LLL) is a low level language similar to Assembly. It is meant to be very simple and minimalistic; essentially just a tiny wrapper over coding in EVM directly.", "reference": [ "https://lll-docs.readthedocs.io/en/latest/lll_introduction.html" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/benjaminion/LLL_docs/issues" ] }, "lllpg": { "title": "lllpg", "appeared": 2012, "type": "library", "creators": [ "David Piepgrass" ], "description": "LLLPG is a recursive-decent LL(k) parser generator for C# that generates efficient code and integrates with Visual Studio.", "website": "http://ecsharp.net/lllpg/", "country": [ "Canada" ], "originCommunity": [ "https://github.com/qwertie/ecsharp/issues" ], "influencedBy": [ "antlr" ] }, "llvmir": { "title": "LLVM IR", "appeared": 2003, "type": "ir", "website": "http://llvm.org/docs/LangRef.html", "documentation": [ "https://llvm.org/docs/LangRef.html" ], "aka": [ "llvm" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/llvm" ], "releaseNotesUrl": "https://releases.llvm.org/14.0.0/docs/ReleaseNotes.html", "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "@.str = internal constant [14 x i8] c\"hello, world\\0A\\00\"\n\ndeclare i32 @printf(i8*, ...)\n\ndefine i32 @main(i32 %argc, i8** %argv) nounwind {\nentry:\n %tmp1 = getelementptr [14 x i8], [14 x i8]* @.str, i32 0, i32 0\n %tmp2 = call i32 (i8*, ...) @printf( i8* %tmp1 ) nounwind\n ret i32 0\n}" ], "related": [ "c", "actionscript", "ada", "csharp", "common-lisp", "crystal", "d", "delphi", "fortran", "glsl", "haskell", "java-bytecode", "julia", "lua", "objective-c", "python", "r", "ruby", "rust", "cuda", "scala", "swift", "xojo", "ios", "assembly-language", "java", "opengl", "cil", "standard-ml", "arm", "hexagon", "mips", "ptx", "powerpc", "sparc", "x86-isa", "elf", "c--", "pure", "opencl", "isbn" ], "summary": "The LLVM compiler infrastructure project is a \"collection of modular and reusable compiler and toolchain technologies\" used to develop compiler front ends and back ends. LLVM is written in C++ and is designed for compile-time, link-time, run-time, and \"idle-time\" optimization of programs written in arbitrary programming languages. Originally implemented for C and C++, the language-agnostic design of LLVM has since spawned a wide variety of front ends: languages with compilers that use LLVM include ActionScript, Ada, C#, Common Lisp, Crystal, D, Delphi, Fortran, OpenGL Shading Language, Halide, Haskell, Java bytecode, Julia, Lua, Objective-C, Pony, Python, R, Ruby, Rust, CUDA, Scala, Swift, and Xojo. The LLVM project started in 2000 at the University of Illinois at Urbana–Champaign, under the direction of Vikram Adve and Chris Lattner. LLVM was originally developed as a research infrastructure to investigate dynamic compilation techniques for static and dynamic programming languages. LLVM was released under the University of Illinois/NCSA Open Source License, a permissive free software licence. In 2005, Apple Inc. hired Lattner and formed a team to work on the LLVM system for various uses within Apple's development systems. LLVM is an integral part of Apple's latest development tools for macOS and iOS. Since 2013, Sony has been using LLVM's primary front end Clang compiler in the software development kit (SDK) of its PS4 console. The name LLVM was originally an initialism for Low Level Virtual Machine. This initialism has offically been removed to avoid confusion, as the LLVM has evolved into an umbrella project that has little relationship to what most current developers think of as virtual machines. Now, LLVM is a brand that applies to the LLVM umbrella project, the LLVM intermediate representation (IR), the LLVM debugger, the LLVM C++ Standard Library (with full support of C++11 and C++14), etc. LLVM is administered by the LLVM Foundation. Its president is compiler engineer Tanya Lattner. The Association for Computing Machinery presented Adve, Lattner, and Evan Cheng with the 2012 ACM Software System Award for LLVM.", "pageId": 654611, "dailyPageViews": 693, "created": 2004, "backlinksCount": 252, "revisionCount": 692, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/LLVM" }, "githubLanguage": { "fileExtensions": [ "ll" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nllvm-mirror llvm https://github.com/llvm-mirror.png https://github.com/llvm-mirror/llvm LLVM #185619 4073 1911 87 \"Mirror of official llvm git repository located at http://llvm.org/git/llvm. Updated every five minutes.\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "tmScope": "source.llvm", "repos": 1351, "id": "LLVM" }, "githubBigQuery": { "repos": 1345, "users": 1263, "id": "LLVM" }, "pygmentsHighlighter": { "filename": "asm.py", "fileExtensions": [ "ll" ], "id": "LLVM" }, "leachim6": { "filepath": "l/LLVM.ll", "fileExtensions": [ "ll" ], "example": [ "target datalayout = \"e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128\"\n@.str = internal constant [12 x i8] c\"Hello World\\00\"\n\n; puts from libc\ndeclare i32 @puts(i8*)\n\ndefine i32 @main(...) {\n\tcall i32 @puts(i8* getelementptr([12 x i8]* @.str, i32 0, i32 0))\n\tret i32 0\n}\n" ], "id": "LLVM" }, "quineRelay": "LLVM asm", "compilerExplorer": { "example": [ "define i32 @square(i32) local_unnamed_addr #0 {\n %2 = mul nsw i32 %0, %0\n ret i32 %2\n}\n" ], "id": "LLVM IR" }, "rijuRepl": { "example": [ "@.str = private unnamed_addr constant [13 x i8] c\"Hello, world!\"\n\ndeclare i32 @puts(i8* nocapture) nounwind\n\ndefine i32 @main() {\n %cast210 = getelementptr [13 x i8],[13 x i8]* @.str, i64 0, i64 0\n call i32 @puts(i8* %cast210)\n ret i32 0\n}\n" ], "id": "https://riju.codes/llvm" }, "tryItOnline": "llvm", "linkedInSkill": { "2018": 2326, "id": "llvm" }, "officialBlogUrl": [ "https://blog.llvm.org/tags/llvm-ir/" ], "eventsPageUrl": [ "https://discourse.llvm.org/t/llvm-community-events-calendar/63237" ], "faqPageUrl": [ "https://llvm.org/docs/FAQ.html" ], "downloadPageUrl": [ "https://releases.llvm.org/download.html" ], "ubuntuPackage": "llvm", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "lmdb": { "title": "lmdb", "appeared": 2011, "type": "library", "creators": [ "Howard Chu" ], "description": "LMDB is a Btree-based database management library modeled loosely on the BerkeleyDB API, but much simplified. The entire database is exposed in a memory map, and all data fetches return data directly from the mapped memory, so no malloc's or memcpy's occur during data fetches. As such, the library is extremely simple because it requires no page caching layer of its own, and it is extremely high performance and memory-efficient. It is also fully transactional with full ACID semantics, and when the memory map is read-only, the database integrity cannot be corrupted by stray pointer writes from application code.", "website": "http://www.openldap.org/software/repo.html", "reference": [ "http://www.lmdb.tech/doc/group__mdb.html" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/LMDB" ], "githubRepo": { "firstCommit": 2011, "stars": 2100, "forks": 528, "subscribers": 156, "created": 2015, "updated": 2022, "description": "Read-only mirror of official repo on openldap.org. Issues and pull requests here are ignored. Use OpenLDAP ITS for issues.", "issues": 0, "url": "https://github.com/LMDB/lmdb" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "lnf": { "title": "LNF", "appeared": 1985, "type": "pl", "reference": [ "http://foldoc.org/LNF", "https://dl.acm.org/doi/abs/10.5555/912525" ], "country": [ "United States" ], "originCommunity": [ "Syracuse University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1160", "centralPackageRepositoryCount": 0 }, "lo": { "title": "LO", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8c5fc85321833fdc390c6db49ab1a3e3f791f9f8" ], "country": [ "Germany" ], "originCommunity": [ "Experimental and Clinical Research Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1566", "wordRank": 3705, "centralPackageRepositoryCount": 0 }, "lobster": { "title": "lobster", "appeared": 2011, "type": "pl", "creators": [ "Wouter van Oortmerssen" ], "website": "http://strlen.com/lobster/", "country": [ "United States" ], "originCommunity": [ "https://github.com/aardappel/lobster/issues" ], "writtenIn": [ "cpp" ], "githubRepo": { "stars": 1387, "forks": 79, "subscribers": 48, "created": 2013, "updated": 2022, "firstCommit": 2013, "description": "The Lobster Programming Language", "issues": 20, "url": "https://github.com/aardappel/lobster" }, "repoStats": { "firstCommit": 2013, "commits": 1714, "committers": 45, "files": 2006 }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lobster", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "local": { "title": "local", "appeared": 2019, "type": "pl", "description": "LoCal: A Language for Programs Operating on Serialized Data", "reference": [ "http://recurial.com/pldi19main.pdf" ], "country": [ "United States" ], "originCommunity": [ "Indiana University" ] }, "loci": { "title": "loci", "appeared": 2013, "type": "pl", "creators": [ "Stephen Cross" ], "website": "http://loci-lang.org", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/scrossuk/locic/issues" ], "domainName": { "name": "loci-lang.org" }, "githubRepo": { "firstCommit": 2011, "stars": 110, "forks": 5, "subscribers": 6, "created": 2014, "updated": 2022, "description": "Compiler and tools for the Loci programming language.", "issues": 4, "url": "https://github.com/scrossuk/locic" }, "repoStats": { "firstCommit": 2011, "commits": 2888, "committers": 5, "files": 1533 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9075333|Loci: A C++-like systems programming language|http://loci-lang.org|2015-02-19 17:25:51 UTC|1424366751|rayiner|61|109" }, "locomotive-basic": { "title": "Locomotive BASIC", "appeared": 1984, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Locomotive Software" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "mallard-basic", "bbc-basic", "assembly-language", "commodore-basic", "sinclair-basic", "ascii" ], "summary": "Locomotive Basic is a proprietary dialect of the BASIC programming language written by Locomotive Software used only on the Amstrad CPC (where it was built-in on ROM). It was the main ancestor of Mallard BASIC, the interpreter for CP/M supplied with the Amstrad PCW.", "created": 2003, "backlinksCount": 97, "pageId": 327737, "revisionCount": 69, "dailyPageViews": 17, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Locomotive_BASIC" }, "leachim6": { "filepath": "l/Locomotive Basic.b", "example": [ "10 print \"Hello World\"\nrun\n" ], "id": "Locomotive Basic" }, "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "" }, "locs": { "title": "LOCS", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/65538201d8a17bcb973374a2f2c4d9e2287d862a" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7483", "centralPackageRepositoryCount": 0 }, "logal": { "title": "LOGAL", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2358bfa4ea7bdbd390995a43ad20e0385affb23f" ], "country": [ "United States" ], "originCommunity": [ "Sperry Univac" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3984", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "logica": { "title": "Logica", "appeared": 2020, "type": "queryLanguage", "creators": [ "Evgeny Skvortsov" ], "description": "Logica is an open source declarative logic programming language for data manipulation. Logica is a successor to Yedalog, a language created at Google earlier.", "website": "https://logica.dev/", "country": [ "United States" ], "originCommunity": [ "https://github.com/EvgSkv/logica/issues" ], "domainName": { "registered": 2020, "name": "logica.dev" }, "compilesTo": [ "sql" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# Define natural numbers from 1 to 29.\nN(x) :- x in Range(30);\n# Define primes.\nPrime(prime: x) :-\n N(x),\n x > 1,\n ~(\n N(y),\n y > 1,\n y != x,\n Mod(x, y) == 0\n );" ], "githubRepo": { "firstCommit": 2020, "stars": 1440, "forks": 83, "subscribers": 31, "created": 2020, "updated": 2022, "description": "Logica is a logic programming language that compiles to StandardSQL and runs on Google BigQuery.", "issues": 23, "url": "https://github.com/evgskv/logica" }, "repoStats": { "firstCommit": 2020, "commits": 428, "committers": 18, "files": 271 }, "isbndb": "year|publisher|title|authors|isbn13\n2008|Springer|Towards Mathematical Philosophy: Papers from the Studia Logica conference Trends in Logic IV|Tshilidzi Marwala; Monica Lagazio|9781402090844" }, "logicon": { "title": "Logicon", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9f925f796da32e45b2b92b568ed90d08c29aa9fd" ], "country": [ "Canada" ], "originCommunity": [ "Université de Montréal" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2781", "centralPackageRepositoryCount": 0 }, "login": { "title": "LOGIN", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f487a24e7f7329da852d0638a130e00aae08a598" ], "country": [ "United States" ], "originCommunity": [ "Microelectronics and Computer Technology Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1236", "wordRank": 541, "centralPackageRepositoryCount": 0 }, "logist": { "title": "LOGIST", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f8f3dd2ebac7bfbfe835db2871fa53bbfa1b5a9e" ], "country": [ "France" ], "originCommunity": [ "Inserm", "UER Sciences Mathématiques, Nancy" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6678", "centralPackageRepositoryCount": 0 }, "loglan": { "title": "LOGLAN", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/47f155eaa3f41f9f53995976949bec6c61325439" ], "country": [ "Poland" ], "originCommunity": [ "Institute of Informatics" ], "wikipedia": { "summary": "Loglan is a constructed language originally designed for linguistic research, particularly for investigating the Sapir–Whorf Hypothesis. The language was developed beginning in 1955 by Dr James Cooke Brown with the goal of making a language so different from natural languages that people learning it would think in a different way if the hypothesis were true. In 1960 Scientific American published an article introducing the language. Loglan is the first among, and the main inspiration for, the languages known as logical languages, which also includes Lojban. Brown founded The Loglan Institute (TLI) to develop the language and other applications of it. He always considered the language an incomplete research project, and although he released many papers about its design, he continued to claim legal restrictions on its use. Because of this, a group of his followers later formed the Logical Language Group to create the language Lojban along the same principles, but with the intention to make it freely available and encourage its use as a real language. Supporters of Lojban use the term Loglan as a generic term to refer to both their own language, and Brown's Loglan, referred to as \"TLI Loglan\" when in need of disambiguation. Although the non-trademarkability of the term Loglan was eventually upheld by the United States Patent and Trademark Office, many supporters and members of The Loglan Institute find this usage offensive, and reserve Loglan for the TLI version of the language.", "backlinksCount": 236, "pageId": 17922, "dailyPageViews": 699, "created": 2001, "appeared": 1955, "url": "https://en.wikipedia.org/wiki/Loglan" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2180", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\nJanuary 1984|Pa?nstwowe Wydawn Nauk|Report on the Loglan 82 Programming Language|Polska Akademia Nauk and Antoni Mazurkiewicz|9788301053505\n1990|Springer|Loglan '88 - Report On The Programming Language (lecture Notes In Computer Science)|Antoni Kreczmar and Andrzej Salwicki and Marek Warpechowski|9783540523253" }, "loglisp": { "title": "LOGLISP", "appeared": 1980, "type": "pl", "reference": [ "https://aitopics.org/download/classics:4A93472A" ], "country": [ "United States" ], "originCommunity": [ "School of Computer and Information Science" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2703", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "loglo": { "title": "loglo", "appeared": 2020, "type": "pl", "website": "https://loglo.app/", "reference": [ "https://lobste.rs/s/lrj6mh/loglo_spreadsheet_using_stack_language" ], "country": [ "Canada" ], "originCommunity": [ "https://avibryant.com/" ], "domainName": { "registered": 2020, "name": "loglo.app" }, "visualParadigm": true }, "logo": { "title": "Logo", "appeared": 1967, "type": "pl", "documentation": [ "https://el.media.mit.edu/logo-foundation/what_is_logo/logo_programming.html" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "print" ] ], "wikipedia": { "related": [ "starlogo", "netlogo", "smalltalk", "etoys", "scratch", "rebol", "lisp", "trs-80-color-computer", "objectlogo", "acornsoft-logo", "python", "jquery", "squeak" ], "summary": "Logo is an educational programming language, designed in 1967 by Wally Feurzeig, Seymour Papert and Cynthia Solomon. \"Logo\" is not an acronym. It was derived from the Greek logos meaning word or \"thought\" by Feurzeig, to distinguish itself from other programming languages that were primarily numbers, not graphics or logic, oriented. A general-purpose language, Logo is widely known for its use of turtle graphics, in which commands for movement and drawing produced line graphics either on screen or with a small robot called a turtle. The language was conceived to teach concepts of programming related to Lisp and only later to enable what Papert called \"body-syntonic reasoning\", where students could understand, predict and reason about the turtle's motion by imagining what they would do if they were the turtle. There are substantial differences among the many dialects of Logo, and the situation is confused by the regular appearance of turtle-graphics programs that call themselves Logo. Logo is a multi-paradigm adaptation and dialect of Lisp, a functional programming language. There is no standard Logo, but UCBLogo has the best facilities for handling lists, files, I/O, and recursion in scripts, and can be used to teach all computer science concepts, as UC Berkeley lecturer Brian Harvey did in his Computer Science Logo Style trilogy. Logo is usually an interpreted language, although there have been developed compiled Logo dialects (such as Lhogho and Liogo). Logo is not case-sensitive but retains the case used for formatting.", "pageId": 18334, "dailyPageViews": 575, "created": 2001, "backlinksCount": 229, "revisionCount": 1360, "appeared": 1967, "url": "https://en.wikipedia.org/wiki/Logo_(programming_language)" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/logo", "projectEuler": { "memberCount": { "2019": 24, "2022": 23 }, "id": "Logo" }, "helloWorldCollection": [ "; Hello World in Logo\n\nDRUCKEZEILE [Hello World!]\n" ], "leachim6": { "filepath": "l/Logo.lg", "fileExtensions": [ "lg" ], "example": [ "print [Hello World]\n" ], "id": "Logo" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Logo", "tiobe": { "currentRank": 36, "id": "Logo" }, "hopl": "https://hopl.info/showlanguage.prx?exp=291", "fileType": "text", "wordRank": 1154, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1997|The MIT Press|Computer Science Logo Style 2/e, Vol. 1: Symbolic Computing|Harvey, Brian|9780262581486\n1985|Mit Pr|Computer Science Logo Style: Intermediate Programming|Harvey, Brian|9780262580724\n1984|Belmont, Calif. : Wadsworth Pub. Co., c1984.|Apple Logo for teachers|Earl Babbie|9780534033927\n1984|Addison-wesley|Computer Art And Animation: A User's Guide To Commodore 64 Logo|David D Thornburg|9780201065176\n1986|H.w. Sams|Ibm Pc And Pcjr Logo Programming Primer|Donald Martin|9780672223792\n1986|West Publishing|Complete Logo Programming: Terrapin|Steven L. Mandell and Colleen J. Mandell|9780314962355\n20140708|Springer Nature|Einführung in die Programmierung mit LOGO|Juraj Hromkovič|9783658048327\n20120405|Springer Nature|Einführung in die Programmierung mit LOGO|Juraj Hromkovic|9783834822666\n1987|The MIT Press|Exploring Language with Logo (Exploring With Logo)|Goldenberg, E. Paul and Feurzeig, Wallace|9780262570657\n1997|The MIT Press|Computer Science Logo Style 2/e, Vol. 3: Beyond Programming|Harvey, Brian|9780262581509\n1983|Addison-Wesley|Ross Logo Programming|Ross, Peter|9780201146370\n1984T|H.W. Sams|Apple Logo programming primer: Featuring top-down structured programming|Martin, Donald|9780672223426\n1997|The MIT Press|Computer Science Logo Style 2/e - 3 vol. set|Harvey, Brian|9780262581516\n1992|Intl Society for Technology in educ|Logo for the Macintosh: An Introduction Through Object Logo With the Student Edition of Object Logo|Abelson, Harold and Abelson, Amanda|9781882527038\n1985|Harcourt School|Logo Physics|James P. Hurley|9780030029134\n1985|Lectorum Pubns|Programacion En Logo/programming In Logo (spanish Edition)|Joaquin D'opazo Alvarez|9788476140338\n1990|Intl Society For Technology In Educ|Introduction To Programming In Logo Using Logo Plus|Sharon Yoder|9780924667602\n2010||Logo Programming Language Family: Microworlds Jr, Netlogo, Starlogo, Atari Logo|Books and LLC|9781158416721\n1986|West Group|Complete Apple Logo Programming|Mandell and Steven L.;melnyk and Carroll|9780314962348\n1983|Educomp Pubns|Teacher, Kids, And Logo|Carolyn Green|9780961222604\n||The Icon Collection: Logo Book III Thinking and Programming in Logo|John Cameron and Tom Hellsten|9780920911174\n1997|Mit Pr|Computer Science Logo Style: Beyond Programming (computer Science Logo Style , Vol 3)|Brian Harvey|9780026581509\n1991|Routledge|Interactive Problem Solving Using Logo|Heinz-dieter Boecker|9780805803068\n1984|Prentice Hall|A Bit Of Logo Magic|Donna Bearden|9780835904940\n20140522|Taylor & Francis|Interactive Problem Solving Using Logo|Heinz-Dieter Boecker; Hal Eden; Gerhard Fischer|9781134744176\n20100423|Springer Nature|Einführung in die Programmierung mit LOGO|Juraj Hromkovic|9783834896407\n||Logo Programming on the IBM PC|Peter Ross|9780201150285\n1994|International Society For Technology In Education|Introduction To Programming In Logo Using Logowriter|Sharon Yoder|9781564840639\n1988|Intl Society For Technology In Educ|Introduction To Programming In Logo Using Logowriter|Burrowes and Yoder|9780924667473\n||Atari Logo Sourcebook A Programming Language Fo|Atari|9781114314672\n1977|Entelek, Incorporated|The Logo Language: Learning Mathematics Through Programming|George Lukas and Joan Lukas|9780875671055\n2011||Articles On Logo Programming Language Family, Including|Hephaestus Books|9781242966279\n1991|Intl Society for Technology in|Introduction to Programming in Logo Using Logowriter|Sharon Yoder|9781564840004\n1985|Simon & Schuster|Ibm Pcjr: Basic Programming And Applications Including Logo|Louis Nashelsky and Robert Boylestad|9780134482347\n1989|Ces Computech|Computer Applications: Programming With Logo Course Code 394-6|Susan Weinman|9780917531965\n1991|Intl Society For Technology In Educ|Introduction To Programming Using Terrapin Logo For The Macintosh|Sharon Yoder|9780924667848\nAugust 1983|Austin : Sterling Swift Pub. Co., c1983.|Forty easy steps to programming in BASIC and LOGO|James L. Poirot and R. Clark Adams|9780884082750\n|National Library Of Canada|Logo Programming Bugs And Debugging Strategies Of Grade Six Students|Cathcart, Gloria M.|9780315232013\n1984|Creative Publications|Logo Discoveries: Explorations And Programming Activities For Beginners (computer Education Series)|Margaret L. Moore|9780884882558\n1984|Reston Pub Co|Let's Talk Commodore Turtle: Teacher's And Parents (learning With Logo Series)|Liddy Nevile and Carolyn Dowling|9780835939980", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|How programming environment shapes perception, learning and goals: logo vs. scratch|10.1145/1734263.1734383|173|12|Colleen M. Lewis|b246bf0671f9e41396760d223555f88f9fec54d7\n1987|Longitudinal Study of the Effects of Logo Programming on Cognitive Abilities and Achievement|10.2190/RCNV-2HYF-60CM-K7K7|91|4|D. Clements|407e6dccdc373fe346209f4a56ca0e11c7e2c046\n2001|Logo in Mainstream Schools: The struggle over the soul of an educational innovation|10.1080/01425690120094449|43|2|Angelos Agalianos and R. Noss and G. Whitty|9cc2c8248b78168c745d32ea970f96c1ab3382ad\n2011|PlayLOGO 3D: A 3D Interactive Video Game for Early Programming Education: Let LOGO Be a Game|10.1109/VS-GAMES.2011.10|39|0|I. Paliokas and Christos Arapidis and Michail Mpimpitsos|2acaeee4c9e14c24dcee9f42abaa431bc1617529\n1994|Benefits of Teaching Design Skills before Teaching Logo Computer Programming: Evidence for Syntax-Independent Learning|10.2190/5MN5-P7LW-JRB4-W9T5|35|1|A. Fay and R. Mayer|27c91e5db457c170ce27d323120e4025dcfca954\n1991|Programming Objects to Think with: Logo and the Teaching and Learning of Problem Solving|10.2190/UX0M-NHM2-1G5X-01X4|28|0|Karen Swan|273e91823e1b5c64ee9ef3e04e49c20956206763\n1987|The Effects of “Instant” Logo Computing Language on the Cognitive Development of Very Young Children|10.2190/A0QK-HB7A-RXQB-70NC|26|0|R. Howell and P. Scott and Jeff Diamond|aa6da2b3204fa0a9b231c08f31bb8151edaf7ffc\n1989|Some Prerequisites for Teaching Thinking: Methodological issues in the Study of LOGO Programming|10.1207/S1532690XCI0604_4|24|0|J. Littlefield and Victor R. Delclos and J. Bransford and K. Clayton and J. J. Franks|fdabee93d818f49666106761ffcf3931c3bb13c0\n2011|Reviving the Turtle: Exploring the Use of Logo with Students with Mild Disabilities|10.1080/07380569.2011.594987|23|2|Corbet C. Ratcliff and S. Anderson|e59df79c4b41b036198500ee6dfb19a668849a7b\n2020|History of Logo|10.1145/3386329|20|2|C. Solomon and B. Harvey and Ken Kahn and H. Lieberman and Mark L. Miller and M. Minsky and Artemis Papert and Brian Silverman|fa55e2ac5069f6ffde59a40d4acf97c082942959\n1988|Gender Differences in the Use of the Logo Programming Language|10.2190/WN8C-GCYL-UDNA-B457|16|1|Lyn Schaefer and Joan E. Sprigle|05cdef8a16637e0fac4fa555ce014b6e18222315\n1992|Logo Mastery and Spatial Problem-Solving by Young Children: Effects of Logo Language Training, Route-Strategy Training, and Learning Styles on Immediate Learning and Transfer|10.2190/LFLP-9T72-L1ND-Y6B3|15|0|J. Watson and G. Lange and V. Brinkley|03def42065c1635cbe530eac0dad6d48a3ad50d6\n1972|Uses of the LOGO programming language in undergraduate instruction|10.1145/800194.805908|13|0|George Lukas|5ee60ebf7a9ecaa568049c2c30019ae1f97ec489\n2011|Computer Application in Elementary Education Bases on Fractal Geometry Theory Using LOGO Programming|10.1007/978-94-007-2598-0_26|9|0|Jaeho An and Namje Park|76665b38853cc623233316665ab4ae6bee396571\n2016|Development of Computer Education Program Using LOGO Programming and Fractals Learning for Enhancing Creativity: Focus on Creative Problem-Solving|10.14257/IJUNESST.2016.9.2.13|7|1|Namje Park|1771413174e30e798563c10f9e50b790f1b11732\n1973|An informal graphics system based on the LOGO language|10.1145/1499586.1499745|4|0|W. Newman|fe58742fe7aeedad25b73812bba4c9290f71a655\n1990|Logo Programming and Peer Interactions: An Analysis of Process- and Product-Oriented Collaborations|10.2190/F2E5-LEVP-XERA-WVU9|4|0|B. Burns and H. Coon|ccba18ce7de25e96058fa979f540004c3d119fa8\n2015|Improving problem-solving skills through logo programming language|10.15804/TNER.2015.41.3.04|4|0|B. Pardamean and Teddy Suparyanto and Evelyn|db1a0857c61235df653a406d1f077ff1ba41b52a\n2013|PILOT, SNOBOL, AND LOGO AS COMPUTING TOOLS FOR FOREIGN-LANGUAGE INSTRUCTION|10.1558/CJ.V3I2.41-47|2|0|Ruth H. Sanders|0a1579d29ac51e3aaf680e634882cd3e95387344\n2019|Exploring Computer Science with MicroworldsEX to Learn Geometry and Logo Programming Code|10.37626/ga9783959871129.0.111|1|0|Thomas Walsh Jr.|03578c446233bbd8541cdf452c7cccab672ebed7" }, "logol": { "title": "LOGOL", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f85cf44a7172276e970683c7f6af73eb84722fb1" ], "country": [ "Ukraine and Poland" ], "originCommunity": [ "Institute of Mathematical Machines", "Western University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=331", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "logos": { "title": "Logos", "appeared": 2010, "type": "pl", "description": "Logos is a component of the Theos development suite that allows method hooking code to be written easily and clearly, using a set of special preprocessor directives. Theos is a cross-platform suite of development tools for managing, developing, and deploying iOS software without the use of Xcode. It is an important tool for people building extensions (tweaks) for jailbroken iOS; most extension developers use Theos.", "reference": [ "https://github.com/DHowett/theos-logos-examples" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/DHowett/theos-logos-examples/issues" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "%group iOS8\n%hook IOS8_SPECIFIC_CLASS\n // your code here\n%end // end hook\n%end // end group ios8\n\n%group iOS9\n%hook IOS9_SPECIFIC_CLASS\n // your code here\n%end // end hook\n%end // end group ios9\n\n%ctor {\n if (kCFCoreFoundationVersionNumber > 1200) {\n %init(iOS9);\n } else {\n %init(iOS8);\n }\n}" ], "githubLanguage": { "fileExtensions": [ "xm", "x", "xi" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.logos", "repos": 6281, "id": "Logos" }, "githubBigQuery": { "repos": 4497, "users": 3774, "id": "Logos" }, "pygmentsHighlighter": { "filename": "objective.py", "fileExtensions": [ "x", "xi", "xm", "xmi" ], "id": "Logos" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2016, "committerCount": 6, "commitCount": 10, "sampleCount": 5, "example": [ "# APPLE LOCAL file string workaround 4943900\nif { [istarget \"*-*-darwin\\[9123\\]*\"] } {\n set additional_flags \"-framework Foundation -fconstant-cfstrings\"\n}\nreturn 0\n" ], "url": "https://github.com/Cykey/Sublime-Logos" }, "fileType": "text", "wordRank": 3920, "centralPackageRepositoryCount": 0, "isbndb": "" }, "logowriter": { "title": "LogoWriter", "appeared": 1986, "type": "pl", "reference": [ "https://archive.org/details/intro_to_programming_in_logo_using_logowriter_2nd_edition", "https://www.researchgate.net/publication/234568888_Introduction_to_Programming_in_Logo_Using_LogoWriter_Revised_Edition" ], "country": [ "United States" ], "originCommunity": [ "University of Oregon" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7667", "centralPackageRepositoryCount": 0 }, "logres": { "title": "Logres", "appeared": 1990, "type": "queryLanguage", "description": "LOGRES is a new project for the development of extended database systems which is based on the integration of the object-oriented data modelling paradigm and of the rule-based approach for the specification of queries and updates. The data model supports generalization hierarchies and object sharing, the rule-based language extends Datalog to support generalized type constructors (sets, multisets, and sequences), rule-based integrity constraints are automatically produced by analyzing schema definitions. Modularization is a fundamental feature, as modules encapsulate queries and updates, when modules are applied to a LOGRES database, their side effects can be controlled. The LOGRES project is a follow-up of the ALGRES project, and takes advantage of the ALGRES programming environment for the development of a fast prototype.", "reference": [ "https://dl.acm.org/doi/10.1145/93605.98732" ], "country": [ "Italy" ], "originCommunity": [ "Politecnico di Milano" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5790" }, "logscheme": { "title": "LogScheme", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/31ce52854607592e4eb7e2d8e830fb1417d73370" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4018", "centralPackageRepositoryCount": 0 }, "logtalk": { "title": "Logtalk", "appeared": 1998, "type": "pl", "creators": [ "Paulo Moura" ], "website": "http://logtalk.org", "country": [ "Portugal" ], "originCommunity": [ "https://github.com/LogtalkDotOrg" ], "domainName": { "registered": 2002, "name": "logtalk.org" }, "hasComments": { "example": "", "value": true }, "hasMultipleInheritance": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "printToken": [ [ "write" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "?- my_first_object::p2.\nERROR: error(permission_error(access, private_predicate, p2), my_first_object::p2, user)" ], "related": [ "prolog", "smalltalk", "objective-c", "swi-prolog", "mercury", "oz", "visual-prolog" ], "summary": "Logtalk is an object-oriented logic programming language that extends and leverages the Prolog language with a feature set suitable for programming in the large. It provides support for encapsulation and data hiding, separation of concerns and enhanced code reuse. Logtalk uses standard Prolog syntax with the addition of a few operators and directives. The Logtalk language implementation is distributed under an open source license and can run using a Prolog implementation (compliant with official and de facto standards) as the back-end compiler.", "pageId": 7792164, "created": 2012, "backlinksCount": 42, "revisionCount": 1, "dailyPageViews": 2, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Logtalk_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "lgt", "logtalk" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.logtalk", "repos": 65, "id": "Logtalk" }, "githubBigQuery": { "repos": 52, "users": 50, "id": "Logtalk" }, "pygmentsHighlighter": { "filename": "prolog.py", "fileExtensions": [ "lgt", "logtalk" ], "id": "Logtalk" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2017, "committerCount": 5, "commitCount": 90, "sampleCount": 1, "example": [ "% this is a Logtalk source file\n\n:- object(hello_world).\n\n\t% the initialization/1 directive argument is automatically executed\n\t% when the object is loaded into memory:\n\t:- initialization((nl, write('********** Hello World! **********'), nl)).\n\n:- end_object.\n" ], "url": "https://github.com/textmate/logtalk.tmbundle" }, "leachim6": { "filepath": "l/Logtalk.lgt", "fileExtensions": [ "lgt" ], "example": [ "write('Hello World')\n" ], "id": "Logtalk" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Logtalk", "hopl": "https://hopl.info/showlanguage.prx?exp=3555", "twitter": "https://twitter.com/logtalkdotorg", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2008|High-Level Multi-threading Programming in Logtalk|10.1007/978-3-540-77442-6_18|13|1|Paulo Moura and P. Crocker and Paulo Nunes|7926b23b6f896193567781ba0ef077b81eae1d1c\n2009|Programming Patterns for Logtalk Parametric Objects|10.1007/978-3-642-20589-7_4|12|1|Paulo Moura|12f4071900572a48e9f75e3d953629346d0c265a\n2009|From Plain Prolog to Logtalk Objects: Effective Code Encapsulation and Reuse|10.1007/978-3-642-02846-5_3|7|1|Paulo Moura|ee9e13c53d2ed91fc61830ed000a44229a705928\n2009|High Level Thread-Based Competitive Or-Parallelism in Logtalk|10.1007/978-3-540-92995-6_8|5|0|Paulo Moura and Ricardo Rocha and S. Madeira|d2d6b9c1f4996a55752753ee221614a86f6a15ef" }, "lol": { "title": "LOL", "appeared": 1994, "type": "queryLanguage", "reference": [ "https://link.springer.com/chapter/10.1007/3-540-61756-6_103" ], "country": [ "Canada" ], "originCommunity": [ "University of Regina" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5798", "wordRank": 4327, "isbndb": "" }, "lola-2": { "title": "Lola-2", "appeared": 1994, "type": "pl", "creators": [ "Niklaus Wirth" ], "description": "Lola-2: A Logic Description Language. Lola is a notation (language) for specifying digital circuits (logic). In many ways it resembles a programming language. However, Lola texts describe static circuits rather than dynamic processes. Objects occurring in a description can be variables representing signals or registers. Their values are defined as expressions of other objects and operators representing gates.", "reference": [ "https://inf.ethz.ch/personal/wirth/Lola/Lola2.pdf" ], "country": [ "Switzerland" ], "originCommunity": [ "Eidgenössische Technische Hochschule Zürich" ] }, "lola": { "title": "LOLA", "appeared": 1991, "type": "pl", "reference": [ "https://docplayer.net/10592589-9-amos-a-natural-language-parser-implemented-as-a-deductive-database-in-lola.html" ], "country": [ "Germany" ], "originCommunity": [ "Technische Universitat Munchen" ], "leachim6": { "filepath": "l/LOLA.lola", "fileExtensions": [ "lola" ], "example": [ ":H,:e,2:l,,:o,:',:_,:w,:o,:r,:l,:d,:!,:%,:\\\\b,\\\\a,,,,,,,,,,,,,,\n\n+\\\\\\cb,ba,,\n*\\\\ba+,,\\\\a,\n:\\\\\\a\\c,c,\n\nH*+8,,8,\ne+d,\nl8+,d,\no3+,l,\n'_+,^,\nw8+,o,\nr+^,+,e,\nd2%,\n_52,\n!+_,\n\n2\\\\bba,,\n3+2,\n5+22,,\n832,\n%*2,5,\n^2*2,,3,\n" ], "id": "LOLA" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3564", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "lolcode": { "title": "LOLCODE", "appeared": 2007, "type": "esolang", "creators": [ "Adam Lindsay" ], "website": "http://lolcode.org/", "documentation": [ "https://learnxinyminutes.com/docs/LOLCODE/" ], "country": [ "England" ], "originCommunity": [ "Lancaster University" ], "domainName": { "awisRank": { "2017": 1442060, "2022": 3117008 }, "name": "lolcode.org" }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "example": [ "HAI 1.3\n OBTW\n Author: Logan Kelly (logan.kelly@gmail.com)\n Github: https://github.com/LoganKelly/LOLTracer\n TLDR\n\n OBTW prev is the number used in the randin function.\n I had to declare it in global scope so that it\n would retain its value between calls to randin.\n TLDR\n I HAS A prev ITZ 0\n I HAS A rand_max ITZ 104729\n\n\n OBTW Equivalent to C's rand() function, except returns\n a number in the range of 0 to rand_max.\n TLDR\n HOW IZ I randin\n I HAS A a ITZ 33083\n I HAS A c ITZ 67607\n prev R MOD OF SUM OF PRODUKT OF prev AN a AN c AN rand_max\n FOUND YR prev\n IF U SAY SO\n\n\n BTW Returns a random number within the range of 0-1.\n HOW IZ I rand_onein\n I HAS A rand_num ITZ I IZ randin MKAY\n rand_num IS NOW A NUMBAR\n I HAS A rand_max_float ITZ MAEK rand_max A NUMBAR\n FOUND YR QUOSHUNT OF rand_num AN rand_max_float\n IF U SAY SO\n\n\n OBTW Equivalent to C ceil() function. Returns the next\n largest integer for the given number.\n TLDR\n HOW IZ I ceilin YR num\n I HAS A int_num ITZ num\n int_num IS NOW A NUMBR\n BOTH SAEM int_num AN num, O RLY?\n YA RLY, FOUND YR num\n OIC\n DIFFRINT num AN SMALLR OF num AN 0, O RLY?\n YA RLY\n int_num R SUM OF int_num AN 1\n FOUND YR MAEK int_num A NUMBAR\n OIC\n DIFFRINT num AN BIGGR OF num AN 0, O RLY?\n YA RLY\n FOUND YR MAEK int_num A NUMBAR\n OIC\n IF U SAY SO\n\n\n OBTW Convert a number to hexadecimal. This\n is returned as a string.\n TLDR\n HOW IZ I decimal_to_hex YR num\n I HAS A i ITZ 0\n I HAS A rem\n I HAS A hex_num ITZ A BUKKIT\n I HAS A decimal_num ITZ num\n IM IN YR num_loop\n rem R MOD OF decimal_num AN 16\n I HAS A hex_digit\n rem, WTF?\n OMG 10, hex_digit R \"A\", GTFO\n OMG 1" ], "wikipedia": { "example": [ "HAI 1.2\nCAN HAS STDIO?\nIM IN YR LOOP UPPIN YR VAR TIL BOTH SAEM VAR AN 10\n VISIBLE SUM OF VAR AN 1\nIM OUTTA YR LOOP\nKTHXBYE" ], "related": [ "c", "php", "javascript", "parrot-vm" ], "summary": "LOLCODE is an esoteric programming language inspired by lolspeak, the language expressed in examples of the lolcat Internet meme. The language was created in 2007 by Adam Lindsay, researcher at the Computing Department of Lancaster University. The language is not clearly defined in terms of operator priorities and correct syntax, but several functioning interpreters and compilers exist. One interpretation of the language has been proven Turing-complete.", "pageId": 15450778, "dailyPageViews": 293, "created": 2007, "backlinksCount": 98, "revisionCount": 532, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/LOLCODE" }, "githubLanguage": { "fileExtensions": [ "lol" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 235, "id": "LOLCODE" }, "githubBigQuery": { "repos": 109, "users": 106, "id": "LOLCODE" }, "leachim6": { "filepath": "l/LOLCODE.lol", "fileExtensions": [ "lol" ], "example": [ "HAI\nCAN HAS STDIO?\nVISIBLE \"Hello World\"\nKTHXBYE\n" ], "id": "LOLCODE" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LOLCODE", "rijuRepl": { "example": [ "HAI 1.2\n VISIBLE \"Hello, world!\"\nKTHXBYE\n" ], "id": "https://riju.codes/lolcode" }, "replit": "https://repl.it/languages/lolcode", "tryItOnline": "lolcode", "esolang": "https://esolangs.org/wiki/LOLCODE", "twitter": "https://twitter.com/icanhaslolcode", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "lookml": { "title": "LookML", "appeared": 2012, "type": "pl", "website": "https://docs.looker.com/data-modeling/learning-lookml/what-is-lookml", "reference": [ "https://docs.looker.com/relnotes/v1-release-notes#looker_1.10.13" ], "originCommunity": [ "Looker" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "######################################\n# FILE: ecommercestore.model.lkml #\n# Define the explores and join logic #\n######################################\nconnection: order_database\ninclude: \"*.view.lkml\"\nexplore: orders {\n join: customers {\n sql_on: ${orders.customer_id} = ${customers.id} ;;\n }\n}\n\n##########################################################\n# FILE: orders.view.lkml #\n# Define the dimensions and measures for the ORDERS view #\n##########################################################\nview: orders {\n dimension: id {\n primary_key: yes\n type: number\n sql: ${TABLE}.id ;;\n }\n dimension: customer_id { # field: orders.customer_id\n sql: ${TABLE}.customer_id ;;\n }\n dimension: amount { # field: orders.amount\n type: number\n value_format: \"0.00\"\n sql: ${TABLE}.amount ;;\n }\n dimension_group: created { # generates fields:\n type: time # orders.created_time, orders.created_date\n timeframes: [time, date, week, month] # orders.created_week, orders.created_month\n sql: ${TABLE}.created_at ;;\n }\n measure: count { # field: orders.count\n type: count # creates a sql COUNT(*)\n drill_fields: [drill_set*] # list of fields to show when someone clicks 'ORDERS Count'\n }\n measure: total_amount {\n type: sum\n sql: ${amount} ;;\n }\n set: drill_set {\n fields: [id, created_time, customers.name, amount]\n }\n}\n\n#############################################################\n# FILE: customers.view.lkml #\n# Define the dimensions and measures for the CUSTOMERS view #\n#############################################################\nview: customers {\n dimension: id {\n primary_key: yes\n type: number\n sql: ${TABLE}.id ;;\n }\n dimension: city { # field: customers.city\n sql: ${TABLE}.city ;;\n }\n dimension: state { # field: customers.state\n sql: ${TABLE}.state ;;\n }\n dimension: name {\n sql: CONCAT(${TABLE}.firstname, \" \", ${TABLE}.lastname) ;;\n }\n measure: count { # field: customers.count\n type: count # creates a sql COUNT(*)\n drill_fields: [drill_set*] # fields to show when someone clicks 'CUSTOMERS Count'\n }\n set: drill_set { # set: customers.drill_set\n fields: [id, state, orders.count] # list of fields to show when someone clicks 'CUSTOMERS Count'\n }\n}" ], "githubLanguage": { "fileExtensions": [ "lookml", "modellkml", "viewlkml" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "yaml", "codemirrorMode": "yaml", "codemirrorMimeType": "text/x-yaml", "tmScope": "source.yaml", "repos": 5427, "id": "LookML" }, "githubBigQuery": { "repos": 185, "users": 47, "id": "LookML" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 25, "commitCount": 205, "sampleCount": 3, "example": [ "- view: comments\n fields:\n\n - dimension: id\n primary_key: true\n type: int\n sql: ${TABLE}.id\n\n - dimension: body\n sql: ${TABLE}.body\n\n - dimension_group: created\n type: time\n timeframes: [time, date, week, month]\n sql: ${TABLE}.created_at\n\n - dimension: headline_id\n type: int\n hidden: true\n sql: ${TABLE}.headline_id\n\n - dimension_group: updated\n type: time\n timeframes: [time, date, week, month]\n sql: ${TABLE}.updated_at\n\n - dimension: user_id\n type: int\n hidden: true\n sql: ${TABLE}.user_id\n\n - measure: count\n type: count\n detail: detail*\n\n\n # ----- Detail ------\n sets:\n detail:\n - id\n - headlines.id\n - headlines.name\n - users.id" ], "url": "https://github.com/atom/language-yaml" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "loom": { "title": "Loom", "appeared": 1987, "type": "knowledgeBase", "description": "Loom is a language and environment for constructing intelligent applications. The heart of Loom is a knowledge representation system that is used to provide deductive support for the declarative portion of the Loom language. Declarative knowledge in Loom consists of definitions, rules, facts, and default rules. A deductive engine called a classifier utilizes forward-chaining, semantic unification and object-oriented truth maintainance technologies in order to compile the declarative knowledge into a network designed to efficiently support on-line deductive query processing.", "website": "https://www.isi.edu/isd/LOOM/LOOM-HOME.html", "reference": [ "https://semanticscholar.org/paper/6031b724f174da0069ea61ffa9da928adb090b24" ], "country": [ "United States" ], "originCommunity": [ "Information Sciences Institute" ], "example": [ "(defconcept air-base\n :is-primitive\n (and military-installation\n (exactly 1 name)\n (at-least 1 runway-length)))" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3991", "centralPackageRepositoryCount": 0 }, "loomscript": { "title": "LoomScript", "appeared": 2013, "type": "pl", "website": "http://loomsdk.com/", "country": [ "United States" ], "originCommunity": [ "https://theengine.co/" ], "domainName": { "registered": 2013, "name": "loomsdk.com" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubLanguage": { "fileExtensions": [ "ls" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.loomscript", "repos": 16, "id": "LoomScript" }, "githubBigQuery": { "repos": 7, "users": 4, "id": "LoomScript" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2014, "committerCount": 2, "commitCount": 11, "sampleCount": 2, "example": [ "package\n{\n import loom.Application;\n import loom2d.display.StageScaleMode;\n import loom2d.ui.SimpleLabel;\n\n /**\n The HelloWorld app renders a label with its name on it,\n and traces 'hello' to the log.\n */\n public class HelloWorld extends Application\n {\n\n override public function run():void\n {\n stage.scaleMode = StageScaleMode.LETTERBOX;\n centeredMessage(simpleLabel, this.getFullTypeName());\n\n trace(\"hello\");\n }\n\n // a convenience getter that generates a label and adds it to the stage\n private function get simpleLabel():SimpleLabel\n {\n return stage.addChild(new SimpleLabel(\"assets/Curse-hd.fnt\")) as SimpleLabel;\n }\n\n // a utility to set the label's text and then center it on the stage\n private function centeredMessage(label:SimpleLabel, msg:String):void\n {\n label.text = msg;\n label.center();\n label.x = stage.stageWidth / 2;\n label.y = (stage.stageHeight / 2) - (label.height / 2);\n }\n\n }\n}" ], "url": "https://github.com/ambethia/Sublime-Loom" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "loopnpp": { "title": "LOOPN++", "appeared": 2000, "type": "pl", "reference": [ "http://www.cs.adelaide.edu.au/users/charles/OPN/postscript/armstrong-thesis.ps.gz" ], "country": [ "Australia" ], "originCommunity": [ "University of Tasmania" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6187", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "loops": { "title": "Lisp Object-Oriented Programming System", "appeared": 1983, "type": "pl", "reference": [ "https://www.markstefik.com/wp-content/uploads/2011/04/1983-loops-manual-Bobrow-Stefik-part-1.pdf" ], "standsFor": "Lisp Object-Oriented Programming System", "country": [ "United States" ], "originCommunity": [ "Xerox PARC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1042", "wordRank": 9535, "isbndb": "", "semanticScholar": "" }, "lore": { "title": "LORE", "appeared": 1985, "type": "pl", "reference": [ "https://dl.acm.org/doi/10.1145/67386.67390" ], "country": [ "United States" ], "originCommunity": [ "Bell Communications" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1337", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "lorel-1": { "title": "Lorel", "appeared": 1974, "type": "pl", "description": "A high level language for processing n-ary relations.", "reference": [ "https://ipsj.ixsq.nii.ac.jp/ej/?action=repository_uri&item_id=7873", "https://cir.nii.ac.jp/crid/1050564287833367040" ], "country": [ "Japan" ], "originCommunity": [ "Kanagawa Institute of Technology", "Science University of Tokyo", "Tokyo Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5037", "isbndb": "" }, "lorel": { "title": "Lorel", "appeared": 1996, "type": "queryLanguage", "creators": [ "Serge Abiteboul", "Dallan Quass", "Jason McHugh", "Jennifer Widom", "Janet L. Wiener" ], "description": "Lorel Query Language for Semistructured Data", "reference": [ "http://infolab.stanford.edu/lore/pubs/lorel96.pdf" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "example": [ "select Guide.restaurant.name,\n Guide.restaurant(.address)?.zipcode\n where Guide.restaurant.% grep \"cheap\"" ], "isbndb": "" }, "lotis": { "title": "LOTIS", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a39f4aa62c7966af1138e0eb95c4d58cc566c5d4" ], "country": [ "Switzerland" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=428", "centralPackageRepositoryCount": 0 }, "lotos": { "title": "LOTOS", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/207b973bfac2d68956a87b803bd6d2921f536bb2" ], "country": [ "Spain" ], "originCommunity": [ "UPM Escuela Técnica Superior de Ingenieros de Telecomunicación" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1493", "centralPackageRepositoryCount": 0 }, "lotusscript": { "title": "LotusScript", "appeared": 1996, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Lotus Development Corporation" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "visual-basic" ], "summary": "LotusScript is an object oriented programming language used by Lotus Notes (since version 4.0) and other IBM Lotus Software products. LotusScript is similar to Visual Basic. Developers familiar with one can easily understand the syntax and structure of code in the other. The major differences between the two are in their respective Integrated Development Environments and in the product-specific object classes provided in each language that are included. VB includes a richer set of classes for UI manipulation, whereas LotusScript includes a richer set of application-specific classes for Lotus Notes, Lotus Word Pro and Lotus 1-2-3. In the case of Lotus Notes, there are classes to work with Notes databases, documents (records) in those databases, etc. These classes can also be used as OLE Automation objects outside of the Lotus Notes environment, from Visual Basic. LotusScript also allows the definition of user-defined types and classes, although it is not possible to inherit from the product-specific classes.", "pageId": 239268, "dailyPageViews": 29, "created": 2003, "backlinksCount": 99, "revisionCount": 50, "url": "https://en.wikipedia.org/wiki/LotusScript" }, "leachim6": { "filepath": "l/LotusScript.lss", "fileExtensions": [ "lss" ], "example": [ "Sub Initialize\n\tPrint \"Hello World\"\nEnd Sub\n" ], "id": "LotusScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LotusScript", "tiobe": { "id": "LotusScript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3547", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nLotusScript for Dummies|1997|James G. Meade|2104599|5.00|1|0\nInside LotusScript: A Complete Guide to Notes Programming|1997|Joe McGinn|4978354|3.00|2|0\n60 Minute Guide to LotusScript 3 Programming for Lotus Notes 4|1996|Robert Beyer|3306848|4.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n1997|Hungry Minds Inc,U.S.|Teach Yourself...: Lotusscript for Notes/Domino 4.6|Bill Kreisle and Rocky Oliver|9781558285606\n1999|Manning Publications|Practical LotusScript|Patton, Anthony|9781884777769\n1996|John Wiley & Sons Inc|60 Minute Guide To Lotusscript 3 Programming For Lotus Notes 4|Robert Beyer and Roland, Jr. Houle and Robert Perron|9781568847795" }, "lowstar": { "title": "Low*", "appeared": 2008, "type": "pl", "website": "https://fstarlang.github.io/lowstar/html/LowStar.html", "aka": [ "low-star" ], "country": [ "United States and France" ], "originCommunity": [ "Microsoft Research", "Institut national de recherche en sciences et technologies du numérique" ], "firstAnnouncement": "https://arxiv.org/abs/1703.00053", "announcementMethod": "paper", "compilesTo": [ "c" ], "subsetOf": [ "fstar" ], "example": [ "let chacha20\n (len: uint32{len ≤ blocklen})\n (output: bytes{len = output.length})\n (key: keyBytes)\n (nonce: nonceBytes{disjoint [output; key; nonce]})\n (counter: uint32) : Stack unit\n (requires (λ m0 → output ∈ m0 ∧ key ∈ m0 ∧ nonce ∈ m0))\n (ensures (λ m0 _m1 → modifies1 output m0 m1 ∧\n m1.[output] ==\n Seq.prefix len (Spec.chacha20 m0.[key] m0.[nonce]) counter))) =\n push_frame ();\n let state = Buffer.create 0ul 32ul in\n let block = Buffer.sub state 16ul 16ul in\n chacha20_init block key nonce counter;\n chacha20_update output state len;\n pop_frame ()" ] }, "lpc": { "title": "LPC", "appeared": 1995, "type": "pl", "creators": [ "Lars Pensjö" ], "website": "http://lpmuds.net", "standsFor": "Lars Pensjö C", "country": [ "Sweden" ], "originCommunity": [ "Chalmers Datorförening" ], "domainName": { "registered": 2006, "awisRank": { "2017": 19387417 }, "name": "lpmuds.net" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "function op = (:\n return sqrt($1 * $1 + $2 * $2);\n :);" ], "related": [ "c", "lisp", "perl", "pike", "java", "php" ], "summary": "LPC (short for Lars Pensjö C) is an object-oriented programming language derived from C and developed originally by Lars Pensjö to facilitate MUD building on LPMuds. Though designed for game development, its flexibility has led to it being used for a variety of purposes, and to its evolution into the language Pike. LPC syntax places it in the family of C-like languages, with C and C++ its strongest influences.", "pageId": 904645, "dailyPageViews": 47, "created": 2004, "backlinksCount": 264, "revisionCount": 211, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/LPC_(programming_language)" }, "helloWorldCollection": [ "// Hello World in LPC\n\nvoid create()\n{\n message(\"info\",\"Hello World!\",this_user());\n}" ], "tiobe": { "id": "LPC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1409", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1998|Multicodebook vector quantization of LPC parameters|10.1109/ICASSP.1998.674367|1|0|C. Xydeas and T. Chapman|85d57012e851b2fb857258b255846a2926b0c71c" }, "lpl": { "title": "LPL", "appeared": 1973, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Virginia Polytechnic Institute & State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4298", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "lrltran": { "title": "LRLTRAN", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f399c9d4756b2e82e3de31b267b8bacb00b4c590" ], "country": [ "United States" ], "originCommunity": [ "University of California,Livermore" ], "hopl": "https://hopl.info/showlanguage.prx?exp=429", "centralPackageRepositoryCount": 0 }, "lsd": { "title": "lsd", "appeared": 2016, "type": "textMarkup", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/fiatjaf/LSD/issues" ], "githubRepo": { "firstCommit": 2016, "stars": 3, "forks": 1, "subscribers": 2, "created": 2016, "updated": 2019, "description": "Loose Structured Data", "issues": 0, "url": "https://github.com/fiatjaf/LSD" }, "repoStats": { "firstCommit": 2016, "commits": 3, "committers": 1, "files": 7 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n12200000|Show HN: A very loose JSON-like markup language|2016-08-01 03:08:11 UTC|1470020891|fiatjaf|0|1" }, "lse": { "title": "Langage Sans Espoir", "appeared": 1971, "type": "pl", "standsFor": "Langage Sans Espoir", "country": [ "France" ], "nativeLanguage": "French", "originCommunity": [ "École supérieure d'électricité and Télémécanique" ], "wikipedia": { "related": [ "basic" ], "summary": "LSE (French: Langage symbolique d'enseignement) is a programming language developed at Supélec in the late 1970s/early 1980s. It is similar to BASIC, except with French-language instead of English-language keywords. It was derived from an earlier language called LSD, also developed at Supélec. It is most commonly said to be an acronym for Langage Symbolique d'Enseignement (Symbolic Teaching Language), but other expansions are also known (e.g. Langage de Sup-Élec, or the more cynical Langage Sans Espoir (hopeless language)). It originally flourished due to support from the French Ministry of National Education, but declined as the ministry lost interest. It went through a number of revisions; earlier versions of LSE lacked full support for structured programming, which later version added, along with exception handling.", "pageId": 11730351, "dailyPageViews": 8, "created": 2007, "backlinksCount": 10, "revisionCount": 21, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/LSE_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4767", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "lsif-format": { "title": "Language Server Index Format", "appeared": 2019, "type": "jsonFormat", "creators": [ "Dan Adler" ], "website": "https://lsif.dev/", "standsFor": "Language Server Index Format", "country": [ "United States" ], "originCommunity": [ "Sourcegraph" ], "domainName": { "awisRank": { "2022": 7825614 }, "name": "lsif.dev" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// a vertex representing the document\n{ id: 1, type: \"vertex\", label: \"document\", uri: \"file:///Users/username/sample.ts\", languageId: \"typescript\" }\n// a vertex representing the range for the identifier bar\n{ id: 4, type: \"vertex\", label: \"range\", start: { line: 0, character: 9}, end: { line: 0, character: 12 } }\n// an edge saying that the document with id 1 contains the range with id 4\n{ id: 5, type: \"edge\", label: \"contains\", outV: 1, inV: 4}\n// a vertex representing the actual hover result\n{ id: 6, type: \"vertex\", label: \"hoverResult\",\n result: {\n contents: [\n { language: \"typescript\", value: \"function bar(): void\" }\n ]\n }\n}\n// an edge linking the hover result to the range.\n{ id: 7, type: \"edge\", label: \"textDocument/hover\", outV: 4, inV: 6 }" ], "githubRepo": { "firstCommit": 2019, "stars": 8, "forks": 3, "subscribers": 5, "created": 2019, "updated": 2022, "description": "https://lsif.dev", "issues": 4, "url": "https://github.com/lsif/lsif.github.io" }, "repoStats": { "firstCommit": 2019, "commits": 48, "committers": 16, "files": 5 } }, "lsl": { "title": "Linden Scripting Language", "appeared": 2003, "type": "pl", "reference": [ "http://wiki.secondlife.com/wiki/LSL_Portal" ], "standsFor": "Linden Scripting Language", "country": [ "United States" ], "originCommunity": [ "Linden Research, Inc" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "// (\\d+\\.\\d*|\\.\\d+|\\d+)[eE][+-]?\\d*", "value": true }, "hasIntegers": { "example": "// \\d+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "githubLanguage": { "fileExtensions": [ "lsl", "lslp" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "lsl" ], "aceMode": "lsl", "tmScope": "source.lsl", "repos": 638, "id": "LSL" }, "githubBigQuery": { "repos": 397, "users": 373, "id": "LSL" }, "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "lsl" ], "id": "LSL" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2017, "committerCount": 3, "commitCount": 46, "sampleCount": 2, "example": [ "/*\n Testing syntax highlighting\n for the Linden Scripting Language\n*/\n\ninteger someIntNormal = 3672;\ninteger someIntHex = 0x00000000;\ninteger someIntMath = PI_BY_TWO;\n\ninteger event = 5673;// 'event' is invalid.illegal\n\nkey someKeyTexture = TEXTURE_DEFAULT;\nstring someStringSpecial = EOF;\n\nsome_user_defined_function_without_return_type(string inputAsString)\n{\n llSay(PUBLIC_CHANNEL, inputAsString);\n}\n\nstring user_defined_function_returning_a_string(key inputAsKey)\n{\n return (string)inputAsKey;\n}\n\ndefault\n{\n state_entry()\n {\n key someKey = NULL_KEY;\n someKey = llGetOwner();\n\n string someString = user_defined_function_returning_a_string(someKey);\n\n some_user_defined_function_without_return_type(someString);\n }\n\n touch_start(integer num_detected)\n {\n list agentsInRegion = llGetAgentList(AGENT_LIST_REGION, []);\n integer numOfAgents = llGetListLength(agentsInRegion);\n\n integer index; // defaults to 0\n for (; index <= numOfAgents - 1; index++) // for each agent in region\n {\n llRegionSayTo(llList2Key(agentsInRegion, index), PUBLIC_CHANNEL, \"Hello, Avatar!\");\n }\n }\n\n touch_end(integer num_detected)\n {\n someIntNormal = 3672;\n someIntHex = 0x00000000;\n someIntMath = PI_BY_TWO;\n\n event = 5673;// 'event' is invalid.illegal\n\n someKeyTexture = TEXTURE_DEFAULT;\n someStringSpecial = EOF;\n\n llSetInventoryPermMask(\"some item\", MASK_NEXT, PERM_ALL);// 'llSetInventoryPermMask' is reserved.godmode\n\n llWhisper(PUBLIC_CHANNEL, \"Leaving \\\"default\\\" now...\");\n state other;\n }\n}\n\nstate other\n{\n state_entry()\n {\n llWhisper(PUBLIC_CHANNEL, \"Entered \\\"state other\\\", returning to \\\"default\\\" again...\");\n state default;\n }\n}" ], "url": "https://github.com/textmate/secondlife-lsl.tmbundle" }, "leachim6": { "filepath": "l/LSL.lsl", "fileExtensions": [ "lsl" ], "example": [ "default\n{\n state_entry()\n {\n llSay(0, \"Hello World\");\n }\n}" ], "id": "LSL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:LSL", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "lua": { "title": "Lua", "appeared": 1993, "type": "pl", "creators": [ "Roberto Ierusalimschy" ], "website": "https://www.lua.org/", "documentation": [ "https://www.lua.org/docs.html", "https://devdocs.io/lua/" ], "emailList": [ "https://www.lua.org/lua-l.html" ], "reference": [ "http://www.lua.org/manual/5.1/manual.html#2.1" ], "country": [ "Brazil" ], "originCommunity": [ "Tecgraf" ], "domainName": { "registered": 2000, "awisRank": { "2022": 51513 }, "name": "lua.org" }, "releaseNotesUrl": "https://www.lua.org/versions.html", "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "--[[\nA comment.\n--]]", "value": true }, "hasAssignment": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasMaps": { "example": "https://www.lua.org/pil/2.5.html", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "--[[", "--]]" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "and", "break", "do", "else", "elseif", "end", "false", "for", "function", "if", "in", "local", "nil", "not", "or", "repeat", "return", "then", "true", "until", "while" ], "wikipedia": { "example": [ "$ cc -o example example.c -llua\n$ ./example\nResult: 8" ], "related": [ "clu", "modula-2", "scheme", "snobol", "falcon", "gamemonkey-script", "io", "javascript", "julia", "minid", "red", "ruby", "squirrel", "tcl", "lisp", "python", "modula", "awk", "ada", "eiffel", "haskell", "sql", "vhdl", "self", "perl-6", "parrot-vm", "android", "c" ], "summary": "Lua ( LOO-ə, from Portuguese: lua [ˈlu.(w)ɐ] meaning moon) is a lightweight, multi-paradigm programming language designed primarily for embedded systems and clients. Lua is cross-platform, since the interpreter is written in ANSI C, and has a relatively simple C API. Lua was originally designed in 1993 as a language for extending software applications to meet the increasing demand for customization at the time. It provided the basic facilities of most procedural programming languages, but more complicated or domain-specific features were not included; rather, it included mechanisms for extending the language, allowing programmers to implement such features. As Lua was intended to be a general embeddable extension language, the designers of Lua focused on improving its speed, portability, extensibility, and ease-of-use in development.", "pageId": 46150, "dailyPageViews": 1069, "created": 2002, "backlinksCount": 2096, "revisionCount": 2536, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Lua_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "lua", "fcgi", "nse", "p8", "pd_lua", "rbxs", "rockspec", "wlua" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nvulnersCom nmap-vulners https://github.com/vulnersCom.png https://github.com/vulnersCom/nmap-vulners Lua #000080 1613 245 112 \"NSE script based on Vulners.com API\"\nkoreader koreader https://github.com/koreader.png https://github.com/koreader/koreader Lua #000080 5226 668 103 \"An ebook reader application supporting PDF, DjVu, EPUB, FB2 and many more formats, running on Cervantes, Kindle, Kobo, PocketBook and Android devices\"\nstijnwop guidanceSteering https://github.com/stijnwop.png https://github.com/stijnwop/guidanceSteering Lua #000080 174 55 15 \"Guidance Steering (AutoTrack) for Farming Simulator 19.\"\ncmusatyalab openface https://github.com/cmusatyalab.png https://github.com/cmusatyalab/openface Lua #000080 12574 3099 141 \"Face recognition with deep neural networks.\"\ncardwing Codes-for-Lane-Detection https://github.com/cardwing.png https://github.com/cardwing/Codes-for-Lane-Detection Lua #000080 375 125 92 \"Learning Lightweight Lane Detection CNNs by Self Attention Distillation (ICCV 2019)\"\nKong kong https://github.com/Kong.png https://github.com/Kong/kong Lua #000080 23291 2898 452 \"🦍 The Cloud-Native API Gateway\"\nnagadomi waifu2x https://github.com/nagadomi.png https://github.com/nagadomi/waifu2x Lua #000080 15744 1802 374 \"Image Super-Resolution for Anime-Style Art\"\nopentibiabr OTServBR-Global https://github.com/opentibiabr.png https://github.com/opentibiabr/OTServBR-Global Lua #000080 57 81 14 \"OTServBR-Global 10x and 12x for OpenTibia community. | Supported by:\"\nTencent LuaPanda https://github.com/Tencent.png https://github.com/Tencent/LuaPanda Lua #000080 329 74 48 \"Lua Debugger for VS Code\"", "trendingProjectsCount": 10, "type": "programming", "filenames": [ ".luacheckrc" ], "interpreters": [ "lua" ], "aceMode": "lua", "codemirrorMode": "lua", "codemirrorMimeType": "text/x-lua", "tmScope": "source.lua", "repos": 243541, "id": "Lua" }, "githubBigQuery": { "repos": 34346, "users": 23389, "id": "Lua" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/lua", "monaco": "lua", "codeMirror": "lua", "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "lua", "wlua" ], "id": "Lua" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2018, "committerCount": 11, "commitCount": 63, "sampleCount": 5, "example": [ "\n-- A simple counting object that increments an internal counter whenever it receives a bang at its first inlet, or changes to whatever number it receives at its second inlet.\n\nlocal HelloCounter = pd.Class:new():register(\"h-counter\")\n\nfunction HelloCounter:initialize(sel, atoms)\n\tself.inlets = 2\n\tself.outlets = 1\n\tself.num = 0\n\treturn true\nend\n\nfunction HelloCounter:in_1_bang()\n\tself:outlet(1, \"float\", {self.num})\n\tself.num = self.num + 1\nend\n\nfunction HelloCounter:in_2_float(f)\n\tself.num = f\nend\n" ], "url": "https://github.com/textmate/lua.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/Alloyed/lua-lsp\nwrittenIn lua" ], "projectEuler": { "memberCount": { "2019": 437, "2022": 477 }, "id": "Lua" }, "helloWorldCollection": [ "# Hello World in Lua\n\nprint \"Hello world\"\n" ], "leachim6": { "filepath": "l/Lua.lua", "fileExtensions": [ "lua" ], "example": [ "print(\"Hello World\")" ], "id": "Lua" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lua", "quineRelay": "Lua", "rijuRepl": { "example": [ "print(\"Hello, world!\")\n" ], "id": "https://riju.codes/lua" }, "replit": "https://repl.it/languages/lua", "tryItOnline": "lua", "indeedJobs": { "2022": 736, "query": "lua developer" }, "linkedInSkill": { "2018": 36954, "id": "lua" }, "officialBlogUrl": [ "https://www.lua.org/news.html" ], "faqPageUrl": [ "https://www.lua.org/faq.html" ], "downloadPageUrl": [ "https://www.lua.org/download.html" ], "subreddit": [ { "memberCount": { "2017": 5571, "2022": 15290 }, "url": "https://reddit.com/r/lua" } ], "meetup": { "memberCount": 4670, "groupCount": 24, "url": "https://www.meetup.com/topics/lua" }, "tiobe": { "currentRank": 30, "id": "Lua" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2196", "pypl": "Lua", "packageRepository": [ "https://luarocks.org/" ], "ubuntuPackage": "lua5.3", "jupyterKernel": [ "https://github.com/pakozm/IPyLua", "https://github.com/neomantra/lua_ipython_kernel", "https://github.com/scrapinghub/splash/tree/master/splash/kernel" ], "fileType": "text", "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming in Lua|2001|Roberto Ierusalimschy|1321894|3.97|323|21", "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|LÖVE for Lua Game Programming|Akinlaja, Darmie|9781782161608\n2003|Roberto Ierusalimschy|Programming In Lua|Ierusalimschy, Roberto|9788590379812\n2006|Lua.org|Lua 5.1 Reference Manual|Ierusalimschy, Roberto and de Figueiredo, Luiz Henrique and Celes, Waldemar|9788590379836\n2012|Apress|Learn Lua for iOS Game Development|Varma, Jayant|9781430246626\n2011|John Wiley & Sons|Beginning Lua Programming|Kurt Jung and Aaron Brown|9781118079119\n2013|Packt Publishing|CryENGINE Game Programming with C++, C#, and Lua|Lundgren, Filip and Pearce-Authers, Ruan|9781849695909\n2013|Apress|Learn Lua for iOS Game Development|Varma, Jayant|9781430246633\n2018-07-27T00:00:01Z|Packt Publishing|Lua Quick Start Guide: The easiest way to learn Lua programming|Szauer, Gabor|9781789343229\n2018|Packt Publishing|Lua Quick Start Guide: The easiest way to learn Lua programming|Szauer, Gabor|9781789340136\n2021|Packt Publishing|Coding Roblox Games Made Easy: The ultimate guide to creating games with Roblox Studio and Lua programming|Brumbaugh, Zander|9781800566361\n2009|Apress|Beginning Lua with World of Warcraft Add-ons|Emmerich, Paul|9781430223719\n2007|Wrox|Beginning Lua Programming|Jung, Kurt|9780470069172\n2013-01-03T00:00:01Z|Lua.org|Programming in Lua|Ierusalimschy, Roberto|9788590379850\n2021|Sams Publishing|Coding with Roblox Lua in 24 Hours: The Official Roblox Guide|Official Roblox Books (HarperCollins)|9780136829287\n2012|CreateSpace Independent Publishing Platform|Basic ROBLOX Lua Programming: (Black and White Edition)|LaRouche, Brandon John|9781475026047\n2021|Packt Publishing - ebooks Account|Coding Roblox Games Made Easy: The Ultimate Guide to Creating Games with Roblox Studio and Lua programming|Zander Brumbaugh|9781800561991\n2008|Lua.org|Lua Programming Gems||9788590379843\n2009|Apress|Beginning Lua with World of Warcraft Add-ons|Emmerich, Paul|9781430223726\n2014|Packt Publishing|Learning Game AI Programming with Lua|Young, David|9781783281336\n2013|Packt Publishing|CryENGINE Game Programming with C++, C#, and Lua|Lundgren, Filip and Pearce-Authers, Ruan|9781849695916\n2015|Packt Publishing|Lua Game Development Cookbook: Over 70 recipes that will help you master the elements and best practices required to build a modern game engine using Lua|Kasuba, Mario|9781849515504\n2018-12-20T00:00:01Z|Apress|Developing Games on the Raspberry Pi: App Programming with Lua and LÖVE|Kenlon, Seth|9781484241691\n2013|CreateSpace Independent Publishing Platform|ComputerCraft: Lua Programming in Minecraft|Monk, Matthew and Monk, Simon|9781481927659\n2001|O'Reilly Media|Programming Lua|Roberto Ierusalimschy|9780596101114\n2019||Lua Programming Language, First Edition|Lua Publishing|9781704204666\n2010||Lua Programming Language: Lua, Luatex, Luaforge|Books and LLC|9781157436553\n2007|John Wiley & Sons, Ltd.|Beginning Lua Programming|Kurt Jung|9780470139523\n2009||Lua (programming Language)|Frederic P. Miller and Agnes F. Vandome and John McBrewster and Miller and Frederic P. and Vandome and Agnes F. and McBrewster and John|9786130256982\n|Brandon Larouche|Basic Roblox Lua Programming||9780985451301\n20150728|Packt Publishing|Lua Game Development Cookbook|Mario Kasuba|9781849515511\n2009|ToÌkyoÌ : AsukiÌmediawaÌkusu, ToÌkyoÌ : KadokawaguruÌpupaburisshingu. 2009 ;|Programming In Lua Lua Programming Language Official Reference (2009) Isbn: 4048677977 [japanese Import]|Roberto Ierusalimschy; Kei ShinjoÌ|9784048677974\n20131003|Packt Publishing|LOVE for Lua Game Programming|Darmie Akinlaja|9781782161615\n20141128|Packt Publishing|Learning Game AI Programming with Lua|David Young|9781783281343\n|Packt Pub.|LÖve For Lua Game Programming: Master The Lua Programming Language And Build Exciting Strategy-based Games In 2d Using The LÖve Framework|Akinlaja, Darmie.|9781782161608", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Typed Lua: An Optional Type System for Lua|10.1145/2617548.2617553|20|1|André Murbach Maidl and Fabio Mascarenhas and R. Ierusalimschy|ea5301e30ef4b41aec9fa4195b6203cf109460d7\n2009|Programming with Multiple Paradigms in Lua|10.1007/978-3-642-11999-6_1|14|0|R. Ierusalimschy|f2b781bf970a8b7c73aa12bd87c1fc615f83a9b2\n2003|Processing sequence annotation data using the Lua programming language.|10.11234/GI1990.14.154|11|0|Y. Ueno and Masanori Arita and Toshitaka Kumagai and K. Asai|cb7050a0e9215caa9956b66f67ee691697f11009\n2017|Lua Code: Security Overview and Practical Approaches to Static Analysis|10.1109/SPW.2017.38|9|0|Andrei Costin|88cc784a7e846af8889eeb524f9b0dc480d6368a\n2017|Luandri: A Clean Lua Interface to the Indri Search Engine|10.1145/3077136.3080650|5|0|Bhaskar Mitra and Fernando Diaz and Nick Craswell|0af8eea643b0391fb552db4828d7706366ee546f\n2015|Unit test code generator for lua programming language|10.1109/ICODSE.2015.7437005|5|0|Junno Tantra Pratama Wibowo and B. Hendradjaya and Yani Widyani|73eac2f3afa05a25133296f4d89df3c8472e6a1f\n2013|LuaRocks - A Declarative and Extensible Package Management System for Lua|10.1007/978-3-642-40922-6_2|4|0|Hisham H. Muhammad and Fabio Mascarenhas and R. Ierusalimschy|f14491f989fc88b8e64986ff25bcee3e4bec41a6\n2015|GUI rendering engine utilizing Lua as script|10.1109/CEWS.2015.7867151|3|0|Dusan Zivkov and Daniel Kurtjak and Mladen Grumic|084164a7f0f9bf5c01de64acea10b7add97fb427\n2015|Operational Semantics for Featherweight Lua|10.31979/etd.xysf-s2af|3|1|Hao Lin|efa547deaa7a77b4e9009cd38bb8035d611c968a\n2012|From visual scripting to Lua|10.1145/2389836.2389848|1|0|Mwawi F. Msiska and L. V. Zijl|d2a9f3989f76dec14c09105735ef0d66245fe407\n2016|Towards a GPU Abstraction for Lua|10.1109/SBAC-PADW.2016.11|1|0|Raphael Ribeiro and Paulo Motta|0fd3290aea2a7b33cd37dab5a9c0a13c928b87cc\n2019|Beginning Lua Scripting|10.1007/978-1-4842-5073-0_8|1|0|Jaken Chandler Herman|3fbf132d1d63c88d6560bc41570058b9b6f2590a\n2017|Remote Sensing Image Processing Functions in Lua Language|10.6062/JCIS.2017.08.03.0133|1|0|R. F. B. Marujo and Leila Maria Garcia Fonseca and T. Körting and H. N. Bendini and G. R. Queiroz and L. Vinhas and K. Ferreira|a5233f484177b2d6a042c864a80392eb45cc768a" }, "luajit": { "title": "LuaJIT", "appeared": 2005, "type": "compiler", "creators": [ "Mike Pall" ], "website": "http://luajit.org/luajit.html", "country": [ "Germany and Denmark" ], "originCommunity": [ "https://github.com/LuaJIT" ], "githubRepo": { "firstCommit": 2009, "stars": 3562, "forks": 779, "subscribers": 243, "created": 2015, "updated": 2022, "description": "Mirror of the LuaJIT git repository", "issues": 63, "url": "https://github.com/LuaJIT/LuaJIT" } }, "luarocks-pm": { "title": "luarocks-pm", "appeared": 2007, "type": "packageManager", "website": "https://luarocks.org/", "country": [ "United States and Australia and Brazil" ], "originCommunity": [ "https://github.com/luarocks" ], "domainName": { "registered": 2007, "awisRank": { "2022": 775839 }, "name": "luarocks.org" }, "packageCount": 2047, "forLanguages": [ "lua" ] }, "luau": { "title": "luau", "appeared": 2020, "type": "pl", "description": "Luau is a fast, small, safe, gradually typed embeddable scripting language derived from Lua. It is used by Roblox game developers to write game code, as well as by Roblox engineers to implement large parts of the user-facing application code as well as portions of the editor (Roblox Studio) as plugins.", "website": "https://roblox.github.io/luau/", "country": [ "United States" ], "originCommunity": [ "https://github.com/Roblox/luau/issues" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "example": [ "type Point = { x: number, y: number }\n\nlocal p = { x = 1, y = 2 }\n\nprint(p.x, p.y)\n-- print(p.z) results in a type error" ] }, "lucene-query-syntax": { "title": "Apache Lucene", "appeared": 1999, "type": "queryLanguage", "reference": [ "https://lucene.apache.org/core/2_9_4/queryparsersyntax.html" ], "country": [ "United States" ], "originCommunity": [ "Apache Software Foundation" ], "wikipedia": { "related": [ "java", "object-pascal", "perl", "csharp", "python", "ruby", "php", "pdf", "html", "c" ], "summary": "Apache Lucene is a free and open-source information retrieval software library, originally written completely in Java by Doug Cutting. It is supported by the Apache Software Foundation and is released under the Apache Software License. Lucene has been ported to other programming languages including Object Pascal, Perl, C#, C++, Python, Ruby and PHP.", "created": 2004, "backlinksCount": 220, "pageId": 522923, "revisionCount": 657, "dailyPageViews": 187, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Apache_Lucene" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "lucid-chart-app": { "title": "Lucidchart", "appeared": 2008, "type": "application", "website": "https://www.lucidchart.com/", "country": [ "United States" ], "originCommunity": [ "Lucid Software Inc" ], "domainName": { "registered": 2008, "awisRank": { "2022": 6200 }, "name": "lucidchart.com" }, "wikipedia": { "summary": "Lucidchart is a web-based proprietary platform that is used to allow users to collaborate on drawing, revising and sharing charts and diagrams.Lucidchart runs on browsers that support HTML5. This means it does not require updates of third party software like flash. In 2010, the firm announced they had integrated into the Google Apps Marketplace.The company raised $1 million in \"angel funding\" in 2011.On 17 October 2018, the firm announced it had raised an additional $72 million from Meritech Capital and ICONIQ Capital.", "backlinksCount": 101, "pageId": 26145412, "dailyPageViews": 117, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Lucidchart" } }, "lucid-lang": { "title": "Lucid", "appeared": 2014, "type": "template", "creators": [ "Chris Done" ], "country": [ "England" ], "originCommunity": [ "https://github.com/chrisdone/lucid/issues" ], "writtenIn": [ "haskell" ], "example": [ "table_ [rows_ \"2\"]\n (tr_ (do td_ [class_ \"top\",colspan_ \"2\",style_ \"color:red\"]\n (p_ \"Hello, attributes!\")\n td_ \"yay!\"))" ], "githubRepo": { "firstCommit": 2014, "stars": 253, "forks": 34, "subscribers": 9, "created": 2014, "updated": 2022, "description": "Clear to write, read and edit DSL for writing HTML", "issues": 0, "url": "https://github.com/chrisdone/lucid" }, "repoStats": { "firstCommit": 2014, "commits": 243, "committers": 28, "files": 40 } }, "lucid-representations": { "title": "Lucid representations", "appeared": 1991, "type": "pl", "reference": [ "https://cs.nyu.edu/media/publications/TR1995-714.pdf", "https://semanticscholar.org/paper/31983782c4c2d558f7256080b96e38bd42e6910f" ], "country": [ "United States" ], "originCommunity": [ "Courant Institute" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6832", "centralPackageRepositoryCount": 0 }, "lucid": { "title": "LUCID", "appeared": 1976, "type": "pl", "creators": [ "Edward A. Ashcroft", "William W. Wadge" ], "reference": [ "https://news.ycombinator.com/item?id=14233054" ], "country": [ "Canada and United States" ], "originCommunity": [ "University of Victoria", "SRI International" ], "wikipedia": { "example": [ "h\n where\n h = 1 fby merge(merge(2 * h, 3 * h), 5 * h);\n merge(x,y) = if xx <= yy then xx else yy fi\n where \n xx = x upon xx <= yy;\n yy = y upon yy <= xx;\n end;\n end;" ], "related": [ "iswim", "sisal", "lustre" ], "summary": "Lucid is a dataflow programming language designed to experiment with non-von Neumann programming models. It was designed by Bill Wadge and Ed Ashcroft and described in the 1985 book Lucid, the Dataflow Programming Language. pLucid was the first interpreter for Lucid.", "pageId": 1485589, "dailyPageViews": 19, "created": 2005, "backlinksCount": 21, "revisionCount": 119, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/Lucid_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lucid", "hopl": "https://hopl.info/showlanguage.prx?exp=960", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010|LAP Lambert Academic Publishing|Hybrid Intensional Computing in GIPSY: JLucid, Objective Lucid and GICF|Mokhov, Serguei|9783838311982\n||Lucid (programming Language)|Miller and Frederic P. and Vandome and Agnes F. and McBrewster and John|9786133616837" }, "lucinda": { "title": "Lucinda", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6999da0d197a52269098eb8f7c456990fd177436" ], "country": [ "England" ], "originCommunity": [ "University of York" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1641", "centralPackageRepositoryCount": 0 }, "luna-1": { "title": "Luna", "appeared": 2011, "type": "pl", "creators": [ "TJ Holowaychuk" ], "description": "Luna is an expressive, minimalistic, elegant programming language implemented in C. With cooperative thread concurrency at its core, async I/O, and influences derived from languages such as Lua, io, Rust, Ruby, and C. Luna favours unification and minimalism over minor obscure conveniences, providing the true convenience of a simple effective language. This includes omitting features which facilitate magic such as getters/setters, method_missing-style delegation etc. This project is very much a work in progress, as I explore the wonderful world of VMs! feel free to join.", "website": "https://github.com/tj/luna", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/tj/luna/issues" ], "example": [ "def greet(name:string)\n return \"Hello \" + name\nend" ], "githubRepo": { "stars": 2400, "forks": 160, "subscribers": 132, "created": 2011, "updated": 2017, "description": "luna programming language - a small, elegant VM implemented in C", "url": "https://github.com/tj/luna" }, "repoStats": { "firstCommit": 2011, "commits": 639, "committers": 16, "files": 78 } }, "luna": { "title": "Luna", "appeared": 2015, "type": "pl", "creators": [ "Wojciech Danilo" ], "description": "Now called Enso.", "website": "https://www.luna-lang.org/", "renamedTo": [ "enso" ], "aka": [ "Enso" ], "country": [ "United States and Poland" ], "originCommunity": [ "https://github.com/enso-org" ], "domainName": { "registered": 2016, "name": "luna-lang.org" }, "related": [ "enso" ], "visualParadigm": true, "githubRepo": { "firstCommit": 2015, "stars": 5552, "forks": 205, "subscribers": 93, "created": 2016, "updated": 2022, "description": "Hybrid visual and textual functional programming.", "issues": 28, "url": "https://github.com/luna/luna" }, "repoStats": { "firstCommit": 2023, "commits": 3, "committers": 2, "files": 1 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n14612680|Luna – Visual and textual functional programming language|http://www.luna-lang.org|2017-06-22 15:00:35 UTC|1498143635|interpol_p|310|944", "twitter": "https://twitter.com/luna_language", "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Visual-Textual Framework for Serverless Computation: A Luna Language Approach|10.1109/UCC-Companion.2018.00052|5|0|Piotr Moczurad and M. Malawski|de853fc32841250ca10792e74d0696d7691c4995" }, "lunar": { "title": "lunar", "appeared": 2017, "type": "pl", "creators": [ "David A. Moon" ], "website": "http://users.rcn.com/david-moon/Lunar/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/f1jcdf/lunar_programming_language_by_david_a_moon/" ] }, "lush": { "title": "Lush", "appeared": 2002, "type": "pl", "creators": [ "Leon Bottou", "Yann Le Cun" ], "description": "Lush is an object-oriented programming language designed for researchers, experimenters, and engineers interested in large-scale numerical and graphic applications. Lush is designed to be used in situations where one would want to combine the flexibility of a high-level, weakly-typed interpreted language, with the efficiency of a strongly-typed, natively-compiled language", "website": "https://lush.sourceforge.net/index.html", "documentation": [ "https://lush.sourceforge.net/doc.html" ], "reference": [ "http://wiki.c2.com/?LushLanguage" ], "standsFor": "Lisp Universal Shell", "example": [ "(for (i 1 100)\n (for (j 1 100)\n (if (= i j) (print (* i j))))))" ], "gitRepo": "https://sourceforge.net/projects/lush/", "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lush", "hopl": "https://hopl.info/showlanguage.prx?exp=8596", "centralPackageRepositoryCount": 0 }, "lustre": { "title": "Lustre", "appeared": 1993, "type": "pl", "country": [ "France and United States" ], "originCommunity": [ "Esterel Technologies" ], "wikipedia": { "example": [ "node Edge (X : bool) returns (E : bool);\nlet\n E = false -> X and not pre X;\ntel" ], "related": [ "esterel", "signal" ], "summary": "Lustre is a formally defined, declarative, and synchronous dataflow programming language for programming reactive systems. It began as a research project in the early 1980s. A formal presentation of the language can be found in the 1991 Proceedings of the IEEE. In 1993 it progressed to practical, industrial use in a commercial product as the core language of the industrial environment SCADE, developed by Esterel Technologies. It is now used for critical control software in aircraft, helicopters, and nuclear power plants.", "pageId": 2211835, "dailyPageViews": 26, "created": 2005, "backlinksCount": 22, "revisionCount": 51, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Lustre_(programming_language)" }, "tiobe": { "id": "Lustre" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1161", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n||Lustre (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133175624" }, "lux": { "title": "Lux", "appeared": 2014, "type": "pl", "creators": [ "Eduardo Julián" ], "website": "https://luxlang.github.io/lux/", "fileExtensions": [ "lux" ], "country": [ "Dominican Republic" ], "originCommunity": [ "https://github.com/LuxLang" ], "compilesTo": [ "javascript", "java", "php", "python", "r", "ruby", "scheme" ], "githubRepo": { "stars": 1500, "forks": 51, "subscribers": 69, "created": 2014, "updated": 2022, "description": "The Lux Programming Language", "url": "https://github.com/LuxLang/lux/" }, "repoStats": { "firstCommit": 2014, "commits": 2504, "committers": 15, "files": 2004 } }, "lyapas": { "title": "LYaPAS", "appeared": 1964, "type": "pl", "creators": [ "Arkady D.Zakrevskij" ], "country": [ "Union of Soviet Socialist Republics or Russia" ], "originCommunity": [ "Siberian Physical-Technical Institute" ], "wikipedia": { "related": [ "apl" ], "summary": "Logical Language for the Representation of Synthesis Algorithms (LYaPAS, Russian: ЛЯПАС) is a programming language created in the Soviet Union in 1964, by Arkady D.Zakrevskij of the Laboratory of System Programming and Logical Synthesis, of the Academy of Sciences of the Byelorussian SSR, since renamed the National Academy of Sciences of Belarus.LYaPAS is an extension to the programming language APL, and was initially designed especially for non-numeric programming for the Soviet designed and built line of mainframe computers named Ural-1. An interesting feature of LYaPAS is its use of octal numbers. A further refinement of LYaPAS is LYaPAS-M.", "created": 2008, "backlinksCount": 47, "pageId": 18305664, "revisionCount": 13, "dailyPageViews": 6, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/LYaPAS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=430", "centralPackageRepositoryCount": 0 }, "lygon": { "title": "Lygon", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/13269feafaf99d803fa9f560f2555dd07e104713" ], "country": [ "Australia" ], "originCommunity": [ "Australian National University" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Lygon", "hopl": "https://hopl.info/showlanguage.prx?exp=2564", "centralPackageRepositoryCount": 0 }, "lynx": { "title": "Lynx", "appeared": 1984, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Wisconsin–Madison" ], "wikipedia": { "summary": "Lynx is a programming language for large distributed networks, using remote procedure calls. It was developed by the University of Wisconsin–Madison in 1984 for the Charlotte multicomputer operating system. In 1986 at the University of Rochester Lynx was ported to the Chrysalis operating system running on a BBN Butterfly multiprocessor.", "pageId": 18530, "created": 2001, "backlinksCount": 9, "revisionCount": 24, "dailyPageViews": 10, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Lynx_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1093", "fileType": "text", "centralPackageRepositoryCount": 0 }, "lyric": { "title": "Language for Your Remote Instruction by Computer", "appeared": 1966, "type": "pl", "description": "Language for Your Remote Instruction by Computer.", "reference": [ "https://dl.acm.org/doi/abs/10.1145/965762.965765?download=true" ], "standsFor": "Language for Your Remote Instruction by Computer", "country": [ "Unknown" ], "originCommunity": [ "Education and Training Consultants Co" ], "wikipedia": { "backlinksCount": 50, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Lyric" }, "hopl": "https://hopl.info/showlanguage.prx?exp=266", "wordRank": 8043 }, "lyx-editor": { "title": "LyX", "appeared": 1995, "type": "editor", "website": "https://www.lyx.org/", "country": [ "Various" ], "originCommunity": [ "https://www.lyx.org/MailingLists" ], "domainName": { "registered": 1998, "awisRank": { "2022": 455918 }, "name": "lyx.org" }, "wikipedia": { "related": [ "qt", "latex", "linux", "xetex", "bibtex", "subversion" ], "summary": "LyX (styled as L Y X {\\displaystyle \\mathbf {L} \\!{}_{\\mathbf {\\displaystyle Y} }\\!\\mathbf {X} } ; pronounced [ˈlɪks]) is an open source document processor based on the LaTeX typesetting system. Unlike most word processors, which follow the WYSIWYG (\"what you see is what you get\") paradigm, LyX has a WYSIWYM (\"what you see is what you mean\") approach, where what shows up on the screen is only an approximation of what will show up on the page. Since LyX largely functions as a front-end to the LaTeX typesetting system, it has the power and flexibility of LaTeX, and can handle documents including books, notes, theses, to academic papers, letters, etc. Knowledge of the LaTeX markup language is not necessary for basic usage, although a variety of specialized formatting is only possible by adding LaTeX directives directly into the page. LyX is popular among technical authors and scientists for its advanced mathematical modes, though it is increasingly used by non-mathematically-oriented scholars as well for its bibliographic database integration and ability to manage multiple files. LyX has also become popular among self-publishers.LyX is available for various operating systems, including Windows, macOS, Linux, UNIX, OS/2 and Haiku. LyX can be redistributed and modified under the terms of the GNU General Public License and is thus free software.", "backlinksCount": 159, "pageId": 166127, "created": 2003, "revisionCount": 493, "dailyPageViews": 130, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/LyX" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "m-expressions": { "title": "Meta Expressions", "appeared": 1960, "type": "dataNotation", "description": "The project of defining M-expressions precisely and compiling them or at least translating them into S-expressions was neither finalized nor explicitly abandoned. It just receded into the indefinite future, and a new generation of programmers appeared who preferred internal notation to any FORTRAN-like or ALGOL-like notation that could be devised.", "standsFor": "Meta Expressions", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "example": [ " [1;2;3]\n f[x;y]\n label[square;λ[[x];product[x;x]]]\n [lessthan[x;0] → negative[x]; T → x]" ], "wikipedia": { "summary": "In computer programming, M-expressions (or meta-expressions) were an early proposed syntax for the Lisp programming language, inspired by contemporary languages such as Fortran and ALGOL.", "backlinksCount": 93, "pageId": 301782, "dailyPageViews": 43, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/M-expression" } }, "m-lisp": { "title": "M-LISP", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/770ed6c27f192a139325c49769da2749cc54f7e0" ], "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1644", "centralPackageRepositoryCount": 0 }, "m-programming-language": { "title": "M", "appeared": 2008, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "https://www.msharp.co.uk/" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/M_Sharp" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "m2001": { "title": "M2001", "appeared": 2001, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Trinity University" ], "wikipedia": { "example": [ "matrix polynomial rationomial stack queue list\n powerseries series sequence tree graph digraph\n MATHEMATICAL CLASSES ABSTRACT CLASSES\n | |\n | |\n | |\n +-------------------------+---------------------+\n |\n |\n |\n product sum set string exponential subdomain\n STRUCTURED TYPES\n |\n |\n |\n boolean character natural integer rational real complex text\n COMPUTATIONAL TYPES" ], "related": [ "pascal", "modula-2" ], "summary": "M2001 is a modular educational mathematical programming language for developing and presenting mathematical algorithms, from the modern discrete to the classical continuous mathematics. M2001 is built on a semantic framework that is based in category theory and has a syntax similar to that of Pascal or Modula-2. It is designed purely for pedagogic use, so efficiency and ease of implementation have been far less important in its development than generality and range of application. It was created to play an important role in forming a formal algorithmic foundation for first-year college math students.", "pageId": 941103, "created": 2004, "backlinksCount": 11, "revisionCount": 16, "dailyPageViews": 5, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/M2001" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7622", "fileType": "text", "centralPackageRepositoryCount": 0 }, "m3db": { "title": "m3db", "appeared": 2016, "type": "database", "creators": [ "Xi Chen" ], "description": "A distributed time series database.", "website": "https://www.m3db.io/", "country": [ "United States" ], "originCommunity": [ "https://github.com/m3db" ], "domainName": { "registered": 2018, "awisRank": { "2022": 2196812 }, "name": "m3db.io" }, "githubRepo": { "firstCommit": 2016, "stars": 4161, "forks": 399, "subscribers": 103, "created": 2016, "updated": 2022, "description": "M3 monorepo - Distributed TSDB, Aggregator and Query Engine, Prometheus Sidecar, Graphite Compatible, Metrics Platform", "issues": 179, "url": "https://github.com/m3db/m3" }, "repoStats": { "firstCommit": 2016, "commits": 8572, "committers": 149, "files": 3551 } }, "m4": { "title": "M4", "appeared": 1977, "type": "pl", "creators": [ "Brian Kernighan", "Dennis Ritchie" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "example": [ "\n

1. First Section

\n

2. Second Section

\n

3. Conclusion

\n" ], "related": [ "assembly-language", "ratfor", "unix", "fortran", "html", "freebsd" ], "summary": "m4 is a general-purpose macro processor included in all UNIX-like operating systems, and is a component of the POSIX standard. The language was designed by Brian Kernighan and Dennis Ritchie for the original versions of UNIX. It is an extension of an earlier macro processor m3, written by Ritchie for the AP-3 minicomputer. The macro preprocessor operates as a text-replacement tool. It is employed to re-use text templates, typically in computer programming applications, but also in text editing and text-processing applications. Most users require m4 as a dependency of GNU autoconf.", "pageId": 625653, "dailyPageViews": 99, "created": 2004, "backlinksCount": 256, "revisionCount": 200, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/M4_(computer_language)" }, "githubLanguage": { "fileExtensions": [ "m4", "mc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.m4", "repos": 2405, "id": "M4" }, "githubBigQuery": { "repos": 15666, "users": 12126, "id": "M4" }, "linguistGrammarRepo": { "sampleCount": 1, "example": [ "dnl Took from https://en.wikipedia.org/wiki/M4_(computer_language)\ndivert(-1)\n\nM4 has multiple output queues that can be manipulated with the\n`divert' macro. Valid queues range from 0 to 10, inclusive, with\nthe default queue being 0.\n\nCalling the `divert' macro with an invalid queue causes text to be\ndiscarded until another call. Note that even while output is being\ndiscarded, quotes around `divert' and other macros are needed to\nprevent expansion.\n\n# Macros aren't expanded within comments, meaning that keywords such\n# as divert and other built-ins may be used without consequence.\n\n# HTML utility macro:\n\ndefine(`H2_COUNT', 0)\n\n# The H2_COUNT macro is redefined every time the H2 macro is used:\n\ndefine(`H2',\n\t`define(`H2_COUNT', incr(H2_COUNT))

H2_COUNT. $1

')\n\ndivert(1)dnl\ndnl\ndnl The dnl macro causes m4 to discard the rest of the line, thus\ndnl preventing unwanted blank lines from appearing in the output.\ndnl\nH2(First Section)\nH2(Second Section)\nH2(Conclusion)\ndnl\ndivert(0)dnl\ndnl\n\nundivert(1)dnl One of the queues is being pushed to output.\n\n" ], "url": "https://github.com/Alhadis/language-etc" }, "helloWorldCollection": [ "# Hello World for the m4 macro processor\nHello\n" ], "leachim6": { "filepath": "m/M4.m4", "fileExtensions": [ "m4" ], "example": [ "Hello" ], "id": "M4" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:M4", "quineRelay": "M4", "rijuRepl": { "example": [ "errprint(`Hello, world!')\n" ], "id": "https://riju.codes/m4" }, "tryItOnline": "m4", "tiobe": { "id": "M4" }, "hopl": "https://hopl.info/showlanguage.prx?exp=766", "ubuntuPackage": "m4", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n16-03-2016|Packt Publishing|ARM® Cortex® M4 Cookbook|Dr. Mark Fisher|9781782176510\n20171016|Springer Nature|Getting Started with Tiva ARM Cortex M4 Microcontrollers|Dhananjay V. Gadre; Sarthak Gupta|9788132237662", "semanticScholar": "" }, "m4sugar": { "title": "M4Sugar", "appeared": 2003, "type": "pl", "description": "M4 by itself provides only a small, but sufficient, set of all-purpose macros. M4sugar introduces additional generic macros. Its name was coined by Lars J. Aas: “Readability And Greater Understanding Stands 4 M4sugar”", "reference": [ "http://www6.gnu.org/software/autoconf/manual/autoconf.pdf" ], "country": [ "United States" ], "originCommunity": [ "Free Software Foundation, Inc." ], "githubLanguage": { "fileExtensions": [ "m4" ], "trendingProjectsCount": 0, "type": "programming", "group": "M4", "filenames": [ "configure.ac" ], "aceMode": "text", "tmScope": "source.m4", "aliases": [ "autoconf" ], "repos": 0, "id": "M4Sugar" }, "linguistGrammarRepo": { "sampleCount": 2, "example": [ "m4_define([m4_list_declare], [m4_do(\n\t[m4_define([$1_GET], [m4_expand([m4_list_nth([$1], $][1)])])],\n\t[m4_define([$1_FOREACH], [m4_foreach([item], [m4_dquote_elt(m4_list_contents([$1]))], m4_quote($][1))])],\n)])\n\nm4_define([m4_list_add], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_ifndef(_LIST_NAME,\n\t\t[m4_define(_LIST_NAME, m4_dquote(m4_escape([$2])))],\n\t\t[m4_define(_LIST_NAME, m4_dquote(m4_list_contents([$1]), m4_escape([$2])))],\n\t)],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\nm4_define([m4_list_contents], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_ifndef(_LIST_NAME, [], m4_quote(_LIST_NAME))],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\nm4_define([m4_list_nth], [m4_argn([$2], m4_list_contents([$1]))])\n\nm4_define([m4_list_pop_front], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_car(m4_unquote(_LIST_NAME))],\n\t[m4_define(_LIST_NAME, m4_cdr(m4_unquote(_LIST_NAME)))],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\nm4_define([m4_list_pop_back], [m4_do(\n\t[m4_pushdef([_LIST_NAME], [[_LIST_$1]])],\n\t[m4_define(_LIST_NAME, m4_dquote(m4_reverse(m4_unquote(_LIST_NAME))))],\n\t[m4_list_pop_front([$1])],\n\t[m4_define(_LIST_NAME, m4_dquote(m4_reverse(m4_unquote(_LIST_NAME))))],\n\t[m4_popdef([_LIST_NAME])],\n)])\n\ndnl\ndnl $1: List name\ndnl $2: What\ndnl $3: If contains\ndnl $4: If not\nm4_define([m4_list_contains], [m4_do(\n\t[m4_foreach([item], m4_list_contents([$1]), m4_if(item, [$2], [[$3]], [[$4]]))]\n)])" ], "url": "https://github.com/Alhadis/language-etc" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "mac": { "title": "MIT Algebraic Compiler", "appeared": 1957, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/J._Halcombe_Laning" ], "standsFor": "MIT Algebraic Compiler", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=89", "wordRank": 1420 }, "macaims": { "title": "MacAims", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/39551ebeb924889c1d4467d6f0fcbcbef5d1c3f0" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6537", "centralPackageRepositoryCount": 0 }, "macbasic": { "title": "MacBASIC", "appeared": 1985, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "related": [ "basic" ], "summary": "Macintosh Basic, or MacBASIC, was both a comprehensive programming language and a fully interactive development environment designed by Apple Inc. for the original Macintosh computer. It was developed by original Macintosh team member Donn Denman, with help from fellow Apple programmers Marianne Hsiung, Larry Kenyon, and Bryan Stearns, as part of the original Macintosh development effort starting in late 1981.MacBASIC was released as beta software in 1985, and was adopted for use in places such as the Dartmouth College computer science department, for use in an introductory programming course. In November 1985, Apple abruptly ended the project as part of a deal with Microsoft to extend the license for BASIC on the Apple II. Although Apple retracted MacBASIC, unlicensed copies of the software and manual still circulated, but because MacBASIC was no longer supported by Apple and not designed to be 32-bit-clean, interest eventually died out. Benchmarks published in the April 1984 issue of BYTE magazine suggested that MacBASIC had better performance as compared to Microsoft BASIC. The language included modern looping control structures, user-defined functions, graphics, and access to the Macintosh Toolbox. The development environment supported multiple programs running simultaneously with symbolic debugging including breakpoints and single-step execution.", "created": 2009, "backlinksCount": 10, "pageId": 24127255, "revisionCount": 52, "dailyPageViews": 5, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/MacBASIC" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "macbook-air-machine": { "title": "MacBook Air", "appeared": 2008, "type": "computingMachine", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/MacBook_Air" } }, "macchiato": { "title": "Macchiato", "appeared": 2019, "type": "pl", "creators": [ "Eddie aka. tamamu" ], "website": "https://github.com/tamamu/macchiato", "fileExtensions": [ "at" ], "country": [ "Japan" ], "originCommunity": [ "https://github.com/tamamu/macchiato/issues" ], "compilesTo": [ "javascript" ], "writtenIn": [ "elixir" ], "example": [ "(defn inc (x) (+ 1 x))\n(defn fizzbuzz (n)\n (doseq (i (range 1 n#inc))\n (match (list (mod i 3) (mod i 5))\n (0 0) (console:log \"FizzBuzz\")\n (0 _) (console:log \"Fizz\")\n (_ 0) (console:log \"Buzz\")\n _ (console:log i))))\n(fizzbuzz 20)" ], "githubRepo": { "stars": 0, "forks": 0, "subscribers": 2, "created": 2019, "updated": 2019, "description": "An AltJS of a dialect of Lisp", "url": "https://github.com/tamamu/macchiato" }, "repoStats": { "firstCommit": 2019, "commits": 4, "committers": 2, "files": 14 } }, "mace": { "title": "MACE", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4690bf68c36dd71eb23cd9b00981976034f2915c" ], "country": [ "United States" ], "originCommunity": [ "University of Southern California Los Angeles" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2202", "centralPackageRepositoryCount": 0 }, "machiavelli": { "title": "Machiavelli", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5d8c270db2e9970bd681b07fb2768a88247d82ce" ], "country": [ "United States" ], "originCommunity": [ "University of Pennsylvania" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1496", "centralPackageRepositoryCount": 0 }, "macintosh-common-lisp": { "title": "Macintosh Common Lisp", "appeared": 1984, "type": "pl", "reference": [ "https://groups.google.com/g/comp.lang.lisp/" ], "country": [ "United States" ], "originCommunity": [ "Digitool, Inc" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Macintosh_Common_Lisp" }, "isbndb": "", "semanticScholar": "" }, "macintosh-machine": { "title": "Macintosh", "appeared": 1984, "type": "computingMachine", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Macintosh" } }, "macro-10": { "title": "MACRO-10", "appeared": 1978, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "lineCommentToken": [ [ ";" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "HELLO WORLD MACRO %53B(1247) 17:29 7-Apr-:9 Page 1\nHELLO MAC 7-Apr-:9 17:29\n\n TITLE HELLO WORLD\n ; 'Hello world' in MACRO-10 for TOPS-10\n SEARCH UUOSYM ; Make UUO symbol names available\n\n 000000' 110 145 154 154 157 LAB: ASCIZ /Hello, world!\n 000001' 054 040 167 157 162\n 000002' 154 144 041 015 012 / ; NUL-terminated ASCII string with CRLF\n 000003' 000 000 000 000 000\n\n 000004' 047 00 0 00 000000 START: RESET ; Initialise job to clean runtime state\n 000005' 051 03 0 00 000000' OUTPUT: OUTSTR LAB ; Output string starting at LAB:\n 000006' 047 01 0 00 000012 MONRT. ; Return to monitor\n 000007' 254 00 0 00 000005' JRST OUTPUT ; Restart at OUTPUT: if user CONTINUEs job\n 000004' END START ; End assembly, set program start address\n\nNO ERRORS DETECTED\n\nPROGRAM BREAK IS 000010\nCPU TIME USED 58:25.100\n\n36P CORE USED\n\nHELLO WORLD MACRO %53B(1247) 17:29 7-Apr-:9 Page S-1\nHELLO MAC 7-Apr-:9 17:29 SYMBOL TABLE\n\nLAB 000000'\nMONRT. 047040 000012\nOUTPUT 000005'\nOUTSTR 051140 000000\nRESET 047000 000000\nSTART 000004'" ], "related": [ "assembly-language" ], "summary": "MACRO-10 is an assembly language with extensive macro facilities for DEC's PDP-10-based Mainframe computer systems, the DECsystem-10 and the DECSYSTEM-20. MACRO-10 is implemented as a two-pass assembler.", "created": 2009, "backlinksCount": 11, "pageId": 22291061, "revisionCount": 25, "dailyPageViews": 4, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/MACRO-10" }, "centralPackageRepositoryCount": 0 }, "macro-11": { "title": "MACRO-11", "appeared": 1974, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "example": [ ".MACRO HELLO\nERRORS DETECTED: 0\n\n.LINK HELLO\n\n.R HELLO\nHello, world!\n." ], "related": [ "assembly-language", "unix" ], "summary": "MACRO-11 is an assembly language with macro facilities for PDP-11 minicomputers from Digital Equipment Corporation (DEC). It is the successor to PAL-11 (Program Assembler Loader), an earlier version of the PDP-11 assembly language without macro facilities. The MACRO-11 assembly language was designed for the PDP-11 minicomputer family. It was supported on all DEC PDP-11 operating systems. PDP-11 Unix systems also include an assembler (called \"as\"), structurally similar to MACRO-11 but with different syntax and fewer features.", "created": 2005, "backlinksCount": 21, "pageId": 2864587, "revisionCount": 34, "dailyPageViews": 9, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/MACRO-11" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4442", "centralPackageRepositoryCount": 0 }, "macro-spitbol": { "title": "Macro SPITBOL", "appeared": 1971, "type": "pl", "reference": [ "https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.4380070106" ], "country": [ "United States and England" ], "originCommunity": [ "Courant Institute of Mathematical Sciences", "University of Leeds" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5510", "centralPackageRepositoryCount": 0 }, "macro": { "title": "MACRO", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9095359f3bc65c41d3879f5ae703b567848b3046" ], "country": [ "United States" ], "originCommunity": [ "UNIVAC EMCC" ], "wikipedia": { "summary": "Macro (or MACRO) may refer to:", "backlinksCount": 114, "pageId": 4638089, "dailyPageViews": 156, "created": 2006, "url": "https://en.wikipedia.org/wiki/Macro" }, "hopl": "https://hopl.info/showlanguage.prx?exp=857", "wordRank": 6238, "centralPackageRepositoryCount": 0 }, "macroml": { "title": "MacroML", "appeared": 2001, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Indiana University", "Yale University" ], "firstAnnouncement": "https://www.cs.indiana.edu/~sabry/papers/macroml.pdf", "announcementMethod": "paper", "wikipedia": { "related": [ "scheme" ], "summary": "MacroML is an experimental programming language based on the ML programming language family that seeks to reconcile ML's static typing systems, and the types of macro systems more commonly found in dynamically typed languages like Scheme; this reconciliation is difficult as macro transformations are typically Turing-complete and so can break the type safety guarantees static typing is supposed to provide.", "pageId": 2525770, "dailyPageViews": 5, "created": 2005, "backlinksCount": 5, "revisionCount": 18, "url": "https://en.wikipedia.org/wiki/MacroML" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "macsyma": { "title": "Project MAC’s SYmbolic MAnipulator", "appeared": 1968, "type": "pl", "description": "Macsyma (Project MAC’s SYmbolic MAnipulator[1]) is one of the oldest general purpose computer algebra systems which is still widely used. It was originally developed from 1968 to 1982 at MIT's Project MAC.", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "maxima", "multics", "fortran", "latex", "lisp", "common-lisp", "maple", "mathematica", "matlab", "linux" ], "summary": "Macsyma (Project MAC’s SYmbolic MAnipulator) is one of the oldest general purpose computer algebra systems which is still widely used. It was originally developed from 1968 to 1982 at MIT's Project MAC. In 1982, Macsyma was licensed to Symbolics and became a commercial product. In 1992, Symbolics Macsyma was spun off to Macsyma, Inc., which continued to develop Macsyma until 1999. That version is still available for Microsoft's Windows XP operating system. The 1982 version of MIT Macsyma remained available to academics and US government agencies, and it is distributed by the US Department of Energy (DOE). That version, DOE Macsyma, was maintained by Bill Schelter. Under the name of Maxima, it was released under the GPL in 1999, and remains under active maintenance.", "pageId": 303734, "created": 2006, "backlinksCount": 123, "revisionCount": 2, "dailyPageViews": 2, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/MACSYMA" }, "leachim6": { "filepath": "m/Macsyma.mac", "fileExtensions": [ "mac" ], "example": [ "print(\"Hello World\");\n" ], "id": "Macsyma" }, "hopl": "https://hopl.info/showlanguage.prx?exp=431", "fileType": "text", "centralPackageRepositoryCount": 0 }, "mad": { "title": "Michigan Algorithm Decoder", "appeared": 1959, "type": "pl", "standsFor": "Michigan Algorithm Decoder", "country": [ "United States" ], "originCommunity": [ "University of Michigan" ], "wikipedia": { "example": [ "PRINT FORMAT HELLOW\nVECTOR VALUES HELLOW=$13h0Hello, world*$\nEND OF PROGRAM" ], "related": [ "algol-58", "algol", "multics", "algol-60", "pl-i", "isbn" ], "summary": "MAD (Michigan Algorithm Decoder) is a programming language and compiler for the IBM 704 and later the IBM 709, IBM 7090, IBM 7040, UNIVAC 1107, UNIVAC 1108, Philco 210-211, and eventually the IBM S/370 mainframe computers. Developed in 1959 at the University of Michigan by Bernard Galler, Bruce Arden and Robert M. Graham, MAD is a variant of the ALGOL language. It was widely used to teach programming at colleges and universities during the 1960s and played a minor role in the development of CTSS, Multics, and the Michigan Terminal System computer operating systems. The archives at the Bentley Historical Library of the University of Michigan contain reference materials on the development of MAD and MAD/I, including three linear feet of printouts with hand-written notations and original printed manuals.", "pageId": 55579, "dailyPageViews": 24, "created": 2002, "backlinksCount": 43, "revisionCount": 147, "appeared": 1959, "url": "https://en.wikipedia.org/wiki/MAD_(programming_language)" }, "helloWorldCollection": [ " R Hello world in MAD\n\nPRINT FORMAT HELLOW\nVECTOR VALUES HELLOW=$13h0Hello, world*$\nEND OF PROGRAM" ], "tiobe": { "id": "MAD" }, "hopl": "https://hopl.info/showlanguage.prx?exp=92", "fileType": "text", "wordRank": 4248, "centralPackageRepositoryCount": 0, "isbndb": "" }, "madcap-vi": { "title": "MADCAP VI", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/edb9d7f3c18ad47f1c4879434a784a3d17dbea6f" ], "country": [ "United States" ], "originCommunity": [ "University of California, Los Alamos" ], "hasSemanticIndentation": { "example": "", "value": true }, "hopl": "https://hopl.info/showlanguage.prx?exp=2763", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "madcap": { "title": "MADCAP", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4bef4a1b67016e569ca7ef57bfc356829c2152ba" ], "country": [ "United States" ], "originCommunity": [ "University of California, Los Alamos" ], "hasSemanticIndentation": { "example": "", "value": true }, "hopl": "https://hopl.info/showlanguage.prx?exp=148", "centralPackageRepositoryCount": 0 }, "mads": { "title": "MADS", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/40fc5bbe839963cb6268ce5bf8e8471b9b98e6f3" ], "country": [ "United States" ], "originCommunity": [ "General Electric Co" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7250", "centralPackageRepositoryCount": 0, "isbndb": "" }, "mages": { "title": "mages", "appeared": 2016, "type": "pl", "creators": [ "Florian Rappl" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/FlorianRappl/Mages/issues" ], "githubRepo": { "firstCommit": 2016, "stars": 106, "forks": 10, "subscribers": 10, "created": 2016, "updated": 2022, "description": ":tophat: MAGES is a very simple, yet powerful, expression parser and interpreter.", "issues": 4, "url": "https://github.com/FlorianRappl/Mages" }, "repoStats": { "firstCommit": 2016, "commits": 618, "committers": 6, "files": 363 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n12071980|Show HN: A lightweight .NET-based scripting language|2016-07-11 16:03:22 UTC|1468253002|FlorianRappl|0|2" }, "magic-paper": { "title": "Magic Paper", "appeared": 1963, "type": "pl", "creators": [ "Jean E. Sammet" ], "description": "Early interactive symbolic math system.", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=432", "semanticScholar": "" }, "magik": { "title": "Magik", "appeared": 1989, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Smallworld Systems Ltd" ], "wikipedia": { "example": [ "my_procedure << _proc @my_procedure(a, b, c)\n _return a + b + c\n _endproc\n\n x << my_procedure(1, 2, 3) # x = 6" ], "related": [ "jvm", "smalltalk", "unix", "linux", "c", "csharp", "java" ], "summary": "Magik is an object-oriented programming language that supports multiple inheritance, polymorphism and is dynamically typed. It was designed implemented in 1989 by Arthur Chance, of Smallworld Systems Ltd, as part of Smallworld Geographical Information System (GIS). Following Smallworld's acquisition in 2000, Magik is now is provided by GE Energy, still as part of its Smallworld technology platform. Magik (Inspirational Magik) was originally introduced in 1990 and has been improved and updated over the years. Its current version is 5.1. In July 2012, Magik developers announced that they were in the process of porting Magik language on the Java virtual machine. The successful porting was confirmed by Oracle Corporation in November of the same year.", "pageId": 2988758, "dailyPageViews": 29, "created": 2005, "backlinksCount": 12, "revisionCount": 147, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Magik_(programming_language)" }, "tiobe": { "id": "Magik" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3912", "fileType": "text", "centralPackageRepositoryCount": 0 }, "magit": { "title": "Magit", "appeared": 2013, "type": "application", "creators": [ "Marius Vollmer" ], "description": "Magit is a complete text-based user interface to Git. It fills the glaring gap between the Git command-line interface and various GUIs, letting you perform trivial as well as elaborate version control tasks with just a couple of mnemonic key presses", "website": "https://magit.vc/", "documentation": [ "https://magit.vc/manual/" ], "reference": [ "https://github.com/magit/magit#readme" ], "country": [ "Unknown" ], "originCommunity": [ "https://emacs.stackexchange.com/questions/tagged/magit" ], "domainName": { "name": "magit.vc" }, "versions": { "2021": [ "v3.3.0" ] }, "githubRepo": { "stars": 57000, "forks": 758, "updated": 2022, "description": "Magit is an interface to the version control system Git, implemented as an Emacs package. Magit aspires to be a complete Git porcelain", "issues": 17, "url": "https://github.com/magit/magit" }, "wikipedia": { "example": [ "" ], "related": [ "git", "lisp", "emacs-lisp" ], "url": "https://en.wikipedia.org/wiki/Magit" } }, "magma": { "title": "MAGMA", "appeared": 1993, "type": "pl", "website": "http://magma.maths.usyd.edu.au", "country": [ "Australia" ], "originCommunity": [ "University of Sydney" ], "domainName": { "name": "magma.maths.usyd.edu.au" }, "wikipedia": { "summary": "Magma is a computer algebra system designed to solve problems in algebra, number theory, geometry and combinatorics. It is named after the algebraic structure magma. It runs on Unix-like operating systems, as well as Windows.", "pageId": 98628, "dailyPageViews": 26, "created": 2002, "backlinksCount": 63, "revisionCount": 166, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/Magma_(computer_algebra_system)" }, "projectEuler": { "memberCount": { "2019": 30, "2022": 32 }, "id": "Magma" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2207", "twitter": "https://twitter.com/magma_maths", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "magma2": { "title": "Magma2", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e64b2e80cd91b986d1f4e0f42d06b3b674604549" ], "country": [ "Italy" ], "originCommunity": [ "Universita di Pisa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1094", "centralPackageRepositoryCount": 0 }, "magritte": { "title": "magritte", "appeared": 2019, "type": "pl", "creators": [ "Jeanine Adkisson" ], "description": "This work proposes Magritte, a general-purpose language that is viable as a shell scripting language", "reference": [ "http://files.jneen.net/academic/thesis.pdf" ], "country": [ "Japan" ], "originCommunity": [ "Tokyo Institute Of Technology" ] }, "mai-basic-four": { "title": "MAI Basic Four", "appeared": 1974, "type": "pl", "country": [ "United States" ], "originCommunity": [ "MAI Systems Corporation" ], "wikipedia": { "related": [ "business-basic" ], "summary": "MAI Basic Four (sometimes written as Basic/Four Corporation or Basic 4) refers to a variety of Business Basic, the computers that ran it, and the company that sold them (its name at various times given as MAI Basic Four Inc., MAI Basic Four Information Systems, and MAI Systems Corporation). MAI Systems Corporation became a wholly owned subsidiary of Softbrands Inc. in 2006. Basic/Four Corporation was created as a subsidiary of Management Assistance, Inc. in Irvine, California. Basic/Four sold small business minicomputers that were assembled from Microdata Corporation CPUs. MAI Basic Four Business Basic was one of the first commercially available business BASIC interpreters. MAI Basic Four (the company) originally sold minicomputers but later offered superminicomputers and microcomputers. The computers ran an operating system with the BASIC interpreter integrated. In 1985, Wall Street financier Bennett S. LeBow purchased the company after it had experienced significant operating financial losses. In 1988, LeBow used the company as a platform for an unsuccessful attempted hostile takeover of much larger Prime Computer.The company released accounting software for third-party microcomputers in the mid 1980's. In 1988 it released its own 80286-based workstation. The Basic4 system was utilized by many small banks and credit unions. In 1990 the company changed its name to MAI Systems Corp. and changed its business to be a system integrator instead of a combined hardware and software manufacturer, reselling third-party computers but installing their own customer-specific software system.", "created": 2007, "backlinksCount": 17, "pageId": 10135405, "revisionCount": 43, "dailyPageViews": 12, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/MAI_Basic_Four" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "mai": { "title": "mai", "appeared": 2019, "type": "pl", "creators": [ "Ahmed Khaled" ], "country": [ "Egypt" ], "originCommunity": [ "https://github.com/akhal3d96/Mai/issues" ], "githubRepo": { "firstCommit": 2019, "created": 2019, "updated": 2020, "description": "an educational programming language", "stars": 1, "forks": 0, "subscribers": 0, "issues": 0, "url": "https://github.com/nemoload/Mai" }, "repoStats": { "firstCommit": 2019, "commits": 23, "committers": 1, "files": 29 } }, "make": { "title": "Make", "appeared": 1977, "type": "application", "description": "Make — a program for maintaining computer programs", "reference": [ "https://semanticscholar.org/paper/40cf2b47de20d0b930cd4b5184febe40bdc681c8" ], "country": [ "United States" ], "originCommunity": [ "Bell Laboratories" ], "related": [ "makefile" ], "leachim6": { "filepath": "m/Make.makefile", "fileExtensions": [ "makefile" ], "example": [ "$(info \"Hello World\")\nall:\n" ], "id": "Make" }, "rijuRepl": { "example": [ ".PHONY: all\nall:\n\t@echo \"Hello, world!\"\n" ], "id": "https://riju.codes/make" }, "hopl": "https://hopl.info/showlanguage.prx?exp=768", "wordRank": 132, "centralPackageRepositoryCount": 0 }, "makedoc": { "title": "MakeDoc", "appeared": 2000, "type": "textMarkup", "country": [ "United States" ], "originCommunity": [ "REBOL Technologies" ], "wikipedia": { "example": [ "*Bullet item\n\n*Another \n\n#Numbered item\n\n#Another numbered item" ], "related": [ "rebol", "html", "xml", "vi-editor", "emacs-editor" ], "summary": "MakeDoc is a lightweight markup language created in 2000 by Carl Sassenrath for creating documentation and web pages using simple text notations. The language is used extensively in the REBOL community for documentation, websites, and wikis.", "backlinksCount": 7, "pageId": 21339396, "created": 2009, "revisionCount": 22, "dailyPageViews": 5, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/MakeDoc" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "makefile": { "title": "Makefile", "appeared": 1976, "type": "pl", "creators": [ "Stuart Feldman" ], "description": "Lines that begin with TAB are assumed to be part of a recipe (so they are shell scripts and passed to the shell for parsing), and lines that do not begin with TAB cannot be part of a recipe (so they cannot be shell scripts: they must be make syntax).", "website": "https://www.gnu.org/software/make/", "documentation": [ "https://www.gnu.org/software/make/manual/make.html" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hasVariableSubstitutionSyntax": { "example": "objects = program.o foo.o utils.o\n$(objects)", "value": true }, "hasAssignment": { "example": "objects = program.o foo.o utils.o", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "lineCommentToken": [ [ "#" ] ], "example": [ " edit : main.o kbd.o command.o display.o \\\n insert.o search.o files.o utils.o\n cc -o edit main.o kbd.o command.o display.o \\\n insert.o search.o files.o utils.o\n\nmain.o : main.c defs.h\n cc -c main.c\nkbd.o : kbd.c defs.h command.h\n cc -c kbd.c\ncommand.o : command.c defs.h command.h\n cc -c command.c\ndisplay.o : display.c defs.h buffer.h\n cc -c display.c\ninsert.o : insert.c defs.h buffer.h\n cc -c insert.c\nsearch.o : search.c defs.h buffer.h\n cc -c search.c\nfiles.o : files.c defs.h buffer.h command.h\n cc -c files.c\nutils.o : utils.c defs.h\n cc -c utils.c\nclean :\n rm edit main.o kbd.o command.o display.o \\\n insert.o search.o files.o utils.o" ], "wikipedia": { "example": [ "edit: main.o kbd.o command.o display.o \n cc -o edit main.o kbd.o command.o display.o\n \nmain.o: main.c defs.h\n cc -c main.c\nkbd.o: kbd.c defs.h command.h\n cc -c kbd.c\ncommand.o: command.c defs.h command.h\n cc -c command.c\ndisplay.o: display.c defs.h\n cc -c display.c\n\nclean:\n rm edit main.o kbd.o command.o display.o" ], "related": [ "c" ], "summary": "A makefile is a file containing a set of directives used with the make build automation tool.", "pageId": 55976, "dailyPageViews": 328, "created": 2002, "backlinksCount": 81, "revisionCount": 87, "url": "https://en.wikipedia.org/wiki/Makefile" }, "githubLanguage": { "fileExtensions": [ "mak", "d", "make", "makefile", "mk", "mkfile" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ntheos theos https://github.com/theos.png https://github.com/theos/theos Makefile #427819 2638 756 60 \"A cross-platform suite of tools for building and deploying software for iOS and other platforms.\"\nfrida frida https://github.com/frida.png https://github.com/frida/frida Makefile #427819 3977 444 165 \"Clone this repo to build Frida\"\nccrisan motioneyeos https://github.com/ccrisan.png https://github.com/ccrisan/motioneyeos Makefile #427819 4285 483 145 \"A Video Surveillance OS For Single-board Computers\"\njobbole awesome-python-cn https://github.com/jobbole.png https://github.com/jobbole/awesome-python-cn Makefile #427819 16302 5573 437 Python资源大全中文版，包括：Web框架、网络爬虫、模板引擎、数据库、数据可视化、图片处理等，由伯乐在线持续更新。\nNVIDIA nvidia-docker https://github.com/NVIDIA.png https://github.com/NVIDIA/nvidia-docker Makefile #427819 9125 1223 268 \"Build and run Docker containers leveraging NVIDIA GPUs\"\nhome-assistant hassos https://github.com/home-assistant.png https://github.com/home-assistant/hassos Makefile #427819 568 156 32 \"🔰 HassOS Docker hypervisor\"\ncontainer-storage-interface spec https://github.com/container-storage-interface.png https://github.com/container-storage-interface/spec Makefile #427819 512 140 17 \"Container Storage Interface (CSI) Specification.\"\nfeiskyer kubernetes-handbook https://github.com/feiskyer.png https://github.com/feiskyer/kubernetes-handbook Makefile #427819 3083 868 146 \"Kubernetes Handbook （Kubernetes指南） https://kubernetes.feisky.xyz\"\nbuildroot buildroot https://github.com/buildroot.png https://github.com/buildroot/buildroot Makefile #427819 821 873 28 \"Buildroot, making embedded Linux easy. Note that this is not the official repository, but only a mirror. The official Git repository is at http://git.buildroot.net/buildroot/. Do not open issues or file pull requests here.\"\nmkubecek vmware-host-modules https://github.com/mkubecek.png https://github.com/mkubecek/vmware-host-modules Makefile #427819 457 74 29 \"Patches needed to build VMware (Player and Workstation) host modules against recent kernels\"\nramitsurana awesome-kubernetes https://github.com/ramitsurana.png https://github.com/ramitsurana/awesome-kubernetes Makefile #427819 6891 1036 275 \"A curated list for awesome kubernetes sources 🚢🎉\"\ntomwhite hadoop-book https://github.com/tomwhite.png https://github.com/tomwhite/hadoop-book Makefile #427819 2791 2359 47 \"Example source code accompanying O'Reilly's \"\"Hadoop: The Definitive Guide\"\" by Tom White\"", "trendingProjectsCount": 13, "type": "programming", "filenames": [ "BSDmakefile", "GNUmakefile", "Kbuild", "Makefile", "Makefile.am", "Makefile.boot", "Makefile.frag", "Makefile.in", "Makefile.inc", "Makefile.wat", "makefile", "makefile.sco", "mkfile" ], "interpreters": [ "make" ], "aceMode": "makefile", "codemirrorMode": "cmake", "codemirrorMimeType": "text/x-cmake", "tmScope": "source.makefile", "aliases": [ "bsdmake", "make", "mf" ], "repos": 247622, "id": "Makefile" }, "githubBigQuery": { "repos": 250693, "users": 152971, "id": "Makefile" }, "pygmentsHighlighter": { "filename": "make.py", "fileExtensions": [ "mak", "mk", "Makefile", "makefile", "Makefile.*", "GNUmakefile" ], "id": "Makefile" }, "linguistGrammarRepo": { "sampleCount": 3, "example": [ "#!/usr/bin/make -f\n%:\n\tls -l\n" ], "url": "https://github.com/textmate/make.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Make", "quineRelay": "Makefile", "tryItOnline": "make", "ubuntuPackage": "make", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "mako": { "title": "Mako", "appeared": 2006, "type": "template", "description": "Mako is a template library written in Python. It provides a familiar, non-XML syntax which compiles into Python modules for maximum performance. Mako's syntax and API borrows from the best ideas of many others, including Django and Jinja2 templates, Cheetah, Myghty, and Genshi. Conceptually, Mako is an embedded Python (i.e. Python Server Page) language, which refines the familiar ideas of componentized layout and inheritance to produce one of the most straightforward and flexible models available, while also maintaining close ties to Python calling and scoping semantics. Mako is used by reddit.com where it delivers over one billion page views per month. It is the default template language included with the Pylons and Pyramid web frameworks.", "website": "https://www.makotemplates.org/", "country": [ "United States" ], "originCommunity": [ "https://www.makotemplates.org/community.html" ], "domainName": { "registered": 2006, "awisRank": { "2022": 1811247 }, "name": "makotemplates.org" }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "example": [ "<%inherit file=\"base.html\"/>\n<%\n rows = [[v for v in range(0,10)] for row in range(0,10)]\n%>\n\n % for row in rows:\n ${makerow(row)}\n % endfor\n
\n\n<%def name=\"makerow(row)\">\n \n % for name in row:\n ${name}\\\n % endfor\n \n" ], "githubLanguage": { "fileExtensions": [ "mako", "mao" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "text.html.mako", "repos": 188, "id": "Mako" }, "githubBigQuery": { "repos": 4341, "users": 3698, "id": "Mako" }, "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "mao" ], "id": "Mako" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2016, "committerCount": 6, "commitCount": 17, "url": "https://github.com/marconi/mako-tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "mal": { "title": "mal", "appeared": 2014, "type": "interpreter", "description": "Mal is a Clojure inspired Lisp interpreter. Mal is implemented in 75 languages.", "country": [ "United States" ], "originCommunity": [ "https://github.com/kanaka/mal/issues" ], "githubRepo": { "firstCommit": 2014, "stars": 8718, "forks": 2093, "subscribers": 179, "created": 2014, "updated": 2022, "description": "mal - Make a Lisp", "issues": 44, "url": "https://github.com/kanaka/mal" } }, "malbolge": { "title": "Malbolge", "appeared": 1998, "type": "esolang", "creators": [ "Ben Olmstead" ], "country": [ "United States" ], "originCommunity": [ "https://web.archive.org/web/20040404144205/http://www.mines.edu/students/b/bolmstea/randlang/index.html" ], "wikipedia": { "example": [ "0000000000111111111122222222223333333333444444444455555555556666666666777777777788888888889999\n0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123\n----------------------------------------------------------------------------------------------\n9m<.TVac`uY*MK'X~xDl}REokN:#?G\"i@5z]&gqtyfr$(we4{WP)H-Zn,[%\\3dL+Q;>U!pJS72FhOA1CB6v^=I_0/8|jsb" ], "related": [ "brainfuck", "intercal", "befunge", "ascii" ], "summary": "Malbolge () is a public domain esoteric programming language invented by Ben Olmstead in 1998, named after the eighth circle of hell in Dante's Inferno, the Malebolge. Malbolge was specifically designed to be almost impossible to use, via a counter-intuitive 'crazy operation', base-three arithmetic, and self-altering code. It builds on the difficulty of earlier, challenging esoteric languages (such as Brainfuck and Befunge), but takes this aspect to the extreme, playing on the entangled histories of computer science and encryption. Despite this design, it is possible (though very difficult) to write useful Malbolge programs.", "created": 2003, "backlinksCount": 66, "pageId": 237720, "revisionCount": 420, "dailyPageViews": 401, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Malbolge" }, "leachim6": { "filepath": "m/Malbolge.mb", "fileExtensions": [ "mb" ], "example": [ "(=<`#9]~6ZY32Vx/4Rs+0No-&Jk)\"Fh}|Bcy?,vNz]KZ%oG4UUS0/@-eMc(:'8" ], "id": "Malbolge" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Malbolge", "rijuRepl": { "example": [ " (=<`#9]~6ZY32Vx/4Rs+0No-&Jk)\"Fh}|Bcy?`=*z]Kw%oG4UUS0/@-ejc(:'8dc\n" ], "id": "https://riju.codes/malbolge" }, "tryItOnline": "malbolge", "esolang": "https://esolangs.org/wiki/Malbolge", "centralPackageRepositoryCount": 0, "isbndb": "" }, "mallard-basic": { "title": "Mallard BASIC", "appeared": 1985, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Locomotive Software" ], "wikipedia": { "related": [ "basic", "cbasic", "zbasic", "x86-assembly", "locomotive-basic" ], "summary": "Mallard BASIC is a BASIC interpreter for CP/M written by Locomotive Software and supplied with the Amstrad PCW range of small business computers, the ZX Spectrum +3 version of CP/M Plus, and the Acorn BBC Micro Z80 second Processor. In the 1980s, it was standard industry practice to bundle a BASIC interpreter with microcomputers, and the PCW followed this practice. While it was primarily a wordprocessor for business use, it was not a dedicated WP: it also ran the CP/M operating system. Though there were existing implementations of BASIC for CP/M, such as Digital Research's CBASIC and the third-party ZBasic, they followed the earlier 1970s model of compilers, fed source code prepared in a separate text editor. Mallard was more like a traditional micro ROM BASIC, with an integrated editor which was tailored for the PCW's non-standard 90-column screen. Although the PCW actually had excellent monochrome graphics support for its time and specification, closely comparable to the Hercules Graphics Card for the PC, Mallard BASIC had no graphics support whatsoever. Instead, Locomotive optimised it for business use, with, for instance, full ISAM random-access file support, making it easier to write database applications. It was also optimised for speed – it is named after the LNER A4 class 4468 Mallard locomotive, the fastest steam locomotive in the world, once again displaying the company's fondness for railway-oriented nomenclature. (For instance, see the company name itself.) In fact the Locomotive name came from the phrase \"To run like a train\" and it was this theme that was used to name Mallard BASIC – no other Locomotive product was named after anything railway-oriented. The Acorn version was designed simply to run the Compact Software small business accounting products Acorn was including to target its Z80 second processor at small businesses. Mallard's major innovation designed specifically for Acorn was the addition of the Jetsam B*-tree keyed access filing system to give similar (but superior) features to the Miksam product Compact had originally designed around. Graphics could be implemented by loading the GSX extension to CP/M, but this was cumbersome for BASIC programmers. The lack of graphics support was rectified by several BASIC toolkits, of which the most popular was LEB: Lightning Extended BASIC. This patched Mallard BASIC, replacing the redundant LET keyword with LEB, which could be followed by a wide variety of parameters to allow sophisticated graphics (for the time) to be drawn on screen, saved to disc, printed, et cetera. Probably the most widespread Mallard application ever was RPED, the text editor supplied with the PCW. The name was short for Roland Perry's EDitor, the program being put together quickly by Roland Perry, the Amstrad executive running the computer product development, when it was realised that CP/M-80 came with no usable full-screen editor, but users had a requirement to edit configuration files. The same problem was apparent with DOS Plus and MS-DOS supplied with IBM-compatible Amstrad computers, but the RPED for those machines was written in 8086 assembler, and not Mallard BASIC. The PC version of Mallard Basic is still available from LocoScript Software as an MS-DOS program which will run under Windows as a Disc only version with licence or with the full Introduction & Reference manual.", "created": 2004, "backlinksCount": 95, "pageId": 1250505, "revisionCount": 62, "dailyPageViews": 8, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Mallard_BASIC" }, "centralPackageRepositoryCount": 0 }, "malus": { "title": "MALUS", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/66788960403ef142f6faddfb7b99927ba581ed7a" ], "country": [ "United States" ], "originCommunity": [ "General Motors Research Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5899", "centralPackageRepositoryCount": 0 }, "mama-software": { "title": "Mama", "appeared": 2010, "type": "pl", "website": "https://web.archive.org/web/20181230132451/https://eytam.com/mama", "country": [ "Israel" ], "originCommunity": [ "Shapes Robotics" ], "wikipedia": { "summary": "Mama is an object-oriented educational programming language designed to help young students start programming by providing all language elements in the student mother tongue. Mama programming language is available in several languages, with both left-to-right (LTR) and right-to-left (RTL) language direction support. A new variant of Mama was built on top of Carnegie Mellon's Alice development environment, supporting scripting of the 3D stage objects. This new variant of Mama was designed to help young students start programming by building 3D animations and games.", "created": 2010, "backlinksCount": 12, "pageId": 26220277, "revisionCount": 51, "dailyPageViews": 10, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Mama_%28software%29" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "man-machine-language": { "title": "MML", "appeared": 1982, "type": "standard", "reference": [ "https://ieeexplore.ieee.org/document/1095582" ], "aka": [ "MML" ], "country": [ "Switzerland" ], "originCommunity": [ "International Telegraph and Telephone Consultative Committee" ], "wikipedia": { "summary": "A man-machine language or MML is a specification language. MML typically are defined to standardize the interfaces for managing a telecommunications or network device from a console. ITU-T Z.300 series recommendations define an MML, that has been extended by Telcordia Technologies (formerly Bellcore) to form Transaction Language 1.", "backlinksCount": 5, "pageId": 1015424, "dailyPageViews": 33, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/MML_(programming_language)" } }, "manchester-syntax": { "title": "Manchester syntax", "appeared": 2006, "type": "dataNotation", "description": "The Manchester syntax is a user-friendly compact syntax for OWL 2 ontologies; it is frame-based, as opposed to the axiom-based other syntaxes for OWL 2. The Manchester Syntax is used in the OWL 2 Primer, and this document provides the language used there. It is expected that tools will extend the Manchester Syntax for their own purposes, and tool builders may collaboratively extend the common language.", "reference": [ "http://webont.org/owled/2006/acceptedLong/submission_9.pdf" ], "country": [ "United Kingdom" ], "originCommunity": [ "The University of Manchester" ], "hasSemanticIndentation": { "example": "", "value": false }, "hasComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/**\n * @rdfs:comment A vegetarian pizza is a pizza that only has cheese toppings\n * and tomato toppings.\n *\n * @rdfs:label Pizza [en]\n * @rdfs:label Pizza [pt]\n */\nClass: VegetarianPizza\n\nEquivalentTo:\n\n Pizza and\n not (hasTopping some FishTopping) and\n not (hasTopping some MeatTopping)\n\nDisjointWith:\n \n NonVegetarianPizza" ], "isbndb": "" }, "mangle": { "title": "Mangle", "appeared": 2022, "type": "pl", "creators": [ "Mangle Team" ], "originCommunity": [ "Google" ], "githubRepo": { "firstCommit": 2022, "stars": 513, "forks": 12, "subscribers": 13, "created": 2022, "updated": 2022, "issues": 2, "url": "https://github.com/google/mangle" }, "repoStats": { "firstCommit": 2022, "commits": 82, "committers": 5, "files": 81 } }, "manhood": { "title": "manhood", "appeared": 2014, "type": "pl", "website": "http://berkin.me/rant", "country": [ "United States" ], "originCommunity": [ "https://github.com/TheBerkin/rant3/issues" ], "githubRepo": { "firstCommit": 2014, "stars": 3021, "forks": 109, "subscribers": 80, "created": 2014, "updated": 2022, "description": "(Obsolete) Archive of Rant 3.x.", "issues": 9, "url": "https://github.com/TheBerkin/Manhood" }, "repoStats": { "firstCommit": 2014, "commits": 991, "committers": 15, "files": 363 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8311269|Show HN: Manhood – a powerful templating language for random text generation|2014-09-13 01:07:46 UTC|1410570466|TheBerkin|5|22", "isbndb": "year|publisher|title|authors|isbn13\n2006|Wingspan Press|Manhood In Black Americans|Joseph A. Bailey|9781595940643", "semanticScholar": "" }, "manim": { "title": "Manim", "appeared": 2015, "type": "framework", "demoVideo": [ "https://www.youtube.com/3blue1brown" ], "creators": [ "Grant Sanderson" ], "description": "A community-maintained Python framework for creating mathematical animations", "website": "https://www.manim.community", "documentation": [ "https://docs.manim.community/en/stable" ], "cheatSheetUrl": [ "https://docs.manim.community/en/stable/tutorials/quickstart.html" ], "fileExtensions": [ ".py" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/ManimCommunity" ], "domainName": { "name": "manim.community" }, "versions": { "2022": [ "v0.17.2" ] }, "writtenIn": [ "python" ], "gource": "https://www.youtube.com/watch?v=hy-6D650Apo", "githubRepo": { "firstCommit": 2015, "stars": 12402, "forks": 1074, "subscribers": 105, "created": 2020, "updated": 2023, "description": "A community-maintained Python framework for creating mathematical animations. ", "issues": 319, "url": "https://github.com/manimCommunity/manim" }, "wikipedia": { "summary": "3Blue1Brown is a math YouTube channel created and run by Grant Sanderson. The channel focuses on teaching higher mathematics from a visual perspective, and on the process of discovery and inquiry-based learning in mathematics, which Sanderson calls \"inventing math\". As of November 2022, the channel has 4.85 million subscribers.", "url": "https://en.wikipedia.org/wiki/3Blue1Brown" }, "subreddit": [ { "memberCount": { "2022": 7009 }, "url": "https://www.reddit.com/r/manim" } ], "packageRepository": [ "https://pypi.org/project/manim" ], "forLanguages": [ "python" ], "twitter": "https://twitter.com/manim_community", "isOpenSource": true }, "manool": { "title": "manool", "appeared": 2018, "type": "pl", "creators": [ "Alex Protasov" ], "description": "Practical programming language with expressive power, in 10 KLOC in C++11 - \"MAnool is Not an Object-Oriented Language!\"", "website": "https://manool.org/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/ep8pc2/manool_practical_language_with_universal_syntax/" ], "country": [ "Colombia" ], "originCommunity": [ "https://github.com/rusini/manool/pulls" ], "domainName": { "registered": 2018, "name": "manool.org" }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "example": [ "-- recursive version, MANOOLish \"cascading\" notation\n{ {extern \"manool.org.18/std/0.3/all\"} in\n: let rec\n { Fact = -- compile-time constant binding\n { proc { N } as -- precondition: N.IsI48[] & (N >= 0)\n : if N == 0 then 1 else\n N * Fact[N - 1]\n }\n }\n in\n Out.WriteLine[\"Factorial of 10 is \"; Fact[10]]\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 56, "subscribers": 4, "created": 2019, "updated": 2022, "description": "Fairly readable homoiconic language with primarily value (non-referential) semantics that balances the programmer's productivity with scalability", "forks": 3, "issues": 0, "url": "https://github.com/rusini/manool" }, "repoStats": { "firstCommit": 2019, "commits": 293, "committers": 2, "files": 72 } }, "manticore": { "title": "manticore", "appeared": 2009, "type": "pl", "description": "The Manticore project is an effort to design and implement a new functional language for parallel programming. Unlike many earlier parallel languages, Manticore is a heterogeneous language that supports parallelism at multiple levels. Specifically, the Manticore language combines Concurrent ML-style explicit concurrency with fine-grain, implicitly threaded, parallel constructs. These lectures will introduce the Manticore language and explore a variety of programs written to take advantage of heterogeneous parallelism. At the explicit-concurrency level, Manticore supports the creation distinct threads of control and the coordination of threads through first-class synchronous-message passing. Message-passing synchronization, in contrast to shared-memory synchronization, fits naturally with the functional-programming paradigm. At the implicit-parallelism level, Manticore supports a diverse collection of parallel constructs for different granularities of work. Many of these constructs are inspired by common functional-programming idioms. In addition to describing the basic mechanisms, we will present a number of useful programming techniques that are enabled by these mechanisms. Finally, we will briefly discuss some of the implementation techniques used to execute Manticore programs on commodity multicore computers.", "reference": [ "http://manticore.cs.uchicago.edu/papers/cefp09-notes.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of Chicago" ], "example": [ "fun forever (init : ’a) (f: ’a -> ’a) : unit =\n let\n fun loop s = loop (f s)\n val _ = spawn (loop init)\n in\n ()\n end" ] }, "manuscript": { "title": "ManuScript", "appeared": 2009, "type": "pl", "reference": [ "http://www.sibelius.com/download/software/win/ManuScriptLanguage.pdf" ], "country": [ "United States" ], "originCommunity": [ "Avid Technology, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6402", "centralPackageRepositoryCount": 0 }, "map": { "title": "MAP", "appeared": 1960, "type": "assembly", "reference": [ "http://bitsavers.org/pdf/ibm/7090/C28-6311-2_7090_MAP.pdf" ], "standsFor": "Macro Assembly Program Language", "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3116", "wordRank": 197 }, "mapbasic": { "title": "MapBasic", "appeared": 1997, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Pitney Bowes Software", "MapInfo Corporation" ], "wikipedia": { "summary": "MapBasic is a programming language for creation of additional tools and functionality for the MapInfo Professional geographical information system. MapBasic is based on the BASIC family of programming languages.MapBasic also allows programmers to develop software in popular programming languages such as C, C++ and Visual Basic and use these with the MapInfo Professional GIS to create geographically based software, such as electronic mapping.", "created": 2006, "backlinksCount": 8, "pageId": 4499444, "revisionCount": 21, "dailyPageViews": 8, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/MapBasic" }, "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "" }, "maple": { "title": "Maple", "appeared": 1982, "type": "pl", "website": "http://www.maplesoft.com/products/maple/", "documentation": [ "https://www.maplesoft.com/documentation_center/" ], "country": [ "Canada" ], "originCommunity": [ "Cybernet Systems Co. Ltd" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "printf" ] ], "wikipedia": { "example": [ "eqn:= f(x)-3*Int((x*y+x^2*y^2)*f(y), y=-1..1) = h(x):\n intsolve(eqn,f(x));" ], "related": [ "c", "java", "linux", "pascal", "csharp", "fortran", "matlab", "visual-basic", "excel-app", "watcom", "sql", "http", "javascript", "julia", "perl", "python", "r", "java-server-pages", "mathcad", "mupad", "sagemath" ], "summary": "Maple is a symbolic and numeric computing environment, and is also a multi-paradigm programming language. Developed by Maplesoft, Maple also covers other aspects of technical computing, including visualization, data analysis, matrix computation, and connectivity. A toolbox, MapleSim, adds functionality for multidomain physical modeling and code generation.", "pageId": 79099, "dailyPageViews": 231, "created": 2002, "backlinksCount": 421, "revisionCount": 776, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/Maple_(software)" }, "projectEuler": { "memberCount": { "2019": 262, "2022": 265 }, "id": "Maple" }, "helloWorldCollection": [ "# Hello World in Maple\n\n>> printf(\"Hello World!\");\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Maple", "linkedInSkill": { "2018": 51134, "id": "maple" }, "officialBlogUrl": [ "https://faq.maplesoft.com/" ], "downloadPageUrl": [ "https://www.maplesoft.com/download/" ], "tiobe": { "id": "Maple" }, "hopl": "https://hopl.info/showlanguage.prx?exp=909", "packageRepository": [ "https://www.maplesoft.com/applications/" ], "twitter": "https://twitter.com/maplesoft", "fileType": "text", "wordRank": 6311, "isbndb": "year|publisher|title|authors|isbn13\n2001|Chapman and Hall/CRC|The Maple Book|Garvan, Frank|9781584882329\n1997|CRC Press|The Maple V Primer, Release 4|Garvan, Frank|9780849326813\n2016|Cambridge University Press|Understanding Maple|Thompson, Ian|9781316628140\n2003|Wiley|Getting Started with Maple|Cheung, C-K. and Keough, G. E. and May, Michael|9780471470137\n2012|Springer|Introduction to Cryptography with Maple|Gómez Pardo, José Luis|9783642321658\n1996|Springer Us|Maple V Programming Guide|M. B. Monagan K. O. Geddes|9780387945378\n2004|Wspc|Introduction to mathematics with maple|Adams, P. and Smith, K. and Výborný, R|9789812560094\n1996|Springer Verlag|Introduction to Maple|Heck, Andre|9780387945354\n2002|Springer|Essential Maple 7: An Introduction for Scientific Programmers|Corless, Robert M.|9780387953526\n2000|Birkhäuser|Nonlinear Physics with Maple for Scientists and Engineers|Enns, Richard H. and McGuire, George C.|9780817641191\n2004|World Scientific Publishing Company|Introduction to Mathematics with Maple|Adams, Peter and Smith, Ken and Vyborny, Rudolf|9789812389312\n1997|Boston : Birkhäuser, C1997.|Nonlinear Physics With Maple For Scientists And Engineers|Richard Enns and George McGuire|9780817639778\n2018|Mercury Learning and Information|Mathematical Methods for Physics: Using MATLAB and Maple|Claycomb, J. R.|9781683920984\n2014|Springer|Scientific Computing - An Introduction using Maple and MATLAB (Texts in Computational Science and Engineering Book 11)|Gander, Walter and Gander, Martin J. and Kwok, Felix|9783319043258\n2012|Springer|Introduction to Cryptography with Maple|Gómez Pardo, José Luis|9783642321665\n1997|Springer|Maple V Programming Guide: for Release 5|Waterloo Maple Incorporated|9780387983981\n2007|Springer|Maple and Mathematica: A Problem Solving Approach for Mathematics|Shingareva, Inna K. and Lizárraga-Celaya, Carlos|9783211732656\n1996|Springer|Introduction to Scientific Programming: Computational Problem Solving Using Maple and C|Zachary, Joseph L.|9780387946306\n2012T||Maple Programming Guide|Maplesoft|9781926902258\n2014|Springer|Introduction to Scientific Programming: Computational Problem Solving Using Maple and C|Zachary, Joseph L.|9781461275183\n1994-09-01T00:00:01Z|Morgan Kaufmann Pub|Differential Equations With Maple V|Abell, Martha L. and Braselton, James P.|9780120415489\n2005T|Maplesoft|Maple 10 Harnessing the Power of Mathematics Advanced Programming Guide|M.B Monagan and K.O. Geddes|9781894511773\n1997|Springer|Maple V: Learning Guide|Waterloo Maple Incorporated|9780387983974\n2022|MapleSoft|Maple 12 The Essential Tool For Mathematics and Modeling, Introductory Programming Guide|MapleSoft|9781897310465\n2003T|Maplesoft|Introductory Programming Guide: Maple 9||9781894511438\n||Maple Introductory Programming Guide 11||9781897310175\n2012|Birkhäuser|Mathematical Computation with Maple V: Ideas and Applications: Proceedings of the Maple Summer Workshop and Symposium, University of Michigan, Ann Arbor, June 28–30, 1993|Thomas Lee|9781461267201\n2012|Springer|Intelligent Routines: Solving Mathematical Analysis with Matlab, Mathcad, Mathematica and Maple (Intelligent Systems Reference Library Book 39)|Anastassiou, George A. and Iatan, Iuliana F.|9783642284755", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|Maple V Language Reference Manual|10.1007/978-1-4615-7386-9|586|42|B. Char and K. Geddes and G. Gonnet and Benton L. Leong and M. Monagan|c530f557b3e05aca6ea0627a9d0ab78264d2b9c2\n1992|First Leaves: A Tutorial Introduction to Maple V|10.1121/1.413756|252|12|B. Char and Benton L. Leong and K. Geddes and M. Monagan and G. Gonnet and S. Watt|b31768389d3fce551e53fc01db39901f835e47f7\n1994|The Maple handbook|10.1007/978-1-4757-1146-2|116|8|D. Redfern|bc40f981663a2e71bc09104d48c1a153f6aa51cf\n1995|The Maple Handbook: Maple V Release 3|10.1121/1.413757|78|2|D. Redfern|9f5968a040c3675e169505cf8f7fe62910c16b4c\n1996|Introduction to Scientific Programming: Computational Problem Solving Using Maple and C|10.1119/1.18778|35|0|J. Zachary|077bba337809bc9209b3604717a54e64206b2d1a\n1993|Parallelizing algorithms for symbolic computation using MAPLE|10.1145/155332.155351|33|0|Kurt Siegl|f31333dd8264f418ce1feb76fe5bb9daee6927c9\n1993|The Maple Computer Algebra System|10.1007/978-3-030-10576-1_300429|9|0|M. Monagan|52f9e1f3ffda68298f73bd2a2fac84d8aa4b9a27\n1994|Chemical Engineering with Maple|10.1007/978-1-4612-0263-9_18|8|0|Ross Taylor and K. Atherley|fe3a019a88bac24067ade4a400a10ed433c608b5\n1991|The Maple Library|10.1007/978-1-4757-2133-1_1|5|0|B. Char and K. Geddes and G. Gonnet and Benton L. Leong and M. Monagan and S. Watt|c67e134fc0d24f8d4b96859869c65a18808f1d4c\n1997|Using Maple To Obtain Analytic Expressions in Physical Chemistry|10.1021/ED074P1491|2|0|S. McDowell|d9075e05457e1ffb563867110597624feefc0fa8\n2019|ANALYTICAL SOLUTION OF THE REGULAR PROBLEM OF THE STURM - LIOUVILLE PROBLEM IN MAPLE ENVIRONMENT|10.15863/TAS.2019.04.72.84|2|0|Unona Krahmaleva and V. Shevtsov|37121e289613a404fb39841707d8811351772789\n2004|Highlighting programming language issues using mixed language programming nn Maple and C|10.1145/971300.971331|2|0|Andrew T. Phillips|df02add29bd8508d8ff3bce0c6a9c147d8313f06\n2000|MAPLE V: A Quick Reference|10.1007/978-1-4612-2128-9_1|1|0|V. Rovenski|67093026cd9a0d98b03533ab96f2acdf86190f4f\n1993|The role of a symbolic programming language in hardware verification: the case of Maple|10.1007/978-1-4612-0351-3_18|1|0|F. Mavaddat|04bc961732466a62f71eb88f00439eec5094f550\n1992|The Maple Programming Language|10.1007/978-1-4615-6996-1_3|1|0|B. Char and K. Geddes and G. Gonnet and Benton L. Leong and M. Monagan and S. Watt|2aaa014af0f2534140aaf2da2e2b7d3eb887386b" }, "maplesoft-app-center-pm": { "title": "Maplesoft Application Center", "appeared": 2004, "type": "packageManager", "website": "https://www.maplesoft.com/applications/", "reference": [ "https://web.archive.org/web/20041208171926/http://www.maplesoft.com/Applications/" ], "country": [ "Canada" ], "originCommunity": [ "Cybernet Systems Co. Ltd" ], "packageCount": 2650, "forLanguages": [ "maple" ], "twitter": "https://twitter.com/maplesoft" }, "mapper": { "title": "MAPPER", "appeared": 1960, "type": "pl", "country": [ "United States" ], "originCommunity": [ "EMCC UNIVAC" ], "wikipedia": { "related": [ "linux" ], "summary": "Sperry Univac's 'MAPPER 4GL originated in the 1970s based on some work in the 1960s, but has been kept current. It was renamed and also given an extension named ICE - Internet Commerce Enabler.Originally available on Sperry's Univac 1108, implementations now also exist for Windows NT, Sun Solaris and Linux. The GUI on Windows is the most advanced of these.", "pageId": 7920952, "created": 2006, "backlinksCount": 16, "revisionCount": 109, "dailyPageViews": 25, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/MAPPER" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MAPPER", "fileType": "text", "centralPackageRepositoryCount": 0 }, "mapquery": { "title": "MAPQUERY", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7256dd93e4f3a9e4d879309154d2af277bd61bb6" ], "country": [ "Switzerland" ], "originCommunity": [ "Swiss Federal Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4124", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "maps": { "title": "MAPS", "appeared": 1993, "type": "pl", "reference": [ "https://www.researchgate.net/publication/2413221_MAPS_An_Efficient_Parallel_Language_for_Scientific_Computing/link/0deec53b954e2f0244000000/download", "https://semanticscholar.org/paper/b0a6eff0ad7b0fee4ee36f715d428053bd9b1d9b" ], "country": [ "United States" ], "originCommunity": [ "California Institute of Technology", "Argonne National Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4990", "wordRank": 1272, "centralPackageRepositoryCount": 0 }, "maraca-lang": { "title": "maraca-lang", "appeared": 2018, "type": "pl", "creators": [ "Jon Whitehead" ], "description": "The dynamic structured data language. Maraca is a lightweight, embeddable, declarative language for defining & manipulating dynamic structured data. And when combined with Maraca-Render, it can be a powerful language for creating interactive UI, such as this site...", "website": "https://maraca-lang.org", "reference": [ "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/maraca-lang" ], "domainName": { "registered": 2019, "name": "maraca-lang.org" }, "example": [ "[\n pad: 10,\n Hello,\n [\n : panel,\n style: bold,\n World,\n ],\n]" ], "githubRepo": { "firstCommit": 2018, "stars": 0, "subscribers": 2, "created": 2021, "updated": 2021, "description": "Maraca JavaScript runtime", "issues": 0, "forks": 0, "url": "https://github.com/maraca-lang/maraca-js" }, "repoStats": { "firstCommit": 2022, "commits": 41, "committers": 1, "files": 11 }, "semanticScholar": "" }, "margin": { "title": "Margin", "appeared": 2019, "type": "textMarkup", "creators": [ "Alex Gamburg" ], "description": "Margin is a lightweight markup language for hierarchically structured thought, like notes and to-do lists.", "website": "https://margin.love", "country": [ "United States" ], "originCommunity": [ "https://github.com/gamburg/margin/issues" ], "domainName": { "registered": 2019, "name": "margin.love" }, "example": [ "Favorite Movies\n Eyes Wide Shut [year: 1999]\n Black Narcissus [year: 1947]\n Adaptation [year: 2002]" ], "githubRepo": { "firstCommit": 2019, "stars": 192, "forks": 10, "subscribers": 11, "created": 2019, "updated": 2022, "description": "Lightweight markup designed for an open mind", "issues": 7, "url": "https://github.com/gamburg/margin" }, "repoStats": { "firstCommit": 2019, "commits": 70, "committers": 7, "files": 24 } }, "maria-db-column-store": { "title": "MariaDB ColumnStore", "appeared": 2016, "type": "database", "description": "Column-oriented database management system", "country": [ "Finland" ], "originCommunity": [ "MariaDB Corporation" ] }, "maria-xml": { "title": "MARIA XML", "appeared": 2009, "type": "xmlFormat", "country": [ "Italy" ], "originCommunity": [ "Institute of Information Science and Technologies, National Research Council of Italy" ], "wikipedia": { "related": [ "xml" ], "summary": "MARIA (Model-based lAnguage foR Interactive Applications) is a universal, declarative, multiple abstraction level, XML-based user interface markup language for modelling interactive applications in ubiquitous environments. MARIA one of the languages that has been submitted for standardization at W3C.", "backlinksCount": 7, "pageId": 32537397, "created": 2011, "revisionCount": 16, "dailyPageViews": 4, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/MARIA_XML" }, "centralPackageRepositoryCount": 0 }, "mariadb": { "title": "MariaDB", "appeared": 2009, "type": "queryLanguage", "documentation": [ "https://mariadb.org/documentation/" ], "country": [ "Finland and United States" ], "originCommunity": [ "MariaDB Foundation" ], "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "ACCESSIBLE", "ADD", "ALL", "ALTER", "ANALYZE", "AND", "AS", "ASC", "ASENSITIVE", "BEFORE", "BETWEEN", "BIGINT", "BINARY", "BLOB", "BOTH", "BY", "CALL", "CASCADE", "CASE", "CHANGE", "CHAR", "CHARACTER", "CHECK", "COLLATE", "COLUMN", "CONDITION", "CONSTRAINT", "CONTINUE", "CONVERT", "CREATE", "CROSS", "CURRENT_DATE", "CURRENT_TIME", "CURRENT_TIMESTAMP", "CURRENT_USER", "CURSOR", "DATABASE", "DATABASES", "DAY_HOUR", "DAY_MICROSECOND", "DAY_MINUTE", "DAY_SECOND", "DEC", "DECIMAL", "DECLARE", "DEFAULT", "DELAYED", "DELETE", "DESC", "DESCRIBE", "DETERMINISTIC", "DISTINCT", "DISTINCTROW", "DIV", "DOUBLE", "DROP", "DUAL", "EACH", "ELSE", "ELSEIF", "ENCLOSED", "ESCAPED", "EXISTS", "EXIT", "EXPLAIN", "FALSE", "FETCH", "FLOAT", "FLOAT4", "FLOAT8", "FOR", "FORCE", "FOREIGN", "FROM", "FULLTEXT", "GENERAL", "GRANT", "GROUP", "HAVING", "HIGH_PRIORITY", "HOUR_MICROSECOND", "HOUR_MINUTE", "HOUR_SECOND", "IF", "IGNORE", "IGNORE_SERVER_IDS", "IN", "INDEX", "INFILE", "INNER", "INOUT", "INSENSITIVE", "INSERT", "INT", "INT1", "INT2", "INT3", "INT4", "INT8", "INTEGER", "INTERVAL", "INTO", "IS", "ITERATE", "JOIN", "KEY", "KEYS", "KILL", "LEADING", "LEAVE", "LEFT", "LIKE", "LIMIT", "LINEAR", "LINES", "LOAD", "LOCALTIME", "LOCALTIMESTAMP", "LOCK", "LONG", "LONGBLOB", "LONGTEXT", "LOOP", "LOW_PRIORITY", "MASTER_HEARTBEAT_PERIOD", "MASTER_SSL_VERIFY_SERVER_CERT", "MATCH", "MAXVALUE", "MEDIUMBLOB", "MEDIUMINT", "MEDIUMTEXT", "MIDDLEINT", "MINUTE_MICROSECOND", "MINUTE_SECOND", "MOD", "MODIFIES", "NATURAL", "NOT", "NO_WRITE_TO_BINLOG", "NULL", "NUMERIC", "ON", "OPTIMIZE", "OPTION", "OPTIONALLY", "OR", "ORDER", "OUT", "OUTER", "OUTFILE", "PARTITION", "PRECISION", "PRIMARY", "PROCEDURE", "PURGE", "RANGE", "READ", "READS", "READ_WRITE", "REAL", "REFERENCES", "REGEXP", "RELEASE", "RENAME", "REPEAT", "REPLACE", "REQUIRE", "RESIGNAL", "RESTRICT", "RETURN", "REVOKE", "RIGHT", "RLIKE", "SCHEMA", "SCHEMAS", "SECOND_MICROSECOND", "SELECT", "SENSITIVE", "SEPARATOR", "SET", "SHOW", "SIGNAL", "SLOW", "SMALLINT", "SPATIAL", "SPECIFIC", "SQL", "SQLEXCEPTION", "SQLSTATE", "SQLWARNING", "SQL_BIG_RESULT", "SQL_CALC_FOUND_ROWS", "SQL_SMALL_RESULT", "SSL", "STARTING", "STRAIGHT_JOIN", "TABLE", "TERMINATED", "THEN", "TINYBLOB", "TINYINT", "TINYTEXT", "TO", "TRAILING", "TRIGGER", "TRUE", "UNDO", "UNION", "UNIQUE", "UNLOCK", "UNSIGNED", "UPDATE", "USAGE", "USE", "USING", "UTC_DATE", "UTC_TIME", "UTC_TIMESTAMP", "VALUES", "VARBINARY", "VARCHAR", "VARCHARACTER", "VARYING", "WHEN", "WHERE", "WHILE", "WITH", "WRITE", "XOR", "YEAR_MONTH", "ZEROFILL", "ACTION", "BIT", "DATE", "ENUM", "NO", "TEXT", "TIME", "TIMESTAMP" ], "wikipedia": { "related": [ "c", "perl", "bash", "solaris", "linux", "mysql", "freebsd" ], "summary": "MariaDB is a community-developed fork of the MySQL relational database management system intended to remain free under the GNU GPL. Development is led by some of the original developers of MySQL, who forked it due to concerns over its acquisition by Oracle Corporation.MariaDB intends to maintain high compatibility with MySQL, ensuring a drop-in replacement capability with library binary parity and exact matching with MySQL APIs and commands. It includes the XtraDB storage engine for replacing InnoDB, as well as a new storage engine, Aria, that intends to be both a transactional and non-transactional engine perhaps even included in future versions of MySQL.Its lead developer is Michael \"Monty\" Widenius, one of the founders of MySQL AB and the founder of Monty Program AB. On 16 January 2008, MySQL AB announced that it had agreed to be acquired by Sun Microsystems for approximately $1 billion. The acquisition completed on 26 February 2008. MariaDB is named after Monty's younger daughter Maria, similar to how MySQL is named after his other daughter My.", "backlinksCount": 218, "pageId": 24960699, "created": 2009, "revisionCount": 556, "dailyPageViews": 538, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/MariaDB" }, "rijuRepl": { "example": [ "SELECT 'Hello, world!';\n" ], "id": "https://riju.codes/mariadb" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2018|Apress|Practical PHP 7, MySQL 8, and MariaDB Website Databases: A Simplified Approach to Developing Database-Driven Websites|West, Adrian W. and Prettyman, Steve|9781484238431\n2019-09-07T00:00:01Z|Independently published|Learning PyQt5 with MariaDB for Absolute Beginners: A Hands-On, Practical Database Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781691545476\n2019-11-25T00:00:01Z|Independently published|Think PyQt: A Smarter Way to Explore MariaDB and SQLite Driven Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781711653815\n2019-11-24T00:00:01Z|Independently published|Learn JDBC By Example: A Quick Start Guide to MariaDB and SQL Server Driven Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781711043302\n20150617|Packt Publishing|Getting Started with MariaDB - Second Edition|Daniel Bartholomew|9781782175711", "semanticScholar": "" }, "mark-iv": { "title": "MARK IV", "appeared": 1985, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Informatics General Corporation" ], "wikipedia": { "related": [ "cobol" ], "summary": "MARK IV is a Fourth-generation programming language that was created by Informatics, Inc. in the 1960s. Informatics took advantage of IBM's decision to unbundle their software; MARK IV was the first \"software product to have cumulative sales of $10 million\". MARK IV was developed for IBM Systems (360 and 370) and for the RCA Spectra 70. Its main benefit was allowing faster application development on the order of 6 to 10 times faster than doing a system using a 3GL, such as COBOL. MARK IV, being an early 4GL, allowed user development of systems related to business. In a 1971 ad by Informatics, there are several quotes from customers, such as: We conservatively estimate that the benefits derived from the MARK IV System have completely returned the cost of our investment in a period of less than 3 months. MARK IV runs ... handle Accounts Receivable, Inventory, Sales Analyses, etc. on about 26 different factories.MARK IV went to Sterling Software in 1985 as part of that company's acquisition of Informatics General. As VISION:BUILDER it is now part of the product suite from Computer Associates.", "pageId": 7918764, "created": 2006, "backlinksCount": 14, "revisionCount": 30, "dailyPageViews": 9, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/MARK_IV_(software)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3117", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "markdeep": { "title": "Markdeep", "appeared": 2015, "type": "textMarkup", "description": "Markdeep is a technology for writing plain text documents that will look good in any web browser, whether local or remote. It supports diagrams, calendars, equations, and other features as extensions of Markdown syntax.", "website": "https://casual-effects.com/markdeep/", "country": [ "Canada" ], "originCommunity": [ "https://github.com/morgan3d/markdeep/pulls" ], "example": [ "**Example**\n\nWelcome to Markdeep. It's the simple \nway to write plain text with _style_.\n \n*************************************\n* _______ *\n* .-------. / / .-----. *\n* | Write +-+->/ Edit ++->| Share | *\n* '-------' ^ /______/ | '-----' *\n* | | *\n* '--------' *\n*************************************\n\n1. Write a text document\n2. Add the Markdeep line at the end\n3. Save with file extension `.md.html`\n4. Double-click to view\n\nLearn more at\nhttps://casual-effects.com/markdeep" ] }, "markdown": { "title": "Markdown", "appeared": 2004, "type": "textMarkup", "creators": [ "John Gruber", "Aaron Swartz" ], "webRepl": [ "https://dillinger.io/" ], "documentation": [ "https://www.markdownguide.org/basic-syntax/" ], "country": [ "United States" ], "originCommunity": [ "https://talk.commonmark.org/" ], "compilesTo": [ "html" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": false }, "wikipedia": { "example": [ "# Heading\n\n## Sub-heading\n\n### Another deeper heading\n \nParagraphs are separated\nby a blank line.\n\nTwo spaces at the end of a line leave a \nline break.\n\nText attributes _italic_, *italic*, __bold__, **bold**, `monospace`.\n\nHorizontal rule:\n\n---\n\nBullet list:\n\n * apples\n * oranges\n * pears\n\nNumbered list:\n\n 1. apples\n 2. oranges\n 3. pears\n\nA [link](http://example.com)." ], "related": [ "html", "textile", "restructuredtext", "perl", "pandoc-app", "mime", "php", "python", "ruby", "drupal", "mediawiki", "rstudio-editor", "r", "c", "apl", "asciidoc", "org", "txt2tags" ], "summary": "Markdown is a lightweight markup language with plain text formatting syntax. It is designed so that it can be converted to HTML and many other formats using a tool by the same name. Markdown is often used to format readme files, for writing messages in online discussion forums, and to create rich text using a plain text editor. As the initial description of Markdown contained ambiguities and unanswered questions, many implementations and extensions of Markdown appeared over the years to answer these issues.", "pageId": 2415885, "dailyPageViews": 1954, "created": 2005, "backlinksCount": 286, "revisionCount": 1124, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Markdown" }, "githubLanguage": { "fileExtensions": [ "md", "livemd", "markdown", "mdown", "mdwn", "mdx", "mkd", "mkdn", "mkdown", "ronn", "scd", "workbook" ], "trendingProjectsCount": 0, "type": "prose", "filenames": [ "contents.lr" ], "aceMode": "markdown", "codemirrorMode": "gfm", "codemirrorMimeType": "text/x-gfm", "tmScope": "source.gfm", "wrap": true, "aliases": [ "pandoc" ], "repos": 1023, "id": "Markdown" }, "githubBigQuery": { "repos": 8, "users": 8, "id": "Markdown" }, "monaco": "markdown", "codeMirror": "markdown", "pygmentsHighlighter": { "filename": "markup.py", "fileExtensions": [ "md", "markdown" ], "id": "Markdown" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 58, "commitCount": 426, "sampleCount": 8, "example": [ "Tender\n======\n" ], "url": "https://github.com/atom/language-gfm" }, "leachim6": { "filepath": "m/Markdown.md", "fileExtensions": [ "md" ], "example": [ "Hello World\n" ], "id": "Markdown" }, "rijuRepl": { "example": [ "Hello, world!" ], "id": "https://riju.codes/markdown" }, "subreddit": [ { "memberCount": { "2022": 2463 }, "url": "https://reddit.com/r/Markdown" } ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2020|Routledge|R Markdown Cookbook (Chapman & Hall/CRC The R Series)|Xie, Yihui|9780367563837\n2017|Chapman and Hall/CRC|blogdown: Creating Websites with R Markdown (Chapman & Hall/CRC The R Series)|Xie, Yihui and Hill, Alison Presmanes and Thomas, Amber|9781138480452\n20190816|Springer Nature|Introducing Markdown and Pandoc|Thomas Mailund|9781484251492\n08/2013|Packt Publishing|Instant Markdown|Herrero Arturo|9781783559152\n20180727|Taylor & Francis|R Markdown|Yihui Xie; J.J. Allaire; Garrett Grolemund|9780429782961", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|R Markdown|10.1002/wics.1348|22|1|Benjamin Baumer and Dana Udwin|8d26eef104eae6e9d902a39eba546ed182195205\n2019|Codebraid: Live Code in Pandoc Markdown|10.25080/MAJORA-7DDC1DD1-008|2|0|Geoffrey M. Poore|fa7fd0916680a78582c6a05b2e6f65ff9a68106a" }, "marklogic": { "title": "MarkLogic", "appeared": 2001, "type": "database", "description": "Document-oriented database management system", "country": [ "United States" ], "originCommunity": [ "MarkLogic Corporation" ] }, "marko": { "title": "Marko", "appeared": 2014, "type": "textMarkup", "website": "https://markojs.com/", "country": [ "United States" ], "originCommunity": [ "https://github.com/marko-js" ], "domainName": { "registered": 2015, "awisRank": { "2022": 1272927 }, "name": "markojs.com" }, "githubRepo": { "firstCommit": 2014, "stars": 11433, "forks": 634, "subscribers": 216, "created": 2014, "updated": 2022, "description": "A declarative, HTML-based language that makes building web apps fun", "issues": 57, "url": "https://github.com/marko-js/marko" }, "repoStats": { "firstCommit": 2014, "commits": 5173, "committers": 163, "files": 4723 }, "githubLanguage": { "fileExtensions": [ "marko" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "text", "codemirrorMode": "htmlmixed", "codemirrorMimeType": "text/html", "tmScope": "text.marko", "aliases": [ "markojs" ], "repos": 101, "id": "Marko" }, "githubBigQuery": { "repos": 12, "users": 12, "id": "Marko" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 5, "commitCount": 40, "sampleCount": 3, "example": [ "$ var name = 'Frank';\n$ var colors = ['red', 'green', 'blue'];\n\n

\n Hello ${name}!\n

\n\n
    \n
  • \n ${color}\n
    • \n
\n
\n No colors!\n
" ], "url": "https://github.com/marko-js/marko-tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "markovjunior": { "title": "MarkovJunior", "appeared": 2022, "type": "pl", "creators": [ "Maxim Gumin" ], "country": [ "Finland" ], "originCommunity": [ "https://github.com/mxgmn/MarkovJunior/issues" ], "githubRepo": { "firstCommit": 2022, "stars": 5359, "forks": 234, "subscribers": 76, "created": 2022, "updated": 2022, "description": "Probabilistic language based on pattern matching and constraint propagation, 153 examples", "issues": 3, "url": "https://github.com/mxgmn/MarkovJunior" }, "repoStats": { "firstCommit": 2022, "commits": 28, "committers": 5, "files": 471 } }, "markus": { "title": "Markus", "appeared": 2020, "type": "queryLanguage", "country": [ "United States" ], "originCommunity": [ "https://github.com/Markus-Studio" ], "example": [ "type User: user {\n name: string;\n}\n\ntype Task {\n owner: User;\n title: string;\n done: bool;\n}\n\nquery myTasks() {\n is(Task),\n # %user is the current authenticated user.\n eq(.owner, %user)\n}\n\naction newTask($title: string) {\n create Task {\n user: %user,\n title: $title,\n done: false\n };\n}\n\naction toggleStatus($task: Task) {\n validate eq($task.owner, %user);\n\n update $task {\n .done: not(.done)\n };\n}\n\naction delete($task: Task) {\n validate eq($task.owner, %user);\n delete $task;\n}\n\naction edit($task: Task, $new_title: string) {\n validate eq($task.owner, %user);\n update $task {\n .title: $new_title\n };\n}\n" ], "githubRepo": { "stars": 2, "forks": 0, "subscribers": 2, "created": 2020, "updated": 2021, "description": "A declarative (database) query language!", "issues": 2, "url": "https://github.com/Markus-Studio/Markus" }, "repoStats": { "firstCommit": 2019, "commits": 374, "committers": 1, "files": 46 } }, "markwhen": { "title": "Markwhen", "appeared": 2022, "type": "textMarkup", "creators": [ "Rob Koch" ], "description": "Make a cascading timeline from Markdown-like text.", "website": "https://markwhen.com/", "webRepl": [ "https://markwhen.com/example" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/mark-when" ], "influencedBy": [ "markdown" ], "example": [ "title: Welcome to Markwhen 👋\n\n#Project1: #d336b1\n\nsection Welcome #welcome\nnow: This example timeline showcases some of markwhen's features.\n\nFeel free to delete everything to start making your own timeline #welcome\n\n\nnow: You can also view this example timeline at [markwhen.com/example](https://markwhen.com/example) #welcome\n\nOr you can save this timeline so you can refer to it later, by going to Browser storage & files, and clicking Save current.\n\nnow: For more information, view the documentation [here](https://docs.markwhen.com) or join the [discord](https://discord.gg/kQbqP4uz)\n#welcome\nendSection\n\nsection All Projects\ngroup Project 1 #Project1\n// Supports ISO8601\n2023-01/2023-03: Sub task #John\n2023-03/2023-06: Sub task 2 #Michelle\nMore info about sub task 2\n\n- [ ] We need to get this done\n- [x] And this\n- [ ] This one is extra\n\n2023-07: Yearly planning\nendGroup\n group Project 2 #Project2\n2023-04/4 months: Larger sub task #Danielle\n\n// Supports American date formats\n03/2023 - 1 year: Longer ongoing task #Michelle\n\n- [x] Sub task 1\n- [x] Sub task 2\n- [ ] Sub task 3\n- [ ] Sub task 4\n- [ ] so many checkboxes omg\n\n10/2023 - 2 months: Holiday season\nendGroup\n\ngroup Project 3\n01/2024: Project kickoff\n02/2024-04/2024: Other stuff\nendGroup\nendSection\n\n2023-01-03 every other week for 1 year: Biweekly meeting" ], "githubRepo": { "stars": 2263, "forks": 90, "subscribers": 24, "created": 2021, "updated": 2023, "description": "Make a cascading timeline from markdown-like text. Supports simple American/European date styles, ISO8601, images, links, locations, and more.", "issues": 48, "url": "https://github.com/mark-when/markwhen" }, "repoStats": { "firstCommit": 2022, "commits": 378, "committers": 2, "files": 148 } }, "marlais": { "title": "Marlais", "appeared": 1995, "type": "pl", "reference": [ "https://sourceforge.net/projects/marlais/" ], "country": [ "Unknown" ], "originCommunity": [ "https://sourceforge.net/p/marlais/mailman/" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3455", "centralPackageRepositoryCount": 0 }, "marmot": { "title": "Marmot", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2c35c23368871f5ecdd11d0e6897f0ee87ba678d" ], "country": [ "United States" ], "originCommunity": [ "Microsoft Research" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/MARMOT" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3713", "centralPackageRepositoryCount": 0 }, "marp": { "title": "Marp", "appeared": 2018, "type": "textMarkup", "description": "Presentations in markdown", "website": "https://marp.app/", "country": [ "Japan" ], "originCommunity": [ "https://github.com/marp-team" ], "supersetOf": [ "markdown" ], "example": [ "---\ntheme: gaia\nsize: 4:3\n---\n\n# A traditional 4:3 slide" ], "githubRepo": { "stars": 526, "forks": 120, "subscribers": 9, "created": 2018, "updated": 2023, "description": "The core of Marp converter", "issues": 12, "url": "https://github.com/marp-team/marp-core" }, "repoStats": { "firstCommit": 2018, "commits": 1153, "committers": 5, "files": 68 } }, "marsyas": { "title": "MARSYAS", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e3eb12246551b486cfcde677a38bd1d72675da09" ], "country": [ "United States" ], "originCommunity": [ "Marshall Space Flight Center", "Computer Applications, Incorporated" ], "hopl": "https://hopl.info/showlanguage.prx?exp=515", "centralPackageRepositoryCount": 0, "isbndb": "" }, "marten": { "title": "marten", "appeared": 1980, "type": "visual", "website": "http://www.andescotia.com/products/marten/", "country": [ "United States" ], "originCommunity": [ "Andescotia LLC" ] }, "mary-2": { "title": "Mary/2", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8b32b46d71095dfe0a005ba7fe146532d09bb58d" ], "country": [ "United States" ], "originCommunity": [ "Penobscot Research Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5980", "centralPackageRepositoryCount": 0 }, "mary": { "title": "Mary", "appeared": 1970, "type": "pl", "country": [ "Norway" ], "originCommunity": [ "Stiftelsen for industriell og teknisk forskning" ], "supersetOf": [ "algol-68" ], "hasLineComments": { "example": "% A comment", "value": true }, "hasComments": { "example": "% A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "lineCommentToken": [ [ "%" ] ], "assignmentToken": [ [ ":=" ] ], "wikipedia": { "example": [ "BEGIN\n INT i := 10; %% Variable with initial value.\n REF INT ri := i; %% Pointer initialized to point to i.\n INT j := 11;\n j :- REF INT =: ri; %% Type conversion and assignment\n %% ri now points to j.\n i =: (ri :- VAL REF INT); \n %% Assignment and type conversion\n %% ri points to j so j is changed.\n IF j > 10 %% Conditional statement with result\n THEN %% used inside an arithmetic expression.\n 1\n ELSE\n 2\n FI + j =: j;\nEND" ], "related": [ "sparc", "algol-68", "c", "algol" ], "summary": "Mary was a programming language designed and implemented by RUNIT at Trondheim, Norway in the 1970s. It borrowed many features from ALGOL 68 but was designed for machine-oriented programming. An unusual feature of its syntax was that expressions were constructed using the conventional infix operators, but all of them had the same precedence and evaluation went from left to right unless there were brackets. Assignment had the destination on the right and assignment was considered just another operator. Similar to C, several language features appear to have existed to allow programmers to produce reasonably well optimised code, despite a quite primitive code generator in the compiler. These included operators similar to the += et alter in C and explicit register declarations for variables. Notable features: \"Dataflow syntax\" - values flow from left to right, including assignment. Most constructs could be used in expressions (blocks, IF, CASE, etc.). Text-based recursive macros. Overloaded user-defined operators, not constrained to predefined identifiers as in C++. Automatic building and dereferencing of pointers from type context. Scalar range types. Array and set enumeration in loop iterators. Dynamic array descriptors (ROW).A book describing Mary was printed in 1974 (Fourth and last edition in 1979): Mary Textbook by Reidar Conradi & Per Holager. Compilers were made for Kongsberg Våpenfabrikk's SM-4 and Norsk Data Nord-10/ND-100 mini-computers. The original Mary compiler was written in NU ALGOL, ran on the Univac-1100 series and was used to bootstrap a native compiler for ND-100/SINTRAN-III. RUNIT implemented a CHILL compiler written in Mary which ran on ND-100 and had Intel 8086 and 80286 targets. When this compiler was ported to the VAX platform, a common backend for Mary and CHILL was implemented. Later, backends for i386 and SPARC were available. Since the Mary compiler was implemented in Mary, it was possible to run the compiler on all these platforms. Mary is no longer maintained.", "pageId": 20340, "created": 2001, "backlinksCount": 13, "revisionCount": 41, "dailyPageViews": 7, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Mary_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=647", "fileType": "text", "wordRank": 1514, "centralPackageRepositoryCount": 0, "isbndb": "" }, "mascara": { "title": "Mascara", "appeared": 2009, "type": "pl", "creators": [ "Olav Junker Kjær" ], "website": "https://web.archive.org/web/20170202011225/http://www.mascaraengine.com/", "country": [ "Denmark" ], "originCommunity": [ "http://olav.dk/" ] }, "masim": { "title": "MASIM", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/54170ee878e387df6210c602553cf57c8e5d032f" ], "country": [ "Austria" ], "originCommunity": [ "Johannes Kepler University Linz" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7420", "centralPackageRepositoryCount": 0 }, "maskjs": { "title": "Mask", "appeared": 2012, "type": "template", "website": "http://www.atmajs.com/", "country": [ "Germany" ], "originCommunity": [ "https://github.com/atmajs" ], "domainName": { "registered": 2013, "name": "atmajs.com" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "firstCommit": 2012, "stars": 95, "forks": 6, "subscribers": 10, "created": 2012, "updated": 2022, "description": "Markup | Template | HMVC", "issues": 1, "url": "https://github.com/atmajs/maskjs" }, "repoStats": { "firstCommit": 2012, "commits": 1710, "committers": 9, "files": 537 }, "githubLanguage": { "fileExtensions": [ "mask" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "mask", "tmScope": "source.mask", "repos": 306, "id": "Mask" }, "githubBigQuery": { "repos": 595, "users": 576, "id": "Mask" }, "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "mask" ], "id": "Mask" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 2, "commitCount": 60, "sampleCount": 1, "example": [ "\n// HTML Elements\nheader {\n \n img .logo src='/images/~[currentLogo].png' alt=logo;\n \n h4 > 'Bar View'\n \n if (currentUser) {\n \n .account >\n a href='/acount' >\n 'Hello, ~[currentUser.username]'\n }\n}\n\n.view {\n ul {\n \n // Iteration\n for ((user, index) of users) {\n \n li.user data-id='~[user.id]' {\n \n // interpolation\n .name > '~[ user.username ]'\n \n // expression\n .count > '~[: user.level.toFixed(2) ]'\n \n // util\n /* Localization sample\n * lastActivity: \"Am {0:dd. MM} war der letzte Eintrag\"\n */\n .date > '~[ L: \"lastActivity\", user.date]'\n }\n }\n }\n \n // Component\n :countdownComponent {\n input type = text >\n :dualbind value='number';\n \n button x-signal='click: countdownStart' > 'Start';\n \n h5 {\n '~[bind: number]'\n \n :animation x-slot='countdownStart' {\n @model > 'transition | scale(0) > scale(1) | 500ms'\n @next > 'background-color | red > blue | 2s linear'\n }\n }\n }\n}\n\nfooter > :bazCompo {\n \n 'Component generated at ~[: $u.format($c.date, \"HH-mm\") ]'\n}" ], "url": "https://github.com/tenbits/sublime-mask" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "masm": { "title": "MASM", "appeared": 1981, "type": "pl", "creators": [ "Thomas Jaeger" ], "website": "http://www.visualmasm.com", "reference": [ "http://www.visualmasm.com/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/ThomasJaeger/VisualMASM/issues" ], "githubRepo": { "firstCommit": 2017, "stars": 1241, "forks": 79, "subscribers": 67, "created": 2017, "updated": 2022, "description": "Visual MASM - Assembly IDE for Microsoft MASM", "issues": 16, "url": "https://github.com/ThomasJaeger/VisualMASM" }, "repoStats": { "firstCommit": 2017, "commits": 169, "committers": 2, "files": 611 }, "hopl": "https://hopl.info/showlanguage.prx?exp=2212", "centralPackageRepositoryCount": 0 }, "mass-energy-equation": { "title": "Mass Energy Equation", "appeared": 1905, "type": "equation", "creators": [ "Albert Einstein" ], "equation": "E=mc^2", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Mass–energy_equivalence" } }, "material-exchange-format": { "title": "MXF", "appeared": 2004, "type": "binaryDataFormat", "standsFor": "Material Exchange Format", "aka": [ "MXF" ], "fileExtensions": [ "mxf" ], "country": [ "Switzerland and United States" ], "originCommunity": [ "European Broadcasting Union", "Society of Motion Picture and Television Engineers" ], "wikipedia": { "summary": "Material Exchange Format (MXF) is a container format for professional digital video and audio media defined by a set of SMPTE standards. A typical example of its use is for delivering advertisements to TV stations and tapeless archiving of broadcast TV programs.", "backlinksCount": 297, "pageId": 154046, "dailyPageViews": 152, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Material_Exchange_Format" } }, "math-matic": { "title": "MATH-MATIC", "appeared": 1957, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Remington Rand" ], "wikipedia": { "example": [ "(2) TYPE-IN ALPHA . \n(2A) READ A B C SERVO 4 STORAGE A IF SENTINEL JUMP TO SENTENCE 8 . \n(3) READ D F SERVO 5 . \n(4) VARY Y 1 (0.1) 3 SENTENCE 5 THRU 6 . \n(5) X1 = (7*103*Y*A*SIN ALPHA)3 / (B POW D+C POW E) . \n(6) WRITE AND EDIT A Y D E X1 SERVO 6 . \n(7) JUMP TO SENTENCE 2A . \n(8) CLOSE-INPUT AND REWIND SENTENCE 3 . \n(9) CLOSE-OUTPUT SENTENCE 6 . \n(10) READ F G H N SERVO 4 STORAGE A IF SENTINEL JUMP TO SENTENCE 20 . \n(11) EXECUTE SENTENCE 3 . \n(12) X2 = (3 ROOT (E-G)+LOG (D+N)) / (F2.6*EXP H) . \n(13) WRITE EDIT F D F X2 SERVO 6 . \n(16) JUMP TO SENTENCE 10 . \n(20) STOP ." ], "related": [ "flow-matic", "arith-matic", "algol-58", "fortran" ], "summary": "MATH-MATIC is the marketing name for the AT-3 (Algebraic Translator 3) compiler, an early programming language for the UNIVAC I and UNIVAC II. MATH-MATIC was written beginning around 1955 by a team led by Charles Katz under the direction of Grace Hopper. A preliminary manual was produced in 1957 and a final manual the following year. Syntactically, MATH-MATIC was similar to Univac's contemporaneous business-oriented language, FLOW-MATIC, differing in providing algebraic-style expressions and floating-point arithmetic, and arrays rather than record structures.", "pageId": 202110, "created": 2003, "backlinksCount": 19, "revisionCount": 40, "dailyPageViews": 12, "appeared": 1957, "url": "https://en.wikipedia.org/wiki/MATH-MATIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=435", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "mathcad": { "title": "Mathcad", "appeared": 1986, "type": "pl", "website": "https://www.ptc.com/en/products/mathcad/", "country": [ "United States" ], "originCommunity": [ "Mathsoft Engineering", "Education, Inc", "PTC Inc" ], "wikipedia": { "related": [ "si", "mathematica", "maple" ], "summary": "Mathcad is computer software primarily intended for the verification, validation, documentation and re-use of engineering calculations. First introduced in 1986 on DOS, it was the first to introduce live editing of typeset mathematical notation, combined with its automatic computations.", "pageId": 1730437, "dailyPageViews": 181, "created": 2005, "backlinksCount": 226, "revisionCount": 345, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Mathcad" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2215", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nEngineering with MathCad: Using MathCad to Create and Organize Your Engineering Calculations [With CDROM]|2006|Brent Maxfield|1474788|2.00|1|0\nMathCAD for Chemical Engineers|2007|Hertanto Adidharma|584017|5.00|2|0\nMathCAD for Chemical Engineers - Second Edition|2009|Hertanto Adidharma|17446677|5.00|1|0\nEssential Mathcad for Engineering, Science, and Math|2008|Brent Maxfield|6011733|4.00|7|0", "isbndb": "year|publisher|title|authors|isbn13\n2003|Prentice Hall|Introduction to MathCAD 11 (ESource Series)|Larsen, Ronald W|9780130081773\n2013|Academic Press|Essential PTC® Mathcad Prime® 3.0: A Guide for New and Current Users|Maxfield, Brent|9780124104105\n2002|Charles River Media|The Mathcad 2001i Handbook (Programming Series)|Kiryanov, D.|9781584502654" }, "mathematica-editor": { "title": "Wolfram Mathematica", "appeared": 1988, "type": "editor", "country": [ "United States" ], "originCommunity": [ "Wolfram Research, Inc." ], "wikipedia": { "related": [ "wolfram", "linux", "c", "java", "modelica", "sql", "fortran", "cuda", "opencl", "http", "eclipse-editor", "visual-studio-editor", "haskell", "applescript", "racket", "visual-basic", "python", "clojure", "excel-app", "matlab", "sagemath", "mongodb", "wsdl", "labview" ], "summary": "Wolfram Mathematica (usually termed Mathematica) is a modern technical computing system spanning most areas of technical computing — including neural networks, machine learning, image processing, geometry, data science, visualizations, and others. The system is used in many technical, scientific, engineering, mathematical, and computing fields. It was conceived by Stephen Wolfram and is developed by Wolfram Research of Champaign, Illinois. The Wolfram Language is the programming language used in Mathematica.", "backlinksCount": 252, "pageId": 49024, "created": 2002, "revisionCount": 1523, "dailyPageViews": 342, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/Wolfram_Mathematica" }, "fileType": "na", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "mathematica-packagedata-pm": { "title": "mathematica-packagedata-pm", "appeared": 2015, "type": "packageManager", "website": "http://packagedata.net/", "country": [ "Unknown" ], "originCommunity": [ "https://community.wolfram.com/groups/-/m/t/562001" ], "domainName": { "registered": 2015, "awisRank": { "2022": 7612796 }, "name": "packagedata.net" }, "packageCount": 210, "forLanguages": [ "mathematica" ] }, "mathematica": { "title": "Mathematica", "appeared": 1988, "type": "pl", "creators": [ "Stephen Wolfram" ], "website": "http://www.wolfram.com/mathematica", "documentation": [ "https://reference.wolfram.com/language/" ], "aka": [ "Wolfram Language" ], "country": [ "United States" ], "originCommunity": [ "Wolfram Research" ], "releaseNotesUrl": "https://www.wolfram.com/mathematica/quick-revision-history/", "versions": { "1988": [ "1.0" ], "1989": [ "1.2" ], "1991": [ "2.0" ], "1992": [ "2.1" ], "1993": [ "2.2" ], "1996": [ "3.0" ], "1999": [ "4.0" ], "2000": [ "4.1" ], "2002": [ "4.2" ], "2003": [ "5.0" ], "2004": [ "5.1" ], "2005": [ "5.2" ], "2007": [ "6.0" ], "2008": [ "7.0" ], "2010": [ "8.0" ], "2012": [ "9.0" ], "2014": [ "10.0" ], "2016": [ "11.0" ], "2019": [ "12.0" ], "2021": [ "13.0" ] }, "visualParadigm": false, "hasLineComments": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "printToken": [ [ "Print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "wolfram", "linux", "c", "java", "modelica", "sql", "fortran", "cuda", "opencl", "http", "eclipse-editor", "visual-studio-editor", "haskell", "applescript", "racket", "visual-basic", "python", "clojure", "excel-app", "matlab", "sagemath", "mongodb", "wsdl", "labview" ], "summary": "Wolfram Mathematica (usually termed Mathematica) is a modern technical computing system spanning most areas of technical computing — including neural networks, machine learning, image processing, geometry, data science, visualizations, and others. The system is used in many technical, scientific, engineering, mathematical, and computing fields. It was conceived by Stephen Wolfram and is developed by Wolfram Research of Champaign, Illinois. The Wolfram Language is the programming language used in Mathematica.", "pageId": 49024, "dailyPageViews": 228, "created": 2016, "backlinksCount": 256, "revisionCount": 5, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/Mathematica" }, "githubLanguage": { "fileExtensions": [ "mathematica", "cdf", "m", "ma", "mt", "nb", "nbp", "wl", "wlt" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nAutodesk maya-usd https://github.com/Autodesk.png https://github.com/Autodesk/maya-usd Mathematica #ccc 97 16 43 \"A common USD (Universal Scene Description) plugin for Autodesk Maya\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "codemirrorMode": "mathematica", "codemirrorMimeType": "text/x-mathematica", "tmScope": "source.mathematica", "aliases": [ "mma", "wolfram", "wolfram language", "wolfram lang", "wl" ], "repos": 22012, "id": "Mathematica" }, "githubBigQuery": { "repos": 2662, "users": 2402, "id": "Mathematica" }, "codeMirror": "mathematica", "pygmentsHighlighter": { "filename": "algebra.py", "fileExtensions": [ "nb", "cdf", "nbp", "ma" ], "id": "Mathematica" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2018, "committerCount": 6, "commitCount": 157, "sampleCount": 12, "example": [ "Test[1 + 2, 3, TestID -> \"One plus two\"]\n" ], "url": "https://github.com/shadanan/mathematica-tmbundle" }, "projectEuler": { "memberCount": { "2019": 1664, "2022": 1757 }, "id": "Mathematica" }, "helloWorldCollection": [ "(* Hello World in Mathematica *)\n\nHello[] := Print[\"Hello, World!\"]\n" ], "leachim6": { "filepath": "m/Mathematica.nb", "fileExtensions": [ "nb" ], "example": [ "Print[\"Hello World\"]\n" ], "id": "Mathematica" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Mathematica", "tryItOnline": "mathematica", "indeedJobs": { "2017": 90, "query": "mathematica engineer" }, "linkedInSkill": { "2018": 146330, "id": "mathematica" }, "meetup": { "memberCount": 1678, "groupCount": 11, "url": "https://www.meetup.com/topics/mathematica" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1410", "packageRepository": [ "http://packagedata.net/" ], "fileType": "text", "isOpenSource": false, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMathematica: A System for Doing Mathematics by Computer|1988|Stephen Wolfram|448090|3.79|19|0\nAn Introduction to Programming with Mathematica(r)|2005|Paul R. Wellin|687991|3.67|15|0\nProgramming in Mathematica|1989|Roman E. Maeder|687997|4.25|12|1", "isbndb": "year|publisher|title|authors|isbn13\n1996|Addison-Wesley Professional|Programming in Mathematica|Maeder, Roman E.|9780201854497\n1994|Addison-Wesley|Mathematica for Scientists and Engineers|Bahder, Thomas B.|9780201540901\n2011|Wiley|Principles of Linear Algebra with Mathematica|Shiskowski, Kenneth M. and Frinkle, Karl|9780470637951\n1997|Academic Press|A Physicist's Guide to Mathematica|Tam, Patrick T.|9780126831900\n2001|Morgan Kaufmann|Illustrating Evolutionary Computation with Mathematica (The Morgan Kaufmann Series in Artificial Intelligence)|Jacob, Christian|9781558606371\n2010|O'Reilly Media|Mathematica Cookbook: Building Blocks for Science, Engineering, Finance, Music, and More|Mangano, Sal|9780596520991\n2009|Cambridge University Press|Computational Discrete Mathematics (Combinatorics and Graph Theory with Mathematica ®)|Pemmaraju, Sriram|9780521121460\n1995|Springer|An Introduction to Programming With Mathematica|Gaylord, Richard J. and Kamin, Samuel N. and Wellin, Paul R.|9780387944340\n2009|Academic Press|Mathematica Navigator: Mathematics, Statistics and Graphics, Third Edition|Ruskeepaa, Heikki|9780123741646\n2004|Springer|The Mathematica GuideBook for Graphics|Trott, Michael|9780387950105\n2000|Cambridge University Press|The Beginner's Guide to MATHEMATICA ®, Version 4|Glynn, Jerry and Gray, Theodore|9780521777698\n1999|Springer|Mathematica in Action|Wagon, Stan|9780387986845\n1992|Addison-Wesley|The Beginner's Guide to Mathematica Version 2|Gray, Theodore W. and Glynn, Jerry|9780201582215\n2004|Wiley|Mathematica Technology Resource Manual to accompany Differential Equations, 2e|Borrelli, Robert L. and Coleman, Courtney S. and Switkes, Jennifer|9780471483861\n1996|Academic Press|The Mathematica Bundle: The Mathematica Programmer II|Maeder, Roman E.|9780124649927\n1996|Wolfram Media Inc|The Mathematica Book|Wolfram, Stephen|9780965053204\n1996|Cambridge University Press|The MATHEMATICA ® Book, Version 3|Wolfram, Stephen|9780521588881\n2018|Springer|Mathematica for Bioinformatics: A Wolfram Language Approach to Omics|Mias, George|9783319723778\n2001|Cambridge University Press|MathLink ® Paperback with CD-ROM: Network Programming with MATHEMATICA ®|Miyaji, Chikara|9780521645980\n2020|Wolfram Media|Hands-on Start to Wolfram Mathematica and Programming with the Wolfram Language|Hastings, Cliff and Mischo, Kelvin and Morrison, Michael|9781579550387\n2021|Apress|Beginning Mathematica and Wolfram for Data Science: Applications in Data Analysis, Machine Learning, and Neural Networks|Villalobos Alva, Jalil|9781484265949\n1997|Prentice Hall|Mathematica for Scientists and Engineers: Using Mathematica to Do Science|Gass, Richard|9780132276122\n1994|Academic Pr|The Mathematica Programmer|Maeder, Roman E.|9780124649903\n2019|Springer|Using Mathematica for Quantum Mechanics: A Student’s Manual|Schmied, Roman|9789811375880\n2008|Academic Press|Mathematica by Example|Abell, Martha L. L. and Braselton, James P.|9780123743183\n2008|Academic Press|A Physicist's Guide to Mathematica|Tam, Patrick T.|9780126831924\n2004|Springer|The Mathematica GuideBook for Programming|Trott, Michael|9780387942827\n2011|Academic Press|A Physicist's Guide to Mathematica|Tam, Patrick T.|9780080926247\n2001|Birkhäuser|Nonlinear Physics with Mathematica for Scientists and Engineers|Enns, Richard H. and McGuire, George C.|9780817642235\n2005|Springer|The Mathematica GuideBook for Numerics|Trott, Michael|9780387950112\n2007|Springer|The Mathematica GuideBook for Symbolics|Trott, Michael|9780387288154\n2002|Academic Press|Mathematica for Microeconomics|Stinespring, John Robert|9780126709612\n2005|Springer|The Mathematica GuideBook for Symbolics (w/ DVD)|Trott, Michael|9780387950204\n2016|Wiley|Micromechanics with Mathematica|Nomura, Seiichi|9781118385708\n2019|Springer|Using Mathematica for Quantum Mechanics: A Student’s Manual|Schmied, Roman|9789811375873\n2009|Cambridge University Press|The Student's Introduction to MATHEMATICA ®: A Handbook for Precalculus, Calculus, and Linear Algebra|Torrence, Bruce F. and Torrence, Eve A.|9780521717892\n1991|Addison-Wesley|Programming in Mathematica (2nd Edition)|Maeder, Roman E.|9780201548785\n1994|Springer|Mathematica Graphics: Techniques & Applications|Wickham-Jones, Tom|9780387940472\n2004|Springer|Computational Geosciences with Mathematica|Haneberg, William|9783540402459\n1989|Addison-Wesley|Programming in Mathematica|Maeder, Roman E.|9780201510027\n1991-04-01T00:00:01Z|Addison-Wesley|A Programming in Mathematica (2nd Edition)|Maeder, Roman E.|9780201548778\n1998|Academic Press|Mathematica Navigator: Graphics and Methods of Applied Mathematics|Ruskeepaa, Heikki|9780126036404\n2014|Springer|The Mathematica GuideBook for Programming|Trott, Michael|9781461264217\n2002|Academic Press|Computing with Mathematica|Hoft, Margret H. and Hoft, Hartmut F.W.|9780123516664\n2005|Wiley|Getting Started with Mathematica|Cheung, C-K. and Keough, G. E. and Landraitis, Charles and Gross, R.|9780471478157\n1994|Birkhäuser|Mathematica as a Tool: An introduction with practical examples|Kaufmann, Stephan|9783764350314\n2001|Cambridge University Press|MathLink ® Hardback with CD-ROM: Network Programming with MATHEMATICA ®|Miyaji, Chikara|9780521641722\n1996|Wolfram Media/Cambridge|The Mathematica Book|Wolfram, Stephen|9780965053211\n1994|Birkhauser|Mathematica As a Tool: An Introduction With Practical Examples|Kaufmann, Stephan|9780817650315\n1999|Wolfram Media Inc|The Mathematica Book|Wolfram, Stephen|9781579550042\n2020|Springer|Using Mathematica For Quantum Mechanics|Roman Schmied|9789811375903\n2018|Science Press|WOLFRAM MATHEMATICA Practical Programming Guide(Chinese Edition)|[ MEI ] KE LI FU · HEI SI TING SI DENG ZHU|9787030580641\n2014|LAP LAMBERT Academic Publishing|Approximation and Antenna and Filter Synthesis: Some Moduli in Programming Environment MATHEMATICA|Kyurkchiev, Nikolay and Andreev, Andrey|9783659533228\n2009|CRC Press|Structural Dynamics of Earthquake Engineering: Theory and Application using Mathematica and Matlab (Woodhead Publishing in Materials)||9781439801321\n2012|Springer|Intelligent Routines: Solving Mathematical Analysis with Matlab, Mathcad, Mathematica and Maple (Intelligent Systems Reference Library Book 39)|Anastassiou, George A. and Iatan, Iuliana F.|9783642284755\n20100402|O'Reilly Media, Inc.|Mathematica Cookbook|Sal Mangano|9781449390761\n1996|Addision Wesley Pub.|Programming In Mathematica|Maeder, Roman.|9780201854497\n20140509|Elsevier S & T|Mathematica by Example|Martha L Abell; James P. Braselton|9781483259284\n24-12-2015|Packt Publishing|Mathematica Data Analysis|Sergiy Suchok|9781785884450\n1991|New York : W.H. Freeman, c1991.|Mathematica in action|Wagon and Stan and S.|9780716722021\n2003|Crc Press|Modelling Metabolism With Mathematica|Peter Mulquiney and Philip W. Kuchel|9780849314681\n1995/01/01|London ; New York : c1994.|First steps in Mathematica|Werner Burkhardt|9780387198750\n2017|de Gruyter GmbH, Walter|Mathematica Und Wolfram Language|Christian H. Weiß|9783110425222\n2005|Jones and Bartlett Publishers, Inc, United States|Calculus : Labs for Mathematica|O'Connor|9780763734251\n20121206|Springer Nature|Computational Geosciences with Mathematica|William Haneberg|9783642185540\n20160919|Elsevier S & T|Differential Equations with Mathematica|Martha L. Abell; James P. Braselton|9780128047774\n20030514|Taylor & Francis|Modelling Metabolism with Mathematica|Peter Mulquiney; Philip W. Kuchel|9780203503935\n20220118|Elsevier S & T|Differential Equations with Mathematica|Martha L. Abell; James P. Braselton|9780323984362\n20010223|Elsevier S & T|Illustrating Evolutionary Computation with Mathematica|Christian Jacob|9780080508450", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|A 99 line code for discretized Michell truss optimization written in Mathematica|10.1007/S00158-010-0557-Z|101|2|T. Sokół|a251bde86d0b6e4f377acd820812c9abdfa6705d\n2004|The Mathematica guidebook for programming|10.1007/978-1-4419-8503-3|70|3|M. Trott|2255e498f8eac2e834763ad55fbce1172ca00b3f\n1995|Computer simulations with Mathematica - explorations in complex physical and biological systems|10.1063/1.2808263|69|0|R. Gaylord and P. Wellin|abb646532692e7c4483a6a2d242723e4cea41d1c\n1997|Psychophysica: Mathematica notebooks for psychophysical experiments (cinematica--psychometrica--quest).|10.1163/156856897X00384|35|0|A. Watson and J. Solomon|75ff0704b310a10e5ef276cd69d60fb2bbf4b24c\n1994|The Mathematica programmer|10.5860/choice.31-6096|29|1|Roman Maeder|99e45dded79f54dfe60856fb708f2d804d1910e8\n2000|Symbolic Maximum Likelihood Estimation with Mathematica|10.1111/1467-9884.00233|23|1|Colin Rose and Murray D. Smith|8f5208baacf72f1a072dc7bb6c7c28c085ba9555\n1995|Bayesian Statistics Using Mathematica|10.1080/00031305.1995.10476118|13|0|P. Cook and L. Broemeling|51709e378f27279f52815fe857992e85ccbe35e3\n2003|\"MathGridLink - A bridge between Mathematica and \"\"the Grid\"\"\"|10.11309/JSSSTCONFERENCE.2003.0.72.0|12|1|Tepeneu Dorin and 哲雄 井田|f296979d100339ff8b3e91f370949350200446c9\n1994|Quantum mechanics using computer algebra : includes sample programs for REDUCE, MAPLE, MATHEMATICA and C++|10.1142/2362|8|0|W. Steeb|357711658754c08f57edf6020d6b6a3753f31902\n1994|Fuzzifying a target motion analysis model using Fril and Mathematica|10.1109/FUZZY.1994.343900|6|0|J. Baldwin and T. Martin|88d8fb392f43eac1c20388524964a5a5d01c71b8\n2006|Mathematica 5.2|10.1198/000313006X110483|5|0|Joseph Hilbe|63f04087aeecb06178a5b0566ba63a512763b47b\n2013|Programming with Mathematica|10.1017/cbo9781316337738.002|4|2|P. Wellin|2d9566bcbccf2d29076a51da21138e4068942251\n1991|FINDING LEAST SQUARES LINES WITH MATHEMATICA|10.1080/10511979108965603|1|0|J. H. Mathews|0e2ce36de1921a31e3f40cbe4a20cf6cea54c943\n2000|Simulating and visualizing neural networks with Mathematica|10.1080/002073900434341|1|0|P. Watters|36652f8f558f03496c9d357983848021bbe35f2c\n1997|Review of mathematica|10.1080/10807039709383692|1|0|S. Vaughn|ce020359bbf874e67edafed118c845d0d31e5b9d\n1997|Mathematica solutions to the ISSAC system challenge 1997|10.1145/274888.274889|1|0|M. Trott|9e6ca630a377185ff64bb766240390f76bed1e5c\n2005|Some useful MATHEMATICA teaching examples|10.2298/FUEE0502329T|1|0|Milan B. Tasic and P. Stanimirović and I. Stanimirović and M. Petković and N. Stojkovic|8675054685157feda551facaae639d5aecb7bb65\n2009|Using Mathematica within E-Prime|10.20982/TQMP.05.2.P059|1|0|D. Cousineau|f33e08870a07bacf039a43cb514bd653f8c2822d\n2014|Short Introduction to Wolfram’s Mathematica|10.1007/978-3-7091-1777-4_6|1|0|Y. Vetyukov|d649b954d1f945739077ab40c3e0b57fead15456\n2019|A Simple Way for Estimating Mechanical Properties from Stress-Strain Diagram using MATLAB and Mathematica|10.1109/ISMSIT.2019.8932881|1|0|E. Yılmaz and S. Yavuz|662fabd1a23db95bd9f9e1bd5b7bb06273b6dc78\n2018|Computational Mathematics with the Wolfram Language and Mathematica|10.1007/978-1-4842-4212-4_4|1|0|Agus Kurniawan|dfddef679a3c8fceb2e16fb969204a90e03e7a7f" }, "mathics": { "title": "mathics", "appeared": 2012, "type": "pl", "description": "Mathics is a free, general-purpose online computer algebra system featuring Mathematica-compatible syntax and functions. It is backed by highly extensible Python code, relying on SymPy for most mathematical tasks.", "website": "https://mathics.github.io/", "reference": [ "https://news.ycombinator.com/item?id=11459186" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/Mathics3" ], "domainName": { "name": "mathics.github.io" }, "example": [ "StringJoin[Riffle[Map[ToString, Table[Fibonacci[i], {i,16}]], \", \"]] <> \"...\"" ], "githubRepo": { "firstCommit": 2011, "stars": 2090, "forks": 218, "subscribers": 71, "created": 2011, "updated": 2022, "description": "This repository is for archival. Please see https://github.com/Mathics3/mathics-core", "issues": 170, "url": "https://github.com/mathics/Mathics" }, "repoStats": { "firstCommit": 2011, "commits": 5749, "committers": 59, "files": 299 }, "tryItOnline": "mathics", "jupyterKernel": [ "http://nbviewer.ipython.org/gist/sn6uv/8381447" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "mathjax": { "title": "MathJax", "appeared": 2008, "type": "textMarkup", "description": "Beautiful and accessible math in all browsers", "website": "https://www.mathjax.org/", "country": [ "United States" ], "originCommunity": [ "NumFOCUS Foundation" ], "domainName": { "registered": 2008, "awisRank": { "2022": 172360 }, "name": "mathjax.org" }, "related": [ "katex" ], "twitter": "https://twitter.com/mathjax" }, "mathlab": { "title": "MATHLAB", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/298ddf1bd24a43720211b5e9d925d00fa9d008fa" ], "country": [ "United States" ], "originCommunity": [ "The MITRE Corporation" ], "wikipedia": { "related": [ "matlab", "lisp", "doi" ], "summary": "MATHLAB is a computer algebra system created in 1964 by Carl Engelman at MITRE and written in Lisp. \"MATHLAB 68\" was introduced in 1967 and became rather popular in university environments running on DECs PDP-6 and PDP-10 under TOPS-10 or TENEX. In 1969 this version was included in the DECUS user group's library (as 10-142) as royalty-free software. Carl Engelman left MITRE for Symbolics where he contributed his expert knowledge in the development of Macsyma.", "backlinksCount": 7, "pageId": 21208499, "dailyPageViews": 222, "created": 2009, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/MATHLAB" }, "hopl": "https://hopl.info/showlanguage.prx?exp=201", "centralPackageRepositoryCount": 0, "isbndb": "" }, "mathlingua": { "title": "MathLingua", "appeared": 2019, "type": "pl", "website": "https://www.mathlingua.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/DominicKramer/mathlingua/issues" ], "domainName": { "registered": 2019, "name": "mathlingua.org" }, "example": [ "Result:\n. for: X\n where:\n . 'X \\subset \\reals'\n then:\n . iff:\n . 'X is \\real.compact \\set'\n then:\n . 'X is \\real.closed \\real.bounded \\set'\nMetadata:\n. name = \"Heine-Borel Theorem\"" ] }, "mathml": { "title": "MathML", "appeared": 1998, "type": "xmlFormat", "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "related": [ "mathjax" ], "example": [ "\n\n\n \n a ⁢ x2\n +b⁢x\n +c\n \n" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/MathML" } }, "mathpix-markdown": { "title": "Mathpix Markdown", "appeared": 2019, "type": "textMarkup", "description": "Standard Markdown and extended it with key LaTeX features and chemistry support. Mathpix Markdown extends standard Markdown, for more power and control when converting your document to HTML, LaTeX, PDF, and DOCX.", "documentation": [ "https://mathpix.com/docs/mathpix-markdown/syntax-reference" ], "reference": [ "https://mathpix.com/markdown-to-latex" ], "supersetOf": [ "markdown" ], "example": [ "Compute \\(f(x) = x^2 + 2\\) if \\(x=2\\)." ], "githubRepo": { "url": "https://github.com/Mathpix/mathpix-markdown-it" } }, "mathsy": { "title": "Mathsy", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dda48a3c7a244b73b3e5fe84c3b0ffe8dee2d1f4" ], "country": [ "United States" ], "originCommunity": [ "Lawrence Livermore Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4355", "centralPackageRepositoryCount": 0 }, "mathtype": { "title": "MathType", "appeared": 1987, "type": "application", "website": "https://www.wiris.com/en/mathtype/", "documentation": [ "https://docs.wiris.com/mathtype/index.html" ], "country": [ "Spain" ], "originCommunity": [ "Design Science" ], "releaseNotesUrl": "https://docs.wiris.com/mathtype/en/mathtype-office-tools/mathtype-office-tools-release-notes.html", "versions": { "2022": [ "v3.4.0" ] }, "related": [ "tex" ], "visualParadigm": true, "wikipedia": { "url": "https://en.wikipedia.org/wiki/MathType" } }, "mathworks-file-exchange-pm": { "title": "MathWorks File Exchange", "appeared": 1997, "type": "packageManager", "website": "https://www.mathworks.com/matlabcentral/fileexchange/", "country": [ "United States" ], "originCommunity": [ "The MathWorks, Inc" ], "packageCount": 9718, "forLanguages": [ "matlab" ] }, "matita": { "title": "Matita", "appeared": 1999, "type": "pl", "country": [ "Italy" ], "originCommunity": [ "University of Bologna" ], "wikipedia": { "summary": "Matita is an experimental proof assistant under development at the Computer Science Department of the University of Bologna. It is a tool aiding the development of formal proofs by man-machine collaboration, providing a programming environment where formal specifications, executable algorithms and automatically verifiable correctness certificates naturally coexist. Matita is based on a dependent type System known as the Calculus of (Co)Inductive Constructions (a derivative of Calculus of Constructions), and is compatible, to some extent, with Coq. The word \"matita\" means \"pencil\" in Italian (a simple and widespread editing tool). It is a reasonably small and simple application, whose architectural and software complexity is meant to be mastered by students, providing a tool particularly suited for testing innovative ideas and solutions. Matita adopts a tactic-based editing mode; (XML-encoded) proof objects are produced for storage and exchange.", "backlinksCount": 11, "pageId": 7160638, "dailyPageViews": 10, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Matita" }, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover|10.1007/s10817-011-9228-z|6|0|A. Asperti and W. Ricciotti and C. Coen and E. Tassi|3e0eac10974ad1e27db2d9ccc9ff4855b239d45d" }, "matlab": { "title": "MATLAB", "appeared": 1984, "type": "pl", "creators": [ "Cleve Moler" ], "website": "http://mathworks.com/products/matlab", "documentation": [ "https://www.mathworks.com/help/matlab/" ], "emailList": [ "https://lists.rothamsted.ac.uk/mailman/listinfo/matlab-users" ], "country": [ "United States" ], "originCommunity": [ "University of New Mexico" ], "releaseNotesUrl": "https://www.mathworks.com/help/matlab/release-notes.html", "visualParadigm": true, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasComments": { "example": "% This is a comment", "value": true }, "hasMultiLineComments": { "example": "%{\nA comment.\n%}", "value": true }, "hasConstructors": { "example": "", "value": true }, "hasExplicitTypeCasting": { "example": "b = cast(a, 'like', p)", "value": true }, "hasImports": { "example": "import pkg.cls1\nimport pkg.pkfcn", "value": true }, "hasIterators": { "example": "% Define an array of integers\nmyArray = [1,3,5,7,11,13];\n\nfor n = myArray\n % ... do something with n\n disp(n) % Echo integer to Command Window\nend", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "% A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "%" ] ], "multiLineCommentTokens": [ [ "%{", "%}" ] ], "printToken": [ [ "disp" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "[X,Y] = meshgrid(-10:0.25:10,-10:0.25:10);\nf = sinc(sqrt((X/pi).^2+(Y/pi).^2));\nsurf(X,Y,f);\naxis([-10 10 -10 10 -0.3 1])\nxlabel('{\\bfx}')\nylabel('{\\bfy}')\nzlabel('{\\bfsinc} ({\\bfR})')" ], "related": [ "mathlab", "c", "java", "linux", "ia-32", "apl", "pl-0", "speakeasy", "julia", "octave", "scilab", "csharp", "fortran", "python", "mupad", "simulink", "r", "perl", "xml", "sql", "maple", "mathematica", "idl", "sagemath", "s", "perl-data-language", "numpy", "scipy", "matplotlib", "lua", "ruby", "javascript", "jvm", "hdf", "powerpc", "solaris", "sparc", "subversion", "json", "isbn" ], "summary": "MATLAB (matrix laboratory) is a multi-paradigm numerical computing environment. A proprietary programming language developed by MathWorks, MATLAB allows matrix manipulations, plotting of functions and data, implementation of algorithms, creation of user interfaces, and interfacing with programs written in other languages, including C, C++, C#, Java, Fortran and Python. Although MATLAB is intended primarily for numerical computing, an optional toolbox uses the MuPAD symbolic engine, allowing access to symbolic computing abilities. An additional package, Simulink, adds graphical multi-domain simulation and model-based design for dynamic and embedded systems. As of 2017, MATLAB has over 2 million users across industry and academia. MATLAB users come from various backgrounds of engineering, science, and economics.", "pageId": 20412, "dailyPageViews": 2338, "created": 2001, "backlinksCount": 1565, "revisionCount": 2461, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/MATLAB" }, "githubLanguage": { "fileExtensions": [ "matlab", "m" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nluanfujun deep-photo-styletransfer https://github.com/luanfujun.png https://github.com/luanfujun/deep-photo-styletransfer MATLAB #e16737 9275 1342 92 \"Code and data for paper \"\"Deep Photo Style Transfer\"\": https://arxiv.org/abs/1703.07511\"\nHuangCongQing Algorithms_MathModels https://github.com/HuangCongQing.png https://github.com/HuangCongQing/Algorithms_MathModels MATLAB #e16737 376 162 47 \"【国赛】【美赛】数学建模相关算法 MATLAB实现\"\nAvaisP machine-learning-programming-assignments-coursera-andrew-ng https://github.com/AvaisP.png https://github.com/AvaisP/machine-learning-programming-assignments-coursera-andrew-ng MATLAB #e16737 218 214 14 \"Solutions to Andrew NG's machine learning course on Coursera\"", "trendingProjectsCount": 4, "type": "programming", "aceMode": "matlab", "codemirrorMode": "octave", "codemirrorMimeType": "text/x-octave", "tmScope": "source.matlab", "aliases": [ "octave" ], "repos": 311901, "id": "Matlab" }, "githubBigQuery": { "repos": 2791, "users": 2497, "id": "MATLAB" }, "pygmentsHighlighter": { "filename": "matlab.py", "fileExtensions": [ "m" ], "id": "Matlab" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2018, "committerCount": 2, "commitCount": 21, "sampleCount": 39, "example": [ "function [ d, d_mean, d_std ] = normalize( d )\n d_mean = mean(d);\n d = d - repmat(d_mean, size(d,1), 1);\n d_std = std(d);\n d = d./ repmat(d_std, size(d,1), 1);\nend\n" ], "url": "https://github.com/mathworks/MATLAB-Language-grammar" }, "projectEuler": { "memberCount": { "2019": 3028, "2022": 3252 }, "id": "Matlab" }, "helloWorldCollection": [ "% Hello World in MATLAB.\n\ndisp('Hello World');\n" ], "leachim6": { "filepath": "m/MATLAB.m", "fileExtensions": [ "m" ], "example": [ "disp('Hello World')\n" ], "id": "MATLAB" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MATLAB", "indeedJobs": { "2017": 6204, "query": "matlab engineer" }, "linkedInSkill": { "2018": 2602372, "id": "matlab" }, "stackOverflowSurvey": { "2021": { "users": 3846, "medianSalary": 43948, "fans": 1562, "percentageUsing": 0.05 } }, "officialBlogUrl": [ "https://blogs.mathworks.com/matlab/" ], "eventsPageUrl": [ "https://www.mathworks.com/company/events.html" ], "faqPageUrl": [ "https://www.mathworks.com/matlabcentral/answers/faqs" ], "subreddit": [ { "memberCount": { "2017": 13222, "2022": 46296 }, "url": "https://reddit.com/r/matlab" } ], "meetup": { "memberCount": 10609, "groupCount": 25, "url": "https://www.meetup.com/topics/matlab" }, "tiobe": { "currentRank": 12, "id": "MATLAB" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2216", "pypl": "Matlab", "packageRepository": [ "https://www.mathworks.com/matlabcentral/fileexchange/" ], "twitter": "https://twitter.com/matlab", "jupyterKernel": [ "https://github.com/imatlab/imatlab", "https://github.com/calysto/matlab_kernel" ], "fileType": "text", "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMATLAB Programming for Engineers|1999|Stephen J. Chapman|4467285|4.10|114|6\nMATLAB for Neuroscientists: An Introduction to Scientific Computing in MATLAB|2008|Pascal Wallisch|3922239|3.94|32|0\nMATLAB for Engineers|2010|Holly Moore|18128130|3.95|37|1\nGetting Started with MATLAB: A Quick Introduction for Scientists and Engineers|2009|Rudra Pratap|13368999|4.01|72|4\nMATLAB for Control Engineers|2007|Katsuhiko Ogata|2185450|4.00|38|0\nEssential MATLAB for Engineers and Scientists|1997|Brian D. Hahn|546841|3.86|43|3\nIntroduction to MATLAB for Engineers|1998|William J. Palm III|10706762|3.88|17|1\nAn Engineers Guide to MATLAB|2000|Edward B. Magrab|3884382|4.29|7|0\nEssentials of MATLAB Programming|2005|Stephen J. Chapman|1175135|4.00|17|0\nGetting Started with MATLAB 7: A Quick Introduction for Scientists and Engineers|2005|Rudra Pratap|337141|4.03|105|5", "isbndb": "year|publisher|title|authors|isbn13\n2010|McGraw-Hill Education|Introduction to MATLAB for Engineers|Palm, William|9780073534879\n2012|Pearson|Engineering Computation with MATLAB|Smith, David|9780132568708\n2015|Cengage Learning|MATLAB Programming for Engineers|Chapman, Stephen J.|9781111576714\n2013|Academic Press|MATLAB for Neuroscientists: An Introduction to Scientific Computing in MATLAB|Wallisch, Pascal and Lusignan, Michael E. and Benayoun, Marc D. and Baker, Tanya I. and Dickey, Adam Seth and Hatsopoulos, Nicholas G.|9780123838360\n2008|Cengage Learning|Essentials of MATLAB Programming|Chapman, Stephen J.|9780495295686\n2009|Pearson|Engineering Computation With MATLAB|Smith, David M.|9780136080633\n2011|CL Engineering|Digital Signal Processing Using MATLAB|Ingle, Vinay K. and Proakis, John G.|9781111427375\n2011|Wiley|Fundamentals of Digital Image Processing: A Practical Approach with Examples in Matlab|Solomon, Chris and Breckon, Toby|9780470844731\n2014|CRC Press|Essential MATLAB and Octave|Rogel-Salazar, Jesus|9781482234633\n2017|Apress|MATLAB Deep Learning: With Machine Learning, Neural Networks and Artificial Intelligence|Kim, Phil|9781484228456\n2009|CRC Press|MATLAB with Applications to Engineering, Physics and Finance|Baez-Lopez, David|9781439806975\n2005|Springer|Mechanics of Composite Materials with MATLAB|Voyiadjis, George Z and Kattan, Peter I.|9783540243533\n2003|Prentice Hall|Matlab Programming|Kuncicky, David C.|9780130351272\n2017|SDC Publications|An Engineer's Introduction to Programming with MATLAB 2017|Shawna Lockhart and Eric Tilleson|9781630571252\n2017|Academic Press|MATLAB Programming for Biomedical Engineers and Scientists|King, Andrew P. and Aljabar, Paul|9780128122037\n2004|McGraw-Hill Science/Engineering/Math|Introduction to Matlab 7 for Engineers (McGraw-Hill's Best: Basic Engineering Series and Tools)|Palm III,William|9780072548181\n2005|Wiley-Interscience|Applied Numerical Methods Using MATLAB|Yang, Won Y. and Cao, Wenwu and Chung, Tae-Sang and Morris, John|9780471698333\n2001|SIAM: Society for Industrial and Applied Mathematics|Spectral Methods in MATLAB (Software, Environments, Tools)|Trefethen, Lloyd N.|9780898714654\n2009|Academic Press|Essential Matlab for Engineers and Scientists (Hahn and Attaway Bundle)|Hahn, Brian and Valentine Ph.D., Daniel|9780123748836\n2006|Jones & Bartlett Learning|Digital Signal Processing Using Matlab And Wavelets (Electrical Engineering)|Weeks, Michael|9780977858200\n2005|Oxford University Press|Getting Started with MATLAB 7: A Quick Introduction for Scientists and Engineers (The Oxford Series in Electrical And Computer Engineering)|Pratap, Rudra|9780195179378\n2009|Prentice Hall|MATLAB and Its Applications in Engineering: Based on Matlab 7.5 (R2007b)|Bansal, Raj Kumar and Goel, Ashok Kumar and Sharma, Manoj Kumar|9788131716816\n2008|Jones & Bartlett Learning|Classical Mechanics With MATLAB Applications|Hasbun, Javier|9780763746360\n2007|Addison Wesley|Engineering Computation with MATLAB|Smith, David M|9780321481085\n2001|Prentice Hall|Numerical Analysis and Graphic Visualization with MATLAB (2nd Edition)|Nakamura, Shoichiro|9780130654892\n|CENGAGE Learning Custom Publishing|Essentials of MATLAB (R) Programming, International Edition|Chapman, Stephen|9781305970717\n2004|Course Technology|Introduction to Digital Image Processing with MATLAB|McAndrew, Alasdair|9780534400118\n2004|CRC Press|Electronics and Circuit Analysis Using MATLAB|John Okyere Attia|9780849318924\n2022|PHI|Lab Primer Through Matlab|JAYADEVAN, R.|9788120349322\n2006|Dog Ear Publishing, LLC|MATLAB Advanced GUI Development|Scott T. Smith|9781598581812\n1998|Oxford University Press|Getting Started with MATLAB 5, A Quick Introduction for Scientists and Engineers|Pratap, Rudra|9780195129472\n2005-02-04|Wiley|Engineering and Scientific Computations Using MATLAB|Sergey E. Lyshevski|9780471723851\n2020|Wiley|Applied Numerical Methods Using MATLAB|Yang, Won Y. and Cao, Wenwu and Kim, Jaekwon and Park, Kyung W. and Park, Ho-Hyun and Joung, Jingon and Ro, Jong-Suk and Lee, Han L. and Hong, Cheol-Ho and Im, Taeho|9781119626800\n2019|Springer|Linear Algebra, Signal Processing, and Wavelets - A Unified Approach: MATLAB Version (Springer Undergraduate Texts in Mathematics and Technology)|Øyvind Ryan|9783030018122\n2003|Springer|Scientific Computing with MATLAB (Texts in Computational Science and Engineering 2)|Quarteroni, Alfio and Saleri, Fausto|9783540443636\n2018|CRC Press|Programming with MATLAB for Scientists: A Beginner’s Introduction|Mikhailov, Eugeniy E.|9781498738286\n2005|Chapman and Hall/CRC|An Introduction to Numerical Methods: A MATLAB Approach|Kharab, Abdelwahab and Kharab, Abdelwahab and Guenther, Ronald B.|9781584885573\n2006|Morgan and Claypool Publishers|Learning Programming using MATLAB (Synthesis Lectures on Electrical Engineering)|Sayood, Khalid|9781598291421\n2014|PEARSON INDIA|Programming in MATLAB|PATEL / MITTAL|9789332524811\n2019|Independently Published|Optimization Introduction With Matlab|Lopez and J.|9781099648281\n1991|Electronic Industry|Matlab Advanced Programming (matlab Practical Guide Series)|Su Jin Ming Bian Zhu|9787121013768\n2013|LAP LAMBERT Academic Publishing|One Dimensional Analysis Program for Scramjet and Ramjet Flowpaths: Conceptual Analysis and Simulation of Scramjet/Ramjet Engine with MATLAB Programming|Ganapathy, Rohan M. and Maruthaiyan, Pradhapraj and Johnson, Pradeep|9783659323973\n2013|LAP LAMBERT Academic Publishing|Matlab for Regional Economists|Zheng, Shi|9783659366703\n1997|Prentice Hall|Mastering Dsp Concepts Using Matlab|Ambardar, Ashok and Borghesani, Craig|9780135349762\n1997|Arnold,|Essential Matlab For Scientists And Engineers|Brian D. Hahn|9780340691441\n2020|SDC Publications|Programming and Engineering Computing with MATLAB 2020|Huei-Huang Lee|9781630573973\n20171127|Springer Nature|Introduction to MATLAB for Engineers and Scientists|Sandeep Nagar|9781484231890\n2004|Springer|Scientific Computing With Matlab (texts In Computational Science And Engineering)|Alfio Quarteroni and Fausto Saleri|9783540208372\n2010|Springer|An Introduction to Scientific Computing: Twelve Computational Projects Solved with MATLAB|Danaila, Ionut and Joly, Pascal and Kaber, Sidi Mahmoud and Postel, Marie|9781441921611\n2008|Chapman and Hall/CRC|Computational Partial Differential Equations Using MATLAB (Chapman & Hall/CRC Applied Mathematics & Nonlinear Science)|Li, Jichun and Chen, Yi-Tung|9781420089059\n2014|Apress|MATLAB Programming for Numerical Analysis (Matlab Solutions)|Lopez, Cesar|9781484202951\n2014|Apress|MATLAB Graphical Programming: Practical hands-on MATLAB solutions|Lopez, Cesar|9781484203163\n2014|Apress|MATLAB Differential Equations|Lopez, Cesar|9781484203101\n2012|Springer|MATLAB for Psychologists|Borgo, Mauro and Soranzo, Alessandro and Grassi, Massimo|9781461421979\n2014|Apress|MATLAB Linear Algebra|Lopez, Cesar|9781484203224\n2014|Apress|MATLAB Control Systems Engineering|Lopez, Cesar|9781484202890\n20010806|Cambridge University Press|A Guide to MATLAB|Brian R. Hunt; Ronald L. Lipsman; Jonathan M. Rosenberg|9780511074813\n2014|Apress|MATLAB Differential and Integral Calculus|Lopez, Cesar|9781484203040\n2014|Apress|MATLAB Symbolic Algebra and Calculus Tools|Lopez, Cesar|9781484203439\n2021|Vikas Publishing|Matlab : Demystified Basic Concepts And Applications|DR. KANDARPA KUMAR SARMA|9788125937128\n2017|Chapman and Hall/CRC|A Guide to MATLAB Object-Oriented Programming|Register, Andy H.|9781138460867\n2013|Morgan Kaufmann|Accelerating MATLAB with GPU Computing: A Primer with Examples|Suh, Jung W. and Kim, Youngmin|9780124079168\n2017|Wiley-Blackwell|Practical Finite Element Modeling in Earth Science using Matlab|Simpson, Guy|9781119248668\n2014|Springer|Exercises in Computational Mathematics with MATLAB (Problem Books in Mathematics)|Lyche, Tom and Merrien, Jean-Louis|9783662435113\n2016|Cengage Learning|Digital Signal Processing using MATLAB (Activate Learning with these NEW titles from Engineering!)|Schilling, Robert J. and Harris, Sandra L|9781305887206\n2016|Routledge|Programming Behavioral Experiments with MATLAB and Psychtoolbox: 9 Simple Steps for Students and Researchers|Misirlisoy, Erman|9781138671928\n2011|Springer|Numerical Methods for the Life Scientist: Binding and Enzyme Kinetics Calculated with GNU Octave and MATLAB|Prinz, Heino|9783642208201\n2013|Springer|A Journey from Robot to Digital Human: Mathematical Principles and Applications with MATLAB Programming (Modeling and Optimization in Science and Technologies Book 1)|Gu, Edward Y L|9783642390470\n2019|Cengage Learning|MATLAB Programming for Engineers|Chapman, Stephen J.|9780357030394\n2020|Academic Press|Programming for Electrical Engineers: MATLAB and Spice|Squire Ph.D., James C. and Brown Ph.D., Julie Phillips|9780128215029\n2019|Cengage Learning|MATLAB Programming for Engineers|Chapman, Stephen J.|9780357030523\n2017|LAP LAMBERT Academic Publishing|Operations Research with Lingo: Solutions of Linear Programming Problems through LINGO and MATLAB|Gahan, Padmabati and Pattnaik, Monalisha|9783330328457\n2014|For Dummies|MATLAB For Dummies|Sizemore, Jim and Mueller, John Paul|9781118820032\n2020-07-28T00:00:01Z|Mercury Learning & Information|Programming Fundamentals Using MATLAB|Weeks PhD, Michael|9781683925552\n2007|McGraw-Hill Education|A Concise Introduction to Matlab|Palm, William|9780073385839\n2020|Academic Press|Programming Mathematics Using MATLAB|Oberbroeckling, Lisa A.|9780128178003\n2000|Pearson|Numerical Methods with MATLAB : Implementations and Applications|Recktenwald, Gerald|9780201308600\n2019-06-19T00:00:01Z|SDC Publications|An Engineer's Introduction to Programming with MATLAB 2019|Shawna Lockhart and Eric Tilleson|9781630572921\n2019|Apress|Beginning MATLAB and Simulink: From Novice to Professional|Eshkabilov, Sulaymon|9781484250600\n2003|Pearson|Numerical Methods Using Matlab|Mathews, John and Fink, Kurtis|9780130652485\n2008|Academic Press|MATLAB for Neuroscientists: An Introduction to Scientific Computing in MATLAB|Wallisch, Pascal and Lusignan, Michael E. and Benayoun, Marc D. and Baker, Tanya I. and Dickey, Adam Seth and Hatsopoulos, Nicholas G.|9780123745514\n2009|New Age Science|MATLAB for Mechanical Engineers|R. V. Dukkipati|9781906574130\n2017|Academic Press|Neural Data Science: A Primer with MATLAB and Python|Nylen, Erik Lee and Wallisch, Pascal|9780128040430\n2015|Cengage Learning|MATLAB Programming for Engineers|Chapman, Stephen J.|9781305445369\n2014|Apress|MATLAB Optimization Techniques|Lopez, Cesar|9781484202920\n2012-01-01T00:00:01Z|CL-Engineering|MATLAB Programming with Applications for Engineers|Stephen J. Chapman|9780495668077\n2019|Apress|Beginning MATLAB and Simulink: From Novice to Professional|Eshkabilov, Sulaymon|9781484250617\n2019-09-30T00:00:01Z|SDC Publications|Programming and Engineering Computing with MATLAB 2019|Huei-Huang Lee|9781630572976\n2017|Cengage Learning|Essentials of MATLAB Programming|Chapman, Stephen J.|9781337515368\n2001|Academic Press|A Matlab Companion for Multivariable Calculus|Cooper, Jeffery|9780121876258\n2020|BPB Publications|Fundamental Concepts of MATLAB Programming: From Learning the Basics to Solving a Problem with MATLAB (English Edition)|Bakariya, Dr. Brijesh and Parmar, Dr. Kulwinder Singh|9789389845822\n2009|Society for Industrial and Applied Mathematics|Insight Through Computing: A MATLAB Introduction to Computational Science and Engineering|Van Loan, Charles F. and Fan, K.-Y. Daisy|9780898716917\n2016-08-10T00:00:01Z|CreateSpace Independent Publishing Platform|MATLAB - Programming with MATLAB for Beginners: A Practical Introduction To Programming And Problem Solving (MATLAB for Engineers, MATLAB for Scientists, MATLAB Programming for Dummies)|Learning, UpSkill|9781536991444\n2011|Wiley|Financial Risk Forecasting: The Theory and Practice of Forecasting Market Risk with Implementation in R and Matlab|Danielsson, Jon|9780470669433\n2020|Apress|Practical MATLAB Deep Learning: A Project-Based Approach|Paluszek, Michael and Thomas, Stephanie|9781484251249\n2003|Springer|MATLAB for Engineers Explained|Gustafsson, Fredrik and Bergman, Niclas|9781852336974\n2007|CL Engineering|MATLAB Programming for Engineers|Chapman, Stephen J.|9780495244493\n2009|Wiley|Applied Optimization with MATLAB Programming|Venkataraman, P.|9780470084885\n2018|Routledge|Hack Audio: An Introduction to Computer Programming and Digital Signal Processing in MATLAB (Audio Engineering Society Presents)|Tarr, Eric|9781351018456\n2020|Apress|Practical MATLAB Modeling with Simulink: Programming and Simulating Ordinary and Partial Differential Equations|Eshkabilov, Sulaymon L.|9781484257982\n2017|Cengage Learning|Essentials of MATLAB Programming|Chapman, Stephen J.|9781305970656\n2015|Chapman and Hall/CRC|R and MATLAB (Chapman & Hall/CRC The R Series Book 30)|Hiebeler, David E.|9781466568396\n2018|Mercury Learning and Information|Mathematical Methods for Physics: Using MATLAB and Maple|Claycomb, J. R.|9781683920984\n2003|Pearson Prentice Hall|Digital Image Processing Using MATLAB|Gonzalez, Rafael C. and Woods, Richard E. and Eddins, Steven L.|9780130085191\n2010|CreateSpace Independent Publishing Platform|MATLAB for Beginners: A Gentle Approach - Revised Edition|Kattan, Peter I|9781453683811\n2017|Academic Press|MATLAB Programming for Biomedical Engineers and Scientists|King, Andrew P. and Aljabar, Paul|9780128135105\n2018|SDC Publications|Programming and Engineering Computing with MATLAB 2018|Huei-Huang Lee|9781630571719\n2005|Springer|An Introduction to Programming and Numerical Methods in MATLAB|Otto, Steve and Denier, James P.|9781852339197\n2020|Apress|Practical MATLAB Modeling with Simulink: Programming and Simulating Ordinary and Partial Differential Equations|Eshkabilov, Sulaymon L.|9781484257999\n2014|Apress|MATLAB Matrix Algebra (Matlab Solutions)|Lopez, Cesar|9781484203071\n1996|Pearson|Engineering Problem Solving with MATLAB|Etter, Delores|9780133976885\n2006|McGraw-Hill Science/Engineering/Math|Applied Numerical Methods with MATLAB for Engineers and Scientists|Chapra, Steven|9780073132907\n2016|Morgan Kaufmann|GPU Programming in MATLAB|Ploskas, Nikolaos and Samaras, Nikolaos|9780128051320\n2016|Apress|MATLAB Machine Learning|Paluszek, Michael and Thomas, Stephanie|9781484222508\n2011|Springer|Programming for Engineers: A Foundational Approach to Learning C and Matlab|Bradley, Aaron R.|9783642233029\n2008-07-30T00:00:01Z|Society for Industrial and Applied Mathematics|Linear Programming with MATLAB (MPS-SIAM Series on Optimization)|Ferris, Michael C. and Mangasarian, Olvi L. and Wright, Stephen J.|9780898716436\n2016|CreateSpace Independent Publishing Platform|Matlab And Python Programming: A Practical Guide For Engineers And Data Scientists (Matlab And Python Programming for Beginners)|Learning, UpSkill|9781540599568\n2012|Cengage Learning|MATLAB Programming with Applications for Engineers|Chapman, Stephen J.|9781285402796\n2016-09-13T00:00:01Z|SDC Publications|Programming with MATLAB 2016|Huei-Huang Lee|9781630570132\n2016|Morgan Kaufmann|GPU Programming in MATLAB|Ploskas, Nikolaos and Samaras, Nikolaos|9780128051337\n2020|Independently published|Design Optimization using Matlab and SolidWorks|Suresh, Prof Krishnan|9781653515608\n2013|Wiley|Financial Modelling: Theory, Implementation and Practice with MATLAB Source (The Wiley Finance Series)|Kienitz, Joerg and Wetterau, Daniel|9780470744895\n2019|CRC Press|Fundamentals of Graphics Using MATLAB|Parekh, Ranjan|9780429591730\n2009-07-23T00:00:01Z|Society for Industrial and Applied Mathematics|Parallel MATLAB for Multicore and Multinode Computers (Software, Environments and Tools)|Kepner, Jeremy|9780898716733\n2021|SDC Publications|Programming and Engineering Computing with MATLAB 2021|Huei-Huang Lee|9781630574918\n2017|SDC Publications|Programming and Engineering Computing with MATLAB 2017|Huei-Huang Lee|9781630571405\n2007|Wiley|Numerical Methods for Engineers and Scientists: An Introduction with Applications Using MATLAB|Gilat, Amos and Subramaniam, Vish|9780471734406\n2014|Academic Press|Numerical Linear Algebra with Applications: Using MATLAB|Ford, William|9780123944351\n2005-10-06T00:00:01Z|CL Engineering|Essentials of MATLAB Programming|Chapman, Stephen J.|9780495073000\n2018|SDC Publications|An Engineer's Introduction to Programming with MATLAB 2018|Shawna Lockhart and Eric Tilleson|9781630572068\n2008|Wiley|Stochastic Simulation and Applications in Finance with MATLAB Programs|Huynh, Huu Tue and Lai, Van Son and Soumare, Issouf|9780470725382\n2020-07-08T14:21:52.970-00:00|Mercury Learning and Information|Programming Fundamentals Using MATLAB|Weeks, Michael C.|9781683925545\n2014|Springer|Scientific Computing with MATLAB and Octave (Texts in Computational Science and Engineering, 2)|Quarteroni, Alfio and Saleri, Fausto and Gervasio, Paola|9783642453663\n2014|Academic Press|Numerical Linear Algebra with Applications: Using MATLAB|Ford, William|9780123947840\n2014|Apress|MATLAB Graphical Programming: Practical hands-on MATLAB solutions|Lopez, Cesar|9781484203170\n2009|CRC Press|Numerical and Analytical Methods with MATLAB (Applied and Computational Mechanics)|Bober, William and Tsai, Chi-Tay and Masory, Oren|9781420093568\n2018|CreateSpace Independent Publishing Platform|Phasor Methods of AC Circuit Analysis: - Designed using MATLAB Object Oriented Programming|Agrawal, Prof Jai P|9781720666028\n2002-05-02T00:00:01Z|Wiley|MATLAB Tutorial Update to Version 6 to accompany Control Systems Engineering|Nise, Norman S.|9780471250913\n2011|Wiley|Fundamentals of Digital Image Processing: A Practical Approach with Examples in Matlab|Solomon, Chris and Breckon, Toby|9780470844724\n2014|Ferret Publishing|Programming with MATLAB for Engineers||9780966960167\n2014|Springer|Scientific Computing with MATLAB and Octave (Texts in Computational Science and Engineering Book 2)|Quarteroni, Alfio and Saleri, Fausto and Gervasio, Paola|9783642453670\n2010|Springer|Scientific Computing with MATLAB and Octave (Texts in Computational Science and Engineering Book 2)|Quarteroni, Alfio|9783642124303\n2010|Jones & Bartlett Learning|Digital Signal Processing Using MATLAB & Wavelets|Weeks, Michael|9780763784225\n1999|Cengage Learning|Contemporary Linear Systems Using MATLAB (Pws Bookware Companion Series.)|Strum, Robert S. and Kirk, Donald E.|9780534371722\n2008|Chapman and Hall/CRC|Computational Partial Differential Equations Using MATLAB (Textbooks in Mathematics)|Li, Jichun and Chen, Yi-Tung|9781420089042\n2009|Springer|Signals and Systems with MATLAB|Yang, Won Young|9783540929543\n2013|Morgan Kaufmann|Accelerating MATLAB with GPU Computing: A Primer with Examples|Suh, Jung W. and Kim, Youngmin|9780124080805\n2001|Wiley-Interscience|Applied Optimization with MATLAB Programming|Venkataraman, P.|9780471349587\n2013|Packt Publishing|Visual Media Processing Using Matlab Beginner's Guide|Siogkas, George|9781849697217\n2014|Apress|MATLAB Optimization Techniques|Lopez, Cesar|9781484202937\n2017|Wiley|Engineering Biostatistics: An Introduction using MATLAB and WinBUGS (Wiley Series in Probability and Statistics)|Vidakovic, Brani|9781119168980\n2010|Academic Press|MATLAB for Neuroscientists: An Introduction to Scientific Computing in MATLAB|Wallisch, Pascal and Lusignan, Michael E. and Benayoun, Marc D. and Baker, Tanya I. and Dickey, Adam Seth and Hatsopoulos, Nicholas G.|9780080923284\n2011|Springer|Programming for Engineers: A Foundational Approach to Learning C and Matlab|Bradley, Aaron R.|9783642233036\n2016|Routledge|Programming Behavioral Experiments with MATLAB and Psychtoolbox: 9 Simple Steps for Students and Researchers|Misirlisoy, Erman|9781138671935\n2019|Springer|Boundary Value Problems for Engineers: with MATLAB Solutions|Ali Ümit Keskin|9783030210809\n2004|Wiley-Interscience|Introduction to Numerical Ordinary and Partial Differential Equations Using MATLAB|Stanoyevitch, Alexander|9780471697381\n2013|McGraw-Hill Education|MATLAB Numerical Methods with Chemical Engineering Applications|Al-Malah, Kamal I.M.|9780071831291\n2015|Springer|The Finite Volume Method in Computational Fluid Dynamics: An Advanced Introduction with OpenFOAM® and Matlab (Fluid Mechanics and Its Applications Book 113)|Moukalled, F. and Mangani, L. and Darwish, M.|9783319168746\n2005|Springer|An Introduction to Programming and Numerical Methods in MATLAB|Otto, Steve and Denier, James P.|9781846281334\n2014|Apress|MATLAB Control Systems Engineering|Lopez, Cesar|9781484202906\n2004|CL Engineering|Fundamentals of Digital Signal Processing Using MATLAB (with CD-ROM)|Schilling, Robert J. and Harris, Sandra L|9780534391508\n2020|Wiley|Applied Numerical Methods Using MATLAB|Yang, Won Y. and Cao, Wenwu and Kim, Jaekwon and Park, Kyung W. and Park, Ho-Hyun and Joung , Jingon and Ro, Jong-Suk and Lee, Han L. and Hong, Cheol-Ho and Im, Taeho|9781119626824\n1999|Wiley|Introduction to Engineering Programming: In C, Matlab and Java|Austin, Mark and Chancogne, David|9780471001164\n2011|Chapman and Hall/CRC|An Introduction to Numerical Methods: A MATLAB Approach, Third Edition|Kharab, Abdelwahab and Kharab, Abdelwahab and Guenther, Ronald B.|9781439868997\n2020|De Gruyter|MATLAB Programming: Mathematical Problem Solutions (De Gruyter STEM)|Dingyü Xue|9783110663563\n2014|Springer|Exercises in Computational Mathematics with MATLAB (Problem Books in Mathematics)|Lyche, Tom and Merrien, Jean-Louis|9783662435106\n2010|CRC Press|Computational Intelligence Paradigms: Theory & Applications using MATLAB|Sumathi, S. and Sumathi|9781439809037", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2002|The Eyelink Toolbox: Eye tracking with MATLAB and the Psychophysics Toolbox|10.3758/BF03195489|848|47|F. Cornelissen and Enno M Peters and J. Palmer|d0ed7b7fad72097d327cc5fd946cbd1a4e74b7e3\n1994|Using MATLAB as a programming language for numerical analysis|10.1080/0020739940250402|50|0|J. H. Mathews and Kurtis D. Fink|0b0be159982bbee3c9c0ddcbcf31232c1aee82f1\n2017|SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)|10.1080/10556788.2019.1576176|41|3|Defeng Sun and K. Toh and Yancheng Yuan and Xinyuan Zhao|48536ec4ce40bba11064a8c1b07e850ee0e396b3\n2013|Design of FPGA-controlled power electronics and drives using MATLAB Simulink|10.1109/ECCE-ASIA.2013.6579155|40|5|Y. Siwakoti and G. Town|5bf67012ede77841fb8263f48a850ae3cd8126ec\n2014|MATLAB Optimization Techniques|10.1007/978-1-4842-0292-0|33|3|C. López|b4f91965499d8b1514bf2c6c82e785b3143557c6\n2006|Teaching the introductory computer programming course for engineers using Matlab|10.1109/FIE.2008.4720302|30|0|A. Azemi and L. L. Pauley|ff6e31e8ea88cc6144a333338370ad6ac7dc5939\n2018|BioSigKit: A Matlab Toolbox and Interface for Analysis of BioSignals|10.21105/joss.00671|28|0|Hooman Sedghamiz|75c6b61aadee9c1d73119a60c42944de4e1a1a00\n2001|Teaching programming skills with MATLAB|10.18260/1-2--9874|26|0|M. Herniter and D. Scott and Rakesh Pangasa|797815e5f7aabad61c29676c7c5c31f81655db7f\n2019|A Comprehensive Framework for Physiologically‐Based Pharmacokinetic Modeling in Matlab|10.1002/psp4.12399|19|1|Felix Stader and M. Penny and M. Siccardi and C. Marzolini|aacb41c32a57a51a7ee867e84a33be768eeebca5\n2012|McSAF: A Static Analysis Framework for MATLAB|10.1007/978-3-642-31057-7_7|15|2|Jesse Doherty and L. Hendren|7afae83f0bf5e23da82d403856545140b868261b\n2006|MATLAB as an introductory programming language|10.1002/cae.20064|14|0|M. Wirth and P. Kovesi|09f940ced7ab73bf079c3957f509d32206c2cbc0\n2016|A MATLAB subset to C compiler targeting embedded systems|10.1002/spe.2408|12|3|João Bispo and João MP Cardoso|b88e27a57916b2237a2d8e31e5e710ac0852ec53\n2014|Parallel performance comparison of alternating group explicit method between parallel virtual machine and matlab distributed computing for solving large sparse partial differential equations|10.1166/ASL.2014.5330|11|0|N. Alias and H. F. S. Saipol and A. C. A. Ghani and M. N. Mustaffa|055015bec06b739c2ad7ac94b1cd517ef4485999\n2015|A Matlab code to fit periodic data|10.5335/RBCA.2015.4618|11|0|R. Brum and J. Ramalho and L. Rocha and L. Isoldi and E. D. D. Santos|854d0eca1173ec4b467b120f753d5f5b1d73d190\n2013|Advanced remote laboratory for control systems based on Matlab and .NET platform|10.1109/ICETA.2013.6674400|10|0|P. Bisták|6d67d1aacd08b5e14500938599631d01c5bb71c0\n2015|MATLAB Function Based Approach to FOC of PMSM Drive|10.1109/EMS.2015.81|10|0|O. C. Kivanc and S. Ozturk|04be37568ec4069667bbe22cbffdc7f2524d2b9b\n1997|MATLAB as an econometric programming environment|10.1002/(SICI)1099-1255(199711/12)12:6<735::AID-JAE471>3.0.CO;2-7|9|1|Francisco Cribari‐Neto and Mark J. Jensen|cfd6a43559d31a3bcca1fffaa4978853ce5d5bda\n2014|MATLAB Control Systems Engineering|10.1007/978-1-4842-0289-0|8|0|C. López|a77172dffd1a3a407af0680a9afbea66fc754eed\n2014|Contract-Based Verification of MATLAB and Simulink Matrix-Manipulating Code|10.1007/978-3-319-11737-9_26|8|1|J. Wiik and Pontus Boström|5e7912085fd135f8c19d7fc3ab607f2090777ec2\n2015|Programación de Controladores Lógicos (PLC) mediante Ladder y Lenguaje de Control Estructurado (SCL) en MATLAB|10.19053/01211129.3555|8|1|Heyder Paez-Logreira and Ronald Zamora-Musa and José Bohórquez-Pérez|7e29910f19a0d713c5aaffd72ac0cb724aaed807\n2016|Porting Matlab Applications to High-Performance C++ Codes: CPU/GPU-Accelerated Spherical Deconvolution of Diffusion MRI Data|10.1007/978-3-319-49583-5_49|8|0|Francisco Javier García Blas and M. F. Dolz and J. Sánchez and J. Carretero and Alessandro Daducci and Y. Alemán‐Gómez and Erick Jorge Canales-Rodríguez|66fcf726eec6a8e904e273f449451591e2b6519b\n2016|Heuristic production line balancing problem solution with MATLAB software programming|10.1108/IJCST-01-2016-0002|8|0|A. Türkmen and Y. Yeşil and Mahmut Kayar|79997df420e398deb6391c0c8938f36e7dbbaeed\n2020|A history of MATLAB|10.1145/3386331|7|0|C. Moler and Jack Little|38ac69cc1e3a5d7e715d66929cdd022999d01f26\n2016|RoBO-2L, a Matlab interface for extended offline programming of KUKA industrial robots|10.1109/MECATRONICS.2016.7547117|7|0|J. Golz and Tim Wruetz and Dominik Eickmann and R. Biesenbach|9df38a5ee9b195def8b333b2a1639c241984da36\n2014|MATLAB Programming for Numerical Analysis|10.1007/978-1-4842-0295-1|6|1|C. López|01d0935f76f57fc2e87cb35a60c9923648eedb7c\n2019|Programming in MATLAB|10.1201/9781315228457-6|6|0|J. Miguel and D. Báez‐López and David Alfredo Báez Villegas|fc133c3152399d53c213ba53875aec37ba50d9ac\n2004|Using Matlab To Teach The Introductory Computer Programming Course For Engineers|10.18260/1-2--12728|5|0|A. Azemi and L. L. Pauley|c1d3ee8f51da4df128ffe8cdd556ca9647f30aab\n2017|MATLAB Implementation of 128-key length SAFER+ Cipher System|10.9790/9622-0702054955|5|1|M. K. Mahmood|f289bcc24b1fb801301e47634202928a00580903\n2006|Learning Programming Using MATLAB|10.2200/S00051ED1V01Y200609EEL003|4|0|K. Sayood|4a5d1e744f03a4b7a79df8ff05b1e5aea5720a4f\n2017|Analysis by STAAD-PRO and Design of Structural Elements by MATLAB|10.18488/JOURNAL.2.2017.75.145.164|4|0|S. Harle|563bef77282115b1cccb8e4881a3f3cbda9dd4f9\n2016|Design and implementation of a RoBO-2L MATLAB toolbox for a motion control of a robotic manipulator|10.1109/SSD.2016.7473678|3|0|H. Elshatarat and Mohammed Baniyounis and R. Biesenbach|3b091e6798d97e7275dcb03bf46ecb3acf765e3f\n2018|A Brief Introduction to MATLAB|10.1007/978-3-319-67125-3_2|3|0|M. Okereke and S. Keates|95a5c7ef63d5ebceb8ec17ca8a8271c91cde860a\n2018|GELAB - A Matlab Toolbox for Grammatical Evolution|10.1007/978-3-030-03496-2_22|3|0|Muhammad Adil Raja and C. Ryan|d5d94e191b27846bb4f06cc01d72b5ed9b869aa7\n2011|McLAB: enabling programming language, compiler and software engineering research for matlab|10.1145/2048147.2048203|2|0|L. Hendren and Jesse Doherty and Anton Dubrau and R. Garg and Nurudeen Lameed and Soroush Radpour and Amina Aslam and Toheed Aslam and Andrew Casey and Maxime Chevalier-Boisvert and Jun Li and Clark Verbrugge and Olivier Savary Bélanger|54603028d353893ad2b357771b6a1e2f7b11ca5b\n2009|Supporting image algebra in the Matlab programming language for compression research|10.1117/12.829203|1|0|M. Schmalz and G. Ritter and Joseph N. Wilson and Eric T. Hayden|cea8433a106f0ffa807ac00d02972a7d34c2d0eb" }, "matplotlib": { "title": "Matplotlib", "appeared": 2003, "type": "library", "creators": [ "John D. Hunter" ], "website": "http://matplotlib.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/matplotlib" ], "domainName": { "awisRank": { "2017": 9197, "2022": 6017 }, "name": "matplotlib.org" }, "githubRepo": { "stars": 15728, "forks": 6423, "subscribers": 583, "created": 2011, "updated": 2022, "firstCommit": 2003, "description": "matplotlib: plotting with Python", "issues": 1829, "url": "https://github.com/matplotlib/matplotlib" }, "wikipedia": { "example": [ ">>> from matplotlib import cm\n>>> from mpl_toolkits.mplot3d import Axes3D\n>>> import matplotlib.pyplot as plt\n>>> import numpy as np\n>>> fig = plt.figure()\n>>> ax = fig.gca(projection='3d')\n>>> X = np.arange(-5, 5, 0.25)\n>>> Y = np.arange(-5, 5, 0.25)\n>>> X, Y = np.meshgrid(X, Y)\n>>> R = np.sqrt(X**2 + Y**2)\n>>> Z = np.sin(R)\n>>> surf = ax.plot_surface(X, Y, Z, rstride=1, cstride=1, cmap=cm.coolwarm)\n>>> plt.show()" ], "related": [ "python", "numpy", "qt", "opengl", "matlab", "scipy", "gnuplot", "julia", "octave", "maxima", "excel-app", "jython", "sagemath" ], "summary": "matplotlib is a plotting library for the Python programming language and its numerical mathematics extension NumPy. It provides an object-oriented API for embedding plots into applications using general-purpose GUI toolkits like Tkinter, wxPython, Qt, or GTK+. There is also a procedural \"pylab\" interface based on a state machine (like OpenGL), designed to closely resemble that of MATLAB, though its use is discouraged. SciPy makes use of matplotlib. matplotlib was originally written by John D. Hunter, has an active development community, and is distributed under a BSD-style license. Michael Droettboom was nominated as matplotlib's lead developer shortly before John Hunter's death in 2012. As of 23 June 2017, matplotlib 2.0.x supports Python versions 2.7 through 3.6. Matplotlib 1.2 is the first version of matplotlib to support Python 3.x. Matplotlib 1.4 is the last version of matplotlib to support Python 2.6.", "pageId": 2901907, "dailyPageViews": 218, "created": 2005, "backlinksCount": 85, "revisionCount": 241, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Matplotlib" }, "twitter": "https://twitter.com/matplotlib", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMatplotlib for Python Developers|2009|Sandro Tosi|10044410|3.19|21|5\nPython and Matplotlib Essentials for Scientists and Engineers|2015|Matt A. Wood|46349225|2.00|2|2\nMatplotlib for Python Developers: Effective techniques for data visualization with Python, 2nd Edition||Aldrin Yim|62830062|3.00|2|0\nPython Data Analytics: Data Analysis and Science Using Pandas, Matplotlib and the Python Programming Language|2015|Fabio Nelli|46543455|2.00|1|1\nMatplotlib for Python Developers: Effective Techniques for Data Visualization with Python, 2nd Edition||Aldrin Yim|62103804|0.0|0|0\nNumerical Python: Scientific Computing and Data Science Applications with Numpy, Scipy and Matplotlib||Robert Johansson|66021570|0.0|0|0" }, "matrix-pascal": { "title": "MATRIX PASCAL", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/819f400db9dd0faf16f0aabec46dfa422aeb3bf3" ], "country": [ "United States" ], "originCommunity": [ "Hewlett Packard Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4722", "centralPackageRepositoryCount": 0 }, "matrix-protocol": { "title": "Matrix protocol", "appeared": 2014, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Amdocs Limited" ], "wikipedia": { "dailyPageViews": 74, "url": "https://en.wikipedia.org/wiki/Matrix_(protocol)" } }, "maude": { "title": "Maude", "appeared": 1990, "type": "pl", "description": "Maude is a high-level language and high-performance system supporting both equational and rewriting logic computation for a wide range of applications.", "reference": [ "https://semanticscholar.org/paper/a9c022579be9dcff685682c1876f8a4532ac02cf" ], "country": [ "Spain and United States" ], "originCommunity": [ "Universidad de Navarra", "Universidad de Málaga", "Universidad Complutense", "Centro Informático Científico de Andalucía", "SRI International" ], "influencedBy": [ "obj" ], "example": [ "fmod FACTORIAL is\n\n protecting INT .\n \n op undefined : -> Int .\n op _! : Int -> Int .\n \n var n : Int .\n \n eq 0 ! = 1 .\n eq n ! = if n < 0 then undefined else n * (sd(n, 1) !) fi .\n \nendfm\n\nred 11 ! ." ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Maude", "hopl": "https://hopl.info/showlanguage.prx?exp=2937", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|A logical theory of concurrent objects and its realization in the Maude language|10.7551/mitpress/2087.003.0017|284|15|J. Meseguer|12f49ee3cb748d590ae424b9bfe2f54b07bd8abf\n2009|Unification and Narrowing in Maude 2.4|10.1007/978-3-642-02348-4_27|33|2|M. Clavel and F. Durán and S. Eker and S. Escobar and P. Lincoln and N. Martí-Oliet and J. Meseguer and C. Talcott|7eb3e198b6f8fb13c9b44c7ec568c6177d4b4e6a\n2000|Maude Action Tool: Using Reflection to Map Action Semantics to Rewriting Logic|10.1007/3-540-45499-3_29|29|2|Christiano Braga and E. Haeusler and J. Meseguer and P. Mosses|f2fc100aa3ebad603020c23815e3d33a52b611bf\n2007|Translating AUML Diagrams into Maude Specifications: A Formal Verification of Agents Interaction Protocols|10.5381/jot.2007.6.4.a2|16|1|Farid Mokhati and N. Boudiaf and M. Badri and L. Badri|2e5d0fa77ab277ccf9835a05cd7e0d4487c7d3dc\n2012|Modelling and analyzing adaptive self-assembly strategies with Maude|10.1007/978-3-642-34005-5_7|16|0|R. Bruni and A. Corradini and F. Gadducci and Alberto Lluch-Lafuente and Andrea Vandin|042bc43e1451f6a36bdf1f3971785f155b090407\n2006|Prototyping 3APL in the Maude term rewriting language|10.1145/1160633.1160865|14|1|M. Riemsdijk and F. S. Boer and M. Dastani and J. Meyer|ccaf53e978f2f67cc0bebb790f72228ef4e3ae0a\n2009|Generating Maude Specifications From UML Use Case Diagrams|10.5381/jot.2009.8.2.a2|13|0|Farid Mokhati and M. Badri|02ebf983954cf64d3a4f243cf4c98bd1619f57e3\n1992|Translating TROLL light Concepts to Maude|10.1007/3-540-57867-6_10|11|0|G. Denker and Martin Gogolla|734de44349047f52ce951030fba50d8957068129\n2010|Using the Maude Term Rewriting Language for Agent Development with Formal Foundations|10.1007/978-1-4419-6984-2_9|10|1|M. Riemsdijk and L. Astefanoaei and F. S. Boer|7cfc25024bdea53ac5644546ac8bcfd7045c65e6\n2014|Using Big-Step and Small-Step Semantics in Maude to Perform Declarative Debugging|10.1007/978-3-319-07151-0_4|8|0|A. Riesco|6d741f902c926d18b96a68c639e7d0a8931333af\n1993|Programming in OBJ and Maude|10.1007/3-540-56883-2_12|7|1|T. Winkler|c7c812225bcf0d41bd1ab6c759313f6a0134130f\n2018|Symbolic Reasoning Methods in Rewriting Logic and Maude|10.1007/978-3-662-57669-4_2|6|0|J. Meseguer|a0801850d231852868b477aea5285f3af3b3384e\n2000|Using Maude|10.1007/3-540-46428-X_27|5|0|M. Clavel and F. Durán and S. Eker and P. Lincoln and N. Martí-Oliet and J. Meseguer and J. F. Quesada|c22441fe433f3a1845ba3353204e29c52a610cc6\n2008|A Declarative Debugger for Maude|10.1007/978-3-540-79980-1_9|5|0|A. Riesco and A. Verdejo and N. Martí-Oliet and R. Caballero|4cfb0f9b759857b64d4fa648c42e4dcfeb62f49a\n2012|Using Semantics Specified in Maude to Generate Test Cases|10.1007/978-3-642-32943-2_7|5|0|A. Riesco|c2e817c7a0b94d016cdc302281d226ea0906c5a2\n2012|Formal Verification of a Subset of UML Diagrams: An Approach Using Maude|10.4018/978-1-61350-456-7.CH411|5|0|A. Chaoui and Okba Tibermacine and A. Zerek|3669f068d55ba494ae435328f83811aaa6adcb6b\n2009|Teaching Formal Methods Based on Rewriting Logic and Maude|10.1007/978-3-642-04912-5_3|4|0|P. C. Ölveczky|e91b6d2a43694a79e7b019ad50239d6cf4e6e14f\n2015|Memory Policy Analysis for Semantics Specifications in Maude|10.1007/978-3-319-27436-2_18|4|0|A. Riesco and I. Asavoae and Mihail Asavoae|03f2da10fde941c7cc23332ab1dd71a4b1a502e0\n2005|Analysis of the Suzuki-Kasami algorithm with the Maude model checker|10.1109/APSEC.2005.40|3|0|K. Ogata and K. Futatsugi|0799d5984c5df95c1a4108b63809004c195b8f78\n2014|Functional Logic Programming in Maude|10.1007/978-3-642-54624-2_16|3|0|S. Escobar|6c9b2d5a5de9de40eab087f6f2bb2644e97c92d4\n2018|Implementation of Privacy Calculus and Its Type Checking in Maude|10.1007/978-3-030-03421-4_30|2|0|Georgios V. Pitsiladis and P. Stefaneas|361e8fcca7d83008c4ee5e8371ee6059311f85b8\n2010|Towards Formalizing Multi-Agent Systems Functional Requirements In Maude|10.26483/IJARCS.V1I2.20|1|0|Fathi Hamidane and Habiba Belleili-Souici Farid Mokhati|834fcaad9f293ba90c5312344b27afc7e4aa84a3\n2018|Model Checking Parameterized by the Semantics in Maude|10.1007/978-3-319-90686-7_13|1|0|A. Riesco|6e784a46ab2aa36100461cb5aac6bc22f383babb" }, "maven-pm": { "title": "Maven Central Repository", "appeared": 2018, "type": "packageManager", "website": "https://search.maven.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/sonatype-nexus-community/search-maven-org/issues" ], "domainName": { "name": "search.maven.org" }, "packageCount": 266776, "forLanguages": [ "java" ] }, "maven-pom": { "title": "Apache Maven", "appeared": 2004, "type": "application", "description": "Apache Maven is a software project management and comprehension tool. Based on the concept of a project object model (POM), Maven can manage a project's build, reporting and documentation from a central piece of information.", "website": "http://maven.apache.org/", "country": [ "United States" ], "originCommunity": [ "Apache Software Foundation" ], "domainName": { "name": "maven.apache.org" }, "wikipedia": { "example": [ "1 validate\n 2 generate-sources\n 3 process-sources\n 4 generate-resources\n 5 process-resources\n 6 compile\n 7 process-test-sources\n 8 process-test-resources\n 9 test-compile\n10 test\n11 package\n12 install\n13 deploy" ], "related": [ "java", "xml", "csharp", "ruby", "scala", "c", "eclipse-editor", "yaml", "groovy" ], "summary": "Maven is a build automation tool used primarily for Java projects. Maven addresses two aspects of building software: first, it describes how software is built, and second, it describes its dependencies. Unlike earlier tools like Apache Ant, it uses conventions for the build procedure, and only exceptions need to be written down. An XML file describes the software project being built, its dependencies on other external modules and components, the build order, directories, and required plug-ins. It comes with pre-defined targets for performing certain well-defined tasks such as compilation of code and its packaging. Maven dynamically downloads Java libraries and Maven plug-ins from one or more repositories such as the Maven 2 Central Repository, and stores them in a local cache. This local cache of downloaded artifacts can also be updated with artifacts created by local projects. Public repositories can also be updated. Maven can also be used to build and manage projects written in C#, Ruby, Scala, and other languages. The Maven project is hosted by the Apache Software Foundation, where it was formerly part of the Jakarta Project. Maven is built using a plugin-based architecture that allows it to make use of any application controllable through standard input. Theoretically, this would allow anyone to write plugins to interface with build tools (compilers, unit test tools, etc.) for any other language. In reality, support and use for languages other than Java has been minimal. A plugin for the .NET framework exists and is maintained, and a C/C++ native plugin is maintained for Maven 2.Alternative technologies like Gradle and sbt as build tools do not rely on XML, but keep the key concepts Maven introduced. With Apache Ivy, a dedicated dependency manager was developed as well that also supports Maven repositories.Maven still does not support reproducible builds, but developers are progressing on this task.", "created": 2004, "backlinksCount": 327, "pageId": 1333305, "revisionCount": 657, "dailyPageViews": 619, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Apache_Maven" }, "githubLanguage": { "trendingProjectsCount": 0, "type": "data", "group": "XML", "filenames": [ "pom.xml" ], "aceMode": "xml", "codemirrorMode": "xml", "codemirrorMimeType": "text/xml", "tmScope": "text.xml.pom", "id": "Maven POM" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2014, "committerCount": 3, "commitCount": 43, "sampleCount": 1, "example": [ "\n\n\t4.0.0\n\trenpengben\n\tspring4mvc-jpa\n\twar\n\t0.0.1-SNAPSHOT\n\tspring4mvc-jpa Maven Webapp\n\n\thttps://renpengben.github.io\n\n\tspring4mvc-jpa\n\n\t\n\t\tUTF-8\n\t\t1.7\n\t\t4.11\n\t\t1.7.7\n\t\t1.2.17\n\n\t\t4.0.5.RELEASE\n\t\t1.6.0.RELEASE\n\t\t2.1_3\n\n\t\t5.1.31\n\t\t4.3.5.Final\n\t\t5.1.1.Final\n\t\t1.0.6\n\n\t\n\n\n\t\n\n\t\t\n\t\t\tjunit\n\t\t\tjunit\n\t\t\t${junit.version}\n\t\t\ttest\n\t\t\n\n\t\t\n\t\t\torg.slf4j\n\t\t\tslf4j-api\n\t\t\t${slf4j.version}\n\t\t\n\t\t\n\t\t\torg.slf4j\n\t\t\tslf4j-log4j12\n\t\t\t${slf4j.version}\n\t\t\n\t\t\n\t\t\tlog4j\n\t\t\tlog4j\n\t\t\t${log4j.version}\n\t\t\n\n\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-core\n\t\t\t${spring.version}\n\t\t\t\n\t\t\t\t\n\t\t\t\t\tcommons-logging\n\t\t\t\t\tcommons-logging\n\t\t\t\t\n\t\t\t\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-beans\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-context\n\t\t\t${spring.version}\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-aop\n\t\t\t${spring.version}\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-expression\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-tx\n\t\t\t${spring.version}\n\t\t\n\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-aspects\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-context-support\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-jdbc\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-orm\n\t\t\t${spring.version}\n\t\t\n\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-web\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-webmvc\n\t\t\t${spring.version}\n\t\t\n\t\t\n\t\t\torg.springframework\n\t\t\tspring-test\n\t\t\t${spring.version}\n\t\t\ttest\n\t\t\n\n\t\t\n\t\t\torg.springframework.data\n\t\t\tspring-data-jpa\n\t\t\t${spring.data.jpa.version}\n\t\t\t\n\t\t\t\t\n\t\t\t\t\tjunit-dep\n\t\t\t\t\tjunit\n\t\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\tcglib\n\t\t\tcglib-nodep\n\t\t\t${cglib.version}\n\t\t\n\n\n\n\t\t\n\n\t\t\n\t\t\torg.hibernate\n\t\t\thibernate-core\n\t\t\t${hibernate.version}\n\t\t\n\t\t\n\t\t\torg.hibernate\n\t\t\thibernate-entitymanager\n\t\t\t${hibernate.version}\n\t\t\n\t\t\n\t\t\torg.hibernate\n\t\t\thibernate-validator\n\t\t\t${hibernate-validator.version}\n\t\t\tcompile\n\n\t\t\n\n\n\t\t\n\t\t\tmysql\n\t\t\tmysql-connector-java\n\t\t\t${mysql.version}\n\t\t\truntime\n\t\t\n\t\t\n\t\t\tcom.alibaba\n\t\t\tdruid\n\t\t\t${druid-version}\n\t\t\n\n\n\t\n\t\n\t\t\n\t\t\t\n\t\t\t\torg.apache.maven.plugins\n\t\t\t\tmaven-compiler-plugin\n\t\t\t\t2.0.2\n\t\t\t\t\n\t\t\t\t\t1.7\n\t\t\t\t\t1.7\n\t\t\t\t\n\t\t\t\n\t\t\n\t\n\n" ], "url": "https://github.com/textmate/maven.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mavis": { "title": "MAVIS", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1f19a79f757a250a02c294c4f70b7cb9173204d2" ], "country": [ "United States" ], "originCommunity": [ "University of Virginia" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4415", "centralPackageRepositoryCount": 0, "isbndb": "" }, "mavo": { "title": "mavo", "appeared": 2015, "type": "template", "creators": [ "Lea Verou" ], "website": "https://mavo.io/", "country": [ "United States" ], "originCommunity": [ "https://github.com/mavoweb" ], "domainName": { "registered": 2016, "awisRank": { "2022": 904879 }, "name": "mavo.io" }, "example": [ "
\n
\n

My tasks

\n

[count(done)] done out of [count(task)] total

\n
\n\n
    \n
  • \n \n
    • \n \n
\n
" ], "githubRepo": { "firstCommit": 2015, "stars": 2676, "forks": 159, "subscribers": 60, "created": 2015, "updated": 2022, "description": "Create web applications entirely by writing HTML and CSS!", "issues": 225, "url": "https://github.com/mavoweb/mavo" }, "repoStats": { "firstCommit": 2015, "commits": 1534, "committers": 26, "files": 99 }, "twitter": "https://twitter.com/mavoweb", "isbndb": "" }, "mawk": { "title": "mawk", "appeared": 1991, "type": "pl", "website": "https://invisible-island.net/mawk/mawk.html", "reference": [ "http://progopedia.com/implementation/mawk/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/ThomasDickey/original-mawk/issues" ], "wikipedia": { "summary": "is a very fast AWK implementation by Mike Brennan based on a bytecode interpreter.", "backlinksCount": 4, "pageId": 3414809, "dailyPageViews": 2, "url": "https://en.wikipedia.org/wiki/AWK#Versions_and_implementations" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1643", "centralPackageRepositoryCount": 0 }, "max": { "title": "Max", "appeared": 1990, "type": "jsonFormat", "website": "https://cycling74.com/products/max/", "country": [ "United States" ], "originCommunity": [ "Cycling '74" ], "wikipedia": { "related": [ "c", "linux", "puredata", "opengl", "csound", "supercollider", "java", "javascript" ], "summary": "Max, also known as Max/MSP/Jitter, is a visual programming language for music and multimedia developed and maintained by San Francisco-based software company Cycling '74. Over its more than thirty-year history, it has been used by composers, performers, software designers, researchers, and artists to create recordings, performances, and installations.The Max program is modular, with most routines existing as shared libraries. An application programming interface (API) allows third-party development of new routines (named external objects). Thus, Max has a large user base of programmers unaffiliated with Cycling '74 who enhance the software with commercial and non-commercial extensions to the program. Because of this extensible design, which simultaneously represents both the program's structure and its graphical user interface (GUI), Max has been described as the lingua franca for developing interactive music performance software.", "pageId": 479795, "created": 2004, "backlinksCount": 171, "revisionCount": 756, "dailyPageViews": 205, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Max_(software)" }, "githubLanguage": { "fileExtensions": [ "maxpat", "maxhelp", "maxproj", "mxt", "pat" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "json", "codemirrorMode": "javascript", "codemirrorMimeType": "application/json", "tmScope": "source.json", "aliases": [ "max/msp", "maxmsp" ], "repos": 5939, "id": "Max" }, "githubBigQuery": { "repos": 1031, "users": 877, "id": "Max" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 11, "commitCount": 21, "sampleCount": 3, "example": [ "max v2;#N vpatcher 109 76 569 534;#P toggle 31 168 21 0;#P button 360 299 15 0;#P button 322 299 15 0;#P button 284 299 15 0;#P button 246 299 15 0;#P window setfont Verdana 12.;#P window linecount 1;#P newex 246 168 43 472055820 r jojo;#B color 5;#P newex 31 386 45 472055820 s jojo;#B color 5;#P newex 246 254 162 472055820 route 0 1 2 3;#P newex 31 338 88 472055820 append toto;#P newex 31 296 35 472055820 % 4;#N counter;#X flags 0 0;#P newobj 31 251 75 472055820 counter;#P newex 31 209 75 472055820 metro 250;#P newex 164 96 32 472055820 t 0;#P message 164 55 136 472055820 Goodbye World !;#P newex 31 96 32 472055820 t 1;#P message 31 55 113 472055820 Hello World !;#P connect 0 0 1 0;#P fasten 3 0 15 0 169 146 36 146;#P connect 1 0 15 0;#P connect 15 0 4 0;#P connect 4 0 5 0;#P connect 5 0 6 0;#P connect 6 0 7 0;#P connect 7 0 9 0;#P connect 2 0 3 0;#P connect 10 0 8 0;#P connect 8 0 11 0;#P connect 8 1 12 0;#P connect 8 2 13 0;#P connect 8 3 14 0;#P pop;" ], "url": "https://github.com/textmate/json.tmbundle" }, "fileType": "text", "wordRank": 1428, "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2005|Jones & Bartlett Learning|Modeling a Character in 3DS Max (Wordware Game Developer's Library)|Steed, Paul|9781556220883\n20110110|Springer Nature|Taking Your iPod touch to the Max|Erica Sadun; Michael Grothaus|9781430232599" }, "maxima": { "title": "Maxima", "appeared": 1982, "type": "pl", "website": "http://maxima.sourceforge.net/", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "domainName": { "name": "maxima.sourceforge.net" }, "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "if", "then", "else", "elseif", "do", "while", "repeat", "until", "for", "from", "to", "downto", "step", "thru" ], "wikipedia": { "related": [ "common-lisp", "unix", "linux", "android", "algol", "lisp", "gnuplot", "fortran", "jupyter-editor", "python", "qt", "sagemath", "r", "lyx-editor", "emacs-editor", "isbn" ], "summary": "Maxima is a computer algebra system (CAS) based on a 1982 version of Macsyma. It is written in Common Lisp and runs on all POSIX platforms such as macOS, Unix, BSD, and Linux, as well as under Microsoft Windows and Android. It is free software released under the terms of the GNU General Public License (GPL).", "pageId": 95925, "created": 2002, "backlinksCount": 250, "revisionCount": 380, "dailyPageViews": 134, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/Maxima_(software)" }, "pygmentsHighlighter": { "filename": "maxima.py", "fileExtensions": [ "mac", "max" ], "id": "Maxima" }, "projectEuler": { "memberCount": { "2022": 19 }, "id": "Maxima" }, "leachim6": { "filepath": "m/Maxima.max", "fileExtensions": [ "max" ], "example": [ "print(\"Hello World\")$\n" ], "id": "Maxima" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Maxima", "tryItOnline": "maxima", "jupyterKernel": [ "https://github.com/robert-dodier/maxima-jupyter" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20190521|Springer Nature|Finite Elements Using Maxima|Andreas Öchsner; Resam Makvandi|9783030171995\n2011-10-14|Wiley|Maxima and Minima with Applications|Wilfred Kaplan|9781118031049", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2020|FPGA implementation of an Islanding detection technique for microgrid using periodic maxima of superimposed voltage components|10.1049/iet-gtd.2018.5914|7|0|Praveen Kumar and Vishal Kumar and R. Pratap|9e8dc4076a7c78f146cbe5aba3db98a29a178bbf\n2019|Search for Global Maxima in Multimodal Functions by Applying Numerical Optimization Algorithms: A Comparison between Golden Section and Simulated Annealing|10.3390/COMPUTATION7030043|7|0|J. Guillot and Diego Restrepo-Leal and Carlos Robles-Algarín and I. Oliveros|4ca5a3622c6d50e7ebc4dc712d27d4d7c7eafa1c\n2014|Maxima and Octave in Development of Online Applications: Service Based Approach|10.3991/ijet.v9i5.3848|4|0|K. Žáková|c86ee6956b04e96664e6f5916faa59ede6d5fc96\n2017|Clifford Algebra Implementations in Maxima|10.7546/JGSP-43-2017-73-105|1|0|D. Prodanov|7fb000ff96109cd89c76ba039641fee09e2d254d" }, "maxscript": { "title": "MAXScript", "appeared": 1996, "type": "pl", "description": "MAXScript is the built-in scripting language in Autodesk 3ds MAX. It can be used to automate repetitive tasks as well as develop new tools and user interfaces.", "website": "http://docs.autodesk.com/3DSMAX/14/ENU/MAXScript%20Help%202012/", "reference": [ "https://dl.acm.org/citation.cfm?id=522752" ], "country": [ "United States" ], "originCommunity": [ "Autodesk, Inc" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "githubLanguage": { "fileExtensions": [ "ms", "mcr" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.maxscript", "repos": 2084, "id": "MAXScript" }, "githubBigQuery": { "repos": 333, "users": 321, "id": "MAXScript" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 1, "commitCount": 46, "sampleCount": 5, "example": [ "fn CalculateVolumeAndCentreOfMass obj =\n(\n\tlocal Volume= 0.0\n\tlocal Centre= [0.0, 0.0, 0.0]\n\tlocal theMesh = snapshotasmesh obj\n\tlocal numFaces = theMesh.numfaces\n\tfor i = 1 to numFaces do\n\t(\n\t\tlocal Face= getFace theMesh i\n\t\tlocal vert2 = getVert theMesh Face.z\n\t\tlocal vert1 = getVert theMesh Face.y\n\t\tlocal vert0 = getVert theMesh Face.x\n\t\tlocal dV = Dot (Cross (vert1 - vert0) (vert2 - vert0)) vert0\n\t\tVolume+= dV\n\t\tCentre+= (vert0 + vert1 + vert2) * dV\n\t)\n\tdelete theMesh\n\tVolume /= 6\n\tCentre /= 24\n\tCentre /= Volume\n\t#(Volume,Centre)\n)\n" ], "url": "https://github.com/Alhadis/language-maxscript" }, "leachim6": { "filepath": "m/MaxScript.ms", "fileExtensions": [ "ms" ], "example": [ "print \"Hello World\"\n-- \"Hello World\"\n\n\n-- Note that MAXScript is expression-based, so simply writing \"Hello World\" is\n-- sufficient to echo it for the reader. Like Haskell, all MAXScript expressions\n-- *must* return values, even if they're unused.\n" ], "id": "MaxScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MAXScript", "tiobe": { "id": "MAXScript" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2000|Sybex Inc|Maxscript and the Sdk for 3d Studio Max|Bicalho, Alexander and Feltman, Simon|9780782127942\n2006|Taylor & Francis|3ds Max Maxscript Essentials|Autodesk|9781136140372\n20130502|Taylor & Francis|3ds Max 8 MAXScript Essentials|Autodesk|9781136142215" }, "maya": { "title": "Maya Embedded Language", "appeared": 2013, "type": "pl", "aka": [ "MEL Script" ], "country": [ "United States" ], "originCommunity": [ "Autodesk, Inc" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "// animated duplicates/instances script\nproc animatedDuplication (int $rangeStart, int $rangeEnd, int $numOfDuplicates, int $duplicateOrInstance)\n{\n int $range_start = $rangeStart;\n int $range_end = $rangeEnd;\n int $num_of_duplicates = $numOfDuplicates;\n int $step_size = ($range_end - $range_start) / $num_of_duplicates;\n int $i = 0;\n int $temp;\n\n currentTime $range_start; // set to range start\n\n string $selectedObjects[]; // to store selected objects\n $selectedObjects = `ls -sl`; // store selected objects\n select $selectedObjects;\n\n while ($i <= $num_of_duplicates)\n {\n $temp = $range_start + ($step_size * $i);\n currentTime ($temp);\n // selected the objects to duplicate or instance\n select $selectedObjects;\n if($duplicateOrInstance == 0)\n {\n duplicate;\n }\n else\n {\n instance;\n }\n $i++;\n }\n}\n\n // Usage example:\n // duplicate the current selection 5 times --\n // evenly distributed between frame 1 and 240\n animatedDuplication(1, 240, 5, 0);" ], "related": [ "perl", "tcl", "python" ], "summary": "The Maya Embedded Language (MEL) is a scripting language used to simplify tasks in Autodesk's 3D Graphics Software Maya. Most tasks that can be achieved through Maya's GUI can be achieved with MEL, as well as certain tasks that are not available from the GUI. MEL offers a method of speeding up complicated or repetitive tasks, as well as allowing users to redistribute a specific set of commands to others that may find it useful.", "pageId": 1690201, "created": 2005, "backlinksCount": 30, "revisionCount": 97, "dailyPageViews": 50, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/Maya_Embedded_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "mbasic": { "title": "MBASIC", "appeared": 1983, "type": "pl", "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "microsoft-basic", "basic", "altair-basic", "ascii", "msx-basic", "cbasic", "pic-microcontroller" ], "summary": "MBASIC is the Microsoft BASIC implementation of BASIC for the CP/M operating system. MBASIC is a descendant of the original Altair BASIC interpreters that were among Microsoft's first products. MBASIC was one of the two versions of BASIC bundled with the Osborne 1 computer. The name \"MBASIC\" is derived from the disk file name MBASIC.COM of the BASIC interpreter.", "created": 2004, "backlinksCount": 102, "pageId": 1195349, "revisionCount": 65, "dailyPageViews": 91, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/MBASIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2217", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2005|Newnes|Programming the PIC Microcontroller with MBASIC (Embedded Technology)|Smith, Jack|9780750679466\n2011|Elsevier India|Programming The Pic Microcontroller With Mbasic {with Cd-rom}|Smith|9788131208403" }, "mbox": { "title": "EML", "appeared": 1974, "type": "textDataFormat", "reference": [ "https://datatracker.ietf.org/doc/html/rfc822" ], "country": [ "United States" ], "originCommunity": [ "Internet Engineering Task Force" ], "example": [ "From MAILER-DAEMON Fri Jul 8 12:08:34 2011\nFrom: Author \nTo: Recipient \nSubject: Sample message 1\n\nThis is the body.\n>From (should be escaped).\nThere are 3 lines.\n\nFrom MAILER-DAEMON Fri Jul 8 12:08:34 2011\nFrom: Author \nTo: Recipient \nSubject: Sample message 2\n\nThis is the second body." ], "wikipedia": { "example": [ "From MAILER-DAEMON Fri Jul 8 12:08:34 2011\nFrom: Author \nTo: Recipient \nSubject: Sample message 1\n\nThis is the body.\n>From (should be escaped).\nThere are 3 lines.\n\nFrom MAILER-DAEMON Fri Jul 8 12:08:34 2011\nFrom: Author \nTo: Recipient \nSubject: Sample message 2\n\nThis is the second body." ], "related": [ "rfc", "unix", "mime" ], "summary": "Mbox is a generic term for a family of related file formats used for holding collections of email messages, first implemented for Fifth Edition Unix. All messages in an mbox mailbox are concatenated and stored as plain text in a single file. Each message starts with the four characters \"From\" followed by a space (the so named \"From_ line\") and the sender's email address. RFC 4155 defines that a UTC timestamp follows after another separating space character. Unlike the Internet protocols used for the exchange of email, the format used for the storage of email has never been formally defined through the RFC standardization mechanism and has been entirely left to the developer of an email client. However, the POSIX standard defined a loose frame in conjunction with the mailx program. In 2005 finally, the application/mbox media type was standardized as RFC 4155, and hints that mbox stores mailbox messages in their original Internet Message (RFC 2822) format, except for the used newline character, seven-bit clean data storage, and the requirement that each newly added message is terminated with a completely empty line within the mbox database. A format similar to mbox is the MH Message Handling System. Other systems, such as Microsoft Exchange Server and the Cyrus IMAP server store mailboxes in centralised databases managed by the mail system and not directly accessible by individual users. The maildir mailbox format is often cited as an alternative to the mbox format for network email storage systems.", "backlinksCount": 63, "pageId": 67367, "created": 2002, "revisionCount": 205, "dailyPageViews": 151, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Mbox" }, "githubLanguage": { "fileExtensions": [ "eml", "mbox" ], "repos": 0, "id": "EML" }, "pygmentsHighlighter": { "filename": "email.py", "fileExtensions": [ "eml" ], "id": "E-mail" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 2, "commitCount": 133, "sampleCount": 1, "example": [ "Return-Path: \nTo: Mario Zaizar \nSubject: Testing Mario Zaizar' MIME E-mail composing and sending PHP class: HTML message\nFrom: nobody \nReply-To: nobody \nSender: nobody@example.org\nX-Mailer: http://www.phpclasses.org/mimemessage $Revision: 1.63 $ (mail)\nMIME-Version: 1.0\nContent-Type: multipart/mixed; boundary=\"652b8c4dcb00cdcdda1e16af36781caf\"\nMessage-ID: <20050430192829.0489.nobody@example.org>\nDate: Sat, 30 Apr 2005 19:28:29 -0300\n\n\n--69c1683a3ee16ef7cf16edd700694a2f\nContent-Type: text/plain; charset=ISO-8859-1\nContent-Transfer-Encoding: quoted-printable\n\nThis is an HTML message. Please use an HTML capable mail program to read\nthis message.\n\n--69c1683a3ee16ef7cf16edd700694a2f\nContent-Type: text/html; charset=ISO-8859-1\nContent-Transfer-Encoding: quoted-printable\n\n\n\nTesting Mario Zaizar' MIME E-mail composing and sending PHP class: H=\nTML message\n\n\n\n\n\n--69c1683a3ee16ef7cf16edd700694a2f--\n\n--6a82fb459dcaacd40ab3404529e808dc\nContent-Type: image/gif; name=\"logo.gif\"\nContent-Transfer-Encoding: base64\nContent-Disposition: inline; filename=\"logo.gif\"\nContent-ID: \n\nR0lGODlhlgAjAPMJAAAAAAAA/y8vLz8/P19fX19f339/f4+Pj4+Pz7+/v///////////////////\n/////yH5BAEAAAkALAAAAACWACMAQwT+MMlJq7046827/2AoHYChGAChAkBylgKgKClFyEl6xDMg\nqLFBj3C5uXKplVAxIOxkA8BhdFCpDlMK1urMTrZWbAV8tVS5YsxtxmZHBVOSCcW9zaXyNhslVcto\nRBp5NQYxLAYGLi8oSwoJBlE+BiSNj5E/PDQsmy4pAJWQLAKJY5+hXhZ2dDYldFWtNSFPiXssXnZR\nk5+1pjpBiDMJUXG/Jo7DI4eKfMSmxsJ9GAUB1NXW19jZ2tvc3d7f4OHi2AgZN5vom1kk6F7s6u/p\nm3Ab7AOIiCxOyZuBIv8AOeTJIaYQjiR/kKTr5GQNE3pYSjCJ9mUXClRUsLxaZGciC0X+OlpoOuQo\nZKdNJnIoKfnxRUQh6FLG0iLxIoYnJd0JEKISJyAQDodp3EUDC48oDnUY7HFI3wEDRjzycQJVZCQT\nOl7NK+G0qgtkAcOKHUu2rNmzYTVqRMt2bB49bHompSchqg6HcGeANSMxr8sEa2y2HexnSEUTuWri\nSSbkYh7BgGVAnhB1b2REibESYaRoBgqIMYx59tFM9AvQffVG49P5NMZkMlHKhJPJb0knmSKZ6kSX\nJtbeF3Am7ocok6c7cM7pU5xcXiJJETUz16qPrzEfaFgZpvzn7h86YV5r/1mxXeAUMVyEIpnVUGpN\nRlG2ka9b3lP3pm2l6u7P+l/YLj3+RlEHbz1C0kRxSITQaAcilVBMEzmkkEQO8oSOBNg9SN+AX6hV\nz1pjgJiAhwCRsY8ZIp6xj1ruqCgeGeKNGEZwLnIwzTg45qjjjjz2GEA5hAUp5JBEFmnkkSCoWEcZ\nX8yohZNK1pFGPQS4hx0qNSLJlk9wCQORYu5QiMd7bUzGVyNlRiOHSlpuKdGEItHQ3HZ18beRRyws\nYSY/waDTiHf/tWlWUBAJiMJ1/Z0XXU7N0FnREpKM4NChCgbyRDq9XYpOplaKopN9NMkDnBbG+UMC\nQwLWIeaiglES6AjGARcPHCWoVAiatcTnGTABZoLPaPG1phccPv366mEvWEFSLnj+2QaonECwcJt/\ne1Zw3lJvVMmftBdVNQS3UngLCA85YHIQOy6JO9N4eZW7KJwtOUZmGwOMWqejwVW6RQzaikRHX3yI\nosKhDAq8wmnKSmdMwNidSOof9ZG2DoV0RfTVmLFtGmNk+CoZna0HQnPHS3AhRbIeDpqmR09E0bsu\nsoeaw994z+rwQVInvqLenBftYjLOVphLFHhV9qsnez8AEUbQRgO737AxChjmyANxuEFHSGi7hFCV\n4jxLst2N8sRJYU+SHiAKjlmCgz2IffbLI5aaQR71hnkxq1ZfHSfKata6YDCJDMAQwY7wOgzhjxgj\nVFQnKB5uX4mr9qJ79pann+VcfcSzsSCd2mw5scqRRvlQ6TgcUelYhu75iPE4JejrsJOFQAG01277\n7bjnrvvuvPfu++/ABy887hfc6OPxyCevPDdAVoDA89BHL/301Fdv/fXYZ6/99tx3Pz0FEQAAOw==\n\n--6a82fb459dcaacd40ab3404529e808dc\n" ], "url": "https://github.com/mariozaizar/language-eml" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "mckeeman-form": { "title": "mckeeman-form", "appeared": 2020, "type": "grammarLanguage", "creators": [ "Bill McKeeman" ], "reference": [ "https://www.youtube.com/watch?v=RGizBNflVKw" ], "country": [ "United States" ], "originCommunity": [ "Dartmouth College" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "example": [ "json\n element\n\nvalue\n object\n array\n string\n number\n \"true\"\n \"false\"\n \"null\"\n\nobject\n '{' ws '}'\n '{' members '}'\n\nmembers\n member\n member ',' members\n\nmember\n ws string ws ':' element\n\narray\n '[' ws ']'\n '[' elements ']'\n\nelements\n element\n element ',' elements\n\nelement\n ws value ws\n\nstring\n '\"' characters '\"'\n\ncharacters\n \"\"\n character characters\n\ncharacter\n '0020' . '10FFFF' - '\"' - '\\'\n '\\' escape\n\nescape\n '\"'\n '\\'\n '/'\n 'b'\n 'f'\n 'n'\n 'r'\n 't'\n 'u' hex hex hex hex\n\nhex\n digit\n 'A' . 'F'\n 'a' . 'f'\n\nnumber\n integer fraction exponent\n\ninteger\n digit\n onenine digits\n '-' digit\n '-' onenine digits\n\ndigits\n digit\n digit digits\n\ndigit\n '0'\n onenine\n\nonenine\n '1' . '9'\n\nfraction\n \"\"\n '.' digits\n\nexponent\n \"\"\n 'E' sign digits\n 'e' sign digits\n\nsign\n \"\"\n '+'\n '-'\n\nws\n \"\"\n '0020' ws\n '000A' ws\n '000D' ws\n '0009' ws" ] }, "mcleyvier-command-language": { "title": "McLeyvier Command Language", "appeared": 1982, "type": "pl", "description": "Music language", "reference": [ "http://www.nosuch.com/plum/cgi/showlist.cgi?oneid=118", "http://retiary.org/ls/writings/cmj_mcleyvier.html", "https://synthmuseum.com/mcleyvier/" ], "country": [ "United States" ], "originCommunity": [ "Hazelcom Industries" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6405", "centralPackageRepositoryCount": 0, "isbndb": "" }, "mcobol": { "title": "MCOBOL", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5cf52186b402cdc6340e610be8cd554465c44997" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Manchester" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7005", "centralPackageRepositoryCount": 0 }, "md5-hash-function": { "title": "MD5", "appeared": 1991, "type": "hashFunction", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "summary": "The MD5 message-digest algorithm is a widely used hash function producing a 128-bit hash value. Although MD5 was initially designed to be used as a cryptographic hash function, it has been found to suffer from extensive vulnerabilities. It can still be used as a checksum to verify data integrity, but only against unintentional corruption. It remains suitable for other non-cryptographic purposes, for example for determining the partition for a particular key in a partitioned database.MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function MD4, and was specified in 1992 as RFC 1321. One basic requirement of any cryptographic hash function is that it should be computationally infeasible to find two distinct messages that hash to the same value. MD5 fails this requirement catastrophically; such collisions can be found in seconds on an ordinary home computer. The weaknesses of MD5 have been exploited in the field, most infamously by the Flame malware in 2012. The CMU Software Engineering Institute considers MD5 essentially \"cryptographically broken and unsuitable for further use\".As of 2019, MD5 continues to be widely used, in spite of its well-documented weaknesses and deprecation by security experts.", "backlinksCount": 629, "pageId": 18826, "dailyPageViews": 1753, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/MD5" } }, "mdbs-qrs": { "title": "MDBS-QRS", "appeared": 1981, "type": "queryLanguage", "country": [ "United States" ], "originCommunity": [ "Computer Corporation of America" ], "example": [ "disp i dept location" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4539" }, "mdl": { "title": "MDL", "appeared": 1971, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "example": [ ")\n \n )\n )\n ( >\n )\n ( .RMS>>\n )\n (\n .RMS>\n .RMS>>>\n )>>\n .EXITS>>" ], "related": [ "scheme", "common-lisp", "java", "prolog", "smalltalk", "simula" ], "summary": "MDL (the MIT Design Language) is a descendant of the Lisp programming language. Its initial purpose was to provide high level language support for the Dynamic Modeling Group at MIT's Project MAC. It was initially developed in 1971 on the PDP-10 computer under the Incompatible Timesharing System. The initial development team consisted of Gerald Sussman and Carl Hewitt of the Artificial Intelligence Lab, and Chris Reeve, Bruce Daniels, and David Cressey of the Dynamic Modeling Group. Later, Stu Galley, also of the Dynamic Modeling Group, wrote the MDL documentation.MDL was initially known as \"Muddle\". This style of self-deprecating humor was not widely understood or appreciated outside of Project MAC and a few other early citadels of information technology. So the name was sanitized to MDL.MDL provides several enhancements to classical Lisp. It supports several built-in data types, including lists, strings and arrays, and user-defined data types. It offers multithreaded expression evaluation and coroutines. Variables can carry both a local value within a scope, and a global value, for passing data between scopes. Advanced built-in functions supported interactive debugging of MDL programs, incremental development, and reconstruction of source programs from object programs. Although MDL is obsolete, some of its features have been incorporated in later versions of Lisp. Gerald Sussman went on to develop the Scheme language, in collaboration with Guy Steele, who later wrote the specifications for Common Lisp and Java. Carl Hewitt had already published the idea for the PLANNER language before the MDL project began, but his subsequent thinking on PLANNER reflected lessons learned from building MDL. Planner concepts influenced languages such as Prolog and Smalltalk. Smalltalk and Simula, in turn, influenced his future work on the Actor model. But the largest influence that MDL had was on the genre known as interactive fiction. An interactive fiction game known as Zork, sometimes called Dungeon, was first written in MDL. Later, Reeve, Daniels, Galley and other members of Dynamic Modeling went on to start Infocom, a company that produced many early commercial works of interactive fiction.", "created": 2004, "backlinksCount": 63, "pageId": 586499, "revisionCount": 54, "dailyPageViews": 19, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/MDL_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MDL", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1995|Onword Pr|Programming With Mdl|Mach N. Dinh-vu|9780934605892\n||Mdl (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133176805" }, "mdx-lang": { "title": "MultiDimensional eXpressions", "appeared": 1997, "type": "queryLanguage", "creators": [ "Mosha Pasumansky" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "example": [ "SELECT\n { [Measures].[Store Sales] } ON COLUMNS,\n { [Date].[2002], [Date].[2003] } ON ROWS\nFROM Sales\nWHERE ( [Store].[USA].[CA] )" ], "wikipedia": { "summary": "Multidimensional Expressions (MDX) is a query language for online analytical processing (OLAP) using a database management system. Much like SQL, it is a query language for OLAP cubes. It is also a calculation language, with syntax similar to spreadsheet formulas.", "backlinksCount": 112, "pageId": 2506869, "dailyPageViews": 114, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/MultiDimensional_eXpressions" } }, "mdx": { "title": "MDX", "appeared": 2017, "type": "textMarkup", "creators": [ "John Otander" ], "description": "MDX allows you to use JSX in your markdown content. You can import components, such as interactive charts or alerts, and embed them within your content.", "website": "https://mdxjs.com/", "webRepl": [ "https://mdxjs.com/playground/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/mdx-js" ], "domainName": { "registered": 2018, "awisRank": { "2022": 345081 }, "name": "mdxjs.com" }, "example": [ "import { Chart } from '../components/chart'\n\n# Here’s a chart\n\nThe chart is rendered inside our MDX document.\n\n" ], "githubRepo": { "firstCommit": 2017, "stars": 13350, "forks": 1109, "subscribers": 80, "created": 2017, "updated": 2022, "description": "Markdown for the component era", "issues": 19, "url": "https://github.com/mdx-js/mdx" }, "repoStats": { "firstCommit": 2017, "commits": 1855, "committers": 182, "files": 196 }, "twitter": "https://twitter.com/chrisbiscardi", "isbndb": "year|publisher|title|authors|isbn13\n2013-08-26|Packt Publishing|Instant MDX Queries for SQL Server 2012|Nicholas Emond|9781782178071", "semanticScholar": "" }, "meanscriptcli": { "title": "MeanscriptCLI", "appeared": 2020, "type": "pl", "creators": [ "jussehoo" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/Meanwhale/MeanscriptCLI/issues" ], "githubRepo": { "firstCommit": 2020, "stars": 2, "forks": 1, "subscribers": 2, "created": 2020, "updated": 2021, "description": "Command line interface for Meanscript", "issues": 0, "url": "https://github.com/Meanwhale/MeanscriptCLI" }, "repoStats": { "firstCommit": 2020, "commits": 93, "committers": 5, "files": 1 } }, "mech-lang": { "title": "Mech", "appeared": 2018, "type": "pl", "creators": [ "Corey Montella" ], "description": "Mech is a language for developing data-driven, reactive systems like animations, games, and robots. It makes composing, transforming, and distributing data easy, allowing you to focus on the essential complexity of your problem.", "website": "http://mech-lang.org", "webRepl": [ "http://try.mech-lang.org/" ], "reference": [ "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "country": [ "United States" ], "originCommunity": [ "Lehigh University" ], "domainName": { "registered": 2018, "awisRank": { "2022": 7955651 }, "name": "mech-lang.org" }, "example": [ "# Breakout\n\n## The Game\n\ngame setup\n #system/timer = [resolution: 15 tick: 0 hours: 0 minutes: 0 seconds: 0]\n #app/main = [root: \"drawing\" direction: _ contains: [#game]]\n\ngame area\n #game = [|type class contains parameters|\n #paddle-control\n \"canvas\" _ [#elements] [width: 400 height: 400]]\n\ncontroller slider\n #paddle-control = [type: \"slider\" class: _ contains: _ parameters: [min: 0 max: 300 value: 40]]\n\ndraw the game area\n pos = #paddle-control{1,4}{1,3}\n start = pos\n end = pos + 100\n #elements = [|shape parameters|\n \"circle\" [cx: #ball.x cy: #ball.y radius: 10 fill: \"#000000\"]\n \"line\" [x1: start y1: 350 x2: end y2: 350 stroke: \"#000000\"]]\n\n## The Ball\n\nblock\n #ball = [x: 20 y: 20 vx: 1 vy: 3]\n\nupdate ball position\n ~ #system/timer.tick\n #ball.x := #ball.x + #ball.vx\n #ball.y := #ball.y + #ball.vy\n\nbounce the ball off the paddle\n ~ #ball.y\n pos = #paddle-control{1,4}{1,3}\n start = pos\n end = pos + 100\n ix = #ball.y > 340 & #ball.x > start & #ball.x < end & #ball.y < 342\n #ball.vy{ix} := -#ball.vy\n\nbounce the ball off the ceiling\n ~ #ball.y\n #ball.vy{#ball.y < 10} := -#ball.vy\n\nbounce the ball off the walls\n ~ #ball.x\n #ball.vx{#ball.x > 390 | #ball.x < 10} := -#ball.vx\n\nreset the ball if it makes it past the paddle\n ~ #ball.y\n ix = #ball.y > 390\n #ball.x{ix} := 20\n #ball.y{ix} := 20" ], "githubRepo": { "firstCommit": 2018, "stars": 138, "subscribers": 5, "created": 2018, "updated": 2022, "description": "🦾 Main repository for the Mech programming language. Start here! ", "forks": 7, "issues": 0, "url": "https://github.com/mech-lang/mech" }, "repoStats": { "firstCommit": 2018, "commits": 890, "committers": 5, "files": 52 }, "twitter": "https://twitter.com/MechLang", "isbndb": "" }, "mediawiki": { "title": "MediaWiki", "appeared": 2002, "type": "wikiMarkup", "description": "The syntax and keywords used by the MediaWiki software to format a page.", "website": "https://en.wikipedia.org/wiki/MediaWiki#Markup", "documentation": [ "https://www.mediawiki.org/wiki/Documentation", "https://en.wikipedia.org/wiki/Help:Wikitext" ], "spec": "https://www.mediawiki.org/wiki/Specs/wikitext/1.0.0", "reference": [ "https://www.mediawiki.org/wiki/Wikitext", "https://doc.wikimedia.org/mediawiki-core/master/php/classParser.html" ], "aka": [ "wikitext", "wikicode", "wiki markup" ], "country": [ "United States" ], "originCommunity": [ "Wikimedia Foundation, Inc" ], "example": [ "= Heading 1 =\nIndentation as used on talk pages:\n:Each colon at the start of a line\n::causes the line to be indented by three more character positions.\n:::(The indentation persists\n* Item1\n* Item2\n* Item3\n* Item4\n** Sub-item 4 a)\n*** Sub-item 4 a) 1.\n**** Sub-item 4 a) 1. i)\n**** Sub-item 4 a) 1. ii)\n** Sub-item 4 b)\n=== Ordered Lists ===\n* Item5\n# Item1\n# Item2\n# Item3\n# Item4\n## Sub-item 1\n### Sub-sub-item\n#### Sub-sub-sub-item\n## Sub-item 2\n# Item5" ], "wikipedia": { "example": [ "

A dialogue

\n\n

\"Take some more tea,\" the March Hare said to Alice, very earnestly.

\n\n

\"I've had nothing yet,\" Alice replied in an offended tone: \"so I can't take more.\"

\n\n

\"You mean you can't take less,\" said the Hatter: \"it's very easy to take more than nothing.\"

" ], "related": [ "php", "linux", "freebsd", "solaris", "wordpress", "perl", "mysql", "rails", "javascript", "html", "python", "xml", "json", "latex", "ocaml", "jquery", "lua", "mariadb", "postgresql", "sqlite" ], "summary": "MediaWiki is a free and open-source wiki software. Originally developed by Magnus Manske and improved by Lee Daniel Crocker, it runs on many websites, including Wikipedia, Wiktionary and Wikimedia Commons. It is written in the PHP programming language and stores the contents into a database. Like WordPress, which is based on a similar licensing and architecture, it has become the dominant software in its category. The first version of the software was deployed to serve the needs of the Wikipedia encyclopedia in 2002. Wikipedia and other Wikimedia Foundation projects continue to define a large part of the requirement set for MediaWiki. The software is optimized to efficiently handle large projects, which can have terabytes of content and hundreds of thousands of hits per second. Because Wikipedia is one of the world's largest websites, achieving scalability through multiple layers of caching and database replication has been a major concern for developers. The software has more than 900 configuration settings and more than 1,900 extensions available for enabling various features to be added or changed. On Wikipedia alone, more than 1000 automated and semi-automated bots and other tools have been developed to assist in editing. It has also been deployed by some companies as an internal knowledge management system, and some educators have assigned students to use MediaWiki for collaborative group projects.", "created": 2003, "backlinksCount": 6149, "pageId": 323710, "revisionCount": 2948, "dailyPageViews": 610, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/MediaWiki" }, "githubLanguage": { "fileExtensions": [ "mediawiki", "wiki" ], "trendingProjectsCount": 0, "repos": 10, "id": "MediaWiki" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2018, "committerCount": 8, "commitCount": 70, "sampleCount": 2, "example": [ "\n= Overview =\n\nThe GDB Tracepoint Analysis feature is an extension to the Tracing and Monitoring Framework that allows the visualization and analysis of C/C++ tracepoint data collected by GDB and stored to a log file.\n\n= Getting Started =\n\nThe feature can be installed from the Eclipse update site by selecting '''Linux Tools''' > '''GDB Tracepoint Analysis'''.\n\nThe feature requires GDB version 7.2 or later to be installed on the local host. The executable program 'gdb' must be found in the path.\n\n= GDB Trace Perspective =\n\nTo open the perspective, select '''Window''' > '''Open Perspective''' > '''Other...''' > '''GDB Trace'''.\n\nThe perspective includes the following views by default:\n\n* '''Project Explorer''': This view shows the projects in the workspace and is used to create and manage Tracing projects.\n* '''Debug''': This view shows the running C/C++ Postmortem Debugger instances and displays the thread and stack trace associated with a tracepoint.\n* '''Trace Control''': This view shows the status of the debugger and allows navigation of trace records.\n* '''Console''': This view displays console output of the C/C++ Postmortem Debugger.\n\nThe editor area contains the '''Events''' and '''C/C++''' editors when a GDB Trace is opened.\n\n[[Image:images/GDBTracePerspective.png]]\n\n= Collecting Tracepoint Data =\n\nCollecting the C/C++ tracepoint data is outside the scope of this feature. It can be done from the GDB command line or by using the CDT debug component within Eclipse. See the CDT FAQ entry in the [[#References | References]] section.\n\n= Importing Tracepoint Data =\n\nSome information in this section is redundant with the LTTng User Guide. For further details, see the LTTng User Guide entry in the [[#References | References]] section.\n\n== Creating a Tracing Project ==\n\nIn the '''Project Explorer''' view, right-click and select '''New''' > '''Project...''' from the context menu. In the '''New Project''' dialog, select '''Tracing''' > '''Tracing Project''', click '''Next''', name your project and click '''Finish'''.\n\n== Importing a GDB Trace ==\n\nIn your tracing project, right-click on the '''Traces''' folder and select '''Import...'''. Browse to, or enter, a source directory. Select the trace file in the tree. Optionally set the trace type to '''GDB : GDB Trace'''. Click '''Finish'''.\n\nAlternatively, the trace can be drag & dropped to the '''Traces''' folder from any external file manager.\n\n== Selecting the GDB Trace Type ==\n\nRight-click the imported trace in the '''Traces''' folder and choose '''Select Trace Type...''' > '''GDB''' > '''GDB Trace''' from the context menu. This step can be omitted if the trace type was selected at import.\n\nThe trace will be updated with the GDB icon [[Image:images/gdb_icon16.png]].\n\n== Selecting the Trace Executable ==\n\nThe executable file that created the tracepoint data must be identified so that the C/C++ Postmortem Debugger can be launched properly.\n\nRight-click the GDB trace in the '''Traces''' folder and choose '''Select Trace Executable...''' from the context menu. Browse to, or enter, the path of the executable file and press '''OK'''.\n\nThe selected file must be recognized by GDB as an executable.\n\n= Visualizing Tracepoint Data =\n\n== Opening a GDB Trace ==\n\nIn the '''Traces''' folder, double-click the GDB trace or right-click it and select '''Open''' from the context menu.\n\nThe tracepoint data will be opened in an Events editor, and a C/C++ Postmortem Debugger instance will be launched.\n\nIf available in the workspace, the source code corresponding to the first trace record will also be opened in a C/C++ editor.\n\nAt this point it is recommended to relocate the Events editor outside of the default editor area, so that it is not hidden by the C/C++ editor.\n\n== Viewing Trace Data ==\n\nIn the Events editor, a table is shown with one row for each trace record. The '''Trace Frame''' column shows the sequential trace record number. The '''Tracepoint''' column shows the number assigned by GDB at collection time for this tracepoint. The '''File''' column shows the file name, line number and method where the tracepoint was set. The '''Content''' column shows the data collected at run-time by the tracepoint.\n\nSearching and filtering can be done on any column by entering a regular expression in the column header.\n\n== Navigating the GDB Trace ==\n\nTrace records can be selected in the Events editor using the keyboard or mouse. The C/C++ Postmortem Debugger in the '''Debug''' view will be updated to show the stack trace of the current trace record.\n\nThe trace can also be navigated from the '''Trace Control''' view by clicking the '''Next Trace Record''' or '''Previous Trace Record''' buttons. The Events editor and '''Debug''' views will be updated.\n\n= References =\n\n* [http://wiki.eclipse.org/index.php/Linux_Tools_Project/LTTng2/User_Guide LTTng User Guide]\n* [http://wiki.eclipse.org/CDT/User/FAQ#How_can_I_trace_my_application_using_C.2FC.2B.2B_Tracepoints.3F CDT FAQ - How can I trace my application using C/C++ Tracepoints?]\n\n= Updating This Document =\n\nThis document is maintained in a collaborative wiki. If you wish to update or modify this document please visit [http://wiki.eclipse.org/index.php/Linux_Tools_Project/GDB_Tracepoint_Analysis/User_Guide http://wiki.eclipse.org/Linux_Tools_Project/GDB_Tracepoint_Analysis/User_Guide]\n" ], "url": "https://github.com/textmate/mediawiki.tmbundle" }, "rijuRepl": { "example": [ "Hello, world!\n" ], "id": "https://riju.codes/mediawiki" }, "indeedJobs": { "2022": 30, "query": "mediawiki developer" }, "linkedInSkill": { "2018": 3862, "id": "mediawiki" }, "fileType": "text", "wordRank": 9998, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20081014|O'Reilly Media, Inc.|MediaWiki|Daniel J. Barrett|9780596554149\n20081014|O'Reilly Media, Inc.|MediaWiki|Daniel J. Barrett|9780596156541", "semanticScholar": "" }, "medic": { "title": "MEDIC", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b910d5bee0d770c27ac1e328fa6af5da013aa420" ], "country": [ "Italy" ], "originCommunity": [ "Istituto Nazionale dei Tumori" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6679", "centralPackageRepositoryCount": 0 }, "medusa": { "title": "MEDUSA", "appeared": 2002, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Cambridge University" ], "wikipedia": { "related": [ "linux", "solaris", "xml", "autocad-app", "unix" ], "summary": "MEDUSA, (since 2004 MEDUSA4) is a CAD program used in the areas of mechanical and plant engineering by manufacturers and Engineering, Procurement and Construction (EPC) companies. The system's history is closely tied to the beginnings of mainstream CAD and the research culture fostered by Cambridge University and the UK government as well as the resulting transformation of Cambridge into a world-class tech centre in the 1980s.", "backlinksCount": 118, "pageId": 25597199, "dailyPageViews": 28, "created": 2009, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/MEDUSA" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4872", "isOpenSource": false, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "megalog": { "title": "Megalog", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/009de3f2b4935a39a3de945eec951fa35823bcf1" ], "country": [ "Germany" ], "originCommunity": [ "Experimental and Clinical Research Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3561", "centralPackageRepositoryCount": 0 }, "megaparsec": { "title": "Megaparsec", "appeared": 2015, "type": "library", "description": "Industrial-strength monadic parser combinator library", "writtenIn": [ "haskell" ], "related": [ "antlr" ], "githubRepo": { "stars": 832, "forks": 83, "subscribers": 12, "created": 2015, "updated": 2023, "description": "Industrial-strength monadic parser combinator library", "issues": 17, "url": "https://github.com/mrkkrp/megaparsec" } }, "meld": { "title": "MELD", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f23cebdf0419fad69ecef41a485926511b6cfb61" ], "country": [ "United States" ], "originCommunity": [ "Columbia University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1499", "centralPackageRepositoryCount": 0, "isbndb": "" }, "melody": { "title": "Melody", "appeared": 2022, "type": "pl", "creators": [ "Yoav Lavi" ], "description": "Melody - A language that compiles to regular expressions and aims to be more easily readable and maintainable", "website": "https://yoav-lavi.github.io/melody/book/", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/stpvpn/melody_a_language_that_compiles_to_regular/" ], "country": [ "Israel" ], "originCommunity": [ "https://github.com/yoav-lavi/melody/issues" ], "githubRepo": { "firstCommit": 2022, "stars": 3923, "forks": 58, "subscribers": 19, "created": 2022, "updated": 2022, "description": "Melody is a language that compiles to regular expressions and aims to be more easily readable and maintainable", "issues": 8, "url": "https://github.com/yoav-lavi/melody" }, "repoStats": { "firstCommit": 2022, "commits": 758, "committers": 13, "files": 165 } }, "melpha-pm": { "title": "melpha-pm", "appeared": 2014, "type": "packageManager", "website": "https://melpa.org/", "country": [ "France and Switzerland and United States" ], "originCommunity": [ "https://github.com/melpa" ], "domainName": { "registered": 2014, "awisRank": { "2022": 1805491 }, "name": "melpa.org" }, "packageCount": 4079, "packageInstallCount": 81967793, "forLanguages": [ "emacs-editor" ] }, "memcached": { "title": "Memcached", "appeared": 2003, "type": "database", "description": "Distributed memory caching system, used as a database", "country": [ "United States" ], "originCommunity": [ "Danga Interactive" ] }, "memex-machine": { "title": "Memex", "appeared": 1945, "type": "computingMachine", "creators": [ "Vannevar Bush" ], "reference": [ "https://www.theatlantic.com/magazine/archive/1945/07/as-we-may-think/303881/" ], "country": [ "United States" ], "originCommunity": [ "Office of Scientific Research and Development" ], "wikipedia": { "summary": "The memex (originally coined \"at random\", though sometimes said to be a portmanteau of \"memory\" and \"index\") is the name of the hypothetical proto-hypertext system that Vannevar Bush described in his 1945 The Atlantic Monthly article \"As We May Think\". Bush envisioned the memex as a device in which individuals would compress and store all of their books, records, and communications, \"mechanized so that it may be consulted with exceeding speed and flexibility\". The memex would provide an \"enlarged intimate supplement to one's memory\". The concept of the memex influenced the development of early hypertext systems (eventually leading to the creation of the World Wide Web) and personal knowledge base software. The hypothetical implementation depicted by Bush for the purpose of concrete illustration was based upon a document bookmark list of static microfilm pages and lacked a true hypertext system, where parts of pages would have internal structure beyond the common textual format. Early electronic hypertext systems were thus inspired by memex rather than modeled directly upon it.", "backlinksCount": 241, "pageId": 20636, "dailyPageViews": 201, "appeared": 1959, "url": "https://en.wikipedia.org/wiki/Memex" } }, "mendel": { "title": "MENDEL", "appeared": 1985, "type": "pl", "reference": [ "https://waseda.pure.elsevier.com/en/publications/software-prototyping-with-mendel", "https://doi.org/10.1007/3-540-16479-0_11", "https://semanticscholar.org/paper/cf4237b30c9e5b93787ad3ee40e6e8b3adb03ec3" ], "country": [ "Japan" ], "originCommunity": [ "Toshiba Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4213", "centralPackageRepositoryCount": 0, "isbndb": "" }, "mentat": { "title": "Mentat", "appeared": 1987, "type": "pl", "creators": [ "Andrew S. Grimshaw", "Jane W.S. Liu" ], "description": "An object-oriented macro data flow system", "reference": [ "https://semanticscholar.org/paper/c93218fb458dc2a06a04d6a4d265bffbf70e7b43" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1339", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|Easy-to-use object-oriented parallel processing with Mentat|10.1109/2.211896|240|16|A. Grimshaw|d6a10312e9132e4ce959ee2ee9ea3952c5a90386\n1989|Real-Time Mentat programming language and architecture|10.1109/GLOCOM.1989.63956|22|0|A. Grimshaw and A. Silberman and J.W.-S. Liu|faed7ee4901b4a18b1704db121f0737ef2c9337e\n1988|The Mentat programming language and architecture|10.1109/FTDCS.1988.26725|4|0|A. Grimshaw and J.W.-S. Liu|62042bca6ed064865648d99e80f2856bce183245" }, "mercurial": { "title": "Mercurial", "appeared": 2005, "type": "application", "country": [ "United States" ], "originCommunity": [ "https://www.mercurial-scm.org/wiki/BugTracker" ], "wikipedia": { "related": [ "python", "c", "freebsd", "linux", "subversion", "http", "rust", "clisp", "octave", "nginx-config" ], "summary": "Mercurial is a distributed revision-control tool for software developers. It is supported on Microsoft Windows and Unix-like systems, such as FreeBSD, macOS and Linux. Mercurial's major design goals include high performance and scalability, decentralized, fully distributed collaborative development, robust handling of both plain text and binary files, and advanced branching and merging capabilities, while remaining conceptually simple. It includes an integrated web-interface. Mercurial has also taken steps to ease the transition for users of other version control systems, particularly Subversion. Mercurial is primarily a command-line driven program, but graphical user interface extensions are available, e.g. TortoiseHg, and several IDEs offer support for version control with Mercurial. All of Mercurial's operations are invoked as arguments to its driver program hg (a reference to Hg - the chemical symbol of the element mercury). Matt Mackall originated Mercurial and serves as its lead developer. Mercurial is released as free software under the terms of the GNU GPL v2 (or any later version). It is mainly implemented using the Python programming language, but includes a binary diff implementation written in C.", "pageId": 2810009, "dailyPageViews": 333, "created": 2005, "backlinksCount": 228, "revisionCount": 752, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Mercurial" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mercury-programming-system": { "title": "Mercury Programming System", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ffa3769faabefb5c4acfa4edca2520834bbb56dc" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7994", "centralPackageRepositoryCount": 0 }, "mercury": { "title": "Mercury", "appeared": 1995, "type": "pl", "creators": [ "Zoltan Somogyi" ], "website": "http://www.mercurylang.org", "documentation": [ "https://mercurylang.org/documentation/documentation.html" ], "fileExtensions": [ "m" ], "country": [ "Australia" ], "originCommunity": [ "University of Melbourne" ], "domainName": { "registered": 2011, "awisRank": { "2022": 7653616 }, "name": "mercurylang.org" }, "compilesTo": [ "c" ], "hasLineComments": { "example": "% A comment", "value": true }, "hasComments": { "example": "% A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "%" ] ], "printToken": [ [ "io.write_string" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ ":- module fib.\n :- interface.\n :- import_module io.\n :- pred main(io::di, io::uo) is det.\n \n :- implementation.\n :- import_module int.\n\n :- func fib(int) = int.\n fib(N) = (if N =< 2 then 1 else fib(N - 1) + fib(N - 2)).\n\n main(!IO) :-\n io.write_string(\"fib(10) = \", !IO),\n io.write_int(fib(10), !IO),\n io.nl(!IO).\n % Could instead use io.format(\"fib(10) = %d\\n\", [i(fib(10))], !IO)." ], "related": [ "autocode", "mercurial", "ia-32", "arm", "unix", "linux", "solaris", "freebsd", "android", "prolog", "hope", "haskell", "c", "java", "csharp", "erlang", "assembly-language", "cil", "vim-editor", "emacs-editor", "eclipse-editor", "curry", "alice", "standard-ml", "oz", "visual-prolog" ], "summary": "Mercury is a functional logic programming language made for real-world uses. The first version was developed at the University of Melbourne, Computer Science department, by Fergus Henderson, Thomas Conway, and Zoltan Somogyi, under Somogyi's supervision, and released on April 8, 1995. Mercury is a purely declarative logic programming language. It is related to both Prolog and Haskell. It features a strong, static, polymorphic type system, and a strong mode and determinism system. The official implementation, the Melbourne Mercury Compiler, is available for most Unix and Unix-like platforms, including Linux, macOS, and for Windows (32bits only).", "pageId": 19726, "dailyPageViews": 74, "created": 2001, "backlinksCount": 83, "revisionCount": 260, "appeared": 1995, "fileExtensions": [ "m" ], "url": "https://en.wikipedia.org/wiki/Mercury_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "m", "moo" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "mmi" ], "aceMode": "prolog", "tmScope": "source.mercury", "repos": 715, "id": "Mercury" }, "githubBigQuery": { "repos": 646, "users": 594, "id": "Mercury" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 1, "commitCount": 31, "sampleCount": 10, "example": [ "% \"Hello World\" in Mercury.\n\n% This source file is hereby placed in the public domain. -fjh (the author).\n\n:- module hello.\n:- interface.\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\nmain(!IO) :-\n\tio.write_string(\"Hello, world\\n\", !IO).\n" ], "url": "https://github.com/sebgod/mercury-tmlanguage" }, "leachim6": { "filepath": "m/Mercury.m", "fileExtensions": [ "m" ], "example": [ ":- module hello.\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\nmain(!IO) :-\n\tio.write_string(\"Hello World\\n\", !IO).\n" ], "id": "Mercury" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Mercury", "subreddit": [ { "memberCount": { "2022": 348 }, "url": "https://www.reddit.com/r/mercury" } ], "tiobe": { "id": "Mercury" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2226", "fileType": "text", "wordRank": 4418, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|Termination Analysis for Mercury|10.1007/BFb0032740|54|5|Chris Speirs and Z. Somogyi and H. Søndergaard|afd089a38347a3178697994b632d3e6784aeda36\n1999|Binding-Time Analysis for Mercury|10.1007/978-3-540-25951-0_7|48|0|W. Vanhoof and M. Bruynooghe and M. Leuschel|5bd60c5d80b234b49725517c2b10772b10ea6a84\n1995|Code Generation for Mercury|10.7551/mitpress/4301.003.0029|28|4|T. Conway and F. Henderson and Z. Somogyi|4495652c540b6eb9d882094e2ee27e4db4238a28\n2001|Practical Aspects for a Working Compile Time Garbage Collection System for Mercury|10.1007/3-540-45635-X_15|23|3|Nancy Mazur and Peter Ross and Gerda Janssens and M. Bruynooghe|ff30b7100bb6ef27513cabbe174ae3a29a192715\n2000|Type classes in Mercury|10.1109/ACSC.2000.824391|20|1|D. Jeffery and F. Henderson and Z. Somogyi|c90f163e576bc4119d3b8a48c3be6ffbe815822e\n2002|Compiling Mercury to High-Level C Code|10.1007/3-540-45937-5_15|16|1|F. Henderson and Z. Somogyi|5a7db270bdc56ffb9100f6e4ced19789e176e37d\n2017|Advanced Stochastic Petri Net Modeling with the Mercury Scripting Language|10.1145/3150928.3150959|16|1|Danilo Oliveira and Rúbens de Souza Matos Júnior and J. Dantas and João Ferreira and B. Silva and G. Callou and P. Maciel and A. Brinkmann|2f67f3aa94cae7cb1244c7bd2dbf5d9c1ece3456\n2000|A Module Based Analysis for Memory Reuse in Mercury|10.1007/3-540-44957-4_84|15|0|Nancy Mazur and Gerda Janssens and M. Bruynooghe|966db383f6ccc53e32ffc6a91b01d289ae7c7988\n2003|Use of an Integrated Mercury Food Web Model for Ecological Risk Assessment|10.1081/ESE-120021120|13|0|J. G. Hunter and J. Burger and K. Cooper|e22703dd3f7cf52216853149b4ee4934335ad65b\n2000|Binding-Time Analysis by Constraint Solving. A Modular and Higher-Order Approach for Mercury|10.1007/3-540-44404-1_25|12|0|W. Vanhoof|d89ec979c59b1e0c9164a8479f018d10944e48f6\n2006|Adding Constraint Solving to Mercury|10.1007/11603023_9|12|0|Ralph Becket and M. G. D. L. Banda and K. Marriott and Z. Somogyi and Peter James Stuckey and M. Wallace|88c71f5bdc9af4a3bc29b2de8ddba0e7a0bb666f\n2008|Runtime support for region-based memory management in Mercury|10.1145/1375634.1375644|8|0|Quan Phan and Z. Somogyi and Gerda Janssens|d3f72cc56eb31c33daaaeeb7a3a4bbc322d64685\n2007|Static Region Analysis for Mercury|10.1007/978-3-540-74610-2_22|7|0|Quan Phan and Gerda Janssens|0b125fbd478c191fe9cb4a53c2f0575f9c86a506\n2007|Inductive Mercury Programming|10.1007/978-3-540-73847-3_23|2|0|B. Fisher and J. Cussens|f8d6f78ad98b6d3df1bd1bcad46020442b109d52\n1999|Binding-Time Analysis for Mercury|10.7551/mitpress/4304.003.0042|1|0|D. D. Schreye|fd1f327efbfde4efe8219025b0a0481c93f8b1b2\n2011|Automatic Parallelism in Mercury|10.4230/LIPIcs.ICLP.2011.251|1|0|P. Bone|9fca42be3c532df8a750821255b2869a27b1da41" }, "merd": { "title": "merd", "appeared": 2002, "type": "pl", "creators": [ "Yoann Padioleau" ], "website": "http://merd.sourceforge.net/", "reference": [ "https://www.ntecs.de/examples/lang/html/merd.en.html", "https://www.cs.nmsu.edu/~jcook/posts/pl-history-of-pl/" ], "country": [ "France" ], "originCommunity": [ "Institut de recherche en informatique et systèmes aléatoires, Rennes" ], "domainName": { "name": "merd.sourceforge.net" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "mermaid": { "title": "mermaid", "appeared": 2014, "type": "textMarkup", "website": "https://mermaidjs.github.io/", "country": [ "Various" ], "originCommunity": [ "https://github.com/mermaid-js" ], "domainName": { "awisRank": { "2022": 385735 }, "name": "mermaidjs.github.io" }, "example": [ "gitGraph:\noptions\n{\n \"nodeSpacing\": 150,\n \"nodeRadius\": 10\n}\nend\ncommit\nbranch newbranch\ncheckout newbranch\ncommit\ncommit\ncheckout master\ncommit\ncommit\nmerge newbranch" ], "githubRepo": { "firstCommit": 2014, "stars": 48174, "forks": 3594, "subscribers": 586, "created": 2014, "updated": 2022, "description": "Generation of diagram and flowchart from text in a similar manner as markdown", "issues": 730, "url": "https://github.com/mermaid-js/mermaid" }, "repoStats": { "firstCommit": 2014, "commits": 7547, "committers": 555, "files": 620 }, "isbndb": "" }, "meroon": { "title": "Meroon", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/aee8c8a08f67fbcbd48e5f3b5ed47197fb4046f8" ], "country": [ "France" ], "originCommunity": [ "Institut de recherche en informatique et en automatique,Rocquencourt", "LIP6, Sorbonne University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3598", "centralPackageRepositoryCount": 0 }, "mesa": { "title": "Mesa", "appeared": 1970, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Computer Systems Laboratory" ], "wikipedia": { "related": [ "algol", "java", "modula-2", "bcpl", "modula-3", "pascal", "c", "sparc", "ada", "solaris" ], "summary": "Mesa is a programming language developed in the late 1970s at the Xerox Palo Alto Research Center in Palo Alto, California, United States. The language name was a pun based upon the programming language catchphrases of the time, because Mesa is a \"high level\" programming language. Mesa is an ALGOL-like language with strong support for modular programming. Every library module has at least two source files: a definitions file specifying the library's interface plus one or more program files specifying the implementation of the procedures in the interface. To use a library, a program or higher-level library must \"import\" the definitions. The Mesa compiler type-checks all uses of imported entities; this combination of separate compilation with type-checking was unusual at the time.Mesa introduced several other innovations in language design and implementation, notably in the handling of software exceptions, thread synchronization, and incremental compilation. Mesa was developed on the Xerox Alto, one of the first personal computers with a graphical user interface, however most of the Alto's system software was written in BCPL. Mesa was the system programming language of the later Xerox Star workstations, and for the GlobalView desktop environment. Xerox PARC later developed Cedar, which was a superset of Mesa. Mesa and Cedar had a major influence on the design of other important languages, such as Modula-2 and Java, and was an important vehicle for the development and dissemination of the fundamentals of GUIs, networked environments, and the other advances Xerox contributed to the field of computer science.", "pageId": 19962, "created": 2001, "backlinksCount": 41, "revisionCount": 187, "dailyPageViews": 37, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Mesa_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=769", "fileType": "text", "wordRank": 8191, "centralPackageRepositoryCount": 0 }, "meson": { "title": "Meson", "appeared": 2013, "type": "pl", "country": [ "Various" ], "originCommunity": [ "https://github.com/mesonbuild" ], "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "wikipedia": { "related": [ "python", "unix", "c", "d", "java", "rust", "vala", "visual-studio-editor", "cmake", "ninja" ], "summary": "Meson (/ˈmɛ.sɒn/) is a software tool for automating the building (compiling) of software. The overall goal for Meson is to promote programmer productivity.Meson is free and open-source software written in Python 3 and subject to the terms of the Apache 2.0 License.", "backlinksCount": 16, "pageId": 50160571, "created": 2016, "revisionCount": 92, "dailyPageViews": 63, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/Meson_(software)" }, "githubLanguage": { "trendingProjectsCount": 0, "type": "programming", "filenames": [ "meson.build", "meson_options.txt" ], "aceMode": "text", "tmScope": "source.meson", "repos": 880, "id": "Meson" }, "githubBigQuery": { "repos": 1153, "users": 765, "id": "Meson" }, "pygmentsHighlighter": { "filename": "meson.py", "fileExtensions": [ "meson.build", "meson_options.txt" ], "id": "Meson" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2018, "committerCount": 1, "commitCount": 14, "sampleCount": 2, "example": [ "option('with-something', type: 'boolean',\n value: true,\n)" ], "url": "https://github.com/TingPing/language-meson" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "messagepack": { "title": "MessagePack", "appeared": 2009, "type": "binaryDataFormat", "website": "https://msgpack.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/msgpack" ], "domainName": { "registered": 2009, "awisRank": { "2022": 663738 }, "name": "msgpack.org" }, "wikipedia": { "summary": "MessagePack is a computer data interchange format. It is a binary form for representing simple data structures like arrays and associative arrays. MessagePack aims to be as compact and simple as possible. The official implementation is available in a variety of languages such as C, C++, C#, D, Erlang, Go, Haskell, Java, JavaScript, Lua, OCaml, Perl, PHP, Python, Ruby, Scala, Smalltalk, and Swift.", "backlinksCount": 50, "pageId": 32083218, "dailyPageViews": 78, "url": "https://en.wikipedia.org/wiki/MessagePack" }, "twitter": "https://twitter.com/mobiltron" }, "met-english": { "title": "Met-English", "appeared": 1950, "type": "pl", "country": [ "United States" ], "originCommunity": [ "MetLife, Inc" ], "wikipedia": { "related": [ "cobol" ], "summary": "Met English Language (MEL) was an early computer language used by the Metropolitan Life Insurance Company (MetLife). It enabled MetLife to establish itself as a strong technology company in the early days of commercial computing. It has now been retired and is no longer in use.", "backlinksCount": 5, "pageId": 2261480, "dailyPageViews": 3, "created": 2005, "appeared": 1950, "url": "https://en.wikipedia.org/wiki/Met_English" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2233", "centralPackageRepositoryCount": 0 }, "meta-assembler": { "title": "Meta-Assembler", "appeared": 1977, "type": "assembly", "description": "This manual describes the SPERRY UNIVAC 1100 Series Meta-Assembler (MASM) processor and language. This manual is directed to users with basic Assembler programming knowledge and experienc€~. Definition of the machine language which is to be assembled by MASM is not given in this document. This information is available in the relevant hardware manuals. MASM is called a meta-assembler because it is not specifically bound to generating code for a particular hardwar~ architecture. With an unaltered environment, MASM will generate code for an 1100 Serit:!s hardware architecture. However, with the directives and built-in functions provided, the user may alter the environment to generate code for any hardware architecture. This assumes the output of MASM (1100 Series Relocatable Binary Format) can be converted to an acceptable form for to the operating system on .the alternate architecture. The processor accepts both Fieldata and ASCII input and maintains character constants in either code as specified by the user. MASM uses,an internal code to store character constants which do not have to be maintained iri a specific character code. MASM performs specified tasks based on the interpretation of statements received primarily via the Source Input Routine (SIR$) and produces an output. The output produced depends upon the user's request. If a relocatable binary element is requested, it is produced by the Relocatable Output Routine (ROH). M,A,SM optionally produces a printed listing of the the input and its processed form. The structure of both the input and output forms are presented elsewhere in this manual. MASM performs its function in two scans of the input. The first scan is known as the summary pass, and the second is known as the generative pass. These two passes of the source input, that is, from the first source image encountered to the last source image, are known as the main assembly. Assemblies invoked within the main assembly are known as subassemblies. Certain initialization is done at the start of each pass", "reference": [ "http://bitsavers.org/pdf/univac/1100/asm/UP-8453_MASM_Programmers_Ref_1977.pdf" ], "aka": [ "MASM" ], "country": [ "United States" ], "originCommunity": [ "UNIVAC Sperry" ] }, "meta-ii": { "title": "Meta II", "appeared": 1962, "type": "grammarLanguage", "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "wikipedia": { "summary": "META II is a domain-specific programming language for writing compilers. It was created in 1963-1964 by Dewey Val Schorre at UCLA. META II uses what Schorre called syntax equations. Its operation is simply explained as: Each syntax equation is translated into a recursive subroutine which tests the input string for a particular phrase structure, and deletes it if found. Meta II programs are compiled into an interpreted byte code language. VALGOL and SMALGOL compilers illustrating its capabilities were written in the META II language, VALGOL is a simple algebraic language designed for the purpose of illustrating META II. SMALGOL was a fairly large subset of ALGOL 60.", "backlinksCount": 33, "pageId": 6512314, "dailyPageViews": 17, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/META_II" }, "hopl": "https://hopl.info/showlanguage.prx?exp=202", "isbndb": "" }, "meta-lisp": { "title": "META/LISP", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4bd5cd31ec5e59c894723df69897b9eab9b68b75" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7275", "centralPackageRepositoryCount": 0 }, "meta-plus": { "title": "META/PLUS", "appeared": 1971, "type": "pl", "reference": [ "https://www.computerhistory.org/collections/catalog/102720724", "https://semanticscholar.org/paper/b489ffb3ccabf6e906294d1286d3cf0dabdbefb8" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7162", "centralPackageRepositoryCount": 0 }, "metacomco": { "title": "MetaComCo", "appeared": 1981, "type": "pl", "aka": [ "MBASIC ABasiC AmigaDOS" ], "country": [ "England" ], "originCommunity": [ "MetaComCo" ], "wikipedia": { "related": [ "mbasic", "pbasic", "reduce" ], "summary": "MetaComCo (MCC) was a computer systems software company started in 1981 and based in Bristol, England by Peter Mackeonis and Derek Budge. A division of Tenchstar, Ltd. MetaComCo's first product was an MBASIC compatible interpreter for IBM PCs, which was licensed by Peter Mackeonis to Digital Research in 1982, and issued as the Digital Research Personal Basic, or PBASIC, running under CP/M. Other computer languages followed, also licensed by Digital Research and MetaComCo established an office in Pacific Grove, California, to service their United States customers. In 1984 Dr. Tim King joined the company, bringing with him a version of the operating system TRIPOS for the Motorola 68000 processor which he had previously worked on whilst a researcher at the University of Cambridge. This operating system was used as the basis of AmigaDOS (file-related functions of AmigaOS); MetaComCo won the contract from Commodore because the original planned Amiga disk operating system called Commodore Amiga Operating System (CAOS) was behind schedule; timescales were incredibly tight and TRIPOS provided a head start for a replacement system. MetaComCo also developed ABasiC for the Amiga which was initially provided with Amigas. Much to Commodore's annoyance MetaComCo also worked with Atari to produce the BASIC that was initially provided with the Atari ST — ST BASIC. The company also sold the Lattice C compiler for the Sinclair QL and the Atari ST and range of other languages (e.g. Pascal, BCPL) for m68k-based computers. MetaComCo also represented LISP and REDUCE software from the RAND Corporation. Several of the team at MetaComCo went on to found Perihelion Software. Mackeonis founded Triangle Publishing, the software publishing company responsible for creating the ST Organizer for the Atari ST and PC Organizer and Counterpoint (a GUI system) for Amstrad Computers and GoldStar computers.", "created": 2002, "backlinksCount": 48, "pageId": 82392, "revisionCount": 75, "dailyPageViews": 6, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/MetaComCo" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "metafont": { "title": "METAFONT", "appeared": 1977, "type": "application", "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hasComments": { "example": "", "value": true }, "wikipedia": { "example": [ "%file name: beta.mf\n%mode_setup;\n% Define a beanlike shape for the character B\nbeginchar(\"B\",11pt#,11pt#,0);\n % Setup coordinates as an equation system\n y1=y2=y3=0;\n y4=y5=y6=h;\n x1=x4=0;\n x2=x5=w;\n x3=x6=2*w;\n\n % Define pen\n pickup pencircle xscaled 0.2w yscaled 0.04w rotated 45;\n\n % Draw the character curve\n draw z1..z3..z6{z2-z6}..z5..{z4-z2}z4..cycle;\nendchar;\n\nend" ], "related": [ "postscript", "tex", "asymptote" ], "summary": "Metafont is a description language used to define raster fonts. It is also the name of the interpreter that executes Metafont code, generating the bitmap fonts that can be embedded into e.g. PostScript. Metafont was devised by Donald Knuth as a counterpart to his TeX typesetting system. One of the characteristics of Metafont is that all of the shapes of the glyphs are defined with geometrical equations. In particular, one can define a given point to be the intersection of a line segment and a Bézier cubic.", "pageId": 44263, "created": 2002, "backlinksCount": 159, "revisionCount": 240, "dailyPageViews": 63, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/Metafont" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Metafont", "hopl": "https://hopl.info/showlanguage.prx?exp=1238", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nComputers & Typesetting, Volume C: The Metafont Book|1986|Donald Ervin Knuth|1595791|4.22|27|0\nComputers & Typesetting, Volume D: Metafont: The Program|1986|Donald Ervin Knuth|1744584|4.36|11|0" }, "metah": { "title": "MetaH", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/476cac33352a111955ac0a98f110a0fec01bb80c" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7769", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "metal-programming-language": { "title": "MetaL", "appeared": 2001, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/MetaL_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "metal": { "title": "Metal", "appeared": 2014, "type": "library", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "related": [ "ios", "opengl", "opencl", "swift", "objective-c", "llvmir", "unity-engine" ], "summary": "Metal is a low-level, low-overhead hardware-accelerated 3D graphic and compute shader application programming interface (API) developed by Apple Inc., and which debuted in iOS 8. Metal combines functions similar to OpenGL and OpenCL under one API. It is intended to bring to iOS, macOS, and tvOS apps some of the performance benefits of similar APIs on other platforms, such as Vulkan (which debuted in mid-February 2016) and DirectX 12. Metal is an object-oriented API that can be invoked using the Swift or Objective-C programming languages. Full-blown control of the Metal framework (as well as the related MetalKit framework) is accessible via the Metal Unified Graphics and Compute Language. According to Apple promotional materials: \"Metal is a C++ based programming language that developers can use to write code that is executed on the GPU for graphics and general-purpose data-parallel computations. Since Metal is based on C++, developers will find it familiar and easy to use. With Metal, both graphics and compute programs can be written with a single, unified language, which allows tighter integration between the two.\"", "backlinksCount": 325, "pageId": 43545213, "created": 2014, "revisionCount": 183, "dailyPageViews": 475, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/Metal_(API)" }, "githubLanguage": { "fileExtensions": [ "metal" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-c++src", "tmScope": "source.c++", "repos": 79, "id": "Metal" }, "githubBigQuery": { "repos": 256, "users": 232, "id": "Metal" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 23, "commitCount": 359, "sampleCount": 1, "example": [ "// Copyright 2014 Isis Innovation Limited and the authors of InfiniTAM\n\n#include \n\n#include \"../../DeviceAgnostic/ITMSceneReconstructionEngine.h\"\n#include \"../../DeviceAgnostic/ITMVisualisationEngine.h\"\n#include \"ITMVisualisationEngine_Metal.h\"\n\nusing namespace metal;\n\nkernel void genericRaycastVH_device(DEVICEPTR(Vector4f) *pointsRay [[ buffer(0) ]],\n const CONSTPTR(ITMVoxel) *voxelData [[ buffer(1) ]],\n const CONSTPTR(typename ITMVoxelIndex::IndexData) *voxelIndex [[ buffer(2) ]],\n const CONSTPTR(Vector2f) *minmaxdata [[ buffer(3) ]],\n const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(4) ]],\n uint2 threadIdx [[ thread_position_in_threadgroup ]],\n uint2 blockIdx [[ threadgroup_position_in_grid ]],\n uint2 blockDim [[ threads_per_threadgroup ]])\n{\n int x = threadIdx.x + blockIdx.x * blockDim.x, y = threadIdx.y + blockIdx.y * blockDim.y;\n \n if (x >= params->imgSize.x || y >= params->imgSize.y) return;\n \n int locId = x + y * params->imgSize.x;\n int locId2 = (int)floor((float)x / minmaximg_subsample) + (int)floor((float)y / minmaximg_subsample) * params->imgSize.x;\n \n castRay(pointsRay[locId], x, y, voxelData, voxelIndex, params->invM, params->invProjParams,\n params->voxelSizes.y, params->lightSource.w, minmaxdata[locId2]);\n}\n\nkernel void genericRaycastVGMissingPoints_device(DEVICEPTR(Vector4f) *forwardProjection [[ buffer(0) ]],\n const CONSTPTR(int) *fwdProjMissingPoints [[ buffer(1) ]],\n const CONSTPTR(ITMVoxel) *voxelData [[ buffer(2) ]],\n const CONSTPTR(typename ITMVoxelIndex::IndexData) *voxelIndex [[ buffer(3) ]],\n const CONSTPTR(Vector2f) *minmaxdata [[ buffer(4) ]],\n const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(5) ]],\n uint2 threadIdx [[ thread_position_in_threadgroup ]],\n uint2 blockIdx [[ threadgroup_position_in_grid ]],\n uint2 blockDim [[ threads_per_threadgroup ]])\n{\n int pointId = threadIdx.x + blockIdx.x * blockDim.x;\n \n if (pointId >= params->imgSize.z) return;\n \n int locId = fwdProjMissingPoints[pointId];\n int y = locId / params->imgSize.x, x = locId - y * params->imgSize.x;\n int locId2 = (int)floor((float)x / minmaximg_subsample) + (int)floor((float)y / minmaximg_subsample) * params->imgSize.x;\n \n castRay(forwardProjection[locId], x, y, voxelData, voxelIndex, params->invM, params->invProjParams,\n params->voxelSizes.y, params->lightSource.w, minmaxdata[locId2]);\n}\n\nkernel void renderICP_device(const CONSTPTR(Vector4f) *pointsRay [[ buffer(0) ]],\n DEVICEPTR(Vector4f) *pointsMap [[ buffer(1) ]],\n DEVICEPTR(Vector4f) *normalsMap [[ buffer(2) ]],\n DEVICEPTR(Vector4u) *outRendering [[ buffer(3) ]],\n const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(4) ]],\n uint2 threadIdx [[ thread_position_in_threadgroup ]],\n uint2 blockIdx [[ threadgroup_position_in_grid ]],\n uint2 blockDim [[ threads_per_threadgroup ]])\n{\n int x = threadIdx.x + blockIdx.x * blockDim.x, y = threadIdx.y + blockIdx.y * blockDim.y;\n \n if (x >= params->imgSize.x || y >= params->imgSize.y) return;\n \n processPixelICP(outRendering, pointsMap, normalsMap, pointsRay, params->imgSize.xy, x, y, params->voxelSizes.x, TO_VECTOR3(params->lightSource));\n}\n\nkernel void renderForward_device(DEVICEPTR(Vector4u) *outRendering [[ buffer(0) ]],\n const CONSTPTR(Vector4f) *pointsRay [[ buffer(1) ]],\n const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(2) ]],\n uint2 threadIdx [[ thread_position_in_threadgroup ]],\n uint2 blockIdx [[ threadgroup_position_in_grid ]],\n uint2 blockDim [[ threads_per_threadgroup ]])\n{\n int x = threadIdx.x + blockIdx.x * blockDim.x, y = threadIdx.y + blockIdx.y * blockDim.y;\n \n if (x >= params->imgSize.x || y >= params->imgSize.y) return;\n \n processPixelForwardRender(outRendering, pointsRay, params->imgSize.xy, x, y, params->voxelSizes.x, TO_VECTOR3(params->lightSource));\n}\n\nkernel void forwardProject_device(DEVICEPTR(Vector4f) *forwardProjection [[ buffer(0) ]],\n const CONSTPTR(Vector4f) *pointsRay [[ buffer(1) ]],\n const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(2) ]],\n uint2 threadIdx [[ thread_position_in_threadgroup ]],\n uint2 blockIdx [[ threadgroup_position_in_grid ]],\n uint2 blockDim [[ threads_per_threadgroup ]])\n{\n int x = (threadIdx.x + blockIdx.x * blockDim.x), y = (threadIdx.y + blockIdx.y * blockDim.y);\n \n if (x >= params->imgSize.x || y >= params->imgSize.y) return;\n \n int locId = x + y * params->imgSize.x;\n Vector4f pixel = pointsRay[locId];\n \n int locId_new = forwardProjectPixel(pixel * params->voxelSizes.x, params->M, params->projParams, params->imgSize.xy);\n if (locId_new >= 0) forwardProjection[locId_new] = pixel;\n}" ], "url": "https://github.com/textmate/c.tmbundle" }, "fileType": "text", "wordRank": 1466, "centralPackageRepositoryCount": 0 }, "metalang99": { "title": "Metalang99", "appeared": 2021, "type": "pl", "creators": [ "Sima Kinsart" ], "description": "Metalang99: A functional language for C99 preprocessor metaprogramming", "website": "https://metalang99.readthedocs.io/en/latest/", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/lswnya/metalang99_a_functional_language_for_c99/" ], "country": [ "Kazakhstan" ], "originCommunity": [ "https://github.com/Hirrolot/metalang99/issues" ], "githubRepo": { "firstCommit": 2020, "stars": 557, "forks": 19, "subscribers": 15, "created": 2020, "updated": 2022, "description": "Full-blown preprocessor metaprogramming", "issues": 2, "url": "https://github.com/Hirrolot/metalang99" }, "repoStats": { "firstCommit": 2020, "commits": 1679, "committers": 5, "files": 117 } }, "metalex": { "title": "metalex", "appeared": 2002, "type": "xmlFormat", "description": "This paper gives an overview of two XML standard proposals dealing with two complementary aspects of electronic legislation – the documents themselves as a carrier, and an institutional reality they represent – in a coherent way: MetaLex XML and the Legal Knowledge Interchange format (LKIF).", "reference": [ "https://link.springer.com/chapter/10.1007/978-3-540-85569-9_2" ], "country": [ "The Netherlands and Italy" ], "originCommunity": [ "University of Amsterdam", "University of Bologna" ] }, "metaml": { "title": "MetaML", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0abaa4c1d1b765c8be7a14204406ae2e7ee5a458" ], "country": [ "United States" ], "originCommunity": [ "University di Genoa", "Oregon Graduate Institute" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3652", "centralPackageRepositoryCount": 0 }, "metapi": { "title": "METAPI", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a617a6ef72375bfcc912fdbdb645fc66db3c6abc" ], "country": [ "United States" ], "originCommunity": [ "RCA Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5090", "centralPackageRepositoryCount": 0 }, "metapost": { "title": "METAPOST", "appeared": 1994, "type": "pl", "creators": [ "John D. Hobby" ], "description": "A graphics language that can output PostScript, SVG, and some other formats.", "reference": [ "https://www.tug.org/docs/metapost/mpman.pdf#targetText=MetaPost%20is%20a%20programming%20language,for%20creating%20and%20manipulating%20pictures." ], "country": [ "Various" ], "originCommunity": [ "https://web.archive.org/web/20070929092912/http://foundry.supelec.fr/projects/metapost/" ], "example": [ "beginfig(2);\nu=1cm;\ndraw (2u,2u)--(0,0)--(0,3u)--(3u,0)--(0,0);\npickup pencircle scaled 4pt;\nfor i=0 upto 2:\n for j=0 upto 2: drawdot (i*u,j*u); endfor\nendfor\nendfig" ], "wikipedia": { "summary": "MetaPost refers to both a programming language and the interpreter of the MetaPost programming language. Both are derived from Donald Knuth's Metafont language and interpreter. MetaPost produces vector graphic diagrams from a geometric/algebraic description. The language shares Metafont's declarative syntax for manipulating lines, curves, points and geometric transformations. However, Metafont is set up to produce fonts, in the form of image files (in .gf format) with associated font metric files (in .tfm format), whereas MetaPost produces EPS, SVG, or PNG files The output of Metafont consists of the fonts at a fixed resolution in a raster-based format, whereas MetaPost's output is vector-based graphics (lines, Bézier curves) Metafont output is monochrome, whereas MetaPost uses RGB or CMYK colors. The MetaPost language can include text labels on the diagrams, either strings from a specified font, or anything else that can be typeset with TeX. Starting with version 1.8, Metapost allows floating-point arithmetic with 64 bits (default: 32 bit fixed-point arithmetic)Many of the limitations of MetaPost derive from features of Metafont. For instance, MetaPost does not support all features of PostScript. Most notably, paths can have only one segment (so that regions are simply connected), and regions can be filled only with uniform colours. PostScript level 1 supports tiled patterns and PostScript 3 supports Gouraud shading.", "backlinksCount": 173, "pageId": 287733, "dailyPageViews": 38, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/MetaPost" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5681", "isbndb": "" }, "metasim": { "title": "METASIM", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a966a817937bb73b7794300e913e3aa49b5545b8" ], "country": [ "United States" ], "originCommunity": [ "Boston Biomedical Research Institute" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6674", "centralPackageRepositoryCount": 0 }, "metatem": { "title": "METATEM", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1f959cf5cdfa72f328fab0f836fe9e6715147f7f" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Manchester", "Manchester Metropolitan University", "Imperial College of Science, Technology and Medicine", "Nomura Research Institute Europe Ltd." ], "hopl": "https://hopl.info/showlanguage.prx?exp=5660", "centralPackageRepositoryCount": 0 }, "metaweb-query-language": { "title": "Metaweb Query Language", "appeared": 2006, "type": "queryLanguage", "reference": [ "https://rpbouman.blogspot.com/2011/01/mql-to-sql-json-based-query-language.html?m=0" ], "country": [ "United States" ], "originCommunity": [ "Metaweb Technologies, Inc" ], "example": [ "{\n \"name\": None,\n \"mid\": None,\n \"type\": \"/food/dish\",\n \"count\": None,\n #\"return\": \"count\",\n \"limit\": 20,\n \"sort\": \"name\",\n}" ] }, "methodology-description-language": { "title": "MDL", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/316a014b05ac38bff81c97d622172252d88acc28" ], "aka": [ "mdl" ], "country": [ "Taiwan and United States" ], "originCommunity": [ "National Chiao-Tung University", "University of Texas at Arlington" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2840", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1995|Onword Pr|Programming With Mdl|Mach N. Dinh-vu|9780934605892\n||Mdl (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133176805" }, "mewl": { "title": "Mewl", "appeared": 2022, "type": "esolang", "creators": [ "Palash Bauri" ], "website": "https://bauripalash.github.io/mewlbook/", "country": [ "India" ], "originCommunity": [ "https://github.com/bauripalash/mewl/issues" ], "githubRepo": { "firstCommit": 2022, "stars": 5, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "description": "Mewl, program in cats' language; A just-for-fun language", "issues": 0, "url": "https://github.com/bauripalash/mewl" }, "repoStats": { "firstCommit": 2022, "commits": 57, "committers": 4, "files": 44 } }, "mewmew": { "title": "MewMew", "appeared": 2020, "type": "esolang", "creators": [ "Palash Bauri" ], "website": "https://palashbauri.in/mewmew", "country": [ "India" ], "originCommunity": [ "https://github.com/bauripalash/mewmew/issues" ], "githubRepo": { "firstCommit": 2020, "stars": 63, "forks": 4, "subscribers": 3, "created": 2020, "updated": 2022, "description": "/ᐠ｡ꞈ｡ᐟ\\ MewMew Programming Language - Program in Cats' Language", "issues": 2, "url": "https://github.com/bauripalash/mewmew" }, "repoStats": { "firstCommit": 2020, "commits": 55, "committers": 4, "files": 23 } }, "mgmt": { "title": "mgmt", "appeared": 2015, "type": "pl", "creators": [ "James Shubin" ], "website": "https://purpleidea.com/tags/mgmtconfig/", "reference": [ "https://fosdem.org/2020/schedule/event/mgmtconfigmore/" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/purpleidea/mgmt/issues" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "import \"datetime\"\n$is_friday = datetime.weekday(datetime.now()) == \"friday\"\nfile \"/srv/files/\" {\n state => $const.res.file.state.exists,\n mode => if $is_friday { # this updates the mode, the instant it changes!\n \"0550\"\n } else {\n \"0770\"\n },\n}" ], "githubRepo": { "firstCommit": 2015, "stars": 2948, "forks": 277, "subscribers": 104, "created": 2015, "updated": 2022, "description": "Next generation distributed, event-driven, parallel config management!", "issues": 126, "url": "https://github.com/purpleidea/mgmt" }, "repoStats": { "firstCommit": 2015, "commits": 1503, "committers": 89, "files": 1099 }, "twitter": "https://twitter.com/purpleidea", "isbndb": "year|publisher|title|authors|isbn13\n2008|Cambridge University Press|Differential Games Econ Mgmt Sci|Dockner, Engelbert J.|9780521637329\n1994|Allyn & Bacon|Sm Quantitative Analysis Mgmt Aie|RENDER|9780205153800" }, "mheg-5": { "title": "MHEG-5", "appeared": 1997, "type": "schema", "country": [ "Switzerland" ], "originCommunity": [ "Multimedia and Hypermedia Experts Group" ], "wikipedia": { "related": [ "asn-1" ], "summary": "MHEG-5, or ISO/IEC 13522-5, is part of a set of international standards relating to the presentation of multimedia information, standardised by the Multimedia and Hypermedia Experts Group (MHEG). It is most commonly used as a language to describe interactive television services.", "pageId": 226438, "created": 2003, "backlinksCount": 196, "revisionCount": 167, "dailyPageViews": 49, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/MHEG-5" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "michelson": { "title": "michelson", "appeared": 2017, "type": "pl", "creators": [ "Grégoire Henry" ], "website": "https://www.michelson-lang.com", "documentation": [ "https://gitlab.com/tezos/michelson-reference" ], "reference": [ "https://opentezos.com/michelson/" ], "country": [ "United States" ], "originCommunity": [ "Dynamic Ledger Solutions Inc" ], "domainName": { "registered": 2017, "name": "michelson-lang.com" }, "gitlabRepo": "https://gitlab.com/tezos/tezos", "repoStats": { "firstCommit": 2016, "commits": 35912, "committers": 361, "files": 15909 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n15061029|The Michelson Language|https://www.michelson-lang.com/|2017-08-21 00:16:24 UTC|1503274584|bshanks|11|92" }, "micro-cpp": { "title": "ΜC++", "appeared": 1992, "type": "pl", "creators": [ "pabuhr" ], "website": "https://plg.uwaterloo.ca/usystem/uC++.html", "country": [ "Canada" ], "originCommunity": [ "University of Waterloo" ], "githubRepo": { "firstCommit": 2013, "stars": 133, "forks": 26, "subscribers": 13, "created": 2013, "updated": 2022, "description": "concurrency for C++", "issues": 2, "url": "https://github.com/pabuhr/uCPP" }, "repoStats": { "firstCommit": 2013, "commits": 43, "committers": 4, "files": 380 }, "wikipedia": { "summary": "μC++, also called uC++, is a programming language, an extension of C++ designed for concurrent programming. Among other features, it adds coroutines, tasks, and monitors, and extends existing language constructs to integrate with them. Its compiler, named u++, operates as a source-to-source translator targeting C++. μC++ is part of the μSystem project, of the University of Waterloo, Ontario, Canada, a large-scale project led by professor Peter Buhr with the goal to create a \"highly-concurrent shared-memory programming system\".It is used in course CS 343 in University of Waterloo.Every μC++ program should include the uC++.h header file before any other header, although this is not necessary for more recent versions. uC++ is now open source, available on GitHub.", "created": 2005, "backlinksCount": 22, "pageId": 3405199, "dailyPageViews": 14, "appeared": 2006, "url": "https://en.wikipedia-on-ipfs.org/wiki/%CE%9CC%2B%2B" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "micro-editor": { "title": "micro-editor", "appeared": 2016, "type": "editor", "website": "https://micro-editor.github.io", "country": [ "United States" ], "originCommunity": [ "https://github.com/zyedidia/micro/issues" ], "domainName": { "awisRank": { "2022": 627687 }, "name": "micro-editor.github.io" }, "githubRepo": { "firstCommit": 2016, "stars": 19747, "forks": 1022, "subscribers": 262, "created": 2016, "updated": 2022, "description": "A modern and intuitive terminal-based text editor", "issues": 671, "url": "https://github.com/zyedidia/micro" } }, "micro-flowcharts": { "title": "Micro-flowcharts", "appeared": 1959, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f688448ed0149c068e7d1bbc396f1fbc5fd7a0e4" ], "country": [ "United States" ], "originCommunity": [ "University of Pennsylvania" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8013", "centralPackageRepositoryCount": 0 }, "micro-mitten": { "title": "micro-mitten", "appeared": 2020, "type": "pl", "website": "https://mitten-lang.org/", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/doctorn/micro-mitten/issues" ], "domainName": { "name": "mitten-lang.org" }, "githubRepo": { "firstCommit": 2020, "stars": 497, "forks": 11, "subscribers": 18, "created": 2020, "updated": 2022, "description": "You might not need your garbage collector", "issues": 1, "url": "https://github.com/doctorn/micro-mitten" }, "repoStats": { "firstCommit": 2020, "commits": 5, "committers": 2, "files": 95 } }, "micro-prolog": { "title": "Micro-PROLOG", "appeared": 1980, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Logic Programming Associates Ltd" ], "wikipedia": { "dailyPageViews": -1, "url": "http://www.edm2.com/index.php/Micro-PROLOG" }, "centralPackageRepositoryCount": 0 }, "microarchitecture-description-language": { "title": "mdl", "appeared": 2019, "type": "isa", "creators": [ "Reid Tatge" ], "description": "We’ve created a DSL and compiler for modeling micro-architecture that handles a very broad class of architectures - CPU, GPUs, VLIWs, DSPs, ML accelerators, and embedded devices. This effort grew out of a need to quickly develop and experiment with high-quality compilers and tools to facilitate rapid architecture exploration. We named the DSL “MDL” for “Microarchitecture Description Language”", "website": "https://github.com/MPACT-ORG", "documentation": [ "https://llvm.org/docs/GettingStarted.html" ], "reference": [ "https://discourse.llvm.org/t/rfc-mdl-a-micro-architecture-description-language-for-llvm/66409/4" ], "cheatSheetUrl": [ "https://github.com/MPACT-ORG/llvm-project/tree/work#the-llvm-compiler-infrastructure" ], "standsFor": "Microarchitecture Description Language", "country": [ "United States" ], "originCommunity": [ "https://github.com/MPACT-ORG" ], "versions": { "2022": [ "llvmorg-14.0.0-rc1" ] }, "writtenIn": [ "cpp" ], "githubRepo": { "stars": 17, "forks": 0, "subscribers": 0, "created": 2022, "updated": 2022, "description": "The LLVM Project is a collection of modular and reusable compiler and toolchain technologies. Note: the repository does not accept github pull requests at this moment. Please submit your patches at http://reviews.llvm.org.", "issues": 0, "url": "https://github.com/MPACT-ORG/llvm-project/" } }, "microdare": { "title": "MICRODARE", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/14487fc9909f9fad6bc1d21c3eb04074d1f54f3d" ], "country": [ "United States" ], "originCommunity": [ "University of Arizona Tucson" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6945", "centralPackageRepositoryCount": 0 }, "microdata": { "title": "Microdata HTML", "appeared": 2013, "type": "schema", "reference": [ "https://www.w3.org/TR/microdata/" ], "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "related": [ "rdf", "json-ld" ], "example": [ "
\n \n \n \n
\n \n \n
\n
\n \n \n
\n
\n \n \n
\n \n \n \n \n \n \n
\n \n
\n
\n \n
\n
\n \n
\n
\n \n
\n
\n \n \n
\n \n
\n \n
\n \n
\n
\n
\n \n
\n \n \n \n \n \n
\n \n
\n \n
\n \n
\n \n \n \n \n \n
\n \n
\n \n \n \n
" ], "wikipedia": { "summary": "Microdata is a WHATWG HTML specification used to nest metadata within existing content on web pages. Search engines, web crawlers, and browsers can extract and process Microdata from a web page and use it to provide a richer browsing experience for users. Search engines benefit greatly from direct access to this structured data because it allows them to understand the information on web pages and provide more relevant results to users. Microdata uses a supporting vocabulary to describe an item and name-value pairs to assign values to its properties. Microdata is an attempt to provide a simpler way of annotating HTML elements with machine-readable tags than the similar approaches of using RDFa and microformats. In 2013, because the W3C HTML Working Group failed to find someone to serve as an editor for the Microdata HTML specification, its development was terminated with a 'Note'. However, since that time, two new editors were selected, and five newer versions of the working draft have been published, the most recent being W3C Working Draft 26 April 2018.", "backlinksCount": 157, "pageId": 25817778, "dailyPageViews": 172, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/Microdata_(HTML)" } }, "microl": { "title": "microl", "appeared": 2021, "type": "pl", "creators": [ "Mike Redko" ], "country": [ "Russia" ], "originCommunity": [ "https://github.com/somerandomdev49/microl/issues" ], "githubRepo": { "firstCommit": 2021, "stars": 6, "forks": 0, "subscribers": 3, "created": 2021, "updated": 2022, "description": "a little minimalistic programming language :o", "issues": 0, "url": "https://github.com/somerandomdev49/microl" }, "repoStats": { "firstCommit": 2021, "commits": 33, "committers": 4, "files": 21 } }, "microplanner": { "title": "microPLANNER", "appeared": 1970, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/Planner_(programming_language)" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=516" }, "micropython": { "title": "MicroPython", "appeared": 2014, "type": "pl", "creators": [ "Damien P. George" ], "website": "https://micropython.org/", "country": [ "Australia and The Netherlands" ], "originCommunity": [ "https://github.com/micropython" ], "domainName": { "registered": 2013, "awisRank": { "2022": 51222 }, "name": "micropython.org" }, "githubRepo": { "firstCommit": 2013, "stars": 15563, "forks": 5978, "subscribers": 728, "created": 2013, "updated": 2022, "description": "MicroPython - a lean and efficient Python implementation for microcontrollers and constrained systems", "issues": 1469, "url": "https://github.com/micropython/micropython" }, "repoStats": { "firstCommit": 2013, "commits": 14737, "committers": 617, "files": 5183 }, "wikipedia": { "related": [ "c", "arduino", "python", "arm" ], "summary": "MicroPython is a software implementation of the Python 3 programming language, written in C, that is optimized to run on a microcontroller. MicroPython is a full Python compiler and runtime that runs on the micro-controller hardware. The user is presented with an interactive prompt (the REPL) to execute supported commands immediately. Included are a selection of core Python libraries; MicroPython includes modules which give the programmer access to low-level hardware.MicroPython was originally created by the Australian programmer and physicist Damien George, after a successful Kickstarter backed campaign in 2013. While the original Kickstart campaign released MicroPython with a pyboard microcontroller, MicroPython supports a number of ARM based architectures. MicroPython has since been run on Arduino platform based products, ESP8266, ESP32, and Internet of things hardware. In 2016 a version of MicroPython for the BBC Micro Bit was created as part of the Python Software Foundation's contribution to the Micro Bit partnership with the BBC.The source code for the project is available on GitHub.", "pageId": 50278739, "created": 2016, "backlinksCount": 35, "revisionCount": 51, "dailyPageViews": 132, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/MicroPython" }, "twitter": "https://twitter.com/micropython", "jupyterKernel": [ "https://github.com/goatchurchprime/jupyter_micropython_kernel/" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPROGRAMMING IN MICROPYTHON||SEPP MAHLER|58245376|1.00|1|0\nProgramming with MicroPython: Embedded Programming with Microcontrollers and Python||Nicholas H. Tollervey|57975936|4.50|2|0\nProgramming the BBC micro:bit: Getting Started with MicroPython||Simon Monk|58372050|0.0|0|0\nMicroPython for STM32 Nucleo Technical Workshop||Agus Kurniawan|65638655|0.0|0|0\nMicroPython for BBC micro:bit Technical Workshop||Agus Kurniawan|64410233|0.0|0|0\nProgramming ESP8266-based Wireless Systems in MicroPython||Yury Magda|54822927|0.0|0|0\nProgramming with Micropython: Embedded Programming with Microcontrollers and Python||Nicholas H Tollervey|58550340|0.0|0|0\nProgramming with Micropython: Embedded Programming with Microcontrollers and Python||Nicholas H Tollervey|58550342|0.0|0|0\nProgramming with Micropython: Embedded Programming with Microcontrollers and Python||Nicholas H Tollervey|58550341|0.0|0|0\nMicroPython for the Internet of Things: A Beginner’s Guide to Programming with Python on Microcontrollers||Charles Bell|59119023|0.0|0|0\nMicropython for the Internet of Things: A Beginner's Guide to Programming with Python on Microcontrollers||Charles Bell|58627905|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2019|Packt Publishing|MicroPython Cookbook: Over 110 practical recipes for programming embedded systems and microcontrollers with Python|Alsabbagh, Marwan|9781838649951\n2017|Apress|MicroPython for the Internet of Things: A Beginner’s Guide to Programming with Python on Microcontrollers|Bell, Charles|9781484231227\n2019|Independently Published|Advanced Programming In Micropython By Example|Magda, Yury|9781090900937\n2021|I/O Press|Programming the Raspberry Pi Pico in MicroPython|Fairhead, Harry and James, Mike|9781871962697\n2017|McGraw-Hill Education TAB|Programming the BBC micro:bit: Getting Started with MicroPython|Monk, Simon|9781260117585\n2020|Apress|Beginning Sensor Networks with XBee, Raspberry Pi, and Arduino: Sensing the World with Python and MicroPython|Bell, Charles|9781484257951\n2016|McGraw-Hill Education TAB|Python for Microcontrollers: Getting Started with MicroPython|Norris, Donald|9781259644535\n2016|McGraw-Hill Education TAB|Python for Microcontrollers: Getting Started with MicroPython|Norris, Donald|9781259644542\n2020|Packt Publishing|MicroPython Projects: A do-it-yourself guide for embedded developers to build a range of applications using Python|Beningo, Jacob|9781789952537\n2022|MicroDigitalEd|Raspberry Pi Pico Interfacing and Programming with MicroPython|Chen, Shujen and Mazidi, Muhammad Ali and Yazdani, Nasim|9781970054231\n2017|McGraw Hill TAB|Programming the BBC micro:bit: Getting Started with MicroPython|Monk, Simon|9781260117592\n2020|Apress|Beginning Sensor Networks with XBee, Raspberry Pi, and Arduino: Sensing the World with Python and MicroPython|Charles Bell|9781484257968\n2022|Springer|Embedded System Design with ARM Cortex-M Microcontrollers: Applications with C, C++ and MicroPython|Ünsalan, Cem and Gürhan, Hüseyin Deniz and Yücel, Mehmet Erkin|9783030884390\n2022|Independently published|MicroPython and the Internet of Things: A gentle introduction to programming digital circuits with Python|Grinberg, Miguel|9798810439226\n21-05-2019|Packt Publishing|MicroPython Cookbook|Marwan Alsabbagh|9781838641955\n20170925|O'Reilly Media, Inc.|Programming with MicroPython|Nicholas H. Tollervey|9781491972694\n2017|O'reilly Media, Inc.|Programming With Micropython|Nicholas H. Tollervey|9781491972717\n20171124|Springer Nature|MicroPython for the Internet of Things|Charles Bell|9781484231234\n20220723|Springer Nature|Beginning MicroPython with the Raspberry Pi Pico|Charles Bell|9781484281352", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2020|Programming in MicroPython|10.1007/978-1-4842-5796-8_3|1|0|Charles Bell|991ad6f5b16d0179712d7272b857091d251cb9b2" }, "microsoft-access": { "title": "Microsoft Access", "appeared": 1992, "type": "database", "description": "Relational database management system (RDBMS)", "country": [ "United States" ], "originCommunity": [ "Microsoft Corporation" ] }, "microsoft-azure-cosmos-db": { "title": "Microsoft Azure Cosmos DB", "appeared": 2017, "type": "database", "description": "Multi-model NoSQL database management system", "country": [ "United States" ], "originCommunity": [ "Microsoft Corporation" ] }, "microsoft-basic": { "title": "Microsoft BASIC", "appeared": 1975, "type": "pl", "documentation": [ "https://ia800708.us.archive.org/8/items/BASIC-80_MBASIC_Reference_Manual/BASIC-80_MBASIC_Reference_Manual_text.pdf" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "altair-basic", "visual-basic.net", "commodore-basic", "atari-microsoft-basic", "basic-plus", "punched-tape", "atari-basic", "gw-basic", "applesoft-basic", "mbasic", "fat", "color-basic", "trs-80-color-computer", "msx-basic", "qbasic", "csharp", "microsoft-small-basic", "visual-basic", "amigabasic", "galaksija-basic", "quickbasic", "vba", "freebasic", "gambas", "locomotive-basic", "integer-basic", "tiny-basic" ], "summary": "Microsoft BASIC is the foundation product of the Microsoft company. It first appeared in 1975 as Altair BASIC, which was the first BASIC by Microsoft and the first high level programming language available for the Altair 8800 microcomputer. During the home computer craze during the late-1970s and early-1980s, Microsoft BASIC was ported to and supplied with practically every computer design. Slight variations to add support for machine-specific functions led to a profusion of related designs like Commodore BASIC and Atari Microsoft BASIC. As the early home computers gave way to newer designs like the IBM PC and Apple Macintosh, BASIC was no longer as widely used, although it retained a strong following. The release of Visual BASIC reignited its popularity and it remains in wide use on Microsoft Windows platforms in its most recent incarnation, Visual Basic .NET", "created": 2002, "backlinksCount": 330, "pageId": 149766, "revisionCount": 253, "dailyPageViews": 280, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Microsoft_BASIC" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "microsoft-equation-editor": { "title": "Microsoft Equation Editor", "appeared": 1993, "type": "application", "reference": [ "https://en.wikipedia.org/wiki/Microsoft_Office_shared_tools#Equation_Editor" ], "originCommunity": [ "Microsoft" ], "versions": { "2007": [ "2007" ] }, "related": [ "tex", "mathtype" ], "visualParadigm": true }, "microsoft-macro-assembler": { "title": "Microsoft Macro Assembler", "appeared": 1981, "type": "assembly", "website": "https://docs.microsoft.com/en-us/cpp/assembler/masm/microsoft-macro-assembler-reference", "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "x86-assembly", "c", "visual-studio-editor", "mmx", "turbo-assembler", "assembly-language" ], "summary": "The Microsoft Macro Assembler (MASM) is an x86 assembler that uses the Intel syntax for MS-DOS and Microsoft Windows. Beginning with MASM 8.0 there are two versions of the assembler - one for 16-bit and 32-bit assembly sources, and another (ML64) for 64-bit sources only. MASM is maintained by Microsoft, but since version 6.12 has not been sold as a separate product, it is instead supplied with various Microsoft SDKs and C compilers. Recent versions of MASM are included with Microsoft Visual Studio.", "pageId": 1061469, "created": 2004, "backlinksCount": 60, "revisionCount": 421, "dailyPageViews": 136, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/Microsoft_Macro_Assembler" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "microsoft-mysql-server": { "title": "Microsoft SQL Server", "appeared": 1989, "type": "database", "description": "Relational database management system (RDBMS)", "country": [ "United States" ], "originCommunity": [ "Microsoft Corporation" ] }, "microsoft-small-basic": { "title": "Microsoft Small Basic", "appeared": 2008, "type": "pl", "website": "http://www.smallbasic.com/", "originCommunity": [ "Microsoft" ], "domainName": { "registered": 2007, "awisRank": { "2022": 2342686 }, "name": "smallbasic.com" }, "wikipedia": { "example": [ "[SmallBasicType]\npublic static class ExampleClass\n{\n public static Primitive Add(Primitive A, Primitive B) => A + B;\n\n public static Primitive SomeProperty\n {\n get;\n set;\n }\n\n public static Primitive Pi => (Primitive)3.14159;\n}" ], "related": [ "smallbasic", "logo", "qbasic", "visual-basic.net", "basic", "csharp", "xml", "visual-studio-editor", "visual-basic", "visual-studio-code-editor", "robomind", "scratch" ], "summary": "Microsoft Small Basic is a programming language and associated IDE. It is Microsoft's simplified variant of the BASIC programming language, intended as an easy programming language for beginners. The associated IDE provides a simplified programming environment with functionality such as syntax highlighting, intelligent code completion, and in-editor documentation access. The language has only 14 keywords.", "pageId": 20153719, "created": 2008, "backlinksCount": 190, "revisionCount": 276, "dailyPageViews": 103, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Microsoft_Small_Basic" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "microtal": { "title": "microTAL", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f3814441341f11959be4dace48c4f4a86bdbf816" ], "country": [ "United States" ], "originCommunity": [ "Tandem Computers Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=963", "centralPackageRepositoryCount": 0 }, "midas": { "title": "Modified Integration Digital Analog Simulator", "appeared": 1963, "type": "pl", "reference": [ "https://www.computer.org/csdl/proceedings/afips/1964/5065/00/50650313.pdf", "https://www.semanticscholar.org/paper/MIDAS%3A-how-it-works-and-how-it%27s-worked-Petersen-Sansom/fa3147f8a8062201b9372276cd6005122b6340bd", "https://dl.acm.org/doi/pdf/10.1145/1464052.1464078" ], "standsFor": "Modified Integration Digital Analog Simulator", "country": [ "United States" ], "originCommunity": [ "Wright-Patterson Air Force Base" ], "hopl": "https://hopl.info/showlanguage.prx?exp=439", "fileType": "text", "centralPackageRepositoryCount": 0 }, "miis": { "title": "Meditech Interpretive Information System", "appeared": 1986, "type": "pl", "standsFor": "Meditech Interpretive Information System", "country": [ "United States" ], "originCommunity": [ "Massachusetts General Hospital" ], "wikipedia": { "related": [ "mumps" ], "summary": "MIIS (Meditech Interpretive Information System) is a MUMPS-like programming language that was created by A.Neil Pappalardo and Curt W. Marble, on a DEC PDP at Mass General Hospital from 1964 to 1968. MUMPS evolution took two major directions: MUMPS proper and MIIS. MUMPS became an ANSI and ISO-standard language. When many MUMPS implementations standardized to be compatible, MIIS did not standardize, but became a proprietary system instead. As an example of the differences between MUMPS and MIIS, the value of a logical expression in MUMPS may be false = zero (0) or true = non-zero, canonically, one (1). In MIIS, the value false is the empty string and the value of true is a string consisting of the ASCII delete character (code 127 decimal). There is also a philosophical difference between the dialects. MIIS often takes the approach that code should march along, regardless of possible errors, where MUMPS will error out to prevent more serious problems. For example, when encountering an undefined variable, MUMPS generates an error where MIIS treats it as nil. In the 1980s Brigham and Women's Hospital in Massachusetts used MIIS to program their Data General Mainframe. In 1986, SCAMC reported that Vancouver General Hospital also had an Integrated Cardiology Patient Management System written in MIIS. The MIIS language has been used in programming library systems as well as health industry systems. The OCLC's library system is one example. It has also been used to create financial systems for insurance brokers, as seen in Ireland and the UK in the late 1970s.", "pageId": 3359079, "created": 2005, "backlinksCount": 12, "revisionCount": 30, "dailyPageViews": 10, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/MIIS_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5919", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "mike": { "title": "MiKe", "appeared": 2022, "type": "pl", "description": "Introducing MiKe: Constant-time control flow, automatic serialization, and more!", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wrqs5w/introducing_mike_constanttime_control_flow/", "https://blog.necode.org/posts/introducing-mike" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/TheUnlocked/mike-language/issues" ] }, "mime": { "title": "MIME", "appeared": 1991, "type": "textDataFormat", "creators": [ "Nathaniel Borenstein", "Ned Freed" ], "documentation": [ "https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/MIME_types" ], "standsFor": "Multipurpose Internet Mail Extensions", "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "example": [ "MIME-Version: 1.0\nContent-Type: multipart/mixed; boundary=frontier\n\nThis is a message with multiple parts in MIME format.\n--frontier\nContent-Type: text/plain\n\nThis is the body of the message.\n--frontier\nContent-Type: application/octet-stream\nContent-Transfer-Encoding: base64\n\nPGh0bWw+CiAgPGhlYWQ+CiAgPC9oZWFkPgogIDxib2R5PgogICAgPHA+VGhpcyBpcyB0aGUg\nYm9keSBvZiB0aGUgbWVzc2FnZS48L3A+CiAgPC9ib2R5Pgo8L2h0bWw+Cg==\n--frontier--" ], "wikipedia": { "example": [ "MIME-Version: 1.0\nContent-Type: multipart/mixed; boundary=frontier\n\nThis is a message with multiple parts in MIME format.\n--frontier\nContent-Type: text/plain\n\nThis is the body of the message.\n--frontier\nContent-Type: application/octet-stream\nContent-Transfer-Encoding: base64\n\nPGh0bWw+CiAgPGhlYWQ+CiAgPC9oZWFkPgogIDxib2R5PgogICAgPHA+VGhpcyBpcyB0aGUg\nYm9keSBvZiB0aGUgbWVzc2FnZS48L3A+CiAgPC9ib2R5Pgo8L2h0bWw+Cg==\n--frontier--" ], "related": [ "ftp", "http", "smtp", "tls", "tcp", "udp", "ascii", "rfc", "html" ], "summary": "Multipurpose Internet Mail Extensions (MIME) is an Internet standard that extends the format of email to support: Text in character sets other than ASCII Non-text attachments: audio, video, images, application programs etc. Message bodies with multiple parts Header information in non-ASCII character setsVirtually all human-written Internet email and a fairly large proportion of automated email is transmitted via SMTP in MIME format.MIME is specified in six linked RFC memoranda: RFC 2045, RFC 2046, RFC 2047, RFC 4288, RFC 4289 and RFC 2049; with the integration with SMTP email specified in detail in RFC 1521 and RFC 1522. Although MIME was designed mainly for SMTP, the content types defined by MIME standards are also of importance in communication protocols outside of email, such as HTTP for the World Wide Web. Servers insert the MIME header at the beginning of any Web transmission. Clients use this content type or media type header to select an appropriate viewer application for the type of data the header indicates. Some of these viewers are built into the Web client or browser (for example, almost all browsers come with GIF and JPEG image viewers as well as the ability to handle HTML files).", "pageId": 19045, "created": 2001, "backlinksCount": 468, "revisionCount": 1106, "dailyPageViews": 872, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/MIME" }, "pygmentsHighlighter": { "filename": "mime.py", "id": "MIME" }, "indeedJobs": { "2022": 1, "query": "MIME developer" }, "fileType": "text", "wordRank": 9190, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1986|Meriwether Pub|Mime Ministry: An illustrated, easy-to-follow guidebook for organizing, programming and training a troupe of Christian mimes|Susan Kelly Toomey|9780916260378", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Economical, energy efficient and portable home security system based on Raspberry Pi 3 using the concepts of OpenCV and MIME|10.1109/CCUBE.2017.8394155|3|0|D. Abhilash and C. Chandrashekar and S. Shalini|f311d128ad24c42e0537a00abfeaf5ea142297d8" }, "mimic": { "title": "MIMIC", "appeared": 1964, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Wright-Patterson Air Force Base" ], "wikipedia": { "example": [ "Card columns\n0 1 2 3 4 5 6 7\n12345678901234567890123456789012345678901234567890123456789012345678901\n-----------------------------------------------------------------------\n* A SIMPLE PREDATOR-PREY MODEL FROM MARINE BIOLOGY\n/ (TUTORIAL 2: NUMERICAL SOLUTION OF ODE'S - 19/08/02)\n/ ENVIRONMENTAL FLUID MECHANICS LAB\n/ DEPT OF CIVIL AND ENVIRONMENTAL ENGINEERİNG\n/ STANFORD UNIVERSITY\n*\n* LOTKA–VOLTERRA EQUATION\n CON(F0,S0,TMAX)\n CON(ALPHA,BETA,GAMMA,EPS)\n 1DF = ALPHA*F-BETA*F*S\n F = INT(1DF,F0)\n 1DS = EPS*BETA*F*S-GAMMA*S\n S = INT(1DS,S0)\n HDR(TIME,FISH,SHARK)\n OUT(T,F,S)\n PLO(F,S)\n FIN(T,TMAX)\n END\n\n600. 50. 50.\n0.7 0.007 0.5 0.1\n" ], "summary": "MIMIC, known in capitalized form only, is a former simulation computer language developed 1964 by H. E. Petersen, F. J. Sansom and L. M. Warshawsky of Systems Engineering Group within the Air Force Materiel Command at the Wright-Patterson AFB in Dayton, Ohio, United States. It is an expression-oriented continuous block simulation language, but capable of incorporating blocks of FORTRAN-like algebra. MIMIC is a further development from MIDAS (Modified Integration Digital Analog Simulator), which represented analog computer design. Written completely in FORTRAN but one routine in COMPASS, and ran on Control Data supercomputers, MIMIC is capable of solving much larger simulation models. With MIMIC, ordinary differential equations describing mathematical models in several scientific disciplines as in engineering, physics, chemistry, biology, economics and as well as in social sciences can easily be solved by numerical integration and the results of the analysis are listed or drawn in diagrams. It also enables the analysis of nonlinear dynamic conditions. The MIMIC software package, written as FORTRAN overlay programs, executes input statements of the mathematical model in six consecutive passes. Simulation programs written in MIMIC are compiled rather than interpreted. The core of the simulation package is a variable step numerical integrator of fourth-order Runge-Kutta method. Many useful functions related to electrical circuit elements exist besides some mathematical functions found in most scientific programming languages. There is no need to sort the statements in order of dependencies of the variables, since MIMIC does it internally. Parts of the software organized in overlays are: MIMIN (input)– reads in user simulation program and data, MIMCO (compiler) – compiles the user program and creates an in-core array of instructions, MIMSO (sort)– sorts the instructions array after dependencies of variables, MIMAS (assembler) – converts the BCD instructions into machine-oriented code, MIMEX (execute)– executes the user program by integrating, MIMOUT (output)– puts out the data as a list or diagram of data.", "pageId": 4017688, "created": 2006, "backlinksCount": 15, "revisionCount": 40, "dailyPageViews": 14, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/MIMIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=294", "fileType": "text", "centralPackageRepositoryCount": 0 }, "mimium": { "title": "mimium", "appeared": 2019, "type": "pl", "creators": [ "Tomoya Matsuura" ], "description": "mimium (MInimal Musical medIUM) a programming language as an infrastructure for sound and music.", "website": "https://mimium.org", "reference": [ "https://dblp.org/rec/conf/icfp/MatsuuraJ21" ], "country": [ "Japan" ], "originCommunity": [ "Kyushu University" ], "domainName": { "registered": 2020, "name": "mimium.org" }, "example": [ "// A minimal example below generates a sinewave of 440Hz:\n// minimal.mmm\ntwopi = 3.141595*2\nsr = 48000\nfn dsp(){\n out = sin(now * 440 * twopi / sr)\n return (out,out)\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 251, "forks": 7, "subscribers": 8, "created": 2020, "updated": 2022, "description": "mimium (MInimal Musical medIUM) a programming language as an infrastructure for sound and music.", "issues": 7, "url": "https://github.com/mimium-org/mimium" }, "repoStats": { "firstCommit": 2019, "commits": 1167, "committers": 9, "files": 229 }, "twitter": "https://twitter.com/mimium-org" }, "mimix-stream-language": { "title": "mimix-stream-language", "appeared": 2018, "type": "pl", "creators": [ "Rommel MARTINEZ" ], "description": "MSL is built from Lisp style s-expressions. MSL differs from Lisp in the way it processes functions and arguments, so Lisp expressions cannot be directly included inside MSL nor vice-versa. MSL code can only contain other MSL.", "website": "https://mimix.io/dev/msl", "reference": [ "https://mimix.io/wp-content/uploads/2020/01/MSL-Specifications-2020.pdf" ], "aka": [ "msl" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/themimixcompany" ], "example": [ "(@lonely-planet Lonely Planet (@Hawaii)\n(@intro The goddess (@Pele) …)\n(@chapter 1 (@p1 When the ancient (@Hawaii Hawaiians)…) (@p2 ...))\n(@chapter 2 …)))" ], "githubRepo": { "firstCommit": 2019, "stars": 1, "forks": 0, "subscribers": 3, "created": 2019, "updated": 2021, "description": "MSL Engine", "issues": 0, "url": "https://github.com/themimixcompany/msl-engine" }, "repoStats": { "firstCommit": 2019, "commits": 1371, "committers": 2, "files": 36 } }, "min": { "title": "min", "appeared": 2017, "type": "pl", "website": "https://min-lang.org/", "country": [ "Italy" ], "originCommunity": [ "https://github.com/h3rald/min/issues" ], "domainName": { "registered": 2017, "name": "min-lang.org" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n14886936|Show HN: Min programming language|2017-07-30 17:29:44 UTC|1501435784|h3rald|2|7" }, "minc": { "title": "MINC", "appeared": 1985, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Princeton University" ], "wikipedia": { "related": [ "c", "perl", "python", "tcl" ], "summary": "MINC (\"MINC is not C\") is a data specification language written in the mid-1980s by a Princeton University graduate student named Lars Graf. This kind of naming is known as a \"recursive acronym\". It contains many (though not all) of the syntactical capabilities of the C programming language, and can be used to implement simple procedural programs that can be executed by a runtime parser (that is to say, MINC does not need to be compiled in any way). MINC continues to be used only in a handful of programs written in the 1980s (e.g. Real-Time Cmix). It has been for all intents and purposes superseded by modern scripting languages such as Perl, Python, and Tcl. A controversial aspect of the language is whether it is pronounced \"mink\" or \"min-see\".", "created": 2004, "backlinksCount": 6, "pageId": 479897, "revisionCount": 31, "dailyPageViews": 3, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/MINC" }, "centralPackageRepositoryCount": 0 }, "mini-ml": { "title": "Mini-ML", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/398d7e9c1aced07a508a45bbf269cc349569a6dc" ], "country": [ "United States" ], "originCommunity": [ "SKEMA Business School - Sophia Antipolis", "Institut national de recherche en sciences et technologies du numérique, Sophia Antipolis" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1239", "centralPackageRepositoryCount": 0 }, "minid": { "title": "MiniD", "appeared": 2006, "type": "pl", "creators": [ "Jarrett Billingsley" ], "website": "http://www.dsource.org/projects/minid", "renamedTo": [ "croc" ], "country": [ "United States" ], "originCommunity": [ "http://www.dsource.org/projects/minid" ], "related": [ "croc" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasHexadecimals": { "example": "// 0[xX][0-9a-fA-F][0-9a-fA-F_]*", "value": true }, "hasFloats": { "example": "// ([0-9][0-9_]*)(?=[.eE])(\\.[0-9][0-9_]*)?([eE][+\\-]?[0-9_]+)?", "value": true }, "hasIntegers": { "example": "// ([0-9][0-9_]*)(?![.eE])", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01][01_]*", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "example": [ "module matrix\n\nlocal SIZE = 30\n\nfunction mkmatrix(rows, cols)\n{\n local count = 1\n local m = array.new(rows)\n\n for(i: 0 .. rows)\n {\n m[i] = array.new(cols)\n\n for(j: 0 .. cols)\n {\n ++count\n m[i][j] = count\n }\n }\n\n return m\n}\n\nfunction mmult(rows, cols, m1, m2, m3)\n{\n for(i: 0 .. rows)\n {\n for(j: 0 .. cols)\n {\n local val = 0\n\n for(k: 0 .. cols)\n val += m1[i][k] * m2[k][j]\n\n m3[i][j] = val\n }\n }\n\n return m3\n}\n\nfunction main(N)\n{\n local n = 1\n\n if(isString(N))\n n = toInt(N)\n\n local m1 = mkmatrix(SIZE, SIZE)\n local m2 = mkmatrix(SIZE, SIZE)\n local mm = mkmatrix(SIZE, SIZE)\n\n for(i: 0 .. n)\n mmult(SIZE, SIZE, m1, m2, mm)\n\n writefln(mm[0][0], \" \", mm[2][3], \" \", mm[3][2], \" \", mm[4][4])\n}" ], "wikipedia": { "example": [ "function first(x: array|string) = x[0]\n\n writeln(first([1, 2, 3])) // prints 1\n writeln(first(\"hello\")) // prints h\n writeln(first(45)) // error, invalid parameter type 'int'" ], "related": [ "d", "lua", "squirrel", "python", "io", "ecmascript", "c" ], "summary": "The MiniD (has been renamed Croc) programming language is a small, lightweight, extension language in the vein of Lua or Squirrel, but designed to be used mainly with the D programming language. It supports both object-oriented and imperative programming paradigms, as well as some simple functional aspects. Distributed under the licence of zlib/libpng, MiniD is free software.", "pageId": 10965409, "created": 2007, "backlinksCount": 8, "revisionCount": 39, "dailyPageViews": 13, "appeared": 2006, "url": "https://web.archive.org/web/20190311032913/https://en.wikipedia.org/wiki/MiniD" }, "githubLanguage": { "fileExtensions": [ "minid" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 0, "id": "MiniD" }, "pygmentsHighlighter": { "filename": "d.py", "id": "MiniD" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "minidsdb": { "title": "Mindsdb", "appeared": 2018, "type": "application", "description": "MindsDB ML-SQL Server enables machine learning workflows for the most powerful databases and data warehouses using SQL.", "website": "https://mindsdb.com/", "documentation": [ "https://docs.mindsdb.com/" ], "originCommunity": [ "https://mindsdb.com/community" ], "domainName": { "name": "mindsdb.com" }, "writtenIn": [ "python" ], "related": [ "python", "sql" ], "githubRepo": { "stars": 13112, "forks": 1496, "subscribers": 340, "created": 2018, "updated": 2023, "description": "In-Database Machine Learning", "issues": 334, "url": "https://github.com/mindsdb/mindsdb/" } }, "minihaskell": { "title": "minihaskell", "appeared": 2013, "type": "plzoo", "description": "lazy, functional, integers, booleans, lists, recursion, statically typed", "website": "http://plzoo.andrej.com/language/minihaskell.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "centralPackageRepositoryCount": 0 }, "minikanren": { "title": "minikanren", "appeared": 2013, "type": "pl", "website": "http://minikanren.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/miniKanren" ], "domainName": { "awisRank": { "2022": 6730355 }, "name": "minikanren.org" }, "githubRepo": { "firstCommit": 2013, "stars": 338, "forks": 30, "subscribers": 16, "created": 2013, "updated": 2022, "description": "Canonical miniKanren implementation", "issues": 4, "url": "https://github.com/miniKanren/miniKanren" }, "repoStats": { "firstCommit": 2013, "commits": 7, "committers": 4, "files": 16 }, "twitter": "https://twitter.com/minikanren", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "minilang": { "title": "Minilang", "appeared": 2016, "type": "interpreter", "creators": [ "Raja Mukherji" ], "website": "https://minilang.readthedocs.io", "country": [ "Ireland" ], "originCommunity": [ "https://github.com/wrapl" ], "githubRepo": { "firstCommit": 2017, "stars": 23, "forks": 1, "subscribers": 3, "created": 2017, "updated": 2022, "description": "A mini language used for the Rabs build system and within Wrapl.", "issues": 0, "url": "https://github.com/wrapl/minilang" } }, "miniml-error": { "title": "miniML_error", "appeared": 2013, "type": "plzoo", "description": "like miniml that can also abort execution", "website": "http://plzoo.andrej.com/language/miniml_error.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "githubRepo": { "stars": 1261, "forks": 68, "subscribers": 50, "created": 2013, "updated": 2022, "description": "Programming Languages Zoo", "issues": 10, "url": "https://github.com/andrejbauer/plzoo/tree/master/src/miniml_error" }, "centralPackageRepositoryCount": 0 }, "miniml": { "title": "miniml", "appeared": 2013, "type": "plzoo", "description": "eager, functional, recursive functions, statically typed, compiler, abstract machine", "website": "http://plzoo.andrej.com/language/miniml.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "tryItOnline": "miniml", "centralPackageRepositoryCount": 0 }, "minion": { "title": "MINION", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bef694cc65362f2d2f5268d8316ae41750d7f182" ], "country": [ "United States" ], "originCommunity": [ "University of Maryland" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7206", "centralPackageRepositoryCount": 0 }, "miniprolog": { "title": "miniprolog", "appeared": 2013, "type": "plzoo", "description": "logic programming, Horn clauses, unification", "website": "http://plzoo.andrej.com/language/miniprolog.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "University of Ljubljana" ], "centralPackageRepositoryCount": 0 }, "minivital": { "title": "MINIVITAL", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a999901289abce1fce15c39a67b1edf77a34201e" ], "country": [ "United States" ], "originCommunity": [ "Palyn Associates", "R.L.G. Associates" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3673", "centralPackageRepositoryCount": 0 }, "minizinc": { "title": "MiniZinc", "appeared": 2012, "type": "pl", "website": "http://www.minizinc.org/", "country": [ "Australia" ], "originCommunity": [ "Monash University" ], "domainName": { "awisRank": { "2022": 8165783 }, "name": "minizinc.org" }, "githubRepo": { "firstCommit": 2012, "stars": 393, "forks": 67, "subscribers": 38, "created": 2015, "updated": 2022, "description": "The MiniZinc compiler", "issues": 59, "url": "https://github.com/MiniZinc/libminizinc" }, "repoStats": { "firstCommit": 2012, "commits": 6766, "committers": 56, "files": 2399 }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MiniZinc", "quineRelay": "MiniZinc", "rijuRepl": { "example": [ "solve satisfy;\n\noutput [\"Hello, world!\\n\"];\n" ], "id": "https://riju.codes/minizinc" }, "twitter": "https://twitter.com/minizinc", "ubuntuPackage": "minizinc", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2020|Springer|Building Decision Support Systems: Using Minizinc|Wallace, Mark|9783030417314" }, "minopt": { "title": "MINOPT", "appeared": 1998, "type": "pl", "reference": [ "https://titan.princeton.edu/MINOPT/" ], "country": [ "United States" ], "originCommunity": [ "Princeton University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4944", "centralPackageRepositoryCount": 0 }, "mint": { "title": "mint", "appeared": 2018, "type": "pl", "website": "https://www.mint-lang.com", "country": [ "Poland and Hungary and United States" ], "originCommunity": [ "https://github.com/mint-lang" ], "domainName": { "registered": 2018, "awisRank": { "2022": 3066082 }, "name": "mint-lang.com" }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "githubLanguage": { "type": "programming", "fileExtensions": [ "mint" ], "aceMode": "text", "tmScope": "source.mint", "repos": 19, "id": "Mint" }, "leachim6": { "filepath": "m/Mint.mint", "fileExtensions": [ "mint" ], "example": [ "component Main {\n fun render : Html {\n
\"Hello World\"
\n }\n}\n" ], "id": "Mint" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n17161533|Mint-lang: a language for the front-end web|https://www.mint-lang.com/|2018-05-26 11:47:36 UTC|1527335256|galfarragem|106|112", "twitter": "https://twitter.com/mint_lang" }, "mips": { "title": "MIPS architecture", "appeared": 1985, "type": "isa", "documentation": [ "https://www.mips.com/products/architectures/mips32-2/" ], "originCommunity": [ "MIPS Technologies", "Imagination Technologies" ], "hasStrings": { "example": "", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasMultiLineComments": { "example": "### A comment\n###", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "###" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ ".data", ".text", "syscall", "trap", "add", "addu", "addi", "addiu", "and", "andi", "div", "divu", "mult", "multu", "nor", "or", "ori", "sll", "slv", "sra", "srav", "srl", "srlv", "sub", "subu", "xor", "xori", "lhi", "lho", "lhi", "llo", "slt", "slti", "sltu", "sltiu", "beq", "bgtz", "blez", "bne", "j", "jal", "jalr", "jr", "lb", "lbu", "lh", "lhu", "lw", "li", "la", "sb", "sh", "sw", "mfhi", "mflo", "mthi", "mtlo", "move" ], "wikipedia": { "summary": "MIPS is a reduced instruction set computer (RISC) instruction set architecture (ISA) developed by MIPS Technologies (formerly MIPS Computer Systems). The early MIPS architectures were 32-bit, with 64-bit versions added later. There are multiple versions of MIPS: including MIPS I, II, III, IV, and V; as well as five releases of MIPS32/64 (for 32- and 64-bit implementations, respectively). As of April 2017, the current version is MIPS32/64 Release 6. MIPS32/64 primarily differs from MIPS I–V by defining the privileged kernel mode System Control Coprocessor in addition to the user mode architecture. Several optional extensions are also available, including MIPS-3D which is a simple set of floating-point SIMD instructions dedicated to common 3D tasks, MDMX (MaDMaX) which is a more extensive integer SIMD instruction set using the 64-bit floating-point registers, MIPS16e which adds compression to the instruction stream to make programs take up less room, and MIPS MT, which adds multithreading capability. Computer architecture courses in universities and technical schools often study the MIPS architecture. The architecture greatly influenced later RISC architectures such as Alpha. As of April 2017, MIPS processors are used in embedded systems such as residential gateways and routers. Originally, MIPS was designed for general-purpose computing, and during the 1980s and 1990s, MIPS processors for personal, workstation, and server computers were used by many companies such as Digital Equipment Corporation, MIPS Computer Systems, NEC, Pyramid Technology, SiCortex, Siemens Nixdorf, Silicon Graphics, and Tandem Computers. Historically, video game consoles such as the Nintendo 64, Sony PlayStation, PlayStation 2 and PlayStation Portable use MIPS processors. MIPS processors also used to be popular in supercomputers during the 1990s, but all such systems have dropped off the TOP500 list. These uses were complemented by embedded applications at first, but during the 1990s, MIPS became a major presence in the embedded processor market, and by the 2000s, most MIPS processors were for these applications. In the mid- to late-1990s, it was estimated that one in three RISC microprocessors produced was a MIPS processor. MIPS is a modular architecture supporting up to four coprocessors (CP0/1/2/3). In MIPS terminology, CP0 is the System Control Coprocessor (an essential part of the processor that is implementation-defined in MIPS I–V), CP1 is an optional floating-point unit (FPU) and CP2/3 are optional implementation-defined coprocessors (MIPS III removed CP3 and reused its opcodes for other purposes). For example, in the PlayStation video game console, CP2 is the Geometry Transformation Engine (GTE), which accelerates the processing of geometry in 3D computer graphics.", "pageId": 20170, "dailyPageViews": 1025, "created": 2001, "backlinksCount": 1013, "revisionCount": 1553, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/MIPS_architecture" }, "monaco": "mips", "leachim6": { "filepath": "m/Mips.s", "fileExtensions": [ "s" ], "example": [ ".data\nhello_world: .asciiz \"Hello World\"\n\n.text\nmain:\n li $v0, 4 # Load syscommand print_string\n la $a0, hello_world # Load hello_world string into register $a0\n syscall # Print the string\n jr $ra # Return\n" ], "id": "Mips" }, "rijuRepl": { "example": [ "\t.text\n\t.global main\nmain:\n\tli $v0, 5001\n\tli $a0, 1\n\tdla $a1, message\n\tli $a2, 14\n\tsyscall\n\tli $v0, 5058\n\tli $a0, 0\n\tsyscall\n\t.data\nmessage:\n\t.string \"Hello, world!\\n\"" ], "id": "https://riju.codes/mips" }, "indeedJobs": { "2022": 12, "query": "mips engineer" }, "fileType": "na", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "mir": { "title": "mir", "appeared": 2015, "type": "ir", "description": "MIR is a human readable serialization format that is used to represent LLVM’s machine specific intermediate representation. The MIR serialization format uses a YAML container.", "website": "http://llvm.org/docs/MIRLangRef.html", "country": [ "United States" ], "originCommunity": [ "LLVM Foundation" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "mirager": { "title": "MIRAGER", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/adadcaa765af5b219960c8e3bedc56c6a7eb5e85" ], "country": [ "United States" ], "originCommunity": [ "Argonne National Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7378", "centralPackageRepositoryCount": 0 }, "mirah": { "title": "Mirah", "appeared": 2009, "type": "pl", "creators": [ "Charles Oliver Nutter" ], "website": "http://www.mirah.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/mirah" ], "domainName": { "registered": 2010, "name": "mirah.org" }, "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "example": [ "def foo(a:String, b:int)" ], "githubRepo": { "firstCommit": 2008, "stars": 870, "forks": 63, "subscribers": 40, "created": 2010, "updated": 2022, "description": "The Mirah Programming Language", "issues": 140, "url": "https://github.com/mirah/mirah" }, "repoStats": { "firstCommit": 2008, "commits": 2858, "committers": 54, "files": 533 }, "wikipedia": { "example": [ "def fib(a:int)\n if a < 2\n a\n else\n fib(a - 1) + fib(a - 2)\n end\nend" ], "related": [ "jvm", "ruby", "java", "boo", "java-bytecode", "jruby", "csharp", "rails", "erb" ], "summary": "Mirah (formerly Duby) is a programming language based on Ruby language syntax, local type inference, hybrid static–dynamic type system, and a pluggable compiler toolchain. Mirah was created by Charles Oliver Nutter to be \"a 'Ruby-like' language, probably a subset of Ruby syntax, that [could] compile to solid, fast, idiomatic JVM bytecode.\" The word mirah refers to the gemstone ruby in the Javanese language, a play on the concept of Ruby in Java.", "pageId": 27970668, "created": 2010, "backlinksCount": 15, "revisionCount": 63, "dailyPageViews": 12, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Mirah_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "druby", "duby", "mirah" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "ruby", "codemirrorMode": "ruby", "codemirrorMimeType": "text/x-ruby", "tmScope": "source.ruby", "repos": 68, "id": "Mirah" }, "githubBigQuery": { "repos": 43, "users": 32, "id": "Mirah" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 76, "commitCount": 458, "url": "https://github.com/atom/language-ruby" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Mirah", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011||Mirah (programming Language)|Nethanel Willy|9786136789286" }, "miranda": { "title": "Miranda", "appeared": 1985, "type": "pl", "creators": [ "David Turner" ], "country": [ "United Kingdom" ], "originCommunity": [ "Research Software Ltd" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Stdout" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "> || The infinite list of all prime numbers.\n\nThe list of potential prime numbers starts as all integers from 2 onwards;\nas each prime is returned, all the following numbers that can exactly be\ndivided by it are filtered out of the list of candidates.\n\n> primes = sieve [2..]\n> sieve (p:x) = p : sieve [n | n <- x; n mod p ~= 0]" ], "related": [ "krc", "ml", "hope", "clean", "haskell", "c", "unix", "iswim", "occam", "python", "pascal" ], "summary": "Miranda is a lazy, purely functional programming language designed by David Turner as a successor to his earlier programming languages SASL and KRC, using some concepts from ML and Hope. It was produced by Research Software Ltd. of England (which holds a trademark on the name Miranda) and was the first purely functional language to be commercially supported.Miranda was first released in 1985, as a fast interpreter in C for Unix-flavour operating systems, with subsequent releases in 1987 and 1989. Miranda had a strong influence on the later Haskell programming language.", "pageId": 93267, "created": 2002, "backlinksCount": 47, "revisionCount": 140, "dailyPageViews": 56, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Miranda_(programming_language)" }, "leachim6": { "filepath": "m/Miranda.m", "fileExtensions": [ "m" ], "example": [ "main :: [sys_message]\nmain = [Stdout \"Hello World\"]\n" ], "id": "Miranda" }, "rijuRepl": { "example": [ "main = [Stdout \"Hello, world!\"]\n" ], "description": "Pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6", "fileExtensions": [ "m" ], "website": "https://www.cs.kent.ac.uk/people/staff/dat/miranda/", "gitRepo": "https://www.cs.kent.ac.uk/people/staff/dat/miranda/downloads/", "id": "https://riju.codes/miranda" }, "hopl": "https://hopl.info/showlanguage.prx?exp=911", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1991-09-20T00:00:01Z|Taylor & Francis Books Ltd|Functional Programming with Miranda|Hoyler, Ian|9780273034537\n1995|Prentice Hall|Programming With Miranda|Clack, Chris and Myers, Colin and Poon, Ellen|9780131925922", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1986|An overview of Miranda|10.1145/15042.15053|247|19|D. Turner|35306f7f53096a62cc087655f6f6e1e21d5100ac\n1986|Laws in Miranda|10.1145/319838.319839|35|1|S. Thompson|ff17127456c7e6156c744d0b7df8c60f9e150ba3\n1993|Using Miranda as a first programming language|10.1017/S0956796800000575|20|3|Tim Lambert and P. Lindsay and K. Robinson|216f9a40d8dfe5d8c775a3e5fe17972ecc7fb1b3\n1994|A visual Miranda machine|10.1109/SEDC.1994.475337|14|3|M. Auguston and J. Reinfelds|57a92013fe97eab9d2fcdab1c94ae1b2cf640d0f\n1989|A logic for Miranda|10.1007/BF01887213|12|0|S. Thompson|f24a5b82c29d8e207368c9e1533fdf5ff953fd29\n1991|Using XView/X11 from Miranda|10.1007/978-1-4471-3196-0_30|7|0|Satnam Singh|6f11dc39c5a2eafae616c00be5f44e596bc8eecd\n1996|SNACC: a parser generator for use with Miranda|10.1145/331119.331416|2|0|D. Turner|3f44c9986b64c301c4014527782743a052d10196" }, "miranim": { "title": "Miranim", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b724aa832b6db1512348f07581b08bc0274fafd1" ], "country": [ "Canada" ], "originCommunity": [ "Université de Montreal" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4144", "centralPackageRepositoryCount": 0 }, "mirc": { "title": "MIRC scripting language", "appeared": 1995, "type": "pl", "creators": [ "Khaled Mardam-Bey" ], "website": "http://mirc.com/", "country": [ "Great Britain" ], "originCommunity": [ "https://www.mirc.com" ], "domainName": { "registered": 1997, "awisRank": { "2022": 198825 }, "name": "mirc.com" }, "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "echo" ] ], "wikipedia": { "example": [ ";Placed in a remote script\n\n;When a user types Hello! in a channel,\n;you answer back: Hello, [nickname]!\n\non *:TEXT:Hello!:#:{ msg $chan Hello, $nick $+ ! }\n\n;When a user types Hello! in a private message,\n;you answer back: Hello, [nickname]!\n\non *:TEXT:Hello!:?: { msg $nick Hello, $nick $+ ! }\n\n;Here is a script which automatically gives voice to a user\n;who joins a particular channel (The Bot or user should have HOP)\n\non *:JOIN:#?: { mode $chan +v $nick }\n\n;A bad word script\n\non *:Text:die*:#: { .mode $chan +b $nick | kick $chan $nick Dont say that again }" ], "related": [ "ini" ], "summary": "The mIRC scripting language, often unofficially abbreviated to \"mSL\", is the scripting language embedded in mIRC, an IRC client for Windows.", "pageId": 310996, "dailyPageViews": 37, "created": 2003, "backlinksCount": 69, "revisionCount": 313, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/MIRC_scripting_language" }, "codeMirror": "mirc", "leachim6": { "filepath": "m/Mirc.mrc", "fileExtensions": [ "mrc" ], "example": [ "echo -a Hello World\n" ], "id": "Mirc" }, "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "" }, "mirfac": { "title": "MIRFAC", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/059ae55b9e60fdf6fa7f3d76afabcdb655db8607" ], "country": [ "United Kingdom" ], "originCommunity": [ "Royal Armament Research" ], "hopl": "https://hopl.info/showlanguage.prx?exp=440", "centralPackageRepositoryCount": 0 }, "mirth": { "title": "mirth", "appeared": 2019, "type": "pl", "country": [ "Switzerland and United States" ], "originCommunity": [ "https://github.com/mirth-lang" ], "githubRepo": { "firstCommit": 2019, "stars": 405, "forks": 11, "subscribers": 31, "created": 2019, "updated": 2022, "description": "Compiler for the Mirth programming language.", "issues": 1, "url": "https://github.com/mirth-lang/mirth" }, "repoStats": { "firstCommit": 2019, "commits": 419, "committers": 8, "files": 91 } }, "miso-framework": { "title": "miso-framework", "appeared": 2016, "type": "framework", "website": "https://haskell-miso.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/dmjio/miso/issues" ], "domainName": { "registered": 2016, "name": "haskell-miso.org" } }, "miva": { "title": "Miva", "appeared": 1996, "type": "pl", "website": "http://www.mivascript.com", "fileExtensions": [ "mv", "mvc", "mvt" ], "country": [ "United States" ], "originCommunity": [ "Miva Merchant, Inc" ], "domainName": { "registered": 2008, "name": "mivascript.com" }, "wikipedia": { "related": [ "c", "perl", "java", "xml", "dbase", "mysql" ], "summary": "Miva Script is a proprietary computer scripting language mainly used for internet applications such as e-commerce. As of 2015, it is developed, maintained and owned by Miva Merchant, Inc., based in San Diego, California. Many web hosting companies support Miva Script on their servers, but it is significantly less widespread than other popular web languages.", "pageId": 849448, "dailyPageViews": 12, "created": 2004, "backlinksCount": 14, "revisionCount": 134, "appeared": 1993, "fileExtensions": [ "mv", "mvc", "mvt" ], "url": "https://en.wikipedia.org/wiki/MIVA_Script" }, "tiobe": { "id": "Miva" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMiva Script Programming|2002|Keith Hunniford|21176080|0.0|0|0\nDeveloper's Guide to Miva Merchant [With CDROM]||Michael Brock|21176066|0.0|0|0" }, "mizar": { "title": "Mizar", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4393b874f1ca7cfc3280629e58de965911e2defd" ], "country": [ "Canada" ], "originCommunity": [ "University of Alberta" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5810", "centralPackageRepositoryCount": 0 }, "ml": { "title": "ML", "appeared": 1973, "type": "pl", "creators": [ "Robin Milner" ], "documentation": [ "http://www.cs.cmu.edu/~rwh/isml/book.pdf", "https://www.cs.nmsu.edu/~rth/cs/cs471/sml.html" ], "standsFor": "Meta Language", "country": [ "United Kingdom" ], "originCommunity": [ "University of Edinburgh" ], "hasGarbageCollection": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "assignmentToken": [ [ ":=" ] ], "wikipedia": { "example": [ "structure Rational : ARITH =\nstruct\n datatype t = Rat of int * int;\n val zero = Rat(0,1);\n fun succ(Rat(a,b)) = Rat( a+b , b );\n fun sum (Rat(a,b), Rat(c,d)) = Rat(a*d+ c*b , b*d) : t ;\nend" ], "related": [ "standard-ml", "caml", "iswim", "clojure", "coq", "cyclone", "elm", "f-sharp", "fstar", "haskell", "idris", "miranda", "nemerle", "ocaml", "opa", "erlang", "rust", "scala", "lisp", "ats", "alice", "dependent-ml", "lazyml", "clean" ], "summary": "ML ('Meta Language') is a general-purpose functional programming language. It has roots in Lisp, and has been characterized as \"Lisp with types\". It is known for its use of the polymorphic Hindley–Milner type system, which automatically assigns the types of most expressions without requiring explicit type annotations, and ensures type safety – there is a formal proof that a well-typed ML program does not cause runtime type errors. ML provides pattern matching for function arguments, garbage collection, imperative programming, call-by-value and currying. It is used heavily in programming language research and is one of the few languages to be completely specified and verified using formal semantics. Its types and pattern matching make it well-suited and commonly used to operate on other formal languages, such as in compiler writing, automated theorem proving and formal verification.", "pageId": 20607, "dailyPageViews": 541, "created": 2001, "backlinksCount": 214, "revisionCount": 449, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/ML_(programming_language)" }, "projectEuler": { "memberCount": { "2019": 435, "2022": 427 }, "id": "ML" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ML", "indeedJobs": { "2022": 6, "query": "ml engineer" }, "faqPageUrl": [ "http://www.faqs.org/faqs/meta-lang-faq/" ], "tiobe": { "id": "ML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=620", "fileType": "text", "wordRank": 3710, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1998|Pearson|Elements of ML Programming, ML97 Edition|Ullman, Jeffrey|9780137903870\n2019|BPB Publications|AI & ML - Powering the Agents of Automation: Demystifying, IOT, Robots, ChatBots, RPA, Drones & Autonomous Cars- The new workforce led Digital ... by AI & ML and secured through Blockchain|M, Deepika and Cuddapah, Vijay and Srivastava, Amitendra and Mahankali, Srinivas|9789388511636\n2020|Apress|Deep Reinforcement Learning in Unity: With Unity ML Toolkit|Majumder, Abhilash|9781484265031\n2018|Apress|Monetizing Machine Learning: Quickly Turn Python ML Ideas into Web Applications on the Serverless Cloud|Amunategui, Manuel and Roopaei, Mehdi|9781484238738\n1996|Cambridge University Press|ML for the Working Programmer, 2nd Edition|L. C. Paulson|9780521565431\n2018|Packt Publishing|Learn Unity ML-Agents – Fundamentals of Unity Machine Learning: Incorporate new powerful ML algorithms such as Deep Reinforcement Learning for games|Lanham, Micheal|9781789131864\n2007|Cambridge University Press|Concurrent Programming in ML|Reppy, John H.|9780521714723\n2019|Packt Publishing|Hands-On Machine Learning with TensorFlow.js: A guide to building ML applications integrated with web technology using the TensorFlow.js library|Sasaki, Kai|9781838827878\n1991|Cambridge University Press|ML for the Working Programmer|Paulson, Lawrence C.|9780521390224\n2018|Packt Publishing|Machine Learning Projects for Mobile Applications: Build Android and iOS applications using TensorFlow Lite and Core ML|NG, Karthikeyan|9781788998468\n1999|Cambridge University Press|Concurrent Programming in ML|Reppy, John H.|9780521480895\n2018|Packt Publishing|Machine Learning Projects for Mobile Applications: Build Android and iOS applications using TensorFlow Lite and Core ML|NG, Karthikeyan|9781788994590\n2020|BPB Publications|Machine Learning Cookbook with Python: Create ML and Data Analytics Projects Using Some Amazing Open Datasets (English Edition|Guha, Rehan|9789389898002\n1987-06-01T00:00:01Z|Prentice Hall|Functional Programming Using Standard Ml (Prentice Hall International Series in Computer Science)|Wikstrom, Ake|9780133316612\n1994-06T|Prentice Hall|Elements of Ml Programming|Ullman, Jeffrey D.|9780131848542\n1988-10-01T00:00:01Z|Prentice Hall|Functional Programming Using Standard Ml (Prentice-hall International Series in Computer Science)|Wikstrom, Ake|9780133319682\n1995|McGraw-Hill|A Practical Course in Functional Programming Using ML|Bosworth, Richard|9780077076252\n2021|BPB Publications|Practical Full Stack Machine Learning: A Guide to Build Reliable, Reusable, and Production-Ready Full Stack ML Solutions (English Edition)|Kumar, Alok|9789391030421\n2019|Independently published|Beginning iOS 12 & Swift App Development: Develop iOS Apps with Xcode 10, Swift 4, Core ML 2, ARKit 2 and more|Lim, Greg|9781796997965\n1998||Elements Of Ml Programming|Jeffrey D. Ullman|9780130803917\n19960628|Cambridge University Press|ML for the Working Programmer|Larry C. Paulson|9781107266346\n20040708|Cambridge University Press|Modern Compiler Implementation in ML|Andrew W. Appel|9781107266391\n20040405|Cambridge University Press|The Standard ML Basis Library|Emden R. Gansner|9780511192197\n19960628|Cambridge University Press|ML for the Working Programmer|Larry C. Paulson|9781107263772\n|Addison Wesley|Modern Functional Programming In Ml||9780201648645\n2004|Cambridge University Press|The Standard ML Basis Library|Emden R. Gansner and John H. Reppy|9780521791427\n1993|Prentice Hall|Programming With Standard Ml (bcs Practitioner)|Colin Myers and Chris Clack and Ellen Poon|9780137220755\n2011||Articles On Ml Programming Language Family, Including|Hephaestus Books|9781243284167\n2010||Programming Languages Created In 1990: Standard Ml|Books and LLC|9781156307267\n2012|Springer-Verlag New York, LLC|ML with Concurrency: Design, Analysis, Implementation, and Application|Flemming Nielson|9781461274834\n20120917|De Gruyter|Programmierung - eine Einführung in die Informatik mit Standard ML|Gert Smolka|9783486719734\n20090101|De Gruyter|Programmierung - eine Einführung in die Informatik mit Standard ML|Gert Smolka|9783486595345\n1991|Chapman & Hall|Applicative High Order Programming: Standard Ml In Practice (chapman And Hall Computing Series)|S. Sokolowski|9780442308384", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1990|Definition of standard ML|10.7551/mitpress/2319.001.0001|2479|100|R. Milner and M. Tofte and R. Harper|37e634588f112478e145fa522a4afb2a40a2d250\n1999|Concurrent programming in ML|10.1017/cbo9780511574962|304|35|J. Reppy|ee041315f66165e43199893d511e4887c4a22824\n1999|Recursion and dynamic data-structures in bounded space: towards embedded ML programming|10.1145/317636.317785|147|7|John Hughes and L. Pareto|79ee2551ee77ab4323e9eaf52bbd642d6f4d37c9\n1998|From ML to Ada: Strongly-typed language interoperability via source translation|10.1017/S0956796898003086|109|10|A. Tolmach and D. Oliva|fd383081c14938ba1f38e5fc385b0a76db90bfea\n1994|Programming Objects with ML-ART, an Extension to ML with Abstract and Record Types|10.1007/3-540-57887-0_102|91|3|Didier Rémy|6a424575907fa91582d830a23696ec7a29d0bc2f\n2007|Dependent ML An approach to practical programming with dependent types|10.1017/S0956796806006216|83|6|H. Xi|e9a621f0da90fa13e7d48bd98c548657bb5b1896\n2012|Resource Aware ML|10.1007/978-3-642-31424-7_64|78|7|Jan Hoffmann and Klaus Aehlig and M. Hofmann|901ad3ea56ae97530cb15c7f761f9e1e026131cd\n2014|Proof-producing translation of higher-order logic into pure and stateful ML|10.1017/S0956796813000282|52|7|Magnus O. Myreen and Scott Owens|5b203abc65643b5237ffb703e01ff5ae080b35fe\n2017|Programming by Examples: PL Meets ML|10.1007/978-3-319-71237-6_1|39|2|Sumit Gulwani and Prateek Jain|8c9d778a6380f7a5d1f4a04f341215024ed3f90d\n1997|ML for the Working Programmer (2nd edition) by L. C. Paulson, Cambridge University Press, 1996. A Practical Course in Functional Programming Using Standard ML by R. Bosworth, McGraw Hill, 1996.|10.1017/S0956796897002761|34|2|C. Reade|cd28200fcc479cafc07a383660766e28acfb97d3\n2012|Proof-producing synthesis of ML from higher-order logic|10.1145/2364527.2364545|30|3|Magnus O. Myreen and Scott Owens|58bb00b882700d67779871a6208f288f68a0b71c\n1994|Programming with Behaviors in an ML Framework - The Syntax and Semantics of LCS|10.1007/3-540-57880-3_6|27|3|B. Berthomieu and T. Sergent|fb1838077df3bd2bb17ad5a48574e74a1ed2d52f\n2011|Making standard ML a practical database programming language|10.1145/2034773.2034815|27|1|A. Ohori and Katsuhiro Ueno|2a2430b6607a077eabac54a8339c1d6b2f2687b7\n2016|Eliom: A Core ML Language for Tierless Web Programming|10.1007/978-3-319-47958-3_20|22|4|Gabriel Radanne and Jérôme Vouillon and V. Balat|c68561486aa1eb715b2fd02cb0170f1535670b48\n2017|FabULous Interoperability for ML and a Linear Language|10.1007/978-3-319-89366-2_8|13|0|G. Scherer and Max S. New and Nick Rioux and A. Ahmed|33354f7006a13cfac99e3d521127bc2c30f908b1\n2010|Functional Parallel Programming with Revised Bulk Synchronous Parallel ML|10.1109/IC-NC.2010.57|11|1|Wadoud Bousdira and F. Gava and Louis Gesbert and F. Loulergue and Guillaume Petiot|8dc34822905f7833306a4f82f8c9e78a2f91f6de\n2016|ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti|10.1007/978-3-319-46750-4_26|7|0|Raphaël Cauderlier and Catherine Dubois|208552e5bc4a53766f932c3d02bb135e3786246c\n2017|Multi-ML: Programming Multi-BSP Algorithms in ML|10.1007/s10766-016-0417-6|7|0|Victor Allombert and F. Gava and J. Tesson|2bf244eb59500a9ee58210232074e74334376bc5\n2017|Program generation for ML modules (short paper)|10.1145/3162072|6|0|Takahisa Watanabe and Yukiyoshi Kameyama|6b327154ea724fb75639bff85f2263c8adaa7496\n2020|The history of Standard ML|10.1145/3386336|5|0|David B. MacQueen and R. Harper and J. Reppy|d90fe939342b472ce4344c7b437abe9f108e020a\n2005|Functional programming languages for verification tools: a comparison of Standard ML and Haskell|10.1007/s10009-004-0184-3|4|0|M. Leucker and T. Noll and P. Stevens and Michael Weber|bb7c485843e97b376ef02d71798cee12daa04178\n2017|Implementing Algorithmic Skeletons with Bulk Synchronous Parallel ML|10.1109/PDCAT.2017.00079|4|0|F. Loulergue|a1717062000e907819d70bbc1f2508a6580737fe\n1993|Categorical ML — Category-theoretic modular programming|10.1007/BF01212406|3|0|E. Dennis-Jones and D. Rydeheard|dfef120a8a6b7c4e4519f6d9a0171eb5fe689e2b\n2017|A BSPlib-style API for Bulk Synchronous Parallel ML|10.12694/scpe.v18i3.1306|2|0|F. Loulergue|6d2c6381ea8e94589fbbe73d65df7ac265295f9f\n2018|An ML Implementation of the MULTI-BSP Model|10.1109/HPCS.2018.00085|2|0|Victor Allombert and F. Gava|b883f7f2b598baab7ff13ac9514b65e4c26d4b53\n2018|Programming bsp and multi-bsp algorithms in ml|10.1007/s11227-019-02822-9|2|0|Victor Allombert and F. Gava|8c290e8b9393c9f74916203d234ee7315b925fa4\n2006|ML grid programming with ConCert|10.1145/1159876.1159879|1|0|Tom Murphy Vii|5ae7538beaa255cede9fac93c2116ef39be77b67\n2006|ML grid programming with ConCert|10.1145/1159876.1159879|1|0|Tom Murphy|6172de57616b3faa82b722f86e66136dca3e9694\n2019|PML2: Integrated Program Verification in ML|10.4230/LIPIcs.TYPES.2017.5|1|0|Rodolphe Lepigre|0071469f766abf45de3746ad76867ecaa1418c88\n2010|Functional Programming in ML|10.1081/E-ESE-120044136|1|0|Lawrence Charles Paulson|3562eb30e03c871a954b47247077e8b6b62d57a5" }, "mlab": { "title": "MLAB", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2f1db51bcb66ba9073de6a402b01cbdfb8d3192a" ], "country": [ "United States" ], "originCommunity": [ "National Institutes of Health" ], "wikipedia": { "related": [ "mongodb", "azure", "aws", "google-cloud" ], "summary": "mLab is a fully managed cloud database service that hosts MongoDB databases. mLab runs on cloud providers Amazon, Google, and Microsoft Azure, and has partnered with platform-as-a-service providers. In May 2011, mLab secured $3 million in first-round funding from Foundry Group, Baseline Ventures, Upfront Ventures, Freestyle Capital and David Cohen.In October 2012, mLab received a follow-on investment of $5 million and shortly thereafter, mLab was named by Network World as one of the 10 most useful cloud databases along with Amazon Web Services, Google Cloud SQL, Microsoft Azure, Rackspace, and others. In June 2014, MongoDB Inc. announced a fully managed highly available MongoDB-as-a-Service Add-On offering on the Microsoft Azure store. The offering is delivered in collaboration with Microsoft and mLab.In February 2016, mLab changed its name from MongoLab to mLab to expand into new areas and products.In October 2018, mLab announced that it will be acquired by MongoDB Inc., citing reasons of a shared vision and engineering culture. All engineers at mLab have been invited to join MongoDB Inc. All of mLab's customers will be transitioned to MongoDB Atlas instances.. The acquisition \"is expected to close in the fourth quarter of MongoDB’s fiscal year ending Jan. 31, 2019\".", "backlinksCount": 6, "pageId": 41012390, "dailyPageViews": 51, "created": 2013, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/MLab" }, "hopl": "https://hopl.info/showlanguage.prx?exp=682", "centralPackageRepositoryCount": 0 }, "mlatu": { "title": "mlatu", "appeared": 2021, "type": "pl", "creators": [ "Caden Haustein" ], "website": "https://mlatu-lang.github.io/mlatu", "country": [ "United States" ], "originCommunity": [ "https://github.com/mlatu-lang" ], "githubRepo": { "firstCommit": 2021, "stars": 144, "forks": 9, "subscribers": 7, "created": 2021, "updated": 2022, "description": "A declarative concatenative programming language", "issues": 0, "url": "https://github.com/mlatu-lang/mlatu" }, "repoStats": { "firstCommit": 2021, "commits": 188, "committers": 6, "files": 27 } }, "mlir": { "title": "mlir", "appeared": 2019, "type": "ir", "creators": [ "Chris Lattner" ], "website": "https://mlir.llvm.org/", "reference": [ "https://blog.tensorflow.org/2019/04/mlir-new-intermediate-representation.html", "https://ieeexplore.ieee.org/document/9370308" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/tensorflow" ], "domainName": { "name": "mlir.llvm.org" }, "announcementMethod": "paper", "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// Syntactically similar to LLVM:\nfunc @testFunction(%arg0: i32) {\n %x = call @thingToCall(%arg0) : (i32) -> i32\n br ^bb1\n^bb1:\n %y = addi %x, %x : i32\n return %y : i32\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 1678, "forks": 260, "subscribers": 170, "created": 2019, "updated": 2022, "description": "\"Multi-Level Intermediate Representation\" Compiler Infrastructure", "issues": 57, "url": "https://github.com/tensorflow/mlir" }, "repoStats": { "firstCommit": 2019, "commits": 3349, "committers": 91, "files": 1 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "mlir" ], "aceMode": "text", "tmScope": "source.mlir", "repos": 84, "id": "MLIR" }, "githubBigQuery": { "repos": 30, "users": 27, "id": "MLIR" }, "compilerExplorer": { "example": [ "// Example code of an affine reduction.\n// MLIR example code may not always work out of the box because the textual MLIR format is not stable.\n// The example tries to be compatible with the latest MLIR version, which may not work on previous versions.\n\nfunc @affine_parallel_with_reductions_i64(%arg0: memref<3x3xi64>, %arg1: memref<3x3xi64>) -> (i64, i64) {\n %0:2 = affine.parallel (%kx, %ky) = (0, 0) to (2, 2) reduce (\"addi\", \"muli\") -> (i64, i64) {\n %1 = affine.load %arg0[%kx, %ky] : memref<3x3xi64>\n %2 = affine.load %arg1[%kx, %ky] : memref<3x3xi64>\n %3 = arith.muli %1, %2 : i64\n %4 = arith.addi %1, %2 : i64\n affine.yield %3, %4 : i64, i64\n }\n return %0#0, %0#1 : i64, i64\n}\n" ], "id": "MLIR" }, "isbndb": "" }, "mlisp2": { "title": "MLISP2", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/62b484384d34f22928468e5dea865e7accf70dc4" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3303", "centralPackageRepositoryCount": 0 }, "mlite": { "title": "mlite", "appeared": 2004, "type": "pl", "description": "a lightweight (and slightly odd) inhabitant of the ML universe.", "website": "https://www.t3x.org/mlite/index.html", "reference": [ "https://lobste.rs/s/ukhvbs/mlite_language" ], "country": [ "Germany" ], "originCommunity": [ "https://www.t3x.org" ], "redditDiscussion": [ "https://www.reddit.com/r/programming/comments/2ouscr/the_mlite_language_t3xorg/" ] }, "mlpolyr": { "title": "mlpolyr", "appeared": 2016, "type": "pl", "creators": [ "Nicolas Ojeda Bar" ], "country": [ "France" ], "originCommunity": [ "https://github.com/owo-lang" ], "githubRepo": { "firstCommit": 2016, "stars": 21, "forks": 1, "subscribers": 5, "created": 2019, "updated": 2021, "description": "The MLPolyR programming language, revived", "issues": 3, "url": "https://github.com/owo-lang/MLPolyR" }, "repoStats": { "firstCommit": 2016, "commits": 59, "committers": 5, "files": 160 } }, "mmix": { "title": "mmix", "appeared": 1999, "type": "assembly", "description": "During the 1990s I spent considerable time designing a computer that would be representative of modern machines, yet easy to learn. Several of the leading experts in the field gave me considerable help with the design. The result was MMIX — \"A RISC computer for the new millennium\". In 1999 I completed the preliminary software to support basic MMIX programming and the simulation of many versions of the architecture.", "reference": [ "http://mmix.cs.hm.edu/examples/index.html" ], "country": [ "Germany" ], "originCommunity": [ "HM Hochschule München University of Applied Sciences" ], "example": [ " LOC Data_Segment\n GREG @\nText BYTE \"Hello world!\",10,0\n\n LOC #100\n\nMain LDA $255,Text\n TRAP 0,Fputs,StdOut\n TRAP 0,Halt,0" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:MMIX", "centralPackageRepositoryCount": 0 }, "mmsearch": { "title": "mmsearch", "appeared": 2001, "type": "pl", "reference": [ "https://semanticscholar.org/paper/008f0b3cce064cc5abd04b3a4fe31219aa0652f0" ], "country": [ "Switzerland" ], "originCommunity": [ "Swiss Institute of Bioinformatics" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3544", "centralPackageRepositoryCount": 0 }, "mmx": { "title": "MMX instruction set", "appeared": 1997, "type": "isa", "country": [ "United States" ], "originCommunity": [ "Intel Corporation" ], "wikipedia": { "related": [ "ia-32", "c", "assembly-language", "arm" ], "summary": "MMX is a single instruction, multiple data (SIMD) instruction set designed by Intel, introduced in 1997 with its P5-based Pentium line of microprocessors, designated as \"Pentium with MMX Technology\". It developed out of a similar unit introduced on the Intel i860, and earlier the Intel i750 video pixel processor. MMX is a processor supplementary capability that is supported on recent IA-32 processors by Intel and other vendors. MMX has subsequently been extended by several programs by Intel and others: 3DNow!, Streaming SIMD Extensions (SSE), and ongoing revisions of Advanced Vector Extensions (AVX).", "pageId": 55364, "dailyPageViews": 215, "created": 2002, "backlinksCount": 275, "revisionCount": 278, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/MMX_(instruction_set)" }, "fileType": "na", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming with Intel Wireless MMX Technology: A Developer's Guide to Mobile Multimedia Applications|2004|Nigel C. Paver|2356224|0.0|0|0\nDirectX(R), Rdx, Rsx, and MMX(TM) Technology: A Jumpstart Guide to High Performance APIs [With Includes DirectX Software Development Kit...]|1997|Rohan Coelho|1419182|3.00|1|0", "isbndb": "", "semanticScholar": "" }, "mobl-lang": { "title": "Mobl", "appeared": 2010, "type": "pl", "creators": [ "Zef Hemel" ], "website": "https://www.mobl-lang.org/", "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/mobl" ], "githubRepo": { "stars": 110, "forks": 22, "subscribers": 8, "created": 2010, "updated": 2013, "description": "Domain-specific language for mobile (web) applications. This repository contains the compiler sources and Eclipse project.", "url": "https://github.com/mobl/mobl" }, "repoStats": { "firstCommit": 2010, "commits": 663, "committers": 15, "files": 388 } }, "mobl": { "title": "MOBL", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d014a6651eed72a684339e131596d7cb543894b1" ], "country": [ "United States" ], "originCommunity": [ "Computer Usage Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5636", "centralPackageRepositoryCount": 0 }, "moby-programming-language": { "title": "Moby", "appeared": 1998, "type": "pl", "website": "http://moby.cs.uchicago.edu", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en-academic.com/dic.nsf/enwiki/791522/" }, "centralPackageRepositoryCount": 0 }, "mochajs": { "title": "mochajs", "appeared": 2011, "type": "library", "website": "https://mochajs.org/", "country": [ "Denmark and Republic of Korea and United States and Switzerland" ], "originCommunity": [ "https://github.com/mochajs" ], "domainName": { "registered": 2014, "awisRank": { "2022": 187194 }, "name": "mochajs.org" }, "githubRepo": { "firstCommit": 2011, "stars": 21471, "forks": 2950, "subscribers": 389, "created": 2011, "updated": 2022, "description": "☕️ simple, flexible, fun javascript test framework for node.js & the browser", "issues": 273, "url": "https://github.com/mochajs/mocha" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mochi": { "title": "mochi", "appeared": 2014, "type": "pl", "description": "Mochi is a dynamically typed programming language for functional programming and actor-style programming. Its interpreter is written in Python3. The interpreter translates a program written in Mochi to Python3's AST / bytecode.", "country": [ "Japan" ], "originCommunity": [ "https://github.com/i2y/mochi/issues" ], "example": [ "def factorial(n, m):\n if n == 1:\n m\n else:\n factorial(n - 1, n * m)" ], "githubRepo": { "firstCommit": 2014, "stars": 909, "forks": 32, "subscribers": 48, "created": 2014, "updated": 2022, "description": "Dynamically typed functional programming language", "issues": 14, "url": "https://github.com/i2y/mochi" }, "repoStats": { "firstCommit": 2014, "commits": 402, "committers": 14, "files": 93 }, "jupyterKernel": [ "https://github.com/pya/mochi-kernel" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mockingbird-notation": { "title": "mockingbird-notation", "appeared": 1996, "type": "notation", "creators": [ "David C. Keenan" ], "website": "http://dkeenan.com/Lambda/", "country": [ "Australia" ], "originCommunity": [ "https://dkeenan.com" ], "related": [ "lisp" ], "visualParadigm": true, "semanticScholar": "" }, "mocklisp": { "title": "Mocklisp", "appeared": 1981, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Unipress" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Mocklisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2245", "centralPackageRepositoryCount": 0 }, "modcap": { "title": "MODCAP", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/31ff2de9d50fa65c9db43b419ec5c92c13c12f13" ], "country": [ "United States" ], "originCommunity": [ "New Mexico State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2761", "centralPackageRepositoryCount": 0 }, "model-204": { "title": "Model 204", "appeared": 1972, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Computer Corporation of America" ], "wikipedia": { "related": [ "assembly-language", "sql" ], "summary": "Model 204 (M204) is a database management system for IBM and compatible mainframe computers, “born” 1965 October 13, and first deployed in 1972. It incorporates a programming language and an environment for application development. Implemented in assembly language for IBM System/360 and its successors, M204 can deal with very large databases and transaction loads of 1000 TPS.", "pageId": 1318381, "created": 2004, "backlinksCount": 22, "revisionCount": 84, "dailyPageViews": 22, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/Model_204" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "model-k": { "title": "MODEL-K", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/21038c2f5d47df42bcf2b899c252cb6c68adb88e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4187", "centralPackageRepositoryCount": 0 }, "modelica": { "title": "Modelica", "appeared": 1997, "type": "pl", "website": "http://www.modelica.org/", "reference": [ "https://marcobonvini.com/modelica/2020/06/29/all-about-modelica.html", "https://modelica.readthedocs.io/en/latest/lexical.html" ], "country": [ "Sweden" ], "originCommunity": [ "Modelica Association" ], "domainName": { "registered": 1998, "awisRank": { "2022": 716353 }, "name": "modelica.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasUnitsOfMeasure": { "example": "type SpecificHeatCapacity = Real (\n final quantity=\"SpecificHeatCapacity\",\n final unit=\"J/(kg.K)\"\n);", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasFloats": { "example": "// \\d+(\\.?\\d*[eE][-+]?\\d+|\\.\\d*)", "value": true }, "hasIntegers": { "example": "// \\d+", "value": true }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "model Circuit\n Capacitor C1(C=1e-4) \"A Capacitor instance from the model above\";\n Capacitor C2(C=1e-5) \"A Capacitor instance from the model above\";\n ...\nequation\n connect(C1.pin_p, C2.pin_n);\n ...\nend Circuit;" ], "related": [ "java", "unicode", "ampl", "general-algebraic-modeling-system", "matlab", "simulink", "doi" ], "summary": "Modelica is an object-oriented, declarative, multi-domain modeling language for component-oriented modeling of complex systems, e.g., systems containing mechanical, electrical, electronic, hydraulic, thermal, control, electric power or process-oriented subcomponents. The free Modelica language is developed by the non-profit Modelica Association. The Modelica Association also develops the free Modelica Standard Library that contains about 1360 generic model components and 1280 functions in various domains, as of version 3.2.1.", "pageId": 1467946, "dailyPageViews": 93, "created": 2005, "backlinksCount": 53, "revisionCount": 288, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Modelica" }, "githubLanguage": { "fileExtensions": [ "mo" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "modelica", "codemirrorMimeType": "text/x-modelica", "tmScope": "source.modelica", "repos": 1208, "id": "Modelica" }, "githubBigQuery": { "repos": 542, "users": 447, "id": "Modelica" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/modelica", "codeMirror": "modelica", "pygmentsHighlighter": { "filename": "modeling.py", "fileExtensions": [ "mo" ], "id": "Modelica" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 6, "commitCount": 55, "sampleCount": 12, "example": [ "within ModelicaByExample;\npackage PackageExamples \"Examples of using packages\"\nend PackageExamples;\n" ], "url": "https://github.com/BorisChumichev/modelicaSublimeTextPackage" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4965", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nIntroduction to Modeling and Simulation of Technical and Physical Systems with Modelica|2011|Peter Fritzson|19472408|3.00|2|0", "isbndb": "year|publisher|title|authors|isbn13\n2004|Wiley-IEEE Press|Principles of Object-Oriented Modeling and Simulation with Modelica 2.1|Fritzson, Peter|9780471471639", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Mapping SysML to modelica to validate wireless sensor networks non-functional requirements|10.1109/ISPS.2013.6581484|25|3|Samir Berrani and A. Hammad and H. Mountassir|7d4a4ce09a58b9f06960ffc24709bdb97a451f31\n2009|Towards a Text Generation Template Language for Modelica|10.3384/ECP09430124|22|0|P. Fritzson and P. Privitzer and Martin Sjölund and Adrian Pop|72bfd66c55ce453246df43306d74305794451fe1\n2017|Innovations for Future Modelica|10.3384/ECP17132693|20|2|H. Elmqvist and T. Henningsson and M. Otter|07ed7754318a9bcce08b497c2d3b546b8b7f0de7\n2012|A Data-Parallel Algorithmic Modelica Extension for Efficient Execution on Multi-Core Platforms|10.3384/ECP12076393|15|1|M. Gebremedhin and A. Moghadam and P. Fritzson and Kristian Stavåker|9d10cc1beff010694193c0b8a80410e576106f5a\n2015|Model-based control with FMI and a C++ runtime for Modelica|10.3384/ECP15118339|10|0|R. Franke and M. Walther and Niklas Worschech and Willi Braun and B. Bachmann|eff7740202229f0a73310d85b9eefe08ed88284e\n2012|Chemical Process Modeling in Modelica|10.3384/ECP12076955|7|0|A. Baharev and A. Neumaier|16edb4ffe8045456c50f9612620b62a4969550c2\n2014|Towards utilizing repeating structures for constant time compilation of large Modelica models|10.1145/2666202.2666207|7|1|M. Arzt and V. Waurich and J. Wensch|ab07f33e40e62e3ee67dd7fbf6c562e684781679\n2019|Use of Modelica language to simulate electrified railway lines and trains|10.1002/spe.2700|3|0|M. Ceraolo and G. Lutzemberger|688fc228b58ae02b0d517d7a7f112822d02c63a9\n2012|Design and implementation of real time simulator with Modelica|10.1109/ICSENGT.2012.6339303|2|0|M. H. Adiprasetya and A. S. Prihatmanto|da64415927c4555999fba755cc0ea3b699b022f8\n2014|impact - A Modelica R Package Manager|10.3384/ECP14096543|2|0|Michael M. Tiller and D. Winkler|ce553d6e2e46356b805029278fee9cf105b9a6c2\n2017|Integrated Flight Simulation Program for Multicopter Drones by Using Acausal and Object-Oriented Language Modelica|10.5139/jksas.2017.45.5.437|2|0|Jaehyun Jin|7e97416cb7b93428ffcb0696dc9b41b3bb3518c5\n2018|Fault Detection and Localization Using Modelica and Abductive Reasoning|10.1007/978-3-319-74962-4_3|1|0|Ingo Pill and F. Wotawa|3499328b944bfecf21af99cb1fabfff5e57ae96f\n2014|Modelica modeling language as a tool on control engineering education: Simulation of a two-tank system|10.1109/TALE.2014.7062602|1|0|J. Figueiredo and V. Carvalho and J. Machado and F. Soares|8994b29fe87bac03d00c879de717078b4c78c617\n2021|Development and Validation of a Latent Thermal Energy Storage Model Using Modelica|10.3390/en14010194|1|1|Dre Helmns and David H. Blum and S. Dutton and V. Carey|b8fe6955626b16c61017f1de5bfcacfd8394b1c8" }, "modl": { "title": "modl", "appeared": 1987, "type": "pl", "description": "c-based language for ExtendSim.", "reference": [ "https://www.extendsim.com/flipbooks/ExtendSimDiscreteEventQSG.pdf" ], "country": [ "United States" ], "originCommunity": [ "Imagine That Inc" ] }, "modlisp": { "title": "MODLISP", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/600ffb97d5e9b66a664c01e84107afbb9e272776" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6722", "centralPackageRepositoryCount": 0 }, "modsim-iii": { "title": "MODSIM III", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/91bd41cbd94f92d46b532bc60ea8ec9ddf83d8ef" ], "country": [ "United States" ], "originCommunity": [ "CACI Products Company" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5439", "centralPackageRepositoryCount": 0 }, "modula-2": { "title": "Modula-2", "appeared": 1978, "type": "pl", "creators": [ "Niklaus Wirth" ], "documentation": [ "https://www.modula2.org/tutor/introduction.php" ], "fileExtensions": [ "mod", "m2", "def", "MOD", "DEF", "mi", "md" ], "country": [ "Switzerland" ], "originCommunity": [ "ETH Zurich" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasPointers": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": false }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "printToken": [ [ "WriteString" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "wikipedia": { "example": [ "ABS EXCL LONGINT REAL\nBITSET FALSE LONGREAL SIZE\nBOOLEAN FLOAT MAX TRUE\nCAP HALT MIN TRUNC\nCARDINAL HIGH NIL VAL\nCHAR INC ODD\nCHR INCL ORD\nDEC INTEGER PROC" ], "related": [ "modula", "mesa", "pascal", "modula-3", "oberon", "ada", "lua", "seed7", "zonnon", "isbn" ], "summary": "Modula-2 is a computer programming language designed and developed between 1977 and 1985 by Niklaus Wirth at the Swiss Federal Institute of Technology in Zurich (ETH Zurich) as a revision of Pascal to serve as the sole programming language for the operating system and application software for the personal workstation Lilith. The principal concepts were: The module as a compilation unit for separate compilation The coroutine as the basic building block for concurrent processes Types and procedures that allow access to machine-specific data. Modula-2 was viewed by Niklaus Wirth as a successor to his earlier programming languages Pascal and Modula. The language design was also influenced by the Mesa language and the new programming possibilities of the early personal computer Xerox Alto, both from Xerox, that Wirth saw during his 1976 sabbatical year at Xerox PARC. The computer magazine BYTE devoted the August 1984 issue to the language and its surrounding environment.", "pageId": 24102707, "dailyPageViews": 87, "created": 2002, "backlinksCount": 211, "revisionCount": 508, "appeared": 1978, "fileExtensions": [ "mod", "m2", "def", "MOD", "DEF", "mi", "md" ], "url": "https://en.wikipedia.org/wiki/Modula-2" }, "githubLanguage": { "fileExtensions": [ "mod" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.modula2", "repos": 306, "id": "Modula-2" }, "githubBigQuery": { "repos": 115, "users": 103, "id": "Modula-2" }, "pygmentsHighlighter": { "filename": "modula2.py", "fileExtensions": [ "def", "mod" ], "id": "Modula-2" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 4, "commitCount": 27, "sampleCount": 1, "example": [ "IMPLEMENTATION MODULE HuffChan;\n\n(*\n This module shows how to redefine standard IO file functions. It provides\n functions for reading and writing packed files opened in Raw mode.\n*)\n\nIMPORT IOChan, IOLink, ChanConsts, IOConsts, SYSTEM, Strings;\nFROM Storage IMPORT ALLOCATE, DEALLOCATE;\n\nCONST\n rbldFrq = 512;\t(* means: every 512 bytes rebuild table *)\n\nTYPE\n charTap = POINTER TO ARRAY [0..MAX(INTEGER)-1] OF CHAR;\n smbTp = POINTER TO smbT;\n\n smbT = RECORD\t\t\t(* Huffman's tree *)\n ch\t\t\t: CHAR;\n n\t\t\t: CARDINAL; (* frequncy of char ch *)\n left,right,next\t: smbTp;\n END;\n\n tblT = RECORD\t\t(* bit sequence for code *)\n vl\t\t: CARDINAL;\t(* bit sequence *)\n cnt\t\t: INTEGER;\t(* it length *)\n END;\n\n lclDataT = RECORD\t(* channel's local data *)\n tRoot \t: smbTp;\n htbl\t: ARRAY [0..255] OF tblT; (* code -> bit sequence table *)\n ftbl \t: ARRAY [0..255] OF CARDINAL; (* frequncey table *)\n wBf,rb1,rb2\t: CARDINAL;\n wbc,rbc,smc\t: INTEGER;\n chid\t: IOChan.ChanId;\n END;\n lclDataTp = POINTER TO lclDataT;\n charp = POINTER TO CHAR;\n\nVAR\n did\t: IOLink.DeviceId;\n ldt\t: lclDataTp;\n\n\nPROCEDURE Shf(a:CARDINAL; b : INTEGER) : CARDINAL; (* shl a,b (or shr) *)\nBEGIN\n RETURN SYSTEM.CAST(CARDINAL,SYSTEM.SHIFT(SYSTEM.CAST(BITSET,a),b));\nEND Shf;\n\nPROCEDURE wrDword(a:CARDINAL);\t(* write 4 bytes to file *)\nBEGIN\n IOChan.RawWrite(ldt^.chid,SYSTEM.ADR(a),4);\nEND wrDword;\n\nPROCEDURE rdDword() : CARDINAL; (* read 4 bytes from file *)\nVAR\n a,z : CARDINAL;\nBEGIN\n a:=0;\n IOChan.RawRead(ldt^.chid,SYSTEM.ADR(a),4,z);\n RETURN a;\nEND rdDword;\n\nPROCEDURE wrSmb(ch : CHAR);\t(* write bit sequence for code ch *)\nVAR\n v,h : CARDINAL;\n b,c : INTEGER;\nBEGIN\n WITH ldt^ DO\n v:=htbl[ORD(ch)].vl;\n c:=htbl[ORD(ch)].cnt;\n IF c+wbc<=32 THEN\n wBf:=Shf(wBf,c);\n wBf:=wBf+v;\n wbc:=wbc+c;\n IF wbc=32 THEN\n\twrDword(wBf);\n\twBf:=0; wbc:=0;\n END;\n RETURN;\n END;\n b:=c+wbc-32;\n h:=Shf(v,-b);\n wBf:=Shf(wBf,32-wbc)+h;\n wrDword(wBf);\n wBf:=v-Shf(h,b);\n wbc:=b;\n END;\nEND wrSmb;\n\nPROCEDURE flush();\t(* write data in buffer *)\nBEGIN\n WITH ldt^ DO\n wBf:=Shf(wBf,32-wbc);\n wrDword(wBf);\n END;\nEND flush;\n\nPROCEDURE getSym() : CHAR; (* find code for first bit sequence in buffer *)\nVAR\n t,i : CARDINAL;\n b : INTEGER;\nBEGIN\n WITH ldt^ DO\n IF rbc<=32 THEN\n rb2:=rdDword();\n t:=Shf(rb2,-rbc);\n IF rbc=32 THEN t:=0; END;\n rb1:=rb1+t;\n rb2:=Shf(rb2,32-rbc);\n IF rbc=0 THEN rb2:=0; END;\n rbc:=rbc+32;\n END;\n FOR i:=0 TO 255 DO\n t:=Shf(rb1,htbl[i].cnt-32);\n IF t=htbl[i].vl THEN\n\trb1:=Shf(rb1,htbl[i].cnt);\n\tb:=32-htbl[i].cnt;\n\tt:=Shf(rb2,-b);\n\trb1:=rb1+t;\n\trb2:=Shf(rb2,32-b);\n\trbc:=rbc+b-32;\n\tRETURN CHR(i);\n END;\n END;\n END;\nEND getSym;\n\nPROCEDURE Insert(s : smbTp); (* insert new character in Huffman's tree *)\nVAR\n cr : smbTp;\nBEGIN\n WITH ldt^ DO\n IF tRoot=NIL THEN\n cr:=tRoot;\n tRoot:=s;\n s^.next:=cr;\n RETURN;\n ELSIF tRoot^.n<=s^.n THEN\n cr:=tRoot;\n tRoot:=s;\n s^.next:=cr;\n RETURN;\n END;\n cr:=tRoot;\n WHILE (cr^.next<>NIL) & (cr^.next^.n>s^.n) DO\n cr:=cr^.next;\n END;\n s^.next:=cr^.next;\n cr^.next:=s;\n END;\nEND Insert;\n\nPROCEDURE BuildTree(); (* build Huffman's tree *)\nVAR\n cr,ocr,ncr : smbTp;\nBEGIN\n WITH ldt^ DO\n LOOP\n ocr:=NIL; cr:=tRoot;\n WHILE cr^.next^.next<>NIL DO\n\tocr:=cr; cr:=cr^.next;\n END;\n NEW(ncr);\n ncr^.n:=cr^.n+cr^.next^.n;\n ncr^.left:=cr;\n ncr^.right:=cr^.next;\n IF ocr<>NIL THEN\n\tocr^.next:=NIL;\n\tInsert(ncr);\n ELSE\n\ttRoot:=NIL;\n\tInsert(ncr);\n\tEXIT;\n END;\n END;\n END;\nEND BuildTree;\n\nPROCEDURE BuildTable(cr: smbTp; vl,n: CARDINAL); (* build table: code -> bit sequence *)\nBEGIN\n WITH ldt^ DO\n IF cr^.left=NIL THEN\n htbl[ORD(cr^.ch)].vl:=vl;\n htbl[ORD(cr^.ch)].cnt:=n;\n DISPOSE(cr);\n RETURN;\n END;\n vl:=vl*2;\n BuildTable(cr^.left,vl,n+1);\n BuildTable(cr^.right,vl+1,n+1);\n DISPOSE(cr);\n END;\nEND BuildTable;\n\nPROCEDURE clcTab(); (* build code/bitseq. table from frequency table *)\nVAR\n i : CARDINAL;\n s : smbTp;\nBEGIN\n WITH ldt^ DO\n tRoot:=NIL;\n FOR i:=0 TO 255 DO\n NEW(s);\n s^.ch:=CHR(i);\n s^.n:=ftbl[i];\n s^.left:=NIL; s^.right:=NIL; s^.next:=NIL;\n Insert(s);\n END;\n BuildTree();\n BuildTable(tRoot,0,0);\n END;\nEND clcTab;\n\nPROCEDURE iniHuf();\nVAR\n i : CARDINAL;\nBEGIN\n WITH ldt^ DO\n FOR i:=0 TO 255 DO\n ftbl[i]:=1;\n END;\n wBf:=0; wbc:=0; rb1:=0; rb2:=0; rbc:=0;\n smc:=0;\n clcTab();\n END;\nEND iniHuf;\n\n\nPROCEDURE RawWrite(x: IOLink.DeviceTablePtr; buf: SYSTEM.ADDRESS;\n\t\tlen: CARDINAL);\nVAR\n i\t: CARDINAL;\n ch\t: CHAR;\n cht\t: charTap;\nBEGIN\n IF len = 0 THEN RETURN; END;\n ldt:=SYSTEM.CAST(lclDataTp,x^.cd);\n cht:=SYSTEM.CAST(charTap,buf);\n WITH ldt^ DO\n FOR i:=0 TO len-1 DO\n ch:=cht^[i];\n wrSmb(ch);\n IF ch = 377C THEN wrSmb(ch); END;\n ftbl[ORD(ch)]:=ftbl[ORD(ch)]+1; smc:=smc+1;\n IF smc=rbldFrq THEN\n\tclcTab();\n\tsmc:=0;\n END;\n END;\n END;\n x^.result:=IOChan.ReadResult(ldt^.chid);\nEND RawWrite;\n\nPROCEDURE RawRead(x: IOLink.DeviceTablePtr; buf: SYSTEM.ADDRESS;\n\t\tblen: CARDINAL; VAR len: CARDINAL);\nVAR\n i\t: CARDINAL;\n cht\t: charTap;\n ch\t: CHAR;\nBEGIN\n ldt:=SYSTEM.CAST(lclDataTp,x^.cd);\n cht:=SYSTEM.CAST(charTap,buf);\n IF (blen=0) OR (x^.result<>IOConsts.allRight) THEN len:=0; RETURN; END;\n WITH ldt^ DO\n FOR i:=0 TO blen-1 DO\n ch:=getSym();\n IF ch = 377C THEN\n\tch:=getSym();\n\tIF ch = 0C THEN\n\t x^.result:=IOConsts.endOfInput;\n\t len:=i; cht^[i]:=0C;\n\t RETURN;\n\tEND;\n END;\n cht^[i]:=ch;\n ftbl[ORD(ch)]:=ftbl[ORD(ch)]+1; smc:=smc+1;\n IF smc=rbldFrq THEN\n\tclcTab();\n\tsmc:=0;\n END;\n END;\n len:=blen;\n END;\nEND RawRead;\n\nPROCEDURE CreateAlias(VAR cid: ChanId; io: ChanId; VAR res: OpenResults);\nVAR\n x\t: IOLink.DeviceTablePtr;\nBEGIN\n IOLink.MakeChan(did,cid);\n IF cid = IOChan.InvalidChan() THEN\n res:=ChanConsts.outOfChans\n ELSE\n NEW(ldt);\n IF ldt=NIL THEN\n IOLink.UnMakeChan(did,cid);\n res:=ChanConsts.outOfChans;\n RETURN;\n END;\n x:=IOLink.DeviceTablePtrValue(cid,did,IOChan.notAvailable,\"\");\n ldt^.chid:=io;\n x^.cd:=ldt;\n x^.doRawWrite:=RawWrite;\n x^.doRawRead:=RawRead;\n res:=ChanConsts.opened;\n iniHuf();\n x^.result:=IOConsts.allRight;\n END;\nEND CreateAlias;\n\nPROCEDURE DeleteAlias(VAR cid: ChanId);\nVAR\n x\t: IOLink.DeviceTablePtr;\nBEGIN\n x:=IOLink.DeviceTablePtrValue(cid,did,IOChan.notAvailable,\"\");\n ldt:=x^.cd;\n IF ldt^.rbc=0 THEN\n wrSmb(377C);\n wrSmb(0C);\n flush();\n END;\n DISPOSE(ldt);\n IOLink.UnMakeChan(did,cid);\nEND DeleteAlias;\n\nBEGIN\n IOLink.AllocateDeviceId(did);\nEND HuffChan.\n" ], "url": "https://github.com/harogaston/Sublime-Modula-2" }, "helloWorldCollection": [ "(* Hello World in Modula-2 *)\n\nMODULE HelloWorld;\nFROM InOut IMPORT WriteString,WriteLn;\nBEGIN\n WriteString(\"Hello World!\");\n WriteLn;\nEND HelloWorld.\n" ], "leachim6": { "filepath": "m/Modula 2.mod", "example": [ "MODULE HelloWorld;\n\nFROM Terminal2 IMPORT WriteString, WriteLn;\n\nBEGIN\n\n WriteString(\"Hello World\");\n WriteLn;\n \nEND HelloWorld." ], "id": "Modula 2" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Modula-2", "indeedJobs": { "2022": 0, "query": "modula-2 developer" }, "officialBlogUrl": [ "https://freepages.modula2.org/oldnew.html" ], "downloadPageUrl": [ "https://www.modula2.org/adwm2/download.php" ], "tiobe": { "id": "Modula-2" }, "hopl": "https://hopl.info/showlanguage.prx?exp=817", "gdbSupport": true, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1985|Springer-Verlag|Programming in Modula-2 (Texts and monographs in computer science)|Wirth, Niklaus|9780387150789", "semanticScholar": "" }, "modula-2p": { "title": "Modula-2+", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d81c6d945138c6482837f0a98f2ef9ee3cf224a2" ], "country": [ "Canada" ], "originCommunity": [ "Uniiversity of Toronto" ], "supersetOf": [ "modula-2" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1101", "centralPackageRepositoryCount": 0 }, "modula-3-star": { "title": "Modula-3*", "appeared": 1993, "type": "pl", "reference": [ "http://people.csail.mit.edu/heinz/ps/jspp93.ps.gz", "https://semanticscholar.org/paper/140498928dc2eedb576ac9244d4fc1c4544dc4ff" ], "country": [ "Germany" ], "originCommunity": [ "University of Karlsruhe" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1737", "centralPackageRepositoryCount": 0 }, "modula-3": { "title": "Modula-3", "appeared": 1986, "type": "pl", "website": "http://www.modula3.org", "documentation": [ "https://modula3.elegosoft.com/cm3/doc/tutorial/m3/m3_toc.html" ], "reference": [ "https://www.cs.purdue.edu/homes/hosking/m3/reference/syntax.html" ], "aka": [ "m3" ], "country": [ "United States and Germany" ], "originCommunity": [ "Digital Equipment Corporation", "elego Software Solutions GmbH" ], "domainName": { "registered": 2007, "name": "modula3.org" }, "releaseNotesUrl": "http://www.opencm3.net/releng/relnotes-5.8.6.html", "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "AND", "ANY", "ARRAY", "AS", "BEGIN", "BITS", "BRANDED", "BY", "CASE", "CONST", "DIV", "DO", "ELSE", "ELSIF", "END", "EVAL", "EXCEPT", "EXCEPTION", "EXIT", "EXPORTS", "FINALLY", "FOR", "FROM", "GENERIC", "IF", "IMPORT", "IN", "INTERFACE", "LOCK", "LOOP", "METHODS", "MOD", "MODULE", "NOT", "OBJECT", "OF", "OR", "OVERRIDES", "PROCEDURE", "RAISE", "RAISES", "READONLY", "RECORD", "REF", "REPEAT", "RETURN", "REVEAL", "SET", "THEN", "TO", "TRY", "TYPE", "TYPECASE", "UNSAFE", "UNTIL", "UNTRACED", "VALUE", "VAR", "WHILE", "WITH" ], "wikipedia": { "example": [ "MODULE Person;\n\nREVEAL T = Public BRANDED \nOBJECT \n name: TEXT; (* These two variables *)\n age: INTEGER; (* are private. *)\nOVERRIDES\n getAge := Age;\n init := Init;\nEND;\n\nPROCEDURE Age(self: T): INTEGER =\n BEGIN\n RETURN self.age;\n END Age;\n\nPROCEDURE Init(self: T; name: TEXT; age: INTEGER): T =\n BEGIN\n self.name := name;\n self.age := age;\n RETURN self;\n END Init;\n\nBEGIN\nEND Person." ], "related": [ "modula-2", "pascal", "algol", "oberon", "java", "python", "caml", "csharp", "nim", "arm", "mesa", "object-pascal", "euclid", "c", "delphi", "scala", "obliq" ], "summary": "Modula-3 is a programming language conceived as a successor to an upgraded version of Modula-2 known as Modula-2+. While it has been influential in research circles (influencing the designs of languages such as Java, C#, and Python) it has not been adopted widely in industry. It was designed by Luca Cardelli, James Donahue, Lucille Glassman, Mick Jordan (before at the Olivetti Software Technology Laboratory), Bill Kalsow and Greg Nelson at the Digital Equipment Corporation (DEC) Systems Research Center (SRC) and the Olivetti Research Center (ORC) in the late 1980s. Modula-3's main features are simplicity and safety while preserving the power of a systems-programming language. Modula-3 aimed to continue the Pascal tradition of type safety, while introducing new constructs for practical real-world programming. In particular Modula-3 added support for generic programming (similar to templates), multithreading, exception handling, garbage collection, object-oriented programming, partial revelation and explicit mark of unsafe code. The design goal of Modula-3 was a language that implements the most important features of modern imperative languages in quite basic forms. Thus allegedly dangerous and complicating features such as multiple inheritance and operator overloading were omitted.", "pageId": 241545, "dailyPageViews": 84, "created": 2003, "backlinksCount": 137, "revisionCount": 336, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Modula-3" }, "githubLanguage": { "fileExtensions": [ "i3", "ig", "m3", "mg" ], "type": "programming", "aceMode": "text", "tmScope": "source.modula-3", "repos": 137, "id": "Modula-3" }, "githubBigQuery": { "repos": 19, "users": 18, "id": "Modula-3" }, "monaco": "m3", "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 2, "commitCount": 11, "sampleCount": 5, "example": [ "(* Copyright (C) 1989, Digital Equipment Corporation *)\n(* All rights reserved. *)\n(* See the file COPYRIGHT for a full description. *)\n\n(* Last modified on Fri Jun 18 16:18:48 PDT 1993 by wobber *)\n(* modified on Tue Jun 15 10:07:07 1993 by gnelson *)\n(* modified on Fri May 21 09:50:56 PDT 1993 by swart *)\n(* modified on Mon Apr 26 17:22:23 PDT 1993 by mcjones *)\n(* modified on Wed Nov 6 10:45:09 PST 1991 by kalsow *)\n(* modified on Fri Sep 28 23:12:34 1990 by muller *)\n\n\n(* The RdClass interface is analogous to the WrClass interface. It\nreveals that every reader contains a buffer of characters together\nwith methods for managing the buffer. New reader classes are created\nby importing RdClass (to gain access to the buffer and the methods)\nand then defining a subclass of Rd.T whose methods provide the new\nclass's behavior. The opaque type Private hides irrelevant details of\nthe class-independent code. *)\n \nINTERFACE RdClass;\nIMPORT Rd;\nFROM Thread IMPORT Alerted;\nFROM Rd IMPORT Failure;\n\nTYPE\n Private <: ROOT;\n SeekResult = {Ready, WouldBlock, Eof};\n\nREVEAL\n Rd.T =\n Private BRANDED OBJECT\n buff : REF ARRAY OF CHAR := NIL;\n Ungetbuff : REF ARRAY OF CHAR := NIL;\n Waitingbuff : REF ARRAY OF CHAR := NIL;\n st : CARDINAL; (* index into buff *)\n Ungetst : CARDINAL; (* index into Ungetbuff *) \n Waitingst : CARDINAL; (* index into WaitingBuff *)\n cur : CARDINAL := 0; (* index into src(rd) *)\n lo, hi : CARDINAL := 0; (* indexes into src(rd) *)\n Ungetlo, Ungethi : CARDINAL := 0; (* indexes into src(rd) *)\n Waitinglo, Waitinghi : CARDINAL := 0; (* indexes into src(rd) *)\n closed: BOOLEAN := TRUE; (* init method of the subtype should set\n this to FALSE *)\n seekable, intermittent: BOOLEAN;\n METHODS\n seek (n: CARDINAL; dontBlock: BOOLEAN): SeekResult\n RAISES {Failure, Alerted};\n (* ^rd is locked and not closed. *)\n getSub (VAR a: ARRAY OF CHAR): CARDINAL\n RAISES {Failure, Alerted} := GetSubDefault;\n (* ^rd is locked and not closed. *)\n length (): INTEGER RAISES {Failure, Alerted} := LengthDefault;\n (* ^rd is locked and not closed. *)\n close () RAISES {Failure, Alerted} := CloseDefault;\n END;\n\n(* Let rd be a reader, abstractly given by len(rd), src(rd), cur(rd),\navail(rd), closed(rd), seekable(rd), and intermittent(rd). The data\nfields cur, closed, seekable, and intermittent in the object represent\nthe corresponding abstract attributes of rd. The buff, st, lo, and hi\nfields represent a buffer that contains part of src(rd), the rest of\nwhich is represented in some class-specific way. \n\nMore precisely, we say that the state of the representation is valid\nif conditions V1 through V4 hold:\n\nV1. the characters of buff in the range [st .. st+(hi-lo)] accurately \n reflect src. That is, for all i in [rd.lo .. rd.hi-1],\n \n\trd.buff[rd.st + i - rd.lo] = src(rd)[i]\n\nV2. the cur field is in or just past the end of the occupied part of the \n buffer, that is:\n\n rd.lo <= rd.cur <= rd.hi\n\nV3. the reader does not claim to be both intermittent and seekable:\n\n\tNOT (rd.intermittent AND rd.seekable)\n\nIt is possible that buff = NIL in a valid state, since the range of\ni's in V1 may be empty; for example, in case lo = hi.\n\nV4. if closed(rd) then rd.buff = NIL AND rd.lo = rd.hi\n\nIf rd is valid and cur(rd) is less than rd.hi, we say the reader\nis ready. More precisely, rd is ready if:\n\n NOT rd.closed AND rd.buff # NIL AND rd.lo <= rd.cur < rd.hi\n\nIf the state is ready, then Rd.GetChar can be implemented by fetching\nfrom the buffer. Together V1, V2, and V4 imply that if rd.cur # rd.hi\nthen rd.buff # NIL and NOT rd.closed. Therefore a valid reader is ready\nif \"rd.cur # rd.hi\".\n\nThe class-independent code modifies rd.cur, but no other variables\nrevealed in this interface (except that \"Rd.Close\" modifies \"rd.lo\" and\n\"rd.cur\" and sets \"rd.buff\" to NIL in order to maintain invariant V4). The\nclass-independent code locks the reader before calling any methods.\n\nHere are the specifications for the methods:\n\nThe basic purpose of the seek method is to make the reader ready. To\nseek to a position n, the class-independent code checks whether the reader\nwould be ready with rd.cur = n and if so, simply sets rd.cur to n.\nIf not, it calls rd.seek supplying the position n as argument.\nAs in the case of writers, the seek method can be called even for an\nunseekable reader in the special case of advancing to the next buffer.\n\nThe fields with names beginning with \"Unget\" describe a buffer of characters \nretained in case they need to be reused by UngetChar. The fields with names \nbeginning with \"Waiting\" are a buffer once supplied by class-dependent code\nbut temporarily suspended while characters originally saved in the unget \nand then ungotten are being returned. If NIL#Ungetbuff=buff, we are accessing\npreviously ungotten characters from Ungetbuff^, and Waitingbuff is the buffer \nmost recently provided by seek. Otherwise, buff is the buffer most recently\nprovided by seek. Either way, the fast path in class-independent code for \ngetting characters works the same, using buff, st, lo, and hi, as in the \nearlier implementation, and ignoring the other buffer fields. \n\nSimilarly, (class-dependent) seek method bodies use only these same fields. \nOnly UngetChar and class-independent code surrounding seek method calls need\nbe aware of the additional two buffer pointers and their subscripts. \n\nThere is a wrinkle to support the implementation of CharsReady. If rd\nis ready, the class-independent code can handle the call to\nCharsReady(rd) without calling any methods (since there is at least\none character ready in the buffer), but if rd.cur = rd.hi, then the\nclass independent code needs to find out from the class implementation\nwhether any characters are ready in the next buffer. Using the seek\nmethod to advance to the next buffer won't do, since this could block,\nand CharsReady isn't supposed to block. Therefore, the seek method\ntakes a boolean argument saying whether blocking is allowed. If\nblocking is forbidden and the next buffer isn't ready, the method\nreturns the special value WouldBlock; this allows the\nclass-independent code to return zero from CharsReady. The \"dontBlock\"\nboolean should be \"TRUE\" only if the seek method is being used to advance\nto the next buffer.\n\nMore precisely, given a valid state where\n\n (n # rd.hi) => rd.seekable\nAND (dontBlock => n = rd.hi)\n\nthe call res := rd.seek(n, dontBlock) establishes a valid state.\nFurthermore, if res = Ready then rd is ready and rd.cur = n;\nwhile if res = Eof, then rd.cur = len(rd); and finally if res = WouldBlock\nthen dontBlock was TRUE and avail(rd) = cur(rd).\n\nThe getSub method is used to implement Rd.GetSub and is\ncalled with the reader lock held and the reader not closed. Efficient \nimplementations override this method to avoid unnecessary copying by reading \ndirectly from the reader source, bypassing the reader buffer. The default\nimplementation is correct for any class, but always copies through\nthe reader buffer.\n\nThe length method returns the length of a non-intermittent reader.\nThat is: Given a valid state in which rd.intermittent is FALSE, the\ncall rd.length() returns len(rd) without changing the state of rd. An\nintermittent reader may return the length if it is known, or -1.\n\nThe close method releases all resources associated with rd. The exact\nmeaning of this is class-specific. \"Rd.Close\" sets the \"buff\" field\nto \"NIL\", so the method need not do this. When the method is \ncalled the state will be valid; validity is not required when the \nmethod returns (since after it returns, the class-independent code \nwill set the closed bit in the reader, which makes the rest of \nthe state irrelevant).\n\nThe remainder of the interface is similar to the corresponding part \nof the WrClass interface: *)\n\nPROCEDURE Init(rd: Rd.T); \n(* Class-independent initialize rd, including private fields revealed herein. *)\n\nPROCEDURE Lock(rd: Rd.T) RAISES {};\n(* The reader rd must be unlocked; lock it and make its state valid. *)\n\nPROCEDURE Unlock(rd: Rd.T) RAISES {};\n(* The reader rd must be locked and valid; unlock it and restore the\nprivate invariant of the reader implementation. *)\n\nPROCEDURE GetSubDefault(rd: Rd.T; VAR (*OUT*) str: ARRAY OF CHAR): CARDINAL\n RAISES {Failure, Alerted};\n (* rd is locked and not closed. *)\n(* Implement \"getSub\" by copying from the buffer, calling the \"seek\"\n method as necessary. Clients can override this in order to\n achieve greater efficiency; for example, by copying directly\n from the source of the reader into \"str\". *)\n\nPROCEDURE LengthDefault(rd: Rd.T): INTEGER RAISES {Failure, Alerted};\n(* The procedure LengthDefault causes a checked runtime error; this\nrepresents an error in the (non-intermittent) class implementation. *)\n\nPROCEDURE CloseDefault(rd: Rd.T) RAISES {Failure, Alerted};\n(* The procedure CloseDefault is a no-op. *)\n\nEND RdClass.\n\n" ], "url": "https://github.com/newgrammars/m3" }, "helloWorldCollection": [ "(* Hello World in Modula-3 *)\n\nMODULE Hello EXPORTS Main;\n\nIMPORT IO;\n\nBEGIN\n IO.Put(\"Hello World!\\n\");\nEND Hello." ], "leachim6": { "filepath": "m/Modula 3.m3", "example": [ "MODULE HelloWorld;\nIMPORT Io;\nBEGIN\n IO.Put (\"Hello World\\n\")\nEND HelloWorld." ], "id": "Modula 3" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Modula-3", "downloadPageUrl": [ "http://www.opencm3.net/download.html" ], "tiobe": { "id": "Modula-3" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1411", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "modula-p": { "title": "Modula-P", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/55ac714f7d73449432275418cdaa18b231c27d2d" ], "country": [ "Germany" ], "originCommunity": [ "University of Karlsruhe" ], "hopl": "https://hopl.info/showlanguage.prx?exp=970", "centralPackageRepositoryCount": 0 }, "modula-r": { "title": "Modula/R", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0141e334a99f18470c623045b4acda77b0531332" ], "country": [ "Switzerland" ], "originCommunity": [ "ETH Zurich" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1046", "centralPackageRepositoryCount": 0 }, "modula": { "title": "Modula", "appeared": 1975, "type": "pl", "creators": [ "Niklaus Wirth" ], "country": [ "Switzerland" ], "originCommunity": [ "ETH Zurich" ], "hasAssignment": { "example": "", "value": true }, "assignmentToken": [ [ ":=" ] ], "wikipedia": { "related": [ "pascal", "alma-0", "go", "modula-2" ], "summary": "The Modula programming language is a descendant of the Pascal programming language. It was developed in Switzerland in the 1970s by Niklaus Wirth, the same person who designed Pascal. The main innovation of Modula over Pascal is a module system, used for grouping sets of related declarations into program units; hence the name Modula. The language is defined in a report by Wirth called Modula. A language for modular multiprogramming published 1976. Modula was first implemented by Niklaus Wirth himself on a PDP-11. Very soon other implementations followed, most important the University of York Modula compiler and a compiler developed at Philips Laboratories named PL Modula, which generated code for the LSI-11 microprocessor. The development of Modula was discontinued soon after its publication. Wirth then concentrated his efforts on Modula's successor, Modula-2.", "pageId": 20824, "dailyPageViews": 37, "created": 2002, "backlinksCount": 55, "revisionCount": 68, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Modula" }, "hopl": "https://hopl.info/showlanguage.prx?exp=771", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming in Modula-2|1982|Niklaus Wirth|18071084|3.60|5|0\nProgramming in Modula-2 (Texts and Monographs in Computer Science)|1985|Niklaus Wirth|2717625|3.14|7|0\nModula 2 For Pascal Programmers|1984|Richard Gleaves|4016916|0.0|0|0\nSystems Programming With Modula 3|1991|Greg Nelson|5007845|3.00|2|0\nSoftware Engineering and Modula-2|1984|Gustav Pomberger|2655108|0.0|0|0\nModula 2 Programming||I. Kaplan|4393413|0.0|0|0\nPortable Modula-2 Programming|1989|Mark Woodman|3649250|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1992|Addison-Wesley|Programming in Oberon: Steps Beyond Pascal and Modula|Reiser, Martin and Wirth, Niklaus|9780201565430\n2010|General Books|Modula Programming Language Family: Modula-3|Books and LLC|9781156290996\n1984|Prentice Hall Direct|Programming In Modula 2|I. Kaplan|9780137292943\n1987|Charles Merrill|Introduction Programming Using Modula 2|SUTCLIFFE|9780675218610\n1989|Mcgraw-hill|Programming In Modula 2 (schaum's Outline Series)|Tremblay|9780070651784\n1988|Prentice Hall|Modula 2: A Second Course In Programming (prentice Hall Advances In Computer Science Series)|K. J. Gough and George M. Mohay|9780135993903" }, "modular-prolog": { "title": "Modular Prolog", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/29b44e1ce6ecd6367468aa062282a86cd61519b9" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Oxford" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1697", "centralPackageRepositoryCount": 0 }, "module-management-system": { "title": "Module Management System", "appeared": 2005, "type": "pl", "description": "MMK is similar in functionality to Digital's DEC/Module Management System (MMS), and understands a syntax in its description files which is a superset of that which is understood by MMS.", "reference": [ "https://github.com/endlesssoftware/mmk" ], "country": [ "Australia" ], "originCommunity": [ "https://github.com/endlesssoftware" ], "hasLineComments": { "example": "! A comment", "value": true }, "hasComments": { "example": "! A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "!" ] ], "example": [ "!\n! $Id: descrip.mms 35 2008-01-08 21:37:42Z tmr $\n!\n! Project: LISP -- The LISP Interpreter\n! Created: 22-DEC-2008 18:35\n! Author: tmr\n\ncc = cc\ncflags = /define=\"_VMS_=1\" -\n/WARN=DISABLE=(ZERODIV,FLOATOVERFL,NOMAINUFLO) -\n/IEEE_MODE=UNDERFLOW_TO_ZERO/FLOAT=IEEE\ncore = LISP_CORE\nmain = LISP_MAIN\nexec = [.bin]LISP\nclib = SYS$LIBRARY:VAXCRTL\nhead = LISP_CORE\nobjs = $(core).obj, $(main).obj\n\n$(exec) : $(objs)\n DEFINE/NOLOG LNK$LIBRARY $(clib)\n LINK/EXEC=$(exec) $(objs)\n DEASSIGN LNK$LIBRARY\n\n$(core).obj : $(core).c, $(head).h\n\n$(main).obj : $(main).c, $(head).h\n\nclean :\n del *.obj;*\n del *.exe;*" ], "githubLanguage": { "fileExtensions": [ "mms", "mmk" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "descrip.mmk", "descrip.mms" ], "aceMode": "text", "tmScope": "none", "repos": 222790, "id": "Module Management System" }, "githubBigQuery": { "repos": 1322, "users": 1239, "id": "Module Management System" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "moescript": { "title": "Moescript", "appeared": 2012, "type": "pl", "creators": [ "Renzhi Li aka. Belleve Invis" ], "website": "https://github.com/yolio2003/moescript", "country": [ "China" ], "originCommunity": [ "University of Science and Technology of China" ], "githubRepo": { "stars": 3, "forks": 3, "subscribers": 1, "created": 2012, "updated": 2012, "description": "A not-very-but-still-light Javascript-targeted language. (and its runtime and libraries.)", "url": "https://github.com/yolio2003/moescript" }, "repoStats": { "firstCommit": 2012, "commits": 85, "committers": 1, "files": 37 } }, "moinmoin": { "title": "moinmoin", "appeared": 2000, "type": "textMarkup", "website": "http://moinmo.in/HelpOnMoinWikiSyntax", "country": [ "Germany" ], "originCommunity": [ "https://github.com/moinwiki" ], "example": [ "Table of contents:\n<>\n\nTable of contents (up to 2nd level headings only):\n<>\n\n= heading 1st level =\n== heading 2nd level ==\n=== heading 3rd level ===\n==== heading 4th level ====\n===== heading 5th level =====\n====== no heading 6th level ======" ] }, "mojo": { "title": "Mojo", "appeared": 2022, "type": "pl", "creators": [ "Chris Lattner" ], "description": "Mojo combines the usability of Python with the performance of C, unlocking unparalleled programmability of AI hardware and extensibility of AI models.", "website": "https://www.modular.com/mojo", "documentation": [ "https://docs.modular.com/mojo/" ], "fileExtensions": [ "mojo" ], "releaseNotesUrl": "https://docs.modular.com/mojo/changelog.html", "influencedBy": [ "python", "c", "mlir" ], "lineCommentToken": [ [ "#" ] ], "example": [ "def softmax(lst):\n norm = np.exp(lst - np.max(lst))\n return norm / norm.sum()\n\nstruct NDArray:\n def max(self) -> NDArray:\n return self.pmap(SIMD.max)\n\nstruct SIMD[type: DType, width: Int]:\n def max(self, rhs: Self) -> Self:\n return (self >= rhs).select(self, rhs)" ], "githubRepo": { "stars": 1577, "forks": 28, "subscribers": 73, "created": 2023, "updated": 2023, "description": "The Mojo Programming Language", "issues": 15, "url": "https://github.com/modularml/mojo" }, "repoStats": { "firstCommit": 2023, "commits": 11, "committers": 1, "files": 3 }, "discord": "https://www.discord.gg/modular", "isOpenSource": false }, "molecular-query-language": { "title": "Molecular Query Language", "appeared": 2007, "type": "queryLanguage", "description": "We have developed a Java library for substructure matching that features easy-to-read syntax and extensibility. This molecular query language (MQL) is grounded on a context-free grammar, which allows for straightforward modification and extension. The formal description of MQL is provided in this paper. Molecule primitives are atoms, bonds, properties, branching, and rings. User-defined features can be added via a Java interface. In MQL, molecules are represented as graphs. Substructure matching was implemented using the Ullmann algorithm because of favorable run-time performance. The Ullmann algorithm carries out a fast subgraph isomorphism search by combining backtracking with effective forward checking. MQL software design was driven by the aim to facilitate the use of various cheminformatics toolkits. Two Java interfaces provide a bridge from our MQL package to an external toolkit: the first one provides the matching rules for every feature of a particular toolkit; the second one converts the found match from the internal format of MQL to the format of the external toolkit. We already implemented these interfaces for the Chemistry Development Toolkit.", "reference": [ "https://pubs.acs.org/doi/full/10.1021/ci600305h" ], "country": [ "Germany" ], "originCommunity": [ "Goethe University Frankfurt" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Molecular_Query_Language" } }, "molfile-format": { "title": "Molfile", "appeared": 1979, "type": "textDataFormat", "description": "An MDL Molfile is a file format for holding information about the atoms, bonds, connectivity and coordinates of a molecule. The molfile consists of some header information, the Connection Table (CT) containing atom info, then bond connections and types, followed by sections for more complex information. The molfile is sufficiently common that most, if not all, cheminformatics software systems/applications are able to read the format, though not always to the same degree. It is also supported by some computational software such as Mathematica. The current de facto standard version is molfile V2000; although, more recently, the V3000 format has been circulating widely enough to present a potential compatibility issue for those applications that are not yet V3000-capable.", "reference": [ "https://en.wikipedia.org/wiki/Chemical_table_file" ], "fileExtensions": [ "mol" ], "country": [ "United States" ], "originCommunity": [ "MDL Information Systems, Inc" ], "example": [ "C8H10N4O2\nAPtclcactv11291901553D 0 0.00000 0.00000\n \n 24 25 0 0 0 0 0 0 0 0999 V2000\n 1.3120 -1.0479 0.0025 N 0 0 0 0 0 0 0 0 0 0 0 0\n 2.2465 -2.1762 0.0031 C 0 0 0 0 0 0 0 0 0 0 0 0\n 1.7906 0.2081 0.0010 C 0 0 0 0 0 0 0 0 0 0 0 0\n 2.9938 0.3838 0.0002 O 0 0 0 0 0 0 0 0 0 0 0 0\n 0.9714 1.2767 -0.0001 N 0 0 0 0 0 0 0 0 0 0 0 0\n 1.5339 2.6294 -0.0017 C 0 0 0 0 0 0 0 0 0 0 0 0\n -0.4026 1.0989 -0.0001 C 0 0 0 0 0 0 0 0 0 0 0 0\n -1.4446 1.9342 -0.0010 N 0 0 0 0 0 0 0 0 0 0 0 0\n -2.5608 1.2510 -0.0000 C 0 0 0 0 0 0 0 0 0 0 0 0\n -2.2862 -0.0680 0.0015 N 0 0 0 0 0 0 0 0 0 0 0 0\n -3.2614 -1.1612 0.0029 C 0 0 0 0 0 0 0 0 0 0 0 0\n -0.9114 -0.1939 0.0014 C 0 0 0 0 0 0 0 0 0 0 0 0\n -0.0163 -1.2853 -0.0022 C 0 0 0 0 0 0 0 0 0 0 0 0\n -0.4380 -2.4279 -0.0068 O 0 0 0 0 0 0 0 0 0 0 0 0\n 3.2697 -1.8004 0.0022 H 0 0 0 0 0 0 0 0 0 0 0 0\n 2.0830 -2.7828 0.8938 H 0 0 0 0 0 0 0 0 0 0 0 0\n 2.0821 -2.7846 -0.8862 H 0 0 0 0 0 0 0 0 0 0 0 0\n 2.6223 2.5703 -0.0019 H 0 0 0 0 0 0 0 0 0 0 0 0\n 1.1987 3.1611 -0.8923 H 0 0 0 0 0 0 0 0 0 0 0 0\n 1.1990 3.1632 0.8877 H 0 0 0 0 0 0 0 0 0 0 0 0\n -3.5520 1.6797 -0.0001 H 0 0 0 0 0 0 0 0 0 0 0 0\n -3.5037 -1.4333 -1.0244 H 0 0 0 0 0 0 0 0 0 0 0 0\n -2.8389 -2.0244 0.5173 H 0 0 0 0 0 0 0 0 0 0 0 0\n -4.1672 -0.8395 0.5168 H 0 0 0 0 0 0 0 0 0 0 0 0\n 1 2 1 0 0 0 0\n 1 3 1 0 0 0 0\n 3 4 2 0 0 0 0\n 3 5 1 0 0 0 0\n 5 6 1 0 0 0 0\n 5 7 1 0 0 0 0\n 7 8 1 0 0 0 0\n 8 9 2 0 0 0 0\n 9 10 1 0 0 0 0\n 10 11 1 0 0 0 0\n 10 12 1 0 0 0 0\n 7 12 2 0 0 0 0\n 12 13 1 0 0 0 0\n 1 13 1 0 0 0 0\n 13 14 2 0 0 0 0\n 2 15 1 0 0 0 0\n 2 16 1 0 0 0 0\n 2 17 1 0 0 0 0\n 6 18 1 0 0 0 0\n 6 19 1 0 0 0 0\n 6 20 1 0 0 0 0\n 9 21 1 0 0 0 0\n 11 22 1 0 0 0 0\n 11 23 1 0 0 0 0\n 11 24 1 0 0 0 0\nM END\n$$$$" ] }, "molog": { "title": "Molog", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/22660f9fe0dedfb30630222089845046e3fb3519" ], "country": [ "France" ], "originCommunity": [ "Université Paul Sabatier" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5066", "centralPackageRepositoryCount": 0 }, "monaco": { "title": "Monaco Editor", "appeared": 2016, "type": "editor", "description": "The Monaco Editor is the code editor that powers VS Code.", "website": "https://microsoft.github.io/monaco-editor/", "webRepl": [ "https://microsoft.github.io/monaco-editor/playground.html" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "related": [ "codemirror" ], "githubRepo": { "firstCommit": 2016, "stars": 30060, "forks": 2875, "subscribers": 511, "created": 2016, "updated": 2022, "description": "A browser based code editor", "issues": 704, "url": "https://github.com/Microsoft/monaco-editor" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mond": { "title": "Mond", "appeared": 2014, "type": "pl", "creators": [ "Rohan Singh" ], "description": "A scripting language for C# which can be embedded in Lua-like manner.", "website": "https://web.archive.org/web/20160429013247/https://rohbot.net/mond/", "country": [ "Canada" ], "originCommunity": [ "https://github.com/Rohansi/Mond" ], "keywords": [ "Infinity", "NaN", "break", "case", "const", "continue", "debugger", "default", "do", "else", "false", "for", "foreach", "fun", "global", "if", "in", "null", "return", "seq", "switch", "true", "undefined", "var", "while", "yield" ], "example": [ "// documentation can be found here: https://github.com/Rohansi/Mond/wiki\nseq range(start, end) {\n for (var i = start; i <= end; i++)\n yield i;\n}\n\nseq where(list, filter) {\n foreach (var x in list) {\n if (filter(x))\n yield x;\n }\n}\n\nseq select(list, transform) {\n foreach (var x in list)\n yield transform(x);\n}\n\nfun toArray(list) {\n var array = [];\n\n foreach (var value in list) {\n array.add(value);\n }\n\n return array;\n}\n\nreturn range(0, 1000)\n |> where(x -> x % 2 == 0)\n |> select(x -> x / 2)\n |> toArray();" ], "githubRepo": { "stars": 292, "forks": 22, "subscribers": 17, "created": 2014, "updated": 2022, "description": "A scripting language for .NET Core", "url": "https://github.com/Rohansi/Mond" }, "repoStats": { "firstCommit": 2014, "commits": 574, "committers": 11, "files": 259 } }, "monesa": { "title": "Monesa", "appeared": 2002, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Monesa" }, "centralPackageRepositoryCount": 0 }, "mongodb": { "title": "MongoDB", "appeared": 2009, "type": "application", "website": "https://www.mongodb.com/", "documentation": [ "https://www.mongodb.com/docs/" ], "originCommunity": [ "https://www.mongodb.com/community/forums/" ], "domainName": { "registered": 2008, "awisRank": { "2022": 1421 }, "name": "mongodb.com" }, "writtenIn": [ "cpp", "c", "javascript" ], "hasComments": { "example": "$comment: \"A comment\"", "value": true }, "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "keywords": [ "find", "findOne", "drop", "createIndex" ], "githubRepo": { "stars": 22031, "forks": 5252, "subscribers": 1232, "created": 2009, "updated": 2022, "firstCommit": 2007, "description": "The MongoDB Database", "issues": 57, "url": "https://github.com/mongodb/mongo" }, "wikipedia": { "related": [ "c", "javascript", "linux", "solaris", "freebsd", "json", "nginx-config", "sql" ], "summary": "MongoDB (from humongous) is a free and open-source cross-platform document-oriented database program. Classified as a NoSQL database program, MongoDB uses JSON-like documents with schemas. MongoDB is developed by MongoDB Inc., and is published under a combination of the GNU Affero General Public License and the Apache License.", "pageId": 21855450, "dailyPageViews": 1760, "created": 2009, "backlinksCount": 348, "revisionCount": 1385, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/MongoDB" }, "rijuRepl": { "example": [ "db.collection.find() " ], "id": "https://riju.codes/mongodb" }, "indeedJobs": { "2022": 1243, "query": "mongodb developer and dba" }, "linkedInSkill": { "2018": 254440, "id": "MongoDB" }, "subreddit": [ { "memberCount": { "2022": 17286 }, "url": "https://www.reddit.com/r/mongodb" } ], "twitter": "https://twitter.com/mongodb", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\n50 Tips and Tricks for MongoDB Developers|2011|Kristina Chodorow|16286777|3.63|60|5\nMongodb (Programming)|2014|Paula Drew|42282006|3.00|2|0" }, "monkey": { "title": "Monkey", "appeared": 2011, "type": "pl", "creators": [ "Anthony Diamond" ], "website": "https://web.archive.org/web/20171205070657/http://monkey-x.com/", "documentation": [ "https://regal-internet-brothers.github.io/monkey/docs/Tutorials_Getting%20started.html" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/Regal-Internet-Brothers" ], "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "' \\$[0-9a-fA-Z]+", "value": true }, "hasFloats": { "example": "' [0-9]+\\.[0-9]*(?!\\.)", "value": true }, "hasIntegers": { "example": "' [0-9]+", "value": true }, "hasBinaryNumbers": { "example": "' \\%[10]+", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "'" ] ], "printToken": [ [ "puts" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2015, "stars": 0, "forks": 0, "subscribers": 3, "created": 2015, "updated": 2016, "description": "A modified version of the TransCC \"driver\" for Monkey's compiler, adapted slightly to work in web browsers.", "issues": 1, "url": "https://github.com/Regal-Internet-Brothers/webcc-monkey" }, "repoStats": { "firstCommit": 2015, "commits": 36, "committers": 5, "files": 116 }, "wikipedia": { "example": [ "' The 'Player' class, as referenced previously (Placement does not matter):\nClass Player\n ' Declare all of our fields (Class-local variables):\n \n ' These two variables will act as our position on the screen.\n ' (Alternatively, an 'Array or third-party class could be used)\n Field x:Float, y:Float\n \n ' This will be a reference to an 'Image' object we'll specify.\n Field image:Image\n \n ' Constructor(s):\n \n ' Overloading 'New' mainly works the same way as constructors in other languages.\n ' Returning is generally not recommended for constructors.\n Method New(img:Image, x:Float=100, y:Float=100)\n ' Due to the arguments using the same names, 'Self'\n ' is required to resolve our fields' names:\n Self.image = img\n \n Self.x = x\n Self.y = y\n End\n \n ' Methods:\n \n ' This will be our main render-method for this object:\n Method Draw:Void()\n ' Draw the 'image' object to the screen using our 'x' and 'y' fields.\n DrawImage(image, x, y)\n \n ' Returning in a 'Void' function is not required. (Some still recommend it)\n Return\n End\nEnd" ], "related": [ "linux", "blitzbasic", "c", "csharp", "javascript", "java", "basic", "android", "ios", "python", "opengl", "webgl", "objective-c", "llvmir", "haxe" ], "summary": "Monkey X is a high-level programming language designed for video game development for many different platforms, including desktop and laptop computers, mobile phones, tablets, and video game consoles. The language itself is an object-oriented dialect of BASIC, which the compiler translates into native source code for several target platforms. The resulting code is then compiled normally. Currently the official target platforms include: Windows (Including the Windows 8 store), OS X, Linux, Xbox 360, Android, iOS, among others. Community-driven, user-made targets have also been created, some notable user-targets include: MonkeyMax (BlitzMax), Monkey-Python (Python), and a Nintendo DS target.Monkey X's main implementation (compiler), and a number of official modules are open source. Monkey X's main application/game framework, Mojo, is partially commercial. The compiler and most of the official modules can be found on GitHub. Monkey is also distributed in several compiled binary forms from its official website (registration required, to build the compiler). For details, see: Mojo (framework), and Game targets (technical).", "pageId": 31116115, "created": 2013, "backlinksCount": 91, "revisionCount": 1, "dailyPageViews": 14, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Monkey_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "monkey", "monkey2" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.monkey", "repos": 254, "id": "Monkey" }, "githubBigQuery": { "repos": 116, "users": 53, "id": "Monkey" }, "pygmentsHighlighter": { "filename": "basic.py", "fileExtensions": [ "monkey" ], "id": "Monkey" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2016, "committerCount": 4, "commitCount": 113, "sampleCount": 5, "example": [ "'Showcases use of Lambda functions and Generics.\n\n#Import \"\"\nUsing std..\n\nFunction Main()\n\n\tLocal testStack := New Stack< MyObject >\n\t\n\tFor Local n := 1 To 20\n\t\tLocal newItem := New MyObject\n\t\tnewItem.depth = Rnd( 0, 100 )\n\t\ttestStack.Push( newItem )\n\tNext\n\t\t\n\ttestStack.Sort( Lambda:Int( x:MyObject,y:MyObject )\n\t\tReturn x.depth<=>y.depth\n\tEnd )\n\t\n\tFor Local n := Eachin testStack\n\t\tPrint( n.depth )\n\tNext\n\t\nEnd\n\n\nStruct MyObject\n\tField depth := 0\nEnd" ], "url": "https://github.com/gingerbeardman/monkey.tmbundle" }, "leachim6": { "filepath": "m/Monkey", "example": [ "puts(\"Hello World\")\n" ], "id": "Monkey" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Monkey", "fileType": "text", "wordRank": 6182, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2018|Pakalana Publishing|Addicted to the Monkey Mind: Change the Programming That Sabotages Your Life|Benoist, J.F.|9780692978597\n2018|Pakalana Publishing|Addicted to the Monkey Mind: Change the Programming That Sabotages Your Life|Benoist, J.F.|9780578333663\n2016|O'Reilly Media|Programming Beyond Practices: Be More Than Just a Code Monkey|Brown, Gregory T|9781491943823", "semanticScholar": "" }, "monodevelop-editor": { "title": "MonoDevelop", "appeared": 2003, "type": "editor", "aka": [ "Xamarin Studio" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/MonoDevelop" } }, "monte": { "title": "monte", "appeared": 2014, "type": "pl", "description": "Monte is a dynamic programming language inspired by Python and E.", "country": [ "United States" ], "originCommunity": [ "https://github.com/monte-language" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "printToken": [ [ "traceln" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 72, "forks": 11, "subscribers": 13, "created": 2014, "updated": 2022, "firstCommit": 2008, "description": "A dynamic language inspired by Python and E.", "issues": 12, "url": "https://github.com/monte-language/monte" }, "repoStats": { "firstCommit": 2008, "commits": 1029, "committers": 22, "files": 76 }, "pygmentsHighlighter": { "filename": "monte.py", "fileExtensions": [ "mt" ], "id": "Monte" }, "leachim6": { "filepath": "m/Monte.mt", "fileExtensions": [ "mt" ], "example": [ "traceln(\"Hello World\")\n" ], "id": "Monte" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Monte", "fileType": "text", "wordRank": 8540, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2009|Springer Verlag|Introducing Monte Carlo Methods with R (Use R!)|Christian P. Robert and George Casella|9781441915757\n2002|Wiley|Monte Carlo Methods in Finance|Jaeckel, Peter|9780471497417\n2009|Wiley|Monte Carlo Frameworks: Building Customisable High-performance C++ Applications|Duffy, Daniel J. and Kienitz, Joerg|9780470060698\n2013|Springer|Finance with Monte Carlo (Springer Undergraduate Texts in Mathematics and Technology)|Shonkwiler, Ronald W.|9781461485117\n2012|Springer|The Monte Carlo Simulation Method for System Reliability and Risk Analysis (Springer Series in Reliability Engineering)|Zio, Enrico|9781447145882\n2018|Gatekeeper Press|Practical Monte Carlo Simulation with Excel - Part 2 of 2: Applications and Distributions|Najjar, Akram|9781642371574\n2007|Wiley-Interscience|Solutions Manual to Accompany Simulation and the Monte Carlo Method (Wiley Series in Probability and Statistics)|Kroese, Dirk P. and Taimre, Thomas and Botev, Zdravko I. and Rubinstein, Reuven Y.|9780470258798\n2009|Springer|Introducing Monte Carlo Methods with R (Use R!)|Robert, Christian and Casella, George|9781441915764\n2010|Springer|Monte Carlo Statistical Methods (Springer Texts in Statistics)|Christian P. Robert|9781441919397\n2009|Springer|Explorations in Monte Carlo Methods (Undergraduate Texts in Mathematics)|Shonkwiler, Ronald W. and Mendivil, Franklin|9780387878379\n2009|Springer|Explorations in Monte Carlo Methods (Undergraduate Texts in Mathematics)|Shonkwiler|9780387878362\n1998|SAS Institute|SAS for Monte Carlo Studies: A Guide for Quantitative Researchers|Fan Ph.D., Xitao|9781590471418\n2005|Duxbury Press|A First Course in Monte Carlo|Fishman, George|9780534420468\n2012|Springer|A Monte Carlo Primer: A Practical Approach to Radiation Transport|Dupree, Stephen A. and Fraley, Stanley K.|9781441984913\n2012|Springer|Monte Carlo Simulation in Statistical Physics: An Introduction (Graduate Texts in Physics)|Binder, Kurt|9783642264467" }, "moo": { "title": "MOO", "appeared": 1993, "type": "pl", "standsFor": "MUD, object-oriented", "country": [ "Canada" ], "originCommunity": [ "University of Waterloo" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "player:tell" ] ], "stringToken": [ [ "\"" ] ], "example": [ "@program toy:wind\nthis.wound = this.wound + 2;\nplayer:tell(\"You wind up the \", this.name,\".\");\nplayer.location:announce(player.name, \" winds up the \", this.name,\".\");\n.\n" ], "wikipedia": { "example": [ "@program toy:wind\n if (this.location == player)\n if (this.wound < this.maximum)\n this.wound = this.wound + 2;\n player:tell(\"You wind up the \", this.name,\".\");\n player.location:announce(player.name, \" winds up the \", this.name,\".\");\n if (this.wound >= this.maximum)\n player:tell(\"The knob comes to a stop while winding.\");\n endif\n else\n player:tell(\"The \",this.name,\" is already fully wound.\");\n endif\n else\n player:tell(\"You have to be holding the \", this.name,\".\");\n endif\n ." ], "related": [ "scheme", "smalltalk", "self", "c", "ada", "muf", "lpc", "pike", "linden-scripting-language" ], "summary": "The MOO programming language is a relatively simple programming language used to support the MOO Server. It is dynamically typed and uses a prototype-based object-oriented system, with syntax roughly derived from the Algol school of programming languages.", "pageId": 20178, "dailyPageViews": 12, "created": 2001, "backlinksCount": 67, "revisionCount": 119, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/MOO_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "moo" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 83, "id": "Moocode" }, "githubBigQuery": { "repos": 23, "users": 23, "id": "Moocode" }, "helloWorldCollection": [ "\"Hello World in MOO\";\n\nplayer.location:announce_all(\"Hello, world!\");" ], "leachim6": { "filepath": "m/Moo.moo", "fileExtensions": [ "moo" ], "example": [ "@program hello:run\nplayer:tell(\"Hello World\");\n." ], "id": "Moo" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MOO", "tiobe": { "id": "MOO" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "mool": { "title": "MINI OBJECT-ORIENTED LANGUAGE", "appeared": 2010, "type": "pl", "description": "Mool is a mini object-oriented language in a Java-like style with support for concurrency, that allows programmers to specify class usage protocols as types.", "website": "http://rss.di.fc.ul.pt/tools/mool/", "reference": [ "http://gloss.di.fc.ul.pt/tryit/tools/Mool" ], "country": [ "Portugal" ], "originCommunity": [ "Universidade de Lisboa" ], "example": [ "class File { \n usage lin{open; Read} where \n Read = lin{eof; };\n ...\n}" ], "centralPackageRepositoryCount": 0 }, "moonrock-basic-compiler": { "title": "Moonrock Basic Compiler", "appeared": 1994, "type": "pl", "creators": [ "Rowan Crowe" ], "country": [ "Australia" ], "originCommunity": [ "http://www.rowan.sensation.net.au" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Moonrock_Basic_Compiler" }, "centralPackageRepositoryCount": 0 }, "moonscript": { "title": "MoonScript", "appeared": 2011, "type": "pl", "website": "http://moonscript.org/", "webRepl": [ "http://moonscript.org/compiler/" ], "documentation": [ "https://moonscript.org/reference/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/leafo/moonscript/issues" ], "domainName": { "awisRank": { "2017": 759106, "2022": 4629577 }, "name": "moonscript.org" }, "compilesTo": [ "lua" ], "writtenIn": [ "lua" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "class Thing\n name: \"unknown\"\n\nclass Person extends Thing\n say_name: => print \"Hello, I am #{@name}!\"\n\nwith Person!\n .name = \"MoonScript\"\n \\say_name!" ], "githubRepo": { "stars": 2801, "forks": 194, "subscribers": 91, "created": 2011, "updated": 2022, "firstCommit": 2011, "description": ":crescent_moon: A language that compiles to Lua", "issues": 181, "url": "https://github.com/leafo/moonscript" }, "repoStats": { "firstCommit": 2011, "commits": 845, "committers": 38, "files": 159 }, "githubLanguage": { "fileExtensions": [ "moon" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "moon" ], "aceMode": "text", "tmScope": "source.moonscript", "repos": 818, "id": "MoonScript" }, "githubBigQuery": { "repos": 359, "users": 276, "id": "MoonScript" }, "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "moon" ], "id": "MoonScript" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2015, "committerCount": 6, "commitCount": 26, "sampleCount": 1, "example": [ "\ntypes = require \"moonscript.types\"\nutil = require \"moonscript.util\"\ndata = require \"moonscript.data\"\n\nimport reversed, unpack from util\nimport ntype, mtype, build, smart_node, is_slice, value_is_singular from types\nimport insert from table\nimport NameProxy, LocalName from require \"moonscript.transform.names\"\n\ndestructure = require \"moonscript.transform.destructure\"\n\nlocal implicitly_return\n\nclass Run\n new: (@fn) =>\n self[1] = \"run\"\n\n call: (state) =>\n self.fn state\n\n-- transform the last stm is a list of stms\n-- will puke on group\napply_to_last = (stms, fn) ->\n -- find last (real) exp\n last_exp_id = 0\n for i = #stms, 1, -1\n stm = stms[i]\n if stm and mtype(stm) != Run\n last_exp_id = i\n break\n\n return for i, stm in ipairs stms\n if i == last_exp_id\n fn stm\n else\n stm\n\n-- is a body a sindle expression/statement\nis_singular = (body) ->\n return false if #body != 1\n if \"group\" == ntype body\n is_singular body[2]\n else\n true\n\nfind_assigns = (body, out={}) ->\n for thing in *body\n switch thing[1]\n when \"group\"\n find_assigns thing[2], out\n when \"assign\"\n table.insert out, thing[2] -- extract names\n out\n\nhoist_declarations = (body) ->\n assigns = {}\n\n -- hoist the plain old assigns\n for names in *find_assigns body\n for name in *names\n table.insert assigns, name if type(name) == \"string\"\n\n -- insert after runs\n idx = 1\n while mtype(body[idx]) == Run do idx += 1\n\n table.insert body, idx, {\"declare\", assigns}\n\nexpand_elseif_assign = (ifstm) ->\n for i = 4, #ifstm\n case = ifstm[i]\n if ntype(case) == \"elseif\" and ntype(case[2]) == \"assign\"\n split = { unpack ifstm, 1, i - 1 }\n insert split, {\n \"else\", {\n {\"if\", case[2], case[3], unpack ifstm, i + 1}\n }\n }\n return split\n\n ifstm\n\nconstructor_name = \"new\"\n\nwith_continue_listener = (body) ->\n continue_name = nil\n {\n Run =>\n @listen \"continue\", ->\n unless continue_name" ], "url": "https://github.com/leafo/moonscript-tmbundle" }, "leachim6": { "filepath": "m/Moonscript.moon", "fileExtensions": [ "moon" ], "example": [ "print 'Hello World'\n" ], "id": "Moonscript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MoonScript", "tryItOnline": "moonscript", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "moose": { "title": "MOOSE", "appeared": 1994, "type": "pl", "description": "MOOSE is a Maisie-based Object-Oriented Simulation Environment that uses inheritance to support iterative design of efficient simulation models. The novel features of MOOSE include its ability to describe complex guards that may be used by an object to specify dynamic enabling conditions for its methods and may also be inherited selectively by a derived object. MOOSE is the first simulation environment to suggest the use of inheritance in driving parallel implementations of an object that may exploit specific knowledge about the application, architecture, or simulation algorithm to improve its efficiency. The paper introduces object-oriented design of simulation models, gives an overview of MOOSE, and illustrates its use in the design of parallel simulation models. Experimental results are provided on the speedup achieved by a parallel simulation of a simple stochastic benchmark.", "reference": [ "https://semanticscholar.org/paper/1cc39dd769f48c27436451a3fe4d590d0a1a7940", "https://www.linkedin.com/in/jerrywaldorf" ], "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3552", "centralPackageRepositoryCount": 0 }, "morfa": { "title": "morfa", "appeared": 2015, "type": "pl", "description": "new programming language – general purpose and DSL-friendly", "website": "http://morfalang.org/", "reference": [ "https://github.com/fimapp/morfa-examples" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/fimapp" ], "domainName": { "name": "morfalang.org" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n10776921|Show HN: Morfa – new programming language – general purpose and DSL-friendly|2015-12-22 10:43:25 UTC|1450781005|piotrekim|3|32" }, "morfik": { "title": "Morfik", "appeared": 2000, "type": "pl", "country": [ "Australia" ], "originCommunity": [ "Morfik Technology Pty Ltd" ], "wikipedia": { "related": [ "java", "csharp", "basic", "object-pascal", "javascript", "linux", "free-pascal" ], "summary": "Morfik Technology Pty Ltd. is an Australian software company that was acquired by Altium in 2010. The company is known for developing a set of visual designers, compilers and a Framework combined in an Integrated development environment (IDE) aimed at developing Ajax applications in a high-level language such as Java, C#, BASIC or Object Pascal. Morfik includes visual design tools for Web interfaces, database structure, and queries. It supports the classic client–server model, however like all Ajax applications, the client-side code runs within a browser. The Morfik development tool converts the forms that the user draws into DHTML, compiles the client-logic into JavaScript, and builds the application and database server engines to house the server-side code.", "created": 2007, "backlinksCount": 97, "pageId": 10269359, "revisionCount": 301, "dailyPageViews": 26, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Morfik" }, "centralPackageRepositoryCount": 0 }, "morphe": { "title": "Morphe", "appeared": 1992, "type": "pl", "reference": [ "http://www.nzdl.org/cgi-bin/library?e=d-00000-00---off-0cstr--00-0----0-10-0---0---0direct-10---4-------0-1l--11-en-50---20-about---00-0-1-00-0--4----0-0-11-10-0utfZz-8-00&a=d&c=cstr&cl=CL1.150&d=HASH01a5f150cfaf4881b0a00b8f", "https://semanticscholar.org/paper/6ea84adad00261d3d1f97dcbb9b213a013c4d033" ], "country": [ "Japan" ], "originCommunity": [ "Sony Computer Science Laboratory Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5045", "centralPackageRepositoryCount": 0 }, "morphism": { "title": "MORPHISM", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bb9b6440f39612cdb15a10ab2dcb142fbd551a2e" ], "country": [ "France" ], "originCommunity": [ "Laboratoire de Calcul Automatique" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5733", "centralPackageRepositoryCount": 0 }, "morse-code": { "title": "Morse code", "appeared": 1837, "type": "notation", "documentation": [ "https://morsecode.readthedocs.io/en/latest/" ], "country": [ "United States" ], "example": [ "−− −−− ·−· ··· · −·−· −−− −·· ·" ], "wikipedia": { "example": [ "M O R S E C O D E\n−− −−− ·−· ··· · (space) −·−· −−− −·· ·" ], "related": [ "nato-phonetic-alphabet", "tap-code" ], "summary": "Morse code is a character encoding scheme used in telecommunication that encodes text characters as standardized sequences of two different signal durations called dots and dashes or dits and dahs. Morse code is named for Samuel F. B. Morse, an inventor of the telegraph. The International Morse Code encodes the ISO basic Latin alphabet, some extra Latin letters, the Arabic numerals and a small set of punctuation and procedural signals (prosigns). Each Morse code symbol is formed by a sequence of dots and dashes. The dot duration is the basic unit of time measurement in Morse code transmission. The duration of a dash is three times the duration of a dot. Each dot or dash within a character is followed by period of signal absence, called a space, equal to the dot duration. The letters of a word are separated by a space of duration equal to three dots, and the words are separated by a space equal to seven dots. To increase the efficiency of encoding, Morse code was designed so that the length of each symbol is approximately inverse to the frequency of occurrence in text of the English language character that it represents. Thus the most common letter in English, the letter \"E\", has the shortest code: a single dot. Because the Morse code elements are specified by proportion rather than specific time durations, the code is usually transmitted at the highest rate that the receiver is capable of decoding. The Morse code transmission rate (speed) is specified in groups per minute, commonly referred to as words per minute.Morse code is usually transmitted by on-off keying of an information carrying medium such as electric current, radio waves, visible light or sound waves. The current or wave is present during time period of the dot or dash and absent during the time between dots and dashes.Morse code can be memorized, and Morse code signalling in a form perceptible to the human senses, such as sound waves or visible light, can be directly interpreted by persons trained in the skill.Because many non-English natural languages use other than the 26 Roman letters, Morse alphabets have been developed for those languages. In an emergency, Morse code can be generated by improvised methods such as turning a light on and off, tapping on an object or sounding a horn or whistle, making it one of the simplest and most versatile methods of telecommunication. The most common distress signal is SOS – three dots, three dashes, and three dots – internationally recognized by treaty.", "created": 2001, "backlinksCount": 3444, "pageId": 18935, "dailyPageViews": 5843, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/Morse_code" }, "leachim6": { "filepath": "m/Morse code", "example": [ ".... . .-.. .-.. --- .-- --- .-. .-.. -..\n" ], "id": "Morse code" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "mortran": { "title": "Mortran", "appeared": 1973, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "wikipedia": { "example": [ "I = SQRT(X/2.0)\n A(I,K) = SQRT(X/2.0)\n J = SQRT(X/2.0)" ], "related": [ "fortran" ], "summary": "Mortran (More Fortran) is an extension of the Fortran programming language used for scientific computation. It introduces syntax changes, including the use of semicolons to end statements, in order to improve readability and flexibility. Mortran code is macro-processed into Fortran code for compilation. Note that Mortran, like many preprocessors, does not make a complete analysis of the Fortran source and, like many preprocessors, may not always make its assumptions/requirements explicit. Consider, for example, Mortran multiple assignment. From the Mortran User Guide: produces the following FORTRAN statements: In this example, the produced Fortran implements the multiple assignment correctly only if X is not aliased to I or to A(I,K), assuming the multiple assignment semantics are left to right.", "created": 2005, "backlinksCount": 6, "pageId": 1979848, "revisionCount": 25, "dailyPageViews": 8, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Mortran" }, "centralPackageRepositoryCount": 0 }, "motif-software": { "title": "Motif", "appeared": 1989, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Open Software Foundation" ], "wikipedia": { "related": [ "linux", "unix", "unicode" ], "summary": "In computing, Motif refers to both a graphical user interface (GUI) specification and the widget toolkit for building applications that follow that specification under the X Window System on Unix and Unix-like operating systems. Motif is the toolkit for the Common Desktop Environment and IRIX Interactive Desktop, thus it was the standard widget toolkit for Unix. Closely related to Motif is the Motif Window Manager (MWM). After many years as proprietary software, Motif was released in 2012, as free software under the GNU Lesser General Public License (LGPL).", "created": 2003, "backlinksCount": 273, "pageId": 222551, "revisionCount": 192, "dailyPageViews": 86, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Motif_(software)" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1998|Sigs|Using Motif With C++ (sigs: Advances In Object Technology)|Daniel J. Bernstein|9780132073905\n1992|Digital Press|Motif Programming: The Essentials... and More (HP Technologies)|Brain, Marshall|9781555580896\n1994|O'Reilly Media|Volume 6C: Motif Tools: Streamlined GUI Design and Programming with the Xmt Library|Flanagan, David|9781565920446\n1992|McGraw-Hill|Motif Programming in the X Window System Environment (The Unix/C)|Parrette, William A.|9780070317222\n1993|O'Reilly Media|Motif Programming Manual, Vol 6A (Definitive Guides to the X Window System)|Brennan, David and Heller, Dan and Ferguson, Paula|9781565920163\n1992|O'Reilly Media|X Toolkit Intrinsics Prog Vol 4M: Motif Edition (Definitive Guides to the X Window System)|Nye, Adrian and O'Reilly, Tim|9781565920132\n1992|Digital Press|X Window Sytem, Third Edition: The Complete Reference to Xlib, X Protocol, ICCM, XLFD, X Version 11, Release 5 (Digital Press X and Motif Series)|Rosenthal, David and Flowers, Jim and Scheifler, Robert and Gettys, James|9781555580889\n|O'Reilly Media|Motif Programming Manual (Definitive Guides to the X Window System)||9780937175705\n1993T|MIS Press|Power programming-- Motif|Foster-Johnson, Eric|9781558283220\n1998|New York : SIGS Books, c1995.|Objectifying Motif|Charles F. Bowman|9780132344364\n1991|Mis Pr|Power Programming Motif|Eric F. Johnson and Kevin Reichard|9781558280618\n1993|Mis Pr|Power Programming... Motif|Eric F. Johnson and Kevin Reichard|9781558283190\n1992|Springer Verlag|Programming With Motif|Keith D. Gregory|9783540978770\n||Motif Programming Manual|Dan Heller and Paula M. Ferguson|9780596000431\n1994|Prentice Hall|Advanced Motif Programming Techniques|Alistair George and Mark Riches|9780132199650\n1992|Digital Press|Motif Programming: The Essentials... And More (digital Press X & Motif Series)|Marshall Brain|9780134893785\n1996|Elsevier Science & Technology Books|Exploring Workstation Applications in CDE and Motif|Katherine Haramundanis|9781555581510\n2001||Motif Programming Tips And Tricks, With Cd-rom|Clayton and Don and Parker and Tim|9780135882122\n1993|Mcgraw-hill Osborne Media|Motif Programming In The X Window System Environment (macgraw-hill Unix/c Series)|William A. Parrette|9780070317239" }, "mountain": { "title": "mountain", "appeared": 2019, "type": "pl", "description": "A (hopefully) fast, C compatible, language designed to enable greatness", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/ForLoveOfCats/Mountain/pulls" ], "githubRepo": { "firstCommit": 2018, "stars": 4, "subscribers": 2, "created": 2019, "updated": 2022, "description": "Compiler I once wrote for a custom language called Mountain", "forks": 0, "issues": 0, "url": "https://github.com/MountainLang/Bootstrap" }, "repoStats": { "firstCommit": 2018, "commits": 422, "committers": 2, "files": 37 } }, "mouse": { "title": "Mouse", "appeared": 1970, "type": "pl", "website": "https://mouse.sourceforge.net", "country": [ "United States" ], "originCommunity": [ "https://sourceforge.net/p/mouse/mailman" ], "hasLineComments": { "example": "~ A comment", "value": true }, "hasComments": { "example": "~ A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "~" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "1 N: ~ initialize N to 1\n( N. N. * ! \" \" ~ begin loop; print squares of numbers\n N. 10 - 0 < ^ ~ exit loop if N >= 10\n N. 1 + N: ) $ ~ increment N and repeat loop" ], "related": [ "reverse-polish-notation", "assembly-language", "pascal", "isbn" ], "summary": "The Mouse programming language is a small computer programming language developed by Dr. Peter Grogono in the late 1970s and early 1980s. It was developed as an extension of an earlier language called MUSYS, which was used to control digital and analog devices in an electronic music studio. Mouse was originally intended as a small, efficient language for microcomputers with limited memory. It is an interpreted, stack-based language and uses Reverse Polish notation. To make an interpreter as easy as possible to implement, Mouse is designed so that a program is processed as a stream of characters, interpreted one character at a time. The elements of the Mouse language consist of a set of (mostly) one-character symbols, each of which performs a specific function (see table below). Since variable names are limited to one character, there are only 26 possible variables in Mouse (named A-Z). Integers and characters are the only available data types. Despite these limits, Mouse includes a number of relatively advanced features, including: Conditional branching Loops Pointers Macros (subroutines (which may be recursive)) Arrays Code tracingThe design of the Mouse language makes it ideal for teaching the design of a simple interpreter. Much of the book describing Mouse is devoted to describing the implementation of two interpreters, one in Z80 assembly language, the other in Pascal.", "pageId": 6378343, "created": 2006, "backlinksCount": 10, "revisionCount": 43, "dailyPageViews": 12, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Mouse_(programming_language)" }, "leachim6": { "filepath": "m/Mouse.mse", "fileExtensions": [ "mse" ], "example": [ "\"Hello World\"\n'! !'\n$\n" ], "id": "Mouse" }, "tryItOnline": "mouse", "hopl": "https://hopl.info/showlanguage.prx?exp=684", "fileType": "text", "wordRank": 2382, "centralPackageRepositoryCount": 0, "isbndb": "" }, "mouse4": { "title": "MOUSE4", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/68b34b11a5a7a41e162bbc32a8e3e02a27a927a2" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3798", "centralPackageRepositoryCount": 0 }, "moxie": { "title": "Moxie", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d3cdda2752ab7898abf54ba7f288f195d7b4e14d" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1102", "centralPackageRepositoryCount": 0 }, "moya": { "title": "moya", "appeared": 2015, "type": "pl", "creators": [ "Will McGugan" ], "website": "https://www.moyaproject.com/", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/moyaproject" ], "domainName": { "registered": 2011, "awisRank": { "2022": 3510100 }, "name": "moyaproject.com" }, "githubRepo": { "firstCommit": 2015, "stars": 109, "forks": 12, "subscribers": 11, "created": 2015, "updated": 2021, "description": "Web development platform", "issues": 0, "url": "https://github.com/moyaproject/moya" }, "repoStats": { "firstCommit": 2015, "commits": 950, "committers": 3, "files": 2751 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9161729|Show HN: Moya, a web framework and integrated language|2015-03-07 13:01:29 UTC|1425733289|billowycoat|15|26", "isbndb": "" }, "mp3-format": { "title": "MP3", "appeared": 1993, "type": "binaryDataFormat", "country": [ "Germany" ], "originCommunity": [ "Fraunhofer Society" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/MP3" } }, "mpgs": { "title": "MPGS", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9ef21ddb2ba940f11684924a220502c4d7e92227" ], "country": [ "Japan" ], "originCommunity": [ "Nippon Electric Co., Ltd" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4906", "centralPackageRepositoryCount": 0 }, "mpl": { "title": "mpl", "appeared": 1988, "type": "pl", "website": "http://www.maximalsoftware.com/mpl/", "reference": [ "http://www.gmu.edu/schools/vse/seor/syllabi/02F/mplman.pdf" ], "fileExtensions": [ "mpl" ], "country": [ "United States" ], "originCommunity": [ "Maximal Software, Inc." ], "related": [ "gams", "ampl" ], "example": [ "{ Planning.mpl } \n\n{ Aggregate production planning for 12 months } \n\n\nTITLE \n Production_Planning; \n\nINDEX \n product = 1..3; \n month = (January,February,March,April,May,June,July,\n August,September,October,November,December); \n\nDATA \n price[product] := (105.09, 234.00, 800.00);\n Demand[month,product] := 1000 DATAFILE(demand.dat);\n ProductionCapacity[product] := 1000 (10, 42, 14);\n ProductionCost[product] := (64.30, 188.10, 653.20);\n InventoryCost := 8.8 ; \n\nDECISION VARIABLES\n Inventory[product,month] -> Invt\n Production[product,month] -> Prod\n Sales[product,month] -> Sale \n\nMACRO \n Revenues := SUM(product,month: price * Sales);\n TotalCost := SUM(product,month: InventoryCost * Inventory\n + ProductionCost * Production);\nMODEL\n\n MAX Profit = Revenues - TotalCost ;\n\nSUBJECT TO\n InventoryBalance[product,month] -> IBal : \n Inventory = Inventory[month-1] + Production - Sales ;\n\nBOUNDS \n Sales < ProductionCapacity ; Inventory[month=\"January..November]\" < 90000 ; \n Inventory[month=\"December]\" ; END" ] }, "mps": { "title": "MPS", "appeared": 2010, "type": "grammarLanguage", "description": "With MPS you can define custom editors for a new language and make using these DSLs simpler. Even domain experts, who are not familiar with traditional programming, can easily work in MPS with domain-specific languages designed around their domain-specific terminology.", "website": "https://www.jetbrains.com/mps/", "standsFor": "Meta programming System", "country": [ "Czech Republic" ], "originCommunity": [ "JetBrains s.r.o." ], "githubRepo": { "firstCommit": 2004, "stars": 1315, "forks": 258, "subscribers": 97, "created": 2011, "updated": 2022, "description": "JetBrains Meta programming System", "issues": 7, "url": "https://github.com/JetBrains/MPS" }, "repoStats": { "firstCommit": 2004, "commits": 92204, "committers": 121, "files": 46129 }, "wikipedia": { "related": [ "java" ], "summary": "JetBrains MPS is a metaprogramming system which is being developed by JetBrains. MPS is a tool to design Domain-specific languages (DSL). It uses projectional editing which allows users to overcome the limits of language parsers, and build DSL editors, such as ones with tables and diagrams. It implements language-oriented programming. MPS is an environment for language definition, a language workbench, and integrated development environment (IDE) for such languages.", "backlinksCount": 23, "pageId": 22726517, "created": 2009, "revisionCount": 108, "dailyPageViews": 39, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/JetBrains_MPS" }, "twitter": "https://twitter.com/jetbrains_mps", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2014|CreateSpace Independent Publishing Platform|The MPS Language Workbench, Vol. 1|Campagne, Fabien|9781497378650" }, "mpsx": { "title": "MPSX", "appeared": 1978, "type": "pl", "reference": [ "https://dl.acm.org/doi/abs/10.1145/1111257.1111262", "https://semanticscholar.org/paper/a1b2b1d6d4a611581f8a787b29a4523707fc0eaf" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=818", "centralPackageRepositoryCount": 0 }, "mql": { "title": "MQL5", "appeared": 2005, "type": "pl", "reference": [ "https://www.wikidata.org/wiki/Q11765028" ], "country": [ "Russia" ], "originCommunity": [ "MetaQuotes Software" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "summary": "MQL4 (MetaQuotes Language 4) and MQL5 (MetaQuotes Language 5) are integrated programming languages designed for developing trading robots, technical market indicators, scripts and function libraries within the MetaTrader software. The primary objective of MQL4 and MQL5 is automation of trading and facilitation of operational analysis. MQL4 and MQL5 comprises an extensive codebase source code library used for developing trading robots.", "pageId": 44398671, "dailyPageViews": 52, "created": 2014, "backlinksCount": 8, "revisionCount": 60, "appeared": 2005, "url": "https://de.wikipedia.org/wiki/MetaQuotes_Language_MQL4/MQL5" }, "githubLanguage": { "fileExtensions": [ "mq5", "mqh" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "c_cpp", "tmScope": "source.mql5", "repos": 1273, "id": "MQL4" }, "githubBigQuery": { "repos": 38, "users": 34, "id": "MQL4" }, "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "mq4", "mq5", "mqh" ], "id": "MQL" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2016, "committerCount": 1, "commitCount": 4, "sampleCount": 3, "example": [ "//+------------------------------------------------------------------+\n//| script-sample.mq5 |\n//| Copyright 2016, Andrey Osorgin |\n//+------------------------------------------------------------------+\n//| The MIT License (MIT) |\n//| |\n//| Permission is hereby granted, free of charge, to any person |\n//| obtaining a copy of this software and associated documentation |\n//| files (the \"Software\"), to deal in the Software without |\n//| restriction, including without limitation the rights to use, |\n//| copy, modify, merge, publish, distribute, sublicense, and/or sell|\n//| copies of the Software, and to permit persons to whom the |\n//| Software is furnished to do so, subject to the following |\n//| conditions: |\n//| |\n//| The above copyright notice and this permission notice shall be |\n//| included in all copies or substantial portions of the Software. |\n//| |\n//| THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, |\n//| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |\n//| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |\n//| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |\n//| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |\n//| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |\n//| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |\n//| OTHER DEALINGS IN THE SOFTWARE. |\n//| |\n//| A copy of the MIT License (MIT) is available at |\n//| https://opensource.org/licenses/MIT |\n//+------------------------------------------------------------------+\n#property version \"1.00\"\n#property script_show_inputs\n\n#include \n\ninput int StopLoss=100; // Stop Loss\ninput int TakeProfit=100; // Take Profit\n//+------------------------------------------------------------------+\n//| Script program start function |\n//+------------------------------------------------------------------+\nvoid OnStart()\n {\n CTrade trade;\n//---\n long stoplevel=SymbolInfoInteger(Symbol(),SYMBOL_TRADE_STOPS_LEVEL);\n Print(\"Minimum stop level is: \",stoplevel);\n double ask=SymbolInfoDouble(Symbol(),SYMBOL_ASK);\n double bid=SymbolInfoDouble(Symbol(),SYMBOL_BID);\n double sl = NormalizeDouble(bid - StopLoss*Point(),Digits());\n double tp = NormalizeDouble(ask + TakeProfit*Point(),Digits());\n//---\n bool result=trade.Buy(0.01,Symbol(),ask,sl,tp,\"test\");\n//---\n Print(\"Success? \",result);\n }\n//+------------------------------------------------------------------+\n" ], "url": "https://github.com/mqsoft/MQL5-sublime" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nHow Hard is Mql4 Programming: A guide for the Absolute Beginner. (JimdDandy's Mql4 Programming Books Book 1)|2014|Jim Hodges|43563344|4.43|7|2\nProgrammer En Mql4||Henri Baltzer|63225783|0.0|0|0\nExpert Advisor Programming for MetaTrader 4. Creating automated trading systems in the MQL4 language|2009|Andrew R. Young|11791642|3.65|17|1\nExpert Advisor Programming for Metatrader 5: Creating Automated Trading Systems in the Mql5 Language|2013|Andrew R. Young|23933556|3.83|6|0\nIntroduction to MetaTrader 5 and Programming with MQL5 : Create your 1st Investment Robot with MQL5 step by step from ZERO.||Rafael F. V. C. Santos|63495915|1.00|1|0\nMQL5 programming language: Advanced use of the trading platform MetaTrader 5: Creating trading robots and indicators||Timur Mashnin|54147063|3.00|1|0" }, "mqtt": { "title": "Message Queuing Telemetry Transport", "appeared": 1999, "type": "protocol", "website": "http://mqtt.org/", "standsFor": "Message Queuing Telemetry Transport", "country": [ "United States" ], "originCommunity": [ "Organization for the Advancement of Structured Information Standards" ], "domainName": { "registered": 2004, "awisRank": { "2022": 194213 }, "name": "mqtt.org" }, "wikipedia": { "summary": "MQTT (Message Queuing Telemetry Transport) is an ISO standard (ISO/IEC PRF 20922) publish-subscribe-based messaging protocol. It works on top of the TCP/IP protocol. It is designed for connections with remote locations where a \"small code footprint\" is required or the network bandwidth is limited. The publish-subscribe messaging pattern requires a message broker. Andy Stanford-Clark of IBM and Arlen Nipper of Cirrus Link authored the first version of the protocol in 1999.In 2013, IBM submitted MQTT v3.1 to the OASIS specification body with a charter that ensured only minor changes to the specification could be accepted. MQTT-SN is a variation of the main protocol aimed at embedded devices on non-TCP/IP networks, such as Zigbee. Historically, the \"MQ\" in \"MQTT\" came from the IBM MQ (then 'MQSeries') message queuing product line. However, queuing itself is not required to be supported as a standard feature in all situations.Alternative message-oriented middleware includes the Advanced Message Queuing Protocol (AMQP), Streaming Text Oriented Messaging Protocol (STOMP), the IETF Constrained Application Protocol, XMPP, DDS, OPC UA, and Web Application Messaging Protocol (WAMP).", "backlinksCount": 256, "pageId": 32695816, "dailyPageViews": 1128, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/MQTT" }, "isbndb": "" }, "mrdb": { "title": "MRDB", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/01956df0de72e06987097b77b604d57ca634e12e" ], "country": [ "United States" ], "originCommunity": [ "Washington University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8087", "centralPackageRepositoryCount": 0 }, "ms2": { "title": "MS2", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/062d7c65c2ad83ebce9336eaa3efc49eb7ec0448" ], "country": [ "United States" ], "originCommunity": [ "Washington University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2871", "centralPackageRepositoryCount": 0 }, "mscgen": { "title": "Mscgen", "appeared": 2016, "type": "textMarkup", "website": "http://www.mcternan.me.uk/mscgen/", "country": [ "United Kingdom" ], "originCommunity": [ "https://code.google.com/archive/p/mscgen/issues" ], "related": [ "dot" ], "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "TRUE", "FALSE" ] ], "example": [ "# MSC for some fictional process\nmsc {\n hscale = \"2\";\n\n a,b,c;\n\n a->b [ label = \"ab()\" ] ;\n b->c [ label = \"bc(TRUE)\"];\n c=>c [ label = \"process(1)\" ];\n c=>c [ label = \"process(2)\" ];\n ...;\n c=>c [ label = \"process(n)\" ];\n c=>c [ label = \"process(END)\" ];\n a<<=c [ label = \"callback()\"];\n --- [ label = \"If more to run\", ID=\"*\" ];\n a->a [ label = \"next()\"];\n a->c [ label = \"ac1()\\nac2()\"];\n b<-c [ label = \"cb(TRUE)\"];\n b->b [ label = \"stalled(...)\"];\n a<-b [ label = \"ab() = FALSE\"];\n}" ], "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "msc" ], "id": "Mscgen" } }, "msg-84": { "title": "MSG.84", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1d21f7b72428d1a464df5213c633e4ac649c3087" ], "country": [ "United States" ], "originCommunity": [ "University of Minnesota" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1164", "centralPackageRepositoryCount": 0 }, "msl": { "title": "MSL", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5d781a7eb5a2c351636a2c6f11289af71b8dc9f5" ], "country": [ "United States" ], "originCommunity": [ "University of South Carolina" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4729", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "msp430": { "title": "TI MSP430", "appeared": 2009, "type": "isa", "originCommunity": [ "TexasInstruments" ], "wikipedia": { "related": [ "assembly-language", "eclipse-editor", "arduino", "llvmir", "vissim" ], "summary": "The MSP430 is a mixed-signal microcontroller family from Texas Instruments. Built around a 16-bit CPU, the MSP430 is designed for low cost and, specifically, low power consumption embedded applications.", "pageId": 218382, "dailyPageViews": 241, "created": 2003, "backlinksCount": 131, "revisionCount": 527, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/TI_MSP430" }, "fileType": "na", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMSP430 LaunchPad Programming|2014|Agus Kurniawan|40228118|4.20|5|0\nMicrocontroller Programming and Interfacing Ti Msp430: Part I|2011|Steven Barrett|22513765|5.00|2|0\nMicrocontroller Programming and Interfacing: Texas Instruments Msp430|2011|Daniel J. Pack|18281308|4.00|1|0\nMSP430 State Machine Programming: with the ES2274|2008|Tom Baugh|6801604|3.50|2|0\nMicrocontrollers: 8051 & MSP430 Microcontrollers Family - Architecture & Programming||A.P. Godse|48185134|4.00|1|0\nMsp430 Production Programming And Testing: With The Usbp And Usbppro||Tom Baugh|6801605|0.0|0|0\nZen and the Forth Language: EFORTH for the MSP430 from Texas Instruments||Chen-Hanson Ting|53511846|5.00|1|0", "isbndb": "" }, "msx-basic": { "title": "MSX BASIC", "appeared": 1984, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "gw-basic", "vilnius-basic", "mbasic", "dartmouth-basic" ], "summary": "MSX BASIC is a dialect of the BASIC programming language. It is an extended version of Microsoft Standard BASIC Version 4.5, and includes support for graphic, music, and various peripherals attached to MSX Personal Computers. Generally, MSX-BASIC is designed to follow GW-BASIC, which is one of the standard BASICs running on 16-bit computers. During the creation of MSX-BASIC, effort was made to make the system flexible and expandable.", "created": 2003, "backlinksCount": 114, "pageId": 327744, "revisionCount": 79, "dailyPageViews": 19, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/MSX_BASIC" }, "centralPackageRepositoryCount": 0 }, "mtml": { "title": "Marine Trading Markup Language", "appeared": 2000, "type": "xmlFormat", "description": "The Marine Trading Markup Language (MTML), formalized in the MTML Document Type Definition, \"is a standard to help a broad base of small, medium and large buyers and suppliers in the marine trading industry conduct their fundamental trading transactions electronically via the Internet.\"", "website": "https://www.shipserv.com", "reference": [ "http://www.meca.org.uk/maritime-trading-markup-language-mtml.html" ], "aka": [ "mtml" ], "country": [ "United Kingdom" ], "originCommunity": [ "shipserv" ], "githubLanguage": { "type": "markup", "fileExtensions": [ "mtml" ], "aceMode": "html", "codemirrorMode": "htmlmixed", "codemirrorMimeType": "text/html", "tmScope": "text.html.basic", "repos": 85, "id": "MTML" }, "githubBigQuery": { "repos": 12, "users": 7, "id": "MTML" }, "centralPackageRepositoryCount": 0 }, "mu": { "title": "Mu", "appeared": 2014, "type": "pl", "creators": [ "Kartik K. Agaram" ], "website": "https://github.com/akkartik/mu", "reference": [ "http://akkartik.name/akkartik-convivial-20200607.pdf" ], "fileExtensions": [ "mu" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/akkartik/mu/issues" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# dump stack from bottom to top\nfn emit-stack-from-bottom _self: (addr grapheme-stack), out: (addr stream byte) {\n var self/esi: (addr grapheme-stack) <- copy _self\n var data-ah/edi: (addr handle array code-point-utf8) <- get self, data\n var _data/eax: (addr array code-point-utf8) <- lookup *data-ah\n var data/edi: (addr array code-point-utf8) <- copy _data\n var top-addr/ecx: (addr int) <- get self, top\n var i/eax: int <- copy 0\n {\n compare i, *top-addr\n break-if->=\n var g/edx: (addr code-point-utf8) <- index data, i\n write-code-point-utf8 out, *g\n i <- increment\n loop\n }\n}" ], "githubRepo": { "stars": 1227, "forks": 46, "subscribers": 38, "created": 2014, "updated": 2022, "firstCommit": 2014, "description": "Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.", "issues": 3, "url": "https://github.com/akkartik/mu" }, "repoStats": { "firstCommit": 2014, "commits": 9002, "committers": 15, "files": 1013 }, "fileType": "text", "wordRank": 9065, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "muddl": { "title": "MUDDL", "appeared": 1988, "type": "pl", "creators": [ "Lars Brinkhoff" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Essex" ], "githubRepo": { "firstCommit": 2017, "stars": 41, "forks": 8, "subscribers": 9, "created": 2017, "updated": 2022, "description": "Essex MUD1 by Trubshaw and Bartle", "issues": 0, "url": "https://github.com/PDP-10/MUD1" }, "repoStats": { "firstCommit": 2017, "commits": 31, "committers": 4, "files": 47 }, "wikipedia": { "related": [ "bcpl" ], "summary": "Multi-User Dungeon, or MUD (referred to as MUD1, to distinguish it from its successor, MUD2, and the MUD genre in general) is an early MUD and one of the oldest examples of a virtual world in existence.", "created": 2010, "backlinksCount": 52, "pageId": 7955375, "revisionCount": 17, "dailyPageViews": 1, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/MUDDL" }, "centralPackageRepositoryCount": 0 }, "mudlle": { "title": "Mudlle", "appeared": 1998, "type": "pl", "creators": [ "MUME user" ], "website": "https://mume.org/download/mudlle/", "reference": [ "https://www.wikidata.org/wiki/Q6931851" ], "country": [ "Switzerland" ], "originCommunity": [ "Swiss Federal Institute of Technology" ], "githubRepo": { "firstCommit": 1998, "stars": 4, "forks": 4, "subscribers": 8, "created": 2014, "updated": 2021, "description": "The mudlle (MUD Language for Little Extensions) distribution, including compiler and some basic libraries.", "issues": 0, "url": "https://github.com/MUME/mudlle" }, "repoStats": { "firstCommit": 1998, "commits": 14, "committers": 1, "files": 192 }, "wikipedia": { "related": [ "linux", "ios", "android" ], "summary": "Numerous computer and video games have been inspired by J. R. R. Tolkien's works set in Middle-earth. Titles have been produced by studios such as Electronic Arts, Sierra, Melbourne House, and Warner Bros. Interactive Entertainment, which currently owns the gaming rights.", "created": 2006, "backlinksCount": 538, "pageId": 5357946, "revisionCount": 32, "dailyPageViews": 1, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Mudlle" }, "centralPackageRepositoryCount": 0 }, "muf": { "title": "Multi-User Forth", "appeared": 1995, "type": "pl", "documentation": [ "https://mud.fandom.com/wiki/MUF_(programming_language)" ], "standsFor": "Multi-User Forth", "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "example": [ "$include $lib/strings\n$include $lib/match\nlvar check-obj-addr\n \n: check-next-loop (d -- )\n dup not if pop exit then\n dup exit? over thing? or\n me @ 3 pick .controls and if\n dup check-obj-addr @ execute\n then\n next check-next-loop\n;\n \n: check-contents (d -- )\n contents check-next-loop\n;\n \n: check-exits (d -- )\n exits check-next-loop\n;\n \n: exec-err (d mtypestr warnstr -- )\n \"On \" 4 rotate unparseobj strcat\n \", in it's \" strcat rot strcat\n \", \" strcat swap strcat .tell\n;\n \n: can-linkto? (player object -- i)\n dup \"link_ok\" flag? if pop pop 1 exit then\n .controls\n;\n \n: check-exec (d mtype execstr -- )\n dup \"@\" 1 strncmp if pop pop pop exit then\n 1 strcut swap pop\n \" \" .split pop\n dup \"$\" 1 strncmp not if\n dup match ok? not if\n \" is not a known registered program.\" strcat\n exec-err exit\n then\n dup match program? not if\n \" is not a program.\" strcat\n exec-err exit\n then\n 3 pick owner over match can-linkto? not if\n \" is not Link_OK.\" strcat\n exec-err exit\n then\n else\n dup number? not if\n \" is not a program dbref.\" strcat\n \"@\" swap strcat exec-err exit\n then\n dup atoi dbref ok? not if\n \" is not a valid program reference.\" strcat\n \"@\" swap strcat exec-err exit\n then\n dup atoi dbref program? not if\n \" is not a valid program reference.\" strcat\n \"@\" swap strcat exec-err exit\n then\n 3 pick owner over atoi dbref can-linkto? not if\n \" is not Link_OK.\" strcat\n \"@\" swap strcat exec-err exit\n then\n then\n pop pop pop\n;\n \n \n: missing-err ( d s -- )\n swap unparseobj\n \" is missing an \"\n strcat swap strcat\n \" message.\" strcat .tell\n;\n \n: colon-err ( d s -- )\n swap unparseobj\n \" has an unnecesary ':' at the start of its \"\n strcat swap strcat\n \" message.\" strcat .tell\n;\n \n: check-desc (d -- )\n dup desc not if\n \"@description\" missing-err\n else\n \"@description\" over\n desc check-exec\n then\n;\n \n: check-succ (d -- )\n dup succ not if\n \"@success\" missing-err\n else\n \"@success\" over\n succ check-exec\n then\n;\n \n: check-fail (d -- )\n dup fail not if\n \"@fail\" missing-err\n else\n \"@fail\" over\n fail check-exec\n then\n;\n \n: check-drop (d -- )\n dup drop not if\n \"@drop\" missing-err\n else\n \"@drop\" over\n drop check-exec\n then\n;\n \n: check-osucc (d -- )\n dup osucc not if\n \"@osuccess\" missing-err\n else\n dup osucc \":\" 1 strncmp not if\n \"@osuccess\" colon-err\n else pop\n then\n then\n;\n \n: check-ofail (d -- )\n dup ofail not if\n \"@ofail\" missing-err\n else\n dup ofail \":\" 1 strncmp not if\n \"@ofail\" colon-err\n else pop\n then\n then\n;\n \n: check-odrop (d -- )\n dup odrop not if\n \"@odrop\" missing-err\n else\n dup odrop \":\" 1 strncmp not if\n \"@odrop\" colon-err\n else pop\n then\n then\n;\n \n \n$define islocked? (d -- i) getlockstr \"*UNLOCKED*\" stringcmp $enddef\n \n: islocked_always? (d -- i)\n getlockstr dup \"#0\" stringcmp not if pop 1 exit then\n dup \"#\" STRsplit swap pop atoi\n \"#\" swap intostr strcat\n (lockstr \"#dbref\")\n dup \"&!\" over strcat strcat\n 3 pick stringcmp not if pop pop 1 exit then\n \"&\" over strcat strcat \"!\" swap strcat\n stringcmp not if 1 exit then\n 0\n;\n \n: check-link ( d -- )\n dup getlink not if\n dup unparseobj \" is unlinked.\" strcat .tell\n else\n dup getlink over location dbcmp if\n dup islocked? not if\n dup unparseobj\n \" is linked to it's location, but is unlocked.\"\n strcat .tell\n then\n else (is not linked to it's location)\n dup getlink program? if\n dup dup owner swap getlink can-linkto? not if\n dup unparseobj\n \" is linked to a program which is not Link_OK.\"\n strcat .tell\n then\n then\n then\n then\n pop\n;\n \n: check-room (d -- )\n dup check-desc\n dup islocked? if\n dup islocked_always? not if\n dup check-succ\n then\n dup check-fail\n then\n dup getlink if\n dup check-drop\n dup check-odrop\n then\n dup check-contents\n check-exits\n;\n \n: check-exit ( d -- )\n dup check-link\n dup check-desc\n dup getlink dup ok? if\n program? not if\n dup islocked_always? not if\n dup check-succ\n dup check-osucc\n dup check-odrop\n then\n dup islocked? if\n dup check-fail\n dup check-ofail\n then\n then\n else pop\n then\n pop\n;\n \n: check-thing ( d -- )\n dup check-desc\n dup islocked_always? not if\n dup check-succ\n dup check-osucc\n then\n dup islocked? if\n dup check-fail\n dup check-ofail\n then\n dup check-drop\n dup check-odrop\n check-exits\n;\n \n: check-player ( d -- )\n dup check-desc\n dup islocked_always? not if\n dup check-succ\n dup check-osucc\n then\n dup islocked? if\n dup check-fail\n dup check-ofail\n then\n dup check-contents\n check-exits\n;\n \n: check-program ( d -- )\n check-desc\n;\n \n: check-obj (d -- )\n dup room? if check-room exit then\n dup exit? if check-exit exit then\n dup thing? if check-thing exit then\n dup player? if check-player exit then\n check-program\n;\n \n: main\n 'check-obj check-obj-addr !\n .strip dup not if pop \"here\" then\n .match_controlled\n dup #-3 dbcmp if pop me @ getlink then\n dup ok? not if pop exit then\n check-obj\n me @ \"Check done.\" notify\n;\n" ], "wikipedia": { "related": [ "muf", "forth" ], "summary": "TinyMUCK or, more broadly, a MUCK, is a type of user-extendable online text-based role-playing game, designed for role playing and social interaction. Backronyms like \"Multi-User Chat/Created/Computer/Character/Carnal Kingdom\" and \"Multi-User Construction Kit\" are sometimes cited, but are not the actual origin of the term; \"muck\" is simply a play on the term MUD.", "pageId": 11997162, "created": 2004, "backlinksCount": 214, "revisionCount": 86, "dailyPageViews": 2, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/MUF_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "muf", "m" ], "trendingProjectsCount": 0, "type": "programming", "group": "Forth", "aceMode": "forth", "codemirrorMode": "forth", "codemirrorMimeType": "text/x-forth", "tmScope": "none", "repos": 0, "id": "MUF" }, "leachim6": { "filepath": "m/Muf.muf", "fileExtensions": [ "muf" ], "example": [ ": main\n me @ \"Hello World\" notify\n;\n" ], "id": "Muf" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MUF", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "mufp": { "title": "muFP", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/017c9556dc434488d60045272e9d5fb9e802d624" ], "country": [ "United Kingdom" ], "originCommunity": [ "Oxford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2261", "centralPackageRepositoryCount": 0 }, "mul-t": { "title": "Mul-T", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f1f80191d7d88d3e2bb389a6b429ac14dafee547" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology", "Digital Equipment Corporation", "Yale University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1502", "centralPackageRepositoryCount": 0 }, "multi-user-basic": { "title": "Multi-user BASIC", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "related": [ "basic", "basic-11", "basic-plus" ], "summary": "Multi-user BASIC was a dialect of the BASIC language for the DEC PDP-11 running the RT-11 operating system. One or more users were supported in separate address spaces sharing the same language interpreter. The syntax of the language was similar to but not identical to BASIC-11. A key language element was the support for virtual files. These were similar to the virtual arrays in BASIC-PLUS in but more limited. An array of integers, floatingpoint, or character strings of length 1, 2, 4, 8, 16, 32, or 64 could be placed in file and accessed with a subscript. The file could actually be opened (or re-opened) with a different definition allowing integers, characters, and floating point numbers to be stored in the same file. Like BASIC-11, Multi-User BASIC provided some support for lab equipment, support for character terminals (LA30, VT100). Because it was a multi-user system, it did not support real-time data collection.", "created": 2006, "backlinksCount": 3, "pageId": 5369818, "revisionCount": 16, "dailyPageViews": 1, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Multi-user_BASIC" }, "centralPackageRepositoryCount": 0 }, "multiaddr": { "title": "multiaddr", "appeared": 2014, "type": "schema", "creators": [ "Juan Batiz-Benet" ], "website": "http://multiformats.io/multiaddr/", "country": [ "Various" ], "originCommunity": [ "https://github.com/multiformats" ], "related": [ "url" ], "githubRepo": { "firstCommit": 2014, "stars": 329, "forks": 73, "subscribers": 49, "created": 2014, "updated": 2022, "description": "Composable and future-proof network addresses", "issues": 25, "url": "https://github.com/multiformats/multiaddr" }, "repoStats": { "firstCommit": 2014, "commits": 144, "committers": 50, "files": 14 } }, "multibase": { "title": "multibase", "appeared": 2016, "type": "standard", "creators": [ "Juan Benet" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/multiformats" ], "related": [ "base64" ], "githubRepo": { "firstCommit": 2016, "stars": 218, "forks": 58, "subscribers": 38, "created": 2016, "updated": 2022, "description": "Self identifying base encodings", "issues": 29, "url": "https://github.com/multiformats/multibase" } }, "multicodec": { "title": "multicodec", "appeared": 2015, "type": "standard", "creators": [ "Juan Batiz-Benet" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/multiformats" ], "githubRepo": { "firstCommit": 2015, "stars": 250, "forks": 166, "subscribers": 44, "created": 2015, "updated": 2022, "description": "Compact self-describing codecs. Save space by using predefined multicodec tables.", "issues": 64, "url": "https://github.com/multiformats/multicodec" } }, "multics": { "title": "Multics", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bbdb16ebe3c71e7b6d32750ae61d0aab7ab72e84" ], "country": [ "Canada" ], "originCommunity": [ "University of Calgary" ], "wikipedia": { "related": [ "pl-i", "assembly-language", "unix", "linux", "algol" ], "summary": "Multics (Multiplexed Information and Computing Service) is an influential early time-sharing operating system, based around the concept of a single-level memory. Virtually all modern operating systems were heavily influenced by Multics – often through Unix, which was created by some of the people who had worked on Multics – either directly (Linux, macOS) or indirectly (Windows NT).", "backlinksCount": 303, "pageId": 18847, "dailyPageViews": 190, "created": 2001, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Multics" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3513", "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1980|Multics Emacs (Prose and Cons): A commercial text-processing system in Lisp|10.1145/800087.802784|5|1|B. Greenberg|ed42164691bd7f567ba0c8f61bdb061f3b70c750" }, "multigame": { "title": "Multigame", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5428fa9c105d56d55cb13962d99726d9b770cdff" ], "country": [ "The Netherlands" ], "originCommunity": [ "Vrije Universiteit Amsterdam" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5766", "centralPackageRepositoryCount": 0 }, "multihash-hash-function": { "title": "Multihash", "appeared": 2017, "type": "hashFunction", "description": "Multihash is a protocol for differentiating outputs from various well-established hash functions, addressing size + encoding considerations. It is useful to write applications that future-proof their use of hashes, and allow multiple hash functions to coexist.", "website": "http://multiformats.io/multihash/", "country": [ "Various" ], "originCommunity": [ "https://github.com/multiformats" ] }, "mumath": { "title": "muMath", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/44ab3648a50014007bda6cef7e091ae20e7737ae" ], "country": [ "United States" ], "originCommunity": [ "University of Hawaii" ], "wikipedia": { "related": [ "maxima", "pari-gp", "sagemath", "xcas", "yacas", "magma", "maple", "mathcad", "mathematica-editor", "mupad", "camal" ], "summary": "muMATH is a computer algebra system (CAS), which was developed in the late 1970s and early eighties by Albert D. Rich and David Stoutemyer of Soft Warehouse in Honolulu, Hawaii. It was implemented in the muSIMP programming language which was built on top of a LISP dialect called muLISP. Platforms supported were CP/M and TRS-DOS (since muMATH-79), Apple II (since muMATH-80) and DOS (in muMATH-83, the last version, which was published by Microsoft). The Soft Warehouse later developed Derive, another computer algebra system. The company was purchased by Texas Instruments in 1999, and development of Derive ended in 2006.", "backlinksCount": 57, "pageId": 1270063, "dailyPageViews": 8, "created": 2004, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/MuMATH" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3625", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "mumps": { "title": "MUMPS", "appeared": 1966, "type": "pl", "creators": [ "Neil Pappalardo" ], "documentation": [ "https://mumps.sourceforge.net/docs.html" ], "aka": [ "m" ], "country": [ "United States" ], "originCommunity": [ "MUMPS Development Committee" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "w" ] ], "stringToken": [ [ "\"" ] ], "example": [ "label1 ; This is a label\n write \"Hello World !\",!\n quit\n" ], "wikipedia": { "example": [ "GTM>S n=\"\"\nGTM>S n=$order(^nodex(n))\nGTM>zwr n\nn=\" building\"\nGTM>S n=$order(^nodex(n))\nGTM>zwr n\nn=\" name:gd\"\nGTM>S n=$order(^nodex(n))\nGTM>zwr n\nn=\"%kml:guid\"" ], "related": [ "joss", "unix", "telcomp", "miis", "linux", "tiny-basic", "ascii", "csv" ], "summary": "MUMPS (Massachusetts General Hospital Utility Multi-Programming System), or M, is a general-purpose computer programming language that provides ACID (Atomic, Consistent, Isolated, and Durable) transaction processing. Its differentiating feature is its \"built-in\" database, enabling high-level access to disk storage using simple symbolic program variables and subscripted arrays, similar to the variables used by most languages to access main memory. The M database is a key-value database engine optimized for high-throughput transaction processing. As such it is in the class of \"schema-less\", \"schema-free,\" or NoSQL databases. Internally, M stores data in multidimensional hierarchical sparse arrays (also known as key-value nodes, sub-trees, or associative memory). Each array may have up to 32 subscripts, or dimensions. A scalar can be thought of as an array element with zero subscripts. Nodes with varying numbers of subscripts (including one node with no subscripts) can freely co-exist in the same array. Perhaps the most unusual aspect of the M language is the notion that the database is accessed through variables, rather than queries or retrievals. This means that accessing volatile memory and non-volatile storage use the same basic syntax, enabling a function to work on either local (volatile) or global (non-volatile) variables. Practically, this provides for extremely high performance data access. Originally designed in 1966 for the healthcare industry, M continues to be used today by many large hospitals and banks to provide high-throughput transaction data processing.", "pageId": 19723, "dailyPageViews": 255, "created": 2001, "backlinksCount": 197, "revisionCount": 1017, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/MUMPS" }, "githubLanguage": { "fileExtensions": [ "mumps", "m" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "mumps", "codemirrorMimeType": "text/x-mumps", "tmScope": "none", "aliases": [ "mumps" ], "repos": 2448, "id": "M" }, "githubBigQuery": { "repos": 4908, "users": 4334, "id": "M" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/mumps", "codeMirror": "mumps", "projectEuler": { "memberCount": { "2019": 31, "2022": 38 }, "id": "MUMPS" }, "helloWorldCollection": [ "; Hello World in Mumps-M\n w !,\"Hello World\"" ], "leachim6": { "filepath": "m/Mumps.m", "fileExtensions": [ "m" ], "example": [ " w \"Hello World\",!\n" ], "id": "Mumps" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MUMPS", "rijuRepl": { "example": [ "main()\n write \"Hello, world!\",!\n quit\n" ], "id": "https://riju.codes/mumps" }, "tryItOnline": "mumps", "tiobe": { "id": "MUMPS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=773", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1989|Prentice Hall|The Complete Mumps: An Introduction and Reference Manual for the Mumps Programming Language|Lewkowicz, John M.|9780131621251\n2008|CreateSpace Independent Publishing Platform|The Mumps Programming Language|O'Kane, Kevin C.|9781438243382\n2010|General Books|Mumps Programming Language: Mumps, Mumps Language Syntax, Mumps Users|Llc Books Not Available (na)|9781156342411\n2010|General Books|Mumps Programming Language Family: Mumps Programming Language, Fileman, Mumps Language Syntax, Meditech, Mumps Users, Miis|Books and LLC|9781156342428\n1995||Programming Languages Mumps|American National Standards Institute|9780918118400\n||Mumps Programming Reference Manual|Melvin E. Conway|9780918118257\n2010|General Books|Persistent Programming Languages: Mumps|Books and LLC|9781156262405\nJune 1981||Computer Programming in Standard Mumps|David H. Miller and Gregory L. Bressler and Arthur Krieg|9780918118288\n2011||Articles On Mumps Programming Language Family, Including|Hephaestus Books|9781244856448\n1982|Mumps Users' Group|Mumps Primer, Revised: An Introduction To The Interactive Programming System Of The Future|Richard F Walters|9780918118240", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1976|A balanced view of MUMPS|10.1145/1164881.1164883|5|0|A. Wasserman and D. Sherertz|63ee3e847a63de9225b5131cecb8933785d77025\n1976|A balanced view of MUMPS|10.1145/800236.807089|3|0|A. Wasserman and D. Sherertz|4900e9669acd5516ce0dca745eb318088073379d\n1989|The MUMPS Programming Language|10.1007/978-1-4612-3488-3_23|2|0|B. Blum and H. Orthner|2c2554297b07cb462c80b1e7161a0353d5ddd290" }, "mums": { "title": "MUMS", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/05dc5d22dd54b378c76fdd09112618ea57e55531" ], "country": [ "Austria" ], "originCommunity": [ "Johannes-Kepler-Universitat" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4359", "centralPackageRepositoryCount": 0 }, "mun-lang": { "title": "mun-lang", "appeared": 2019, "type": "pl", "website": "https://mun-lang.org/", "reference": [ "https://news.ycombinator.com/item?id=21172980" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/mun-lang" ], "domainName": { "registered": 2019, "awisRank": { "2022": 8850967 }, "name": "mun-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "fn main() {\n let sum = add(a, b);\n // Comments: Mun natively supports bool, float, and int\n let is_true = true;\n let var: float = 0.5;\n}\n// The order of function definitions doesn't matter\nfn add(a: int, b: int): int {\n a + b\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 1291, "forks": 56, "subscribers": 25, "created": 2019, "updated": 2022, "description": "Source code for the Mun language and runtime.", "issues": 40, "url": "https://github.com/mun-lang/mun" }, "repoStats": { "firstCommit": 2019, "commits": 878, "committers": 29, "files": 766 } }, "munin": { "title": "MUNIN", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0056b0a97538cb9a9e37a3d5ddcc8ebb0fe15158" ], "country": [ "Denmark" ], "originCommunity": [ "Aalborg University and Judex Datasystemer and Nordjysk Udviklingscenter and Turku University Hospital" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7713", "centralPackageRepositoryCount": 0 }, "muon": { "title": "muon", "appeared": 2019, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/nickmqb/muon/issues" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "printf" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2019, "stars": 758, "forks": 23, "subscribers": 27, "created": 2019, "updated": 2022, "description": "Modern low-level programming language", "issues": 9, "url": "https://github.com/nickmqb/muon" }, "repoStats": { "firstCommit": 2019, "commits": 124, "committers": 3, "files": 114 }, "leachim6": { "filepath": "m/Muon.mu", "fileExtensions": [ "mu" ], "example": [ "printf(fmt cstring) int #Foreign(\"printf\") #VarArgs\n\nmain() {\n\tprintf(\"Hello World\")\n}\n" ], "id": "Muon" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n19598592|Show HN: Muon, a low-level programming language inspired by C, C# and Go|2019-04-07 18:00:10 UTC|1554660010|nickmqb|114|175" }, "mupad": { "title": "muPad", "appeared": 1997, "type": "pl", "website": "http://mathworks.com/discovery/mupad.html", "country": [ "Germany" ], "originCommunity": [ "University of Paderborn" ], "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "linux", "matlab", "java" ], "summary": "MuPAD is a computer algebra system (CAS). Originally developed by the MuPAD research group at the University of Paderborn, Germany, development was taken over by the company SciFace Software GmbH & Co. KG in cooperation with the MuPAD research group and partners from some other universities starting in 1997. Until autumn 2005, the version \"MuPAD Light\" was offered for free for research and education, but as a result of the closure of the home institute of the MuPAD research group, only the version \"MuPAD Pro\" became available for purchase. The MuPAD kernel is bundled with Scientific Notebook and Scientific Workplace. Former versions of MuPAD Pro were bundled with SciLab. In MathCAD's version 14 release Mupad was adopted as the CAS engine. In September 2008, SciFace was purchased by MathWorks and the MuPAD code was included in the Symbolic Math Toolbox add-on for MATLAB. On 28 September 2008, MuPAD was withdrawn from the market as a software product in its own right. However, it is still available in the Symbolic Math Toolbox in MATLAB and can also be used as a stand-alone program.", "pageId": 30874575, "created": 2004, "backlinksCount": 76, "revisionCount": 102, "dailyPageViews": 29, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/MuPAD" }, "githubLanguage": { "fileExtensions": [ "mu" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.mupad", "repos": 39, "id": "mupad" }, "githubBigQuery": { "repos": 71, "users": 69, "id": "mupad" }, "pygmentsHighlighter": { "filename": "algebra.py", "fileExtensions": [ "mu" ], "id": "MuPAD" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2018, "committerCount": 4, "commitCount": 18, "url": "https://github.com/ccreutzig/sublime-MuPAD" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7523", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMupad Pro Computing Essentials|2002|Miroslaw Majewski|13658983|0.0|0|0\nProgramming Fundamentals with MATLAB Using Mupad||Smith A|53994831|0.0|0|0\nDynamic Modules: User's Manual and Programming Guide for Mupad 1.4 [With *]|1998|Andreas Sorgatz|4117301|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1998|Springer|Dynamic Modules: User’s Manual and Programming Guide for MuPAD 1.4|Sorgatz, Andreas|9783540650430\n1996|Wiley|MuPAD User's Manual and CD-ROM: Multiprocessing Algebra Data Tool, MuPad Version 1.2.2.|The MuPad Group and Fuchssteiner, B. and Drescher, K. and Kemper, A. and Kluge, O. and Morrise, K. and Naundorf, H. and Oevel, G. and Postel, F. and Schulze, T. and Siek, G. and Sorgatz, A. and Wiwianka, W. and Zimmermann, P.|9780471967163\n2014|Springer|Dynamic Modules: User's Manual and Programming Guide for MuPAD 1.4|Sorgatz, Andreas|9783642599965\n2004|Springer|Mupad Tutorial|Christopher Creutzig and Walter Oevel|9783540221845\n20131201|Springer Nature|MuPAD Tutorial|Christopher Creutzig; Walter Oevel|9783642593048\n20121206|Springer Nature|MuPAD Pro Computing Essentials|Miroslaw Majewski|9783642979101\n20110627|Springer Nature|MuPAD Pro Computing Essentials|Miroslaw Majewski|9783642187605" }, "murmur-hash-function": { "title": "MurmurHash", "appeared": 2008, "type": "hashFunction", "country": [ "United States" ], "originCommunity": [ "https://web.archive.org/web/20160304184004/http://tanjent.com/" ], "wikipedia": { "summary": "MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup. It was created by Austin Appleby in 2008 and is currently hosted on GitHub along with its test suite named 'SMHasher'. It also exists in a number of variants, all of which have been released into the public domain. The name comes from two basic operations, multiply (MU) and rotate (R), used in its inner loop. Unlike cryptographic hash functions, it is not specifically designed to be difficult to reverse by an adversary, making it unsuitable for cryptographic purposes.", "backlinksCount": 41, "pageId": 25081196, "dailyPageViews": 297, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/MurmurHash" } }, "mushroom": { "title": "Mushroom", "appeared": 1988, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "https://gitlab.com/ifff/mushroom/-/issues" ], "gitlabRepo": "https://gitlab.com/ifff/mushroom" }, "music-sp": { "title": "MUSIC/SP", "appeared": 1972, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "McGill University" ], "wikipedia": { "related": [ "unix", "watfiv", "pascal", "pl-i", "basic", "apl", "algol", "ibm-rpg", "gpss", "rexx", "multics" ], "summary": "MUSIC/SP (Multi-User System for Interactive Computing/System Product; originally \"McGill University System for Interactive Computing\") was developed at McGill University in the 1970s from an early IBM time-sharing system called RAX (Remote Access Computing System). The system ran on IBM S/360, S/370, and 4300-series mainframe hardware, and offered novel features (for the time) such as file access control and data compression. It was designed to allow academics and students to create and run their programs interactively on terminals, in an era when most mainframe computing was still being done from punched cards. Over the years, development continued and the system evolved to embrace email, the Internet and eventually the World Wide Web. At its peak in the late 1980s, there were over 250 universities, colleges and high school districts that used the system in North and South America, Europe and Asia.", "created": 2003, "backlinksCount": 228, "pageId": 197821, "revisionCount": 69, "dailyPageViews": 38, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/MUSIC/SP" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "musicxml": { "title": "MusicXML", "appeared": 2004, "type": "pl", "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "wikipedia": { "example": [ "\n\n\n \n \n Music\n \n \n \n \n \n 1\n \n 0\n \n \n \n G\n 2\n \n \n \n \n C\n 4\n \n 4\n whole\n \n \n \n" ], "related": [ "xml", "dtd", "sibelius-software", "javascript" ], "summary": "MusicXML is an XML-based file format for representing Western musical notation. The format is open, fully documented, and can be freely used under the W3C Community Final Specification Agreement.", "backlinksCount": 110, "pageId": 863937, "dailyPageViews": 70, "created": 2004, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/MusicXML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6430", "centralPackageRepositoryCount": 0 }, "musimp": { "title": "MuSimp", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/854d1c0e80326e5865dac9dd78763c646d152359" ], "country": [ "United States" ], "originCommunity": [ "University of Hawaii" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2265", "centralPackageRepositoryCount": 0 }, "musp": { "title": "MUSP", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8ac08826937a3a45a3db22b5507330a527900205" ], "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Musp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5086", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "mustache": { "title": "mustache", "appeared": 2009, "type": "template", "creators": [ "Chris Wanstrath" ], "website": "http://mustache.github.io/", "country": [ "United States and France and Portugal and Croatia" ], "originCommunity": [ "https://github.com/mustache" ], "domainName": { "awisRank": { "2022": 475411 }, "name": "mustache.github.io" }, "example": [ "Hello {{name}}\nYou have just won {{value}} dollars!\n{{#in_ca}}\nWell, {{taxed_value}} dollars, after taxes.\n{{/in_ca}}" ], "githubRepo": { "firstCommit": 2009, "stars": 2841, "forks": 278, "subscribers": 62, "created": 2009, "updated": 2022, "description": "Logic-less Ruby templates.", "issues": 44, "url": "https://github.com/mustache/mustache" }, "repoStats": { "firstCommit": 2009, "commits": 853, "committers": 78, "files": 98 }, "githubLanguage": { "type": "markup", "fileExtensions": [ "mustache" ], "aceMode": "smarty", "codemirrorMode": "smarty", "codemirrorMimeType": "text/x-smarty", "tmScope": "text.html.smarty", "repos": 6085, "id": "Mustache" }, "githubBigQuery": { "repos": 616, "users": 535, "id": "Mustache" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "musys": { "title": "MUSYS", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f2751da6da60ec6092b92430c768536068db80b5" ], "country": [ "England" ], "originCommunity": [ "Alcock Shearing and Partners" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8015", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "mvel": { "title": "MVEL", "appeared": 2003, "type": "pl", "country": [ "Italy and Canada" ], "originCommunity": [ "https://github.com/mvel" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "import java.util.*;\n\n// the main quicksort algorithm\ndef quicksort(list) {\n if (list.size() <= 1) {\n list;\n }\n else {\n pivot = list[0];\n concat(quicksort(($ in list if $ < pivot)), pivot, quicksort(($ in list if $ > pivot)));\n }\n}\n\n// define method to concatenate lists.\ndef concat(list1, pivot, list2) {\n concatList = new ArrayList(list1);\n concatList.add(pivot);\n concatList.addAll(list2);\n concatList;\n}\n\n// create a list to sort\nlist = [5,2,4,1,18,10,15,1,0];\n\n// sort it!\nquicksort(list);" ], "related": [ "java", "xml", "lisp", "ognl" ], "summary": "MVFLEX Expression Language (MVEL) is a hybrid dynamic/statically typed, embeddable Expression Language and runtime for the Java Platform. Originally started as a utility language for an application framework, the project is now developed completely independently. MVEL is typically used for exposing basic logic to end-users and programmers through configuration such as XML files or annotations. It may also be used to parse simple JavaBean expressions. The runtime allows MVEL expressions to be executed either interpretively, or through a pre-compilation process with support for runtime bytecode generation to remove overhead. Since MVEL is meant to augment Java-based software, it borrows most of its syntax directly from the Java programming language with some minor differences and additional capabilities. For example: as a side effect of MVEL's typing model, which treats class and method references as regular variables, it is possible to use both class and function pointers (but only for static methods). MVEL also allows collections to be represented as folds (or projections) in a Lisp-like syntax.", "created": 2008, "backlinksCount": 13, "pageId": 19100445, "revisionCount": 75, "dailyPageViews": 43, "url": "https://en.wikipedia.org/wiki/MVEL" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mvl": { "title": "MVL", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/17577952166282ee183b0cf669fe7ab629b6f0f0" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3669", "centralPackageRepositoryCount": 0 }, "mxml": { "title": "MXML", "appeared": 2004, "type": "xmlFormat", "country": [ "United States" ], "originCommunity": [ "Adobe Inc" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "\n\n \n \n \n \n \n" ], "related": [ "musicxml", "xml", "actionscript", "php", "xaml", "uiml", "svg" ], "summary": "MXML is an XML-based user interface markup language first introduced by Macromedia in March 2004. Application developers use MXML in combination with ActionScript to develop rich Internet applications, with products such as Apache Flex. Adobe Systems, which acquired Macromedia in December 2005, gives no official meaning for the acronym MXML. Some developers suggest it should stand for \"Magic eXtensible Markup Language\" (which is a backronym). It is likely that the name comes from the MX suffix given to Macromedia Studio products released in 2002 and 2004, or simply \"Macromedia eXtensible Markup Language\". MXML is used mainly to declaratively lay out the interface of applications and can also be used to implement business logic and internet application behaviors. It can contain chunks of ActionScript code, either when creating the body of an event handler function, or with data binding where the curly braces ({) syntax is used. MXML is often used with Flex Server, which dynamically compiles it into standard binary SWF files. However, the Adobe Flash Builder IDE (formerly Adobe Flex Builder) and free Flex SDK can also compile MXML into SWF files without the use of a Flex Server. There is also a PHP PEAR package called XML_MXML, which is a framework to build Adobe Flex applications. MXML is considered a proprietary standard due to its tight integration with Adobe technologies. It is like XAML in this respect. No published translators exist for converting an MXML document to another user interface language such as UIML, XUL, XForms, XAML, or SVG. However, there do exist third party vendor plugins for Flex Builder that are capable of generating a result other than a SWF file from Flex applications, for instance native mobile applications.", "backlinksCount": 183, "pageId": 894349, "created": 2004, "revisionCount": 124, "dailyPageViews": 32, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/MXML" }, "pygmentsHighlighter": { "filename": "actionscript.py", "fileExtensions": [ "mxml" ], "id": "MXML" }, "leachim6": { "filepath": "m/MXML.mxml", "fileExtensions": [ "mxml" ], "example": [ "\n\n\n" ], "id": "MXML" }, "centralPackageRepositoryCount": 0 }, "mybb": { "title": "MyBB", "appeared": 2002, "type": "pl", "country": [ "Australia" ], "originCommunity": [ "https://github.com/mybb" ], "wikipedia": { "related": [ "php", "mysql", "postgresql", "sqlite", "subversion", "javascript", "jquery", "twig", "wordpress", "xml" ], "summary": "MyBB, formerly MyBBoard and originally MyBulletinBoard, is a free and open-source forum software developed by the MyBB Group. It is written in PHP, supports MySQL, PostgreSQL and SQLite as database systems and, in addition, has database failover support. It is available in multiple languages and is licensed under the LGPL.", "backlinksCount": 60, "pageId": 34093886, "dailyPageViews": 46, "created": 2011, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/MyBB" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8605", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mycroft": { "title": "mycroft", "appeared": 2013, "type": "pl", "description": "A prolog-like language with compound truth value logic", "website": "https://enkiv2.github.io/mycroft/", "country": [ "United States" ], "originCommunity": [ "http://www.lord-enki.net" ], "githubRepo": { "firstCommit": 2013, "stars": 69, "forks": 6, "subscribers": 5, "created": 2013, "updated": 2022, "description": "A prolog-like language with compound truth value logic", "issues": 1, "url": "https://github.com/enkiv2/mycroft" }, "repoStats": { "firstCommit": 2013, "commits": 207, "committers": 3, "files": 32 } }, "myghty": { "title": "Myghty", "appeared": 2006, "type": "pl", "description": "A Python-based template and view-controller framework derived from HTML::Mason. Supports the full featureset of Mason, allowing component-based web development with Python-embedded HTML, and includes many new concepts and features not found in Mason. Myghty is a legacy library. New projects should use Mako templates.", "reference": [ "https://pypi.org/project/Myghty/" ], "country": [ "United States" ], "originCommunity": [ "https://web.archive.org/web/20100618062929/http://www.myghty.org/" ], "githubLanguage": { "fileExtensions": [ "myt" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 1, "id": "Myghty" }, "githubBigQuery": { "repos": 59, "users": 59, "id": "Myghty" }, "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "myt", "autodelegate" ], "id": "Myghty" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "myia": { "title": "myia", "appeared": 2017, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "Quebec Artificial Intelligence Institute" ], "githubRepo": { "firstCommit": 2017, "stars": 449, "forks": 40, "subscribers": 31, "created": 2017, "updated": 2022, "description": "Myia prototyping", "issues": 30, "url": "https://github.com/mila-udem/myia" }, "repoStats": { "firstCommit": 2017, "commits": 965, "committers": 10, "files": 388 }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "mypy": { "title": "mypy", "appeared": 2012, "type": "pl", "website": "http://www.mypy-lang.org", "country": [ "United Kingdom" ], "originCommunity": [ "University of Cambridge" ], "domainName": { "registered": 2012, "awisRank": { "2022": 898482 }, "name": "mypy-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n4561973|Mypy - An experimental Python variant with dynamic and static typing|http://www.mypy-lang.org/|2012-09-23 20:41:51 UTC|1348432911|room606|39|108", "twitter": "https://twitter.com/mypyproject" }, "myrddin": { "title": "myrddin", "appeared": 2016, "type": "pl", "description": "Myrddin is a systems programming language. Myrddin emphasizes control, simplicity, a clear mental model and predictable, transparent behavior. It features strong type checking, generics, type inference, closures, and traits. It aims to fit a similar niche as C, but with fewer bullets in your feet.", "website": "https://myrlang.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/oridb/mc/issues" ], "domainName": { "registered": 2016, "awisRank": { "2017": 6310985 }, "name": "myrlang.org" }, "leachim6": { "filepath": "m/Myrddin.myr", "fileExtensions": [ "myr" ], "example": [ "use std\n\nconst main = {\n std.put(\"Hello World\\n\")\n}\n\n" ], "id": "Myrddin" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Myrddin", "fileType": "text", "centralPackageRepositoryCount": 0 }, "mys": { "title": "mys", "appeared": 2020, "type": "pl", "creators": [ "Erik Moqvist" ], "country": [ "Iran" ], "originCommunity": [ "https://github.com/mys-lang" ], "githubRepo": { "firstCommit": 2020, "stars": 128, "subscribers": 11, "created": 2020, "updated": 2022, "description": "The Mys (/maɪs/) programming language - an attempt to create a statically typed Python-like language that produces fast binaries. See https://mys-lang.org for more information.", "forks": 8, "issues": 7, "url": "https://github.com/eerimoq/mys" }, "repoStats": { "firstCommit": 2020, "commits": 2943, "committers": 4, "files": 980 }, "semanticScholar": "" }, "mysql": { "title": "MySQL", "appeared": 1995, "type": "queryLanguage", "creators": [ "David Axmark", "Michael Widenius" ], "website": "http://www.mysql.com/", "documentation": [ "https://dev.mysql.com/doc/" ], "emailList": [ "http://mysql.babo.ist/#/en/mailing-lists.html" ], "originCommunity": [ "Oracle" ], "domainName": { "registered": 1999, "awisRank": { "2022": 1475 }, "name": "mysql.com" }, "releaseNotesUrl": "https://dev.mysql.com/doc/relnotes/mysql/8.0/en/", "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasHexadecimals": { "example": "-- x'([0-9a-f]{2})+'", "value": true }, "hasFloats": { "example": "-- [0-9]+\\.[0-9]*(e[+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "-- [0-9]+(?=[^0-9a-z$_\\u0080-\\uffff])", "value": true }, "hasBinaryNumbers": { "example": "-- b'[01]+'", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "ACCESSIBLE", "ADD", "ALL", "ALTER", "ANALYZE", "AND", "AS", "ASC", "ASENSITIVE", "BEFORE", "BETWEEN", "BIGINT", "BINARY", "BLOB", "BOTH", "BY", "CALL", "CASCADE", "CASE", "CHANGE", "CHAR", "CHARACTER", "CHECK", "COLLATE", "COLUMN", "CONDITION", "CONSTRAINT", "CONTINUE", "CONVERT", "CREATE", "CROSS", "CUBE", "CUME_DIST", "CURRENT_DATE", "CURRENT_TIME", "CURRENT_TIMESTAMP", "CURRENT_USER", "CURSOR", "DATABASE", "DATABASES", "DAY_HOUR", "DAY_MICROSECOND", "DAY_MINUTE", "DAY_SECOND", "DEC", "DECIMAL", "DECLARE", "DEFAULT", "DELAYED", "DELETE", "DENSE_RANK", "DESC", "DESCRIBE", "DETERMINISTIC", "DISTINCT", "DISTINCTROW", "DIV", "DOUBLE", "DROP", "DUAL", "EACH", "ELSE", "ELSEIF", "EMPTY", "ENCLOSED", "ESCAPED", "EXCEPT", "EXISTS", "EXIT", "EXPLAIN", "FALSE", "FETCH", "FIRST_VALUE", "FLOAT", "FLOAT4", "FLOAT8", "FOR", "FORCE", "FOREIGN", "FROM", "FULLTEXT", "FUNCTION", "GENERATED", "GET", "GRANT", "GROUP", "GROUPING", "GROUPS", "HAVING", "HIGH_PRIORITY", "HOUR_MICROSECOND", "HOUR_MINUTE", "HOUR_SECOND", "IF", "IGNORE", "IN", "INDEX", "INFILE", "INNER", "INOUT", "INSENSITIVE", "INSERT", "INT", "INT1", "INT2", "INT3", "INT4", "INT8", "INTEGER", "INTERVAL", "INTO", "IO_AFTER_GTIDS", "IO_BEFORE_GTIDS", "IS", "ITERATE", "JOIN", "JSON_TABLE", "KEY", "KEYS", "KILL", "LAG", "LAST_VALUE", "LATERAL", "LEAD", "LEADING", "LEAVE", "LEFT", "LIKE", "LIMIT", "LINEAR", "LINES", "LOAD", "LOCALTIME", "LOCALTIMESTAMP", "LOCK", "LONG", "LONGBLOB", "LONGTEXT", "LOOP", "LOW_PRIORITY", "MASTER_BIND", "MASTER_SSL_VERIFY_SERVER_CERT", "MATCH", "MAXVALUE", "MEDIUMBLOB", "MEDIUMINT", "MEDIUMTEXT", "MIDDLEINT", "MINUTE_MICROSECOND", "MINUTE_SECOND", "MOD", "MODIFIES", "NATURAL", "NOT", "NO_WRITE_TO_BINLOG", "NTH_VALUE", "NTILE", "NULL", "NUMERIC", "OF", "ON", "OPTIMIZE", "OPTIMIZER_COSTS", "OPTION", "OPTIONALLY", "OR", "ORDER", "OUT", "OUTER", "OUTFILE", "OVER", "PARTITION", "PERCENT_RANK", "PRECISION", "PRIMARY", "PROCEDURE", "PURGE", "RANGE", "RANK", "READ", "READS", "READ_WRITE", "REAL", "RECURSIVE", "REFERENCES", "REGEXP", "RELEASE", "RENAME", "REPEAT", "REPLACE", "REQUIRE", "RESIGNAL", "RESTRICT", "RETURN", "REVOKE", "RIGHT", "RLIKE", "ROW", "ROWS", "ROW_NUMBER", "SCHEMA", "SCHEMAS", "SECOND_MICROSECOND", "SELECT", "SENSITIVE", "SEPARATOR", "SET", "SHOW", "SIGNAL", "SMALLINT", "SPATIAL", "SPECIFIC", "SQL", "SQLEXCEPTION", "SQLSTATE", "SQLWARNING", "SQL_BIG_RESULT", "SQL_CALC_FOUND_ROWS", "SQL_SMALL_RESULT", "SSL", "STARTING", "STORED", "STRAIGHT_JOIN", "SYSTEM", "TABLE", "TERMINATED", "THEN", "TINYBLOB", "TINYINT", "TINYTEXT", "TO", "TRAILING", "TRIGGER", "TRUE", "UNDO", "UNION", "UNIQUE", "UNLOCK", "UNSIGNED", "UPDATE", "USAGE", "USE", "USING", "UTC_DATE", "UTC_TIME", "UTC_TIMESTAMP", "VALUES", "VARBINARY", "VARCHAR", "VARCHARACTER", "VARYING", "VIRTUAL", "WHEN", "WHERE", "WHILE", "WINDOW", "WITH", "WRITE", "XOR", "YEAR_MONTH", "ZEROFILL" ], "wikipedia": { "related": [ "c", "linux", "solaris", "freebsd", "sql", "perl", "php", "python", "wordpress", "mybb", "drupal", "yacc", "mariadb", "sql-psm", "unicode", "csv", "postgresql", "csharp", "visual-basic", "asp", "utf-8" ], "summary": "MySQL (officially pronounced as \"My S-Q-L\",) is an open-source relational database management system (RDBMS). Its name is a combination of \"My\", the name of co-founder Michael Widenius's daughter, and \"SQL\", the abbreviation for Structured Query Language. The MySQL development project has made its source code available under the terms of the GNU General Public License, as well as under a variety of proprietary agreements. MySQL was owned and sponsored by a single for-profit firm, the Swedish company MySQL AB, now owned by Oracle Corporation. For proprietary use, several paid editions are available, and offer additional functionality. MySQL is a central component of the LAMP open-source web application software stack (and other \"AMP\" stacks). LAMP is an acronym for \"Linux, Apache, MySQL, Perl/PHP/Python\". Applications that use the MySQL database include: TYPO3, MODx, Joomla, WordPress, phpBB, MyBB, and Drupal. MySQL is also used in many high-profile, large-scale websites, including Google (though not for searches), Facebook, Twitter, Flickr, and YouTube.", "pageId": 19545, "dailyPageViews": 2139, "created": 2001, "backlinksCount": 3644, "revisionCount": 3746, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/MySQL" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/mysql", "monaco": "mysql", "pygmentsHighlighter": { "filename": "sql.py", "id": "MySQL" }, "leachim6": { "filepath": "m/MySQL.sql", "fileExtensions": [ "sql" ], "example": [ "SELECT \"Hello World\";\n" ], "id": "MySQL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:MySQL", "rijuRepl": { "example": [ "SELECT 'Hello, world!';\n" ], "id": "https://riju.codes/mysql" }, "indeedJobs": { "2022": 21490, "query": "MySQL developer" }, "linkedInSkill": { "2018": 2597646, "id": "mysql" }, "officialBlogUrl": [ "https://dev.mysql.com/blog-archive/" ], "faqPageUrl": [ "https://www.mysql.com/industry/faq/" ], "downloadPageUrl": [ "https://www.mysql.com/downloads/" ], "meetup": { "memberCount": 276432, "groupCount": 644, "url": "https://www.meetup.com/topics/mysql" }, "twitter": "https://twitter.com/mysql", "fileType": "text", "wordRank": 3351, "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMySQL Language Reference|2004|MySQL|296747|3.71|7|0\nPHP and MySQL Web Development (Developer's Library)|2003|Luke Welling|40127|3.95|854|54\nPHP & MySQL For Dummies|2002|Janet Valade|40136|3.53|186|11\nMySQL Stored Procedure Programming: Building High-Performance Web Applications in MySQL|2006|Guy Harrison|43055|3.67|48|3\nMySQL Administrator's Guide and Language Reference|2006|MySQL AB|42670|3.63|19|2", "isbndb": "year|publisher|title|authors|isbn13\n2009|Oxford University Press|Building Bioinformatics Solutions: with Perl, R and MySQL|Bessant, Conrad and Shadforth, Ian and Oakley, Darren|9780199230235\n2007|Addison-Wesley Professional|SQL for MySQL Developers: A Comprehensive Tutorial and Reference|van der Lans, Rick|9780131497351\n2008|Addison-Wesley Professional|MySQL (4th Edition)|DuBois, Paul|9780672329388\n2012|CreateSpace Independent Publishing Platform|The Joy of PHP: A Beginner's Guide to Programming Interactive Web Applications with PHP and mySQL|Forbes, Alan|9781494267353\n2004|Cengage Learning PTR|PHP 5 / MySQL Programming for the Absolute Beginner|Harris, Andy|9781592004942\n2015|Apress|Learn PHP 7: Object Oriented Modular Programming using HTML5, CSS3, JavaScript, XML, JSON, and MySQL|Prettyman, Steve|9781484217290\n1999|O'Reilly Media|MySQL and mSQL|King, Tim and Reese, George and Yarger, Randy|9781565924345\n2008|Sams|Sams Teach Yourself PHP, MySQL and Apache All in One|Meloni, Julie C.|9780672329760\n2017|Sams Publishing|PHP, MySQL & JavaScript All in One, Sams Teach Yourself|Meloni, Julie|9780672337703\n2008|Cengage Learning EMEA|Dynamic Web Application Development Using PHP and MySQL|Stobart, Simon and Parsons, David|9781844807536\n2003|Wiley|MySQL and Java Developer's Guide|Mark Matthews and Jim Cole and Joseph D. Gradecki|9780471269236\n2009|McGraw-Hill Education|MySQL Database Usage & Administration|Vaswani, Vikram|9780071605496\n2005|MySQL Press|MySQL Database Design and Tuning|Schneider, Robert D|9780672327650\n2005|O'Reilly Media|MySQL in a Nutshell (In a Nutshell (O'Reilly))|Dyer, Russell J. T.|9780596007898\n20180509|O'Reilly Media, Inc.|Learning PHP, MySQL & JavaScript|Robin Nixon|9781491979099\n2005|For Dummies|PHP and MySQL Everyday Apps For Dummies|Valade, Janet|9780764575877\n2006|O'Reilly Media|Learning PHP and MySQL|Michele E. Davis and Jon A. Phillips|9780596101107\n2012|Springer|PHP and MySQL Manual: Simple, yet Powerful Web Programming (Springer Professional Computing)|Stobart, Simon and Vassileiou, Mike|9781447110552\n2001|Addison-Wesley|Create Dynamic Web Pages Using PHP and MySQL|Tansley, David|9780201734027\n2018||Learning Php, Mysql & Javascript, 5th Edition|Robin Nixon|9781491979075\n2003|Wrox Press|PHP MySQL Website Programming: Problem - Design - Solution|Chris Lea and Mike Buzzard and Cinis, Jessey and Thomas, Dilip|9781861008275\n20180608|McGraw-Hill Professional|MySQL and JSON: A Practical Programming Guide|David Stokes|9781260135459\n2010|Packt Publishing|MySQL 5.1 Plugin Development|Sergei Golubchik and Andrew Hutchings|9781849510608\n2016|Addison-Wesley Professional|PHP and MySQL Web Development (Developer's Library)|Luke, Welling and Thomson Laura|9780133038637\n2016|Apress|PHP and MySQL Recipes: A Problem-Solution Approach|Kromann, Frank M.|9781484206058\n2010|Shroff Publishers and Distributors Pvt. Ltd.|LAMP Programming, for Professionals - Covers MySQL 5.4 & PHP 6 (Book/CD-ROM/CentOS 5.4 DVD) by Sharanam Shah, Vaishali Shah (2010) Hardcover|Sharanam Shah and Vaishali Shah|9788184048438\n2015|Lulu.com|MYSQL Programming Professional Made Easy|Key, Sam|9781329502178\n2014|Apress|Practical PHP and MySQL Website Databases: A Simplified Approach (Expert's Voice in Web Development)|West, Adrian W.|9781430260776\n2021|O'Reilly Media|Learning PHP, MySQL & JavaScript: A Step-by-Step Guide to Creating Dynamic Websites|Nixon, Robin|9781492093824\n2017|Peachpit Press|PHP and MySQL for Dynamic Web Sites: Visual QuickPro Guide|Ullman, Larry|9780134301914\n2017|Peachpit Press|PHP and MySQL for Dynamic Web Sites: Visual QuickPro Guide|Ullman, Larry|9780134301846\n2006|O'Reilly Media|MySQL Stored Procedure Programming: Building High-Performance Web Applications in MySQL|Harrison, Guy and Feuerstein, Steven|9780596100896\n2013|Addison-Wesley Professional|MySQL (Developer's Library)|DuBois, Paul|9780133038538\n2011|O'Reilly Media|Head First PHP & MySQL|Morrison, Michael and Beighley, Lynn|9780596800802\n2020|Bowker|MySQL & JSON A Practical Programming Guide: Second Edition|Stokes, David|9780578783246\n2017|Sams Publishing|PHP, MySQL & JavaScript All in One, Sams Teach Yourself|Meloni Julie C.|9780134439587\n2008|Addison-Wesley Professional|PHP and MySQL Web Development (4th Edition)|Welling, Luke and Thomson, Laura|9780672329166\n2011|Peachpit Press|PHP and MySQL for Dynamic Web Sites, Fourth Edition: Visual QuickPro Guide|Ullman, Larry|9780132767583\n2015|CreateSpace Independent Publishing Platform|The Joy of PHP: A Beginner's Guide to Programming Interactive Web Applications with PHP and mySQL|Forbes, Alan|9781522792147\n2013|Addison-Wesley Professional|MySQL (Developer's Library)|Dubois, Paul|9780321833877\n2014|Peachpit Press|PHP and MySQL for Dynamic Web Sites: Visual QuickPro Guide|Ullman, Larry|9780321784070\n2005|MySQL Press|MySQL 5.0 Certification Study Guide|DuBois, Paul and Hinz, Stefan and Pedersen, Carsten|9780672328121\n2014|O'Reilly Media|MySQL Cookbook: Solutions for Database Developers and Administrators|DuBois, Paul|9781449374020\n2018|Apress|MySQL Connector/Python Revealed: SQL and NoSQL Data Storage Using MySQL for Python Programmers|Krogh, Jesper Wisborg|9781484236949\n2020-12-02T00:00:01Z|Paul Gibbs|PHP Tutorials: Programming with PHP and MySQL: Learn PHP 7 / 8 with MySQL databases for web Programming|Gibbs, Paul|9780992869755\n2010|Packt Publishing|MySQL for Python|Lukaszewski, Albert|9781849510189\n2018|Apress|Introducing InnoDB Cluster: Learning the MySQL High Availability Stack|Bell, Charles|9781484238851\n2018|McGraw-Hill Education|MySQL and JSON: A Practical Programming Guide|Stokes, David|9781260135442\n2018-05-21T00:00:01Z|CreateSpace Independent Publishing Platform|PHP Programming for Beginners: Programming Concepts. How to use PHP with MySQL and Oracle databases (MySqli, PDO)|Skudaev, Sergey|9781548980078\n2008|O'Reilly Media|MySQL in a Nutshell: A Desktop Quick Reference (In a Nutshell (O'Reilly))|Dyer, Russell J. T.|9780596514334\n2002|O'Reilly Media|Managing and Using MySQL (2nd Edition)|King, Tim and Reese, George and Yarger, Randy and Williams, Hugh E. and Yarger, Randy Jay|9780596002114\n2019|Apress|Building REST APIs with Flask: Create Python Web Services with MySQL|Relan, Kunal|9781484250228\n2017|Apress|Pro MySQL NDB Cluster|Krogh, Jesper Wisborg and Okuno, Mikiya|9781484229828\n2015|McGraw-Hill Education|PHP and MySQL Web Development: A Beginner’s Guide (Beginner's Guide)|Matthews, Marty|9780071837316\n2017-02-07T00:00:01Z|CreateSpace Independent Publishing Platform|Web Programming with HTML, CSS, Bootstrap, JavaScript, jQuery, PHP, and MySQL|Sanchez, Larry|9781542604758\n2018|Apress|Practical PHP 7, MySQL 8, and MariaDB Website Databases: A Simplified Approach to Developing Database-Driven Websites|West, Adrian W. and Prettyman, Steve|9781484238431\n2008|John Wiley &Sons|PHP & MySQL Web Development All-in-One Desk Reference For Dummies|Valade, Janet|9780470167779\n2008|Cengage Learning PTR|Just Enough Web Programming with XHTML, PHP, and MySQL|Lecky-Thompson, Guy W.|9781598634815\n2019|Apress|Introducing MySQL Shell: Administration Made Easy with Python|Bell, Charles|9781484250839\n2011|Wrox|PHP and MySQL 24-Hour Trainer|Tarr, Andrea|9781118066881\n2006|Pearson|PHP and MySQL by Example|Quigley, Ellie and Gargenta, Marko|9780138006020\n2010|New Riders|Effortless E-Commerce with PHP and MySQL (Voices That Matter)|Ullman, Larry|9780321678829\n2019-08-10T00:00:01Z|Independently published|Web Programming with HTML, CSS, Bootstrap, JavaScript, jQuery, PHP, and MySQL Second Edition|Sanchez, Larry|9781089565772\n2005|MySQL Press|MySQL Database Design and Tuning|Schneider, Robert D|9780672332692\n2010|Wrox|Expert PHP and MySQL|Curioso, Andrew and Bradford, Ronald and Galbraith, Patrick|9780470563120\n2019|Momentum Press|Creating Data-Driven Web Sites: An Introduction to HTML, CSS, PHP, and MySQL|Terrell, Bob|9781946646057\n2005|Course Technology|PHP Programming with MySQL|Gosselin, Don|9780619216870\n2012|Addison-Wesley Professional|PHP and MySQL Phrasebook (Developer's Library)|Wenz, Christian Wenz|9780321834638\n2017|CreateSpace Independent Publishing Platform|Developing a Java Web Application in a Day: Step by step explanations with Eclipse, Tomcat, MySQL - A complete Java Project with Source Code (Java Web Programming) (Volume 2)|Manelli, Luciano|9781544274386\n2015|Apress|Learn PHP 7: Object Oriented Modular Programming using HTML5, CSS3, JavaScript, XML, JSON, and MySQL|Prettyman, Steve|9781484217306\n2001|Sams|PHP and MySQL Web Development|Luke Welling and Laura Thomson|9780672317842\n2022|Mike Murach & Associates|Murach's PHP and MySQL (4th Edition)|Joel Murach and Ray Harris|9781943873005\n2002|Sams Publishing|MySQL and JSP Web Applications: Data-Driven Programming Using Tomcat and MySQL|Turner, James|9780672323096\n2009|Wrox|Beginning PHP 6, Apache, MySQL 6 Web Development|Boronczyk, Timothy and Naramore, Elizabeth and Gerner, Jason and Le Scouarnec, Yann and Stolz, Jeremy|9780470391143\n2012|Addison-Wesley Professional|PHP and MySQL Phrasebook (Developer's Library)|Wenz, Christian|9780133040333\n2004|SitePoint|Build Your Own Database Driven Website Using PHP and MySQL: Learning PHP & MySQL Has Never Been So Easy!|Yank, Kevin|9780975240212\n2014-11-14T00:00:01Z|CreateSpace Independent Publishing Platform|PHP Programming and MySQL For Beginners: A Simple Start To PHP & MySQL Written By A Software Engineer (PHP Programming, MySQL, Computer Programming, Software Engineering) (Volume 1)|Sanderson, Scott|9781503216051\n2002|Peachpit Press|MySQL|Ullman, Larry|9780321127310\n2005|McGraw-Hill Education|How to Do Everything with PHP and MySQL|Vaswani, Vikram|9780071466547\n2017|CreateSpace Independent Publishing Platform|PHP Beginners Course: Understand basics of PHP / MySQL programming in 5 days|Thenmayer, Klaus|9781542609876\n2003|Apress|PHP MySQL Website Programming: Problem - Design - Solution|Chris Lea and Mike Buzzard and Dilip Thomas and Jessey White-Cinis|9781590591505\n2001|Prentice Hall|Web Programming: Techniques for Integrating Python, Linux, Apache, and Mysql|Thiruvathukal, George K., Ph.D. and Christopher, Thomas W. and Shafaee, John P.|9780130410658\n2019|Independently published|Source Code: Path to Programming MySQL|Society, Source Code|9781090807779\n2005|McGraw-Hill Education|How to Do Everything with PHP and MySQL|Vaswani, Vikram|9780072257953\n2005|Wrox|Professional ADO.NET 2: Programming with SQL Server 2005, Oracle, and MySQL|McClure, Wallace B. and Beamer, Gregory A. and Croft IV, John J. and Little, J. Ambrose and Ryan, Bill and Winstanley, Phil and Yack, David and Zongker, Jeremy|9780764584374\n2002|Sams|Sams Teach Yourself PHP, MySQL and Apache in 24 Hours|Meloni, Julie C.|9780672324895\n2014|Springer Vieweg|Datenbanken und SQL: Eine praxisorientierte Einführung mit Anwendungen in Oracle, SQL Server und MySQL (Informatik & Praxis 17) (German Edition)|Schicker, Edwin|9783834821850\n2005|Sams|Mysql: The definitive guide to using, programming, and administering MySQL 4.1 and 5.0|Dubois, Paul|9780672326738\n2015|CreateSpace Independent Publishing Platform|PHP: The Ultimate Step by Step guide for beginners on how to learn PHP and MYSQL programming in just 6 hours|Dawson, Ted|9781516927494\n2019-11-24T00:00:01Z|Independently published|Learn PyQt By Example: A Quick Start Guide to MySQL and SQLite Driven Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781711134468\n2004|Mysql Pr|MySQL Language Reference: The Official Guide to the MySQL Language and APIs|MySQL AB|9780672326332\n2003|Springer|PHP and MySQL Manual: Simple, yet Powerful Web Programming (Springer Professional Computing)|Stobart, Simon and Vassileiou, Mike|9781852337476\n2007|Equity Press|mySQL Database Programming Interview Questions, Answers, and Explanations: mySQL Database Certification Review Guide|Sanchez-Clark, Terry|9781933804590\n2015-04-29T00:00:01Z|CreateSpace Independent Publishing Platform|Python Programming Professional Made Easy & MYSQL Programming Professional Made Easy (Volume 48)|Key, Sam|9781511966306\n|O´Reilly Verlag|MySQL kurz & gut||9783897215252\n2019-11-05T00:00:01Z|Independently published|Learn SQL: the beginner’s guide that explain to you step by step the computer programming SQL language and how to program your first database using MySQL + practical exercises|Harris, Adam|9781705901298\n2003-06-30T00:00:01Z|Anaya Multimedia-Anaya Interactiva|Desarrollo Web Con Php Y Mysql / PHP and MYSQL Web Development (Programacion / Programming) (Spanish Edition)|Welling, Luke|9788441515697\n2015|CreateSpace Independent Publishing Platform|C Programming Professional Made Easy & MYSQL Programming Professional Made Easy|Key, Sam|9781511730259\n2001|Prentice Hall Ptr|Core MySQL|Atkinson, Leon|9780130661906\n2015|No Starch Press, Incorporated|Php And Mysql For Kids|Johann-Christian Hanke|9781593275655\n2005|Anaya Multimedia-Anaya Interactiva|Mysql (Programacion / Programming) (Spanish Edition)|Dubois, Paul|9788441518988\n2009|ANAYA MULTIMEDIA|Programacion con PHP 6 y MySQL/ Programming with PHP 6 and MySQL (Spanish Edition)|Harris, Andy|9788441525528\n2011|Wiley & Sons, Incorporated, John|Php And Mysql 24-hour Trainer|Andrea Tarr|9781118172933\n2006|O'Reilly Media|Web Database Applications with PHP & MySQL|Shillingford, Nadine|9780596100032\n2009|ANAYA MULTIMEDIA|PHP y MySQL (Anaya Multimedia/Wrox) (Spanish Edition)|Boronczyk, Timothy and Psinas, Martin E.|9788441525160\n2017|Createspace Independent Publishing Platform|Learn Php And Mysql With Ajax In A Weekend : Practical Guide For Quick Learn On Php Programming And Mysql Database Management|Blerton Abazi|9781545378885\n2014|People Post Press|National Computer Rank Examination Tutorial - two MySQL database programming(Chinese Edition)|QUAN GUO JI SUAN JI DENG JI KAO SHI JIAO CAI BIAN XIE...|9787115370501\n2011|LAP LAMBERT Academic Publishing|Websites on Tourism: Internet programming with Java, C#, VB.NET and PHP using Microsoft SQL Server and MySQL databases|Voicu, Mirela Catrinel|9783846515532\n2008|Pearson Technology Group|MySQL|Paul DuBois|9780132704649\n|O'reilly Verlag Gmbh|MySQL : kurz & gut||9783897215252\n02/2015|Mike Murach & Associates|Murach's MySQL|Joel Murach|9781890774882\n03/2019|Mike Murach & Associates|Murach's MySQL|Joel Murach|9781943872466\n20140728|O'Reilly Media, Inc.|MySQL Cookbook|Paul DuBois|9781449374150\n20140728|O'Reilly Media, Inc.|MySQL Cookbook|Paul DuBois|9781449374143\n20061114|O'Reilly Media, Inc.|Learning MySQL|Saied M.M. Tahaghoghi; Hugh E. Williams|9780596529468\n20061114|O'Reilly Media, Inc.|Learning MySQL|Saied M.M. Tahaghoghi; Hugh E. Williams|9781449303969\n2008|Prentice Hall|PHP and MySQL (Video Training)|Marc Wandschneider|9780137155750\n2003|Apress|Professional Mysql Programming|Wrox Author Team|9781861004284\n20211018|O'Reilly Media, Inc.|High Performance MySQL|Silvia Botros; Jeremy Tinley|9781492080466\n20150413|O'Reilly Media, Inc.|Jump Start MySQL|Timothy Boronczyk|9781457192821\n20100921|Packt Publishing|MySQL for Python|Albert Lukaszewski|9781849510196\n20211130|O'Reilly Media, Inc.|Efficient MySQL Performance|Daniel Nichter|9781098105044\n20150413|O'Reilly Media, Inc.|Jump Start MySQL|Timothy Boronczyk|9781457192838\n29-04-2022|Packt Publishing|The MySQL Workshop|Thomas Pettit; Scott Cosentino|9781839215476\n20020423|O'Reilly Media, Inc.|Managing & Using MySQL|Tim King; George Reese; Randy Yarger; Hugh E. Williams|9781449316785\n20020423|O'Reilly Media, Inc.|Managing & Using MySQL|Tim King|9780596159979\n2004|Osborne/mcgraw-hill|Php 5 & Mysql Programming|Vikram Vaswani|9780072228830\n2014|O'reilly Media, Inc.|Learning Php, Mysql & Javascript|Robin Nixon|9781491918647\n20091201|McGraw-Hill Professional|MySQL Database Usage & Administration|Vikram Vaswani|9780071605502\n2021|O'reilly Media, Inc.|Learning Php, Mysql & Javascript|Robin Nixon|9781492093794\n2010|John Wiley & Sons, Ltd.|Expert Php And Mysql|Andrew Curioso|9780470643075\n2010|Wiley & Sons, Incorporated, John|Expert Php And Mysql|Andrew Curioso|9780470881644\n20060602|O'Reilly Media, Inc.|Learning PHP and MySQL|Michele E. Davis; Jon A. Phillips|9780596553500\n||Learning Php, Mysql & Javascript|Robin Nixon|9788184047943\n10/2017|Mike Murach & Associates|Murach's PHP and MySQL|Joel Murach, Ray Harris|9781943872244\n20050503|O'Reilly Media, Inc.|MySQL in a Nutshell|Russell J.T. Dyer|9781449379063\n20060328|O'Reilly Media, Inc.|MySQL Stored Procedure Programming|Guy Harrison|9780596519162\n20121206|Springer Nature|PHP and MySQL Manual|Simon Stobart; Mike Vassileiou|9780857294043\n20080415|O'Reilly Media, Inc.|MySQL in a Nutshell|Russell J.T. Dyer|9780596523237\n20080415|O'Reilly Media, Inc.|MySQL in a Nutshell|Russell J.T. Dyer|9781449379377\n11/2010|Mike Murach & Associates|Murach's PHP and MySQL|Joel Murach, Ray Harris|9781890774745\n12/2014|Mike Murach & Associates|Murach's PHP and MySQL|Joel Murach, Ray Harris|9781890774929\n20210722|O'Reilly Media, Inc.|Learning PHP, MySQL & JavaScript|Robin Nixon|9781492093770\n20101228|Springer Nature|Beginning PHP and MySQL|W Jason Gilmore|9781430231158\n20050503|O'Reilly Media, Inc.|MySQL in a Nutshell|Russell J.T. Dyer|9780596518288\n20220303|Taylor & Francis|Mastering MySQL for Web|Mahauganee D. Shaw Bonds|9781000537758\n20060602|O'Reilly Media, Inc.|Learning PHP and MySQL|Michele E. Davis|9780596519179\n20060328|O'Reilly Media, Inc.|MySQL Stored Procedure Programming|Guy Harrison; Steven Feuerstein|9781449379131\n2007|Pearson|SQL for MySQL Developers|Rick F. van der Lans|9780321509673\n2010|Equity Press|Php Mysql Web Programming Interview Questions, Answers, And Explanations: Php Mysql Faq|Jim Stewart and Itcookbook|9781933804477\n06/2022|Mike Murach & Associates|Murach's PHP and MySQL|Joel Murach, Ray Harris|9781943873012\n20081222|O'Reilly Media, Inc.|Head First PHP & MySQL|Lynn Beighley; Michael Morrison|9781449331559\n2018-06-06|In Easy Steps Limited|PHP & MySQL in easy steps, 2nd edition|Mike McGrath|9781840788310\n20200316|Springer Nature|MySQL 8 Query Performance Tuning|Jesper Wisborg Krogh|9781484255841\n|Kudits-obraz|PHP / MySQL for beginners. Harris E. / PHP/MySQL dlya nachinayushchikh. Kharris E.|Kharris E.|9785957900467\n2003-03-14|Wiley|MySQL and Java Developer's Guide|Mark Matthews and Jim Cole and Joseph D. Gradecki|9780471462224\n2013|Cram101|Studyguide For Php Programming With Mysql|Cram101 Textbook Reviews|9781478495611\n20180620|Springer Nature|Introducing the MySQL 8 Document Store|Charles Bell|9781484227251\n20111013|Wiley Professional Development (P&T)|PHP and MySQL 24-Hour Trainer|Andrea Tarr|9781118172919\n20080328|Springer Nature|Beginning PHP and MySQL E-Commerce|Cristian Darie; Emilian Balanescu|9781430202912\n20130310|eBookit.com|PHP & MySQL Practice It Learn It|Jitendra Patel|9781456614423\n2019-12-02|Paul Gibbs|Php Tutorials: Programming With Php And Mysql: Learn Php 7 With Mysql Databases For Web Programming|Mr Paul Gibbs|9780992869748\n20140220|Emereo|MySQL 323 Success Secrets - 323 Most Asked Questions On MySQL - What You Need To Know|Karen Rich|9781488536373", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|The Development of Web Based Expert System for Diagnosing Children Diseases Using PHP and MySQL|10.14445/22312803/IJCTT-V10P134|12|0|Hustina waty and Randy Aprianggi|e4b687662191d88ae1249632f281317aca509e55\n2016|Aplikasi Diagnosis Gangguan Kecemasan Menggunakan Metode Forward Chaining Berbasis Web dengan PHP dan MYSQL|10.15408/SIJSI.V9I1.2960|7|0|Raka Yusuf and Harni Kusniyati and Yurike Nuramelia|926bb33994dc8ced2416bdf997a19c0497e32220\n2020|Sistem Informasi Berbasis Web Sma Al- Mukhtariyah Mamben Lauk Berbasis Php Dan Mysql Dengan Framework Codeigniter|10.29408/JIT.V3I1.1793|5|0|S. Suhartini and Muhamad Sadali and Yupi Kuspandi Putra|3293452be118ca6720c4a6ea1bfd2bf7198b713b\n2011|PHP and MySQL|10.1007/978-1-4302-3154-7_3|4|0|B. Travis|b101d45a74a4da315d1d7cf5811bdfea7d01cc11\n2013|Determination of Bahasa Melayu Word List From Friday Sermon Transcripts Using PHP and MySQL|10.11113/JT.V64.2071|2|0|M. Harun and Muhammad ‘Aasim Asyafi’ie bin Ahmad and S. Hamid and Fareha Abdul Rahman and P. I. Khalid|cfa538107946ab4e1f77ae41db99d8af9a0a3471\n2014|Sistem Pemrosesan Transaksi Pada Toko Bangunan Berbasis Web Dengan PHP dan MySQL|10.14710/JTSISKOM.2.2.2014.170-174|2|0|Rizky Gelar Maliq and R. Isnanto and Ike Pertiwi Windasari|dbfb0559140c92a193e4723fc8ca7242531286b9\n2016|SISTEM INFORMASI MANAJEMEN SURAT BERBASIS PHP DAN MYSQL DI INSTITUT SENI INDONESIA PADANGPANJANG|10.36275/stsp.v16i1.53|2|1|Irwan Yusti|71d4444fc6c57e59c4e1137b97d0b3da121e028a\n2019|Sistem Pendaftaran Hotspot Online Berbasis Web Menggunakan Mikrotik API, PHP, MySql Pada SMK Plus Nurul Hakim Kediri|10.29303/jtika.v1i2.28|2|0|Lalu Yusran Said and Andy Hidayat Jatmika and I Wayan Agus Arimbawa|8a53d05a3b7c9a1cc46115d08bbd0179f0099166\n2014|Design and implementation of massive MYSQL data intelligent export system to excel by using Apache –POI libraries|10.9790/0661-16545865|1|0|K. Bawankule and N. Raut|3084537903d693e891010c67b082ff28c050fbde\n2019|Perancangan Sistem Informasi Pengolahan Data Penjualan Secara Kredit dan Controlling Stock Dengan Menerapkan Metode Backorder Pada Toko Master Menggunakan Bahasa Pemrograman Java dan Database MySql|10.30829/ALGORITMA.V3I2.6439|1|0|J. Prayoga|852a691443d4f13cf474c7327f78677629d3a738\n2020|Perancangan Sistem Informasi Penjualan pada Toko Stock Point Lily berbasis PHP MySQL|10.47927/jikb.v11i1.195|1|1|Nery Nestary|460f5e0cbb246f392dae830bbf4e2d170b808e38\n2020|PERANCANGAN APLIKASI PENENTUAN HASIL KINERJA KARYAWAN AVIATION SECURITY BERBASIS DESKTOP DENGAN MENGGUNAKAN VISUAL STUDIO DAN MYSQL|10.35968/JSI.V7I2.447|1|0|A. Gani|5b9509a6e6f0400025ef4b305afd50f0aee29d85\n2021|Benchmarking the Operation Times of NoSQL and MySQL Databases for Python Clients|10.1109/IECON48115.2021.9589382|1|0|M. Reichardt and Michael Gundall and H. Schotten|7bca23368078950e94b40d1e397e07870c42901c\n2016|Developing Plugin e-DDC as an Additional Application for Senayan Library Management System with PHP Language Programming and MySQL Database|10.20473/RLJ.V1I3.2124|1|0|Mohamad Rotmianto and E. Wahyudi|e9f2994a961c188db422c61206970134412286fa\n2020|Indonesian Language Portfolio in Elementary Schools Based on C++, C# and MySQL Server|10.32628/IJSRST207643|1|0|Ferril Irham Muzaki|bbc1d72cc1724d8fb228c0f9aa2ca0e6f976e23a\n2020|Implementation of the Electre (Elimination Et Choix Traduisan La Realite) Method in a Healthy Food Menu Decision Support System for Toddlers in the Sasak Area Health Center Pasisie Using the Php And Databse Mysql Programming Language|10.35134/KOMTEKINFO.V7I1.1194|1|0|Mardison Mardison and Syafrika Deni Rizki and L. Rani and Agung Ramadhanu and R. Witri|3144f67d9059167b99ac70b9c5fd369e38955e4b" }, "mythryl": { "title": "mythryl", "appeared": 2006, "type": "pl", "website": "https://mythryl.org", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/mythryl/mythryl/issues" ], "domainName": { "registered": 2006, "name": "mythryl.org" }, "example": [ "fun qsort [] => []; qsort (x!xs) => qsort (filter {. #a < x; } xs) @ [x] @ qsort (filter {. #a >= x; } xs); end;" ], "githubRepo": { "firstCommit": 2010, "stars": 114, "forks": 10, "subscribers": 15, "created": 2010, "updated": 2022, "description": "The Mythryl programming language", "issues": 6, "url": "https://github.com/mythryl/mythryl" }, "repoStats": { "firstCommit": 2010, "commits": 3372, "committers": 6, "files": 5641 } }, "n-prolog": { "title": "N-Prolog", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d32be98849af4eb52ade505125f7444c5b1220b5" ], "country": [ "United Kingdom and Germany" ], "originCommunity": [ "Imperial College", "Universität Stuttgart" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2289", "centralPackageRepositoryCount": 0, "isbndb": "" }, "n-triples": { "title": "N-Triples", "appeared": 2014, "type": "dataNotation", "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "subsetOf": [ "turtle" ], "example": [ " ↵\n .\n \"N-Triples\"@en-US .\n _:art .\n _:dave .\n_:art .\n_:art \"Art Barstow\".\n_:dave .\n_:dave \"Dave Beckett\"." ], "wikipedia": { "summary": "N-Triples is a format for storing and transmitting data. It is a line-based, plain text serialisation format for RDF (Resource Description Framework) graphs, and a subset of the Turtle (Terse RDF Triple Language) format. N-Triples should not be confused with Notation3 which is a superset of Turtle. N-Triples was primarily developed by Dave Beckett at the University of Bristol and Art Barstow at the World Wide Web Consortium (W3C).N-Triples was designed to be a simpler format than Notation3 and Turtle, and therefore easier for software to parse and generate. However, because it lacks some of the shortcuts provided by other RDF serialisations (such as CURIEs and nested resources, which are provided by both RDF/XML and Turtle) it can be onerous to type out large amounts of data by hand, and difficult to read.", "backlinksCount": 140, "pageId": 15752256, "dailyPageViews": 91, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/N-Triples" }, "isbndb": "" }, "n": { "title": "N", "appeared": 1990, "type": "pl", "creators": [ "Gael de La Croix Vaubois", "Catherine Moulinoux", "BenoIt Derot" ], "reference": [ "https://link.springer.com/chapter/10.1007/978-3-642-76153-9_10" ], "country": [ "France" ], "originCommunity": [ "Thomson-CSF" ] }, "nadesiko": { "title": "Nadesiko", "appeared": 2008, "type": "pl", "creators": [ "kujirahand" ], "website": "https://nadesi.com/", "fileExtensions": [ "nako", "nako3" ], "country": [ "Japan" ], "originCommunity": [ "https://kujirahand.com" ], "compilesTo": [ "javascript" ], "example": [ "# 取り込みテスト\n●(AとBの)加算処理とは\n A+Bを戻す。\nここまで。" ], "githubRepo": { "stars": 177, "forks": 17, "subscribers": 3, "created": 2017, "updated": 2022, "description": "Japanese Programming Language Nadesiko v3 (JavaScript)", "url": "https://github.com/kujirahand/nadesiko3" }, "repoStats": { "firstCommit": 2017, "commits": 2774, "committers": 24, "files": 299 } }, "nail": { "title": "Nail", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2247a9af4172b74267e2fe8bf8283860d6e285f7" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5795", "wordRank": 6667, "centralPackageRepositoryCount": 0 }, "nakl": { "title": "NAKL", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2b3750267744a90e81e6bed54c22e84da70a7c2c" ], "standsFor": "Not Another Keypunch Language", "country": [ "United States" ], "originCommunity": [ "University of Arkansas" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7306", "centralPackageRepositoryCount": 0, "isbndb": "" }, "nano-editor": { "title": "GNU nano", "appeared": 2000, "type": "editor", "website": "https://www.nano-editor.org", "country": [ "United States" ], "originCommunity": [ "https://nano-editor.org/contact.php" ], "domainName": { "registered": 2000, "awisRank": { "2022": 548134 }, "name": "nano-editor.org" }, "wikipedia": { "related": [ "c", "regex" ], "summary": "GNU nano is a text editor for Unix-like computing systems or operating environments using a command line interface. It emulates the Pico text editor, part of the Pine email client, and also provides additional functionality. Unlike Pico, nano is licensed under the GNU General Public License (GPL). Released as free software by Chris Allegretta in 1999, nano became part of the GNU Project in 2001.", "pageId": 21850, "created": 2002, "backlinksCount": 105, "revisionCount": 295, "dailyPageViews": 117, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/GNU_nano" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "napier88": { "title": "Napier88", "appeared": 1989, "type": "pl", "country": [ "Scotland" ], "originCommunity": [ "University of St Andrews" ], "wikipedia": { "related": [ "java", "s-algol", "ps-algol", "isbn" ], "summary": "Napier88 is an orthogonally persistent programming language that was designed and implemented at the University of St Andrews, Scotland. The primary designer was Ron Morrison, whose initial designs were extended and implemented by Fred Brown, Richard Connor, and Al Dearle. Napier88 was ahead of its time in many ways, and was the first robustly implemented language to combine a polymorphic type system with orthogonal persistence. The language was robustly implemented and released to users from both industry and academia; up to 1,000 registered users were recorded in due course. The language, however, was only intended to provide a proof of concept for an experiment in persistent programming; some time after 1989 (the year the first implementation was in fact released) the group's interests moved on and the language was no longer maintained. Its influence lives on in various other systems however; the CORBA type ANY is distinctly recognisable in Napier88's type ANY; Microsoft's CLR uses a similar polymorphic architecture, and Java's parametric types solve some of the same problems of uninstantiated types escaping from their static scope.", "created": 2006, "backlinksCount": 24, "pageId": 5748470, "revisionCount": 35, "dailyPageViews": 5, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Napier88" }, "centralPackageRepositoryCount": 0 }, "napss": { "title": "NAPSS", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/57ad3061f92a25b6b7e0b19bc440a0ecf3245bf0" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=231", "centralPackageRepositoryCount": 0 }, "narpl": { "title": "NARPL", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/513307c8f1387456af597c00d5033424452fc5ae" ], "country": [ "United States" ], "originCommunity": [ "Drexel University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2859", "centralPackageRepositoryCount": 0 }, "nasal": { "title": "Nasal", "appeared": 2002, "type": "pl", "creators": [ "Andy Ross" ], "website": "https://web.archive.org/web/20150202210822/http://plausible.org/nasal", "reference": [ "https://mathieugouin.github.io/nasal/", "http://freshmeat.sourceforge.net/projects/nasal" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/andyross/nasal/issues" ], "githubLanguage": { "type": "programming", "fileExtensions": [ "nas" ], "aceMode": "text", "tmScope": "none", "repos": 32, "id": "Nasal" }, "githubBigQuery": { "repos": 12, "users": 12, "id": "Nasal" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8606", "centralPackageRepositoryCount": 0 }, "nasm": { "title": "Netwide Assembler", "appeared": 1996, "type": "assembly", "website": "http://www.nasm.us", "country": [ "United States and Russia" ], "originCommunity": [ "https://github.com/netwide-assembler" ], "domainName": { "registered": 2007, "awisRank": { "2022": 382491 }, "name": "nasm.us" }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "global _start\n\nsection .data\n\n\tquery_string:\t\tdb\t\"Enter a character: \"\n\tquery_string_len:\tequ\t$ - query_string\n\tout_string:\t\t\tdb\t\"You have input: \"\n\tout_string_len:\t\tequ\t$ - out_string\n\nsection .bss\n\n\tin_char:\t\t\tresw 4\n\nsection .text\n\n_start:\n\n\tmov\trax, 0x2000004\t \t; put the write-system-call-code into register rax\n\tmov\trdi, 1\t\t\t\t; tell kernel to use stdout\n\tmov\trsi, query_string\t; rsi is where the kernel expects to find the address of the message\n\tmov\trdx, query_string_len\t; and rdx is where the kernel expects to find the length of the message \n\tsyscall\n\n\t; read in the character\n\tmov\trax, 0x2000003\t\t; read system call\n\tmov\trdi, 0\t\t\t\t; stdin\n\tmov\trsi, in_char\t\t; address for storage, declared in section .bss\n\tmov\trdx, 2\t\t\t\t; get 2 bytes from the kernel's buffer (one for the carriage return)\n\tsyscall\n\n\t; show user the output\n\tmov\trax, 0x2000004\t\t; write system call\n\tmov\trdi, 1\t\t\t\t; stdout\n\tmov\trsi, out_string\n\tmov\trdx, out_string_len\n\tsyscall\n\n\tmov\trax, 0x2000004\t\t; write system call\n\tmov\trdi, 1\t\t\t\t; stdout\n\tmov\trsi, in_char\n\tmov\trdx, 2\t\t\t\t; the second byte is to apply the carriage return expected in the string\n\tsyscall\n\n\t; exit system call\n\tmov\trax, 0x2000001\t\t; exit system call\n xor rdi, rdi\n\tsyscall" ], "related": [ "x86-assembly", "assembly-language", "x86-isa", "ia-32", "linux", "coff", "elf", "powerpc", "sparc" ], "summary": "The Netwide Assembler (NASM) is an assembler and disassembler for the Intel x86 architecture. It can be used to write 16-bit, 32-bit (IA-32) and 64-bit (x86-64) programs. NASM is considered to be one of the most popular assemblers for Linux. NASM was originally written by Simon Tatham with assistance from Julian Hall. As of 2016, it is maintained by a small team led by H. Peter Anvin. It is open-source software released under the terms of a simplified (2-clause) BSD license.", "pageId": 60647, "dailyPageViews": 117, "created": 2002, "backlinksCount": 77, "revisionCount": 297, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Netwide_Assembler" }, "pygmentsHighlighter": { "filename": "asm.py", "fileExtensions": [ "asm", "ASM" ], "id": "NASM" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "nassi-shneiderman-charts": { "title": "Nassi-Shneiderman charts", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/18b416005dee051a440081e2cd7232987ff33172" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7314", "centralPackageRepositoryCount": 0 }, "native-structured-storage": { "title": "NSS", "appeared": 1999, "type": "binaryDataFormat", "description": "Native Structured Storage (NSS) was a method to transparently store ActiveX document files in a multi-stream format on NTFS volumes", "reference": [ "https://web.archive.org/web/20070927212324/http://www.windowsitpro.com/Article/ArticleID/13785/13785.html" ], "standsFor": "Native Structured Storage", "country": [ "United States" ], "originCommunity": [ "Microsoft" ] }, "nato-phonetic-alphabet": { "title": "NATO phonetic alphabet", "appeared": 1956, "type": "notation", "country": [ "Canada" ], "originCommunity": [ "International Civil Aviation Organization" ], "wikipedia": { "related": [ "morse-code", "unicode" ], "summary": "The NATO phonetic alphabet, officially denoted as the International Radiotelephony Spelling Alphabet, and also commonly known as the ICAO phonetic alphabet, and in a variation also known officially as the ITU phonetic alphabet and figure code, is the most widely used radiotelephone spelling alphabet. Although often called \"phonetic alphabets\", spelling alphabets are unrelated to phonetic transcription systems such as the International Phonetic Alphabet. Instead, the International Civil Aviation Organization (ICAO) alphabet assigned codewords acrophonically to the letters of the English alphabet, so that critical combinations of letters and numbers are most likely to be pronounced and understood by those who exchange voice messages by radio or telephone, regardless of language differences or the quality of the communication channel.The 26 code words in the NATO phonetic alphabet are assigned to the 26 letters of the English alphabet in alphabetical order as follows: Alfa, Bravo, Charlie, Delta, Echo, Foxtrot, Golf, Hotel, India, Juliett, Kilo, Lima, Mike, November, Oscar, Papa, Quebec, Romeo, Sierra, Tango, Uniform, Victor, Whiskey, X-ray, Yankee, Zulu.Strict adherence to the prescribed spelling words is required in order to avoid the problems of confusion that the spelling alphabet is designed to overcome. As noted in a 1955 NATO memo, It is known that [the ICAO spelling alphabet] has been prepared only after the most exhaustive tests on a scientific basis by several nations. One of the firmest conclusions reached was that it was not practical to make an isolated change to clear confusion between one pair of letters. To change one word involves reconsideration of the whole alphabet to ensure that the change proposed to clear one confusion does not itself introduce others. The same memo notes a potential confusion between ZERO and SIERRA is overcome when following the procedures in ACP 125, which specify the use of the procedure word FIGURES in many instances in which digits need to be read.", "created": 2001, "backlinksCount": 626, "pageId": 59045, "dailyPageViews": 13394, "appeared": 1955, "url": "https://en.wikipedia.org/wiki/NATO_phonetic_alphabet" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "natural": { "title": "NATURAL", "appeared": 1971, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "Software AG" ], "wikipedia": { "example": [ "0010 * These two lines (0010 and 0020)\n0020 ** are comments.\n0030 FORMAT LS = 80 / * As well as this part of the line (0030)\n0040 * NOTE: The \"/ *\" form has a space between the SLASH and ASTERISK.\n.\n.\n0200 END" ], "related": [ "linux", "unix", "model-204", "sql", "cobol" ], "summary": "ADABAS, a contraction of “adaptable database system\", is a database package that was developed by Software AG to run on IBM mainframes. Launched in 1971 as a non-relational software package, earnings reports for the package's vendor were being followed by The New York Times in the early 1980s.As of 2017, ADABAS is marketed for use on a wider range of platforms, including Linux, UNIX and Windows.", "created": 2018, "backlinksCount": 34, "pageId": 401962, "revisionCount": 1, "dailyPageViews": 3, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/NATURAL" }, "wordRank": 759, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Steven Bird, Ewan Klein and Edward Loper: Natural Language Processing with Python, Analyzing Text with the Natural Language Toolkit|10.1007/s10579-010-9124-x|1304|116|Wiebke Wagner|cfdd423c8672a7b178ea85d56079328df4eea647\n2020|CodeBERT: A Pre-Trained Model for Programming and Natural Languages|10.18653/v1/2020.findings-emnlp.139|398|114|Zhangyin Feng and Daya Guo and Duyu Tang and Nan Duan and Xiaocheng Feng and Ming Gong and Linjun Shou and Bing Qin and Ting Liu and Daxin Jiang and Ming Zhou|0fe2636446cd686830da3d971b31a004d6094b3c\n1981|Natural Language Programming: Styles, Strategies, and Contrasts|10.1147/sj.202.0184|183|4|L. A. Miller|2a49ee0e7fa2048c483856cbbf5b24b05340ae8f\n2002|Mobile robot programming using natural language|10.1016/S0921-8890(02)00166-5|173|4|S. Lauria and G. Bugmann and T. Kyriacou and Ewan Klein|340e8db8d35bc3343727ac51c905f9dbd6c92c18\n2012|Inferring method specifications from natural language API descriptions|10.1109/ICSE.2012.6227137|152|8|Rahul Pandita and Xusheng Xiao and Hao Zhong and Tao Xie and S. Oney and A. Paradkar|d2544ae0c1411445a4f6400e5fba61e1a2913da5\n2017|Evaluating Natural Language Understanding Services for Conversational Question Answering Systems|10.18653/v1/W17-5522|136|10|Daniel Braun and Adrian Hernandez-Mendez and F. Matthes and M. Langen|ab8c725e04fc25dc03e96332e4490573cd87abd8\n2014|NLyze: interactive programming by natural language for spreadsheet data analysis and manipulation|10.1145/2588555.2612177|102|6|Sumit Gulwani and Mark Marron|baa919534218b7dfad833f3bd47314be7044c84b\n2005|Teaching the tacit knowledge of programming to noviceswith natural language tutoring|10.1080/08993400500224286|99|6|H. Lane and K. VanLehn|ed0f7f735cf4bb211cc19841cd7391eee927bfb6\n2015|Program Synthesis Using Natural Language|10.1145/2884781.2884786|95|8|Aditya Desai and Sumit Gulwani and V. Hingorani and Nidhi Jain and Amey Karkare and Mark Marron and R. Sailesh and Subhajit Roy|2579e826f22da988fbc1b5d545aa59ab68bde4f3\n2000|NaturalJava: a natural language interface for programming in Java|10.1145/325737.325845|93|5|D. Price and E. Riloff and J. Zachary and Brandon Harvey|a11513ce3256ebea0eec68b38acbd8275723050d\n2013|SmartSynth: synthesizing smartphone automation scripts from natural language|10.1145/2462456.2464443|91|12|Vu Le and Sumit Gulwani and Z. Su|15fc2c21caff60b98c242c88c6890f790d1f5447\n1986|Automatic Programming Through Natural Language Dialogue: A Survey|10.1147/rd.204.0302|83|0|G. Heidorn|6e47dc64b863fa01508fc1a855c3f6aa26cefb2f\n1983|An Experimental Study of Natural Language Programming|10.1016/S0020-7373(83)80005-4|76|1|A. Biermann and B. Ballard and A. Sigmon|40f6a11f7fdcad7ece0739780414a32f9c31ace8\n1996|Inductive Logic Programming for Natural Language Processing|10.1007/3-540-63494-0_45|71|7|R. Mooney|ac11493e05275258f09e6406a2635752899f074d\n1979|Programming in natural language: “NLC” as a prototype|10.1145/800177.810072|69|4|B. Ballard and A. Biermann|d74b5b7d087689ae10c47d9292e3eea8bd074e58\n2017|A Neural Architecture for Generating Natural Language Descriptions from Source Code Changes|10.18653/v1/P17-2045|69|9|Pablo Loyola and Edison Marrese-Taylor and Y. Matsuo|45416ffd8fa572c23c8dbc43cc7b8b5095fcbcc2\n2019|NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language|10.18653/v1/P19-1618|61|8|Leon Weber and Pasquale Minervini and Jannes Munchmeyer and U. Leser and Tim Rocktäschel|2163dbd2c06f0aa326995b59c226e40553c4c63b\n2018|Characterizing the Natural Language Descriptions in Software Logging Statements|10.1145/3238147.3238193|52|9|Pinjia He and Zhuangbin Chen and Shilin He and Michael R. Lyu|e2b098eef6bf83ed7d21ec6bc7249b6aab965940\n2014|A Grammar-Based Semantic Similarity Algorithm for Natural Language Sentences|10.1155/2014/437162|49|4|Ming-Che Lee and Jia-Wei Chang and T. Hsieh|d49ce913be73d93a7a0a02cf78aa0331dd3cf8d1\n2013|Natural language programming of industrial robots|10.1109/ISR.2013.6695630|49|2|Maj Stenmark and P. Nugues|e3b741d3d08927305fd89233ac7e9605bf2f4d6d\n2019|Genie: a generator of natural language semantic parsers for virtual assistant commands|10.1145/3314221.3314594|44|0|Giovanni Campagna and Silei Xu and M. Moradshahi and R. Socher and M. Lam|f906264694759f1beda0cb07d02bf098b98c17bb\n2019|PUMICE: A Multi-Modal Agent that Learns Concepts and Conditionals from Natural Language and Demonstrations|10.1145/3332165.3347899|43|6|Toby Jia-Jun Li and Marissa Radensky and Justin Jia and Kirielle Singarajah and Tom Michael Mitchell and B. Myers|98ec93df77d6f672b4f682cbe315fedf0e2d4ee7\n2013|Integrating Programming by Example and Natural Language Programming|10.1609/aaai.v27i1.8695|40|2|Mehdi Manshadi and D. Gildea and James F. Allen|8ad378c449db1ac08e8b98238e5387b62c549020\n2006|Feasibility Studies for Programming in Natural Language|10.1007/1-4020-5386-X_20|39|1|H. Lieberman and Hugo Liu|4d52e4f8037d797b7f9829bfa1854141790c1d7e\n2020|Incorporating External Knowledge through Pre-training for Natural Language to Code Generation|10.18653/v1/2020.acl-main.538|39|8|Frank F. Xu and Zhengbao Jiang and Pengcheng Yin and Bogdan Vasilescu and Graham Neubig|77910e51a40d17157fc798325d06edfa6cff18d6\n1987|A natural language discourse model to explain linear programming models and solutions|10.1016/0167-9236(87)90104-7|38|0|H. J. Greenberg|92efbbcae9c8dfdef0b4be22010ea126f3b3f0c4\n2020|Relating Natural Language Aptitude to Individual Differences in Learning Programming Languages|10.1038/s41598-020-60661-8|34|2|C. Prat and T. Madhyastha and Malayka Mottarella and Chu-Hsuan Kuo|ea11192b7f351071f1efaf6ce37f47bc9af6dfb4\n2013|Natural language processing future|10.1109/ICOISS.2013.6678407|33|1|M. Surabhi|b1d2acf0702837ef20d9112847e2dffd46a25016\n2016|TextFlows: A visual programming platform for text mining and natural language processing|10.1016/J.SCICO.2016.01.001|33|1|Matic Perovsek and Janez Kranjc and T. Erjavec and B. Cestnik and N. Lavrac|10d51dee0d10d2df77e2f9bd5e7d7f53d87a4a20\n1988|Natural language understanding and logic programming|10.1609/AIMAG.V9I1.666|32|0|V. Dahl and P. Saint-Dizier|c89e246e96794c54d0f7c4197b1bce74ae75917f\n2017|Natural Language is a Programming Language: Applying Natural Language Processing to Software Development|10.4230/LIPIcs.SNAPL.2017.4|32|0|Michael D. Ernst|c27009a331655c1bab4d2940590dc8b73a63da2b\n1983|Natural Language Programming|10.1007/978-94-009-7019-9_10|27|0|A. Biermann|2a8d64de11d82392bf00bf930e963ce22309f12d\n2006|Realization of natural language interfaces using lazy functional programming|10.1145/1177352.1177353|27|1|R. Frost|ba6a60dd068232806d5e4e81d384be26a9f1fa7b\n2017|Programming language, natural language? Supporting the diverse computational activities of novice programmers|10.1016/j.jvlc.2016.10.008|26|0|J. Good and K. Howland|5edc09db8d6cd6fa34695819fda9e3d89ccf3c3c\n2013|Natural Language Programming of Complex Robotic BDI Agents|10.1007/s10846-012-9779-1|25|1|N. Lincoln and S. Veres|788194746adae3bc2465ec5b1596f63f4fece1e9\n2014|Describing constraint-based assembly tasks in unstructured natural language|10.3182/20140824-6-ZA-1003.02062|21|1|Maj Stenmark and J. Malec|fb1e1fed2927b27c847046a4cb39a454255a0494\n2013|Lips: An IDE for model driven engineering based on natural language processing|10.1109/NATURALISE.2013.6611718|19|1|Oliver Keszocze and M. Soeken and E. Kuksa and R. Drechsler|d6347fb418ed0fa23fcaeb48779b945639ad39c0\n2015|Poster: ProNat: An Agent-Based System Design for Programming in Spoken Natural Language|10.1109/ICSE.2015.264|19|2|Sebastian Weigelt and W. Tichy|63d9c99c47ab7d011dfb21923f0c9b22ed5fb61c\n2018|Studying the difference between natural and programming language corpora|10.1007/s10664-018-9669-7|18|1|Casey Casalnuovo and Kenji Sagae and Premkumar T. Devanbu|ef5561ae5da38ef899333e0444276f5d97923372\n1998|Natural Programming: Project Overview and Proposal|10.21236/ada339056|17|0|B. Myers|64920e9e4a66937411227151e3517d40c222cf57\n1985|Natural Language Understanding and Logic Programming|10.1016/0167-739x(85)90020-2|16|0|Kepa Mirena Sarasola Gabiola and Ana M. García-Serrano|503817d0b66bf379465c3cdccbcffc524a4fe4f5\n2013|The jobs puzzle: Taking on the challenge via controlled natural language processing|10.1017/S1471068413000306|14|4|Rolf Schwitter|42760f18c162748832b484988be99d849f911110\n2013|Can natural language be utilized in the learning of programming fundamentals?|10.1109/FIE.2013.6685157|11|0|O. Oliveira and Ana María Monteiro and N. T. Roman|0e1574072fe000c359fb304aec5c23f8912ff3bf\n2019|Genetic programming for natural language processing|10.1007/s10710-019-09361-5|8|1|Lourdes Araujo|9d4b4c4c83f962c95a734b2e11b56fbec1feff61" }, "navier-stokes-equation": { "title": "Navier-Stokes Equation", "appeared": 1821, "type": "equation", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Navier–Stokes_equations" } }, "nawk": { "title": "New AWK", "appeared": 1993, "type": "pl", "description": "Brian Kernighan's nawk (New AWK) source was first released in 1993 unpublicized, and publicly since the late 1990s; many BSD systems use it to avoid the GPL license.", "website": "https://linux.die.net/man/1/nawk", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2272", "fileType": "text", "centralPackageRepositoryCount": 0 }, "ncar-command-language": { "title": "NCAR Command Language", "appeared": 1990, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University Corporation for Atmospheric Research" ], "wikipedia": { "summary": "The US National Center for Atmospheric Research (NCAR ) is a US federally funded research and development center (FFRDC) managed by the nonprofit University Corporation for Atmospheric Research (UCAR) and funded by the National Science Foundation (NSF). NCAR has multiple facilities, including the I. M. Pei-designed Mesa Laboratory headquarters in Boulder, Colorado. Studies include meteorology, climate science, atmospheric chemistry, solar-terrestrial interactions, environmental and societal impacts.", "created": 2016, "backlinksCount": 330, "pageId": 4014614, "revisionCount": 10, "dailyPageViews": 4, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/NCAR_Command_Language" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ncl": { "title": "NCAR Command Language", "appeared": 1994, "type": "pl", "description": "(The NCAR Command Language (NCL), a product of the Computational & Information Systems Laboratory at the National Center for Atmospheric Research (NCAR) and sponsored by the National Science Foundation, is a free interpreted language designed specifically for scientific data processing and visualization.", "website": "https://www.ncl.ucar.edu/index.shtml", "standsFor": "NCAR Command Language", "country": [ "United States" ], "originCommunity": [ "University Corporation for Atmospheric Research" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ ";-----------------------------------------------------------------\n; NCL User Guide Example: NUG_bar_chart.ncl\n;\n; KMF 30.10.14\n;-----------------------------------------------------------------\n; These load commands are not required in NCL versions 6.2.0 and later.\nload \"$NCARG_ROOT/lib/ncarg/nclscripts/csm/gsn_code.ncl\"\nload \"$NCARG_ROOT/lib/ncarg/nclscripts/csm/gsn_csm.ncl\"\n\nbegin\n\n low = 0.0\n high = 1.0\n\n n = 12\n\n x = fspan(1.0, 12.0, n)\n y = random_uniform(low, high, n)\n\n wks = gsn_open_wks(\"png\",\"NUG_bar_chart\")\n\n res = True\n res@gsnXYBarChart = True\n res@gsnXYBarChartBarWidth = 0.3\n res@gsnXYBarChartColors = \"blue\"\n\n res@trXMinF = 0.0 ;-- x-axis min value\n res@trXMaxF = 13.0 ;-- x-axis max value\n res@trYMinF = 0.0 ;-- y-axis min value\n res@trYMaxF = 1.0 ;-- y-axis max value\n\n res@tmXBMode = \"Explicit\" ;-- explicit labels\n res@tmXBValues = ispan(1,12,1)\n res@tmXBLabels = (/\"Jan\",\"Feb\",\"Mar\",\"Apr\",\"May\",\"Jun\",\"Jul\",\"Aug\",\"Sep\", \\\n \"Oct\",\"Nov\",\"Dec\"/)\n res@tmXBLabelFontHeightF = 0.015\n\n res@tiMainString = \"NCL Doc Example: bar chart\"\n\n plot = gsn_csm_xy(wks, x, y, res)\n\nend" ], "githubRepo": { "firstCommit": 1990, "stars": 208, "forks": 54, "subscribers": 34, "created": 2016, "updated": 2022, "issues": 106, "description": "The NCAR Command Language (NCL) is a scripting language for the analysis and visualization of climate and weather data.", "url": "https://github.com/NCAR/ncl" }, "repoStats": { "firstCommit": 1990, "commits": 14345, "committers": 50, "files": 9271 }, "githubLanguage": { "fileExtensions": [ "ncl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.ncl", "repos": 654, "id": "NCL" }, "githubBigQuery": { "repos": 64, "users": 61, "id": "NCL" }, "pygmentsHighlighter": { "filename": "ncl.py", "fileExtensions": [ "ncl" ], "id": "NCL" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2015, "committerCount": 2, "commitCount": 9, "sampleCount": 16, "example": [ "val=102\na=val/4.\nprint(a)" ], "url": "https://github.com/rpavlick/language-ncl.git" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ndl": { "title": "NDL", "appeared": 2007, "type": "pl", "reference": [ "https://digitalcommons.ohsu.edu/cgi/viewcontent.cgi?article=2851&context=etd" ], "country": [ "United States" ], "originCommunity": [ "Oregon Health & Science University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2274", "centralPackageRepositoryCount": 0 }, "nearley": { "title": "Nearley", "appeared": 2014, "type": "grammarLanguage", "website": "https://nearley.js.org/", "documentation": [ "https://nearley.js.org/docs/how-to-grammar-good" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/kach/nearley/issues" ], "domainName": { "awisRank": { "2017": 3556499, "2022": 3704646 }, "name": "nearley.js.org" }, "writtenIn": [ "javascript" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "booleanTokens": [ [ "true", "false" ] ], "githubRepo": { "stars": 3231, "forks": 222, "subscribers": 44, "created": 2014, "updated": 2022, "firstCommit": 2014, "description": "📜🔜🌲 Simple, fast, powerful parser toolkit for JavaScript.", "issues": 176, "url": "https://github.com/Hardmath123/nearley" }, "repoStats": { "firstCommit": 2014, "commits": 1092, "committers": 65, "files": 134 }, "githubLanguage": { "fileExtensions": [ "ne", "nearley" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.ne", "repos": 53, "id": "Nearley" }, "githubBigQuery": { "repos": 33, "users": 32, "id": "Nearley" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2017, "committerCount": 2, "commitCount": 4, "sampleCount": 1, "example": [ "# nearley grammar\n@builtin \"string.ne\"\n\n@{%\n\nfunction insensitive(sl) {\n var s = sl.literal;\n result = [];\n for (var i=0; i whit? prog whit? {% function(d) { return d[1]; } %}\n\nprog -> prod {% function(d) { return [d[0]]; } %}\n | prod whit prog {% function(d) { return [d[0]].concat(d[2]); } %}\n\nprod -> word whit? (\"-\"|\"=\"):+ \">\" whit? expression+ {% function(d) { return {name: d[0], rules: d[5]}; } %}\n | word \"[\" wordlist \"]\" whit? (\"-\"|\"=\"):+ \">\" whit? expression+ {% function(d) {return {macro: d[0], args: d[2], exprs: d[8]}} %}\n | \"@\" whit? js {% function(d) { return {body: d[2]}; } %}\n | \"@\" word whit word {% function(d) { return {config: d[1], value: d[3]}; } %}\n | \"@include\" whit? string {% function(d) {return {include: d[2].literal, builtin: false}} %}\n | \"@builtin\" whit? string {% function(d) {return {include: d[2].literal, builtin: true }} %}\n\nexpression+ -> completeexpression\n | expression+ whit? \"|\" whit? completeexpression {% function(d) { return d[0].concat([d[4]]); } %}\n\nexpressionlist -> completeexpression\n | expressionlist whit? \",\" whit? completeexpression {% function(d) { return d[0].concat([d[4]]); } %}\n\nwordlist -> word\n | wordlist whit? \",\" whit? word {% function(d) { return d[0].concat([d[4]]); } %}\n\ncompleteexpression -> expr {% function(d) { return {tokens: d[0]}; } %}\n | expr whit? js {% function(d) { return {tokens: d[0], postprocess: d[2]}; } %}\n\nexpr_member ->\n word {% id %}\n | \"$\" word {% function(d) {return {mixin: d[1]}} %}\n | word \"[\" expressionlist \"]\" {% function(d) {return {macrocall: d[0], args: d[2]}} %} \n | string \"i\":? {% function(d) { if (d[1]) {return insensitive(d[0]); } else {return d[0]; } } %}\n | \"%\" word {% function(d) {return {token: d[1]}} %}\n | charclass {% id %}\n | \"(\" whit? expression+ whit? \")\" {% function(d) {return {'subexpression': d[2]} ;} %}\n | expr_member whit? ebnf_modifier {% function(d) {return {'ebnf': d[0], 'modifier': d[2]}; } %}\n\nebnf_modifier -> \":+\" {% id %} | \":*\" {% id %} | \":?\" {% id %}\n\nexpr -> expr_member\n | expr whit expr_member {% function(d){ return d[0].concat([d[2]]); } %}\n\nword -> [\\w\\?\\+] {% function(d){ return d[0]; } %}\n | word [\\w\\?\\+] {% function(d){ return d[0]+d[1]; } %}\n\nstring -> dqstring {% function(d) {return { literal: d[0] }; } %}\n#string -> \"\\\"\" charset \"\\\"\" {% function(d) { return { literal: d[1].join(\"\") }; } %}\n#\n#charset -> null\n# | charset char {% function(d) { return d[0].concat([d[1]]); } %}\n#\n#char -> [^\\\\\"] {% function(d) { return d[0]; } %}\n# | \"\\\\\" . {% function(d) { return JSON.parse(\"\\\"\"+\"\\\\\"+d[1]+\"\\\"\"); } %}\n\ncharclass -> \".\" {% function(d) { return new RegExp(\".\"); } %}\n | \"[\" charclassmembers \"]\" {% function(d) { return new RegExp(\"[\" + d[1].join('') + \"]\"); } %}\n\ncharclassmembers -> null\n | charclassmembers charclassmember {% function(d) { return d[0].concat([d[1]]); } %}\n\ncharclassmember -> [^\\\\\\]] {% function(d) { return d[0]; } %}\n | \"\\\\\" . {% function(d) { return d[0] + d[1]; } %}\n\njs -> \"{\" \"%\" jscode \"%\" \"}\" {% function(d) { return d[2]; } %}\n\njscode -> null {% function() {return \"\";} %}\n | jscode [^%] {% function(d) {return d[0] + d[1];} %}\n | jscode \"%\" [^}] {% function(d) {return d[0] + d[1] + d[2]; } %}\n\n# Whitespace with a comment\nwhit -> whitraw\n | whitraw? comment whit?\n\n# Optional whitespace with a comment\nwhit? -> null\n | whit\n\n# Literally a string of whitespace\nwhitraw -> [\\s]\n | whitraw [\\s]\n\n# A string of whitespace OR the empty string\nwhitraw? -> null\n | whitraw\n\ncomment -> \"#\" commentchars \"\\n\"\ncommentchars -> null\n | commentchars [^\\n]" ], "url": "https://github.com/Hardmath123/sublime-nearley" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "neater": { "title": "NEATER 2", "appeared": 1968, "type": "linter", "reference": [ "https://semanticscholar.org/paper/b438a87ff740647bc4471f8486337cec6db6b301" ], "country": [ "United States" ], "originCommunity": [ "Kansas State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8136", "centralPackageRepositoryCount": 0 }, "nebula": { "title": "NEBULA", "appeared": 1960, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Ferranti International plc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=150" }, "nectar": { "title": "nectar", "appeared": 2016, "type": "pl", "website": "http://nectar-lang.com", "reference": [ "https://doc.nectarjs.com/nectarjs/getting-started" ], "country": [ "Spain" ], "originCommunity": [ "https://github.com/NectarJS" ], "domainName": { "registered": 2016, "name": "nectar-lang.com" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n13948502|Compile JavaScript to WebAssembly (wasm) or Arduino firmware in your browser|http://nectar-lang.com/?hn|2017-03-24 12:45:37 UTC|1490359537|chrisdouay|0|6" }, "neeilang": { "title": "neeilang", "appeared": 2019, "type": "pl", "creators": [ "Neeilan Selvalingam" ], "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/erqm6s/neeilang_a_small_stronglytyped_language_oop/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/neeilan/neeilang/issues" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "fn main() : Int {\n var a : Int = 5;\n var b : Int = 3;\n\n print a + b; // 8\n print a - b; // 2\n print b - a; // -2\n\n if (a >= 5) {\n print \"a >= 5\"; // a >= 5\n }\n\n if (a > 5) {\n print \"a > 5\"; // Not executed\n }\n\n if (a < 5) {\n print \"a < 5\"; // Not executed\n }\n\n if (5 <= a) {\n print \"5 <= a\"; // 5 <= a\n }\n" ], "githubRepo": { "firstCommit": 2019, "stars": 42, "subscribers": 3, "created": 2019, "updated": 2022, "description": "Fast, type-safe, object-oriented language by yours truly", "forks": 2, "issues": 0, "url": "https://github.com/neeilan/neeilang" }, "repoStats": { "firstCommit": 2019, "commits": 131, "committers": 2, "files": 144 } }, "neko": { "title": "Neko", "appeared": 2005, "type": "pl", "creators": [ "Nicolas Cannasse" ], "website": "https://nekovm.org/", "country": [ "Unknown" ], "originCommunity": [ "Haxe Foundation" ], "domainName": { "registered": 2005, "awisRank": { "2022": 8443224 }, "name": "nekovm.org" }, "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "printToken": [ [ "$print" ] ], "githubRepo": { "firstCommit": 2005, "stars": 510, "forks": 101, "subscribers": 37, "created": 2013, "updated": 2022, "description": "The Neko Virtual Machine", "issues": 53, "url": "https://github.com/HaxeFoundation/neko" }, "repoStats": { "firstCommit": 2005, "commits": 2522, "committers": 41, "files": 207 }, "wikipedia": { "example": [ "get_params = $loader.loadprim(\"mod_neko@get_params\",0);\n$print(\"PARAMS = \"+get_params());" ], "related": [ "c", "ocaml", "ia-32", "linux", "haxe", "jvm", "groovy" ], "summary": "Neko is a high-level dynamically typed programming language developed by Nicolas Cannasse as part of research and development (R&D) efforts at two indie video game firms in Bordeaux, France: first at Motion Twin and then at Shiro Games.", "pageId": 15110419, "created": 2008, "backlinksCount": 20, "revisionCount": 59, "dailyPageViews": 32, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Neko_(programming_language)" }, "leachim6": { "filepath": "n/Neko.neko", "fileExtensions": [ "neko" ], "example": [ "$print(\"Hello World\\n\");\n" ], "id": "Neko" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Neko", "rijuRepl": { "example": [ "$print(\"Hello, world!\\n\");\n" ], "id": "https://riju.codes/neko" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "neliac": { "title": "NELIAC", "appeared": 1958, "type": "pl", "description": "The Navy Electronics Laboratory International ALGOL Compiler or NELIAC is a dialect and compiler implementation of the ALGOL 58 programming language developed by the Naval Electronics Laboratory in 1958.", "standsFor": "Navy Electronics Laboratory International ALGOL Compiler", "country": [ "United States" ], "originCommunity": [ "U.S. Navy Electronics Laboratory" ], "wikipedia": { "related": [ "algol-58", "jovial" ], "summary": "The Navy Electronics Laboratory International ALGOL Compiler or NELIAC is a dialect and compiler implementation of the ALGOL 58 programming language developed by the Naval Electronics Laboratory in 1958. It was designed for numeric and logical computations and was the first language to provide a bootstrap implementation.", "pageId": 949068, "created": 2004, "backlinksCount": 18, "revisionCount": 41, "dailyPageViews": 5, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/NELIAC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=32", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "nelua": { "title": "Nelua", "appeared": 2019, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://github.com/edubart/nelua-lang/issues" ], "compilesTo": [ "c" ], "related": [ "lua" ], "rijuRepl": { "example": [ "print 'Hello, world!'\n" ], "description": "Systems programming language for performance sensitive applications", "fileExtensions": [ "nelua" ], "website": "https://nelua.io/", "gitRepo": "https://github.com/edubart/nelua-lang", "id": "https://riju.codes/nelua" } }, "nemerle": { "title": "Nemerle", "appeared": 2003, "type": "pl", "website": "http://nemerle.org", "fileExtensions": [ "n" ], "originCommunity": [ "JetBrains" ], "domainName": { "registered": 2003, "awisRank": { "2017": 10979387, "2022": 9445077 }, "name": "nemerle.org" }, "influencedBy": [ "csharp", "ml", "lisp" ], "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasMacros": { "example": "// http://nemerle.org/About\ndef title = \"Programming language authors\";\ndef authors = [\"Anders Hejlsberg\", \"Simon Peyton-Jones\"];\n \n// 'xml' - macro from Nemerle.Xml.Macro library which alows to inline XML literals into the nemerle-code\ndef html = xml <#\n \n \n $title\n \n \n
    \n
  • $author
    • \n
\n \n \n#>\nTrace.Assert(html.GetType().Equals(typeof(XElement)));\nWriteLine(html.GetType());", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasUnitsOfMeasure": { "example": "def m3 = 1 g;\ndef m4 = Si.Mass(m1);\n\nWriteLine($\"Mass in SI: $m4, in CGS: $m3\");\n\ndef x1 = Si.Area(1 cm * 10 m);\n\nWriteLine($\"Area of 1 cm * 10 m = $x1 m\");", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "System.Console.WriteLine" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "using System;\nusing System.Runtime.InteropServices;\n\nclass PlatformInvokeTest\n{\n [DllImport(\"msvcrt.dll\")]\n public extern static puts(c : string) : int;\n\n [DllImport(\"msvcrt.dll\")]\n internal extern static _flushall() : int;\n\n public static Main() : void\n {\n _ = puts(\"Test\");\n _ = _flushall();\n }\n}" ], "related": [ "csharp", "ml", "lisp", "java", "ocaml", "haskell", "sql" ], "summary": "Nemerle is a general-purpose high-level statically typed programming language designed for platforms using the Common Language Infrastructure (.NET/Mono). It offers functional, object-oriented (OO) and imperative features. It has a simple C#-like syntax and a powerful metaprogramming system. In June 2012, the core developers of Nemerle were hired by the Czech software development company JetBrains. The team is focusing on developing Nitra, a framework to implement extant and new programming languages. This framework will likely be used to create future versions of Nemerle. Nemerle is named after the Archmage Nemmerle, a character in the fantasy novel A Wizard of Earthsea by Ursula K. Le Guin.", "pageId": 30883042, "dailyPageViews": 37, "created": 2004, "backlinksCount": 121, "revisionCount": 247, "appeared": 2003, "fileExtensions": [ "n" ], "url": "https://en.wikipedia.org/wiki/Nemerle" }, "githubLanguage": { "fileExtensions": [ "n" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.nemerle", "repos": 177, "id": "Nemerle" }, "githubBigQuery": { "repos": 286, "users": 257, "id": "Nemerle" }, "pygmentsHighlighter": { "filename": "dotnet.py", "fileExtensions": [ "n" ], "id": "Nemerle" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2012, "committerCount": 3, "commitCount": 14, "sampleCount": 1, "example": [ "using System.Console;\n\nmodule Program\n{\n Main() : void\n {\n WriteLine(\"Hello world\");\n }\n}" ], "url": "https://github.com/textmate/nemerle.tmbundle" }, "projectEuler": { "memberCount": { "2019": 9, "2022": 10 }, "id": "Nemerle" }, "helloWorldCollection": [ "// Hello World in Nemerle (a functional programming language for .NET)\n\nSystem.Console.WriteLine(\"Hello World\");\n" ], "leachim6": { "filepath": "n/Nemerle.n", "fileExtensions": [ "n" ], "example": [ "class Hello\n{\n static Main () : void\n {\n System.Console.WriteLine (\"Hello World\");\n }\n}" ], "id": "Nemerle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nemerle", "tiobe": { "id": "Nemerle" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8336", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "neo4j": { "title": "Neo4j", "appeared": 2007, "type": "database", "description": "Graph database management system", "country": [ "Sweden" ], "originCommunity": [ "Neo4j, Inc." ] }, "neovim-editor": { "title": "neovim-editor", "appeared": 2015, "type": "editor", "website": "https://neovim.io/", "country": [ "Various" ], "originCommunity": [ "https://github.com/neovim" ], "domainName": { "registered": 2015, "awisRank": { "2022": 79632 }, "name": "neovim.io" }, "twitter": "https://twitter.com/neovim" }, "neralie-format": { "title": "neralie-format", "appeared": 2017, "type": "timeFormat", "description": "This decimal clock has two groups of 3 digits, called the beat & the pulse. A beat contains 1000 pulses, and equivalent to 86.4 seconds.", "website": "https://wiki.xxiivv.com/#neralie", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/XXIIVV" ], "domainName": { "name": "wiki.xxiivv.com" }, "example": [ "6:00 250:000 12:00 500:000\n16:00 750:000 Now 384:908" ] }, "nesc": { "title": "nesC", "appeared": 2002, "type": "pl", "standsFor": "network embedded systems C", "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley", "Harvard University" ], "githubRepo": { "firstCommit": 2002, "stars": 93, "forks": 58, "subscribers": 31, "created": 2012, "updated": 2022, "description": "Master nesc repository", "issues": 11, "url": "https://github.com/tinyos/nesc" }, "repoStats": { "firstCommit": 2002, "commits": 828, "committers": 26, "files": 2152 }, "wikipedia": { "related": [ "c" ], "summary": "nesC (pronounced \"NES-see\") is a component-based, event-driven programming language used to build applications for the TinyOS platform. TinyOS is an operating environment designed to run on embedded devices used in distributed wireless sensor networks. nesC is built as an extension to the C programming language with components \"wired\" together to run applications on TinyOS. The name nesC is an abbreviation of \"network embedded systems C\".", "pageId": 1000634, "created": 2004, "backlinksCount": 92, "revisionCount": 52, "dailyPageViews": 37, "url": "https://en.wikipedia.org/wiki/NesC" }, "githubLanguage": { "fileExtensions": [ "nc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.nesc", "repos": 1669, "id": "nesC" }, "githubBigQuery": { "repos": 468, "users": 416, "id": "nesC" }, "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "nc" ], "id": "nesC" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2016, "committerCount": 7, "commitCount": 24, "url": "https://github.com/cdwilson/nesC.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "nesl": { "title": "NESL", "appeared": 1993, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "haskell", "cilk" ], "summary": "NESL is a parallel programming language developed at Carnegie Mellon by the SCandAL project and released in 1993. It integrates various ideas from parallel algorithms, and functional programming and array programming languages. The most important new ideas behind NESL are Nested data parallelism: this feature offers the benefits of data parallelism, concise code that is easy to understand and debug, while being well suited for irregular algorithms, such as algorithms on trees, graphs or sparse matrices. A language based performance model: this gives a formal way to calculate the work and depth of a program. These measures can be related to running time on parallel machines.The main design guideline for NESL was to make parallel programming easy and portable. Algorithms are typically significantly more concise in NESL than in most other parallel programming languages, and the code closely resembles high-level pseudocode. NESL supports nested data parallelism by using the flattening transform to convert nested data parallelism to flat data parallelism. This works by storing nested vectors as the nested data and a segment descriptor of vector lengths, separately. This flattening transform, however, can increase the asymptotic work and space complexity of the original program, leading to a much less efficient result.", "pageId": 919571, "created": 2004, "backlinksCount": 13, "revisionCount": 21, "dailyPageViews": 10, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/NESL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:NESL", "hopl": "https://hopl.info/showlanguage.prx?exp=1740", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1996|A provable time and space efficient implementation of NESL|10.1145/232627.232650|148|16|G. Blelloch and John Greiner|ab3811f4e64078bdc95f0573b9cec256d400e9ea\n2007|Ct: channelling NeSL and SISAL in C++|10.1145/1362702.1362707|16|0|A. Ghuloum|3fef0481b898614b393a2e82babc84dc651807c1\n1997|Interactive Simulations on the Web: Compiling NESL into Java|10.1002/(SICI)1096-9128(199711)9:11%3C1075::AID-CPE345%3E3.0.CO;2-6|2|0|J. Hardwick and G. Narlikar and J. Sipelstein|928c8464fc94448a609af5f61bcaa49098394aff" }, "ness": { "title": "Ness", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/99431c53efe9414e83bd6bb3fdc49a41d0900974" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2727", "centralPackageRepositoryCount": 0 }, "nested-context-language": { "title": "Nested Context Language", "appeared": 2000, "type": "xmlFormat", "country": [ "Brazil" ], "originCommunity": [ "Sistema Brasileiro de Televisão Digital" ], "wikipedia": { "related": [ "xml", "synchronized-multimedia-integration-language" ], "summary": "In the field of digital and interactive television, Nested Context Language (NCL) is a declarative authoring language for hypermedia documents. NCL documents do not contain multimedia elements such as audio or video content; rather they function as a \"glue\" language that specifies how multimedia components are related. In particular, NCL documents specify how these components are synchronized relative to each other and how the components are composed together into a unified document. Among its main facilities, it treats hypermedia relations as first-class entities through the definition of hypermedia connectors, and it can specify arbitrary semantics for a hypermedia composition using the concept of composite templates. NCL is an XML application language that is an extension of XHTML, with XML elements and attributes specified by a modular approach. NCL modules can be added to standard web languages, such as XLink and SMIL. NCL was initially designed for the Web environment, but a major application of NCL is use as the declarative language of the Japanese-Brazilian ISDB-Tb (International Standard for Digital Broadcasting) terrestrial DTV digital television middleware (named Ginga). It is also the first standardized technology of the ITU-T multimedia application framework series of specifications for IPTV (internet protocol television) services. In both cases it is used to develop interactive applications to digital television.", "pageId": 2990227, "created": 2005, "backlinksCount": 21, "revisionCount": 66, "dailyPageViews": 5, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Nested_Context_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "nestedtext": { "title": "NestedText", "appeared": 2020, "type": "dataNotation", "creators": [ "Ken Kundert" ], "website": "https://nestedtext.org", "country": [ "United States" ], "originCommunity": [ "https://nurdletech.com" ], "domainName": { "name": "nestedtext.org" }, "related": [ "yaml" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# Contact information for our officers\n\nKatheryn McDaniel:\n position: president\n address:\n > 138 Almond Street\n > Topeka, Kansas 20697\n phone:\n cell: 1-210-555-5297\n home: 1-210-555-8470\n # Katheryn prefers that we always call her on her cell phone.\n email: KateMcD@aol.com\n additional roles:\n - board member\n\nMargaret Hodge:\n position: vice president\n address:\n > 2586 Marigold Lane\n > Topeka, Kansas 20682\n phone: 1-470-555-0398\n email: margaret.hodge@ku.edu\n additional roles:\n - new membership task force\n - accounting task force" ], "githubRepo": { "firstCommit": 2020, "stars": 270, "forks": 11, "subscribers": 9, "created": 2020, "updated": 2022, "description": "Human Readable and Writable Data Interchange Format", "issues": 3, "url": "https://github.com/KenKundert/nestedtext" }, "repoStats": { "firstCommit": 2020, "commits": 448, "committers": 7, "files": 89 }, "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "nt" ], "id": "NestedText" } }, "net-format": { "title": "net-format", "appeared": 2006, "type": "textDataFormat", "description": "The net file format is used to describe the axtNet data that underlie the net alignment annotations in the Genome Browser. In 2016 it was revised so that line indentation level represents the parent/child relationship between records and is a necessary part of the net file format. Child records are indented one space from the parent, as shown in the example net file below.", "reference": [ "https://genome.ucsc.edu/goldenPath/help/net.html" ], "country": [ "United States" ], "originCommunity": [ "University of California, Santa Cruz" ], "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "net chr2L 23011544\n fill 6004 3278 chrXR_group3a - 1396397 2164 id 25606 score 23114 ali 782 qDup 576 type top tN 0 qN 0 tR 36 qR 0 tTrf 0 qTrf 0\n gap 6065 2 chrXR_group3a - 1398498 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 6096 1485 chrXR_group3a - 1397572 897 tN 0 qN 0 tR 36 qR 0 tTrf 0 qTrf 0\n fill 6096 513 chrU - 5570675 533 id 48675 score 4435 ali 465 qDup 533 type nonSyn tN 0 qN 0 tR 0 qR 13 tTrf 0 qTrf 0\n gap 6116 8 chrU - 5571188 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 6156 5 chrU - 5571156 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 6184 3 chrU - 5571133 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 6212 18 chrU - 5571106 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 6244 9 chrU - 5571092 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 6340 2 chrU - 5570996 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 6515 3 chrU - 5570771 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 7623 1 chrXR_group3a - 1397530 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 7664 1007 chrXR_group3a - 1397008 482 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n fill 7664 382 chrXL_group1e - 8262003 506 id 25608 score 10609 ali 364 qDup 506 type nonSyn tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 7784 4 chrXL_group1e - 8262361 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 7792 3 chrXL_group1e - 8262357 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 7921 2 chrXL_group1e - 8262126 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 7949 9 chrXL_group1e - 8262092 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 8693 1 chrXR_group3a - 1396985 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n fill 9833 1251 chrU - 5562980 1239 id 48675 score 10720 ali 1124 qDup 1094 type top tN 0 qN 0 tR 22 qR 88 tTrf 0 qTrf 0\n gap 9966 7 chrU - 5564075 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 10015 3 chrU - 5564030 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 10088 2 chrU - 5563957 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0\n gap 10101 8 chrU - 5563946 0 tN 0 qN 0 tR 0 qR 0 tTrf 0 qTrf 0" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "netbasic": { "title": "NetBasic", "appeared": 1999, "type": "pl", "reference": [ "https://support.novell.com/techcenter/articles/dnd19961103.html" ], "country": [ "United States" ], "originCommunity": [ "Novell, Inc." ], "hopl": "https://hopl.info/showlanguage.prx?exp=3402", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "netbeans-editor": { "title": "netbeans-editor", "appeared": 2013, "type": "editor", "demoVideo": [ "https://www.youtube.com/user/NetBeansVideos" ], "creators": [ "pgebauer" ], "website": "https://netbeans.apache.org", "country": [ "United States" ], "originCommunity": [ "The Apache Software Foundation" ], "githubRepo": { "firstCommit": 2017, "stars": 2111, "forks": 732, "subscribers": 153, "created": 2017, "updated": 2022, "description": "Apache NetBeans", "issues": 530, "url": "https://github.com/apache/netbeans" }, "isOpenSource": true }, "netform": { "title": "Netform", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/283ca3cc628e88bdfdc4f405c957df1519ef2c92" ], "country": [ "The Netherlands" ], "originCommunity": [ "Twente University of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8444", "centralPackageRepositoryCount": 0 }, "netlib": { "title": "Netlib", "appeared": 1985, "type": "library", "website": "http://netlib.org/", "country": [ "United States" ], "originCommunity": [ "AT&T, Bell Laboratories", "The University of Tennessee", "Oak Ridge National Laboratory" ], "domainName": { "registered": 1994, "awisRank": { "2022": 321538 }, "name": "netlib.org" }, "wikipedia": { "dailyPageViews": 19, "url": "https://en.wikipedia.org/wiki/Netlib" }, "centralPackageRepositoryCount": 0 }, "netlinx": { "title": "NetLinx", "appeared": 2007, "type": "pl", "reference": [ "https://www.amx.com/en/site_elements/language-reference-guide-netlinx-programming-language" ], "fileExtensions": [ "axserb", "axierb" ], "country": [ "United States" ], "originCommunity": [ "AMX, LLC" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "(*", "*)" ] ], "wikipedia": { "related": [ "c", "ascii" ], "summary": "NetLinx is both a range of controllers manufactured by AMX and the name of the proprietary programming language (loosely based on C) used to program the devices. The NetLinx controllers are rack mountable devices which run a version of VxWorks and integrate both a processor and device controllers and are typically utilized for audio-visual control systems. An example is the mid-range NetLinx Integrated NI-2100 controller which has 3 RS-232/RS-485 serial ports, 4 relays, 4 infrared/serial ports and 4 input/outputs. Serial ports can send and receive strings, typically ASCII instructions and replies. Relays permit switching of modest currents. IR ports can send infrared signals which emulate typical remote control devices that control (for instance) televisions and video recorders. Input/output ports detect contact closures. AMX supplies an IDE known as NetLinx Studio which allows a proprietary language to be edited, compiled and sent to the NetLinx controller. NetLinx also contains an interface which allows it to utilize Java based modules. Earlier models of AMX controller were named Axcent.", "created": 2007, "backlinksCount": 2, "pageId": 9870556, "revisionCount": 20, "dailyPageViews": 14, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/NetLinx" }, "githubLanguage": { "fileExtensions": [ "axs", "axi" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.netlinx", "repos": 122, "id": "NetLinx" }, "githubBigQuery": { "repos": 25, "users": 21, "id": "NetLinx" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 2, "commitCount": 115, "sampleCount": 2, "example": [ "(***********************************************************\n Mock Projector\n \n For testing syntax highlighting\n************************************************************)\n\n#if_not_defined MOCK_PROJECTOR\n#define MOCK_PROJECTOR 1\n(***********************************************************)\n(* System Type : NetLinx *)\n(***********************************************************)\n(* DEVICE NUMBER DEFINITIONS GO BELOW *)\n(***********************************************************)\nDEFINE_DEVICE\n\ndvPROJECTOR = 5001:1:0;\n\n(***********************************************************)\n(* CONSTANT DEFINITIONS GO BELOW *)\n(***********************************************************)\nDEFINE_CONSTANT\n\n// Power States\nPOWER_STATE_ON = 0;\nPOWER_STATE_OFF = 1;\nPOWER_STATE_WARMING = 2;\nPOWER_STATE_COOLING = 3;\n\n// Inputs\nINPUT_HDMI = 0;\nINPUT_VGA = 1;\nINPUT_COMPOSITE = 2;\nINPUT_SVIDEO = 3;\n\n(***********************************************************)\n(* INCLUDES GO BELOW *)\n(***********************************************************)\n\n#include 'amx-lib-log'\n\n(***********************************************************)\n(* DATA TYPE DEFINITIONS GO BELOW *)\n(***********************************************************)\nDEFINE_TYPE\n\nstruct projector_t\n{\n integer power_state;\n integer input;\n integer lamp_hours;\n}\n\n(***********************************************************)\n(* VARIABLE DEFINITIONS GO BELOW *)\n(***********************************************************)\nDEFINE_VARIABLE\n\nvolatile projector_t proj_1;\n\n(***********************************************************)\n(* SUBROUTINE/FUNCTION DEFINITIONS GO BELOW *)\n(***********************************************************)\n\ndefine_function initialize(projector_t self)\n{\n self.power_state = POWER_STATE_OFF;\n self.input = INPUT_HDMI;\n self.lamp_hours = 0;\n}\n\ndefine_function switch_input(projector_t self, integer input)\n{\n self.input = input;\n print(LOG_LEVEL_INFO, \"'Projector set to input: ', itoa(input)\");\n}\n\n(***********************************************************)\n(* STARTUP CODE GOES BELOW *)\n(***********************************************************)\nDEFINE_START\n\ninitialize(proj_1);\n\n(***********************************************************)\n(* THE EVENTS GO BELOW *)\n(***********************************************************)\nDEFINE_EVENT\n\ndata_event[dvPROJECTOR]\n{\n string:\n {\n parse_message(data.text);\n }\n \n command: {}\n online: {}\n offline: {}\n}\n\nbutton_event[dvTP, BTN_HDMI]\nbutton_event[dvTP, BTN_VGA]\nbutton_event[dvTP, BTN_COMPOSITE]\nbutton_event[dvTP, BTN_SVIDEO]\n{\n push:\n {\n switch (button.input.channel)\n {\n case BTN_HDMI: switch_input(proj_1, INPUT_HDMI);\n case BTN_VGA: switch_input(proj_1, INPUT_VGA);\n case BTN_COMPOSITE: switch_input(proj_1, INPUT_COMPOSITE);\n case BTN_SVIDEO: switch_input(proj_1, INPUT_SVIDEO);\n }\n }\n \n release: {}\n}\n\n(***********************************************************)\n(* THE MAINLINE GOES BELOW *)\n(***********************************************************)\nDEFINE_PROGRAM\n\n[dvTP, BTN_POWER_ON] = (proj_1.power_state == POWER_STATE_ON);\n[dvTP, BTN_POWER_OFF] = (proj_1.power_state == POWER_STATE_OFF);\n\n(***********************************************************)\n(* END OF PROGRAM *)\n(* DO NOT PUT ANY CODE BELOW THIS COMMENT *)\n(***********************************************************)\n#end_if\n" ], "url": "https://github.com/amclain/sublime-netlinx" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "netlogo": { "title": "NetLogo", "appeared": 1999, "type": "pl", "creators": [ "Uri Wilensky" ], "website": "http://ccl.northwestern.edu/netlogo/", "country": [ "United States" ], "originCommunity": [ "Northwestern University" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "booleanTokens": [ [ "true", "false" ] ], "githubRepo": { "firstCommit": 2011, "stars": 890, "forks": 227, "subscribers": 84, "created": 2011, "updated": 2022, "description": "turtles, patches, and links for kids, teachers, and scientists", "issues": 433, "url": "https://github.com/NetLogo/NetLogo" }, "repoStats": { "firstCommit": 2011, "commits": 7354, "committers": 74, "files": 3053 }, "wikipedia": { "related": [ "starlogo", "logo", "isbn", "scala", "java" ], "summary": "NetLogo is an agent-based programming language and integrated modeling environment.", "pageId": 593757, "dailyPageViews": 80, "created": 2004, "backlinksCount": 67, "revisionCount": 255, "appeared": 1999, "fileExtensions": [ "nlogo", "nlogo3d", "nls" ], "url": "https://en.wikipedia.org/wiki/NetLogo" }, "githubLanguage": { "fileExtensions": [ "nlogo" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "lisp", "codemirrorMode": "commonlisp", "codemirrorMimeType": "text/x-common-lisp", "tmScope": "source.lisp", "repos": 3859, "id": "NetLogo" }, "githubBigQuery": { "repos": 154, "users": 138, "id": "NetLogo" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 6, "commitCount": 40, "sampleCount": 1, "example": [ "patches-own [\n living? ;; indicates if the cell is living\n live-neighbors ;; counts how many neighboring cells are alive\n]\n\nto setup-blank\n clear-all\n ask patches [ cell-death ]\n reset-ticks\nend\n\nto setup-random\n clear-all\n ask patches\n [ ifelse random-float 100.0 < initial-density\n [ cell-birth ]\n [ cell-death ] ]\n reset-ticks\nend\n\nto cell-birth\n set living? true\n set pcolor fgcolor\nend\n\nto cell-death\n set living? false\n set pcolor bgcolor\nend\n\nto go\n ask patches\n [ set live-neighbors count neighbors with [living?] ]\n ;; Starting a new \"ask patches\" here ensures that all the patches\n ;; finish executing the first ask before any of them start executing\n ;; the second ask. This keeps all the patches in synch with each other,\n ;; so the births and deaths at each generation all happen in lockstep.\n ask patches\n [ ifelse live-neighbors = 3\n [ cell-birth ]\n [ if live-neighbors != 2\n [ cell-death ] ] ]\n tick\nend\n\nto draw-cells\n let erasing? [living?] of patch mouse-xcor mouse-ycor\n while [mouse-down?]\n [ ask patch mouse-xcor mouse-ycor\n [ ifelse erasing?\n [ cell-death ]\n [ cell-birth ] ]\n display ]\nend\n\n" ], "url": "https://github.com/textmate/lisp.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:NetLogo", "hopl": "https://hopl.info/showlanguage.prx?exp=7674", "twitter": "https://twitter.com/netlogo", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|The MIT Press|An Introduction to Agent-Based Modeling: Modeling Natural, Social, and Engineered Complex Systems with NetLogo (The MIT Press)|Wilensky, Uri and Rand, William|9780262731898\n2015|ISTE Press - Elsevier|Agent-Based Spatial Simulation with NetLogo Volume 1|Banos, Arnaud and Lang, Christophe and Marilleau, Nicolas|9781785480553\n2013|Bentham Science Publishers|Agent-based Computational Economics using NetLogo|Damaceanu, Romulus-Catalin|9781608054893\n2018|Bentham Science Publishers|Agent-based Computational Economics using NetLogo|Damaceanu, Romulus Catalin|9781608056385", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Improving Execution Speed of Models Implemented in NetLogo|10.18564/JASSS.3282|31|1|S. Railsback and D. Ayllón and U. Berger and V. Grimm and S. Lytinen and C. Sheppard and Jan C. Thiele|f1ab7b2481d60041c4aceae24841a2cee7a8e3ed\n2018|PyNetLogo: Linking NetLogo with Python|10.18564/jasss.3668|29|2|M. Jaxa-Rozen and J. Kwakkel|052a2b1231dcc08071a2a9a96ed8e7b4177e1a30\n2015|Fuzzy Logic for Social Simulation Using NetLogo|10.18564/jasss.2885|25|0|L. Izquierdo and D. Olaru and S. Izquierdo and S. Purchase and G. Soutar|5bb0537eb0502408528c9cbbafb22c70ab9dd684\n2015|Extracting OWL Ontologies from Agent-Based Models: A Netlogo Extension|10.18564/jasss.2810|13|2|J. Gareth Polhill|80230019782bf7408c482bc57efd66630024fdae\n2012|NetLogo — An alternative way of simulating mobile ad hoc networks|10.1109/WMNC.2012.6416163|9|0|Miroslav Babis and P. Magula|1037a275f7ed01bd6050cb439982194c3b0ef6de\n2015|An agent-based simulation of a release process for encapsulated flavour using the NetLogo platform|10.1002/FFJ.3234|7|0|M. Zandi and M. Mohebbi|922a7bdd88741781baf8d8504392e22c6d806c4d\n2020|LevelSpace: A NetLogo Extension for Multi-Level Agent-Based Modeling|10.18564/jasss.4130|6|0|A. Hjorth and Bryan Head and C. Brady and U. Wilensky|a44458e7303525a64f1ed72eb6f24d66bef7b328\n2012|An Introduction to the NetLogo Modeling Environment|10.1007/978-1-4614-1257-1_3|3|0|D. Stigberg|ad2c584049fe38277ccd1aa3f2fbaaa6444c26b6\n2015|Мультиагентное моделирование в среде NetLogo|10.12731/2306-1561-2015-1-2|1|0|Konstantin Nikolaevich Mezencev|785b7e13308b0b9e23f5a8fc79436c8daa0ddb2f\n2016|HLogo: A Haskell STM-Based Parallel Variant of NetLogo|10.1007/978-3-319-69832-8_7|1|0|Nikolaos Bezirgiannis and I. Prasetya and I. Sakellariou|12db86f6a9cbc5175baf0b7e53424a8f5382b919" }, "netrexx": { "title": "NetRexx", "appeared": 1996, "type": "pl", "creators": [ "Mike Cowlishaw" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "say" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "related": [ "pl-i", "rexx", "object-rexx", "java", "jvm" ], "summary": "NetRexx is an open source, originally IBM's, variant of the REXX programming language to run on the Java virtual machine. It supports a classic REXX syntax, with no reserved keywords, along with considerable additions to support object-oriented programming in a manner compatible with Java's object model, yet can be used as both a compiled and an interpreted language, with an option of using only data types native to the JVM or the NetRexx runtime package. The latter offers the standard Rexx data type that combines string processing with unlimited precision decimal arithmetic. Integration with the JVM platform is tight, and all existing Java class libraries can be used unchanged and without special setup; at the same time, a Java programmer can opt to just use the Rexx class from the runtime package for improved string handling in Java syntax source programs.NetRexx is free to download from the Rexx Language Association. IBM announced the transfer of NetRexx 3.00 source code to the Rexx Language Association (RexxLA) on June 8, 2011.", "pageId": 11690683, "created": 2007, "backlinksCount": 19, "revisionCount": 133, "dailyPageViews": 9, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/NetRexx" }, "leachim6": { "filepath": "n/NetRexx.nrx", "fileExtensions": [ "nrx" ], "example": [ "say 'Hello World'\n" ], "id": "NetRexx" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:NetRexx", "hopl": "https://hopl.info/showlanguage.prx?exp=2277", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Netrexx Language|1997|M. F. Cowlishaw|7283371|5.00|1|0", "isbndb": "" }, "netscript": { "title": "Netscript", "appeared": 2016, "type": "pl", "description": "A programming language for packet-stream processing", "reference": [ "http://dl.acm.org/citation.cfm?id=959590" ], "country": [ "United States" ], "originCommunity": [ "Columbia University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8607", "centralPackageRepositoryCount": 0 }, "network-control-language": { "title": "Network Control Language", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/000142664971e1b4202198b04bcf96f3ba3d103c" ], "country": [ "United States" ], "originCommunity": [ "Computer Systems Engineers Ltd" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7056", "centralPackageRepositoryCount": 0 }, "neuronc": { "title": "NeuronC", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/03e092833db6d8a046b23a658fbfeac6ab2d0858" ], "country": [ "United States" ], "originCommunity": [ "University of Pennsylvania" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6715", "centralPackageRepositoryCount": 0 }, "neut": { "title": "neut", "appeared": 2018, "type": "pl", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/gprche/neut_a_dependentlytyped_programming_language_with/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/vekatze/neut/issues" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "; download the core library\n(ensure core/0.1.0.0\n \"https://github.com/u2zv1wx/neut-core/raw/master/release/0.1.0.0.tar.gz\")\n\n(include \"core/0.1.0.0/core.neut\")\n\n(with identity.bind\n (let str \"a\")\n (let _ (string.print str))\n (let _ (string.print str))\n (string.print str))" ], "githubRepo": { "firstCommit": 2018, "stars": 797, "forks": 6, "subscribers": 27, "created": 2020, "updated": 2022, "description": "A dependently-typed programming language with compile-time malloc/free determination", "issues": 3, "url": "https://github.com/u2zv1wx/neut" }, "repoStats": { "firstCommit": 2018, "commits": 8243, "committers": 5, "files": 363 } }, "neutron": { "title": "neutron", "appeared": 2019, "type": "pl", "website": "https://the-neutron-foundation.github.io", "reference": [ "https://neutron-lang.readthedocs.io/en/latest/" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/the-neutron-foundation" ], "domainName": { "name": "the-neutron-foundation.github.io" }, "githubRepo": { "firstCommit": 2019, "stars": 31, "created": 2019, "updated": 2022, "description": "A simple, extensible and efficient programming language based on C and Python", "issues": 2, "forks": 0, "subscribers": 2, "url": "https://github.com/the-neutron-foundation/neutron" }, "repoStats": { "firstCommit": 2019, "commits": 174, "committers": 6, "files": 65 } }, "never": { "title": "never", "appeared": 2018, "type": "pl", "website": "https://never-lang.readthedocs.io", "country": [ "Spain" ], "originCommunity": [ "https://github.com/never-lang" ], "domainName": { "name": "never-lang.readthedocs.io" }, "example": [ "func main() -> float\n{\n 100.0 * 1.8 + 32.0\n}" ], "githubRepo": { "firstCommit": 2018, "stars": 315, "subscribers": 15, "created": 2018, "updated": 2022, "description": "Never: statically typed, embeddable functional programming language.", "forks": 7, "issues": 0, "url": "https://github.com/never-lang/never" }, "repoStats": { "firstCommit": 2018, "commits": 596, "committers": 6, "files": 696 }, "isbndb": "year|publisher|title|authors|isbn13\n2005|Sams Publishing|Java After Hours: 10 Projects You'll Never Do at Work|Holzner, Steven|9780672327476" }, "newclay": { "title": "newclay", "appeared": 2011, "type": "pl", "creators": [ "Joe Groff" ], "description": "Newclay is an experimental offshoot of the Clay programming language. The Newclay compiler requires Clay to compile.", "country": [ "United States" ], "originCommunity": [ "https://github.com/jckarter/newclay/issues" ], "githubRepo": { "firstCommit": 2011, "stars": 4, "forks": 1, "subscribers": 2, "created": 2011, "updated": 2016, "description": "Newclay programming language", "issues": 0, "url": "https://github.com/jckarter/newclay" }, "repoStats": { "firstCommit": 2011, "commits": 1, "committers": 1, "files": 1424 } }, "newick-format": { "title": "Newick format", "appeared": 1986, "type": "textDataFormat", "country": [ "United States and Canada" ], "originCommunity": [ "University of Washington", "University of British Columbia" ], "example": [ "(A:0.1,B:0.2,(C:0.3,D:0.4):0.5);" ], "wikipedia": { "example": [ "Tree → RootLeaf \";\" | RootInternal \";\" | Branch \";\"\n RootLeaf → Name | \"(\" Branch \")\" Name\n RootInternal → \"(\" Branch \",\" BranchSet \")\" Name" ], "related": [ "phyloxml-format" ], "summary": "In mathematics, Newick tree format (or Newick notation or New Hampshire tree format) is a way of representing graph-theoretical trees with edge lengths using parentheses and commas. It was adopted by James Archie, William H. E. Day, Joseph Felsenstein, Wayne Maddison, Christopher Meacham, F. James Rohlf, and David Swofford, at two meetings in 1986, the second of which was at Newick's restaurant in Dover, New Hampshire, US. The adopted format is a generalization of the format developed by Meacham in 1984 for the first tree-drawing programs in Felsenstein's PHYLIP package.", "pageId": 7857636, "created": 2006, "backlinksCount": 51, "revisionCount": 67, "dailyPageViews": 78, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Newick_format" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "newlisp": { "title": "NewLisp", "appeared": 1991, "type": "pl", "creators": [ "Lutz Mueller" ], "website": "http://www.newlisp.org/", "documentation": [ "http://www.newlisp.org/index.cgi?Documentation" ], "country": [ "United States" ], "originCommunity": [ "http://kosh.sdf.org" ], "domainName": { "registered": 1999, "awisRank": { "2022": 5805944 }, "name": "newlisp.org" }, "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasLineComments": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "githubRepo": { "firstCommit": 2008, "stars": 87, "forks": 18, "subscribers": 10, "created": 2014, "updated": 2022, "description": "newLISP mirror repository (unofficial)", "issues": 8, "url": "https://github.com/kosh04/newlisp" }, "repoStats": { "firstCommit": 2008, "commits": 139, "committers": 6, "files": 269 }, "wikipedia": { "related": [ "lisp", "common-lisp", "scheme", "pascal", "c", "tcl", "s-expressions", "xml", "utf-8", "tcp", "udp", "linux", "solaris", "sqlite", "smtp", "ftp", "opengl" ], "summary": "newLISP is an open source scripting language in the Lisp family of programming languages developed by Lutz Mueller and released under the GNU General Public License.", "pageId": 1964813, "created": 2005, "backlinksCount": 48, "revisionCount": 242, "dailyPageViews": 18, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/NewLISP" }, "githubLanguage": { "fileExtensions": [ "nl", "lisp", "lsp" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "newlisp" ], "aceMode": "lisp", "codemirrorMode": "commonlisp", "codemirrorMimeType": "text/x-common-lisp", "tmScope": "source.lisp", "repos": 476, "id": "NewLisp" }, "githubBigQuery": { "repos": 812, "users": 774, "id": "NewLisp" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "lsp", "nl", "kif" ], "id": "NewLisp" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 6, "commitCount": 40, "sampleCount": 3, "example": [ "#!/usr/bin/env newlisp\n\n(constant 'NUM 8)\n\n(define (intersects? q1 q2)\n\t(or \n\t\t(= (q1 0) (q2 0)) \n\t\t(= (q1 1) (q2 1))\n\t\t(= (abs (- (q1 0) (q2 0))) (abs (- (q1 1) (q2 1))))))\n\n(define (variant? alist)\n\t(set 'logic nil)\n\t(cond\n\t\t((= (length alist) 1) true)\n\t\t((> (length alist) 1)\n\t\t\t(while (> (length alist) 1)\n\t\t\t\t(set 'q (pop alist -1))\n\t\t\t\t(dolist (el alist)\n\t\t\t\t\t(push \n\t\t\t\t\t\t(intersects? \n\t\t\t\t\t\t\t(list q (inc (length alist)))\n\t\t\t\t\t\t\t(list el (+ 1 $idx)))\n\t\t\t\t\tlogic -1)))\n\t\t\t(not (apply or logic)))))\n\n(define (fork-by-line alist)\n\t(let (res '())\n\t\t(dolist (i (sequence 1 NUM))\n\t\t\t(set 'tmp alist)\n\t\t\t(push i tmp -1)\n\t\t\t(setf res (push tmp res -1)))\n\t\tres))\n\n(define (find-variants num)\n\t(let (res '())\n\t\t(cond \n\t\t\t((< num 1) \n\t\t\t\t(begin (println \"num < 1\") (exit)))\n\t\t\t((= num 1) \n\t\t\t\t(dolist (i (sequence 1 NUM)) (push (list i) res -1)))\n\t\t\t((> num 1) \n\t\t\t\t(dolist (v (find-variants (dec num))) \n\t\t\t\t\t(set 'passed (filter variant? (fork-by-line v)))\n\t\t\t\t\t(if (not (empty? passed)) (extend res passed)))))\n\t\tres))\n\t\t\n(set 'solutions (find-variants NUM))\n(println (length solutions))\n;;(exit)" ], "url": "https://github.com/textmate/lisp.tmbundle" }, "projectEuler": { "memberCount": { "2022": 1 }, "id": "newLISP" }, "leachim6": { "filepath": "n/NewLISP.lsp", "fileExtensions": [ "lsp" ], "example": [ "#!/usr/bin/newlisp\n(print \"Hello World\\n\")\n(exit)\n" ], "id": "NewLISP" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:NewLISP", "tryItOnline": "http://www.newlisp.org/newlisp-js", "twitter": "https://twitter.com/newlisp", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "newp": { "title": "NEWP", "appeared": 1985, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Burroughs Corporation", "Unisys Corporation" ], "wikipedia": { "summary": "NEWP (or the New Executive Programming Language) is a high-level programming language used on the Unisys MCP systems. The language is used to write the operating system and other system utilities, although it can also be used to write user software as well. Several constructs separate it from extended ALGOL on which it is based. Language operators such as MEMORY which allows direct memory access are strictly used by programs running as the MCP.", "created": 2006, "backlinksCount": 36, "pageId": 6433017, "revisionCount": 23, "dailyPageViews": 13, "url": "https://en.wikipedia.org/wiki/NEWP" }, "centralPackageRepositoryCount": 0 }, "newspeak": { "title": "Newspeak", "appeared": 2006, "type": "pl", "creators": [ "Gilad Bracha" ], "website": "http://newspeaklanguage.org/", "country": [ "United States" ], "originCommunity": [ "Cadence Design Systems, Inc" ], "domainName": { "registered": 2008, "awisRank": { "2017": 11151826 }, "name": "newspeaklanguage.org" }, "wikipedia": { "example": [ "HelloBraveNewWorld usingPlatform: platform = ( \n platform Transcript open show: 'Hello, Oh Brave new world'. \n)" ], "related": [ "smalltalk", "self", "beta" ], "summary": "Newspeak is a programming language and platform in the tradition of Smalltalk and Self being developed by a team led by Gilad Bracha. The platform includes an IDE, a GUI library, and standard libraries. Starting in 2006, Cadence Design Systems funded its development and employed the main contributors, but ceased funding in January 2009. Newspeak is a class based language. Classes may be nested, as in BETA. This is one of the key differences between Newspeak and Smalltalk. All names in Newspeak are late-bound, and are interpreted as message sends, as in Self. Newspeak is distinguished by its unusual approach to modularity. The language has no global namespace. Top level classes act as module declarations. Module declarations are first class values (i.e., they may be stored in variables, passed as parameters, returned from methods, etc.) and are stateless.", "pageId": 24308364, "dailyPageViews": 17, "created": 2009, "backlinksCount": 16, "revisionCount": 59, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Newspeak_(programming_language)" }, "pygmentsHighlighter": { "filename": "smalltalk.py", "fileExtensions": [ "ns2" ], "id": "Newspeak" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "newsqueak": { "title": "Newsqueak", "appeared": 1990, "type": "pl", "creators": [ "Rob Pike" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "related": [ "squeak", "newspeak", "c", "csp", "alef", "go", "limbo", "rust", "smalltalk" ], "summary": "Newsqueak is a concurrent programming language for writing application software with interactive graphical user interfaces. Newsqueak's syntax and semantics are influenced by the C language, but its approach to concurrency was inspired by C. A. R. Hoare's communicating sequential processes (CSP). However, in Newsqueak, channels are first-class objects, with dynamic process creation and dynamic channel creation. Newsqueak was developed from an earlier, smaller, language, called Squeak (not to be confused with the Smalltalk implementation Squeak). It was developed by Luca Cardelli and Rob Pike at Bell Labs in the first half of the 1980s as a language for implementing graphical user interfaces. Both languages were presented as \"a language for communicating with mice\": their main aim was to model the concurrent nature of programs interacting with multiple input devices, viz., keyboards and mice.The ideas present in Newsqueak were further developed in the programming languages Alef, Limbo, and Go.", "created": 2009, "backlinksCount": 32, "pageId": 25051106, "revisionCount": 18, "dailyPageViews": 19, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Newsqueak" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1503", "centralPackageRepositoryCount": 0 }, "newton": { "title": "Newton", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8a7d217a8c701d3951d456b5e783ef5e5da66365" ], "country": [ "Switzerland" ], "originCommunity": [ "École polytechnique fédérale de Lausanne" ], "hopl": "https://hopl.info/showlanguage.prx?exp=965", "wordRank": 6382, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1998|Cambridge University Press|Higher Order Operational Techniques in Semantics (Publications of the Newton Institute)|Andrew D. Gordon and Andrew M. Pitts and H. K. Moffatt and Nicholas Negroponte|9780521631686\n1996|Addison-Wesley|Newton 2.0 User Interface Guidelines|Apple Computer Inc and Apple Computer, Inc Staff|9780201488388\n1996|Addison-Wesley|Newton Programmer's Guide: For Newton 2.0|Apple Computer Inc|9780201479478\n1997|Cambridge University Press|Semantics and Logics of Computation (Publications of the Newton Institute, Series Number 14)|Pitts, Andrew M.|9780521580571\n1995|Morgan Kaufmann Pub|Basic for the Newton: Programming for the Newton With Ns Basic/Book and Disk|Schettino, John and O'Hara, Liz|9780126239553" }, "newtonscript": { "title": "NewtonScript", "appeared": 1993, "type": "pl", "creators": [ "Walter Smith" ], "country": [ "United States" ], "originCommunity": [ "Apple Computer" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "self", "dylan", "smalltalk", "javascript", "lisp", "lua", "io" ], "summary": "NewtonScript is a prototype-based programming language created to write programs for the Newton platform. It is heavily influenced by the Self programming language, but modified to be more suited to needs of mobile and embedded devices.", "pageId": 60545, "created": 2002, "backlinksCount": 29, "revisionCount": 89, "dailyPageViews": 16, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/NewtonScript" }, "leachim6": { "filepath": "n/NewtonScript.nwt", "fileExtensions": [ "nwt" ], "example": [ "baseview :=\n {viewBounds: {left: -3, top: 71, right: 138, bottom: 137},\n viewFlags: 581,\n declareSelf: 'base,\n _proto: protoFloatNGo,\n debug: \"baseview\"\n };\n\ntextview := * child of baseview *\n {text: \"Hello World\",\n viewBounds: {left: 33, top: 24, right: 113, bottom: 46},\n viewFlags: 579,\n _proto: protoStaticText,\n debug: \"textview\"\n };\n" ], "id": "NewtonScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:NewtonScript", "hopl": "https://hopl.info/showlanguage.prx?exp=1278", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming for the Newton: Software Development with Newtonscript|1994|Julie McKeehan|2172147|0.0|0|0\nProgramming for the Newton®: Software Development with Newtonscript™||Julie McKeehan|59333740|0.0|0|0\nPrototype-Based Programming: Prototype-Based Programming Languages, JavaScript, Self, Rebol, Newtonscript, Lua, Moo, ActionScript, Falcon|2011|Source Wikipedia|17750077|0.0|0|0", "isbndb": "" }, "nexml": { "title": "NeXML format", "appeared": 2007, "type": "xmlFormat", "website": "http://nexml.org/", "country": [ "The Netherlands and United States and Canada and India" ], "originCommunity": [ "Naturalis Biodiversity Center", "National Evolutionary Synthesis Center", "University of North Carolina", "Wayne State University", "University of Kansas", "University of British Columbia", "Indian Institute of Technology Kharagpur", "University of Ottawa", "National Institute of Standards and Technology" ], "domainName": { "registered": 2007, "name": "nexml.org" }, "githubRepo": { "stars": 14, "forks": 8, "subscribers": 3, "created": 2012, "updated": 2022, "description": "NeXML is an exchange standard for representing phyloinformatic data.", "issues": 9, "url": "https://github.com/nexml/nexml" }, "repoStats": { "firstCommit": 2007, "commits": 3471, "committers": 12, "files": 108 }, "wikipedia": { "related": [ "nexus-format", "xml" ], "summary": "NeXML is an exchange standard for representing phyloinformatic data. It was inspired by the widely used Nexus file format but uses XML to produce a more robust format for rich phylogenetic data. Advantages include syntax validation, semantic annotation, and web services. The format is broadly supported and has libraries in many popular programming languages for bioinformatics.", "pageId": 48720906, "created": 2015, "backlinksCount": 4, "revisionCount": 17, "dailyPageViews": 2, "url": "https://en.wikipedia.org/wiki/NeXML_format" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "nextflow": { "title": "Nextflow", "appeared": 2013, "type": "pl", "website": "http://nextflow.io", "documentation": [ "https://www.nextflow.io/docs/latest/index.html" ], "country": [ "Sweden and Spain and Brazil and South Africa" ], "originCommunity": [ "https://github.com/nextflow-io" ], "domainName": { "registered": 2014, "awisRank": { "2022": 628198 }, "name": "nextflow.io" }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "firstCommit": 2013, "stars": 1768, "forks": 454, "subscribers": 81, "created": 2013, "updated": 2022, "description": "A DSL for data-driven computational pipelines", "issues": 264, "url": "https://github.com/nextflow-io/nextflow" }, "repoStats": { "firstCommit": 2013, "commits": 6773, "committers": 170, "files": 1705 }, "githubLanguage": { "fileExtensions": [ "nf" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "nextflow.config" ], "interpreters": [ "nextflow" ], "aceMode": "groovy", "tmScope": "source.nextflow", "repos": 3132, "id": "Nextflow" }, "githubBigQuery": { "repos": 62, "users": 46, "id": "Nextflow" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 1, "commitCount": 33, "sampleCount": 3, "example": [ "#!/usr/bin/env nextflow\n/*\n * This is free and unencumbered software released into the public domain.\n * \n * Anyone is free to copy, modify, publish, use, compile, sell, or\n * distribute this software, either in source code form or as a compiled\n * binary, for any purpose, commercial or non-commercial, and by any\n * means.\n * \n * In jurisdictions that recognize copyright laws, the author or authors\n * of this software dedicate any and all copyright interest in the\n * software to the public domain. We make this dedication for the benefit\n * of the public at large and to the detriment of our heirs and\n * successors. We intend this dedication to be an overt act of\n * relinquishment in perpetuity of all present and future rights to this\n * software under copyright law.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n * \n * For more information, please refer to \n */\n \n/* \n * Author Paolo Di Tommaso \n */\n\n\nparams.query = \"$HOME/sample.fa\"\nparams.db = \"$HOME/tools/blast-db/pdb/pdb\"\n\nprocess blast {\n output:\n file top_hits\n\n \"\"\"\n blastp -query ${params.query} -db ${params.db} -outfmt 6 \\\n | head -n 10 \\\n | cut -f 2 > top_hits\n \"\"\"\n}\n\nprocess extract {\n input:\n file top_hits\n output:\n file sequences\n\n \"\"\"\n blastdbcmd -db ${params.db} -entry_batch $top_hits > sequences\n \"\"\"\n}\n\nprocess align {\n input:\n file sequences\n echo true\n\n \"\"\"\n t_coffee $sequences 2>&- | tee align_result\n \"\"\"\n}" ], "url": "https://github.com/nextflow-io/atom-language-nextflow" }, "twitter": "https://twitter.com/nextflowio", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|DolphinNext: A graphical user interface for creating, deploying and executing Nextflow pipelines|10.1101/689539|2|0|Alper Kucukural and Manuel Garber and O. Yukselen and Osman Turkyilmaz and A. Ozturk and Isabelle Girard and Roy Martin|d3fc8a7fff8c84d3f697f7e1fe0b58a521909e5e" }, "nexus-format": { "title": "Nexus file", "appeared": 1997, "type": "textDataFormat", "reference": [ "http://wiki.christophchamp.com/index.php/NEXUS_file_format" ], "country": [ "United States" ], "originCommunity": [ "University of Arizona", "Smithsonian Institution" ], "example": [ "#NEXUS\nBEGIN TAXA;\n TAXLABELS A B C;\nEND;\n\nBEGIN TREES;\n TREE tree1 = ((A,B),C);\nEND;" ], "wikipedia": { "example": [ "#NEXUS\nBEGIN TAXA;\n TAXLABELS A B C;\nEND;\n\nBEGIN TREES;\n TREE tree1 = ((A,B),C);\nEND;" ], "related": [ "newick-format", "nexml", "phyloxml-format" ], "summary": "The NEXUS file format (usually .nex or .nxs) is widely used in bioinformatics. Several popular phylogenetic programs such as PAUP*, MrBayes, Mesquite,, MacClade and SplitsTree use this format.", "pageId": 6139571, "created": 2006, "backlinksCount": 22, "revisionCount": 71, "dailyPageViews": 35, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Nexus_file" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "nfql": { "title": "NFQL", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d4eef3fa0f4aa184c86350a97663ae24e2c80288" ], "country": [ "United States" ], "originCommunity": [ "Kansas State University", "Brigham Young University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1504", "centralPackageRepositoryCount": 0 }, "nginx-config": { "title": "Nginx", "appeared": 2004, "type": "configFormat", "documentation": [ "https://nginx.org/en/docs/", "https://devdocs.io/nginx/" ], "country": [ "Russia" ], "originCommunity": [ "F5, Inc" ], "hasMultiLineComments": { "example": "", "value": false }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "#user nobody;\nworker_processes 1;\n\n#error_log logs/error.log;\n#pid /run/nginx.pid;\n\nevents {\n worker_connections 1024;\n}\n\nhttp {\n include /etc/nginx/mime.types;\n gzip on;\n gzip_http_version 1.1;\n gzip_comp_level 2;\n gzip_types text/plain text/html text/css\n application/x-javascript text/xml\n application/xml application/xml+rss\n text/javascript;\n\nserver {\n listen 80;\n server_name localhost;\n access_log logs/localhost.access.log main;\n location / {\n root html;\n index index.html index.htm;\n }\n include /etc/nginx/sites-enabled/*;\n }\n}" ], "wikipedia": { "related": [ "c", "linux", "solaris", "tls", "wordpress" ], "summary": "Nginx ( EN-jin-EKS) (stylized as NGINX, NGiИX or nginx) is a web server which can also be used as a reverse proxy, load balancer, mail proxy and HTTP cache. The software was created by Igor Sysoev and first publicly released in 2004. A company of the same name was founded in 2011 to provide support and Nginx plus paid software.Nginx is free and open-source software, released under the terms of a BSD-like license. A large fraction of web servers use NGINX, often as a load balancer.", "pageId": 10494974, "dailyPageViews": 795, "created": 2007, "backlinksCount": 298, "revisionCount": 1044, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Nginx" }, "githubLanguage": { "fileExtensions": [ "nginx", "nginxconf", "vhost" ], "trendingProjectsCount": 0, "type": "data", "filenames": [ "nginx.conf" ], "aceMode": "text", "codemirrorMode": "nginx", "codemirrorMimeType": "text/x-nginx-conf", "tmScope": "source.nginx", "aliases": [ "nginx configuration file" ], "repos": 5905, "id": "Nginx" }, "githubBigQuery": { "repos": 8529, "users": 7652, "id": "Nginx" }, "codeMirror": "nginx", "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "nginx.conf" ], "id": "Nginx configuration file" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 6, "commitCount": 41, "sampleCount": 1, "example": [ "# Move the www people to no-www\nserver {\n listen 80;\n server_name www.example.com;\n return 301 $scheme://example.com$request_uri;\n}\n\nserver {\n listen 80;\n listen 443 ssl;\n server_name example.com;\n\n # Certs sent to the client in SERVER HELLO are concatenated in ssl_certificate\n ssl_certificate /srv/www/example.com/ssl/example.com.crt;\n ssl_certificate_key /srv/www/example.com/ssl/example.com.key;\n \n # Allow multiple connections to use the same key data\n ssl_session_timeout 5m;\n ssl_session_cache shared:SSL:50m;\n \n # Diffie-Hellman parameter for DHE ciphersuites, recommended 2048 bits\n ssl_dhparam /etc/ssl/certs/dhparam.pem;\n\n # Intermediate configuration. tweak to your needs\n ssl_protocols TLSv1 TLSv1.1 TLSv1.2;\n include snippets/ssl_ciphers_intermediate.conf;\n ssl_prefer_server_ciphers on;\n\n # HSTS (ngx_http_headers_module is required) (15768000 seconds = 6 months)\n #add_header Strict-Transport-Security max-age=15768000;\n\n # OCSP Stapling - fetch OCSP records from URL in ssl_certificate and cache them\n ssl_stapling on;\n ssl_stapling_verify on;\n\n # Verify chain of trust of OCSP response using Root CA and Intermediate certs\n ssl_trusted_certificate /srv/www/example.com/ssl/unified-ssl.crt;\n resolver 8.8.8.8 8.8.4.4;\n resolver_timeout 10s;\n\n root /srv/www/example.com/htdocs;\n index index.php index.html index.htm;\n charset UTF-8;\n autoindex off;\n \n # Deny access based on HTTP method (set in HTTP level)\n if ($bad_method = 1) {\n return 444;\n }\n\n # Show \"Not Found\" 404 errors in place of \"Forbidden\" 403 errors, because\n # forbidden errors allow attackers potential insight into your server's\n # layout and contents\n error_page 403 = 404;\n\n # It's always good to set logs, note however you cannot turn off the error log\n # setting error_log off; will simply create a file called 'off'.\n access_log /var/log/nginx/example.com.access.log;\n error_log /var/log/nginx/example.com.error.log;\n\n # Add trailing slash to */wp-admin requests.\n rewrite /wp-admin$ $scheme://$host$uri/ permanent;\n\n location / {\n # This try_files directive is used to enable pretty, SEO-friendly URLs\n # and permalinks for Wordpress. Leave it *off* to start with, and then\n # turn it on once you've gotten Wordpress configured!\n try_files $uri $uri/ /index.php?$args;\n }\n\n # Option to create password protected directory\n # http://www.howtoforge.com/basic-http-authentication-with-nginx\n # location /admin {\n # auth_basic \"Administrator Login\";\n # auth_basic_user_file /var/www/domain.com/admin/.htpasswd;\n # }\n\n # Do not log access to these to keep the logs cleaner\n location = /favicon.ico {\n log_not_found off;\n access_log off;\n }\n\n location = /apple-touch-icon.png {\n log_not_found off;\n access_log off;\n }\n\n location = /apple-touch-icon-precomposed.png {\n log_not_found off;\n access_log off;\n }\n\n # This block will catch static file requests, such as images, css, js\n # The ?: prefix is a 'non-capturing' mark, meaning we do not require\n # the pattern to be captured into $1 which should help improve performance\n location ~* \\.(?:3gp|gif|jpg|jpe?g|png|ico|wmv|avi|asf|asx|mpg|mpeg|mp4|pls|mp3|mid|wav|swf|flv|html|htm|txt|js|css|exe|zip|tar|rar|gz|tgz|bz2|uha|7z|doc|docx|xls|xlsx|pdf|iso|woff)$ {\n # Some basic cache-control for static files to be sent to the browser\n expires max;\n add_header Pragma public;\n add_header Cache-Control \"public, must-revalidate, proxy-revalidate\";\n }\n\n # Deny all attempts to access hidden files such as .htaccess, .htpasswd, .DS_Store (Mac).\n # Keep logging the requests to parse later (or to pass to firewall utilities such as fail2ban)\n location ~ /\\. {\n access_log off;\n log_not_found off;\n deny all;\n }\n\n location ~ ~$ {\n access_log off;\n log_not_found off;\n deny all;\n }\n\n # Common deny or internal locations, to help prevent access to areas of\n # the site that should not be public\n location ~* wp-admin/includes {\n deny all;\n }\n\n location ~* wp-includes/theme-compat/ {\n deny all;\n }\n\n location ~* wp-includes/js/tinymce/langs/.*\\.php {\n deny all;\n }\n\n location /wp-content/ {\n internal;\n }\n\n # Deny access to any files with a .php extension in the uploads directory\n # Works in sub-directory installs and also in multisite network\n # Keep logging the requests to parse later (or to pass to firewall utilities such as fail2ban)\n location ~* /(?:uploads|files)/.*\\.php$ {\n deny all;\n }\n\n # Make sure these get through, esp with dynamic WP sitmap plugin\n location = /robots.txt {\n try_files $uri /index.php;\n }\n\n location = /sitemap.xml {\n try_files $uri /index.php;\n }\n\n location = /sitemap.xml.gz {\n try_files $uri /index.php;\n }\n\n # Fix for Firefox issue with cross site font icons\n location ~* \\.(eot|otf|ttf|woff)$ {\n add_header Access-Control-Allow-Origin *;\n }\n\n # Redirect server error pages to the static page /50x.html\n # Make sure 50x.html exists at that location\n error_page 500 502 503 504 /50x.html;\n location = /50x.html {\n root /usr/share/nginx/html;\n }\n\n # Cache everything by default\n set $skip_cache 0;\n\n # POST requests and urls with a query string should always go to PHP\n if ($request_method = POST) {\n set $skip_cache 1;\n }\n if ($query_string != \"\") {\n set $skip_cache 1;\n }\n\n # Don't cache uris containing the following segments\n if ($request_uri ~* \"/wp-admin/|/xmlrpc.php|wp-.*.php|/feed/|index.php|sitemap(_index)?.xml\") {\n set $skip_cache 1;\n }\n\n # Don't use the cache for logged in users or recent commenters\n if ($http_cookie ~* \"comment_author|wordpress_[a-f0-9]+|wp-postpass|wordpress_no_cache|wordpress_logged_in\") {\n set $skip_cache 1;\n }\n\n # Pass all .php files onto a php-fpm/php-fcgi server.\n location ~ [^/]\\.php(/|$) {\n # regex to split $uri to $fastcgi_script_name and $fastcgi_path\n fastcgi_split_path_info ^(.+\\.php)(/.+)$;\n\n # Check that the PHP script exists before passing it\n try_files $fastcgi_script_name =404;\n\n # Bypass the fact that try_files resets $fastcgi_path_info\n # see: http://trac.nginx.org/nginx/ticket/321\n set $path_info $fastcgi_path_info;\n fastcgi_param PATH_INFO $path_info;\n\n fastcgi_pass unix:/var/run/example.com.sock;\n fastcgi_index index.php;\n # Uncomment if site is HTTPS\n #fastcgi_param HTTPS on;\n include fastcgi.conf;\n \n fastcgi_cache_bypass $skip_cache;\n fastcgi_no_cache $skip_cache;\n\n fastcgi_cache WORDPRESS;\n fastcgi_cache_valid 60m;\n }\n\n location ~ /purge(/.*) {\n fastcgi_cache_purge WORDPRESS \"$scheme$request_method$host$1\";\n }\n\n # Use this block if PHPMyAdmin is enabled for this domain\n location /phpmyadmin {\n root /usr/share/;\n index index.php index.html index.htm;\n\n location ~ ^/phpmyadmin/(.+\\.php)$ {\n try_files $uri =404;\n root /usr/share/;\n fastcgi_pass unix:/var/run/example.com.sock;\n fastcgi_index index.php;\n include fastcgi.conf;\n }\n\n location ~* ^/phpmyadmin/(.+\\.(jpg|jpeg|gif|css|png|js|ico|html|xml|txt))$ {\n root /usr/share/;\n }\n }\n\n location /phpMyAdmin {\n rewrite ^/* /phpmyadmin last;\n }\n # End PHPMyAdmin block\n\n} # End of server block." ], "url": "https://github.com/brandonwamboldt/sublime-nginx" }, "indeedJobs": { "2022": 2884, "query": "nginx engineer" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|Nginx Module Extension|Dar, Usama|9781782163046\n2018|Packt Publishing|Nginx HTTP Server: Harness the power of Nginx to make the most of your infrastructure and serve pages faster than ever before, 4th Edition|Fjordvald, Martin Bjerretoft and Nedelcu, Clement|9781788621977\n2013-03-19|Packt Publishing|Mastering Nginx|Dimitri Aivaliotis|9781849517454\n2013|Packt Publishing|Nginx HTTP Server Second Edition|Nedelcu, Clement|9781782162339\n18-11-2015|Packt Publishing|Nginx HTTP Server|Clement Nedelcu|9781785285912\n2013-12-26|Packt Publishing|Nginx Module Extension|Usama Dar|9781782163053", "semanticScholar": "" }, "ngl-programming-language": { "title": "NGL", "appeared": 2001, "type": "pl", "reference": [ "https://en-academic.com/dic.nsf/enwiki/1416026", "https://www.semanticscholar.org/topic/NGL-(programming-language)/1070864", "https://www.wikiwand.com/de/Zeittafel_der_Programmiersprachen" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/herrerae" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/NGL_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "ngql": { "title": "Noms GraphQL", "appeared": 2017, "type": "queryLanguage", "reference": [ "https://github.com/attic-labs/noms/blob/master/go/ngql/README.md" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/attic-labs" ], "related": [ "graphql" ] }, "ngs": { "title": "NGS", "appeared": 2013, "type": "pl", "creators": [ "Ilya Sher" ], "description": "NGS - Next Generation Shell, a language (and a shell in the future) for ops tasks. NGS aims to be an alternative for both bash/Python/Ruby/Perl/Go and configuration management tools. It has syntax for the common operations and libraries (currently only AWS) for idempotent resources manipulation. NGS unique features include built in exit code handling and syntax for run-a-command-and-parse-output.", "website": "https://ngs-lang.org/", "standsFor": "Next Generation Shell", "country": [ "Israel and Portugal" ], "originCommunity": [ "https://github.com/ngs-lang" ], "domainName": { "awisRank": { "2022": 4234959 }, "name": "ngs-lang.org" }, "githubRepo": { "stars": 1151, "forks": 39, "subscribers": 31, "created": 2013, "updated": 2022, "firstCommit": 2013, "description": "Next Generation Shell (NGS)", "issues": 268, "url": "https://github.com/ilyash/ngs" }, "repoStats": { "firstCommit": 2013, "commits": 2694, "committers": 20, "files": 244 }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:NGS", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "nhx": { "title": "The New Hampshire X Format", "appeared": 1999, "type": "textDataFormat", "website": "https://web.archive.org/web/20020819032848/http://www.genetics.wustl.edu/eddy/forester/NHX.html", "reference": [ "https://www.cs.cmu.edu/~aiton/split/Manual-2.6.master014.html", "https://www.cs.mcgill.ca/~birch/birchhomedir/doc/atv/NHX.pdf" ], "standsFor": "New Hampshire X", "aka": [ "NHX" ], "country": [ "United States" ], "originCommunity": [ "Washington University in St. Louis" ], "example": [ "(((ADH2:0.1[&&NHX:S=human:E=1.1.1.1],ADH1:0.11[&&NHX:S=human:E=1.1.1.1]):0\n.05[&&NHX:S=Primates:E=1.1.1.1:D=Y:B=100],ADHY:0.1[&&NHX:S=nematode:E=1.1.\n1.1],ADHX:0.12[&&NHX:S=insect:E=1.1.1.1]):0.1[&&NHX:S=Metazoa:E=1.1.1.1:D=\nN],(ADH4:0.09[&&NHX:S=yeast:E=1.1.1.1],ADH3:0.13[&&NHX:S=yeast:E=1.1.1.1],\nADH2:0.12[&&NHX:S=yeast:E=1.1.1.1],ADH1:0.11[&&NHX:S=yeast:E=1.1.1.1]):0.1\n[&&NHX:S=Fungi])[&&NHX:E=1.1.1.1:D=N];" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "nial": { "title": "Nial", "appeared": 1981, "type": "pl", "creators": [ "Mike Jenkins" ], "standsFor": "Nested Interactive Array Language", "country": [ "Canada" ], "originCommunity": [ "Queen's University" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "write" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "quicksort is fork [ >= [1 first,tally],\n pass,\n link [\n quicksort sublist [ < [pass, first], pass ],\n sublist [ match [pass,first],pass ],\n quicksort sublist [ > [pass,first], pass ]\n ]\n]" ], "summary": "Nial (from \"Nested Interactive Array Language\") is a high-level array programming language developed from about 1981 by Mike Jenkins of Queen's University, Kingston, Ontario, Canada. Jenkins co-created the Jenkins–Traub algorithm. Nial combines a functional programming notation for arrays based on an array theory developed by Trenchard More with structured programming concepts for numeric, character and symbolic data. It is most often used for prototyping and artificial intelligence.", "pageId": 21571, "created": 2001, "backlinksCount": 30, "revisionCount": 125, "dailyPageViews": 21, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/Nial" }, "leachim6": { "filepath": "n/Nial.ndf", "fileExtensions": [ "ndf" ], "example": [ "write 'Hello World';\nbye\n" ], "id": "Nial" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nial", "tryItOnline": "nial", "hopl": "https://hopl.info/showlanguage.prx?exp=1242", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n|National Library Of Canada|A Basis For Effective Logic Programming In Nial|Blevis, Eli B.|9780315304048" }, "nianiolang": { "title": "nianiolang", "appeared": 2015, "type": "pl", "creators": [ "Andrzej Gasienica-Samek" ], "description": "Procedural programming language without pointers", "website": "http://www.nianiolang.org/", "reference": [ "https://news.ycombinator.com/item?id=14178782" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/nianiolang" ], "domainName": { "registered": 2015, "name": "nianiolang.org" }, "githubRepo": { "firstCommit": 2015, "stars": 7, "forks": 5, "subscribers": 5, "created": 2015, "updated": 2019, "description": "NianioLang Compiler - main repo", "issues": 0, "url": "https://github.com/nianiolang/nl" }, "repoStats": { "firstCommit": 2015, "commits": 19, "committers": 5, "files": 255 } }, "nice": { "title": "Nice", "appeared": 2006, "type": "pl", "creators": [ "Daniel Bonniot" ], "website": "https://nice.sourceforge.net/", "documentation": [ "https://nice.sourceforge.net/manual.html", "https://nice.sourceforge.net/" ], "reference": [ "https://gallium.inria.fr/~remy/poly/mot/10/nice/web/", "https://nice.sourceforge.net/Nice-source.tar.gz" ], "country": [ "France" ], "originCommunity": [ "Institut national de recherche en sciences et technologies du numérique" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "haskell", "eiffel", "java-bytecode", "java" ], "summary": "Nice is an object-oriented programming language released under the GNU General Public License. It features a powerful type system which can help eliminate many common bugs, such as null pointer dereferences and invalid casts, by detecting potential runtime errors at compile-time; the goal of the designers was to provide safety features comparable to those found in languages such as ML and Haskell, but using a more conventional syntax. Nice aims to be feature-rich, and as such, in addition to the common features of modern object-oriented programming languages, it implements contracts in the style of Eiffel, class extensibility through multimethods, and many concepts drawn from functional programming such as anonymous functions, tuples, pattern matching (“value dispatch”), and parametric polymorphism. Source programs are compiled to Java bytecode, and can therefore interact with libraries written in Java and other programming languages targeting the Java Virtual Machine. Work on the Nice language appears to have slowed since early 2006.", "pageId": 294856, "created": 2003, "backlinksCount": 20, "revisionCount": 50, "dailyPageViews": 9, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Nice_(programming_language)" }, "leachim6": { "filepath": "n/Nice.nice", "fileExtensions": [ "nice" ], "example": [ "void main(String[] args){\n println(\"Hello World\");\n}\n" ], "id": "Nice" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nice", "fileType": "text", "wordRank": 1157, "centralPackageRepositoryCount": 0 }, "nickle": { "title": "Nickle", "appeared": 2001, "type": "pl", "website": "http://www.nickle.org/", "reference": [ "https://keithp.com/cgit/nickle.git/" ], "country": [ "United States" ], "originCommunity": [ "https://keithp.com/pipermail/nickle/" ], "domainName": { "registered": 2000, "name": "nickle.org" }, "wikipedia": { "related": [ "c", "lisp", "modula-3", "ml", "java" ], "summary": "Nickle is a numeric oriented programming language by Keith Packard and Bart Massey. Originally used for desktop calculation, it has since expanded for prototyping of complicated algorithms.", "pageId": 4072208, "created": 2006, "backlinksCount": 9, "revisionCount": 24, "dailyPageViews": 7, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Nickle_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nickle", "rijuRepl": { "example": [ "printf(\"Hello, world!\\n\");\n" ], "id": "https://riju.codes/nickle" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5675", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "nikl": { "title": "NIKL", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d1d2fffa67e72944665f2b09adf2c39dce2dd6d9" ], "country": [ "United States" ], "originCommunity": [ "University of Southern California, Information Sciences Institute" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1243", "centralPackageRepositoryCount": 0 }, "nil": { "title": "NIL", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/febdb3b6b8a1cfde771e2705afecd2ff82d36c98" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1048", "wordRank": 9364, "centralPackageRepositoryCount": 0 }, "nilscript": { "title": "NilScript", "appeared": 2013, "type": "pl", "creators": [ "Ricci Adams" ], "website": "https://github.com/musictheory/NilScript", "country": [ "United States" ], "originCommunity": [ "musictheory.net, LLC" ], "example": [ "@implementation TheClass {\n String _myStringInstanceVariable;\n}\n@end\n@implementation TheSubClass : TheSuperClass {\n String _myStringInstanceVariable;\n}\n@end" ], "githubRepo": { "stars": 49, "forks": 5, "subscribers": 5, "created": 2013, "updated": 2018, "description": "Objective-C-style language superset of JavaScript with a tiny, simple runtime", "url": "https://github.com/musictheory/NilScript" }, "repoStats": { "firstCommit": 2013, "commits": 523, "committers": 2, "files": 74 } }, "nim": { "title": "Nim", "appeared": 2008, "type": "pl", "creators": [ "Andreas Rumpf" ], "description": "Nim was called Nimrod until 2014. Nimrod is a relatively new programming language that is severely underrated in comparison to other new programming languages, with extensive metaprogramming support, generics and exception tracking built in, optional garbage collection, and rivals C in performance. And it can compile to C, C++, Objective-C, or JavaScript. Nimrod is a statically typed, imperative programming language that tries to give the programmer ultimate power without compromises on runtime efficiency. This means it focuses on compile-time mechanisms in all their various forms.", "website": "https://nim-lang.org/", "documentation": [ "https://nim-lang.org/documentation.html" ], "reference": [ "https://irclogs.nim-lang.org/01-07-2012.html" ], "aka": [ "nimrod" ], "fileExtensions": [ "nim" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/nim-lang" ], "domainName": { "registered": 2014, "awisRank": { "2017": 288984, "2022": 428858 }, "name": "nim-lang.org" }, "compilesTo": [ "c", "cpp", "objective-c", "javascript" ], "writtenIn": [ "nim" ], "hasComments": { "example": "", "value": true }, "hasTemplates": { "example": "# https://hookrace.net/blog/introduction-to-metaprogramming-in-nim/#templates\ntemplate debug*(args: varargs[string, `$`]) =\nif logLevel <= Level.debug:\n const module = instantiationInfo().filename[0 .. ^5]\n echo \"[$# $#][$#]: $#\" % [getDateStr(), getClockStr(),\n module, join args]", "value": true }, "hasMacros": { "example": "# https://hookrace.net/blog/introduction-to-metaprogramming-in-nim/#macros\nimport macros\ndumpTree:\n result = 10", "value": true }, "hasSemanticIndentation": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "# Though they may be phased out:\n# https://github.com/nim-lang/RFCs/issues/456", "value": true }, "hasStaticTyping": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "#[ A comment\n]#", "value": true }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": " let res = true", "value": true }, "hasGotos": { "example": "", "value": false }, "hasUnicodeIdentifiers": { "example": "let δ = 0.00001", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "#[", "]#" ] ], "printToken": [ [ "echo" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false", "on", "off" ] ], "githubRepo": { "stars": 13062, "forks": 1318, "subscribers": 304, "created": 2010, "updated": 2022, "firstCommit": 2008, "description": "Nim is a statically typed compiled systems programming language. It combines successful concepts from mature languages like Python, Ada and Modula. Its design focuses on efficiency, expressiveness, and elegance (in that order of priority).", "issues": 2287, "url": "https://github.com/nim-lang/Nim" }, "repoStats": { "firstCommit": 2008, "commits": 23651, "committers": 976, "files": 3378 }, "wikipedia": { "example": [ "proc printf(formatstr: cstring) {.header: \"\", varargs.}\n\nprintf(\"%s %d\\n\", \"foo\", 5)" ], "related": [ "ada", "modula-3", "lisp", "object-pascal", "python", "oberon", "c", "javascript", "pascal", "delphi", "csharp", "go", "objective-c", "ios", "android", "git", "json", "opengl", "postgresql", "mysql", "sqlite", "lua", "scala", "d", "rust" ], "summary": "Nim (formerly named Nimrod) is an imperative, multi-paradigm, compiled programming language designed and developed by Andreas Rumpf. It is designed to be \"efficient, expressive, and elegant\", supporting metaprogramming, functional, message passing, procedural, and object-oriented programming styles by providing several features such as compile time code generation, algebraic data types, a foreign function interface (FFI) with C and compiling to JavaScript, C and C++.", "pageId": 45413679, "dailyPageViews": 176, "created": 2015, "backlinksCount": 69, "revisionCount": 247, "appeared": 2008, "fileExtensions": [ "nim" ], "url": "https://en.wikipedia.org/wiki/Nim_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "nim", "nimcfg", "nimble", "nimrod", "nims" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "nim.cfg" ], "aceMode": "text", "tmScope": "source.nim", "repos": 8018, "id": "Nim" }, "githubBigQuery": { "repos": 472, "users": 299, "id": "Nim" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 28, "commitCount": 303, "sampleCount": 4, "example": [ "# from: https://github.com/nim-lang/Nim/blob/27b081d1f77604ee47c886e69dbc52f53ea3741f/compiler/nimfix/nimfix.nim.cfg\n\n# Special configuration file for the Nim project\n# gc:markAndSweep\n\nhint[XDeclaredButNotUsed]:off\npath:\"$projectPath/..\"\n\npath:\"$lib/packages/docutils\"\npath:\"$nim\"\n\ndefine:useStdoutAsStdmsg\nsymbol:nimfix\ndefine:nimfix\n\ncs:partial\n#define:useNodeIds\ndefine:booting\ndefine:noDocgen\n" ], "url": "https://github.com/Varriount/NimLime" }, "languageServerProtocolProject": [ "https://github.com/PMunch/nimlsp\nwrittenIn nim" ], "projectEuler": { "memberCount": { "2019": 10, "2022": 36 }, "id": "Nim" }, "helloWorldCollection": [ "# Hello world in Nim\n\necho \"Hello World\"" ], "leachim6": { "filepath": "n/Nim.nim", "fileExtensions": [ "nim" ], "example": [ "echo(\"Hello World\")\n" ], "id": "Nim" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nim", "quineRelay": "Nim", "compilerExplorer": { "example": [ "# Type your code here, or load an example.\nproc square(num: int): int {.exportc.} =\n num * num\n" ], "id": "Nim" }, "rijuRepl": { "example": [ "echo \"Hello, world!\"" ], "id": "https://riju.codes/nim" }, "tryItOnline": "nim", "officialBlogUrl": [ "https://nim-lang.org/blog.html" ], "faqPageUrl": [ "https://nim-lang.org/faq.html" ], "tiobe": { "id": "Nim" }, "packageRepository": [ "https://nimble.directory/" ], "twitter": "https://twitter.com/nim_lang", "ubuntuPackage": "nim", "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2022|Independently published | Mastering Nim |Rumpf, Andreas|979-8836539412\n2017|Manning Publications|Nim in Action|Picheta, Dominik|9781617293436\n2017|Manning|Nim in Action|Picheta, Dominik|9781638352297", "semanticScholar": "" }, "nimble-pm": { "title": "nimble-pm", "appeared": 2016, "type": "packageManager", "website": "https://nimble.directory/", "country": [ "Various" ], "originCommunity": [ "https://github.com/nim-lang" ], "domainName": { "registered": 2016, "name": "nimble.directory" }, "packageCount": 499, "forLanguages": [ "nim" ] }, "nimrod": { "title": "nimrod", "appeared": 2013, "type": "pl", "website": "http://nimrod-lang.org", "domainName": { "registered": 2013, "name": "nimrod-lang.org" }, "hasWhileLoops": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "keywords": [ "addr", "and", "as", "asm", "bind", "block", "break", "case", "cast", "concept", "const", "continue", "converter", "defer", "discard", "distinct", "div", "do", "elif", "else", "end", "enum", "except", "export", "finally", "for", "func", "if", "in", "yield", "interface", "is", "isnot", "iterator", "let", "macro", "method", "mixin", "mod", "not", "notin", "object", "of", "or", "out", "proc", "ptr", "raise", "ref", "return", "shl", "shr", "static", "template", "try", "tuple", "type", "using", "when", "while", "xor" ], "githubBigQuery": { "repos": 601, "users": 375, "id": "Nimrod" }, "pygmentsHighlighter": { "filename": "nimrod.py", "fileExtensions": [ "nim", "nimrod" ], "id": "Nimrod" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n6820474|Nimrod: A new approach to metaprogramming|http://nimrod-lang.org/talk01/slides.html|2013-11-29 18:39:28 UTC|1385750368|ryeguy|57|218" }, "nimskull": { "title": "Nimskull", "appeared": 2021, "type": "pl", "creators": [ "Andreas Rumpf" ], "website": "https://nim-works.github.io/nimskull/index.html", "reference": [ "https://news.ycombinator.com/item?id=32021299" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/nim-works" ], "forkOf": [ "nim" ], "githubRepo": { "firstCommit": 2008, "stars": 137, "forks": 20, "subscribers": 11, "created": 2021, "updated": 2022, "description": "An in development statically typed systems programming language; with sustainability at its core. We, the community of users, maintain it.", "issues": 51, "url": "https://github.com/nim-works/nimskull" }, "repoStats": { "firstCommit": 2008, "commits": 21400, "committers": 884, "files": 2964 } }, "ninja": { "title": "Ninja", "appeared": 2012, "type": "template", "creators": [ "Evan Martin" ], "website": "https://ninja-build.org/", "country": [ "United States" ], "originCommunity": [ "Google" ], "domainName": { "registered": 2014, "awisRank": { "2022": 636194 }, "name": "ninja-build.org" }, "githubRepo": { "firstCommit": 2010, "stars": 8228, "forks": 1307, "subscribers": 249, "created": 2011, "updated": 2022, "description": "a small build system with a focus on speed", "issues": 336, "url": "https://github.com/ninja-build/ninja" }, "repoStats": { "firstCommit": 2010, "commits": 2965, "committers": 300, "files": 162 }, "wikipedia": { "related": [ "python", "cmake", "meson" ], "summary": "Ninja is a small build system with a focus on speed. It differs from other build systems in two major respects: it is designed to have its input files generated by a higher-level build system, and it is designed to run builds as fast as possible. In essence, Ninja is meant to replace Make, which is slow when performing incremental (or no-op) builds. This can considerably slow down developers working on large projects, such as Google Chrome which compiles 30,000 input files into a single executable. In fact, Google Chrome is a main user and motivation for Ninja. It's also used to build Android, and is used by most developers working on LLVM.In contrast to Make, Ninja lacks features such as string manipulation, as Ninja build files are not meant to be written by hand. Instead, a \"build generator\" should be used to generate Ninja build files. CMake and Meson are popular build management software tools which support creating build files for Ninja.", "backlinksCount": 18, "pageId": 54312048, "created": 2017, "revisionCount": 27, "dailyPageViews": 71, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Ninja_(build_system)" }, "githubLanguage": { "fileExtensions": [ "ninja" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.ninja", "repos": 0, "id": "Ninja" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2016, "committerCount": 3, "commitCount": 20, "url": "https://github.com/khyo/language-ninja" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|Manning|Secrets of the JavaScript Ninja|John Resig and Bear Bibeault|9781933988696\n2019|Independently published|Linux: Linux For Beginners: Your Step By Step Guide Of Becoming A Linux Command Line Ninja|John, Felix|9781094653389", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2001|The NINJA project|10.1145/383845.383867|69|5|J. Moreira and S. Midkiff and Manish Gupta and Pedro V. Artigas and Peng Wu and G. Almási|1087cd70688cddf041c50acf75152e1f26aba8f2\n2015|Can traditional programming bridge the Ninja performance gap for parallel computing applications?|10.1145/2742910|68|3|N. Satish and Changkyu Kim and J. Chhugani and H. Saito and R. Krishnaiyer and M. Smelyanskiy and M. Girkar and P. Dubey|6c5f2a84716b989360834b2825f7e18ddb4d644e\n2012|Can traditional programming bridge the Ninja performance gap for parallel computing applications?|10.1145/2366231.2337210|66|5|N. Satish and Changkyu Kim and J. Chhugani and H. Saito and R. Krishnaiyer and M. Smelyanskiy and M. Girkar and P. Dubey|86f1f688eda730293da60f4787b35caf86f7bec8\n2016|Ninja code village for scratch: Function samples/function analyser and automatic assessment of computational thinking concepts|10.1109/VLHCC.2016.7739695|28|5|G. Ota and Y. Morimoto and H. Kato|e1798e205881241ba613e9fae5ae687ea1703c94" }, "nios": { "title": "Nios II", "appeared": 2000, "type": "isa", "originCommunity": [ "Altera" ], "wikipedia": { "related": [ "c", "eclipse-editor", "linux" ], "summary": "Nios II is a 32-bit embedded-processor architecture designed specifically for the Altera family of FPGAs. Nios II incorporates many enhancements over the original Nios architecture, making it more suitable for a wider range of embedded computing applications, from DSP to system-control. Nios II is comparable to MicroBlaze, a competing softcore CPU for the Xilinx family of FPGA. Unlike Microblaze, Nios II is licensable for standard-cell ASICs through a third-party IP provider, Synopsys Designware. Through the Designware license, designers can port Nios-based designs from an FPGA-platform to a mass production ASIC-device. Nios II is a successor to Altera's first configurable 16-bit embedded processor Nios.", "pageId": 1583721, "dailyPageViews": 93, "created": 2005, "backlinksCount": 157, "revisionCount": 168, "url": "https://en.wikipedia.org/wiki/Nios_II" }, "fileType": "na", "centralPackageRepositoryCount": 0, "isbndb": "" }, "nirvana": { "title": "nirvana", "appeared": 2018, "type": "pl", "isDead": true, "githubRepo": { "firstCommit": 2018, "stars": 25, "subscribers": 7, "created": 2018, "updated": 2019, "description": "[stalled] A language that aims to be conducive to writing beautiful, effective, maintainable code", "issues": 5, "url": "https://github.com/shreyasminocha/nirvana" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n18369802|Show HN: Nirvana, a WIP programming language|2018-11-03 12:00:55 UTC|1541246455|shreyasminocha|18|8" }, "nit": { "title": "Nit", "appeared": 2008, "type": "pl", "creators": [ "Jean Privat" ], "website": "https://nitlanguage.org/", "reference": [ "http://nitlanguage.org/nit.git/" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/nitlang" ], "domainName": { "registered": 2008, "name": "nitlanguage.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "example": [ "print \"Hello, World!\"" ], "githubRepo": { "firstCommit": 2008, "stars": 228, "forks": 65, "subscribers": 20, "created": 2009, "updated": 2022, "description": "Nit language", "issues": 169, "url": "https://github.com/nitlang/nit" }, "repoStats": { "firstCommit": 2008, "commits": 13837, "committers": 48, "files": 6372 }, "githubLanguage": { "fileExtensions": [ "nit" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.nit", "repos": 29, "id": "Nit" }, "githubBigQuery": { "repos": 26, "users": 26, "id": "Nit" }, "pygmentsHighlighter": { "filename": "nit.py", "fileExtensions": [ "nit" ], "id": "Nit" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 2, "commitCount": 7, "sampleCount": 24, "example": [ "print \"hello world\"\n" ], "url": "https://github.com/R4PaSs/Sublime-Nit" }, "leachim6": { "filepath": "n/Nit.nit", "fileExtensions": [ "nit" ], "example": [ "print \"Hello World\"\n\n" ], "id": "Nit" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nit", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "nix": { "title": "Nix", "appeared": 2003, "type": "packageManager", "reference": [ "https://nixos.org/" ], "country": [ "The Netherlands" ], "originCommunity": [ "NixOS Foundation" ], "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "keywords": [ "rec", "with", "let", "in", "inherit", "assert", "if", "else", "then", "..." ], "example": [ "{\n boot.loader.grub.device = \"/dev/sda\";\n\n fileSystems.\"/\".device = \"/dev/sda1\";\n\n services.sshd.enable = true;\n}" ], "githubLanguage": { "fileExtensions": [ "nix" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nNixOS nixpkgs https://github.com/NixOS.png https://github.com/NixOS/nixpkgs Nix #7e7eff 4149 3954 134 \"Nix Packages collection\"\nrycee home-manager https://github.com/rycee.png https://github.com/rycee/home-manager Nix #7e7eff 712 225 38 \"Manage a user environment using Nix\"", "trendingProjectsCount": 3, "type": "programming", "aceMode": "nix", "tmScope": "source.nix", "aliases": [ "nixos" ], "id": "Nix" }, "githubBigQuery": { "repos": 2673, "users": 1808, "id": "Nix" }, "pygmentsHighlighter": { "filename": "nix.py", "fileExtensions": [ "nix" ], "id": "Nix" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2017, "committerCount": 5, "commitCount": 36, "sampleCount": 1, "example": [ "{ stdenv, fetchurl, fetchgit, openssl, zlib, pcre, libxml2, libxslt, expat\n, rtmp ? false\n, fullWebDAV ? false\n, syslog ? false\n, moreheaders ? false, ...}:\n\nlet\n version = \"1.4.4\";\n mainSrc = fetchurl {\n url = \"http://nginx.org/download/nginx-${version}.tar.gz\";\n sha256 = \"1f82845mpgmhvm151fhn2cnqjggw9w7cvsqbva9rb320wmc9m63w\";\n };\n\n rtmp-ext = fetchgit {\n url = git://github.com/arut/nginx-rtmp-module.git;\n rev = \"1cfb7aeb582789f3b15a03da5b662d1811e2a3f1\";\n sha256 = \"03ikfd2l8mzsjwx896l07rdrw5jn7jjfdiyl572yb9jfrnk48fwi\";\n };\n\n dav-ext = fetchgit {\n url = git://github.com/arut/nginx-dav-ext-module.git;\n rev = \"54cebc1f21fc13391aae692c6cce672fa7986f9d\";\n sha256 = \"1dvpq1fg5rslnl05z8jc39sgnvh3akam9qxfl033akpczq1bh8nq\";\n };\n\n syslog-ext = fetchgit {\n url = https://github.com/yaoweibin/nginx_syslog_patch.git;\n rev = \"165affd9741f0e30c4c8225da5e487d33832aca3\";\n sha256 = \"14dkkafjnbapp6jnvrjg9ip46j00cr8pqc2g7374z9aj7hrvdvhs\";\n };\n\n moreheaders-ext = fetchgit {\n url = https://github.com/agentzh/headers-more-nginx-module.git;\n rev = \"refs/tags/v0.23\";\n sha256 = \"12pbjgsxnvcf2ff2i2qdn39q4cm5czlgrng96j8ml4cgxvnbdh39\";\n };\nin\n\nstdenv.mkDerivation rec {\n name = \"nginx-${version}\";\n src = mainSrc;\n\n buildInputs = [ openssl zlib pcre libxml2 libxslt\n ] ++ stdenv.lib.optional fullWebDAV expat;\n\n patches = if syslog then [ \"${syslog-ext}/syslog_1.4.0.patch\" ] else [];\n\n configureFlags = [\n \"--with-http_ssl_module\"\n \"--with-http_spdy_module\"\n \"--with-http_xslt_module\"\n \"--with-http_sub_module\"\n \"--with-http_dav_module\"\n \"--with-http_gzip_static_module\"\n \"--with-http_secure_link_module\"\n \"--with-ipv6\"\n # Install destination problems\n # \"--with-http_perl_module\"\n ] ++ stdenv.lib.optional rtmp \"--add-module=${rtmp-ext}\"\n ++ stdenv.lib.optional fullWebDAV \"--add-module=${dav-ext}\"\n ++ stdenv.lib.optional syslog \"--add-module=${syslog-ext}\"\n ++ stdenv.lib.optional moreheaders \"--add-module=${moreheaders-ext}\";\n\n preConfigure = ''\n export NIX_CFLAGS_COMPILE=\"$NIX_CFLAGS_COMPILE -I${libxml2 }/include/libxml2\"\n '';\n\n # escape example\n postInstall = ''\n mv $out/sbin $out/bin ''' ''${\n ${ if true then ${ \"\" } else false }\n '';\n\n meta = {\n description = \"A reverse proxy and lightweight webserver\";\n maintainers = [ stdenv.lib.maintainers.raskin];\n platforms = stdenv.lib.platforms.all;\n inherit version;\n };\n}" ], "url": "https://github.com/wmertens/sublime-nix" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nix", "packageCount": 49610, "fileType": "text", "centralPackageRepositoryCount": 0 }, "nixos": { "title": "NixOS", "appeared": 2003, "type": "os", "country": [ "The Netherlands" ], "originCommunity": [ "NixOS Foundation" ], "wikipedia": { "summary": "NixOS is a Linux distribution built on top of the Nix package manager. It uses declarative configuration and allows reliable system upgrades. Two main branches are offered: current Stable release and Unstable following latest development. Although NixOS started as a research project, it is a fully functional and usable operating system.NixOS has tools dedicated to DevOps and deployment tasks.", "backlinksCount": 323, "pageId": 27125334, "dailyPageViews": 156, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/NixOS" } }, "njcl": { "title": "NJCL", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2b9636ca3bcee91b6fb07a12109f599ec1f49e87" ], "hopl": "https://hopl.info/showlanguage.prx?exp=649", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "nl": { "title": "NL", "appeared": 1993, "type": "application", "reference": [ "https://web.archive.org/web/20161228202832/https://cfwebprod.sandia.gov/cfdocs/CompResearch/docs/nlwrite20051130.pdf" ], "country": [ "United States" ], "originCommunity": [ "Sandia National Laboratories" ], "example": [ "g3 0 1 0\t# problem assign0\n 9 6 1 0 6\t# vars, constraints, objectives, ranges, eqns\n 0 0\t# nonlinear constraints, objectives\n 0 0\t# network constraints: nonlinear, linear\n 0 0 0\t# nonlinear vars in constraints, objectives, both\n 0 0 0 1\t# linear network variables; functions; arith, flags\n 9 0 0 0 0\t# discrete variables: binary, integer, nonlinear (b,c,o)\n 18 9\t# nonzeros in Jacobian, gradients\n 0 0\t# max name lengths: constraints, variables\n 0 0 0 0 0\t# common exprs: b,c,o,c1,o1\nC0\nn0\nC1\nn0\nC2\nn0\nC3\nn0\nC4\nn0\nC5\nn0\nO0 0\nn0\nr\n4 1\n4 1\n4 1\n4 1\n4 1\n4 1\nb\n0 0 1\n0 0 1\n0 0 1\n0 0 1\n0 0 1\n0 0 1\n0 0 1\n0 0 1\n0 0 1\nk8\n2\n4\n6\n8\n10\n12\n14\n16\nJ0 3\n0 1\n1 1\n2 1\nJ1 3\n3 1\n4 1\n5 1\nJ2 3\n6 1\n7 1\n8 1\nJ3 3\n0 1\n3 1\n6 1\nJ4 3\n1 1\n4 1\n7 1\nJ5 3\n2 1\n5 1\n8 1\nG0 9\n0 1\n1 3\n2 3\n3 2\n4 3\n5 3\n6 3\n7 3\n8 2\n" ], "wikipedia": { "related": [ "ampl", "netlib" ], "summary": "nl is a file format for presenting and archiving mathematical programming problems. Initially this format has been invented for connecting solvers to AMPL. It has also been adopted by other systems such as COIN-OR (as one of the input formats), FortSP (for interacting with external solvers), and Coopr (as one of its output formats). The nl format supports a wide range of problem types, among them: Linear programming Quadratic programming Nonlinear programming Mixed-integer programming Mixed-integer quadratic programming with or without convex quadratic constraints Mixed-integer nonlinear programming Second-order cone programming Global optimization Semidefinite programming problems with bilinear matrix inequalities Complementarity problems (MPECs) in discrete or continuous variables Constraint programmingThe nl format is low-level and is designed for compactness, not for readability. It has both binary and textual representation. Most commercial and academic solvers accept this format either directly or through special driver programs. The open-source AMPL Solver Library (ASL) distributed via Netlib and AMPL/MP library provide nl parsers that are used in many solvers.", "backlinksCount": 59, "pageId": 26492433, "created": 2010, "revisionCount": 38, "dailyPageViews": 11, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Nl_(format)" }, "githubLanguage": { "fileExtensions": [ "nl" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "none", "id": "NL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5545", "fileType": "text", "wordRank": 4393, "centralPackageRepositoryCount": 0 }, "nlpl": { "title": "nlpl", "appeared": 2018, "type": "pl", "creators": [ "Daniel Garcia" ], "country": [ "Mexico" ], "originCommunity": [ "https://github.com/nlpl-lang" ], "example": [ "Draw a red circle" ], "githubRepo": { "firstCommit": 2018, "stars": 1, "forks": 2, "subscribers": 2, "created": 2018, "updated": 2021, "description": "A notebook like programming environment with code written in plain English", "issues": 10, "url": "https://github.com/nlpl-lang/nlpl-editor" }, "repoStats": { "firstCommit": 2018, "commits": 65, "committers": 3, "files": 11 } }, "nltk": { "title": "Natural Language Toolkit", "appeared": 2001, "type": "library", "website": "http://www.nltk.org/", "country": [ "Various" ], "originCommunity": [ "https://www.nltk.org/team.html" ], "domainName": { "registered": 2007, "awisRank": { "2022": 88205 }, "name": "nltk.org" }, "writtenIn": [ "python" ], "githubRepo": { "stars": 10863, "forks": 2617, "subscribers": 470, "created": 2009, "updated": 2022, "firstCommit": 2001, "description": "NLTK Source", "issues": 233, "url": "https://github.com/nltk/nltk" }, "wikipedia": { "related": [ "python" ], "summary": "The Natural Language Toolkit, or more commonly NLTK, is a suite of libraries and programs for symbolic and statistical natural language processing (NLP) for English written in the Python programming language. It was developed by Steven Bird and Edward Loper in the Department of Computer and Information Science at the University of Pennsylvania. NLTK includes graphical demonstrations and sample data. It is accompanied by a book that explains the underlying concepts behind the language processing tasks supported by the toolkit, plus a cookbook. NLTK is intended to support research and teaching in NLP or closely related areas, including empirical linguistics, cognitive science, artificial intelligence, information retrieval, and machine learning. NLTK has been used successfully as a teaching tool, as an individual study tool, and as a platform for prototyping and building research systems. There are 32 universities in the US and 25 countries using NLTK in their courses. NLTK supports classification, tokenization, stemming, tagging, parsing, and semantic reasoning functionalities..", "pageId": 1661566, "dailyPageViews": 111, "created": 2005, "backlinksCount": 36, "revisionCount": 127, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Natural_Language_Toolkit" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPython Text Processing with NLTK 2.0 Cookbook: Over 80 Practical Recipes for Using Python's NLTK Suite of Libraries to Maximize Your Natural Language Processing Capabilities|2010|Jacob Perkins|14692614|3.91|43|2\nNatural Language Processing: Python and Nltk||Nitin Hardeniya|53857081|0.0|0|0\nNatural Language Processing: Python and NLTK||Nitin Hardeniya|54033345|3.00|1|0\nNatural Language Processing With Python: Natural Language Processing Using NLTK||Frank Millstein|60775831|5.00|2|0" }, "nml": { "title": "nML", "appeared": 1991, "type": "pl", "reference": [ "https://mfx.dasburo.com/old-home/w/nml.html", "http://archive.www6.in.tum.de/www6/Main/Publications/Freericks1991a.pdf", "https://semanticscholar.org/paper/022c8bfaf28c0d0ceb9dc7d819d7fd98e4ca775e" ], "country": [ "Germany" ], "originCommunity": [ "Forschungsberichte Des Fachbereichs Informatik" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7457", "centralPackageRepositoryCount": 0, "isbndb": "" }, "noah": { "title": "NOAH", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0172e9caf3dc204175368cab98e34c49def2add1" ], "country": [ "Former West Germany or Federal Republic of Germany" ], "originCommunity": [ "University of Hagen" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5593", "centralPackageRepositoryCount": 0 }, "nodal": { "title": "NODAL", "appeared": 1972, "type": "pl", "reference": [ "https://cds.cern.ch/record/132988?ln=en", "https://pal.anderssen.ch/Nod/index.php" ], "country": [ "Switzerland" ], "originCommunity": [ "Conseil Européen pour la Recherche Nucléaire" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2285", "fileType": "text", "centralPackageRepositoryCount": 0 }, "nodejs": { "title": "Node.js", "appeared": 2009, "type": "pl", "creators": [ "Ryan Dahl" ], "website": "https://nodejs.org", "documentation": [ "https://nodejs.org/en/docs/", "https://devdocs.io/node/" ], "country": [ "United States" ], "originCommunity": [ "OpenJS Foundation" ], "domainName": { "registered": 2009, "awisRank": { "2022": 2451 }, "name": "nodejs.org" }, "releaseNotesUrl": "https://nodejs.org/en/download/releases/", "writtenIn": [ "c", "cpp", "javascript" ], "canWriteToDisk": { "example": "require(\"fs\").writeFileSync(\"foo.txt\", \"foo\", \"utf8\")", "value": true }, "hasImports": { "example": "const jtree = require(\"jtree\")", "value": true }, "hasStreams": { "example": "const stream = require('stream');", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "console.log" ] ], "stringToken": [ [ "\"" ] ], "gource": "https://www.youtube.com/watch?v=1eERxzjXeGo", "githubRepo": { "stars": 88526, "forks": 23732, "subscribers": 2910, "created": 2014, "updated": 2022, "firstCommit": 2009, "description": "Node.js JavaScript runtime :sparkles::turtle::rocket::sparkles:", "issues": 1654, "url": "https://github.com/nodejs/node" }, "repoStats": { "firstCommit": 2009, "commits": 80544, "committers": 3721, "files": 40065 }, "wikipedia": { "related": [ "c", "javascript", "linux", "freebsd", "npm-pm", "tcp", "tls", "udp", "ecmascript", "unix", "coffeescript", "dart", "typescript", "php", "mps", "visual-studio-editor", "eclipse-editor", "visual-studio-code-editor", "postgresql", "mongodb", "json" ], "summary": "Node.js is an open-source, cross-platform JavaScript run-time environment that executes JavaScript code outside of a browser. Typically, JavaScript is used primarily for client-side scripting, in which scripts written in JavaScript are embedded in a webpage's HTML and run client-side by a JavaScript engine in the user's web browser. Node.js lets developers use JavaScript to write Command Line tools and for server-side scripting—running scripts server-side to produce dynamic web page content before the page is sent to the user's web browser. Consequently, Node.js represents a \"JavaScript everywhere\" paradigm, unifying web application development around a single programming language, rather than different languages for server side and client side scripts. Though .js is the conventional filename extension for JavaScript code, the name \"Node.js\" does not refer to a particular file in this context and is merely the name of the product. Node.js has an event-driven architecture capable of asynchronous I/O. These design choices aim to optimize throughput and scalability in web applications with many input/output operations, as well as for real-time Web applications (e.g., real-time communication programs and browser games).The Node.js distributed development project, governed by the Node.js Foundation, is facilitated by the Linux Foundation's Collaborative Projects program.Corporate users of Node.js software include GoDaddy, Groupon, IBM, LinkedIn, Microsoft, Netflix, PayPal, Rakuten, SAP, Voxer, Walmart, and Yahoo!.", "pageId": 26415635, "created": 2010, "backlinksCount": 805, "revisionCount": 2, "dailyPageViews": -1, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/nodejs" }, "leachim6": { "filepath": "n/Node.js.js", "fileExtensions": [ "js" ], "example": [ "#!/usr/bin/env node\n\nconsole.log('Hello World');\n" ], "id": "Node.js" }, "replit": "https://repl.it/languages/nodejs", "indeedJobs": { "2022": 6864, "query": "nodejs developer" }, "stackOverflowSurvey": { "2021": { "users": 27975, "medianSalary": 54672, "fans": 24100, "percentageUsing": 0.34 } }, "officialBlogUrl": [ "https://nodejs.org/en/blog/year-2011/" ], "downloadPageUrl": [ "https://nodejs.org/en/download/" ], "subreddit": [ { "memberCount": { "2022": 213404 }, "url": "https://reddit.com/r/node" } ], "meetup": { "memberCount": 928277, "groupCount": 1560, "url": "https://www.meetup.com/topics/nodejs" }, "packageRepository": [ "https://www.npmjs.com/" ], "fileType": "text", "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nNodejs Programming by Example|2012|Agus Kurniawan|22023706|3.75|12|0", "isbndb": "year|publisher|title|authors|isbn13\n2019|Manning Publications|Get Programming with Node.js|Wexler, Jonathan|9781617294747\n2014|Manning Publications|Node.js in Practice|Alex R. Young and Marc Harter|9781617290930\n2016|Packt Publishing|Developing Microservices with Node.js|Gonzalez, David|9781785887406\n2016|Apress|Reactive Programming with Node.js|Doglio, Fernando|9781484221518\n2013|O'Reilly Media|Node.js for PHP Developers: Porting PHP to Node.js|Howard, Daniel|9781449333607\n2012|Packt Publishing|CoffeeScript Programming with jQuery, Rails, and Node.js|Erasmus, Michael|9781849519588\n2014|Apress|Beginning Node.js|Syed, Basarat|9781484201879\n2016|Apress|Building APIs with Node.js|Pereira, Caio Ribeiro|9781484224427\n2015|Apress|Beginning Amazon Web Services with Node.js|Shackelford, Adam|9781484206539\n2015|Apress|Pro REST API Development with Node.js|Doglio, Fernando|9781484209172\n2012-12-13|Packt Publishing|CoffeeScript Programming with jQuery, Rails, and Node.js|Michael Erasmus|9781849519595\n2015|Apress|Full Stack JavaScript: Learn Backbone.js, Node.js and MongoDB|Mardan, Azat|9781484217511\n2017|Packt Publishing|Kotlin Blueprints: A practical guide to building industry-grade web, mobile, and desktop applications in Kotlin using frameworks such as Spring Boot and Node.js|Belagali, Ashish and Trivedi, Hardik and Chordiya, Akshay|9781788470421\n2020|Packt Publishing|Node.js Design Patterns: Design and implement production-grade Node.js applications using proven patterns and techniques, 3rd Edition|Casciaro, Mario and Mammino, Luciano|9781839210440\n2018|Packt Publishing|Advanced Node.js Development: Master Node.js by building real-world applications|Mead, Andrew|9781788394796\n2020|Packt Publishing|Node Cookbook: Discover solutions, techniques, and best practices for server-side web development with Node.js 14, 4th Edition|Griggs, Bethany|9781838554576\n2016|Manning Publications|Express in Action: Writing, building, and testing Node.js applications|Hahn, Evan|9781617292422\n2018|Packt Publishing|Learning Node.js Development: Learn the fundamentals of Node.js, and deploy and test Node.js applications on the web|Mead, Andrew|9781788396349\n2013|Manning Publications|Node.js in Action|Cantelon, Mike and Harter, Marc and Holowaychuk, TJ and Rajlich, Nathan|9781617290572\n2018|Packt Publishing|Beginning API Development with Node.js: Build highly scalable, developer-friendly APIs for the modern web with JavaScript and Node.js|Nandaa, Anthony|9781789534177\n2013|Pragmatic Bookshelf|Node.js the Right Way: Practical, Server-Side JavaScript That Scales|Wilson, Jim|9781937785734\n2018|Packt Publishing|Node.js Web Development: Server-side development with Node 10 made easy, 4th Edition|Herron, David|9781788627368\n2016|Packt Publishing|RESTful Web API Design with Node.js - Second Edition|Bojinov, Valentin|9781786463203\n2018|Pragmatic Bookshelf|Node.js 8 the Right Way: Practical, Server-Side JavaScript That Scales|Wilson, Jim|9781680501957\n2012|Sams Publishing|Sams Teach Yourself Node.js in 24 Hours (Sams Teach Yourself -- Hours)|Ornbo, George|9780672335952\n2018|Packt Publishing|Learn Blockchain Programming with JavaScript: Build your very own Blockchain and decentralized network with JavaScript and Node.js|Traub, Eric|9781789618822\n2017|Packt Publishing|Building Bots with Node.js|Freitas, Eduardo and Bhintade, Madan|9781786468499\n2014|Apress|Pro Express.js: Master Express.js: The Node.js Framework For Your Web Development|Mardan, Azat|9781484200377\n2017|Apress|The CLI Book: Writing Successful Command Line Interfaces with Node.js|Kowalski, Robert|9781484231777\n2014|Apress|Pro Node.js for Developers|Ihrig, Colin J.|9781430258612\n2012|Sams Publishing|Sams Teach Yourself Node.js in 24 Hours (Sams Teach Yourself -- Hours)|Ornbo, George|9780132966269\n2015|Packt Publishing|Node.js High Performance|Resende, Diogo|9781785280627\n2018|Packt Publishing|Learn Blockchain Programming with JavaScript: Build your very own Blockchain and decentralized network with JavaScript and Node.js|Traub, Eric|9781789614848\n2015|Microsoft Press|Node.js for .NET Developers (Developer Reference)|Gaynes, David|9781509300501\n2018|Apress|Scaling Your Node.js Apps: Progress Your Personal Projects to Production-Ready|Doglio, Fernando|9781484239919\n2014|Packt Publishing|Node.js Blueprints|Tsonev, Krasimir|9781783287338\n2018|CreateSpace Independent Publishing Platform|The Raspberry Pi 3 Project Book: More Project Ideas! With Step-By-Step Configuration Guides and Programming Examples in Python and Node.js|McCarthy, Steve|9781983653490\n2018|Apress|Practical Bot Development: Designing and Building Bots with Node.js and Microsoft Bot Framework|Rozga, Szymon|9781484235409\n2015|Packt Publishing|Learning Node.js for Mobile Application Development|Buttigieg, Stefan and Jevdjenic, Milorad|9781782175049\n2013|Apress|Node.js Recipes: A Problem-Solution Approach (Expert's Voice in Web Development)|Gackenheimer, Cory|9781430260592\n2014|Packt Publishing|Building Scalable Apps with Redis and Node.js|Johanan, Joshua|9781783984480\n2019|The October Foundation|Building Chatbots in TypeScript with the Microsoft Bot Framework: Programming Useful Bots in the Node.JS SDK|Szul, Michael|9780578513492\n2013|Packt Publishing|Using Node.js for UI Testing|Teixeira, Pedro|9781782160526\n2013|Packt Publishing|Instant Node.js Starter|Teixeira, Pedro|9781782165569\n2017|Addison-wesley,|Learning Node.js|Wandschneider, Marc.|9780134663715\n20141230|Packt Publishing|Node.js Design Patterns|Mario Casciaro|9781783287321\n2012|John Wiley & Sons|Professional Node.js|Pedro Teixeira|9781118227541\n29-12-2017|Packt Publishing|Mastering Node.js|Sandro Pasquali; Kevin Faaborg|9781785883033\n2013|Pearson Technology Group|Learning Node.js|Marc Wandschneider|9780133377989\n20140616|Packt Publishing|Node.js Blueprints|Krasimir Tsonev|9781783287345\n2012-10-01|Wiley|Professional Node.js|Pedro Teixeira|9781118240564\n20141203|Simon & Schuster|Node.js in Practice|Marc Harter; Alex Young|9781638355182\n20170816|Simon & Schuster|Node.js in Action|Tim Oxley; Nathan Rajlich; TJ Holowaychuk; Alex Young|9781638355175\n2013-05-23|Packt Publishing|Instant Node.js Starter|Pedro Teixeira|9781782165576\n20121103|O'Reilly Media, Inc.|Jump Start Node.js|Don Nguyen|9781457192050\n20121103|O'Reilly Media, Inc.|Jump Start Node.js|Don Nguyen|9781457192043\n20150525|Packt Publishing|Node.js By Example|Krasimir Tsonev|9781784399603\n31-07-2020|Packt Publishing|Node.js Web Development|David Herron|9781838983253\n20190211|Simon & Schuster|Get Programming with Node.js|Jonathan Wexler|9781638352402\n20121129|O'Reilly Media, Inc.|Node.js for PHP Developers|Daniel Howard|9781449333805\n20181130|O'Reilly Media, Inc.|9 Practical Node.js Projects|James Hibbard; James Kolce; Lukas White; Jeremy Wilken; Simon Holmes; Michael Wanyoike; Paul Orac; P|9781492071099\n20121129|O'Reilly Media, Inc.|Node.js for PHP Developers|Daniel Howard|9781449333812\n20161010|O'Reilly Media, Inc.|Node.js for Embedded Systems|Patrick Mulder; Kelsey Breseman|9781491928943\n2016-04-26|Packt Publishing|Developing Microservices with Node.js|David Gonzalez|9781785883194\n2018-12-21|Packt Publishing|Node.js Complete Reference Guide|Valentin Bojinov and David Herron and Diogo Resende|9781789951615\n20161208|Springer Nature|Reactive Programming with Node.js|Fernando Doglio|9781484221525\n20190212|Simon & Schuster|Serverless Applications with Node.js|Slobodan Stojanovic; Aleksandar Simovic|9781638356172\n|Apress, Distributed To The Book Trade Worldwide By Springer Science+business Media New York|Beginning Node.js: unleash the power of Node.js and create highly scalable websites|Syed, Basarat Ali (author.)|9781484201886\n24-06-2016|Packt Publishing|Learning Node.js for .NET Developers|Harry Cummings|9781785287510\n20180104|O'Reilly Media, Inc.|Node.js 8 the Right Way|Jim Wilson|9781680505368\n2018-06-29|Packt Publishing|Hands-On Microservices with Node.js|Diogo Resende|9781788626835\n20151228|O'Reilly Media, Inc.|Secure Your Node.js Web Application|Karl Duuna|9781680504620\n20181130|O'Reilly Media, Inc.|Your First Week With Node.js|James Hibbard; Camilo Reyes; Michael Wanyoike; Mark Brown; Manjunath M; Jay Raj; Florian Rappl|9781492071051\n20200424|O'Reilly Media, Inc.|Your First Week With Node.js|James Hibbard; Craig Buckler; Mark Brown; Nilson Jacques; James Kolce; Paul Orac; M. David Green; Fl|9781098122829\n2013-03-26|Packt Publishing|Using Node.js for UI Testing|Pedro Teixeira|9781782160533\n20140925|Packt Publishing|Web Development with MongoDB and Node.js|Jason Krol|9781783987313\n30-11-2018|Packt Publishing|Server Side development with Node.js and Koa.js Quick Start Guide|Olayinka Omole|9781789343663\n2018|Pragmatic Programmers,|Node.js 8 the right way: practical, server-side JavaScript that scales|Wilson, Jim R. (author.)|9781680501957", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Static analysis of event-driven Node.js JavaScript applications|10.1145/2814270.2814272|95|3|Magnus Madsen and F. Tip and O. Lhoták|ab1a30dc95975d264e0ba93efd869e469e535441\n2014|Performance Comparison and Evaluation of Web Development Technologies in PHP, Python, and Node.js|10.1109/CSE.2014.142|76|4|Kai Lei and Yining Ma and Zhi Tan|22266f8ad97d4bb4e2422d3a7dfa77ab7b47af21\n2018|Efficient dynamic analysis for Node.js|10.1145/3178372.3179527|36|2|Haiyang Sun and Daniele Bonetta and Christian Humer and Walter Binder|561d95be369566a0a1598fa1d7ddee9f27c088d4\n2012|Security Assessment of Node.js Platform|10.1007/978-3-642-35130-3_3|17|1|A. Ojamaa and Karl Düüna|232e37c0f722ae0657fdc474db2b8d7524e4809a\n2019|Nodest: feedback-driven static analysis of Node.js applications|10.1145/3338906.3338933|15|2|Benjamin Barslev Nielsen and Behnaz Hassanshahi and François Gauthier|e2e77f3a44bb5a1731af1bd238c586e3009e6edb\n2019|Model-based testing of breaking changes in Node.js libraries|10.1145/3338906.3338940|13|0|Anders Møller and Martin Toldam Torp|3daf9b286aba6cd74b8b1201887715344dd179cb\n2018|Towards Runtime Monitoring of Node.js and Its Application to the Internet of Things|10.4204/EPTCS.264.4|12|0|D. Ancona and Luca Franceschini and G. Delzanno and Maurizio Leotta and M. Ribaudo and F. Ricca|d4b06ff764f3ea52714fae7856bf7043000fcf25\n2017|The Case of the Poisoned Event Handler: Weaknesses in the Node.js Event-Driven Architecture|10.1145/3065913.3065916|11|1|James C. Davis and Gregor Kildow and Dongyoon Lee|4e2eda9ed082164302e16c8278f443f3a182e979\n2018|Mutode: generic JavaScript and Node.js mutation testing tool|10.1145/3213846.3229504|10|0|Diego Rodríguez-Baquero and M. Vásquez|fe9f8618d69b3b38cc29d4a9b4e0fefeef28a1d1\n2016|GEMs: shared-memory parallel programming for Node.js|10.1145/2983990.2984039|10|0|Daniele Bonetta and Luca Salucci and Stefan Marr and Walter Binder|d86cc1eb64afeea10b9131b8d6ab33704681753d\n2019|Reasoning about the Node.js Event Loop using Async Graphs|10.1109/CGO.2019.8661173|7|1|Haiyang Sun and Daniele Bonetta and F. Schiavio and Walter Binder|eb7bfd46a55ae0a971c61ea196c077feeb2be3a0\n2021|Detecting Node.js prototype pollution vulnerabilities via object lookup analysis|10.1145/3468264.3468542|5|1|Song Li and Mingqing Kang and Jianwei Hou and Yinzhi Cao|51c494cc72a4fe87b33eebaa0932ea7a020c9ec8\n2014|Server-side web development with JavaScript and Node.js (abstract only)|10.1145/2538862.2539001|5|0|Ariel Ortiz|665a1784b6407aede6d74ef3806abf8812843e22\n2015|Node.js and REST|10.1007/978-1-4842-0917-2_3|2|0|Fernando Doglio|0b0c793a612e76f70f8c80e9450e7be96a356fc8\n2020|Analysis of Node.js Application Performance Using MongoDB Drivers|10.1007/978-3-030-40690-5_21|2|0|Leandro Ungari Cayres and B. S. D. Lima and R. E. García and R. C. M. Correia|c1767050f5f5741459663cb03b5a40b5b44813f0\n2016|Programming Web Services on the Cloud with Node.js (Abstract Only)|10.1145/2839509.2844703|2|0|Ariel Ortiz|8610bc8ea4c4f0eda7e3a24deaa58da9bf1e46cb\n2014|Publishing Node.js Modules and Contributing to Open Source|10.1007/978-1-4302-6596-2_12|2|0|A. Mardan|6a8193b7d9cb0fe778efb030a64300afd90eb43f\n2019|Towards the Efficient Use of Dynamic Call Graph Generators of Node.js Applications|10.1007/978-3-030-40223-5_14|1|0|Zoltán Herczeg and Gábor Lóki and Ákos Kiss|f5f8f97e7d516f479c8c2e14b44c15f0a2a73c8d" }, "noisecraft": { "title": "noisecraft", "appeared": 2021, "type": "pl", "creators": [ "Maxime Chevalier-Boisvert" ], "website": "https://noisecraft.app/", "country": [ "Canada" ], "originCommunity": [ "https://github.com/maximecb/noisecraft/issues" ], "writtenIn": [ "javascript" ], "visualParadigm": true, "githubRepo": { "stars": 769, "forks": 41, "subscribers": 15, "created": 2021, "updated": 2022, "description": "Browser-based visual programming language and platform for sound synthesis.", "url": "https://github.com/maximecb/noisecraft/" }, "repoStats": { "firstCommit": 2021, "commits": 543, "committers": 15, "files": 73 } }, "nomad-software": { "title": "Nomad software", "appeared": 1976, "type": "pl", "country": [ "United States" ], "originCommunity": [ "National CSS, Inc" ], "wikipedia": { "example": [ "CHANGE ALL SALARY=SALARY*1.06 WHERE POSITION='ENG' AND AVG(INSTANCE(RATING)) GE 7" ], "related": [ "sql", "ramis-software", "assembly-language", "focus", "cobol", "unix", "excel-app" ], "summary": "Nomad Software is a relational database and fourth-generation language (4GL), originally developed in the 1970s by time-sharing vendor National CSS. While it is still in use today, its widest use was in the 1970s and 1980s. Nomad provides both interactive and batch environments for data management and application development, including commands for database definition, data manipulation, and reporting. All components are accessible by and integrated through a database-oriented programming language. Unlike many tools for managing mainframe data, which are geared to the needs of professional programmers in MIS departments, Nomad is particularly designed for (and sold to) application end-users in large corporations. End-users employ Nomad in batch production cycles and in Web-enabled applications, as well as for reporting and distribution via the Web or PC desktop.", "created": 2005, "backlinksCount": 18, "pageId": 2491250, "revisionCount": 78, "dailyPageViews": 19, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Nomad_software" }, "hopl": "https://hopl.info/showlanguage.prx?exp=727", "centralPackageRepositoryCount": 0, "isbndb": "" }, "noms-db": { "title": "noms-db", "appeared": 2015, "type": "database", "description": "Noms is a decentralized database philosophically descendant from the Git version control system.", "country": [ "United States" ], "originCommunity": [ "https://github.com/attic-labs" ], "githubRepo": { "firstCommit": 2015, "stars": 7478, "forks": 281, "subscribers": 203, "created": 2015, "updated": 2022, "description": "The versioned, forkable, syncable database", "issues": 295, "url": "https://github.com/attic-labs/noms" }, "repoStats": { "firstCommit": 2015, "commits": 4016, "committers": 56, "files": 451 }, "isbndb": "" }, "none": { "title": "none", "appeared": 2015, "type": "pl", "creators": [ "Leonard Ritter" ], "description": "None (a backronym for None's Only Nested Expressions), also called Nonelang for clarity, is a young, powerful, convenient, extensible and performant programming language and infrastructure. It is developed alongside our game in production, NOWHERE (we have a Patreon going if you would like to support us).", "website": "https://bitbucket.org/duangle/nonelang", "documentation": [ "https://nonelang.readthedocs.io/en/latest/" ], "country": [ "Germany" ], "originCommunity": [ "Duangle GbR" ], "sourcehutRepo": "https://hg.sr.ht/~duangle/lua_legacy/browse/default/nonelang", "semanticScholar": "" }, "noodle": { "title": "Noodle", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/95611dde7df948285d4cf6417fa04aa62e45097d" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories", "Columbia University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5786", "centralPackageRepositoryCount": 0 }, "nop-2": { "title": "NOP-2", "appeared": 2001, "type": "pl", "reference": [ "https://semanticscholar.org/paper/caac297bc024f9be9a3526726bdb35bf99c23bdc" ], "country": [ "Austria" ], "originCommunity": [ "Universität Wien" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8036", "centralPackageRepositoryCount": 0 }, "nord": { "title": "Nord Programming Language", "appeared": 1974, "type": "pl", "reference": [ "http://gunkies.org/wiki/NORD_PL" ], "country": [ "Norway" ], "originCommunity": [ "Norsk Data" ], "wikipedia": { "example": [ "FUNC FUN1, FUN2\n\nFUN1: T := 1\nFUN2:\n\ncode here\n\nEND" ], "summary": "Nord Programming Language, commonly abbreviated NPL, was a programming language by the Norwegian minicomputer manufacturer Norsk Data. It shipped as a standard component of the operating system SINTRAN III. The language was also used to implement SINTRAN III. I.e. the core and file system of SINTRAN III was written in NPL. The NPL compiler was also written in NPL and some core applications was early on written in NPL until PLANC came and linker and other software was rewritten in PLANC. The NPL compiler was also special in that it did not produce object code as most compilers do. Instead it produced assembler code which then had to be assembled using the Norsk Data Assembler. The registers of the CPU were available in NPL as predefined variables. Thus you could write: X + T =: A and the compiler would generate: COPY SX DA RADD ST DA Functions could be declared with multiple entry points: FUNC FUN1, FUN2 FUN1: T := 1 FUN2: code here END FUN1 could be called to set T to 1 before falling into FUN2 or T could be set to something else and call FUN2. If T register specified which file handle to write to then either FUN1 could be called to always output to terminal or T could be specified to handle a file itself in T and call FUN2 to output to that file.", "pageId": 8295240, "created": 2006, "backlinksCount": 28, "revisionCount": 21, "dailyPageViews": 3, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Nord_Programming_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "normal-distribution-equation": { "title": "Normal Distribution Equation", "appeared": 1823, "type": "equation", "creators": [ "Carl Gauss" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Normal_distribution" } }, "northstar-basic": { "title": "NorthStar BASIC", "appeared": 1977, "type": "pl", "creators": [ "Charles A. Grant", "Mark Greenberg" ], "country": [ "United States" ], "originCommunity": [ "North Star Computers Inc" ], "wikipedia": { "related": [ "basic", "fortran", "atari-basic", "unix" ], "summary": "NorthStar BASIC was a dialect of the programming language BASIC originally provided for use on the NorthStar Horizon and NorthStar Advantage. The interpreter was written using only Intel 8080 instructions so that it could run also on custom systems. One notable difference with other dialects of BASIC of the time was the array-like way in which strings were addressed. For example, A$(13,17) in NorthStar BASIC corresponded to MID$(A$,13,5) in other dialects. This string addressing technique is analogous to the one used in Fortran, and was also used in HP-3000 Basic and Atari BASIC. Strings were allocated 10 bytes maximum length unless DIMensioned otherwise. It was still possible to use arrays of strings, but these were declared in two or more dimensions, for example DIM B$(10,50) created 11 strings (0-10) of maximum length 50 bytes. Input from the keyboard and output to the console and printers were treated in the same way as reading and writing to data files. Some other differences were that POKE became FILL, PEEK became EXAM, and INSTR became MATCH.Some other dialects of BASIC were created which were based on and inspired by NorthStar BASIC, such as Bazic (a rewrite of North Star BASIC taking advantage of the faster Zilog Z80 instructions), Megabasic and S.A.I.L.B.O.A.T. (a basic optimized for Z80 and X86 MS-DOS). Some of these were available for other hardware and operating systems, including Unix, CP/M and DOS.", "created": 2010, "backlinksCount": 3, "pageId": 26078944, "revisionCount": 17, "dailyPageViews": 2, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/NorthStar_BASIC" }, "centralPackageRepositoryCount": 0 }, "nosica": { "title": "Nosica", "appeared": 2002, "type": "pl", "creators": [ "David Jobet" ], "website": "http://nosicalanguage.free.fr", "documentation": [ "http://nosicalanguage.free.fr/?User%20documentation" ], "country": [ "France" ], "originCommunity": [ "https://sourceforge.net/p/nosica/discussion/" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Nosica" }, "centralPackageRepositoryCount": 0 }, "notation3": { "title": "Notation3", "appeared": 1998, "type": "dataNotation", "creators": [ "Tim Berners-Lee" ], "reference": [ "https://www.w3.org/DesignIssues/N3Resources" ], "aka": [ "n3" ], "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "supersetOf": [ "turtle" ], "related": [ "turtle", "rdf", "rdfa" ], "example": [ "@prefix dc: .\n\n\n dc:title \"Tony Benn\";\n dc:publisher \"Wikipedia\"." ], "wikipedia": { "summary": "Notation3, or N3 as it is more commonly known, is a shorthand non-XML serialization of Resource Description Framework models, designed with human-readability in mind: N3 is much more compact and readable than XML RDF notation. The format is being developed by Tim Berners-Lee and others from the Semantic Web community. A formalization of the logic underlying N3 was published by Berners-Lee and others in 2008.N3 has several features that go beyond a serialization for RDF models, such as support for RDF-based rules. Turtle is a simplified, RDF-only subset of N3.", "backlinksCount": 145, "pageId": 2906123, "dailyPageViews": 74, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Notation3" } }, "note": { "title": "Note", "appeared": 2012, "type": "dataNotation", "isDead": "true\nhttps://github.com/breck7/note", "isPublicDomain": true, "creators": [ "Breck Yunits" ], "description": "Note is a structured, human readable, concise language for encoding data.", "website": "https://github.com/breck7/note", "reference": [ "https://breckyunits.com/introducing-note.html" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/breck7/note/issues" ], "hasSemanticIndentation": { "example": "settings\n title Note", "value": true }, "example": [ "settings\n title Note" ], "githubRepo": { "firstCommit": 2012, "stars": 8, "forks": 1, "subscribers": 3, "created": 2012, "updated": 2017, "description": "This has been replaced by Space", "issues": 0, "url": "https://github.com/breck7/note" }, "isOpenSource": true }, "notepad-editor": { "title": "Microsoft Notepad", "appeared": 1983, "type": "editor", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "unix", "unicode", "utf-8", "ascii" ], "summary": "Notepad is a simple text editor for Microsoft Windows and a basic text-editing program which enables computer users to create documents. It was first released as a mouse-based MS-DOS program in 1983, and has been included in all versions of Microsoft Windows since Windows 1.0 in 1985.", "pageId": 143474, "created": 2002, "backlinksCount": 938, "revisionCount": 862, "dailyPageViews": 1881, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Microsoft_Notepad" }, "fileType": "na", "centralPackageRepositoryCount": 0 }, "notepad-plus-plus-editor": { "title": "Notepad++", "appeared": 2003, "type": "editor", "country": [ "United States" ], "originCommunity": [ "https://web.archive.org/web/20110407233803/http://sourceforge.net/projects/notepad-plus/develop/" ], "wikipedia": { "related": [ "mediawiki", "ia-32", "c", "java", "unix", "javascript", "actionscript", "ada", "asp", "assembly-language", "autoit", "bash", "batch", "csharp", "caml", "cmake", "coffeescript", "csound", "d", "erlang", "forth", "fortran", "freebasic", "haskell", "html", "ini", "inno-setup", "json", "kixtart", "latex", "lua", "makefile", "objective-c", "pascal", "perl", "php", "postscript", "powershell", "purebasic", "python", "r", "ruby", "rust", "scheme", "smalltalk", "sql", "swift", "tcl", "tex", "txt2tags", "visual-basic", "vhdl", "verilog", "xml", "yaml", "ascii", "utf-8", "regex" ], "summary": "Notepad++ is a text editor and source code editor for use with Microsoft Windows. It supports tabbed editing, which allows working with multiple open files in a single window. The project's name comes from the C increment operator. Notepad++ is distributed as free software. At first the project was hosted on SourceForge.net, from where it has been downloaded over 28 million times, and twice won the SourceForge Community Choice Award for Best Developer Tool. The project was hosted on TuxFamily from 2010 to 2015; since 2015 Notepad++ has been hosted on GitHub. Notepad++ uses the Scintilla editor component.", "pageId": 1329953, "created": 2009, "backlinksCount": 638, "revisionCount": 8, "dailyPageViews": 604, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Notepad++" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "noulith": { "title": "noulith", "appeared": 2022, "type": "pl", "creators": [ "Brian Chen" ], "description": "*slaps roof of [programming language]* this bad boy can fit so much [syntax sugar] into it", "website": "https://betaveros.github.io", "documentation": [ "https://github.com/betaveros/noulith/blob/main/README.md" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/betaveros/noulith/issues" ], "writtenIn": [ "rust" ], "githubRepo": { "firstCommit": 2022, "stars": 885, "forks": 14, "subscribers": 8, "created": 2022, "updated": 2023, "description": "*slaps roof of [programming language]* this bad boy can fit so much [syntax sugar] into it", "issues": 5, "url": "https://github.com/betaveros/noulith" }, "repoStats": { "firstCommit": 2022, "commits": 205, "committers": 5, "files": 21 }, "isOpenSource": true }, "nova-editor": { "title": "Nova", "appeared": 2019, "type": "editor", "website": "https://www.panic.com/nova/", "country": [ "United States" ], "originCommunity": [ "Panic, Inc" ] }, "noweb": { "title": "Noweb", "appeared": 1989, "type": "textMarkup", "creators": [ "Norman Ramsey" ], "website": "https://www.cs.tufts.edu/~nr/noweb/", "country": [ "United States" ], "originCommunity": [ "Tufts University" ], "related": [ "cweb" ], "example": [ "\\section{Hello world}\n\nToday I awoke and decided to write\nsome code, so I started to write Hello World in \\textsf C.\n\n<>=\n/*\n <>\n*/\n#include \n\nint main(int argc, char *argv[]) {\n printf(\"Hello World!\\n\");\n return 0;\n}\n@\n\\noindent \\ldots then I did the same in PHP.\n\n<>=\n>\n */\n echo \"Hello world!\\n\";\n?>\n@\n\\section{License}\nLater the same day some lawyer reminded me about licenses.\nSo, here it is:\n\n<>=\nThis work is placed in the public domain." ], "githubRepo": { "firstCommit": 1991, "stars": 177, "forks": 20, "subscribers": 18, "created": 2012, "updated": 2022, "description": "The noweb tool for literate programming", "issues": 6, "url": "https://github.com/nrnrnr/noweb" }, "repoStats": { "firstCommit": 1991, "commits": 335, "committers": 6, "files": 385 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Noweb" } }, "np": { "title": "np", "appeared": 2013, "type": "pl", "website": "http://np-lang.org", "webRepl": [ "http://np-lang.org/tutorial" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/Udo/np/issues" ], "domainName": { "registered": 2013, "name": "np-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n5390954|Show HN: a lexer, parser, interpreter and web runtime (np, a 5-weekend project)|http://np-lang.org/|2013-03-17 20:41:05 UTC|1363552865|Udo|44|122" }, "npl-lang": { "title": "NPL", "appeared": 1977, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Edinburgh", "Imperial College London" ], "hasPatternMatching": { "example": "", "value": true }, "wikipedia": { "summary": "NPL is a functional programming language with pattern matching designed by Rod Burstall and John Darlington in 1977. The language allows certain sets and logic constructs to appear on the right hand side of definitions, e.g. setofeven(X) <= <:x: x in X & even(x) :>The NPL interpreter evaluates the list of generators from left to right so conditions can mention any bound variables that occur to their left. These were known as set comprehensions. NPL eventually evolved into Hope but lost set comprehensions, which made a reappearance in the form of list comprehensions in later functional languages.", "backlinksCount": 9, "pageId": 948982, "dailyPageViews": 10, "appeared": 1977, "url": "https://en.wikipedia.org/wiki/NPL_(programming_language)" } }, "npl": { "title": "NPL", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ea0c28e0c80c8d3741001d3defc703af4a8370bb" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=446", "centralPackageRepositoryCount": 0 }, "npm-pm": { "title": "npm", "appeared": 2010, "type": "packageManager", "creators": [ "Isaac Z. Schlueter" ], "website": "http://npmjs.org", "country": [ "United States" ], "originCommunity": [ "npm, Inc" ], "domainName": { "registered": 2010, "awisRank": { "2022": 114891 }, "name": "npmjs.org" }, "githubRepo": { "firstCommit": 2009, "stars": 17403, "forks": 3234, "subscribers": 867, "created": 2009, "updated": 2022, "description": "This repository is moving to: https://github.com/npm/cli", "issues": 2167, "url": "https://github.com/npm/npm" }, "wikipedia": { "related": [ "javascript", "php", "perl", "json" ], "summary": "npm is a package manager for the JavaScript programming language. It is the default package manager for the JavaScript runtime environment Node.js. It consists of a command line client, also called npm, and an online database of public and paid-for private packages, called the npm registry. The registry is accessed via the client, and the available packages can be browsed and searched via the npm website. The package manager and the registry are managed by npm, Inc.", "pageId": 32102343, "created": 2011, "backlinksCount": 158, "revisionCount": 231, "dailyPageViews": 492, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Npm_(software)" }, "packageCount": 1029249, "packageInstallCount": 991954002030, "forLanguages": [ "javascript", "nodejs", "typescript" ], "twitter": "https://twitter.com/npmjs", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "npy": { "title": "npy", "appeared": 2008, "type": "binaryDataFormat", "description": "A simple format for saving numpy arrays to disk with the full information about them. The .npy format is the standard binary file format in NumPy for persisting a single arbitrary NumPy array on disk.", "reference": [ "https://docs.scipy.org/doc/numpy/reference/generated/numpy.lib.format.html#module-numpy.lib.format" ], "fileExtensions": [ "npy" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/numpy" ], "centralPackageRepositoryCount": 0 }, "nqc": { "title": "Not Quite C", "appeared": 2017, "type": "pl", "creators": [ "Nora Sandler" ], "standsFor": "Not Quite C", "country": [ "United States" ], "originCommunity": [ "https://github.com/nlsandler/nqcc/issues" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "githubRepo": { "firstCommit": 2017, "stars": 204, "forks": 11, "subscribers": 15, "created": 2017, "updated": 2022, "description": "A compiler for a tiny (but growing!) subset of C, written in OCaml.", "issues": 5, "url": "https://github.com/nlsandler/nqcc" }, "repoStats": { "firstCommit": 2017, "commits": 86, "committers": 3, "files": 116 }, "wikipedia": { "example": [ "task main () // Main program\n {\n SetPower(OUT_A, OUT_FULL); // Turn on motor A at 100% power.\n OnFor(OUT_A, 200); // Let the motor run for two seconds, and then turn it off.\n }" ], "related": [ "c", "linux" ], "summary": "Not Quite C (NQC) is a programming language, application programming interface (API), and native bytecode compiler toolkit for the Lego Mindstorms, Cybermaster and LEGO Spybotics systems. It is based primarily on the C language but has specific limitations, such as the maximum number of subroutines and variables allowed, which differ depending on the version of firmware the RCX has. The language was invented by David Baum. He has released two books on the subject.", "pageId": 969174, "created": 2004, "backlinksCount": 9, "revisionCount": 60, "dailyPageViews": 11, "url": "https://en.wikipedia.org/wiki/Not_Quite_C" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "nrl": { "title": "Namespace Routing Language", "appeared": 2003, "type": "xmlFormat", "reference": [ "https://relaxng.org/jclark/nrl.html" ], "aka": [ "nrl" ], "country": [ "Thailand" ], "originCommunity": [ "Thai Open Source Software Center Ltd" ], "example": [ "\n \n \n \n \n \n \n \n" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Namespace_Routing_Language" } }, "nroff": { "title": "nroff", "appeared": 1972, "type": "textMarkup", "creators": [ "Joe Ossanna" ], "originCommunity": [ "AT&T Bell Laboratories" ], "related": [ "troff", "groff", "roff" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Nroff" } }, "ns-basic": { "title": "NS Basic", "appeared": 1994, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "NSB Corporation" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "// in JavaScript\nOKButton.onclick = function() {\n NSB.MsgBox(\"Hello World\");\n}" ], "related": [ "ios", "android", "visual-basic", "javascript", "hypercard" ], "summary": "NS Basic is a family of development tools for the mobile devices developed and commercially marketed by NS BASIC Corporation in Toronto, Ontario, Canada for iOS, Android, BlackBerry OS, WebOS, Newton OS, Palm OS, Windows CE, Windows Mobile and Microsoft Windows.", "created": 2008, "backlinksCount": 90, "pageId": 19160625, "revisionCount": 154, "dailyPageViews": 17, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/NS_Basic" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "nsis": { "title": "NSIS", "appeared": 2001, "type": "pl", "website": "http://nsis.sourceforge.net", "standsFor": "Nullsoft Software Install Script", "country": [ "United States" ], "originCommunity": [ "Nullsoft, Inc" ], "domainName": { "name": "nsis.sourceforge.net" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "wikipedia": { "example": [ "# Modern UI example script\n!include MUI.nsh\nName \"Example 2\"\nOutFile \"Example2.exe\"\n!insertmacro MUI_PAGE_WELCOME\n!insertmacro MUI_PAGE_LICENSE \"license.rtf\"\n!insertmacro MUI_PAGE_DIRECTORY\n!insertmacro MUI_PAGE_COMPONENTS\n!insertmacro MUI_PAGE_INSTFILES\n!insertmacro MUI_PAGE_FINISH\n!insertmacro MUI_LANGUAGE \"English\"\n!insertmacro MUI_LANGUAGE \"German\"\n!insertmacro MUI_LANGUAGE \"French\"\nSection \"Extract makensis\"\n SetOutPath $INSTDIR\n File ..\\makensis.exe\nSectionEnd" ], "related": [ "c", "eclipse-editor", "delphi", "visual-studio-editor", "python" ], "summary": "Nullsoft Scriptable Install System (NSIS) is a script-driven installer authoring tool for Microsoft Windows with minimal overhead backed by Nullsoft, the creators of Winamp. NSIS is released under a combination of free software licenses, primarily the zlib license. It has become a widely used alternative to commercial proprietary products like InstallShield, with users including Amazon.com, Dropbox, Ubisoft, FL Studio, BitTorrent, and McAfee.", "pageId": 307436, "dailyPageViews": 97, "created": 2003, "backlinksCount": 103, "revisionCount": 476, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Nullsoft_Scriptable_Install_System" }, "githubLanguage": { "fileExtensions": [ "nsi", "nsh" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "nsis", "codemirrorMimeType": "text/x-nsis", "tmScope": "source.nsis", "repos": 4747, "id": "NSIS" }, "githubBigQuery": { "repos": 8095, "users": 7167, "id": "NSIS" }, "codeMirror": "nsis", "pygmentsHighlighter": { "filename": "installers.py", "fileExtensions": [ "nsi", "nsh" ], "id": "NSIS" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2016, "committerCount": 12, "commitCount": 75, "sampleCount": 2, "example": [ "; ---------------------\n; x64.nsh\n; ---------------------\n;\n; A few simple macros to handle installations on x64 machines.\n;\n; RunningX64 checks if the installer is running on x64.\n;\n; ${If} ${RunningX64}\n; MessageBox MB_OK \"running on x64\"\n; ${EndIf}\n;\n; DisableX64FSRedirection disables file system redirection.\n; EnableX64FSRedirection enables file system redirection.\n;\n; SetOutPath $SYSDIR\n; ${DisableX64FSRedirection}\n; File some.dll # extracts to C:\\Windows\\System32\n; ${EnableX64FSRedirection}\n; File some.dll # extracts to C:\\Windows\\SysWOW64\n;\n\n!ifndef ___X64__NSH___\n!define ___X64__NSH___\n\n!include LogicLib.nsh\n\n!macro _RunningX64 _a _b _t _f\n !insertmacro _LOGICLIB_TEMP\n System::Call kernel32::GetCurrentProcess()i.s\n System::Call kernel32::IsWow64Process(is,*i.s)\n Pop $_LOGICLIB_TEMP\n !insertmacro _!= $_LOGICLIB_TEMP 0 `${_t}` `${_f}`\n!macroend\n\n!define RunningX64 `\"\" RunningX64 \"\"`\n\n!macro DisableX64FSRedirection\n\n System::Call kernel32::Wow64EnableWow64FsRedirection(i0)\n\n!macroend\n\n!define DisableX64FSRedirection \"!insertmacro DisableX64FSRedirection\"\n\n!macro EnableX64FSRedirection\n\n System::Call kernel32::Wow64EnableWow64FsRedirection(i1)\n\n!macroend\n\n!define EnableX64FSRedirection \"!insertmacro EnableX64FSRedirection\"\n\n!endif # !___X64__NSH___\n" ], "url": "https://github.com/github-linguist/NSIS" }, "helloWorldCollection": [ "; Hello World in Nullsoft Software Install Script (NSIS)\n\nCaption \"Hello World!\"\nOutFile \".\\HelloWorld.exe\"\nSilentInstall silent\n\nSection \"\"\n MessageBox MB_OK \"Hello World!\"\nSectionEnd\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:NSIS", "tiobe": { "id": "NSIS" }, "twitter": "https://twitter.com/nsis_tweets", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "nsl": { "title": "NSL", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2f1648fd377bc98a8840f83c5b29a485a813e248" ], "country": [ "United States" ], "originCommunity": [ "University of South Florida" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4012", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "ntfs": { "title": "New Technology File System", "appeared": 1993, "type": "filesystem", "standsFor": "New Technology File System", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "fat", "linux", "powershell", "freebsd" ], "summary": "NTFS (New Technology File System) is a proprietary file system developed by Microsoft. Starting with Windows NT 3.1, it is the default file system of the Windows NT family.NTFS has several technical improvements over the file systems that it superseded – File Allocation Table (FAT) and High Performance File System (HPFS) – such as improved support for metadata and advanced data structures to improve performance, reliability, and disk space use. Additional extensions are a more elaborate security system based on access control lists (ACLs) and file system journaling. NTFS is supported in other desktop and server operating systems as well. Linux and BSD have a free and open-source NTFS driver, called NTFS-3G, with both read and write functionality. macOS comes with read-only support for NTFS; its disabled-by-default write support for NTFS is unstable.", "pageId": 39184, "created": 2002, "backlinksCount": 1092, "revisionCount": 2371, "dailyPageViews": 900, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/NTFS" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ntp": { "title": "Network Time Protocol", "appeared": 1981, "type": "protocol", "standsFor": "Network Time Protocol", "country": [ "United States" ], "originCommunity": [ "University of Delaware" ], "wikipedia": { "summary": "The Network Time Protocol (NTP) is a networking protocol for clock synchronization between computer systems over packet-switched, variable-latency data networks. In operation since before 1985, NTP is one of the oldest Internet protocols in current use. NTP was designed by David L. Mills of the University of Delaware. NTP is intended to synchronize all participating computers to within a few milliseconds of Coordinated Universal Time (UTC). It uses the intersection algorithm, a modified version of Marzullo's algorithm, to select accurate time servers and is designed to mitigate the effects of variable network latency. NTP can usually maintain time to within tens of milliseconds over the public Internet, and can achieve better than one millisecond accuracy in local area networks under ideal conditions. Asymmetric routes and network congestion can cause errors of 100 ms or more.The protocol is usually described in terms of a client-server model, but can as easily be used in peer-to-peer relationships where both peers consider the other to be a potential time source. Implementations send and receive timestamps using the User Datagram Protocol (UDP) on port number 123. They can also use broadcasting or multicasting, where clients passively listen to time updates after an initial round-trip calibrating exchange. NTP supplies a warning of any impending leap second adjustment, but no information about local time zones or daylight saving time is transmitted.The current protocol is version 4 (NTPv4), which is a proposed standard as documented in RFC 5905. It is backward compatible with version 3, specified in RFC 1305.", "backlinksCount": 507, "pageId": 159886, "dailyPageViews": 1441, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Network_Time_Protocol" }, "isbndb": "" }, "nu-prolog": { "title": "NU-Prolog", "appeared": 1988, "type": "pl", "website": "https://people.eng.unimelb.edu.au/lee/papers/eq", "reference": [ "https://semanticscholar.org/paper/c487bf45def79989d28ea8218914bfa93492883b", "https://people.eng.unimelb.edu.au/lee", "https://lee-naish.github.io" ], "country": [ "Australia" ], "originCommunity": [ "University of Melbourne" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1412", "centralPackageRepositoryCount": 0, "isbndb": "" }, "nu": { "title": "Nu", "appeared": 2007, "type": "pl", "creators": [ "Tim Burks" ], "country": [ "United States and Germany" ], "originCommunity": [ "https://github.com/programming-nu" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "puts" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "(unless @prefix\n (set @prefix \n \"#{((((NSProcessInfo processInfo) arguments) 0) dirName)}..\"))\n\n(unless @icon_files \n (set @icon_files \n (array \"#{@prefix}/share/nu/resources/nu.icns\")))" ], "related": [ "x86-isa", "lisp", "objective-c", "ruby", "linux", "f-script" ], "summary": "Nu is an interpreted object-oriented programming language, with a Lisp-like syntax, created by Tim Burks as an alternative scripting language to program OS X through its Cocoa application programming interface (API). Implementations also exist for iPhone and Linux. The language was first announced at C4, a conference for indie Mac developers held in August 2007.", "pageId": 17151577, "created": 2008, "backlinksCount": 13, "revisionCount": 55, "dailyPageViews": 14, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Nu_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "nu" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "Nukefile" ], "interpreters": [ "nush" ], "aceMode": "scheme", "codemirrorMode": "scheme", "codemirrorMimeType": "text/x-scheme", "tmScope": "source.nu", "aliases": [ "nush" ], "repos": 215, "id": "Nu" }, "githubBigQuery": { "repos": 375, "users": 331, "id": "Nu" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2017, "committerCount": 7, "commitCount": 107, "sampleCount": 2, "example": [ "#!/usr/bin/env nush\n(puts \"Hello\")\n" ], "url": "https://github.com/jsallis/nu.tmbundle" }, "leachim6": { "filepath": "n/Nu.nu", "fileExtensions": [ "nu" ], "example": [ "(puts \"Hello World\")\n" ], "id": "Nu" }, "fileType": "text", "wordRank": 7528, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "nua-prolog": { "title": "NUA-Prolog", "appeared": 1991, "type": "pl", "creators": [ "Douglas Frank Palmer" ], "reference": [ "https://semanticscholar.org/paper/b595b50b02c5f72765d55993d13733931118b541" ], "country": [ "Australia" ], "originCommunity": [ "University of Melbourne" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4097", "centralPackageRepositoryCount": 0 }, "nuget-pm": { "title": "NuGet", "appeared": 2010, "type": "packageManager", "website": "https://www.nuget.org/", "country": [ "United States" ], "originCommunity": [ "Outercurve Foundation" ], "domainName": { "registered": 2010, "awisRank": { "2022": 9008 }, "name": "nuget.org" }, "wikipedia": { "dailyPageViews": 230, "url": "https://en.wikipedia.org/wiki/NuGet" }, "packageCount": 141524, "packageInstallCount": 15743156044, "forLanguages": [ "csharp", "f-sharp", "visual-basic.net" ], "centralPackageRepositoryCount": 0 }, "nul-lang": { "title": "Navigational User's Language", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2e8ff22c4958300f63709502f87f5752e78dde5a" ], "aka": [ "nul" ], "country": [ "Canada" ], "originCommunity": [ "institut d'Informatique" ] }, "nulan": { "title": "nulan", "appeared": 2012, "type": "pl", "webRepl": [ "https://pauan.github.io/nulan/doc/tutorial.html" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/Pauan/nulan/issues" ], "githubRepo": { "firstCommit": 2012, "stars": 46, "forks": 1, "subscribers": 9, "created": 2012, "updated": 2021, "description": "Purely functional statically typed Lisp which compiles to JavaScript", "issues": 1, "url": "https://github.com/Pauan/nulan" }, "repoStats": { "firstCommit": 2012, "commits": 455, "committers": 2, "files": 167 } }, "numba": { "title": "Numba", "appeared": 2012, "type": "compiler", "creators": [ "Travis E. Oliphant" ], "description": "Numba is an open source JIT compiler that translates a subset of Python and NumPy code into fast machine code.", "website": "http://numba.pydata.org/", "country": [ "United States and United Kingdom and Germany" ], "originCommunity": [ "https://github.com/numba" ], "example": [ "from numba import njit\nimport random\n\n@njit\ndef monte_carlo_pi(nsamples):\n acc = 0\n for i in range(nsamples):\n x = random.random()\n y = random.random()\n if (x ** 2 + y ** 2) < 1.0:\n acc += 1\n return 4.0 * acc / nsamples" ], "githubRepo": { "firstCommit": 2012, "stars": 7727, "forks": 943, "subscribers": 207, "created": 2012, "updated": 2022, "description": "NumPy aware dynamic Python compiler using LLVM", "issues": 1548, "url": "https://github.com/numba/numba" } }, "numbers-app": { "title": "Numbers", "appeared": 2007, "type": "application", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "summary": "Numbers is a spreadsheet application developed by Apple Inc. as part of the iWork productivity suite alongside Keynote and Pages. Numbers is available for iOS, and macOS High Sierra or newer. Numbers 1.0 on OS X was announced on 7 August 2007, making it the newest application in the iWork suite. The iPad version was released on 27 January 2010. The app was later updated to support iPhone and iPod Touch. Numbers uses a free-form \"canvas\" approach that demotes tables to one of many different media types placed on a page. Other media, like charts, graphics and text, are treated as peers. In comparison, traditional spreadsheets like Microsoft Excel use the table as the primary container, with other media placed within the table. Numbers also includes features from the seminal Lotus Improv, notably the use of formulas based on ranges rather than cells. However, it implements these using traditional spreadsheet concepts, as opposed to Improv's use of multidimensional databases. Numbers also includes numerous stylistic improvements in an effort to improve the visual appearance of spreadsheets. At its introductory demonstration, Steve Jobs pitched a more usable interface and better control over the appearance and presentation of tables of data.", "backlinksCount": 495, "pageId": 12665211, "dailyPageViews": 147, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Numbers_(spreadsheet)" } }, "numerica": { "title": "Numerica", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/148689502f77b33ea32d93d2cc8174bdebe1cef9" ], "country": [ "United States" ], "originCommunity": [ "Brown University", "University of Connecticut" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5770", "centralPackageRepositoryCount": 0 }, "numpad": { "title": "NumPad", "appeared": 2022, "type": "editor", "website": "https://numpad.io/", "reference": [ "https://news.ycombinator.com/item?id=32493946" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://numpad.io/about/" ], "related": [ "soulver" ], "example": [ "3 × 3\n120 + 30\n100 EUR in USD\n30% of 700\n$30/day is what per year" ] }, "numpy": { "title": "NumPy", "appeared": 1995, "type": "library", "creators": [ "Travis Oliphant" ], "website": "http://www.numpy.org/", "aka": [ "Numeric" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/numpy" ], "domainName": { "registered": 2000, "awisRank": { "2022": 5924 }, "name": "numpy.org" }, "writtenIn": [ "python", "c" ], "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "wikipedia": { "example": [ ">>> # # # Pure iterative Python # # #\n>>> points = [[9,2,8],[4,7,2],[3,4,4],[5,6,9],[5,0,7],[8,2,7],[0,3,2],[7,3,0],[6,1,1],[2,9,6]]\n>>> qPoint = [4,5,3]\n>>> minIdx = -1\n>>> minDist = -1\n>>> for idx, point in enumerate(points): # iterate over all points\n dist = sum([(dp-dq)**2 for dp,dq in zip(point,qPoint)])**0.5 # compute the euclidean distance for each point to q\n if dist < minDist or minDist < 0: # if necessary, update minimum distance and index of the corresponding point\n minDist = dist\n minIdx = idx\n\n>>> print 'Nearest point to q: ', points[minIdx]\nNearest point to q: [3, 4, 4]\n\n>>> # # # Equivalent NumPy vectorization # # #\n>>> import numpy as np\n>>> points = np.array([[9,2,8],[4,7,2],[3,4,4],[5,6,9],[5,0,7],[8,2,7],[0,3,2],[7,3,0],[6,1,1],[2,9,6]])\n>>> qPoint = np.array([4,5,3])\n>>> minIdx = np.argmin(np.linalg.norm(points-qPoint,axis=1)) # compute all euclidean distances at once and return the index of the smallest one\n>>> print 'Nearest point to q: ', points[minIdx]\nNearest point to q: [3 4 4]" ], "related": [ "python", "c", "jython", "scipy", "matlab", "simulink", "matplotlib", "cython" ], "summary": "NumPy (pronounced (NUM-py) or sometimes (NUM-pee)) is a library for the Python programming language, adding support for large, multi-dimensional arrays and matrices, along with a large collection of high-level mathematical functions to operate on these arrays. The ancestor of NumPy, Numeric, was originally created by Jim Hugunin with contributions from several other developers. In 2005, Travis Oliphant created NumPy by incorporating features of the competing Numarray into Numeric, with extensive modifications. NumPy is open-source software and has many contributors.", "pageId": 381782, "dailyPageViews": 427, "created": 2003, "backlinksCount": 108, "revisionCount": 379, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/NumPy" }, "githubLanguage": { "fileExtensions": [ "numpy", "numpyw", "numsc" ], "trendingProjectsCount": 0, "type": "programming", "group": "Python", "aceMode": "text", "codemirrorMode": "python", "codemirrorMimeType": "text/x-python", "tmScope": "none", "id": "NumPy" }, "pygmentsHighlighter": { "filename": "python.py", "id": "NumPy" }, "twitter": "https://twitter.com/numpy_team", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSciPy and NumPy: An Overview for Developers|2012|Eli Bressert|19175991|2.96|47|10" }, "nuprl": { "title": "Nuprl", "appeared": 1984, "type": "pl", "creators": [ "Robert Lee" ], "aka": [ "FDL" ], "country": [ "United States" ], "originCommunity": [ "Cornell University" ], "wikipedia": { "summary": "Nuprl is a proof development system, providing computer-mediated analysis and proofs of formal mathematical statements, and tools for software verification and optimization. Originally developed in the 1980s by Robert Lee Constable and others, the system is now maintained by the PRL Project at Cornell University. The currently supported version, Nuprl 5, is also known as FDL (Formal Digital Library). Nuprl functions as an automated theorem proving system and can also be used to provide proof assistance.", "backlinksCount": 13, "pageId": 45609427, "dailyPageViews": 6, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Nuprl" } }, "nushell": { "title": "Nushell", "appeared": 2019, "type": "pl", "creators": [ "Yehuda Katz" ], "website": "https://www.nushell.sh/", "country": [ "Ecuador" ], "originCommunity": [ "https://github.com/nushell" ], "githubRepo": { "firstCommit": 2019, "stars": 21115, "forks": 1035, "subscribers": 160, "created": 2019, "updated": 2022, "description": "A new type of shell", "issues": 472, "url": "https://github.com/nushell/nushell" }, "repoStats": { "firstCommit": 2019, "commits": 7183, "committers": 553, "files": 1363 } }, "nut": { "title": "NUT", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/032d0a3ee326b06e971c56b1858a8914a8d161c9" ], "country": [ "Sweden" ], "originCommunity": [ "Royal Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4011", "wordRank": 8494, "centralPackageRepositoryCount": 0 }, "nuua": { "title": "Nuua", "appeared": 2018, "type": "pl", "website": "https://nuua.io", "country": [ "Spain" ], "originCommunity": [ "https://github.com/nuua-io" ], "domainName": { "name": "nuua.io" }, "example": [ "class Triangle {\n b: float\n h: float\n fun area(): float -> (self.b * self.h) / 2.0\n}\n\nfun main(argv: [string]) {\n t := Triangle!{b: 10.0, h: 5.0}\n print \"The area is: \" + t.area() as string\n}" ], "githubRepo": { "firstCommit": 2018, "stars": 37, "forks": 2, "subscribers": 3, "created": 2018, "updated": 2022, "description": "The Nuua Programming Language - A zero dependencies, high level strong typed, interpreted language built on the top of modern C++17.", "issues": 0, "url": "https://github.com/nuua-io/Nuua" }, "repoStats": { "firstCommit": 2018, "commits": 116, "committers": 2, "files": 103 } }, "nvdl": { "title": "Namespace-based Validation Dispatching Language", "appeared": 2006, "type": "xmlFormat", "standsFor": "Namespace-based Validation Dispatching Language", "country": [ "United States and Canada" ], "originCommunity": [ "National Security Complex", "Crane Softwrights Ltd" ], "example": [ "\n \n \n \n \n \n \n \n \n \n" ], "wikipedia": { "summary": "Namespace-based Validation Dispatching Language (NVDL) is an XML schema language for validating XML documents that integrate with multiple namespaces. It is an ISO/IEC standard, and it is Part 4 of the DSDL schema specification. Much of the work on NVDL is based on the older Namespace Routing Language.", "backlinksCount": 11, "pageId": 14633662, "dailyPageViews": 5, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Namespace-based_Validation_Dispatching_Language" }, "isbndb": "" }, "nwscript": { "title": "NWScript", "appeared": 2004, "type": "pl", "originCommunity": [ "BioWare" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "void main()\n{\n SendMessageToPC(GetEnteringObject(), \"Hello world\");\n}" ], "related": [ "linux", "c", "java" ], "summary": "NWScript is the scripting language developed by BioWare for the role-playing video game Neverwinter Nights. It is based on the C programming language and is implemented in the Aurora toolset. Neverscript, an open source 3rd party editor, has been created for the Mac OS X and Linux versions of NWN because the Aurora toolset has not been ported to those platforms. NWScript is also used in the video games The Witcher, Star Wars: Knights of the Old Republic and Star Wars: Knights of the Old Republic II The Sith Lords, which use the Odyssey Engine. Neverwinter Nights 2, the sequel to the original NWN, features a modified version of this scripting language.", "pageId": 853032, "created": 2004, "backlinksCount": 87, "revisionCount": 100, "dailyPageViews": 11, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/NWScript" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "nss" ], "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-csrc", "tmScope": "source.c.nwscript", "repos": 78, "id": "NWScript" }, "githubBigQuery": { "repos": 1, "users": 1, "id": "NWScript" }, "leachim6": { "filepath": "n/NWScript.nss", "fileExtensions": [ "nss" ], "example": [ "// Place in the OnClientEnter event of the module's properties\n{\n SendMessageToPC(GetEnteringObject(), \"Hello World\");\n}\n" ], "id": "NWScript" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "nxc": { "title": "Not eXactly C", "appeared": 2006, "type": "pl", "reference": [ "https://www.hispabrickmagazine.com/pdfs/HBM009_EN/HBM009_EN-32-33.pdf" ], "country": [ "United States" ], "originCommunity": [ "https://sourceforge.net/p/bricxcc/_list/tickets" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "TextOut" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "task main() //sets a new task. main() is compulsory\n {\n OnFwd(OUT_BC,75); //ask the motors connected to ports B and C to move forward at a power of 75.\n Wait(5000); //wait for 5 seconds [the value is in milliseconds](note that 1000 = 1 second)\n Off(OUT_BC); //off the motors connected to ports B and C\n }" ], "related": [ "assembly-language", "c", "nqc" ], "summary": "Not eXactly C, or NXC, is a high-level programming language for the Lego Mindstorms NXT designed by John Hansen in 2006. NXC, which is short for Not eXactly C, is based on Next Byte Codes, an assembly language. NXC has a syntax like C. The IDE for NXC is the Bricx Command Center. The NXC compiler is available under the Mozilla Public License. A sample code is as shown below:", "pageId": 16826148, "created": 2008, "backlinksCount": 13, "revisionCount": 50, "dailyPageViews": 21, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Not_eXactly_C" }, "leachim6": { "filepath": "n/NXC.nxc", "fileExtensions": [ "nxc" ], "example": [ "task main()\n{\n TextOut(0, LCD_LINE1, \"Hello World\");\n}\n" ], "id": "NXC" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "nxt-g": { "title": "NXT-G", "appeared": 2006, "type": "pl", "country": [ "Denmark" ], "originCommunity": [ "The Lego Group" ], "wikipedia": { "related": [ "atmel-avr", "labview", "csharp", "nxc", "nqc", "assembly-language", "c", "robomind", "java", "matlab", "simulink", "ravenscar-profile", "ruby", "haskell", "python", "ch", "perl", "ada", "arduino" ], "summary": "LEGO Mindstorms NXT is a programmable robotics kit released by Lego in late July 2006. It replaced the first-generation Lego Mindstorms kit, which was called the Robotics Invention System. The base kit ships in two versions: the Retail Version (set #8527) and the Education Base Set (set #9797). It comes with the NXT-G programming software, or optionally LabVIEW for Lego Mindstorms. A variety of unofficial languages exist, such as NXC, NBC, leJOS NXJ, and RobotC. The second generation of the set, the Lego Mindstorms NXT 2.0, was released on August 1, 2009, featuring a color sensor and other upgraded capabilities. The third generation, the EV3, was released in September 2013.", "pageId": 5994421, "dailyPageViews": 3, "created": 2011, "backlinksCount": 161, "revisionCount": 1, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/NXT-G" }, "tiobe": { "id": "NXT-G" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nLego Mindstorms NXT-G Programming Guide|2007|James Floyd Kelly|998898|3.85|20|2\nThe Art of LEGO MINDSTORMS NXT-G Programming|2010|Terry Griffin|13156651|3.95|19|0" }, "nydp": { "title": "nydp", "appeared": 2014, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://github.com/conanite/nydp/issues" ], "example": [ "(def pre-compile (expr)\n (map pre-compile\n (if (mac-names (car expr))\n (pre-compile (mac-expand (car expr) (cdr expr)))\n expr)))\n(mac yoyo (thing) `(do-yoyo ,thing))" ], "githubRepo": { "firstCommit": 2014, "stars": 8, "subscribers": 3, "created": 2014, "updated": 2021, "description": "nydp - a modern, more dangerous kind of lisp", "forks": 0, "issues": 0, "url": "https://github.com/conanite/nydp" }, "repoStats": { "firstCommit": 2014, "commits": 968, "committers": 2, "files": 214 } }, "nylo": { "title": "nylo", "appeared": 2017, "type": "pl", "description": "Nylo: any task in one line of code", "website": "http://veggero.altervista.org/nylo.html", "country": [ "Italy" ], "originCommunity": [ "https://github.com/veggero/nylo/issues" ], "githubRepo": { "firstCommit": 2017, "stars": 21, "forks": 3, "subscribers": 5, "created": 2017, "updated": 2021, "description": "Nylo's programming language interpreter.", "issues": 0, "url": "https://github.com/veggero/nylo" }, "repoStats": { "firstCommit": 2017, "commits": 390, "committers": 9, "files": 13 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "nymph": { "title": "Nymph", "appeared": 2017, "type": "pl", "creators": [ "Brandon Barber" ], "fileExtensions": [ "n" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/maelswarm/nymph/issues" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "printf" ] ], "example": [ "#include \n#include \n\nclass Mammal {\n\n + int population = 0; // Class Variable (+)\n - int height = 0, weight = 100; // Object Variable (-)\n\n + Mammal *init(int height, int weight) { // Class Method (+) Constructor\n this->height = height;\n this->weight = weight;\n Mammal->population++;\n return this;\n }\n\n - void print() { // Object Method (-)\n printf(\"print instance properties...\\n\");\n }\n}" ], "githubRepo": { "firstCommit": 2017, "stars": 173, "forks": 6, "subscribers": 6, "created": 2017, "updated": 2022, "description": "🧚 A slightly different version of C.", "issues": 0, "url": "https://github.com/maelswarm/nymph" }, "repoStats": { "firstCommit": 2017, "commits": 238, "committers": 7, "files": 16 } }, "nyquist": { "title": "Nyquist", "appeared": 1997, "type": "pl", "creators": [ "Roger Dannenberg" ], "reference": [ "https://semanticscholar.org/paper/318380e3ddd56afe7eccc3cfeeefbb0ffd7ac657" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "wikipedia": { "summary": "Nyquist is a programming language for sound synthesis and analysis based on the Lisp programming language. It is an extension of the XLISP dialect of Lisp, and is named after Harry Nyquist. ", "url": "https://en.wikipedia.org/wiki/Nyquist_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Nyquist", "hopl": "https://hopl.info/showlanguage.prx?exp=4076", "centralPackageRepositoryCount": 0 }, "o-matrix": { "title": "O-Matrix", "appeared": 1994, "type": "pl", "description": "O-Matrix is a matrix programming language for mathematics, engineering, science, and financial analysis, marketed by Harmonic Software. The language is designed for use in high-performance computing.", "country": [ "United States" ], "originCommunity": [ "Harmonic Software Inc" ], "wikipedia": { "related": [ "matlab" ], "summary": "O-Matrix is a matrix programming language for mathematics, engineering, science, and financial analysis, marketed by Harmonic Software. The language is designed for use in high-performance computing. O-Matrix provides an integrated development environment and a matrix-based scripting language. The environment includes mathematical, statistical, engineering and visualization functions. The set of analysis functions is designed for development of complex, computationally intensive scientific, mathematical and engineering applications. The integrated environment provides a mode that is largely compatible with version 4 of the MATLAB language in the commercial product from MathWorks. Certain features of MATLAB, such as non-numeric data types (structures, cell arrays and objects), error handling with try/catch, and nested and anonymous functions, are missing in O-Matrix. The O-Matrix environment includes a virtual machine of the O-Matrix language to enable re-distribution of applications.", "backlinksCount": 8, "pageId": 4492598, "created": 2006, "revisionCount": 28, "dailyPageViews": 7, "url": "https://en.wikipedia.org/wiki/O-Matrix" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "o-xml": { "title": "o:XML", "appeared": 2002, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "https://web.archive.org/web/20190210195527/http://www.pingdynasty.com/" ], "wikipedia": { "related": [ "xml" ], "summary": "o:XML is an open source, dynamically typed, general-purpose object-oriented programming language based on XML-syntax. It has threads, exception handling, regular expressions and namespaces. Additionally o:XML has an expression language very similar to XPath that allows functions to be invoked on nodes and node sets.", "pageId": 851815, "created": 2004, "backlinksCount": 4, "revisionCount": 37, "dailyPageViews": 4, "url": "https://en.wikipedia.org/wiki/O:XML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8337", "fileType": "text", "centralPackageRepositoryCount": 0 }, "o": { "title": "O", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7f3deda8653959368b739f4b5f969893351775d4" ], "country": [ "France and United States" ], "originCommunity": [ "GIP Altair group", "Université de Paris-Sud", "Brown University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2915", "wordRank": 269, "centralPackageRepositoryCount": 0 }, "o2": { "title": "o2", "appeared": 1989, "type": "pl", "description": "Database programming language.", "reference": [ "https://pdfs.semanticscholar.org/19bb/07b76a8b0dd867db5a1f6237d19458fec311.pdf?_ga=2.74848722.1732224894.1541658055-1663431151.1540068998" ], "country": [ "France" ], "originCommunity": [ "GIP Altair Group" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "o42a": { "title": "o42a", "appeared": 2010, "type": "pl", "creators": [ "Ruslan Lopatin" ], "description": "o42a is a high-level general purpose programming language. It is: compiled, statically-typed, prototype-based, logic-driven, and primarily declarative, while the imperative programming style is also supported. A program written in o42a is closer to natural English text than one written in any C-like programming language. The language is designed with programming productivity and code maintainability as main priorities. This achieved by powerful, yet restrained, semantics, and expressive and natural syntax.", "website": "http://o42a.org/", "reference": [ "https://freshcode.club/projects/o42a", "https://dev.to/surol", "https://web.archive.org/web/20180909202101/http://o42a.org" ], "country": [ "Russia" ], "domainName": { "name": "o42a.org" }, "example": [ "Use namespace 'Console'\n@Main (\n Print \"Hello, World!\" nl\n)" ] }, "oak": { "title": "Oak", "appeared": 1991, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Sun Microsystems" ], "wikipedia": { "related": [ "java" ], "summary": "Oak is a discontinued programming language created by James Gosling in 1991, initially for Sun Microsystems' set-top box project. The language later evolved to become Java. The name Oak was used by Gosling after an oak tree that stood outside his office.", "pageId": 16840885, "created": 2008, "backlinksCount": 17, "revisionCount": 83, "dailyPageViews": 61, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Oak_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6802", "fileType": "text", "wordRank": 3619, "centralPackageRepositoryCount": 0 }, "oaklisp": { "title": "Oaklisp", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9ff0f14de60543923c8f9437edea50298d0ec73e" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1246", "centralPackageRepositoryCount": 0 }, "oasis-operating-system": { "title": "oasis-operating-system", "appeared": 1977, "type": "os", "description": "The OASIS operating system was originally developed and distributed in 1977 by Phase One Systems of Oakland, California (President Howard Sidorsky). OASIS was developed for the Z80 processor and was the first multi-user operating system for 8-bit microprocessor based computers (Z-80 from Zilog). \"OASIS\" was a backronym for \"Online Application System Interactive Software\".", "reference": [ "https://en.wikipedia.org/wiki/THEOS#OASIS" ], "country": [ "United States" ], "originCommunity": [ "Phase One Systems" ], "centralPackageRepositoryCount": 0 }, "oasis": { "title": "OASIS", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/be0134cd242a68f9d16f9590851ca67947127831" ], "country": [ "Denmark" ], "originCommunity": [ "Aarhus University" ], "tryItOnline": "oasis", "hopl": "https://hopl.info/showlanguage.prx?exp=2830", "wordRank": 6544, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2018|The Museum of Modern Art, New York|Oasis in the City: The Abby Aldrich Rockefeller Sculpture Garden at The Museum of Modern Art|Reed, Peter and Silver-Kohn, Romy and Bajac, Quentin and Temkin, Ann|9780870709074\n2015|AuthorHouse|Blossoms of Light: An Oasis for the Soul|Moore, Iris Arla|9781504957878" }, "oberon-2": { "title": "Oberon-2", "appeared": 1991, "type": "pl", "creators": [ "Niklaus Wirth", "Hanspeter Mössenböck" ], "reference": [ "https://semanticscholar.org/paper/0279ae521a3f0c16e53259cf62f83739931fbc50", "https://dl.acm.org/doi/pdf/10.1145/157352.157355" ], "country": [ "Switzerland" ], "originCommunity": [ "Eidgenössische Technische Hochschule Zürich" ], "supersetOf": [ "oberon" ], "hasComments": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Out.String" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "Module = MODULE ident \";\" [ImportList] DeclSeq [BEGIN StatementSeq] END ident \".\".\nImportList = IMPORT [ident \":=\"] ident {\",\" [ident \":=\"] ident} \";\".\nDeclSeq = { CONST {ConstDecl \";\" } | TYPE {TypeDecl \";\"} | VAR {VarDecl \";\"}} {ProcDecl \";\" | ForwardDecl \";\"}.\nConstDecl = IdentDef \"=\" ConstExpr.\nTypeDecl = IdentDef \"=\" Type.\nVarDecl = IdentList \":\" Type.\nProcDecl = PROCEDURE [Receiver] IdentDef [FormalPars] \";\" DeclSeq [BEGIN StatementSeq] END ident.\nForwardDecl = PROCEDURE \"^\" [Receiver] IdentDef [FormalPars].\nFormalPars = \"(\" [FPSection {\";\" FPSection}] \")\" [\":\" Qualident].\nFPSection = [VAR] ident {\",\" ident} \":\" Type.\nReceiver = \"(\" [VAR] ident \":\" ident \")\".\nType = Qualident\n | ARRAY [ConstExpr {\",\" ConstExpr}] OF Type\n | RECORD [\"(\"Qualident\")\"] FieldList {\";\" FieldList} END\n | POINTER TO Type\n | PROCEDURE [FormalPars].\nFieldList = [IdentList \":\" Type].\nStatementSeq = Statement {\";\" Statement}.\nStatement = [ Designator \":=\" Expr\n | Designator [\"(\" [ExprList] \")\"]\n | IF Expr THEN StatementSeq {ELSIF Expr THEN StatementSeq} [ELSE StatementSeq] END\n | CASE Expr OF Case {\"|\" Case} [ELSE StatementSeq] END\n | WHILE Expr DO StatementSeq END\n | REPEAT StatementSeq UNTIL Expr\n | FOR ident \":=\" Expr TO Expr [BY ConstExpr] DO StatementSeq END\n | LOOP StatementSeq END\n | WITH Guard DO StatementSeq {\"|\" Guard DO StatementSeq} [ELSE StatementSeq] END\n | EXIT\n | RETURN [Expr]\n ].\t\nCase = [CaseLabels {\",\" CaseLabels} \":\" StatementSeq].\nCaseLabels = ConstExpr [\"..\" ConstExpr].\nGuard = Qualident \":\" Qualident.\nConstExpr = Expr.\nExpr = SimpleExpr [Relation SimpleExpr].\nSimpleExpr = [\"+\" | \"-\"] Term {AddOp Term}.\nTerm = Factor {MulOp Factor}.\nFactor = Designator [\"(\" [ExprList] \")\"] | number | character | string | NIL | Set | \"(\" Expr \")\" | \" ~ \" Factor.\nSet = \"{\" [Element {\",\" Element}] \"}\".\nElement = Expr [\"..\" Expr].\nRelation = \"=\" | \"#\" | \"<\" | \"<=\" | \">\" | \">=\" | IN | IS.\nAddOp = \"+\" | \"-\" | OR.\nMulOp = \"*\" | \"/\" | DIV | MOD | \"&\".\nDesignator = Qualident {\".\" ident | \"[\" ExprList \"]\" | \" ^ \" | \"(\" Qualident \")\"}.\nExprList = Expr {\",\" Expr}.\nIdentList = IdentDef {\",\" IdentDef}.\nQualident = [ident \".\"] ident.\nIdentDef = ident [\" * \" | \" - \"]." ], "related": [ "oberon", "modula-2", "pascal", "go", "object-oberon", "smalltalk", "python", "java", "algol", "yacc", "javascript", "powerpc" ], "summary": "Oberon-2 is an extension of the original Oberon programming language that adds limited reflection and object-oriented programming facilities, open arrays as pointer base types, read-only field export and reintroduces the FOR loop from Modula-2. It was developed in 1991 at ETH Zurich by Niklaus Wirth and Hanspeter Mössenböck, who is now at Institut für Systemsoftware (SSW) of the University of Linz, Austria. Oberon-2 is a superset of Oberon, and is fully compatible with it. Oberon-2 was a redesign of Object Oberon. Oberon-2 inherited limited reflection and single inheritance (\"type extension\") without interfaces or mixins from Oberon, but added efficient virtual methods (\"type bound procedures\"). Method calls were resolved at run-time using C++-style virtual method tables. Compared to fully object-oriented programming languages like Smalltalk, in Oberon-2 basic types are not objects, classes are not objects, many operations are not methods, there is no message passing (to a certain extent it can be emulated by reflection and through message extension, as demonstrated in ETH Oberon), and polymorphism is limited to subclasses of a common class (no duck typing like in Python, and it's not possible to define interfaces like in Java). Oberon-2 does not support encapsulation at object/class level, but modules can be used for this purpose. Reflection in Oberon-2 does not use meta-objects, but simply reads from type descriptors compiled into the executable binaries, and exposed in the modules that define the types and/or procedures. If the format of these structures are exposed at the language level (as is the case for ETH Oberon, for example), reflection could be implemented at the library level. It could therefore be implemented almost entirely at library level, without changing the language code. Indeed, ETH Oberon makes use of language-level and library-level reflection capabilities extensively. Oberon-2 provides built-in run-time support for garbage collection similar to Java and performs bounds and array index checks, etc. that eliminate the potential stack and array bounds overwriting problems and manual memory management issues inherent in C/C++. Separate compilation using symbol files and name-spaces via the module architecture ensure quick rebuilds since only modules with changed interfaces need to be recompiled. The language Component Pascal is a refinement (a superset) of Oberon-2.", "backlinksCount": 64, "pageId": 449019, "dailyPageViews": 29, "created": 2004, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Oberon-2" }, "leachim6": { "filepath": "o/Oberon 2.obn", "example": [ "MODULE HelloWorld; \nIMPORT Out;\nBEGIN\n Out.String( \"Hello World\" );\n Out.Ln;\nEND HelloWorld." ], "id": "Oberon 2" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Oberon-2", "hopl": "https://hopl.info/showlanguage.prx?exp=1647", "centralPackageRepositoryCount": 0, "isbndb": "" }, "oberon": { "title": "Oberon", "appeared": 1986, "type": "pl", "creators": [ "Niklaus Wirth" ], "website": "http://www.projectoberon.com/", "documentation": [ "https://people.inf.ethz.ch/wirth/Oberon/Oberon07.Report.pdf" ], "country": [ "Switzerland" ], "originCommunity": [ "Eidgenössische Technische Hochschule Zürich" ], "domainName": { "registered": 2011, "awisRank": { "2022": 6362528 }, "name": "projectoberon.com" }, "hasPrintDebugging": { "example": "", "value": true }, "hasPointers": { "example": "", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasComments": { "example": "(* A comment\n*)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "printToken": [ [ "Out.String" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "MODULE Rectangles;\n\nIMPORT Figures;\n\nTYPE\n Rectangle* = POINTER TO RectangleDesc;\n\n RectangleDesc* = RECORD\n (Figures.FigureDesc)\n x, y, w, h : INTEGER;\n END;\n\nPROCEDURE Draw* (r : Rectangle);\nBEGIN\n (* ... *)\nEND Draw;\n\n(* Other procedures here *)\n\nPROCEDURE Handle* (f: Figure; VAR msg: Figures.Message);\n VAR\n r : Rectangle;\nBEGIN\n r := f(Rectangle);\n IF msg IS Figures.DrawMsg THEN Draw(r)\n ELSIF msg IS Figures.MarkMsg THEN Mark(r)\n ELSIF msg IS Figures.MoveMsg THEN Move(r, msg(Figures.MoveMsg).dx, msg(Figures.MoveMsg).dy)\n ELSE (* ignore *)\n END\nEND Handle;\n\nPROCEDURE New* (VAR r : Rectangle);\nBEGIN\n NEW(r);\n Figures.Init(r, Handle);\nEND New;\n\nEND Rectangles." ], "related": [ "modula-2", "oberon-2", "zonnon", "go", "nim", "algol", "euler", "pascal", "modula", "ada", "linux", "solaris", "lex", "yacc", "x86-isa", "obliq", "visual-studio-editor" ], "summary": "Oberon is a general-purpose programming language created in 1986 by Niklaus Wirth and the latest member of the Wirthian family of ALGOL-like languages (Euler, Algol-W, Pascal, Modula, and Modula-2). Oberon was the result of a concentrated effort to increase the power of Modula-2, the direct successor of Pascal, and simultaneously to reduce its complexity. Its principal new feature is the concept of type extension of record types: It permits the construction of new data types on the basis of existing ones and to relate them, deviating from the dogma of strictly static data typing. Type extension is Wirth's way of inheritance reflecting the viewpoint of the parent site. Oberon was developed as part of the implementation of the Oberon operating system at ETH Zurich in Switzerland. The name is from the moon of Uranus, Oberon. Oberon is still maintained by Wirth and the latest revision is dated May 3, 2016.", "pageId": 22496, "dailyPageViews": 100, "created": 2001, "backlinksCount": 128, "revisionCount": 388, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Oberon_(programming_language)" }, "projectEuler": { "memberCount": { "2019": 2, "2022": 3 }, "id": "Oberon" }, "leachim6": { "filepath": "o/Oberon.o", "fileExtensions": [ "o" ], "example": [ "MODULE HelloWorld;\n\nIMPORT Out;\n\nBEGIN\n Out.Open;\n Out.String('Hello World');\nEND HelloWorld.\n" ], "id": "Oberon" }, "rijuRepl": { "example": [ "MODULE Main;\n\nIMPORT Out;\n\nBEGIN\n Out.String(\"Hello, world!\");\n Out.Ln;\nEND Main.\n" ], "id": "https://riju.codes/oberon" }, "indeedJobs": { "2022": 0, "query": "applescript engineer" }, "faqPageUrl": [ "http://www.projectoberon.net/txt/FAQ.txt" ], "subreddit": [ { "memberCount": { "2022": 289 }, "url": "https://www.reddit.com/r/Oberon" } ], "tiobe": { "id": "Oberon" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1415", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1988|The programming language oberon|10.1002/spe.4380180707|242|19|N. Wirth|0648b884fc979f8d4e4a620193f855f173a89a74\n1988|From modula to oberon|10.1002/spe.4380180706|63|4|N. Wirth|d71f6af965cef1f53e9026bb54a55d71d7aa1453\n1997|The Formal Specification of Oberon|10.3217/jucs-003-05-0443|29|0|P. Kutter and A. Pierantonio|702fef24576704bd12aa6a7983b5543f9ba15f84\n1992|The Oberon System family|10.1002/spe.4380251204|21|1|M. Brandis and R. Crelier and Michael Franz and J. Templ|0ce78acb2c8e53859a41238a0c09bc475a59b65f\n1997|Do the Fish Really Need Remote Control? A Proposal for Self-Active Objects in Oberon|10.1007/3-540-62599-2_41|14|1|J. Gutknecht|7a1834c14d7dd5a0ec4bf9e570f08c5ad62803cc\n1987|From Modula to Oberon and the programming language Oberon|10.3929/ETHZ-A-005363226|14|1|N. Wirth|a0d4be2f56438ca59033cfd826a04a334ebfa647\n2007|Modula-2 and Oberon|10.1145/1238844.1238847|11|1|N. Wirth|6611c2c376d85397a7020885a35c3ade9b689a18\n1996|Dynamic semantics of the Oberon programming language|10.3929/ETHZ-A-004292949|10|1|P. Kutter|5327cc1e0fde395ded437974e1836e9b74d09c45\n1997|An Object-Oriented Database Programming Environment for Oberon|10.1007/3-540-62599-2_32|9|0|Jacques Supcik and M. Norrie|7c24291fbcb7e132fa343540050438cc379b1cb4\n1991|Differences between Oberon and Oberon-2|10.3929/ETHZ-A-000589808|6|0|H. Mössenböck and N. Wirth|4fe362c41f9e39756d51bdeb19efc356d599d3e7\n1994|On the Essence of Oberon|10.1007/3-540-57840-4_39|6|0|D. Naumann|34a315fadd302899d9796b41d48bcf04f598ccb9\n1990|Programming without enumerations in Oberon|10.1145/382076.382642|5|1|Charles Lins|d9ff19e9616698d5950350379c00b7b138117f32\n1993|A voyage to Oberon|10.1145/165408.165412|2|0|A. Radenski|b015e8772aa90ee1731deda734b6b8e9a75c158c\n1996|A first course in object-oriented programming using Oberon|10.2495/SEHE950401|2|0|V. Mahnic and B. Vilfan|66b8ec6ecefca37ca74b5d5100be699b7c2f6f07\n1989|From Modula to Oberon: The programming language Oberon|10.3929/ETHZ-A-000564136|2|0|N. Wirth|073431b262dc897b4b4a2cab8ebe8b2a29feeda7\n1996|Combined modelling and simulation of dynamic systems using Oberon|10.1109/CACSD.1996.555318|1|0|M. Kottmann|f095581b91137b1cb0c6a8c8f7e672bead585616\n2000|Building Your Own Tools: An Oberon Industrial Case-Study|10.1007/10722581_23|1|0|P. Reed|b8ca106f02e13392418e83b83b7820351065f5cc\n1997|Some Experience In Teaching An IntroductoryProgramming Course Using Oberon|10.2495/SQE970031|1|0|V. Mahnic|c12e98e9ac447cf4cb9a56fa2c7b8d1d1346c9e5\n1996|Algebraic Semantics of the Oberon Target Machine|10.1007/3-540-62064-8_5|1|0|A. Zamulin|133d0b379533b680b3385cbb255e2034adca789f\n1994|Control system design with Oberon|10.1109/CACSD.1994.288919|1|0|Xiaobing Qiu and W. Schaufelberger|370c1df9adf39ecf4b1c4e4d8f20954c5b1cbaea\n1994|Is Oberon as Simple as Possible? A Smaller Object-Oriented Language Based on the Concept of Module Type|10.1007/3-540-57840-4_38|1|0|A. Radenski|0184b7b480ae3524825e2260603d7e920a87bf70" }, "obj": { "title": "OBJ", "appeared": 1976, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "wikipedia": { "summary": "OBJ is a programming language family introduced by Joseph Goguen in 1976. It is a family of declarative \"ultra high-level\" languages. It features abstract types, generic modules, subsorts (subtypes with multiple inheritance), pattern-matching modulo equations, E-strategies (user control over laziness), module expressions (for combining modules), theories and views (for describing module interfaces) for the massively parallel RRM (rewrite rule machine). Members of the OBJ family of languages include CafeOBJ, Eqlog, FOOPS, Kumo, Maude and OBJ3.", "created": 2004, "backlinksCount": 12, "pageId": 1063976, "revisionCount": 29, "dailyPageViews": 9, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/OBJ_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=728", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2000|Software Engineering with OBJ|10.1007/978-1-4757-6541-0|45|0|J. Goguen and G. Malcolm|6c8757c7b05e8403dad1c5691b337c9c7a433b3b\n1989|OBJ as a Theorem Prover with Applications to Hardware Verification|10.1007/978-1-4612-3658-0_5|44|2|J. Goguen|36de68653e3ff91a59c7db225e804c6eac3e63c1\n1982|Rapid prototyping: in the OBJ executable specification language|10.1145/1006259.1006273|29|1|J. Goguen and J. Meseguer|6b9a05a8ea9671f2090291e2b187e348a6360fc4\n1993|Programming in OBJ and Maude|10.1007/3-540-56883-2_12|7|1|T. Winkler|c7c812225bcf0d41bd1ab6c759313f6a0134130f\n2000|OBJ for OBJ|10.1007/978-1-4757-6541-0_6|3|0|C. Kirchner and H. Kirchner and Aristide Mégrelis|cb82d9367819e8b9fb9068770f1059b920c6bfc4\n2006|From OBJ to ML to Coq|10.1007/11780274_12|1|0|J. Chrzaszcz and J. Jouannaud|aac97972451632d3eec85c1696580af22a705ab7" }, "obj2": { "title": "OBJ2", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/af14c22d411e0b8a4c1e2536fdb903f946f5028c" ], "country": [ "United States" ], "originCommunity": [ "SRI Intternational" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1169", "centralPackageRepositoryCount": 0 }, "objdump": { "title": "ObjDump", "appeared": 1991, "type": "application", "country": [ "United States" ], "originCommunity": [ "Cygnus Solutions" ], "wikipedia": { "example": [ "4004ed:\t55 \tpush rbp\n 4004ee:\t48 89 e5 \tmov rbp,rsp\n 4004f1:\tc7 45 ec 00 00 00 00 \tmov DWORD PTR [rbp-0x14],0x0\n 4004f8:\tc7 45 f0 01 00 00 00 \tmov DWORD PTR [rbp-0x10],0x1\n 4004ff:\tc7 45 f4 02 00 00 00 \tmov DWORD PTR [rbp-0xc],0x2\n 400506:\tc7 45 f8 03 00 00 00 \tmov DWORD PTR [rbp-0x8],0x3\n 40050d:\tc7 45 fc 04 00 00 00 \tmov DWORD PTR [rbp-0x4],0x4\n 400514:\tc7 45 ec 00 00 00 00 \tmov DWORD PTR [rbp-0x14],0x0\n 40051b:\teb 13 \tjmp 400530 \n 40051d:\t8b 05 15 0b 20 00 \tmov eax,DWORD PTR [rip+0x200b15] # 601038 \n 400523:\t83 e8 01 \tsub eax,0x1\n 400526:\t89 05 0c 0b 20 00 \tmov DWORD PTR [rip+0x200b0c],eax # 601038 \n 40052c:\t83 45 ec 01 \tadd DWORD PTR [rbp-0x14],0x1\n 400530:\t8b 05 02 0b 20 00 \tmov eax,DWORD PTR [rip+0x200b02] # 601038 \n 400536:\t39 45 ec \tcmp DWORD PTR [rbp-0x14],eax\n 400539:\t7c e2 \tjl 40051d \n 40053b:\t5d \tpop rbp\n 40053c:\tc3 \tret \n 40053d:\t0f 1f 00 \tnop DWORD PTR [rax]" ], "related": [ "unix" ], "summary": "objdump is a program for displaying various information about object files on Unix-like systems. For instance, it can be used as a disassembler to view an executable in assembly form. It is part of the GNU Binutils for fine-grained control over executables and other binary data. For example, $ objdump -D -M intel file.bin | grep main.: -A20 This performs disassembly on the file «file.bin», with the assembly code shown in Intel syntax. We then redirect it to grep, which searches the main function and displays 20 lines of its code. Example output: objdump uses the BFD library to read the contents of object files. Similar utilities are Borland TDUMP, Microsoft DUMPBIN and readelf.", "backlinksCount": 17, "pageId": 4464255, "created": 2006, "revisionCount": 52, "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/objdump" }, "githubLanguage": { "fileExtensions": [ "objdump" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "assembly_x86", "tmScope": "objdump.x86asm", "id": "ObjDump" }, "pygmentsHighlighter": { "filename": "asm.py", "fileExtensions": [ "objdump" ], "id": "objdump" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2014, "committerCount": 2, "commitCount": 7, "url": "https://github.com/nanoant/assembly.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "object-definition-language": { "title": "Object Definition Language", "appeared": 1991, "type": "pl", "reference": [ "https://handwiki.org/wiki/Object_Definition_Language" ], "country": [ "United States" ], "originCommunity": [ "http://www.odbms.org/odmg-standard" ], "wikipedia": { "summary": "Object Definition Language (ODL) is the specification language defining the interface to object types conforming to the ODMG Object Model. Often abbreviated by the acronym ODL. This language's purpose is to define the structure of an Entity-relationship diagram.", "url": "https://web.archive.org/web/20190430204008/https://en.wikipedia.org/wiki/Object_Definition_Language" }, "centralPackageRepositoryCount": 0 }, "object-oberon": { "title": "Object Oberon", "appeared": 1990, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "Eidgenössische Technische Hochschule Zürich" ], "wikipedia": { "related": [ "oberon", "oberon-2" ], "summary": "Object Oberon is a programming language which is based on the Oberon programming language with features for object-oriented programming. Oberon-2 was essentially a redesign of Object Oberon.", "created": 2004, "backlinksCount": 6, "pageId": 1064051, "revisionCount": 14, "dailyPageViews": 3, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Object_Oberon" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1505", "centralPackageRepositoryCount": 0 }, "object-pascal": { "title": "Object Pascal", "appeared": 1986, "type": "pl", "documentation": [ "https://castle-engine.io/modern_pascal" ], "country": [ "United States" ], "originCommunity": [ "https://gitlab.com/groups/freepascal.org/fpc/-/issues" ], "visualParadigm": false, "hasConstructors": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasComments": { "example": "(* This is a multi-line comments\n and it will span multiple lines. *)\n{ This is a single line comment in pascal }", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ], [ "{", "}" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "type\n THelloWorld = class\n procedure Put;\n begin\n PrintLn('Hello, World!');\n end\n end;\n\nvar HelloWorld := THelloWorld.Create;\n\nHelloWorld.Put;" ], "related": [ "x86-isa", "arm", "free-pascal", "powerpc", "sparc", "mips", "oxygene", "java", "javascript", "turbo-pascal", "pascal", "simula", "smalltalk", "csharp", "genie", "nim", "ios", "linux", "freebsd", "solaris", "ecmascript", "morfik", "visual-studio-editor", "android", "delphi" ], "summary": "Object Pascal refers to a branch of object-oriented derivatives of Pascal, mostly known as the primary programming language of Embarcadero Delphi.", "pageId": 630175, "dailyPageViews": 149, "created": 2004, "backlinksCount": 412, "revisionCount": 548, "appeared": 1986, "fileExtensions": [ "p", "pp", "pas" ], "url": "https://en.wikipedia.org/wiki/Object_Pascal" }, "leachim6": { "filepath": "o/Object Pascal.pp", "example": [ "program ObjectPascalExample;\n\ntype\n THelloWorld = class\n procedure Put;\n end;\n\nprocedure THelloWorld.Put;\nbegin\n Writeln('Hello World');\nend;\n\nvar\n HelloWorld: THelloWorld;\n\nbegin\n HelloWorld := THelloWorld.Create;\n HelloWorld.Put;\n HelloWorld.Free;\nend." ], "id": "Object Pascal" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1170", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "object-query-language": { "title": "OQL", "appeared": 1986, "type": "queryLanguage", "reference": [ "http://tech.novosoft-us.com/products/oql_book.htm" ], "aka": [ "OQL" ], "country": [ "United States" ], "originCommunity": [ "http://www.odbms.org/odmg-standard" ], "example": [ "select c.address\nfrom Persons p, p.children c\nwhere p.address.street = \"Main Street\" and count(p.children) >= 2 and c.address.city != p.address.city" ], "wikipedia": { "summary": "Object Query Language (OQL) is a query language standard for object-oriented databases modeled after SQL. OQL was developed by the Object Data Management Group (ODMG). Because of its overall complexity nobody has ever fully implemented the complete OQL. OQL has influenced the design of some of the newer query languages like JDOQL and EJB QL, but they can't be considered as different flavors of OQL.", "backlinksCount": 62, "pageId": 4674558, "dailyPageViews": 45, "url": "https://en.wikipedia.org/wiki/Object_Query_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4549" }, "object-rexx": { "title": "Object Rexx", "appeared": 1988, "type": "pl", "creators": [ "Simon C. Nash" ], "website": "http://www.oorexx.org", "fileExtensions": [ "rxs", "rex" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "domainName": { "registered": 2004, "awisRank": { "2022": 7466986 }, "name": "oorexx.org" }, "hasMultipleInheritance": { "example": "", "value": true }, "wikipedia": { "related": [ "linux", "rexx", "smalltalk", "netrexx", "solaris" ], "summary": "The Object REXX programming language is an object-oriented scripting language initially produced by IBM for OS/2. It is a follow-on to and a significant extension of the \"Classic Rexx\" language originally created for the CMS component of VM/SP and later ported to MVS, OS/2 and PC DOS. OS/2 version of IBM Object REXX is deeply integrated with SOM. On October 12, 2004, IBM released Object REXX as open source software, giving rise to Open Object Rexx (ooREXX), now available for various operating systems: Linux, Solaris, Windows. This implementation includes a WSH Scripting Engine for Rexx. The released sources however didn't include significant piece of the SOM support. Object REXX supports multiple inheritance via the use of mixin classes.", "pageId": 1353817, "dailyPageViews": 17, "created": 2005, "backlinksCount": 32, "revisionCount": 76, "appeared": 1988, "fileExtensions": [ "rxs", "rex" ], "url": "https://en.wikipedia.org/wiki/Object_REXX" }, "tiobe": { "id": "Object Rexx" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3742", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "object-z": { "title": "Object-Z", "appeared": 1991, "type": "pl", "country": [ "Australia" ], "originCommunity": [ "University of Queensland" ], "wikipedia": { "related": [ "z-notation", "zpp" ], "summary": "Object-Z is an object-oriented extension to the Z notation developed at the University of Queensland, Australia. Object-Z extends Z by the addition of language constructs resembling the object-oriented paradigm, most notably, classes. Other object-oriented notions such as polymorphism and inheritance are also supported. While not as popular as its base language Z, Object-Z has still received significant attention in the formal methods community, and research on aspects of the language are ongoing, including hybrid languages using Object-Z, tool support (e.g., through the Community Z Tools project) and refinement calculi.", "created": 2004, "backlinksCount": 8, "pageId": 30872150, "revisionCount": 33, "dailyPageViews": 6, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Object-Z" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1649", "centralPackageRepositoryCount": 0 }, "objectcharts": { "title": "Objectcharts", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e55bd50560451f344e31e48c3226b7d1cf1217a1" ], "country": [ "Germany" ], "originCommunity": [ "FZI Forschungszentrum Informatik" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7789", "centralPackageRepositoryCount": 0 }, "objective-c": { "title": "Objective-C", "appeared": 1984, "type": "pl", "creators": [ "Brad Cox" ], "website": "https://developer.apple.com/library/content/documentation/Cocoa/Conceptual/ProgrammingWithObjectiveC/Introduction/Introduction.html", "documentation": [ "https://developer.apple.com/documentation/objectivec" ], "aka": [ "objectivec" ], "fileExtensions": [ "h", "m", "mm", "C" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "supersetOf": [ "c" ], "hasStrings": { "example": "\"hello world\"", "value": true }, "hasSingleDispatch": { "example": "", "value": true }, "hasPointers": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": false }, "hasImports": { "example": "// #import ensures that a file is only ever included once so that you never have a problem with recursive includes.\n#import \n#include \n#include ", "value": true }, "hasInterfaces": { "example": "@protocol Printing\n -(void) print;\n@end", "value": true }, "hasOperatorOverloading": { "example": "", "value": false }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMessagePassing": { "example": "", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasWhileLoops": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "printf" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "auto", "break", "case", "char", "const", "continue", "default", "do", "double", "else", "enum", "extern", "float", "for", "goto", "if", "inline", "int", "long", "register", "restrict", "return", "short", "signed", "sizeof", "static", "struct", "switch", "typedef", "union", "unsigned", "void", "volatile", "while", "_Bool", "_Complex", "_Imaginary", "BOOL", "Class", "bycopy", "byref", "id", "IMP", "in", "inout", "nil", "NO", "NULL", "oneway", "out", "Protocol", "SEL", "self", "Super", "YES", "@", "@interface", "@end", "@implementation", "@protocol", "@class", "@public", "@protected", "@private", "@property", "@try", "@throw", "@catch()", "@finally", "@synthesize", "@dynamic", "@selector", "atomic", "nonatomic", "retain" ], "wikipedia": { "example": [ "-(void) firstLabel: (int)param1 secondLabel: (int)param2;" ], "related": [ "c", "smalltalk", "groovy", "java", "nu", "objective-j", "tom-oopl", "swift", "ios", "simula", "ada", "self", "ruby", "llvmir", "linux", "vala" ], "summary": "Objective-C is a general-purpose, object-oriented programming language that adds Smalltalk-style messaging to the C programming language. It was the main programming language used by Apple for the OS X and iOS operating systems, and their respective application programming interfaces (APIs) Cocoa and Cocoa Touch prior to the introduction of Swift. The programming language Objective-C was originally developed in the early 1980s. It was selected as the main language used by NeXT for its NeXTSTEP operating system, from which OS X and iOS are derived. Portable Objective-C programs that do not use the Cocoa or Cocoa Touch libraries, or those using parts that may be ported or reimplemented for other systems, can also be compiled for any system supported by GNU Compiler Collection (GCC) or Clang. Objective-C source code 'implementation' program files usually have .m filename extensions, while Objective-C 'header/interface' files have .h extensions, the same as C header files. Objective-C++ files are denoted with a .mm file extension.", "pageId": 39809523, "dailyPageViews": 910, "created": 2002, "backlinksCount": 1275, "revisionCount": 1901, "appeared": 1984, "fileExtensions": [ "h", "m", "mm", "C" ], "url": "https://en.wikipedia.org/wiki/Objective-C" }, "githubLanguage": { "fileExtensions": [ "m", "h" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nMustangYM WeChatExtension-ForMac https://github.com/MustangYM.png https://github.com/MustangYM/WeChatExtension-ForMac Objective-C #438eff 1706 302 460 Mac版微信的功能拓展\nfirebase firebase-ios-sdk https://github.com/firebase.png https://github.com/firebase/firebase-ios-sdk Objective-C #438eff 1341 317 54 \"Firebase iOS SDK\"\nFlipboard FLEX https://github.com/Flipboard.png https://github.com/Flipboard/FLEX Objective-C #438eff 10723 1223 112 \"An in-app debugging and exploration tool for iOS\"\nsparkle-project Sparkle https://github.com/sparkle-project.png https://github.com/sparkle-project/Sparkle Objective-C #438eff 4445 795 54 \"A software update framework for macOS\"\nSunnyyoung WeChatTweak-macOS https://github.com/Sunnyyoung.png https://github.com/Sunnyyoung/WeChatTweak-macOS Objective-C #438eff 3641 479 210 \"A dynamic library tweak for WeChat macOS - 首款微信 macOS 客户端撤回拦截与多开\"\ngnachman iTerm2 https://github.com/gnachman.png https://github.com/gnachman/iTerm2 Objective-C #438eff 9157 917 200 \"iTerm2 is a terminal emulator for Mac OS X that does amazing things.\"\nreact-native-community react-native-permissions https://github.com/react-native-community.png https://github.com/react-native-community/react-native-permissions Objective-C #438eff 1592 506 50 \"Check and request user permissions in ReactNative (iOS and Android)\"\nreact-native-webrtc react-native-webrtc https://github.com/react-native-webrtc.png https://github.com/react-native-webrtc/react-native-webrtc Objective-C #438eff 2291 556 54 \"The WebRTC module for React Native\"\nbanchichen TZImagePickerController https://github.com/banchichen.png https://github.com/banchichen/TZImagePickerController Objective-C #438eff 6628 1487 106 \"一个支持多选、选原图和视频的图片选择器，同时有预览、裁剪功能，支持iOS6+。 A clone of UIImagePickerController, support picking multiple photos、original photo、video, also allow preview photo and video, support iOS6+\"\ngit-up GitUp https://github.com/git-up.png https://github.com/git-up/GitUp Objective-C #438eff 8649 567 81 \"The Git interface you've been missing all your life has finally arrived.\"\nkstenerud KSCrash https://github.com/kstenerud.png https://github.com/kstenerud/KSCrash Objective-C #438eff 2785 421 51 \"The Ultimate iOS Crash Reporter\"\nhalfrost Halfrost-Field https://github.com/halfrost.png https://github.com/halfrost/Halfrost-Field Objective-C #438eff 4210 702 102 \"✍️ 这里是写博客的地方 —— Halfrost-Field 冰霜之地\"\nWenchaoD FSCalendar https://github.com/WenchaoD.png https://github.com/WenchaoD/FSCalendar Objective-C #438eff 8285 1457 124 \"A fully customizable iOS calendar library, compatible with Objective-C and Swift\"\nfacebook Shimmer https://github.com/facebook.png https://github.com/facebook/Shimmer Objective-C #438eff 9052 1092 58 \"An easy way to add a simple, shimmering effect to any view in an iOS app.\"\nliberalisman iOS-InterviewQuestion-collection https://github.com/liberalisman.png https://github.com/liberalisman/iOS-InterviewQuestion-collection Objective-C #438eff 2176 419 91 \"iOS 开发者在面试过程中，常见的一些面试题，建议尽量弄懂了原理，并且多实践。\"\nrealm realm-cocoa https://github.com/realm.png https://github.com/realm/realm-cocoa Objective-C #438eff 13425 1754 71 \"Realm is a mobile database: a replacement for Core Data & SQLite\"\nluggit react-native-config https://github.com/luggit.png https://github.com/luggit/react-native-config Objective-C #438eff 2536 440 62 \"Bring some 12 factor love to your mobile apps!\"\npujiaxin33 JXPagingView https://github.com/pujiaxin33.png https://github.com/pujiaxin33/JXPagingView Objective-C #438eff 911 154 94 类似微博主页、简书主页等效果。多页面嵌套，既可以上下滑动，也可以左右滑动切换页面。支持HeaderView悬浮、支持下拉刷新、上拉加载更多。\nnst iOS-Runtime-Headers https://github.com/nst.png https://github.com/nst/iOS-Runtime-Headers Objective-C #438eff 7298 1564 42 \"iOS Objective-C headers as derived from runtime introspection\"\nkayanouriko E-HentaiViewer https://github.com/kayanouriko.png https://github.com/kayanouriko/E-HentaiViewer Objective-C #438eff 534 78 43 一个E-Hentai的iOS端阅读器\nzendesk zendesk_sdk_ios https://github.com/zendesk.png https://github.com/zendesk/zendesk_sdk_ios Objective-C #438eff 105 72 4 \"Zendesk Mobile SDK for iOS\"\nKJCracks Clutch https://github.com/KJCracks.png https://github.com/KJCracks/Clutch Objective-C #438eff 2607 534 58 \"Fast iOS executable dumper\"\nAliSoftware OHHTTPStubs https://github.com/AliSoftware.png https://github.com/AliSoftware/OHHTTPStubs Objective-C #438eff 4256 512 49 \"Stub your network requests easily! Test your apps with fake network data and custom response time, response code and headers!\"\nopenid AppAuth-iOS https://github.com/openid.png https://github.com/openid/AppAuth-iOS Objective-C #438eff 657 328 18 \"iOS and macOS SDK for communicating with OAuth 2.0 and OpenID Connect providers.\"\nuber ios-snapshot-test-case https://github.com/uber.png https://github.com/uber/ios-snapshot-test-case Objective-C #438eff 977 99 26 \"Snapshot view unit tests for iOS\"", "trendingProjectsCount": 26, "type": "programming", "aceMode": "objectivec", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-objectivec", "tmScope": "source.objc", "aliases": [ "obj-c", "objc", "objectivec" ], "repos": 535667, "id": "Objective-C" }, "githubBigQuery": { "repos": 167113, "users": 97044, "id": "Objective-C" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/objc", "monaco": "objective-c", "pygmentsHighlighter": { "filename": "objective.py", "fileExtensions": [ "m", "h" ], "id": "Objective-C" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 14, "commitCount": 499, "sampleCount": 22, "example": [ "#import \"Foo.h\"\n\n\n@implementation Foo\n\n@end\n" ], "url": "https://github.com/textmate/objective-c.tmbundle" }, "projectEuler": { "memberCount": { "2019": 66, "2022": 60 }, "id": "Objective-C" }, "helloWorldCollection": [ "/* Hello World in Objective-C.\n** Since the standard implementation is identical to K&R C,\n** a version that says hello to a set of people passed on\n** the command line is shown here.\n*/\n\n#include \n#include \nint main(int argc,char **argv)\n{\n id set = [Set new];\n argv++;while (--argc) [set add:[String str:*argv++]];\n [set do:{ :each | printf(\"hello, %s!\\n\",[each str]); }];\n return 0;\n}\n" ], "leachim6": { "filepath": "o/Objective C.m", "example": [ "/*\n Build on OS X: \n clang -framework Foundation -fobjc-arc objc.m -o objc\n \n Build on Linux with GNUstep:\n clang `gnustep-config --objc-flags` `gnustep-config --base-libs` -fobjc-nonfragile-abi -fobjc-arc objc.m -o objc\n */\n\n#import \n\nint main(void)\n{\n NSLog(@\"Hello World\");\n}\n" ], "id": "Objective C" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Objective-C", "quineRelay": "Objective-C", "rijuRepl": { "example": [ "#import \n\nint main() {\n NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];\n NSLog(@\"Hello, world!\");\n [pool drain];\n return 0;\n}\n" ], "id": "https://riju.codes/objectivec" }, "indeedJobs": { "2017": 4276, "query": "objective-c engineer" }, "stackOverflowSurvey": { "2021": { "users": 2310, "medianSalary": 64859, "fans": 1400, "percentageUsing": 0.03 } }, "subreddit": [ { "memberCount": { "2017": 5468, "2022": 6609 }, "url": "https://reddit.com/r/ObjectiveC" } ], "meetup": { "memberCount": 235352, "groupCount": 445, "url": "https://www.meetup.com/topics/objective-c" }, "tiobe": { "currentRank": 19, "id": "Objective-C" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1247", "pypl": "Objective-C", "packageRepository": [ "https://cocoapods.org/" ], "ubuntuPackage": "gobjc", "gdbSupport": true, "fileType": "text", "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming in Objective C|1999|Stephen G. Kochan|116159|3.96|445|21\nProgramming in Objective-C 2.0|2008|Stephen G. Kochan|3467967|3.85|370|16\nObjective-C Programming: The Big Nerd Ranch Guide|2011|Aaron Hillegass|14382053|4.17|634|41\nThe Objective-C Programming Language||Apple Inc.|15769650|3.62|24|0", "isbndb": "year|publisher|title|authors|isbn13\n2012|Addison-Wesley Professional|Programming in Objective-C (Developer's Library)|Kochan, Stephen G.|9780321887283\n2008|Apress|Learn Objective-C on the Mac (Learn Series)|Knaster, Scott and Dalrymple, Mark|9781430218159\n2011|Wiley|Objective-C|DeVoe, Jiva|9780470479223\n2012|Apress|Learn Objective-C on the Mac: For OS X and iOS|Knaster, Scott and Dalrymple, Mark and Malik, Waqar|9781430241881\n2011|Apress|Objective-C for Absolute Beginners: iPhone, iPad and Mac Programming Made Easy|Bennett, Gary and Fisher, Mitchell and Lees, Brad|9781430236535\n2011|O'Reilly Media|Head First iPhone and iPad Development: A Learner's Guide to Creating Objective-C Applications for the iPhone and iPad|Pilone, Dan and Pilone, Tracey|9781449387822\n2009|Apress|Learn Objective-C for Java Developers (Learn Series)|Bucanek, James|9781430223696\n2010|McGraw-Hill Education|Objective-C for iPhone Developers, A Beginner's Guide|Brannan, James|9780071703284\n2011|O'Reilly Media|Learning the iOS 4 SDK for JavaScript Programmers: Create Native Apps with Objective-C and Xcode|Goodman, Danny|9781449388454\n2011|Apress|Pro Objective-C Design Patterns for iOS|Chung, Carlo|9781430233312\n2011|Manning Publications|Objective-C Fundamentals|Fairbairn, Christopher and Ruffenach, Collin and Fahrenkrug, Johannes|9781935182535", "semanticScholar": "" }, "objective-cpp": { "title": "Objective C++", "appeared": 1993, "type": "pl", "description": "Objective-C++ is simply source code that mixes Objective-C classes and C++ classes.", "reference": [ "https://en.wikipedia.org/wiki/Objective-C" ], "aka": [ "objectivecpp" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubLanguage": { "fileExtensions": [ "mm" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nTextureGroup Texture https://github.com/TextureGroup.png https://github.com/TextureGroup/Texture Objective-C++ #6866fb 5856 833 103 \"Smooth asynchronous user interfaces for iOS apps.\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "objectivec", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-objectivec", "tmScope": "source.objc++", "aliases": [ "obj-c++", "objc++", "objectivec++" ], "repos": 535669, "id": "Objective-C++" }, "githubBigQuery": { "repos": 17925, "users": 14642, "id": "Objective-C++" }, "pygmentsHighlighter": { "filename": "objective.py", "fileExtensions": [ "mm", "hh" ], "id": "Objective-C++" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 14, "commitCount": 499, "sampleCount": 2, "example": [ "// grabbed from https://raw.github.com/AOKP/external_webkit/61b2fb934bdd3a5fea253e2de0bcf8a47a552333/Source/WebCore/page/mac/EventHandlerMac.mm\n\n/*\n * Copyright (C) 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \"config.h\"\n#include \"EventHandler.h\"\n\n#include \"AXObjectCache.h\"\n#include \"BlockExceptions.h\"\n#include \"Chrome.h\"\n#include \"ChromeClient.h\"\n#include \"ClipboardMac.h\"\n#include \"DragController.h\"\n#include \"EventNames.h\"\n#include \"FocusController.h\"\n#include \"Frame.h\"\n#include \"FrameLoader.h\"\n#include \"FrameView.h\"\n#include \"KeyboardEvent.h\"\n#include \"MouseEventWithHitTestResults.h\"\n#include \"NotImplemented.h\"\n#include \"Page.h\"\n#include \"PlatformKeyboardEvent.h\"\n#include \"Pl" ], "url": "https://github.com/textmate/objective-c.tmbundle" }, "rijuRepl": { "example": [ "#import \n\nint main() {\n NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];\n NSLog(@\"Hello, world!\");\n [pool drain];\n return 0;\n}\n" ], "id": "https://riju.codes/objectivecpp" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "objective-j": { "title": "Objective-J", "appeared": 2008, "type": "pl", "website": "http://www.cappuccino-project.org/", "country": [ "United States and United Kingdom and Sweden" ], "originCommunity": [ "https://github.com/cappuccino" ], "domainName": { "registered": 2011, "name": "cappuccino-project.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "document.write" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "@implementation Address : CPObject\n{\n CPString name;\n CPString city;\n}\n\n- (id)initWithName:(CPString)aName city:(CPString)aCity\n{\n self = [super init];\n\n name = aName;\n city = aCity;\n\n return self;\n}\n\n- (void)setName:(CPString)aName\n{\n name = aName;\n}\n\n- (CPString)name\n{\n return name;\n}\n\n+ (id)newAddressWithName:(CPString)aName city:(CPString)aCity\n{\n return [[self alloc] initWithName:aName city:aCity];\n}\n\n@end" ], "related": [ "objective-c", "javascript", "c", "smalltalk" ], "summary": "Objective-J is a programming language developed as part of the Cappuccino web development framework. Its syntax is nearly identical to the Objective-C syntax and it shares with JavaScript the same relationship that Objective-C has with the C programming language: that of being a strict, but small, superset; adding traditional inheritance and Smalltalk/Objective-C style dynamic dispatch. Pure JavaScript, being a prototype-based language, already has a notion of object orientation and inheritance, but Objective-J adds the use of class-based programming to JavaScript. Programs written in Objective-J need to be preprocessed before being run by a web browser's JavaScript virtual machine. This step can occur in the web browser at runtime or by a compiler which translates Objective-J programs into pure JavaScript code. The Objective-J compiler is written in JavaScript; consequently, deploying Objective-J programs does not require a web browser plug-in. Objective-J can be compiled and run on Node.js.", "pageId": 19176983, "created": 2008, "backlinksCount": 102, "revisionCount": 112, "dailyPageViews": 31, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Objective-J" }, "githubLanguage": { "fileExtensions": [ "j", "sj" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.js.objj", "aliases": [ "obj-j", "objectivej", "objj" ], "repos": 1058, "id": "Objective-J" }, "githubBigQuery": { "repos": 340, "users": 298, "id": "Objective-J" }, "pygmentsHighlighter": { "filename": "javascript.py", "fileExtensions": [ "j" ], "id": "Objective-J" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2014, "committerCount": 3, "commitCount": 7, "sampleCount": 3, "example": [ "\n@import \n\n\n@implementation AppController : CPObject\n{\n}\n\n- (void)applicationDidFinishLaunching:(CPNotification)aNotification\n{\n // The end result of this layout will be the kind of master/detail/auxilliary view\n // found in iTunes, Mail, and many other apps.\n\n var theWindow = [[CPWindow alloc] initWithContentRect:CGRectMakeZero() styleMask:CPBorderlessBridgeWindowMask],\n contentView = [theWindow contentView];\n\n var navigationArea = [[CPView alloc] initWithFrame:CGRectMake(0.0, 0.0, 150.0, CGRectGetHeight([contentView bounds]) - 150.0)];\n\n [navigationArea setBackgroundColor:[CPColor redColor]];\n\n // This view will grow in height, but stay fixed width attached to the left side of the screen.\n [navigationArea setAutoresizingMask:CPViewHeightSizable | CPViewMaxXMargin];\n\n [contentView addSubview:navigationArea];\n\n var metaDataArea = [[CPView alloc] initWithFrame:CGRectMake(0.0, CGRectGetMaxY([navigationArea frame]), 150.0, 150.0)];\n\n [metaDataArea setBackgroundColor:[CPColor greenColor]];\n\n // This view will stay the same size in both directions, and fixed to the lower left corner.\n [metaDataArea setAutoresizingMask:CPViewMinYMargin | CPViewMaxXMargin];\n\n [contentView addSubview:metaDataArea];\n\n var contentArea = [[CPView alloc] initWithFrame:CGRectMake(150.0, 0.0, CGRectGetWidth([contentView bounds]) - 150.0, CGRectGetHeight([contentView bounds]))];\n\n [contentArea setBackgroundColor:[CPColor blueColor]];\n\n // This view will grow in both height an width.\n [contentArea setAutoresizingMask:CPViewWidthSizable | CPViewHeightSizable];\n\n [contentView addSubview:contentArea];\n\n [theWindow orderFront:self];\n}\n\n@end" ], "url": "https://github.com/textmate/javascript-objective-j.tmbundle" }, "leachim6": { "filepath": "o/Objective J.j", "example": [ "document.write(\"Hello World\");\n" ], "id": "Objective J" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "objective-modula-2": { "title": "objective-modula-2", "appeared": 2009, "type": "pl", "website": "http://objective.modula-2.net/", "country": [ "Various" ], "originCommunity": [ "https://groups.google.com/g/comp.lang.modula2" ], "domainName": { "name": "objective.modula-2.net" }, "isbndb": "" }, "objective-s": { "title": "Objective-S", "appeared": 1980, "type": "pl", "website": "https://objective.st/", "reference": [ "https://news.ycombinator.com/item?id=32444300" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/mpw/Objective-Smalltalk/issues" ], "example": [ "-deleteFile:filename {\n thumbs := self thumbsView subviews.\n viewsToRemove := thumbs selectWhereValueForKey:'filename' isEqual:filename.\n aView := viewsToRemove firstObject.\n\n UIView animateWithDuration:0.4\n animations: { aView setAlpha: 0.0. }\n completion: { aView removeFromSuperview. \n UIView animateWithDuration: 0.2\n animations: { self thumbsView layoutSubviews. }\n completion: { 3 }. \n }.\n url := self urlForFile:aFilename.\n NSFileManager defaultManager removeItemAtURL:url error:nil.\n self thumbsView afterDelay:0.4 | setNeedsLayout.\n}" ] }, "objectlogo": { "title": "ObjectLOGO", "appeared": 1993, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bolt Beranek and Newman Inc" ], "wikipedia": { "related": [ "logo" ], "summary": "ObjectLOGO is a variant of the programming language Logo with object-oriented programming extensions and lexical scoping. Version 2.7 is sold by Digitool, Inc. It is no longer being developed or supported, and does not run on versions of the Mac operating system after version 7.5.", "created": 2004, "backlinksCount": 19, "pageId": 1064025, "revisionCount": 33, "dailyPageViews": 6, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/ObjectLOGO" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5529", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "objectpal": { "title": "ObjectPAL", "appeared": 1993, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Corel Corporation" ], "wikipedia": { "related": [ "smalltalk", "visual-basic" ], "summary": "ObjectPAL is short for Object-Oriented Paradox Application Language, which is the programming language used by the Borland Paradox database application (now owned by Corel). Paradox, now in its 11th version, is a constituent of Corel's Word Perfect X3 office suite, for 32-bit Microsoft Windows. The language is tightly-bound to the application's forms, and provides a very rapid and robust development environment for creating database applications for Windows. ObjectPAL is not a full free-standing object-oriented language. It belongs to the family of languages inspired by Hypercard, with influences from PAL (wherever functionality could be kept the same), Smalltalk, and Garnet (a UI language created by Brad Myers). While its objects do encapsulate source code, there is no support for polymorphism, and only a very limited inheritance concept, which is wedded to objects on a form which can be controlled by code placed on a higher object in a form's object hierarchy. However, for what it is, ObjectPAL provides a wideranging and versatile language for creating Paradox applications. The syntax and structure of the language resembles Visual Basic, but knowing Visual Basic would only help someone new to ObjectPAL in the sense that any other programming skill would be transferable to ObjectPAL. ObjectPAL was the successor to PAL, which was the Paradox for DOS programming language. With the advent of Paradox for Windows 1.0 in 1993, which was then owned by Borland Corporation, ObjectPAL was born. Version 1.0 was quickly succeeded by version 4.5 that same year. It can be used as such as a web server scripting language when combined with the Corel Web Server Control OCX, which implements a server API similar to the CGI, and its standalone console, the Corel Web Server.", "backlinksCount": 5, "pageId": 61379, "dailyPageViews": 3, "created": 2002, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/ObjectPAL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2297", "centralPackageRepositoryCount": 0 }, "objectscript": { "title": "ObjectScript", "appeared": 2012, "type": "pl", "creators": [ "unitpoint" ], "website": "http://objectscript.org", "reference": [ "https://www.codeproject.com/Articles/466907/%2FArticles%2F466907%2FObjectScript-A-new-programming-language" ], "country": [ "Russia" ], "originCommunity": [ "https://github.com/unitpoint/objectscript/issues" ], "githubRepo": { "firstCommit": 2012, "stars": 66, "forks": 18, "subscribers": 12, "created": 2012, "updated": 2022, "description": "ObjectScript, OS for short, is a new programming language. It's free, cross-platform, lightweight, embeddable and open-source. It combines the benefits of multiple languages, including: JavaScript, Lua, Ruby, Python and PHP. OS features the syntax of Javascripts, the \"multiple results\" feature from lua, syntactic shugar from Ruby as well as magic methods from PHP and Ruby - and even more!", "issues": 9, "url": "https://github.com/unitpoint/objectscript" }, "repoStats": { "firstCommit": 2012, "commits": 618, "committers": 14, "files": 1224 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "cls" ], "aceMode": "text", "tmScope": "source.objectscript", "repos": 1054, "id": "ObjectScript" }, "githubBigQuery": { "repos": 13, "users": 11, "id": "ObjectScript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8615", "centralPackageRepositoryCount": 0 }, "objectworld": { "title": "ObjectWorld", "appeared": 1993, "type": "pl", "reference": [ "http://dl.acm.org/citation.cfm?id=1747249.1747274" ], "country": [ "Austria" ], "originCommunity": [ "University of Vienna" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5117", "centralPackageRepositoryCount": 0 }, "objvlisp": { "title": "ObjVlisp", "appeared": 1984, "type": "pl", "country": [ "France" ], "originCommunity": [ "University of Paris VIII – Vincennes" ], "wikipedia": { "backlinksCount": 10, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/ObjVlisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1103" }, "objvprolog": { "title": "ObjVProlog", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0ac219622794dad9d4c83862f17c6feb589fffbe" ], "country": [ "France and Canada" ], "originCommunity": [ "Sorbonne Université", "Université de Montréal" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1506", "centralPackageRepositoryCount": 0 }, "obliq": { "title": "Obliq", "appeared": 1993, "type": "pl", "originCommunity": [ "DEC" ], "hasTypeInference": { "example": "", "value": true }, "wikipedia": { "related": [ "modula-3", "self", "oberon", "smalltalk" ], "summary": "Obliq is an interpreted, object-oriented programming language designed to make distributed, and locally multi-threaded, computation simple and easy for the programmer, while providing program safety and implicit type system. The interpreter is written in Modula-3, and provides Obliq with full access to Modula-3's network objects capabilities. A type inference algorithm for record concatenation, subtyping and recursive types has been developed for Obliq, more important it has been proved to be NP-complete and its lowest complexity to be Ο(n3) or if under other modeling up to certain conditions down to Ο(n2) and its best known implementation runs in Ο(n5). Obliq's syntax is very similar to Modula-3, the biggest difference being that Obliq has no need of explicit typed variables (i.e., a variable can hold any data type allowed by the type checker and if does not accepts one, i.e., a given expression execution error will be thrown) although explicit type declarations are allowed and ignored by the interpreter. The basic data types in the language include booleans, integers, reals, characters, strings, and arrays. Obliq supports the usual set of sequential control structures (conditional, iteration, and exception handling forms), as well as special control forms for concurrency (mutexes and guarded statements). Besides that Obliq's objects are able to be cloned and safely copied remotely by any machine in a distributed network object and it can be done in a transparent way. Obliq's large standard library provides strong support for mathematical operations, I/O, persistence, thread control, graphics, and animation. Distributed computation is object-based: objects hold a state, which is local to a particular process. Scope of objects and other variables is purely lexical. Objects can call methods of other objects, even if those objects are on another machine on the network. Obliq objects are simply collections of named fields (similar to slots in Self and Smalltalk), and support inheritance by delegation (like Self). The common uses of Obliq involve programming over networks, 3D animation, and distributed computation over Ethernet LAN as. Obliq is included free with the DEC Modula-3 distribution, but other free versions exist elsewhere including pre-compiled binaries for several operating systems.", "pageId": 602578, "dailyPageViews": 9, "created": 2004, "backlinksCount": 12, "revisionCount": 45, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Obliq" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1742", "fileType": "text", "centralPackageRepositoryCount": 0 }, "obscure": { "title": "OBSCURE", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/147aacbd7d6fdab57cd40c126db80242f377d8a5" ], "country": [ "Germany" ], "originCommunity": [ "Universität des Saarlandes" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1171", "centralPackageRepositoryCount": 0 }, "observable-lang": { "title": "Observable", "appeared": 2017, "type": "pl", "creators": [ "Mike Bostock" ], "description": "A partially open source derivative of Javascript modified for dataflow that powers the Observable data science web app.", "website": "https://observablehq.com/", "webRepl": [ "https://observablehq.com/@breck7/languages-with-central-package-repositories" ], "reference": [ "https://observablehq.com/@observablehq/observables-not-javascript" ], "originCommunity": [ "Observable" ], "domainName": { "registered": 2017, "awisRank": { "2022": 38267 }, "name": "observablehq.com" }, "related": [ "javascript" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "{\n let x = 0;\n for (let i = 1; i <= 100; ++i) {\n x += i;\n }\n return x;\n}" ], "githubRepo": { "firstCommit": 2017, "stars": 798, "forks": 61, "subscribers": 29, "created": 2017, "updated": 2022, "description": "The Observable dataflow runtime.", "issues": 16, "url": "https://github.com/observablehq/runtime" }, "repoStats": { "firstCommit": 2017, "commits": 904, "committers": 15, "files": 35 }, "twitter": "https://twitter.com/observablehq", "isbndb": "year|publisher|title|authors|isbn13\n2004|Cambridge University Press|Stochastic Control of Partially Observable Systems|Bensoussan, Alain|9780521611978" }, "obsidian": { "title": "obsidian", "appeared": 2018, "type": "pl", "creators": [ "Michael Coblenz" ], "website": "http://obsidian-lang.com", "country": [ "United States" ], "originCommunity": [ "University of California San Diego" ], "domainName": { "registered": 2018, "awisRank": { "2022": 10603534 }, "name": "obsidian-lang.com" }, "githubRepo": { "firstCommit": 2017, "stars": 74, "forks": 10, "subscribers": 16, "created": 2017, "updated": 2022, "description": "Obsidian language development", "issues": 79, "url": "https://github.com/mcoblenz/Obsidian" }, "repoStats": { "firstCommit": 2017, "commits": 2055, "committers": 29, "files": 906 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n20061546|Obsidian: A safer blockchain programming language|http://obsidian-lang.com/|2019-05-31 15:05:29 UTC|1559315129|azhenley|31|67" }, "ocaml": { "title": "OCaml", "appeared": 1996, "type": "pl", "creators": [ "Xavier Leroy" ], "website": "http://ocaml.org", "documentation": [ "https://ocaml.org/docs", "https://devdocs.io/ocaml/" ], "fileExtensions": [ "ml", "mli" ], "country": [ "France" ], "originCommunity": [ "Institut national de recherche en sciences et technologies du numérique" ], "domainName": { "registered": 2000, "awisRank": { "2017": 160837, "2022": 335321 }, "name": "ocaml.org" }, "releaseNotesUrl": "https://ocaml.org/releases", "visualParadigm": false, "hasLineComments": { "example": "", "value": false }, "hasComments": { "example": "(* This is a single-line comment. *)\n(* This is a\n * multi-line\n * comment.\n *)", "value": true }, "hasMultipleInheritance": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasModules": { "example": "(* In OCaml, every piece of code is wrapped into a module. *)\n(* amodule.ml *)\nlet hello () = print_endline \"Hello\"\n(* bmodule.ml *)\nAmodule.hello ()", "value": true }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "(*", "*)" ] ], "printToken": [ [ "print_string" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "as", "assert", "begin", "class", "constraint", "do", "done", "downto", "else", "end", "exception", "external", "false", "for", "fun", "function", "functor", "if", "in", "include", "inherit", "initializer", "lazy", "let", "match", "method", "module", "mutable", "new", "object", "of", "open", "private", "raise", "rec", "sig", "struct", "then", "to", "true", "try", "type", "value", "val", "virtual", "when", "while", "with" ], "wikipedia": { "example": [ "fun x_1 -> (x_1 *\n let y_3 =\n let y_2 = (x_1 * 1)\n in (y_2 * y_2)\n in (y_3 * y_3))" ], "related": [ "occam", "c", "ia-32", "sparc", "arm", "unix", "f-sharp", "caml", "cool", "standard-ml", "ats", "elm", "fstar", "haxe", "opa", "rust", "scala", "ml", "python", "perl", "java", "csharp", "fortran", "javascript", "jvm", "pic-microcontroller", "emacs-editor", "vim-editor", "opengl", "hack", "php", "ios", "android", "coq", "wasm", "haskell" ], "summary": "OCaml ( oh-KAM-əl), originally named Objective Caml, is the main implementation of the programming language Caml, created by Xavier Leroy, Jérôme Vouillon, Damien Doligez, Didier Rémy, Ascánder Suárez and others in 1996. A member of the ML language family, OCaml extends the core Caml language with object-oriented programming constructs. OCaml's toolset includes an interactive top-level interpreter, a bytecode compiler, a reversible debugger, a package manager (OPAM), and an optimizing native code compiler. It has a large standard library, making it useful for many of the same applications as Python or Perl, and has robust modular and object-oriented programming constructs that make it applicable for large-scale software engineering. OCaml is the successor to Caml Light. The acronym CAML originally stood for Categorical Abstract Machine Language, although OCaml omits this abstract machine. OCaml is a free and open-source software project managed and principally maintained by French Institute for Research in Computer Science and Automation (INRIA). In the early 2000s, many new languages adopted elements from OCaml, most notably F# and Scala.", "pageId": 39652, "dailyPageViews": 424, "created": 2002, "backlinksCount": 445, "revisionCount": 886, "appeared": 1996, "fileExtensions": [ "ml", "mli" ], "url": "https://en.wikipedia.org/wiki/OCaml" }, "githubLanguage": { "fileExtensions": [ "ml", "eliom", "eliomi", "ml4", "mli", "mll", "mly" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ncoq coq https://github.com/coq.png https://github.com/coq/coq OCaml #3be133 2275 366 118 \"Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.\"\nfacebook pyre-check https://github.com/facebook.png https://github.com/facebook/pyre-check OCaml #3be133 2985 148 243 \"Performant type-checking for python.\"\nocaml ocaml https://github.com/ocaml.png https://github.com/ocaml/ocaml OCaml #3be133 2473 590 53 \"The core OCaml system: compilers, runtime system, base libraries\"\nfacebook flow https://github.com/facebook.png https://github.com/facebook/flow OCaml #3be133 19958 1699 131 \"Adds static typing to JavaScript to improve developer productivity and code quality.\"\nfacebook infer https://github.com/facebook.png https://github.com/facebook/infer OCaml #3be133 10169 1365 134 \"A static analyzer for Java, C, C++, and Objective-C\"", "trendingProjectsCount": 6, "type": "programming", "interpreters": [ "ocaml", "ocamlrun", "ocamlscript" ], "aceMode": "ocaml", "codemirrorMode": "mllike", "codemirrorMimeType": "text/x-ocaml", "tmScope": "source.ocaml", "repos": 27376, "id": "OCaml" }, "githubBigQuery": { "repos": 5622, "users": 3634, "id": "OCaml" }, "pygmentsHighlighter": { "filename": "ml.py", "fileExtensions": [ "ml", "mli", "mll", "mly" ], "id": "OCaml" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2015, "committerCount": 11, "commitCount": 241, "sampleCount": 10, "example": [ "(*\n * Copyright (c) 2013 Jeremy Yallop.\n *\n * This file is distributed under the terms of the MIT License.\n * See the file LICENSE for details.\n *)\nlet string_of format v =\n let buf = Buffer.create 100 in\n let fmt = Format.formatter_of_buffer buf in begin\n format fmt v;\n Format.pp_print_flush fmt ();\n Buffer.contents buf\n end" ], "url": "https://github.com/textmate/ocaml.tmbundle" }, "projectEuler": { "memberCount": { "2019": 142, "2022": 219 }, "id": "OCaml" }, "helloWorldCollection": [ "(* Hello World in OCaml *)\nprint_string \"Hello World!\\n\";;" ], "leachim6": { "filepath": "o/OCaml.ml", "fileExtensions": [ "ml" ], "example": [ "print_string \"Hello World\\n\"" ], "id": "OCaml" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:OCaml", "quineRelay": "OCaml", "compilerExplorer": { "example": [ "let square x = x * x\n" ], "id": "OCaml" }, "rijuRepl": { "example": [ ";;\nprint_string \"Hello, world!\\n\"\n" ], "id": "https://riju.codes/ocaml" }, "tryItOnline": "ocaml", "officialBlogUrl": [ "https://ocaml.org/blog" ], "faqPageUrl": [ "https://opam.ocaml.org/doc/FAQ.html" ], "meetup": { "memberCount": 23394, "groupCount": 87, "url": "https://www.meetup.com/topics/ocaml-programming" }, "tiobe": { "id": "OCaml" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2294", "packageRepository": [ "https://opam.ocaml.org/" ], "twitter": "https://twitter.com/ocamllang", "ubuntuPackage": "ocaml", "jupyterKernel": [ "https://github.com/andrewray/iocaml", "https://github.com/akabe/ocaml-jupyter" ], "fileType": "text", "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nReal World OCaml: Functional programming for the masses|2013|Yaron Minsky|21890163|4.28|88|7\nUnix System Programming in OCaml|1994|Xavier Leroy|43400023|4.00|1|0\nApprendre à programmer avec OCaml|2014|Sylvain Conchon|43307400|4.00|1|0\nUsing, Understanding, and Unraveling The OCaml Language: From Practice to Theory and vice versa||Didier Rémy|23588230|5.00|1|0\nApprendre à programmer avec OCaml: Algorithmes et structures de données (Noire)||Jean-Christophe Filliatre|59798916|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2021|Wiley-ISTE|Concepts and Semantics of Programming Languages 1: A Semantical Approach with OCaml and Python|Hardin, The¿re¿se and Jaume, Mathieu and Pessaux, François and Viguie Donzeau-Gouge, Ve¿ronique|9781786305305\n2022|Springer|OCaml Scientific Computing: Functional Programming in Data Science and Artificial Intelligence (Undergraduate Topics in Computer Science)|Wang, Liang and Zhao, Jianxin and Mortier, Richard|9783030976446\n2006|Apress|Practical OCaml|Smith, Joshua B.|9781590596203\n20080103|Springer Nature|Practical OCaml|Joshua B. Smith|9781430202448\n20220526|Springer Nature|OCaml Scientific Computing|Liang Wang; Jianxin Zhao; Richard Mortier|9783030976453\n2010||Ocaml Programming Language Family: Ocaml Software, Objective Caml, Marionnet, Fftw, Mldonkey, Unison, Frama-c, Hol Light, Coq, Geneweb|Books Llc and Books and LLC|9781158073269", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2000|Using, Understanding, and Unraveling the OCaml Language. From Practice to Theory and Vice Versa|10.1007/3-540-45699-6_9|42|2|Didier Rémy|dbf92034106f3c26488946a043a48c9187bc0821\n2006|Type-safe distributed programming for OCaml|10.1145/1159876.1159881|25|2|John N. Billings and Peter Sewell and Mark R. Shinwell and Rok Strnisa|7a3fe7e9246140a6e07aeb07841a8b052d0784b5\n2018|Typed Embedding of a Relational Language in OCaml|10.4204/EPTCS.285.1|14|2|D. Kosarev and D. Boulytchev|f11043b0ebaa3923e39d3e1010fd8f87bda5552e\n2021|Retrofitting effect handlers onto OCaml|10.1145/3453483.3454039|13|2|K. Sivaramakrishnan and Stephen Dolan and Leo White and T. Kelly and S. Jaffer and A. Madhavapeddy|fbf84ef1173647b7bdf7f674c8acff9f61180728\n2018|Merlin: a language server for OCaml (experience report)|10.1145/3236798|12|0|Frédéric Bour and Thomas Refis and G. Scherer|83af07fe7334441c22973321127459731403cfa6\n2019|GOSPEL - Providing OCaml with a Formal Specification Language|10.1007/978-3-030-30942-8_29|8|0|A. Charguéraud and J. Filliâtre and C. Lourenço and Mário Pereira|96745e021ccaeb721d1854b7dea4eceb75d71357\n2014|GPGPU Composition with OCaml|10.1145/2627373.2627379|4|0|M. Bourgoin and E. Chailloux|3a54d960ab04fddb451800a65b55970a1c2e4382\n2015|Improving Type Error Messages in OCaml|10.4204/EPTCS.198.4|4|0|A. Charguéraud|8d994f1118904a90ede5abefec8c8b8c0ba5ab6e\n2008|Caml-Shcaml: an ocaml library for unix shell programming|10.1145/1411304.1411316|4|1|A. Heller and Jesse A. Tov|4ec33572f58d0f2a0411abdc88e483a7bdc9fde7\n2019|Chemoinformatics and structural bioinformatics in OCaml|10.1186/s13321-019-0332-0|4|0|F. Berenger and Kam Y. J. Zhang and Yoshihiro Yamanishi|b10743378eabcbc7d3415e4c43c6dcad192604f2\n2020|Retrofitting parallelism onto OCaml|10.1145/3408995|4|1|K. Sivaramakrishnan and Stephen Dolan and Leo White and S. Jaffer and T. Kelly and Anmol Sahoo and S. Parimala and Atul Dhiman and A. Madhavapeddy|0202d541aadfe56d9cce09c1c5c609098778b908\n2019|WCET of OCaml Bytecode on Microcontrollers: An Automated Method and Its Formalisation|10.4230/OASIcs.WCET.2019.5|2|0|S. Varoumas and T. Crolard|8b3c59637fb8f5c4d181125aa03b9fe48792a4c8\n2011|Using camlp4 for presenting dynamic mathematics on the web: DynaMoW, an OCaml language extension for the run-time generation of mathematical contents and their presentation on the web|10.1145/2034773.2034809|1|0|F. Chyzak and Alexis Darrasse|2fbcc662edca887550e0ce0463695b3ecfcf0381\n2021|Cameleer: a Deductive Verification Tool for OCaml|10.1007/978-3-030-81688-9_31|1|0|Mário Pereira and A. Ravara|00ba0130dc4666ce2b3aa584dbf32ec325cbd0ba" }, "occam-2": { "title": "Occam 2", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6ccfaaf57101386875d526b70abe23f1801ac621" ], "country": [ "United Kingdom" ], "originCommunity": [ "City Univerisy, London" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1344", "centralPackageRepositoryCount": 0 }, "occam-pi": { "title": "Occam π", "appeared": 2005, "type": "pl", "description": "occam-pi is a concurrent programming language using the process-oriented programming model, which aims to make it straightforward to write correct, expressive concurrent programs. occam-pi is supported on a variety of platforms by a collection of open source tools, and is used and maintained by a community of developers around the world.", "reference": [ "https://www.cs.kent.ac.uk/projects/ofa/kroc/occam-pi.pdf" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Kent" ], "wikipedia": { "related": [ "ia-32", "arduino", "occam" ], "summary": "In computer science, occam-π (or occam-pi) is the name of a variant of the programming language occam developed by the Kent Retargetable occam Compiler (KRoC) team at the University of Kent. The name reflects the introduction of elements of π-calculus (pi-calculus) into occam, especially concepts involving mobile agents (processes) and data. The language contains several extensions to occam 2.1, including: Nested protocols Run-time process creation Mobile channels, data, and processes Recursion Protocol inheritance Array constructors Extended rendezvous", "pageId": 2079775, "backlinksCount": 14, "dailyPageViews": 9, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Occam-π" }, "tryItOnline": "occam-pi", "fileType": "text", "centralPackageRepositoryCount": 0 }, "occam": { "title": "Occam", "appeared": 1983, "type": "pl", "creators": [ "David May" ], "documentation": [ "https://mahi.ucsd.edu/Steve/Occam/documentation.html" ], "country": [ "United Kingdom" ], "originCommunity": [ "Inmos International plc" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "write.full.string" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "ALT\n count1 < 100 & c1 ? data\n SEQ\n count1 := count1 + 1\n merged ! data\n count2 < 100 & c2 ? data\n SEQ\n count2 := count2 + 1\n merged ! data\n status ? request\n SEQ\n out ! count1\n out ! count2" ], "related": [ "ocaml", "ease", "go", "csp", "pascal", "haskell", "python" ], "summary": "occam is a concurrent programming language that builds on the communicating sequential processes (CSP) process algebra, and shares many of its features. It is named after William of Ockham of Occam's Razor fame. occam is an imperative procedural language (such as Pascal). It was developed by David May and others at INMOS, advised by Tony Hoare, as the native programming language for their transputer microprocessors, but implementations for other platforms are available. The most widely known version is occam 2; its programming manual was written by Steven Ericsson-Zenith and others at INMOS.", "pageId": 22660, "dailyPageViews": 61, "created": 2001, "backlinksCount": 63, "revisionCount": 213, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Occam_(programming_language)" }, "helloWorldCollection": [ "PROGRAM Hello\n-- Hello world in Occam\n#USE ioconv\n\nSEQ\n write.full.string(screen,\"Hello World!\")\n" ], "leachim6": { "filepath": "o/occam.occam", "fileExtensions": [ "occam" ], "example": [ "PROGRAM Hello\n#USE ioconv\n\nSEQ\n write.full.string(screen,\"Hello World\")\n" ], "id": "occam" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Occam", "tiobe": { "id": "Occam" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1002", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming In Occam||Geraint Jones|3878947|3.00|3|1", "isbndb": "year|publisher|title|authors|isbn13\n1988|Prentice Hall|Programming In Occam 2 (2nd Edition)|Jones, Geraint and Goldsmith, Michael|9780137303342\n1987|Prentice Hall|Programming in Occam (Prentice-hall International Series in Computer Science)|Jones, Geraint|9780137297733\n1983|Prentice Hall Direct|Occam Programming Manual|Inmos Limited|9780136292968\n1987||Tutorial Introduction to Occam Programming|D. Pountain and David May|9780632018475\n1987|Mcgraw-Hill (Tx)|A Tutorial Introduction to Occam Programming|D. Pountain and D. May|9780070506060\n2010||Occam (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130911133\n1987|Chartwell-bratt|Introduction To Occam 2 Programming|Bowler K|9780862381370\n1989|Ellis Horwood Ltd , Publisher|Concurrent Programming In Occam 2|J. Wexler|9780131617384\n1989|Springer|Introduction To Occam 2 On The Transputer|Graham R. Brookes and Andrew J. Stewart|9781349098774\n1995|Fairfax, Virginia, U.S.A.: Ios Pr Inc|Transputer and Occam Developments: WoTUG 18|Patrick Nixon|9789051992229\n1987|Alfred Waller Ltd|Occam Programming: A Practical Approach (computer Science Texts)|Jon Kerridge|9780632016594\n1987|Blackwell Science Inc|Occam Programming: A Practical Approach (computer Science Texts)|Jon Kerridge|9780632016587\n1995|Ios Pr Inc|Parallel Programming And Applications, (transputer And Occam Engineering Series)|Peter Fritzson (editor) and Leif Finmo (editor)|9789051992298\n1992|Ios Pr Inc|Parallel Computing: From Theory To Sound Practice, (transputer & Occam Engineering.)|Elie Milgrom and Spain) European Workshops On Parallel Computing (1992 Barcelona|9789051990805\n1989|Halsted Press|Concurrent Programming In Occam 2 (ellis Horwood Series In Computers And Their Applications)|John Wexler|9780470213261\n1997|Ios Pr Inc|Parallel Programming And Java: Wotug 20 : Proceedings Of The 20th World Occam And Transputer User Group Technical Meeting, 13-16 April 1997 (concurrent Systems Engineering Series, 50)|A. Bakkers|9789051993363", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1996|Correctness of Compiling Occam to Transputer Code|10.1093/comjnl/39.1.52|98|1|E. Börger and Igor Durdanovic|f3e345e58675d0e3f9790146d9f3e993239643c0\n1984|Denotational Semantics for occam|10.1007/3-540-15670-4_15|57|2|A. W. Roscoe|500c414d8c3c6c9415b95303a7e13964f98a0864\n1984|Occam and the transputer|10.1007/3-540-52494-0_36|37|0|D. May and R. Shepherd|fcaa79736b37aab664379f8e5c11ac2c44a61293\n1984|Signal processing with occam and the transputer|10.1049/IP-F-1:19840094|19|0|R. Taylor|f9924ad689040636a1db65fea0fbe2237797f872\n1987|Occam - A Programming Language for Multiprocessor Systems|10.1016/0096-0551(87)90010-5|17|0|M. Hull|c4ef6cc5864c1b64382c5faed190fca5bc7b7393\n1992|Occam in the specification and verification of microprocessors|10.1098/rsta.1992.0030|15|1|A. W. Roscoe|afe7083bdc771bec3448fb7397e1ba3276a5af72\n1994|Towards provably correct hardware/software partitioning using OCCAM|10.1109/HSC.1994.336704|14|0|E. Barros and A. Sampaio|d3fee6c16da01b27eb12fbeedc2684ed97c35499\n1985|Simulating hardware structures in occam|10.1049/sm.1985.0021|11|0|R. Dowsing|44671428e71cc803fea3c8b6a0289f4ee3251f4a\n1986|A multi‐processor implementation of occam|10.1002/spe.4380161002|6|0|A. J. Fisher|cd98581a8b7136f36eb2c1f56ae5dfd18b6c3d83\n1988|Communication protocols and concurrency: an Occam implementation of X.25|10.1109/DIGCOM.1988.4691|6|0|J. E. Boillat and P. K. Goode and P. Kropf and D. Bartschi and A. Spichiger|048cc18a760894e216d177ba7e4a6850f207ec37\n1987|Occam as a hardware description language|10.1049/sej.1987.0028|6|0|G. Collis and E. Kappos|80104fa26e57a6d0443e42b950c5ff4aef403395\n2008|Combining EDF Scheduling with occam using the Toc Programming Language|10.3233/978-1-58603-907-3-55|6|1|Martin Korsgaard and S. Hendseth|9fe18a983148b85afa39444b564804195cc2e395\n1988|Asynchronous communication on Occam|10.1145/57669.57673|5|0|N. Serbedzija|c62561c440fdd4b077bbb9886176163699eb704a\n1990|An operational semantics for occam|10.1007/BF01379186|5|0|Juanito Camilleri|85483aa850baea439d205f5c9b4c7edbc1c728ea\n1985|Design strategies for implementing systolic and wavefront arrays using OCCAM|10.1109/ICASSP.1985.1168511|4|0|R. Chapman and T. Durrani and T. Willey|29546b533af456e1dc0285d7bdb80e3c977bdd7b\n1985|Occam structures in control applications|10.1177/014233128500700501|4|0|D.I. Jones|1d93da2b8e40e1bf44324712a1a7450d671d8b59\n1993|Occam channels and Kernel Linda|10.1109/45.207168|3|0|T. K. Hazra|f9b7aca52fc6673007655cc77e77958b698c6e17\n1985|Occam and the transputer|10.1049/EP.1985.0185|3|0|R. Dettmer|ce1323c0d9cca7cbd98134e4f8bf1a500bc59625\n1990|Notes on termination of OCCAM processes|10.1145/101344.101348|2|0|D. Talia|a2a9d53aef0123e9d5bf2298e7f5a2381dd828af\n1989|A fully parallel, multi-processor software system using Inmos transputers and the occam programming language|10.1109/23.41110|2|0|R. Taylor and S. Taylor|d52f3d89a67938341f7a0e6108f1f62e92de0041\n1990|Notes on termination of OCCAM processes|10.1145/101344.101348|1|0|D. Talla|2c53c86d0b89a1faebe89a9284f5672f47daa341\n1990|Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM|10.1007/978-3-642-76602-2_15|1|0|T. Seifert and Ewald Speckenmeyer|6f45c90133e5f21fa0980577ef3f9a4d1dda3fe2\n1987|OCCAM - Eine Sprache für die Programmierung paralleler Prozesse/OCCAM - Α Parallel Programming Language|10.1524/itit.1987.29.4.226|1|0|H. Dietsch and R. Ulrich|62dde477262c7a62f81019d5067e8adc0df401c4\n1988|Protocol description and simulation in the OCCAM programming language|10.1016/0165-6074(88)90054-3|1|0|Gert Van Der Jeugt and E. Dirkx and J. Tiberghien|d4d625951c34040bee9ab4fb5198b758e0aaf62f" }, "ocl": { "title": "OCL", "appeared": 1997, "type": "pl", "description": "The Object Constraint Language (OCL) is a textual sublanguage of the Unified Modelling Language (UML). It can be used to express additional constraints on UML models that cannot be expressed, or are very difficult to express, with the graphical means provided by UML. OCL is based on first-order predicate logic but it uses a syntax similar to programming languages and closely related to the syntax of UML. It is, thus, more adequate for every-day modelling than pure first-order predicate logic.", "reference": [ "http://www-st.inf.tu-dresden.de/ocl/", "https://www.omg.org/spec/OCL/2.2/PDF" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "example": [ "context Person inv: self.age >=0\ncontext Person inv: self.age<18 implies self.cars->isEmpty()" ], "wikipedia": { "summary": "The Object Constraint Language (OCL) is a declarative language describing rules applying to Unified Modeling Language (UML) models developed at IBM and is now part of the UML standard. Initially, OCL was merely a formal specification language extension for UML. OCL may now be used with any Meta-Object Facility (MOF) Object Management Group (OMG) meta-model, including UML. The Object Constraint Language is a precise text language that provides constraint and object query expressions on any MOF model or meta-model that cannot otherwise be expressed by diagrammatic notation. OCL is a key component of the new OMG standard recommendation for transforming models, the Queries/Views/Transformations (QVT) specification.", "backlinksCount": 498, "pageId": 409006, "dailyPageViews": 186, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Object_Constraint_Language" }, "isbndb": "" }, "octave": { "title": "GNU Octave", "appeared": 1988, "type": "pl", "website": "https://gnu.org/software/octave/", "documentation": [ "https://docs.octave.org/interpreter/" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin-Madison", "University of Texas" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "% A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "% (\\d+\\.\\d*|\\d*\\.\\d+)([eEf][+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "% \\d+", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "%" ] ], "printToken": [ [ "printf" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "% create figure and panel on it\nf = figure;\n% create a button group\ngp = uibuttongroup (f, \"Position\", [ 0 0.5 1 1])\n% create a buttons in the group\nb1 = uicontrol (gp, \"style\", \"radiobutton\", \"string\", \"Choice 1\", \"Position\", [ 10 150 100 50 ]);\nb2 = uicontrol (gp, \"style\", \"radiobutton\", \"string\", \"Choice 2\", \"Position\", [ 10 50 100 30 ]);\n% create a button not in the group\nb3 = uicontrol (f, \"style\", \"radiobutton\",\"string\", \"Not in the group\",\"Position\", [ 10 50 100 50 ]);" ], "related": [ "linux", "c", "fortran", "scilab", "opengl", "gnuplot", "unix", "bash", "lisp", "qt" ], "summary": "GNU Octave is software featuring a high-level programming language, primarily intended for numerical computations. Octave helps in solving linear and nonlinear problems numerically, and for performing other numerical experiments using a language that is mostly compatible with Matlab. It may also be used as a batch-oriented language. Since it is part of the GNU Project, it is free software under the terms of the GNU General Public License. Octave is one of the major free alternatives to Matlab, others being Scilab and FreeMat. Scilab, however, puts less emphasis on (bidirectional) syntactic compatibility with Matlab than Octave does.", "pageId": 48707, "dailyPageViews": 467, "created": 2002, "backlinksCount": 613, "revisionCount": 653, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/GNU_Octave" }, "codeMirror": "octave", "pygmentsHighlighter": { "filename": "matlab.py", "fileExtensions": [ "m" ], "id": "Octave" }, "projectEuler": { "memberCount": { "2019": 137, "2022": 150 }, "id": "Octave" }, "helloWorldCollection": [ "#Hello World in Octave (http://www.octave.org/)\nprintf(\"Hello World\\n\");\n" ], "leachim6": { "filepath": "o/Octave.m", "fileExtensions": [ "m" ], "example": [ "printf(\"Hello World\");\n" ], "id": "Octave" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Octave", "quineRelay": "Octave", "rijuRepl": { "example": [ "disp(\"Hello, world!\")\n" ], "id": "https://riju.codes/octave" }, "tryItOnline": "octave", "tiobe": { "id": "GNU Octave" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2302", "ubuntuPackage": "octave", "jupyterKernel": [ "https://github.com/calysto/octave_kernel" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nScientific Computing with MATLAB and Octave|2003|Alfio Quarteroni|312792|4.10|10|0", "isbndb": "", "semanticScholar": "" }, "octopus": { "title": "Octopus", "appeared": 1993, "type": "pl", "reference": [ "https://link.springer.com/chapter/10.1007/978-1-4471-3564-7_4" ], "country": [ "Australia" ], "originCommunity": [ "University of Adelaide" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3537", "centralPackageRepositoryCount": 0 }, "octune": { "title": "Octune", "appeared": 2021, "type": "pl", "creators": [ "Gary Feng" ], "country": [ "Canada" ], "originCommunity": [ "The University of Waterloo" ], "githubRepo": { "firstCommit": 2021, "stars": 22, "forks": 1, "subscribers": 2, "created": 2021, "updated": 2022, "description": "A DSL for creating 8-bit style music", "issues": 0, "url": "https://github.com/fengctor/octune" }, "repoStats": { "firstCommit": 2021, "commits": 102, "committers": 3, "files": 70 } }, "odata": { "title": "Open Data Protcol", "appeared": 2007, "type": "protocol", "website": "https://www.odata.org/", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "domainName": { "registered": 2009, "awisRank": { "2022": 320477 }, "name": "odata.org" }, "example": [ "{\n \"@odata.context\": \"http://services.odata.org/V4/OData/OData.svc/$metadata#Products\",\n \"value\": [\n {\n \"ID\": 0,\n \"Name\": \"Meat\",\n \"Description\": \"Red Meat\",\n \"ReleaseDate\": \"1992-01-01T00:00:00Z\",\n \"DiscontinuedDate\": null,\n \"Rating\": 14,\n \"Price\": 2.5\n },\n {\n \"ID\": 1,\n \"Name\": \"Milk\",\n \"Description\": \"Low fat milk\",\n \"ReleaseDate\": \"1995-10-01T00:00:00Z\",\n \"DiscontinuedDate\": null,\n \"Rating\": 3,\n \"Price\": 3.5\n }\n ]\n}" ], "wikipedia": { "summary": "In computing, Open Data Protocol (OData) is an open protocol which allows the creation and consumption of queryable and interoperable RESTful APIs in a simple and standard way. Microsoft initiated OData in 2007. Versions 1.0, 2.0, and 3.0 are released under the Microsoft Open Specification Promise. Version 4.0 was standardized at OASIS, with a release in March 2014. In April 2015 OASIS submitted OData v4 and OData JSON Format v4 to ISO/IEC JTC 1 for approval as an international standard.The protocol enables the creation and consumption of REST APIs, which allow Web clients to publish and edit resources, identified using URLs and defined in a data model, using simple HTTP messages. OData shares some similarities with JDBC and with ODBC; like ODBC, OData is not limited to relational databases.", "backlinksCount": 39, "pageId": 26639400, "dailyPageViews": 244, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Open_Data_Protocol" }, "isbndb": "" }, "odbc": { "title": "Open Database Connectivity", "appeared": 1990, "type": "protocol", "country": [ "United States and Canada" ], "originCommunity": [ "Microsoft", "Simba Technologies Inc" ], "wikipedia": { "summary": "In computing, Open Database Connectivity (ODBC) is a standard application programming interface (API) for accessing database management systems (DBMS). The designers of ODBC aimed to make it independent of database systems and operating systems. An application written using ODBC can be ported to other platforms, both on the client and server side, with few changes to the data access code. ODBC accomplishes DBMS independence by using an ODBC driver as a translation layer between the application and the DBMS. The application uses ODBC functions through an ODBC driver manager with which it is linked, and the driver passes the query to the DBMS. An ODBC driver can be thought of as analogous to a printer driver or other driver, providing a standard set of functions for the application to use, and implementing DBMS-specific functionality. An application that can use ODBC is referred to as \"ODBC-compliant\". Any ODBC-compliant application can access any DBMS for which a driver is installed. Drivers exist for all major DBMSs, many other data sources like address book systems and Microsoft Excel, and even for text or comma-separated values (CSV) files. ODBC was originally developed by Microsoft and Simba Technologies during the early 1990s, and became the basis for the Call Level Interface (CLI) standardized by SQL Access Group in the Unix and mainframe field. ODBC retained several features that were removed as part of the CLI effort. Full ODBC was later ported back to those platforms, and became a de facto standard considerably better known than CLI. The CLI remains similar to ODBC, and applications can be ported from one platform to the other with few changes.", "backlinksCount": 208, "pageId": 168701, "dailyPageViews": 402, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Open_Database_Connectivity" }, "isbndb": "" }, "oden": { "title": "oden", "appeared": 2016, "type": "pl", "creators": [ "Oskar Wickström" ], "website": "https://oden-lang.github.io", "reference": [ "https://web.archive.org/web/20160603002614/https://oden-lang.org" ], "country": [ "Sweden" ], "originCommunity": [ "https://github.com/oden-lang" ], "githubRepo": { "firstCommit": 2015, "stars": 729, "forks": 23, "subscribers": 44, "created": 2015, "updated": 2022, "description": "The Oden Programming Language (NO LONGER IN ACTIVE DEVELOPMENT)", "issues": 15, "url": "https://github.com/oden-lang/oden" }, "repoStats": { "firstCommit": 2015, "commits": 582, "committers": 6, "files": 507 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n11183836|Oden: experimental, statically-typed functional language, built for Go ecosystem|http://oden-lang.org/|2016-02-26 20:06:41 UTC|1456517201|jaytaylor|80|127" }, "odin": { "title": "odin", "appeared": 2016, "type": "pl", "website": "https://odin-lang.org", "documentation": [ "https://odin-lang.org/docs/" ], "country": [ "The Netherlands and Denmark and Sweden and United States and Germany" ], "originCommunity": [ "https://github.com/odin-lang" ], "domainName": { "registered": 2017, "awisRank": { "2022": 1231489 }, "name": "odin-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "fmt.println" ] ], "stringToken": [ [ "\"" ] ], "example": [ "package main\n\nimport \"core:fmt\"\n\nmain :: proc() {\n program := \"+ + * 😃 - /\";\n accumulator := 0;\n\n for token in program {\n switch token {\n case '+': accumulator += 1;\n case '-': accumulator -= 1;\n case '*': accumulator *= 2;\n case '/': accumulator /= 2;\n case '😃': accumulator *= accumulator;\n case: // Ignore everything else\n }\n }\n\n fmt.printf(\"The program \\\"%s\\\" calculates the value %d\\n\",\n program, accumulator);\n}" ], "githubRepo": { "firstCommit": 2016, "stars": 2861, "forks": 236, "subscribers": 72, "created": 2016, "updated": 2022, "description": "Odin Programming Language", "issues": 217, "url": "https://github.com/odin-lang/Odin" }, "repoStats": { "firstCommit": 2016, "commits": 8502, "committers": 252, "files": 1241 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "odin" ], "aceMode": "text", "tmScope": "source.odin", "aliases": [ "odinlang", "odin-lang" ], "repos": 417, "id": "Odin" }, "githubBigQuery": { "repos": 6, "users": 5, "id": "Odin" }, "pygmentsHighlighter": { "filename": "archetype.py", "fileExtensions": [ "odin" ], "id": "ODIN" }, "leachim6": { "filepath": "o/Odin.odin", "fileExtensions": [ "odin" ], "example": [ "package main\n\nimport \"core:fmt\"\n\nmain :: proc() {\n fmt.println(\"Hello World\");\n}\n" ], "id": "Odin" }, "rijuRepl": { "example": [ "package main\n\nimport \"core:fmt\"\n\nmain :: proc() {\n fmt.printf(\"Hello, world!\\n\");\n}\n" ], "description": "Alternative to C with goals of simplicity, high performance, built for modern systems, and joy of programming", "fileExtensions": [ "odin" ], "website": "https://odin-lang.org/", "gitRepo": "https://github.com/odin-lang/Odin", "id": "https://riju.codes/odin" }, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Towards programmable enterprise WLANS with Odin|10.1145/2342441.2342465|315|35|L. Suresh and Julius Schulz-Zander and R. Merz and A. Feldmann and T. Vazão|5a1f93a0003bd2942c336b0c0bbfc96ade963bfc\n2019|Verilog Loop Unrolling, Module Generation, Part-Select and Arithmetic Right Shift Support in Odin II|10.1145/3339985.3358497|1|0|Scott Young and Alexandrea Demmings and N. E. Ivari and Jean-Philippe Legault and K. Kent|a26062d057c1b6a363b90283ef35ce7e34135f1d" }, "odrl": { "title": "ODRL", "appeared": 2000, "type": "pl", "country": [ "Australia" ], "originCommunity": [ "https://odrl.net" ], "wikipedia": { "example": [ "{\n \"@context\": \"http://www.w3.org/ns/odrl.jsonld\",\n \"uid\": \"http://example.com/policy:001\",\n \"permission\": [{\n \t\"target\": \"http://example.com/mysong.mp3\",\n\t\"assignee\": \"John\",\n\t\"action\": \"play\"\n }]\n}" ], "summary": "The Open Digital Rights Language (ODRL) is a policy expression language that provides a flexible and interoperable information model, vocabulary, and encoding mechanisms for representing statements about the usage of content and services. An example of ODRL policy follows, which can be intepreted as \"John can play mysong.mp3\".", "created": 2004, "backlinksCount": 9, "pageId": 1001985, "revisionCount": 68, "dailyPageViews": 12, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/ODRL" }, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Defining expressive access policies for linked data using the ODRL ontology 2.0|10.1145/2660517.2660530|36|3|Simon Steyskal and A. Polleres|4cdf228f77a96fb19da2d41f4dfc5cbfc926cd54\n2019|ODRL Policy Modelling and Compliance Checking|10.1007/978-3-030-31095-0_3|28|1|Marina De Vos and S. Kirrane and J. Padget and K. Satoh|68ef0a1d08ac6f801e0240968e57d5dc77d2904c\n2015|Towards Formal Semantics for ODRL Policies|10.1007/978-3-319-21542-6_23|20|1|Simon Steyskal and A. Polleres|6442e71ae9a783c859130001293cedef9d88904a" }, "oem": { "title": "OEM", "appeared": 1995, "type": "schema", "standsFor": "Object Exchange Model", "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "related": [ "rdf" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "\n <_895: Price 8.95>\n}>\n\n\n<&_895>\n}>\n<\"Credit Card\" \"Visa\">\n}>\n}>" ], "wikipedia": { "summary": "The Object Exchange Model (OEM) is a model for exchanging semi-structured data between object-oriented databases. It serves as the basic data model in numerous projects of the Stanford University Database Group, including Tsimmis, Lore, and C3. Slight variations of OEM have evolved across different Stanford projects. In Lore, labels are actually on parent-child \"links\" rather than objects. For example, if an OEM object has multiple parents, different parent objects may use different labels to identify that object. An atomic value encoding a person's name might be included in one complex object using the label \"Author\" and in another complex object using the label \"Editor.\" In C3, additional attributes are required for each object to annotate the changes to the object that have occurred over time.", "backlinksCount": 15, "pageId": 6366963, "dailyPageViews": 6, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/Object_Exchange_Model" } }, "ofl": { "title": "OFL", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3534e02af047f41a225334aeef1511f6629f0bea" ], "country": [ "France" ], "originCommunity": [ "Université de Versailles Saint-Quentin", "Institut national de recherche en sciences et technologies du numérique", "EDS International (France) SA" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5589", "centralPackageRepositoryCount": 0, "isbndb": "" }, "oforth": { "title": "oforth", "appeared": 2009, "type": "pl", "description": "Oforth is an imperative, dynamic typed, stack-based language. Oforth is a Forth dialect (Oforth is for Object + Forth). It keeps Forth mecanisms while implementing a full object model.", "website": "http://www.oforth.com/", "country": [ "Germany" ], "originCommunity": [ "http://www.oforth.com" ], "domainName": { "registered": 2009, "name": "oforth.com" }, "twitter": "https://twitter.com/oforthsupport" }, "ofx": { "title": "Open Financial Exchange", "appeared": 1997, "type": "xmlFormat", "country": [ "United States" ], "originCommunity": [ "Microsoft", "Intuit Inc", "Fiserv Inc" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Open_Financial_Exchange" } }, "ogdl": { "title": "Ordered graph data language", "appeared": 2002, "type": "textDataFormat", "website": "http://ogdl.org/", "standsFor": "Ordered graph data language", "country": [ "Various" ], "originCommunity": [ "https://ogdl.org/info.html" ], "domainName": { "registered": 2002, "name": "ogdl.org" }, "hasSemanticIndentation": { "example": "", "value": true } }, "ognl": { "title": "OGNL", "appeared": 2007, "type": "pl", "country": [ "United States" ], "originCommunity": [ "OGNL Technology, Inc" ], "wikipedia": { "related": [ "java", "antlr", "javacc", "thymeleaf", "mvel" ], "summary": "Object-Graph Navigation Language (OGNL) is an open-source Expression Language (EL) for Java, which, while using simpler expressions than the full range of those supported by the Java language, allows getting and setting properties (through defined setProperty and getProperty methods, found in JavaBeans), and execution of methods of Java classes. It also allows for simpler array manipulation. It is aimed to be used in Java EE applications with taglibs as expression language. OGNL was created by Luke Blanshard and Drew Davidson of OGNL Technology. OGNL development was continued by OpenSymphony, which closed in 2011. OGNL is developed now as a part of the Apache Commons.", "created": 2007, "backlinksCount": 13, "pageId": 9332907, "revisionCount": 104, "dailyPageViews": 29, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/OGNL" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "ohaskell": { "title": "O'Haskell", "appeared": 2002, "type": "pl", "reference": [ "https://www.sciencedirect.com/science/article/pii/S0167642302000266" ], "country": [ "United States" ], "originCommunity": [ "Oregon Graduate Institute of Science and Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3545", "centralPackageRepositoryCount": 0 }, "ohayo": { "title": "Ohayo", "appeared": 2017, "type": "pl", "isPublicDomain": true, "creators": [ "Breck Yunits" ], "description": "Ohayo is a fast and free tool for data science. Ohayo consists of a very high level programming language and a visual web studio for that language. The goal of Ohayo is to enable people to do data science at the speed of voice.", "website": "https://ohayo.computer/", "webRepl": [ "https://ohayo.computer/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/breck7/ohayo/issues" ], "related": [ "r" ], "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "web.get ohayo/packages/samples/welcome.md\n parser text\n hidden\n markdown.toHtml\ntemplates.list\nchallenge.list" ], "githubRepo": { "firstCommit": 2017, "stars": 109, "forks": 2, "subscribers": 7, "created": 2017, "updated": 2022, "description": "A free, fast, public domain data science studio", "issues": 56, "url": "https://github.com/breck7/ohayo" }, "repoStats": { "firstCommit": 2017, "commits": 198, "committers": 4, "files": 383 }, "isOpenSource": true }, "ohm": { "title": "ohm", "appeared": 2014, "type": "grammarLanguage", "country": [ "Germany and United States" ], "originCommunity": [ "https://github.com/harc" ], "githubRepo": { "stars": 4217, "forks": 198, "subscribers": 90, "created": 2015, "updated": 2022, "firstCommit": 2014, "description": "A library and language for building parsers, interpreters, compilers, etc.", "issues": 25, "url": "https://github.com/harc/ohm" }, "repoStats": { "firstCommit": 2014, "commits": 1869, "committers": 40, "files": 1281 }, "tryItOnline": "ohm", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "oil": { "title": "oil", "appeared": 2016, "type": "pl", "description": "Oil is a new Unix shell.", "website": "http://www.oilshell.org/", "aka": [ "OSH" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/oilshell" ], "domainName": { "registered": 2016, "awisRank": { "2022": 2209974 }, "name": "oilshell.org" }, "githubRepo": { "firstCommit": 2016, "stars": 2197, "forks": 111, "subscribers": 31, "created": 2016, "updated": 2022, "description": "Oil is a new Unix shell. It's our upgrade path from bash to a better language and runtime. It's also for Python and JavaScript users who avoid shell!", "issues": 421, "url": "https://github.com/oilshell/oil" }, "repoStats": { "firstCommit": 2016, "commits": 8191, "committers": 71, "files": 4811 }, "subreddit": [ { "memberCount": { "2017": 221, "2022": 436 }, "url": "https://reddit.com/r/oilshell" } ], "twitter": "https://twitter.com/oilshellblog", "wordRank": 981, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ok": { "title": "OK", "appeared": 2021, "type": "pl", "creators": [ "Jesse Duffield" ], "webRepl": [ "https://www.okquestionmark.org" ], "reference": [ "https://news.ycombinator.com/item?id=32640918" ], "country": [ "Australia" ], "originCommunity": [ "https://github.com/jesseduffield/OK/issues" ], "example": [ "let divide = fn(a, b) {\n return switch b {\n case 0: [NO!, \"cannot divide by zero\"];\n default: [a / b, \"\"];\n };\n};\n\nresult = divide(5, 0)\nswitch result[1] {\n case \"\": puts(result[0])\n default: puts(result[1]) // prints \"cannot divide by zero\"\n}\n" ], "githubRepo": { "firstCommit": 2021, "stars": 146, "forks": 10, "subscribers": 2, "created": 2021, "updated": 2022, "description": "Welcome to the future of programming languages: OK?", "issues": 3, "url": "https://github.com/jesseduffield/OK" }, "repoStats": { "firstCommit": 2021, "commits": 91, "committers": 3, "files": 76 } }, "oldas": { "title": "OLDAS", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2a0572e52fc09b5a8ebadd65bd4824155aeb86ab" ], "country": [ "United States" ], "originCommunity": [ "U.S. Naval Weapons Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=334", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "ole-protocol": { "title": "Object Linking and Embedding", "appeared": 1990, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "summary": "Object Linking & Embedding (OLE) is a proprietary technology developed by Microsoft that allows embedding and linking to documents and other objects. For developers, it brought OLE Control Extension (OCX), a way to develop and use custom thing of users using interface elements. On a technical level, an OLE object is any object that implements the IOleObject interface, possibly along with a wide range of other interfaces, depending on the object's needs.", "backlinksCount": 567, "pageId": 93500, "dailyPageViews": 250, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Object_Linking_and_Embedding" }, "isbndb": "" }, "olga": { "title": "OLGA", "appeared": 1985, "type": "pl", "reference": [ "https://dl.acm.org/citation.cfm?id=809592" ], "country": [ "Canada" ], "originCommunity": [ "University of Toronto" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1173", "centralPackageRepositoryCount": 0 }, "oli": { "title": "OLI", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/37a37bbfa6b7f9bf3480777b02a11f1d96df6a54" ], "country": [ "Hong Kong (SAR) and United Kingdom" ], "originCommunity": [ "The Chinese University of Hong Kong", "University of Manchester" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2851", "centralPackageRepositoryCount": 0 }, "oliver": { "title": "OLIVER", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d5be1aafdb22936f74bbb099d5c64f5c87ebd36c" ], "country": [ "United States" ], "originCommunity": [ "On-Line Systems, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6990", "wordRank": 6521, "centralPackageRepositoryCount": 0 }, "olog": { "title": "olog", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/94bbfdcdfcbf1684b551a8f1eba84b252f080c83" ], "country": [ "Canada" ], "originCommunity": [ "University of Regina" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7142", "centralPackageRepositoryCount": 0, "isbndb": "" }, "om": { "title": "Om", "appeared": 2012, "type": "pl", "creators": [ "Jason Erb" ], "website": "https://www.om-language.org/", "country": [ "Canada" ], "originCommunity": [ "https://github.com/sparist/Om/issues" ], "domainName": { "name": "om-language.org" }, "writtenIn": [ "cpp" ], "githubRepo": { "firstCommit": 2012, "stars": 145, "forks": 7, "subscribers": 15, "created": 2012, "updated": 2022, "description": "The Om programming language.", "issues": 11, "url": "https://github.com/sparist/Om" }, "repoStats": { "firstCommit": 2012, "commits": 678, "committers": 2, "files": 277 }, "isOpenSource": true }, "omar": { "title": "OMAR", "appeared": 1999, "type": "pl", "description": "Hypercosm produced a specialized programming language called OMAR (Object Modelling And Rendering) suitable for describing 3-D content. Hypercosm made available a web browser plugin for displaying this 3-D content. Unlike many other plugins, the Hypercosm plugin was available for Windows, MacOS, and Linux systems.", "reference": [ "http://www.highprogrammer.com/alan/hypercosm/" ], "standsFor": "Object Modelling And Rendering", "country": [ "United States" ], "originCommunity": [ "University of Wisconsin" ], "isbndb": "" }, "omega": { "title": "omega", "appeared": 2005, "type": "pl", "creators": [ "Tim Sheard" ], "description": "The Ωmega interpreter is styled after the Hugs Haskell Interpreter. The Ωmega syntax is based upon the syntax of Haskell. If you’re unsure of what syntax to use, a best first approximation is to use Haskell syntax. It works most of the time. While clearly descended from Haskell, Ωmega has several important syntactic and semantic differences.", "website": "http://web.cecs.pdx.edu/~sheard/Omega/index.html", "reference": [ "https://code.google.com/archive/p/omega" ], "country": [ "United States" ], "originCommunity": [ "Portland State University" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "{- A comment\n-}", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "{-", "-}" ] ], "example": [ "--\n-- This code written by James Hook\n-- This file should work with Omega version 1.1\n-- released May 23, 2005\n-- See http://www.cs.pdx.edu/~sheard/Omega/index.html\n\n{-- These are predefined by the compiler\nkind Nat = Z | S Nat\n\ndata Nat' n\n = Z where n = Z\n | forall m . S (Nat' m) where n = S m\n-}\n\n\ndata LE a b\n = LeBase where a = b\n | ex c . LeStep (LE a c) where b = S c\n\nreflLE :: LE a a\nreflLE = LeBase\n\ntransLE :: (LE a b) -> (LE b c) -> (LE a c)\ntransLE p LeBase = p\ntransLE p (LeStep q) = LeStep (transLE p q)\n\ncompare :: Nat' a -> Nat' b -> ((LE a b)+(LE b a))\ncompare Z Z = L LeBase\ncompare Z (S x) =\n case compare Z x of L w -> L (LeStep w)\ncompare (S x) Z =\n case compare Z x of L w -> R (LeStep w)\ncompare (S x) (S y) = mapP g g (compare x y )\n where mapP f g (L x) = L(f x)\n mapP f g (R x) = R(g x)\n g :: LE x y -> LE (S x) (S y)\n g LeBase = LeBase\n g (LeStep x) = LeStep (g x)\n\ndata MonoList min max\n = MonoNil (LE min max)\n | forall n a . MonoCons (Nat' n) (LE a n) (LE n max) (MonoList min a)\n\nappMonoList :: MonoList b c -> MonoList a b -> MonoList a c\nappMonoList (MonoNil bc) (MonoNil ab) =\n MonoNil (transLE ab bc)\nappMonoList (MonoNil bc) (MonoCons n an nb xs) =\n MonoCons n an (transLE nb bc) xs\nappMonoList (MonoCons m dm mc ys) xs =\n MonoCons m dm mc (appMonoList ys xs)\n\nsingletonMonoList :: Nat' n -> MonoList n n\nsingletonMonoList n = MonoCons n reflLE reflLE (MonoNil reflLE)\n\ndata IntervalList min max\n = ILNil (LE min max)\n | forall x . ILCons (Nat' x) (LE min x) (LE x max) (IntervalList min max)\n\npartition :: Nat' n -> LE a n -> LE n b -> IntervalList a b ->\n (IntervalList a n, IntervalList n b)\npartition x an nb xs = partitionAcc (ILNil an) (ILNil nb) xs\n where partitionAcc ls gs (ILNil ab) = (ls,gs)\n partitionAcc ls gs (ILCons y ay yb ys) =\n case compare y x of\n L yx -> partitionAcc (ILCons y ay yx ls) gs ys\n R xy -> partitionAcc ls (ILCons y xy yb gs) ys\n\nqsort :: IntervalList a b -> MonoList a b\nqsort (ILNil ab) = MonoNil ab\nqsort (ILCons x ax xb (ILNil ab)) = MonoCons x ax xb (MonoNil reflLE)\nqsort (ILCons x ax xb xs) =\n let (less,greater) = partition x ax xb xs\n sortedLess = qsort less\n sortedGreater = qsort greater\n in appMonoList sortedGreater (appMonoList (singletonMonoList x) sortedLess)\n\n--" ], "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|The Omega test: A fast and practical integer programming algorithm for dependence analysis|10.1145/125826.125848|950|82|W. Pugh|285024b15197b5face8bdef1d03f36949b8339c4\n2008|Programming in Omega|10.1007/978-3-540-88059-2_5|31|0|T. Sheard and Nathan Mishra-Linger|69077e4f231a87a15ae3e0dff8c718d5e36f729d" }, "ometa": { "title": "OMeta", "appeared": 2007, "type": "grammarLanguage", "country": [ "United States" ], "originCommunity": [ "Viewpoints Research Institute" ], "wikipedia": { "summary": "OMeta is a specialized object-oriented programming language for pattern matching, developed by Alessandro Warth and Ian Piumarta in 2007 under the Viewpoints Research Institute. The language is based on Parsing Expression Grammars (PEGs) rather than Context-Free Grammars with the intent of providing “a natural and convenient way for programmers to implement tokenizers, parsers, visitors, and tree-transformers”.OMeta's main goal is to allow a broader audience to use techniques generally available only to language programmers, such as parsing. It is also known for its use in quickly creating prototypes, though programs written in OMeta are noted to be generally less efficient than those written in vanilla (base language) implementations, such as JavaScript.OMeta is noted for its use in creating domain-specific languages, and especially for the maintainability of its implementations (Newcome). OMeta, like other meta languages, requires a host language; it was originally created as a COLA implementation.", "backlinksCount": 15, "pageId": 40847963, "dailyPageViews": 10, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/OMeta" } }, "omg-idl": { "title": "OMG IDL", "appeared": 2018, "type": "idl", "website": "https://www.omg.org/spec/IDL/About-IDL/", "standsFor": "OMG Interface Definition Language", "country": [ "United States" ], "originCommunity": [ "Object Management Group" ], "example": [ "interface A {\n typedef long L1;\n short opA (in L1 l_1);\n};\ninterface B {\n typedef short L1;\n L1 opB (in long l);\n};\ninterface C: B, A {\n typedef L1 L2; // Error: L1 ambiguous\n typedef A::L1 L3; // A::L1 is OK\n B::L1 opC (in L3 l_3); // All OK no ambiguities\n};" ], "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "idl", "pidl" ], "id": "OMG Interface Definition Language" }, "isbndb": "" }, "omgrofl": { "title": "Omgrofl", "appeared": 2006, "type": "esolang", "country": [ "Lithuania" ], "originCommunity": [ "https://github.com/OlegSmelov/omgrofl-interpreter/issues" ], "example": [ "lol iz 71\nwtf lol iz liek 71\n lmao lol\nbrb\nw00t Hello, World!\nrofl lol\nlol iz 101\nrofl lol\nlol iz 108\nrofl lol\nrofl lol\nlool iz 111\nrofl lool\nloool iz 44\nrofl loool\nloool iz 32\nrofl loool\nloool iz 87\nrofl loool\nrofl lool\nlool iz 114\nrofl lool\nrofl lol\nlol iz 100\nrofl lol\nlol iz 33\nrofl lol\nstfu\n" ], "githubRepo": { "firstCommit": 2012, "stars": 16, "forks": 9, "subscribers": 3, "created": 2012, "updated": 2021, "description": "Omgrofl interpreter", "issues": 1, "url": "https://github.com/OlegSmelov/omgrofl-interpreter" }, "repoStats": { "firstCommit": 2012, "commits": 57, "committers": 5, "files": 59 }, "githubLanguage": { "fileExtensions": [ "omgrofl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 3, "id": "Omgrofl" }, "githubBigQuery": { "repos": 8, "users": 8, "id": "Omgrofl" }, "leachim6": { "filepath": "o/Omgrofl.omgrofl", "fileExtensions": [ "omgrofl" ], "example": [ "lol iz 72\nrofl lol\nlol iz 101\nrofl lol\nlol iz 108\nrofl lol\nrofl lol\nlool iz 111\nrofl lool\nloool iz 44\nrofl loool\nloool iz 32\nrofl loool\nloool iz 87\nrofl loool\nrofl lool\nlool iz 114\nrofl lool\nrofl lol\nlol iz 100\nrofl lol\nlol iz 33\nrofl lol\n" ], "id": "Omgrofl" }, "rijuRepl": { "example": [ "lol iz 72\nrofl lol\nlol iz 101\nrofl lol\nlol iz 108\nrofl lol\nrofl lol\nlool iz 111\nrofl lool\nloool iz 44\nrofl loool\nloool iz 32\nrofl loool\nloool iz 119\nrofl loool\nrofl lool\nlool iz 114\nrofl lool\nrofl lol\nlol iz 100\nrofl lol\nlol iz 33\nrofl lol\nlol iz 10\nrofl lol\n" ], "id": "https://riju.codes/omgrofl" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "omikron-basic": { "title": "Omikron BASIC", "appeared": 1985, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "Omikron.Soft + Hardware GmbH" ], "wikipedia": { "dailyPageViews": -1, "url": "https://de.wikipedia.org/wiki/Omikron_BASIC" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "omnimark": { "title": "OMNIMARK", "appeared": 1980, "type": "pl", "reference": [ "http://developers.omnimark.com/documentation/v4r0/narrativ/11.htm" ], "country": [ "Canada" ], "originCommunity": [ "Exoterica Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1998", "centralPackageRepositoryCount": 0 }, "omnis-studio": { "title": "Omnis Studio", "appeared": 1982, "type": "pl", "wikipedia": { "related": [ "linux", "android", "java", "ucsd-pascal" ], "summary": "Omnis Studio is a rapid application development (RAD) tool that allows programmers and application developers to create enterprise, web, and mobile applications for Windows, Linux, and macOS personal computers and servers across all business sectors. The Omnis JavaScript Client allows developers to build all types of web applications and mobile applications by presenting a highly functional interface in the user's desktop web browser, or on tablet and mobile devices. The business logic and database access in such web and mobile applications is handled by the Omnis server. The Omnis server also can act as a hub between database servers, services based on Java and .Net and clients like Adobe Air & Flex transferring data in the form of XML or Web services.", "created": 2006, "backlinksCount": 22, "pageId": 4732813, "revisionCount": 171, "dailyPageViews": 17, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/Omnis_Studio" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "omnitab-80": { "title": "OMNITAB 80", "appeared": 1980, "type": "pl", "description": "OMNITAB 80 is a high-level statistical analysis program. OMNITAB, the precursor of Minitab(TM), was developed in the Statistical Engineering Division and is maintained by the Statistical Engineering Division. OMNITAB performs many different statistical analyses including: arithmetic and trigonometric calculations, and matrix and array operations. The software responds to simple instructions and uses reliable computational algorithms.", "reference": [ "https://www.nist.gov/itl/sed/omnitab-80" ], "country": [ "United States" ], "originCommunity": [ "National Institute of Standards and Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6805" }, "omnitab-ii": { "title": "OMNITAB II", "appeared": 1970, "type": "pl", "reference": [ "https://dl.acm.org/doi/10.1145/356599.356600" ], "country": [ "United States" ], "originCommunity": [ "National Institute of Standards and Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4641" }, "omnitab": { "title": "OMNITAB", "appeared": 1963, "type": "pl", "reference": [ "https://www.govinfo.gov/content/pkg/GOVPUB-C13-daaa8e8e414a51b481ac1395f0f356d5/pdf/GOVPUB-C13-daaa8e8e414a51b481ac1395f0f356d5.pdf" ], "country": [ "United States" ], "originCommunity": [ "National Bureau of Standards" ], "hopl": "https://hopl.info/showlanguage.prx?exp=559" }, "one-man-language": { "title": "One-man-language", "appeared": 1977, "type": "pl", "description": "A language for a dissertation. Miceli, James J. Some Experiences with a One-man Language. Diss. University of Toronto, Department of Computer Science, 1977.", "reference": [ "https://www.semanticscholar.org/paper/A-minisystem-programming-language-Lechner-Stallings/ef68c74958a8dddcdbf25c875af647fdc6d938b7" ], "country": [ "Canada" ], "originCommunity": [ "University of Toronto" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5870", "isbndb": "" }, "onex": { "title": "onex", "appeared": 2014, "type": "application", "description": "This is the vision of the \"Object Network\" and its app and programming system called \"Onex\". Onex is a mobile app that will enable you to build your own programs and manage your own data, directly on your phone or tablet. It's as easy as spreadsheets, but can scale up over the network.", "website": "http://object.network/", "reference": [ "https://scholar.google.com/citations?user=NCfVEdoAAAAJ&hl=en", "https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0" ], "country": [ "United Kingdom" ], "originCommunity": [ "http://cilux.org" ], "domainName": { "registered": 2014, "name": "object.network" } }, "oniguruma": { "title": "oniguruma", "appeared": 2002, "type": "queryLanguage", "reference": [ "https://macromates.com/manual/en/regular_expressions" ], "country": [ "Denmark" ], "originCommunity": [ "MacroMates Ltd" ] }, "onnx": { "title": "onnx", "appeared": 2017, "type": "binaryDataFormat", "creators": [ "Junjie Bai" ], "website": "https://onnx.ai/", "country": [ "United States" ], "originCommunity": [ "https://github.com/onnx" ], "domainName": { "registered": 2017, "awisRank": { "2017": 957966, "2022": 408680 }, "name": "onnx.ai" }, "githubRepo": { "stars": 12803, "forks": 2823, "subscribers": 426, "created": 2017, "updated": 2022, "firstCommit": 2017, "description": "Open standard for machine learning interoperability", "issues": 291, "url": "https://github.com/onnx/onnx" }, "twitter": "https://twitter.com/onnxai", "fileType": "binary", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "onyx": { "title": "Onyx", "appeared": 1989, "type": "pl", "creators": [ "Jason Evans" ], "reference": [ "https://directory.fsf.org/wiki/Onyx", "https://en.everybodywiki.com/Onyx_(programming_language)" ], "country": [ "Unknown" ], "originCommunity": [ "https://web.archive.org/web/20160206090152/http://www.canonware.com/" ], "wikipedia": { "summary": "Onyx is a stack-oriented, multi-threaded, interpreted, general purpose programming language .", "pageId": 3304684, "created": 2005, "backlinksCount": 8, "revisionCount": 29, "dailyPageViews": 9, "appeared": 1989, "url": "https://web.archive.org/web/20200125004752/https://en.wikipedia.org/wiki/Onyx_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Onyx", "fileType": "text", "centralPackageRepositoryCount": 0 }, "ooc": { "title": "ooc", "appeared": 2009, "type": "pl", "creators": [ "Amos Wenger" ], "website": "https://ooc-lang.org/", "country": [ "United States and Germany and Switzerland" ], "originCommunity": [ "https://github.com/ooc-lang" ], "domainName": { "registered": 2009, "awisRank": { "2022": 4397938 }, "name": "ooc-lang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2009, "stars": 382, "forks": 42, "subscribers": 32, "created": 2009, "updated": 2022, "description": ":ocean: self-hosted ooc compiler that generates c99", "issues": 76, "url": "https://github.com/ooc-lang/rock" }, "repoStats": { "firstCommit": 2009, "commits": 4013, "committers": 59, "files": 767 }, "githubLanguage": { "fileExtensions": [ "ooc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.ooc", "repos": 227, "id": "ooc" }, "githubBigQuery": { "repos": 126, "users": 69, "id": "ooc" }, "pygmentsHighlighter": { "filename": "ooc.py", "fileExtensions": [ "ooc" ], "id": "Ooc" }, "linguistGrammarRepo": { "firstCommit": 2009, "lastCommit": 2014, "committerCount": 3, "commitCount": 20, "url": "https://github.com/nilium/ooc.tmbundle" }, "leachim6": { "filepath": "o/Ooc.ooc", "fileExtensions": [ "ooc" ], "example": [ "main: func {\n \"Hello World\" println()\n}\n\n" ], "id": "Ooc" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:OOC", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ook": { "title": "Ook", "appeared": 2005, "type": "esolang", "creators": [ "David Morgan-Mar" ], "website": "https://www.dangermouse.net/esoteric/ook.html", "reference": [ "https://esolangs.org/wiki/Ook!" ], "country": [ "Australia" ], "originCommunity": [ "https://www.dangermouse.net" ], "rijuRepl": { "example": [ "Ook. Ook? Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook.\nOok. Ook. Ook. Ook. Ook! Ook? Ook? Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook.\nOok. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook? Ook! Ook! Ook? Ook! Ook? Ook.\nOok! Ook. Ook. Ook? Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook.\nOok. Ook. Ook! Ook? Ook? Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook?\nOok! Ook! Ook? Ook! Ook? Ook. Ook. Ook. Ook! Ook. Ook. Ook. Ook. Ook. Ook. Ook.\nOok. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook! Ook. Ook! Ook. Ook. Ook. Ook. Ook.\nOok. Ook. Ook! Ook. Ook. Ook? Ook. Ook? Ook. Ook? Ook. Ook. Ook. Ook. Ook. Ook.\nOok. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook! Ook? Ook? Ook. Ook. Ook.\nOok. Ook. Ook. Ook. Ook. Ook. Ook. Ook? Ook! Ook! Ook? Ook! Ook? Ook. Ook! Ook.\nOok. Ook? Ook. Ook? Ook. Ook? Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook.\nOok. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook! Ook? Ook? Ook. Ook. Ook.\nOok. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook.\nOok. Ook? Ook! Ook! Ook? Ook! Ook? Ook. Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook.\nOok? Ook. Ook? Ook. Ook? Ook. Ook? Ook. Ook! Ook. Ook. Ook. Ook. Ook. Ook. Ook.\nOok! Ook. Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook.\nOok! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook! Ook!\nOok! Ook. Ook. Ook? Ook. Ook? Ook. Ook. Ook! Ook.\n" ], "id": "https://riju.codes/ook" }, "esolang": "https://esolangs.org/wiki/Ook!", "isbndb": "" }, "oolp": { "title": "OOLP", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dc33966bfc3e26f521e3723aade4ac5ed9000bc4" ], "country": [ "United States" ], "originCommunity": [ "Rutgers University", "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7147", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "oopal": { "title": "OOPAL", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/07e1ba85e3da92074c7af917aa21f4a7320fe717" ], "country": [ "Switzerland" ], "originCommunity": [ "University Of Bern" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8254", "centralPackageRepositoryCount": 0 }, "oops": { "title": "OOPS", "appeared": 1986, "type": "pl", "creators": [ "Els Laenens", "Dirk Vermeir" ], "description": "OOPS: A Knowledge Representation Language", "country": [ "The Netherlands and Belgium" ], "originCommunity": [ "Philips International", "University of Antwerp" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1249", "wordRank": 7564 }, "oopsilon": { "title": "oopsilon", "appeared": 2017, "type": "esolang", "description": "Oopsilon is an object-oriented language in the Kayian tradition which is (perhaps uniquely) founded on a negativist philosophy drawing on critical theory and stressing the importance of hermeneutics in understanding the problems programmers experience.", "country": [ "Scotland" ], "originCommunity": [ "https://github.com/Oopsilon" ], "githubRepo": { "stars": 8, "forks": 0, "subscribers": 2, "created": 2017, "updated": 2017, "firstCommit": 2017, "description": "Main repository - implementation of the dynamic programming environment Oopsilon", "issues": 1, "url": "https://github.com/Oopsilon/Oopsilon" }, "repoStats": { "firstCommit": 2022, "commits": 9, "committers": 2, "files": 51 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "oopsp": { "title": "OOPS+", "appeared": 1988, "type": "pl", "creators": [ "Els Laenens", "Dirk Vermeir" ], "reference": [ "https://www.lirmm.fr/~ducour/Doc-objets/ECOOP/papers/0322/03220350.pdf", "https://semanticscholar.org/paper/784b6b440a6a3afebf0a7e6eea988f55897e8d1e" ], "country": [ "The Netherlands and Belgium" ], "originCommunity": [ "Philips International", "University of Antwerp" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6233", "centralPackageRepositoryCount": 0 }, "ooxml": { "title": "Office Open XML", "appeared": 2006, "type": "xmlFormat", "documentation": [ "https://learn.microsoft.com/en-us/office/open-xml/open-xml-sdk" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "related": [ "xml", "excel-app" ], "summary": "Office Open XML (also informally known as OOXML or Microsoft Open XML (MOX)) is a zipped, XML-based file format developed by Microsoft for representing spreadsheets, charts, presentations and word processing documents. The format was initially standardized by Ecma (as ECMA-376), and by the ISO and IEC (as ISO/IEC 29500) in later versions. Starting with Microsoft Office 2007, the Office Open XML file formats have become the default target file format of Microsoft Office. Microsoft Office 2010 provides read support for ECMA-376, read/write support for ISO/IEC 29500 Transitional, and read support for ISO/IEC 29500 Strict. Microsoft Office 2013 and Microsoft Office 2016 additionally support both reading and writing of ISO/IEC 29500 Strict.", "pageId": 3300610, "dailyPageViews": 560, "created": 2005, "backlinksCount": 1196, "revisionCount": 5072, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Office_Open_XML" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "opa": { "title": "Opa", "appeared": 2011, "type": "pl", "website": "http://opalang.org", "documentation": [ "https://github.com/MLstate/opalang/wiki/A-tour-of-Opa" ], "country": [ "France" ], "originCommunity": [ "https://github.com/MLstate" ], "domainName": { "registered": 2010, "name": "opalang.org" }, "hasTypeInference": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "jlog" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "and", "as", "begin", "case", "client", "css", "database", "db", "do", "else", "end", "external", "forall", "function", "if", "import", "match", "module", "or", "package", "parser", "rec", "server", "then", "type", "val", "with", "xml_parser" ], "githubRepo": { "firstCommit": 2010, "stars": 1227, "forks": 130, "subscribers": 45, "created": 2011, "updated": 2022, "description": "The Opa Language for Web Application Development", "issues": 37, "url": "https://github.com/MLstate/opalang" }, "repoStats": { "firstCommit": 2010, "commits": 4609, "committers": 71, "files": 1707 }, "wikipedia": { "example": [ "Server.start(Server.http,\n { title: \"Hello\"\n , page: function() {

Hello, web!

}\n }\n)" ], "related": [ "linux", "ocaml", "erlang", "javascript", "jquery", "html", "mongodb", "postgresql", "sql", "dart", "haxe", "coffeescript" ], "summary": "Opa is an open-source programming language for developing scalable web applications. It can be used for both client-side and server-side scripting, where complete programs are written in Opa and subsequently compiled to Nodejs on the server and JavaScript on the client, with the compiler automating all communication between the two. Opa implements strong, static typing, which can be helpful in protecting against security issues such as SQL injections and cross-site scripting attacks. The language was first officially presented at the OWASP conference in 2010, and the source code was released on GitHub in June 2011, under a GNU Affero General Public License. Later, the license changed to the MIT license for the framework part (library) and AGPL for the compiler so that applications written in Opa can be released under any license, proprietary or open source.", "pageId": 32976878, "dailyPageViews": 53, "created": 2011, "backlinksCount": 94, "revisionCount": 149, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Opa_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "opa" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.opa", "repos": 76, "id": "Opa" }, "githubBigQuery": { "repos": 58, "users": 50, "id": "Opa" }, "pygmentsHighlighter": { "filename": "ml.py", "fileExtensions": [ "opa" ], "id": "Opa" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2014, "committerCount": 3, "commitCount": 23, "sampleCount": 2, "example": [ "/**\n * To compile & run on port 8080:\n * opa hello_syntax1.opa --\n */\nserver = Server.one_page_server(\n \"Hello, world\",\n -> (

Hello, world

)\n)\n\n" ], "url": "https://github.com/mads379/opa.tmbundle" }, "leachim6": { "filepath": "o/Opa.opa", "fileExtensions": [ "opa" ], "example": [ "jlog(\"Hello World\")\n" ], "id": "Opa" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Opa", "twitter": "https://twitter.com/opalang", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|Opa Application Development|Wenbo, Li|9781782163749\n20130612|Packt Publishing|Opa Application Development|Li Wenbo|9781782163756", "semanticScholar": "" }, "opal": { "title": "Opal", "appeared": 1994, "type": "pl", "reference": [ "https://link.springer.com/chapter/10.1007%2F3-540-57840-4_34" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/TU-Berlin" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "githubRepo": { "firstCommit": 1998, "stars": 6, "forks": 2, "subscribers": 6, "created": 2016, "updated": 2020, "description": "Opal - Optimized Applicative Language", "issues": 0, "url": "https://github.com/TU-Berlin/opal" }, "repoStats": { "firstCommit": 1998, "commits": 833, "committers": 9, "files": 3723 }, "wikipedia": { "example": [ "IMPLEMENTATION GCD\n IMPORT Nat COMPLETELY\n DEF GCD(a,b) == IF a % b = 0 THEN b\n ELSE IF a-b < b THEN GCD(b,a-b)\n ELSE GCD(a-b,b)\n FI\n FI" ], "summary": "OPAL (OPtimized Applicative Language) is a functional programming language first developed at the Technical University of Berlin.", "pageId": 1936835, "created": 2005, "backlinksCount": 5, "revisionCount": 23, "dailyPageViews": 11, "url": "https://en.wikipedia.org/wiki/Opal_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "opal" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.opal", "repos": 14, "id": "Opal" }, "githubBigQuery": { "repos": 10, "users": 9, "id": "Opal" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 3, "commitCount": 46, "sampleCount": 1, "example": [ "-- Deepak Chopra nonsense text generator\n-- see https://github.com/StoneCypher/DeepakChopra_Opal/\n\nstarts = [\"Experiential truth \", \"The physical world \", \"Non-judgment \", \"Quantum physics \"]\nmiddles = [\"nurtures an \", \"projects onto \", \"imparts reality to \", \"constructs with \"]\nqualifiers = [\"abundance of \", \"the barrier of \", \"self-righteous \", \"potential \"]\nfinishes = [\"marvel.\", \"choices.\", \"creativity.\", \"actions.\"]\n\nalert starts.sample + middles.sample + qualifiers.sample + finishes.sample" ], "url": "https://github.com/artifactz/sublime-opal" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "opam-pm": { "title": "opam-pm", "appeared": 2012, "type": "packageManager", "creators": [ "Fabrice Le Fessant" ], "website": "https://opam.ocaml.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/ocaml" ], "domainName": { "name": "opam.ocaml.org" }, "githubRepo": { "firstCommit": 2012, "stars": 1040, "forks": 324, "subscribers": 56, "created": 2012, "updated": 2022, "description": "opam is a source-based package manager. It supports multiple simultaneous compiler installations, flexible package constraints, and a Git-friendly development workflow.", "issues": 445, "url": "https://github.com/ocaml/opam" }, "packageCount": 2224, "packageInstallCount": 10000000, "forLanguages": [ "ocaml" ] }, "open-nn": { "title": "OpenNN", "appeared": 2003, "type": "library", "website": "https://www.opennn.net/", "documentation": [ "https://www.opennn.net/documentation/opennn_start.html" ], "originCommunity": [ "https://github.com/Artelnics/opennn" ], "domainName": { "name": "opennn.net" }, "writtenIn": [ "cpp" ], "githubRepo": { "stars": 931, "forks": 320, "updated": 2022, "description": "OpenNN is a software library written in C++ for advanced analytics. It implements neural networks, the most successful machine learning method.", "issues": 5, "url": "https://github.com/Artelnics/opennn" }, "wikipedia": { "summary": "OpenNN (Open Neural Networks Library) is a software library written in the C++ programming language which implements neural networks, a main area of deep learning research.", "pageId": 42129549, "dailyPageViews": 11, "url": "https://en.wikipedia.org/wiki/OpenNN" } }, "open-shading-language": { "title": "Open Shading Language", "appeared": 2008, "type": "pl", "website": "http://openshadinglanguage.com", "country": [ "Canada" ], "originCommunity": [ "Sony Pictures Imageworks Inc" ], "domainName": { "registered": 2012, "name": "openshadinglanguage.com" }, "githubRepo": { "firstCommit": 2008, "stars": 1698, "forks": 322, "subscribers": 192, "created": 2011, "updated": 2022, "description": "Advanced shading language for production GI renderers", "issues": 36, "url": "https://github.com/imageworks/openshadinglanguage" }, "repoStats": { "firstCommit": 2008, "commits": 3993, "committers": 109, "files": 2949 }, "wikipedia": { "summary": "Open Shading Language (OSL) is a shading language developed by Sony Pictures Imageworks for use in its Arnold Renderer. It is also supported by Otoy's Octane Render, V-Ray 3, and by the Cycles render engine in Blender (starting with Blender 2.65). OSL's surface and volume shaders define how surfaces or volumes scatter light in a way that allows for importance sampling; thus, it is well suited for physically-based renderers that support ray tracing and global illumination.", "backlinksCount": 15, "pageId": 43647388, "dailyPageViews": 24, "url": "https://en.wikipedia.org/wiki/Open_Shading_Language" }, "isbndb": "" }, "openada": { "title": "OpenAda", "appeared": 2000, "type": "pl", "creators": [ "Patrick Rogers", "Andy Wellings" ], "reference": [ "https://semanticscholar.org/paper/1fdbcde71a7e1509d5676d10d39d2a77d831b7bd" ], "country": [ "United States and United Kingdom" ], "originCommunity": [ "Ada Core Technologies", "University of York" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3611", "centralPackageRepositoryCount": 0 }, "opencl": { "title": "OpenCL", "appeared": 2009, "type": "pl", "website": "https://www.khronos.org/opencl", "documentation": [ "https://www.khronos.org/opencl/" ], "originCommunity": [ "Khronos Group" ], "releaseNotesUrl": "https://www.khronos.org/opencl/", "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "wikipedia": { "example": [ "// This kernel computes FFT of length 1024. The 1024 length FFT is decomposed into\n // calls to a radix 16 function, another radix 16 function and then a radix 4 function\n\n __kernel void fft1D_1024 (__global float2 *in, __global float2 *out,\n __local float *sMemx, __local float *sMemy) {\n int tid = get_local_id(0);\n int blockIdx = get_group_id(0) * 1024 + tid;\n float2 data[16];\n\n // starting index of data to/from global memory\n in = in + blockIdx; out = out + blockIdx;\n\n globalLoads(data, in, 64); // coalesced global reads\n fftRadix16Pass(data); // in-place radix-16 pass\n twiddleFactorMul(data, tid, 1024, 0);\n\n // local shuffle using local memory\n localShuffle(data, sMemx, sMemy, tid, (((tid & 15) * 65) + (tid >> 4)));\n fftRadix16Pass(data); // in-place radix-16 pass\n twiddleFactorMul(data, tid, 64, 4); // twiddle factor multiplication\n\n localShuffle(data, sMemx, sMemy, tid, (((tid >> 4) * 64) + (tid & 15)));\n\n // four radix-4 function calls\n fftRadix4Pass(data); // radix-4 function number 1\n fftRadix4Pass(data + 4); // radix-4 function number 2\n fftRadix4Pass(data + 8); // radix-4 function number 3\n fftRadix4Pass(data + 12); // radix-4 function number 4\n\n // coalesced global writes\n globalStores(data, out, 64);\n }" ], "related": [ "opengl", "android", "freebsd", "linux", "ia-32", "cuda", "c", "python", "java", "llvmir", "mathematica", "javascript", "arm", "x86-isa", "ptx", "metal", "sequencel" ], "summary": "Open Computing Language (OpenCL) is a framework for writing programs that execute across heterogeneous platforms consisting of central processing units (CPUs), graphics processing units (GPUs), digital signal processors (DSPs), field-programmable gate arrays (FPGAs) and other processors or hardware accelerators. OpenCL specifies programming languages (based on C99 and C++11) for programming these devices and application programming interfaces (APIs) to control the platform and execute programs on the compute devices. OpenCL provides a standard interface for parallel computing using task- and data-based parallelism. OpenCL is an open standard maintained by the non-profit technology consortium Khronos Group. Conformant implementations are available from Altera, AMD, Apple, ARM, Creative, IBM, Imagination, Intel, Nvidia, Qualcomm, Samsung, Vivante, Xilinx, and ZiiLABS.", "pageId": 17861917, "dailyPageViews": 702, "created": 2008, "backlinksCount": 586, "revisionCount": 1164, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/OpenCL" }, "githubLanguage": { "fileExtensions": [ "cl", "opencl" ], "trendingProjectsCount": 0, "type": "programming", "group": "C", "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-csrc", "tmScope": "source.c", "repos": 0, "id": "OpenCL" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 23, "commitCount": 359, "sampleCount": 2, "example": [ "/* Old-style comment. */\n\n// New-style comment.\n\ntypedef float foo_t;\n\n#ifndef ZERO\n#define ZERO (0.0)\n#endif\n\n#define FOO(x) ((x) + \\\n ZERO)\n\n__kernel\nvoid foo(__global const foo_t * x, __local foo_t y, const uint n)\n{\n barrier(CLK_LOCAL_MEM_FENCE);\n\n if (n > 42) {\n *x += y;\n }\n}\n\n" ], "url": "https://github.com/textmate/c.tmbundle" }, "indeedJobs": { "2017": 266, "query": "opencl engineer" }, "officialBlogUrl": [ "https://opencl.org/blog/" ], "meetup": { "memberCount": 4546, "groupCount": 37, "url": "https://www.meetup.com/topics/opencl" }, "tiobe": { "id": "OpenCL" }, "gdbSupport": true, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nOpenCL Programming Guide|2011|Aaftab Munshi|15004505|4.00|17|0\nHeterogeneous Computing with OpenCL|2003|Benedict Gaster|16333886|4.05|21|0\nHeterogeneous Computing with OpenCL: Revised OpenCL 1.2 Edition|2012|Benedict Gaster|39876843|3.71|7|0\nThe OpenCL Programming Book|2010|Fixstars Corporation|13510611|4.00|1|1\nHeterogeneous Computing with Opencl 2.0|2014|David R. Kaeli|42380828|3.75|4|0\nThe OpenCL Programming Book|2010|Ryoji Tsuchiyama|27510693|3.50|6|0\nOpencl Programming by Example|2013|Ravishekhar Banger|28760828|5.00|1|1\nOpencl Parallel Programming Development Cookbook|2013|Raymond Tay|26278040|4.00|1|1\nOpencl Programming by Example|2013|Ravishekhar Banger|28760826|0.0|0|0\nOpencl Programming Guide|2011|Aaftab Munshi|41548045|0.0|0|0\nOpenCL Programming by Example|2013|Ravishekhar Banger|41406764|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2015|Morgan Kaufmann|Heterogeneous Computing with OpenCL 2.0|Kaeli, David R. and Mistry, Perhaad and Schaa, Dana and Zhang, Dong Ping|9780128014141\n2011|Addison-Wesley Professional|OpenCL Programming Guide|Munshi, Aaftab|9780321749642\n2013|Packt Publishing|OpenCL Programming by Example|Banger, Ravishekhar and Bhattacharyya, Koushik|9781849692342\n2013|Packt Publishing|OpenCL Parallel Programming Development Cookbook|Tay, Raymond|9781849694520\n20110930|Elsevier S & T|Heterogeneous Computing with OpenCL|Benedict Gaster|9780123877673\n2012|Morgan Kaufmann|Heterogeneous Computing with OpenCL: Revised OpenCL 1.2 Edition|Gaster, Benedict and Howes, Lee and Kaeli, David R. and Mistry, Perhaad and Schaa, Dana|9780124058941\n2013|Packt Publishing|OpenCL Programming by Example|Banger, Ravishekhar and Bhattacharyya, Koushik|9781849692359\n2015|Morgan Kaufmann|Heterogeneous Computing with OpenCL 2.0|Kaeli, David R. and Mistry, Perhaad and Schaa, Dana and Zhang, Dong Ping|9780128016497\n2011|Addison-Wesley Professional|OpenCL Programming Guide (OpenGL)|Munshi, Aaftab and Gaster, Benedict and Mattson, Timothy G. and Ginsburg, Dan|9780132594554\n2011|Manning Publications|OpenCL in Action: How to Accelerate Graphics and Computations|Scarpino, Matthew|9781617290176\n2012|Morgan Kaufmann|Heterogeneous Computing with OpenCL: Revised OpenCL 1.2 Edition|Gaster, Benedict and Howes, Lee and Kaeli, David R. and Mistry, Perhaad and Schaa, Dana|9780124055209\n2011|Morgan Kaufmann|Heterogeneous Computing with OpenCL|Gaster, Benedict and Howes, Lee and Kaeli, David R. and Mistry, Perhaad and Schaa, Dana|9780123877666\n2011|Manning|OpenCL in Action: How to accelerate graphics and computations|Scarpino, Matthew|9781638352389\n2013-08-26|Packt Publishing|OpenCL Parallel Programming Development Cookbook|Raymond Tay|9781849694537", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|The OpenCL specification|10.1109/HOTCHIPS.2009.7478342|958|97|A. Munshi|d0dd928da77a5510f67dc114b86c677f4502654a\n2013|Portable mapping of data parallel programs to OpenCL for heterogeneous systems|10.1109/CGO.2013.6494993|139|13|Dominik Grewe and Zheng Wang and M. O’Boyle|03028a78daf97a01a26975a72c59c8d97cb18810\n2012|clSpMV: A Cross-Platform OpenCL SpMV Framework on GPUs|10.1145/2304576.2304624|125|10|Bor-Yiing Su and K. Keutzer|11fa55df451335b846a56c6b295738c32506adeb\n2015|Generating performance portable code using rewrite rules: from high-level functional expressions to high-performance OpenCL code|10.1145/2784731.2784754|117|6|Michel Steuwer and Christian Fensch and S. Lindley and Christophe Dubach|8095a0dc01a3f75f85b0baa7890e2fa3463170c4\n2012|accULL: An OpenACC Implementation with CUDA and OpenCL Support|10.1007/978-3-642-32820-6_86|84|2|Ruymán Reyes and I. López-Rodríguez and J. Fumero and F. Sande|871d9641582562f9a83ed785ce3051f3e9e95483\n2013|HadoopCL: MapReduce on Distributed Heterogeneous Platforms through Seamless Integration of Hadoop and OpenCL|10.1109/IPDPSW.2013.246|54|6|M. Grossman and M. Breternitz and Vivek Sarkar|097ca69fda44a3499771bb2ece41ab5fb561cc6c\n2012|Portable LDPC Decoding on Multicores Using OpenCL [Applications Corner]|10.1109/MSP.2012.2192212|47|5|G. F. P. Fernandes and V. Silva and L. Sousa and J. Andrade|9c4b1c13a2d8c7753a90ce6a348a8a49efcc59b5\n2015|Comparative analysis of OpenCL vs. HDL with image-processing kernels on Stratix-V FPGA|10.1109/ASAP.2015.7245733|46|2|K. Hill and S. Craciun and A. George and H. Lam|1d7e4503882e2d2972186acacfb547ab4dc23b20\n2013|Exploiting the parallelism of heterogeneous systems using dataflow graphs on top of OpenCL|10.1109/ESTIMedia.2013.6704502|31|4|Lars Schor and Andreas Tretter and T. Scherer and L. Thiele|0b7174a7d444c248a11e8a4a8a847c595241cc15\n2013|OpenCL Performance Evaluation on Modern Multi Core CPUs|10.1109/IPDPSW.2013.141|28|4|Joo Hwan Lee and Kaushik Patel and Nimit Nigania and Hyojong Kim and Hyesoon Kim|38c71451c23a13460b6c6d6bc3e7e39e36e3cc74\n2016|Boost.Compute: A parallel computing library for C++ based on OpenCL|10.1145/2909437.2909454|24|0|J. Szuppe|6f7d9e7ae7deee07d41e8663607fe270d3f66977\n2010|OpenCL - An effective programming model for data parallel computations at the Cell Broadband Engine|10.1109/IPDPSW.2010.5470823|21|2|J. Breitbart and Claudia Fohry|90c4de6bea1bd4368b47fff147e10129543639e1\n2017|Implementation of Sobel Edge Detection on FPGA based on OpenCL|10.1109/CYBER.2017.8446103|16|1|Baoshan You and W. Sheng and Hongwei Ma and Ye Gu and Yinglin Qin|4885f993418b97b8aa223c63387715adf92598b2\n2015|Execution of Dataflow Process Networks on OpenCL Platforms|10.1109/PDP.2015.29|15|0|Wictor Lund and Sudeep Kanur and Johan Ersfolk and Leonidas Tsiopoulos and J. Lilius and Joakim Haldin and U. Falk|21b000428fea4824751d8c3ef8c5a693f6aed498\n2015|Evaluating vector data type usage in OpenCL kernels|10.1002/cpe.3424|14|0|Jianbin Fang and A. Varbanescu and Xiangke Liao and H. Sips|d17e5ac835b5744b70652888daef880af44c3c4d\n2018|FCLNN: A Flexible Framework for Fast CNN Prototyping on FPGA with OpenCL and Caffe|10.1109/FPT.2018.00043|13|3|Xianchao Xu and Brian Liu|dd4923ad4de0aa2b9e57bdf28d2bf2c28f74d93e\n2016|FPGA-based deep-pipelined architecture for FDTD acceleration using OpenCL|10.1109/ICIS.2016.7550742|12|1|H. M. Waidyasooriya and M. Hariyama|947cebc22fc52d3a03fc97cb6d16f8ba795f29a2\n2017|Implementation of a performance optimized database join operation on FPGA-GPU platforms using OpenCL|10.1109/NORCHIP.2017.8124981|12|2|Mehdi Roozmeh and L. Lavagno|8b002593453bff7acc5418e225ecb7662964de45\n2010|A Hybrid Programming Model for Compressible Gas Dynamics Using OpenCL|10.1109/ICPPW.2010.60|10|0|B. Bergen and Marcus G. Daniels and Paul M. Weber|4fddc1f60a15f4e1c42f971db70f9a339ceccb83\n2016|Automatic OpenCL Task Adaptation for Heterogeneous Architectures|10.1007/978-3-319-43659-3_50|8|2|Pierre Huchant and M. Counilh and Denis Barthou|d5622368919f78945272390c0fa1bae819ad8bea\n2011|GPU programming for EDA with OpenCL|10.1109/ICCAD.2011.6105306|7|0|R. Topaloglu and Benedict R. Gaster|a65360befbae04151b19ab8d55ced61669cf2965\n2020|A Heterogeneous Implementation of the Sobel Edge Detection Filter Using OpenCL|10.1109/MOCAST49295.2020.9200249|7|0|Theodora Sanida and Argyrios Sideris and M. Dasygenis|535b8d4a2681f58923303c177e770d29845fa98a\n2018|OpenCL-Darknet: An OpenCL Implementation for Object Detection|10.1109/BigComp.2018.00112|5|0|Yongbon Koo and Chayoung You and Sunghoon Kim|3ff3517534b97dbe8ae11c8fc3d8742ff8499191\n2019|OpenCL Implementation of FPGA-Based Signal Generation and Measurement|10.1109/ACCESS.2019.2910391|5|1|I. Firmansyah and Y. Yamaguchi|e54c1eb3136d82938a55c7839ed84aedf12c8da5\n2020|Is OpenCL Driven Reconfigurable Hardware Suitable for Virtualising 5G Infrastructure?|10.1109/TNSM.2020.2964392|5|0|F. Civerchia and M. Pelcat and Luca Maggiani and K. Kondepu and P. Castoldi and L. Valcarenghi|159d1bb3f664517eae9882eb06b3c2d350d3517b\n2015|Parallel Programming in Actor-Based Applications via OpenCL|10.1145/2814576.2814732|5|0|P. Harvey and Kristian Hentschel and J. Sventek|9a6ae216341217e62269824e5a239b4cc5970314\n2017|Implementing and Evaluating OpenCL on an ARMv8 Multi-Core CPU|10.1109/ISPA/IUCC.2017.00131|4|0|Jianbin Fang and P. Zhang and T. Tang and Chun Huang and Canqun Yang|d619f88777cffa7ab32a2edc5a60f5e9887555cb\n2018|Parallel implementation of cryptographic algorithm: AES using OpenCL on GPUs|10.1109/ICISC.2018.8398949|4|2|Govardhana Rao Inampudi and K. Shyamala and S. Ramachandram|14d8c6ae902e3ef975eb334f0d4620e8ffcacf4b\n2019|A High Performance Parallel Ranking SVM with OpenCL on Multi-core and Many-core Platforms|10.4018/IJGHPC.2019010102|4|0|Huming Zhu and Peidao Li and P. Zhang and Zheng Luo|8ce003a66ffeb58385d8a472231436cebf51b9af\n2020|Design and Preliminary Evaluation of OpenACC Compiler for FPGA with OpenCL and Stream Processing DSL|10.1145/3373271.3373274|4|0|Yutaka Watanabe and Jinpil Lee and K. Sano and T. Boku and M. Sato|5bc6a4f0e608a608d7b51dbcb058412d62e3c9a4\n2017|Performance-Power Evaluation of an OpenCL Implementation of the Simplex Growing Algorithm for Hyperspectral Unmixing|10.1109/LGRS.2016.2635585|3|0|S. Bernabé and G. Botella and J. Navarro and Carlos Orueta and F. Igual and Manuel Prieto-Matias and A. Plaza|0ec3100e86a7d6ae68301b7d68c1cb0f717852fe\n2018|OpenCL Superpixel Implementation on a General Purpose Multi-core CPU|10.1109/IST.2018.8577083|3|0|Hana Haseljic and Emir Cogo and Irfan Prazina and Razija Turcinhodzic and E. Buza and Amila Akagic|5084ea6f4af3eea78e7dc109cd77011ea2066654\n2019|Sparse-Matrix Compression Primitives with OpenCL Framework to Support Halide|10.1145/3318170.3318179|3|0|Chao-Lin Lee and Chen-Ting Chao and Jenq-Kuen Lee and Chung-Wen Huang and Ming-Yu Hung|2fa067b5a7bccbb6abcd5a813416fee9202f2989\n2020|POCL-R: Distributed OpenCL Runtime for Low Latency Remote Offloading|10.1145/3388333.3388642|3|0|Jan Solanti and Michal Babej and Julius Ikkala and P. Jääskeläinen|edd6701938abde27e38de9f1e8174bb6f04bd0e2\n2017|On Coding Techniques for Targeting FPGAs via OpenCL|10.3233/978-1-61499-843-3-652|2|0|N. Paulino and Luís Reis and João MP Cardoso|48fa6e3dd8dc1cdfca0e9b2b3e70e01b3cb5ccef\n2017|Hierarchical Read/Write Analysis for Pointer-Based OpenCL Programs on RRAM|10.1109/ICPPW.2017.20|2|0|Lin-Ya Yu and Shao-Chung Wang and Jenq-Kuen Lee|7a79da2046a52253cf8a32b31ac6d8d6beb03955\n2018|Towards Dynamic Multi-task Schedulling of OpenCL Programs on Emerging CPU-GPU-FPGA Heterogeneous Platforms: A Fuzzy Logic Approach|10.1109/CloudCom2018.2018.00055|2|0|Ahmad Al-Zoubi and K. Tatas and C. Kyriacou|f7d9d3c51484cfe6864a7d79ea024de35bc28794\n2018|2D Stencil Computation on Cyclone V SoC FPGA using OpenCL|10.1109/ICRAMET.2018.8683924|2|0|I. Firmansyah and Y. N. Wijayanto and Y. Yamaguchi|2e21c365d01b9437065c6fa6c75c280cb236098b\n2019|\"Effective Implementation of \"\"Kuznyechik\"\" Block Cipher on FPGA with OpenCL Platform\"|10.1109/EICONRUS.2019.8656872|2|0|A. Korobeynikov|5fbf1051badadcccbacb6a25c54848d0b153af9d\n2019|Mapping a Guided Image Filter on the HARP Reconfigurable Architecture Using OpenCL|10.3390/A12080149|2|0|Thomas Faict and E. D'Hollander and B. Goossens|3b5beb6639597a451c31fc086b2b6c5d328260b1\n2020|Accelerating the AES Algorithm using OpenCL|10.1109/MOCAST49295.2020.9200240|2|0|Theodora Sanida and Argyrios Sideris and M. Dasygenis|1f14f32cf73879a5180be2bce1406d5a89ff5e93\n2021|Impact of CUDA and OpenCL on Parallel and Distributed Computing|10.1109/ICEEE52452.2021.9415927|2|0|A. Asaduzzaman and Alec Trent and S. Osborne and C. Aldershof and F. Sibai|b8dd58407502f25fdc07b2ae83659e247c4b1f9b\n2020|The C++ for OpenCL Programming Language|10.1145/3388333.3388647|2|0|Anastasia Stulova and N. Hickey and S. V. Haastregt and M. Antognini and Kevin Petit|7aa05827d60185f3792c448075b0562fc15af045\n2017|Compiler Techniques for Efficient MATLAB to OpenCL Code Generation|10.1145/3078155.3078186|1|0|Luís Reis and João Bispo and João MP Cardoso|fbbda14de83443327ab0eeb149d1a452152f05e2\n2018|Implementation of a C-V2X Receiver on an Over-the-Air Software-Defined-Radio Platform with OpenCL|10.1109/NGCAS.2018.8572101|1|0|Ming-Hsuan Lai and T. Chiueh|93256643b4c58199d0291af1897fa385f1faca9d\n2019|Support OpenCL 2.0 Compiler on LLVM for PTX Simulators|10.1007/S11265-018-1377-4|1|0|Chun-Chieh Yang and Shao-Chung Wang and Min-Yih Hsu and Yuan-Ming Chang and Yuan-Shin Hwang and Jenq-Kuen Lee|be47a5bfa6ab236beecf15fed673466f87b56232" }, "opencomal": { "title": "OpenComal", "appeared": 2006, "type": "pl", "creators": [ "Christian Pietsch" ], "website": "https://www.josvisser.nl/opencomal", "reference": [ "https://slackbuilds.org/repository/14.2/development/opencomal" ], "country": [ "The Netherlands" ], "originCommunity": [ "http://www.josvisser.nl" ], "githubRepo": { "firstCommit": 2012, "stars": 18, "forks": 5, "subscribers": 6, "created": 2017, "updated": 2022, "description": "OpenCOMAL aims to be a compliant Common COMAL interpreter. It has been tested on Linux and macOS.", "issues": 3, "url": "https://github.com/poldy/OpenCOMAL" }, "repoStats": { "firstCommit": 2012, "commits": 288, "committers": 5, "files": 247 }, "hopl": "https://hopl.info/showlanguage.prx?exp=8618", "centralPackageRepositoryCount": 0 }, "opendoc-protocol": { "title": "OpenDoc", "appeared": 1993, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/OpenDoc" } }, "openedge-advanced-business-language": { "title": "OpenEdge ABL", "appeared": 2006, "type": "pl", "aka": [ "abl" ], "country": [ "United States" ], "originCommunity": [ "Progress Software Corporation" ], "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "example": [ "FOR EACH customer WHERE customer.custno = 14 EXCLUSIVE-LOCK:\n ASSIGN customer.salesman = 'Fred'.\nEND." ], "related": [ "sql", "isbn" ], "summary": "OpenEdge Advanced Business Language, or OpenEdge ABL for short, is a business application development language created and maintained by Progress Software Corporation (PSC). The language, typically classified as a fourth-generation programming language, uses an English-like syntax to simplify software development. The language was called PROGRESS or Progress 4GL up until version 9, but in 2006 PSC changed the name to OpenEdge Advanced Business Language (OpenEdge ABL) in order to overcome a presumed industry perception that 4GLs were less capable than other languages. A subset of the language, called SpeedScript, is used in the development of web applications.OpenEdge ABL helps developers to develop applications optionally using its own integrated relational database and programming tool. These applications are portable across computing systems and allow access to various popular data sources without having to learn the underlying data access methods. This means that the end-user of these products can be unaware of the underlying architecture. By combining a fourth generation language and relational database, OpenEdge ABL allows the use of the Rapid Application Development (RAD) model for developing software. A programmer and even end users can do rapid prototyping using the integrated and GUI tools of the development environment.", "pageId": 1071357, "created": 2004, "backlinksCount": 36, "revisionCount": 308, "dailyPageViews": 98, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/OpenEdge_Advanced_Business_Language" }, "githubLanguage": { "fileExtensions": [ "p", "cls", "w" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.abl", "aliases": [ "progress", "openedge", "abl" ], "repos": 72, "id": "OpenEdge ABL" }, "githubBigQuery": { "repos": 2568, "users": 2346, "id": "OpenEdge ABL" }, "pygmentsHighlighter": { "filename": "business.py", "fileExtensions": [ "p", "cls" ], "id": "OpenEdge ABL" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2016, "committerCount": 4, "commitCount": 21, "sampleCount": 6, "example": [ "MESSAGE \"Hello, world!\".\n" ], "url": "https://github.com/jfairbank/Sublime-Text-2-OpenEdge-ABL" }, "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "openexr-format": { "title": "OpenEXR", "appeared": 1999, "type": "binaryDataFormat", "country": [ "United States" ], "originCommunity": [ "Industrial Light & Magic" ], "wikipedia": { "summary": "OpenEXR is a high dynamic range raster file format, released as an open standard along with a set of software tools created by Industrial Light & Magic (ILM), under a free software license similar to the BSD license.It is notable for supporting multiple channels of potentially different pixel sizes, including 64-, 32- and 16-bit floating point values, as well as various compression techniques which include lossless and lossy compression algorithms. It also has arbitrary channels and encodes multiple points of view such as left- and right-camera images.", "backlinksCount": 353, "pageId": 172902, "dailyPageViews": 103, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/OpenEXR" } }, "opengl": { "title": "OpenGL", "appeared": 1992, "type": "library", "website": "https://www.opengl.org/", "originCommunity": [ "Khronos Group" ], "domainName": { "registered": 1997, "awisRank": { "2022": 145266 }, "name": "opengl.org" }, "wikipedia": { "related": [ "opencl", "c", "javascript", "webgl", "ios", "java", "android", "isbn", "qt", "linux", "glsl", "metal" ], "summary": "Open Graphics Library (OpenGL) is a cross-language, cross-platform application programming interface (API) for rendering 2D and 3D vector graphics. The API is typically used to interact with a graphics processing unit (GPU), to achieve hardware-accelerated rendering. Silicon Graphics Inc., (SGI) started developing OpenGL in 1991 and released it in January 1992; applications use it extensively in the fields of computer-aided design (CAD), virtual reality, scientific visualization, information visualization, flight simulation, and video games. Since 2006 OpenGL has been managed by the non-profit technology consortium Khronos Group.", "pageId": 22497, "dailyPageViews": 1054, "created": 2001, "backlinksCount": 1120, "revisionCount": 2131, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/OpenGL" }, "twitter": "https://twitter.com/opengl", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nComputer Graphics Using OpenGL|2000|F.S. Hill Jr.|1042306|4.06|83|8\nComputer Graphics with OpenGL|2003|Donald Hearn|1795464|3.73|126|7\nOpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 2|1999|Dave Shreiner|341753|3.68|119|8\nOpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1.2|1999|OpenGL Architecture Review Board|1741809|3.49|39|3\nOpenGL Es 2.0 Programming Guide|2008|Aaftab Munshi|4622203|3.82|60|4\nBeginning OpenGL Game Programming|2004|Dave Astle|837838|3.52|44|2\nOpenGL Shading Language|2009|Randi J. Rost|7074483|3.64|22|0\nOpenGL Game Programming|2002|Dave Astle|1480790|3.39|28|0\nOpenGL(R) Programming Guide: The Official Guide to Learning OpenGL(R), Version 1.4|2003|David Shreiner|341754|3.64|66|6\nMore OpenGL Game Programming|2005|Dave Astle|1042304|3.75|16|0" }, "opengraph": { "title": "opengraph", "appeared": 2010, "type": "xmlFormat", "description": "The Open Graph protocol enables any web page to become a rich object in a social graph. For instance, this is used on Facebook to allow any web page to have the same functionality as any other object on Facebook.", "website": "https://ogp.me/", "country": [ "United States" ], "originCommunity": [ "Facebook" ], "domainName": { "registered": 2010, "awisRank": { "2022": 75250 }, "name": "ogp.me" }, "hasBooleans": { "example": "true\nfalse\n1\n0", "value": true }, "example": [ "\n\nThe Rock (1996)\n\n\n\n\n...\n\n...\n" ] }, "openlisp": { "title": "OpenLisp", "appeared": 1988, "type": "pl", "creators": [ "Christian Jullien" ], "country": [ "Brazil" ], "originCommunity": [ "Eligis (one person company)" ], "wikipedia": { "example": [ "static POINTER \nOLDEFCOMPILED1(olfib_00, p1) {\n POINTER a1;\n POINTER VOLATILE a2;\n\n ollapenter(SN_OLFIB_00);\n a1 = p1;\n if (eq(a1, olmakefix(1))) goto _l004;\n if (!eq(a1, olmakefix(2))) goto _l003;\n ollapleave(SN_OLFIB_00);\n return olmakefix(1);\n_l003:\n a1 = ollapgsub(a1, olmakefix(1));\n a2 = olfib_00(a1);\n a1 = ollapgsub(p1, olmakefix(2));\n a1 = olfib_00(a1);\n a1 = ollapgadd(a2, a1);\n_l004:\n ollapleave(SN_OLFIB_00);\n return a1;\n}" ], "related": [ "emacs-editor", "lisp", "c", "x86-isa", "sparc", "powerpc", "mips", "arm", "unix", "linux", "freebsd", "solaris", "islisp", "common-lisp", "regex", "xml", "sql", "java", "unicode", "interlisp", "lisp-machine-lisp", "scheme", "le-lisp", "t", "emacs-lisp", "autolisp", "picolisp", "eulisp", "newlisp", "racket", "guile", "clojure", "arc", "lfe", "http", "smtp", "mysql", "sqlite", "postgresql", "csv" ], "summary": "OpenLisp is a programming language in the Lisp family developed by Christian Jullien. It conforms to the international standard for ISLISP published jointly by the International Organization for Standardization (ISO) and International Electrotechnical Commission (IEC), ISO/IEC 13816:1997(E), revised to ISO/IEC 13816:2007(E).Written in the programming languages C and Lisp, it runs on most common operating systems. OpenLisp is designated an ISLISP implementation, but also contains many Common Lisp-compatible extensions (hashtable, readtable, package, defstruct, sequences, rational numbers) and other libraries (network socket, regular expression, XML, Portable Operating System Interface (POSIX), SQL, Lightweight Directory Access Protocol (LDAP)).OpenLisp includes an interpreter associated to a read–eval–print loop (REPL), a Lisp Assembly Program (LAP) and a backend compiler for the language C.", "created": 2012, "backlinksCount": 39, "pageId": 34994823, "revisionCount": 142, "dailyPageViews": 15, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/OpenLisp" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:OpenLisp", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "openmusic": { "title": "OpenMusic", "appeared": 2019, "type": "pl", "reference": [ "https://www.sciencedirect.com/science/article/pii/S1045926X14000330" ], "country": [ "France" ], "originCommunity": [ "Institut national de recherche en sciences et technologies du numérique" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6433", "centralPackageRepositoryCount": 0 }, "openrc-runscript": { "title": "OpenRC runscript", "appeared": 2007, "type": "application", "creators": [ "Roy Marples" ], "description": "OpenRC is basically an interpreter for shell scripts which provides an easy interface to the often complex system commands and daemons. When a service runs a command it first loads its multiplexed configuration file, then its master configuration file, then /etc/rc.conf and finally the script itself. At this point then runs the command given.", "reference": [ "http://www.linuxhowtos.org/manpages/8/openrc-run.htm" ], "country": [ "England" ], "originCommunity": [ "https://roy.marples.name/projects" ], "example": [ "#!/sbin/openrc-run\ncommand=/usr/bin/foo\ncommand_args=\"${foo_args} --bar\"\npidfile=/var/run/foo.pid\nname=\"FooBar Daemon\"\n\ndescription=\"FooBar is a daemon that eats and drinks\"\nextra_commands=\"show\"\nextra_started_commands=\"drink eat\"\ndescription_drink=\"Opens mouth and reflexively swallows\"\ndescription_eat=\"Chews food in mouth\"\ndescription_show=\"Shows what's in the tummy\"\n\n_need_dbus()\n{\n grep -q dbus /etc/foo/plugins\n}\n\ndepend()\n{\n # We write a pidfile and to /var/cache, so we need localmount.\n need localmount\n # We can optionally use the network, but it's not essential.\n use net\n # We should be after bootmisc so that /var/run is cleaned before\n # we put our pidfile there.\n after bootmisc\n\n # Foo may use a dbus plugin.\n # However, if we add the dbus plugin whilst foo is running and\n # stop dbus, we don't need to stop foo as foo didn't use dbus.\n config /etc/foo/plugins\n local _need=\n if service_started; then\n _need=`service_get_value need`\n else\n if _need_dbus; then\n _need=\"${_need} dbus\"\n fi\n fi\n need ${_need}\n}\n\n# This function does any pre-start setup. If it fails, the service will\n# not be started.\n# If you need this function to behave differently for a restart command,\n# you should check the value of RC_CMD for \"restart\".\n# This also applies to start_post, stop_pre and stop_post.\nstart_pre()\n{\n if [ \"$RC_CMD\" = restart ]; then\n # This block will only execute for a restart command. Use a\n # structure like this if you need special processing for a\n # restart which you do not need for a normal start.\n # The function can also fail from here, which will mean that a\n # restart can fail.\n # This logic can also be used in start_post, stop_pre and\n # stop_post.\n fi\n # Ensure that our dirs are correct\n checkpath --directory --owner foo:foo --mode 0775 \\\n /var/run/foo /var/cache/foo\n}\n\nstart_post()\n{\n # Save our need\n if _need_dbus; then\n service_set_value need dbus\n fi\n}\n\nstop_post() {\n # Clean any spills\n rm -rf /var/cache/foo/*\n}\n\ndrink()\n{\n ebegin \"Starting to drink\"\n ${command} --drink beer\n eend $? \"Failed to drink any beer :(\"\n}\n\neat()\n{\n local result=0 retval= ate= food=\n ebegin \"Starting to eat\"\n\n if yesno \"${foo_diet}\"; then\n eend 1 \"We are on a diet!\"\n return 1\n fi\n\n for food in /usr/share/food/*; do\n veinfo \"Eating `basename ${food}`\"\n ${command} --eat ${food}\n retval=$?\n : $(( result += retval ))\n [ ${retval} = 0 ] && ate=\"${ate} `basename ${food}`\"\n done\n\n if eend ${result} \"Failed to eat all the food\"; then\n service_set_value ate \"${ate}\"\n fi\n}\n\nshow()\n{\n einfo \"Foo has eaten: `service_get_value ate`\"\n}" ], "githubRepo": { "firstCommit": 2007, "stars": 1109, "forks": 206, "subscribers": 57, "created": 2013, "updated": 2023, "description": "The OpenRC init system", "issues": 132, "url": "https://github.com/OpenRC/openrc" }, "githubLanguage": { "trendingProjectsCount": 0, "type": "programming", "group": "Shell", "interpreters": [ "openrc-run" ], "aceMode": "sh", "codemirrorMode": "shell", "codemirrorMimeType": "text/x-sh", "tmScope": "source.shell", "aliases": [ "openrc" ], "id": "OpenRC runscript" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 31, "commitCount": 243, "sampleCount": 1, "example": [ "#!/sbin/openrc-run\n\ndescription=\"Daemon for Advanced Configuration and Power Interface\"\n\nextra_started_commands=\"reload\"\ncommand=\"/usr/sbin/acpid\"\ncommand_args=\"$ACPID_ARGS\"\nstart_stop_daemon_args=\"--quiet\"\n\ndepend() {\n\tneed localmount\n\tuse logger\n}\n\nreload() {\n\tebegin \"Reloading acpid configuration\"\n\tstart-stop-daemon --exec $command --signal HUP\n\teend $?\n}\n" ], "url": "https://github.com/atom/language-shellscript" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "openroad": { "title": "OpenROAD", "appeared": 1990, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Actian Corporation" ], "wikipedia": { "related": [ "sql" ], "summary": "OpenROAD stands for \"Open Rapid Object Application Development\". It is a software product of Actian Corporation. OpenROAD is a fourth-generation programming language (4GL) which include a suite of development tools, with built-in Integrated development environment (IDE) (Written in OpenROAD), Code Repository, allowing applications to be developed and deployed on Microsoft and UNIX/LINUX platforms.", "created": 2006, "backlinksCount": 13, "pageId": 3647229, "revisionCount": 64, "dailyPageViews": 18, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/OpenROAD" }, "centralPackageRepositoryCount": 0 }, "openscad": { "title": "OpenSCAD", "appeared": 2010, "type": "pl", "description": "OpenSCAD is a 2D/3D and solid modeling program which is based on a Functional programming language used to create models that are previewed on the screen, and rendered into 3D mesh which allows the model to be exported in a variety of 2D/3D file formats. A script in the OpenSCAD language is used to create 2D or 3D models. This script is a free format list of action statements.", "reference": [ "https://en.wikipedia.org/wiki/OpenSCAD" ], "country": [ "Norway" ], "originCommunity": [ "https://opencollective.com/openscad" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ " cube(5);\n x = 4+y;\n rotate(40) square(5,10);\n translate([10,5]) { circle(5); square(4); }\n rotate(60) color(\"red\") { circle(5); square(4); }\n color(\"blue\") { translate([5,3,0]) sphere(5); rotate([45,0,45]) { cylinder(10); cube([5,6,7]); } }" ], "wikipedia": { "related": [ "opengl", "linux", "freebsd", "ia-32", "dxf" ], "summary": "OpenSCAD is a free software application for creating solid 3D CAD (computer-aided design) objects. It is a script-only based modeller that uses its own description language; parts can be previewed, but it cannot be interactively selected or modified by mouse in the 3D view. An OpenSCAD script specifies geometric primitives (such as spheres, boxes, cylinders, etc.) and defines how they are modified and combined (for instance by intersection, difference, envelope combination and Minkowski sums) to render a 3D model. As such, the program does constructive solid geometry (CSG). OpenSCAD is available for Windows, Linux and OS X.", "created": 2010, "backlinksCount": 126, "pageId": 25778048, "revisionCount": 132, "dailyPageViews": 100, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/OpenSCAD" }, "githubLanguage": { "fileExtensions": [ "scad" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nmaduce fosscad-repo https://github.com/maduce.png https://github.com/maduce/fosscad-repo OpenSCAD #ccc 650 518 22 \"Official FOSSCAD Library Repository\"\nprusa3d Original-Prusa-i3 https://github.com/prusa3d.png https://github.com/prusa3d/Original-Prusa-i3 OpenSCAD #ccc 859 494 22 \"Original Prusa i3 MK2 3D printer printed parts\"", "trendingProjectsCount": 3, "type": "programming", "aceMode": "scad", "tmScope": "source.scad", "repos": 10989, "id": "OpenSCAD" }, "githubBigQuery": { "repos": 1781, "users": 1469, "id": "OpenSCAD" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2017, "committerCount": 2, "commitCount": 12, "sampleCount": 2, "example": [ "// Simple sphere in OpenSCAD\n\nsphere( r=10 );\n" ], "url": "https://github.com/tbuser/openscad.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Openscad", "rijuRepl": { "example": [ "echo(\"Hello, world!\");\n" ], "id": "https://riju.codes/openscad" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2019||Python For Openscad|John Craig|9781074400675\n2020-09-22|Elektor International Media|Technical Modeling with OpenSCAD|Tam Hanna|9783895763946" }, "openspice": { "title": "OpenSpice", "appeared": 2005, "type": "pl", "creators": [ "Stephen Leach" ], "description": "OpenSpice is an openly available specification of the Spice language - a modern programming language with some nice XML processing features. It is designed with the needs of part-time or occasional programmers in mind. The language features are properly separated and their corner cases have been eliminated. This design means that if you only use Spice occasionally, you're likely to find it easy to come back to despite the breaks. The most similar well-known language is probably Common LISP together with CLOS. But Spice has a rich Algol-like external syntax, an XML transport form, and makes multiple values a key feature. The way Spice deals with multiple values is, we think, the feature that will strike most programmers as special.", "website": "https://web.archive.org/web/20050204011930/https://www.openspice.org", "reference": [ "http://lambda-the-ultimate.org/node/516" ], "country": [ "United Kingdom" ], "originCommunity": [ "The OpenSpice Group" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8619", "centralPackageRepositoryCount": 0 }, "opentype-feature-file": { "title": "OpenType Feature File", "appeared": 1996, "type": "application", "description": "An OpenType feature file is a text file that contains the typographic layout feature specifications for an OpenType font in an easy-to-read format. It may also contain override values for certain fields in the font tables. It is read in during the creation or editing of an OpenType font.", "reference": [ "https://en.wikipedia.org/wiki/OpenType" ], "country": [ "United States" ], "originCommunity": [ "Microsoft", "Adobe Systems" ], "example": [ "# Script and language coverage\nlanguagesystem DFLT dflt;\nlanguagesystem latn dflt;\n\n# Ligature formation\nfeature liga {\n substitute f i by f_i;\n substitute f l by f_l;\n} liga;\n\n# Kerning\nfeature kern {\n position A Y -100;\n position a y -80;\n position s f' <0 0 10 0> t;\n} kern;" ], "githubLanguage": { "fileExtensions": [ "fea" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.opentype", "aliases": [ "AFDKO" ], "id": "OpenType Feature File" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 2, "commitCount": 51, "url": "https://github.com/Alhadis/language-fontforge" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "openvera": { "title": "OpenVera", "appeared": 2001, "type": "pl", "reference": [ "http://wiki.c2.com/?VeraLanguage" ], "fileExtensions": [ "vr" ], "country": [ "United States" ], "originCommunity": [ "Systems Science Inc" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// This Examples shows how random \n// Test vectors is generated\n\n// This is base object\nclass m_base_o {\n rand bit [7:0] addr ;\n rand bit [7:0] data ;\n rand bit rd_wr;\n\n constraint c1 {\n addr > 0;\n data > 0;\n }\n\n task print() {\n printf (\"-------------------------\\n\");\n printf (\"Address : %x\\n\",addr);\n printf (\"Data : %x\\n\",data);\n printf (\"Write : %x\\n\",rd_wr);\n }\n}\n\n// This is transcation generator\nclass txgen {\n m_base_o base_ob;\n integer num_cmds;\n integer i,s;\n\n // Method to generate commands\n task gen_tx () {\n base_ob = new();\n // Generate num_cmds commands\n for ( i = 0; i < num_cmds; i ++) {\n s = base_ob.randomize();\n base_ob.print();\n }\n }\n}\n\n// Top level for any vera testbench\nprogram memory {\n txgen tx;\n tx = new();\n tx.num_cmds = 5;\n tx.gen_tx();\n}" ], "wikipedia": { "related": [ "systemverilog" ], "summary": "OpenVera is a hardware verification language developed and managed by Synopsys. OpenVera is an interoperable, open hardware verification language for testbench creation. The OpenVera language was used as the basis for the advanced verification features in the IEEE Std. 1800 SystemVerilog standard, for the benefit of the entire verification community including companies in the semiconductor, systems, IP and EDA industries along with verification services. The OpenVera language reference manual (LRM) can be obtained at no cost, but modifications to the language must go through Synopsys.", "pageId": 7841593, "created": 2006, "backlinksCount": 100, "revisionCount": 43, "dailyPageViews": 17, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/OpenVera" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "operational-control-language": { "title": "Operational Control Language", "appeared": 1986, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "** Procedure PROC1\n** \n** Written by Joe User 2006-05-29\n**\n** \n// * 'PROC1 procedure is running'\n// * ' '\n// IFF ACTIVE-'PROC2,PROC3' GOTO OKAY\n** IFF means 'if false'\n** ACTIVE-'nnn,nnn2' means at least one of the listed programs is currently running\n** GOTO xxx means skip to the statement that says TAG xxx and resume processing\n// PAUSE ' Cannot continue because other Payroll is running'\n// CANCEL stops execution of this procedure\n// TAG OKAY\n// IFF DATAF1-PFILE1 IFF DATAF1-PFILE2 GOTO NODELT\n// * ' Caution, Pay Data Exists' displays info on CRT\n// * ' '\n// * ' Press 1 to continue and DELETE existing files'\n// IFF '1'=?1R? CANCEL A parameter is indicated by question marks surrounding a number\n** Using 1R between question marks indicates that the parameter is required and processing\n** waits for user input. CANCEL means immediately go to end of job.\n// LOAD $DELET $DELET is used to delete files\n// RUN\n// IF DATAF1-PFILE1 SCRATCH UNIT-F1,LABEL-PFILE1 deletes a disk file\n// IF DATAF1-PFILE2 SCRATCH UNIT-F1,LABEL-PFILE2\n// END END returns control from a system program\n// LOAD PR101 PR101 is the sample RPG program\n// FILE NAME-PAYMAST,DISP-SHR PAYMAST is the payroll master file\n// FILE NAME-PFILE1,DISP-NEW,RECORDS-100,EXTEND-100 A new file PFILE1 is created\n** 100 records are assigned to PFILE1 - if full, the system tries to extend it by another 100\n** each time it fills.\n// RUN\n** It's not necessary or valid to put an END statement after most user programs\n// SWITCH 1XXXXXXX Causes U1 to be SETON in the RPG program\n// LOCAL OFFSET-1,DATA-'PROC1' Places PROC1 in the Local Data Area\n// LOCAL OFFSET-101,DATA-'?USER?' Substitutes the operator's User ID \n** LDA becomes the external data structure (UDS) in an RPG program\n// LOAD PR102\n// FILE NAME-PAYMAST,DISP-SHR DISP-SHR means the file is shared\n** Other programs can use PAYMAST at the same time\n// FILE NAME-PFILE,LABEL-PFILE1\n** NAME/LABEL is used when the RPG disk file and the actual disk file names are different.\n// RUN\n// RETURN Return means go to end-of-job" ], "related": [ "jcl" ], "summary": "Operational Control Language (OCL) is the control language of the IBM System/34 and System/36 minicomputer family. Other control languages include CL (System/38 and AS/400), JCL (System/370), and REXX (AS/400). The facility of DOS to use batch files is also control language.", "created": 2006, "backlinksCount": 8, "pageId": 5336178, "revisionCount": 23, "dailyPageViews": 4, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Operational_Control_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2301", "centralPackageRepositoryCount": 0 }, "operon": { "title": "operon", "appeared": 2018, "type": "queryLanguage", "description": "Operon.io is a powerful language to query, transform and integrate JSON-data. You can use it for example to build a small microservice for your backend services. All code is run on the powerful and battle tested Java Virtual Machine (JVM).", "website": "https://www.operon.io/", "country": [ "Finland" ], "originCommunity": [ "Operon Consulting" ], "domainName": { "name": "operon.io" }, "example": [ "From json:true\nFunction mySum($a, $b):\n $a + $b\nEnd\nSelect [1 ... 5] => array:Reduce(mySum($a, $b))" ], "isbndb": "", "semanticScholar": "" }, "opl-langage-informatique": { "title": "OPL", "appeared": 1989, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Psion PLC" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Open_Programming_Language" }, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1999|The MIT Press|The OPL Optimization Programming Language|Van Hentenryck, Pascal|9780262720304\n2005|Wiley|Rapid Mobile Enterprise Development for Symbian OS: An Introduction to OPL Application Design and Programming (Symbian Press)|Spence, Ewan|9780470014851" }, "opl": { "title": "OPL", "appeared": 1984, "type": "pl", "website": "http://opl-dev.sourceforge.net", "standsFor": "Open Programming Language", "country": [ "United Kingdom" ], "originCommunity": [ "Psion PLC" ], "domainName": { "name": "opl-dev.sourceforge.net" }, "wikipedia": { "example": [ "PROC test:\n dINIT \"Your Challenge\"\n dTEXT \"\",\"Will your answer to this question be no?\"\n dBUTTONS \"Yes\",%y,\"No\",%n\n IF DIALOG=%y\n PRINT \"No it wasn't!\"\n ELSE\n PRINT \"Yes it was!\"\n ENDIF\n GET\nENDP" ], "related": [ "basic", "visual-basic", "python", "python-for-s60" ], "summary": "Open Programming Language (OPL) is an embedded programming language for portable devices that run the Symbian Operating System.", "pageId": 832032, "dailyPageViews": 18, "created": 2004, "backlinksCount": 22, "revisionCount": 100, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Open_Programming_Language" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:OPL", "tiobe": { "id": "OPL" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Opl Optimization Programming Language|1999|Pascal van Hentenryck|4859836|4.67|3|0\nStructured Programming in OPL on the Psion Organiser||Bill Aitken|48166027|0.0|0|0\nA Deep Dive into Strategic Network Design Programming: OPL CPLEX Edition|2014|Michael Watson|41346050|4.00|3|1\nRapid Mobile Enterprise Development for Symbian OS: An Introduction to OPL Application Design and Programming (Symbian Press)|2005|Ewan Spence|13579798|3.50|2|0", "isbndb": "year|publisher|title|authors|isbn13\n1999|The MIT Press|The OPL Optimization Programming Language|Van Hentenryck, Pascal|9780262720304\n2005|Wiley|Rapid Mobile Enterprise Development for Symbian OS: An Introduction to OPL Application Design and Programming (Symbian Press)|Spence, Ewan|9780470014851" }, "opp": { "title": "O++", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/416373e9e968734385d1d7948d11edc90a9dc70c" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3341", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|The O++ database programming language: implementation and experience|10.1109/ICDE.1993.344077|31|0|R. Agrawal and Shaul Dar and N. Gehani|9bf9ee2a0b3c7b6ee52f9d6f462d6093f42d4e7a" }, "ops-3": { "title": "OPS-3", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c0e0552bda123b904ca76a6aff5b9076064252ff" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4609", "centralPackageRepositoryCount": 0 }, "ops": { "title": "OPS", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ea0bc6190993e02ea017c57595df6d4a6edc0d20" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=519", "centralPackageRepositoryCount": 0 }, "ops5": { "title": "OPS5", "appeared": 1977, "type": "pl", "standsFor": "Official Production System version 5", "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "example": [ "(compute 2 + (3 * 4) + 5)" ], "wikipedia": { "summary": "OPS5 is a rule-based or production system computer language, notable as the first such language to be used in a successful expert system, the R1/XCON system used to configure VAX computers. The OPS (said to be short for \"Official Production System\") family was developed in the late 1970s by Charles Forgy while at Carnegie Mellon University. Allen Newell's research group in artificial intelligence had been working on production systems for some time, but Forgy's implementation, based on his Rete algorithm, was especially efficient, sufficiently so that it was possible to scale up to larger problems involving hundreds or thousands of rules. OPS5 uses a forward chaining inference engine; programs execute by scanning \"working memory elements\" (which are vaguely object-like, with classes and attributes) looking for matches with the rules in \"production memory\". Rules have actions that may modify or remove the matched element, create new ones, perform side effects such as output, and so forth. Execution continues until no more matches can be found. In this sense, OPS5 is an execution engine for a Petri net extended with inhibitor arcs. The OPS5 forward chaining process makes it extremely parallelizeable during the matching phase, and several automatic parallelizing compilers were created. OPS4 was an early version, while OPS83 came later. The first implementation of OPS5 was written in Lisp, and later rewritten in BLISS for speed. DEC OPS5 is an extended implementation of the OPS5 language definition, developed for use with the VMS, RISC ULTRIX, and DEC OSF/1 operating systems.", "pageId": 475829, "created": 2004, "backlinksCount": 23, "revisionCount": 49, "dailyPageViews": 26, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/OPS5" }, "hopl": "https://hopl.info/showlanguage.prx?exp=775", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Expert Systems in Ops5: An Introduction to Rule-Based Programming|1985|Lee Brownston|1071877|0.0|0|0", "isbndb": "" }, "optimization-programming-language": { "title": "Optimization Programming Language", "appeared": 1999, "type": "pl", "creators": [ "Pascal Van Hentenryck" ], "reference": [ "https://www.amazon.com/OPL-Optimization-Programming-Language/dp/0262720302" ], "aka": [ "opl" ], "country": [ "United States" ], "originCommunity": [ "Brown University" ], "related": [ "gams" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Optimization_Programming_Language" } }, "optimized-systems-software": { "title": "Optimized Systems Software", "appeared": 1981, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Shepardson Microsystems, Inc" ], "wikipedia": { "related": [ "atari-basic", "action", "fat", "basic-ap", "algol", "c", "isbn" ], "summary": "Optimized Systems Software (OSS) was a company that produced disk operating systems, programming languages, and applications primarily for the Atari 8-bit family of home computers, but some products were also sold for the Apple II. OSS was best known for their enhanced versions of Atari BASIC and the MAC/65 assembler (both of which are much faster than Atari's products) and the Action! programming language. OSS transitioned to other platforms with Personal Pascal for the Atari ST and Personal Prolog for Macintosh (which was also advertised for the Atari ST, but may not have been released). OSS was not as significant in those markets.", "created": 2005, "backlinksCount": 107, "pageId": 1965451, "revisionCount": 161, "dailyPageViews": 10, "appeared": 1981, "url": "https://en.wikipedia.org/wiki/Optimized_Systems_Software" }, "centralPackageRepositoryCount": 0 }, "optimj": { "title": "OptimJ", "appeared": 2006, "type": "pl", "originCommunity": [ "Ateji" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "// select name from persons where age > 18\n `multiSet(){ p.name | Person p : persons, :p.age > 18 }" ], "related": [ "java", "algebraic-modeling-language" ], "summary": "OptimJ is an extension of the Java with language support for writing optimization models and abstractions for bulk data processing. The extensions and the proprietary product implementing the extensions were developed by Ateji which went out of business in September 2011. OptimJ aims at providing a clear and concise algebraic notation for optimization modeling, removing compatibility barriers between optimization modeling and application programming tools, and bringing software engineering techniques such as object-orientation and modern IDE support to optimization experts. OptimJ models are directly compatible with Java source code, existing Java libraries such as database access, Excel connection or graphical interfaces. OptimJ is compatible with development tools such as Eclipse, CVS, JUnit or JavaDoc. OptimJ is available free with the following solvers: lp_solve, glpk, LP or MPS file formats and also supports the following commercial solvers: Gurobi, MOSEK, IBM ILOG CPLEX Optimization Studio.", "created": 2010, "backlinksCount": 67, "pageId": 28952622, "revisionCount": 52, "dailyPageViews": 10, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/OptimJ" }, "centralPackageRepositoryCount": 0 }, "oracle-java": { "title": "Oracle Java", "appeared": 2010, "type": "pl", "description": "A commercial implementation of Java provided by Oracle Corporation.", "website": "https://www.oracle.com/java/", "documentation": [ "https://docs.oracle.com/en/java/" ], "releaseNotesUrl": "https://www.oracle.com/java/technologies/javase/jdk-relnotes-index.html", "implementationOf": [ "java" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Java_Development_Kit" } }, "oracle": { "title": "Oracle", "appeared": 1979, "type": "database", "description": "Relational database management system (RDBMS)", "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ] }, "orange": { "title": "orange", "appeared": 2014, "type": "pl", "creators": [ "Robert Fratto" ], "description": "Orange is a systems programming language made to be as powerful as C++ with none of the headache. It aims to be very productive by baking the most important low- and high-level features directly into the language, instead of dealing with them through obtuse function calls.", "website": "https://web.archive.org/web/20191002000130/http://orange-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/orange-lang" ], "domainName": { "name": "orange-lang.org" }, "keywords": [ "alias", "bool", "break", "catch", "char", "class", "const", "continue", "data", "def", "delete", "do", "double", "elif", "else", "enum", "extend", "extern", "false", "final", "finally", "float", "fro", "get", "if", "import", "int", "int16", "int32", "int64", "int8", "interface", "new", "of", "package", "private", "property", "protected", "public", "return", "set", "static", "string", "super", "this", "throw", "true", "try", "uint", "uint16", "uint362", "uint64", "uint8", "var", "virtual", "void", "where", "while" ], "example": [ "extern printf(char* s, ...) -> int32 \n\nclass Person\n public char* name\n\n public Person(char* name)\n @name = name \n end\nend\n\nPerson john = Person(\"Johnny\")\nprintf(\"Hello, %s!\\n\", john.name)" ], "githubRepo": { "stars": 70, "forks": 10, "subscribers": 10, "created": 2017, "updated": 2018, "url": "https://github.com/orange-lang/orange" }, "repoStats": { "firstCommit": 2017, "commits": 2009, "committers": 1, "files": 81 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9784334|Orange: A simple systems programming language|http://orange-lang.org/|2015-06-26 13:56:26 UTC|1435326986|rfratto|38|55" }, "orc-format": { "title": "Optimized Row Columnar", "appeared": 2016, "type": "binaryDataFormat", "website": "https://orc.apache.org/", "country": [ "United States" ], "originCommunity": [ "Apache Software Foundation" ], "domainName": { "name": "orc.apache.org" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "orc-lang": { "title": "Orc", "appeared": 2004, "type": "pl", "creators": [ "Jayadev Misra" ], "website": "http://orc.csres.utexas.edu/", "country": [ "United States" ], "originCommunity": [ "The University of Texas at Austin" ], "domainName": { "name": "orc.csres.utexas.edu" }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "{- A comment\n-}", "value": true }, "hasComments": { "example": "{- A comment\n-}", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "multiLineCommentTokens": [ [ "{-", "-}" ] ], "printToken": [ [ "Println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "haskell", "ml", "oz", "smalltalk" ], "summary": "Orc is a concurrent, nondeterministic computer programming language created by Jayadev Misra at the University of Texas at Austin. Orc provides uniform access to computational services, including distributed communication and data manipulation, through sites. Using four simple concurrency primitives, the programmer orchestrates the invocation of sites to achieve a goal, while managing timeouts, priorities, and failures.", "pageId": 13345244, "created": 2007, "backlinksCount": 11, "revisionCount": 37, "dailyPageViews": 13, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Orc_(programming_language)" }, "leachim6": { "filepath": "o/Orc.orc", "fileExtensions": [ "orc" ], "example": [ "{- HelloWorld.orc -- Orc program HelloWorld\n -\n - $Id$\n -\n - Created by xbony2 on Nov 8, 2014 8:30:25 PM\n - Licensed under public domain.\n -}\n\nPrintln(\"Hello World\") >>\nstop\n" ], "id": "Orc" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "orca-lang": { "title": "orca-lang", "appeared": 2014, "type": "pl", "creators": [ "Karl Robillard" ], "description": "Orca is a REBOL-like interpreter which can be used under the terms of either the GPL or LGPL. The interpreter is a C library so that C/C++ applications can use Orca as an embedded scripting system.", "website": "https://sourceforge.net/p/urlan/wiki/OrcaProject/", "country": [ "Unknown" ], "originCommunity": [ "https://sourceforge.net/p/urlan/mailman/urlan-orca" ], "twitter": "https://twitter.com/sourceforge", "semanticScholar": "" }, "orca-pl": { "title": "orca-pl", "appeared": 2018, "type": "esolang", "description": "Each letter of the alphabet is an operation, lowercase letters typically operate on bang(*), uppercase letters operate on each frame. Bangs can be generated by various operations, such as E colliding with a 0, see the bang.orca example. Watch a music video of ORCΛ in action. C Port for the ORCΛ programming environment, with a commandline interpreter.", "website": "http://wiki.xxiivv.com/orca", "reference": [ "https://git.sr.ht/~rabbits/orca" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/hundredrabbits/Orca-c/issues" ], "githubRepo": { "firstCommit": 2018, "stars": 394, "forks": 37, "subscribers": 24, "created": 2018, "updated": 2022, "description": "Live Programming Environment(C Port)", "issues": 15, "url": "https://github.com/hundredrabbits/orca-c" }, "repoStats": { "firstCommit": 2018, "commits": 1025, "committers": 17, "files": 69 } }, "orca": { "title": "orca", "appeared": 1985, "type": "pl", "creators": [ "Lee Ki-Yeul" ], "description": "orca is yet another script language which supports OO & distribute processing & functional programming aspects. And It's useful in string processing with decode statements & regular expression in it.", "reference": [ "https://sourceforge.net/p/orca-lang/wiki/Home/" ], "country": [ "Korea" ], "originCommunity": [ "https://github.com/lynix94/orca-lang/issues" ], "githubRepo": { "firstCommit": 2016, "stars": 24, "forks": 0, "subscribers": 5, "created": 2016, "updated": 2021, "issues": 1, "url": "https://github.com/lynix94/orca-lang" }, "repoStats": { "firstCommit": 2016, "commits": 338, "committers": 8, "files": 431 }, "hopl": "https://hopl.info/showlanguage.prx?exp=1250", "fileType": "text", "centralPackageRepositoryCount": 0 }, "order": { "title": "order", "appeared": 2003, "type": "pl", "creators": [ "Vesa Karvonen" ], "description": "Metalanguage for C Preprocessor Metaprogramming", "reference": [ "https://github.com/polytypic/order-pp" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://www.devever.net/~hl" ], "example": [ "#define ORDER_PP_DEF_8fib \\\nORDER_PP_FN(8fn(8N, \\\n 8fib_iter(8N, 0, 1)))" ] }, "oregano": { "title": "OREGANO", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/114ec91124e001570a457b927d37c71f41b2b2e4" ], "country": [ "United States" ], "originCommunity": [ "General Electric Research and Development" ], "hopl": "https://hopl.info/showlanguage.prx?exp=621", "centralPackageRepositoryCount": 0 }, "org": { "title": "Org", "appeared": 2003, "type": "textMarkup", "creators": [ "Carsten Dominik" ], "description": "Org is a mode for keeping notes, maintaining TODO lists, and project planning with a fast and effective plain-text system. It also is an authoring system with unique support for literate programming and reproducible research.", "website": "https://orgmode.org/", "documentation": [ "https://orgmode.org/manual/" ], "reference": [ "https://orgmode.org/org.html#Document-structure" ], "country": [ "The Netherlands and France" ], "originCommunity": [ "https://list.orgmode.org/" ], "domainName": { "registered": 2007, "awisRank": { "2022": 420155 }, "name": "orgmode.org" }, "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "* Top level headline\n** Second level\n*** 3rd level\n some text\n*** 3rd level\n more text\n\n* Another top level headline ", "#+OPTIONS: H:3 num:nil toc:nil \\n:nil @:t ::t |:t ^:t -:t f:t *:t TeX:t LaTeX:t skip:nil d:(HIDE) tags:not-in-toc\n#+STARTUP: align fold nodlcheck hidestars oddeven lognotestate\n#+SEQ_TODO: TODO(t) INPROGRESS(i) WAITING(w@) | DONE(d) CANCELED(c@)\n#+TAGS: Write(w) Update(u) Fix(f) Check(c)\n#+TITLE: org-ruby\n#+AUTHOR: Brian Dewey\n#+EMAIL: bdewey@gmail.com\n#+LANGUAGE: en\n#+PRIORITIES: A C B\n#+CATEGORY: worg\n\n{Back to Worg's index}\n\n* Motivation\n\n The dominant simple plain-text markup languages for the web are\n Textile and Markdown. A factor for the popularity of those markup\n formats is the widespread availability of simple, free packages for\n converting the formats to HTML. For example, the world of\n Ruby-powered websites has settled on RedCloth for converting Textile\n to HTML.\n\n The default way to convert org-mode files to HTML is the powerful\n publishing functionality provided by =emacs=. However, =emacs= does\n not easiliy integrate into many existing website frameworks.\n\n =Org-ruby= tries to make it easier to use org-mode files in both\n dyanmic and static website generation tools written in\n Ruby. =Org-ruby= is a simple Ruby gem to convert org-mode files to\n HTML.\n\n* Using Org-ruby\n\n =Org-ruby= follows the same model as other Ruby markup\n libraries. You install the gem:\n\n #+BEGIN_EXAMPLE\n sudo gem install org-ruby\n #+END_EXAMPLE\n\n Then, to convert an org-file to HTML in your Ruby code:\n\n #+BEGIN_EXAMPLE\n require 'rubygems'\n require 'org-ruby'\n\n data = IO.read(filename)\n puts Orgmode::Parser.new(data).to_html\n #+END_EXAMPLE\n\n* Walkthrough: Using org-ruby with Webby\n\n Here is an example of how to integrate =org-ruby= into Webby, a\n static website generation tool written in Ruby.\n\n Webby follows a similar pattern to other static site generation\n tools (like nanoc, Jekyll, and webgen):\n\n - You author website content in text with simple markup\n - Each page is fed through one or more /filters/ to produce HTML\n - The HTML is mixed in with layouts to produce the final pages\n\n For a Webby site, a the source for a page may look like this:\n\n #+BEGIN_EXAMPLE\n ---\n title: Special Directories\n created_at: 2009-12-17\n status: Complete\n filter:\n - erb\n - maruku\n tags:\n - powershell\n ---\n <%= @page.title %>\n ==================\n\n Special Directories are a set of directories, each of which has a\n function that will navigate you to the appropriate directory using\n the push-location cmdlet. For example, the function `home` might\n navigate to `c:\\users\\bdewey.`\n\n Install\n -------\n\n Copy the module to somewhere in `ENV:PSModulePath`. Then,\n\n InstallModule SpecialDirectories\n #+END_EXAMPLE\n\n In the above example, the text is written in Markdown. At the top of\n the file, metadata informs Webby to pass the text through two\n /filters/ to produce HTML. The first filter, =erb=, handles embedded\n Ruby. In this case, it will replace ~<%= @page.title %>~ with the\n page title (=Special Directories=). The second filter uses Maruku to\n translate Markdown into HTML.\n\n You can use the exact same pattern to include org-mode files in a\n Webby site. For this walkthrough, I assume you already have Webby\n installed, and that you've already created a site.\n\n 1. Make sure you have =org-ruby= installed: =sudo gem install\n org-ruby=.\n 2. You need to register a new Webby filter to handle org-mode\n content. Webby makes this easy. In the =lib/= folder of your\n site, create a file =orgmode.rb=:\n\n #+BEGIN_EXAMPLE\n require 'org-ruby'\n\n Webby::Filters.register :org do |input|\n Orgmode::Parser.new(input).to_html\n end\n #+END_EXAMPLE\n\n This code creates a new filter, =org=, that will use the\n =org-ruby= parser to translate org-mode input into HTML.\n 3. Create your content. For example:\n\n #+BEGIN_EXAMPLE\n---\ntitle: Orgmode Parser\ncreated_at: 2009-12-21\nstatus: Under development\nfilter:\n - erb\n - org\ntags:\n - orgmode\n - ruby\n---\n<%= @page.title %>\n\n Status: <%= @page.status %>\n\n* Description\n\n Helpful Ruby routines for parsing orgmode files. The most\n significant thing this library does today is convert orgmode files\n to textile. Currently, you cannot do much to customize the\n conversion. The supplied textile conversion is optimized for\n extracting \"content\" from the orgfile as opposed to \"metadata.\"\n\n\n* History\n\n** 2009-12-29: Version 0.4\n\n - The first thing output in HTML gets the class \"title\"\n - HTML output is now indented\n - Proper support for multi-paragraph list items.\n\n See? This paragraph is part of the last bullet.\n\n - Fixed bugs:\n - \"rake spec\" wouldn't work on Linux. Needed \"require 'rubygems'\".\n #+END_EXAMPLE\n\n This file will go through the =erb= and =org= filters; as defined\n in the previous step, the =org= filter will use =org-ruby= to\n generate HTML.\n\n That's all there is to it!\n" ], "wikipedia": { "related": [ "emacs-editor", "html", "latex", "markdown", "restructuredtext", "textile", "git", "mediawiki", "pandoc-app", "vim-editor", "sublime-editor" ], "summary": "Org-mode (also: Org mode; ) is a document editing, formatting, and organizing mode, designed for notes, planning, and authoring within the free software text editor Emacs. The name is used to encompass plain text files (\"org files\") that include simple marks to indicate levels of a hierarchy (such as the outline of an essay, a topic list with subtopics, nested computer code, etc.), and an editor with functions that can read the markup and manipulate hierarchy elements (expand/hide elements, move blocks of elements, check off to-do list items, etc.). Org-mode was created by Carsten Dominik in 2003, originally to organize his own life and work, and since the first release numerous other users and developers have contributed to this free software package. Emacs includes Org-mode as a major mode by default. Bastien Guerry is the current maintainer, in cooperation with an active development community. Since its success in Emacs, some other systems have also begun providing functions to work with org files.", "backlinksCount": 93, "pageId": 24317457, "created": 2009, "revisionCount": 447, "dailyPageViews": 127, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Org-mode" }, "githubLanguage": { "fileExtensions": [ "org" ], "trendingProjectsCount": 0, "type": "prose", "aceMode": "text", "tmScope": "none", "wrap": true, "repos": 18, "id": "Org" }, "githubBigQuery": { "repos": 1, "users": 1, "id": "Org" }, "leachim6": { "filepath": "o/Org-mode.org", "fileExtensions": [ "org" ], "example": [ "Hello World\n" ], "id": "Org-mode" }, "rijuRepl": { "example": [ "Hello, world!\n" ], "id": "https://riju.codes/org" }, "fileType": "text", "wordRank": 4476, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "orient-db": { "title": "OrientDB", "appeared": 2010, "type": "database", "description": "Multi-model NoSQL database management system", "country": [ "Italy" ], "originCommunity": [ "OrientDB LTD" ] }, "orient84-k": { "title": "Orient84/K", "appeared": 1986, "type": "pl", "reference": [ "https://dl.acm.org/doi/10.1145/323779.323741", "https://semanticscholar.org/paper/3dbaa58a9f7ad7fb04e1a04be4fad3f70d9c25b7" ], "country": [ "Japan" ], "originCommunity": [ "Keio University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1251", "centralPackageRepositoryCount": 0 }, "orlog": { "title": "Orlog", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5d0ba04059cdc5cf7f0f6f176e49885cd6675c84" ], "country": [ "United States and Canada" ], "originCommunity": [ "University of Idaho", "University of British Columbia - Vancouver" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7155", "centralPackageRepositoryCount": 0 }, "osiris": { "title": "OSIRIS", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/898ebdb18c02b923f0b7965d2976080c5b2ab67a" ], "country": [ "United States" ], "originCommunity": [ "University of Michigan" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6761", "centralPackageRepositoryCount": 0 }, "osl-2": { "title": "OSL/2", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/458a0b9228c7fd19e7e87dd2304189a5e8f35fdd" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7409", "centralPackageRepositoryCount": 0 }, "osql": { "title": "Object-oriented Structured Query Language", "appeared": 1990, "type": "queryLanguage", "reference": [ "https://stason.org/TULARC/software/object-oriented-programming/9-3-Odapter-OpenODB-Odapter-Language.html" ], "standsFor": "Object-oriented Structured Query Language", "country": [ "United States" ], "originCommunity": [ "University of Michigan" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2322", "isbndb": "" }, "ottawa-euclid": { "title": "Ottawa Euclid", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8bc6a491425664186ce40fb96735f4ea51947151" ], "country": [ "Canada" ], "originCommunity": [ "I.P. Sharp Associates" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2324", "centralPackageRepositoryCount": 0 }, "otter": { "title": "Otter", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7cc53381bfb1f0201a356f423e3df8e57fd56178" ], "country": [ "United States" ], "originCommunity": [ "University of Chicago" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3666", "centralPackageRepositoryCount": 0 }, "owbasic": { "title": "OWBasic", "appeared": 2000, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "University of Heidelberg" ], "wikipedia": { "related": [ "basic" ], "summary": "OWBasic is an interpreted language environment that can be downloaded to Personal digital assistants like the Casio's Pocket viewer.", "created": 2010, "backlinksCount": 8, "pageId": 25732355, "revisionCount": 13, "dailyPageViews": 3, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/OWBasic" }, "centralPackageRepositoryCount": 0 }, "owen-lang": { "title": "owen-lang", "appeared": 2019, "type": "pl", "creators": [ "Paw Møller" ], "website": "http://owen-lang.org", "country": [ "Denmark" ], "originCommunity": [ "https://github.com/pawwkm/owen/issues" ], "domainName": { "registered": 2019, "name": "owen-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "print" ] ], "example": [ "// An imperative, statically but weakly typed systems programming\n// language with manual memory management.\n\nnamespace Hello.Owen\n\nfunction main\n output i32\n print(\"Hello World\\n\")\n return 0\nend" ], "githubRepo": { "firstCommit": 2019, "stars": 11, "subscribers": 1, "created": 2019, "updated": 2022, "description": "An imperative, statically but weakly typed systems programming language with manual memory management.", "forks": 0, "issues": 0, "url": "https://github.com/pawwkm/owen" }, "repoStats": { "firstCommit": 2019, "commits": 197, "committers": 3, "files": 147 } }, "owl-dl": { "title": "OWL DL", "appeared": 2007, "type": "xmlFormat", "description": "A subset of OWL.", "reference": [ "https://www.w3.org/2007/OWL/wiki/images/9/9a/Pfps-f2f1.pdf" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs Research" ], "related": [ "owl" ] }, "owl": { "title": "OWL", "appeared": 2004, "type": "xmlFormat", "documentation": [ "https://www.w3.org/TR/owl-guide/" ], "standsFor": "One World Language", "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "hasLineComments": { "example": "", "value": false }, "wikipedia": { "example": [ " rdf:type owl:Ontology .\n :Tea rdf:type owl:Class ." ], "related": [ "rdf", "xml", "html", "axiom", "turtle", "sql", "prolog", "uml" ], "summary": "The Web Ontology Language (OWL) is a family of knowledge representation languages for authoring ontologies. Ontologies are a formal way to describe taxonomies and classification networks, essentially defining the structure of knowledge for various domains: the nouns representing classes of objects and the verbs representing relations between the objects. Ontologies resemble class hierarchies in object-oriented programming but there are several critical differences. Class hierarchies are meant to represent structures used in source code that evolve fairly slowly (typically monthly revisions) whereas ontologies are meant to represent information on the Internet and are expected to be evolving almost constantly. Similarly, ontologies are typically far more flexible as they are meant to represent information on the Internet coming from all sorts of heterogeneous data sources. Class hierarchies on the other hand are meant to be fairly static and rely on far less diverse and more structured sources of data such as corporate databases. The OWL languages are characterized by formal semantics. They are built upon the World Wide Web Consortium's (W3C) XML standard for objects called the Resource Description Framework (RDF). OWL and RDF have attracted significant academic, medical and commercial interest. In October 2007, a new W3C working group was started to extend OWL with several new features as proposed in the OWL 1.1 member submission. W3C announced the new version of OWL on 27 October 2009. This new version, called OWL 2, soon found its way into semantic editors such as Protégé and semantic reasoners such as Pellet, RacerPro, FaCT++ and HermiT. The OWL family contains many species, serializations, syntaxes and specifications with similar names. OWL and OWL2 are used to refer to the 2004 and 2009 specifications, respectively. Full species names will be used, including specification version (for example, OWL2 EL). When referring more generally, OWL Family will be used.", "pageId": 248001, "dailyPageViews": 443, "created": 2003, "backlinksCount": 506, "revisionCount": 706, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Web_Ontology_Language" }, "githubLanguage": { "fileExtensions": [ "owl" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "xml", "tmScope": "text.xml", "repos": 199, "id": "Web Ontology Language" }, "githubBigQuery": { "repos": 642, "users": 524, "id": "Web Ontology Language" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 12, "commitCount": 97, "sampleCount": 1, "example": [ "\n\n\n\n \n \n \n]>\n\n\n\n \n v.1.4. Added Food class (used in domain/range of hasIngredient), Added several hasCountryOfOrigin restrictions on pizzas, Made hasTopping invers functional\n version 1.5\n v.1.5. Removed protege.owl import and references. Made ontology URI date-independent\n An example ontology that contains all constructs required for the various versions of the Pizza Tutorial run by Manchester University (see http://www.co-ode.org/resources/tutorials/)\n \n \n\n\n \n\n \n\n\n \n\n \n Americana\n \n \n \n \n , mxsu=<>, mxsl=<>,\n\t\t time, timeall, timeran=0, timelik=0, timefun=0, timeint=0, timeres=0;\n\n\tmData = GetData(m_asY);\n\tmhdet = sqrt((2*M_PI)^m_cY * determinant(m_mMSbE.^2));\t\t// covariance determinant\n\tmhi = invert(m_mMSbE.^2);\t\t\t\t\t// invert covariance of measurement shocks\n\n\tms \t = m_vSss + zeros(m_cPar, m_cS);\t\t\t// start particles\n\tmx \t = m_vXss + zeros(m_cPar, m_cX);\t\t\t// steady state of state and policy\n\n\tloglikeli = 0;\t\t\t\t\t\t\t// init likelihood\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//timeall=timer();\n\tfor(it = 0; it < sizer(mData); it++)\n\t{\n\t\tmss = rann(m_cPar, m_cSS) * m_mSSbE;\t\t\t// state noise\n\t\tfg(&ms, ms, mx, mss);\t\t\t\t\t// transition prior as proposal\n\t\tmx = m_oApprox.FastInterpolate(ms); \t\t\t// interpolate\n\t\tfy(&my, ms, mx, zeros(m_cPar, m_cMS));\t\t\t// evaluate importance weights\n\t\tmy -= mData[it][];\t\t\t\t\t// observation error\n\n\t\tvw = exp(-0.5 * outer(my,mhi,'d')' )/mhdet;\t\t// vw = exp(-0.5 * sumr(my*mhi .*my ) )/mhdet;\n\n\t\tvw = vw .== .NaN .? 0 .: vw;\t\t\t\t// no policy can happen for extrem particles\n\t\tdws = sumc(vw);\n\t\tif(dws==0) return -.Inf;\t\t\t\t// or extremely wrong parameters\n\t\tloglikeli += log(dws/m_cPar)\t;\t\t\t// loglikelihood contribution\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//timelik += (timer()-time)/100;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//time=timer();\n\t\tvwi = resample(vw/dws)-1;\t\t\t\t// selection step in c++\n\t\tms = ms[vwi][];\t\t\t\t\t\t// on normalized weights\n\t\tmx = mx[vwi][];\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\treturn loglikeli;\n}\n" ], "url": "https://github.com/andreashetland/sublime-text-ox" }, "leachim6": { "filepath": "o/OX.oz", "fileExtensions": [ "oz" ], "example": [ "{Show 'Hello World'}\n" ], "id": "OX" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2718", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2006|Timberlake Consultants|An Object-oriented Matrix Programming Language: Ox 4|Jurgen A. Doornik|9780954260385\n2010||Ox Programming Language|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133182042\n2007|Timberlake Consultants|An Object-oriented Matrix Programming Language: Ox 5|Jurgen A. Doornik|9780955212758\n2006|Timberlake Consultants Ltd|Introduction To Ox An Object-oriented Matrix Programming Language|Jurgen A. Doornik and Marius Ooms|9780955212703" }, "oxide": { "title": "Oxide", "appeared": 2021, "type": "pl", "description": "Oxide, scripting language with Rust-influenced syntax", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/mflcry/oxide_scripting_language_with_rustinfluenced/" ], "country": [ "Russia" ], "originCommunity": [ "https://github.com/tuqqu/oxide-lang/issues" ] }, "oxygene": { "title": "Oxygene", "appeared": 2002, "type": "pl", "website": "http://elementscompiler.com", "country": [ "United States" ], "originCommunity": [ "RemObjects Software" ], "domainName": { "registered": 2014, "awisRank": { "2017": 590346, "2022": 788483 }, "name": "elementscompiler.com" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "Console.WriteLine" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "Type: System.Int32\n-> a = 23, b = 15\n-> a = 15, b = 23\nType: System.String\n-> a = abc, b = def\n-> a = def, b = abc\nType: System.Double\n-> a = 1,1, b = 1,2\n-> a = 1,2, b = 1,1" ], "related": [ "object-pascal", "csharp", "eiffel", "java", "f-sharp", "delphi", "swift", "free-pascal" ], "summary": "Oxygene (formerly known as Chrome) is a programming language developed by RemObjects Software for Microsoft's Common Language Infrastructure, the Java Platform and Cocoa. Oxygene is Object Pascal-based, but also has influences from C#, Eiffel, Java, F# and other languages. Compared to the now deprecated Delphi.NET, Oxygene does not emphasize total backward compatibility, but is designed to be a \"reinvention\" of the language, be a good citizen on the managed development platforms, and leverage all the features and technologies provided by the .NET and Java runtimes. Oxygene is commercial product, and offers full integration into Microsoft's Visual Studio IDE on Windows, as well as its own IDE, Fire for use on macOS. The command line compiler is available free. Oxygene is one of three languages supported by the underlying Elements Compiler toolchain, next to C# and Swift. From 2008 to 2012, RemObjects Software has licensed its compiler and IDE technology to Embarcadero to be used in their Embarcadero Prism product. Starting in the Fall of 2011, Oxygene became available in two separate editions, with the second edition adding support for the Java and Android runtimes. Starting with the release of XE4, Embarcadero Prism is no longer part of the RAD Studio SKU. Numerous support and upgrade paths for Prism customers exist to migrate to Oxygene. As of 2016, there is only one edition of Oxygene, which allows development on Windows or macOS, and which can create executables for Windows .NET, iOS, Android, Java and macOS.", "pageId": 4249746, "dailyPageViews": 50, "created": 2006, "backlinksCount": 212, "revisionCount": 346, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Oxygene_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "oxygene" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 65, "id": "Oxygene" }, "githubBigQuery": { "repos": 35, "users": 32, "id": "Oxygene" }, "leachim6": { "filepath": "o/Oxygene.pas", "fileExtensions": [ "pas" ], "example": [ "implementation\n\nclass method ConsoleApp.Main;\nbegin\n Console.WriteLine('Hello World');\nend;\n\nend.\n" ], "id": "Oxygene" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Oxygene", "tiobe": { "id": "Oxygene" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Oxygene (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130911270\n||Pascal Programming Language Family: Oxygene|Books and LLC|9781156561096", "semanticScholar": "" }, "oxyl": { "title": "Oxyl", "appeared": 2019, "type": "pl", "creators": [ "J Rain De Jager" ], "description": "Oxyl is a functional programming language focused on being explicit and safe but not clunky or verbose", "website": "https://www.oxyllang.org/", "country": [ "South Africa" ], "originCommunity": [ "https://gitlab.com/selfReferentialName/oxylc/-/issues" ], "domainName": { "name": "oxyllang.org" }, "gitlabRepo": "https://gitlab.com/selfReferentialName/oxylc", "repoStats": { "firstCommit": 2019, "commits": 444, "committers": 3, "files": 69 }, "packageRepository": [ "https://opam.ocaml.org/packages/oxylc" ] }, "oz": { "title": "Oz", "appeared": 1991, "type": "pl", "creators": [ "Gert Smolka" ], "website": "http://mozart.github.io", "documentation": [ "https://www.ps.uni-saarland.de/oz2/documentation/", "http://mozart2.org/mozart-v1/doc-1.4.0/tutorial/index.html" ], "country": [ "Germany" ], "originCommunity": [ "Universität des Saarlandes" ], "domainName": { "awisRank": { "2017": 3368943 }, "name": "mozart.github.io" }, "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "% A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "%" ] ], "booleanTokens": [ [ "true", "false" ] ], "wikipedia": { "example": [ "class Counter\n attr val\n meth init(Value)\n val:=Value\n end\n meth browse\n {Browse @val}\n end\n meth inc(Value)\n val :=@val+Value\n end\nend\n\nlocal C in\n C = {New Counter init(0)}\n {C inc(6)}\n {C browse}\nend" ], "related": [ "erlang", "lisp", "prolog", "alice", "scala", "unix", "freebsd", "linux", "curry", "mercury", "visual-prolog" ], "summary": "Oz is a multiparadigm programming language, developed in the Programming Systems Lab at Université catholique de Louvain, for programming language education. It has a canonical textbook: Concepts, Techniques, and Models of Computer Programming. Oz was first designed by Gert Smolka and his students in 1991. In 1996, development of Oz continued in cooperation with the research group of Seif Haridi and Peter Van Roy at the Swedish Institute of Computer Science. Since 1999, Oz has been continually developed by an international group, the Mozart Consortium, which originally consisted of Saarland University, the Swedish Institute of Computer Science, and the Université catholique de Louvain. In 2005, the responsibility for managing Mozart development was transferred to a core group, the Mozart Board, with the express purpose of opening Mozart development to a larger community. The Mozart Programming System is the primary implementation of Oz. It is released with an open source license by the Mozart Consortium. Mozart has been ported to different flavors of Unix, FreeBSD, Linux, Windows, and macOS.", "pageId": 256916, "dailyPageViews": 78, "created": 2003, "backlinksCount": 60, "revisionCount": 228, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/Oz_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "oz" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "oz", "codemirrorMimeType": "text/x-oz", "tmScope": "source.oz", "repos": 371, "id": "Oz" }, "githubBigQuery": { "repos": 72, "users": 70, "id": "Oz" }, "codeMirror": "oz", "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2012, "committerCount": 2, "commitCount": 59, "sampleCount": 1, "example": [ "% You can get a lot of information about Oz by following theses links :\n% - http://mozart.github.io/\n% - http://en.wikipedia.org/wiki/Oz_(programming_language)\n% There is also a well known book that uses Oz for pedagogical reason :\n% - http://mitpress.mit.edu/books/concepts-techniques-and-models-computer-programming\n% And there are two courses on edX about 'Paradigms of Computer Programming' that also uses Oz for pedagogical reason :\n% - https://www.edx.org/node/2751#.VHijtfl5OSo\n% - https://www.edx.org/node/4436#.VHijzfl5OSo\n%\n% Here is an example of some code written with Oz.\n\ndeclare\n% Computes the sum of square of the N first integers.\nfun {Sum N}\n local SumAux in\n fun {SumAux N Acc}\n if N==0 then Acc\n else\n {Sum N-1 Acc}\n end\n end\n {SumAux N 0}\n end\nend\n\n% Returns true if N is a prime and false otherwize\nfun {Prime N}\n local PrimeAcc in\n fun {PrimeAcc N Acc}\n\t if(N == 1) then false\n\t elseif(Acc == 1) then true\n\t else\n\t if (N mod Acc) == 0 then false\n\t else\n\t {PrimeAcc N Acc-1}\n\t end\n\t end\n end\n {PrimeAcc N (N div 2)}\n end\nend\n\n% Reverse a list using cells and for loop (instead of recursivity)\nfun {Reverse L}\n local RevList in\n RevList = {NewCell nil}\n for E in L do\n RevList := E|@RevList\n end\n @RevList\n end\nend\n" ], "url": "https://github.com/eregon/oz-tmbundle" }, "projectEuler": { "memberCount": { "2019": 4, "2022": 4 }, "id": "Oz" }, "helloWorldCollection": [ "% Hello World in Oz\n\nfunctor\nimport\n System\n Application\ndefine\n {System.showInfo \"Hello World!\"}\n {Application.exit 0}\nend" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Oz", "rijuRepl": { "example": [ "functor\nimport\n Application\n System\ndefine\n {System.showInfo 'Hello, world!'}\n {Application.exit 0}\nend" ], "id": "https://riju.codes/oz" }, "indeedJobs": { "2022": 0, "query": "oz engineer" }, "tiobe": { "id": "Oz" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2327", "fileType": "text", "wordRank": 2692, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1996|The Oz Programming Model|10.1007/BFb0015252|344|15|G. Smolka|a0ae020a14de2b76598b81f8c2556cc0a3f7cc22\n1997|Mobile objects in distributed Oz|10.1145/265943.265972|116|4|P. V. Roy and Seif Haridi and P. Brand and G. Smolka and Michael Mehl and R. Scheidhauer|39864a975b5e91de623665e080337f066e9c6f77\n1993|Object-Oriented Concurrent Constraint Programming in Oz|10.1007/978-3-642-78545-0_3|111|0|G. Smolka and M. Henz and J. Würtz|4b0b130602cca2044e027669c3e388b55cf50206\n1994|Encapsulated Search and Constraint Programming in Oz|10.1007/3-540-58601-6_96|68|0|Christian Schulte and G. Smolka and J. Würtz|0f7e0b3ab153c5fd5796321eb29eae65d49932b0\n1995|Using Oz for College Timetabling|10.1007/3-540-61794-9_58|65|1|M. Henz and J. Würtz|17ecb640560df069fcfb43a79f11f0d5863f278c\n1994|The Definition of Kernel Oz|10.1007/3-540-59155-9_14|57|2|G. Smolka|c67f30469ee981f91d7d65f0396de0534d34402f\n2002|Logic programming in the context of multiparadigm programming: the Oz experience|10.1017/S1471068403001741|55|2|P. V. Roy and P. Brand and D. Duchier and Seif Haridi and M. Henz and Christian Schulte|59de7c9bfad41d5a4b9372bbbdb20252235ca598\n1997|An overview of the design of Distributed Oz|10.1145/266670.266726|54|1|Seif Haridi and P. V. Roy and G. Smolka|628f81e7ea25a065a23d55dfa86aee641a18bb5e\n1999|Logic Programming in Oz with Mozart|10.7551/mitpress/4304.003.0010|22|1|P. V. Roy|d04967af2209e726a502d63365f4accbfe16a56e\n1996|Virtual reality programming in Oz|10.1007/978-3-7091-7488-3_4|22|2|Tomas Axling and Seif Haridi and L. Fahlén|e2a71cf789d9a7f33a36dce3d43d6009585a482b\n1997|Objects in Oz|10.22028/D291-25701|16|2|M. Henz|30077a00fcbcae9e8c88ca85b8f5489f1c82b1bd\n2004|Strasheela: Design and Usage of a Music Composition Environment Based on the Oz Programming Model|10.1007/978-3-540-31845-3_23|13|0|Torsten Anders and C. Anagnostopoulou and Michael Alcorn|3fb32d3ef26e56cd4091fb6702c459b2cd20f5ef\n1998|Lösen kombinatorischer Probleme mit Constraintprogrammierung in Oz|10.22028/D291-25755|10|0|Jörg Würtz|2ac5f93874908107a52398cc928417df4e221e3b\n1997|Constraint-Based Scheduling in Oz|10.1007/978-3-642-60744-8_40|8|0|J. Würtz|bfffc8e419b9c05b7999561dedd81f68f21a95a5\n1994|Constraint Programming in Oz|10.7551/mitpress/4283.003.0013|8|0|Tobias Müller and K. Popov and Christian Schulte and J. Würtz|9733a192994b32c1ca5af41f1f49368201e28977\n2004|The CURRENT Platform: Building Conversational Agents in Oz|10.1007/978-3-540-31845-3_14|7|0|T. Lager and Fredrik Kronlid|477e934569677d22b16a053575ce8d944df86b64\n2004|The Development of Oz and Mozart|10.1007/978-3-540-31845-3_1|6|0|G. Smolka|f85fc3cdf9a8e32a383312d666c6f59a51ceb0f0\n1995|The Oz Programming Model (Extended Abstract)|10.1007/BFb0020450|5|0|G. Smolka|20ee7067494999a4c05678b0305abbdbc808e283\n2004|A Program Verification System Based on Oz|10.1007/978-3-540-31845-3_4|3|0|Isabelle Dony and B. L. Charlier|9e17663abf4679c2fc0b7fa361fed7fe133cabd8\n2020|A history of the Oz multiparadigm language|10.1145/3386333|3|0|P. V. Roy and Seif Haridi and C. Schulte and G. Smolka|f7286d7f80225f0386ff7f5e1ceedaeaece12130\n1996|The Oz Programming Language and System (Abstract)|10.1007/BFb0027821|3|0|G. Smolka|c5d091b371a17b9dfa749dfde3afe2091329f85a\n2004|Compiling Formal Specifications to Oz Programs|10.1007/978-3-540-31845-3_6|2|0|Tim Wahls|7804cf5eb823a0acb992a37c7dc5f5f528bc2f30" }, "p-cl": { "title": "P/CL", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f4925398fa75c3758bb00d601e44b232f5f1afd8" ], "country": [ "The Netherlands" ], "originCommunity": [ "Universiteit Utrecht" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3340", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "p-prolog": { "title": "P-Prolog", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/afc96ec418da6f6dfb89696b21e1087b7b77cbbc" ], "country": [ "Japan" ], "originCommunity": [ "Keio University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1259", "centralPackageRepositoryCount": 0 }, "p-star": { "title": "P*", "appeared": 2013, "type": "pl", "creators": [ "Atle Solbakken" ], "description": "P* (pronounced P-star) is a programming language specifically designed for web development. P* provides easy in-language support for common tasks in this field.", "website": "https://www.p-star.org/home", "aka": [ "p-star" ], "country": [ "Norway" ], "originCommunity": [ "https://github.com/P-star" ], "example": [ "#!/usr/bin/wpl -f\nSCENE main {\n /* Create a variable named 'env' of special type 'ENV' */\n ENV env;\n /* Create a variable named 'path' of type 'string' */\n string path;\n /* Tell the env variable to retrieve the environment\n variable PATH and put the result into our 'path' variable */\n path = env->PATH;\n /* Put the variable 'path' into a text string and then print it out */\n echo \"My shell looks for programs in these directories: $path\\n\";\n}" ], "githubRepo": { "stars": 5, "forks": 4, "subscribers": 4, "created": 2013, "updated": 2020, "description": "Main repository for the P* web programming language.", "url": "https://github.com/P-star/P-star" }, "repoStats": { "firstCommit": 2013, "commits": 582, "committers": 7, "files": 406 } }, "p-tac": { "title": "P-TAC", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/69d5f415589db0579dc4afc03219c9375e8a46aa" ], "country": [ "United States" ], "originCommunity": [ "Harvard University", "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1515", "centralPackageRepositoryCount": 0 }, "p": { "title": "P", "appeared": 2013, "type": "pl", "description": "P is a state machine based programming language for modeling and specifying complex distributed systems.", "website": "https://p-org.github.io/P/", "country": [ "United States" ], "originCommunity": [ "https://github.com/p-org" ], "githubRepo": { "firstCommit": 2013, "stars": 2441, "forks": 147, "subscribers": 102, "created": 2015, "updated": 2022, "description": "The P programming language.", "issues": 18, "url": "https://github.com/p-org/P" }, "repoStats": { "firstCommit": 2013, "commits": 4211, "committers": 71, "files": 1460 } }, "p3l": { "title": "P3L", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b68e6132b5e0970db71717f876fc329869533d89" ], "country": [ "Italy" ], "originCommunity": [ "Universita di Catania", "Universita di Pisa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5425", "centralPackageRepositoryCount": 0 }, "p4": { "title": "P4", "appeared": 2014, "type": "pl", "website": "http://p4.org", "country": [ "United States" ], "originCommunity": [ "Barefoot Networks", "Intel", "Stanford University", "Princeton University", "Google", "Microsoft Research" ], "domainName": { "registered": 2002, "awisRank": { "2022": 552856 }, "name": "p4.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "wikipedia": { "related": [ "c", "python" ], "summary": "P4 is a programming language designed to allow programming of packet forwarding planes. In contrast to a general purpose language such as C or Python, P4 is a domain-specific language with a number of constructs optimized around network data forwarding. P4 is an open-source, permissively licensed language and is maintained by a non-profit organization called the P4 Language Consortium. The language was originally described in a SIGCOMM CCR paper in 2014 titled “Programming Protocol-Independent Packet Processors” – the alliterative name shortens to “P4”.", "pageId": 46347117, "created": 2015, "backlinksCount": 6, "revisionCount": 28, "dailyPageViews": 89, "appeared": 2014, "fileExtensions": [ "p4" ], "url": "https://en.wikipedia.org/wiki/P4_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "p4" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.p4", "repos": 574, "id": "P4" }, "githubBigQuery": { "repos": 38, "users": 29, "id": "P4" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 3, "commitCount": 30, "sampleCount": 2, "example": [ "// Copyright 2015, Barefoot Networks, Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\naction set_mirror_id(session_id) {\n clone_ingress_pkt_to_egress(session_id);\n}\n\ntable mirror_acl {\n reads {\n ingress_metadata.if_label : ternary;\n ingress_metadata.bd_label : ternary;\n\n /* ip acl */\n ingress_metadata.lkp_ipv4_sa : ternary;\n ingress_metadata.lkp_ipv4_da : ternary;\n ingress_metadata.lkp_ip_proto : ternary;\n\n /* mac acl */\n ingress_metadata.lkp_mac_sa : ternary;\n ingress_metadata.lkp_mac_da : ternary;\n ingress_metadata.lkp_mac_type : ternary;\n }\n actions {\n nop;\n set_mirror_id;\n }\n size : INGRESS_MIRROR_ACL_TABLE_SIZE;\n}\n" ], "url": "https://github.com/TakeshiTseng/atom-language-p4" }, "twitter": "https://twitter.com/p4org", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "p4p": { "title": "p4p", "appeared": 2010, "type": "pl", "description": "an alternate syntax for Racket.", "website": "https://shriram.github.io/p4p", "reference": [ "http://shriram.github.io/p4p" ], "country": [ "United States" ], "originCommunity": [ "Brown University" ], "hasSemanticIndentation": { "example": "", "value": true }, "example": [ "defvar: m = 10\ndefvar: this-better-be-6 = add(1, 2, 3)\ndefvar: this-better-be-0 = add()\ndeffun: five() = 5\ndeffun: trpl(x) = add(x, x, x)\ndeffun: g(a, b, c) = add(a, b, c)\ndeffun: d/dx(f) =\n\n defvar: delta = 0.001\n\n fun: (x) in:\n\n div(sub(f(add(x, delta)),\n\n f(x)),\n\n delta)\n deffun: fib(n) =\n if: numeq(n, 0)\n 1\n elseif: numeq(n, 1)\n 1\n else:\n add(fib(sub1(n)), fib(sub(n, 2)))" ], "githubRepo": { "firstCommit": 2010, "stars": 12, "forks": 2, "subscribers": 2, "created": 2010, "updated": 2022, "description": "An alternate syntax for Racket", "issues": 0, "url": "https://github.com/shriram/p4p" }, "repoStats": { "firstCommit": 2010, "commits": 20, "committers": 2, "files": 15 } }, "package-control-pm": { "title": "package-control-pm", "appeared": 2014, "type": "packageManager", "website": "https://packagecontrol.io/", "country": [ "United States" ], "originCommunity": [ "https://github.com/wbond/package_control/issues" ], "domainName": { "registered": 2014, "awisRank": { "2022": 66815 }, "name": "packagecontrol.io" }, "packageCount": 4698, "packageAuthors": 3423, "packageInstallCount": 50000000, "forLanguages": [ "sublime-editor" ] }, "packagist-pm": { "title": "packagist-pm", "appeared": 2011, "type": "packageManager", "creators": [ "Jordi Boggiano" ], "website": "https://packagist.org/", "country": [ "The Netherlands and Canada and Germany and Switzerland and Moscow" ], "originCommunity": [ "https://github.com/composer" ], "domainName": { "registered": 2011, "awisRank": { "2022": 13969 }, "name": "packagist.org" }, "githubRepo": { "firstCommit": 2011, "stars": 1586, "forks": 489, "subscribers": 79, "created": 2011, "updated": 2022, "description": "Package Repository Website - try https://packagist.com if you need your own -", "issues": 58, "url": "https://github.com/composer/packagist" }, "packageCount": 211636, "packageInstallCount": 12906177931, "forLanguages": [ "php" ], "twitter": "https://twitter.com/packagist" }, "pacmanconf": { "title": "PacmanConf", "appeared": 2019, "type": "configFormat", "website": "https://www.archlinux.org/pacman/pacman.conf.5.html", "country": [ "Unknown" ], "originCommunity": [ "https://bugs.archlinux.org" ], "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "pacman.conf" ], "id": "PacmanConf" }, "semanticScholar": "" }, "pacol": { "title": "PACOL", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b517ba4cb6cf0e9ed5fc910e1bafe63e8605d731" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5884", "centralPackageRepositoryCount": 0 }, "pact-i": { "title": "PACT I", "appeared": 1955, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "related": [ "speedcoding" ], "summary": "PACT was a series of compilers for the IBM 701 and IBM 704 scientific computers. Their development was conducted jointly by IBM and a committee of customers starting in 1954. PACT I was developed for the 701, and PACT IA for the 704. The emphasis in that early generation of compilers was minimization of the memory footprint, because memory was a very expensive resource at the time. The word \"compiler\" was not in widespread use at the time, so most of the 1956 papers described it as an \"(automatic) coding system\", although the word compiler was also used in some papers.", "created": 2010, "backlinksCount": 9, "pageId": 13140102, "revisionCount": 2, "dailyPageViews": 3, "appeared": 1954, "url": "https://en.wikipedia.org/wiki/PACT_I" }, "hopl": "https://hopl.info/showlanguage.prx?exp=103", "centralPackageRepositoryCount": 0, "isbndb": "" }, "pact-ia": { "title": "PACT IA", "appeared": 1957, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2403ebaa7ec4482b08cd913d029bc80dc4e64464" ], "country": [ "United States" ], "originCommunity": [ "RAND Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2515", "centralPackageRepositoryCount": 0, "isbndb": "" }, "pact": { "title": "Pact", "appeared": 2016, "type": "contractLanguage", "isPublicDomain": false, "creators": [ "Stuart Popejoy" ], "website": "http://kadena.io/try-pact/", "documentation": [ "https://pact-language.readthedocs.io/en/stable/" ], "country": [ "United States" ], "originCommunity": [ "Kadena LLC" ], "writtenIn": [ "haskell" ], "example": [ "(map (+ 1) [1 2 3])" ], "githubRepo": { "stars": 536, "forks": 93, "subscribers": 47, "created": 2016, "updated": 2023, "description": "The Pact Smart Contract Language", "issues": 110, "url": "https://github.com/kadena-io/pact" }, "repoStats": { "firstCommit": 2016, "commits": 4397, "committers": 54, "files": 412 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n12944077|Show HN: Pact – a safe smart contract language (web editor)|2016-11-13 16:30:19 UTC|1479054619|buckie|2|18", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2001|Springer|Parallel Computing Technologies: 6th International Conference, PaCT 2001, Novosibirsk, Russia, September 3-7, 2001 Proceedings (Lecture Notes in Computer Science, 2127)||9783540425229\n2021|Springer|Parallel Computing Technologies: 16th International Conference, PaCT 2021, Kaliningrad, Russia, September 13–18, 2021, Proceedings (Lecture Notes in Computer Science Book 12942)|Author|9783030863593\n2015|Springer|Parallel Computing Technologies: 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31-September 4, 2015, Proceedings (Lecture Notes in Computer Science Book 9251)|Victor Malyshkin|9783319219097" }, "pactolus": { "title": "PACTOLUS", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6934c13c28c37f165cefe838c1f6ed6a1472a4e8" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=449", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "padl-1": { "title": "PADL-1", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6de7d26addad29cc99ac49ce1c85bf668ccb50a2" ], "country": [ "United States" ], "originCommunity": [ "The University of Rochester" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5287", "centralPackageRepositoryCount": 0 }, "pailisp": { "title": "PaiLisp", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/cb80e839c67a7a28f1cc087daf8175f259fbfce7" ], "country": [ "United States" ], "originCommunity": [ "Tohoku University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1252", "centralPackageRepositoryCount": 0 }, "paisley": { "title": "PAISley", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/83b4bfa6f2c5cb24bf41aded6d41d64dfb570b51" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1004", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Some Experiments on Light-Weight Object-Functional-Logic Programming in Java with Paisley|10.1007/978-3-319-08909-6_14|4|0|B. T. Widemann and M. Lepper|b3373d0e33771471ae105b8abbbb153a01f0f3d5\n2017|A Practical Study of Control in Objected-Oriented-Functional-Logic Programming with Paisley|10.4204/EPTCS.234.11|2|0|B. T. Widemann and M. Lepper|9e8ae4bd268d35b642cfb12bddd7988669d47af3\n2019|Improving the Performance of the Paisley Pattern-Matching EDSL by Staged Combinatorial Compilation|10.1007/978-3-030-46714-2_17|1|0|B. T. Widemann and M. Lepper|828518848408eafe083d1193040d2ac70b675acb" }, "palasm": { "title": "PALASM", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Monolithic Memories, Inc" ], "wikipedia": { "summary": "PALASM is an early hardware description language, used to translate Boolean functions and state transition tables into a fuse map for use with Programmable Array Logic (PAL) devices introduced by Monolithic Memories, Inc. (MMI). The language was developed by John Birkner in the early 1980s. It is not case-sensitive. The PALASM compiler was written by MMI in FORTRAN IV on an IBM 370/168. MMI made the source code available to users at no cost. By 1983, MMI customers ran versions on the DEC PDP-11, Data General NOVA, Hewlett-Packard HP 2100, MDS800 and others. A widely used MS DOS port was produced by MMI. There was a windows front-end written sometime later.", "created": 2004, "backlinksCount": 90, "pageId": 1081091, "revisionCount": 34, "dailyPageViews": 16, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/PALASM" }, "centralPackageRepositoryCount": 0 }, "palcode": { "title": "PALcode", "appeared": 1996, "type": "isa", "reference": [ "http://www.science.unitn.it/~fiorella/guidelinux/tlk/node140.html" ], "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "related": [ "freebsd", "linux" ], "summary": "In computing, in the Alpha instruction set architecture, PALcode (Privileged Architecture Library code) is the name used by DEC for a set of functions in the SRM or AlphaBIOS firmware, providing a hardware abstraction layer for system software, covering features such as cache management, translation lookaside buffer (TLB) miss handling, interrupt handling and exception handling. PALcode is Alpha machine code, running in a special mode that also allows access to internal registers specific to the particular Alpha processor implementation. It is thus somewhere between the role of microcode and of a hardware emulator. PALcode is operating system-specific; different versions of PALcode are required by OpenVMS, Tru64 UNIX, and Windows NT. Tru64 UNIX PALcode is also used by NetBSD, FreeBSD, OpenBSD and Linux.", "pageId": 5817145, "dailyPageViews": 8, "created": 2006, "backlinksCount": 24, "revisionCount": 21, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/PALcode" }, "fileType": "na", "centralPackageRepositoryCount": 0 }, "palingol": { "title": "Palingol", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5da731820bc1c93b30a271da7ff90de85088dbf9" ], "country": [ "France" ], "originCommunity": [ "Institut Curie" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6698", "centralPackageRepositoryCount": 0 }, "pamela": { "title": "PAMELA", "appeared": 1992, "type": "pl", "description": "In this report we present a new methodology for the performance prediction of parallel programs on parallel platforms ranging from shared-memory to distributed-memory (vector) machines. The complete methodology comprises the concurrent language Pamela (PerformAnce ModEling LAnguage), the program and machine modeling paradigm, and a novel performance analysis method, called \"serialization analysis\". While Pamela models can be directly executed (i.e., simulated), prior to this ultimate evaluation step, serialization analysis allows for (symbolic) model reduction, which often renders simulation superuous. This analysis method extends conventional parallel program analysis technology by explicitly accounting for the performance degrading e\u000bects of resource contention, yet at the low evaluation cost, typical for conventional techniques. It is shown that, where application of conventional techniques may yield serious errors, predictions from serialization analysis remain accurate. Apart from the modeling methodology itself, this low-cost/high-reliability analysis potential makes Pamela a particularly suitable candidate for compile-time application in terms of the performance prediction hierarchy often found in parallel programming environments.", "reference": [ "http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.12.9900&rep=rep1&type=pdf", "https://dl.acm.org/doi/10.1145/165939.166002" ], "country": [ "The Netherlands" ], "originCommunity": [ "Delft University of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5099", "wordRank": 8220, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1993|Performance prediction of parallel processing systems: the PAMELA methodology|10.1145/165939.166002|112|3|A. V. Gemund|33e380c38a45918c483c5e9c6ae7410f040db391" }, "pan": { "title": "Pan", "appeared": 2011, "type": "pl", "creators": [ "Charles Loomis" ], "website": "http://www.quattor.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/quattor" ], "domainName": { "registered": 2003, "name": "quattor.org" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "githubRepo": { "firstCommit": 2011, "stars": 10, "forks": 18, "subscribers": 25, "created": 2012, "updated": 2022, "description": "Pan Language Compiler and Tools", "issues": 64, "url": "https://github.com/quattor/pan" }, "repoStats": { "firstCommit": 2011, "commits": 954, "committers": 26, "files": 1267 }, "wikipedia": { "example": [ "[ object | declaration | unique | structure ] template template-name;\n[ statement … ]" ], "related": [ "java" ], "summary": "The pan configuration language allows the definition of machine configuration information and an associated schema with a simple, human-accessible syntax. A pan language compiler transforms the configuration information contained within a set of pan templates to a machine-friendly XML or JSON format. The pan language is used within the Quattor toolkit to define the desired configuration for one or more machines. The language is primarily a declarative language where elements in a hierarchical tree are set to particular values. The pan syntax is human-friendly and fairly simple, yet allows system administrators to simultaneously set configuration values, define an overall configuration schema, and validate the final configuration against the schema.", "pageId": 33160613, "created": 2011, "backlinksCount": 5, "revisionCount": 27, "dailyPageViews": 4, "fileExtensions": [ "pan", "tpl" ], "url": "https://en.wikipedia.org/wiki/Pan_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "pan" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.pan", "repos": 41, "id": "Pan" }, "githubBigQuery": { "repos": 150, "users": 119, "id": "Pan" }, "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "pan" ], "id": "Pan" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 17, "commitCount": 117, "sampleCount": 18, "example": [ "unique template site/one/onevm;\n\ninclude 'components/chkconfig/config';\n\n# set opennebula map\ninclude 'quattor/aii/opennebula/schema';\nbind \"/system/opennebula\" = opennebula_vmtemplate;\n\ninclude 'site/config-vm';\n\ninclude 'quattor/aii/opennebula/default';\n\n\"/software/packages/{acpid}\" = dict();\n\"/software/components/chkconfig/service/acpid\" = dict('on', '', 'startstop', true);\n" ], "url": "https://github.com/quattor/language-pan" }, "fileType": "text", "wordRank": 3457, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "pancode": { "title": "PANCODE", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9e64520ea46880dd54f6fc649a2db3cf6d6481a3" ], "country": [ "Canada" ], "originCommunity": [ "Concordia Universily" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5293", "centralPackageRepositoryCount": 0 }, "pandas": { "title": "Pandas", "appeared": 2008, "type": "library", "website": "https://pandas.pydata.org", "country": [ "Various" ], "originCommunity": [ "https://github.com/pandas-dev" ], "domainName": { "name": "pandas.pydata.org" }, "writtenIn": [ "python" ], "hasLineComments": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "wikipedia": { "example": [ ">>>import pandas as pd\nSeries\n>>>s = pd.Series([1, 3, 5, np.nan, 6, 8])\nDataFrame\n>>> import pandas as pd\n>>>df = pd.DataFrame(np.random.randn(6, 4), index=dates, columns=list(\"ABCD\"))\n>>> df.head()\n>>>df.tail()\nQuick Statistics summary of data\n>>> df.describe()\nIndexing" ], "related": [ "python", "cython", "c", "matplotlib", "numpy", "scipy", "r", "scikit-learn" ], "summary": "In computer programming, pandas is a software library written for the Python programming language for data manipulation and analysis. In particular, it offers data structures and operations for manipulating numerical tables and time series. It is free software released under the three-clause BSD license. The name is derived from the term \"panel data\", an econometrics term for multidimensional, structured data sets.", "pageId": 38833779, "dailyPageViews": 277, "created": 2013, "backlinksCount": 46, "revisionCount": 113, "appeared": 2017, "url": "https://pandas.pydata.org/docs/user_guide/10min.html" }, "indeedJobs": { "2017": 341, "query": "pandas engineer" }, "twitter": "https://twitter.com/pandas_dev", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPandas for Everyone: Python Data Analysis (Addison-Wesley Data & Analytics Series)|2017|Daniel Y. Chen|37559100|3.98|46|4\nPython Pandas: The Hands-On, Example-Rich Introduction to Pandas Data Analysis in Python|2019|Pandas Publishing|48658135|3.86|7|1\nPlay with csv Files using Python : pandas|2021|Pandas Publishing|59410781|3.00|1|0" }, "pandoc-app": { "title": "Pandoc", "appeared": 2006, "type": "application", "description": "If you need to convert files from one markup format into another, pandoc is your swiss-army knife.", "website": "http://pandoc.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/jgm/pandoc/issues" ], "domainName": { "registered": 2014, "awisRank": { "2022": 143637 }, "name": "pandoc.org" }, "writtenIn": [ "haskell" ], "wikipedia": { "related": [ "haskell", "markdown", "html", "restructuredtext", "latex", "org", "ooxml", "tex", "lua", "bibtex" ], "summary": "Pandoc is a free and open-source software document converter, widely used as a writing tool (especially by scholars) and as a basis for publishing workflows. It was created by John MacFarlane, a philosophy professor at the University of California, Berkeley.", "pageId": 43162750, "created": 2014, "backlinksCount": 136, "revisionCount": 66, "dailyPageViews": 75, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Pandoc" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "pandora": { "title": "Pandora", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0d886a743ec66f491f34c3f053fdff9a59bde8c9" ], "country": [ "United Kingdom" ], "originCommunity": [ "Imperial College London" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1511", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|The Pandora software development kit for pattern recognition|10.1140/EPJC/S10052-015-3659-3|84|4|J. Marshall and M. Thomson|5b6f7ef6d27897403ba33ed69f6d54dee307be5f\n1993|Non-Deterministic Concurrent Logic Programming in Pandora|10.1142/1898|14|1|R. Bahgat|3d3427de48b19aa5767acf6ecba873461c03682e\n2018|PANDORA - A python based framework for modelling and structural sizing of transport aircraft|10.1051/MATECCONF/201823300013|9|0|M. Petsch and D. Kohlgrüber and J. Heubischl|252f259f45890fc3770b2ee4c01c8d862ce4e9c1\n2020|Curating Ocean Ecology at the Natural History Museum: Miranda Lowe and Richard Sabin in conversation with Pandora Syperek and Sarah Wade|10.15180/201314|4|0|P. Syperek and S. Wade and M. Lowe and R. Sabin|7dd12db562f8c47414980e0f857c3ca2ad92af21\n1991|The Pandora Abstract Machine: An Extension of JAM|10.1007/3-540-55038-0_7|2|0|R. Bahgat|42fd5e02db84cdea91b935209e29eda354785f8d\n1996|Incremental querying in the concurrent CLP language IFD-Constraint Pandora|10.1145/331119.331211|2|0|Jimmy Ho-man Lee and Ho-fung Leung|9f42ee0dff83316c1d57bbd77c90386e69523f1a" }, "panon-1": { "title": "PANON-1", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/558c3be32d038f51e0f87f8bc815ab5b04d155de" ], "country": [ "Italy" ], "originCommunity": [ "Universita di pisa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2880", "centralPackageRepositoryCount": 0 }, "panon-1b": { "title": "PANON-1B", "appeared": 1965, "type": "pl", "reference": [ "https://semanticscholar.org/paper/558c3be32d038f51e0f87f8bc815ab5b04d155de" ], "country": [ "Italy" ], "originCommunity": [ "Universita di pisa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3166", "centralPackageRepositoryCount": 0 }, "panther-lang": { "title": "panther-lang", "appeared": 2010, "type": "pl", "description": "Panther is a programming language aimed at young users with only a small knowledge of programming. Panther offers you a more advanced version of Scratch, a simple programming language developed at MIT.", "website": "http://pantherprogramming.weebly.com/", "reference": [ "https://en.scratch-wiki.info/wiki/Panther_(Scratch_Modification)" ], "country": [ "Various" ], "originCommunity": [ "http://pantherprogramming.weebly.com/meet-the-developers.html" ], "domainName": { "awisRank": { "2022": 6333562 }, "name": "pantherprogramming.weebly.com" }, "centralPackageRepositoryCount": 0 }, "paperalgo": { "title": "paperalgo", "appeared": 2014, "type": "notation", "creators": [ "Kragen Javier Sitaker" ], "website": "http://canonical.org/~kragen/sw/dev3/paperalgo", "country": [ "Argentina" ], "originCommunity": [ "https://www.mail-archive.com/kragen-tol@canonical.org" ] }, "papyrus": { "title": "Papyrus", "appeared": 2015, "type": "pl", "description": "Papyrus is an entirely new scripting system created specifically for the Creation Kit. If you've never used a Bethesda toolset before, consider some basic tutorials to get your footing with the Creation Kit in general.", "reference": [ "https://www.creationkit.com/index.php?title=Category:Papyrus" ], "country": [ "United States" ], "originCommunity": [ "Bethesda Softworks LLC" ], "wikipedia": { "related": [ "isbn", "doi" ], "summary": "Papyrus is a material similar to thick paper that was used in ancient times as a writing surface. It was made from the pith of the papyrus plant, Cyperus papyrus, a wetland sedge. Papyrus (plural: papyri) can also refer to a document written on sheets of such material, joined together side by side and rolled up into a scroll, an early form of a book. Papyrus is first known to have been used in Egypt (at least as far back as the First Dynasty), as the papyrus plant was once abundant across the Nile Delta. It was also used throughout the Mediterranean region and in the Kingdom of Kush. Apart from a writing material, ancient Egyptians employed papyrus in the construction of other artifacts, such as reed boats, mats, rope, sandals, and baskets.", "backlinksCount": 1929, "pageId": 23664, "created": 2002, "revisionCount": 1920, "dailyPageViews": 868, "appeared": 1830, "url": "https://en.wikipedia.org/wiki/Papyrus" }, "githubLanguage": { "fileExtensions": [ "psc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.papyrus.skyrim", "repos": 3518, "id": "Papyrus" }, "githubBigQuery": { "repos": 79, "users": 58, "id": "Papyrus" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2017, "committerCount": 3, "commitCount": 523, "sampleCount": 3, "example": [ "Scriptname vMFX_FXPlugin extends Quest \n" ], "url": "https://github.com/Kapiainen/SublimePapyrus" }, "languageServerProtocolProject": [ "https://github.com/joelday/papyrus-lang\nwrittenIn csharp" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "par": { "title": "par", "appeared": 2018, "type": "pl", "website": "https://par-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/karthikv/par/issues" ], "domainName": { "registered": 2017, "name": "par-lang.org" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17339290|Show HN: Par, a statically-typed, functional language focused on usability|2018-06-18 16:02:51 UTC|1529337771|karthikksv|0|5" }, "paragon": { "title": "Paragon", "appeared": 1991, "type": "pl", "reference": [ "https://apps.dtic.mil/sti/pdfs/ADA461110.pdf", "https://semanticscholar.org/paper/210f6179ce9b11f0c8bf3b76af85d2928dfac7b3" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1651", "centralPackageRepositoryCount": 0 }, "parallax-propeller": { "title": "Parallax Propeller", "appeared": 2006, "type": "isa", "country": [ "United States" ], "originCommunity": [ "Parallax, Inc" ], "wikipedia": { "related": [ "assembly-language", "verilog", "python", "basic-stamp", "pbasic", "c", "basic", "forth", "jvm", "pascal", "ladder-logic" ], "summary": "The Parallax P8X32A Propeller is a multi-core processor parallel computer architecture microcontroller chip with eight 32-bit reduced instruction set computer (RISC) central processing unit (CPU) cores. Introduced in 2006, it is designed and sold by Parallax, Inc. The Propeller microcontroller, Propeller assembly language, and Spin interpreter were designed by one person, Parallax's cofounder and president, Chip Gracey. The Spin programming language and Propeller Tool integrated development environment (IDE) were designed by Chip Gracey and Parallax's software engineer Jeff Martin. On August 6, 2014, Parallax Inc., released all of the Propeller 1 P8X32A hardware and tools as open-source hardware and software under the GNU General Public License (GPL) 3.0. This included the Verilog code, top-level hardware description language (HDL) files, Spin interpreter, PropellerIDE and SimpleIDE programming tools, and compilers.", "pageId": 5118476, "created": 2006, "backlinksCount": 143, "revisionCount": 369, "dailyPageViews": 62, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Parallax_Propeller" }, "fileType": "na", "centralPackageRepositoryCount": 0 }, "parallel-ellpack": { "title": "Parallel ELLPACK", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/394dfd721925c2faf160c851de2df7b5b67a2e8d" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6931", "centralPackageRepositoryCount": 0 }, "parallel-pascal": { "title": "Parallel Pascal", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/10c78f2482fc971ed101675837148fc5af655455" ], "country": [ "United States" ], "originCommunity": [ "Cornell University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1106", "centralPackageRepositoryCount": 0 }, "paralog-e": { "title": "ParaLog_e", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a849f326a4ae2f8e1fcdf8311528a882720839b6" ], "country": [ "Brazil" ], "originCommunity": [ "Pontifical Catholic University of Parana", "Paulista University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5776", "centralPackageRepositoryCount": 0 }, "parasail": { "title": "parasail", "appeared": 2009, "type": "pl", "creators": [ "Seth Tucker Taft" ], "description": "ParaSail is a new parallel programming language designed to support the development of inherently safe and secure, highly parallel applications that can be mapped to multicore, manycore, heterogeneous, or distributed architectures.", "website": "http://parasail-lang.org", "documentation": [ "https://adacore.github.io/ParaSail/images/parasail_ref_manual.pdf" ], "fileExtensions": [ ".psi", ".psl" ], "country": [ "United States" ], "originCommunity": [ "Ada Core Technologies" ], "domainName": { "registered": 2012, "name": "parasail-lang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "IO.Println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "summary": "Parallel Specification and Implementation Language (ParaSail) is an object-oriented parallel programming language. Its design and ongoing implementation is described in a blog and on its official website.", "url": "https://en.wikipedia.org/wiki/ParaSail_(programming_language)" }, "pygmentsHighlighter": { "filename": "parasail.py", "fileExtensions": [ "psi", "psl" ], "id": "ParaSail" }, "leachim6": { "filepath": "p/ParaSail.psi", "fileExtensions": [ "psi" ], "example": [ "func Hello_World(var IO) is\n IO.Println(\"Hello World\");\nend func Hello_World;\n" ], "id": "ParaSail" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n19121947|ParaSail Programming Language: parallel programming language|http://parasail-lang.org/|2019-02-09 12:26:40 UTC|1549715200|based2|19|97" }, "parasolid": { "title": "Parasolid", "appeared": 2000, "type": "application", "fileExtensions": [ "x_t", "x_b" ], "country": [ "United States" ], "originCommunity": [ "Siemens Industry Software Inc" ], "wikipedia": { "backlinksCount": 211, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Parasolid" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4875" }, "parenscript": { "title": "Parenscript", "appeared": 2009, "type": "pl", "creators": [ "Manuel Odendahl", "Edward Marco Baringer" ], "website": "https://common-lisp.net/project/parenscript/", "country": [ "United States and Italy" ], "originCommunity": [ "https://gitlab.common-lisp.net/parenscript/parenscript/-/issues" ], "compilesTo": [ "javascript" ], "writtenIn": [ "common-lisp" ], "isLisp": { "example": "", "value": true }, "githubRepo": { "stars": 247, "forks": 34, "subscribers": 25, "created": 2013, "updated": 2022, "firstCommit": 2005, "description": "MOVED TO C-L.NET GITLAB. THIS REPOSITORY WILL BE DELETED", "issues": 1, "url": "https://github.com/vsedach/Parenscript" }, "gitlabRepo": "https://gitlab.common-lisp.net/parenscript/parenscript", "repoStats": { "firstCommit": 2005, "commits": 885, "committers": 35, "files": 37 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "parenthetic": { "title": "parenthetic", "appeared": 2012, "type": "esolang", "creators": [ "Cameron McKinnon" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/cammckinnon/Parenthetic/issues" ], "githubRepo": { "firstCommit": 2012, "stars": 71, "forks": 7, "subscribers": 4, "created": 2012, "updated": 2022, "description": "A Lisp-style language whose programs consist entirely of parentheses.", "issues": 6, "url": "https://github.com/cammckinnon/Parenthetic" }, "repoStats": { "firstCommit": 2012, "commits": 11, "committers": 2, "files": 21 }, "leachim6": { "filepath": "p/Parenthetic.p", "fileExtensions": [ "p" ], "example": [ "Parenthetic - https://github.com/cammckinnon/Parenthetic\n\n((()()())(()(()()))((()(()))((())()()()()()()())((()()(()))((())()()()()()()()()())\n((())()()()()()()()()()()))))((()()())(()(()()()))((()(())(())())((())()()()()()()(\n)()()()()()()()()()()()()()()()()()()()()()()()()())))((()(()))((()(())(())())((()(\n()))(()(()()))((())()()()()()()())))((()(())(())())((()(()))(()(()()))((())()()()()\n)))((()(())(())())((()(()))(()(()()))((())()()()()()()()()()()())))((()(())(())())(\n(()(()))(()(()()))((())()()()()()()()()()()())))((()(())(())())((()(()))(()(()()))(\n(())()()()()()()()()()()()()()())))(()(()()()))((()(())(())())((()(()))(()(()()))((\n())()()()()()()()()()()()()()()()()()()()()()())))((()(())(())())((()(()))(()(()())\n)((())()()()()()()()()()()()()()())))((()(())(())())((()(()))(()(()()))((())()()()(\n)()()()()()()()()()()()()())))((()(())(())())((()(()))(()(()()))((())()()()()()()()\n()()()())))((()(())(())())((()(()))(()(()()))((())()()()))))\n" ], "id": "Parenthetic" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n3892508|Show HN: A programming language that uses only parentheses|2012-04-26 05:01:56 UTC|1335416516|c4m|31|55" }, "pari-gp": { "title": "PARI/GP", "appeared": 1985, "type": "pl", "website": "http://pari.math.u-bordeaux.fr/", "aka": [ "parigp", "PARI/GP" ], "country": [ "France" ], "originCommunity": [ "Université Bordeaux" ], "domainName": { "name": "pari.math.u-bordeaux.fr" }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "wikipedia": { "example": [ "? \\p 212\n realprecision = 221 significant digits (212 digits displayed)\n? (1.378-0.09143*I)^(14.87+0.3721*I)\ntime = 0 ms.\n%1 = 80.817082637557070449383034933010288336925078193546211741027496566803185\n11092579265743992920628314516739962724446042667886245322716456966120413965187\n3272488827365261487845201056199035423784093096984005713791800191 - 94.8384618\n89186304973351271821601500916571303364865064205039706592481303045713982306764\n33264430511752515705768858710051382035377195497482934017239179757538824688799\n0680136241031895212412150770309289450962931402933*I\n\n? 123456! + 0.\ntime = 1,656 ms.\n%2 = 2.6040699049291378729513930560926568818273270409503019584610185579952057\n37967683415793560716617127908735520017061666000857261271456698589373086528293\n4317244121152865814030204645985573419251305342231135573491050756 E574964\n\n? sin(x)\ntime = 0 ms.\n%3 = x - 1/6*x^3 + 1/120*x^5 - 1/5040*x^7 + 1/362880*x^9 - 1/39916800*x^11\n+ 1/6227020800*x^13 - 1/1307674368000*x^15 + O(x^17)\n\n? for(z=25,30, print (factor(2^z-1)))\n[31, 1; 601, 1; 1801, 1]\n[3, 1; 2731, 1; 8191, 1]\n[7, 1; 73, 1; 262657, 1]\n[3, 1; 5, 1; 29, 1; 43, 1; 113, 1; 127, 1]\n[233, 1; 1103, 1; 2089, 1]\n[3, 2; 7, 1; 11, 1; 31, 1; 151, 1; 331, 1]\ntime = 5 ms.\n\n? K = bnfinit(x^2 + 23); K.cyc\ntime = 1ms.\n%4 = [3]\n/* This number field has class number 3. */" ], "related": [ "c", "pascal", "fortran", "perl", "python", "sagemath" ], "summary": "PARI/GP is a computer algebra system with the main aim of facilitating number theory computations. Versions 2.1.0 and higher are distributed under the GNU General Public License. It runs on most common operating systems.", "pageId": 24383128, "dailyPageViews": 42, "created": 2002, "backlinksCount": 146, "revisionCount": 183, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/PARI/GP" }, "projectEuler": { "memberCount": { "2022": 123 }, "id": "PARI/GP" }, "quineRelay": "PARI/GP", "rijuRepl": { "example": [ "print(\"Hello, world!\")" ], "id": "https://riju.codes/parigp" }, "tryItOnline": "pari-gp", "ubuntuPackage": "pari-gp", "jupyterKernel": [ "https://github.com/jdemeyer/pari_jupyter" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "parlog": { "title": "Parlog", "appeared": 1983, "type": "pl", "creators": [ "Steve Gregory", "Keith L. Clark" ], "country": [ "United Kingdom" ], "originCommunity": [ "Imperial College, London" ], "example": [ "mode qsort(list?,sorted_list^).\nqsort([N|Rest],Sorted) <-\npartition(N,Rest,LessN,MoreN),\nqsort(LessN,SortedLess),\nqsort(MoreN,SortedMore),\nappend(SortedLess,[N|SortedMore],Sorted).\nqsort([],[])." ], "wikipedia": { "summary": "Parlog is a logic programming language designed for efficient utilization of parallel computer architectures. Its semantics is based on first order predicate logic. It expresses concurrency, interprocess communication, indeterminacy and synchronization within the declarative language framework.It was designed at Imperial College, London by Steve Gregory and Keith L. Clark, as a descendant of IC Prolog and Relational Language.", "pageId": 31688822, "created": 2011, "backlinksCount": 2, "revisionCount": 13, "dailyPageViews": 6, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/Parlog" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1049", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming In Parlog|1989|Tom Conlon|4758737|0.0|0|0\nParlog as a System Progrmming Language||- -|66253993|0.0|0|0\nParlog as a System Progrmming Language||- -|66253992|0.0|0|0\nParallel Logic Programming in Parlog: The Language and Its Implementation|1987|Steve Gregory|3574744|2.00|1|0" }, "parmod": { "title": "ParMod", "appeared": 1987, "type": "pl", "reference": [ "https://link.springer.com/chapter/10.1007/3-540-55437-8_75" ], "country": [ "Germany" ], "originCommunity": [ "Technische Universität München" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1348", "centralPackageRepositoryCount": 0 }, "parquet": { "title": "parquet", "appeared": 2014, "type": "binaryDataFormat", "creators": [ "Doug Cutting", "Julien Le Dem" ], "website": "http://parquet.apache.org/", "country": [ "United States" ], "originCommunity": [ "Twitter Inc", "Cloudera, Inc" ], "domainName": { "name": "parquet.apache.org" }, "wikipedia": { "summary": "Apache Parquet is a free and open-source column-oriented data storage format in the Apache Hadoop ecosystem. It is similar to RCFile and ORC, the other columnar-storage file formats in Hadoop, and is compatible with most of the data processing frameworks around Hadoop. It provides efficient data compression and encoding schemes with enhanced performance to handle complex data in bulk.", "url": "https://en.wikipedia.org/wiki/Apache_Parquet" }, "twitter": "https://twitter.com/apacheparquet", "fileType": "binary", "centralPackageRepositoryCount": 0 }, "parrot-assembly": { "title": "Parrot Assembly", "appeared": 2003, "type": "assembly", "country": [ "United States" ], "originCommunity": [ "https://www.perl.org" ], "example": [ "#!/usr/bin/env parrot\n\n.pcc_sub :main main:\n say \"Hello!\"\n end" ], "wikipedia": { "related": [ "assembly-language", "parrot-vm", "parrot-internal-representation" ], "summary": "The Parrot assembly language (PASM) is the basic assembly language used by the Parrot virtual machine. PASM is the lowest level assembly language in the Parrot stack. The Parrot intermediate representation (PIR) is PASM extended to simplify development of compilers. The hello world program in PASM is simply: print \"Hello world!\\n\" end Although it appears similar to source code in some high-level programming languages, more complex PASM programs will resemble other assembly languages. The main exceptions to this low level programming in PASM are string handling and, as shown above, input and output. Additionally, PASM has automatic garbage collection from the virtual machine, and it does not allow pointer arithmetic. Parrot assembly language has more instructions than hardware assembly languages, even CISC processors. This is because the marginal cost of creating a new instruction in Parrot is low compared to the marginal cost of doing so in hardware, and the creators of Parrot had no particular goal of minimalism.", "backlinksCount": 12, "pageId": 293811, "created": 2003, "revisionCount": 35, "dailyPageViews": 5, "url": "https://en.wikipedia.org/wiki/Parrot_assembly_language" }, "githubLanguage": { "fileExtensions": [ "pasm" ], "trendingProjectsCount": 0, "type": "programming", "group": "Parrot", "interpreters": [ "parrot" ], "aceMode": "text", "tmScope": "none", "aliases": [ "pasm" ], "repos": 1, "id": "Parrot Assembly" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "parrot-basic": { "title": "Parrot BASIC", "appeared": 2009, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://www.perl.org" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "example": [ ".sub 'main' :main\n $I1 = 4\n inc $I1 # $I1 is now 5\n $I1 += 2 # $I1 is now 7\n $N1 = 42.0\n dec $N1 # $N1 is now 41.0\n $N1 -= 2.0 # $N1 now 39.0\n print $I1\n print ', '\n print $N1\n print \"\\n\"\n .end" ], "related": [ "c", "parrot-assembly", "parrot-internal-representation", "perl", "perl-6", "python", "jvm", "llvmir", "java", "java-bytecode", "joy", "lua", "php", "ruby", "scheme", "tcl", "wmlscript", "arc", "apl", "common-lisp", "lisp", "ecmascript", "forth", "quickbasic", "smalltalk", "cil", "befunge", "brainfuck", "lolcode", "unlambda", "unicode" ], "summary": "Parrot is a register-based process virtual machine designed to run dynamic languages efficiently. It is possible to compile Parrot assembly language and PIR (an intermediate language) to Parrot bytecode and execute it. Parrot is free and open source software.Parrot was started by the Perl community and is developed with help from the open source and free software communities. As a result, it is focused on license compatibility with Perl (Artistic License 2.0), platform compatibility across a broad array of systems, processor architecture compatibility across most modern processors, speed of execution, small size (around 700k depending on platform), and the flexibility to handle the varying demands made by Perl 6 and other modern dynamic languages. Version 1.0, with a stable API for development, was released on March 17, 2009.The current version is release 8.1.0 \"Andean Parakeet\"", "created": 2010, "backlinksCount": 174, "pageId": 60511, "revisionCount": 1, "dailyPageViews": 1, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/Parrot_BASIC" }, "centralPackageRepositoryCount": 0 }, "parrot-internal-representation": { "title": "PIR", "appeared": 2006, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://www.perl.org" ], "wikipedia": { "example": [ ".sub foo\n .param int a\n .param int b\n .local int tmp\n tmp = a + b\n .return (tmp)\n .end" ], "related": [ "assembly-language", "parrot-vm", "parrot-assembly" ], "summary": "The Parrot intermediate representation (PIR), previously called Intermediate code (IMC), is one of the two assembly languages for the Parrot virtual machine. The other is Parrot assembly language or PASM. Compared to PASM, PIR exists at a slightly higher abstraction layer, and provides temporary registers and named registers, simplifying code generation. While Parrot is still evolving, it is currently being used in many different capacities, and has undergone several releases.", "backlinksCount": 12, "pageId": 4850580, "created": 2006, "revisionCount": 20, "dailyPageViews": 10, "url": "https://en.wikipedia.org/wiki/Parrot_intermediate_representation" }, "githubLanguage": { "fileExtensions": [ "pir" ], "trendingProjectsCount": 0, "type": "programming", "group": "Parrot", "interpreters": [ "parrot" ], "aceMode": "text", "tmScope": "source.parrot.pir", "aliases": [ "pir" ], "repos": 0, "id": "Parrot Internal Representation" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 1, "commitCount": 10, "sampleCount": 1, "example": [ "#!/usr/bin/env parrot\n\n.sub 'main' :main\n say \"Hello!\"\n.end\n" ], "url": "https://github.com/textmate/parrot.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "parrot-vm": { "title": "Parrot", "appeared": 2002, "type": "vm", "country": [ "United States" ], "originCommunity": [ "https://www.perl.org" ], "wikipedia": { "example": [ ".sub 'main' :main\n $I1 = 4\n inc $I1 # $I1 is now 5\n $I1 += 2 # $I1 is now 7\n $N1 = 42.0\n dec $N1 # $N1 is now 41.0\n $N1 -= 2.0 # $N1 now 39.0\n print $I1\n print ', '\n print $N1\n print \"\\n\"\n .end" ], "related": [ "c", "parrot-assembly", "parrot-internal-representation", "perl", "perl-6", "python", "jvm", "llvmir", "java", "java-bytecode", "joy", "lua", "php", "ruby", "scheme", "tcl", "wmlscript", "arc", "apl", "common-lisp", "lisp", "ecmascript", "forth", "quickbasic", "smalltalk", "cil", "befunge", "brainfuck", "lolcode", "unlambda", "unicode" ], "summary": "Parrot is a register-based process virtual machine designed to run dynamic languages efficiently. It is possible to compile Parrot assembly language and PIR (an intermediate language) to Parrot bytecode and execute it. Parrot is free and open source software.Parrot was started by the Perl community and is developed with help from the open source and free software communities. As a result, it is focused on license compatibility with Perl (Artistic License 2.0), platform compatibility across a broad array of systems, processor architecture compatibility across most modern processors, speed of execution, small size (around 700k depending on platform), and the flexibility to handle the varying demands made by Perl 6 and other modern dynamic languages. Version 1.0, with a stable API for development, was released on March 17, 2009.The current version is release 8.1.0 \"Andean Parakeet\"", "backlinksCount": 174, "pageId": 60511, "created": 2002, "revisionCount": 538, "dailyPageViews": 66, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/Parrot_virtual_machine" }, "githubLanguage": { "fileExtensions": [ "parrot" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "id": "Parrot" }, "githubBigQuery": { "repos": 121, "users": 88, "id": "Parrot" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2016, "committerCount": 1, "commitCount": 10, "url": "https://github.com/textmate/parrot.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "parse-tree-notation": { "title": "Parse Tree Notation", "appeared": 1994, "type": "grammarLanguage", "description": "An important aspect of Parse Tree Notation (PTN) is that the data structure being manipulated is the parse tree for the program, not its token list. Pattern matching in PTN is on subtrees of the program's parse tree, using DCG rules to identify the subtrees of interest", "reference": [ "https://dtai.cs.kuleuven.be/projects/ALP/newsletter/archive_93_96/news/tools/grammars/ptn.html" ], "country": [ "Australia" ], "originCommunity": [ "University of Melbourne" ] }, "parser": { "title": "Parser 3", "appeared": 1997, "type": "pl", "creators": [ "Konstantin Morshnev" ], "website": "http://www.parser.ru/", "aka": [ "parser3" ], "country": [ "Russia" ], "originCommunity": [ "Art. Lebedev Studio" ], "domainName": { "awisRank": { "2022": 7803956 }, "name": "parser.ru" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "$console:line" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "xml", "pcre" ], "summary": "Parser is a free server-side CGI web scripting language developed by Art. Lebedev Studio and released under the GPL. Originally, Parser was merely a simple macro processing language. The latest 3rd revision (March 2006) introduced object-oriented programming features. The compiler for the language was developed in C++ by studio employees Konstantin Morshnev and Alexander Petrosyan to automate often repeated tasks, especially maintenance of already existing websites. It was used in many web projects of the studio. Since revision 3 it was released as free software and it is now used in other websites, mostly in Russia (according to a partial list at the language's website). The language supports technologies needed for common web design tasks: XML, Document Object Model (DOM), Perl Compatible Regular Expressions (PCRE) and others.", "pageId": 13923210, "dailyPageViews": 8, "created": 2007, "backlinksCount": 16, "revisionCount": 29, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Parser_(CGI_language)" }, "helloWorldCollection": [ "# Hello World in Parser\n\nHello world!" ], "leachim6": { "filepath": "p/Parser.p", "fileExtensions": [ "p" ], "example": [ "@main[]\n ^rem{Will print \"Hello World\" when run as CGI script}\n $hello[Hello World]\n $result[$hello]\n" ], "id": "Parser" }, "quineRelay": "Parser 3", "rijuRepl": { "example": [ "$console:line[Hello, world!]" ], "id": "https://riju.codes/parser3" }, "ubuntuPackage": "parser3-cgi", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "partiql": { "title": "partiql", "appeared": 2019, "type": "queryLanguage", "creators": [ "James Siri" ], "website": "https://partiql.org/", "reference": [ "https://aws.amazon.com/blogs/opensource/announcing-partiql-one-query-language-for-all-your-data/" ], "country": [ "United States" ], "originCommunity": [ "Amazon Web Services, Inc" ], "domainName": { "registered": 2019, "awisRank": { "2022": 1299218 }, "name": "partiql.org" }, "githubRepo": { "firstCommit": 2019, "stars": 517, "forks": 55, "subscribers": 23, "created": 2019, "updated": 2022, "description": "An implementation of PartiQL written in Kotlin.", "issues": 182, "url": "https://github.com/partiql/partiql-lang-kotlin" }, "repoStats": { "firstCommit": 2019, "commits": 1438, "committers": 36, "files": 851 } }, "pascal-abc.net": { "title": "PascalABC.NET", "appeared": 2002, "type": "pl", "creators": [ "S.S. Mikhalkovich", "Ivan Bondarev", "A.V. Tkachuk", "S.O. Ivanov" ], "website": "http://pascalabc.net/", "country": [ "Russia" ], "originCommunity": [ "http://pascalabc.net/en" ], "domainName": { "registered": 2006, "awisRank": { "2022": 481137 }, "name": "pascalabc.net" }, "wikipedia": { "summary": "PascalABC.NET is a Pascal programming language that implements classic Pascal, most Delphi language features, as well as a number of their own extensions. It is implemented on the .NET Framework platform and contains all the modern language features: classes, operator overloading, interfaces, exception handling, generic classes and routines, garbage collection, lambda expressions, parallel programming tools (OpenMP only as of 2016). PascalABC.NET is also a simple and powerful integrated development environment with integrated debugger, IntelliSense system, form designer, code templates and code auto-formatting. Command-line PascalABC.NET compiler is also available on Linux and MacOS (under Mono).PascalABC.NET is popular in Russian schools and universities. In Southern Federal University, it is used as the main language for teaching students of Information technology in the course \"Fundamentals of programming\" and for teaching children in one of the largest computer schools in Russia.", "backlinksCount": 115, "pageId": 50034768, "dailyPageViews": 24, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/PascalABC.NET" } }, "pascal-fc": { "title": "Pascal-FC", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dacf5dd50fd54c90e1bc5d9be14f20cfb90f6e63", "https://www.semanticscholar.org/paper/Pascal-FC%3A-a-language-for-teaching-concurrent-Burns-Davies/d99464c60bddb8a33c2f7b65ea22a5261e04867b" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Bradford" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1581", "centralPackageRepositoryCount": 0 }, "pascal-i": { "title": "PASCAL-I", "appeared": 1980, "type": "pl", "reference": [ "https://www.linkedin.com/bg/richard-cichelli-11783a24", "https://semanticscholar.org/paper/ba7f4908b17a0797505f05a8ce0f8f3acd8725f8" ], "country": [ "United States" ], "originCommunity": [ "Software Consulting Services, LLC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2862", "centralPackageRepositoryCount": 0 }, "pascal-mtp": { "title": "PASCAL/MT+", "appeared": 1988, "type": "pl", "country": [ "United States" ], "originCommunity": [ "MT MicroSYSTEMS" ], "wikipedia": { "related": [ "pascal" ], "summary": "Pascal/MT+ was an ISO 7185 compatible Pascal compiler written in 1980 by Michael Lehman, founder of MT MicroSYSTEMS of Solana Beach, California. The company was acquired by Digital Research in 1981 which subsequently distributed versions that ran on the 8080/Z80 processor under the CP/M operating system. Later versions ran on the 68000 CPU under CP/M-68K, and the 8086 CPU under CP/M-86 and MS-DOS. Pascal/MT+, for the 8086, was available for CP/M-86, PC DOS/MS-DOS as well as RMX-86 (a proprietary OS from Intel). Pascal/MT+86 still runs today on even the latest version of Microsoft Windows and DR-DOS.", "backlinksCount": 43, "pageId": 3226664, "dailyPageViews": 12, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Pascal/MT+" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3387", "centralPackageRepositoryCount": 0 }, "pascal-plus": { "title": "Pascal Plus", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/481812ae08cfd5ea9ac2e83cf64532c84cd34686" ], "country": [ "N. Ireland" ], "originCommunity": [ "Queen's University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=861", "centralPackageRepositoryCount": 0 }, "pascal-s": { "title": "Pascal-S", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fbf2246618ddca5d06723f8cbf9e9535fd810af4" ], "country": [ "Switzerland" ], "originCommunity": [ "Eidgenössische Technische Hochschule Zürich" ], "hopl": "https://hopl.info/showlanguage.prx?exp=686", "centralPackageRepositoryCount": 0, "isbndb": "" }, "pascal-sc": { "title": "Pascal-SC", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/303abc789e8c7dc2757878f7bee9860ae8a83da4" ], "country": [ "Germany" ], "originCommunity": [ "Universitat Karlsruhe" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1349", "centralPackageRepositoryCount": 0 }, "pascal-script": { "title": "Pascal Script", "appeared": 2000, "type": "pl", "description": "Pascal Script is a free scripting engine that allows you to use most of the Object Pascal language within your Delphi or Free Pascal projects at runtime. Written completely in Delphi, it is composed of a set of units that can be compiled into your executable, eliminating the need to distribute any external files. Pascal Script started out as a need for a good working script, when there were none available at the time.", "website": "https://www.remobjects.com/ps.aspx", "country": [ "United States" ], "originCommunity": [ "RemObjects Software" ], "wikipedia": { "summary": "Pascal Script is a scripting language based on the programming language Pascal that facilitates automated runtime control over scriptable applications and server software. It is implemented by a free scripting engine that includes a compiler and an interpreter for byte code. Pascal Script supports the majority of Object Pascal constructs, making it partly compatible to Delphi, Free Pascal and GNU Pascal. Initially developed by Carlo Kok as CajScript and renamed to Innerfuse Pascal Script with version 2.23, the software was taken over by RemObjects, renamed again to RemObjects Pascal Script and offered as open source software for the Delphi IDE. Beginning with version 2.07 CajScript has been ported to Free Pascal. Since 2017 Pascal Script is included as a standard component in the Lazarus IDE.", "backlinksCount": 50, "pageId": 31788384, "dailyPageViews": 18, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Pascal_Script" }, "twitter": "https://twitter.com/remobjects" }, "pascal-xsc": { "title": "Pascal-XSC", "appeared": 1991, "type": "pl", "reference": [ "https://www2.math.uni-wuppertal.de/wrswt/literatur/rep9801.pdf", "https://semanticscholar.org/paper/dc823b9dc049d8732bac5c15365b72c3ebe5c825" ], "country": [ "Germany" ], "originCommunity": [ "Universitat Karlsruhe" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6744", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pascal": { "title": "Pascal", "appeared": 1970, "type": "pl", "demoVideo": [ "https://www.youtube.com/watch?v=Hw4GEwhCZpc" ], "creators": [ "Niklaus Wirth" ], "documentation": [ "https://www.freepascal.org/docs.html" ], "emailList": [ "https://www.freepascal.org/maillist.html" ], "fileExtensions": [ "pp", "pas", "inc" ], "country": [ "Switzerland" ], "originCommunity": [ "ETH Zürich" ], "releaseNotesUrl": "https://www.freepascal.org/news.html", "hasPolymorphism": { "example": "", "value": true }, "hasComments": { "example": "{ This is a single line comment in pascal. But needs to be closed. }", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasMultiLineComments": { "example": "(* A comment\n*)", "value": true }, "hasFunctionOverloading": { "example": "program Adhoc;\n\nfunction Add(x, y : Integer) : Integer;\nbegin\n Add := x + y\nend;\n\nfunction Add(s, t : String) : String;\nbegin\n Add := Concat(s, t)\nend;\n\nbegin\n Writeln(Add(1, 2)); (* Prints \"3\" *)\n Writeln(Add('Hello, ', 'World!')); (* Prints \"Hello, World!\" *)\nend.", "value": true }, "hasOperatorOverloading": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "s := (A + a + A);", "value": true }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "isCaseSensitive": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "{", "}" ] ], "printToken": [ [ "writeln" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "*", "+", "-", "/", ":=", "<", "<=", "<>", "=", ">", ">=", "and", "begin", "boolean", "break", "byte", "continue", "div", "do", "double", "else", "end", "false", "if", "integer", "longint", "mod", "not", "or", "repeat", "shl", "shortint", "shr", "single", "then", "true", "until", "while", "word", "xor" ], "wikipedia": { "example": [ "program Printing;\n\nvar i : integer;\n\nprocedure Print(j : integer);\nbegin\n ...\nend;\n\nbegin { main program }\n ...\n Print(i);\nend." ], "related": [ "delphi", "free-pascal", "turbo-pascal", "ucsd-pascal", "algol-w", "ada", "go", "java", "modula", "modula-2", "modula-3", "oberon", "object-pascal", "oxygene", "seed7", "algol-60", "euler", "lisp", "algol-68", "assembly-language", "tex", "simula", "fortran", "watcom", "c", "x86-isa", "ip-pascal", "csharp", "algol", "pl-i", "ios", "android", "unicode", "linux", "freebsd" ], "summary": "Pascal is an imperative and procedural programming language, which Niklaus Wirth designed in 1968–69 and published in 1970, as a small, efficient language intended to encourage good programming practices using structured programming and data structuring. It is named in honor of the French mathematician, philosopher and physicist Blaise Pascal. Pascal was developed on the pattern of the ALGOL 60 language. Wirth had already developed several improvements to this language as part of the ALGOL X proposals, but these were not accepted and Pascal was developed separately and released in 1970. A derivative known as Object Pascal designed for object-oriented programming was developed in 1985; this was used by Apple Computer and Borland in the late 1980s and later developed into Delphi on the Microsoft Windows platform. Extensions to the Pascal concepts led to the Pascal-like languages Modula-2 and Oberon.", "pageId": 23773, "dailyPageViews": 1116, "created": 2001, "backlinksCount": 2517, "revisionCount": 2212, "appeared": 1970, "fileExtensions": [ "pp", "pas", "inc" ], "url": "https://en.wikipedia.org/wiki/Pascal_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "pas", "dfm", "dpr", "inc", "lpr", "pascal", "pp" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ncheat-engine cheat-engine https://github.com/cheat-engine.png https://github.com/cheat-engine/cheat-engine Pascal #E3F171 3166 650 185 \"Cheat Engine. A development environment focused on modding\"\nstascorp rdpwrap https://github.com/stascorp.png https://github.com/stascorp/rdpwrap Pascal #E3F171 5646 1029 162 \"RDP Wrapper Library\"", "trendingProjectsCount": 3, "type": "programming", "interpreters": [ "instantfpc" ], "aceMode": "pascal", "codemirrorMode": "pascal", "codemirrorMimeType": "text/x-pascal", "tmScope": "source.pascal", "aliases": [ "delphi", "objectpascal" ], "repos": 49346, "id": "Pascal" }, "githubBigQuery": { "repos": 10149, "users": 8263, "id": "Pascal" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/pascal", "monaco": "pascal", "codeMirror": "pascal", "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2016, "committerCount": 4, "commitCount": 37, "sampleCount": 10, "example": [ "uses\n uw27294;\n\nvar\n p : procedure;\n\nprocedure test;\n\nbegin\n p:=@test;\n writeln('OK');\nend;\n\nprocedure global;\nbegin\n p:=nil;\n test;\n p();\nend;\n\nbegin\n global;\n uw27294.global;\nend.\n\n\n" ], "url": "https://github.com/textmate/pascal.tmbundle" }, "projectEuler": { "memberCount": { "2019": 708, "2022": 710 }, "id": "Pascal" }, "helloWorldCollection": [ "{Hello World in Pascal}\n\nprogram HelloWorld(output);\nbegin\n WriteLn('Hello World!');\nend.\n" ], "leachim6": { "filepath": "p/Pascal.p", "fileExtensions": [ "p" ], "example": [ "program HelloWorld(output);\nbegin\n writeln('Hello World');\nend.\n" ], "id": "Pascal" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Pascal", "quineRelay": "Pascal", "compilerExplorer": { "example": [ "unit output;\n\ninterface\n\nfunction Square(const num: Integer): Integer;\n\nimplementation\n\n// Type your code here, or load an example.\n\nfunction Square(const num: Integer): Integer;\nbegin\n Square := num * num;\nend;\n\nend.\n" ], "id": "Pascal" }, "rijuRepl": { "example": [ "program Main;\nbegin\n writeln('Hello, world!');\nend." ], "id": "https://riju.codes/pascal" }, "indeedJobs": { "2022": 102, "query": "pascal developer" }, "faqPageUrl": [ "https://www.freepascal.org/faq.html" ], "downloadPageUrl": [ "https://www.freepascal.org/download.html" ], "subreddit": [ { "memberCount": { "2022": 1858 }, "url": "https://www.reddit.com/r/Pascal" } ], "tiobe": { "id": "Pascal" }, "hopl": "https://hopl.info/showlanguage.prx?exp=520", "ubuntuPackage": "fp-compiler", "gdbSupport": true, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1993|Richard d Irwin|Structures and Abstractions: An Introduction to Computer Science With Pascal|Salmon, William I.|9780256126662\n1985|D C Heath & Co|Pascal Plus Data Structures, Algorithms, and Advanced Programming|Dale, Nell B. and Lilly, Susan C.|9780669072396\n1981|Addison-Wesley Professional|Software Tools in Pascal|Kernighan, Brian W.|9780201103427\n1995|Butterworth-Heinemann|Pascal for Students (including Turbo Pascal)|Kemp, Ray and Hahn, Brian|9780340645888\n1990|Merrill Pub Co|Introduction To Structured Programming Using Turbo Pascal Version 5.0 On The Ibm Pc|Kenneth J. Morgan|9780675207706\n1972|Princeton University Press|The Computer from Pascal to von Neumann|Goldstine, Herman H.|9780691081045\n1987|Lewis Osborne Book Pub|Advanced Turbo Pascal: Now Includes Borland's Turbo Pascal Database Toolbox and Turbo Pascal Graphix Toolbox (Programming Series)|Schildt, Herbert|9780078812835\n1992|Wiley|Pascal and Beyond...: Data Abstraction and Data Structures Using Turbo Pascal|Fisher, Steve and Reges, Stuart|9780471502616\n1992|Addison-Wesley|Programming in Oberon: Steps Beyond Pascal and Modula|Reiser, Martin and Wirth, Niklaus|9780201565430\n1990|University of Chicago Press|Pascal Programming for Music Research|Brinkman, Alexander R.|9780226075075\n1984|Addison-Wesley|Programming in Pascal|Grogono, Peter|9780201120707\n1978|John Wiley & Sons|An Introduction to Programming and Problem Solving with Pascal|Schneider, G. Michael|9780471025429\n|London : Prentice-hall International, C1989.|Programming With Data Structures, Pascal Version||9780137304585\n1997|Jones & Bartlett Learning|Turbo Pascal (Computer Science Series))|Dale, Nell|9780763706081\n1993|Sybex Inc|Programming in Borland Pascal|Palmer, Scott D.|9780782111514\n1985|New York : Barnes & Noble, c1985.|Programming in PASCAL|Zwass and Vladimir|9780064602013\n1985|Reston Pub Co|Pascal Programming For The Ibm Pc And Xt|William M. Fuori|9780835954365\n1981|Reston Pub. Co|Pascal Programming For The Apple|T. G Lewis|9780835954556\n1988|Harcourt Brace Jovanovich|Computer Programming In The Pascal Language|Neal Golden|9780153591105\n1991|Addison Wesley School|Object-oriented Programming With Turbo Pascal|Keith Weiskamp and Bryan Flamig and Loren Heiny|9780673463340\n2006|Dover Publications|Discrete Optimization Algorithms: with Pascal Programs (Dover Books on Computer Science)|Syslo, Maciej M. and Deo, Narsingh and Kowalik, Janusz S.|9780486453538\n2000|Thomson Learning|Pascal Programming|Holmes|9780826454294\n1989|Prentice Hall|Programming With Data Structures: Pascal Version/Book and Disk|Kruse, Robert L.|9780137292387\n1993|MIS Press,U.S.|Borland Pascal with Objects 7.0|Jose DeJesus|9781558282476\n1986|Lawrenceville Pr|A Guide To Programming In Turbo Pascal|Bruce Presley and Tim Corica|9780931717413\n1985|Addison-Wesley Pub. Co|Problem solving and structured programming in Pascal|Koffman, Elliot B|9780201117363\n1980|Tab Books|Pascal|Heiserman, David L.|9780830699346\n1984|Cambridge University Press|Recursion via Pascal (Cambridge Computer Science Texts, Series Number 19)|Rohl|9780521269346\n1992|M & T Books|Fractal Programming In Turbo Pascal|Roger T. Stevens|9781558511071\n1990|Thomson Learning|Pascal Programming (complete Course Texts)|B.j. Holmes|9781870941655\n1983|Palgrave|Mastering Pascal Programming (Macmillan Master)|Huggins, Eric|9780333322949\n1997|Wiley|Mastering C++: An Introduction To C++ And Object-oriented Programming For C And Pascal Programmers Second Edition And Engineering Fluid Mechanics, Sixth Edition|Horstmann and Cay S. Horstmann and John A. Roberson and Clayton T. Crowe|9780471293743\n1984|Barrons Educational Series Inc|Computer Programming in Pascal the Easy Way|Downing, Douglas and Yoshimi, Mark|9780812027990\n1986|Addison-Wesley|Introduction to Computer Science With Applications in Pascal|Garland, Stephen|9780201043983\n1980|Reston Pub. Co|Pascal programming structures: An introduction to systematic programming|Cherry, George William|9780835954631\n1982|Addison-wesley|Programming Primer: A Graphic Introduction To Computer Programming With Basic And Pascal|Robert P Taylor|9780201074000\n|West Group|Understanding Pascal|Steven Mandell|9780314872548\n2000|Wordware Publishing, Inc.|Learn Pascal|Abolrous, Sam|9781556227066\n1995|Birkhäuser|Scientific Pascal|Flanders, Harley|9780817637606\n1983|Sra|Programming In Pascal|C. William Gear|9780023412059\n1989|West Group|Programming Process With Pascal|Judith L. Gersting|9780314445322\n1983|Sybex|Doing business with Pascal|Hergert, Richard|9780895880918\n1999|Pearson Us Imports & Phipes|Structured Programming Turbo Pascal|Horn|9780130225443\n1994|Oxford University Press|Abstractions & Programming in Turbo Pascal Flexlabs|Shaffer and Dale and Platt and David C.|9780030972409\n1988|Camelot Publishing Company|Challenging Mathematical Problems with Pascal Solutions|Donald D. Spencer|9780892180967\n1980|Wiley|PASCAL Programming (Wiley Series in Computing)|Atkinson, Laurence|9780471277743\n1987|Addison-wesley|Pascal On The Macintosh: A Graphical Approach|David A. Niguidula|9780201165883\n1988|Henry Holt & Company|Solution Key For Pascal Computer Programming 88|Golden|9780153591129\n1991|Abacus Software Inc|Turbo Pascal System Programming/book And Disk|Michael Tischer|9781557551245\n1984|Blue Ridge Summit, Pa. : Tab Books, c1984.|Programming your own adventure games in Pascal|Richard C. Vile and Jr|9780830617685\n1989|Addison-Wesley|Programming the IBM User Interface: Using Turbo Pascal|Ezzell, Ben|9780201150094\n1995|I/o Press|The Windows Pascal Laboratory: Experiments In Windows Programming (programmers Library)|Don Asumu Pdd|9781871962321\n1991|Wiley-vch|Turbo Pascal For Chemists: A Problem Solving And Practical Approach|Gordon-filby-m-klusmann|9783527278305\n1986|Tab Books Software|Turbo Pascal Programming With Applications: Ibm Pc/book And 256k Disk|Leon A. Wortman|9780830652051\n1985|1985|Programming With Turbo Pascal (mcgraw-hill's Best--basic Engineering Series And Tools)|Carroll, David W. (david William)|9780078529085\n2020-02-24T00:00:01Z|Dark Neon|The Little Book Of Delphi Programming: Learn To Program with Object Pascal|Collingbourne, Huw|9781913132095\n2001|Jones & Bartlett Learning|Learn Pascal in Three Days|Abolrous, Sam|9781556228056\n1982|Wiley|Introduction to Programming and Problem Solving with PASCAL|Schneider, G. Michael and Weingart, Steven W. and Pearlman, David M.|9780471082163\n2021|Independently published|Object Pascal Handbook Delphi 10.4 Sydney Edition: The Complete Guide to the Object Pascal programming language for Delphi 10.4 Sydney|Cantu, Marco|9798554519963\n2015|CreateSpace Independent Publishing Platform|Getting Started with Lazarus and Free Pascal: A beginners and intermediate guide to Free Pascal using Lazarus IDE|Abiola-Ellison, Menkaura|9781507632529\n1995|Butterworth-Heinemann|Pascal for Students (including Turbo Pascal)|Kemp, Ray and Hahn, Brian|9780080928708\n1989|Cambridge University Press|Numerical Recipes in Pascal (First Edition): The Art of Scientific Computing|Press, William H. and Flannery, Brian P. and Teukolsky, Saul A. and Vetterling, William T.|9780521375160\n2020|Oberkochener Medienverlag|Professional Programming From the Beginning: With Free Pascal And the Free Development Environment Lazarus|Koch, Wilfried|9783945899311\n1988-01-11T00:00:01Z|Pearson International|Intro Programming W/Macintosh Pascal|PRITCHARD|9780201175394\n1993|Pearson|Pascal Programming and Problem Solving (4th Edition)|Leestma, Sanford and Nyhoff, Larry|9780023887314\n1994-01-01T00:00:01Z|McGraw-Hill|Schaum's Outline of Programming with Pascal|Gottfried, Byron S.|9780070239241\n1993|Benjamin-Cummings Pub Co|Turbo Pascal 7.0 (4th Edition)|Savitch, Walter J.|9780805304183\n1980|Addison-Wesley|Programming in PASCAL|Grogono, Peter|9780201027754\n1987|Wiley|Advanced Programming and Problem Solving with PASCAL|Schneider, Michael and Bruell, Steven|9780471837442\n2000|Wordware Publishing, Inc.|Learn Object Pascal with Delphi|Rachele, Warren|9781556227196\n1994|Addison-Wesley|Turbo Pascal|Koffman, Elliot B.|9780201512397\n1991|Addison-Wesley|Macintosh Pascal Programming Primer: Inside the Toolbox Using Think Pascal|Mark, Dave and Reed, Cartwright|9780201570847\n2020|Apress|Delphi Quick Syntax Reference: A Pocket Guide to the Delphi and Object Pascal Language|Kouraklis, John|9781484261118\n1987|Cambridge University Press|Illustrating Pascal|Alcock, Donald G.|9780521336956\n1995|Benjamin-Cummings Pub Co|C++ for Pascal Programmers (2nd Edition)|Pohl, Ira|9780805331585\n1994|Cengage Learning|Using Turbo Pascal 6.0 - 7.0|Hennefeld, Julien|9780534943981\n1981|John Wiley & Sons|Advanced Programming and Problem Solving with Pascal|Schneider, G. Michael|9780471078760\n1981|Prentice-Hall Canada, Incorporated|Data Structures Using Pascal|Augenstein, Moshe J.; Tenenbaum, Aaron M.|9780131965010\n1996|Springer|Migrating from Pascal to C++ (Undergraduate Texts in Computer Science)|Merritt, Susan N. and Stix, Allen|9780387947303\n1984T|Tab Books|Programming your own adventure games in Pascal|Vile, Richard C|9780830607686\n1984|Springer|Pascal User Manual and Report: Revised for the ISO Pascal Standard|Jensen, Kathleen and Wirth, Niklaus|9780387960487\n1985|Mcgraw-Hill|Schaum's Outline of Theory and Problems of Programming With Pascal (Schaum's Outline Series in Computers)|Gottfried, Byron S.|9780070238497\n1997|Addison Wesley|Turbo Pascal Update|Koffman, Elliot B.|9780201350869\n1979|Hayden Book Co|PASCAL with style: Programming proverbs (Hayden computer programming series)|Ledgard, Henry F|9780810451247\n1991|Macmillan Coll Div|Data Structures and Program Design in Pascal|Nyhoff, Larry R. and Leestma, Sanford|9780023694653\n1981|Addison-Wesley Pub. Co|Problem solving and structured programming in PASCAL (Addison-Wesley series in computer science and information processing)|Koffman, Elliot B|9780201038934\n1990|Addison-Wesley|Pascal Precisely for Engineers and Scientists|Bishop, Judy and Bishop, Nigel|9780201416923\n1983|Computer Science Press|Pascal an Introduction to Methodical Programming Edition|Findlay, William|9780914894735\n1985-07-01T00:00:01Z|Hodder Arnold|Statistical Computing in Pascal|Cooke, D. and Craven, A. H. and Clarke, G. M.|9780713135459\n1983|Houghton Mifflin College Div|Introduction to Pascal and Structured Design|Dale, Nell B.|9780669069624\n1987|McGraw-Hill College|Programming With Pascal|Konvalina, John and Wileman, Stanley|9780070352247\n1992|W. W. Norton & Company|Oh! PASCAL!: Turbo PASCAL 6.0|Cooper, Doug|9780393962499\n1983-06-30T00:00:01Z|Springer|Introduction to Numerical Computation in Pascal|DEW/JAMES|9780387912165\n1984|Franklin Watts|Pascal for Beginners (Computer Literacy Skills Book)|Lampton, Christopher|9780531047484\n1989-04-01T00:00:01Z|Computing McGraw-Hill|Using Turbo Pascal Version 5 (Programming Series)|Wood, Steve|9780078814969\n1992|Hodder & Stoughton Educational Division|Teach Yourself Computer Programming in Pascal (Teach Yourself)|Lightfoot, D.|9780340337288\n1985|Wadsworth Pub. Co|From Pascal to C: An introduction to the C programming language|Brown, Douglas L|9780534046026\n1990|M & T Books|Fractal Programming in Turbo Pascal|Stevens, Roger T.|9781558511064\n1995|Wiley|Mastering C++: An Introduction to C++ and Object-Oriented Programming for C and Pascal Programmers|Horstmann, Cay S.|9780471104278\n1982|William C Brown Pub|A First Course in Programming With Pascal|Mendelson, Bert|9780205078233\n1997|West Publishing Company, College & School Div|Turbo Pascal Programming High School EDI|Mandell, Steven L.|9780314346292\n1987|Wadsworth Pub Co|Algorithms, Programming, Pascal|Li Santi, Barbara|9780534066789\n1987-06T|Letts Educational|PASCAL Programming|Holmes, B.J.|9780905435817\n1984T|Osborne/McGraw-Hill|Advanced Pascal programming techniques|Sand, Paul A|9780881341058\n1991|Dellen Pub Co|Programming in Pascal|Riddle, Douglas F.|9780023998157\n1994|Addison-Wesley|Software Design and Data Structures in Turbo Pascal|Elliot B. Koffman and Bruce R. Maxim|9780201156249\n1986-01-01T00:00:01Z|Addison-Wesley|Advanced Programming: Design and Structure Using Pascal|Miller, Lawrence H.|9780201055313\n1988|Praeger|Pascal Programming for Libraries: Illustrative Examples for Information Specialists (Contributions in Librarianship and Information Science)|Davis, Charles H. and Lundeen, Gerald and Shaw, Debora|9780313252594\n1984|Computer Science Press|Paradigms and programming with PASCAL|Wood, Derick|9780914894452\n1980|John Wiley & Sons|PASCAL Programming (Computing Series)|Atkinson, Laurence|9780471277736\n1984|West Group|Fundamental Programming With Pascal|Starkey, J. Denbigh and Ross, Rockford J.|9780314778062\n1985|Addison Wesley Publishing Company|Problem Solving & Structured Programming in Pascal|Koffman, Elliot B.|9780201117370\n1983T|Distributed in cooperation with Wiley-Interscience|IEEE Standard Pascal Computer Programming Language|American National Standards Institute and Institute of Electrical and Electronics Engineers|9780471889441\n1986|Cambridge University Press|Pascal Programming: A Beginner's Guide to Computers and Programming|Hawksley, Chris|9780521337144\n1991T|D.C. Heath and Co|Pascal Plus data structures, algorithms, and advanced programming|Dale, Nell B|9780669248302\n||PASCAL Programming Fundamentals||9788177641936\n1996|Richard d Irwin|Structures and Abstractions: An Introduction to Computer Science With Turbo Pascal (5.X, 6.X, 7.0)|Salmon, William I.|9780256126679\n1994|McGraw-Hill Education - Europe|Programming with Pascal|Sos Gottfried|9780071133371\n1990|PWS Publishing|Turbo Pascal With Turtle Graphics|Slack, James M.|9780314667823\n1995|Pearson College Div|Programming with MacIntosh and THINK Pascal|Rink, Richard A. and Wisenbaker, Vance B. and Vance, Richard G.|9780130938732\n1982T|Pearson Higher Education|Pocket Guide to Pascal (Pitman Programming Pocket Guides)|Watt, David A|9780273016496\n1989|Prentice Hall|Programming with Macintosh Pascal|Rink, Richard A|9780137305407\n1992|William C Brown Pub|Data Structures, Using Pascal|Rhoads, Samuel E. and Gearen, Michael V.|9780697111739\n1982|Springer|Pascal at Work and Play: An Introduction to Computer Programming in Pascal|Forsyth, Richard|9780412233807\n1993|Gardners Books|An Introduction to Pascal|Morton, James K.|9780907679479\n1990|Cambridge University Press|Programming via Pascal (Cambridge Computer Science Texts, Series Number 12)|Rohl, J. S. and Barrett, H. J.|9780521356619\n1984-09-01T00:00:01Z|Addison-Wesley|Handbook of Algorithms and Data Structures: Coded in Pascal and C (International Computer Science Series)|Gonnet, Gaston H.|9780201142181\n1992|CRC Press|The Structures and Abstractions Labs: Experiments in Pascal and Turbo Pascal/Includes Disk|Salmon|9780256103526\n1994|West Group|Introduction to Computer Programming Using Turbo Pascal|Johnson, Richard and Keil, David M.|9780314042064\n1991|Wiley|Mastering C++: An Introduction to C++ and Object-Oriented Programming for C and Pascal Programmers|Horstmann, Cay S.|9780471522577\n1984|John Wiley and Sons Ltd|Introduction to Programming and Problem Solving with PASCAL|Schneider, G. Michael|9780471875895\n1985|McGraw-Hill|Programming with Turbo Pascal (A Byte book)|David W Carroll|9780078529092\n1982|McGraw-Hill Osborne Media|A First Course in Computer Programming Using Pascal (MCGRAW HILL COMPUTER SCIENCE SERIES)|Keller, Arthur M.|9780070335080\n1989-10-01T00:00:01Z|McGraw-Hill Osborne Media|Turbo Pascal Disktutor/Book and 2 Disk (Borland-Osborne/McGraw-Hill Programming Series)|Feibel, Werner|9780078815751\n1980|Ellis Horwood, Ltd.|Foundations of Programming with Pascal (New Patterns of Learning)|Moore, Lawrie|9780470269398\n1978|Addison Wesley Publishing Company|Programming in Pascal (Addison-Wesley Series in Clinical and Professional Psycholog)|Grogono, Peter|9780201024739\n1991|D C Heath & Co|Pascal Plus Data Structures, Algorithms and Advanced Programming/Book and 3 1/2' Disk|Dale and LILLY|9780669269604\n1989T|Benjamin/Cummings Pub|Turbo Pascal 4.0/5.0: An introduction to the art and science of programming (The Benjamin/Cummings series in structured programming)|Savitch, Walter J|9780805304107\n1987-06-01T00:00:01Z|West Group|Pascal Programming Today|Mandell, Steven L.|9780314339355\n1981|Univ Coll Londo|Simple Pascal Pb|Mcgregor J|9780273017042\n1987T|McGraw Hill|Programming with Pascal|Konvalina, John; Wileman, Stanley|9780071005364\n1993-05-02T00:00:01Z|Gale|Pascal Programming Problem Sol|Turk|9780024217912\n2003|清华大学出版社|PASCAL Programming (Second Edition)|郑启华|9787302020042\n1982|Van Nostrand Reinhold Co|Programming microcomputers with PASCAL|Beer, M. D|9780442213688\n1982|Van Nostrand,, New York:|Programming Microcomputers with PASCAL|Beer, Martin|9780246116192", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1975|The programming language Concurrent Pascal|10.1007/3-540-07994-7_50|532|15|P. B. Hansen|93442ec9b4403619bb1658bdee2c08026bf442ba\n1979|The programming language PASCAL|10.1016/0141-9331(79)90216-3|327|39|J. Wakerly|ba75552c3468389d01220c149f24064bb10338e7\n1972|An axiomatic definition of the programming language PASCAL|10.1007/BF00289504|263|14|C. Hoare and N. Wirth|19e6eccb0fae5321045d4491f3800c814945d629\n1975|The programming language Concurrent Pascal|10.1007/978-3-662-09507-2_17|153|6|P. Brinch-hansen|f93f7a8f3dccdde22d7e3947b93ea922c4e0e568\n1971|The programming language pascal|10.1007/BF00264291|57|1|N. Wirth|d6ec6efe5a31898c8c8619b06a8982cec92fdf38\n1973|The programming language Pascal (Revised Report)|10.3929/ETHZ-A-000814158|55|3|N. Wirth|f64eed893989cdde76f61dc8a86174cb4f89a318\n1975|An assessment of the programming language pascal|10.1145/800027.808421|46|1|N. Wirth|3b37c309943c908759e32c06af6274c7529ecb15\n1986|Does programming language affect the type of conceptual bugs in beginners' programs? A comparison of FPL and Pascal|10.1145/22627.22368|36|1|N. Cunniff and R. Taylor and J. B. Black|005103a0ada5d2c98e59ab4ba5c89b8c75e15258\n2000|Assessing the utility of an interactive electronic book for learning the Pascal programming language|10.1109/13.883350|36|0|I. Aedo and P. Díaz and Camino Fernández and Guadalupe Muñoz and A. Berlanga|620fdc00e3920c0a71332a5d156024fbf4422cfb\n1974|Structured programming, programming teaching and the language Pascal|10.1145/953224.953226|19|1|O. Lecarme|ae82d9933cd4cb9af02187792883e00cc0ecefa1\n2002|The Programming Language Pascal (Reprint)|10.1007/978-3-642-59412-0_9|13|0|N. Wirth|bb490427ea1355bbdba234d4f7b93e1fdf0c679b\n1973|Critical comments on the programming language Pascal|10.1007/BF00288652|13|0|A. Habermann|932a44b1054838f0bbec3ddf1600a45f65844210\n1974|Reply to a paper by A. N. Habermann on the programming language Pascal|10.1145/953343.953345|12|0|O. Lecarme and Pierre Desjardins|29789bf619f319b34a2ae33bf312d4b5cbfd4190\n1979|A heap‐based implementation of the programming language Pascal|10.1002/spe.4380090205|7|0|C. Marlin|2c3444137ac303d39e97e31326b7eba4b346ba4d\n2019|PasOnto: Ontology for Learning Pascal Programming Language|10.1109/EDUCON.2019.8725092|6|0|Baboucar Diatta and Adrien Basse and S. Ouya|3d2ceb5b95bf3e844413b562758d65d583d9b9c7\n1975|More comments on the programming language Pascal|10.1007/BF00288728|5|0|O. Lecarme and Pierre Desjardins|47c3921931d60684bdb5d75b1ff27d6ab55d4736\n1974|Structured programming, programming teaching and the language Pascal|10.1145/382196.382997|4|0|O. Lecarme|a368ad1295eca04ce8138f3335130df90a5357dd\n2020|Fast and robust approach for data security in communication channel using pascal matrix|10.11591/IJEECS.V19.I1.PP248-256|4|0|Oday Kamil Hamid and Riyadh Bassil Abduljabbar and N. Alhyani|8906e39d1597cee47097d77930d6631933705475\n1990|POLROB—a manipulator-level programming language based on Pascal|10.1016/0745-7138(91)90012-G|2|0|K. Kozlowski|3d2dde6cb2987b66ceb9f9e632211056f8748d12\n2018|USING THE FREE PASCAL PROGRAMMING LANGUAGE AND THE RUBIROBOTLIB SOFTWARE LIBRARY TO CONTROL ROBOTS ON THE LEGO MINDSTORMS EV3 PLATFORM|10.32517/2221-1993-2018-17-7-8-12|2|0|D. A. Slinkin|8789b2adfc57dd99097e2ce58ac233a36d696f24\n1972|Implementation of the Programming Language Pascal|10.1007/978-3-642-80718-3_1|1|0|R. Schild|c141b8a6ffe6c15fecb71433748031d59ba730f7" }, "pascals-calculator-machine": { "title": "Pascal's calculator", "appeared": 1642, "type": "computingMachine", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Pascal%27s_calculator" } }, "pasion": { "title": "PASION", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fbed8ca88776b2203c84c4bd327c78736f6e1f91" ], "country": [ "Mexico" ], "originCommunity": [ "Universidad Panamericana" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4723", "centralPackageRepositoryCount": 0 }, "pasro": { "title": "PASRO", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/523e2e9839e6e0893ec51f86b0d38fd89236dd1f" ], "country": [ "Germany" ], "originCommunity": [ "Karlsruhe Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1176", "centralPackageRepositoryCount": 0 }, "passambler": { "title": "passambler", "appeared": 2015, "type": "pl", "country": [ "Belgium" ], "originCommunity": [ "https://github.com/gitter-badger/Passambler/pulls" ], "githubRepo": { "stars": 0, "forks": 1, "subscribers": 1, "created": 2015, "updated": 2015, "description": "The Passambler programming language", "issues": 0, "url": "https://github.com/gitter-badger/Passambler" }, "repoStats": { "firstCommit": 2015, "commits": 749, "committers": 3, "files": 193 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9676182|Show HN: Passambler: A toy language I made in Java over the course of 4 months|2015-06-07 20:03:25 UTC|1433707405|raoulvdberge|0|5" }, "passerine": { "title": "Passerine", "appeared": 2021, "type": "pl", "creators": [ "Isaac Cayton (slightknack)" ], "website": "https://www.passerine.io/", "country": [ "United States" ], "originCommunity": [ "https://github.com/vrtbl" ], "githubRepo": { "firstCommit": 2020, "stars": 980, "forks": 33, "subscribers": 22, "created": 2020, "updated": 2022, "description": "A small extensible programming language designed for concise expression with little code.", "issues": 20, "url": "https://github.com/vrtbl/passerine" }, "repoStats": { "firstCommit": 2020, "commits": 535, "committers": 16, "files": 127 } }, "pasukon": { "title": "pasukon", "appeared": 2020, "type": "grammarLanguage", "creators": [ "Federico Ramirez" ], "website": "https://pasukon.rocks", "webRepl": [ "https://pasukon.rocks/#try-it" ], "reference": [ "https://news.ycombinator.com/item?id=24347956" ], "country": [ "Argentina" ], "originCommunity": [ "https://github.com/gosukiwi/Pasukon/issues" ], "domainName": { "name": "pasukon.rocks" }, "example": [ "lex\n match NUMBER /[0-9]+(?:\\.[0-9]+)?/\n match PLUS '+'\n match MINUS '-'\n match TIMES '*'\n match DIV '/'\n match POPEN '('\n match PCLOSE ')'\n ignore WHITESPACE /^\\s+/\n/lex\n\naddition\n | (subtraction as :lhs) then :PLUS then (subtraction as :rhs)\n |> 'return $.lhs + $.rhs'\n | subtraction\n ;\n\nsubtraction\n | (multiplication as :lhs) then :MINUS then (multiplication as :rhs)\n |> 'return $.lhs - $.rhs'\n | multiplication\n ;\n\nmultiplication\n | (division as :lhs) then :TIMES then (division as :rhs)\n |> 'return $.lhs * $.rhs'\n | division\n ;\n\ndivision\n | (expression as :lhs) then :DIV then (expression as :rhs)\n |> 'return $.lhs / $.rhs'\n | expression\n ;\n\nexpression\n | :POPEN then (addition as :expr) then :PCLOSE\n |> 'return $.expr'\n | number\n ;\n\nnumber\n | :NUMBER 'return +$1'\n ;\n\nstart\n | addition\n ;" ], "githubRepo": { "firstCommit": 2020, "stars": 109, "forks": 2, "subscribers": 4, "created": 2020, "updated": 2022, "description": "JavaScript practical parser generator library using combinators", "issues": 6, "url": "https://github.com/gosukiwi/Pasukon" }, "repoStats": { "firstCommit": 2020, "commits": 83, "committers": 1, "files": 53 } }, "patch": { "title": "patch", "appeared": 1985, "type": "unixApplication", "creators": [ "Larry Wall" ], "originCommunity": [ "mod.sources" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Patch_(Unix)" } }, "patchwork": { "title": "Patchwork", "appeared": 1996, "type": "pl", "creators": [ "Ronen Barzel", "David Salesin" ], "description": "We have built a system, Patchwork, that allows programs to be organized according to a dataflow model. In our implementation, application programs use Patchwork to assemble complex microcode programs for a graphics processor from a library of microcode modules. We describe a simple and efficient implementation, in which the only overhead incurred is a single extra level of indirection when invoking a module or when a module accesses inputs, outputs, or local storage. The implementation depends on being able to describe a distinct execution tree for the network, which obviates the need both for run-time monitoring of the execution and for movement of data. Thus, neither dataflow hardware nor a dataflow language is needed for the implementation. Patchwork supports flow-of-control constructs such as looping and branching, the assembly of complex modules from simpler ones, modules written in a variety of languages for a variety of different devices, the interleaved execution of several programs on a single processor, and the execution of a single program on a set of processors in parallel. An analysis showed that Patchwork contributed between 2 and 5% to the total running time of sample microcode programs.", "reference": [ "http://www.sciencedirect.com/science/article/pii/0164121286900476/pdf?md5=16c0636d527cb9586f25153185f169a6&pid=1-s2.0-0164121286900476-main.pdf" ], "country": [ "United States" ], "originCommunity": [ "Lucasfilm Computer Graphics Group" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6437", "centralPackageRepositoryCount": 0, "isbndb": "" }, "path-pascal": { "title": "Path Pascal", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0958388c3a62e515f9eb94227b568b220310de7c" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=922", "centralPackageRepositoryCount": 0 }, "pawn-scripting-language": { "title": "Pawn", "appeared": 1998, "type": "pl", "country": [ "The Netherlands" ], "originCommunity": [ "Informatie-Technologisch Bureau CompuPhase" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "dailyPageViews": -1, "url": "https://web.archive.org/web/20150408071820/https://en.wikipedia.org/wiki/Pawn_(scripting_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "pwn", "inc", "sma" ], "aceMode": "text", "tmScope": "source.pawn", "repos": 3270, "id": "Pawn" }, "githubBigQuery": { "repos": 330, "users": 304, "id": "Pawn" }, "pygmentsHighlighter": { "filename": "pawn.py", "fileExtensions": [ "p", "pwn", "inc" ], "id": "Pawn" }, "leachim6": { "filepath": "p/Pawn.p", "fileExtensions": [ "p" ], "example": [ "#include \n \nmain(){\n print(\"Hello World\"); \n}\n" ], "id": "Pawn" }, "centralPackageRepositoryCount": 0 }, "pawn": { "title": "PAWN", "appeared": 2006, "type": "pl", "website": "https://www.compuphase.com/pawn/pawn.htm", "country": [ "The Netherlands" ], "originCommunity": [ "Informatie-Technologisch Bureau CompuPhase" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "githubRepo": { "firstCommit": 2006, "stars": 385, "forks": 66, "subscribers": 31, "created": 2015, "updated": 2022, "description": "Pawn is a quick and small scripting language that requires few resources.", "issues": 37, "url": "https://github.com/compuphase/pawn" }, "repoStats": { "firstCommit": 2006, "commits": 72, "committers": 10, "files": 228 }, "githubLanguage": { "fileExtensions": [ "pwn", "inc" ], "trendingProjectsCount": 0, "repos": 3270, "id": "PAWN" }, "githubBigQuery": { "repos": 502, "users": 434, "id": "PAWN" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 23, "commitCount": 168, "sampleCount": 2, "example": [ "#include \n\nforward OneSecTimer();\n\nnew lasttick = 0;\n\nmain()\n{\n\tprint(\"\\n----------------------------------\");\n\tprint(\" This is a blank GameModeScript\");\n\tprint(\"----------------------------------\\n\");\n}\n\npublic OnGameModeInit()\n{\n\t// Set timer of 1 second.\n\tSetTimer(\"OneSecTimer\", 1000, 1);\n\tprint(\"GameModeInit()\");\n\tSetGameModeText(\"Timer Test\");\n\tAddPlayerClass(0, 1958.3783, 1343.1572, 15.3746, 269.1425, 0, 0, 0, 0, 0, 0);\n\treturn 1;\n}\n\npublic OneSecTimer() {\n\n\tif(lasttick == 0) {\n \tlasttick = GetTickCount();\n\t\treturn;\n\t}\n\tnew sText[256];\n\tformat(sText,sizeof(sText),\"GetTickCountOffset = %d\",GetTickCount() - lasttick);\n\tprint(sText);\n\tSendClientMessageToAll(0xFF0000, sText);\n\tlasttick = GetTickCount();\n}\n\n" ], "url": "https://github.com/Southclaw/pawn-sublime-language.git" }, "rijuRepl": { "example": [ "#include \n\nmain() {\n print(\"Hello, world!\\n\");\n}\n" ], "id": "https://riju.codes/pawn" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Pawn (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130911683\n20150313|Emereo|A Source Of Pawn Stars Inspiration - 121 Success Secrets|Laura Sloan|9781488834257" }, "paxscript": { "title": "paxScript", "appeared": 2011, "type": "pl", "creators": [ "Alexander Baranovsky" ], "website": "https://web.archive.org/web/20150519155028/www.paxscript.com", "reference": [ "https://web.archive.org/web/20050204024219/https://www.virtlabs.com.ua/paxscript", "https://web.archive.org/web/20160526092626/http://www.delphipages.com/result.cfm?AC=900", "https://web.archive.org/web/20160526023044/http://www.delphipages.com/comp/tpaxscripter-5101.html" ], "country": [ "United States" ], "originCommunity": [ "VIRT Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8624", "centralPackageRepositoryCount": 0 }, "pbasic": { "title": "PBASIC", "appeared": 1988, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Parallax, Inc" ], "wikipedia": { "example": [ "HIGH 1 'turn on LED on pin 1\n PAUSE 1000 'pause for one second\n LOW 1 'turn off LED on pin 1\n END 'end program" ], "related": [ "basic", "basic-stamp" ], "summary": "PBASIC is a microcontroller-based version of BASIC created by Parallax, Inc. in 1992.PBASIC was created to bring ease of use to the microcontroller and embedded processor world. It is used for writing code for the BASIC Stamp microcontrollers. After the code is written, it is tokenized and loaded into an EEPROM on the microcontroller. These tokens are fetched by the microcontroller and used to generate instructions for the processor.", "created": 2005, "backlinksCount": 26, "pageId": 1655770, "revisionCount": 87, "dailyPageViews": 12, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/PBASIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6747", "centralPackageRepositoryCount": 0 }, "pbm-format": { "title": "Portable Bit Map Format", "appeared": 1986, "type": "textDataFormat", "description": "The PBM format is a lowest common denominator monochrome file format. It serves as the common language of a large family of bitmap image conversion filters. Because the format pays no heed to efficiency, it is simple and general enough that one can easily develop programs to convert to and from just about any other graphics format, or to manipulate the image. The name \"PBM\" is an acronym derived from \"Portable Bit Map.\"", "reference": [ "http://netpbm.sourceforge.net/doc/pbm.html" ], "country": [ "Unknown" ], "originCommunity": [ "https://netpbm.sourceforge.net/history.html" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "P1\n# This is an example bitmap of the letter \"J\"\n6 10\n0 0 0 0 1 0\n0 0 0 0 1 0\n0 0 0 0 1 0\n0 0 0 0 1 0\n0 0 0 0 1 0\n0 0 0 0 1 0\n1 0 0 0 1 0\n0 1 1 1 0 0\n0 0 0 0 0 0\n0 0 0 0 0 0" ] }, "pbt-omega": { "title": "Omega", "appeared": 2019, "type": "pl", "description": "Omega is a general purpose problem solving language with an informal conversational interface. Like pure functional programming languages, It is declarative and side-effect free. It is a pure calculus of types where each type characterizes a category of things. Omega expands the range of applications of automated systems by validly characterizing and answering questions about anything that can be imagined including infinite, incompletely knowable and nonexistent things.", "website": "https://www.pbtomega.com/", "country": [ "United States" ], "originCommunity": [ "Reasoning Technology, LLC" ], "domainName": { "name": "pbtomega.com" }, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|The Omega test: A fast and practical integer programming algorithm for dependence analysis|10.1145/125826.125848|950|82|W. Pugh|285024b15197b5face8bdef1d03f36949b8339c4\n2008|Programming in Omega|10.1007/978-3-540-88059-2_5|31|0|T. Sheard and Nathan Mishra-Linger|69077e4f231a87a15ae3e0dff8c718d5e36f729d" }, "pclos": { "title": "PCLOS", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4ccdfd07154446c02ec36eb10ed122dccfc5bf02" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7311", "centralPackageRepositoryCount": 0 }, "pcn": { "title": "PCN", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a40bc8206f1cb0064f89f8c03ab55191a6adfb9a" ], "country": [ "United States" ], "originCommunity": [ "Argonne National Laboratory" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1702", "centralPackageRepositoryCount": 0 }, "pcol": { "title": "PCOL", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6b5d2a050559ac439b45876587fbcb8da1daa979" ], "country": [ "The Netherlands" ], "originCommunity": [ "University of Leiden" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6361", "centralPackageRepositoryCount": 0 }, "pcpp": { "title": "pC++", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f0d0e8e319f4f733d066f6490cee425a2d864d84" ], "country": [ "France and United States" ], "originCommunity": [ "University of Renne", "Indiana University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1654", "centralPackageRepositoryCount": 0 }, "pcrap": { "title": "PCrap", "appeared": 2021, "type": "pl", "creators": [ "valkarias" ], "website": "https://valkarias.github.io/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/valkarias/Pa/issues" ], "githubRepo": { "firstCommit": 2021, "stars": 16, "forks": 1, "subscribers": 1, "created": 2021, "updated": 2022, "description": "A Small & Interesting Programming Language.", "issues": 0, "url": "https://github.com/valkarias/Pa" }, "repoStats": { "firstCommit": 2021, "commits": 170, "committers": 3, "files": 64 } }, "pcre": { "title": "PCRE", "appeared": 1997, "type": "queryLanguage", "creators": [ "Philip Hazel" ], "website": "http://pcre.org/", "standsFor": "Perl Compatible Regular Expressions", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/PCRE2Project" ], "domainName": { "registered": 2000, "awisRank": { "2017": 447683, "2022": 741758 }, "name": "pcre.org" }, "writtenIn": [ "c" ], "githubRepo": { "firstCommit": 2014, "stars": 284, "forks": 63, "subscribers": 12, "created": 2021, "updated": 2022, "description": "PCRE2 development is now based here.", "issues": 15, "url": "https://github.com/philiphazel/pcre2" }, "repoStats": { "firstCommit": 2014, "commits": 1579, "committers": 28, "files": 456 }, "wikipedia": { "related": [ "regex", "c", "perl", "php", "r", "cmake", "unicode", "ascii", "utf-8", "python" ], "summary": "Perl Compatible Regular Expressions (PCRE) is a regular expression C library inspired by the regular expression capabilities in the Perl programming language. Philip Hazel started writing PCRE in summer 1997. PCRE's syntax is much more powerful and flexible than either of the POSIX regular expression flavors and than that of many other regular-expression libraries. While PCRE originally aimed at feature-equivalence with Perl, the two implementations are not fully equivalent. During the PCRE 7.x and Perl 5.9.x phase, the two projects have coordinated development, with features being ported between them in both directions. A number of prominent open-source programs, such as the Apache HTTP Server and the PHP and R scripting languages, incorporate the PCRE library; proprietary software can do likewise (BSD license). As of Perl 5.10, PCRE is also available as a replacement for Perl's default regular expression engine through the re::engine::PCRE module. The library can be built using configure and make (typical of Unix-like environments), as well as in Unix, Windows and other environments using CMake. Numerous default settings are chosen at build time. In addition to the PCRE library, the distribution includes a POSIX C wrapper, a native C++ wrapper, several test programs, and the utility program pcregrep built in tandem with the library. The PCRE library provides matching only; the C++ wrapper, if used, adds multiple match and replacement functionality. Unless users choose the \"NoRecurse\" PCRE build option (aka \"--disable-stack-for-recursion\"), the calling application or operating system must allocate adequate stack space to PCRE. The amount of stack needed varies for each pattern. For example, completing the tests provided with pcretest needs 8 MB of stack space. While PCRE's documentation cautions that the \"NoRecurse\" build option makes PCRE slower than the alternative, using it avoids entirely the issue of stack overflows.", "pageId": 1712290, "dailyPageViews": 101, "created": 2005, "backlinksCount": 40, "revisionCount": 259, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Perl_Compatible_Regular_Expressions" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "pdel": { "title": "Partial Differential Equation Language", "appeared": 1968, "type": "pl", "reference": [ "https://www.osti.gov/biblio/4827530" ], "standsFor": "Partial Differential Equation Language", "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "hopl": "https://hopl.info/showlanguage.prx?exp=521" }, "pdf": { "title": "PDF", "appeared": 1993, "type": "binaryDataFormat", "reference": [ "https://www.adobe.com/content/dam/acom/en/devnet/pdf/pdfs/PDF32000_2008.pdf" ], "standsFor": "Portable Document Format", "country": [ "United States" ], "originCommunity": [ "Adobe Inc" ], "wikipedia": { "related": [ "postscript", "html", "javascript", "ascii", "gzip", "csv", "xml", "linux", "ghostscript", "latex" ], "summary": "The Portable Document Format (PDF) is a file format used to present documents in a manner independent of application software, hardware, and operating systems. Each PDF file encapsulates a complete description of a fixed-layout flat document, including the text, fonts, graphics, and other information needed to display it.", "pageId": 24077, "dailyPageViews": 2092, "created": 2018, "backlinksCount": 13085, "revisionCount": 3, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/Portable_Document_Format" }, "helloWorldCollection": [ "%Hello World in Portable Document Format (PDF)\n%PDF-1.2\n1 0 obj\n<<\n/Type /Page\n/Parent 5 0 R\n/Resources 3 0 R\n/Contents 2 0 R\n>>\nendobj\n2 0 obj\n<<\n/Length 51\n>>\nstream\nBT\n/F1 24 Tf\n1 0 0 1 260 600 Tm\n(Hello World)Tj\nET\nendstream\nendobj\n3 0 obj\n<<\n/ProcSet[/PDF/Text]\n/Font <>\n>>\nendobj\n4 0 obj\n<<\n/Type /Font\n/Subtype /Type1\n/Name /F1\n/BaseFont /Arial\n>>\nendobj\n5 0 obj\n<<\n/Type /Pages\n/Kids [ 1 0 R ]\n/Count 1\n/MediaBox\n[ 0 0 612 792 ]\n>>\nendobj\n6 0 obj\n<<\n/Type /Catalog\n/Pages 5 0 R\n>>\nendobj\ntrailer\n<<\n/Root 6 0 R\n>>\n" ], "fileType": "binary", "wordRank": 1078, "centralPackageRepositoryCount": 0 }, "pdl-ada": { "title": "PDL/Ada", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6aacf17c753a525d7574b2c9fc343607db0b58eb" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5613", "centralPackageRepositoryCount": 0 }, "pdl": { "title": "PDL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/09e5ae62d7f9417781fe537bfac40db64daa0ab0" ], "country": [ "United States" ], "originCommunity": [ "Caine, Farber & Gordon, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1413", "centralPackageRepositoryCount": 0 }, "pdp-11-machine": { "title": "PDP-11", "appeared": 1970, "type": "computingMachine", "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "wikipedia": { "summary": "The PDP-11 is a series of 16-bit minicomputers sold by Digital Equipment Corporation (DEC) from 1970 into the 1990s, one of a succession of products in the PDP series. In total, around 600,000 PDP-11s of all models were sold, making it one of DEC's most successful product lines. The PDP-11 is considered by some experts to be the most popular minicomputer ever. The PDP-11 included a number of innovative features in its instruction set and additional general-purpose registers that made it much easier to program than earlier models in the series. Additionally, the innovative Unibus system allowed external devices to be easily interfaced to the system using direct memory access, opening the system to a wide variety of peripherals. The PDP-11 replaced the PDP-8 in many real-time applications, although both product lines lived in parallel for more than 10 years. The ease of programming of the PDP-11 made it very popular for general purpose computing uses as well. The design of the PDP-11 inspired the design of late-1970s microprocessors including the Intel x86 and the Motorola 68000. Design features of PDP-11 operating systems, as well as other operating systems from Digital Equipment, influenced the design of other operating systems such as CP/M and hence also MS-DOS. The first officially named version of Unix ran on the PDP-11/20 in 1970. It is commonly stated that the C programming language took advantage of several low-level PDP-11–dependent programming features, albeit not originally by design.An effort to expand the PDP-11 from 16 to 32-bit addressing led to the VAX-11 design, which took part of its name from the PDP-11.", "backlinksCount": 626, "pageId": 24399, "dailyPageViews": 361, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/PDP-11" } }, "pear-pm": { "title": "PEAR", "appeared": 1999, "type": "packageManager", "website": "http://pear.php.net/", "reference": [ "https://github.com/pear/" ], "country": [ "Unknown" ], "originCommunity": [ "https://pear.php.net/group" ], "domainName": { "name": "pear.php.net" }, "wikipedia": { "dailyPageViews": 45, "url": "https://en.wikipedia.org/wiki/PEAR" }, "forLanguages": [ "php" ], "twitter": "https://twitter.com/pear" }, "pearl": { "title": "PEARL", "appeared": 1977, "type": "pl", "standsFor": "Process and Experiment Automation Real-Time Language", "country": [ "Germany" ], "originCommunity": [ "Deutsches Institut für Normung" ], "wikipedia": { "related": [ "perl" ], "summary": "PEARL, or Process and experiment automation realtime language, is a computer programming language designed for multitasking and real-time programming. Being a high-level language, it is fairly cross-platform. Since 1977, the language has been going under several standardization steps by the Deutsches Institut für Normung. The current version is PEARL-90, which was standardized in 1998 as DIN 66253-2. PEARL is not to be confused with the similarly named Perl, an entirely unrelated programming language created by Larry Wall in 1987.", "pageId": 2603123, "dailyPageViews": 83, "created": 2005, "backlinksCount": 14, "revisionCount": 90, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/PEARL_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=923", "fileType": "text", "wordRank": 3864, "centralPackageRepositoryCount": 0 }, "pearscript": { "title": "PearScript", "appeared": 2016, "type": "pl", "creators": [ "Ondřej Kocián" ], "website": "https://github.com/kocisov/pearscript", "country": [ "Malta" ], "originCommunity": [ "https://github.com/kocisov/pearscript/issues" ], "compilesTo": [ "javascript" ], "githubRepo": { "stars": 9, "forks": 0, "subscribers": 3, "created": 2016, "updated": 2016, "description": "Little language that compiles into Javascript", "url": "https://github.com/kocisov/pearscript" }, "repoStats": { "firstCommit": 2016, "commits": 35, "committers": 2, "files": 11 } }, "pearson-correlation-coefficient-equation": { "title": "Pearson correlation coefficient equation", "appeared": 1880, "type": "equation", "creators": [ "Karl Pearson" ], "equation": "p(x,y) = cov(x,y)/sigmaX*sigmaY" }, "pebble": { "title": "Pebble", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/81af48482535018e2ae3a6b34f5e6995f1844850" ], "country": [ "United States and Scotland" ], "originCommunity": [ "Digital Equipment Corporation", "University of Edinburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1107", "centralPackageRepositoryCount": 0 }, "peg": { "title": "PEG", "appeared": 2002, "type": "grammarLanguage", "standsFor": "parsing expression grammar", "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "example": [ "Expr ← Sum\nSum ← Product (('+' / '-') Product)*\nProduct ← Value (('*' / '/') Value)*\nValue ← [0-9]+ / '(' Expr ')'" ], "wikipedia": { "example": [ "Value ← [0-9.]+ / '(' Expr ')'\nProduct ← Expr (('*' / '/') Expr)*\nSum ← Expr (('+' / '-') Expr)*\nExpr ← Product / Sum / Value" ], "related": [ "regex" ], "summary": "In computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language. The formalism was introduced by Bryan Ford in 2004 and is closely related to the family of top-down parsing languages introduced in the early 1970s. Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation: the choice operator selects the first match in PEG, while it is ambiguous in CFG. This is closer to how string recognition tends to be done in practice, e.g. by a recursive descent parser. Unlike CFGs, PEGs cannot be ambiguous; if a string parses, it has exactly one valid parse tree. It is conjectured that there exist context-free languages that cannot be recognized by a PEG, but this is not yet proven. PEGs are well-suited to parsing computer languages (and artificial human languages such as Lojban), but not natural languages where the performance of PEG algorithms is comparable to general CFG algorithms such as the Earley algorithm.", "pageId": 892899, "created": 2004, "backlinksCount": 121, "revisionCount": 443, "dailyPageViews": 187, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Parsing_expression_grammar" }, "pygmentsHighlighter": { "filename": "grammar_notation.py", "fileExtensions": [ "peg" ], "id": "PEG" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "pegasus-autocode": { "title": "Pegasus AUTOCODE", "appeared": 1959, "type": "pl", "reference": [ "https://academic.oup.com/comjnl/article/1/4/192/430774" ], "country": [ "United Kingdom" ], "originCommunity": [ "Ferranti Ltd" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2898" }, "pegjs": { "title": "PEG.js", "appeared": 2010, "type": "grammarLanguage", "creators": [ "David Majda" ], "description": "PEG.js is a simple parser generator for JavaScript that produces fast parsers with excellent error reporting. You can use it to process complex data or computer languages and build transformers, interpreters, compilers and other tools easily.", "website": "https://pegjs.org/", "webRepl": [ "https://pegjs.org/online" ], "country": [ "Germany and United Kingdom" ], "originCommunity": [ "https://github.com/pegjs" ], "domainName": { "awisRank": { "2017": 1244889, "2022": 804820 }, "name": "pegjs.org" }, "compilesTo": [ "javascript" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "start\n = additive\n\nadditive\n = left:multiplicative \"+\" right:additive { return left + right; }\n / multiplicative\n\nmultiplicative\n = left:primary \"*\" right:multiplicative { return left * right; }\n / primary\n\nprimary\n = integer\n / \"(\" additive:additive \")\" { return additive; }\n\ninteger \"integer\"\n = digits:[0-9]+ { return parseInt(digits.join(\"\"), 10); }" ], "githubRepo": { "stars": 4410, "forks": 437, "subscribers": 91, "created": 2010, "updated": 2022, "firstCommit": 2010, "description": "PEG.js: Parser generator for JavaScript", "issues": 116, "url": "https://github.com/pegjs/pegjs" }, "repoStats": { "firstCommit": 2010, "commits": 1417, "committers": 29, "files": 178 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "pegjs" ], "aceMode": "javascript", "codemirrorMode": "javascript", "codemirrorMimeType": "text/javascript", "tmScope": "source.pegjs", "repos": 72, "id": "PEG.js" }, "githubBigQuery": { "repos": 63, "users": 63, "id": "PEG.js" }, "twitter": "https://twitter.com/pegjs", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pei": { "title": "PEI", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8a23d36dc51b3f14ed81faea28caebc5704a3acd" ], "country": [ "France" ], "originCommunity": [ "Université Louis Pasteur" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6243", "centralPackageRepositoryCount": 0 }, "penguor": { "title": "penguor", "appeared": 2020, "type": "pl", "creators": [ "Carl Schierig" ], "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/eon92a/penguor_my_own_dataoriented_programming_language/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/CozyPenguin/Pave/issues" ], "githubRepo": { "firstCommit": 2021, "stars": 11, "forks": 0, "subscribers": 3, "created": 2020, "updated": 2022, "description": "The compiler for the Pave Language", "issues": 0, "url": "https://github.com/Penguor/PenguorCS" }, "repoStats": { "firstCommit": 2021, "commits": 342, "committers": 1, "files": 175 } }, "penrose": { "title": "penrose", "appeared": 2016, "type": "pl", "website": "http://penrose.ink", "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "domainName": { "name": "penrose.ink" }, "githubRepo": { "firstCommit": 2016, "stars": 5431, "forks": 248, "subscribers": 115, "created": 2016, "updated": 2022, "description": "Create beautiful diagrams just by typing mathematical notation in plain text.", "issues": 159, "url": "https://github.com/penrose/penrose" }, "repoStats": { "firstCommit": 2016, "commits": 3865, "committers": 45, "files": 938 }, "twitter": "https://twitter.com/usepenrose", "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2020|Penrose|10.1145/3386569.3392375|7|1|Katherine Q. Ye and Wode Ni and Max Krieger and Dor Ma'ayan and Jenna Wise and Jonathan Aldrich and Joshua Sunshine and Keenan Crane|e2a49a1b90e758d55e30782db5b722170880b5a0" }, "peoplecode": { "title": "PeopleCode", "appeared": 2008, "type": "pl", "originCommunity": [ "Oracle" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "&SQL = CreateSQL(\"SQL Statement\");\n &SQL.Execute([bind_values]);" ], "related": [ "java" ], "summary": "PeopleCode is a proprietary object-oriented programming language used to express business logic for PeopleSoft applications. Syntactically, PeopleCode is similar to other programming languages, and can be found in both loosely-typed and strongly-typed forms. PeopleCode and its run-time environment is part of the larger PeopleTools framework. PeopleCode has evolved over time and its implementation through the PeopleSoft applications lack consistency. PeopleCode offers some interoperability with the Java programming language. Definition name references, for example, enable you to refer to PeopleTools definitions, such as record definitions or pages, without using hard-coded string literals. Other language features, such as PeopleCode data types and metastrings, reflect the close interaction of PeopleTools and Structured Query Language (SQL). Dot notation, classes and methods in PeopleCode are similar to other object oriented languages, like Java. Object syntax was an important feature of PeopleTools 8.", "pageId": 5157513, "dailyPageViews": 27, "created": 2006, "backlinksCount": 10, "revisionCount": 83, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/PeopleCode" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/peoplecode", "helloWorldCollection": [ "/* Hello World in PeopleCode 8.45\n\n&MsgText = MsgGetText(66666666, 999999999, \"Hello World!\");\n" ], "leachim6": { "filepath": "p/PeopleCode", "example": [ "MessageBox(0, \"\", 0, 0, \"Hello World\");\n" ], "id": "PeopleCode" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:PeopleCode", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPeopleSoft Developer's Guide for Peopletools & Peoplecode|2008|Judi Dolittle|5705403|2.20|5|0\nPeopleSoft Developer's Guide for Peopletools & Peoplecode|2008|Judi Dolittle|15324665|0.0|0|0\nPeopleSoft Developer's Guide for PeopleTools & PeopleCode (Osborne Oracle Press)|2008|Judi Dolittle|27942732|0.0|0|0\nOracle 1z0-241 Exam: PeopleSoft Application Developer I: PeopleTools & PeopleCode||Jacob Michael|48865985|0.0|0|0\nEasy Guide: PeopleSoft Application Developer I PeopleTools and PeopleCode||Austin Songer|57761265|0.0|0|0\nEasy Guide: PeopleSoft Application Developer I Peopletools and Peoplecode: Questions and Answers||Austin Vern Songer|55355393|0.0|0|0" }, "pep": { "title": "PEP", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bcfbb8578832db7be05b5250f2323dc7ec31c7a2" ], "country": [ "The Netherlands" ], "originCommunity": [ "Eindhoven University of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3339", "centralPackageRepositoryCount": 0 }, "pep8": { "title": "Pep8", "appeared": 2009, "type": "assembly", "reference": [ "http://computersystemsbook.com/4th-edition/pep8/" ], "country": [ "United States" ], "originCommunity": [ "Pepperdine University" ], "example": [ " BR main\n num: .EQUATE 0 \n main: SUBSP 2,i \n DECI num,s \n if: LDA num,s \n ANDA 0x0001,i\n BRNE else\n STRO even_msg,d \n BR endIf\n else: STRO odd_msg,d \n endIf: ADDSP 2,i \n STOP\n odd_msg: .ASCII \"The number is: Odd\\x00\"\n even_msg: .ASCII \"The number is: Even\\x00\"\n .END" ], "githubRepo": { "firstCommit": 2009, "stars": 20, "forks": 4, "subscribers": 8, "created": 2015, "updated": 2022, "description": "Pep/8 assembler and simulator for the textbook Computer Systems, J. Stanley Warford, Fourth edition", "issues": 0, "url": "https://github.com/StanWarford/pep8" }, "repoStats": { "firstCommit": 2009, "commits": 490, "committers": 8, "files": 265 }, "githubLanguage": { "fileExtensions": [ "pep" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.pep8", "repos": 165, "id": "Pep8" }, "githubBigQuery": { "repos": 33, "users": 32, "id": "Pep8" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2017, "committerCount": 1, "commitCount": 3, "sampleCount": 7, "example": [ "_start:\tLDA\t0,i\n\tLDX\t0,i\n\tLDA\t20, i\n\tADDA\t51, i\n\tCPA\t0,i\n\tBRLT\ts3\n\tBR\ts4\ns1:\tLDBYTEA\ts3, x\n\tNOTA\n\tSTBYTEA s3, x\n\tADDX\t1,i\n\tCPX\t12, i\n\tBRNE\ts1\ns2:\tSTOP\ns4:\tLDA\t31, d\n\tLDX\t50, d\n\tRET0\n\tSTOP\ns3:\tCPX\t-27746, d\n\tANDX\t-8241, i\n\tSUBA\t-12337, sxf\n\tLDX\t-12289, sx\n\t.END\n" ], "url": "https://github.com/R4PaSs/Sublime-Pep8" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "perfectscript": { "title": "Perfectscript", "appeared": 1995, "type": "pl", "description": "A programming language for the office suite.", "reference": [ "https://officecommunity.com/discussion/wordperfect_office_15/b/wordperfect_office_blog/posts/perfectscript-example-1-part-1-retrieve-filenames-from-a-directory", "https://personalpages.bradley.edu/~arn/ime117/psmacros/Chapter_11_toc.htm" ], "originCommunity": [ "Novell" ], "example": [ "Declare Test[10]\nTest[1] := 5" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "peridot": { "title": "Peridot", "appeared": 2022, "type": "pl", "description": "Peridot MVP", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wjsxwh/peridot_mvp/" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/eashanhatti/peridot/issues" ] }, "perl-6": { "title": "Perl 6", "appeared": 2015, "type": "pl", "creators": [ "Larry Wall" ], "website": "https://perl6.org/", "aka": [ "Raku perl6" ], "country": [ "Various" ], "originCommunity": [ "https://raku.org/community" ], "domainName": { "name": "perl6.org" }, "visualParadigm": false, "hasMultipleInheritance": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "example": [ "multi sub hanoi(0, $, $, $) { } # No disk, so do not do anything\n multi sub hanoi($n, $a = 'A', $b = 'B', $c = 'C') { # Start with $n disks and three pegs A, B, C\n hanoi $n - 1, $a, $c, $b; # firstly move top $n - 1 disks from A to B\n say \"Move disk $n from peg $a to peg $c\"; # then move last disk from A to C\n hanoi $n - 1, $b, $a, $c; # lastly move $n - 1 disks from B to C\n }" ], "related": [ "perl", "haskell", "javascript", "ruby", "smalltalk", "rfc", "python", "java", "squeak", "regex", "peg", "antlr", "icon", "isbn" ], "summary": "Perl 6 (also known as Raku) is a member of the Perl family of programming languages.While historically several interpreter and compiler implementations were being written, today only the Rakudo Perl 6 implementation is in active development. It is introducing elements of many modern and historical languages. Compatibility with Perl 5 is not a goal, though a compatibility mode is part of the specification. The design process for Perl 6 began in 2000. In February 2015 a post on The Perl Foundation blog stated that \"The Perl6 team will attempt to get a development release of version 1.0 available for Larry's birthday in September and a Version 1.0 release by Christmas\", and on 25 December 2015, the first stable version of the specification was announced.Development on Pugs, the first high-traction implementation, began in 2005, and there have been multiple Perl 6 implementation projects. Rakudo Perl 6 is based on NQP (Not Quite Perl) and can use MoarVM or the Java Virtual Machine as a runtime environment, and releases a new version every month (including precompiled GNU/Linux packages); in July 2010, the project released the first Rakudo Star distribution, a collection of a Perl 6 implementation and related materials. Larry Wall maintains a reference grammar known as STD.pm6, written in Perl 6 and bootstrapped with Perl 5.", "backlinksCount": 180, "pageId": 1146638, "created": 2004, "revisionCount": 893, "dailyPageViews": 148, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/Perl_6" }, "githubLanguage": { "fileExtensions": [ "6pl", "6pm", "nqp", "p6", "p6l", "p6m", "pl", "pl6", "pm", "pm6", "t" ], "trendingProjectsCount": 0, "repos": 966, "id": "Perl 6" }, "githubBigQuery": { "repos": 2002, "users": 1750, "id": "Perl 6" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2017, "committerCount": 6, "commitCount": 510, "sampleCount": 22, "example": [ "# used in t/spec/S11-modules/nested.t \n\nBEGIN { @*INC.push('t/spec/packages') };\n\nmodule A::A {\n use A::B;\n}\n\n# vim: ft=perl6\n" ], "url": "https://github.com/perl6/atom-language-perl6" }, "tryItOnline": "perl6", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThink Perl 6: How to Think Like a Computer Scientist|2017|Laurent Rosenfeld|54910137|4.00|2|0\nLearning to program with Perl 6: First Steps: Getting into programming without leaving the command line.||J.J. Merelo|56847882|3.50|2|0", "isbndb": "", "semanticScholar": "" }, "perl-data-language": { "title": "Perl Data Language", "appeared": 1996, "type": "pl", "country": [ "Various" ], "originCommunity": [ "https://github.com/PDLPorters" ], "wikipedia": { "example": [ "perldl> $x = pdl [[1, 2], [3, 4]];\n \n perldl> $y = pdl [[5, 6, 7],[8, 9, 0]];\n \n perldl> $z = $x x $y;\n \n perldl> p $z;\n \n [\n [21 24 7]\n [47 54 21]\n ]" ], "related": [ "apl", "idl", "perl", "matlab", "numpy", "perl-6", "gnuplot", "opengl", "c", "xs", "fortran" ], "summary": "Perl Data Language (abbreviated PDL) is a set of free software array programming extensions to the Perl programming language. PDL extends the data structures built into Perl, to include large multidimensional arrays, and adds functionality to manipulate those arrays as vector objects. It also provides tools for image processing, computer modeling of physical systems, and graphical plotting and presentation. Simple operations are automatically vectorized across complete arrays, and higher-dimensional operations (such as matrix multiplication) are supported.", "created": 2004, "backlinksCount": 41, "pageId": 908764, "revisionCount": 127, "dailyPageViews": 22, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Perl_Data_Language" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "perl": { "title": "Perl", "appeared": 1987, "type": "pl", "creators": [ "Larry Wall" ], "website": "https://www.perl.org", "documentation": [ "https://perldoc.perl.org/" ], "emailList": [ "https://lists.perl.org/all.html" ], "spec": "https://perldoc.perl.org/File::Spec", "fileExtensions": [ "pl", "pm", "t", "pod" ], "country": [ "United States" ], "originCommunity": [ "Unisys" ], "domainName": { "registered": 1995, "awisRank": { "2022": 124744 }, "name": "perl.org" }, "releaseNotesUrl": "https://dev.perl.org/perl5/news/", "visualParadigm": false, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "print \"Hello World\".match(/\\w/)", "value": true }, "hasPartialApplication": { "example": "sub first-and-last ( $first, $last ) {\n say \"Name is $first $last\";\n}\nmy &surname-smith = &first-and-last.assuming( *, 'Smith' );\n&surname-smith.( 'Joe' ); # OUTPUT: «Name is Joe Smith␤» ", "value": true }, "hasComments": { "example": "# This is a comment in perl\n=begin comment\nThis is all part of multiline comment.\nYou can use as many lines as you like\nThese comments will be ignored by the \ncompiler until the next =cut is encountered.\n=cut", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasHereDocs": { "example": "", "value": true }, "hasDirectives": { "example": "# In Perl, the keyword \"use\", which imports modules, can also be used to specify directives, such as use strict; or use utf8;\nuse utf8;", "value": true }, "hasImports": { "example": "use Digest::MD5 'md5_hex';", "value": true }, "hasMultipleInheritance": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasRangeOperators": { "example": "# https://users.cs.cf.ac.uk/Dave.Marshall/PERL/node38.html\n@array = (1..10);", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasWhileLoops": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "# 0_?[0-7]+(_[0-7]+)*", "value": true }, "hasHexadecimals": { "example": "# 0x[0-9A-Fa-f]+(_[0-9A-Fa-f]+)*", "value": true }, "hasFloats": { "example": "# (?i)(\\d*(_\\d*)*\\.\\d+(_\\d*)*|\\d+(_\\d*)*\\.\\d+(_\\d*)*)(e[+-]?\\d+)?", "value": true }, "hasIntegers": { "example": "# \\d+(_\\d+)*", "value": true }, "hasBinaryNumbers": { "example": "# 0b[01]+(_[01]+)*", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "=begin", "=cut" ] ], "printToken": [ [ "print" ] ], "keywords": [ "__DATA__", "else", "lock", "qw", "__END__", "elsif", "lt", "qx", "__FILE__", "eq", "m", "s", "__LINE__", "exp", "ne", "sub", "__PACKAGE__", "for", "no", "tr", "and", "foreach", "or", "unless", "cmp", "ge", "package", "until", "continue", "gt", "q", "while", "CORE", "if", "qq", "xor", "do", "le", "qr", "y" ], "wikipedia": { "example": [ "#!/usr/bin/perl\nuse strict;\nuse warnings;\nuse IO::Handle;\n\nmy ( $remaining, $total );\n\n$remaining = $total = shift(@ARGV);\n\nSTDOUT->autoflush(1);\n\nwhile ( $remaining ) {\n printf ( \"Remaining %s/%s \\r\", $remaining--, $total );\n sleep 1;\n}\n\nprint \"\\n\";" ], "related": [ "pearl", "c", "lisp", "pascal", "sed", "coffeescript", "ecmascript", "falcon", "groovy", "javascript", "julia", "lpc", "perl-6", "php", "python", "ruby", "powershell", "unix", "bourne-shell", "regex", "unicode", "haskell", "parrot-vm", "dtrace", "json", "awk", "fortran", "s-expressions", "yacc", "bison", "sql", "html", "xs", "rfc", "jvm", "apl", "perl-data-language", "pod" ], "summary": "Perl is a family of high-level, general-purpose, interpreted, dynamic programming languages. The languages in this family include Perl 5 and Perl 6. Though Perl is not officially an acronym, there are various backronyms in use, including \"Practical Extraction and Reporting Language\". Perl was originally developed by Larry Wall in 1987 as a general-purpose Unix scripting language to make report processing easier. Since then, it has undergone many changes and revisions. Perl 6, which began as a redesign of Perl 5 in 2000, eventually evolved into a separate language. Both languages continue to be developed independently by different development teams and liberally borrow ideas from one another. The Perl languages borrow features from other programming languages including C, shell script (sh), AWK, and sed. They provide powerful text processing facilities without the arbitrary data-length limits of many contemporary Unix commandline tools, facilitating easy manipulation of text files. Perl 5 gained widespread popularity in the late 1990s as a CGI scripting language, in part due to its then unsurpassed regular expression and string parsing abilities. In addition to CGI, Perl 5 is used for system administration, network programming, finance, bioinformatics, and other applications, such as for GUIs. It has been nicknamed \"the Swiss Army chainsaw of scripting languages\" because of its flexibility and power, and also its ugliness. In 1998, it was also referred to as the \"duct tape that holds the Internet together\", in reference to both its ubiquitous use as a glue language and its perceived inelegance.", "pageId": 23939, "dailyPageViews": 1299, "created": 2001, "backlinksCount": 4942, "revisionCount": 3709, "appeared": 1987, "fileExtensions": [ "pl", "pm", "t", "pod" ], "url": "https://en.wikipedia.org/wiki/Perl" }, "githubLanguage": { "fileExtensions": [ "pl", "al", "cgi", "fcgi", "perl", "ph", "plx", "pm", "psgi", "t" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nbrendangregg FlameGraph https://github.com/brendangregg.png https://github.com/brendangregg/FlameGraph Perl #0298c3 8342 973 180 \"Stack trace visualizer\"\nwebmin webmin https://github.com/webmin.png https://github.com/webmin/webmin Perl #0298c3 1077 318 37 \"Powerful and flexible web-based server management control panel\"\nAlDanial cloc https://github.com/AlDanial.png https://github.com/AlDanial/cloc Perl #0298c3 7923 502 189 \"cloc counts blank lines, comment lines, and physical lines of source code in many programming languages.\"\nSpiderLabs owasp-modsecurity-crs https://github.com/SpiderLabs.png https://github.com/SpiderLabs/owasp-modsecurity-crs Perl #0298c3 1828 573 41 \"OWASP ModSecurity Core Rule Set (CRS) Project (Official Repository)\"\nsullo nikto https://github.com/sullo.png https://github.com/sullo/nikto Perl #0298c3 3232 542 81 \"Nikto web server scanner\"", "trendingProjectsCount": 6, "type": "programming", "filenames": [ "Makefile.PL", "Rexfile", "ack", "cpanfile" ], "interpreters": [ "cperl", "perl" ], "aceMode": "perl", "codemirrorMode": "perl", "codemirrorMimeType": "text/x-perl", "tmScope": "source.perl", "aliases": [ "cperl" ], "repos": 169830, "id": "Perl" }, "githubBigQuery": { "repos": 101542, "users": 69499, "id": "Perl" }, "monaco": "perl", "codeMirror": "perl", "pygmentsHighlighter": { "filename": "perl.py", "fileExtensions": [ "pl", "pm", "t", "perl" ], "id": "Perl" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 30, "commitCount": 248, "sampleCount": 20, "example": [ "#!/usr/local/bin/perl\nprint \"Perl\\n\"\n" ], "url": "https://github.com/textmate/perl.tmbundle" }, "projectEuler": { "memberCount": { "2019": 2439, "2022": 2433 }, "id": "Perl" }, "helloWorldCollection": [ "# Hello world in perl\n\nprint \"Hello World!\\n\";\n" ], "leachim6": { "filepath": "p/Perl.pl", "fileExtensions": [ "pl" ], "example": [ "#!/usr/bin/perl\nprint \"Hello World\\n\";\n" ], "id": "Perl" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Perl", "rijuRepl": { "example": [ "print(\"Hello, world!\\n\");\n" ], "id": "https://riju.codes/perl" }, "tryItOnline": "perl6", "indeedJobs": { "2017": 8795, "query": "perl engineer" }, "linkedInSkill": { "2018": 468708, "id": "perl" }, "stackOverflowSurvey": { "2021": { "users": 2028, "medianSalary": 80000, "fans": 1175, "percentageUsing": 0.02 } }, "annualReportsUrl": [ "http://blogs.perl.org/users/mohammad_s_anwar/2022/01/" ], "eventsPageUrl": [ "https://www.perl.org/events.html" ], "faqPageUrl": [ "https://perldoc.perl.org/perlfaq" ], "downloadPageUrl": [ "https://www.perl.org/get.html" ], "subreddit": [ { "memberCount": { "2017": 10666, "2022": 15510 }, "url": "https://reddit.com/r/perl" } ], "meetup": { "memberCount": 28878, "groupCount": 83, "url": "https://www.meetup.com/topics/perl" }, "tiobe": { "currentRank": 15, "id": "Perl" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2355", "pypl": "Perl", "packageRepository": [ "https://www.cpan.org/" ], "jupyterKernel": [ "https://metacpan.org/release/Devel-IPerl", "https://github.com/gabrielash/p6-net-jupyter", "https://github.com/timo/iperl6kernel", "https://github.com/bduggan/p6-jupyter-kernel" ], "fileType": "text", "wordRank": 3152, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Perl|1991|Tom Christiansen|675275|4.04|2104|52\nAdvanced Perl Programming (Perl Series)|1997|Sriram Srinivasan|570466|3.93|201|1\nEffective Perl Programming|1997|Joseph Hall|931057|4.22|103|10\nPerl for Dummies|1997|Paul E. Hoffman|1015718|3.42|48|5\nThe Perl CD Bookshelf: Perl in a Nutshell/Programming Perl, 2nd Edition/Perl Cookbook/Advanced Perl Programming/Learning Perl, 2nd Edition/Learning Perl on WIN32 Systems|1999|O'Reilly Media Inc.|570491|4.11|27|0\nProgramming the Perl DBI|2000|Tim Bunce|620583|3.47|77|3", "isbndb": "year|publisher|title|authors|isbn13\n2007|Prentice Hall|Perl by Example (4th Edition)|Quigley, Ellie|9780132381826\n2000|Addison-Wesley Professional|Network Programming with Perl|Stein, Lincoln D.|9780201615715\n1996|Sams|Perl 5 Unleashed|Husain, Kamran and Breedlove, Robert F.|9780672308918\n2001|Peachpit Press|Perl and CGI for the World Wide Web, Second Edition|Castro, Elizabeth|9780201735680\n2012|Wrox|Beginning Perl|Poe, Curtis|9781118013847\n1998|Peachpit Press|Perl and CGI for the World Wide Web (Visual QuickStart Guide)|Castro, Elizabeth|9780201353587\n1997|O'Reilly Media|Advanced Perl Programming (Perl Series)|Srinivasan, Sriram|9781565922204\n1997|O'Reilly Media|Mastering Regular Expressions: Powerful Techniques for Perl and Other Tools (Nutshell Handbooks)|Friedl, Jeffrey E. F.|9781565922570\n1998|Computing McGraw-Hill|Perl 5 Developer's Guide|Peschko, Ed and Dewolfe, Michelle|9780079136985\n2011|O'Reilly Media|Perl Pocket Reference: Programming Tools|Vromans, Johan|9781449303709\n2006|O'Reilly Media|Intermediate Perl|Randal L. Schwartz and Tom Phoenix and brian d foy|9780596102067\n1998|Addison-Wesley Professional|Effective Perl Programming: Writing Better Programs with Perl|Hall, Joseph N. and Schwartz, Randal|9780201419757\n1999|O'Reilly Media|The Perl CD Bookshelf: Perl in a Nutshell/Programming Perl, 2nd Edition/Perl Cookbook/Advanced Perl Programming/Learning Perl, 2nd Edition/Learning Perl on WIN32 Systems|O'Reilly Media, Inc.|9781565924628\n1999|Coriolis Group|Perl Core Language Little Black Book: The Essentials of the Perl Language|Holzner, Steven|9781576104262\n1997|O'Reilly Media|Learning Perl (Nutshell Handbooks)|Christiansen, Tom and Schwartz, Randal L.|9781565922846\n2014|O'Reilly Media|Mastering Perl: Creating Professional Programs with Perl|foy, brian d|9781449393113\n2003|For Dummies|Perl For Dummies|Hoffman, Paul|9780764537509\n2002|O'Reilly Media|Mastering Perl/Tk: Graphical User Interfaces in Perl|Lidie, Stephen and Walsh, Nancy|9781565927162\n2005|Sams Publishing|Sams Teach Yourself Perl in 24 Hours (3rd Edition)|Pierce, Clinton|9780672327933\n2007|Jones & Barlett Learning|Perl Programming For Medicine And Biology|Jules J. Berman|9780763743338\n2001|McGraw-Hill Osborne Media|Instant Perl Modules|Sparling, Douglas and Wiles, Frank|9780072129625\n2001|Apress|Professional Perl Development|Arva, Adrian and Ellis, Joshua and Corliss, Arthur and Kobes, Randy and Wainwright, Peter and Wilcox, Mark and de Mauro, Pancrazio and Mauro, Pancrazio de and Oliver, Simon and Brown, Gavin|9781861004383\n2002|O'Reilly Media|The Perl CD Bookshelf, Version 3.0: 7 Bestselling Books on CD-ROM Includes a Bonus Book! Perl in a Nutshell, 2nd Edition|O'Reilly & Associates|9780596003890\n2001|O'Reilly Media|Perl CD Bookshelf 2.0 (Book & CD-ROM)|Various Authors|9780596001643\n2002|Addison-Wesley|The Web Wizard's Guide to Perl and CGI|David A. Lash|9780201764369\n2020|Apress|Advanced Perl Programming: From Advanced to Expert|\"Rothwell, William \"\"Bo\"\"\"|9781484258620\n1998|O'Reilly Media|Perl 5 Pocket Reference|Vromans, Johan|9781565924956\n2003|Wiley-Liss|Perl Programming for Biologists|Jamison, D. Curtis|9780471430599\n2002|Manning Publications|Graphics Programming with Perl|Verbruggen, Martien|9781930110021\n2003|O'Reilly Media|Perl 6 Essentials|Allison Randal and Dan Sugalski and Leopold Totsch|9780596004996\n2001|Prentice Hall|Weaving a Website: Programming in HTML, Java Script, Perl and Java|Anderson-Freed, Susan|9780130282200\n1996|O'Reilly Media|Perl 5 Desktop Reference (A Nutshell Handbook)|Vromans, Johan|9781565921870\n2001|Sams Publishing|Win32 Perl Programming: The Standard Extensions|Roth, Dave|9781578702169\n2019|Apress|Beginning Perl Programming: From Novice to Professional|\"Rothwell, William \"\"Bo\"\"\"|9781484250549\n2006|No Starch Press|Wicked Cool Perl Scripts: Useful Perl Scripts That Solve Difficult Problems|Oualline, Steve|9781593270629\n2001|Addison-wesley|Perl Debugged|Scott, Peter|9780201700541\n1999|Coriolis Group Books|Perl Black Book: The Most Comprehensive Perl Reference Available Today|Holzner, Steven|9781576104651\n2001|Addison-Wesley Professional|Writing CGI Applications with Perl|Meltzer, Kevin and Michalski, Brent|9780201710144\n2001|Coriolis Group|Perl Black Book, 2nd Edition|Holzner, Steven|9781588801937\n2000|Sams Publishing|Win32 Perl Scripting: The Administrator's Handbook|Roth, Dave|9781578702152\n2016|CreateSpace Independent Publishing Platform|Advanced programming in Perl for beginners|Oria San Martin, Dorian|9781533018731\n1996|Sams|Teach Yourself Cgi Programming With Perl in a Week (Sams Teach Yourself)|Herrmann, Eric|9781575210094\n2016|CreateSpace Independent Publishing Platform|Perl In Your Hands: For Beginners in Perl Programming|S, Gokul Amuthan|9781530959631\n1997|Hungry Minds Inc|Perl 5 for Dummies|Hoffman, Paul|9780764500442\n20010718|O'Reilly Media, Inc.|Learning Perl|Tom Phoenix; Randal L. Schwartz|9780596551926\n2009|Chapman and Hall/CRC|Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R (Chapman & Hall/CRC Computational Biology Series)|Valiente, Gabriel|9781420069730\n2012|Cambridge University Press|Unix And Perl To The Rescue!: A Field Guide For The Life Sciences (and Other Data-rich Pursuits)|Bradnam, Keith.|9780521169820\n1997|Prentice Hall Ptr|Cgi Developer's Resource: Web Programming in Tcl and Perl (Resource Series)|Ivler, J. M. and Husain, Kamran|9780137277513\n20030821|O'Reilly Media, Inc.|Perl Cookbook|Tom Christiansen; Nathan Torkington|9780596554965\n20011022|O'Reilly Media, Inc.|Beginning Perl for Bioinformatics|James Tisdall|9780596550479\n2002|Wiley|Programming the Network with Perl|Barry, Paul|9780471486701\n2020|Apress|Pro Perl Programming: From Professional to Advanced|\"Rothwell, William \"\"Bo\"\"\"|9781484256053\n1997|Sams|Sams Teach Yourself Perl 5 For Windows Nt In 21 Days|Till and David and Zhang and Tony|9780672310478\n2009|Chapman and Hall/CRC|Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R (Chapman & Hall/CRC Computational Biology Series)|Valiente, Gabriel|9781420069747\n2006|Springer|An Introduction to Language Processing with Perl and Prolog: An Outline of Theories, Implementation, and Application with Special Consideration of English, French, and German (Cognitive Technologies)|Nugues, Pierre M.|9783540343363\n2003|O'Reilly Media|Perl Cookbook, Second Edition|Christiansen, Tom and Torkington, Nathan|9780596003135\n2000|O'Reilly Media|Programming Perl (3rd Edition)|Wall, Larry and Christiansen, Tom and Orwant, Jon|9780596000271\n2003|Wiley-Blackwell|Programming for Linguists: Perl for Language Researchers|Hammond, Michael|9780631234340\n2012|O'Reilly Media|Intermediate Perl: Beyond The Basics of Learning Perl|Schwartz, Randal L. and foy, brian d and Phoenix, Tom|9781449393090\n2019|Apress|Beginning Perl Programming: From Novice to Professional|\"Rothwell, William \"\"Bo\"\"\"|9781484250556\n2005|O'Reilly Media|Perl Best Practices: Standards and Styles for Developing Maintainable Code|Conway, Damian|9780596001735\n2005|O'Reilly Media|Advanced Perl Programming: The Worlds Most Highly Developed Perl Tutorial|Cozens, Simon|9780596004569\n2001|O'Reilly Media|Beginning Perl for Bioinformatics|James Tisdall|9780596000806\n2000|O'Reilly Media|Programming the Perl DBI: Database programming with Perl|Tim Bunce and Alligator Descartes|9781565926998\n2004|CGI101.com|CGI Programming 101: Programming Perl for the World Wide Web, Second Edition|Jacqueline Hamilton|9780966942613\n2010|Addison-Wesley Professional|Effective Perl Programming: Ways to Write Better, More Idiomatic Perl (Effective Software Development)|Hall, Joseph N. and McAdams, Joshua A. and Foy, Brian D.|9780321718273\n2010|Addison-Wesley Professional|Effective Perl Programming: Ways to Write Better, More Idiomatic Perl (Effective Software Development Series)|Hall, Joseph and McAdams, Joshua and Foy, Brian|9780321496942\n1999|Manning Publications|Elements of Programming with Perl|Johnson, Andrew L|9781884777806\n2002|O'Reilly Media|Perl in A Nutshell: A Desktop Quick Reference (2nd Edition)|Ellen Siever and Stephen Spainhour and Nathan Patwardhan|9780596002411\n2003|O'Reilly Media|Mastering Perl for Bioinformatics|James D. Tisdall|9780596003074\n2001|Manning Publications|Data Munging with Perl|Cross, David|9781930110007\n2017|Apress|Parsing with Perl 6 Regexes and Grammars: A Recursive Descent into Parsing|Lenz, Moritz|9781484232286\n1996|Addison-Wesley Professional|CGI Programming in C and Perl|Boutell, Thomas|9780201422191\n2006|O'Reilly Media|Perl Hacks: Tips & Tools for Programming, Debugging, and Surviving|\"chromatic and Damian Conway and Curtis \"\"Ovid\"\" Poe\"|9780596526740\n2002|O'Reilly Media|Perl Graphics Programming: Creating SVG, SWF (Flash), JPEG and PNG files with Perl|Wallace, Shawn|9780596002190\n2002|O'Reilly Media|Perl and XML: XML Processing with Perl|Ray, Erik T. and McIntosh, Jason|9780596002053\n2008|Wiley|Scripting with Objects: A Comparative Presentation of Object-Oriented Scripting with Perl and Python|Kak, Avinash C.|9780470397251\n2001|Prentice Hall|Perl How to Program|Deitel, Harvey M. and Deitel, Paul J. and Nieto, Tem R. and McPhie, D. C.|9780130284181\n2017|Apress|Perl 6 Fundamentals: A Primer with Examples, Projects, and Case Studies|Lenz, Moritz|9781484228999\n2005|O'Reilly Media|Perl Testing: A Developer's Notebook: A Developer's Notebook|Ian Langworth and chromatic|9780596100926\n2006|Cengage Learning PTR|Perl Programming for the Absolute Beginner|Ford, Jr. Jerry Lee|9781598632224\n2002|O'Reilly Media|Programming Web Services with Perl|Randy J. Ray and Pavel Kulchenko|9780596002060\n2019|Independently published|PERL: PERL Programming for Beginners. Learn Programming PERL, 2019 Edition. (Step-by-Step PERL Programming)|Publishing, Nexcod|9781088570869\n2010|Apress|Beginning Perl (Expert's Voice in Open Source)|Lee, James|9781430227939\n2002|Manning Publications|Extending and Embedding Perl|Tim Jenness and Simon Cozens|9781930110823\n2008|Wiley|Practical Text Mining with Perl|Bilisoly, Roger|9780470176436\n2020|Apress|Advanced Perl Programming: From Advanced to Expert|\"Rothwell, William \"\"Bo\"\"\"|9781484258637\n2002|Sams Publishing|Sams Teach Yourself Perl in 21 Days (2nd Edition)|Lemay, Laura|9780672320354\n2003|O'Reilly Media|Learning Perl Objects, References, and Modules|Randal L. Schwartz and Tom Phoenix|9780596004781\n2005|Apress|Pro Perl Debugging|Lester, Andy and Foley, Richard|9781590594544\n2002|O'Reilly Media|Computer Science & Perl Programming: Best of TPJ|Jon Orwant|9780596003104\n1996|O'Reilly Media|Programming Perl|Christiansen, Tom and Schwartz, Randal L. and Wall, Larry|9781565921498\n2007|O'Reilly Media|Mastering Perl|brian d foy|9780596527242\n2005|Apress|Pro Perl Parsing|Frenz, Christopher M.|9781590595046\n2002|John Wiley &Sons|Perl Database Programming|Michalski, Brent|9780764549564\n1997|O'Reilly Media|Learning Perl on Win32 Systems: Perl Programming in Win32 (Perl Series)|Schwartz, Randal L. and Olson, Erik and Christiansen, Tom|9781565923249\n2017|Packt Publishing|Perl 6 Deep Dive: Data manipulation, concurrency, functional programming, and more|Shitov, Andrew|9781787123458\n2003|In Easy Steps Limited|PERL in easy steps|McGrath, Mike|9781840782608\n2007|Elsevier Inc.|Perl Scripting for Windows Security: Live Response, Forensic Analysis, and Monitoring|Harlan Carvey and Jeremy Faircloth|9781597491730\n2004|O'Reilly Media|Games Diversions & Perl Culture: Best of the Perl Journal|Jon Orwant|9780596003128\n2019|Apress|Perl 6 Quick Syntax Reference: A Pocket Guide to the Language, the Core Modules, and the Community|Merelo, J.J.|9781484249567\n2012|Cambridge University Press|UNIX and Perl to the Rescue!: A Field Guide for the Life Sciences (and Other Data-rich Pursuits)|Bradnam, Keith and Korf, Ian|9780521169820\n2002|O'Reilly Media|Perl Pocket Reference, 4th Edition|Vromans, Johan|9780596003746\n2006|Apress|Pro Perl Debugging: From Professional to Expert (Pro: From Professional to Expert)|Lester, Andy and Foley, Richard|9781430200444\n1991|O'Reilly Media|Programming Perl (Nutshell Handbooks)|Schwartz, Randal L. and Wall, Larry|9780937175644\n1993|O'Reilly Media|Learning Perl (Nutshell Handbooks)|Schwartz, Randal L.|9781565920422\n2020-02-29T00:00:01Z|Apress|Pro Perl Programming: From Professional to Advanced|\"Rothwell, William \"\"Bo\"\"\"|9781484256046\n1999|O'Reilly Media|Writing Apache Modules with Perl and C: The Apache API and mod_perl|MacEachern, Doug and Stein, Lincoln|9781565925670\n2011|Syngress|Perl Scripting for Windows Security: Live Response, Forensic Analysis, and Monitoring|Carvey, Harlan|9780080555638\n2001|Apress|Professional Perl Programming|Simon Cozens|9781861004499\n1996|Sams|Teach Yourself Cgi Programming With Perl 5 in a Week (Teach Yourself Series)|Herrmann, Eric|9781575211961\n2004|Paraglyph Press|Perl Core Language Little Black Book, Second Edition|Steven Holzner|9781932111927\n2004|O'Reilly Media|Perl 6 and Parrot Essentials, Second Edition|Allison Randal and Dan Sugalski and Leopold Toetsch|9780596007379\n1996|Sams|Teach Yourself Perl 5 in 21 Days (Sams Teach Yourself)|Till, David|9780672308949\n2014|Packt Publishing|Penetration Testing with Perl|Berdeaux, Douglas|9781783283453\n2002|Manning Publications|Web Development with Apache and Perl|Peterson, Theo and Petersen, Theo|9781930110069\n2000|O'Reilly Media|Perl 5 Pocket Reference, 3rd Edition: Programming Tools (O'Reilly Perl)|Vromans, Johan and Mui, Linda|9780596000325\n2001|O'Reilly Media|Perl for Web Site Management: HTML Generation, Link Checking, Simple CGI, and More|Callender, John|9781565926479\n2007|Oxford University Press|Perl for Exploring DNA|LeBlanc, Mark D. and Dyer, Betsey Dexter|9780195305890\n2001|Que Publishing|Perl for the Web|Radcliff, Chris|9780735711143\n1997|O'Reilly Media|Perl Resource Kit -- UNIX Edition|Siever, Ellen and Wall, Larry and Jepson, Brian and Futato, David and Patwardhan, Nathan|9781565923706\n2017|Packt Publishing|Perl 6 Deep Dive: Data manipulation, concurrency, functional programming, and more|Shitov, Andrew|9781787282049\n1996|Que Pub|Special Edition Using Perl 5 for Web Programming|Harlan, David and Doyle, Paul and Healy, Matthew D. and Foghlu, Micheal O and Powers, Shelley|9780789706591\n1997|Sams|Web Programming with Perl 5|Middleton, Bill and Deng, Brian and Kemp, Chris|9781575211121\n1999|Prentice Hall|A Little Book on Perl|Sebesta, Robert W.|9780139279553\n2004|Apress|Perl 6 Now: The Core Ideas Illustrated with Perl 5 (Expert's Voice in Open Source)|Walters, Scott|9781590593950\n2000|For Dummies|Perl For Dummies?|Hoffman, Paul|9780764507762\n2015|Lulu Publishing Services|Programming Perl for Geoscientists|Oria San Martin, Dorian|9781483418438\n1997|White Mane Pub. Co|Web Client Programming with Perl|Wong, Clinton|9780942597264\n1999|New Riders Pub|Win32 Perl Programming: The Standard Extensions (The Mtp Windows Nt Professional Reference Series)|Roth, Dave|9781578700677\n1999-07-01T00:00:01Z|Prentice Hall Ptr|Perl Programmer's Interactive Workbook (Interactive Workbook (Prentice Hall))|Lowe, Vincent|9780130208682\n2004|Universal Publishers|On Perl: Perl for Students and Professionals|Kalita, Jugal K.|9781581125504\n1996|Waite Group Pr|Perl 5 How-To|Glover, Mike and Humphreys, Aidan and Weiss, Ed|9781571690586\n1999-02-11T00:00:01Z|O'Reilly Media|Programming Web Graphics with Perl and GNU Softwar|Shawn P. Wallace|9781565924789\n2009-03-20T00:00:01Z|CreateSpace Independent Publishing Platform|Learning PERL the Hard Way: Perl Programming for Beginners|Downey, Allen B.|9781441419033\n1999|O'Reilly Media|Perl in a Nutshell|Ellen Siever and Nathan Patwardhan and Spainhour, Stephen|9781565922860\n2002|Pearson P T R|Modern Perl Programming|Saltzman, Michael|9780130089656\n1998|Hungry Minds Inc|Perl for Dummies|Hoffman, Paul|9780764504600\n2015|Lulu.com|Perl Programming Success In Day|Key, Sam|9781329502239\n1997|John Wiley & Sons Inc|Discover Perl 5 (Discover (Idg Books Worldwide, Inc.).)|Barkakati, Nabajyoti|9780764530760\n1996|Ziff Davis Pr|Programming Perl 5.0 Cgi Web Pages for Microsoft Windows Nt (PC Magazine (New York, N.Y.).)|Hagey, Jonathan|9781562764203\n2010|Springer|An Introduction to Language Processing with Perl and Prolog: An Outline of Theories, Implementation, and Application with Special Consideration of English, French, and German (Cognitive Technologies)|Nugues, Pierre M.|9783642064050\n2019|Independently Published|Perl|Nexcod Publishing|9781076869388\n2022||Programming Perl|Christiansen|9789350236505\n2019-11-21T00:00:01Z|Independently published|PERL PROGRAMMING|Toliver, Felicia|9781710286021\n2003|Tata Mcgraw-hill Education|Perl Programming For Bioinformatics|Harshawardhan P. Bal and Bal|9780070474475\n2005|O'Reilly Media|Extreme Programming with Perl|Nagler, Rob|9780596002664\n|NA|PROGRAMMING PERL 3/E|WALL|9788173662652\n2011T|Pearson Education|Effective Perl Programming 2/e: Ways to Write Better, More Idiomatic Perl|Hall|9788131774250\n1996|John Wiley & Sons Inc|60 Minute Guide to Cgi Programming With Perl 5|Farrell, Robert|9781568847801\n1999|Computing Mcgraw-hill|Perl|Martin C. Brown|9780072121421\n|New Riders|Applied Perl|William Weinman|9781562057343\n20120726|O'Reilly Media, Inc.|Intermediate Perl|Randal L. Schwartz; brian d foy; Tom Phoenix|9781449343804\n2000|San Val|Programming Perl|Larry Wall and Tom Christiansen and Jon Orwant|9781417625642\n20061101|Springer Nature|Pro Perl|Peter Wainwright|9781430200147\n2007|O'reilly Media, Inc.|Mastering Perl|brian d foy|9780596551476\n2001|Wiley|Applied Perl|Peter Williams|9780764547836\n20140109|O'Reilly Media, Inc.|Mastering Perl|brian d foy|9781449364977\n20140109|O'Reilly Media, Inc.|Mastering Perl|brian d foy|9781449364960\n20010718|O'Reilly Media, Inc.|Learning Perl|Tom Phoenix|9780596517953\n||Programming Perl|Larry Wall; Steve Talbot; Randal L. Schwartz; Tom Christiansen|9781565928282\n20080908|BarCharts Inc.|Perl Guide|Scott Marino|9781423208150\n20210629|O'Reilly Media, Inc.|Learning Perl|Randal L. Schwartz; brian d foy; Tom Phoenix|9781492094906\n2012-09-27|Wiley|Beginning Perl|Curtis Poe|9781118235638\n20120217|O'Reilly Media, Inc.|Programming Perl|Tom Christiansen|9781449321475\n20120217|O'Reilly Media, Inc.|Programming Perl|Tom Christiansen; brian d foy; Larry Wall; Jon Orwant|9781449321468\n20140430|Pearson Technology Group|Perl Debugged|Peter Scott|9780133891454\n20161006|O'Reilly Media, Inc.|Learning Perl|Randal L. Schwartz; brian d foy; Tom Phoenix|9781491954270\n20080627|O'Reilly Media, Inc.|Learning Perl|Randal L. Schwartz; Tom Phoenix; brian d foy|9780596154318\n9/4/12|Wiley Professional Development (P&T)|Beginning Perl|Curtis Poe|9781118221877\n20080627|O'Reilly Media, Inc.|Learning Perl|Randal L. Schwartz; Tom Phoenix; brian d foy|9780596551858\n20030821|O'Reilly Media, Inc.|Perl Cookbook|Tom Christiansen; Nathan Torkington|9780596516864\n20100614|Springer Nature|Beginning Perl|James Lee|9781430227946\n20120726|O'Reilly Media, Inc.|Intermediate Perl|Randal L. Schwartz; brian d foy; Tom Phoenix|9781449343811\n20131126|Random House Publishing Services|Perl One-Liners|Peteris Krumins|9781593275693\n2000||Advanced Perl Programming|Sriram Srinivasan / Larry Wall / Tom Christiansen / Ronald Schwartz|9781565925588\n2002|Sams|XML and Perl|Mark Riehl and Ilya Sterin and Llya Sterin|9780735712898\n||Perl Programming Essentials|Software Alchemy|9781114236967\n2000|D D C Pub|Advanced Perl Programming|Rob Roselius|9781562439774\n|Safari Press|Basic Perl Programming|Loy and Marc|9780596526030\n2001|Wrox Press, Inc.|Professional Perl Programming|Peter C. Wainwright and Arthur Corliss and Aldo Calpini and Simon Cozens and J. J. Merelo-Guervos|9780641537356\n20150102|Pearson Technology Group|Perl by Example|Ellie Quigley|9780133593044\n20020719|O'Reilly Media, Inc.|Perl Pocket Reference|Johan Vromans|9780596528942\n||Advanced Perl Programming|Sriram Srinivasan; Andy Oram|9781565928305\n1997|O'Reilly Media, Incorporated|Advanced Perl Programming|Sriram Srinivasan and Andy Oram|9780641500220\n2005||Programming In Perl|Behrouz A. Forouzan and Richard F. Gilberg|9780534376628\n||Advanced Perl Programming|Not Available|9780596002671\n20110719|O'Reilly Media, Inc.|Perl Pocket Reference|Johan Vromans|9781449312978\n20110719|O'Reilly Media, Inc.|Perl Pocket Reference|Johan Vromans|9781449313555\n20050331|Elsevier S & T|Higher-Order Perl|Mark Jason Dominus|9780080478340\n20020425|O'Reilly Media, Inc.|Perl and XML|Erik T. Ray|9780596516406\n20020719|O'Reilly Media, Inc.|Perl Pocket Reference|Johan Vromans|9781449378844\n20021219|O'Reilly Media, Inc.|Perl Graphics Programming|Shawn Wallace|9781449358310\n|Longman Higher Education|Wall:programming Perl 2e||9781565920330\n20021219|O'Reilly Media, Inc.|Perl Graphics Programming|Shawn Wallace|9781449358303\n2011-05-09|Wiley|Perl For Dummies|Paul Hoffman|9781118085189\n20050712|O'Reilly Media, Inc.|Perl Best Practices|Damian Conway|9780596516369\n20170508|O'Reilly Media, Inc.|Think Perl 6|Laurent Rosenfeld; Allen B. Downey|9781491980507\n|McGraw-Hill|Perl 5 complete|Peschko, Ed and DeWolfe, Michele|9780072129144\n20050628|O'Reilly Media, Inc.|Advanced Perl Programming|Simon Cozens|9781449378912\n20020425|O'Reilly Media, Inc.|Perl and XML|Erik T. Ray; Jason McIntosh|9781449366827\n20050628|O'Reilly Media, Inc.|Advanced Perl Programming|Simon Cozens|9780596517113\n20061107|Springer Nature|Pro Perl Parsing|Christopher M. Frenz|9781430200499\n20180824|O'Reilly Media, Inc.|Learning Perl 6|brian d foy|9781491977644\n20050712|O'Reilly Media, Inc.|Perl Best Practices|Damian Conway|9780596555023\n1999|Longhorn Pr|Perl Power!: A Jumpstart Guide To Programming With Perl 5|Michael Schilli|9780201360684\n2000||Programming The Perl Dbi|Alligator Descartes / Tim Bunce|9780641508608\n1998||Cgi Programming With Perl|Ziff-Davis Education|9780737253542\n2000|D D C Pub|Perl Programming (5 Days)|Jeff Howell|9781562439767\n2006|Equity Press|Perl Programming Interview Questions, Answers, And Explanations: Perl Programming Certification Review|Itcookbook|9781933804484\n1999/08/24|Upper Saddle River, N.J. Prentice Hall PTR, c2000.|Perl 5 programmer's notebook|Jesse Feiler|9780130213211\n20021104|O'Reilly Media, Inc.|Computer Science & Perl Programming|Jon Orwant|9781449371357\n2007|Oxford University Press|Perl for exploring DNA|Leblanc, Mark D. , 1962-|9780195327571\n19990818|O'Reilly Media, Inc.|Mastering Algorithms with Perl|Jarkko Hietaniemi|9781449307271\n20061122|Springer Nature|Beginning Perl Web Development|Steve Suehring|9781430200895\n20000204|O'Reilly Media, Inc.|Programming the Perl DBI|Tim Bunce; Alligator Descartes|9781449315368\n19990818|O'Reilly Media, Inc.|Mastering Algorithms with Perl|Jarkko Hietaniemi; John Macdonald; Jon Orwant|9781449307196\n20000629|O'Reilly Media, Inc.|CGI Programming with Perl|Scott Guelich|9781491904664\n20030925|O'Reilly Media, Inc.|Mastering Perl for Bioinformatics|James Tisdall|9781449390907\n20011022|O'Reilly Media, Inc.|Beginning Perl for Bioinformatics|James Tisdall|9780596516277\n2014-12-30|Packt Publishing|Penetration Testing with Perl|Douglas Berdeaux|9781783283460\n|Hoboken, N.J. : Wiley-Liss, c2003.|Perl programming for biologists||9780471722748\n2005-09-27|Wiley|Bioinformatics Biocomputing and Perl|Michael Moorhouse and Paul Barry|9780470026458\n|Cambridge, Ma : O'reilly, 2000.|Programming The Perl Dbi||9781565929753\n20030522|O'Reilly Media, Inc.|Games, Diversions & Perl Culture|Jon Orwant|9781449397784\n20080514|O'Reilly Media, Inc.|Learning Perl Student Workbook|foy, brian d|9781449335205\n2007||Programming The Perl Dbi|Tim Bunce and Jeff Zucker|9780596005863\n20000629|O'Reilly Media, Inc.|CGI Programming with Perl|Scott Guelich; Shishir Gundavaram; Gunther Birznieks|9781449326791\n20030522|O'Reilly Media, Inc.|Games, Diversions & Perl Culture|Jon Orwant|9781449397913\n20020603|O'Reilly Media, Inc.|Perl in a Nutshell|Nathan Patwardhan; Ellen Siever; Stephen Spainhour|9780596516550\n20000204|O'Reilly Media, Inc.|Programming the Perl DBI|Tim Bunce|9781449315917\n20021104|O'Reilly Media, Inc.|Computer Science & Perl Programming|Jon Orwant|9781449371340\n20020603|O'Reilly Media, Inc.|Perl in a Nutshell|Nathan Patwardhan; Ellen Siever; Stephen Spainhour|9781449378820\n20030925|O'Reilly Media, Inc.|Mastering Perl for Bioinformatics|James Tisdall|9781449391553\n1997|O'reilly|Web Client Programming With Perl|Wong, Clinton.|9781565922143\n|Cambridge ; O'reilly, C1997.|Web Client Programming With Perl||9780585032238\n20021219|O'Reilly Media, Inc.|Programming Web Services with Perl|Randy J. Ray; Pavel Kulchenko|9780596516413\n2011-09-20|Wiley|Practical Text Mining with Perl|Roger Bilisoly|9781118210505\n20050714|O'Reilly Media, Inc.|Perl Testing: A Developer's Notebook|Ian Langworth; Chromatic|9781449313081\n20050714|O'Reilly Media, Inc.|Perl Testing: A Developer's Notebook|Ian Langworth|9781449313678\n20020809|Springer Nature|Writing Perl Modules for CPAN|Sam Tregar|9781430211525\n|O'reilly Media|Programming Cocoa Applications With Perl|Sugalski, Dan|9780596003586\n2003-01-10|Wiley|Programming the Network with Perl|Paul Barry|9780470849415\n20030609|O'Reilly Media, Inc.|Learning Perl Objects, References, and Modules|Randal L. Schwartz; Tom Phoenix|9781449365691\n1996|Simon & Schuster|Perl And Cgi Programming Starter Kit|Simon & Schuster|9781575210780\n2001||Perl Programming For The Absolute Beginner|Andy Harris|9780761536635\n1902|Addison-wesley Professional|Programming Perl In The .net Environment|Yevgeny Menaker and Michael Saltzman and Robert J. Oberg|9780130652065\n1998|Wiley & Sons, Incorporated, John|Perl Cgi Programming - No Experience Required|Erik Strom|9780782121575\n20030609|O'Reilly Media, Inc.|Learning Perl Objects, References, and Modules|Randal L. Schwartz|9781449365707\n20120719|Cambridge University Press|UNIX and Perl to the Rescue!|Keith Bradnam; Ian Korf|9781139368575\n20120719|Cambridge University Press|UNIX and Perl to the Rescue!|Keith Bradnam; Ian Korf|9781139365741\n2003|Wiley, John & Sons, Incorporated|Programming for Linguists: Perl for Language|Michael Hammond|9780631234333\n20140316|Emereo|Perl 254 Success Secrets - 254 Most Asked Questions On Perl - What You Need To Know|Janice Randolph|9781488538193\n2015-07-21|Createspace Independent Publishing Platform|Perl Programming Success In A Day: Beginners Guide To Fast, Easy, And Efficient Learning Of Perl Programming|Sam Key|9781515168584\n1997|Macmillan Technical Pub|Perl 5 Windows Nt Programming (using Series)|Mike Mcmillan|9781578700011\n1999|Coriolis Group Books|Perl Programming For Nt Blue Book: The Quickest Path To Expertise In Nt Administration Scripting Using Perl|Michael Mcmillan and James Sutherland|9781576104040\n1999|O'reilly|Writing Apache Modules With Perl And C|Stein, Lincoln D. , 1960-|9781565925670\n2000|Mcgraw-hill Professional|Perl Developer's Guide (book/cd-rom Package)|Ed S. Peschko and Ed Peschko and Michele Dewolfe and Michelle DeWolfe|9781402854194\n2003|APRESS|Real World SQL Server Administration with Perl|Linchi Shea|9781590590973\n1996||Using Perl 5 For Web Programming, Special Edition||9780641024894\n2000||Tuomas J. Lukka's Object-oriented Programming In Perl|Tuomas J. Lukka|9781893115033\n2002||Perl Programming For Biologists: Hands-on Tools For Bioinformatics|Unknown|9781891786143\n2012|Createspace Independent Publishing Platform|Perl Programming Interview Questions You'll Most Likely Be Asked|Vibrant Publishers|9781475188387\n2011|Xlibris Corporation 9/27/2011|Scientific Database And Programming Examples Using Php, Mysql, Xml, Matlab, Python, Perl: Using Php, Mysql, Xml, Matlab, Python, Perl (paperback Or Softback)|Cheung and K. Y.|9781465364432\nJuly 2000||Relational Database Programming for the Web with Perl and CGI|Brian Shensky|9780201432954\n2008-05-15|Wiley Global Research (STMS)|Scripting with Objects: A Comparative Presentation of Object-Oriented Scripting with Perl and Python|Avinash C. Kak|9781119095095\n2012|Cambridge University Press|Unix And Perl To The Rescue!: A Field Guide For The Life Sciences (and Other Data-rich Pursuits)|Bradnam, Keith.|9780521169820\n2001||Open Source: The Wiki Way: Quick Collaboration On The Web, Postgresql: Introduction And Concepts And Network Programming With Perl Package|Momjian|9780201787719\n2010||Array Programming Languages: FORTRAN, APL, Gnu Octave, J, Mathematica, MATLAB, Nial, Scilab, IDL, Supercollider, K, Numpy, Perl Data Language|Books and LLC and Group|9781157458708\n|Springer Berlin Heidelberg,|An Introduction To Language Processing With Perl And Prolog: An Outline Of Theories, Implementation, And Application With Special Consideration Of English, French, And German|Nugues, Pierre M. (author.)|9783540250319", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2002|Programming for Linguists: Perl for Language Researchers|10.1002/9780470752234|20|0|Michael Hammond|008fce82b00d157447e1432559aa9193d8986bf9\n2014|Perldoop: Efficient execution of Perl scripts on Hadoop clusters|10.1109/BigData.2014.7004303|6|0|J. Abuín and J. C. Pichel and T. F. Pena and Pablo Gamallo and Marcos Garcia|a1139332895dd8827f2152413f66c2f6a5918bf8\n2015|Quantitative Linguistic Computing with Perl|10.1080/07268602.2015.1004657|3|0|Haoda Feng|fa316f617c3256ec4ee95c7fbb41fe488e42c217\n2005|VECT: an automatic visual Perl programming tool for nonprogrammers.|10.2144/05384RR02|2|0|Hui-Hsien Chou|06a478a88dc7d47277addc1d648ab7f3e749af0a\n2020|A newly developed free software tool set for averaging electroencephalogram implemented in the Perl programming language|10.1016/j.heliyon.2020.e05580|2|0|S. Suwazono and H. Arao|fca6d512fc3434c39663f289f7df06a403553dac\n2011|Joint Application of Perl Scripts and MCNPX in Solving the Dynamic-Geometry Related Problems in Proton Beam Radiotherapy (Selected Papers of the Joint International Conference of Supercomputing in Nuclear Applications and Monte Carlo : SNA + MC 2010)|10.15669/pnst.2.176|1|0|F. Guan and J. Poston and L. Braby|e28e642649d133b7f2f861a256c63b2d620c91b0\n2019|Running Perl 6|10.1007/978-1-4842-4956-7_1|1|0|J. Merelo|2146c6d9a24fd20503e7db406799eefa6ff0ae47\n2004|PERL PROGRAMMING FOR BIOLOGISTS, by D. Curtis Jamison, Wiley, Hoboken, 2003, ISBN 0-471-43059-5, ix + 191 pp. (Pbk, £27.95)|10.1017/S0263574704210943|1|0|A. Andrew|014606001ea7425a185967570b2c8711ed3fb42d\n2006|A Study on Perl Programming Language Aided Informetrics|10.11925/INFOTECH.1003-3513.2006.07.10|1|0|Chen Xin Chen Tun|c01b9d1786913352f097df4f480d04d5d8a9b222" }, "petr": { "title": "Petr", "appeared": 1999, "type": "pl", "description": "Czech visual language for kids, created in 1999, written by developer who was cheated by author of Baltik and Baltazar.", "reference": [ "http://www.gemtree.com/peter.htm" ], "country": [ "Czech Republic" ], "nativeLanguage": "Czech", "originCommunity": [ "Gemtree Software, s.r.o" ], "visualParadigm": true, "semanticScholar": "" }, "pfort": { "title": "PFORT", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2fe4c371d137b510524ae2d8443787d19672810f" ], "country": [ "United States" ], "originCommunity": [ "Bell Laboratories" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8104", "centralPackageRepositoryCount": 0 }, "pfortran": { "title": "Pfortran", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bf0a0806fbbdd165123c9791eb41445391dc122f" ], "country": [ "United States" ], "originCommunity": [ "Pennsylvania State University", "University of Houston" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1703", "centralPackageRepositoryCount": 0 }, "pgbouncer": { "title": "PgBouncer", "appeared": 2007, "type": "application", "creators": [ "Frank McGeough" ], "description": "PgBouncer is an open-source, lightweight, single-binary connection pooler for PostgreSQL. It can pool connections to one or more databases (on possibly different servers) and serve clients over TCP and Unix domain socket.", "website": "https://www.pgbouncer.org/", "documentation": [ "https://www.pgbouncer.org/faq.html" ], "reference": [ "https://wiki.postgresql.org/wiki/PgBouncer" ], "country": [ "unknown" ], "originCommunity": [ "https://github.com/pgbouncer/pgbouncer" ], "domainName": { "name": "pgbouncer.org" }, "related": [ "c", "postgresql", "sql", "plpgsql" ], "githubRepo": { "stars": 18000, "forks": 348, "updated": 2022, "description": "Lightweight connection pooler for PostgreSQL", "issues": 141, "url": "https://github.com/pgbouncer/pgbouncer" }, "isOpenSource": true }, "pgen": { "title": "PGen", "appeared": 2015, "type": "grammarLanguage", "reference": [ "http://python-history.blogspot.com/2018/05/the-origins-of-pgen.html" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/python" ] }, "pgm-format": { "title": "Netpbm grayscale image format", "appeared": 1988, "type": "textDataFormat", "description": "The PGM format is a lowest common denominator grayscale file format. It is designed to be extremely easy to learn and write programs for. (It's so simple that most people will simply reverse engineer it because it's easier than reading this specification).", "reference": [ "https://en.wikipedia.org/wiki/Netpbm_format" ], "country": [ "Unknown" ], "originCommunity": [ "https://netpbm.sourceforge.net/history.html" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "P2\n# feep.pgm\n24 7\n15\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 3 3 3 3 0 0 7 7 7 7 0 0 11 11 11 11 0 0 15 15 15 15 0\n0 3 0 0 0 0 0 7 0 0 0 0 0 11 0 0 0 0 0 15 0 0 15 0\n0 3 3 3 0 0 0 7 7 7 0 0 0 11 11 11 0 0 0 15 15 15 15 0\n0 3 0 0 0 0 0 7 0 0 0 0 0 11 0 0 0 0 0 15 0 0 0 0\n0 3 0 0 0 0 0 7 7 7 7 0 0 11 11 11 11 0 0 15 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0" ] }, "pgolog": { "title": "pGOLOG", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b39312ed8f28002bb4da91edafb6c8c8d67add38" ], "country": [ "Germany" ], "originCommunity": [ "Aachen University of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2952", "centralPackageRepositoryCount": 0 }, "pgql": { "title": "pgql", "appeared": 2016, "type": "pl", "website": "http://pgql-lang.org", "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ], "domainName": { "registered": 2016, "awisRank": { "2022": 7505312 }, "name": "pgql-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n12353993|Property Graph Query Language|http://pgql-lang.org/|2016-08-24 18:09:08 UTC|1472062148|stunksys|1|4" }, "pharen": { "title": "Pharen", "appeared": 2009, "type": "pl", "creators": [ "Tamreen Khan" ], "website": "http://www.pharen.org", "fileExtensions": [ "phn" ], "country": [ "United States" ], "originCommunity": [ "http://github.com/scriptor/pharen/issues" ], "compilesTo": [ "php" ], "githubRepo": { "stars": 216, "forks": 31, "subscribers": 17, "updated": 2018, "description": "Lisp to PHP Compiler", "url": "https://github.com/scriptor/pharen/" }, "repoStats": { "firstCommit": 2009, "commits": 1190, "committers": 17, "files": 58 } }, "pharo": { "title": "Pharo", "appeared": 2008, "type": "pl", "description": "Pharo is a pure object-oriented programming language and a powerful environment, focused on simplicity and immediate feedback (think IDE and OS rolled into one).", "website": "https://pharo.org/", "reference": [ "https://fosdem.org/2020/schedule/event/pharominimalrefllangkernels/" ], "cheatSheetUrl": [ "http://files.pharo.org/media/pharoCheatSheet.pdf" ], "country": [ "France" ], "originCommunity": [ "https://consortium.pharo.org" ], "domainName": { "registered": 2008, "awisRank": { "2022": 745957 }, "name": "pharo.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "crLog" ] ], "stringToken": [ [ "'" ] ], "example": [ "Object subclass: #Counter\n instanceVariableNames: ’count initialValue’\n classVariableNames: ’’\n package: ’MyCounter’" ], "wikipedia": { "related": [ "smalltalk", "linux", "squeak", "newspeak", "visualworks" ], "summary": "Pharo is an open source dynamic and reflective language inspired from the programming language and integrated development environment (IDE) Smalltalk. Pharo offers strong live programming features such as immediate object manipulation, live update and hot recompiling. The live programming environment is at the heart of the system.", "pageId": 23490878, "created": 2009, "backlinksCount": 62, "revisionCount": 189, "dailyPageViews": 72, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Pharo" }, "leachim6": { "filepath": "p/Pharo.st", "fileExtensions": [ "st" ], "example": [ "'Hello World' crLog" ], "id": "Pharo" }, "twitter": "https://twitter.com/pharoproject", "jupyterKernel": [ "https://github.com/jmari/JupyterTalk" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010|Square Bracket Associates|Pharo by Example|Nierstrasz, Oscar and Ducasse, Stéphane and Pollet, Damien|9783952334140\n20211127|Springer Nature|Agile Visualization with Pharo|Alexandre Bergel|9781484271612", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Asking and Answering Questions during a Programming Change Task in Pharo Language|10.1145/2688204.2688212|34|3|Juraj Kubelka and Alexandre Bergel and R. Robbes|8b29476f63f39b3c259c9844f84f1bc17e5f56ca\n2011|PHANtom: a modern aspect language for Pharo Smalltalk|10.1145/2166929.2166939|10|1|J. Fabry and Daniel Galdames|dda4fc4ab5d99522fb446c6fd202ba415f343ee8\n2020|What do class comments tell us? An investigation of comment evolution and practices in Pharo|10.1007/s10664-021-09981-5|6|0|Pooja Rani and Sebastiano Panichella and Manuel Leuenberger and Mohammad Ghafari and Oscar Nierstrasz|86bec3144af8d6996df358369e9f1765c7883b9f\n2016|ViennaTalk and Assertch: Building Lightweight Formal Methods Environments on Pharo 4|10.1145/2991041.2991045|5|1|T. Oda and K. Araki and P. Larsen|7382a96489af88c7a8cbba64eb5948fd1e68736a\n2016|Lowcode: Extending Pharo with C Types to Improve Performance|10.1145/2991041.2991064|2|0|R. Salgado and Stéphane Ducasse|241acd16e41e359c3ce03ac281dba8d219146585\n2012|Generic Programming in Pharo|10.1007/978-3-642-45404-2_5|2|0|Alexandre Bergel and Lorenzo Bettini|aebd8d0dd6b369bdec036c65ece65996290e66a1\n2016|Phorms: Pattern Combinator Library for Pharo|10.1145/2991041.2991057|2|0|M. Rizun and Stéphane Ducasse and Gustavo Santos and Camille Teruel|88e8ed83a5fe49bf2132323d320b75c3449e8a58" }, "phel": { "title": "Phel", "appeared": 2020, "type": "pl", "creators": [ "Jens Haase" ], "website": "https://phel-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/phel-lang" ], "domainName": { "registered": 2020, "name": "phel-lang.org" }, "compilesTo": [ "php" ], "example": [ " (ns hello-world\\boot)\n\n (println \"Hello, World!\")" ], "githubRepo": { "firstCommit": 2020, "stars": 271, "forks": 10, "subscribers": 8, "created": 2020, "updated": 2022, "description": "Phel is a functional programming language that compiles to PHP. It is a dialect of Lisp inspired by Clojure and Janet.", "issues": 16, "url": "https://github.com/phel-lang/phel-lang" }, "repoStats": { "firstCommit": 2020, "commits": 1888, "committers": 19, "files": 795 }, "twitter": "https://twitter.com/phel_lang", "semanticScholar": "" }, "phigs": { "title": "PHIGS", "appeared": 1988, "type": "library", "country": [ "United States and Switzerland" ], "originCommunity": [ "American National Standards Institute", "Federal Information Processing Standards", "International Organization for Standardization", "International Electrotechnical Commission" ], "related": [ "opengl" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/PHIGS" } }, "phocus": { "title": "PHOCUS", "appeared": 1987, "type": "pl", "description": "An object-oriented Prolog-like language.", "reference": [ "https://semanticscholar.org/paper/5ad3456657e84641d8539fb31ff9d4ecab1176c3" ], "country": [ "Germany" ], "originCommunity": [ "Experimental and Clinical Research Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1350", "centralPackageRepositoryCount": 0 }, "phoenix-object-basic": { "title": "Phoenix Object Basic", "appeared": 2001, "type": "pl", "country": [ "United States and The Netherlands" ], "originCommunity": [ "CIMLINC, Inc", "Janus Software" ], "wikipedia": { "related": [ "linux", "python", "perl", "visual-basic" ], "summary": "Phoenix Object Basic is an object-oriented rapid application development tool for Linux. It has object-oriented features such as inheritance and polymorphism as found in languages such as Python and Perl. It also features a similar design environment and compatible syntax to Visual Basic reducing the learning curve for those making a transition from that language to Linux programming. Phoenix includes a full implementation of the BASIC programming language. It was released for download in 2001 and the Linux package is at version 1.5 beta 6 (released October 2004), it also requires the distribution of a small number of runtime library files with complied applications. Phoenix Object Basic is a proprietary tool for cross-platform Linux and Windows application development. Key attributes: No longer being actively developed Rapid Application Development for Windows and Linux Short learning curve for VB developers Object-oriented Small executables, Fast execution Cross platform Released as an RPMThe Phoenix source code is not available because it contains proprietary third party components. Phoenix is free of charge and freely distributable.", "created": 2002, "backlinksCount": 10, "pageId": 152748, "revisionCount": 28, "dailyPageViews": 3, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Phoenix_Object_Basic" }, "centralPackageRepositoryCount": 0 }, "phorth": { "title": "phorth", "appeared": 2016, "type": "pl", "creators": [ "Joe Jevnik" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/llllllllll/phorth/issues" ], "githubRepo": { "firstCommit": 2016, "stars": 48, "forks": 3, "subscribers": 1, "created": 2016, "updated": 2022, "description": "A small forth-like language that targets the CPython VM.", "issues": 0, "url": "https://github.com/llllllllll/phorth" }, "repoStats": { "firstCommit": 2016, "commits": 13, "committers": 1, "files": 17 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n13445357|Show HN: Phorth – A Forth-like language on the Python VM|2017-01-20 17:33:17 UTC|1484933597|joejev|14|62" }, "php": { "title": "PHP", "appeared": 1995, "type": "pl", "demoVideo": [ "https://www.youtube.com/watch?v=ZdP0KM49IVk" ], "creators": [ "Rasmus Lerdorf" ], "website": "https://php.net", "documentation": [ "https://devdocs.io/php/", "https://www.php.net/docs.php." ], "emailList": [ "https://www.php.net/mailing-lists.php" ], "spec": "https://phplang.org/", "reference": [ "http://php.net/manual/en/reserved.keywords.php" ], "standsFor": "Personal Home Page", "fileExtensions": [ "php", "phtml", "php3", "php4", "php5", "php7", "phps" ], "country": [ "Canada" ], "originCommunity": [ "Zend" ], "domainName": { "registered": 1997, "awisRank": { "2017": 935, "2022": 1353 }, "name": "php.net" }, "releaseNotesUrl": "https://www.php.net/releases/index.php", "proposals": "https://wiki.php.net/rfc", "visualParadigm": false, "hasBooleans": { "example": "", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasMagicGettersAndSetters": { "example": " public function __set($name, $value)\n {\n echo \"Setting '$name' to '$value'\\n\";\n $this->data[$name] = $value;\n }\n\n public function __get($name)\n {\n echo \"Getting '$name'\\n\";\n if (array_key_exists($name, $this->data)) {\n return $this->data[$name];\n }\n\n $trace = debug_backtrace();\n trigger_error(\n 'Undefined property via __get(): ' . $name .\n ' in ' . $trace[0]['file'] .\n ' on line ' . $trace[0]['line'],\n E_USER_NOTICE);\n return null;\n }", "value": true }, "hasComments": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": true }, "hasHereDocs": { "example": "", "value": true }, "hasTernaryOperators": { "example": "firstName = $firstName;\n $this->lastName = $lastName;\n }\n\n public function greet(): string {\n return 'Hello, my name is ' . $this->firstName .\n (($this->lastName != '') ? (' ' . $this->lastName) : '') . '.';\n }\n\n public static function staticGreet(string $firstName, string $lastName) {\n return 'Hello, my name is ' . $firstName . ' ' . $lastName . '.';\n }\n}\n\n$he = new Person('John', 'Smith');\n$she = new Person('Sally', 'Davis');\n$other = new Person('iAmine');\n\necho $he->greet(); // prints \"Hello, my name is John Smith.\"\necho '
';\n\necho $she->greet(); // prints \"Hello, my name is Sally Davis.\"\necho '
';\n\necho $other->greet(); // prints \"Hello, my name is iAmine.\"\necho '
';\n\necho Person::staticGreet('Jane', 'Doe'); // prints \"Hello, my name is Jane Doe.\"" ], "related": [ "c", "hhvm", "parrot-vm", "java", "perl", "tcl", "falcon", "hack", "html", "x86-isa", "unicode", "wordpress", "json", "mysql", "mime", "javascript", "xml", "parrot-internal-representation", "cil", "ftp", "postgresql", "sqlite", "aws", "java-server-pages", "linux", "python", "mediawiki", "drupal" ], "summary": "PHP is a server-side scripting language designed primarily for web development but also used as a general-purpose programming language. Originally created by Rasmus Lerdorf in 1994, the PHP reference implementation is now produced by The PHP Development Team. PHP originally stood for Personal Home Page, but it now stands for the recursive acronym PHP: Hypertext Preprocessor. PHP code may be embedded into HTML or HTML5 markup, or it can be used in combination with various web template systems, web content management systems and web frameworks. PHP code is usually processed by a PHP interpreter implemented as a module in the web server or as a Common Gateway Interface (CGI) executable. The web server software combines the results of the interpreted and executed PHP code, which may be any type of data, including images, with the generated web page. PHP code may also be executed with a command-line interface (CLI) and can be used to implement standalone graphical applications. The standard PHP interpreter, powered by the Zend Engine, is free software released under the PHP License. PHP has been widely ported and can be deployed on most web servers on almost every operating system and platform, free of charge. The PHP language evolved without a written formal specification or standard until 2014, leaving the canonical PHP interpreter as a de facto standard. Since 2014 work has gone on to create a formal PHP specification.", "pageId": 24131, "dailyPageViews": 3151, "created": 2001, "backlinksCount": 7839, "revisionCount": 10104, "appeared": 1994, "fileExtensions": [ "php", "phtml", "php3", "php4", "php5", "php7", "phps" ], "url": "https://en.wikipedia.org/wiki/PHP" }, "githubLanguage": { "fileExtensions": [ "php", "aw", "ctp", "fcgi", "inc", "php3", "php4", "php5", "phps", "phpt" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nfzaninotto Faker https://github.com/fzaninotto.png https://github.com/fzaninotto/Faker PHP #4F5D95 21754 2507 375 \"Faker is a PHP library that generates fake data for you\"\nlaravel laravel https://github.com/laravel.png https://github.com/laravel/laravel PHP #4F5D95 54813 16809 929 \"A PHP framework for web artisans\"\nlaravel framework https://github.com/laravel.png https://github.com/laravel/framework PHP #4F5D95 18676 6774 463 \nmonicahq monica https://github.com/monicahq.png https://github.com/monicahq/monica PHP #4F5D95 7726 935 302 \"Personal CRM. Remember everything about your friends and family.\"\nmautic mautic https://github.com/mautic.png https://github.com/mautic/mautic PHP #4F5D95 3421 1236 88 \"Mautic: Open Source Marketing Automation Software.\"\ndanielmiessler SecLists https://github.com/danielmiessler.png https://github.com/danielmiessler/SecLists PHP #4F5D95 19907 8011 550 \"SecLists is the security tester's companion. It's a collection of multiple types of lists used during security assessments, collected in one place. List types include usernames, passwords, URLs, sensitive data patterns, fuzzing payloads, web shells, and many more.\"\nthe-benchmarker web-frameworks https://github.com/the-benchmarker.png https://github.com/the-benchmarker/web-frameworks PHP #4F5D95 2932 243 204 \"Which is the fastest web framework?\"\nSeldaek monolog https://github.com/Seldaek.png https://github.com/Seldaek/monolog PHP #4F5D95 15663 1570 315 \"Sends your logs to files, sockets, inboxes, databases and various web services\"\nfirefly-iii firefly-iii https://github.com/firefly-iii.png https://github.com/firefly-iii/firefly-iii PHP #4F5D95 2718 426 130 \"Firefly III: a personal finances manager\"\neasy-swoole easyswoole https://github.com/easy-swoole.png https://github.com/easy-swoole/easyswoole PHP #4F5D95 2336 365 282 \"High performance Coroutine PHP Framework, base on Swoole\"\nPrestaShop PrestaShop https://github.com/PrestaShop.png https://github.com/PrestaShop/PrestaShop PHP #4F5D95 3922 3305 77 \"PrestaShop offers a fully scalable open source ecommerce solution.\"\nakaunting akaunting https://github.com/akaunting.png https://github.com/akaunting/akaunting PHP #4F5D95 2097 797 137 \"Free and Online Accounting Software\"\nphacility phabricator https://github.com/phacility.png https://github.com/phacility/phabricator PHP #4F5D95 10942 1385 116 \"Open software engineering platform and fun adventure game\"\nyiisoft yii2 https://github.com/yiisoft.png https://github.com/yiisoft/yii2 PHP #4F5D95 13073 6810 94 \"Yii 2: The Fast, Secure and Professional PHP Framework\"\nswoft-cloud swoft https://github.com/swoft-cloud.png https://github.com/swoft-cloud/swoft PHP #4F5D95 3829 590 447 \"🚀 PHP Microservice Full Coroutine Framework\"\nelastic elasticsearch-php https://github.com/elastic.png https://github.com/elastic/elasticsearch-php PHP #4F5D95 3510 712 106 \"Official PHP low-level client for Elasticsearch.\"\nelementor elementor https://github.com/elementor.png https://github.com/elementor/elementor PHP #4F5D95 2505 632 81 \"The most advanced frontend drag & drop page builder. Create high-end, pixel perfect websites at record speeds. Any theme, any page, any design.\"\nopencart opencart https://github.com/opencart.png https://github.com/opencart/opencart PHP #4F5D95 5040 3838 87 \"A free shopping cart system. OpenCart is an open source PHP-based online e-commerce solution.\"\ntymondesigns jwt-auth https://github.com/tymondesigns.png https://github.com/tymondesigns/jwt-auth PHP #4F5D95 8258 1047 134 \"🔐 JSON Web Token Authentication for Laravel & Lumen\"\nlaravel cashier https://github.com/laravel.png https://github.com/laravel/cashier PHP #4F5D95 1655 411 41 \nmagento magento2 https://github.com/magento.png https://github.com/magento/magento2 PHP #4F5D95 7806 6717 128 \"All Submissions you make to Magento Inc. (\"\"Magento\"\") through GitHub are subject to the following terms and conditions: (1) You grant Magento a perpetual, worldwide, non-exclusive, no charge, royalty free, irrevocable license under your applicable copyrights and patents to reproduce, prepare derivative works of, display, publically perform, subli…\"\ntennc webshell https://github.com/tennc.png https://github.com/tennc/webshell PHP #4F5D95 4829 3617 191 \"This is a webshell open source project\"\narea17 twill https://github.com/area17.png https://github.com/area17/twill PHP #4F5D95 1507 162 119 \"Twill is an open source CMS toolkit for Laravel that helps developers rapidly create a custom admin console that is intuitive, powerful and flexible. Chat with us and others on Spectrum! https://spectrum.chat/twill\"\nhyperf-cloud hyperf https://github.com/hyperf-cloud.png https://github.com/hyperf-cloud/hyperf PHP #4F5D95 1186 167 366 \"🚀 A coroutine framework that focuses on hyperspeed and flexibility, specifically used for build microservices or middlewares.\"\ncomposer composer https://github.com/composer.png https://github.com/composer/composer PHP #4F5D95 20839 5592 354 \"Dependency Manager for PHP\"", "trendingProjectsCount": 26, "type": "programming", "filenames": [ ".php", ".php_cs", ".php_cs.dist", "Phakefile" ], "interpreters": [ "php" ], "aceMode": "php", "codemirrorMode": "php", "codemirrorMimeType": "application/x-httpd-php", "tmScope": "text.html.php", "aliases": [ "inc" ], "repos": 3479326, "id": "PHP" }, "githubBigQuery": { "repos": 339509, "users": 202442, "id": "PHP" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/php", "monaco": "php", "codeMirror": "php", "pygmentsHighlighter": { "filename": "php.py", "fileExtensions": [ "php", "php[345]", "inc" ], "id": "PHP" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 28, "commitCount": 509, "sampleCount": 15, "example": [ "#!/usr/bin/php\n" ], "leachim6": { "filepath": "p/PHP.php", "fileExtensions": [ "php" ], "example": [ "\n \n example from Prof. Joe Felsenstein's book \"Inferring Phylogenies\"\n MrBayes based on MAFFT alignment\n \n \n 0.88\n \n A\n \n \n B\n \n \n \n C\n \n \n \n" ], "wikipedia": { "example": [ "\n \n example from Prof. Joe Felsenstein's book \"Inferring Phylogenies\"\n MrBayes based on MAFFT alignment\n \n \n 0.88\n \n A\n \n \n B\n \n \n \n C\n \n \n \n " ], "related": [ "xml", "nexus-format", "newick-format" ], "summary": "PhyloXML is an XML language for the analysis, exchange, and storage of phylogenetic trees (or networks) and associated data. The structure of phyloXML is described by XML Schema Definition (XSD) language. A shortcoming of current formats for describing phylogenetic trees (such as Nexus and Newick/New Hampshire) is a lack of a standardized means to annotate tree nodes and branches with distinct data fields (which in the case of a basic species tree might be: species names, branch lengths, and possibly multiple support values). Data storage and exchange is even more cumbersome in studies in which trees are the result of a reconciliation of some kind: gene-function studies (requires annotation of nodes with taxonomic information as well as gene names, and possibly gene-duplication data) evolution of host-parasite interactions (requires annotation of tree nodes with taxonomic information for both host and parasite) phylogeographic studies (requires annotation of tree nodes with taxonomic and geographic information)To alleviate this, a variety of ad-hoc, special purpose formats have come into use (such as the NHX format, which focuses on the needs of gene-function and phylogenomic studies). A well defined XML format addresses these problems in a general and extensible manner and allows for interoperability between specialized and general purpose software. An example of a program for visualizing phyloXML is Archaeopteryx.", "pageId": 21356135, "created": 2009, "backlinksCount": 12, "revisionCount": 42, "dailyPageViews": 6, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/PhyloXML" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "physictran": { "title": "PHYSICTRAN", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2788136771757c8c046bafad9afec0ba8a88183e" ], "country": [ "France" ], "originCommunity": [ "French Ministry of Defence Computing Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5472", "centralPackageRepositoryCount": 0 }, "pi-calculus": { "title": "Pi Calculus", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fa025cfbd3e988186e561e538ea1c2edf7b35454" ], "country": [ "France" ], "originCommunity": [ "Laboratoire de l'Informatique du Parallélisme" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6813", "centralPackageRepositoryCount": 0 }, "pic-microcontroller": { "title": "PIC microcontroller", "appeared": 1975, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Microchip Technology, Inc" ], "wikipedia": { "related": [ "c", "mips", "flowcode", "basic-stamp", "atmel-avr", "arduino", "msp430" ], "summary": "PIC (usually pronounced as \"pick\") is a family of microcontrollers made by Microchip Technology, derived from the PIC1650 originally developed by General Instrument's Microelectronics Division. The name PIC initially referred to Peripheral Interface Controller, then it was corrected as Programmable Intelligent Computer. The first parts of the family were available in 1976; by 2013 the company had shipped more than twelve billion individual parts, used in a wide variety of embedded systems. Early models of PIC had read-only memory (ROM) or field-programmable EPROM for program storage, some with provision for erasing memory. All current models use flash memory for program storage, and newer models allow the PIC to reprogram itself. Program memory and data memory are separated. Data memory is 8-bit, 16-bit, and, in latest models, 32-bit wide. Program instructions vary in bit-count by family of PIC, and may be 12, 14, 16, or 24 bits long. The instruction set also varies by model, with more powerful chips adding instructions for digital signal processing functions. The hardware capabilities of PIC devices range from 6-pin SMD, 8-pin DIP chips up to 144-pin SMD chips, with discrete I/O pins, ADC and DAC modules, and communications ports such as UART, I2C, CAN, and even USB. Low-power and high-speed variations exist for many types. The manufacturer supplies computer software for development known as MPLAB X, assemblers and C/C++ compilers, and programmer/debugger hardware under the MPLAB and PICKit series. Third party and some open-source tools are also available. Some parts have in-circuit programming capability; low-cost development programmers are available as well as high-production programmers. PIC devices are popular with both industrial developers and hobbyists due to their low cost, wide availability, large user base, extensive collection of application notes, availability of low cost or free development tools, serial programming, and re-programmable Flash-memory capability.", "created": 2018, "backlinksCount": 127, "pageId": 184588, "revisionCount": 1, "dailyPageViews": 138, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/PIC_microcontroller" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "pic": { "title": "PIC", "appeared": 1988, "type": "textMarkup", "country": [ "United States" ], "originCommunity": [ "Bell labs" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "related": [ "diagram", "troff", "tex", "linux" ], "summary": "In computing, Pic is a domain-specific programming language by Brian Kernighan for specifying diagrams in terms of objects such as boxes with arrows between them. The pic compiler translates this description into concrete drawing commands. Pic is a procedural programming language, with variable assignment, macros, conditionals, and looping. The language is an example of a little language originally intended for the comfort of non-programmers in the Unix environment (Bentley 1988). Pic was first implemented, and is still most typically used, as a preprocessor in the troff document processing system. The pic preprocessor filters a troff document, replacing diagram descriptions by concrete drawing commands, and passing the rest of the document through without change. A version of pic is included in groff, the GNU version of troff. GNU pic can also act as a preprocessor for TeX documents, emitting its own tpic DVI specials, which aren't as widely supported as those of other TeX drivers (like PostScript). Arbitrary diagram text can be included for formatting by the word processor to which the pic output is directed, and arbitrary post-processor commands can also be included. Dwight Aplevich's implementation, DPIC, can also generate postscript or svg images by itself, as well as act as a preprocessor. The three principal sources of pic processors are GNU pic, found on many Linux systems, and dpic, both of which are free, and the original AT&T pic. Pic has some similarity with MetaPost and the DOT language.", "pageId": 8033525, "created": 2017, "backlinksCount": 19, "revisionCount": 1, "dailyPageViews": 1, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/Pic_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "pic", "chem" ], "trendingProjectsCount": 0, "type": "markup", "group": "Roff", "aceMode": "text", "codemirrorMode": "troff", "codemirrorMimeType": "text/troff", "tmScope": "source.pic", "repos": 0, "id": "Pic" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 3, "commitCount": 351, "sampleCount": 3, "example": [ "# Dextroamphetamine molecule\n.cstart\n\t.ps 26\n\tsize 28\nR1:\n\tring double 1,2 3,4 5,6\n\tbond 60 from R1.V2\n\tbond 120\nA1:\n\tfront bond down ; CH3\n\tbond 60 from A1 ; NH2\n\t.ps\n.cend\n" ], "url": "https://github.com/Alhadis/language-roff" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1007", "fileType": "text", "wordRank": 2402, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2004|Cengage Learning|PIC Microcontroller: An Introduction to Software & Hardware Interfacing|Huang, Han-Way and Chartrand, Leo|9781401839673\n2009|Newnes|Designing Embedded Systems with PIC Microcontrollers: Principles and Applications|Wilmshurst, Tim|9781856177504\n2011|Newnes|PIC Microcontrollers: An Introduction to Microelectronics|Bates, Martin P.|9780080969114\n2013|Newnes|Designing Embedded Systems with 32-Bit PIC Microcontrollers and MikroC|Ibrahim, Dogan|9780080977867\n2006|Newnes|Designing Embedded Systems with PIC Microcontrollers: Principles and Applications|Wilmshurst, Tim|9780750667555\n2008|Newnes|Advanced PIC Microcontroller Projects In C: From USB to RTOS With the PIC1 8f Series|Ibrahim, Dogan|9780750686112\n1997|Newnes|Microcontroller Cookbook: PIC and 8051|James, Mike|9780750627016\n2017|Apress|Programming PIC Microcontrollers with XC8|Subero, Armstrong|9781484232729\n2007|Newnes|Programming 16-Bit PIC Microcontrollers in C: Learning to Fly the PIC 24 (Embedded Technology)|Di Jasio, Lucio|9780750682923\n2007|Newnes|PIC Microcontrollers: Know It All (Newnes Know It All)|Di Jasio, Lucio and Wilmshurst, Tim and Ibrahim, Dogan and Morton, John and Bates, Martin P. and Smith, Jack and Smith, David W and Hellebuyck, Chuck|9780750686150\n2010|Newnes|SD Card Projects Using the PIC Microcontroller|Ibrahim, Dogan|9781856177191\n2008|CreateSpace Independent Publishing Platform|Beginner's Guide To Embedded C Programming: Using The Pic Microcontroller And The Hitech Picc-Lite C Compiler|Hellebuyck, Chuck|9781438231594\n2003|Delmar Cengage Learning|Embedded C Programming and the Microchip PIC|Barnett, Richard H. and Cox, Sarah and O'Cull, Larry|9781401837488\n2010|Amer Radio Relay League|ARRL'S PIC Programming for Beginners (Softcover)|arrl|9780872590892\n2009|Newnes|Designing Embedded Systems with PIC Microcontrollers: Principles and Applications|Wilmshurst, Tim|9780080961842\n2014|Newnes|Embedded C Programming: Techniques and Applications of C and PIC MCUS|Siegesmund, Mark|9780128014707\n2019-12-10T00:00:01Z|Apress|C Programming for the PIC Microcontroller: Demystify Coding with Embedded Programming|Ward, Hubert Henry|9781484255247\n2013|Newnes|PIC Projects and Applications using C: A Project-based Approach|Smith, David W|9780080971513\n2007|Prentice Hall|PIC Microcontroller|Mazidi, Muhammad Ali and McKinlay, Rolin D. and Causey, Danny|9780131194045\n2011|Newnes|Programming 16-Bit PIC Microcontrollers in C: Learning to Fly the PIC 24|Di Jasio, Lucio|9781856178709\n2008|Newnes|Programming 8-bit PIC Microcontrollers in C: with Interactive Hardware Simulation|Bates, Martin P.|9780750689601\n2014|Newnes|PIC Microcontroller Projects in C: Basic to Advanced|Ibrahim, Dogan|9780080999241\n2007|McGraw-Hill Education TAB|Programming and Customizing the PIC Microcontroller (Tab Electronics)|Predko, Myke|9780071472876\n2011|Newnes|Programming 16-Bit PIC Microcontrollers in C: Learning to Fly the PIC 24|Jasio, Lucio Di|9781856178716\n2014|Newnes|Embedded C Programming: Techniques and Applications of C and PIC MCUS|Siegesmund, Mark|9780128013144\n2005|Newnes|The PIC Microcontroller: Your Personal Introductory Course|Morton, John|9780750666640\n2007|Thomson/Delmar Learning|Fundamentals of Microcontrollers and Applications in Embedded Systems with PIC Microcontrollers|Ramesh S. Gaonkar|9781401879143\n2011|Newnes|PIC Microcontrollers: An Introduction to Microelectronics|Bates, Martin P.|9780080969169\n2004|McGraw-Hill Education TAB|PIC Microcontroller Project Book : For PIC Basic and PIC Basic Pro Compliers|Iovine, John|9780071437042\n2007|McGraw-Hill Education TAB|Programming and Customizing the PIC Microcontroller (Tab Electronics)|Predko, Myke|9780071510875\n2009|McGraw-Hill Education TAB|Making PIC Microcontroller Instruments and Controllers|Sandhu, Harprit Singh|9780071606158\n2002|Newnes|Programming PIC Microcontrollers with PICBASIC (Embedded Technology)|Hellebuyck, Chuck|9781589950016\n2001|Newnes|PIC BASIC: Programming and Projects|Ibrahim, Dogan|9780750652292\n2007|Newnes|Programming 16-Bit PIC Microcontrollers in C: Learning to Fly the PIC 24 (Embedded Technology)|Jasio, Lucio Di|9780080475462\n2006|Newnes|PIC in Practice: A Project-based Approach|Smith, David W|9780750668262\n2020|Apress|Intermediate C Programming for the PIC Microcontroller: Simplifying Embedded Programming|Ward, Hubert Henry|9781484260678\n2006|CRC Press|Microcontroller Programming: The Microchip PIC|Sanchez, Julio and Canton, Maria P.|9780849371899\n2021|Apress|Programming Arduino Projects with the PIC Microcontroller: A Line-by-Line Code Analysis and Complete Reference Guide for Embedded Programming in C|Ward, Hubert Henry|9781484272329\n2013T|Elektor Publishing|PIC Microcontroller Programming: in 10 captivating lessons (JAL)|Bert Van Dam|9781907920172\n1997|McGraw-Hill|Programming and Customizing the Pic Microcontroller|Predko, Michael|9780079136459\n2013|Newnes|Designing Embedded Systems with 32-Bit PIC Microcontrollers and MikroC|Ibrahim, Dogan|9780080981994\n2021|Packt Publishing - ebooks Account|Creative DIY Microcontroller Projects with C: A practical guide to building PIC and STM32 microcontroller board applications with C programming|Miguel Angel Garcia-Ruiz and Pedro Cesar Santana Mancilla|9781800564138\n2005|Newnes|Programming the PIC Microcontroller with MBASIC (Embedded Technology)|Smith, Jack|9780750679466\n2009|CRC Press|Microcontrollers: Fundamentals and Applications with PIC|Valdes-Perez, Fernando E. and Pallas-Areny, Ramon|9781420077674\n2021|Apress|Programming Arduino Projects with the PIC Microcontroller: A Line-by-Line Code Analysis and Complete Reference Guide for Embedded Programming in C|Ward, Hubert Henry|9781484272299\n2001|Butterworth-Heinemann|Introduction to Microelectronic Systems: The PIC 16F84 Microcontroller|Bates, Martin P.|9780340759202\n1997|McGraw-Hill|Programming and Customizing the Pic Microcontroller|Predko, Michael|9780079136466\n2004|DL|Embedded C Programming and the Microchip PIC|Richard H Barnett|9788131505274\n2006|Newnes|PIC in Practice: A Project-based Approach|Smith, David|9780080464985\n2022|Dodeka XXI|\"Microcontrollers PIC 24 The architecture and programming - (Programmable Systems) / Mikrokontrollery PIC 24 arkhitektura i programmirovanie - (\"\"Programmiruemye sistemy\"\")\"|Yu. S. Magda|9785941202270\n2012-09-28|LAP LAMBERT Academic Publishing|Programming PIC Microcontroller|Kashif Adhami|9783659257032\n20011221|McGraw-Hill Professional|PIC Robotics: A Beginner's Guide to Robotics Projects Using the PIC Micro|John Iovine|9780071394550\n|Newnes|Programming 16-bit PIC microcontrollers in C: learning to fly the PIC 24|Di Jasio, Lucio.|9781856178709\n2000|Custom Computer Services Inc.|Pic C : An Introduction To Programming The Microchip Pic In C (spanish Edition)|Nigel Gardner|9781899013067\n20171206|Springer Nature|Programming PIC Microcontrollers with XC8|Armstrong Subero|9781484232736\n20061219|CRC Press|Microcontroller Programming: The Microchip PIC|Julio Sanchez; Maria P. Canton|9781420006612\n2011|Springer Science+Business Media B.V.|Interfacing Pic Microcontrollers To Peripherial Devices|Bohdan Borowik|9789400711198\n20061024|Elsevier S & T|Designing Embedded Systems with PIC Microcontrollers|Tim Wilmshurst|9780080468143\n20191209|Springer Nature|C Programming for the PIC Microcontroller|Hubert Henry Ward|9781484255254\n2010|Elsevier Science|Sd Card Projects Using The Pic Microcontroller|Dogan Ibrahim|9780080961262\n2003|Delmar Pub|Embedded C Programming And The Microchip Pic||9781111321895\n||Embedded C Programming & The Microchip Pic Microcontroller|Barnett|9788131500958\n20200928|Springer Nature|Intermediate C Programming for the PIC Microcontroller|Hubert Henry Ward|9781484260685\n20210930|Springer Nature|Programming Arduino Projects with the PIC Microcontroller|Hubert Henry Ward|9781484272305\n20080822|Elsevier S & T|Programming 8-bit PIC Microcontrollers in C|Martin P. Bates|9780080560144\n2014|Lulu Press, Inc|Demystifying The Microchip Pic Microcontroller For Engineering Students|Charly Bechara|9781291792348\n2012|Lulu.com|Pic Programming for the Impatient: The MikroBasic Edition|Brian Patton|9781257147175\n2008|Foreign Trade Pub. Date :2008-7-1|Pic Microcontroller C Programming And Practice(chinese Edition)|(ri )hou Xian Zhe Ye Chang Xiao Ming Yi|9787810779197\n2011|Elsevier India|Programming The Pic Microcontroller With Mbasic {with Cd-rom}|Smith|9788131208403\n2007|Newnes|Programming 16-bit Pic Microcontrollers In C - Cd-rom (embedded Technology)|Lucio Di Jasio|9780750682930\n1991|Unknown|Pic Microcontroller C Programming Language And Practical Examples Of Typical (with Cd)|Sun An Qing Bian Zhu|9787508369051\n2002-08-19|Ccs Inc|Picmicro Mcu C: An Introduction To Programming The Microchip Pic In Ccs C|Nigel Gardner|9780972418102" }, "picasso": { "title": "PICASSO", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/26e84cc639c8afbd8b658c05449a0c967f0bde7e" ], "country": [ "United States" ], "originCommunity": [ "University of Texas at Austin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5551", "centralPackageRepositoryCount": 0, "isbndb": "" }, "picat": { "title": "Picat", "appeared": 2012, "type": "pl", "creators": [ "Neng-Fa Zhou", "Jonathan Fruhman" ], "website": "http://www.picat-lang.org/", "reference": [ "http://www.hakank.org/picat/" ], "domainName": { "registered": 2012, "awisRank": { "2022": 4716784 }, "name": "picat-lang.org" }, "related": [ "prolog" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "example": [ "import util.\n\ninput_data(Tri) => \n Lines = read_file_lines(\"triangle.txt\"),\n Tri = new_array(Lines.length),\n I = 1,\n foreach(Line in Lines)\n Tri[I] = Line.split().map(to_integer).to_array(),\n I := I+1\n end." ], "leachim6": { "filepath": "p/PiCat.pi", "fileExtensions": [ "pi" ], "example": [ "main =>\n println(\"Hello World\").\n" ], "id": "PiCat" } }, "piccola": { "title": "piccola", "appeared": 2002, "type": "pl", "description": "Piccola is a small, pure language for building applications from software components. Piccola is small in the sense that its syntax is tiny, and it is pure in the sense that it provides only compositional features — computation is performed entirely by components of the host programming language. The semantics of Piccola is defined in terms of a process calculus, an extension of Milner’s pi calculus in which values communicated are forms, rather than tuples. A \"form\" is essentially an extensible nested record which also serves as a namespace in which expressions may be evaluated. This simple mechanism is responsible for much of the expressive power of Piccola.", "website": "http://scg.unibe.ch/research/piccola/", "spec": "https://scg.unibe.ch/archive/phd/acherman-phd.pdf", "country": [ "Switzerland" ], "originCommunity": [ "RUniversitat ̈at Bern" ], "isbndb": "" }, "pick-operating-system": { "title": "Pick operating system", "appeared": 1970, "type": "os", "country": [ "United States" ], "originCommunity": [ "TRW Inc" ], "wikipedia": { "related": [ "assembly-language", "solaris", "linux", "sql", "basic", "dartmouth-basic", "unix", "mumps" ], "summary": "The Pick operating system (often called just \"the Pick system\" or simply \"Pick\") is a demand-paged, multiuser, virtual memory, time-sharing computer operating system based around a unique MultiValue database. Pick is used primarily for business data processing. It is named after one of its developers, Dick Pick. The term \"Pick system\" has also come to be used as the general name of all operating environments which employ this multivalued database and have some implementation of Pick/BASIC and ENGLISH/Access queries. Although Pick started on a variety of minicomputers, the system and its various implementations eventually spread to a large assortment of microcomputers, personal computers and mainframe computers.", "created": 2004, "backlinksCount": 258, "pageId": 471217, "revisionCount": 467, "dailyPageViews": 115, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/Pick_operating_system" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2362", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "pickcode": { "title": "PickCode", "appeared": 2021, "type": "visual", "screenshot": "https://pldb.com/screenshots/pickcode.png", "website": "https://www.pickcode.io/", "reference": [ "https://news.ycombinator.com/item?id=32230329" ], "country": [ "United States" ], "originCommunity": [ "Pickcode Technologies, LLC" ], "domainName": { "registered": 2021, "awisRank": { "2022": 3048479 }, "name": "pickcode.io" }, "related": [ "scratch" ] }, "pickle-format": { "title": "Pickle", "appeared": 1995, "type": "binaryDataFormat", "website": "https://docs.python.org/3/library/pickle.html", "reference": [ "https://www.python.org/ftp/python/doc/quick-ref.1.3.html" ], "country": [ "United States" ], "originCommunity": [ "The Python Software Foundation" ], "example": [ "\\x80\\x03cpandas.core.frame\\nDataFrame\\nq\\x00)\\x81q\\x01}q\\x02(X\\x05\\x00\\x00\\x00_dataq\\x03cpandas.core.internals\\nBlockManager\\nq\\x04)\\x81q\\x05(]q\\x06(cpandas.core.indexes.base\\n_new_Index\\nq\\x07cpandas.core.indexes.base\\nIndex\\nq\\x08}q\\t(X\\x04\\x00\\x00\\x00dataq\\ncnumpy.core.multiarray\\n_reconstruct\\nq\\x0bcnumpy\\nndarray\\nq\\x0cK\\x00\\x85q\\rC\\x01bq\\x0e\\x87q\\x0fRq\\x10(K\\x01K\\x02\\x85q\\x11cnumpy\\ndtype\\nq\\x12X\\x02\\x00\\x00\\x00O8q\\x13K\\x00K\\x01\\x87q\\x14Rq\\x15(K\\x03X\\x01\\x00\\x00\\x00|q\\x16NNNJ\\xff\\xff\\xff\\xffJ\\xff\\xff\\xff\\xffK?tq\\x17b\\x89]q\\x18(X\\x03\\x00\\x00\\x00Catq\\x19X\\x03\\x00\\x00\\x00Dogq\\x1aetq\\x1bbX\\x04\\x00\\x00\\x00nameq\\x1cNu\\x86q\\x1dRq\\x1eh\\x07cpandas.core.indexes.range\\nRangeIndex\\nq\\x1f}q (h\\x1cNX\\x05\\x00\\x00\\x00startq!K\\x00X\\x04\\x00\\x00\\x00stopq\"K\\x02X\\x04\\x00\\x00\\x00stepq#K\\x01u\\x86q$Rq%e]q&h\\x0bh\\x0cK\\x00\\x85q\\'h\\x0e\\x87q(Rq)(K\\x01K\\x02K\\x02\\x86q*h\\x12X\\x02\\x00\\x00\\x00f8q+K\\x00K\\x01\\x87q,Rq-(K\\x03X\\x01\\x00\\x00\\x00(X\\x04\\x00\\x00\\x00axesq?h\\x06X\\x06\\x00\\x00\\x00blocksq@]qA}qB(X\\x06\\x00\\x00\\x00valuesqCh)X\\x08\\x00\\x00\\x00mgr_locsqDcbuiltins\\nslice\\nqEK\\x00K\\x02K\\x01\\x87qFRqGuaustqHbX\\x04\\x00\\x00\\x00_typqIX\\t\\x00\\x00\\x00dataframeqJX\\t\\x00\\x00\\x00_metadataqK]qLub." ], "githubLanguage": { "fileExtensions": [ "pkl" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "none", "id": "Pickle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "pico": { "title": "PICO", "appeared": 1997, "type": "pl", "website": "http://pico.vub.ac.be", "country": [ "Belgium" ], "originCommunity": [ "Vrije Universiteit Brussel" ], "wikipedia": { "example": [ "`http://www.paulgraham.com/accgen.html`\nfoo(n): fun(i): n := n+i" ], "related": [ "scheme" ], "summary": "See also Pico (disambiguation).Pico is a programming language developed at the Software Languages Lab at Vrije Universiteit Brussel. The language was created to introduce the essentials of programming to non-computer science students. Pico can be seen as an effort to generate a palatable and enjoyable language for people who do not want to study hard for the elegance and power of a language. They have done it by adapting Scheme's semantics. While designing Pico, the Software Languages Lab was inspired by the Abelson and Sussman's book \"Structure and Interpretation of Computer Programs\". Furthermore, they were influenced by the teaching of programming at high school or academic level. Pico should be interpreted as 'small', the idea was to create a small language for educational purposes.", "pageId": 379013, "created": 2003, "backlinksCount": 14, "revisionCount": 81, "dailyPageViews": 14, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Pico_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2364", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "picolisp": { "title": "PicoLisp", "appeared": 1988, "type": "pl", "creators": [ "Alexander Burger" ], "website": "https://picolisp.com/", "documentation": [ "https://picolisp.com/wiki/?Documentation" ], "country": [ "Germany" ], "originCommunity": [ "https://www.mail-archive.com/picolisp@software-lab.de" ], "domainName": { "registered": 2007, "awisRank": { "2017": 9031045, "2022": 5670205 }, "name": "picolisp.com" }, "isLisp": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "related": [ "lisp", "linux", "s-expressions", "common-lisp", "emacs-lisp", "prolog", "c", "assembly-language", "java" ], "summary": "PicoLisp is an open source Lisp dialect. It runs on Linux and other POSIX-compliant systems.", "pageId": 25055375, "dailyPageViews": 19, "created": 2009, "backlinksCount": 28, "revisionCount": 124, "appeared": 1988, "fileExtensions": [ "l" ], "url": "https://en.wikipedia.org/wiki/PicoLisp" }, "githubLanguage": { "fileExtensions": [ "l" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "picolisp", "pil" ], "aceMode": "lisp", "tmScope": "source.lisp", "repos": 114, "id": "PicoLisp" }, "githubBigQuery": { "repos": 99, "users": 85, "id": "PicoLisp" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 6, "commitCount": 40, "sampleCount": 1, "example": [ "# 11dec13abu\n# (c) Software Lab. Alexander Burger\n\n(de permute (Lst)\n (ifn (cdr Lst)\n (cons Lst)\n (mapcan\n '((X)\n (mapcar\n '((Y) (cons X Y))\n (permute (delete X Lst)) ) )\n Lst ) ) )\n\n(de subsets (N Lst)\n (cond\n ((=0 N) '(NIL))\n ((not Lst))\n (T\n (conc\n (mapcar\n '((X) (cons (car Lst) X))\n (subsets (dec N) (cdr Lst)) )\n (subsets N (cdr Lst)) ) ) ) )\n\n(de shuffle (Lst)\n (by '(NIL (rand)) sort Lst) )\n\n(de samples (Cnt Lst)\n (make\n (until (=0 Cnt)\n (when (>= Cnt (rand 1 (length Lst)))\n (link (car Lst))\n (dec 'Cnt) )\n (pop 'Lst) ) ) )\n\n\n# Genetic Algorithm\n(de gen (\"Pop\" \"Cond\" \"Re\" \"Mu\" \"Se\")\n (until (\"Cond\" \"Pop\")\n (for (\"P\" \"Pop\" \"P\" (cdr \"P\"))\n (set \"P\"\n (maxi \"Se\" # Selection\n (make\n (for (\"P\" \"Pop\" \"P\")\n (rot \"P\" (rand 1 (length \"P\")))\n (link # Recombination + Mutation\n (\"Mu\" (\"Re\" (pop '\"P\") (pop '\"P\"))) ) ) ) ) ) ) )\n (maxi \"Se\" \"Pop\") )\n\n\n# Alpha-Beta tree search\n(de game (\"Flg\" \"Cnt\" \"Moves\" \"Move\" \"Cost\")\n (let (\"Alpha\" '(1000000) \"Beta\" -1000000)\n (recur (\"Flg\" \"Cnt\" \"Alpha\" \"Beta\")\n (let? \"Lst\" (\"Moves\" \"Flg\")\n (if (=0 (dec '\"Cnt\"))\n (loop\n (\"Move\" (caar \"Lst\"))\n (setq \"*Val\" (list (\"Cost\" \"Flg\") (car \"Lst\")))\n (\"Move\" (cdar \"Lst\"))\n (T (>= \"Beta\" (car \"*Val\"))\n (cons \"Beta\" (car \"Lst\") (cdr \"Alpha\")) )\n (when (> (car \"Alpha\") (car \"*Val\"))\n (setq \"Alpha\" \"*Val\") )\n (NIL (setq \"Lst\" (cdr \"Lst\")) \"Alpha\") )\n (setq \"Lst\"\n (sort\n (mapcar\n '((\"Mov\")\n (prog2\n (\"Move\" (car \"Mov\"))\n (cons (\"Cost\" \"Flg\") \"Mov\")\n (\"Move\" (cdr \"Mov\")) ) )\n \"Lst\" ) ) )\n (loop\n (\"Move\" (cadar \"Lst\"))\n (setq \"*Val\"\n (if (recurse (not \"Flg\") \"Cnt\" (cons (- \"Beta\")) (- (car \"Alpha\")))\n (cons (- (car @)) (cdar \"Lst\") (cdr @))\n (list (caar \"Lst\") (cdar \"Lst\")) ) )\n (\"Move\" (cddar \"Lst\"))\n (T (>= \"Beta\" (car \"*Val\"))\n (cons \"Beta\" (cdar \"Lst\") (cdr \"Alpha\")) )\n (when (> (car \"Alpha\") (car \"*Val\"))\n (setq \"Alpha\" \"*Val\") )\n (NIL (setq \"Lst\" (cdr \"Lst\")) \"Alpha\") ) ) ) ) ) )\n\n\n### Grids ###\n(de grid (DX DY FX FY)\n (let Grid\n (make\n (for X DX\n (link\n (make\n (for Y DY\n (set\n (link\n (if (> DX 26)\n (box)\n (intern (pack (char (+ X 96)) Y)) ) )\n (cons (cons) (cons)) ) ) ) ) ) )\n (let West (and FX (last Grid))\n (for (Lst Grid Lst)\n (let\n (Col (pop 'Lst)\n East (or (car Lst) (and FX (car Grid)))\n South (and FY (last Col)) )\n (for (L Col L)\n (with (pop 'L)\n (set (: 0 1) (pop 'West)) # west\n (con (: 0 1) (pop 'East)) # east\n (set (: 0 -1) South) # south\n (con (: 0 -1) # north\n (or (car L) (and FY (car Col))) )\n (setq South This) ) )\n (setq West Col) ) ) )\n Grid ) )\n\n(de west (This)\n (: 0 1 1) )\n\n(de east (This)\n (: 0 1 -1) )\n\n(de south (This)\n (: 0 -1 1) )\n\n(de north (This)\n (: 0 -1 -1) )\n\n(de disp (\"Grid\" \"How\" \"Fun\" \"X\" \"Y\" \"DX\" \"DY\")\n (setq \"Grid\"\n (if \"X\"\n (mapcar\n '((L) (flip (head \"DY\" (nth L \"Y\"))))\n (head \"DX\" (nth \"Grid\" \"X\")) )\n (mapcar reverse \"Grid\") ) )\n (let (N (+ (length (cdar \"Grid\")) (or \"Y\" 1)) Sp (length N))\n (\"border\" north)\n (while (caar \"Grid\")\n (prin \" \" (align Sp N) \" \"\n (and \"How\" (if (and (nT \"How\") (west (caar \"Grid\"))) \" \" '|)) )\n (for L \"Grid\"\n (prin\n (\"Fun\" (car L))\n (and \"How\" (if (and (nT \"How\") (east (car L))) \" \" '|)) ) )\n (prinl)\n (\"border\" south)\n (map pop \"Grid\")\n (dec 'N) )\n (unless (> (default \"X\" 1) 26)\n (space (inc Sp))\n (for @ \"Grid\"\n (prin \" \" (and \"How\" \" \") (char (+ 96 \"X\")))\n (T (> (inc '\"X\") 26)) )\n (prinl) ) ) )\n\n(de \"border\" (Dir)\n (when \"How\"\n (space Sp)\n (prin \" +\")\n (for L \"Grid\"\n (prin (if (and (nT \"How\") (Dir (car L))) \" +\" \"---+\")) )\n (prinl) ) )\n" ], "url": "https://github.com/textmate/lisp.tmbundle" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:PicoLisp", "tryItOnline": "picolisp", "officialBlogUrl": [ "http://pico-lisp.blogspot.com/" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "pict": { "title": "PICT", "appeared": 1992, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Edinburgh" ], "wikipedia": { "summary": "Pict is a statically typed programming language, one of the very few based on the π-calculus. Work on the language began at the University of Edinburgh in 1992, and development has been more or less dormant since 1998. The language is still at an experimental stage.", "pageId": 6751312, "created": 2006, "backlinksCount": 7, "revisionCount": 22, "dailyPageViews": 8, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Pict_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Pict", "hopl": "https://hopl.info/showlanguage.prx?exp=2365", "fileType": "text", "centralPackageRepositoryCount": 0 }, "pictol": { "title": "PICTOL", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9763fc35b3dec7962a862dd6798a0140b4987e7c" ], "country": [ "United States" ], "originCommunity": [ "Georgetown University Medical Center" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7362", "centralPackageRepositoryCount": 0 }, "picturebalm": { "title": "PICTUREBALM", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7f0a74202874a0771490fd5ebfca38ff5a7a96b8" ], "country": [ "United States" ], "originCommunity": [ "The University of Utah" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4150", "centralPackageRepositoryCount": 0 }, "pie-lang": { "title": "pie-lang", "appeared": 2018, "type": "pl", "creators": [ "David Christiansen" ], "description": "Pie: A Little Language with Dependent Types. Pie is a Racket language, requiring Racket version 6.5 or newer.", "website": "http://thelittletyper.com/", "country": [ "Denmark" ], "originCommunity": [ "https://github.com/the-little-typer" ], "domainName": { "registered": 2017, "name": "thelittletyper.com" }, "githubRepo": { "stars": 615, "forks": 47, "subscribers": 33, "created": 2018, "updated": 2022, "description": "The Pie language, which accompanies The Little Typer by Friedman and Christiansen", "issues": 4, "firstCommit": 2018, "url": "https://github.com/the-little-typer/pie" }, "repoStats": { "firstCommit": 2018, "commits": 57, "committers": 7, "files": 31 }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "pie": { "title": "PIE", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/65946f875c4936f961bf1727415b4d29e626791a" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2368", "wordRank": 6321, "centralPackageRepositoryCount": 0 }, "piet-programming-language": { "title": "Piet", "appeared": 1990, "type": "esolang", "country": [ "Australia" ], "originCommunity": [ "https://www.dangermouse.net/esoteric/piet.html" ], "wikipedia": { "example": [ "~ATH(THIS) {\n\n // ADDITIONAL GRAVES...\n\n} EXECUTE(NULL);\n\nTHIS.DIE();" ], "related": [ "intercal", "fortran", "cobol", "assembly-language", "unix", "brainfuck", "befunge", "fractran", "grass", "lolcode", "malbolge", "unlambda", "whitespace" ], "summary": "An esoteric programming language (sometimes shortened to esolang) is a programming language designed to test the boundaries of computer programming language design, as a proof of concept, as software art, as a hacking interface to another language (particularly functional programming or procedural programming languages), or as a joke. The use of esoteric distinguishes these languages from programming languages that working developers use to write software. Usually, an esolang's creators do not intend the language to be used for mainstream programming, although some esoteric features, such as visuospatial syntax, have inspired practical applications in the arts. Such languages are often popular among hackers and hobbyists. Usability is rarely a goal for esoteric programming language designers—often it is quite the opposite. Their usual aim is to remove or replace conventional language features while still maintaining a language that is Turing-complete, or even one for which the computational class is unknown.", "created": 2004, "backlinksCount": 283, "pageId": 53398, "revisionCount": 87, "dailyPageViews": 21, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/Piet_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "pig": { "title": "Pig Latin", "appeared": 2008, "type": "queryLanguage", "website": "https://pig.apache.org/", "aka": [ "piglatin" ], "originCommunity": [ "Apache" ], "domainName": { "name": "pig.apache.org" }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasHexadecimals": { "example": "-- 0x[0-9a-f]+", "value": true }, "hasFloats": { "example": "-- [0-9]*\\.[0-9]+(e[0-9]+)?[fd]?", "value": true }, "hasIntegers": { "example": "-- [0-9]+L?", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "input_lines = LOAD '/tmp/word.txt' AS (line:chararray);\nwords = FOREACH input_lines GENERATE FLATTEN(TOKENIZE(line)) AS word;\nfiltered_words = FILTER words BY word MATCHES '\\\\w+';\nword_groups = GROUP filtered_words BY word;\nword_count = FOREACH word_groups GENERATE COUNT(filtered_words) AS count, group AS word;\nordered_word_count = ORDER word_count BY count DESC;\nSTORE ordered_word_count INTO '/tmp/results.txt';" ], "wikipedia": { "example": [ "input_lines = LOAD '/tmp/my-copy-of-all-pages-on-internet' AS (line:chararray);\n \n -- Extract words from each line and put them into a pig bag\n -- datatype, then flatten the bag to get one word on each row\n words = FOREACH input_lines GENERATE FLATTEN(TOKENIZE(line)) AS word;\n \n -- filter out any words that are just white spaces\n filtered_words = FILTER words BY word MATCHES '\\\\w+';\n \n -- create a group for each word\n word_groups = GROUP filtered_words BY word;\n \n -- count the entries in each group\n word_count = FOREACH word_groups GENERATE COUNT(filtered_words) AS count, group AS word;\n \n -- order the records by count\n ordered_word_count = ORDER word_count BY count DESC;\n STORE ordered_word_count INTO '/tmp/number-of-words-on-internet';" ], "related": [ "linux", "java", "sql", "python", "javascript", "ruby", "groovy", "sawzall" ], "summary": "Apache Pig is a high-level platform for creating programs that run on Apache Hadoop. The language for this platform is called Pig Latin. Pig can execute its Hadoop jobs in MapReduce, Apache Tez, or Apache Spark. Pig Latin abstracts the programming from the Java MapReduce idiom into a notation which makes MapReduce programming high level, similar to that of SQL for relational database management systems. Pig Latin can be extended using user-defined functions (UDFs) which the user can write in Java, Python, JavaScript, Ruby or Groovy and then call directly from the language.", "pageId": 29417433, "dailyPageViews": 211, "created": 2010, "backlinksCount": 13, "revisionCount": 102, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Apache_Pig" }, "githubLanguage": { "fileExtensions": [ "pig" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.pig_latin", "repos": 1347, "id": "PigLatin" }, "githubBigQuery": { "repos": 606, "users": 535, "id": "PigLatin" }, "codeMirror": "pig", "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "pig" ], "id": "Pig" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2016, "committerCount": 2, "commitCount": 4, "sampleCount": 1, "example": [ "/**\n * sample.pig\n */\n\nREGISTER $SOME_JAR;\n\nA = LOAD 'person' USING PigStorage() AS (name:chararray, age:int); -- Load person\nB = FOREACH A generate name;\nDUMP B;\n\n" ], "url": "https://github.com/goblindegook/sublime-text-pig-latin" }, "leachim6": { "filepath": "p/Pig.pig", "fileExtensions": [ "pig" ], "example": [ "Hello WorldPIGHello World\n" ], "id": "Pig" }, "fileType": "text", "wordRank": 7993, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "pikachu": { "title": "pikachu", "appeared": 2017, "type": "esolang", "description": "It is an eso language designed specifically to be usable by Pikachus.", "website": "http://trove42.com/introducing-pikachu-programming-language/", "country": [ "Unknown" ], "originCommunity": [ "https://trove42.com/about-trove-42" ], "rijuRepl": { "example": [ "pi pi pi pi pi pi pi pi pi pi pika pipi pi pi pi pi pi pi pi pipi pi pi\npi pi pi pi pi pi pi pi pipi pi pi pi pipi pi pichu pichu pichu pichu ka\nchu pipi pi pi pikachu pipi pi pikachu pi pi pi pi pi pi pi pikachu\npikachu pi pi pi pikachu pipi pi pi pikachu pichu pichu pi pi pi pi pi\npi pi pi pi pi pi pi pi pi pi pikachu pipi pikachu pi pi pi pikachu ka\nka ka ka ka ka pikachu ka ka ka ka ka ka ka ka pikachu pipi pi pikachu\npipi pikachu\n" ], "id": "https://riju.codes/pikachu" } }, "pike": { "title": "Pike", "appeared": 1994, "type": "pl", "creators": [ "Fredrik Hübinette" ], "website": "https://pike.lysator.liu.se/", "documentation": [ "https://pike.lysator.liu.se/docs/man/" ], "country": [ "Sweden" ], "originCommunity": [ "Chalmers Datorförening" ], "domainName": { "name": "pike.lysator.liu.se" }, "hasComments": { "example": "", "value": true }, "hasMacros": { "example": "#define CYCLES 20", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "write" ] ], "wikipedia": { "example": [ "mixed anything;\nanything = (int)5.5; // anything is now the integer value 5\nanything = (string)anything; // anything is now the string value \"5\"" ], "related": [ "lpc", "c" ], "summary": "Pike is an interpreted, general-purpose, high-level, cross-platform, dynamic programming language, with a syntax similar to that of C. Unlike many other dynamic languages, Pike is both statically and dynamically typed, and requires explicit type definitions. It features a flexible type system that allows the rapid development and flexible code of dynamically typed languages, while still providing some of the benefits of a statically typed language. Pike features garbage collection, advanced data types, and first-class anonymous functions, with support for many programming paradigms, including object-oriented, functional and imperative programming. Pike is free software, released under the GPL, LGPL and MPL licenses.", "pageId": 86780, "dailyPageViews": 45, "created": 2002, "backlinksCount": 66, "revisionCount": 165, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Pike_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "pike", "pmod" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "pike" ], "aceMode": "text", "tmScope": "source.pike", "repos": 145, "id": "Pike" }, "githubBigQuery": { "repos": 105, "users": 94, "id": "Pike" }, "pygmentsHighlighter": { "filename": "c_like.py", "fileExtensions": [ "pike", "pmod" ], "id": "Pike" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2014, "committerCount": 1, "commitCount": 1, "sampleCount": 3, "example": [ "#!/usr/bin/env pike\n\nint main(int argc, array argv) {\n\treturn 0;\n}\n\n" ], "url": "https://github.com/hww3/pike-textmate" }, "projectEuler": { "memberCount": { "2019": 3, "2022": 6 }, "id": "Pike" }, "helloWorldCollection": [ "// Hello world in Pike (pike.roxen.com)\n\nint main(){\n write(\"Hello World!\\n\");\n}\n" ], "leachim6": { "filepath": "p/Pike.pike", "fileExtensions": [ "pike" ], "example": [ "int main() {\n write(\"Hello World\\n\");\n return 0;\n}\n" ], "id": "Pike" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Pike", "quineRelay": "Pike", "rijuRepl": { "example": [ "int main()\n{\n write(\"Hello, world!\\n\");\n return 0;\n}\n" ], "id": "https://riju.codes/pike" }, "tryItOnline": "pike", "tiobe": { "id": "Pike" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2369", "ubuntuPackage": "pike8.0", "jupyterKernel": [ "https://github.com/kevinior/jupyter-pike-kernel" ], "fileType": "text", "wordRank": 9961, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Pike (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786131011245", "semanticScholar": "" }, "pikelet": { "title": "pikelet", "appeared": 2017, "type": "pl", "creators": [ "Brendan Zabarauskas" ], "description": "Pikelet is a small, functional, dependently typed programming language.", "website": "https://pikelet-lang.github.io/pikelet/", "country": [ "Australia" ], "originCommunity": [ "https://github.com/pikelet-lang" ], "githubRepo": { "firstCommit": 2017, "stars": 566, "forks": 25, "subscribers": 28, "created": 2017, "updated": 2022, "description": "A friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧", "issues": 30, "url": "https://github.com/pikelet-lang/pikelet" }, "repoStats": { "firstCommit": 2017, "commits": 1190, "committers": 12, "files": 90 } }, "pikt": { "title": "PIKT", "appeared": 1998, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Chicago" ], "wikipedia": { "related": [ "unix", "linux", "solaris", "freebsd" ], "summary": "PIKT is cross-categorical, multi-purpose software for global-view, site-at-a-time system and network administration. Applicability includes system monitoring, configuration management, server and network administration, system security, and many other uses. PIKT consists of a feature-rich file preprocessor; a scripting language; a flexible, centrally directed process scheduler; a customizing file installer; a collection of command-line extensions; and other useful tools. The PIKT binaries are written using a combination of C, lex (flex), and yacc (bison). PIKT's configuration combines free-form text files, Pikt scripts, and programs written in other popular scripting languages. PIKT is in widespread use at thousands of sites around the world, although its popularity is diminished by the perception that it is complicated to set up and difficult to administer. Recent changes have mitigated the complexity and difficulty somewhat. PIKT's user community is low-profile and not very active. PIKT was first released publicly on October 17, 1998, and has undergone numerous revisions since then. As of 2008, it is still being actively maintained.", "created": 2007, "backlinksCount": 13, "pageId": 13922370, "revisionCount": 41, "dailyPageViews": 10, "appeared": 2007, "url": "https://web.archive.org/web/20190328003724/https://en.wikipedia.org/wiki/PIKT" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "pilib": { "title": "PiLib", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/38ae8b57d327d3dfa9a5d083488ff46dc8daab4a" ], "country": [ "Switzerland" ], "originCommunity": [ "Ecole Polytechnique Federale de Lausanne" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6815", "centralPackageRepositoryCount": 0 }, "pilot": { "title": "PILOT", "appeared": 1962, "type": "pl", "standsFor": "Programmed Instruction, Learning, or Teaching", "country": [ "United States" ], "originCommunity": [ "University of California, San Francisco" ], "wikipedia": { "example": [ "R:Call subroutine starting at label *INITIALIZE\n U:*INITIALIZE" ], "related": [ "basic" ], "summary": "Programmed Instruction, Learning, or Teaching (PILOT) is a simple programming language developed in the 1960s. Like its younger sibling LOGO, it was an early foray into the technology of computer-assisted instruction", "pageId": 57399, "dailyPageViews": 31, "created": 2002, "backlinksCount": 162, "revisionCount": 104, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/PILOT" }, "helloWorldCollection": [ "R:Hello world in PILOT\nT:Hello World!\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:PILOT", "tiobe": { "id": "PILOT" }, "hopl": "https://hopl.info/showlanguage.prx?exp=341", "fileType": "text", "wordRank": 3447, "centralPackageRepositoryCount": 0, "isbndb": "" }, "pin": { "title": "PIN", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2cb303e5a6c1999ce41fb019b7db8b43a8762041" ], "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6669", "wordRank": 3071, "centralPackageRepositoryCount": 0 }, "pinto": { "title": "pinto", "appeared": 2016, "type": "pl", "creators": [ "Peter Graf" ], "website": "https://pinto.tech", "country": [ "United States" ], "originCommunity": [ "https://github.com/punkbrwstr/pinto/issues" ], "domainName": { "name": "pinto.tech" }, "githubRepo": { "firstCommit": 2016, "stars": 10, "forks": 1, "created": 2016, "updated": 2021, "description": "Pinto is a domain-specific programming language for time series", "subscribers": 0, "issues": 3, "url": "https://github.com/punkbrwstr/pinto" }, "repoStats": { "firstCommit": 2016, "commits": 238, "committers": 4, "files": 77 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n12638229|Show HN: Pinto is a stack-based functional language for time series|2016-10-04 18:55:03 UTC|1475607303|punkbrwstr|1|7", "semanticScholar": "" }, "pipelines": { "title": "pipelines", "appeared": 2018, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://github.com/calebwin/pipelines/issues" ], "githubRepo": { "firstCommit": 2018, "stars": 365, "forks": 10, "subscribers": 13, "created": 2018, "updated": 2022, "description": "An experimental programming language for data flow", "issues": 2, "url": "https://github.com/calebwin/pipelines" }, "repoStats": { "firstCommit": 2018, "commits": 82, "committers": 5, "files": 15 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n18905100|Show HN: Pipelines: framework and language for crafting data pipelines|2019-01-14 18:27:03 UTC|1547490423|calebwin|0|5" }, "pisc": { "title": "pisc", "appeared": 2017, "type": "pl", "description": "PISC attempts to make concatenative programming less mind-bendy via pervasive use of locals, closures, the smallest set of syntax hacks to make code look nice. PISC is a stack-based programming language that is primarily inspired by factor, TCL, bash and a little bit of python, written in go.", "website": "https://pisc.junglecoder.com/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/62nk1o/position_independent_source_code_pisc/" ], "country": [ "United States" ], "originCommunity": [ "https://pisc.junglecoder.com/home/apps/fossil/PISC.fossil/ticket" ], "domainName": { "name": "pisc.junglecoder.com" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "pit": { "title": "PIT", "appeared": 1958, "type": "pl", "reference": [ "https://www.computer.org/csdl/proceedings/isola/2006/3071/00/3071a111.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of North Dakota" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2375", "wordRank": 6977, "centralPackageRepositoryCount": 0 }, "pixin": { "title": "PIXIN", "appeared": 1974, "type": "pl", "creators": [ "Malcolm Phillip Atkinson" ], "reference": [ "https://semanticscholar.org/paper/5cf2593c63b511f27dfb678c6bfc303d1cfda53d" ], "country": [ "United Kingdom" ], "originCommunity": [ "The University of Edinburgh" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5475", "centralPackageRepositoryCount": 0 }, "pizza": { "title": "Pizza", "appeared": 2001, "type": "pl", "website": "https://pizzacompiler.sourceforge.net", "country": [ "United Kingdom" ], "originCommunity": [ "https://sourceforge.net/p/pizzacompiler/_list/tickets" ], "supersetOf": [ "java" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "System.out.println" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "public final class Main {\n public int main(String args[]) {\n System.out.println(\n new Lines(new DataInputStream(System.in))\n .takeWhile(nonEmpty)\n .map(fun(String s) -> int { return Integer.parseInt(s); })\n .reduceLeft(0, fun(int x, int y) -> int { return x + y; }));\n while(x == 0) { map.create.newInstance() }\n }\n}" ], "related": [ "java" ], "summary": "Pizza is an open-source superset of Java 1.4, prior to the introduction of generics for the Java programming language. In addition to its own solution for adding generics to the language, Pizza also added function pointers and algebraic types with case classes and pattern matching. In August 2001, the developers made a compiler capable of working with Java. Most Pizza applications can run in a Java environment, but certain cases will cause problems. Work on Pizza has more or less stopped since 2002. Its main developers have concentrated instead on the Generic Java project, another attempt to add generics to Java which was eventually adopted into the official language version 1.5. The pattern matching and other functional programming-like features have been further developed in the Scala programming language. Martin Odersky remarked, \"we wanted to integrate the functional and object-oriented parts in a cleaner way than what we were able to achieve before with the Pizza language. [...] In Pizza we did a clunkier attempt, and in Scala I think we achieved a much smoother integration between the two.\"", "pageId": 509700, "created": 2004, "backlinksCount": 22, "revisionCount": 94, "dailyPageViews": 44, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Pizza_(programming_language)" }, "leachim6": { "filepath": "p/Pizza.pizza", "fileExtensions": [ "pizza" ], "example": [ "class HelloWorld {\n public static void main(String[] args) {\n System.out.println(\"Hello World\");\n }\n}" ], "id": "Pizza" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2376", "fileType": "text", "wordRank": 4629, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2019|Independently Published|Will Code For Pizza - Funny Computer Programming Notebook: Reat Present For The Best Software Engineers, Code Monkeys, New Coders, Computer Science ... Designers Who Love Smart Programming Humor|Prog Ana Maria Vesga Diaz|9781651732557" }, "pkgconfig": { "title": "PkgConfig", "appeared": 2000, "type": "configFormat", "website": "http://www.freedesktop.org/wiki/Software/pkg-config/", "country": [ "United States" ], "originCommunity": [ "X.Org Foundation" ], "related": [ "makefile", "autoconf" ], "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "pc" ], "id": "PkgConfig" } }, "pl-0": { "title": "PL/0", "appeared": 1976, "type": "pl", "creators": [ "Niklaus Wirth" ], "reference": [ "https://web.archive.org/web/20060712015332/http://www.cs.rochester.edu/courses/254/PLzero/guide.pdf" ], "country": [ "Switzerland" ], "originCommunity": [ "Eidgenössische Technische Hochschule Zürich" ], "wikipedia": { "example": [ "VAR x, y, z, q, r, n, f;\n\nPROCEDURE multiply;\nVAR a, b;\nBEGIN\n a := x;\n b := Y;\n z := 0;\n WHILE b > 0 DO\n BEGIN\n IF ODD b THEN z := z + a;\n a := 2 * a;\n b := b / 2\n END\nEND;\n\nPROCEDURE divide;\nVAR w;\nBEGIN\n r := x;\n q := 0;\n w := y;\n WHILE w <= r DO w := 2 * w;\n WHILE w > y DO\n BEGIN\n q := 2 * q;\n w := w / 2;\n IF w <= r THEN\n BEGIN\n r := r - w;\n q := q + 1\n END\n END\nEND;\n\nPROCEDURE gcd;\nVAR f, g;\nBEGIN\n f := x;\n g := y;\n WHILE f # g DO\n BEGIN\n IF f < g THEN g := g - f;\n IF g < f THEN f := f - g\n END;\n z := f\nEND;\n\nPROCEDURE fact;\nBEGIN\n IF n > 1 THEN\n BEGIN\n f := n * f;\n n := n - 1;\n CALL fact\n END\nEND;\n\nBEGIN\n ?x; ?y; CALL multiply; !z;\n ?x; ?y; CALL divide; !q; !r;\n ?x; ?y; CALL gcd; !z;\n ?n; f := 1; CALL fact; !f\nEND." ], "related": [ "pl-i", "pascal", "lex", "yacc", "python", "modula-2", "csp", "isbn" ], "summary": "PL/0 is a programming language, intended as an educational programming language, that is similar to but much simpler than Pascal, a general-purpose programming language. It serves as an example of how to construct a compiler. It was originally introduced in the book, Algorithms + Data Structures = Programs, by Niklaus Wirth in 1976. It features quite limited language constructs: there are no real numbers, very few basic arithmetic operations and no control-flow constructs other than \"if\" and \"while\" blocks. While these limitations make writing real applications in this language impractical, it helps the compiler remain compact and simple.", "pageId": 507221, "created": 2004, "backlinksCount": 26, "revisionCount": 133, "dailyPageViews": 40, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/PL/0" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2592", "fileType": "text", "centralPackageRepositoryCount": 0 }, "pl-11": { "title": "PL-11", "appeared": 1971, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "Conseil Européen pour la Recherche Nucléaire" ], "wikipedia": { "related": [ "pl360" ], "summary": "PL-11 is a high-level machine-oriented programming language for the PDP-11, developed by R.D. Russell of CERN in 1971. Written in Fortran IV, it is similar to PL360 and is cross-compiled on other machines. PL-11 was originally developed as part of the Omega project, a particle physics facility operational at CERN (Geneva, Switzerland) during the 1970s. The first version was written for the CII 10070, a clone of the XDS Sigma 7 built in France. Towards the end of the 1970s it was ported to the IBM 370/168, then part of CERN's computer centre. A report describing the language is available from CERN.", "pageId": 507366, "created": 2004, "backlinksCount": 6, "revisionCount": 17, "dailyPageViews": 6, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/PL-11" }, "hopl": "https://hopl.info/showlanguage.prx?exp=561", "fileType": "text", "centralPackageRepositoryCount": 0 }, "pl-as": { "title": "IBM Programming Language/Advanced Systems", "appeared": 1976, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/IBM_PL/S" ], "country": [ "United States" ], "originCommunity": [ "IBM" ] }, "pl-c": { "title": "PL/C", "appeared": 1973, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Cornell University" ], "wikipedia": { "related": [ "pl-i", "cornell-university-programming-language", "sp-k", "watfiv" ], "summary": "PL/C is a computer programming language developed at Cornell University with the specific goal of being used for teaching programming. It is based on IBM's PL/I language, and was designed in the early 1970s. Cornell also developed a compiler for the language that was based on its earlier CUPL compiler, and it was widely used in college-level programming courses. The two researchers and academic teachers who designed PL/C were Richard W. Conway and Thomas R. Wilcox. They submitted the famous article \"Design and implementation of a diagnostic compiler for PL/I\" published in the Communications of ACM in March 1973, pages 169-179. PL/C eliminated some of the more complex features of PL/I, and added extensive debugging and error recovery facilities. PL/C is a subset of PL/I. A program that runs without error under the PL/C compiler should run under PL/I and produce the same results, unless certain incompatible diagnostic features, such as a macro section (begun by a $MACRO statement and finished by a $MEND statement), were used.The PL/C compiler had the unusual capability of never failing to compile any program, through the use of extensive automatic correction of many syntax errors and by converting any remaining syntax errors to output statements.", "pageId": 309357, "created": 2003, "backlinksCount": 17, "revisionCount": 40, "dailyPageViews": 10, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/PL/C" }, "hopl": "https://hopl.info/showlanguage.prx?exp=650", "fileType": "text", "centralPackageRepositoryCount": 0 }, "pl-exus": { "title": "PL/EXUS", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c655c13b1a0704df8a857f026b2e0fb5dbf708f6" ], "country": [ "United States" ], "originCommunity": [ "Texas Institute for Rehabilitation and Research", "Baylor College of Medicine", "Four-Phase Systems,-Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3390", "centralPackageRepositoryCount": 0 }, "pl-i-formac": { "title": "PL/I-FORMAC", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5a83bfbb465ea67c78a5b9f37ff5eb0b6f32e724" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "supersetOf": [ "pl-i" ], "hopl": "https://hopl.info/showlanguage.prx?exp=560", "centralPackageRepositoryCount": 0 }, "pl-i-subset-g": { "title": "PL/I", "appeared": 1981, "type": "pl", "originCommunity": [ "IBM" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/PL/I" }, "semanticScholar": "" }, "pl-i": { "title": "PL/I", "appeared": 1964, "type": "pl", "documentation": [ "https://www.ibm.com/support/pages/enterprise-pli-zos-documentation-library", "https://www.ibm.com/docs/en/SSY2V3_5.1.0/com.ibm.ent.pl1.zos.doc/lrm.pdf" ], "standsFor": "Programming Language One", "originCommunity": [ "IBM" ], "hasPointers": { "example": "", "value": true }, "hasThreads": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasFixedPoint": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "assignmentToken": [ [ "=" ] ], "wikipedia": { "example": [ "/* Read in a line, which contains a string,\n/* and then print every subsequent line that contains that string. */\n\nfind_strings: procedure options (main);\n declare pattern character (100) varying;\n declare line character (100) varying;\n declare line_no fixed binary;\n\n on endfile (sysin) stop;\n\n get edit (pattern) (L);\n line_no = 1;\n do forever;\n get edit (line) (L);\n if index(line, pattern) > 0 then\n put skip list (line_no, line);\n line_no = line_no + 1;\n end;\n\nend find_strings;" ], "related": [ "pl-m", "xpl", "pl-p", "pl-c", "cobol", "fortran", "algol", "cms-2", "sp-k", "b", "rexx", "autocoder", "comtran", "george", "multics", "basic", "pascal", "daisy-systems", "linux", "hal-s", "unix", "java", "c", "isbn", "doi" ], "summary": "PL/I (Programming Language One, pronounced ) is a procedural, imperative computer programming language designed for scientific, engineering, business and system programming uses. It has been used by various academic, commercial and industrial organizations since it was introduced in the 1960s, and continues to be actively used. PL/I's main domains are data processing, numerical computation, scientific computing, and system programming; it supports recursion, structured programming, linked data structure handling, fixed-point, floating-point, complex, character string handling, and bit string handling. The language syntax is English-like and suited for describing complex data formats, with a wide set of functions available to verify and manipulate them.", "pageId": 23708, "dailyPageViews": 303, "created": 2001, "backlinksCount": 341, "revisionCount": 1138, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/PL/I" }, "projectEuler": { "memberCount": { "2022": 1 }, "id": "PL/I" }, "tiobe": { "id": "PL/I" }, "hopl": "https://hopl.info/showlanguage.prx?exp=185", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pl-ll": { "title": "PL/LL", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bc2144c1521bd11e23d000c3cb198dcb62ba43ed" ], "country": [ "Sweden" ], "originCommunity": [ "KTH Royal Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6277", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pl-m": { "title": "PL/M", "appeared": 1973, "type": "pl", "standsFor": "Programming Language for Microcomputers", "country": [ "United States" ], "originCommunity": [ "Microcomputer Applications Associates" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "assignmentToken": [ [ ":=" ] ], "wikipedia": { "example": [ "FIND: PROCEDURE(PA,PB) BYTE;\n DECLARE (PA,PB) BYTE;\n /* FIND THE STRING IN SCRATCH STARTING AT PA AND ENDING AT PB */\n DECLARE J ADDRESS,\n (K, MATCH) BYTE;\n J = BACK ;\n MATCH = FALSE;\n DO WHILE NOT MATCH AND (MAXM > J);\n LAST,J = J + 1; /* START SCAN AT J */\n K = PA ; /* ATTEMPT STRING MATCH AT K */\n DO WHILE SCRATCH(K) = MEMORY(LAST) AND\n NOT (MATCH := K = PB);\n /* MATCHED ONE MORE CHARACTER */\n K = K + 1; LAST = LAST + 1;\n END;\n END;\n IF MATCH THEN /* MOVE STORAGE */\n DO; LAST = LAST - 1; CALL MOVER;\n END;\n RETURN MATCH;\n END FIND;" ], "related": [ "algol", "pl-i", "xpl", "c" ], "summary": "The PL/M programming language (an acronym of Programming Language for Microcomputers) is a high-level language conceived and developed by Gary Kildall in 1973 for Hank Smith at Intel for its microprocessors. The language incorporated ideas from PL/I, ALGOL and XPL, and had an integrated macro processor. Unlike other contemporary languages such as Pascal, C or BASIC, PL/M had no standard input or output routines. It included features targeted at the low-level hardware specific to the target microprocessors, and as such, it could support direct access to any location in memory, I/O ports and the processor interrupt flags in a very efficient manner. PL/M was the first higher level programming language for microprocessor-based computers and was the original implementation language for the CP/M operating system. Many Intel and Zilog Z80 based embedded systems were programmed in PL/M during the 1970s and 1980s. For instance, the firmware of the Service Processor component of CISC AS/400 was written in PL/M. The original PL/M compiler targeted the Intel 8008. An updated version generated code for the 8080 processor, which would also run on the newer Intel 8085 as well as on the Zilog Z80 family (as it is backward-compatible with the 8080). Later followed compilers for the Intel 8048 and Intel 8051-microcontroller family as well as for the 8086 (8088), 80186 (80188) and subsequent 8086-based processors, including the advanced 80286 and the 32-bit 80386. There were also PL/M compilers developed for later microcontrollers, such as the Intel 8061 and 8096 / MCS-96 architecture family. While some PL/M compilers were \"native\", meaning that they ran on systems using that same microprocessor, e.g. for the Intel ISIS operating system, there were also \"cross compilers\", for instance PLMX, which ran on other operating environments such as CP/M, Microsoft's DOS, and Digital Equipment Corporation's VAX/VMS. PL/M is no longer supported by Intel, but aftermarket tools like PL/M-to-C translators exist (for examples, see External links, below).", "pageId": 543057, "created": 2004, "backlinksCount": 67, "revisionCount": 108, "dailyPageViews": 68, "appeared": 1973, "url": "https://en.wikipedia.org/wiki/PL/M" }, "hopl": "https://hopl.info/showlanguage.prx?exp=591", "fileType": "text", "centralPackageRepositoryCount": 0 }, "pl-p": { "title": "PL/P", "appeared": 1978, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Prime Computer, Inc" ], "wikipedia": { "related": [ "pl-i", "c" ], "summary": "The PL/P programming language (an acronym of Programming Language for Prime (computers)) is a mid-level programming language developed by Prime Computer to serve as their second primary system programming language after Fortran IV. PL/P was a subset of PL/I. Additions to the PRIMOS operating system for Prime 50 Series computers were written mostly in PL/P in later years. Certain PRIMOS modules written in Fortran IV during PRIMOS's early years were rewritten in PL/P. PL/P was the most widespread compiled programming language used for commercial PRIMOS applications, outpacing the use of the Prime C compiler, the CPL (PRIMOS) scripting language, and the Fortran IV compiler in commercial applications.", "created": 2005, "backlinksCount": 10, "pageId": 1960521, "revisionCount": 19, "dailyPageViews": 26, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/PL/P" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2380", "centralPackageRepositoryCount": 0 }, "pl-s-ii": { "title": "PL/S-II", "appeared": 1974, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5242", "semanticScholar": "" }, "pl-s": { "title": "PL/S", "appeared": 1968, "type": "pl", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=592", "semanticScholar": "" }, "pl-sql": { "title": "PL/SQL", "appeared": 1991, "type": "pl", "documentation": [ "https://docs.oracle.com/database/121/LNPLS/toc.htm" ], "aka": [ "PLSQL" ], "country": [ "United States" ], "originCommunity": [ "Oracle" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "dbms_output.put_line" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "wikipedia": { "example": [ "DECLARE\n CURSOR cursor_person IS\n SELECT person_code FROM people_table;\nBEGIN\n FOR RecordIndex IN cursor_person\n LOOP\n DBMS_OUTPUT.PUT_LINE(recordIndex.person_code);\n END LOOP;\nEND;" ], "related": [ "sql", "transact-sql", "postgresql", "plpgsql", "sql-psm", "object-pascal", "free-pascal", "java", "sqlite", "sqlpl" ], "summary": "PL/SQL (Procedural Language/Structured Query Language) is Oracle Corporation's procedural extension for SQL and the Oracle relational database. PL/SQL is available in Oracle Database (since version 6 - stored pl/sql procedures/functions/packages/triggers since version 7), TimesTen in-memory database (since version 11.2.1), and IBM DB2 (since version 9.7). Oracle Corporation usually extends PL/SQL functionality with each successive release of the Oracle Database. PL/SQL includes procedural language elements such as conditions and loops. It allows declaration of constants and variables, procedures and functions, types and variables of those types, and triggers. It can handle exceptions (runtime errors). Arrays are supported involving the use of PL/SQL collections. Implementations from version 8 of Oracle Database onwards have included features associated with object-orientation. One can create PL/SQL units such as procedures, functions, packages, types, and triggers, which are stored in the database for reuse by applications that use any of the Oracle Database programmatic interfaces.", "pageId": 33862363, "dailyPageViews": 427, "created": 2001, "backlinksCount": 432, "revisionCount": 1056, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/PL/SQL" }, "githubLanguage": { "fileExtensions": [ "pls", "bdy", "ddl", "fnc", "pck", "pkb", "pks", "plb", "plsql", "prc", "spc", "sql", "tpb", "tps", "trg", "vw" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "sql", "codemirrorMode": "sql", "codemirrorMimeType": "text/x-plsql", "tmScope": "none", "repos": 20365, "id": "PLSQL" }, "githubBigQuery": { "repos": 6767, "users": 6008, "id": "PLSQL" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/plsql", "linguistGrammarRepo": { "sampleCount": 8, "example": [ "create or replace procedure print_bool(\n p_bool in BOOLEAN,\n p_true_value in varchar2 default 'TRUE',\n p_false_value in varchar2 := 'FALSE'\n)\nas\nbegin\n\n dbms_output.put_line(case when p_bool then p_true_value else p_false_value end);\n\nend print_bool;\n/\n" ], "url": "https://github.com/textmate/sql.tmbundle" }, "helloWorldCollection": [ "-- Hello World in Oracle PL/SQL (sqlplus)\n\nset serveroutput on\n\nbegin\n dbms_output.enable(10000);\n dbms_output.put_line('Hello World');\nend;\n/\n" ], "leachim6": { "filepath": "p/PL∕SQL.pls", "fileExtensions": [ "pls" ], "example": [ "BEGIN\n dbms_output.put_line('Hello World');\nEND;\n/\n" ], "id": "PL∕SQL" }, "indeedJobs": { "2017": 2972, "query": "pl/sql developer" }, "meetup": { "memberCount": 78458, "groupCount": 276, "url": "https://www.meetup.com/topics/oracle" }, "tiobe": { "currentRank": 18, "id": "PL/SQL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7323", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAdvanced Plsql Programming: The Definitive Reference||Boobal Ganesan|58532308|0.0|0|0\nOracle SQL: Sql-Plsql Concepts, Queries & Tips for All Database Developers & Programmers||Niraj Gupta|55220774|0.0|0|1\n100 Plus SQL and PLSQL Tips: Useful for Beginner's and Experienced Database Programmers and Developers|2014|Niraj Gupta|45930441|4.00|5|0\nData-Centric Programming Languages: Mumps, Microsoft Access, Plsql, Transact-SQL, IBM RPG, Visual FoxPro, Jade, K||Source Wikipedia|59365714|0.0|0|0\nOracle: Oracle Adf, Sun Microsystems, Plsql, Oracle Rac, Larry Ellison, Jdeveloper, BMW Oracle Racing, SQL Developer||Quelle Wikipedia|54064120|0.0|0|0", "semanticScholar": "" }, "pl-x": { "title": "PL-X", "appeared": 1994, "type": "pl", "description": "IBM internal systems programming language (Programming Language/Cross Systems). There has been a progression from the original PL/S to the current PL/X. The language looks like and was originally based on PL/1 but it has picked up modern features along the way as well as features specifically for writing system software. AFAIK code exists written in all of the PL/* dialects and that the current PL/X compiler can handle all of them. Mark knows a lot better and may feel like commenting.", "reference": [ "http://users.etown.edu/w/wunderjt/home_IBM.html" ], "country": [ "United States" ], "originCommunity": [ "IBM" ] }, "pl360": { "title": "PL360", "appeared": 1967, "type": "pl", "creators": [ "Niklaus Wirth" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "wikipedia": { "example": [ "BEGIN INTEGER BUCKET;\n IF FLAG THEN\n BEGIN BUCKET := R0; R0 := R1; R1 := R2;\n R2 := BUCKET;\n END ELSE\n BEGIN BUCKET := R2; R2 := R1; R1 := R0;\n R0 := BUCKET;\n END\n RESET(FLAG);\n END" ], "related": [ "algol", "assembly-language", "euler" ], "summary": "PL360 (or PL/360) is a programming language designed by Niklaus Wirth and written by Niklaus Wirth, Joseph W. Wells, Jr., and Edwin Satterthwaite, Jr. for the IBM System/360 computer at Stanford University. A description of PL360 was published in early 1968, although the implementation was probably completed before Wirth left Stanford in 1967.", "pageId": 15774460, "created": 2008, "backlinksCount": 17, "revisionCount": 42, "dailyPageViews": 8, "appeared": 1967, "url": "https://en.wikipedia.org/wiki/PL360" }, "hopl": "https://hopl.info/showlanguage.prx?exp=342", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nIntroduction To Pl360 Programming||Richard L Guertin|4112903|0.0|0|0" }, "pl4": { "title": "PL4", "appeared": 1974, "type": "pl", "reference": [ "https://external.dandelon.com/download/attachments/dandelon/ids/DE004CCF8F74BCA4022C8C12579350053A660.pdf", "https://semanticscholar.org/paper/846939b6a7d2bb4514b7e196a88574e9709a2bf4" ], "country": [ "Canada" ], "originCommunity": [ "Université de Montréal" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3216", "centralPackageRepositoryCount": 0 }, "placa": { "title": "PLACA", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/45ee453b342846e1e28cd4146821e3aea3a566e2" ], "country": [ "United States" ], "originCommunity": [ "University of Northern Iowa" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7797", "centralPackageRepositoryCount": 0, "isbndb": "" }, "plaid-programming-language": { "title": "Plaid", "appeared": 2009, "type": "pl", "creators": [ "Jonathan Aldrich" ], "website": "https://www.cs.cmu.edu/~aldrich/plaid", "documentation": [ "https://www.cs.cmu.edu/~aldrich/plaid/plaid-intro.pdf" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "githubRepo": { "firstCommit": 2010, "stars": 9, "forks": 1, "subscribers": 1, "created": 2015, "updated": 2022, "description": "The Plaid Programming Language Tools", "issues": 30, "url": "https://github.com/plaidgroup/plaid-lang" }, "repoStats": { "firstCommit": 2010, "commits": 2891, "committers": 43, "files": 1872 }, "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Plaid_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "plain-english": { "title": "Plain English", "appeared": 2018, "type": "pl", "creators": [ "Gerry Rzeppa", "Dan Rzeppa" ], "website": "http://osmosian.com/", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/h0fpmi/this_plain_english_programming_language_makes_me/", "https://wiki.osdev.org/Plain_English_Programming" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/Folds/english/issues" ], "domainName": { "registered": 2005, "name": "osmosian.com" }, "example": [ "The background is a picture.\n\nA button has a box and a name.\n\nTo clear the status:\n Clear the status' string.\n Show everything.\n \nTo create the background:\n Draw the screen's box with the white color.\n Loop.\n Pick a spot anywhere in the screen's box.\n Pick a color between the lightest gray color and the white color.\n Dab the color on the spot.\n If a counter is past 80000, break.\n If the counter is evenly divisible by 1000, refresh the screen.\n Repeat.\n Extract the background given the screen's box. \\or Create the background from the screen. Or something.\n \nTo create a work given a URL:\n Allocate memory for the work.\n Put the URL into the work's URL.\n \nTo create some works given a buffer:\n Destroy the works.\n Put nil into the current work.\n Slap a rider on the buffer.\n Loop.\n Move the rider (Googley image rules).\n If the rider's token is blank, exit.\n Create a work given the rider's token.\n Append the work to the works.\n Repeat.\n \nThe current work is a work.\n \nTo dab a color on a spot:\n Pick an ellipse's left-top within 1/16 inch of the spot.\n Pick the ellipse's right-bottom within 1/16 inch of the spot.\n Draw the ellipse with the color.\n \nTo decide if a spot is in a button:\n If the spot is in the button's box, say yes.\n Say no.\n \nTo decide if a work is finished:\n If the work is nil, say yes.\n If the work's painting is not nil, say yes.\n Say no.\n \nTo draw a button:\n Draw the button's name in the button's box.\n \nTo draw the status:\n Draw the status' string in the center of the status' box.\n \nTo draw a string in a box in the center: \\ needed in sausage\n draw the string in the box with \"center\".\n \nTo draw the text:\n Put the text's string then \"_\" into a string.\n Draw the string in the text's box.\n \nTo draw a work:\n If the work is nil, exit.\n If the work is not finished, exit.\n Draw the work's painting.\n \nTo finalize our stuff:\n Destroy the background.\n Destroy the works.\n \nTo finish a work:\n If the work is nil, exit.\n If the work is finished, exit.\n Create a picture given the work's URL.\n If the picture is nil, exit.\n Resize the picture to 5-1/2 inches by 5-1/2 inches.\n Center the picture in the screen's box.\n Draw the background.\n Draw the picture.\n Loop.\n Pick a spot anywhere near the picture's box.\n Mix a color given the spot.\n Dab the color on the spot.\n If a counter is past 20000, break.\n Repeat.\n Extract the work's painting given the picture's box.\n Destroy the picture.\n \nTo go to a work:\n If the work is nil, exit.\n Show \"Working...\" in the status.\n Put the work into the current work.\n Finish the current work.\n Clear the status.\n Show everything.\n \nTo handle any events:\n Deque an event.\n If the event is nil, exit.\n Handle the event.\n Repeat.\n \nTo handle an event:\n If the event's kind is \"set cursor\", handle the event (set cursor); exit.\n If the event's kind is \"refresh\", handle the event (refresh); exit.\n If the event's kind is \"left click\", handle the event (left click); exit.\n If the event's kind is \"key down\", handle the event (key down); exit.\n \nTo handle an event (backspace):\n If the text's string is blank, cluck; exit.\n Remove the last byte from the text's string.\n Show everything.\n \nTo handle an event (end):\n If the current work is nil, cluck; exit.\n If the current work is the works' last, cluck; exit.\n Go to the works' last.\n \nTo handle an event (enter):\n If the text's string is blank, cluck; exit.\n Show \"Working...\" in the status.\n Put \"http://images.google.com/images?q=\" into a URL.\n\\ Put \"http://images.google.com/images?safe=active&q=\" into a URL.\n Convert the text's string to a query string.\n Append the query string to the URL.\n Read the URL into a buffer.\n If the i/o error is not blank, show the i/o error in the status; exit.\n Create the works given the buffer.\n If the works are empty, show \"Huh?\" in the status; exit.\n Go to the works' first.\n \nTo handle an event (escape):\n Clear the text's string.\n Show everything.\n \nTo handle an event (home):\n If the current work is nil, cluck; exit.\n If the current work is the works' first, cluck; exit.\n Go to the works' first.\n \nTo handle an event (key down):\n Clear the status.\n If the event is modified, handle the event (shortcut); exit.\n If the event's byte is printable, handle the event (printable); exit.\n Put the event's key into a key.\n If the key is the escape key, handle the event (escape); exit.\n If the key is the backspace key, handle the event (backspace); exit.\n If the key is the enter key, handle the event (enter); exit.\n If the key is the home key, handle the event (home); exit.\n If the key is the end key, handle the event (end); exit.\n If the key is the page-up key, handle the event (page-up); exit.\n If the key is the page-down key, handle the event (page-down); exit.\n \nTo handle an event (left click):\n Clear the status.\n If the event's spot is in the print button, print.\n If the event's spot is in the quit button, quit.\n \nTo handle an event (page-down):\n If the current work is nil, cluck; exit.\n If the current work's next is nil, cluck; exit.\n Go to the current work's next.\n \nTo handle an event (page-up):\n If the current work is nil, cluck; exit.\n If the current work's previous is nil, cluck; exit.\n Go to the current work's previous.\n \nTo handle an event (printable):\n Append the event's byte to the text's string.\n Show everything.\n \nTo handle an event (refresh):\n Show everything.\n \nTo handle an event (set cursor):\n Show the arrow cursor.\n \nTo handle an event (shortcut):\n If the event's key is the q-key, quit; exit.\n If the event's key is the p-key, print; exit.\n \nTo initialize the buttons:\n Put the screen's bottom minus 1/2 inch into a spot's y.\n Put the screen's right minus 1/2 inch into the spot's x.\n Make the quit button given the spot and \"Quit\".\n Put the quit button's left minus 1/2 inch into the spot's x.\n Make the print button given the spot and \"Print\".\n \nTo initialize our stuff:\n Create the background.\n Initialize the status.\n Initialize the buttons.\n Initialize the text.\n Show \"Hello, World!\" in the status.\n \nTo initialize the status:\n Put the screen's center into a spot.\n Put the spot's x minus 1 inch into the status' left.\n Put the spot's x plus 1 inch into the status' right.\n Put the screen's bottom minus 3/4 inch into the status' top.\n Put the screen's bottom minus 1/2 inch into the status' bottom.\n \nTo initialize the text:\n Put the screen's left plus 1/2 inch into the text's left.\n Put the text's left plus 2 inches into the text's right.\n Put the screen's bottom minus 3/4 inch into the text's top.\n Put the screen's bottom minus 1/2 inch into the text's bottom.\n \nTo make a button given a spot and a name:\n Put the spot's x minus the name's width into the button's left.\n Put the spot's y minus 1/4 inch into the button's top.\n Put the spot into the button's right-bottom.\n Put the name into the button's name.\n \nTo mix a color given a spot:\n Get the color given the spot.\n If the color is not very very light, exit.\n Pick the color between the lightest gray color and the white color.\n \nTo move a rider (Googley image rules):\n Clear the rider's token.\n Loop.\n If the rider's source is blank, exit.\n If the rider's source starts with \"src=\"\"http://t\", break.\n Add 1 to the rider's source's first.\n Repeat.\n Add \"src=\"\"\"'s length to the rider's source's first.\n Position the rider's token on the rider's source.\n Move the rider (HTML attribute rules).\n \nTo move a rider (HTML attribute rules):\n If the rider's source is blank, exit.\n If the rider's source's first's target is the right-alligator byte, exit.\n If the rider's source's first's target is the double-quote byte, exit.\n Bump the rider.\n Repeat.\n \nA painting is a picture.\n \nTo pick a spot anywhere near a box:\n Privatize the box.\n Outdent the box given 1/8 inch.\n Pick the spot anywhere in the box.\n \nTo print:\n If the current work is nil, cluck; exit.\n Show \"Printing...\" in the status.\n Begin printing.\n Begin a sheet.\n Center the current work's painting in the sheet.\n Draw the current work's painting.\n Center the current work's painting in the screen's box.\n End the sheet.\n End printing.\n Show \"Printed\" in the status.\n \nThe print button is a button.\n \nTo quit:\n Relinquish control.\n \nThe quit button is a button.\n \nTo run:\n Start up.\n Initialize our stuff.\n Handle any events.\n Finalize our stuff.\n Shut down.\n \nTo show everything:\n Hide the cursor.\n Draw the background.\n Draw the status.\n Draw the print button.\n Draw the quit button.\n Draw the text.\n Draw the current work.\n Refresh the screen.\n \nTo show a string in the status:\n Put the string into the status' string.\n Show everything.\n \nThe status has a box and a string.\n \nThe text has a box and a string.\n \nA work is a thing with a URL and a painting.\n \nThe works are some works." ] }, "plain": { "title": "PLAIN", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e45feb720f24025777fbe4e7b1b768e06823b512" ], "country": [ "The Netherlands and United States" ], "originCommunity": [ "Vrije Universiteit", "University of California, San Francisco" ], "hopl": "https://hopl.info/showlanguage.prx?exp=969", "wordRank": 3226, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1979|The data management facilities of PLAIN|10.1145/582095.582106|52|0|A. Wasserman|09e4388fe62ebb064dff742c21deca6b693f0615\n1981|The architecture of the PLAIN data base handler|10.1002/spe.4380110208|18|0|M. Kersten and A. Wasserman|e45feb720f24025777fbe4e7b1b768e06823b512\n2009|From Plain Prolog to Logtalk Objects: Effective Code Encapsulation and Reuse|10.1007/978-3-642-02846-5_3|7|1|Paulo Moura|ee9e13c53d2ed91fc61830ed000a44229a705928\n2012|Extending HQL with Plain Recursive Facilities|10.1007/978-3-642-32741-4_24|6|0|Aneta Szumowska and Marta Burzanska and Piotr Wisniewski and Krzysztof Stencel|5e592cfc4929cb2944c3a495a4a9f8a9541c7161\n2021|How should we ‘Explain in plain English’? Voices from the Community|10.1145/3446871.3469738|3|0|Max Fowler and Binglin Chen and C. Zilles|ede5df38d69ae2bb552f5f9850e1016a9185f54d\n2014|A web based tool for teaching hardware design based on the plain simple hardware description language|10.1109/EDUCON.2014.6826073|1|0|Karsten Becker|ca986817378d1768f1d3fef56bb2d143fa2aff8a" }, "plam": { "title": "plam", "appeared": 2017, "type": "pl", "creators": [ "Sandro Lovnički" ], "fileExtensions": [ "plam" ], "country": [ "Croatia" ], "originCommunity": [ "https://github.com/slovnicki/pLam/issues" ], "githubRepo": { "firstCommit": 2017, "stars": 417, "forks": 16, "subscribers": 8, "created": 2017, "updated": 2022, "description": "An interpreter for learning and exploring pure λ-calculus", "issues": 4, "url": "https://github.com/sandrolovnicki/pLam" }, "repoStats": { "firstCommit": 2017, "commits": 269, "committers": 6, "files": 44 } }, "plan2d": { "title": "PLAN2D", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/25e643ef1c44fed15fa34dd21a0e6183b976fd4e" ], "country": [ "Germany" ], "originCommunity": [ "Technical University of Berlin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5381", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1974|PLAN2D - Towards a Two-Dimensional Programming Language|10.1007/3-540-07141-5_223|5|0|E. Denert and R. Franck and W. Streng|0763b61863a58a6a9ff05c331bbf5def83acdc63" }, "planguage": { "title": "Planguage", "appeared": 2001, "type": "dataNotation", "description": "Planguage is a keyword-driven language whose name is derived from a contraction of the words planning and language1. Planguage can be used in requirements specifications, design documents, plans, and other places where qualitative statements are common. Its primary benefits are quantifying the qualitative and improving communication about complex ideas", "website": "http://www.syque.com/quality_tools/tools/Tools104.htm", "reference": [ "http://concepts.gilb.com/dl44" ], "country": [ "Norway" ], "originCommunity": [ "Gilb International" ], "example": [ "PLAN [01-Sep 2012]: Full product release\nGIST : Develop XYZ product ready for product release\nSTAKEHOLDER [planning, final signoff]: Product Quality Manager\nAUTHORITY [final signoff]: Marketing Manager\nMETER [Product]: Signed off acceptance by \nMUST [01-Sep 2012]: Partial product release\nWISH [01-Aug 2012]: Full product release" ] }, "planit": { "title": "PLANIT", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/727178f186186866e862cb909374646efd3384e6" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=296", "centralPackageRepositoryCount": 0 }, "plankalkul": { "title": "Plankalkul", "appeared": 1948, "type": "pl", "creators": [ "Konrad Zuse" ], "country": [ "Germany" ], "originCommunity": [ "Zuse-Ingenieurbüro Hopferau" ], "wikipedia": { "example": [ "P1 max3 (V0[:8.0],V1[:8.0],V2[:8.0]) → R0[:8.0]\nmax(V0[:8.0],V1[:8.0]) → Z1[:8.0]\nmax(Z1[:8.0],V2[:8.0]) → R0[:8.0]\nEND\nP2 max (V0[:8.0],V1[:8.0]) → R0[:8.0]\nV0[:8.0] → Z1[:8.0]\n(Z1[:8.0] < V1[:8.0]) → V1[:8.0] → Z1[:8.0]\nZ1[:8.0] → R0[:8.0]\nEND" ], "related": [ "algol-58", "algol" ], "summary": "Plankalkül (German pronunciation: [ˈplaːnkalkyːl], \"Plan Calculus\") is a programming language designed for engineering purposes by Konrad Zuse between 1942 and 1945. It was the first high-level (non-von Neumann) programming language to be designed for a computer. \"Kalkül\" means formal system – the Hilbert-style deduction system is for example originally called \"Hilbert-Kalkül\", so Plankalkül means \"formal system for planning\".", "pageId": 65944, "dailyPageViews": 154, "created": 2002, "backlinksCount": 51, "revisionCount": 268, "appeared": 1948, "url": "https://en.wikipedia.org/wiki/Plankalkül" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3", "fileType": "text", "centralPackageRepositoryCount": 0 }, "planner-73": { "title": "PLANNER-73", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/692c91426fa930ce043bee9d1e80410927253139" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3346", "centralPackageRepositoryCount": 0 }, "planner": { "title": "PLANNER", "appeared": 1969, "type": "pl", "creators": [ "Carl Hewitt" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "wikipedia": { "related": [ "pop-2", "lisp", "prolog" ], "summary": "Planner (often seen in publications as \"PLANNER\" although it is not an acronym) is a programming language designed by Carl Hewitt at MIT, and first published in 1969. First, subsets such as Micro-Planner and Pico-Planner were implemented, and then essentially the whole language was implemented as Popler by Julian Davies at the University of Edinburgh in the POP-2 programming language. Derivations such as QA4, Conniver, QLISP and Ether (see Scientific Community Metaphor) were important tools in Artificial Intelligence research in the 1970s, which influenced commercial developments such as KEE and ART.", "pageId": 46143, "dailyPageViews": 27, "created": 2002, "backlinksCount": 36, "revisionCount": 347, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Planner_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=297", "fileType": "text", "wordRank": 5824, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1972|From PLANNER to CONNIVER: a genetic approach|10.1145/1480083.1480156|129|2|G. Sussman and D. McDermott|4a2986f8a3b4a385ef410bfac509ace84401e961\n2009|A Mission Planner for an Autonomous Tractor|10.13031/2013.29123|51|2|D. Bochtis and S. Vougioukas and H. Griepentrog|3e52acba3b307fc389b7a02a1a754780f7efb0e3\n2015|A One-Semester Course Planner for EE Students|10.24178/IRJECE.2015.1.1.13|8|0|M. Laghari and Shaima Al Habsi and Nafisa A. Maaz and Mejd A. Ahmed Al Naqbi|f2f9001274769d4540a9c3420d4b023b4b1a1918\n2002|A Hierarchical Manufacturing Route Planner Based on Heuristic Algorithm: Design and Evaluation|10.1080/716067198|3|0|Ali A. Al-Titinchi and K. Al-Aubidy|1a45bbf8012428e2b42b181709455af9678c4417\n2011|A Temporally Expressive Planner Based on Answer Set Programming with Constraints: Preliminary Design|10.1007/978-3-642-20832-4_25|1|0|F. S. Bao and S. Chintabathina and A. Morales and Nelson Rushton and Richard Watson and Yuanlin Zhang|08e8a7bd1c63975e5eac844ac4d0e3123f92f109" }, "plantuml": { "title": "plantuml", "appeared": 2010, "type": "textMarkup", "website": "http://plantuml.com/", "country": [ "United States" ], "originCommunity": [ "Ezoic Inc" ], "domainName": { "registered": 2010, "awisRank": { "2022": 48102 }, "name": "plantuml.com" }, "example": [ "Bob->Alice : hello" ], "githubLanguage": { "type": "data", "fileExtensions": [ "puml", "iuml", "plantuml" ], "aceMode": "text", "tmScope": "source.wsd", "repos": 5, "id": "PlantUML" }, "twitter": "https://twitter.com/plantuml", "isbndb": "" }, "plasma": { "title": "plasma", "appeared": 2015, "type": "pl", "description": "Plasma, which aims to strike a balance between functional and imperative programming, include state-of-the-art concurrent programming features and feature automatic parallelisation. Boney previously worked on Mercury a logic language.", "website": "http://plasmalang.org/", "country": [ "Australia" ], "originCommunity": [ "https://github.com/PlasmaLang" ], "domainName": { "registered": 2015, "awisRank": { "2017": 16554107 }, "name": "plasmalang.org" }, "twitter": "https://twitter.com/plasmalang", "fileType": "text", "wordRank": 3774, "centralPackageRepositoryCount": 0 }, "playground": { "title": "Playground", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bca61be86585d10a0941e00cdeee4bde43484594" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2383", "centralPackageRepositoryCount": 0 }, "plb": { "title": "Programming Language for Business", "appeared": 1972, "type": "pl", "standsFor": "Programming Language for Business", "oldName": "DATABUS", "country": [ "United Kingdom" ], "originCommunity": [ "Datapoint Corporation" ], "wikipedia": { "example": [ "IF (DF_EDIT[ITEM] = \"PHYS\")\n STATESAVE MYSTATE\n IF (C_F07B != 2)\n DISPLAY *SETSWALL 1:1:1:80:\n *BGCOLOR=2,*COLOR=15:\n *P49:1,\" 7-Find \"\n ELSE\n DISPLAY *SETSWALL 1:1:1:80:\n *BGCOLOR=7,*COLOR=0:\n *P49:1,\" 7-Find \"\n ENDIF\n STATEREST MYSTATE\n TRAP GET_PRO NORESET IF F7\n ENDIF\n IF (SHOW_FILTER AND THIS_FILTER AND C_CUSTNO <> \"MAG\")\n LOADMOD \"filter\"\n PACK PASS_ID WITH \"QED \",QED_ID1,BLANKS\n MOVE \" FILTER DISPLAY (F6) \" TO PASS_DESC\n SET C_BIGFLT\n CALL RUN_FILT USING PASS_ID,PASS_DESC,\"432\"\n UNLOAD \"filter\"\n CLEAR THIS_FILTER\n ENDIF" ], "related": [ "cobol", "java", "unix", "linux", "visual-basic", "sql", "xml" ], "summary": "Programming Language for Business or PL/B is a business-oriented programming language originally called DATABUS and designed by Datapoint in 1972 as an alternative to COBOL because Datapoint's 8-bit computers could not fit COBOL into their limited memory, and because COBOL did not at the time have facilities to deal with Datapoint's built-in keyboard and screen. A version of DATABUS became an ANSI standard, and the name PL/B came about when Datapoint chose not to release its trademark on the DATABUS name.", "pageId": 350323, "created": 2003, "backlinksCount": 10, "revisionCount": 82, "dailyPageViews": 19, "appeared": 1972, "fileExtensions": [ "rl", "ps", "cb" ], "url": "https://en.wikipedia.org/wiki/Programming_Language_for_Business" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "please-build": { "title": "Please Build", "appeared": 2016, "type": "pl", "description": "Language for the please.build cross-language build system. The Please build language is a full programming language.", "website": "https://please.build", "reference": [ "https://please.build/language.html" ], "country": [ "United Kingdom" ], "originCommunity": [ "Thought Machine Group" ], "related": [ "makefile" ], "influencedBy": [ "python" ], "example": [ "# Taken from //src/core/BUILD in the Please repo\ngo_library(\n name = \"core\",\n srcs = glob([\"*.go\"], exclude=[\"*_test.go\", \"version.go\"]) + [\":version\"],\n visibility = [\"PUBLIC\"],\n deps = [\n \"//third_party/go:gcfg\",\n \"//third_party/go:logging\",\n \"//third_party/go:queue\",\n ]\n)" ], "githubRepo": { "firstCommit": 2016, "stars": 2060, "forks": 175, "subscribers": 34, "created": 2016, "updated": 2022, "description": "High-performance extensible build system for reproducible multi-language builds.", "issues": 57, "url": "https://github.com/thought-machine/please" }, "repoStats": { "firstCommit": 2016, "commits": 4042, "committers": 133, "files": 1032 } }, "please": { "title": "PLEASE", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/67f0224194a4e35f6602d08ac0a013752b67c85d" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois at Urbana-Champaign" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6976", "wordRank": 145, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1994|Overlook Books|Please Stand By: A Prehistory of Television|Ritchie, Michael|9780879515461", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Sir, Please Step Away from the ASR-33!|10.1145/1866296.1871406|3|0|Poul-Henning Kamp|7d59de3f4c07a814af96ed69652498d2626b2fb8" }, "plex": { "title": "PLEX", "appeared": 1975, "type": "pl", "reference": [ "https://www.erlang-factory.com/upload/presentations/416/MikeWilliams.pdf" ], "country": [ "Sweden" ], "originCommunity": [ "Telefonaktiebolaget LM Ericsson" ], "wikipedia": { "related": [ "fortran", "erlang" ], "summary": "PLEX (Programming Language for EXchanges) is a special-purpose, concurrent, real-time programming language. The PLEX language is closely tied to the architecture of Ericsson's AXE telephone exchanges which it was designed to control. PLEX was developed by Göran Hemdahl at Ericsson in the 1970s, and it has been continuously evolving since then. PLEX was described in 2008 as \"a cross between Fortran and a macro assembler.\"The language has two variants: Plex-C used for the AXE Central Processor (CP) and Plex-M used for Extension Module Regional Processors (EMRP).", "pageId": 21866469, "created": 2009, "backlinksCount": 11, "revisionCount": 29, "dailyPageViews": 21, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/PLEX_(programming_language)" }, "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "plexil": { "title": "PLEXIL", "appeared": 2005, "type": "pl", "website": "http://plexil.sourceforge.net/", "originCommunity": [ "NASA" ], "domainName": { "name": "plexil.sourceforge.net" }, "wikipedia": { "related": [ "linux" ], "summary": "PLEXIL (Plan Execution Interchange Language) is an open source technology for automation, created and currently in development by NASA.", "pageId": 19189627, "created": 2008, "backlinksCount": 8, "revisionCount": 39, "dailyPageViews": 5, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/PLEXIL" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "pliant": { "title": "pliant", "appeared": 1999, "type": "pl", "description": "At the beginning, Pliant is a computing language. It's target is: enable to keep better control on the computing system and better adaptation capabilities thanks to reduced complexity. This has been achieved mostly through enabling to develop everything in a single language that combines high expression power with execution efficiency.", "website": "https://www.fullpliant.org/", "reference": [ "http://wiki.c2.com/?PliantLanguage" ], "country": [ "France" ], "originCommunity": [ "Copliant Société à responsabilité limitée" ], "domainName": { "registered": 2001, "name": "fullpliant.org" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "plink-bed-format": { "title": "plink-bed-format", "appeared": 2007, "type": "binaryDataFormat", "description": "Primary representation of genotype calls at biallelic variants. Do not confuse this with the UCSC Genome Browser's BED format, which is totally different. Used in plink.", "website": "https://www.cog-genomics.org/plink2/formats#bed", "reference": [ "https://www.sciencedirect.com/science/article/pii/S0002929707613524" ], "fileExtensions": [ "bed" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/samtools" ], "example": [ "0x6c 0x1b 0x01 0xdc 0x0f 0xe7 0x0f 0x6b 0x01" ], "fileType": "binary", "centralPackageRepositoryCount": 0 }, "plink-bim-format": { "title": "plink-bim-format", "appeared": 2007, "type": "textDataFormat", "description": "Extended variant information file accompanying a .bed binary genotype table.", "website": "https://www.cog-genomics.org/plink2/formats#bim", "reference": [ "https://www.sciencedirect.com/science/article/pii/S0002929707613524" ], "fileExtensions": [ "bim" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/samtools" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "plink-fam-format": { "title": "plink-fam-format", "appeared": 2007, "type": "textDataFormat", "description": "Sample information file accompanying a .bed binary genotype table. The FAM file is just the first six columns of the PED file.", "website": "https://www.cog-genomics.org/plink2/formats#fam", "reference": [ "https://www.sciencedirect.com/science/article/pii/S0002929707613524" ], "fileExtensions": [ "fam" ], "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "plink-map-format": { "title": "plink-map-format", "appeared": 2007, "type": "textDataFormat", "description": "Variant information file accompanying a .ped text pedigree + genotype table.", "website": "https://www.cog-genomics.org/plink2/formats#map", "reference": [ "https://www.sciencedirect.com/science/article/pii/S0002929707613524" ], "fileExtensions": [ "map" ], "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "plink-ped-format": { "title": "plink-ped-format", "appeared": 2007, "type": "textDataFormat", "description": "The \"ped\" file is a commonly used format for holding pedigree and genotype data. Files in this format usually end in \".ped\". There are several variants of the format. Used by plink.", "website": "https://www.cog-genomics.org/plink2/formats#ped", "reference": [ "https://www.sciencedirect.com/science/article/pii/S0002929707613524" ], "fileExtensions": [ "ped" ], "country": [ "South Korea" ], "originCommunity": [ "Kyung Hee University" ], "example": [ "1 1 0 0 1 0 G G 2 2 C C\n1 2 0 0 2 0 A A 0 0 A C\n1 3 1 2 1 2 0 0 1 2 A C\n2 1 0 0 1 0 A A 2 2 0 0\n2 2 0 0 2 2 A A 2 2 0 0\n2 3 1 2 1 2 A A 2 2 A A" ], "githubRepo": { "stars": 1, "forks": 3, "subscribers": 0, "created": 2019, "updated": 2022, "issues": 0, "url": "https://github.com/WonyoungCho/plink/issues" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "plist": { "title": "Property list", "appeared": 2012, "type": "textMarkup", "fileExtensions": [ "plist" ], "country": [ "United States" ], "originCommunity": [ "Apple, Inc", "NeXT, Inc" ], "wikipedia": { "related": [ "ascii", "xml", "json", "applescript" ], "summary": "In the macOS, iOS, NeXTSTEP, and GNUstep programming frameworks, property list files are files that store serialized objects. Property list files use the filename extension .plist, and thus are often referred to as p-list files. Property list files are often used to store a user's settings. They are also used to store information about bundles and applications, a task served by the resource fork in the old Mac OS.", "pageId": 2437658, "dailyPageViews": 104, "created": 2005, "backlinksCount": 199, "revisionCount": 183, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Property_list" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "plot-lang": { "title": "Plot", "appeared": 2006, "type": "pl", "creators": [ "David A. Moon" ], "website": "http://users.rcn.com/david-moon/PLOT/", "reference": [ "http://users.rcn.com/david-moon/PLOT/Moon-ILC09.pdf" ], "standsFor": "Programming Language for Old Timers", "country": [ "United States" ], "originCommunity": [ "Association of Lisp Users" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ ";; A silly toy program\ndef response(threat)\n if threat = #severe\n run-in-circles()\n scream-and-shout()\n elseif threat = #moderate\n print(\"Danger Will Robinson\")\n else\n sleep(1)" ] }, "plot": { "title": "plot", "appeared": 2019, "type": "template", "creators": [ "John Sundell" ], "country": [ "Poland" ], "originCommunity": [ "https://github.com/JohnSundell/Plot/pulls" ], "example": [ "let html = HTML(\n .head(\n .title(\"My website\"),\n .stylesheet(\"styles.css\")\n ),\n .body(\n .div(\n .h1(\"My website\"),\n .p(\"Writing HTML in Swift is pretty great!\")\n )\n )\n)" ], "githubRepo": { "firstCommit": 2019, "stars": 1780, "forks": 119, "subscribers": 29, "created": 2019, "updated": 2022, "description": "A DSL for writing type-safe HTML, XML and RSS in Swift.", "issues": 14, "url": "https://github.com/JohnSundell/Plot" }, "repoStats": { "firstCommit": 2019, "commits": 108, "committers": 36, "files": 86 }, "isbndb": "" }, "plpgsql": { "title": "PL/pgSQL", "appeared": 1998, "type": "pl", "creators": [ "Jan Wieck" ], "documentation": [ "https://www.postgresql.org/docs/current/plpgsql.html" ], "country": [ "United States" ], "originCommunity": [ "The PostgreSQL Global Development Group" ], "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "pl-sql", "ada", "postgresql", "sql-psm", "sql", "bison" ], "summary": "PL/pgSQL (Procedural Language/PostgreSQL) is a procedural programming language supported by the PostgreSQL ORDBMS. It closely resembles Oracle's PL/SQL language. Implemented by Jan Wieck, PL/pgSQL first appeared with PostgreSQL 6.4, released on October 30, 1998. Version 9 also implements some ISO SQL/PSM features, like overloading of SQL-invoked functions and procedures.PL/pgSQL, as a fully featured programming language, allows much more procedural control than SQL, including the ability to use loops and other control structures. SQL statements and triggers can call functions created in the PL/pgSQL language. The design of PL/pgSQL aimed to allow PostgreSQL users to perform more complex operations and computations than SQL, while providing ease of use. The language is able to be defined as trusted by the server.PL/pgSQL is one of the programming languages included in the standard PostgreSQL distribution, the others being PL/Tcl, PL/Perl and PL/Python. In addition many others are available from third parties, including PL/Java, PL/pgPSM, PL/php, PL/R, PL/Ruby,PL/sh, PL/Lua and PL/v8. PostgreSQL uses Bison as its parser, making it easy to port many open-source languages, as well as to reuse code.", "created": 2005, "backlinksCount": 37, "pageId": 1545014, "revisionCount": 89, "dailyPageViews": 54, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/PL/pgSQL" }, "githubLanguage": { "fileExtensions": [ "pgsql", "sql" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nopenmaptiles openmaptiles https://github.com/openmaptiles.png https://github.com/openmaptiles/openmaptiles PLpgSQL #ccc 711 222 26 \"OpenMapTiles Vector Tile Schema Implementation\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "pgsql", "codemirrorMode": "sql", "codemirrorMimeType": "text/x-sql", "tmScope": "source.sql", "repos": 24919, "id": "PLpgSQL" }, "githubBigQuery": { "repos": 9239, "users": 8265, "id": "PLpgSQL" }, "pygmentsHighlighter": { "filename": "sql.py", "id": "PL/pgSQL" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2016, "committerCount": 15, "commitCount": 224, "sampleCount": 7, "example": [ "load 'plpgsql';\nload 'plpgsql_lint';\n\nDROP FUNCTION IF EXISTS list_sites();\nCREATE OR REPLACE FUNCTION list_sites() RETURNS TABLE (fc json) AS\n$func$\nBEGIN\nRETURN QUERY SELECT row_to_json(feat_col) FROM (\n SELECT 'FeatureCollection' AS type, array_to_json(array_agg(feat)) AS features FROM (\n SELECT DISTINCT ON (new_id) 'Feature' AS type, ST_ASGeoJSON(loc.geom)::json AS geometry, row_to_json(\n (SELECT prop FROM (SELECT new_id) AS prop)) AS properties FROM location loc) AS feat) AS feat_col;\nEND;\n$func$ LANGUAGE plpgsql;\n\n\nDROP FUNCTION IF EXISTS get_observations(character varying, integer);\nCREATE OR REPLACE FUNCTION get_observations(kind varchar, site_id integer) RETURNS TABLE (fc json) AS\n$func$\nBEGIN\n IF kind = 'o2_abs' THEN\n RETURN QUERY SELECT array_to_json(array_agg(row_to_json(obs))) FROM (\n SELECT observation_date AS date, o2_abs AS value FROM oxygen WHERE new_id = site_id) AS obs;\n ELSIF kind = 'o2_rel' THEN\n RETURN QUERY SELECT array_to_json(array_agg(row_to_json(obs))) FROM (\n SELECT observation_date AS date, o2_rel AS value FROM oxygen WHERE new_id = site_id) AS obs;\n ELSIF kind = 'temp' THEN\n RETURN QUERY SELECT array_to_json(array_agg(row_to_json(obs))) FROM (\n SELECT observation_date AS date, temp AS value FROM oxygen WHERE new_id = site_id) AS obs;\n END IF;\nEND;\n$func$ LANGUAGE plpgsql;\n" ], "url": "https://github.com/textmate/sql.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pluk": { "title": "Pluk", "appeared": 1995, "type": "pl", "creators": [ "Bart van der Werf" ], "reference": [ "https://github.com/bartwe", "http://freshmeat.sourceforge.net/projects/pluk" ], "fileExtensions": [ ".pluk" ], "country": [ "The Netherlands" ], "originCommunity": [ "https://sourceforge.net/p/pluk/_list/tickets" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8629", "centralPackageRepositoryCount": 0 }, "plum": { "title": "Programming Language for the University of Maryland", "appeared": 1978, "type": "pl", "reference": [ "http://teampli.net/plifamily.html", "https://github.com/plum-umd" ], "country": [ "United States" ], "originCommunity": [ "University of Maryland" ], "wikipedia": { "backlinksCount": 1465, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/Plum" }, "hopl": "https://hopl.info/showlanguage.prx?exp=821" }, "plumb": { "title": "plumb", "appeared": 2014, "type": "pl", "website": "http://chriswarbo.net/plumb", "webRepl": [ "http://www.chriswarbo.net/projects/plumb/try.html" ], "documentation": [ "http://www.chriswarbo.net/projects/plumb/using.html" ], "reference": [ "https://github.com/Warbo" ], "country": [ "Unknown" ], "originCommunity": [ "http://www.chriswarbo.net" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8213721|Show HN: Plumb, a functional language embedded in PHP, JS and Python|2014-08-22 20:11:17 UTC|1408738277|chriswarbo|6|7", "semanticScholar": "" }, "plunk": { "title": "Pλ⍵NK", "appeared": 2020, "type": "pl", "description": "This work presents Pλ⍵NK, a functional probabilistic network programming language that extends Probabilistic NetKAT (PNK). Like PNK, it enables probabilistic modelling of network behaviour, by providing probabilistic choice and infinite iteration (to simulate looping network packets). Yet, unlike PNK, it also offers abstraction and higher-order functions to make programming much more convenient.", "reference": [ "https://dl.acm.org/doi/pdf/10.1145/3371107?download=true" ], "country": [ "Belgium" ], "originCommunity": [ "Katholieke Universiteit Leuven" ] }, "plus": { "title": "Plus", "appeared": 1976, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "University of British Columbia" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "%Title := \"Hello world\";\n%Include(Pluslist);\n%Subtitle := \"Definitions\";\n%Lower_Case := True;\n\n/* Definitions that everyone needs */\n%Include(Boolean, Numeric_Types, More_Numeric_Types, String_Types,\n More_String_Types);\n\n/* A tasteful subset of procedure definitions */\n%Include(Main);\n\n/* Message routine definitions */\n%Include(Message_Initialize, Message, Message_Terminate);\n\n%Subtitle := \"Local Procedure Definitions\";\n%Eject();\ndefinition Main\n\n variable Mcb is pointer to Stream_Type;\n\n Mcb := Message_Initialize();\n Message(Mcb, \"Hello, world!\");\n Message_Terminate(Mcb);\n Mcb := Null;\n \nend Main;" ], "related": [ "pascal", "c" ], "summary": "Plus is a \"Pascal-like\" system implementation language from the University of British Columbia (UBC), Canada, based on the SUE system language developed at the University of Toronto, c. 1971.There is another programming language named PLUS, developed at Sperry Univac in Roseville, Minnesota, but the Univac PLUS is not the subject of this article.", "pageId": 27900530, "created": 2010, "backlinksCount": 22, "revisionCount": 32, "dailyPageViews": 8, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/Plus_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:PLUS", "fileType": "text", "wordRank": 844, "centralPackageRepositoryCount": 0 }, "plush": { "title": "Plush", "appeared": 2017, "type": "pl", "creators": [ "Maxime Chevalier-Boisvert" ], "website": "https://github.com/zetavm/zetavm/tree/master/plush/", "country": [ "Canada" ] }, "plz": { "title": "PLZ", "appeared": 1979, "type": "pl", "description": "PLZ/SYS is intended to aid the implementation of system programs for microcomputers. PLZ/SYS is a synthesis of concepts from contemporary programming languages and compilers--the language Pascal has had the most notable influence on the overall design and implementation of PLZ/SYS.", "reference": [ "https://semanticscholar.org/paper/a6f73d43d666ff8763b9cc97ce408243c9b95038" ], "country": [ "United States" ], "originCommunity": [ "Zilog, Inc" ], "influencedBy": [ "pascal" ], "hasBooleans": { "example": "", "value": true }, "booleanTokens": [ [ "true", "false" ] ], "example": [ "bubble sort MODULE\n\nCONSTANT\n false : .. 0\n true := 1\n \nEXTERNAL\n printarray PROCEDURE (first tWORD count BYTE)\n \nINTERNAL\n a ARRAY [10 WORD]\n := [33 10 2000 400 410\n 3 3 33 500 1999]\n sort PROCEDURE (n BYTE)\n LOCAL\n i j limit BYTE\n temp WORD\n switched BYTE\n ENTRY\n DO\n switched := false\n i := 0\n limit := n-2\n DO\n IF i > limit THEN EXIT FI\n j := i + 1\n IF a[i] > a[j] THEN\n switched := true\n temp :'\" a [i)\n a[i] := a[j]\n a [j] : .. temp\n FI\n i +- 1\n OD\n IF switched .. false THEN RETURN FI\n END sort\nGLOBAL\n main PROCEDURE\n ENTRY\n sort (10)\n printarray(ta[O] 10)\n END main\nEND bubble sort" ], "hopl": "https://hopl.info/showlanguage.prx?exp=865", "centralPackageRepositoryCount": 0 }, "pm2": { "title": "PM2", "appeared": 1989, "type": "pl", "country": [ "France" ], "originCommunity": [ "Institut national de recherche en sciences et technologies du numérique", "Centre national de la recherche scientifique", "University of Bordeaux" ], "wikipedia": { "backlinksCount": 6, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/PM2" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2528" }, "pml": { "title": "PML", "appeared": 1986, "type": "textMarkup", "creators": [ "Christian Neumanns" ], "website": "https://www.pml-lang.dev/", "reference": [ "https://medium.com/@christian.ppl" ], "standsFor": "Practical Markup Language", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/pml-lang" ], "example": [ "[doc [title PML Demo]\n\n [ch [title Introduction]\n This is a [i simple] example.\n\n You can add images, audio, and videos:\n [image (\n source = images/strawberries.jpg\n width = 300\n align = center\n )]\n ]\n\n [ch [title Source Code]\n You can show highlighted source code:\n [code (lang=java)\n // Simple Java example\n public static void sayHello ( String name ) {\n System.out.println ( \"Hello \" + name );\n } \n code]\n ]\n]" ] }, "png-format": { "title": "PNG", "appeared": 1996, "type": "binaryDataFormat", "standsFor": "Portable Network Graphics", "country": [ "United States" ], "originCommunity": [ "www.libpng.org/pub/png/#history" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Portable_Network_Graphics" } }, "pnuts": { "title": "Pnuts", "appeared": 1997, "type": "pl", "country": [ "Japan" ], "originCommunity": [ "Sun Japan" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "use(\"pnuts.lib\") // Standard module that makes sort, println and other functions available. \ncountries = [\"Canada\", \"Austria\", \"Brazil\"] \nsort(countries) \nfor (country : countries) println(\"Hello \" + country)" ], "related": [ "java" ], "summary": "Pnuts is a dynamic scripting language for the Java platform. It is designed to be used in a dual language system with the Java programming language. The goals of the Pnuts project are to provide a small, fast scripting language that has tight integration with the Java language. Pnuts uses syntax that is simple and friendly to Java developers, while also being very expressive.", "created": 2008, "backlinksCount": 11, "pageId": 16718543, "revisionCount": 26, "dailyPageViews": 8, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Pnuts" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "po": { "title": "PO", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/69ae26efe248b3a4c8bdcbcbaf07cbe84d5ac38c" ], "country": [ "Italy" ], "originCommunity": [ "Universita' di Bologna" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6305", "wordRank": 1997, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1992|Moskovskai︠a︡ Mezhdunar. Shkola Perevodchikov|Anglo-russkiĭ slovarʹ po programmirovanii︠u︡ i informatike: s tolkovanii︠a︡mi : okolo 6,000 terminov|Borkovskiĭ, A. B. (arkadiĭ Borisovich)|9785823400039" }, "pocket-smalltalk": { "title": "Pocket Smalltalk", "appeared": 1999, "type": "pl", "reference": [ "https://archive.org/details/tucows_33442_Pocket_Smalltalk" ], "country": [ "Canada" ], "originCommunity": [ "Tucows Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3749", "centralPackageRepositoryCount": 0 }, "pod": { "title": "Pod", "appeared": 1997, "type": "textMarkup", "reference": [ "https://groups.google.com/forum/#!search/%22Plain$20Old$20Documentation%22/comp.lang.perl.misc/A9zVCf4UrIs/1hSITu_f4ckJ" ], "country": [ "United States" ], "originCommunity": [ "https://www.perl.org" ], "wikipedia": { "example": [ "=head1 NAME\n\nMy::Module - An example module\n\n=head1 SYNOPSIS\n\n use My::Module;\n my $object = My::Module->new();\n print $object->as_string;\n\n=head1 DESCRIPTION\n\nThis module does not really exist, it\nwas made for the sole purpose of\ndemonstrating how POD works.\n\n=head2 Methods\n\n=over 12\n\n=item C\n\nReturns a new My::Module object.\n\n=item C\n\nReturns a stringified representation of\nthe object. This is mainly for debugging\npurposes.\n\n=back\n\n=head1 LICENSE\n\nThis is released under the Artistic \nLicense. See L.\n\n=head1 AUTHOR\n\nJuerd - L\n\n=head1 SEE ALSO\n\nL, L\n\n=cut" ], "related": [ "perl", "xml", "tex", "markdown", "parrot-vm", "bash", "tiddlywiki", "mediawiki", "ascii", "utf-8" ], "summary": "Plain Old Documentation (pod) is a lightweight markup language used to document the Perl programming language.", "backlinksCount": 84, "pageId": 888219, "created": 2004, "revisionCount": 118, "dailyPageViews": 31, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Plain_Old_Documentation" }, "githubLanguage": { "fileExtensions": [ "pod" ], "trendingProjectsCount": 0, "type": "prose", "interpreters": [ "perl" ], "aceMode": "perl", "codemirrorMode": "perl", "codemirrorMimeType": "text/x-perl", "tmScope": "none", "wrap": true, "repos": 0, "id": "Pod" }, "linguistGrammarRepo": { "sampleCount": 3, "example": [ "use strict;\nuse warnings;\npackage DZT::Sample;\n\nsub return_arrayref_of_values_passed {\n my $invocant = shift;\n return \\@_;\n}\n\n1;\n" ], "url": "https://github.com/perl6/atom-language-perl6" }, "fileType": "text", "wordRank": 9791, "centralPackageRepositoryCount": 0 }, "pod6": { "title": "Pod6", "appeared": 2019, "type": "textMarkup", "creators": [ "Aliaksandr Zahatski" ], "website": "https://pod6.in", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/zag/js-pod6/issues" ], "domainName": { "registered": 2012, "name": "pod6.in" }, "example": [ "=begin pod\n This is an ordinary paragraph\n\n While this is not\n This is a code block\n \n =head1 Mumble mumble\n \n Suprisingly, this is not a code block\n (with fancy indentation too)\n\nBut this is just a text. Again\n\n=end pod" ], "githubRepo": { "firstCommit": 2019, "stars": 8, "forks": 0, "subscribers": 2, "created": 2019, "updated": 2022, "description": "Pod6 is an easy-to-use markup language. It can be used for writing language documentation, for documenting programs and modules, as well as for other types of document composition", "issues": 17, "url": "https://github.com/zag/js-pod6" }, "repoStats": { "firstCommit": 2019, "commits": 269, "committers": 2, "files": 155 } }, "pogol": { "title": "POGOL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9fdacc168f5ccad268546464644791819e74ba50" ], "country": [ "United States" ], "originCommunity": [ "Dept. of Defense" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6653", "centralPackageRepositoryCount": 0 }, "pogoscript": { "title": "PogoScript", "appeared": 2011, "type": "pl", "website": "http://pogoscript.org/", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/featurist" ], "domainName": { "registered": 2011, "name": "pogoscript.org" }, "githubRepo": { "firstCommit": 2011, "stars": 127, "forks": 9, "subscribers": 13, "created": 2011, "updated": 2022, "description": "A readable, DSL friendly programming language with excellent concurrency primitives", "issues": 21, "url": "https://github.com/featurist/pogoscript" }, "repoStats": { "firstCommit": 2011, "commits": 1174, "committers": 4, "files": 272 }, "githubLanguage": { "fileExtensions": [ "pogo" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.pogoscript", "repos": 51, "id": "PogoScript" }, "githubBigQuery": { "repos": 12, "users": 4, "id": "PogoScript" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2015, "committerCount": 2, "commitCount": 9, "sampleCount": 1, "example": [ "httpism = require 'httpism'\nasync = require 'async'\nresolve = require 'url'.resolve\n\nexports.squash (url) ! =\n html = httpism.get ! (url).body\n squash html ! (html, url)\n\nsquash html (html, url, callback) =\n replacements = sort (links in (html).concat(scripts in (html)))\n for each @(r) in (replacements) @{ r.url = resolve(url, r.href) }\n async.map (replacements, get) @(err, requested)\n callback (err, replace (requested) in (html)) \n\nsort (replacements) =\n replacements.sort @(a, b) @{ a.index - b.index }\n\nget (replacement) =\n replacement.body = httpism.get ! (replacement.url).body\n replacement\n\nreplace (replacements) in (html) =\n i = 0\n parts = \"\"\n for each @(rep) in (replacements)\n parts := \"#(parts)#(html.substring(i, rep.index))<#(rep.tag)>#(rep.body)\"\n i := rep.index + rep.length\n \n parts + html.substr(i)\n\nlinks in (html) =\n link reg = r/]*href=[\"']?([^\"']+)[\"'][^\\>]*(\\/\\>|\\>\\s*\\<\\/link\\>)/gi\n elements in (html) matching (link reg) as 'style'\n\nscripts in (html) =\n script reg = r/]*src=[\"']?([^\"']+)[\"'][^\\>]*(\\/\\>|\\>\\s*\\<\\/script\\>)/gi\n elements in (html) matching (script reg) as 'script'\n\nelements in (html) matching (reg) as (tag) =\n elements = []\n while (m = reg.exec (html))\n elements.push { tag = tag, index = m.index, length = m.0.length, href = m.1 }\n \n elements\n" ], "url": "https://github.com/featurist/PogoScript.tmbundle" }, "twitter": "https://twitter.com/pogoscript", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "pointless": { "title": "pointless", "appeared": 2020, "type": "pl", "creators": [ "Avery N. Nortonsmith" ], "website": "https://ptls.dev/", "reference": [ "https://news.ycombinator.com/item?id=22838255" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/pointless-lang" ], "domainName": { "name": "ptls.dev" }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "example": [ "import \"chart.ptls\" as chart\n \noutput =\n iterate(collatzStep, 175)\n |> takeWhile(greaterThan(1))\n |> chart.scale(8)\n |> println\n\ncollatzStep(n) =\n if n % 2 == 0 then n / 2 else n * 3 + 1" ], "githubRepo": { "firstCommit": 2020, "stars": 121, "forks": 8, "subscribers": 6, "created": 2020, "updated": 2022, "description": "Pointless: a scripting language for learning and fun", "issues": 6, "url": "https://github.com/pointless-lang/pointless" }, "repoStats": { "firstCommit": 2020, "commits": 108, "committers": 6, "files": 81 }, "pygmentsHighlighter": { "filename": "pointless.py", "fileExtensions": [ "ptls" ], "id": "Pointless" }, "tryItOnline": "https://ptls.dev/online" }, "polac": { "title": "POLAC", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8181228b3c1415a2aef0192a387d3cb806e9e968" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3702", "centralPackageRepositoryCount": 0 }, "polly": { "title": "polly", "appeared": 2016, "type": "template", "website": "https://gitlab.com/Polly-lang/Polly", "country": [ "Unknown" ], "originCommunity": [ "https://gitlab.com/Polly-lang" ], "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n11163438|Show HN: Polly: A templating language for Rust|2016-02-24 00:05:19 UTC|1456272319|Aaronepower|21|47", "isbndb": "" }, "poly": { "title": "poly", "appeared": 2013, "type": "plzoo", "description": "lazy, functional, statically typed, parametric polymorphism, type inference", "website": "http://plzoo.andrej.com/language/poly.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "country": [ "Slovenia" ], "originCommunity": [ "https://github.com/andrejbauer/plzoo/issues" ], "wordRank": 7762, "centralPackageRepositoryCount": 0 }, "polyglot-compiler": { "title": "polyglot-compiler", "appeared": 2003, "type": "compiler", "creators": [ "Nick Mathewson" ], "website": "https://www.cs.cornell.edu/projects/polyglot/", "country": [ "United States" ], "originCommunity": [ "Defense Advanced Research Projects Agency", "US Air Force" ], "githubRepo": { "firstCommit": 1999, "stars": 92, "forks": 21, "subscribers": 18, "created": 2014, "updated": 2022, "description": "Polyglot Extensible Compiler Framework for Java", "issues": 2, "url": "https://github.com/polyglot-compiler/polyglot" } }, "polylith": { "title": "Polylith", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/29fe52cae95491b866f8976ad5ce781c5d511078" ], "country": [ "United States" ], "originCommunity": [ "University of Maryland" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7205", "centralPackageRepositoryCount": 0 }, "polymath": { "title": "polymath", "appeared": 2020, "type": "textMarkup", "creators": [ "JL" ], "description": "Polymath is a markup language (like Markdown, LaTeX, or HTML) and a static site generator specialized in aesthetically presenting a wide variety of information: text, mathematics, code, photos, videos, you name it.", "website": "https://jwmza.com/polymath/", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/jwmza/polymath/issues" ], "githubRepo": { "firstCommit": 2020, "stars": 12, "forks": 0, "subscribers": 4, "created": 2020, "updated": 2022, "description": "Polymath is a human readable, interoperable, long-term focused markup language for information storage and display", "issues": 0, "url": "https://github.com/jwmza/polymath" }, "repoStats": { "firstCommit": 2020, "commits": 20, "committers": 3, "files": 4 } }, "polymorphic-programming-language": { "title": "Polymorphic Programming Language", "appeared": 1969, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Harvard University" ], "wikipedia": { "related": [ "apl", "s" ], "summary": "The Polymorphic Programming Language (PPL) was developed in 1969 at Harvard University by Thomas A. Standish. It is an interactive, extensible language with a base language similar to the language APL.The assignment operator <- (or ←) has influenced the language S.", "created": 2006, "backlinksCount": 48, "pageId": 5005125, "revisionCount": 21, "dailyPageViews": 9, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Polymorphic_Programming_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=454", "centralPackageRepositoryCount": 0 }, "polyp": { "title": "PolyP", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/19eabbb7b59ecd5e893e093675a81963eba8e094" ], "country": [ "Sweden" ], "originCommunity": [ "Chalmers University of Technology", "University of Göteborg" ], "hopl": "https://hopl.info/showlanguage.prx?exp=206", "centralPackageRepositoryCount": 0 }, "polytoil": { "title": "PolyTOIL", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/97aabd8e34d7ecfe3220a9ec356625f15c996943" ], "country": [ "Canada" ], "originCommunity": [ "Williams College", "Memorial University of Newfoundland" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3368", "centralPackageRepositoryCount": 0 }, "pomsky": { "title": "Pomsky", "appeared": 2022, "type": "pl", "creators": [ "Ludwig Stecher" ], "website": "https://pomsky-lang.org/", "oldName": "Rulex", "country": [ "Germany" ], "originCommunity": [ "https://github.com/rulex-rs" ], "example": [ "'Hello' ' '+ ('world' | 'pomsky')" ], "githubRepo": { "firstCommit": 2022, "stars": 1068, "forks": 15, "subscribers": 6, "created": 2022, "updated": 2023, "description": "A new, portable, regular expression language", "issues": 25, "url": "https://github.com/rulex-rs/pomsky" }, "repoStats": { "firstCommit": 2022, "commits": 347, "committers": 6, "files": 481 } }, "pony": { "title": "Pony", "appeared": 2012, "type": "pl", "website": "https://www.ponylang.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/ponylang" ], "domainName": { "registered": 2015, "name": "ponylang.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "env.out.print" ] ], "stringToken": [ [ "\"" ] ], "example": [ "actor Main\n new create(env: Env) =>\n env.out.print(\"Hello, world!\")" ], "githubRepo": { "stars": 5310, "forks": 411, "subscribers": 144, "created": 2012, "updated": 2023, "description": ":horse: Pony is an open-source, actor-model, capabilities-secure, high performance programming language", "issues": 270, "url": "https://github.com/ponylang/ponyc" }, "repoStats": { "firstCommit": 2012, "commits": 7220, "committers": 264, "files": 1043 }, "githubLanguage": { "fileExtensions": [ "pony" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.pony", "repos": 549, "id": "Pony" }, "githubBigQuery": { "repos": 78, "users": 59, "id": "Pony" }, "pygmentsHighlighter": { "filename": "pony.py", "fileExtensions": [ "pony" ], "id": "Pony" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 10, "commitCount": 32, "sampleCount": 6, "example": [ "actor Main\n new create(env: Env) =>\n env.out.print(\"Hello, world.\")\n" ], "url": "https://github.com/CausalityLtd/sublime-pony" }, "leachim6": { "filepath": "p/Pony.pony", "fileExtensions": [ "pony" ], "example": [ "actor Main\n new create(env: Env) =>\n env.out.print(\"Hello World\")\n" ], "id": "Pony" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Pony", "compilerExplorer": { "example": [ "actor Main\n var _env: Env\n\n new create(env: Env) =>\n _env = env\n square(3)\n\n fun square(num: I32): I32 =>\n num * num\n" ], "id": "Pony" }, "tryItOnline": "pony", "subreddit": [ { "memberCount": { "2017": 375, "2022": 672 }, "url": "https://reddit.com/r/ponylang" } ], "twitter": "https://twitter.com/ponylang", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "pop-11": { "title": "Pop-11", "appeared": 1999, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Sussex" ], "hasMultipleInheritance": { "example": "", "value": true }, "wikipedia": { "example": [ "define RemoveElementsMatching(Element, Source) -> Result;\n lvars Index;\n [[%\n for Index in Source do\n unless Index = Element or Index matches Element then\n Index;\n endunless;\n endfor;\n %]] -> Result;\n enddefine;\n\n RemoveElementsMatching(\"the\", [[the cat sat on the mat]]) => ;;; outputs [[cat sat on mat]]\n RemoveElementsMatching(\"the\", [[the cat] [sat on] the mat]) => ;;; outputs [[the cat] [sat on] mat]\n RemoveElementsMatching([[= cat]], [[the cat]] is a [[big cat]]) => ;;; outputs [[is a]]" ], "related": [ "poplog", "pop-2", "forth", "prolog", "common-lisp", "standard-ml", "cowsel" ], "summary": "POP-11 is a reflective, incrementally compiled programming language with many of the features of an interpreted language. It is the core language of the Poplog programming environment developed originally by the University of Sussex, and recently in the School of Computer Science at the University of Birmingham which hosts the Poplog website. POP-11 is an evolution of the language POP-2, developed in Edinburgh University and features an open stack model (like Forth, among others). It is mainly procedural, but supports declarative language constructs, including a pattern matcher and is mostly used for research and teaching in Artificial Intelligence, although it has features sufficient for many other classes of problems. It is often used to introduce symbolic programming techniques to programmers of more conventional languages like Pascal, who find POP syntax more familiar than that of Lisp. One of POP-11's features is that it supports first-class functions. Pop-11 is the core language of the Poplog system. The fact that the compiler and compiler subroutines are available at run-time (a requirement for incremental compilation) gives it the ability to support a far wider range of extensions than would be possible using only a macro facility. This made it possible for incremental compilers to be added for Prolog, Common Lisp and Standard ML, which could be added as required to support either mixed language development or development in the second language without using any Pop-11 constructs. This made it possible for Poplog to be used by teachers, researchers, or developers who were interested in only one of the languages. The most successful product developed in Pop-11 was the Clementine data-mining system, developed by ISL, as described in the entry on Poplog. After SPSS bought ISL they decided to port Clementine to C++ and Java, and eventually succeeded with great effort (and perhaps some loss of the flexibility provided by the use of an AI language!). As explained in the entries for Poplog and POP-2, Pop-11 was for a time available only as part of an expensive commercial package (Poplog), but since about 1999 it has been freely available as part of the Open Source version of Poplog, including various additional packages and teaching libraries. An online version of ELIZA using Pop-11 is available at Birmingham. At the University of Sussex David Young used Pop-11 in combination with C and Fortran to develop a suite of teaching and interactive development tools for image processing and vision, and has made them available in the Popvision extension to Poplog.", "pageId": 562827, "created": 2004, "backlinksCount": 26, "revisionCount": 75, "dailyPageViews": 18, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/POP-11" }, "hopl": "https://hopl.info/showlanguage.prx?exp=689", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "pop-2": { "title": "POP-2", "appeared": 1967, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of Edinburgh" ], "wikipedia": { "example": [ "vars operation 3 +*;\n lambda x y; x * x + y * y end -> nonop +*" ], "related": [ "cowsel", "algol-60", "pop-11", "unix", "prolog", "poplog", "common-lisp", "standard-ml" ], "summary": "POP-2 (also referred to as POP2) is a programming language developed around 1970 from the earlier language POP-1 (developed by Robin Popplestone in 1968, originally named COWSEL) by Robin Popplestone and Rod Burstall at the University of Edinburgh. It drew roots from many sources: the languages LISP and ALGOL 60, and theoretical ideas from Peter J. Landin. It used an incremental compiler, which gave it some of the flexibility of an interpreted language, including allowing new function definitions at run time and modification of function definitions while a program was running (both of which are features of dynamic compilation), without the overhead of an interpreted language.", "created": 2004, "backlinksCount": 34, "pageId": 981616, "revisionCount": 64, "dailyPageViews": 14, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/POP-2" }, "hopl": "https://hopl.info/showlanguage.prx?exp=298", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pop-pl": { "title": "Patient-Oriented Prescription Programming Language", "appeared": 2015, "type": "pl", "website": "https://users.cs.northwestern.edu/~sfq833/pop-pl/", "reference": [ "https://users.cs.northwestern.edu/~sfq833/resources/papers/GPCE_POP-PL_2015.pdf" ], "country": [ "United States" ], "originCommunity": [ "Northwestern University" ], "example": [ "#lang pop-pl\n\nused by JessieBrownVA\n\ninitially\n giveBolus 80 units/kg of: HEParin by: iv\n\ninfusion:\n whenever new aPTTResult\n aPTT < 45 | giveBolus 80 units/kg of: HEParin by: iv" ], "semanticScholar": "" }, "pop-protocol": { "title": "Post Office Protocol", "appeared": 1957, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "University of Southern California" ], "wikipedia": { "summary": "In computing, the Post Office Protocol (POP) is an application-layer Internet standard protocol used by e-mail clients to retrieve e-mail from a mail server.POP version 3 (POP3) is the version in common use.", "backlinksCount": 647, "pageId": 23062, "dailyPageViews": 481, "appeared": 1957, "url": "https://en.wikipedia.org/wiki/Post_Office_Protocol" }, "isbndb": "" }, "popasm": { "title": "PopAsm", "appeared": 2003, "type": "pl", "creators": [ "Helcio Bezerra de Mello" ], "documentation": [ "https://popasm.sourceforge.net/files/usr_man.pdf" ], "reference": [ "https://sourceforge.net/projects/popasm.berlios/" ], "country": [ "Unknown" ], "originCommunity": [ "https://sourceforge.net/p/popasm/feature-requests" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8630", "centralPackageRepositoryCount": 0 }, "popcorn-linux": { "title": "popcorn-linux", "appeared": 1994, "type": "os", "website": "http://popcornlinux.org/", "reference": [ "https://sourceforge.net/p/popcornlinux/_list/git" ], "country": [ "United States" ], "originCommunity": [ "Virginia Tech" ], "domainName": { "registered": 2012, "name": "popcornlinux.org" }, "centralPackageRepositoryCount": 0 }, "poplog": { "title": "POPLOG", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/804beaedcc3577a60b2f1bc177a96723fe70a888" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Sussex" ], "visualParadigm": false, "wikipedia": { "related": [ "pop-11", "common-lisp", "prolog", "standard-ml", "spss", "scheme", "sparc", "solaris", "powerpc", "pop-2" ], "summary": "Poplog is a reflective, incrementally compiled software development environment for the programming languages POP-11, Common Lisp, Prolog, and Standard ML, originally created in the UK for teaching and research in artificial intelligence at the University of Sussex.", "backlinksCount": 115, "pageId": 65118, "dailyPageViews": 13, "created": 2002, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/Poplog" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1705", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "popr": { "title": "popr", "appeared": 2012, "type": "pl", "description": "Popr applies concatenative programming to types as well as values, striving for purity and correctness, and efficient execution.", "website": "https://popr.dev", "webRepl": [ "http://hackerfoo.com/eval.html" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/HackerFoo/poprc/issues" ], "domainName": { "registered": 2019, "name": "popr.dev" }, "firstAnnouncement": "http://hackerfoo.com/presentations/ttpl_slides.html", "announcementMethod": "webpage", "compilesTo": [ "c" ], "hasGarbageCollection": { "example": "", "value": false }, "hasLazyEvaluation": { "example": "", "value": true }, "hasLineComments": { "example": "__ A comment", "value": true }, "hasComments": { "example": "__ A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "__" ] ], "example": [ "1 2 | 3 +" ], "githubRepo": { "stars": 194, "forks": 7, "subscribers": 14, "created": 2012, "updated": 2022, "firstCommit": 2012, "description": "A Compiler for the Popr Language", "issues": 0, "url": "https://github.com/HackerFoo/poprc" }, "repoStats": { "firstCommit": 2012, "commits": 1806, "committers": 3, "files": 164 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "popsy": { "title": "POPSY", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dcd4185a643a4dabeccde62520306eb0107f6baf" ], "country": [ "Germany" ], "originCommunity": [ "Rogowski-Institut fuer Elektrotechnik" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2819", "centralPackageRepositoryCount": 0 }, "port-alg": { "title": "PORT-ALG", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/53c2d575ec135ee9d6be06576bebc7ec118bb85b" ], "country": [ "United States" ], "originCommunity": [ "University of Alabama" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3886", "centralPackageRepositoryCount": 0 }, "portable-standard-lisp": { "title": "Portable Standard Lisp", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "University of Utah" ], "wikipedia": { "related": [ "c", "common-lisp" ], "summary": "Portable Standard Lisp (PSL) is a tail-recursive dynamically bound dialect of Lisp inspired by its predecessor, Standard Lisp and the Portable Lisp Compiler. It was developed by researchers at the University of Utah in 1980, which released PSL 3.1; development was handed over to developers at Hewlett-Packard in 1982 who released PSL 3.3 and up. Portable Standard Lisp was available as a kit containing a screen editor, a compiler, and an interpreter for the 68000 processor architecture, DEC-20s, CRAY-1s, and the VAX architecture (among many others). Today, PSL is mainly developed by and available from Konrad-Zuse-Zentrum für Informationstechnik Berlin. Its main modern use is as underlying language for implementations of Reduce.Like most older lisps, PSL in the first step compiles Lisp to LAP code, which is a platform independent language in its own. However, where older lisps mostly compiled LAP directly to assembler or some architecture dependent intermediate, PSL compiles the LAP to C code, which would run in a virtual machine language; so programs written in it in principle are as portable as C itself, which is very portable. The compiler itself was written in PSL or a more primitive dialect dubbed \"System Lisp\"/\"SYSLISP\" as \"an experiment in writing a production-quality Lisp in Lisp itself as much as possible, with only minor amounts of code written by hand in assembly language or other systems languages\", so the whole ensemble could bootstrap itself, and improvements to the compiler improved the compiler itself as well. Some later releases had a compatibility package for Common Lisp, but this is not sustained in the modern versions.", "created": 2006, "backlinksCount": 51, "pageId": 4243267, "revisionCount": 29, "dailyPageViews": 9, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Portable_Standard_Lisp" }, "centralPackageRepositoryCount": 0 }, "portal-langage": { "title": "Portal langage", "appeared": 1978, "type": "pl", "country": [ "Switzerland" ], "originCommunity": [ "LGZ LANDIS & GYR ZUG AG" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Portal_(langage)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=971", "centralPackageRepositoryCount": 0, "isbndb": "" }, "pose": { "title": "POSE", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/97db08d658408470b03edcb4f9f8f178d1fa6bbc" ], "country": [ "United States" ], "originCommunity": [ "Aerospace Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=299", "wordRank": 9747, "centralPackageRepositoryCount": 0 }, "post-canonical-system": { "title": "Post production", "appeared": 1941, "type": "grammarLanguage", "creators": [ "Emil Post" ], "reference": [ "http://www-formal.stanford.edu/jmc/mcc59.pdf" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "example": [ "Alphabet: {[, ]}\nInitial word: []\nProduction rules: \n(1) $ → [$]\n(2) $ → $$\n(3) $1$2 → $1[]$2" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Post_canonical_system" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2474", "isbndb": "" }, "post-x": { "title": "Post-X", "appeared": 1980, "type": "grammarLanguage", "creators": [ "P.A.C. Bailes", "L.H. Reeker" ], "description": "The Post-X language is designed to provide facilities for pattern-directed processing of strings, sequences and trees in an integrated applicative format.", "reference": [ "https://pdfs.semanticscholar.org/4949/e6dbe9967617534a3e9e5d66e1694a541d74.pdf" ], "country": [ "Australia" ], "originCommunity": [ "University of Queensland" ], "example": [ "REPLACE GRAM := \"<\"^BREAK\">\"^\"> ''\n {$<^((REPLACE GRAM)<\n SELECT RHS\n (ALT LTST<\n (LHS--FIND $2 }\n INULL{$$}; " ], "hopl": "https://hopl.info/showlanguage.prx?exp=5734" }, "postcss": { "title": "PostCSS", "appeared": 2013, "type": "textMarkup", "website": "https://postcss.org/", "documentation": [ "https://postcss.org/docs/" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/postcss" ], "domainName": { "registered": 2015, "awisRank": { "2022": 257386 }, "name": "postcss.org" }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2013, "stars": 26406, "forks": 1505, "subscribers": 525, "created": 2013, "updated": 2022, "description": "Transforming styles with JS plugins", "issues": 12, "url": "https://github.com/postcss/postcss" }, "repoStats": { "firstCommit": 2013, "commits": 3913, "committers": 432, "files": 102 }, "githubLanguage": { "fileExtensions": [ "pcss", "postcss" ], "trendingProjectsCount": 0, "type": "markup", "group": "CSS", "aceMode": "text", "tmScope": "source.postcss", "repos": 0, "id": "PostCSS" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 10, "commitCount": 231, "sampleCount": 1, "example": [ "@define-mixin size $size {\n width: $size;\n}\n\n$big: 100px;\n\n/* Main block */\n.block {\n &_logo {\n background: inline(\"./logo.png\");\n @mixin size $big;\n }\n}" ], "url": "https://github.com/hudochenkov/Syntax-highlighting-for-PostCSS" }, "leachim6": { "filepath": "p/PostCSS.pcss", "fileExtensions": [ "pcss" ], "example": [ "body::before {\n content: \"Hello World\";\n}" ], "id": "PostCSS" }, "twitter": "https://twitter.com/postcss", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "postgresql": { "title": "PostgreSQL", "appeared": 1986, "type": "queryLanguage", "creators": [ "Marc G. Fournier" ], "website": "https://www.postgresql.org/", "documentation": [ "https://www.postgresql.org/docs/" ], "emailList": [ "https://www.postgresql.org/list/" ], "aka": [ "pgsql" ], "country": [ "United States" ], "originCommunity": [ "University of California" ], "domainName": { "registered": 1996, "awisRank": { "2022": 5404 }, "name": "postgresql.org" }, "releaseNotesUrl": "https://www.postgresql.org/docs/release/", "writtenIn": [ "c" ], "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "ABORT", "ABS", "ABSOLUTE", "ACCESS", "ACTION", "ADA", "ADD", "ADMIN", "AFTER", "AGGREGATE", "ALIAS", "ALL", "ALLOCATE", "ALTER", "ANALYSE", "ANALYZE", "AND", "ANY", "ARE", "ARRAY", "AS", "ASC", "ASENSITIVE", "ASSERTION", "ASSIGNMENT", "ASYMMETRIC", "AT", "ATOMIC", "AUTHORIZATION", "AVG", "BACKWARD", "BEFORE", "BEGIN", "BETWEEN", "BIGINT", "BINARY", "BIT", "BITVAR", "BIT_LENGTH", "BLOB", "BOOLEAN", "BOTH", "BREADTH", "BY", "CACHE", "CALL", "CALLED", "CARDINALITY", "CASCADE", "CASCADED", "CASE", "CAST", "CATALOG", "CATALOG_NAME", "CHAIN", "CHAR", "CHARACTER", "CHARACTERISTICS", "CHARACTER_LENGTH", "CHARACTER_SET_CATALOG", "CHARACTER_SET_NAME", "CHARACTER_SET_SCHEMA", "CHAR_LENGTH", "CHECK", "CHECKED", "CHECKPOINT", "CLASS", "CLASS_ORIGIN", "CLOB", "CLOSE", "CLUSTER", "COALESCE", "COBOL", "COLLATE", "COLLATION", "COLLATION_CATALOG", "COLLATION_NAME", "COLLATION_SCHEMA", "COLUMN", "COLUMN_NAME", "COMMAND_FUNCTION", "COMMAND_FUNCTION_CODE", "COMMENT", "COMMIT", "COMMITTED", "COMPLETION", "CONDITION_NUMBER", "CONNECT", "CONNECTION", "CONNECTION_NAME", "CONSTRAINT", "CONSTRAINTS", "CONSTRAINT_CATALOG", "CONSTRAINT_NAME", "CONSTRAINT_SCHEMA", "CONSTRUCTOR", "CONTAINS", "CONTINUE", "CONVERSION", "CONVERT", "COPY", "CORRESPONDING", "COUNT", "CREATE", "CREATEDB", "CREATEUSER", "CROSS", "CUBE", "CURRENT", "CURRENT_DATE", "CURRENT_PATH", "CURRENT_ROLE", "CURRENT_TIME", "CURRENT_TIMESTAMP", "CURRENT_USER", "CURSOR", "CURSOR_NAME", "CYCLE", "DATA", "DATABASE", "DATE", "DATETIME_INTERVAL_CODE", "DATETIME_INTERVAL_PRECISION", "DAY", "DEALLOCATE", "DEC", "DECIMAL", "DECLARE", "DEFAULT", "DEFERRABLE", "DEFERRED", "DEFINED", "DEFINER", "DELETE", "DELIMITER", "DELIMITERS", "DEPTH", "DEREF", "DESC", "DESCRIBE", "DESCRIPTOR", "DESTROY", "DESTRUCTOR", "DETERMINISTIC", "DIAGNOSTICS", "DICTIONARY", "DISCONNECT", "DISPATCH", "DISTINCT", "DO", "DOMAIN", "DOUBLE", "DROP", "DYNAMIC", "DYNAMIC_FUNCTION", "DYNAMIC_FUNCTION_CODE", "EACH", "ELSE", "ENCODING", "ENCRYPTED", "END", "END-EXEC", "EQUALS", "ESCAPE", "EVERY", "EXCEPT", "EXCEPTION", "EXCLUSIVE", "EXEC", "EXECUTE", "EXISTING", "EXISTS", "EXPLAIN", "EXTERNAL", "EXTRACT", "FALSE", "FETCH", "FINAL", "FIRST", "FLOAT", "FOR", "FORCE", "FOREIGN", "FORTRAN", "FORWARD", "FOUND", "FREE", "FREEZE", "FROM", "FULL", "FUNCTION", "GENERAL", "GENERATED", "GET", "GLOBAL", "GO", "GOTO", "GRANT", "GRANTED", "GROUP", "GROUPING", "HANDLER", "HAVING", "HIERARCHY", "HOLD", "HOST", "HOUR", "IDENTITY", "IGNORE", "ILIKE", "IMMEDIATE", "IMMUTABLE", "IMPLEMENTATION", "IMPLICIT", "IN", "INCREMENT", "INDEX", "INDICATOR", "INFIX", "INHERITS", "INITIALIZE", "INITIALLY", "INNER", "INOUT", "INPUT", "INSENSITIVE", "INSERT", "INSTANCE", "INSTANTIABLE", "INSTEAD", "INT", "INTEGER", "INTERSECT", "INTERVAL", "INTO", "INVOKER", "IS", "ISNULL", "ISOLATION", "ITERATE", "JOIN", "KEY", "KEY_MEMBER", "KEY_TYPE", "LANCOMPILER", "LANGUAGE", "LARGE", "LAST", "LATERAL", "LEADING", "LEFT", "LENGTH", "LESS", "LEVEL", "LIKE", "LIMIT", "LISTEN", "LOAD", "LOCAL", "LOCALTIME", "LOCALTIMESTAMP", "LOCATION", "LOCATOR", "LOCK", "LOWER", "MAP", "MATCH", "MAX", "MAXVALUE", "MESSAGE_LENGTH", "MESSAGE_OCTET_LENGTH", "MESSAGE_TEXT", "METHOD", "MIN", "MINUTE", "MINVALUE", "MOD", "MODE", "MODIFIES", "MODIFY", "MODULE", "MONTH", "MORE", "MOVE", "MUMPS", "NAME", "NAMES", "NATIONAL", "NATURAL", "NCHAR", "NCLOB", "NEW", "NEXT", "NO", "NOCREATEDB", "NOCREATEUSER", "NONE", "NOT", "NOTHING", "NOTIFY", "NOTNULL", "NULL", "NULLABLE", "NULLIF", "NUMBER", "NUMERIC", "-", "0", "OBJECT", "OCTET_LENGTH", "OF", "OFF", "OFFSET", "OIDS", "OLD", "ON", "ONLY", "OPEN", "OPERATION", "OPERATOR", "OPTION", "OPTIONS", "OR", "ORDER", "ORDINALITY", "OUT", "OUTER", "OUTPUT", "OVERLAPS", "OVERLAY", "OVERRIDING", "OWNER", "PAD", "PARAMETER", "PARAMETERS", "PARAMETER_MODE", "PARAMETER_NAME", "PARAMETER_ORDINAL_POSITION", "PARAMETER_SPECIFIC_CATALOG", "PARAMETER_SPECIFIC_NAME", "PARAMETER_SPECIFIC_SCHEMA", "PARTIAL", "PASCAL", "PASSWORD", "PATH", "PENDANT", "PLACING", "PLI", "POSITION", "POSTFIX", "PRECISION", "PREFIX", "PREORDER", "PREPARE", "PRESERVE", "PRIMARY", "PRIOR", "PRIVILEGES", "PROCEDURAL", "PROCEDURE", "PUBLIC", "READ", "READS", "REAL", "RECHECK", "RECURSIVE", "REF", "REFERENCES", "REFERENCING", "REINDEX", "RELATIVE", "RENAME", "REPEATABLE", "REPLACE", "RESET", "RESTRICT", "RESULT", "RETURN", "RETURNED_LENGTH", "RETURNED_OCTET_LENGTH", "RETURNED_SQLSTATE", "RETURNS", "REVOKE", "RIGHT", "ROLE", "ROLLBACK", "ROLLUP", "ROUTINE", "ROUTINE_CATALOG", "ROUTINE_NAME", "ROUTINE_SCHEMA", "ROW", "ROWS", "ROW_COUNT", "RULE", "SAVEPOINT", "SCALE", "SCHEMA", "SCHEMA_NAME", "SCOPE", "SCROLL", "SEARCH", "SECOND", "SECTION", "SECURITY", "SELECT", "SELF", "SENSITIVE", "SEQUENCE", "SERIALIZABLE", "SERVER_NAME", "SESSION", "SESSION_USER", "SET", "SETOF", "SETS", "SHARE", "SHOW", "SIMILAR", "SIMPLE", "SIZE", "SMALLINT", "SOME", "SOURCE", "SPACE", "SPECIFIC", "SPECIFICTYPE", "SPECIFIC_NAME", "SQL", "SQLCODE", "SQLERROR", "SQLEXCEPTION", "SQLSTATE", "SQLWARNING", "STABLE", "START", "STATE", "STATEMENT", "STATIC", "STATISTICS", "STDIN", "STDOUT", "STORAGE", "STRICT", "STRUCTURE", "STYLE", "SUBCLASS_ORIGIN", "SUBLIST", "SUBSTRING", "SUM", "SYMMETRIC", "SYSID", "SYSTEM", "SYSTEM_USER", "TABLE", "TABLE_NAME", "TEMP", "TEMPLATE", "TEMPORARY", "TERMINATE", "THAN", "THEN", "TIME", "TIMESTAMP", "TIMEZONE_HOUR", "TIMEZONE_MINUTE", "TO", "TOAST", "TRAILING", "TRANSACTION", "TRANSACTIONS_COMMITTED", "TRANSACTIONS_ROLLED_BACK", "TRANSACTION_ACTIVE", "TRANSFORM", "TRANSFORMS", "TRANSLATE", "TRANSLATION", "TREAT", "TRIGGER", "TRIGGER_CATALOG", "TRIGGER_NAME", "TRIGGER_SCHEMA", "TRIM", "TRUE", "TRUNCATE", "TRUSTED", "TYPE", "UNCOMMITTED", "UNDER", "UNENCRYPTED", "UNION", "UNIQUE", "UNKNOWN", "UNLISTEN", "UNNAMED", "UNNEST", "UNTIL", "UPDATE", "UPPER", "USAGE", "USER", "USER_DEFINED_TYPE_CATALOG", "USER_DEFINED_TYPE_NAME", "USER_DEFINED_TYPE_SCHEMA", "USING", "VACUUM", "VALID", "VALIDATOR", "VALUE", "VALUES", "VARCHAR", "VARIABLE", "VARYING", "VERBOSE", "VERSION", "VIEW", "VOLATILE", "WHEN", "WHENEVER", "WHERE", "WITH", "WITHOUT", "WORK", "WRITE", "YEAR", "ZONE" ], "githubRepo": { "stars": 10491, "forks": 3385, "subscribers": 489, "created": 2010, "updated": 2022, "firstCommit": 1996, "description": "Mirror of the official PostgreSQL GIT repository. Note that this is just a *mirror* - we don't work with pull requests on github. To contribute, please see https://wiki.postgresql.org/wiki/Submitting_a_Patch", "issues": 0, "url": "https://github.com/postgres/postgres" }, "repoStats": { "firstCommit": 1996, "commits": 86375, "committers": 55, "files": 6704 }, "wikipedia": { "related": [ "c", "linux", "sql", "gist", "xml", "xpath", "json", "julia", "go", "r", "d", "erlang", "plpgsql", "pl-sql", "sql-psm", "perl", "python", "tcl", "java", "javascript", "ruby", "regex", "tls", "freebsd", "solaris", "x86-isa", "powerpc", "systemz", "sparc", "arm", "mips", "visual-basic", "mysql", "aws" ], "summary": "PostgreSQL, often simply Postgres, is an object-relational database management system (ORDBMS) with an emphasis on extensibility and standards compliance. As a database server, its primary functions are to store data securely and return that data in response to requests from other software applications. It can handle workloads ranging from small single-machine applications to large Internet-facing applications (or for data warehousing) with many concurrent users; on macOS Server, PostgreSQL is the default database; and it is also available for Microsoft Windows and Linux (supplied in most distributions). PostgreSQL is ACID-compliant and transactional. PostgreSQL has updatable views and materialized views, triggers, foreign keys; supports functions and stored procedures, and other expandability. PostgreSQL is developed by the PostgreSQL Global Development Group, a diverse group of many companies and individual contributors. It is free and open-source, released under the terms of the PostgreSQL License, a permissive software license.", "pageId": 23824, "dailyPageViews": 1262, "created": 2001, "backlinksCount": 991, "revisionCount": 2302, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/PostgreSQL" }, "monaco": "pgsql", "helloWorldCollection": [ "-- Hello World in PL/pgSQL (PostgreSQL Procedural Language)\n-- In old versions replace '$$' by double qoutes\n\nCREATE FUNCTION hello_world() RETURNS text AS $$\nBEGIN\nRETURN 'Hello World';\nEND\n$$ LANGUAGE plpgsql;\n\nSELECT hello_world();\n" ], "rijuRepl": { "example": [ "SELECT 'Hello, world!';\n" ], "id": "https://riju.codes/postgresql" }, "indeedJobs": { "2022": 9946, "query": "postgresql developer" }, "linkedInSkill": { "2018": 313773, "id": "postgresql" }, "annualReportsUrl": [ "https://www.postgresql.org/about/policies/coc/" ], "officialBlogUrl": [ "https://www.postgresql.org/about/newsarchive/" ], "eventsPageUrl": [ "https://www.postgresql.org/about/events/" ], "faqPageUrl": [ "https://www.postgresql.org/docs/faq/" ], "downloadPageUrl": [ "https://www.postgresql.org/download/" ], "subreddit": [ { "url": "https://www.reddit.com/r/PostgreSQL/" } ], "twitter": "https://twitter.com/postgresql", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPostgreSQL Developer's Handbook|2001|Ewald Geschwinde|570422|3.17|6|0\nPostgreSQL Server Programming|2012|Hannu Krosing|24026689|3.87|15|3\nPostgreSQL Developer's Guide|2015|Ibrar Ahmed|44827008|3.75|8|2", "isbndb": "year|publisher|title|authors|isbn13\n2002|Sams Publishing|PHP and PostgreSQL Advanced Web Programming|Geschwinde, Ewald and Schoenig, Hans-Juergen|9780672323829\n2013|Packt Publishing|PostgreSQL Server Programming|Hannu Krosing and Kirk Roybal and Jim Mlodgenski|9781849516983\n2016-09-26|Packt Publishing|PostgreSQL Development Essentials|Manpreet Kaur and Baji Shaik|9781783989003\n2018|Apress|Beginning PostgreSQL on the Cloud: Simplifying Database as a Service on Cloud Platforms|Shaik, Baji and Vallarapu, Avinash|9781484234471\n2011|Fultus Corporation|PostgreSQL 9.0 Official Documentation - Volume III. Server Programming|Postgresql Global Development Group and The Postgresql Global Development Group|9781596822481\n2015|Packt Publishing|PostgreSQL Server Programming - Second Edition|Dar, Usama and Krosing, Hannu and Mlodgenski, Jim and Roybal, Kirk|9781783980598\n2016|Samurai Media Limited|Postgresql 9.5 Vol4: Server Programming (volume 4)|Postgresql Development Group|9789888406340\n2017|Samurai Media Limited|Postgresql 9.6 Vol4: Server Programming (volume 4)|Postgresql Development Group|9789888406715\n2020|Apress|PostgreSQL Configuration: Best Practices for Performance and Security|Shaik, Baji|9781484256633\n2002|O'Reilly Media|Practical PostgreSQL|Drake, Joshua D. and Worsley, John C.|9781565928466\n2005|Sams Publishing|PostgreSQL|Douglas, Korry|9780672327568\n2010|Packt Publishing|PostgreSQL 9.0 High Performance|Smith, Gregory|9781849510301\n2017|Packt Publishing|Learning PostgreSQL 10 - Second Edition: A beginner's guide to building high-performance PostgreSQL database solutions|Juba, Salahaldin and Volkov, Andrey|9781788470667\n2015|Packt Publishing|Learning PostgreSQL: Create, develop and manage relational databases in real world applications using PostgreSQL|Juba, Salahaldin and Vannahme, Achim and Volkov, Andrey|9781783989188\n2018|Packt Publishing|PostgreSQL 11 Server Side Programming Quick Start Guide: Effective database programming and interaction|Ferrari, Luca|9781789343502\n2015|Packt Publishing|PostgreSQL Server Programming - Second Edition|Dar, Usama and Krosing, Hannu and Mlodgenski, Jim and Roybal, Kirk|9781783980581\n2018|Packt Publishing|PostgreSQL 11 Server Side Programming Quick Start Guide: Effective database programming and interaction|Ferrari, Luca|9781789342222\n2006|Apress|Beginning PHP and PostgreSQL E-Commerce: From Novice to Professional (Beginning, from Novice to Professional)|Darie, Cristian and Bucica, Mihai and Balanescu, Emilian|9781590596487\n2009|Fultus Corporation|PostgreSQL 8.4 Official Documentation - Volume III. Server Programming|The PostgreSQL Global Development Group|9781596821606\n2019|Independently published|Learn PyQt The Hard Way: A Quick Start Guide to PostgreSQL and SQLite Driven Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781711384313\n20020107|O'Reilly Media, Inc.|Practical PostgreSQL|Joshua D. Drake; John C. Worsley|9781449310103\n20020107|O'Reilly Media, Inc.|Practical PostgreSQL|Joshua D. Drake|9781449310288\n30-11-2015|Packt Publishing|Learning PostgreSQL|Salahaldin Juba|9781783989195\n44113|Packt Publishing|Learn PostgreSQL|Luca Ferrari; Enrico Pirozzi|9781838986896\n2000|Iuniverse Inc|Postgresql Programmer's Guide|Thomas Lockhart|9780595149179\n2013-08-26|Packt Publishing|PostgreSQL Replication|Zoltan Boszormenyi and Hans-Jurgen Schonig|9781849516730\n20130625|Packt Publishing|PostgreSQL Server Programming|Hannu Krosing; Kirk Roybal; Jim Mlodgenski|9781849516990\n20210422|Springer Nature|PostgreSQL Query Optimization|Henrietta Dombrovskaya; Boris Novikov; Anna Bailliekova|9781484268858\n26-09-2016|Packt Publishing|PostgreSQL Development Essentials|Manpreet Kaur|9781783989010\n31-01-2019|Packt Publishing|Learning PostgreSQL 11|Salahaldin Juba; Andrey Volkov|9781789535211\n20150227|Packt Publishing|PostgreSQL Developer's Guide|Ahmed Ibrar|9781783989034\n2015|Samurai Media Limited|Postgresql 9.4 Vol4: Server Programming|Postgresql Development Group|9789888381340\n20061121|Springer Nature|Beginning PHP and PostgreSQL 8|W Jason Gilmore; Robert H. Treat|9781430201366\n13-08-2021|Packt Publishing|Developing Modern Database Applications with PostgreSQL|Dr. Quan Ha Le; Marcelo Diaz|9781838641061\n2017-10-26|Samurai Media Limited|Postgresql 10 Vol4: Server Programming (volume 4)|Postgresql Development Group|9789888407255\n2007|Network Theory Ltd.|The Postgresql Reference Manual Volume 2: Programming Guide|The Postgresql Global Development Group|9780954612030\n2010|Network Theory Ltd.|Postgresql 9.0 Reference Manual - Volume 2: Programming Guide|Postgresql Global Development Group|9781906966065", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Implementasi JSON untuk Minimasi Penggunaan Jumlah Kolom Suatu Tabel Pada Database PostgreSQL|10.21070/JOINCS.V1I1.802|5|1|M. A. Rosid|6b6d9197323171c9e0b36379319b941a133908fe\n2017|Penerapan Replikasi Data pada Aplikasi Ticketing Menggunakan Slony PostgreSQL|10.30871/JAIC.V1I2.472|4|0|Defriyanuar Dhining and Yeni Rokhayati and D. Kurniawan|3e756dc9289583f7046a3a3685f2721e56c3f565\n2017|Query compilation in PostgreSQL by specialization of the DBMS source code|10.1134/S0361768817060068|2|0|E. Sharygin and R. Buchatskiy and Roman Zhuykov and A. Sher|fbbd9fec8f42fb1aa2608ecd5d757002e62d8609" }, "postscript": { "title": "PostScript", "appeared": 1982, "type": "textMarkup", "creators": [ "John Warnock", "Chuck Geschke", "Doug Brotz", "Ed Taft", "Bill Paxton" ], "description": "Postscript is a graphical page description language invented by ChuckGetsche and JohnWarnock (the President and CEO of Adobe). Its syntax looks a little bit like Forth, because it is derived from Forth; however, Postscript's internal implementation has nothing to do with Forth.", "documentation": [ "https://www.pdfa.org/norm-refs/PLRM.pdf" ], "country": [ "United States" ], "originCommunity": [ "Adobe" ], "hasComments": { "example": "", "value": true }, "hasPostfixNotation": { "example": "", "value": true }, "hasLineComments": { "example": "% A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasOctals": { "example": "% [0-9]+\\#(\\-|\\+)?([0-9]+\\.?|[0-9]*\\.[0-9]+|[0-9]+\\.[0-9]*)((e|E)[0-9]+)?(?=[()<>\\[\\]{}/%\\s])", "value": true }, "hasHexadecimals": { "example": "% <[0-9A-Fa-f]+>(?=[()<>\\[\\]{}/%\\s])", "value": true }, "hasFloats": { "example": "% (\\-|\\+)?([0-9]+\\.?|[0-9]*\\.[0-9]+|[0-9]+\\.[0-9]*)((e|E)[0-9]+)?(?=[()<>\\[\\]{}/%\\s])", "value": true }, "hasIntegers": { "example": "% (\\-|\\+)?[0-9]+(?=[()<>\\[\\]{}/%\\s])", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "lineCommentToken": [ [ "%" ] ], "printToken": [ [ "print" ] ], "wikipedia": { "example": [ "/mm {360 mul 127 div} def\n 0 0 moveto\n 0 40 mm lineto stroke" ], "related": [ "ghostscript", "lisp", "pdf", "ascii", "tex", "forth", "reverse-polish-notation", "latex" ], "summary": "PostScript (PS) is a page description language in the electronic publishing and desktop publishing business. It is a dynamically typed, concatenative programming language and was created at Adobe Systems by John Warnock, Charles Geschke, Doug Brotz, Ed Taft and Bill Paxton from 1982 to 1984.", "pageId": 24080, "dailyPageViews": 473, "created": 2001, "backlinksCount": 942, "revisionCount": 914, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/PostScript" }, "githubLanguage": { "fileExtensions": [ "ps", "eps", "epsi", "pfa" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "text", "tmScope": "source.postscript", "aliases": [ "postscr" ], "repos": 8053, "id": "PostScript" }, "githubBigQuery": { "repos": 4145, "users": 3932, "id": "PostScript" }, "pygmentsHighlighter": { "filename": "graphics.py", "fileExtensions": [ "ps", "eps" ], "id": "PostScript" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2011, "committerCount": 3, "commitCount": 10, "sampleCount": 2, "example": [ "%!PS-Adobe-3.0\n%%Creator: Aaron Puchert\n%%Title: The Sierpinski triangle\n%%Pages: 1\n%%PageOrder: Ascend\n\n%%BeginProlog\n% PAGE SETTINGS\n/pageset {\n 28.3464566 28.3464566 scale % set cm = 1\n 0.5 0.5 translate\n 0 setlinewidth\n} def\n\n% sierpinski(n) draws a sierpinski triangle of order n\n/sierpinski {\ndup 0 gt {\n [0.5 0 0 0.5 0 0] concat dup 1 sub sierpinski\n [1 0 0 1 1 0] concat dup 1 sub sierpinski\n [1 0 0 1 -1 1] concat dup 1 sub sierpinski\n [2 0 0 2 0 -1] concat\n} {\n newpath\n 0 0 moveto\n 1 0 lineto\n 0 1 lineto\n closepath\n fill\n} ifelse pop} def\n%%EndProlog\n\n%%BeginSetup\n<< /PageSize [596 843] >> setpagedevice % A4\n%%EndSetup\n\n%%Page: Test 1\npageset\n[20 0 10 300 sqrt 0 0] concat\n9 sierpinski\nshowpage\n%%EOF\n" ], "url": "https://github.com/textmate/postscript.tmbundle" }, "helloWorldCollection": [ "% Hello World in Postscript\n%!PS\n/Palatino-Roman findfont\n100 scalefont\nsetfont\n100 100 moveto\n(Hello World!) show\nshowpage\n" ], "leachim6": { "filepath": "p/PostScript.ps", "fileExtensions": [ "ps" ], "example": [ "% run> gs -q -sDEVICE=nullpage postscript.ps\n(Hello World\\n) print quit" ], "id": "PostScript" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:PostScript", "quineRelay": "PostScript", "rijuRepl": { "example": [ "(Hello, world!) =\n" ], "id": "https://riju.codes/postscript" }, "tiobe": { "id": "PostScript" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1010", "ubuntuPackage": "ghostscript", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPostScript Language Tutorial and Cookbook|1985|Adobe Systems Inc.|1604758|3.47|15|0\nPostScript Language Reference Manual|1990|Adobe Creative Team|3440124|3.67|9|0", "isbndb": "year|publisher|title|authors|isbn13\n1991|Peachpit Press Publications|Inside PostScript|Frank Braswell|9780938151104\n2004|Cambridge University Press|Mathematical Illustrations: A Manual of Geometry and PostScript|Casselman, Bill|9780521547888\n1991|Addison-Wesley|Programming the Display Postscript System With Nextstep|Adobe Systems|9780201581355\n2005|Cambridge University Press|Mathematical Illustrations: A Manual of Geometry and PostScript|Casselman, Bill|9780521839211\n1990|Addison-wesley Longman, Incorporated|Display Postscript Programming|David A. Holzgang|9780201518146\n1987|Sybex|Understanding Postscript Programming|David A Holzgang|9780895883964\n1988|Sybex|Understanding Postscript Programming|David A Holzgang|9780895885661\n2018|Springer|Postscript & Acrobat/pdf|Thomas Merz|9783642603846\n1994|Van Nostrand Reinhold Computer|Postscript Typeface Library: Sans Serif Design, Outline & Ornaments|Tony Esposito and Jean Callan King|9780442014940\n1993|Addison-wesley|Programming The Display Postscript System With X (apl)|Adobe Systems|9780201622034\n1996|Springer|Postscript And Acrobat/pdf: Applications, Troubleshooting, And Cross-platform-publishing|Thomas Merz|9783540608547", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2007|Teaching compiler construction and language design: making the case for unusual compiler projects with postscript as the target language|10.1145/1227310.1227460|13|0|Martin Ruckert|91505badeba72e85a565b340b743106994710b46" }, "potential": { "title": "potential", "appeared": 2010, "type": "pl", "creators": [ "Tim Carstens" ], "website": "https://web.archive.org/web/20150714061208/https://potential-lang.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/intoverflow/Potential/issues" ], "domainName": { "name": "potential-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n1419278|Monads in Potential: a type-safe x86-64 assembly language|http://potential-lang.org/2010/06/09/monads-in-potential/|2010-06-10 06:03:18 UTC|1276149798|mbrubeck|0|17" }, "potion": { "title": "Potion", "appeared": 2007, "type": "pl", "creators": [ "Jonathan Gillette" ], "description": "Potion is an object- and mixin-oriented (traits) language.", "website": "http://perl11.org/potion/", "reference": [ "http://groups.google.com/group/potion-lang", "https://news.ycombinator.com/item?id=21176027" ], "country": [ "United States and Germany and The Netherlands" ], "originCommunity": [ "https://github.com/perl11" ], "githubRepo": { "firstCommit": 2008, "stars": 624, "forks": 93, "subscribers": 28, "created": 2009, "updated": 2023, "description": "_why the lucky stiff's little language (the official repo... until _why returns)", "issues": 21, "url": "https://github.com/perl11/potion" }, "repoStats": { "firstCommit": 2008, "commits": 2283, "committers": 29, "files": 214 }, "wikipedia": { "dailyPageViews": -1, "url": "https://web.archive.org/web/20150325130627/https://en.wikipedia.org/wiki/Potion_(programming_language)" }, "centralPackageRepositoryCount": 0 }, "pov-ray-sdl": { "title": "POV-Ray SDL", "appeared": 1991, "type": "pl", "creators": [ "Chris Cason" ], "reference": [ "http://www.povray.org/documentation/view/3.6.0/224/" ], "aka": [ "POVRay" ], "country": [ "United States" ], "originCommunity": [ "Persistence of Vision Raytracer Pty. Ltd" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasFloats": { "example": "// [0-9]*\\.[0-9]+", "value": true }, "hasIntegers": { "example": "// [0-9]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "firstCommit": 2013, "stars": 1149, "forks": 273, "subscribers": 97, "created": 2013, "updated": 2022, "description": "The Persistence of Vision Raytracer: http://www.povray.org/", "issues": 195, "url": "https://github.com/POV-Ray/povray" }, "repoStats": { "firstCommit": 2013, "commits": 1029, "committers": 21, "files": 11792 }, "githubLanguage": { "fileExtensions": [ "pov", "inc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.pov-ray sdl", "aliases": [ "pov-ray", "povray" ], "repos": 3, "id": "POV-Ray SDL" }, "githubBigQuery": { "repos": 493, "users": 482, "id": "POV-Ray SDL" }, "pygmentsHighlighter": { "filename": "graphics.py", "fileExtensions": [ "pov", "inc" ], "id": "POVRay" }, "linguistGrammarRepo": { "sampleCount": 12, "example": [ "// This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License.\n// To view a copy of this license, visit http://creativecommons.org/licenses/by-sa/3.0/ or send a\n// letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA.\n\n// Persistence Of Vision Ray Tracer Include File\n// File: water.inc\n// Desc: water for 'balcony.pov' demonstration scene\n// Date: July/August 2001\n// Auth: Christoph Hormann\n\n// Updated: 09Aug2008 (jh) for v3.7 distribution\n\n/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*/\n\n#if (version < 3.7)\n #version 3.5;\n#end\n\n#include \"functions.inc\"\n\n#declare RMF=function{ f_ridged_mf(x, y, z, 0.07, 2.2, 7, 0.6, 0.9, 1)}\n\n#declare M_Watx4 =\nmaterial {\n texture {\n pigment {\n color rgbt <0.2, 0.22, 0.21, 0.94>\n }\n finish {\n diffuse 0.0\n ambient -0.2\n\n reflection {\n 0.0, 0.95\n fresnel on\n }\n\n conserve_energy\n\n specular 0.4\n roughness 0.007\n }\n normal{\n function { RMF(x, y, z) } 0.8\n scale 0.3\n }\n }\n interior {\n ior 1.31\n fade_distance 5\n fade_power 1001.0\n fade_color <0.02, 0.20, 0.06>\n }\n}\n\nplane {\n z, -1\n material {\n M_Watx4\n }\n hollow on\n}\n\nplane {\n z, -12.0\n\n texture {\n pigment { color rgb 0 }\n finish { ambient 0.0 diffuse 0.0 }\n }\n hollow on\n}\n\n/*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*/" ], "url": "https://github.com/c-lipka/language-povray" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "power-bi-app": { "title": "Power BI", "appeared": 2011, "type": "application", "website": "https://powerbi.microsoft.com/en-us/", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "summary": "Power BI is a business analytics service by Microsoft. It aims to provide interactive visualizations and business intelligence capabilities with an interface simple enough for end users to create their own reports and dashboards.", "backlinksCount": 37, "pageId": 50418026, "dailyPageViews": 1116, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Power_BI" } }, "power-query-m": { "title": "PowerQuery M", "appeared": 2015, "type": "queryLanguage", "description": "The Power Query M formula language is optimized for building highly flexible data mashup queries. It's a functional, case sensitive language similar to F#.", "website": "https://docs.microsoft.com/en-us/powerquery-m/", "reference": [ "https://docs.microsoft.com/en-us/powerquery-m/power-query-m-type-system" ], "aka": [ "m", "powerquery" ], "originCommunity": [ "Microsoft" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "as", "each", "else", "error", "false", "if", "in", "is", "let", "meta", "otherwise", "section", "shared", "then", "true", "try", "type" ], "example": [ "\"Hello World\" // a text value \n123 // a number \n1 + 2 // sum of two numbers \n{1, 2, 3} // a list of three numbers \n[ x = 1, y = 2 + 3 ] // a record containing two fields: \n // x and y \n(x, y) => x + y // a function that computes a sum \nif 2 > 1 then 2 else 1 // a conditional expression \nlet x = 1 + 1 in x * 2 // a let expression \nerror \"A\" // error with message \"A\"", "let Orders = Table.FromRecords({ \n [OrderID = 1, CustomerID = 1, Item = \"fishing rod\", Price = 100.0], \n [OrderID = 2, CustomerID = 1, Item = \"1 lb. worms\", Price = 5.0], \n [OrderID = 3, CustomerID = 2, Item = \"fishing net\", Price = 25.0]}), \n #\"Capitalized Each Word\" = Table.TransformColumns(Orders, {\"Item\", Text.Proper}) \nin \n #\"Capitalized Each Word\"" ], "monaco": "powerquery", "centralPackageRepositoryCount": 0, "isbndb": "" }, "powerbasic": { "title": "PowerBASIC", "appeared": 1989, "type": "pl", "country": [ "United States" ], "originCommunity": [ "PowerBASIC Inc" ], "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "'" ] ], "wikipedia": { "example": [ "#Compile Exe ' using either PBCC6 or PBWIN10 compiler\n#Dim All\n\nFunction PBMain \n Local GW As Dword\n ' start a GRAPHIC WINDOW\n Graphic Window New \"graphic window\", 100, 100, 200, 200 to GW\n ' show a coloured disc\n Graphic Ellipse (10, 10)-(190, 190), %rgb_Red, %rgb_SeaGreen, 0\n ' wait for a keypress\n Graphic Waitkey$\nEnd Function" ], "related": [ "turbo-basic-xl", "turbo-basic", "basic", "qbasic", "quickbasic", "algol", "assembly-language", "x86-isa", "mmx" ], "summary": "PowerBASIC, formerly Turbo Basic, is the brand of several commercial compilers by PowerBASIC Inc. that compile a dialect of the BASIC programming language. There are both MS-DOS and Windows versions, and two kinds of the latter: Console and Windows. The MS-DOS version has a syntax similar to that of QBasic and QuickBASIC. The Windows versions use a BASIC syntax expanded to include many Windows functions, and the statements can be combined with calls to the Windows API.", "created": 2002, "backlinksCount": 135, "pageId": 64316, "revisionCount": 449, "dailyPageViews": 43, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/PowerBASIC" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:PowerBASIC", "centralPackageRepositoryCount": 0, "isbndb": "" }, "powerbuilder": { "title": "PowerBuilder", "appeared": 2010, "type": "pl", "country": [ "Germany" ], "originCommunity": [ "SAP SE" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "MessageBox" ] ], "stringToken": [ [ "\"" ] ], "example": [ "// The MIT License (MIT)\n\n// Copyright (c) 2016 dario ureña\n\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\n\n// Source: https://github.com/darioaxel/PowerScriptToKDMTransformer/blob/173c3949d5684150c34f7405f0689310eade0362/resources/basics/TestPBT.pbt\n\nSave Format v3.0(19990112)\n@begin Projects\n 0 \"myproject\\\\myprojectlib.pbl\";\n@end;\nappname \"myproject\";\napplib \"myproject\\\\myproject.pbl\";\nLibList \"myproject\\\\myproject.pbl;myproject\\\\lib\\\\logger\\\\logger.pbl;myproject\\\\lib\\\\payroll\\\\payroll.pbl;myproject\\\\lib\\\\contract\\\\contract.pbl;myproject\\\\lib\\\\common\\\\common.pbl;\";\ntype \"pb\";" ], "wikipedia": { "example": [ "UPDATE my_employee SET STATUS = 'A';\n IF sqlca.sqlcode<>0 THEN ..." ], "related": [ "csharp", "json", "xml", "sql" ], "summary": "PowerBuilder is an integrated development environment owned by SAP since the acquisition of Sybase in 2010. On July 5, 2016, SAP and Appeon entered into an agreement whereby Appeon would be responsible for developing, selling, and supporting PowerBuilder.PowerBuilder has been in use since 1991, peaking around 1998 with around 100,000 users. While PowerBuilder's market share has declined over the years, many applications created with it are still in use today. Over the years, PowerBuilder has been updated with new standards. In 2010, a major upgrade of PowerBuilder was released to provide support for the Microsoft .NET Framework. In 2014, support was added for OData, dockable windows, and 64-bit native applications. In 2017, support was added for iOS and Android app development.PowerBuilder 2018 provides new targets to enable developers to rapidly create RESTful Web APIs and non-visual .NET assemblies, in a test-driven manner, with the native PowerBuilder IDE and C#. A preview version is currently available for select customers.", "pageId": 1611118, "created": 2005, "backlinksCount": 65, "revisionCount": 539, "dailyPageViews": 189, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/PowerBuilder" }, "githubLanguage": { "fileExtensions": [ "pbt", "sra", "sru", "srw" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 747, "id": "PowerBuilder" }, "githubBigQuery": { "repos": 17, "users": 14, "id": "PowerBuilder" }, "leachim6": { "filepath": "p/PowerBuilder.psr", "fileExtensions": [ "psr" ], "example": [ "MessageBox(\"Hello World\")\n" ], "id": "PowerBuilder" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Powerbuilder", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPowerBuilder 5.0: Secrets of the PowerBuilder Masters: PowerBuilder Developer's Journal|1996|Michael MacDonald|16267172|0.0|0|0\nMore Professional PowerBuilder Programming|1997|Paul Bukauskas|3747146|0.0|0|0\nPowerbuilder 5: Developer's Resource|1997|Robin Schumacher|4621476|0.0|0|0\nPowerBuilder 4 Programming for Dummies|1995|Ted Coombs|2386887|0.0|0|0\nPowerbuilder For Xbase Programmers||Greg Nunemacher|5513792|0.0|0|0\nDistributed Application Development With Powerbuilder 6 (Powerbuilder Developer's Library)||Michael Barlotta|3930419|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n||Client/server Programming With Powerbuilder|Harrington and Jan L.|9780760039540\n1996|Addison-wesley|Powerbuilder Desktop: The Authorized Guide To Object-oriented Powerbuilder Programming|D. William Reynolds and Margaret Robbins|9780201408867\n1997|Sams|Powerbuilder 6.0 Unleashed|Gallagher, Simon and Herbert, Simon J. A.|9780672311796\n1996|Sams|Developing Powerbuilder 5 Applications|Hatfield, Bill|9780672309168\n1999|Envision Software Systems|Powerbuilder 7.0: Basic Programming|Hieber and Chetney J.|9780966634983\n2000|Addison-Wesley|The Definitive DataWindow: Your Key to PowerBuilder Success|Brooks, Richard|9780201702248\n1998|Itp - Media|Official Powerbuilder 6: Advanced Tools for the Enterprise|Ball, Derek|9781850329183\n1996|John Wiley & Sons Inc|Foundations of Powerbuilder 5.0 Programming|Schaad, Gordon W. and Castler, Richard and Bruce, Jon E. and Gandjei, Azita and Miller, John and Smith, Brian J.|9781568843025\n1998|Manning Publications|PowerBuilder 5.0 Questions and Answers|Hatton, Tim|9781884777431\n1996|Apress|Instant Powerbuilder Objects|Nanda, Basant and Bodepudi, Prasad and Hartwell, Bruce|9781861000064\n1997|Que Pub|Using Powerbuilder 6 (SPECIAL EDITION USING)|Hayes, William B. and Wood, Charles A.|9780789714374\n1996|Sams Publishing, U.s.a.|Powerbuilder 5 Unleashed|Gallagher and Simon; Herbert and Simon|9780672309076\n1998||Basic PowerBuilder Programming|Chetney Heiber|9780966634938\n1995|Pearson P T R|Professional Powerbuilder Programming|Paul Bukauskas|9780132385770\n1995|Wiley|Application Development With Powerbuilder|James Hobuss|9780471060673\n1998|Envision Software Systems|Advanced Powerbuilder 6.0 Programming|Chetney Hieber|9780966634945\n1999|Envision Software Systems|Advanced Powerbuilder 7.0 Programming|Chetney Hieber|9780966634990\n|Longman Higher Education|Object-oriented Programming Powerbuilder|Marsh|9780672308307\n1996|Mis Pr|Teach Yourself... Powerbuilder 5|David Mcclanahan|9781558284746\n||Powerbuilder 8.0 Advanced Programming|Hieber and Chetney J|9781114613386\n1995|John Wiley & Sons Inc|Powerbuilder 4 Programming For Dummies|Jason Coombs and Ted Coombs|9781568843254\n1996|John Wiley & Sons Inc|Powerbuilder 5: A Developer's Guide|David Mcclanahan|9781558514737\n2002|Envision Software Systems|Programming With The Pfc: Powerbuilder 8.0|Bob Hendry|9781930600201\n1995|Que|Using Powerbuilder Special Edition (Using ... (Que))|C. Wood|9780789700599\n1999|Manning Pubns Co|Internet & Intranet Applications With Powerbuilder 6|Tom Cervenka|9781884777608\n||Powerbuilder 6.0 Programming With The Pfc|Envision Software Sy|9781114291546\n1997|Prentice Hall Ptr|More Professional Powerbuilder Programming: Advanced Techniques|Paul Bukauskas and Bruce Braunstein|9780135081457\n20140224|Emereo|Powerbuilder 32 Success Secrets - 32 Most Asked Questions On Powerbuilder - What You Need To Know|Daniel Mckay|9781488536601\n1995|Sams Publishing|Teach Yourself PowerBuilder 4 in 14 Days|Judah Holstein|9780672306761\n1996|Prentice Hall Ptr|Powerbuilder 5 Developer's Resource: Client/server Programming For The Enterprise|Robin Schumacher and Billy Bosworth|9780132711562" }, "powerhouse-programming-language": { "title": "PowerHouse", "appeared": 1988, "type": "pl", "country": [ "United States" ], "originCommunity": [ "UNICOM Systems" ], "wikipedia": { "related": [ "cobol", "sql" ], "summary": "PowerHouse is a trademarked name for a byte-compiled fourth-generation programming language (or 4GL) originally produced by Quasar Corporation (later renamed Cognos Incorporated) for the Hewlett-Packard HP3000 mini-computer. It was initially composed of five components: QDD, or Quasar Data Dictionary: for building a central data dictionary used by all other components QDesign: a character-based screen generator Quick: an interactive, character-based screen processor (running screens generated by QDesign) Quiz: a report writer QTP: a batch transaction processor.", "created": 2006, "backlinksCount": 10, "pageId": 4313670, "revisionCount": 58, "dailyPageViews": 11, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/PowerHouse_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3432", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "powerisa": { "title": "IBM POWER Instruction Set Architecture", "appeared": 1998, "type": "isa", "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "related": [ "powerpc" ], "summary": "The IBM POWER ISA is a reduced instruction set computer (RISC) instruction set architecture (ISA) developed by IBM. The name is an acronym for Performance Optimization With Enhanced RISC. The ISA is used as base for high end microprocessors from IBM during the 1990s and were used in many of IBM's servers, minicomputers, workstations, and supercomputers. These processors are called POWER1 (RIOS-1, RIOS.9, RSC, RAD6000) and POWER2 (POWER2, POWER2+ and P2SC). The ISA evolved into the PowerPC instruction set architecture and was deprecated in 1998 when IBM introduced the POWER3 processor that was mainly a 32/64 bit PowerPC processor but included the POWER ISA for backwards compatibility. The POWER ISA was then abandoned.", "pageId": 38905529, "dailyPageViews": 48, "created": 2017, "backlinksCount": 100, "revisionCount": 1, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/IBM_POWER_Instruction_Set_Architecture" }, "fileType": "na", "centralPackageRepositoryCount": 0 }, "powerlanguage": { "title": "PowerLanguage", "appeared": 1997, "type": "pl", "reference": [ "https://www.multicharts.com/trading-software/index.php/About_PowerLanguage" ], "country": [ "United States" ], "originCommunity": [ "MultiCharts, LLC" ], "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/PowerLanguage" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "powerloom-knowledgebase": { "title": "powerloom-knowledgeBase", "appeared": 1999, "type": "knowledgeBase", "website": "https://www.isi.edu/isd/LOOM/PowerLoom/", "country": [ "United States" ], "originCommunity": [ "University of Southern California" ], "isbndb": "" }, "powerpc": { "title": "PowerPC", "appeared": 1992, "type": "isa", "documentation": [ "https://developer.ibm.com/articles/l-ppc/" ], "originCommunity": [ "Apple", "IBM", "Motorola" ], "wikipedia": { "related": [ "powerisa", "solaris", "unix", "linux", "x86-isa", "freebsd" ], "summary": "PowerPC (a backronym for Performance Optimization With Enhanced RISC – Performance Computing, sometimes abbreviated as PPC) is a reduced instruction set computer instruction set architecture created by the 1991 Apple–IBM–Motorola alliance, known as AIM. PowerPC, as an evolving instruction set, has since 2006 been named Power ISA, while the old name lives on as a trademark for some implementations of Power Architecture-based processors. PowerPC was the cornerstone of AIM's PReP and Common Hardware Reference Platform initiatives in the 1990s. Originally intended for personal computers, the architecture is well known for being used by Apple's Power Macintosh, PowerBook, iMac, iBook, and Xserve lines from 1994 until 2006, when Apple migrated to Intel's x86. It has since become niche in personal computers, but remain popular as embedded and high-performance processors. Its use in video game consoles and embedded applications provided an array of uses. In addition, PowerPC CPUs are still used in AmigaOne and third party AmigaOS 4 personal computers. PowerPC is largely based on IBM's earlier POWER instruction set architecture, and retains a high level of compatibility with it; the architectures have remained close enough that the same programs and operating systems will run on both if some care is taken in preparation; newer chips in the POWER series use the Power ISA.", "pageId": 24281, "dailyPageViews": 646, "created": 2001, "backlinksCount": 1637, "revisionCount": 1385, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/PowerPC" }, "linkedInSkill": { "2018": 5876, "id": "powerpc" }, "fileType": "na", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nInsider's Guide to PowerPC Computing|1994|Que\\IBM Development Group|3562767|0.0|0|0\nPowerPC Programming for Intel Programmers with Disk||Kip McClanahan|13840153|3.00|1|0\nProgramming The Powerpc (New Technology Building Blocks)||Dan Parks Sydow|4373166|0.0|0|0\nInside Macintosh: PowerPC System Software|1994|Apple Inc.|5216845|5.00|1|0\nFreescale PowerPC Mpc5554 Microprocessor Programming||MS Mohanamba Govindappa|60243625|0.0|0|0\nProgramming PowerPC Platforms with CD-ROM||Kip McClanahan|14000392|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2005|Prentice Hall|The Linux Kernel Primer: A Top-Down Approach for x86 and PowerPC Architectures|Rodriguez, Claudia Salzberg|9780131181632\n1994|M & T Books|Programming the Powerpc (New Technology Building Blocks)|Sydow, Dan Parks|9781558514003\n1996|Addison-wesley|Optimizing Powerpc Code: Programming The Powerpc Chip In Assembly Language|Gary Kacmarcik|9780201408393\n1995|Programmers Press|Powerpc Programming For Intel Programmers|Kip Mcclanahan|9781568843063", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|Verified LISP Implementations on ARM, x86 and PowerPC|10.1007/978-3-642-03359-9_25|21|0|Magnus O. Myreen and M. Gordon|a0da5b57a8f3f919d144edf06d49eee270db90ed\n1994|The PowerPC 603 C++ Verilog interface model|10.1109/CMPCON.1994.282909|5|0|R. P. Voith|73ac82fcff57ef2a5a81eb167fc51515184aaba5" }, "powershell-gallery-pm": { "title": "powershell-gallery-pm", "appeared": 2014, "type": "packageManager", "website": "https://www.powershellgallery.com/", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "domainName": { "registered": 2014, "awisRank": { "2022": 70812 }, "name": "powershellgallery.com" }, "packageCount": 4382, "packageInstallCount": 356303893, "forLanguages": [ "powershell" ] }, "powershell": { "title": "PowerShell", "appeared": 2006, "type": "pl", "creators": [ "Jeffrey Snover" ], "website": "http://microsoft.com/powershell", "documentation": [ "https://learn.microsoft.com/en-us/powershell/" ], "originCommunity": [ "Microsoft" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "hasMultiLineComments": { "example": "<# A comment\n#>", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "<#", "#>" ] ], "printToken": [ [ "echo" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "'" ] ], "keywords": [ "begin", "break", "catch", "class", "continue", "data", "define", "do", "dynamicparam", "else", "elseif", "end", "exit", "filter", "finally", "for", "foreach", "from", "function", "if", "in", "param", "process", "return", "switch", "throw", "trap", "try", "until", "using", "var", "while", "workflow", "parallel", "sequence", "inlinescript", "configuration" ], "wikipedia": { "example": [ "name value1 value2\nname -Param1 value1 -Param2 value2" ], "related": [ "perl", "csharp", "digital-command-language", "sql", "tcl", "puppet", "jscript", "vbscript", "linux", "ascii", "awk", "grep", "sed", "xml", "cli-assembly", "ooxml", "bash" ], "summary": "PowerShell is a task automation and configuration management framework from Microsoft, consisting of a command-line shell and associated scripting language. Initially a Windows component only, known as Windows PowerShell, it was made open-source and cross-platform on 18 August 2016 with the introduction of PowerShell Core. The former is built on .NET Framework while the latter on .NET Core. In PowerShell, administrative tasks are generally performed by cmdlets (pronounced command-lets), which are specialized .NET classes implementing a particular operation. These work by accessing data in different data stores, like the file system or registry, which are made available to PowerShell via providers. Third-party developers can develop their own cmdlets and add them to PowerShell. Sets of cmdlets may be combined into scripts. PowerShell provides full access to COM and WMI, enabling administrators to perform administrative tasks on both local and remote Windows systems as well as WS-Management and CIM enabling management of remote Linux systems and network devices. PowerShell also provides a hosting API with which the PowerShell runtime can be embedded inside other applications. These applications can then use PowerShell functionality to implement certain operations, including those exposed via the graphical interface. This capability has been used by Microsoft Exchange Server 2007 to expose its management functionality as PowerShell cmdlets and providers and implement the graphical management tools as PowerShell hosts which invoke the necessary cmdlets. Other Microsoft applications including Microsoft SQL Server 2008 also expose their management interface via PowerShell cmdlets. PowerShell includes its own extensive, console-based help (similar to man pages in Unix shells) accessible via the Get-Help cmdlet. Local help contents can be retrieved from the Internet via Update-Help cmdlet. Alternatively, help from the web can be acquired on a case-by-case basis via the -online switch to Get-Help.", "pageId": 14465871, "dailyPageViews": 1173, "created": 2004, "backlinksCount": 680, "revisionCount": 1897, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/PowerShell" }, "githubLanguage": { "fileExtensions": [ "ps1", "psd1", "psm1" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nAzure azure-quickstart-templates https://github.com/Azure.png https://github.com/Azure/azure-quickstart-templates PowerShell #012456 5646 8219 173 \"Azure Quickstart Templates\"\nfireeye commando-vm https://github.com/fireeye.png https://github.com/fireeye/commando-vm PowerShell #012456 2883 631 217 \"Complete Mandiant Offensive VM (Commando VM), a fully customizable Windows-based pentesting virtual machine distribution.\"\ndotnet docs https://github.com/dotnet.png https://github.com/dotnet/docs PowerShell #012456 1949 3479 52 \"This repository contains .NET Documentation.\"\nMicrosoftDocs azure-docs https://github.com/MicrosoftDocs.png https://github.com/MicrosoftDocs/azure-docs PowerShell #012456 3023 7981 127 \"Open source documentation of Microsoft Azure\"\nmicrosoft azure-pipelines-image-generation https://github.com/microsoft.png https://github.com/microsoft/azure-pipelines-image-generation PowerShell #012456 527 288 39 \"Azure Pipelines VM image generation for Microsoft-hosted CI/CD\"\nredcanaryco atomic-red-team https://github.com/redcanaryco.png https://github.com/redcanaryco/atomic-red-team PowerShell #012456 2427 764 106 \"Small and highly portable detection tests based on MITRE's ATT&CK.\"\nSharePoint sp-dev-docs https://github.com/SharePoint.png https://github.com/SharePoint/sp-dev-docs PowerShell #012456 803 585 18 \"SharePoint Developer Documentation\"\nPowerShellMafia PowerSploit https://github.com/PowerShellMafia.png https://github.com/PowerShellMafia/PowerSploit PowerShell #012456 5774 2124 180 \"PowerSploit - A PowerShell Post-Exploitation Framework\"\naspnet Blazor https://github.com/aspnet.png https://github.com/aspnet/Blazor PowerShell #012456 8382 669 125 \"Blazor is a .NET web framework using C#/Razor and HTML that runs in the browser with WebAssembly\"\nDisassembler0 Win10-Initial-Setup-Script https://github.com/Disassembler0.png https://github.com/Disassembler0/Win10-Initial-Setup-Script PowerShell #012456 2542 607 95 \"PowerShell script for automation of routine tasks done after fresh installations of Windows 10 / Server 2016 / Server 2019\"\nBloodHoundAD BloodHound https://github.com/BloodHoundAD.png https://github.com/BloodHoundAD/BloodHound PowerShell #012456 3358 622 114 \"Six Degrees of Domain Admin\"\nSycnex Windows10Debloater https://github.com/Sycnex.png https://github.com/Sycnex/Windows10Debloater PowerShell #012456 2759 362 222 \"Script to remove Windows 10 bloatware.\"\nfireeye flare-vm https://github.com/fireeye.png https://github.com/fireeye/flare-vm PowerShell #012456 1575 266 78 \ndotnet machinelearning-samples https://github.com/dotnet.png https://github.com/dotnet/machinelearning-samples PowerShell #012456 1966 908 106 \"Samples for ML.NET, an open source and cross-platform machine learning framework for .NET.\"\ndahlbyk posh-git https://github.com/dahlbyk.png https://github.com/dahlbyk/posh-git PowerShell #012456 3788 610 75 \"A PowerShell environment for Git\"\ndfinke ImportExcel https://github.com/dfinke.png https://github.com/dfinke/ImportExcel PowerShell #012456 1083 206 42 \"PowerShell module to import/export Excel spreadsheets, without Excel\"\nhak5 bashbunny-payloads https://github.com/hak5.png https://github.com/hak5/bashbunny-payloads PowerShell #012456 1176 844 30 \"The Official Bash Bunny Payload Repository\"\nsamratashok nishang https://github.com/samratashok.png https://github.com/samratashok/nishang PowerShell #012456 3127 1193 105 \"Nishang - Offensive PowerShell for red team, penetration testing and offensive security.\"\nMicrosoftDocs dynamics-365-unified-operations-public https://github.com/MicrosoftDocs.png https://github.com/MicrosoftDocs/dynamics-365-unified-operations-public PowerShell #012456 91 253 12 \"Documentation for Microsoft Dynamics 365 for Finance and Operations, Dynamics 365 for Retail, and Dynamics 365 for Talent\"\nlukesampson scoop-extras https://github.com/lukesampson.png https://github.com/lukesampson/scoop-extras PowerShell #012456 580 405 19 \"\"\"Extras\"\" bucket for Scoop\"\nMicrosoftDocs OfficeDocs-Exchange https://github.com/MicrosoftDocs.png https://github.com/MicrosoftDocs/OfficeDocs-Exchange PowerShell #012456 47 219 4 \"Contains documentation for Exchange Server and Exchange Online\"\nMicrosoftDocs windows-driver-docs https://github.com/MicrosoftDocs.png https://github.com/MicrosoftDocs/windows-driver-docs PowerShell #012456 239 390 3 \"The official Windows Driver Kit documentation sources\"\nMicrosoftDocs appcenter-docs https://github.com/MicrosoftDocs.png https://github.com/MicrosoftDocs/appcenter-docs PowerShell #012456 51 186 1 \"content repo for Visual Studio App Center on docs.microsoft.com\"", "trendingProjectsCount": 24, "type": "programming", "interpreters": [ "pwsh" ], "aceMode": "powershell", "codemirrorMode": "powershell", "codemirrorMimeType": "application/x-powershell", "tmScope": "source.powershell", "aliases": [ "posh", "pwsh" ], "repos": 161144, "id": "PowerShell" }, "githubBigQuery": { "repos": 33120, "users": 24804, "id": "PowerShell" }, "monaco": "powershell", "pygmentsHighlighter": { "filename": "shell.py", "fileExtensions": [ "ps1", "psm1" ], "id": "PowerShell" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 10, "commitCount": 108, "sampleCount": 4, "example": [ "#!/usr/bin/env pwsh\n\n# source: https://github.com/PowerShell/PowerShellStandard/blob/3436bfc162d6804dd11d1d76c4faff486b4b405d/build.ps1\n\nparam ( \n [Parameter(ParameterSetName=\"Clean\")][switch]$Clean,\n [Parameter(ParameterSetName=\"Test\")][switch]$Test\n)\n\nimport-module $PSScriptRoot/PowerShellStandard.psm1 -force\n\nif ( $Clean ) {\n Start-Clean\n return\n}\n\nStart-Build\n\nif ( $Test ) {\n Invoke-Test\n}\n" ], "url": "https://github.com/PowerShell/EditorSyntax" }, "languageServerProtocolProject": [ "https://github.com/PowerShell/PowerShellEditorServices\nwrittenIn csharp" ], "projectEuler": { "memberCount": { "2019": 134, "2022": 159 }, "id": "PowerShell" }, "helloWorldCollection": [ "# Hello World in Microsoft Powershell\n\n'Hello World!'\n" ], "leachim6": { "filepath": "p/PowerShell.ps1", "fileExtensions": [ "ps1" ], "example": [ "'Hello World'\n" ], "id": "PowerShell" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:PowerShell", "rijuRepl": { "example": [ "Write-Host \"Hello, world!\"\n" ], "id": "https://riju.codes/powershell" }, "tryItOnline": "powershell", "indeedJobs": { "2022": 19576, "query": "powershell developer" }, "stackOverflowSurvey": { "2021": { "users": 8871, "medianSalary": 68824, "fans": 4896, "percentageUsing": 0.11 } }, "subreddit": [ { "memberCount": { "2022": 201622 }, "url": "https://reddit.com/r/PowerShell" } ], "tiobe": { "id": "PowerShell" }, "packageRepository": [ "https://www.powershellgallery.com/" ], "twitter": "https://twitter.com/powershell_team", "jupyterKernel": [ "https://github.com/vors/jupyter-powershell" ], "fileType": "text", "isOpenSource": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nWindows PowerShell for Developers|2012|Douglas Finke|19180557|3.70|64|7\nPowershell: Comprehensive Beginner's Guide to Learn Powershell Programming||Daniel Jones|57036557|1.00|2|0\nWindows PowerShell 2 for Dummies|2009|Steve Seguis|7014705|3.94|18|1", "isbndb": "year|publisher|title|authors|isbn13\n2014|Cengage Learning PTR|Windows PowerShell Programming for the Absolute Beginner, 3rd|Ford, Jr. Jerry Lee|9781305260344\n2012|O'Reilly Media|Windows PowerShell for Developers: Enhance Your Productivity and Enable Rapid Application Development|Finke, Douglas|9781449322700\n2011|Manning Publications|Windows PowerShell in Action, Second Edition|Payette, Bruce|9781935182139\n2014|Packt Publishing|Windows PowerShell 4.0 for .NET Developers|Talaat, Sherif|9781849688765\n2013|Microsoft Press|Windows PowerShell 3.0 Step by Step (Step by Step Developer)|Wilson, Ed|9780735663398\n2008|Addison-Wesley Professional|Essential PowerShell|Schwichtenberg, Holger|9780672329661\n2008|Wrox|Professional Windows PowerShell Programming: Snapins, Cmdlets, Hosts and Providers (Wrox Professional Guides)|Kumaravel, Arul and White, Jon and Li, Michael Naixin and Happell, Scott and Xie, Guohui and Vutukuri, Krishna C.|9780470173930\n2014|Apress|Windows PowerShell Desired State Configuration Revealed|Chaganti, Ravikanth|9781484200162\n2017|CreateSpace Independent Publishing Platform|Powershell: Tips and Tricks to Learn Powershell Programming (Volume 2)|Jones, Mr Daniel|9781548211981\n2017|CreateSpace Independent Publishing Platform|Powershell: Comprehensive Beginner's Guide to Learn Powershell Programming (Volume 1)|Jones, Mr Daniel|9781548556839\n2017|Createspace Independent Publishing Platform|Powershell: Become A Master In Powershell|Richard Dorsey|9781547290239\n2017|CreateSpace Independent Publishing Platform|PowerShell: PowerShell Command Line 2017 - Easy Beginners Guide To Write And Run Scripts And Learn Basic PowerShell Commands! (Programming, C++, SQL)|Nelson, Francisco|9781545226506\n2017|Apress|Troubleshooting SharePoint: The Complete Guide to Tools, Best Practices, PowerShell One-Liners, and Scripts|Simpkins, Stacy|9781484231388\n2012|Createspace Independent Publishing Platform|Cmd Your Computer: Using Command Prompt, Powershell & Run Commands To Control And Program In The 21st Century.|Cask J. Thomson|9781470066697\n2020|Wiley|PowerShell 7 for IT Professionals: A Guide to Using PowerShell 7 to Manage Windows Systems|Lee, Thomas|9781119644705\n2016|Manning|Learn Windows PowerShell in a Month of Lunches|Jones, Don|9781638353898\n2020|No Starch Press|PowerShell for Sysadmins: Workflow Automation Made Easy|Bertram, Adam|9781593279196\n2013|O'Reilly Media|Windows PowerShell Pocket Reference: Portable Help for PowerShell Scripters (Pocket Reference (O'Reilly))|Holmes, Lee|9781449320966\n2019|Apress|Pro PowerShell for Amazon Web Services|Beach, Brian and Armentrout, Steven and Bozo, Rodney and Tsouris, Emmanuel|9781484248508\n2013|O'Reilly Media|Windows PowerShell Cookbook: The Complete Guide to Scripting Microsoft's Command Shell|Holmes, Lee|9781449320683\n2015|Microsoft Press|Windows PowerShell Step by Step|Wilson, Ed|9780735675117\n2019|Apress|PowerShell and Python Together: Targeting Digital Investigations|Hosmer, Chet|9781484245040\n2016|CreateSpace Independent Publishing Platform|PowerShell: For Beginners! Master The PowerShell Command Line In 24 Hours (Python Programming, Javascript, Computer Programming, C++, SQL, Computer Hacking, Programming)|Artuso, Alex|9781530411825\n2018|Apress|Pro PowerShell Desired State Configuration: An In-Depth Guide to Windows PowerShell DSC|Chaganti, Ravikanth|9781484234839\n2008|Cengage Learning PTR|Microsoft Windows PowerShell 2.0 Programming for the Absolute Beginner, 2nd Edition|Ford, Jr. Jerry Lee|9781598638998\n2013|Manning Publications|PowerShell in Depth: An administrator's guide|Jones, Don and Siddaway, Richard and Hicks, Jeffrey|9781617290558\n2015|Packt Publishing|Microsoft Hyper-V PowerShell Automation|Menon, Vinith|9781784392208\n2015|Apress|Pro PowerShell for Database Developers|Cafferky, Bryan P.|9781484205419\n2015|Packt Publishing|Windows PowerShell for .NET Developers - Second Edition|Venkatesan, Chendrayan and Talaat, Sherif|9781785280269\n2010|O'Reilly Media|Windows PowerShell Cookbook: The Complete Guide to Scripting Microsoft's New Command Shell|Holmes, Lee|9780596801502\n2017|CreateSpace Independent Publishing Platform|Powershell: The Ultimate Windows Powershell Beginners Guide. Learn Powershell Scripting In A Day! (Powershell, Powershell guide, Powershell scripting, ... Hacking, Tor, Programming, Command Line)|Jones, Jack|9781545494325\n2016|Packt Publishing|Microsoft Exchange Server PowerShell Essentials|Banerjee, Biswanath|9781782176039\n2015|Packt Publishing|Microsoft System Center PowerShell Essentials|HP, Guruprasad and Patel, Harshul|9781784393267\n2016|Apress|Troubleshooting Windows Server with PowerShell|Schauland, Derek and Jacobs, Donald|9781484218518\n2014|Apress|Pro PowerShell for Amazon Web Services: DevOps for the AWS Cloud|Beach, Brian|9781430264521\n2006|Cengage Learning PTR|Microsoft Windows PowerShell Programming for the Absolute Beginner|Ford Jr., Jerry Lee|9781598633542\n2013|Packt Publishing|Microsoft Exchange Server 2013 Powershell Cookbook: Second Edition|Andersson, Jonas and Pfeiffer, Mike|9781849689427\n2014|Apress|Beginning PowerShell for SharePoint 2013|Charlebois-Laprade, Nikolas|9781430264736\n2008|Sams Publishing|Essential PowerShell|Schwichtenberg Holger|9780132715195\n2011|Sybex|Automating Active Directory Administration with Windows PowerShell 2.0|St. Cyr, Ken and Hunter, Laura E.|9781118027318\n2018|Independently published|CMD Your Computer: An In-Depth Guide to Command Prompt, Batch Programming and Powershell|Thomson, Cask J.|9781719982535\n2009|Wrox|Microsoft SQL Server 2008 Administration with Windows PowerShell|Muthusamy, Ananthakumar|9780470477281\n2009|Microsoft Press|Windows PowerShell 2.0 Best Practices (IT Best Practices - Microsoft Press)|Ed Wilson|9780735626461\n2008|Apress|Pro Windows PowerShell|Deshev, Hristo|9781590599402\n2014|Apress|Pro Exchange 2013 SP1 PowerShell Administration: For Exchange On-Premises and Office 365|de Rooij, Michel and Wesselius, Jaap|9781430268475\n2022|Independently published|PowerShell Programming, For Beginners, Quick Start Guide: PowerShell Programming Language Crash Course Tutorial, Textbook & Exercises|Yao, Ray|9798404004441\n2011|Sybex|Automating SharePoint 2010 with Windows PowerShell 2.0|Lapointe, Gary and Bray, Shannon|9780470939208\n2015|Packt Publishing|Windows PowerShell for .NET Developers - Second Edition|Venkatesan, Chendrayan and Talaat, Sherif|9781785287435\n2011|Packt Publishing|Microsoft SharePoint 2010 and Windows PowerShell 2.0: Expert Cookbook|Pentsarskyy, Yaroslav|9781849684118\n2017|CreateSpace Independent Publishing Platform|Powershell: Advanced Strategies to Learn and Execute Powershell Programming (Volume 5)|Jones, Mr Daniel|9781976408359\n2016-09-17T00:00:01Z|CreateSpace Independent Publishing Platform|PowerShell: For Beginners! - Learn How To Write And Run Scripts From The PowerShell Command Line (Python Programming, Javascript, Computer Programming)|Larson, David|9781537717135\n2017|CreateSpace Independent Publishing Platform|Powershell: Best Practices to Learn and Execute Powershell Programming (Volume 4)|Jones, Mr Daniel|9781976055096\n2018|Independently published|Advanced Programming With Sample Codings: 4 Books In 1- Arduino, C++, Powershell and Python Programming with Sample Designs and Codings|Webber, Zach|9781791316761\n2014|Packt Publishing|PowerShell Troubleshooting Guide|Shepard, Michael|9781782173571\n2018-05-20T00:00:01Z|CreateSpace Independent Publishing Platform|PowerShell: The Utmost Intermediate Course Guide in Fundamentals and Concept of PowerShell Programming (Volume 2)|Webber, Zach|9781719524995\n2017|CreateSpace Independent Publishing Platform|Powershell: The What, When and How of Powershell (David Chang - Programming) (Volume 1)|Chang, David|9781548542726\n2018-05-20T00:00:01Z|CreateSpace Independent Publishing Platform|Powershell: 2 Books in 1: The Comprehensive Beginners Guide to Taking Control of The PowerShell Command Line & Best Practices to Excel While Learning PowerShell Programming|Price, Miles|9781719359023\n2018|CreateSpace Independent Publishing Platform|PowerShell: Best Practices to Excel While Learning PowerShell Programming|Price, Miles|9781987737899\n2017|CreateSpace Independent Publishing Platform|Programming for Beginners: 6 Books in 1- Powershell Programming(3 Book series) & Docker Programming(3 Book series)|Jones, Mr Daniel|9781975980177\n2009|For Dummies|Windows Powershell 2 For Dummies|Steve Seguis|9780470535769\n||Acp Ms Windows Powershell Programming|Jerry Lee Ford Jr.|9781337684279\n21-09-2017|Packt Publishing|Windows Server 2016 Automation with PowerShell Cookbook - Second Edition|Thomas Lee|9781787126404\n20210616|O'Reilly Media, Inc.|PowerShell Cookbook|Lee Holmes|9781098101565\n20170320|De Gruyter|Learning PowerShell|Jonathan Hassell|9781501506611\n2017-06-14|Createspace Independent Publishing Platform|Powershell: The Ultimate Windows Powershell Beginners Guide - Part 2. Take Your Powershell Scripting Further! (powershell, Powershell Guide, ... Hacking, Tor, Programming, Command Line)|Jack Jones|9781548105365\n20100607|Simon & Schuster|PowerShell in Practice|Richard Siddaway|9781638352594\n20210611|Springer Nature|PowerShell for Beginners|Ian Waters|9781484270646\n29-06-2021|Packt Publishing|Mastering PowerShell Scripting|Chris Dent|9781800208575\n20121222|O'Reilly Media, Inc.|Windows PowerShell Cookbook|Lee Holmes|9781449364281\n20100819|O'Reilly Media, Inc.|Windows PowerShell Cookbook|Lee Holmes|9781449399627\n20141031|Simon & Schuster|PowerShell in Depth|Don Jones; Jeffery Hicks; Richard Siddaway|9781638353294\n20080406|Springer Nature|Pro Windows PowerShell|Hristo Deshev|9781430205463\n20210422|O'Reilly Media, Inc.|PowerShell Pocket Reference|Lee Holmes|9781098101633\n20211125|Springer Nature|PowerShell Fast Track|Vikas Sukhija|9781484277591\n20121222|O'Reilly Media, Inc.|Windows PowerShell Cookbook|Lee Holmes|9781449364274\n2016|O'Reilly Media, Incorporated|Windows Powershell For Developers|Douglas Finke|9781491937471\n20131125|Packt Publishing|Instant Windows PowerShell Guide|Harshul Patel|9781849686792\n20121210|O'Reilly Media, Inc.|Windows PowerShell Pocket Reference|Lee Holmes|9781449363390\n20120706|O'Reilly Media, Inc.|Windows PowerShell for Developers|Douglas Finke|9781449322687\n20201019|Springer Nature|Building Better PowerShell Code|Adam Bertram|9781484263884\n20121210|O'Reilly Media, Inc.|Windows PowerShell Pocket Reference|Lee Holmes|9781449363383\n20170919|Simon & Schuster|Windows PowerShell in Action|Bruce Payette; Richard Siddaway|9781638351566\n20100224|O'Reilly Media, Inc.|Windows PowerShell 2.0 - Crashkurs|Peter Monadjemi|9783866457119\n20120706|O'Reilly Media, Inc.|Windows PowerShell for Developers|Douglas Finke|9781449322663\n20120601|O'Reilly Media, Inc.|Windows PowerShell 2.0 - Crashkurs|Peter Monadjemi|9783848301041\n2017|Createspace Independent Publishing Platform|Powershell: Simple And Effective Strategies To Execute Powershell Programming (volume 3)|Mr Daniel Jones|9781548212247\n2015|Microsoft Press|Windows Powershell Step By Step|Ed Wilson|9781509300457\n2016|Createspace Independent Publishing Platform|Powershell : The Complete Beginner's Guide|Byron Francis|9781540670021\n2018|Createspace Independent Publishing Platform|Powershell: The Ultimate Beginners Guide To Learn And Understand Powershell Programming Effectively|Webber and Zach|9781987665505\n2018|Independently Published|Powershell: 21 Sample Codes And Advance Crash Course Guide In Powershell Programming|Zach Webber|9781723976858\n2013-04-25|Packt Publishing|PowerShell 3.0 Advanced Administration Handbook|Sherif Talaat and Haijun Fu|9781849686433\n20170523|Springer Nature|Beginning PowerShell for SharePoint 2016|Nikolas Charlebois-Laprade; John Edward Naguib|9781484228845\n20151124|Springer Nature|Pro PowerShell for Microsoft Azure|Sherif Talaat|9781484206652\n|Microsoft Press,|Windows Powershell Step By Step|Wilson, Ed , 1957- (author.)|9781509300433\n20180327|Springer Nature|Essential PowerShell for Office 365|Vlad Catrinescu|9781484231296\n2017|Createspace Independent Publishing Platform|Powershell: Powershell Command Line Tips - Learn How To Write And Run Scripts, Plus Basic Powershell Commands! (python Programming, Computer Hacking, Programming)|Chester Mckinney|9781542744911\n2014-01-16|Packt Publishing|Windows PowerShell 4.0 for .NET Developers|Sherif Talaat|9781849688772\n20171111|Simon & Schuster|Learn PowerShell Scripting in a Month of Lunches|Don Jones; Jeffery Hicks|9781638351559\n|Nelson Education|Microsoft Windows Powershell Programming For The Absolute Beginner|Jerry Lee Ford|9781305260351\n20130326|Packt Publishing|Instant Windows Powershell 3.0 Windows Management Instrumentation Starter|Brenton J.W. Blawat|9781849689632\n2008|John Wiley & Sons|Professional Windows Powershell Programming: Snapins, Cmdlets, Hosts And Providers|Jon White and Arul Kumaravel and Michael Naixin Li and Scott Happell and Guohui Xie and Krishna C. Vutukuri|9780470289860\n2022-03-29|Wiley|Windows Server 2022 & Powershell All-in-One For Dummies|Sara Perrott|9781119867845\n2011|Wiley & Sons, Incorporated, John|Automating Active Directory Administration With Windows Powershell 2. 0|Ken St. Cyr and Laura E. Hunter|9781118118542\n2018-11-03|Independently Published|Powershell: The Complete 3 Books In 1 For Beginners, Intermediate And 21 Sample Codings And Advance Crash Course Guide In Powershell Programming|Zach Webber|9781730803901", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Detecting Malicious PowerShell Commands using Deep Neural Networks|10.1145/3196494.3196511|54|8|Danny Hendler and Shay Kels and Amir Rubin|2ce5684b7b0a14e3ea3c1f281c8f1f9e1db56b7f\n2018|AST-Based Deep Learning for Detecting Malicious PowerShell|10.1145/3243734.3278496|21|0|Gili Rusak and Abdullah Al-Dujaili and Una-May O’Reilly|77369f12dd131a755129b1b5b923b1d479eff5db\n2013|Working with PowerShell|10.1007/978-1-4302-4942-9_3|1|0|R. Garrett|e0390ca20fd2572a1f6e41898fdd39e030649bf6" }, "ppm-format": { "title": "ppm-format", "appeared": 1988, "type": "textDataFormat", "description": "The PPM format is a lowest common denominator color image file format. It should be noted that this format is egregiously inefficient. It is highly redundant, while containing a lot of information that the human eye can't even discern. Furthermore, the format allows very little information about the image besides basic color, which means you may have to couple a file in this format with other independent information to get any decent use out of it. However, it is very easy to write and analyze programs to process this format, and that is the point.", "reference": [ "http://netpbm.sourceforge.net/doc/ppm.html" ], "country": [ "United States" ], "originCommunity": [ "https://netpbm.sourceforge.net/index.html#support" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "P3\n# feep.ppm\n4 4\n15\n 0 0 0 0 0 0 0 0 0 15 0 15\n 0 0 0 0 15 7 0 0 0 0 0 0\n 0 0 0 0 0 0 0 15 7 0 0 0\n15 0 15 0 0 0 0 0 0 0 0 0" ] }, "pqq": { "title": "P′′", "appeared": 1964, "type": "pl", "creators": [ "Corrado Böhm" ], "country": [ "Italy" ], "originCommunity": [ "University of Rome" ], "wikipedia": { "related": [ "brainfuck" ], "summary": "P′′ is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines.", "pageId": 2242844, "created": 2005, "backlinksCount": 26, "revisionCount": 12, "dailyPageViews": 34, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/P′′" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "praat-script": { "title": "Praat Script", "appeared": 1997, "type": "pl", "description": "The language is bundled with Praat, a speech analysis tool, to execute menu and action commands.", "website": "https://www.fon.hum.uva.nl/praat/manual/Praat_script.html", "country": [ "The Netherlands" ], "originCommunity": [ "Universiteit van Amsterdam" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "clearinfo\n# print fizzbuzz result\nprocedure fizzbuzz: .i\n\tif .i mod 15 == 0\n\t\tappendInfoLine: \"fizzbuzz\"\n\telsif .i mod 3 == 0\n\t\tappendInfoLine: \"fizz\"\n\telsif .i mod 5 == 0\n\t\tappendInfoLine: \"buzz\"\n\telse\n\t\tappendInfoLine: .i\n\tendif\nendproc\n\nfor i from 1 to 100\n\t@fizzbuzz: i\nendfor" ], "githubRepo": { "firstCommit": 2005, "stars": 915, "forks": 195, "subscribers": 44, "created": 2014, "updated": 2022, "description": "Praat: Doing Phonetics By Computer", "issues": 50, "url": "https://github.com/praat/praat" }, "repoStats": { "firstCommit": 2005, "commits": 7914, "committers": 17, "files": 3231 } }, "praxis-lang": { "title": "praxis-lang", "appeared": 2011, "type": "pl", "creators": [ "Richard Evans" ], "reference": [ "https://versu.com/", "https://www.ifwiki.org/Versu", "https://versublog.files.wordpress.com/2014/05/versu.pdf" ], "aka": [ "praxis" ], "country": [ "United Kingdom" ], "originCommunity": [ "Imperial College" ], "example": [ "insert data.scene_data.linus_wakes_up\n {\n noun!”Linus wakes up”\n set_location.jordan_fischer!anonymous_room\n set_location.linus_bergstrom!anonymous_room\n establish_relationship.linus_bergstrom.jordan_fischer!\nfriends!”{A}We get along really well”\n movement_restricted\n timeout_conclusion.null_scene!”The story has ended due\nto inactivity.”!10000\n setup!stocker_for_linus_wakes_up\n }" ] }, "praxis": { "title": "PRAXIS", "appeared": 1980, "type": "pl", "reference": [ "http://mvb.saic.com/freeware/vax85b/praxis/aaareadme.txt", "https://www.digiater.nl/openvms/decus/vax85b/praxis/aaareadme.txt" ], "country": [ "United States" ], "originCommunity": [ "Bolt Beranek and Newman Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4070" }, "preferred-executable-format": { "title": "Preferred Executable Format", "appeared": 1994, "type": "pl", "reference": [ "https://groups.google.com/forum/#!search/preferred-executable-format/comp.sys.powerpc/FmjbgTCFSkE/-5xj762g-v4J" ], "country": [ "United States" ], "originCommunity": [ "Apple" ], "wikipedia": { "related": [ "powerpc", "x86-isa" ], "summary": "The Preferred Executable Format is a file format that specifies the format of executable files and other object code. PEF executables are also called Code Fragment Manager files (CFM). PEF was developed by Apple Computer for use in its classic Mac OS operating system. It was optimised for RISC processors. In macOS, the Mach-O file format is the native executable format. However, PEF is still supported on PowerPC-based Macintoshes running Mac OS X and is used by some Carbon applications ported from earlier versions for classic Mac OS, so that the same binary can be run on classic Mac OS and Mac OS X. BeOS on PowerPC systems also uses PEF, although x86 systems do not.", "created": 2004, "backlinksCount": 39, "pageId": 694240, "revisionCount": 38, "dailyPageViews": 18, "url": "https://en.wikipedia.org/wiki/Preferred_Executable_Format" }, "centralPackageRepositoryCount": 0 }, "preforth": { "title": "preforth", "appeared": 2018, "type": "pl", "creators": [ "Ulrich Hoffmann" ], "reference": [ "https://fosdem.org/2020/schedule/event/forth_new_synthesis/" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/uho/preForth/issues" ], "githubRepo": { "firstCommit": 2018, "stars": 51, "forks": 6, "subscribers": 10, "created": 2018, "updated": 2022, "description": "a minimalistic Forth kernel that can bootstrap", "issues": 14, "url": "https://github.com/uho/preforth" }, "repoStats": { "firstCommit": 2018, "commits": 72, "committers": 2, "files": 22 }, "semanticScholar": "" }, "presto": { "title": "PRESTO", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/41ae591cd31e9ce2dad574100d0d2e5e2bcf0d41" ], "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1354", "centralPackageRepositoryCount": 0 }, "price-equation": { "title": "Price Equation", "appeared": 1967, "type": "equation", "country": [ "United Kingdom" ], "originCommunity": [ "University College London" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Price_equation" } }, "principle-of-sufficient-reason": { "title": "Principle of sufficient reason", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/10bf7c2d65e868efc8065cf1909bf3adf58e7685" ], "country": [ "United States" ], "originCommunity": [ "Binghamton University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2141", "centralPackageRepositoryCount": 0 }, "prism": { "title": "PRISM", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dbeccf2f4f7745707845d9dab06747f24164db27" ], "country": [ "United States" ], "originCommunity": [ "University of Maryland" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1053", "centralPackageRepositoryCount": 0 }, "prisma-schema-language": { "title": "Prisma Schema Language", "appeared": 2019, "type": "idl", "description": "The Prisma schema file (short: schema file, Prisma schema or schema) is the main configuration file for your Prisma setup. It is typically called schema.prisma and consists of the following parts:", "reference": [ "https://github.com/prisma/specs/tree/master/schema" ], "country": [ "Germany" ], "originCommunity": [ "Prisma Data,Inc" ], "isbndb": "" }, "prismjs": { "title": "Prism", "appeared": 2012, "type": "library", "creators": [ "Lea Verou" ], "description": "Prism is a lightweight, extensible syntax highlighter, built with modern web standards in mind. It’s used in millions of websites, including some of those you visit daily.", "website": "https://prismjs.com/", "country": [ "United States and Germany" ], "originCommunity": [ "https://github.com/PrismJS" ], "domainName": { "registered": 2012, "awisRank": { "2022": 142007 }, "name": "prismjs.com" }, "writtenIn": [ "javascript" ], "related": [ "codemirror", "monaco", "highlightjs", "ace", "pygments" ], "githubRepo": { "stars": 10432, "forks": 1215, "subscribers": 112, "created": 2012, "updated": 2022, "description": "Lightweight, robust, elegant syntax highlighting.", "issues": 219, "firstCommit": 2012, "url": "https://github.com/PrismJS/prism" } }, "priz": { "title": "PRIZ", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/028c3b540466b1c2a86aed61c619c3fc76e657a3" ], "country": [ "Former Union of Soviet Socialist Republics or Estonia" ], "originCommunity": [ "Estonian Academy of Sciences" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4010", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pro-star-c": { "title": "Pro*C", "appeared": 1996, "type": "pl", "reference": [ "https://docs.oracle.com/cd/A97630_01/win.920/a96111/intro.htm" ], "country": [ "United States" ], "originCommunity": [ "Oracle Corporation" ], "wikipedia": { "related": [ "sql" ], "summary": "Pro*C (also known as Pro*C/C++) is an embedded SQL programming language used by Oracle Database database management systems. Pro*C uses either C or C++ as its host language. During compilation, the embedded SQL statements are interpreted by a precompiler and replaced by C or C++ function calls to their respective SQL library. The output from the Pro*C precompiler is standard C or C++ code that is then compiled by any one of several C or C++ compilers into an executable.", "pageId": 13142178, "created": 2007, "backlinksCount": 18, "revisionCount": 23, "dailyPageViews": 46, "url": "https://en.wikipedia.org/wiki/Pro*C" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "probevue": { "title": "ProbeVue", "appeared": 2008, "type": "pl", "cheatSheetUrl": [ "http://www.tablespace.net/quicksheet/vue-quicksheet.pdf" ], "country": [ "United States" ], "originCommunity": [ "http://www.tablespace.net" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "@@syscall:*:read:entry\nwhen ( __pid == 123456)\n{\n /* This is a comment: The process with a PID of 123456 has called read(); */\n printf(\"read() system call entered.\\n\");\n}" ], "wikipedia": { "summary": "ProbeVue is IBM's implementation of a lightweight dynamic tracing environment introduced in AIX version 6.1. ProbeVue provides the ability to probe running processes in order to provide statistical analysis as well as retrieve data from the probed process. The dynamic nature of ProbeVue allows it to be used as a global system performance tool while retaining the ability to drill into very specific events on a single process or thread. Because modifications are not required of a probed process or system and the lightweight design of ProbeVue as a tracing tool, it is suitable for use in a production environment where previous tracing tools would have been performance prohibitive.", "url": "https://en.wikipedia.org/wiki/undefined" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "proc-procedure-language": { "title": "PROC procedure language", "appeared": 1986, "type": "pl", "country": [ "United States" ], "originCommunity": [ "TRW Inc" ], "wikipedia": { "dailyPageViews": -1, "url": "https://web.archive.org/web/20170301080656/https://en.wikipedia.org/wiki/PROC_procedure_language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1260", "centralPackageRepositoryCount": 0 }, "processing": { "title": "Processing", "appeared": 2001, "type": "pl", "website": "http://processing.org", "documentation": [ "https://processing.org/reference" ], "fileExtensions": [ "pde" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "domainName": { "registered": 2003, "awisRank": { "2017": 17405, "2022": 48450 }, "name": "processing.org" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "PShape usa;\nPShape state;\nString [] Obama = { \"HI\", \"RI\", \"CT\", \"MA\", \"ME\", \"NH\", \"VT\", \"NY\", \"NJ\",\n\t \"FL\", \"NC\", \"OH\", \"IN\", \"IA\", \"CO\", \"NV\", \"PA\", \"DE\", \"MD\", \"MI\",\n\t \"WA\", \"CA\", \"OR\", \"IL\", \"MN\", \"WI\", \"DC\", \"NM\", \"VA\" };\n\nString [] McCain = { \"AK\", \"GA\", \"AL\", \"TN\", \"WV\", \"KY\", \"SC\", \"WY\", \"MT\",\n\t \"ID\", \"TX\", \"AZ\", \"UT\", \"ND\", \"SD\", \"NE\", \"MS\", \"MO\", \"AR\", \"OK\",\n\t \"KS\", \"LA\" };\n\nvoid setup() {\n size(950, 600);\n // The file \"Blank US Map (states only).svg\" can be found at Wikimedia Commons\n usa = loadShape(\"http://upload.wikimedia.org/wikipedia/commons/archive/1/1a/20130330152451!Blank_US_Map_(states_only).svg\");\n smooth(); // Improves the drawing quality of the SVG\n noLoop();\n}\n\nvoid draw() {\n background(255);\n // Draw the full map\n shape(usa, 0, 0);\n // Blue denotes states won by Obama\n statesColoring(Obama , color(0, 0, 255));\n // Red denotes states won by McCain\n statesColoring(McCain, color(255, 0, 0));\n // Save the map as image\n saveFrame(\"map output.png\");\n}\n\nvoid statesColoring(String[] states, int c){\n for (int i = 0; i < states.length; ++i) {\n PShape state = usa.getChild(states[i]);\n // Disable the colors found in the SVG file\n state.disableStyle();\n // Set our own coloring\n fill(c);\n noStroke();\n // Draw a single state\n shape(state, 0, 0);\n }\n}" ], "related": [ "java", "logo", "opengl", "postscript", "c", "javascript", "arduino", "scala", "clojure", "lisp", "max" ], "summary": "Processing is an open source computer programming language and integrated development environment (IDE) built for the electronic arts, new media art, and visual design communities with the purpose of teaching the fundamentals of computer programming in a visual context, and to serve as the foundation for electronic sketchbooks. The project was initiated in 2001 by Casey Reas and Benjamin Fry, both formerly of the Aesthetics and Computation Group at the MIT Media Lab. In 2012, they started the Processing Foundation along with Daniel Shiffman, who joined as a third project lead. Johanna Hedva joined the Foundation in 2014 as Director of Advocacy. One of the aims of Processing is to allow non-programmers to start computer programming aided by visual feedback. The Processing language builds on the Java language, but uses a simplified syntax and a graphics user interface.", "pageId": 546083, "dailyPageViews": 429, "created": 2004, "backlinksCount": 240, "revisionCount": 517, "appeared": 2001, "fileExtensions": [ "pde" ], "url": "https://en.wikipedia.org/wiki/Processing_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "pde" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\ngreerviau SnakeAI https://github.com/greerviau.png https://github.com/greerviau/SnakeAI Processing #0096D8 578 133 77 \"Train a Neural Network to play Snake using a Genetic Algorithm\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "tmScope": "source.processing", "repos": 78037, "id": "Processing" }, "githubBigQuery": { "repos": 6773, "users": 5494, "id": "Processing" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2015, "committerCount": 5, "commitCount": 33, "sampleCount": 1, "example": [ "/**\n * Shape Primitives. \n * \n * The basic shape primitive functions are triangle(),\n * rect(), quad(), ellipse(), and arc(). Squares are made\n * with rect() and circles are made with ellipse(). Each \n * of these functions requires a number of parameters to \n * determine the shape's position and size. \n */\n\nvoid setup() {\n size(640, 360);\n background(0);\n noStroke();\n}\n\nvoid draw() {\n fill(204);\n triangle(18, 18, 18, 360, 81, 360);\n\n fill(102);\n rect(81, 81, 63, 63);\n\n fill(204);\n quad(189, 18, 216, 18, 216, 360, 144, 360);\n\n fill(255);\n ellipse(252, 144, 72, 72);\n\n fill(204);\n triangle(288, 18, 351, 360, 288, 360); \n\n fill(255);\n arc(479, 300, 280, 280, PI, TWO_PI);\n}\n\n" ], "url": "https://github.com/textmate/processing.tmbundle" }, "projectEuler": { "memberCount": { "2019": 43, "2022": 53 }, "id": "Processing" }, "helloWorldCollection": [ "// Hello world in Processing\n\nprintln( \"Hello world!\" );" ], "leachim6": { "filepath": "p/Processing.pde", "fileExtensions": [ "pde" ], "example": [ "size(128, 128);\nbackground(0);\ntextAlign(CENTER, CENTER);\nfill(255);\ntext(\"Hello World\", width / 2, height / 2);\n" ], "id": "Processing" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Processing", "tiobe": { "id": "Processing" }, "twitter": "https://twitter.com/processingorg", "fileType": "text", "wordRank": 1486, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2009|O'Reilly Media|Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit|Bird, Steven and Klein, Ewan and Loper, Edward|9780596516499\n1982|Prentice Hall|Signals and Systems (Prentice-Hall signal processing series)|Oppenheim, Alan V.|9780138097318\n1995|Prentice Hall|Signal Processing with Fractals: A Wavelet Based Approach|Wornell, Gregory|9780131209992\n1997|Academic Press|Image Processing and Pattern Recognition (Volume 5) (Neural Network Systems Techniques and Applications, Volume 5)|Leondes, Cornelius T.|9780124438651\n2008|O'Reilly Media|Visualizing Data: Exploring and Explaining Data with the Processing Environment|Fry, Ben|9780596514556\n2011|CL Engineering|Digital Signal Processing Using MATLAB|Ingle, Vinay K. and Proakis, John G.|9781111427375\n2000|Wiley-Interscience|3-D Image Processing Algorithms|Nikolaidis, N. and Pitas, Ioannis|9780471377368\n2003|Addison-Wesley Professional|Text Processing in Python|Mertz, David and Mike Hendrickson|9780321112545\n2012|The Nature of Code|The Nature of Code: Simulating Natural Systems with Processing|Shiffman, Daniel|9780985930806\n2010|Morgan and Claypool Publishers|Data-Intensive Text Processing with MapReduce (Synthesis Lectures on Human Language Technologies)|Lin, Jimmy and Dyer, Chris|9781608453429\n2008|Academic Press|Feature Extraction & Image Processing|Nixon, Mark|9780123725387\n2006|Academic Press|Signal Processing for Neuroscientists: An Introduction to the Analysis of Physiological Signals|van Drongelen, Wim|9780123708670\n1996|Morgan Kaufmann|Principles of Transaction Processing for the Systems Professional (The Morgan Kaufmann Series in Data Management Systems)|Philip A. Bernstein and Eric Newcomer|9781558604155\n2005|Springer|Information Processing with Evolutionary Algorithms: From Industrial Applications to Academic Speculations (Advanced Information and Knowledge Processing)||9781852338664\n2006|Jones & Bartlett Learning|Digital Signal Processing Using Matlab And Wavelets (Electrical Engineering)|Weeks, Michael|9780977858200\n2005|Morgan Kaufmann|Machine Vision: Theory, Algorithms, Practicalities (Signal Processing and its Applications)|Davies, E. R.|9780122060939\n2007|Wiley-IEEE Press|Embedded Signal Processing with the Micro Signal Architecture|Gan, Woon-Seng and Kuo, Sen M.|9780471738411\n1995|Prentice Hall|Introduction to Statistical Signal Processing with Applications|Srinath, Mandyam D. and Rajasekaran, P.K. and Viswanathan, R.|9780131252950\n2015|Packt Publishing|Image Processing with ImageJ - Second Edition|Broeke, Jurjen and Perez, Jose Maria Mateos and Pascau, Javier|9781785889837\n1974|R. D. Irwin|Basic Fortran Iv Programming (irwin-dorsey Information Processing Series)|Donald H Ford|9780256015805\n1999|Springer|Parallel Processing and Parallel Algorithms: Theory and Computation|Roosta, Seyed H|9780387987163\n2004|Prentice Hall|Java Transaction Processing (Hewlett-Packard Professional Books): Design and Implementation|Mark Little and Jon Maron and Greg Pavlik and Jonathan Maron|9780130352903\n2017|Wiley-ISTE|Digital Signal Processing (DSP) with Python Programming|Charbit, Maurice|9781786301260\n2004|Course Technology|Introduction to Digital Image Processing with MATLAB|McAndrew, Alasdair|9780534400118\n2013|Packt Publishing|Instant Audio Processing with Web Audio|Khoo, Chris|9781782168799\n1998|Routledge|An Introduction to Natural Language Processing Through Prolog (Learning about Language)|Matthews, Clive|9780582066229\n1997|McGraw-Hill|Developing Natural Language Interfaces: Processing Human Conversations|Suereth, Russell|9780079130174\n2014|Springer|Text Mining: From Ontology Learning to Automated Text Processing Applications (Theory and Applications of Natural Language Processing)|Chris Biemann|9783319126555\n2005|Newnes|Embedded Media Processing (Embedded Technology)|Katz, David J. and Gentile, Rick|9780750679121\n1995|Academic Press|Digital Compression of Still Images and Video (Signal Processing and its Applications)|Clarke, Roger J.|9780121757205\n1997|Springer|Algorithms for Discrete Fourier Transform and Convolution (Signal Processing and Digital Filtering)|Tolimieri, Richard and An, Myoung and Lu, Chao|9780387982618\n2010|Springer|Agile Processes in Software Engineering and Extreme Programming: 11th International Conference, XP 2010, Trondheim, Norway, June 1-4, 2010, ... in Business Information Processing (48))||9783642130533\n2003|Morgan Kaufmann|Constraint Processing (The Morgan Kaufmann Series in Artificial Intelligence)|Dechter, Rina|9781558608900\n2003|Springer|Data Privacy and Security (Signal Processing and Digital Filtering)|Salomon, David|9780387003115\n2003|CRC Press|Nonlinear Signal and Image Processing: Theory, Methods, and Applications (Electrical Engineering & Applied Signal Processing Series)||9780849314278\n1985|Krieger Publishing Company|Digital Signal Processing|Abraham Peled and Bede Liu|9780898748642\n2008|Springer|Agile Processes in Software Engineering and Extreme Programming: 9th International Conference, XP 2008, Limerick, Ireland, June 10-14, 2008, ... Notes in Business Information Processing (9))||9783540682547\n2011|Springer|Coarse-to-Fine Natural Language Processing (Theory and Applications of Natural Language Processing)|Petrov, Slav|9783642227424\n2010|McGraw-Hill Education TAB|Programming the Propeller with Spin: A Beginner's Guide to Parallel Processing (Tab Electronics)|Sandhu, Harprit|9780071716666\n2014|The MIT Press|Advanced Structured Prediction (Neural Information Processing series)||9780262028370\n20150721|Springer Nature|Fundamentals of Music Processing|Meinard Müller|9783319219455\n1984|Van Nostrand Reinhold Co.|Image Processing Of Geological Data|Fabbri, Andrea G.|9780442225360", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|scikit-image: image processing in Python|10.7717/peerj.453|2701|73|S. Walt and Johannes L. Schönberger and Juan Nunez-Iglesias and François Boulogne and Joshua D. Warner and Neil Yager and E. Gouillart and Tony Yu|a2fcf53f0aef0bfaec6353676c4f1d4e36aab5c0\n2008|Pig latin: a not-so-foreign language for data processing|10.1145/1376616.1376726|2055|269|Christopher Olston and B. Reed and U. Srivastava and Ravi Kumar and A. Tomkins|81813379dde0fe90d67e5ee1fd6e1d4c72bcfe70\n2010|Steven Bird, Ewan Klein and Edward Loper: Natural Language Processing with Python, Analyzing Text with the Natural Language Toolkit|10.1007/s10579-010-9124-x|1304|116|Wiebke Wagner|cfdd423c8672a7b178ea85d56079328df4eea647\n1995|Constraint Processing|10.1007/3-540-59479-5|1179|153|R. Dechter|2bc1daaba330f4ea8a4f951d5dcd40c39bef5a8a\n2015|Spark SQL: Relational Data Processing in Spark|10.1145/2723372.2742797|1155|207|Michael Armbrust and Reynold Xin and Cheng Lian and Yin Huai and Davies Liu and Joseph K. Bradley and X. Meng and Tomer Kaftan and M. Franklin and A. Ghodsi and M. Zaharia|ada0b87cd5c30d31186c38fb12e631d29426a3bf\n2008|SCOPE: easy and efficient parallel processing of massive data sets|10.14778/1454159.1454166|856|88|R. Chaiken and Bob Jenkins and P. Larson and Bill Ramsey and Darren Shakib and S. Weaver and Jingren Zhou|8429d29385ae410cef9a5cf6118528bbfc39a751\n2011|Automating string processing in spreadsheets using input-output examples|10.1145/1926385.1926423|718|84|Sumit Gulwani|e2d3f4ef30652b36145cbecfcd1f50d9f69351f3\n2009|Monte Carlo simulation of photon migration in 3D turbid media accelerated by graphics processing units.|10.1364/OE.17.020178|658|24|Q. Fang and D. Boas|72418a969890621cfe99e470889ed0bedd0dba98\n2010|EBImage—an R package for image processing with applications to cellular phenotypes|10.1093/bioinformatics/btq046|507|26|Grégoire Pau and Florian Fuchs and O. Sklyar and M. Boutros and W. Huber|c7ba786c84c9c5161604e021551a23f098028eba\n2014|Convolutional Neural Networks over Tree Structures for Programming Language Processing|10.1609/aaai.v30i1.10139|420|61|Lili Mou and Ge Li and Lu Zhang and Tao Wang and Zhi Jin|49512270b39636375880d611d7b2192d324f4ba6\n2011|EP-SPARQL: a unified language for event processing and stream reasoning|10.1145/1963405.1963495|401|53|Darko Anicic and P. Fodor and S. Rudolph and N. Stojanović|95b75baaf259fa0ad83c0c27e0c74d4210ec7481\n2003|XDuce: A statically typed XML processing language|10.1145/767193.767195|357|24|H. Hosoya and B. Pierce|c488504779ab5a4e33ab5b58f71e8d6702701a17\n2013|Swift/T: Large-Scale Application Composition via Distributed-Memory Dataflow Processing|10.1109/CCGrid.2013.99|131|16|J. Wozniak and Timothy G. Armstrong and M. Wilde and D. Katz and E. Lusk and Ian T Foster|84c1285253bee1bce56731983b5bc3ae0e7c06e9\n2013|IBM Streams Processing Language: Analyzing Big Data in motion|10.1147/JRD.2013.2243535|127|8|Martin Hirzel and H. Andrade and B. Gedik and Gabriela Jacques-Silva and R. Khandekar and Vibhore Kumar and M. Mendell and Howard Nasgaard and S. Schneider and R. Soulé and Kun-Lung Wu|1fcc527c54e692ab6db69a8a6b5f5ee9118e0dd6\n1977|A very high level programming language for data processing applications|10.1145/359863.359886|107|1|M. Hammer and W. G. Howe and V. Kruskal and I. Wladawsky|42354d82fffedafe87d84e61d0cbca536ac1720a\n2010|Feldspar: A domain specific language for digital signal processing algorithms|10.1109/MEMCOD.2010.5558637|104|10|E. Axelsson and K. Claessen and Gergely Dévai and Zoltán Horváth and K. Keijzer and B. Lyckegård and Anders Persson and M. Sheeran and Josef Svenningsson and A. Vajda|813bd991a0ab48a2046d50d32f1d8879e7a59220\n1991|C Language Algorithms for Digital Signal Processing|10.1121/1.401205|103|4|P. M. Embree and Bruce Kimble|db3bc4e4e0fbf5eb5c681ca0a195ff8e1abfbab8\n2016|Programming Heterogeneous Systems from an Image Processing DSL|10.1145/3107953|80|9|Jing Pu and Steven Bell and Xuan S. Yang and Jeff Setter and S. Richardson and Jonathan Ragan-Kelley and M. Horowitz|e9bf383dd76f2df2ed84ea07949b63852557f174\n1996|Inductive Logic Programming for Natural Language Processing|10.1007/3-540-63494-0_45|71|7|R. Mooney|ac11493e05275258f09e6406a2635752899f074d\n2009|Lightweight Language Processing in Kiama|10.1007/978-3-642-18023-1_12|64|9|A. Sloane|2669374854a57ec89d928469ebaf7b141bfecba2\n2010|The Design and Implementation of Feldspar - An Embedded Language for Digital Signal Processing|10.1007/978-3-642-24276-2_8|60|6|E. Axelsson and K. Claessen and M. Sheeran and Josef Svenningsson and David Engdal and Anders Persson|aae1cfb2729d3807ba6ea8312b956a23faff5eb5\n2009|Genetic programming on graphics processing units|10.1007/s10710-009-9092-3|54|4|D. Robilliard and Virginie Marion-Poty and C. Fonlupt|3bf5f45d615a296754a432d0e8186df8e2c71046\n2014|Simplifying Scalable Graph Processing with a Domain-Specific Language|10.1145/2544137.2544162|52|4|Sungpack Hong and S. Salihoglu and J. Widom and K. Olukotun|2d8be5e1b88ac9919984b9369f7045fbb0af0d08\n2013|Natural language processing future|10.1109/ICOISS.2013.6678407|33|1|M. Surabhi|b1d2acf0702837ef20d9112847e2dffd46a25016\n2017|Natural Language is a Programming Language: Applying Natural Language Processing to Software Development|10.4230/LIPIcs.SNAPL.2017.4|32|0|Michael D. Ernst|c27009a331655c1bab4d2940590dc8b73a63da2b\n2011|Programming language Python for data processing|10.1109/ICECENG.2011.6057428|28|1|Z. Dobesová|3b2574ca20143a380283d827f361f99de3d57b7e\n2007|XCentric: logic programming for XML processing|10.1145/1316902.1316904|27|1|Jorge Coelho and Mário Florido|fff40acdda2b6ef583ddc6430e9524a6efcd63d4\n1990|IAL: a parallel image processing programming language|10.1049/IP-I-2.1990.0025|24|0|D. Crookes and P. Morrow and P. McParland|4eaa48bc846517f46192b91ed6c9f5d8ee842652\n2015|Kronos: A Declarative Metaprogramming Language for Digital Signal Processing|10.1162/COMJ_a_00330|17|2|Vesa Norilo|ef11199bcd2476c28b6bcb925f8eef10df6b8800\n2017|ASAMPL: Programming Language for Mulsemedia Data Processing Based on Algebraic System of Aggregates|10.1007/978-3-319-75175-7_43|15|2|Y. Sulema|87ae77f26b74a6e92ab61075e0ddcb825cd36cc6\n2017|Visualizing Morphogenesis with the Processing Programming Language|10.5210/jbc.v41i1.7314|3|0|Avik Patel and Amarpreet Bains and Richard Miller and T. Elul|9a4e9fcc445a596beca188b62f89cb103e9f26bd" }, "processor-technology": { "title": "Processor Technology", "appeared": 1975, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Processor Technology Corporation" ], "wikipedia": { "related": [ "isbn" ], "summary": "Processor Technology Corporation was a personal computer company founded in April 1975 by Gary Ingram and Bob Marsh in Berkeley, California. Their first product was a 4K byte RAM board that was compatible with the MITS Altair 8800 computer but more reliable than the MITS board. This was followed by a series of memory and I/O boards including a video display module.Popular Electronics magazine wanted a feature article on an intelligent computer terminal and Technical Editor Les Solomon asked Marsh and Lee Felsenstein to design one. It was featured on the July 1976 cover and became the Sol-20 Personal Computer. The first units were shipped in December 1976 and the Sol-20 was a very successful product. The company failed to develop next generation products and ceased operations in May 1979.", "created": 2006, "backlinksCount": 49, "pageId": 4269036, "revisionCount": 117, "dailyPageViews": 20, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Processor_Technology" }, "centralPackageRepositoryCount": 0 }, "procfile": { "title": "Procfile", "appeared": 2012, "type": "pl", "website": "https://devcenter.heroku.com/articles/procfile#procfile-format", "country": [ "United States" ], "originCommunity": [ "Heroku, Inc" ], "hasIntegers": { "example": "", "value": true }, "example": [ "web: bundle exec rails server -p $PORT" ], "githubLanguage": { "type": "programming", "filenames": [ "Procfile" ], "aceMode": "batchfile", "tmScope": "source.procfile", "repos": 536, "id": "Procfile" }, "githubBigQuery": { "repos": 1041, "users": 904, "id": "Procfile" }, "pygmentsHighlighter": { "filename": "procfile.py", "fileExtensions": [ "Procfile" ], "id": "Procfile" } }, "procol": { "title": "PROCOL", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8ca0a3c29736265fdc26fe5f7aeea3337e60df43" ], "country": [ "The Netherlands" ], "originCommunity": [ "University of Leiden" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1655", "centralPackageRepositoryCount": 0 }, "prodel": { "title": "prodel", "appeared": 2014, "type": "pl", "description": "Another Japanese programming language", "website": "https://rdr.utopiat.net/", "country": [ "Japan" ], "nativeLanguage": "Japanese", "originCommunity": [ "https://rdr.utopiat.net/cgi/bbs2/wforum-rdr.cgi" ], "domainName": { "name": "rdr.utopiat.net" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "profit": { "title": "ProFIT", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7ceaffd3bfd58ee19a8634a1cd200c98c97921e4" ], "country": [ "Germany" ], "originCommunity": [ "Universitat des Saarlandes" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3559", "wordRank": 2314, "centralPackageRepositoryCount": 0 }, "progol": { "title": "Progol", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/11d702bdd25dfdf368d9028693ea00dac25c8851" ], "country": [ "Germany" ], "originCommunity": [ "Universitat des Saarlandes" ], "supersetOf": [ "prolog" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5487", "centralPackageRepositoryCount": 0 }, "prograph": { "title": "Prograph", "appeared": 1983, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "Acadia University" ], "visualParadigm": true, "wikipedia": { "related": [ "diagram", "prolog", "labview", "doi", "isbn" ], "summary": "Prograph is a visual, object-oriented, dataflow, multiparadigm programming language that uses iconic symbols to represent actions to be taken on data. Commercial Prograph software development environments such as Prograph Classic and Prograph CPX were available for the Apple Macintosh and Windows platforms for many years but were eventually withdrawn from the market in the late 1990s. Support for the Prograph language on macOS has recently reappeared with the release of the Marten software development environment.", "pageId": 521637, "created": 2004, "backlinksCount": 22, "revisionCount": 152, "dailyPageViews": 24, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Prograph" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1011", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nVisual Programming with Prograph CPX|1995|Scott B. Steinman|4051326|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1995|Prentice Hall|Visual Programming With Prograph Cpx|Steinman, Scott B. and Carver, Kevin G.|9780134411637\n1995|Manning Publications|Visual Programming With Prograph Cpx|Scott B Steinman|9781884777059" }, "progres": { "title": "PROGRES", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6c95f7f3e59d0e6cba1d384e7e12c78d0d7d9dba" ], "country": [ "Germany" ], "originCommunity": [ "Rheinisch-Westfaelische Technische Hochschule Aachen University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1656", "centralPackageRepositoryCount": 0 }, "progsbase": { "title": "progsbase", "appeared": 2018, "type": "pl", "creators": [ "Martin F. Johansen" ], "description": "A programming language and tooling for timeless programming. Programs written in progsbase can be reused across time and space. Code written in progsbase can currently be translated to 13 other languages, but many more can be supported.", "website": "https://www.progsbase.com/", "documentation": [ "https://www.progsbase.com/docs/" ], "spec": "https://www.progsbase.com/docs/", "reference": [ "https://www.progsbase.com/featuredpost/progsbase-a-timeless-translatable-and-understandable-programming-system/" ], "country": [ "Norway" ], "originCommunity": [ "Inductive AS" ], "domainName": { "registered": 2017, "awisRank": { "2022": 3521085 }, "name": "progsbase.com" }, "hasFunctions": { "example": "", "value": true }, "hasAssignment": { "example": "", "value": true }, "hasAssertStatements": { "example": "", "value": false }, "hasGenerics": { "example": "", "value": false }, "hasSingleDispatch": { "example": "", "value": false }, "hasPointers": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasConstructors": { "example": "", "value": false }, "hasGarbageCollection": { "example": "", "value": false }, "hasImports": { "example": "", "value": true }, "hasInterfaces": { "example": "", "value": false }, "hasIterators": { "example": "", "value": false }, "hasMacros": { "example": "", "value": false }, "hasOperatorOverloading": { "example": "", "value": false }, "hasZeroBasedNumbering": { "example": "", "value": true }, "hasModules": { "example": "", "value": true }, "hasIncrementAndDecrementOperators": { "example": "", "value": false }, "hasLineComments": { "example": "", "value": true }, "hasThreads": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": false }, "hasMultiLineComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "isCaseSensitive": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": false }, "hasClasses": { "example": "", "value": false }, "hasConstants": { "example": "", "value": false }, "hasExceptions": { "example": "", "value": false }, "hasSwitch": { "example": "", "value": false }, "hasAccessModifiers": { "example": "", "value": false }, "hasInheritance": { "example": "", "value": false }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "", "value": false }, "hasHexadecimals": { "example": "", "value": false }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": false }, "hasBinaryNumbers": { "example": "", "value": false }, "hasScientificNotation": { "example": "", "value": true }, "hasDirectives": { "example": "", "value": false }, "hasMultipleInheritance": { "example": "", "value": false }, "hasLists": { "example": "", "value": false }, "hasMessagePassing": { "example": "", "value": true }, "hasStaticTyping": { "example": "", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": false }, "hasMultilineStrings": { "example": "", "value": true }, "hasBitWiseOperators": { "example": "", "value": false }, "hasPatternMatching": { "example": "", "value": false }, "hasManualMemoryManagement": { "example": "", "value": true }, "hasGotos": { "example": "", "value": false }, "hasStructs": { "example": "", "value": true }, "packageRepository": [ "https://repo.progsbase.com/repoviewer/" ], "twitter": "https://twitter.com/progsbase", "fileType": "text", "isbndb": "year|publisher|title|authors|isbn13\n2022|Amazon KDP|Foundations of computer Science|Johansen, Martin Fagereng|9798836363796" }, "proiv": { "title": "PROIV", "appeared": 1976, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "McDonnell Information Systems" ], "wikipedia": { "related": [ "abap", "focus", "pick-operating-system", "jvm", "linux", "solaris", "postgresql", "c" ], "summary": "PROIV is a low code development platform, developed and sold by NorthgateArinso, part of the Northgate Information Solutions Group. It has an active community of around 2500 developers and end-users worldwide, ranging from consultants to large multinationals, finance institutions, tax authorities, retailers, engineering companies, media operators and software houses. PROIV's usual application domain is database-centric business applications. PROIV has some similarities to languages such as ABAP, FOCUS and RPG. PROIV programs consist of declarative/non-procedural specifications that control the overall structure of the program and database access and that have an implicit sequence of execution (which PROIV programmers refer to as the timing cycle). Procedural subroutines can be added by the programmer; these are written in a 3GL-like language which PROIV calls \"Logic\". Note that in PROIV programs are referred to as \"functions\", which can be confusing as it differs from the more usual use of that term in programming languages.", "pageId": 580197, "created": 2004, "backlinksCount": 9, "revisionCount": 125, "dailyPageViews": 14, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/PROIV" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "project-mentat": { "title": "Project Mentat", "appeared": 2016, "type": "queryLanguage", "creators": [ "Richard Newman" ], "description": "Project Mentat is a persistent, embedded knowledge base. It draws heavily on DataScript and Datomic. This project was started by Mozilla, but is no longer being developed or actively maintained by them.", "website": "https://mentat.rs/", "reference": [ "https://mozilla.github.io/mentat" ], "country": [ "United States" ], "originCommunity": [ "Mozilla Foundation" ], "domainName": { "name": "mentat.rs" }, "related": [ "datascript", "datomic", "sqlite" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "{:db/id :person/email\n :db/valueType :db.type/string\n :db/cardinality :db.cardinality/many ; People can have multiple email addresses.\n :db/unique :db.unique/identity ; For our purposes, each email identifies one person.\n :db/index true} ; We want fast lookups by email.\n{:db/id :person/friend\n :db/valueType :db.type/ref\n :db/cardinality :db.cardinality/many} ; People can have many friends." ], "githubRepo": { "firstCommit": 2016, "stars": 28, "forks": 1, "subscribers": 3, "created": 2018, "updated": 2022, "description": "A persistent, relational store inspired by Datomic and DataScript.", "issues": 299, "url": "https://github.com/qpdb/mentat" }, "repoStats": { "firstCommit": 2016, "commits": 1530, "committers": 27, "files": 2321 } }, "prolog-d-linda": { "title": "Prolog-D-Linda", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d3b1b8ffbe9469eaaf409e640c190e3156064cdc" ], "country": [ "Australia" ], "originCommunity": [ "James Cook University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2408", "centralPackageRepositoryCount": 0 }, "prolog-elf": { "title": "Prolog-ELF", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/542c5cff6183e73d68782c1118acf2c1dfee7e27" ], "country": [ "Japan" ], "originCommunity": [ "University of Tokyo" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2003", "centralPackageRepositoryCount": 0 }, "prolog-iii": { "title": "Prolog III", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/281cb123812ab786ac4675e095b5ef22ee83d861" ], "country": [ "France" ], "originCommunity": [ "Aix-Marseille Université" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1112", "centralPackageRepositoryCount": 0 }, "prolog-kr": { "title": "Prolog/KR", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/419b71f6e9c856ffdfc0b37b3abb622cba83626e" ], "country": [ "Japan" ], "originCommunity": [ "The University of Tokyo" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4207", "centralPackageRepositoryCount": 0 }, "prolog-linda": { "title": "Prolog-Linda", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/327db1716b1ef4e6de076616bb88b8c43d0c2e78" ], "country": [ "Australia" ], "originCommunity": [ "The University of Western Australia" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2409", "centralPackageRepositoryCount": 0 }, "prolog-pack-pm": { "title": "Prolog Pack", "appeared": 2012, "type": "packageManager", "reference": [ "http://www.swi-prolog.org/pldoc/doc/_SWI_/library/prolog_pack.pl", "https://www.swi-prolog.org/pack/list", "https://www.swi-prolog.org/download/devel/doc/SWI-Prolog-6.1.4.pdf", "https://github.com/SWI-Prolog/swipl-devel/commits/6c9b4c35d35c795c9a688d6f065723063ed08071?after=6c9b4c35d35c795c9a688d6f065723063ed08071+139&branch=6c9b4c35d35c795c9a688d6f065723063ed08071&path%5B%5D=library&path%5B%5D=prolog_pack.pl&qualified_name=6c9b4c35d35c795c9a688d6f065723063ed08071" ], "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/SWI-Prolog" ], "packageCount": 275, "forLanguages": [ "prolog" ] }, "prolog": { "title": "Prolog", "appeared": 1972, "type": "pl", "creators": [ "Alain Colmerauer" ], "documentation": [ "https://www.swi-prolog.org/pldoc/index.html" ], "fileExtensions": [ "pl", "pro", "P" ], "country": [ "United Kingdom and France" ], "originCommunity": [ "University of Edinburgh", "Aix-Marseille University" ], "hasComments": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasMacros": { "example": "term_expansion(parent_child(Parent, Child),\n child_parent(Child, Parent)).\nparent_child(trevor, simon).\n% With the above definitions, we can query (even though the predicate child_parent/2 is nowhere explicitly defined in the code above):\n?- child_parent(Child, Parent).\n Child = simon, Parent = trevor.", "value": true }, "hasLineComments": { "example": "% A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasOctals": { "example": "% 0o[0-7]+", "value": true }, "hasHexadecimals": { "example": "% 0x[0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "% (\\d+\\.\\d*|\\d*\\.\\d+)([eE][+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "% \\d\\d?\\'[a-zA-Z0-9]+", "value": true }, "hasBinaryNumbers": { "example": "% 0b[01]+", "value": true }, "lineCommentToken": [ [ "%" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "write" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "rule(q0, 1, q0, 1, right).\nrule(q0, b, qf, 1, stay)." ], "related": [ "poplog", "swi-prolog", "visual-prolog", "mercury", "oz", "erlang", "datalog", "unicode", "lambda-prolog", "html", "xml", "rdf", "owl", "actionscript", "lisp", "planner", "agentspeak" ], "summary": "Prolog is a general-purpose logic programming language associated with artificial intelligence and computational linguistics. Prolog has its roots in first-order logic, a formal logic, and unlike many other programming languages, Prolog is intended as primarily a declarative programming language: the program logic is expressed in terms of relations, represented as facts and rules. A computation is initiated by running a query over these relations. The language was first conceived by a group around Alain Colmerauer in Marseille, France, in the early 1970s and the first Prolog system was developed in 1972 by Colmerauer with Philippe Roussel. Prolog was one of the first logic programming languages, and remains the most popular among such languages today, with several free and commercial implementations available. The language has been used for theorem proving, expert systems, term rewriting, type inference, and automated planning, as well as its original intended field of use, natural language processing. Modern Prolog environments support the creation of graphical user interfaces, as well as administrative and networked applications. Prolog is well-suited for specific tasks that benefit from rule-based logical queries such as searching databases, voice control systems, and filling templates.", "pageId": 23485, "dailyPageViews": 1127, "created": 2001, "backlinksCount": 1469, "revisionCount": 1748, "appeared": 1972, "fileExtensions": [ "pl", "pro", "P" ], "url": "https://en.wikipedia.org/wiki/Prolog" }, "githubLanguage": { "fileExtensions": [ "pl", "pro", "prolog", "yap" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "swipl", "yap" ], "aceMode": "prolog", "tmScope": "source.prolog", "repos": 22512, "id": "Prolog" }, "githubBigQuery": { "repos": 11137, "users": 9245, "id": "Prolog" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/prolog", "pygmentsHighlighter": { "filename": "prolog.py", "fileExtensions": [ "ecl", "prolog", "pro", "pl" ], "id": "Prolog" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2018, "committerCount": 10, "commitCount": 63, "sampleCount": 9, "example": [ "%6.8\nsubset(Set, Subset) :-\n\tappend(L1, Subset, Set).\npowerset(Set, Subset) :-\n\tbagof(Subset, subset(Set, Subset), Subset).\n" ], "url": "https://github.com/alnkpa/sublimeprolog" }, "projectEuler": { "memberCount": { "2019": 143, "2022": 156 }, "id": "Prolog" }, "helloWorldCollection": [ "% Hello World in Prolog\n\nhello :- display('Hello World!') , nl .\n" ], "leachim6": { "filepath": "p/Prolog.pro", "fileExtensions": [ "pro" ], "example": [ "helloWorld :-\n write('Hello World').\n\n:- helloWorld.\n" ], "id": "Prolog" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Prolog", "quineRelay": "Prolog", "rijuRepl": { "example": [ ":- initialization main.\n\nmain :-\n write(\"Hello, world!\"), nl.\n" ], "id": "https://riju.codes/prolog" }, "indeedJobs": { "2022": 79, "query": "prolog developer" }, "linkedInSkill": { "2018": 36743, "id": "prolog" }, "faqPageUrl": [ "https://www.swi-prolog.org/FAQ/" ], "downloadPageUrl": [ "https://www.swi-prolog.org/Download.html" ], "subreddit": [ { "memberCount": { "2017": 1756, "2022": 7884 }, "url": "https://reddit.com/r/prolog" } ], "meetup": { "memberCount": 3771, "groupCount": 8, "url": "https://www.meetup.com/topics/prolog" }, "tiobe": { "currentRank": 41, "id": "Prolog" }, "hopl": "https://hopl.info/showlanguage.prx?exp=562", "packageRepository": [ "http://www.swi-prolog.org/pldoc/doc/_SWI_/library/prolog_pack.pl" ], "ubuntuPackage": "swi-prolog", "jupyterKernel": [ "https://github.com/Calysto/calysto_prolog" ], "fileType": "text", "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPROLOG: Programming for Artificial Intelligence|1986|Ivan Bratko|2059933|3.75|166|4\nProgramming in PROLOG: Using the ISO Standard|1981|William F. Clocksin|1601676|3.57|83|4\nThe Art of Prolog: Advanced Programming Techniques|1994|Leon Sterling|2365132|3.91|22|2\nThe Art Of Prolog: Advanced Programming Techniques|1986|Leon Sterling|1710377|3.79|43|2\nLogic Programming with PROLOG|2005|Max Bramer|2069010|3.56|16|0", "isbndb": "year|publisher|title|authors|isbn13\n2006|College Publications|Learn Prolog Now! (Texts in Computing, Vol. 7)|Patrick Blackburn and Johan Bos and Kristina Striegnitz|9781904987178\n1990|Addison-Wesley Pub (Sd)|Prolog Programming for Artificial Intelligence|Bratko, Ivan|9780201416060\n1988|Oxford University Press|Logic with Prolog (Oxford Applied Mathematics and Computing Science Series)|Gibbins, Peter|9780198596592\n2003|Kendall Hunt Publishing|INTRODUCTION TO PROGRAMMING LANGUAGES: PRINCIPLES, C, C++, SCHEME AND PROLOG|Yinong Chen|9780757503672\n1998|Routledge|An Introduction to Natural Language Processing Through Prolog (Learning about Language)|Matthews, Clive|9780582066229\n2005|Springer|Logic Programming with Prolog|Bramer, Max|9781852339388\n2003|MIT Press|The Practice of Prolog (Logic Programming)|Sterling, Leon S.|9780262514453\n1988|Addison-Wesley|Computing With Logic: Logic Programming With Prolog|Maier, David and Warren, David S.|9780805366815\n1993|Alfred Waller Ltd|Application Programming in Quintus Prolog|Lucas, Robert|9781872474045\n1992|Wiley|Techniques of Prolog Programming with Implementation of Logical Negation and Quantified Goals|Van Le, T.|9780471571759\n1983|Tab Books|Disc For Turbo Prolog Advanced Programming Techniques|Hashim|9780830666645\n1997|Springer|Clause and Effect: Prolog Programming for the Working Programmer|Clocksin, William F.|9783540652373\n1988|The Mit Press|Concurrent Prolog - 2 Vol. Set: Collected Papers (logic Programming)|Ehud Shapiro; with a foreword by Kazuhiro Fuchi|9780262192552\n1987|Prentice-hall International|Productive Prolog Programming (prentice-hall International Series In Computer Science)|Peter Schnupp|9780137251100\n1986|Addison-Wesley Pub. Co|Prolog programming: Applications for database systems, expert systems, and natural language systems|Marcus, Claudia|9780201146479\n2007|Alpha Science Intl Ltd|Introduction To Prolog|R. P. Suri|9781842653968\n1984|Research Studies Press Wiley|A Prolog Database System|Li, Deyi , 1944-|9780863800146\n1988|Scott Foresman & Co|Prolog Programming In Depth|Michael A. Covington and Donald Nute and Andre Vellino|9780673186591\n1991|Oxford University Press|Knowledge Systems Through Prolog|Kim, Steven H.|9780195072419\n1996|Prentice Hall|From Logic Programming to Prolog|Apt, Krzysztof R.|9780132303682\n2015|CreateSpace Independent Publishing Platform|Prolog Programming Success in a Day: Beginners Guide to Fast, Easy and Efficient Learning of Prolog Programming|Key, Sam|9781516878444\n1989|Springer|Concepts, Design, and Performance Analysis of a Parallel Prolog Machine (Lecture Notes in Computer Science (404))|Beer, Joachim|9783540520535\n2011-08-31T00:00:01Z|Pearson Education Canada|Prolog Programming for Artificial Intelligence (4th Edition) (International Computer Science Series)|Bratko, Ivan|9780321417466\n2019-11-15T00:00:01Z|Kendall Hunt Pub Co|Introduction to Programming Languages: Programming in C C++ Scheme Prolog C# and Python|Chen, Yinong|9781792407994\n2013|Springer|Logic Programming with Prolog|Bramer, Max|9781447154877\n2017|Independently published|Expert Systems in Prolog|Merritt, Dennis|9781723821868\n1994|Springer-Verlag|Programming in Prolog|Clocksin, W. F. and Mellish, C. S.|9780387583501\n1990|The MIT Press|The Practice of Prolog (Logic Programming)||9780262193016\n1997|Springer|Clause and Effect: Prolog Programming for the Working Programmer|Clocksin, William F.|9783540629719\n2013|Springer|Logic Programming with Prolog|Bramer, Max|9781447154860\n1996|Prentice Hall|Prolog Programming in Depth|Covington, Michael A. and Nute, Donald and Vellino, Andre|9780131386457\n2009|The MIT Press|The Craft of Prolog (Logic Programming)|O'Keefe, Richard|9780262512275\n2000|Pearson|Prolog Programming for Artificial Intelligence|Bratko, Ivan|9780201403756\n1990|The MIT Press|The Craft of Prolog (Logic Programming)|Richard A. O'Keefe|9780262150392\n1984|Springer Berlin Heidelberg|Programming in Prolog|Clocksin, William F.|9783540150114\n1986|Addison-Wesley|Prolog programming for artificial intelligence (International computer science series)|Bratko, Ivan|9780201142242\n1989-12-18T00:00:01Z|Springer|An Introduction to Programming in Prolog|Saint-Dizier, Patrick|9780387971445\n2012-01-26T00:00:01Z|Kendall Hunt Publishing|INTRODUCTION TO PROGRAMMING LANGUAGES: PRINCIPLES, C, C++, SCHEME AND PROLOG|CHEN YINONG and TSAI WEI-TEK|9780757529740\n2015-08-26T00:00:01Z|Lulu.com|Prolog Programming Success In A Day|Key, Sam|9781329502369\n1990|Wiley|Logic, Programming and Prolog|Nilsson, Ulf and Maluszynski, Jan|9780471926252\n1987|The MIT Press|Concurrent Prolog - Vol. 2: Collected Papers (Logic Programming)||9780262192675\n1995|Wiley|Logic, Programming and Prolog|Nilsson, Ulf and Maluszynski, Jan|9780471959960\n1987|Springer|Programming in PROLOG|Clocksin, William F and Clocksin, W F and Mellish, C S|9780387175393\n1987-12-31T00:00:01Z|Springer-Verlag Berlin and Heidelberg GmbH & Co. K|Programming in Prolog|Clocksin, W F|9783540175391\n1996|Prentice Hall|An Introduction to Logic Programming Through Prolog (Prentice Hall International Series in Computer Science)|Spivey, J. M. and Spivey, Michael|9780135360477\n1991|Wiley|Prolog for Natural Language Processing|Gal, Annie and Lapalme, Guy and Saint-Dizier, Patrick and Somers, Harold|9780471930129\n2001|Cengage Learning EMEA|Prolog Programming for Students: With Expert Systems and Artificial Intelligence Topics|Callear, David|9781844801121\n1999|Springer|Agent-Oriented Programming: From Prolog to Guarded Definite Clauses (Lecture Notes in Computer Science (1630))|Huntbach, Matthew M. and Ringwood, Graem A.|9783540666837\n1985|Palgrave HE UK|Prolog Programming and Applications (MacMillan Computer Science)|Burnham, W. and Hall, Alex|9780333391594\n1987|H.W. Sams|Advanced Turbo prolog programming|Shafer, Dan|9780672225734\n1987|The MIT Press|Concurrent Prolog - Vol. 1: Collected Papers (Volume 1) (Logic Programming)||9780262192668\n2001|Thomson Learning|Prolog Programming for Students: With Expert Systems and Artificial Intelligence Topics|Callear, David|9780826454966\n1981|Springer-Verlag|Programming in Prolog|Clocksin, W. F|9780387110462\n1994|Addison-Wesley|Prolog ++: The Power of Object-Oriented and Logic Programming (International Series in Logic Programming)|Moss, Chris|9780201565072\n2021|PEARSON INDIA|Prolog : Programming for Artificial Intelligence, 3/e|BRATKO|9788131711347\n1986|Springer-Verlag Telos|Programming in PROLOG|Clocksin, W. F. and Mellish, C. S.|9780387150116\n1989|Springer|Prolog Versus You: An Introduction to Logic Programming|Johansson, Anna-Lena and Eriksson-Granskog, Agneta and Edman, Anneli|9783540175773\n2012|Springer Science & Business Media|Programming In Prolog|W. F. Clocksin and C. S. Mellish|9783642968730\n1984-01-01T00:00:01Z|Springer Berlin Heidelberg|Programming in Prolog|Clocksin, William F.|9783540110460\n20121206|Springer Nature|Programming in Prolog|William F. Clocksin; Christopher S. Mellish|9783642554810\n2011|Springer|Adventure in Prolog (Springer Compass International)|Merritt, Dennis|9781461280071\n2013|LAP LAMBERT Academic Publishing|Prolog and inductive reasoning: a logic programming language|Alsmail, Kumeel Alsmail|9783659486784\n1989|Wiley|Prolog Programming|Nigel Ford|9780471921417\n1987|Longman Higher Education Division (a Pearson Education Company)|Further Programming Prolog|Hepburn|9780745802879\n20220323|O'Reilly Media, Inc.|Programmer Passport: Prolog|Bruce Tate|9781680509380\n1985|Macmillan International Higher Education|Prolog Programming And Applications||9781349079629\n1985|Wiley|Prolog Programming And Applications|W. D Burnham|9780470202630\n||Logic Programming With Prolog|Bramer and Max|9781848008410\n||Introduction To Turbo Prolog|Carl Townsend|9788170291046\n20040114|CRC Press|Problem Solving With Prolog|John Stobo|9780203168905\n20140714|Princeton University Press|The Implementation of Prolog|Patrice Boizumault|9781400863440\n1992-04-01|Mit Pr|Prolog Vlsi Implementations (logic Programming)|Pierluigi Civera|9780262031707\n2012|Springer-Verlag New York, LLC|Building Expert Systems in Prolog|Dennis Merritt|9781461389132\n1988|Tab Books|Turbo Prolog Advanced Programming Techniques|Safaa H Hashim|9780830693085\n1988|Prentice Hall|Introduction To Programming In Prolog|Danny Crookes|9780137101481\n|John Wiley & Sons|PROLOG for Natural Language Processing||9780471930891\n1988|Prentice Hall|Expert Systems Programming In Turbo Prolog|Daniel H. Marcellus|9780132958417\n2012|Springer Science & Business Media|An Introduction To Programming In Prolog|Patrick Saint-Dizier|9781461233329\n1990|Springer-verlag Berlin And Heidelberg Gmbh & Co. K|An Introduction To Programming In Prolog|Patrick Saint-dizier|9783540971443\n1990|Mit Pr|Prolog And It's Applications (logic Programming Series)||9780262521512\n1990|Pearson Higher Education|Logic Programming: Prolog And Stream Parallel Languages|Jan Newmarch|9780724807000\n1986|Addison-wesley Professional|Logic Programming: Prolog Its Appl Vid Pkg|Kowalski|9780201145045\n1996|Mcgraw Hill Higher Education|Programming Languages: Paradigm And Practice: Prolog Minimanual|Appleby|9780070053199\n1988|Sigma Press|Prolog Through Examples: A Practical Programming Guide|I. Kononenko and N. Lavrac|9781850580720\n1991|Mcgraw Hill Higher Education|Programming Languages: Paradigm And Practice: Prolog Mini-manual|J.k|9780070025790\n1990|Alfred Waller Ltd|Prolog Programming: A Tutorial Introduction (artificial Intelligence Texts)|Carlton Mcdonald and Masoud Yazdani|9780632012466\n20160701|Taylor & Francis|An Introduction to Natural Language Processing Through Prolog|Clive Matthews|9781317898337\n1987|Prentice Hall Europe (a Pearson Education Company)|Hepburn: Further Programming In Prolog - Writing Application Programs (cloth)|Philip Henry Hepburn|9780745801735\n1994|Open University Worldwide|Programming And Programming Languages: Prolog V. 2 (course M353)||9780749247966\n2015-06-29|LAP LAMBERT Academic Publishing|A Quick Guide To An Introduction to Expert System Using PROLOG|Alemu Kumilachew Tegegnie and Adane Nega Tarekegn|9783659749155\n|Wiley|Techniques Of Prolog Programming: With Implementation Of Logical Negation And Quantified Goals|Van Le, T.|\n1988|Prentice Hall|Introduction To Programming In Prolog (prentice Hall International Series In Computer Science)|Danny Crookes|9780137101467\n1992|John Wiley & Sons Inc|Techniques Of Prolog Programming With Implementation Of Logical Negation And Quantified Goals Software||9780471591085\n1993|John Wiley And Sons Ltd|The Techniques Of Prolog Programming With Implementation Of Logical Negation And Quantified Goals|T. Van Le|9780471599708\n1990|Prentice Hall|Logic Programming: Prolog And Stream Parallel Languages (prentice Hall Advances In Computer Science Series)|J. D. Newmarch|9780135398425", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1987|Programming in Prolog|10.1007/978-3-642-97005-4|1301|102|W. Clocksin and C. Mellish|ec74eaf722b5fb9c49e3fe38fe30ddf3dda61d72\n1987|Prolog and Natural-Language Analysis|10.2307/414538|397|27|F. Pereira and S. Shieber|547d483ed1e80066693af561f63daa30ffa8e9fa\n1977|Prolog - the language and its implementation compared with Lisp|10.1145/800228.806939|157|6|D. Warren and L. Pereira and Fernando C Pereira|57f796c1bb843b65ba45c42aa00c1068c529eae0\n1992|High-performance logic programming with the Aquarius Prolog compiler|10.1109/2.108055|141|8|P. V. Roy and A. Despain|901aabda7822b120245399bde172dbaf2cc68d9d\n1982|Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog|10.1145/582153.582181|134|4|J. Komorowski|bd0021d9a1816dad9759c43dc0a0889917fcdd22\n2005|Logic Programming with Prolog|10.1007/978-1-4471-5487-7|116|30|M. Bramer|ae8a471753922d18c550cd0fa7db01055c82e85f\n1985|If Prolog is the Answer, What is the Question? or What it Takes to Support AI Programming Paradigms|10.1109/TSE.1985.231888|69|0|D. Bobrow|b3f45bca1bcbd81fd5319341ad15907b37d85890\n1986|Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog|10.1007/3-540-16492-8_119|61|4|M. Fujita and S. Kono and Hidehiko Tanaka and T. Moto-Oka|6266ea0a988231d0d73544cca601e9300fc9ec0b\n1985|Reasoning about protein topology using the logic programming language PROLOG|10.1016/0263-7855(85)80027-8|60|0|C. Rawlings and W. Taylor and J. Nyakairu and John Fox and M. Sternberg|5cae6a91ba51c2febd78839a801c3085c1849610\n1984|Systems programming in concurrent prolog|10.1145/800017.800520|55|1|E. Shapiro|29607edfbf48bd0d820f9d45854e19320c7520d1\n1991|Prolog programming techniques|10.1007/BF00120879|39|1|P. Brna and A. Bundy and Tony Dodd and M. Eisenstadt and C. Looi and H. Pain and D. Robertson and Barbara M. Smith and M. Someren|d1e1c791ea0fb12f3929ee1362fca0e571b18e5f\n1986|Prolog programming: applications for database systems, expert systems, and natural language systems|10.1016/0950-5849(87)90357-0|15|0|C. Marcus|f6bb99f3f2e0eac5f238729fae7a99d36c5dca2f\n1989|Rapid prototyping of programming language semantics using Prolog|10.1109/CMPSAC.1989.65123|14|0|B. Bryant and Aiqin Pan|b5e4a9cbbbb5b528668f5cb70628160e9240b18a\n1986|Programming in Modal Logic: An Extension of PROLOG based on Modal Logic|10.1007/3-540-18024-9_24|12|1|Y. Sakakibara|5e6f4bb243db724e65fe1c56c177a58350e69f88\n1984|On implementing Prolog in functional programming|10.1007/BF03037326|11|0|M. Carlsson|319932ff3d51905bb0557c8076982b1e6c22c8e9\n2010|Natural language processing: a prolog perspective|10.1007/s10462-009-9151-4|6|0|Christian Bitter and David A. Elizondo and Yingjie Yang|389a0f41524e226c6a01e31040e6e8ee279b824b\n1970|Prolog As A First Programming Language|10.2495/SEHE940321|6|0|Martin P. Lee and J. Pryce and A. Harrison|db49d728b8ceec7570695c877c66a02e268d6685\n1986|Pitfalls in PROLOG programming|10.1145/15095.15102|5|0|K. Ng and W. Ma|3cee6a1787ec611e962a733b5be822749be11505\n1985|Prolog Programming and Applications|10.1109/mex.1986.4306988|5|0|W. D. Burnham and A. Hall and R. Bharath|f12d2a1753264f09e792e1343742640d136f289f\n1990|A plea for a readable Prolog programming style|10.1145/101356.101360|4|0|Robert McLaughlin|beea2925d73b4bf7edb8017644b6068123b9831a\n1988|Enhancing Prolog to Support Prolog Programming Environments|10.1007/3-540-19027-9_21|4|0|A. Martelli and G. Rossi|281a193b8fcd79442cd54d98e8e95ccaed15d162\n2012|An adaptive prolog programming language with machine learning|10.1109/CCIS.2012.6664359|1|0|Benjie Lu and Zhiqing Liu and Hui Gao|a22535f08ebba5e76633ceb8a321cbb156727dfc\n2013|Design an Arm Robot through Prolog Programming Language|10.4172/2168-9695.1000104|1|0|A. Azad and T. Rashid|1e2d636b3b4df2802b0815122ba551c001f7235a" }, "prologpp": { "title": "Prolog++", "appeared": 1994, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9b8daa85bb9f08a0844d02a2fd738d8c061df517" ], "country": [ "United Kingdom" ], "originCommunity": [ "Logic Programming Associates" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Prolog%2B%2B" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1767", "centralPackageRepositoryCount": 0 }, "promal": { "title": "PROMAL", "appeared": 1986, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Systems Management Associates" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "wikipedia": { "example": [ "PROGRAM SIEVE\n ; Sieve of Eratosthenes Benchmark\n ; test (BYTE magazine)\n ; 10 iterations, 1800 element array.\n INCLUDE LIBRARY\n CON SIZE=1800\n WORD I\n WORD J\n WORD PRIME\n WORD K\n WORD COUNT\n BYTE FLAGS[SIZE]\n \n BEGIN\n OUTPUT \"10 ITERATIONS\"\n FOR J= 1 TO 10\n COUNT=0\n FILL FLAGS, SIZE, TRUE\n FOR I= 0 TO SIZE\n IF FLAGS[I]\n PRIME=I+I+3\n K=I+PRIME\n WHILE K <= SIZE\n FLAGS[K]=FALSE\n K=K+PRIME\n COUNT=COUNT+1\n OUTPUT \"#C#I PRIMES\", COUNT\n END" ], "related": [ "abc", "python" ], "summary": "PROMAL (PROgrammer's Microapplication Language) is a structured programming language from Systems Management Associates for MS-DOS, Commodore 64, and Apple II. PROMAL features simple syntax, no line numbers, long variable names, functions and procedures with argument passing, real number type, arrays, strings, pointer, and a built-in I/O library. Like ABC and Python, indentation is part of the language syntax. The language uses a single-pass compiler to generate byte code that is interpreted when the program is run. Since the memory is very limited on these early home computers, the compiler can compile to/from disk and memory. The software package for C64 includes a full-screen editor and command shell. See also [Computer Language, Mar 1986, pp. 128–134].", "created": 2004, "backlinksCount": 11, "pageId": 1064169, "revisionCount": 38, "dailyPageViews": 7, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/PROMAL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1261", "centralPackageRepositoryCount": 0, "isbndb": "" }, "promela": { "title": "Promela", "appeared": 1997, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "printf" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Promela" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "pml" ], "aceMode": "text", "tmScope": "source.promela", "repos": 109, "id": "Promela" }, "githubBigQuery": { "repos": 21, "users": 21, "id": "Promela" }, "leachim6": { "filepath": "p/Promela.pml", "fileExtensions": [ "pml" ], "example": [ "active proctype main(){\n printf(\"Hello World\")\n}\n" ], "id": "Promela" }, "rijuRepl": { "example": [ "active proctype main() {\n printf(\"Hello, world!\\n\");\n}\n" ], "id": "https://riju.codes/promela" } }, "prometheus": { "title": "PROMETHEUS", "appeared": 2012, "type": "pl", "creators": [ "Matt T. Proud" ], "website": "https://prometheus.io/", "reference": [ "https://download.opensuse.org/update/leap/15.2/oss/x86_64/golang-github-prometheus-prometheus-2.22.1-lp152.3.4.1.x86_64.rpm.mirrorlist", "http://www.ai1.uni-bayreuth.de/en/projects/Prometheus/index.html" ], "country": [ "Germany" ], "originCommunity": [ "SoundCloud Limited" ], "githubRepo": { "firstCommit": 2012, "stars": 46169, "forks": 7765, "subscribers": 1134, "created": 2012, "updated": 2023, "description": "The Prometheus monitoring system and time series database.", "issues": 837, "url": "https://github.com/prometheus/prometheus" }, "repoStats": { "firstCommit": 2012, "commits": 11682, "committers": 1019, "files": 1127 }, "hopl": "https://hopl.info/showlanguage.prx?exp=2411", "centralPackageRepositoryCount": 0 }, "prompter": { "title": "prompter", "appeared": 2011, "type": "pl", "creators": [ "Graham Nelson" ], "description": "“Blood and Laurels”, “Bramble House” and other Versu titles are instead written in a language called Prompter which compiles down to Praxis. Besides making it feasible to write large-scale narratives for Versu, Prompter has two other goals: to enable faster development, and to make Versu content more human-readable. Readability matters. It matters for all soware, in fact, but especially here. In Prompter, the basic unit for grouping code together is the “scene”.", "reference": [ "http://worrydream.com/refs/Nelson%20-%20Prompter%20-%20A%20Domain-Speci!c%20Language%20for%20Versu.pdf" ], "country": [ "United Kingdom" ], "originCommunity": [ "Little Text People" ], "compilesTo": [ "praxis-lang" ], "example": [ "A poor young straight Ancient Roman man. By reputation he is\nattractive - “[He] is widely accounted tremendously handsome”,\nintelligent - “[He] is known for his poetry, and cannot be\nsupposed a fool”, but not proper - “[His] misbehaviour, with\nvarious ladies, is the talk of the town”. He is open,\nunconscientious, extroverted and &irtatious. He is concerned\nwith attractiveness, intelligence and friendship" ] }, "promql": { "title": "PromQL", "appeared": 2014, "type": "queryLanguage", "website": "https://prometheus.io/docs/prometheus/latest/querying/basics/", "reference": [ "https://timber.io/blog/promql-for-humans/" ], "cheatSheetUrl": [ "https://files.timber.io/pdfs/PromQL+Cheatsheet.pdf" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/prometheus" ], "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "example": [ "topk(3, sum by (app, proc) (rate(instance_cpu_time_ns[5m])))" ], "pygmentsHighlighter": { "filename": "promql.py", "fileExtensions": [ "promql" ], "id": "PromQL" }, "centralPackageRepositoryCount": 0 }, "property-specification-language": { "title": "Property Specification Language", "appeared": 2004, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Accellera Systems Initiative" ], "wikipedia": { "example": [ "((true[*]; req; ack) |=> (start; data[*3]; end) @ clk" ], "related": [ "vhdl", "verilog", "systemverilog" ], "summary": "Property Specification Language (PSL) is a temporal logic extending Linear temporal logic with a range of operators for both ease of expression and enhancement of expressive power. PSL makes an extensive use of regular expressions and syntactic sugaring. It is widely used in the hardware design and verification industry, where formal verification tools (such as model checking) and/or logic simulation tools are used to prove or refute that a given PSL formula holds on a given design. PSL was initially developed by Accellera for specifying properties or assertions about hardware designs. Since September 2004 the standardization on the language has been done in IEEE 1850 working group. In September 2005, the IEEE 1850 Standard for Property Specification Language (PSL) was announced.", "created": 2004, "backlinksCount": 255, "pageId": 762084, "revisionCount": 109, "dailyPageViews": 30, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Property_Specification_Language" }, "centralPackageRepositoryCount": 0 }, "prophet": { "title": "PROPHET", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/278608bb506afba2bd4b2c9c4166ad485dbcd5df" ], "country": [ "United States" ], "originCommunity": [ "Bolt Beranek and Newman, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4346", "wordRank": 9657, "centralPackageRepositoryCount": 0 }, "proplan": { "title": "PROPLAN", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/886457bf258e2b5ab537e40daaebfd275f41febb" ], "country": [ "United States" ], "originCommunity": [ "Procter & Gamble Company" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5971", "centralPackageRepositoryCount": 0 }, "proset": { "title": "ProSet", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b0d78f9fea44c60186b6957d94fbb2a6bf7d4be2" ], "country": [ "Germany" ], "originCommunity": [ "University of Essen" ], "wikipedia": { "related": [ "setl" ], "summary": "ProSet is a set theoretic programming language that is being developed at the University of Essen as a successor to SETL. It is a very-high level language that supports prototyping. ProSet provides the following first-class data types: atom, integer, real, string, boolean, tuple, set. Functions and modules are also first-class.", "backlinksCount": 4, "pageId": 919134, "dailyPageViews": 2, "created": 2004, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/ProSet" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1586", "centralPackageRepositoryCount": 0 }, "prosper": { "title": "PROSPER", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7df3e21087df2ccf4be7e2e68967ae5ced04034a" ], "country": [ "Poland and United States" ], "originCommunity": [ "Polish Academy of Sciences", "Iowa State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1514", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2000|The PROSPER Toolkit|10.1007/3-540-46419-0_7|67|3|Louise Dennis and G. Collins and Michael Norrish and R. Boulton and Konrad Slind and Graham Robinson and M. Gordon and T. Melham|89c1580dc770048345c3454771c495119326d6f5\n2003|The PROSPER toolkit|10.1007/s100090200076|40|0|Louise Dennis and G. Collins and Michael Norrish and R. Boulton and Konrad Slind and T. Melham|6b779efdcbd19a0692f5074d3dfddd3b99a73228" }, "protel": { "title": "Protel", "appeared": 1975, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "Nortel Networks Corporation" ], "wikipedia": { "related": [ "pascal", "algol-68" ], "summary": "Protel stands for \"Procedure Oriented Type Enforcing Language\". It is a programming language created by Nortel Networks and used on telecommunications switching systems such as the DMS-100. Protel-2 is the object-oriented version of Protel.PROTEL languages were designed to meet the needs of digital telephony and is the basis of the DMS-100 line of switching systems PROTEL is a strongly typed, block-structured language which is based heavily on PASCAL and ALGOL 68 with left-to-right style of variable assignment, variable-sized arrays, and extensible structures. The designers of PROTEL significantly extended PASCAL of the day by adding external compilation and extending the data structures available in the language.", "created": 2007, "backlinksCount": 13, "pageId": 13134192, "revisionCount": 52, "dailyPageViews": 17, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Protel" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4094", "centralPackageRepositoryCount": 0 }, "proteus-programming-language": { "title": "Proteus", "appeared": 1998, "type": "pl", "country": [ "Italy" ], "originCommunity": [ "http://www.zanella-hifi.com/szp/bugrep.html" ], "wikipedia": { "related": [ "c", "basic", "clipper", "unix", "linux", "regex", "csv" ], "summary": "Proteus (PROcessor for TExt Easy to USe) is a fully functional, procedural programming language created in 1998 by Simone Zanella. Proteus incorporates many functions derived from several other languages: C, BASIC, Assembly, Clipper/dBase; it is especially versatile in dealing with strings, having hundreds of dedicated functions; this makes it one of the richest languages for text manipulation. Proteus owes its name to a Greek god of the sea (Proteus), who took care of Neptune's crowd and gave responses; he was renowned for being able to transform himself, assuming different shapes. Transforming data from one form to another is the main usage of this language.", "created": 2011, "backlinksCount": 2, "pageId": 31314339, "revisionCount": 18, "dailyPageViews": 10, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Proteus_%28programming_language%29" }, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1991|Prototyping parallel and distributed programs in Proteus|10.1109/SPDP.1991.218300|48|3|P. Mills and L. Nyland and J. Prins and J. Reif and R. Wagner|46f2b99c5ea2fea167c53da9e8cbe75c6f712054\n1994|Specification and Development of Parallel Algorithms with the Proteus System|10.1090/dimacs/018/23|15|0|Allen T. Goldberg and P. Mills and L. Nyland and J. Prins and J. Reif and J. Riely|7f94853a0886c88d4bcde2d6ad4b59ec12662695\n1992|Prototyping N-body simulation in Proteus|10.1109/IPPS.1992.222981|12|0|P. Mills and L. Nyland and J. Prins and J. Reif|2a8ff885ceacf1cf51a8dc893f843ae2a2b0b16a\n2010|LED Display Screen Design and Proteus Simulation Based on Single-Chip Microcomputer|10.1109/ICIECS.2010.5677762|6|0|Yanchuang Ding and Jinying Guo|44b0f09274e0d1ac4c327cb54806e7047cfcc4a0" }, "protium": { "title": "protium", "appeared": 2007, "type": "pl", "creators": [ "Diarmuid Pigott" ], "website": "http://www.protiumblue.com/", "reference": [ "http://enacademic.com/dic.nsf/enwiki/3468524" ], "country": [ "Australia" ], "originCommunity": [ "Strapper" ], "domainName": { "registered": 2019, "name": "protiumblue.com" }, "example": [ "<@ DEFAREFLE>pleac\n<@ DEFFLELIT>pleac|C:\\Documents and Settings\\All Users\\Documents\\Projects\\PLEAC\\pleac_perl.data\n<@ ITEENUFLELIT>pleac|\n<@ LETVARELTFLE>aLine|...\n<@ TSTRXPVARLIT>aLine|# \\^\\^PLEAC\\^\\^_(\\d+\\.\\d+)\n<@ IFF><@ LETVARKEY>number|__Reg1\n<@ ACTSNKLIT>__Off\n<@ ACTSNKEMMLIT>pleac_perl_&number;.p\n\n<@ SAYVAR>aLine\n" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "proto-gnosis": { "title": "proto-GNOSIS", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0a837de8a148a3a28dbe616972aa430a53291158" ], "country": [ "Former West Germany or Germany" ], "originCommunity": [ "University of Cologne" ], "influencedBy": [ "mumps", "prolog" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8095", "centralPackageRepositoryCount": 0 }, "protobuf": { "title": "Protocol Buffers", "appeared": 2008, "type": "idl", "website": "https://developers.google.com/protocol-buffers/", "documentation": [ "https://developers.google.com/protocol-buffers/docs/overview" ], "originCommunity": [ "Google" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasOctals": { "example": "// 0[0-7]+[LlUu]*", "value": true }, "hasHexadecimals": { "example": "// 0x[0-9a-fA-F]+[LlUu]*", "value": true }, "hasFloats": { "example": "// (\\d+\\.\\d*|\\.\\d+|\\d+)[eE][+-]?\\d+[LlUu]*", "value": true }, "hasIntegers": { "example": "// \\d+[LlUu]*", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "syntax", "import", "weak", "public", "package", "option", "repeated", "oneof", "map", "reserved", "to", "max", "enum", "message", "service", "rpc", "stream", "returns", "package", "optional", "true", "false" ], "example": [ "message Person {\n required string name = 1;\n required int32 id = 2;\n optional string email = 3;\n}" ], "wikipedia": { "example": [ "// polyline.cpp\n#include \"polyline.pb.h\" // generated by calling \"protoc polyline.proto\"\n\nLine* createNewLine(const std::string& name) {\n // create a line from (10, 20) to (30, 40)\n Line* line = new Line;\n line->mutable_start()->set_x(10);\n line->mutable_start()->set_y(20);\n line->mutable_end()->set_x(30);\n line->mutable_end()->set_y(40);\n line->set_label(name);\n return line;\n}\n\nPolyline* createNewPolyline() {\n // create a polyline with points at (10,10) and (20,20)\n Polyline* polyline = new Polyline;\n Point* point1 = polyline->add_point();\n point1->set_x(10);\n point1->set_y(10);\n Point* point2 = polyline->add_point();\n point2->set_x(20);\n point2->set_y(20);\n return polyline;\n}" ], "related": [ "xml", "thrift", "java", "csharp", "python", "go", "ruby", "objective-c", "perl", "php", "scala", "julia" ], "summary": "Protocol Buffers is a method of serializing structured data. It is useful in developing programs to communicate with each other over a wire or for storing data. The method involves an interface description language that describes the structure of some data and a program that generates source code from that description for generating or parsing a stream of bytes that represents the structured data. Google developed Protocol Buffers for use internally and has provided a code generator for multiple languages under an open source license (see below). The design goals for Protocol Buffers emphasized simplicity and performance. In particular, it was designed to be smaller and faster than XML. Protocol Buffers is widely used at Google for storing and interchanging all kinds of structured information. The method serves as a basis for a custom remote procedure call (RPC) system that is used for nearly all inter-machine communication at Google. Protocol Buffers are similar to the Apache Thrift (used by Facebook) or Microsoft Bond protocols, offering as well a concrete RPC protocol stack to use for defined services called gRPC. A software developer defines data structures (called messages) and services in a proto definition file (.proto) and compiles it with protoc. This compilation generates code that can be invoked by a sender or recipient of these data structures. For example, example.proto will produce example.pb.cc and example.pb.h, which will define C++ classes for each message and service that example.proto defines. Canonically, messages are serialized into a binary wire format which is compact, forward- and backward-compatible, but not self-describing (that is, there is no way to tell the names, meaning, or full datatypes of fields without an external specification). There is no defined way to include or refer to such an external specification (schema) within a Protocol Buffers file. The officially supported implementation includes an ASCII serialization format, but this format—though self-describing—loses the forward- and backward-compatibility behavior, and is thus not a good choice for applications other than debugging. Though the primary purpose of Protocol Buffers is to facilitate network communication, its simplicity and speed make Protocol Buffers an alternative to data-centric C++ classes and structs, especially where interoperability with other languages or systems might be needed in the future.", "pageId": 18338104, "dailyPageViews": 439, "created": 2008, "backlinksCount": 86, "revisionCount": 218, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Protocol_Buffers" }, "githubLanguage": { "fileExtensions": [ "proto" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "protobuf", "codemirrorMode": "protobuf", "codemirrorMimeType": "text/x-protobuf", "tmScope": "source.proto", "aliases": [ "protobuf", "Protocol Buffers" ], "repos": 23747, "id": "Protocol Buffer" }, "githubBigQuery": { "repos": 11692, "users": 10064, "id": "Protocol Buffer" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/protobuf3", "monaco": "protobuf", "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "proto" ], "id": "Protocol Buffer" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2018, "committerCount": 2, "commitCount": 11, "sampleCount": 1, "example": [ "package tutorial;\n\noption java_package = \"com.example.tutorial\";\noption java_outer_classname = \"AddressBookProtos\";\n\nmessage Person {\n required string name = 1;\n required int32 id = 2;\n optional string email = 3;\n\n enum PhoneType {\n MOBILE = 0;\n HOME = 1;\n WORK = 2;\n }\n\n message PhoneNumber {\n required string number = 1;\n optional PhoneType type = 2 [default = HOME];\n }\n\n repeated PhoneNumber phone = 4;\n}\n\nmessage AddressBook {\n repeated Person person = 1;\n}\n" ], "url": "https://github.com/michaeledgar/protobuf-tmbundle" }, "indeedJobs": { "2022": 94, "query": "protocol buffers developer" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "protos-l": { "title": "PROTOS-L", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1783a738e09f64393365c81c32d2c66200d02505" ], "country": [ "Germany" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5243", "centralPackageRepositoryCount": 0 }, "protosynthex": { "title": "Protosynthex", "appeared": 1964, "type": "pl", "reference": [ "https://onlinelibrary.wiley.com/doi/abs/10.1002/bs.3830120110" ], "country": [ "United States" ], "originCommunity": [ "University of Illinois" ], "hopl": "https://hopl.info/showlanguage.prx?exp=459" }, "proverif-lang": { "title": "ProVerif", "appeared": 2014, "type": "pl", "creators": [ "Bruno Blanchet" ], "description": "ProVerif is an automatic cryptographic protocol verifier, in the formal model (so called Dolev-Yao model).", "reference": [ "https://prosecco.gforge.inria.fr/personal/bblanche/proverif/manual.pdf" ], "fileExtensions": [ "pv" ], "country": [ "France" ], "originCommunity": [ "Institut national de recherche en sciences et technologies du numérique" ] }, "providex": { "title": "ProvideX", "appeared": 1992, "type": "pl", "creators": [ "Michael F. King" ], "country": [ "Canada" ], "originCommunity": [ "Sage Software Canada" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "! This example code shows some ways to do the traditional hello world.\n!\nbegin\n print 'CS', ! Clear Screen\n ! Plain Text\n print \"Hello World!\"\n\n ! Fonted Text (Error branch moves to next line if fonted text not available)\n print (0,err=*next)'Font'(\"Arial,-16,B\"), ! Use Bold 16pt Arial Font\n print (0,err=*next)'Text'(@x(20),@y(2),\"Hello World\"),\n\n ! Move to the 2nd to last line on screen\n print @(3,mxl(0)-2),\"Press Enter: \",\n input a$\n\n ! Message Box\n msgbox \"Hello World\"+sep+sep+\"This is a test message box.\",\"Message Box\"\nend" ], "related": [ "unix", "linux", "business-basic" ], "summary": "ProvideX is a computer language and development environment derived from Business Basic (a business oriented derivative of BASIC) in the mid-1980s. ProvideX is available on several operating systems (Unix/Linux/Windows/Mac OS X) and includes not only the programming language but also file system, presentation layer interface, and other components. The language is primarily designed for use in the development of business applications. Over the years since its inception and as the computer industry has changed, ProvideX has added functionality such as a graphical interface, client-server capabilities, access to external databases, web services, and, more recently, object-oriented programming capabilities. On October 8, 2010, PVX Plus Technologies announced that it has assumed all ongoing sales, development, and support of the ProvideX product line for Independent Software Vendors. This brings the development of the language back under control of the original creator, Mike King and is the end result of almost 2 years of negotiations between Sage, EDIAS, and PVX Plus Technologies.", "pageId": 2276397, "created": 2005, "backlinksCount": 97, "revisionCount": 49, "dailyPageViews": 18, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/ProvideX" }, "leachim6": { "filepath": "p/ProvideX.vim", "fileExtensions": [ "vim" ], "example": [ "begin \n print \"Hello World\" \nend\n" ], "id": "ProvideX" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "prow": { "title": "PROW", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/577e96521d62b9ebb5fd67412a21b02e9cd67b90" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University", "National Institute of Health" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8179", "centralPackageRepositoryCount": 0 }, "proxy": { "title": "Proxy", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a6bb78b10ac4f7e191db3a784114b004767797e9" ], "country": [ "United States" ], "originCommunity": [ "EDL Software Design" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5094", "wordRank": 5837, "centralPackageRepositoryCount": 0 }, "prql": { "title": "PRQL", "appeared": 2022, "type": "queryLanguage", "creators": [ "Maximilian Roos" ], "description": "PRQL is a modern language for transforming data — a simple, powerful, pipelined SQL replacement", "website": "https://prql-lang.org/", "reference": [ "https://news.ycombinator.com/item?id=31897430", "https://news.ycombinator.com/item?id=30060784" ], "standsFor": "Pipelined Relational Query Language", "country": [ "South Africa and United States" ], "originCommunity": [ "https://github.com/PRQL" ], "domainName": { "registered": 2022, "awisRank": { "2022": 7177742 }, "name": "prql-lang.org" }, "compilesTo": [ "sql" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "from employees\nfilter country == \"USA\" # Each line transforms the previous result.\naggregate [ # `aggregate` reduces column to a value.\n max salary,\n min salary,\n count, # Closing commas are allowed :)\n]", "from employees\nfilter start_date > @2021-01-01 # Clear date syntax.\nderive [ # `derive` adds columns / variables.\n gross_salary = salary + (tax ?? 0), # Terse coalesce\n gross_cost = gross_salary + benefits_cost, # Variables can use other variables.\n]\nfilter gross_cost > 0\ngroup [title, country] ( # `group` runs a pipeline over each group.\n aggregate [ # `aggregate` reduces each group to a row.\n average gross_salary,\n sum_gross_cost = sum gross_cost, # `=` sets a column name.\n ]\n)\nfilter sum_gross_cost > 100000 # Identical syntax for SQL's `WHERE` & `HAVING`.\nderive id = f\"{title}_{country}\" # F-strings like python.\nsort [sum_gross_cost, -country] # `-country` means descending order.\ntake 1..20 # Range expressions (also valid here as `take 20`)." ], "githubRepo": { "firstCommit": 2022, "stars": 4261, "forks": 71, "subscribers": 41, "created": 2022, "updated": 2022, "description": "PRQL is a modern language for transforming data — a simple, powerful, pipelined SQL replacement", "issues": 83, "url": "https://github.com/prql/prql" }, "repoStats": { "firstCommit": 2022, "commits": 1831, "committers": 59, "files": 584 }, "semanticScholar": "" }, "ps-algol": { "title": "PS-algol", "appeared": 1981, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of St Andrews", "University of Edinburgh" ], "wikipedia": { "related": [ "s-algol" ], "summary": "PS-algol is an orthogonally persistent programming language. PS-algol was an extension of the language S-algol implemented by the University of St Andrews and the University of Edinburgh, Scotland. S-algol was designed by Ron Morrison, and extended and by Pete Bailey, Fred Brown, Paul Cockshott, Ken Chisholm and Al Dearle. PS-algol was the world's first fully implemented persistent programming language, and had a significant quantity of users both in academia and, notably, in ICL research labs.", "created": 2011, "backlinksCount": 8, "pageId": 31727718, "revisionCount": 13, "dailyPageViews": 2, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/PS-algol" }, "hopl": "https://hopl.info/showlanguage.prx?exp=972", "centralPackageRepositoryCount": 0 }, "psather": { "title": "pSather", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c1f6a05ddd3edddb8a16f78cc1c2aee494423077" ], "country": [ "Germany" ], "originCommunity": [ "University of California, Berkeley", "Universität Saarbrücken" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2415", "centralPackageRepositoryCount": 0 }, "pseint": { "title": "PSeInt", "appeared": 2003, "type": "pl", "website": "http://pseint.sourceforge.net/index.php", "country": [ "Argentina" ], "nativeLanguage": "Spanish", "originCommunity": [ "https://pseint.sourceforge.net/index.php?page=contacto.php" ], "rijuRepl": { "example": [ "Proceso Main\n Escribir \"¡Hola, mundo!\";\nFinProceso\n" ], "id": "https://riju.codes/pseint" } }, "psg": { "title": "PSG", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e64a3719a08356b4482517a9d52b2ed01a1df10b" ], "country": [ "United States" ], "originCommunity": [ "American Academy of Sleep Medicine" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4624", "centralPackageRepositoryCount": 0 }, "psi": { "title": "PSI", "appeared": 2013, "type": "pl", "reference": [ "http://departure.dk/files/pspl.pdf" ], "country": [ "Germany" ], "originCommunity": [ "http://departure.dk" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6348", "wordRank": 8802, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|Springer|Perspectives of system informatics: 4th International Andrei Ershov Memorial Conference, PSI 2001, Akademgorodok, Novosibirsk, Russia, July 2-6, 2001 : revised papers|International Andrei Ershov Memorial Conference (4th : 2001 : Novosibirsk, Russia)|9783540430759\n2003|Springer|Perspectives Of Systems Informatics: 5th International Andrei Ershov Memorial Conference, Psi 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, ... Papers (lecture Notes In Computer Science)|International Andrei Ershov Memorial Conference (5th : 2003 : Akademgorodok, Novosibirsk, Russia)|9783540208136\n2016|Springer|Perspectives of System Informatics: 10th International Andrei Ershov Informatics Conference, PSI 2015, in Memory of Helmut Veith, Kazan and Innopolis, ... Notes in Computer Science Book 9609)|Manuel Mazzara|9783319415796\n2010|Springer Netherlands|Multicriteria Analysis in Engineering: Using the PSI Method with MOVI 1.0|Statnikov, R.B. and Matusov, J.B.|9789401599689\n2015|Springer|Perspectives of System Informatics: 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected ... Notes in Computer Science Book 8974)|Andrei Voronkov|9783662468234" }, "psl": { "title": "PSL", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6979acd46bd44d862a3923a8938e945495662f1e" ], "country": [ "United States" ], "originCommunity": [ "University of Utah" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1009", "centralPackageRepositoryCount": 0 }, "psyche-c": { "title": "psyche-c", "appeared": 2016, "type": "compiler", "creators": [ "Leandro T. C. Melo" ], "description": "Psyche-c is a compiler for incomplete C code. It features a Hindley/Milner-inspired type inference engine for C.", "country": [ "Brazil" ], "originCommunity": [ "https://github.com/ltcmelo/psychec/issues" ], "githubRepo": { "stars": 441, "forks": 34, "subscribers": 19, "created": 2016, "updated": 2022, "firstCommit": 2016, "description": "A compiler frontend for the C programming language", "issues": 7, "url": "https://github.com/ltcmelo/psychec" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "psyche": { "title": "psyche", "appeared": 2018, "type": "pl", "country": [ "Japan" ], "originCommunity": [ "https://github.com/0918nobita/psyche/issues" ], "githubRepo": { "firstCommit": 2018, "stars": 4, "forks": 0, "subscribers": 2, "created": 2021, "updated": 2022, "description": "Programming Language", "issues": 0, "url": "https://github.com/0918nobita/psyche" }, "repoStats": { "firstCommit": 2018, "commits": 437, "committers": 2, "files": 103 } }, "psyco": { "title": "PSYCO", "appeared": 2007, "type": "grammarLanguage", "website": "https://psyco.sourceforge.net", "country": [ "Switzerland" ], "originCommunity": [ "https://sourceforge.net/p/psyco/_list/tickets" ], "wikipedia": { "backlinksCount": 44, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Psyco" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3185" }, "pt": { "title": "PT", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/52f4ac1716064d09d73784fa153ce598bf80553d" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2865", "wordRank": 3473, "centralPackageRepositoryCount": 0, "isbndb": "" }, "ptx": { "title": "PTX", "appeared": 2009, "type": "assembly", "description": "PTX, a low-level parallel thread execution virtual machine and instruction set architecture (ISA). PTX exposes the GPU as a data-parallel computing device.", "website": "https://llvm.org/docs/NVPTXUsage.html", "reference": [ "https://www.nvidia.com/content/cuda-ptx_isa_1.4.pdf" ], "aka": [ "nvptx" ], "originCommunity": [ "Nvidia" ], "wikipedia": { "example": [ ".shared .align 8 .b8 pbatch_cache[15744]; // define 15744 bytes, aligned to an 8-byte boundary" ], "related": [ "assembly-language", "cuda" ], "summary": "Parallel Thread Execution (PTX, or NVPTX) is a pseudo-assembly language used in Nvidia's CUDA programming environment. The nvcc compiler translates code written in CUDA, a C++-like language, into PTX, and the graphics driver contains a compiler which translates the PTX into a binary code which can be run on the processing cores.", "backlinksCount": 13, "pageId": 25073119, "created": 2009, "revisionCount": 37, "dailyPageViews": 19, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Parallel_Thread_Execution" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "public-key-file": { "title": "Public Key File", "appeared": 1995, "type": "application", "reference": [ "https://en.wikipedia.org/wiki/Secure_Shell" ], "country": [ "United States" ], "originCommunity": [ "Internet Engineering Task Force" ], "example": [ "ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAAAgQCw3QQtYgRViVH8ZpkQ2A7BuCeyPYC4hB9kKNhxwUfJ2hFgW8soGMBhsLN+vOeAJ2IXDMsezJO2/qhoZFQMvHoWpWTRTLPeNtBsKD+nhOZX28A4D+QRzVZ6hdWoh9W+mIP69MIT3aX35oLb86IycbNdRJlEK4FAUt7tjezNkU7boQ== root@use1-2.nitrousbox.com" ], "githubLanguage": { "fileExtensions": [ "asc", "pub" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "codemirrorMode": "asciiarmor", "codemirrorMimeType": "application/pgp", "tmScope": "none", "id": "Public Key" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "pufft": { "title": "PUFFT", "appeared": 1965, "type": "pl", "reference": [ "https://www.semanticscholar.org/paper/PUFFT%E2%80%94The-Purdue-University-fast-FORTRAN-translator-Rosen-Spurgeon/b7c693622af63766b2d73bc52a515b5e1cb11715", "https://semanticscholar.org/paper/55394e8e351470c632b859f54556777436ae8079" ], "country": [ "United States" ], "originCommunity": [ "Purdue University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=235", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "pug": { "title": "Pug", "appeared": 2010, "type": "template", "creators": [ "Tj Holowaychuk" ], "website": "https://pugjs.org", "webRepl": [ "https://playcode.io/pug/" ], "documentation": [ "https://pugjs.org/api/getting-started.html" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/pugjs" ], "domainName": { "awisRank": { "2022": 173271 }, "name": "pugjs.org" }, "hasSemanticIndentation": { "example": "", "value": true }, "hasForEachLoops": { "example": "ul\n each val in [1, 2, 3, 4, 5]\n li= val", "value": true }, "hasImports": { "example": "//- index.pug\ndoctype html\nhtml\n include includes/head.pug\n body\n h1 My Site\n p Welcome to my super lame site.\n include includes/foot.pug", "value": true }, "hasConditionals": { "example": "- var user = {description: 'foo bar baz'}\n- var authorised = false\n#user\n if user.description\n h2.green Description\n p.description= user.description\n else if authorised\n h2.blue Description\n p.description.\n User has no description,\n why not add one...\n else\n h2.red Description\n p.description User has no description", "value": true }, "hasSwitch": { "example": "- var friends = 10\ncase friends\n when 0\n p you have no friends\n when 1\n p you have a friend\n default\n p you have #{friends} friends", "value": true }, "hasFunctions": { "example": "mixin article(title)\n .article\n .article-wrapper\n h1= title\n if block\n block\n else\n p No content provided\n\n+article('Hello world')\n\n+article('Hello world')\n p This is my\n p Amazing article", "value": true }, "hasAssignment": { "example": "- var title = \"On Dogs: Man's Best Friend\";\n\nh1= title", "value": true }, "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasInheritance": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "keywords": [ "append", "block", "case", "default", "doctype", "each", "else", "extends", "for", "if", "in", "include", "mixin", "typeof", "unless", "var", "when" ], "githubRepo": { "firstCommit": 2010, "stars": 20817, "forks": 1973, "subscribers": 553, "created": 2010, "updated": 2022, "description": "Pug – robust, elegant, feature rich template engine for Node.js", "issues": 280, "url": "https://github.com/pugjs/pug" }, "repoStats": { "firstCommit": 2010, "commits": 2715, "committers": 266, "files": 918 }, "githubLanguage": { "fileExtensions": [ "jade", "pug" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "jade", "codemirrorMode": "pug", "codemirrorMimeType": "text/x-pug", "tmScope": "text.jade", "repos": 11560, "id": "Pug" }, "githubBigQuery": { "repos": 575, "users": 528, "id": "Pug" }, "monaco": "pug", "pygmentsHighlighter": { "filename": "html.py", "fileExtensions": [ "pug", "jade" ], "id": "Pug" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2016, "committerCount": 16, "commitCount": 118, "sampleCount": 2, "example": [ "p.\n Hello,\n World!" ], "url": "https://github.com/davidrios/jade-tmbundle" }, "leachim6": { "filepath": "p/Pug.pug", "fileExtensions": [ "pug" ], "example": [ "doctype html\nhtml\n head\n title Hello World\n body\n h1 Hello World" ], "id": "Pug" }, "rijuRepl": { "example": [ "html\n body\n p Hello, world!\n" ], "id": "https://riju.codes/pug" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2016|Apress|Programming Web Applications with Node, Express and Pug|Krause, Jörg|9781484225103\n20161220|Springer Nature|Programming Web Applications with Node, Express and Pug|Jörg Krause|9781484225110", "semanticScholar": "" }, "pumpkin": { "title": "PUMPKIN", "appeared": 1974, "type": "pl", "reference": [ "https://semanticscholar.org/paper/cd3c946dd8e41e9716300e5328362e16668512c5" ], "country": [ "United States" ], "originCommunity": [ "Brown University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=655", "centralPackageRepositoryCount": 0 }, "punched-tape": { "title": "Punched tape", "appeared": 1943, "type": "notation", "country": [ "France" ], "originCommunity": [ "silk center" ], "wikipedia": { "related": [ "ascii" ], "summary": "Punched tape or perforated paper tape is a form of data storage, consisting of a long strip of paper in which holes are punched to store data. Now effectively obsolete, it was widely used during much of the twentieth century for teleprinter communication, for input to computers of the 1950s and 1960s, and later as a storage medium for minicomputers and CNC machine tools.", "pageId": 49761, "dailyPageViews": 196, "created": 2002, "backlinksCount": 221, "revisionCount": 401, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/Punched_tape" }, "fileType": "paper", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "punycode": { "title": "Punycode", "appeared": 2003, "type": "characterEncoding", "reference": [ "https://tools.ietf.org/html/rfc3492" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "wikipedia": { "summary": "Punycode is a representation of Unicode with the limited ASCII character subset used for Internet hostnames. Using Punycode, host names containing Unicode characters are transcoded to a subset of ASCII consisting of letters, digits, and hyphens, which is called the Letter-Digit-Hyphen (LDH) subset. For example, München (German name for Munich) is encoded as Mnchen-3ya. While the Domain Name System (DNS) technically supports arbitrary sequences of octets in domain name labels, the DNS standards recommend the use of the LDH subset of ASCII conventionally used for host names, and require that string comparisons between DNS domain names should be case-insensitive. The Punycode syntax is a method of encoding strings containing Unicode characters, such as internationalized domain names (IDNA), into the LDH subset of ASCII favored by DNS. It is specified in IETF Request for Comments 3492.", "backlinksCount": 190, "pageId": 380586, "dailyPageViews": 313, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Punycode" } }, "puppet": { "title": "Puppet", "appeared": 2005, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Puppet, Inc" ], "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "wikipedia": { "example": [ "user { 'harry':\n ensure => present,\n uid => '1000',\n shell => '/bin/bash',\n home => '/var/tmp'\n}" ], "related": [ "clojure", "ruby", "linux", "rest", "solaris" ], "summary": "In computing, Puppet is an open-source software configuration management tool. It runs on many Unix-like systems as well as on Microsoft Windows, and includes its own declarative language to describe system configuration. Puppet is produced by Puppet, founded by Luke Kanies in 2005. It is written in Ruby and released as free software under the GNU General Public License (GPL) until version 2.7.0 and the Apache License 2.0 after that.", "pageId": 14432911, "dailyPageViews": 586, "created": 2007, "backlinksCount": 144, "revisionCount": 286, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Puppet_(software)" }, "githubLanguage": { "fileExtensions": [ "pp" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "Modulefile" ], "aceMode": "text", "codemirrorMode": "puppet", "codemirrorMimeType": "text/x-puppet", "tmScope": "source.puppet", "repos": 23445, "id": "Puppet" }, "githubBigQuery": { "repos": 14936, "users": 8311, "id": "Puppet" }, "codeMirror": "puppet", "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "pp" ], "id": "Puppet" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 9, "commitCount": 72, "sampleCount": 5, "example": [ "hiera_include('classes')\n" ], "url": "https://github.com/russCloak/SublimePuppet" }, "languageServerProtocolProject": [ "https://github.com/lingua-pupuli/puppet-editor-services\nwrittenIn ruby" ], "twitter": "https://twitter.com/puppetize", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1996|Amer Library Assn|Amazingly Easy Puppet Plays: 42 New Scripts for One-Person Puppetry|Anderson, Dee|9780838906972\n2014|Apress|Pro Puppet|Krum, Spencer and Van Hevelingen, William and Kero, Ben and Turnbull, James and McCune, Jeffrey|9781430260417\n20080902|Springer Nature|Pulling Strings with Puppet|James Turnbull|9781430206224\n2017|Packt Publishing|Puppet 5 Beginner's Guide - Third Edition: Go from newbie to pro with Puppet 5|Arundel, John|9781788395366\n2017|Packt Publishing|Puppet 4.10 Beginner's Guide - Second Edition: From newbie to pro with Puppet 4.10|Arundel, John|9781787120969\n2011|Packt Publishing|Puppet 2.7 Cookbook|Arundel, John|9781849515399\n2015|Packt Publishing|Learning Puppet Security|Slagle, Jason|9781784398897\n2016|Packt Publishing|Puppet for Containerization|Coulton, Scott|9781785885389\n2013|Packt Publishing|Puppet 3 Cookbook|Arundel, John|9781782169765\n2011|Packt Publishing|Puppet 2.7 Cookbook|Arundel, John|9781849515382\n20121212|O'Reilly Media, Inc.|Puppet Types and Providers|Dan Bode; Nan Liu|9781449339302", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Rehearsal: a configuration verification tool for puppet|10.1145/2908080.2908083|50|11|Rian Shambaugh and Aaron Weiss and Arjun Guha|3d09b1c2ba9f3c985cbbda778dd53f6f8dd888c5\n2016|muPuppet: A Declarative Subset of the Puppet Configuration Language|10.4230/LIPIcs.ECOOP.2017.12|7|0|Weili Fu and R. Perera and P. Anderson and J. Cheney|8165b44e7a4f455fb6f5fd43e0e83b0e1d6e5722" }, "pure": { "title": "Pure", "appeared": 2008, "type": "pl", "creators": [ "Albert Gräf" ], "website": "https://agraef.github.io/pure-lang/", "country": [ "Germany" ], "originCommunity": [ "https://bitbucket.org/purelang/pure-lang/issues" ], "wikipedia": { "example": [ "extern int puts(char*);\n hello = puts \"Hello, world!\";\n hello;" ], "related": [ "freebsd", "linux", "haskell", "lisp", "alice", "matlab", "llvmir", "c", "miranda", "puredata", "octave", "opengl", "faust", "supercollider" ], "summary": "Pure, successor to the equational language Q, is a dynamically typed, functional programming language based on term rewriting. It has facilities for user-defined operator syntax, macros, arbitrary-precision arithmetic (multiple-precision numbers), and compiling to native code through the LLVM. Pure is free and open-source software distributed (mostly) under the GNU Lesser General Public License version 3 or later. Pure comes with an interpreter and debugger, provides automatic memory management, has powerful functional and symbolic programming abilities, and interfaces to libraries in C (e.g., for numerics, low-level protocols, and other such tasks). At the same time, Pure is a small language designed from scratch; its interpreter is not large, and the library modules are written in Pure. The syntax of Pure resembles that of Miranda and Haskell, but it is a free-format language and thus uses explicit delimiters (rather than off-side rule indents) to denote program structure. The Pure language is a successor of the equational programming language Q created formerly by the same author, Albert Gräf at the University of Mainz, Germany. Relative to Q, it offers some important new features (such as local functions with lexical scoping, efficient vector and matrix support, and the built-in C interface) and programs run much faster as they are compiled just-in-time to native code on the fly. Pure is mostly aimed at mathematical applications and scientific computing currently, but its interactive interpreter environment, the C interface and the growing set of addon modules make it suitable for a variety of other applications, such as artificial intelligence, symbolic computation, and real-time multimedia processing. Pure plug-ins are available for the Gnumeric spreadsheet and Miller Puckette's Pure Data graphical multimedia software, which make it possible to extend these programs with functions written in the Pure language. Interfaces are also provided as library modules to GNU Octave, OpenCV, OpenGL, the GNU Scientific Library, FAUST, SuperCollider, and liblo (for Open Sound Control (OSC)).", "pageId": 20446791, "dailyPageViews": 31, "created": 2008, "backlinksCount": 34, "revisionCount": 100, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Pure_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Pure", "tryItOnline": "pure", "fileType": "text", "wordRank": 3337, "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Proof-producing translation of higher-order logic into pure and stateful ML|10.1017/S0956796813000282|52|7|Magnus O. Myreen and Scott Owens|5b203abc65643b5237ffb703e01ff5ae080b35fe\n2012|Position paper: nondeterminism is unavoidable, but data races are pure evil|10.1145/2414729.2414732|48|3|H. Boehm|caf8e6709fc112adc62ac1ef57dd4dfc561aec67\n2012|Task-oriented programming in a pure functional language|10.1145/2370776.2370801|47|5|M. J. Plasmeijer and B. Lijnse and Steffen Michels and P. Achten and P. Koopman|5a2f4c1479f02950563df29427322005125a3efd\n2011|Realizability and Parametricity in Pure Type Systems|10.1007/978-3-642-19805-2_8|43|3|Jean-Philippe Bernardy and Marc Lasson|f2458d0def87bc42e57cb308b7145eb83bf9efeb\n1990|Representing Object Identity in a Pure Functional Language|10.1007/3-540-53507-1_69|26|1|A. Ohori|596a96ca28d3ad73ab4bb09a2532d266e83a0b9d\n2014|Programming BDI Agents with Pure Java|10.1007/978-3-319-11584-9_15|21|0|A. Pokahr and L. Braubach and C. Haubeck and J. Ladiges|cbd32c3e8f0b4c15469956e271d6de1ab57a57d9\n2019|Milestones from the Pure Lisp theorem prover to ACL2|10.1007/s00165-019-00490-3|16|1|J. S. Moore|9608e7fb5b37c9208fe8af63e10e83e029a23405\n2014|Automatic design of sound synthesizers as pure data patches using coevolutionary mixed-typed cartesian genetic programming|10.1145/2576768.2598303|15|2|Matthieu Macret and P. Pasquier|05382fbb8c09605c4e410d8a5d8a99aabfcc982e\n2016|Pure ion chromatogram extraction via optimal k-means clustering|10.1039/C6RA08409E|7|0|H. Ji and Hongmei Lu and Zhimin Zhang|3d4c18b2c730b4262c73ea976ef48272d435d2c9\n2013|Pure trait-based programming on the Java platform|10.1145/2500828.2500835|7|0|Lorenzo Bettini and F. Damiani|7f2d5abb57901a4503be1c3d31dbb7c1e175ae3c\n1989|Imperative Effects from a Pure Functional Language|10.1007/978-1-4471-3166-3_11|6|0|L. McLoughlin and E. S. Hayes|d917999058a69013f538afdba8ac5d8d43cd4202\n2013|Pure Pointer Programs and Tree Isomorphism|10.1007/978-3-642-37075-5_21|5|0|M. Hofmann and Ramyaa and Ulrich Schöpp|6097deb125048c581e9cfecf0e518206fc408a23\n2002|A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language|10.1007/3-540-45628-7_7|4|0|K. Ueda|3cb9bba2dd901c9920ba44d66c5a5b92fa4f2bbe\n2015|A Game Engine in Pure Python for CS1: Design, Experience, and Limits|10.1145/2729094.2742590|4|0|John Aycock and Etienne Pitout and Sarah Storteboom|719053092aadf4ccdd46e6af9e26ce18c2b0d6a9\n1991|Parallel Programming with Pure Functional Languages|10.1007/3-540-55160-3_48|3|0|R. Harrison|475f93a9ee89b25b4bcc22b53a14adeae8b76544\n2013|An evaluation of a pure embedded domain-specific language for strategic term rewriting|10.4018/978-1-4666-2092-6.CH004|3|0|Shirren Premaratne and A. Sloane and Len Hamey|8123bee5eded32079734e106b60a7ea60ac88497\n2021|A Synchronous Effects Logic for Temporal Verification of Pure Esterel|10.1007/978-3-030-67067-2_19|2|1|Yahui Song and W. Chin|821f0b1c578451f71677a8a0d571f6b0f71ae4a7\n2015|Introduction to Pure Data|10.1007/978-1-4842-1583-8_1|1|0|Alexandros Drymonitis|c129841a37361b2fd04c1c0c5942e273bf4b4f43\n1993|Dynamic programming in a pure functional language|10.1145/162754.162864|1|0|R. Harrison and C. Glass|39df21ea57c745856838c45662bbd253a33e1330" }, "purebasic": { "title": "PureBasic", "appeared": 1998, "type": "pl", "website": "http://www.purebasic.com", "documentation": [ "https://www.purebasic.com/documentation/index.html" ], "originCommunity": [ "Fantaisie Software" ], "domainName": { "registered": 2000, "awisRank": { "2022": 790778 }, "name": "purebasic.com" }, "releaseNotesUrl": "https://www.purebasic.com/news.php", "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "PrintN" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "Structure type_name\n field_name.type ; Single field. Perhaps the structures attachment.\n field_name[count].type ; Static arrays.\n ; ... \n ; Optional construction StructureUnion .. EndStructureUnion allows you\n ; to combine multiple fields into one area of memory\n ; that is sometimes required for the conversion types.\n StructureUnion\n type_name.type\n ; ... \n EndStructureUnion \nEndStructure" ], "related": [ "basic", "linux", "x86-isa", "powerpc", "isbn" ], "summary": "PureBasic is a commercially distributed procedural computer programming language and integrated development environment based on BASIC and developed by Fantaisie Software for Windows 32/64-bit, Linux 32/64-bit, and macOS. An Amiga version is available, although it has been discontinued and some parts of it are released as open source. The first public release of PureBasic for Windows was on December 17, 2000. It has been continually updated since. PureBasic has a \"lifetime license model\". As cited on the website, the very first PureBasic user (who registered in 1998) still has free access to new updates and this is not going to change.PureBasic compiles directly to x86, x86-64, PowerPC or 680x0 instruction sets, generating small standalone executables and DLLs which need no runtime libraries beyond the standard system libraries. Programs developed without using the platform-specific application programming interfaces (APIs) can be built easily from the same source file with little or no modification. PureBasic supports inline assembly, allowing the developer to include FASM assembler commands within PureBasic source code, while using the variables declared in PureBasic source code, enabling experienced programmers to improve the speed of speed-critical sections of code. PureBasic supports and has integrated the OGRE 3D Environment. Other 3D environments such as the Irrlicht Engine are unofficially supported.", "pageId": 60643, "created": 2002, "backlinksCount": 135, "revisionCount": 349, "dailyPageViews": 41, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/PureBasic" }, "githubLanguage": { "fileExtensions": [ "pb", "pbi" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nonnx onnx https://github.com/onnx.png https://github.com/onnx/onnx PureBasic #5a6986 6751 1080 196 \"Open Neural Network Exchange\"\nalibaba x-deeplearning https://github.com/alibaba.png https://github.com/alibaba/x-deeplearning PureBasic #5a6986 2862 709 123 \"An industrial deep learning framework for high-dimension sparse data\"", "trendingProjectsCount": 3, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 6366, "id": "PureBasic" }, "githubBigQuery": { "repos": 647, "users": 556, "id": "PureBasic" }, "linguistGrammarRepo": { "sampleCount": 2, "example": [ "EnableExplicit\n\n; ##################################################### Includes ####################################################\n\nXIncludeFile \"Includes/AudioOut.pbi\"\n\n; ##################################################### Prototypes ##################################################\n\n; ##################################################### Structures ##################################################\n\n; ##################################################### Constants ###################################################\n\n#Samplerate = 44100\n\n; ##################################################### Structures ##################################################\n\nStructure Main\n *AudioOut\n \n Quit.i\nEndStructure\nGlobal Main.Main\n\nStructure Main_Window\n ID.i\n \n TrackBar.i [10]\nEndStructure\nGlobal Main_Window.Main_Window\n\n; ##################################################### Variables ###################################################\n\nGlobal Frequency.d = 1000\nGlobal Amplitude.d = 0.25\n\n; ##################################################### Procedures ##################################################\n\nProcedure Main_Window_Open()\n Main_Window\\ID = OpenWindow(#PB_Any, 0, 0, 800, 100, \"AudioOut Example\", #PB_Window_SystemMenu | #PB_Window_MinimizeGadget | #PB_Window_ScreenCentered)\n \n If Main_Window\\ID\n \n Main_Window\\TrackBar[0] = TrackBarGadget(#PB_Any, 10, 10, 780, 30, 0, 20000)\n SetGadgetState(Main_Window\\TrackBar[0], Frequency)\n \n Main_Window\\TrackBar[1] = TrackBarGadget(#PB_Any, 10, 40, 780, 30, 0, 1000)\n SetGadgetState(Main_Window\\TrackBar[1], Amplitude*1000)\n \n EndIf\nEndProcedure\n\nProcedure Notifier_CallBack(*AudioOut)\n Protected *Temp, Temp_Size.i\n Static Rotation.d\n \n While AudioOut::GetQueuedBlocks(*AudioOut) <= 3\n \n Temp_Size = AudioOut::GetBufferBlocksize(*AudioOut)\n If Temp_Size > 0\n *Temp = AllocateMemory(Temp_Size)\n \n Define Left.d, Right.d, i\n For i = 0 To Temp_Size / 4 - 1\n Left = Sin(Rotation) * Amplitude\n Right = Sin(Rotation) * Amplitude\n \n PokeW(*Temp + i*4 , Left*32767)\n PokeW(*Temp + i*4 + 2, Right*32767)\n \n Rotation + 2.0*#PI / #Samplerate * Frequency\n Next\n \n AudioOut::Write_Data(Main\\AudioOut, *Temp, Temp_Size)\n \n FreeMemory(*Temp)\n EndIf\n \n Wend\nEndProcedure\n\n; ##################################################### Initialisation ##############################################\n\nMain_Window_Open()\n\nAudioOut::GetDevices()\n\nForEach AudioOut::Device()\n Debug PeekS(AudioOut::@Device()\\szPname)\nNext\n\nMain\\AudioOut = AudioOut::Initialize(#WAVE_MAPPER, #Samplerate, 2, 16, @Notifier_CallBack())\n\nIf Not Main\\AudioOut\n Debug AudioOut::GetError()\n End\nEndIf\n\nNotifier_CallBack(Main\\AudioOut)\n\n; ##################################################### Main ########################################################\n\nRepeat\n \n Repeat\n Select WaitWindowEvent(100)\n Case #PB_Event_Gadget\n Select EventGadget()\n Case Main_Window\\TrackBar[0]\n Frequency = GetGadgetState(Main_Window\\TrackBar[0])\n Debug Frequency\n \n Case Main_Window\\TrackBar[1]\n Amplitude = GetGadgetState(Main_Window\\TrackBar[1]) / 1000\n \n EndSelect\n \n Case #PB_Event_CloseWindow\n Main\\Quit = #True\n \n Case 0\n Break\n EndSelect\n ForEver\n \nUntil Main\\Quit\n\n; ##################################################### End #########################################################\n\nAudioOut::Deinitialize(Main\\AudioOut)\n\n; IDE Options = PureBasic 5.30 Beta 2 (Windows - x64)\n; CursorPosition = 109\n; FirstLine = 79\n; Folding = -\n; EnableUnicode\n; EnableThread\n; EnableXP\n" ], "url": "https://github.com/telnet23/language-basic" }, "leachim6": { "filepath": "p/PureBasic.pb", "fileExtensions": [ "pb" ], "example": [ "If OpenConsole()\n PrintN(\"Hello World\")\nEndIf\n" ], "id": "PureBasic" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:PureBasic", "indeedJobs": { "2022": 0, "query": "purebasic developer" }, "officialBlogUrl": [ "https://www.purebasic.fr/blog/" ], "faqPageUrl": [ "https://www.purebasic.com/faq.php" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|Bookbaby|Programming 2d Scrolling Games: For Purebasic Developers|John P. Logsdon and Derlidio Siqueira|9781624883415\n2010||Basic Programming Language Family: Basic, Quickbasic, Gw-basic, Ibm Basica, True Basic, Vbscript, Visual Basic For Applications, Purebasic|Books and LLC and Group|9781157362517", "semanticScholar": "" }, "puredata": { "title": "Pure Data", "appeared": 1996, "type": "pl", "website": "http://puredata.info/", "country": [ "United States" ], "originCommunity": [ "University of California, San Diego" ], "domainName": { "awisRank": { "2017": 292479, "2022": 567348 }, "name": "puredata.info" }, "wikipedia": { "related": [ "linux", "ios", "android", "freebsd", "max", "opengl", "c", "python", "scheme", "lua", "tcl" ], "summary": "Pure Data (Pd) is a visual programming language developed by Miller Puckette in the 1990s for creating interactive computer music and multimedia works. While Puckette is the main author of the program, Pd is an open source project with a large developer base working on new extensions. It is released under a license similar to the BSD license. It runs on GNU/Linux, Mac OS X, iOS, Android and Windows. Ports exist for FreeBSD and IRIX. Pd is very similar in scope and design to Puckette's original Max program, developed while he was at IRCAM, and is to some degree interoperable with Max/MSP, the commercial successor to the Max language. They may be collectively discussed as members of the Patcher family of languages. With the addition of the Graphics Environment for Multimedia (GEM) external, and externals designed to work with it (like Pure Data Packet / PiDiP for Linux, Mac OS X), framestein for Windows, GridFlow (as n-dimensional matrix processing, for Linux, Mac OS X, Windows), it is possible to create and manipulate video, OpenGL graphics, images, etc., in realtime with extensive possibilities for interactivity with audio, external sensors, etc. Pd is natively designed to enable live collaboration across networks or the Internet, allowing musicians connected via LAN or even in disparate parts of the globe to create music together in real time. Pd uses FUDI as a networking protocol.", "pageId": 480378, "dailyPageViews": 137, "created": 2004, "backlinksCount": 135, "revisionCount": 319, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Pure_Data" }, "githubLanguage": { "fileExtensions": [ "pd" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "none", "repos": 3084650, "id": "Pure Data" }, "githubBigQuery": { "repos": 914, "users": 696, "id": "Pure Data" }, "leachim6": { "filepath": "p/Pure Data.pd", "example": [ "#N canvas 1029 457 450 300 10;\n#X obj 127 132 print;\n#X msg 127 86 Hello World;\n#X connect 1 0 0 0;\n" ], "id": "Pure Data" }, "tiobe": { "id": "Pure Data" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6444", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "purescript": { "title": "PureScript", "appeared": 2013, "type": "pl", "creators": [ "Phil Freeman" ], "website": "http://functorial.com/purescript", "documentation": [ "https://github.com/purescript/documentation" ], "releaseNotesUrl": "https://github.com/purescript/purescript/releases", "compilesTo": [ "javascript" ], "hasComments": { "example": "", "value": true }, "hasDocComments": { "example": "-- https://github.com/purescript/documentation/blob/master/language/Syntax.md\n-- | `bool` performs case analysis for the `Boolean` data type, like an `if` statement.\nbool :: forall a. Boolean -> a -> a -> a\nbool true x _ = x\nbool false _ x = x", "value": true }, "hasSemanticIndentation": { "example": "-- https://github.com/purescript/documentation/blob/master/language/Syntax.md\n-- Syntax is whitespace sensitive. The general rule of thumb is that declarations which span multiple lines should be indented past the column on which they were first defined on their subsequent lines.\nfoo = bar +\n baz", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "{- A comment\n-}", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "{-", "-}" ] ], "stringToken": [ [ "\"" ] ], "example": [ "import Prelude\nimport Effect.Console (log)\n\ngreet :: String -> String\ngreet name = \"Hello, \" <> name <> \"!\"\n\nmain = log (greet \"World\")" ], "githubRepo": { "firstCommit": 2013, "stars": 7813, "forks": 557, "subscribers": 160, "created": 2013, "updated": 2022, "description": "A strongly-typed language that compiles to JavaScript", "issues": 277, "url": "https://github.com/purescript/purescript" }, "repoStats": { "firstCommit": 2013, "commits": 4544, "committers": 237, "files": 1844 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/PureScript" }, "githubLanguage": { "fileExtensions": [ "purs" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "haskell", "codemirrorMode": "haskell", "codemirrorMimeType": "text/x-haskell", "tmScope": "source.purescript", "repos": 5443, "id": "PureScript" }, "githubBigQuery": { "repos": 826, "users": 382, "id": "PureScript" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 9, "commitCount": 90, "sampleCount": 4, "example": [ "module Control.Arrow where\n\nimport Data.Tuple\n\nclass Arrow a where\n arr :: forall b c. (b -> c) -> a b c\n first :: forall b c d. a b c -> a (Tuple b d) (Tuple c d)\n\ninstance arrowFunction :: Arrow (->) where\n arr f = f\n first f (Tuple b d) = Tuple (f b) d\n\nsecond :: forall a b c d. (Category a, Arrow a) => a b c -> a (Tuple d b) (Tuple d c)\nsecond f = arr swap >>> first f >>> arr swap\n\nswap :: forall a b. Tuple a b -> Tuple b a\nswap (Tuple x y) = Tuple y x\n\ninfixr 3 ***\ninfixr 3 &&&\n\n(***) :: forall a b b' c c'. (Category a, Arrow a) => a b c -> a b' c' -> a (Tuple b b') (Tuple c c')\n(***) f g = first f >>> second g\n\n(&&&) :: forall a b b' c c'. (Category a, Arrow a) => a b c -> a b c' -> a b (Tuple c c')\n(&&&) f g = arr (\\b -> Tuple b b) >>> (f *** g)\n\nclass ArrowZero a where\n zeroArrow :: forall b c. a b c\n\ninfixr 5 <+>\n\nclass ArrowPlus a where\n (<+>) :: forall b c. a b c -> a b c -> a b c" ], "url": "https://github.com/purescript-contrib/atom-language-purescript" }, "languageServerProtocolProject": [ "https://github.com/nwolverson/purescript-language-server\nwrittenIn purescript" ], "projectEuler": { "memberCount": { "2022": 4 }, "id": "PureScript" }, "leachim6": { "filepath": "p/PureScript.purs", "fileExtensions": [ "purs" ], "example": [ "module Main where\n\nimport Debug.Trace\n\nmain = trace \"Hello World\"\n" ], "id": "PureScript" }, "tryItOnline": "purescript", "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n6644685|Show HN: PureScript - a functional language which compiles to Javascript|2013-10-31 01:19:21 UTC|1383182361|paf31|0|2", "packageRepository": [ "https://pursuit.purescript.org/" ], "twitter": "https://twitter.com/purescript", "jupyterKernel": [ "https://github.com/Eoksni/ipurescript" ], "fileType": "text", "isOpenSource": true, "semanticScholar": "" }, "pursuit-pm": { "title": "Pursuit PureScript Package Repository", "appeared": 2014, "type": "packageManager", "description": "Pursuit hosts API documentation for PureScript packages.", "website": "https://pursuit.purescript.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/purescript" ], "domainName": { "name": "pursuit.purescript.org" }, "packageCount": 800 }, "push": { "title": "Push", "appeared": 2001, "type": "pl", "creators": [ "Lee Spector", "Alan Robinson" ], "reference": [ "http://faculty.hampshire.edu/lspector/push3-description.html", "https://faculty.hampshire.edu/lspector/pubs/push-gpem-final.pdf" ], "originCommunity": [ "Hampshire College" ], "announcementMethod": "paper", "versions": { "2001": [ "1.0" ], "2003": [ "2.0" ], "2004": [ "3.0" ] }, "example": [ "TIMES2\nCODE.QUOTE ( 2 INTEGER.* )\nCODE.DEFINE" ] }, "pv-wave": { "title": "PV-Wave", "appeared": 1988, "type": "pl", "originCommunity": [ "Precision Visuals" ], "wikipedia": { "related": [ "idl" ], "summary": "PV-WAVE (Precision Visuals - Workstation Analysis and Visualization Environment) is an array oriented fourth-generation programming language used by engineers, scientists, researchers, business analysts and software developers to build and deploy visual data analysis applications.. PV-WAVE was originally developed by a company called Precision Visuals, based in Boulder, CO. In 1992, the IMSL Numerical Libraries and Precision Visuals merged and the new company was renamed Visual Numerics. In 2009, Visual Numerics was acquired by Rogue Wave Software. PV-WAVE is closely related to the IDL (programming language), from whose code-base PV-WAVE originated. The shared history of PV-WAVE and IDL began in 1988, when Precision Visuals entered into an agreement with Research Systems, Incorporated (RSI, the original developer of IDL) under which Precision Visuals resold IDL under the name PV-WAVE. In September 1990, Precision Visuals exercised an option in its agreement with RSI to purchase a copy of the IDL source code. Since that time, IDL and PV-WAVE have been on separate development tracks: each product has been enhanced, supported, and maintained separately by its respective company.. Due to their common history, PV-WAVE and IDL share a similar FORTRAN-like syntax, as well as many common commands, functions, and subroutines.", "created": 2008, "backlinksCount": 6, "pageId": 17742923, "revisionCount": 29, "dailyPageViews": 8, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/PV-Wave" }, "centralPackageRepositoryCount": 0 }, "pvs": { "title": "PVS", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/50597508a9e76ed5cef6515b6bb107c8988c1e67" ], "standsFor": "Prototype Verification System", "country": [ "United States" ], "originCommunity": [ "SRI International" ], "wikipedia": { "summary": "The Prototype Verification System (PVS) is a specification language integrated with support tools and an automated theorem prover, developed at the Computer Science Laboratory of SRI International in Menlo Park, California. PVS is based on a kernel consisting of an extension of Church's theory of types with dependent types, and is fundamentally a classical typed higher-order logic. The base types include uninterpreted types that may be introduced by the user, and built-in types such as the booleans, integers, reals, and the ordinals. Type-constructors include functions, sets, tuples, records, enumerations, and abstract data types. Predicate subtypes and dependent types can be used to introduce constraints; these constrained types may incur proof obligations (called type-correctness conditions or TCCs) during typechecking. PVS specifications are organized into parameterized theories. The system is implemented in Common Lisp, and is released under the GNU General Public License (GPL).", "backlinksCount": 24, "pageId": 1848947, "dailyPageViews": 9, "appeared": 1992, "url": "https://en.wikipedia.org/wiki/Prototype_Verification_System" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2724", "centralPackageRepositoryCount": 0 }, "py": { "title": "Py", "appeared": 1991, "type": "pl", "creators": [ "David Cuny" ], "reference": [ "http://webs.lanset.com/dcuny/py.htm" ], "country": [ "United States" ], "originCommunity": [ "https://webs.lanset.com/dcuny/euphoria.htm" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2417", "centralPackageRepositoryCount": 0 }, "pycharm-editor": { "title": "pycharm-editor", "appeared": 2016, "type": "editor", "country": [ "Czechia" ], "originCommunity": [ "JetBrains s.r.o" ] }, "pycket": { "title": "Pycket", "appeared": 2022, "type": "pl", "creators": [ "Sam Tobin-Hochstadt" ], "description": "Pycket: a Racket/Scheme implementation that is generated using the RPython framework", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/upizne/pycket_a_racketscheme_implementation_that_is/", "https://reddit.com/r/Racket/comments/upim61/pycket_a_racketscheme_implementation_that_is/" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/pycket" ], "githubRepo": { "firstCommit": 2013, "stars": 244, "forks": 24, "subscribers": 16, "created": 2013, "updated": 2022, "description": "A rudimentary Racket implementation using RPython", "issues": 53, "url": "https://github.com/pycket/pycket" }, "repoStats": { "firstCommit": 2013, "commits": 4986, "committers": 21, "files": 248 } }, "pygmalion": { "title": "Pygmalion", "appeared": 1974, "type": "visual", "reference": [ "http://worrydream.com/refs/Smith%20-%20Pygmalion.pdf" ], "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3889" }, "pygments": { "title": "Pygments", "appeared": 2006, "type": "library", "creators": [ "Georg Brandl" ], "description": "Pygments is a generic syntax highlighter suitable for use in code hosting, forums, wikis or other applications that need to prettify source code.", "website": "https://pygments.org/", "webRepl": [ "https://pygments.org/demo/" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/pygments" ], "domainName": { "registered": 2007, "awisRank": { "2022": 824052 }, "name": "pygments.org" }, "writtenIn": [ "python" ], "related": [ "codemirror", "monaco", "highlightjs", "ace", "sublime-syntax", "tmlanguage" ], "githubRepo": { "firstCommit": 2006, "stars": 990, "forks": 432, "subscribers": 24, "created": 2019, "updated": 2022, "description": "Pygments is a generic syntax highlighter written in Python", "issues": 385, "url": "https://github.com/pygments/pygments" } }, "pyke": { "title": "pyke", "appeared": 2008, "type": "knowledgeBase", "creators": [ "Paul Haesler", "Bruce Frederiksen" ], "website": "http://pyke.sourceforge.net/index.html", "reference": [ "http://pyke.sourceforge.net/PyCon2008-paper.html" ], "fileExtensions": [ "fb", "krb", "kqb" ], "country": [ "Australia and United States" ], "originCommunity": [ "https://sourceforge.net/p/pyke/_list/tickets" ] }, "pypi-pm": { "title": "PyPI", "appeared": 2015, "type": "packageManager", "website": "https://pypi.org/", "standsFor": "Python Package Index", "country": [ "Various" ], "originCommunity": [ "https://github.com/pypi" ], "packageCount": 167097, "forLanguages": [ "python" ], "twitter": "https://twitter.com/pypi" }, "pyret-lang": { "title": "Pyret", "appeared": 2012, "type": "pl", "creators": [ "Ben Lerner", "Joe Gibbs Politz" ], "website": "https://www.pyret.org/", "country": [ "United States" ], "originCommunity": [ "Brown University" ], "githubRepo": { "firstCommit": 2012, "stars": 924, "forks": 105, "subscribers": 42, "created": 2012, "updated": 2022, "description": "The Pyret language.", "issues": 439, "url": "https://github.com/brownplt/pyret-lang" }, "repoStats": { "firstCommit": 2012, "commits": 10731, "committers": 85, "files": 631 } }, "pyret": { "title": "pyret", "appeared": 2011, "type": "pl", "creators": [ "Joe Gibbs Politz" ], "description": "Pyret is a programming language designed to serve as an outstanding choice for programming education while exploring the confluence of scripting and functional programming. It's under active design and development, and free to use or modify.", "website": "https://www.pyret.org/", "country": [ "United States" ], "originCommunity": [ "Brown University" ], "domainName": { "registered": 2011, "awisRank": { "2022": 1111494 }, "name": "pyret.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "'" ] ], "example": [ "data BinTree:\n | leaf\n | node(value, left, right)\nend\nfun tree-sum(t):\n doc: \"Calculate the sum of node values\"\n cases (BinTree) t:\n | leaf => 0\n | node(v, l, r) =>\n v + tree-sum(l) + tree-sum(r)\n end\nwhere:\n tree-sum(leaf) is 0\n node4 = node(4, leaf, leaf)\n tree-sum(node(5, node4, leaf)) is 9\nend" ], "githubRepo": { "firstCommit": 2012, "stars": 924, "forks": 105, "subscribers": 42, "created": 2012, "updated": 2022, "description": "The Pyret language.", "issues": 439, "url": "https://github.com/brownplt/pyret-lang" }, "repoStats": { "firstCommit": 2012, "commits": 10731, "committers": 85, "files": 631 }, "leachim6": { "filepath": "p/Pyret.arr", "fileExtensions": [ "arr" ], "example": [ "print('Hello World')\n" ], "id": "Pyret" }, "isbndb": "" }, "pyrex": { "title": "Pyrex", "appeared": 2002, "type": "pl", "website": "http://www.cosc.canterbury.ac.nz/greg.ewing/python/Pyrex/", "country": [ "New Zealand" ], "originCommunity": [ "University of Canterbury" ], "sourcehutRepo": "https://www.csse.canterbury.ac.nz/greg.ewing/python/Pyrex/hg/", "wikipedia": { "related": [ "python", "c", "cython" ], "summary": "Pyrex is a programming language developed to aid in creating Python modules. Its syntax is very close to Python. The goal is to make it easy for Python programmers to write the non-Python supporting code usually required for interfacing modules in a language which is as close to Python as possible.", "pageId": 3274540, "dailyPageViews": 24, "created": 2005, "backlinksCount": 18, "revisionCount": 64, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Pyrex_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4938", "fileType": "text", "centralPackageRepositoryCount": 0 }, "pyth": { "title": "Pyth", "appeared": 2014, "type": "esolang", "creators": [ "Isaac Grosof" ], "documentation": [ "https://pyth.readthedocs.io/en/latest" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/isaacg1/pyth/issues" ], "githubRepo": { "description": "Pyth, an extremely concise language.", "stars": 250, "url": "https://github.com/isaacg1/pyth" }, "repoStats": { "firstCommit": 2014, "commits": 766, "committers": 31, "files": 119 }, "esolang": "https://esolangs.org/wiki/Pyth" }, "pythagorean-equation": { "title": "Pythagorean Equation", "appeared": -570, "type": "equation", "equation": "a^2 + b^2 = c^2", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Pythagorean_theorem" } }, "python-cl-compiler": { "title": "python-cl-compiler", "appeared": 1991, "type": "compiler", "description": "The Python compiler for CMU Common Lisp has been under development for over five years, and now forms the core of a production quality public domain Lisp implementation. Python synthesizes the good ideas from Lisp compilers and source transformation systems with mainstream optimization and retargetability techniques. Novel features include strict type checking and source-level debugging of compiled code. Unusual attention has been paid to the compiler's user interface.", "reference": [ "https://www.researchgate.net/publication/221252239_Python_compiler_for_CMU_common_Lisp" ], "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "fileType": "na", "centralPackageRepositoryCount": 0 }, "python-for-s60": { "title": "Python for S60", "appeared": 2006, "type": "pl", "creators": [ "Guido van Rossum" ], "country": [ "United States" ], "originCommunity": [ "Python Software Foundation" ], "wikipedia": { "related": [ "python", "unix", "opl" ], "summary": "The Python for S60 also called PyS60 (Unix name), was Nokia’s port of the general Python programming language to its S60 software platform, originally based on Python 2.2.2 from 2002. The latest final version, PyS60-2.0.0, released on 11 February 2010 updated the python core to version 2.5.4.", "created": 2008, "backlinksCount": 82, "pageId": 18805500, "revisionCount": 77, "dailyPageViews": 17, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Python_for_S60" }, "centralPackageRepositoryCount": 0 }, "python-format-spec": { "title": "Python Format Specification", "appeared": 2008, "type": "template", "description": "Python minilang introduced in Python 2.6 in 2008.", "website": "https://docs.python.org/3/library/string.html#format-specification-mini-language", "country": [ "United States" ], "originCommunity": [ "Python Software Foundation" ], "example": [ "'{0}, {1}, {2}'.format('a', 'b', 'c')" ] }, "python": { "title": "Python", "appeared": 1991, "type": "pl", "creators": [ "Guido van Rossum" ], "website": "https://www.python.org/", "documentation": [ "https://docs.python.org/3/" ], "emailList": [ "https://mail.python.org/mailman/listinfo" ], "spec": "https://docs.python.org/3/reference/", "reference": [ "https://www.programiz.com/python-programming/keyword-list" ], "fileExtensions": [ "py", "pyc", "pyd", "pyo" ], "country": [ "Netherlands" ], "originCommunity": [ "Centrum Wiskunde & Informatica" ], "domainName": { "registered": 1995, "awisRank": { "2017": 875, "2022": 728 }, "name": "python.org" }, "releaseNotesUrl": "https://docs.python.org/3/whatsnew/", "proposals": "https://peps.python.org/", "visualParadigm": false, "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasMacros": { "example": "", "value": false }, "hasEnums": { "example": "# Though there is an Enum class in stdlib https://peps.python.org/pep-0435/", "value": false }, "canWriteToDisk": { "example": "with open('helloworld.txt', 'w') as filehandle:\n filehandle.write('Hello, world!\\n')", "value": true }, "hasDuckTyping": { "example": "", "value": true }, "hasSingleDispatch": { "example": "", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasTernaryOperators": { "example": "print(1 if 1 else 0)", "value": true }, "hasBitWiseOperators": { "example": "x << y", "value": true }, "canDoShebang": { "example": "#!/usr/bin/env python", "value": true }, "hasSymbolTables": { "example": "# https://eli.thegreenplace.net/2010/09/18/python-internals-symbol-tables-part-1", "value": true }, "hasDynamicProperties": { "example": "class Person (object):\n def __init__(self, name):\n self.name = name\n\nperson = Person(\"John\")\nperson.age = 50", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasClasses": { "example": "class Person (object):\n def __init__(self, name):\n self.name = name", "value": true }, "hasConditionals": { "example": "if True:\n print(\"Hello world\")", "value": true }, "hasComments": { "example": "# This is a comment", "value": true }, "hasMultiLineComments": { "example": "''' A comment.\n'''", "value": true }, "hasConstructors": { "example": "", "value": true }, "hasGenerators": { "example": "https://wiki.python.org/moin/Generators", "value": true }, "hasDirectives": { "example": "from __future__ import feature\n# coding=", "value": true }, "hasAssignment": { "example": "name = \"John\"", "value": true }, "hasImports": { "example": "import datetime\noTime = datetime.datetime.now()\nfrom my_pkg import my_funcs", "value": true }, "hasInfixNotation": { "example": "seven = 3 + 4", "value": true }, "hasIterators": { "example": "https://www.w3schools.com/python/python_iterators.asp", "value": true }, "hasMixins": { "example": "# https://easyaspython.com/mixins-for-fun-and-profit-cb9962760556\nclass EssentialFunctioner(LoggerMixin, object):", "value": true }, "hasMultilineStrings": { "example": "template = \"\"\"This is the first line.\nThis is the second line.\nThis is the third line.\"\"\"", "value": true }, "hasPointers": { "example": "", "value": false }, "hasIntegers": { "example": "pldb = 80766866", "value": true }, "hasUnitsOfMeasure": { "example": "", "value": false }, "hasLists": { "example": "myList = [1, 2, 3, 4, 5]", "value": true }, "hasMultipleInheritance": { "example": "class Base1:\n pass\nclass Base2:\n pass\nclass MultiDerived(Base1, Base2):\n pass\n# Or multilevel inheritance:\nclass Base:\n pass\nclass Derived1(Base):\n pass\nclass Derived2(Derived1):\n pass", "value": true }, "hasOperatorOverloading": { "example": "# Python Program illustrate how \n# to overload an binary + operator \n \nclass A: \n def __init__(self, a): \n self.a = a \n \n # adding two objects \n def __add__(self, o): \n return self.a + o.a \nob1 = A(1) \nob2 = A(2) \nob3 = A(\"Geeks\") \nob4 = A(\"For\") \n \nprint(ob1 + ob2) \nprint(ob3 + ob4)", "value": true }, "hasSemanticIndentation": { "example": "class Person (object):\n def __init__(self, name):\n self.name = name", "value": true }, "hasInheritance": { "example": "class SumComputer(object):\n def __init__(self, a, b):\n self.a = a\n self.b = b\n def transform(self, x):\n raise NotImplementedError\n def inputs(self):\n return range(self.a, self.b)\n def compute(self):\n return sum(self.transform(value) for value in self.inputs())\n class SquareSumComputer(SumComputer):\n def transform(self, x):\n return x * x\n class CubeSumComputer(SumComputer):\n def transform(self, x):\n return x * x * x", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": true }, "hasDisposeBlocks": { "example": "with resource_context_manager() as resource:\n # Perform actions with the resource.\n# Perform other actions where the resource is guaranteed to be deallocated.", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasThreads": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasOctals": { "example": "# 0[oO](?:_?[0-7])+", "value": true }, "hasHexadecimals": { "example": "# 0[xX](?:_?[a-fA-F0-9])+", "value": true }, "hasFloats": { "example": "# (\\d(?:_?\\d)*\\.(?:\\d(?:_?\\d)*)?|(?:\\d(?:_?\\d)*)?\\.\\d(?:_?\\d)*)([eE][+-]?\\d(?:_?\\d)*)?", "value": true }, "hasBinaryNumbers": { "example": "# 0[bB](?:_?[01])+", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "'''" ] ], "printToken": [ [ "print" ] ], "assignmentToken": [ [ "=" ] ], "booleanTokens": [ [ "True", "False" ] ], "keywords": [ "and", "as", "assert", "break", "class", "continue", "def", "del", "elif", "else", "except", "False", "finally", "for", "from", "global", "if", "import", "in", "is", "lambda", "None", "nonlocal", "not", "or", "pass", "raise", "return", "True", "try", "while", "with", "yield" ], "gource": "https://www.youtube.com/watch?v=9mput42uZsQ", "githubRepo": { "stars": 51959, "forks": 26518, "subscribers": 1480, "created": 2017, "updated": 2023, "description": "The Python programming language", "issues": 8360, "url": "https://github.com/python/cpython" }, "repoStats": { "firstCommit": 1990, "commits": 140461, "committers": 2601, "files": 4656 }, "wikipedia": { "related": [ "jython", "micropython", "stackless-python", "cython", "abc", "algol-68", "c", "dylan", "haskell", "icon", "java", "lisp", "modula-3", "perl", "boo", "cobra", "coffeescript", "d", "f-sharp", "falcon", "genie", "go", "groovy", "javascript", "julia", "nim", "ruby", "swift", "setl", "unix", "unicode", "standard-ml", "pascal", "regex", "csharp", "common-lisp", "scheme", "objective-c", "numpy", "mime", "http", "sagemath", "llvmir", "jvm", "java-bytecode", "cil", "pyrex", "mercurial", "python-for-s60", "qt", "django", "scipy", "matplotlib", "gdb", "freebsd", "ecmascript", "ocaml", "tcl", "erlang", "pandas" ], "summary": "Python is a widely used high-level programming language for general-purpose programming, created by Guido van Rossum and first released in 1991. An interpreted language, Python has a design philosophy that emphasizes code readability (notably using whitespace indentation to delimit code blocks rather than curly brackets or keywords), and a syntax that allows programmers to express concepts in fewer lines of code than might be used in languages such as C++ or Java. It provides constructs that enable clear programming on both small and large scales. Python features a dynamic type system and automatic memory management. It supports multiple programming paradigms, including object-oriented, imperative, functional and procedural, and has a large and comprehensive standard library. Python interpreters are available for many operating systems. CPython, the reference implementation of Python, is open source software and has a community-based development model, as do nearly all of its variant implementations. CPython is managed by the non-profit Python Software Foundation.", "pageId": 23862, "dailyPageViews": 7204, "created": 2001, "backlinksCount": 6849, "revisionCount": 6342, "appeared": 1991, "fileExtensions": [ "py", "pyc", "pyd", "pyo" ], "url": "https://en.wikipedia.org/wiki/Python_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "py", "cgi", "fcgi", "gyp", "gypi", "lmi", "py3", "pyde", "pyi", "pyp", "pyt", "pyw", "rpy", "smk", "spec", "tac", "wsgi", "xpy" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nCorentinJ Real-Time-Voice-Cloning https://github.com/CorentinJ.png https://github.com/CorentinJ/Real-Time-Voice-Cloning Python #3572A5 7049 955 4051 \"Clone a voice in 5 seconds to generate arbitrary speech in real-time\"\nYorko mlcourse.ai https://github.com/Yorko.png https://github.com/Yorko/mlcourse.ai Python #3572A5 5417 3816 871 \"Open Machine Learning Course\"\niperov DeepFaceLab https://github.com/iperov.png https://github.com/iperov/DeepFaceLab Python #3572A5 8645 2006 3166 \"DeepFaceLab is a tool that utilizes machine learning to replace faces in videos. Includes prebuilt ready to work standalone Windows 7,8,10 binary (look readme.md).\"\ntaki0112 UGATIT https://github.com/taki0112.png https://github.com/taki0112/UGATIT Python #3572A5 3646 593 2798 \"Official Tensorflow implementation of U-GAT-IT: Unsupervised Generative Attentional Networks with Adaptive Layer-Instance Normalization for Image-to-Image Translation\"\nshengqiangzhang examples-of-web-crawlers https://github.com/shengqiangzhang.png https://github.com/shengqiangzhang/examples-of-web-crawlers Python #3572A5 4155 1295 1321 \"一些非常有趣的python爬虫例子,对新手比较友好,主要爬取淘宝、天猫、微信、豆瓣、QQ等网站。(Some interesting examples of python crawlers that are friendly to beginners. )\"\ngoogle-research google-research https://github.com/google-research.png https://github.com/google-research/google-research Python #3572A5 3329 488 724 \"Google AI Research\"\ndeepfakes faceswap https://github.com/deepfakes.png https://github.com/deepfakes/faceswap Python #3572A5 24602 8021 3172 \"Deepfakes Software For All\"\nznxlwm UGATIT-pytorch https://github.com/znxlwm.png https://github.com/znxlwm/UGATIT-pytorch Python #3572A5 1150 199 933 \"Official PyTorch implementation of U-GAT-IT: Unsupervised Generative Attentional Networks with Adaptive Layer-Instance Normalization for Image-to-Image Translation\"\npwxcoo chinese-xinhua https://github.com/pwxcoo.png https://github.com/pwxcoo/chinese-xinhua Python #3572A5 6111 1309 535 \"📙 中华新华字典数据库。包括歇后语，成语，词语，汉字。\"\ntlbootcamp tlroadmap https://github.com/tlbootcamp.png https://github.com/tlbootcamp/tlroadmap Python #3572A5 1965 184 806 \"👩🏼‍💻👨🏻‍💻Карта навыков и модель развития тимлидов\"\npytorch fairseq https://github.com/pytorch.png https://github.com/pytorch/fairseq Python #3572A5 5336 1168 536 \"Facebook AI Research Sequence-to-Sequence Toolkit written in Python.\"\nvinta awesome-python https://github.com/vinta.png https://github.com/vinta/awesome-python Python #3572A5 72704 14251 2125 \"A curated list of awesome Python frameworks, libraries, software and resources\"\nAvik-Jain 100-Days-Of-ML-Code https://github.com/Avik-Jain.png https://github.com/Avik-Jain/100-Days-Of-ML-Code Python #3572A5 25578 6210 861 \"100 Days of ML Coding\"\npandas-dev pandas https://github.com/pandas-dev.png https://github.com/pandas-dev/pandas Python #3572A5 21188 8366 561 \"Flexible and powerful data analysis / manipulation library for Python, providing labeled data structures similar to R data.frame objects, statistical functions, and much more\"\ntimgrossmann InstaPy https://github.com/timgrossmann.png https://github.com/timgrossmann/InstaPy Python #3572A5 8694 2384 280 \"📷 Instagram Bot - Tool for automated Instagram interactions\"\nrobotframework robotframework https://github.com/robotframework.png https://github.com/robotframework/robotframework Python #3572A5 3746 1186 153 \"Generic automation framework for acceptance testing and RPA\"\ngoogle python-fire https://github.com/google.png https://github.com/google/python-fire Python #3572A5 15088 900 469 \"Python Fire is a library for automatically generating command line interfaces (CLIs) from absolutely any Python object.\"\neriklindernoren ML-From-Scratch https://github.com/eriklindernoren.png https://github.com/eriklindernoren/ML-From-Scratch Python #3572A5 13039 2386 1269 \"Machine Learning From Scratch. Bare bones NumPy implementations of machine learning models and algorithms with a focus on accessibility. Aims to cover everything from linear regression to deep learning.\"\nnvbn thefuck https://github.com/nvbn.png https://github.com/nvbn/thefuck Python #3572A5 46597 2305 1380 \"Magnificent app which corrects your previous console command.\"\ninstagrambot instabot https://github.com/instagrambot.png https://github.com/instagrambot/instabot Python #3572A5 1902 648 151 \"🐙 Free Instagram scripts, bots and Python API wrapper. Get free instagram followers with our auto like, auto follow and other scripts!\"\npublic-apis public-apis https://github.com/public-apis.png https://github.com/public-apis/public-apis Python #3572A5 61065 6583 1402 \"A collective list of free APIs for use in software and web development.\"\ntiangolo fastapi https://github.com/tiangolo.png https://github.com/tiangolo/fastapi Python #3572A5 4182 224 516 \"FastAPI framework, high performance, easy to learn, fast to code, ready for production\"\n521xueweihan HelloGitHub https://github.com/521xueweihan.png https://github.com/521xueweihan/HelloGitHub Python #3572A5 15415 1708 1008 \"Find pearls on open-source seashore 分享 GitHub 上有趣、入门级的开源项目\"\n3b1b manim https://github.com/3b1b.png https://github.com/3b1b/manim Python #3572A5 13205 1540 1041 \"Animation engine for explanatory math videos\"\nxingyizhou CenterNet https://github.com/xingyizhou.png https://github.com/xingyizhou/CenterNet Python #3572A5 2194 503 289 \"Object detection, 3D detection, and pose estimation using center point detection:\"", "trendingProjectsCount": 26, "type": "programming", "filenames": [ ".gclient", "DEPS", "SConscript", "SConstruct", "Snakefile", "wscript" ], "interpreters": [ "python", "python2", "python3" ], "aceMode": "python", "codemirrorMode": "python", "codemirrorMimeType": "text/x-python", "tmScope": "source.python", "aliases": [ "python3", "rusthon" ], "repos": 9300725, "id": "Python" }, "githubBigQuery": { "repos": 550171, "users": 297138, "id": "Python" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/python", "monaco": "python", "codeMirror": "python", "pygmentsHighlighter": { "filename": "python.py", "fileExtensions": [ "py", "pyw", "jy", "sage", "sc", "SConstruct", "SConscript", "bzl", "BUCK", "BUILD", "BUILD.bazel", "WORKSPACE", "tac" ], "id": "Python" }, "linguistGrammarRepo": { "sampleCount": 20, "example": [ "#!/usr/bin/env python2.4\nprint \"Python\"\n" ], "url": "https://github.com/tree-sitter/tree-sitter-python" }, "languageServerProtocolProject": [ "http://www.pydev.org/vscode/index.html\nwrittenIn python", "https://github.com/palantir/python-language-server\nwrittenIn python", "https://github.com/Microsoft/python-language-server\nwrittenIn csharp" ], "projectEuler": { "memberCount": { "2019": 46780, "2022": 60791 }, "id": "Python" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Python", "quineRelay": "Python", "compilerExplorer": { "example": [ "def square(num):\n return num * num\n" ], "id": "Python" }, "rijuRepl": { "example": [ "print(\"Hello, world!\")\n" ], "description": "Interpreted, high-level, general-purpose programming language", "fileExtensions": [ "py", "pyi", "pyc", "pyd", "pyo", "pyw", "pyz" ], "website": "https://www.python.org/", "gitRepo": "https://github.com/python/cpython", "id": "https://riju.codes/python" }, "replit": "https://repl.it/languages/python", "indeedJobs": { "2017": 28965, "query": "python engineer" }, "linkedInSkill": { "2018": 1801117, "id": "python" }, "stackOverflowSurvey": { "2021": { "users": 39792, "medianSalary": 59454, "fans": 34929, "percentageUsing": 0.48 } }, "annualReportsUrl": [ "https://www.python.org/psf-landing/" ], "eventsPageUrl": [ "https://www.python.org/events/" ], "faqPageUrl": [ "https://docs.python.org/3/faq/" ], "downloadPageUrl": [ "https://www.python.org/downloads/" ], "discord": "https://www.pythondiscord.com/", "subreddit": [ { "memberCount": { "2017": 197722, "2022": 979629 }, "url": "https://reddit.com/r/Python" } ], "meetup": { "memberCount": 1424303, "groupCount": 1964, "url": "https://www.meetup.com/topics/python" }, "tiobe": { "currentRank": 1, "id": "Python" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1658", "pypl": "Python", "packageRepository": [ "https://pypi.python.org/pypi" ], "ubuntuPackage": "python", "fileType": "text", "wordRank": 4048, "isOpenSource": true, "githubCopilotOptimized": true, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPython: Programming: Your Step By Step Guide To Easily Learn Python in 7 Days (Python for Beginners, Python Programming for Beginners, Learn Python, Python Language)||iCode Academy|54724997|3.76|126|6\nProgramming Python|1996|Mark Lutz|77671|3.96|898|23\nNatural Language Processing with Python|2009|Steven Bird|6581044|4.14|389|34", "isbndb": "year|publisher|title|authors|isbn13\n2014|No Starch Press|Black Hat Python: Python Programming for Hackers and Pentesters|Seitz, Justin|9781593275907\n2010|Franklin, Beedle & Associates|Python Programming: An Introduction to Computer Science|Zelle, John|9781590282410\n2015|McGraw-Hill Education TAB|Programming the Raspberry Pi, Second Edition: Getting Started with Python|Monk, Simon|9781259587405\n2011|CRC Press|Maya Python for Games and Film: A Complete Reference for Maya Python and the Maya Python API|Mechtley, Adam and Trowbridge, Ryan|9780123785787\n2013|The MIT Press|Introduction to Computation and Programming Using Python (MIT Press)|Guttag, John V.|9780262525008\n2010|Course Technology|Python Programming for the Absolute Beginner, 3rd Edition|Dawson, Michael|9781435455009\n2012|O'Reilly Media|Think Python|Allen B. Downey|9781449330729\n2009|No Starch Press|Gray Hat Python: Python Programming for Hackers and Reverse Engineers|Seitz, Justin|9781593271923\n2013|Jones & Bartlett Learning|Python Programming in Context|Miller, Bradley N. and Ranum, David L.|9781449699390\n2019|No Starch Press|Python Crash Course, 2nd Edition: A Hands-On, Project-Based Introduction to Programming|Matthes, Eric|9781593279288\n2009|Addison-Wesley Professional|Python Essential Reference|Beazley, David|9780672329784\n2013|Addison-Wesley Professional|Learn Python the Hard Way: A Very Simple Introduction to the Terrifyingly Beautiful World of Computers and Code (Zed Shaw's Hard Way Series)|Shaw, Zed|9780321884916\n2012|Pearson|The Practice of Computing Using Python (2nd Edition)|Punch, William F. and Enbody, Richard|9780132805575\n2014|lulu.com|Mathematics and Python Programming|Bautista, J.C.|9781326017965\n2009|O'Reilly Media|Head First Programming: A learner's guide to programming using the Python language|Griffiths, David and Barry, Paul|9780596802370\n2017|Pearson|Starting Out with Python Plus MyLab Programming with Pearson eText -- Access Card Package|Gaddis, Tony|9780134543666\n2014|CreateSpace Independent Publishing Platform|Python Programming for Beginners: An Introduction to the Python Computer Language and Computer Programming|Cannon, Jason|9781501000867\n2016|Springer|A Primer on Scientific Programming with Python (Texts in Computational Science and Engineering, 6)|Langtangen, Hans Petter|9783662498866\n2015|No Starch Press|Teach Your Kids to Code: A Parent-Friendly Guide to Python Programming|Payne, Bryson|9781593276140\n2011|Pearson|Starting Out with Python (2nd Edition) (Gaddis Series)|Gaddis, Tony|9780132576376\n2007|Prentice Hall|Rapid GUI Programming with Python and Qt (Prentice Hall Open Source Software Development)|Summerfield, Mark|9780132354189\n2014|Chapman and Hall/CRC|Explorations in Computing: An Introduction to Computer Science and Python Programming (Chapman & Hall/CRC Textbooks in Computing)|Conery, John S.|9781466572447\n2020|Esri Press|Python Scripting for ArcGIS Pro|Zandbergen, Paul A.|9781589484993\n2009|Pearson|Introduction To Computing And Programming In Python|Guzdial, Mark J. and Ericson, Barbara|9780136060239\n2006|Pearson P T R|Core Python Programming|Chun, Wesley J.|9780132269933\n2003|Addison-Wesley Professional|Text Processing in Python|Mertz, David and Mike Hendrickson|9780321112545\n2015|Packt Publishing|Python GUI Programming Cookbook|Meier, Burkhard A.|9781785283758\n2020|SAGE Publications, Inc|Introduction to Python Programming for Business and Social Science Applications|Kaefer, Frederick and Kaefer, Paul|9781544377445\n2014|Packt Publishing|Python Network Programming Cookbook|Sarker, Dr. M. O. Faruque|9781849513463\n2015|Springer|Python Programming Fundamentals (Undergraduate Topics in Computer Science)|Lee, Kent D.|9781447166412\n2020|Pearson|Starting Out with Python [RENTAL EDITION]||9780135929032\n2020|O'Reilly Media|Practical Statistics for Data Scientists: 50+ Essential Concepts Using R and Python|Bruce, Peter and Bruce, Andrew and Gedeck, Peter|9781492072942\n2015|Packt Publishing|Python Parallel Programming Cookbook|Zaccone, Giancarlo|9781785289583\n2017|Addison-Wesley Professional|Learn More Python 3 the Hard Way: The Next Step for New Python Programmers (Zed Shaw's Hard Way Series)|Shaw, Zed|9780134123486\n2006|O'Reilly Media|Python in a Nutshell, Second Edition (In a Nutshell)|Martelli, Alex|9780596100469\n2018|Manning Publications|The Quick Python Book|Ceder, Naomi|9781617294037\n2009||Python For Software Design||9780511507311\n2016|Packt Publishing|Mastering Python: Master the art of writing beautiful and powerful Python by using all of the features that Python 3.5 offers|Hattem, Rick van|9781785289729\n2010|Wrox|Beginning Python: Using Python 2.6 and Python 3.1|Payne|9780470414637\n2012|Pearson|The Practice of Computing Using Python plus MyProgrammingLab with Pearson eText -- Access Card Package (2nd Edition)|Punch, William F. and Enbody, Richard|9780132992831\n2013|Packt Publishing|Learning Geospatial Analysis with Python|Lawhead, Joel|9781783281138\n2018|No Starch Press|Impractical Python Projects: Playful Programming Activities to Make You Smarter|Vaughan, Lee|9781593278908\n2017|Apress|Mastering Machine Learning with Python in Six Steps: A Practical Implementation Guide to Predictive Data Analytics Using Python|Swamynathan, Manohar|9781484228654\n2016|Packt Publishing|Designing Machine Learning Systems with Python|Julian, David|9781785882951\n2010|Apress|Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source)|Hetland, Magnus Lie|9781430232377\n2014|Packt Publishing|Mastering Python Regular Expressions|Lopez, Felix and Romero, Victor|9781783283156\n2015|CreateSpace Independent Publishing Platform|A collection of Data Science Interview Questions Solved in Python and Spark: Hands-on Big Data and Machine Learning (A Collection of Programming Interview Questions) (Volume 6)|Gulli, Antonio|9781517216719\n2007|Apress|Beginning Game Development with Python and Pygame: From Novice to Professional (Expert's Voice)|McGugan, Will|9781590598726\n2010|Apress|Foundations of Python Network Programming: The comprehensive guide to building network applications with Python (Books for Professionals by Professionals)|Goerzen, John and Bower, Tim and Rhodes, Brandon|9781430230038\n2015|Packt Publishing|Mastering Python for Data Science|Madhavan, Samir|9781784390150\n2000|Manning Publications|The Quick Python Book|Harms Ph.D., Daryl D and McDonald, Kenneth|9781884777745\n1996|CreateSpace Independent Publishing Platform|Programming Python|Mark Lutz|9781565921979\n2014|Packt Publishing|Parallel Programming with Python|Palach, Jan|9781783288397\n2013|Sams Publishing|Python Programming for Raspberry Pi, Sams Teach Yourself in 24 Hours|Blum, Richard and Bresnahan, Christine|9780789752055\n2015|Packt Publishing|Functional Python Programming|Lott, Steven|9781784396992\n2021|No Starch Press|Black Hat Python, 2nd Edition: Python Programming for Hackers and Pentesters|Seitz, Justin and Arnold, Tim|9781718501126\n2018|For Dummies|Beginning Programming with Python For Dummies|Mueller, John Paul|9781119457893\n2009|Cambridge University Press|Python for Software Design: How to Think Like a Computer Scientist|Downey, Allen B.|9780521725965\n2008|Prentice Hall|Python Fundamentals|Chun, Wesley J.|9780137143412\n2009|Cambridge University Press|Python for Software Design: How to Think Like a Computer Scientist|Downey, Allen B.|9780521898119\n2011|Springer|A Primer on Scientific Programming with Python (Texts in Computational Science and Engineering)|Langtangen, Hans Petter|9783642183652\n2014|Packt Publishing|Python Data Analysis|Idris, Ivan|9781783553358\n2020|Pearson|MyLab Programming with Pearson eText -- Access Card -- for Starting out with Python|Gaddis, Tony|9780136679110\n2014|Packt Publishing|Learning Python Data Visualization|Adams, Chad|9781783553334\n2003|Cengage Learning PTR|Python Programming for the Absolute Beginner|Dawson, Michael|9781592000739\n2016|Apress|Beginning Ethical Hacking with Python|Sinha, Sanjib|9781484225400\n2017|DK Children|Coding Projects in Python (Computer Coding for Kids)|DK|9781465461889\n2017|Packt Publishing|Mastering Python Networking: Your one stop solution to using Python for network automation, DevOps, and SDN|Chou, Eric|9781784397005\n2016|Packt Publishing|Scientific Computing with Python 3|Fuhrer, Claus and Solem, Jan Erik and Verdier, Olivier|9781786463517\n2008|Packt Publishing|Expert Python Programming: Best practices for designing, coding, and distributing your Python software|Ziadé, Tarek|9781847194947\n2015|CreateSpace Independent Publishing Platform|A collection of Advanced Data Science and Machine Learning Interview Questions Solved in Python and Spark (II): Hands-on Big Data and Machine ... of Programming Interview Questions)|Gulli, Dr Antonio|9781518678646\n2017|Springer|Programming with Python|Padmanabhan, T R|9789811032769\n2016|Packt Publishing|Bayesian Analysis with Python|Martin, Osvaldo|9781785883804\n2017|O'Reilly Media|Python in a Nutshell: A Desktop Quick Reference|Martelli, Alex and Ravenscroft, Anna Martelli and Holden, Steve|9781449392925\n2010|Apress|The Definitive Guide to Jython: Python for the Java Platform (Expert's Voice in Software Development)|Juneau, Josh and Baker, Jim and Wierzbicki, Frank and Soto Muoz, Leo and Ng, Victor and Ng, Alex and Baker, Donna L.|9781430225270\n2015|O'Reilly Media|Programming Google App Engine with Python: Build and Run Scalable Python Apps on Google's Infrastructure|Sanderson, Dan|9781491900253\n2016|Cambridge University Press|Learning Scientific Programming with Python|Hill, Christian|9781107428225\n2014|Packt Publishing|Learning Selenium Testing Tools with Python|Gundecha, Unmesh|9781783983506\n11/2018|Wiley Global Education US|Python For Everyone, Enhanced eText|Cay S. Horstmann; Rance D. Necaise|9781119498537\n2019|Apress|Python Projects for Beginners: A Ten-Week Bootcamp Approach to Python Programming|Milliken, Connor P.|9781484253540\n2016|Packt Publishing|Learning Python Application Development|Sathaye, Ninad|9781785889196\n2009|Packt Publishing|Matplotlib for Python Developers|Tosi,Sandro|9781847197900\n2009|CreateSpace Independent Publishing Platform|Python/C Api Manual - Python 3: (Python Documentation Manual Part 4)|Van Rossum, Guido and Drake, Fred L.|9781441412737\n20200325|Pearson Education (US)|Starting Out with Python|Tony Gaddis|9780136719199\n2004|Apress|Foundations of Python Network Programming|Goerzen, John|9781590593714\n2011|Createspace Independent Publishing Platform|Python Programming|Wikibooks Contributors|9781466366053\n2017|Wiley-ISTE|Digital Signal Processing (DSP) with Python Programming|Charbit, Maurice|9781786301260\n2003|O'Reilly Media|Python in a Nutshell|Alex Martelli|9780596001889\n2012||Myprogramminglab With Pearson Etext -- Access Card -- For Starting Out With Python (myprogramminglab (access Codes))|Tony Gaddis|9780133075939\n2018|Packt Publishing|Python Programming Blueprints: Build nine projects by leveraging powerful frameworks such as Flask, Nameko, and Django|Furtado, Daniel and Pennington, Marcus|9781786468161\n2018|Wiley India|Core Python Programming, 2Ed [Paperback] [Jan 01, 2018] R. Nageswara Rao|R. Nageswara Rao|9789386052308\n2014|Packt Publishing|Python Tools for Visual Studio|Sabia, Martino and Wang, Cathy|9781783288687\n2016|CreateSpace Independent Publishing Platform|Python: The Fundamentals Of Python Programming|Jones, Paul|9781539530268\n2015|Pearson|Rapid GUI Programming with Python and Qt: The Definitive Guide to PyQt Programming (paperback)|Summerfield, Mark|9780134393339\n2002|Wiley|Making Use of Python|Gupta, Rashi|9780471219750\n1999|Premier Pr|Programming With Python|Altom, Tim and Chapman, Mitch|9780761523345\n2018|Packt Publishing|Internet of Things Programming Projects: Build modern IoT solutions with the Raspberry Pi 3 and Python|Dow, Colin|9781789134803\n2019|BPB Publications|Python for Professionals: Hands-on Guide for Python Professionals (English Edition)|Telles, Matt|9789389423754\n2018|Mercury Learning & Information|Python Basics: A Self-Teaching Introduction|Bhasin, H.|9781683923534\n2011|Chapman and Hall/CRC|A Concise Introduction to Programming in Python (Chapman & Hall/CRC Textbooks in Computing)|Johnson, Mark J.|9781439896945\n2016|Packt Publishing|Learning Predictive Analytics with Python: Gain practical insights into predictive modelling by implementing Predictive Analytics algorithms on public datasets with Python|Kumar, Ashish|9781783983261\n2010|Packt Publishing|Python Geospatial Development|Westra, Erik|9781849511544\n2011|Prentice Hall|Rapid Web Applications with TurboGears: Using Python to Create Ajax-Powered Sites|Ramm, Mark|9780132433884\n2019|BPB Publications|Let Us Python: Python Is Future, Embrace It Fast (Second Edition) (English Edition)|Kanetkar, Yashavant and Kanetkar, Aditya|9789389845006\n2014|Pearson|MyLab Programming with Pearson eText -- Access Code Card -- for An Introduction to Programming Using Python|Schneider, David|9780134058436\n2016|Createspace Independent Publishing Platform|Python: Python Programming: Learn Python Programming In A Day - A Comprehensive Introduction To The Basics Of Python & Computer Programming|Steve Gold|9781534608634\n2015|Pearson|MyLab Programming with Pearson eText -- Access Card -- for Introduction to Computing and Programming in Python (My Programming Lab)|Guzdial, Mark and Ericson, Barbara and Guijarro-Crouch, Mercedes|9780134026244\n2016|Packt Publishing|Natural Language Processing: Python and NLTK|Hardeniya, Nitin and Perkins, Jacob and Chopra, Deepti and Joshi, Nisheeth and Mathur, Iti|9781787285101\n2019|BPB Publications|Python for Developers: Learn to Develop Efficient Programs using Python (English Edition)|Raj, Mohit|9788194401872\n2020|Mercury Learning & Information|Python 3 for Machine Learning|Campesato, Oswald|9781683924951\n2020|Wiley|Bite-Size Python: An Introduction to Python Programming|Speight, April|9781119643814\n2011|Apress|Pro Android Python with SL4A: Writing Android Native Apps Using Python, Lua, and Beanshell|Ferrill, Paul|9781430235699\n2008|Cengage Learning EMEA|Python for Rookies|Mount, Sarah and Shuttleworth, James and Winder, Russel|9781844807017\n2020|Apress|The Definitive Guide to Masonite: Building Web Applications with Python|Pitt, Christopher and Mancuso, Joe|9781484256015\n2016|Createspace Independent Publishing Platform|Deep Learning With Python|Chao Pan|9781721250974\n2018|Routledge|Introduction to Python for Science and Engineering (Series in Computational Physics)|Pine, David J.|9781138583894\n2016|CreateSpace Independent Publishing Platform|Python: Beginner’s Guide to Programming Code with Python (Python, Java, JavaScript, Code, Programming Language, Programming, Computer Programming) (Volume 1)|Masterson, Charlie|9781540501998\n20170921|Springer Nature|Snake Charming - The Musical Python|Iain Gray|9783319606606\n2017|CreateSpace Independent Publishing Platform|Tor: Accessing The Deep Web & Dark Web With Tor: How To Set Up Tor, Stay Anonymous Online, Avoid NSA Spying & Access The Deep Web & Dark Web (Tor, Tor ... Invisible, NSA Spying, Python Programming)|Jones, Jack|9781545269923\n2020|Drip Digital|Learn Python Quickly: A Complete Beginner’s Guide to Learning Python, Even If You’re New to Programming (Crash Course With Hands-On Project)|Quickly, Code|9781951791278\n2019|Independently published|Problem Solving with Python 3.6 Edition: A beginner's guide to Python & open-source programming tools|Kazarinoff, Peter D.|9781793814043\n2019|Packt Publishing|MicroPython Cookbook: Over 110 practical recipes for programming embedded systems and microcontrollers with Python|Alsabbagh, Marwan|9781838649951\n2020|Cambridge University Press|Python for Linguists|Hammond, Michael|9781108493444\n2018|Packt Publishing|Mastering Python for Networking and Security: Leverage Python scripts and libraries to overcome networking and security issues|Ortega, José Manuel|9781788990707\n2017|Apress|MicroPython for the Internet of Things: A Beginner’s Guide to Programming with Python on Microcontrollers|Bell, Charles|9781484231227\n2018|CRC Press|Understanding Optics with Python (Multidisciplinary and Applied Optics)|Lakshminarayanan, Vasudevan and Ghalila, Hassen and Ammar, Ahmed and Varadharajan, L. Srinivasa|9781498755047\n2018|Apress|Learn Keras for Deep Neural Networks: A Fast-Track Approach to Modern Deep Learning with Python|Moolayil, Jojo|9781484242391\n2014|CreateSpace Independent Publishing Platform|Python: Learn Python FAST! - The Ultimate Crash Course to Learning the Basics of the Python Programming Language In No Time|Hutt, Ryan|9781502741004\n2008|Addison-Wesley Professional|Python Web Development with Django|Forcier, Jeff and Paul Bissex and Wesley Chun|9780132701815\n2017|Apress|Pro Deep Learning with TensorFlow: A Mathematical Approach to Advanced Artificial Intelligence in Python|Pattanayak, Santanu|9781484230961\n2017|Packt Publishing|Python Network Programming Cookbook - Second Edition: Practical solutions to overcome real-world networking challenges|Kathiravelu, Pradeeban and Sarker, Dr. M. O. Faruque|9781786463999\n2018|CreateSpace Independent Publishing Platform|Writing Interpreters and Compilers for the Raspberry Pi Using Python|Dos Reis, Anthony J.|9781977509208\n2018|Springer|Dynamical Systems with Applications using Python|Lynch, Stephen|9783319781440\n2020|Chapman & Hall|Advanced Data Science and Analytics with Python (Chapman & Hall/CRC Data Mining and Knowledge Discovery Series)|Rogel-Salazar, Jesus|9781138315068\n2016|Springer|Python for Probability, Statistics, and Machine Learning|Unpingco, José|9783319307176\n2013|Wiley|Python for Everyone|Horstmann, Cay S. and Necaise, Rance D.|9781118645208\n2018|Independently published|50 Steps to Mastering Basic Python Programming: With 140 practice problems and available accompanying videos, software, and problem solutions|Shaffer, Dr. Steven C.|9781980763321\n2020|Apress|Beginning Game Programming with Pygame Zero: Coding Interactive Games on Raspberry Pi Using Python|Watkiss, Stewart|9781484256497\n2018|CreateSpace Independent Publishing Platform|Python for beginners: Step-By-Step Guide to Learning Python Programming|Lutz, Larry|9781717410580\n2017|Createspace Independent Publishing Platform|Python: The No B.s. Python Crash Course For Newbies - Learn Python Programming In 8 Hours! (programming Series) (volume 3)|Steven Codey|9781545180426\n20090213|Pearson Technology Group|Advanced Python 3 Programming Techniques|Mark Summerfield|9780321637710\n2016|Lulu.com|The Python Language Reference Manual|Sheridan, Chris|9781326570972\n2019|Pearson|Revel for Introduction to Python Programming and Data Structures -- Access Card|Liang, Y. Daniel|9780135187753\n2017|Independently published|Programming: Python Programming, JAVA Programming, HTML and CSS Programming for Beginners|Academy, iCode|9781520676081\n2017|CreateSpace Independent Publishing Platform|PYTHON & HACKING: The No-Nonsense Bundle: Learn Python Programming and Hacking Within 24 Hours!|University, Cyberpunk|9781543055399\n2019|Apress|Learn TensorFlow 2.0: Implement Machine Learning and Deep Learning Models with Python|Singh, Pramod and Manure, Avinash|9781484255582\n2019|Independently published|Problem Solving with Python 3.7 Edition: A beginner's guide to Python & open-source programming tools|Kazarinoff, Peter D.|9781693405419\n2019|Independently published|Data Structures and Algorithms in Python|Publishing, DS|9781691372379\n2018|Packt Publishing|Tkinter GUI Programming by Example: Learn to create modern GUIs using Tkinter by building real-world projects in Python|Love, David|9781788627481\n2020|Apress|Machine Learning Concepts with Python and the Jupyter Notebook Environment: Using Tensorflow 2.0|Silaparasetty, Nikita|9781484259665\n2016|CreateSpace Independent Publishing Platform|Python: The Complete Python Quickstart Guide (For Beginner's) (Python, Python Programming, Python for Dummies, Python for Beginners, Python crash course)|Style Academy, Life-|9781539567745\n2019|BPB Publications|Data Science with Jupyter: Master Data Science skills with easy-to-follow Python examples|Gupta, Prateek|9789388511377\n2018|CreateSpace Independent Publishing Platform|Python Programming: A Step By Step Guide For Beginners|Eddison, Leonard|9781719396509\n2018|In Easy Steps Limited|Python in easy steps: Covers Python 3.7|McGrath, Mike|9781840788365\n2019|Independently published|Python Programming: The Ultimate Crash Course for Beginners with all the Tools and Tricks to Learn Coding with Python (with Practical Examples)|Hayes, Howard|9781706111658\n2017|Createspace Independent Publishing Platform|Python Made Simple And Practical: A Step-by-step Guide To Learn Python Coding And Computer Science From Basic To Advanced Concepts.|James L. Young|9781546573333\n2015|Springer|The Python Workbook: A Brief Introduction with Exercises and Solutions|Stephenson, Ben|9783319142401\n2016|Chapman and Hall/CRC|Python for Bioinformatics (Chapman & Hall/CRC Mathematical and Computational Biology)|Bassi, Sebastian|9781584889304\n2016|CreateSpace Independent Publishing Platform|Python: An Ultimate Beginner's Guide to Python Programming|Gabon, Gale|9781533535573\n2018||Python Crash Course|Alexis Jordan|9781717716484\n20170113|Springer Nature|Programming with Python|T R Padmanabhan|9789811032776\n2019|Independently published|Mastering Deep Learning Fundamentals with Python: The Absolute Ultimate Guide for Beginners To Expert and Step By Step Guide to Understand Python Programming Concepts|Wilson, Richard|9781080537778\n2017-04-28|Packt Publishing|Python Deep Learning|Valentino Zocca and Gianmario Spacagna and Daniel Slater and Peter Roelants|9781786460660\n2015|Packt Publishing|Python Penetration Testing Essentials|Mohit|9781784395889\n|Independently Published|Python Programming: An Easiest Beginner To Expert Guide To Learn Python|Burn and Andrew|9781090664846\n2016|Createspace Independent Publishing Platform|Python Programming: A Beginner's Guide To Learn Python In 7 Days|Ramsey Hamilton|9781533698537\n2018|Packt Publishing|Keras Deep Learning Cookbook: Over 30 recipes for implementing deep neural networks in Python|Dua, Rajdeep and Ghotra, Manpreet Singh|9781788621755\n2017|CreateSpace Independent Publishing Platform|Python: 2 Books in 1: Beginner's Guide + Best Practices to Programming Code with Python (Python, Java, JavaScript, Code, Programming Language, Programming, Computer Programming)|Masterson, Charlie|9781543292756\n2009|Springer|A Primer on Scientific Programming with Python (Texts in Computational Science and Engineering Book 6)|Langtangen, Hans Petter|9783642024757\n2019|Independently published|Raspberry Pi 3: A Practical Beginner's Guide To Understanding The Full Potential Of Raspberry Pi 3 By Starting Your Own Projects Using Python Programming|Sanders, Finn|9781093479508\n2017|Lulu.com|The Hacker's Guide To Scaling Python|Danjou, Julien|9781387379323\n2015|Packt Publishing|Python Data Visualization Cookbook - Second Edition|Milovanovic, Igor and Foures, Dimitry and Vettigli, Giuseppe|9781784394943\n2019|John Wiley & Sons|Python All-in-one For Dummies|John Shovic and Alan Simpson|9781119557678\n2014|Springer|A Primer on Scientific Programming with Python (Texts in Computational Science and Engineering Book 6)|Langtangen, Hans Petter|9783642549595\n2014|Apress|Learn Raspberry Pi Programming with Python|Donat, Wolfram|9781430264255\n2015|Packt Publishing|Python 3 Object-oriented Programming: Building robust and maintainable software with object oriented design patterns in Python|Phillips, Dusty|9781784395957\n2018|CreateSpace Independent Publishing Platform|Python Programming & Machine Learning With Python: Best Starter Pack Illustrated Guide For Beginners & Intermediates: The Future Is Here!|Sullivan, William|9781724534668\n2017|Createspace Independent Publishing Platform|Learn To Code:: The Beginner's Guide To Computer Programming - Python Machine Learning, Python For Beginners, Coding For Beginners|Dave Jones|9781548309794\n2017|Haynes Publishing UK|Coding - Computer programming (beginners onwards): Everything you need to get started with programming using Python (Owners' Workshop Manual)|Saunders, Mike|9781785211188\n2019|BPB Publications|Python Data Persistence: With SQL and NOSQL Databases|Lathkar, Malhar|9789388511759\n2018|BlackNES Guy Books|PYTHON & HACKING BUNDLE: 3 BOOKS IN 1: THE BLUEPRINT: Everything You Need To Know For Python Programming and Hacking!|Architects, CyberPunk|9781775235774\n2019|Independently published|PYTHON FOR BEGINNERS: The Ultimate Step by Step Learning Guide for Beginners to Python Programming in the Best Optimal Way|SANCHEZ, ENRIQUE|9781089550860\n2018|Independently published|Python Programming: A Step-by-Step Guide For Absolute Beginners|Brian Jenkins|9781792659416\n2019|EGEA Spa - Bocconi University Press|Python for non-Pythonians: How to Win Over Programming Languages|Grossetti, Francesco and Rubera, Gaia|9788885486867\n2007|Springer|Python Scripting for Computational Science (Texts in Computational Science and Engineering Book 3)|Langtangen, Hans Petter|9783540739166\n2016|People's Posts and Telecommunications Press|Python programming quickly get started to make the tedious work automation(Chinese Edition)|[ MEI ] Al Sweigart ZHU|9787115422699\n2021|Millennium Publishing Ltd|Python Programming For Beginners In 2021: Learn Python In 5 Days With Step By Step Guidance, Hands-on Exercises And Solution (Fun Tutorial For Novice Programmers) (Easy Coding Crash Course)|Tudor, James|9781913361273\n2019|Independently published|Python Data Analytics: A step by step fast and easy guide for whom are interested learn python data analytics. With examples, tips and tricks, includind basics of Pandas, Numpy and Matlotlib|programming languages project|9781704066530\n2019|Platinum Press LLC|Python Programming: Python Programming for Beginners, Python Programming for Intermediates|Stewart, Sarah|9781951339944\n2019|Apress|Natural Language Processing Recipes: Unlocking Text Data with Machine Learning and Deep Learning using Python|Kulkarni, Akshay and Shivananda, Adarsha|9781484242674\n2016|Springer|A Primer on Scientific Programming with Python (Texts in Computational Science and Engineering Book 6)|Langtangen, Hans Petter|9783662498873\n2017|Createspace Independent Publishing Platform|Python Succinctly|Jason Cannon|9781542827126\n20091002|O'Reilly Media, Inc.|Learning Python|Mark Lutz|9781449379322\n2003|O'Reilly Media, Incorporated|Learning Python|Mark Lutz and David Ascher|9781600330216\n2019|Independently published|LEARN PYTHON PROGRAMMING: Write code from scratch in a clear & concise way, with a complete basic course. From beginners to intermediate, an hands-on project with examples, to follow step by step|GRAY, WILLIAM|9781098525729\n2021|Apress|Programming Microcontrollers with Python: Experience the Power of Embedded Python|Subero, Armstrong|9781484270578\n2015|Createspace Independent Publishing Platform|Python: Learn Python Fast - The Ultimate Crash Course To Learning The Basics Of The Python Programming Language In No Time (python, Python ... Coding Fast With Hands-on Project) (volume 7)|Stephen Hoffman|9781517137861\n2016|Packt Publishing|Bayesian Analysis with Python|Martin, Osvaldo|9781785889851\n20091208|O'Reilly Media, Inc.|Bioinformatics Programming Using Python|Mitchell L Model|9781449382902\n2018|Packt Publishing|Python Artificial Intelligence Projects for Beginners: Get up and running with Artificial Intelligence using 8 smart and exciting AI applications|Eckroth, Dr. Joshua|9781789538243\n2017|Createspace Independent Publishing Platform|Intermediate Python Programming: The Insider Guide To Intermediate Python Programming Concepts|Richard Ozer|9781978081123\n2014|Packt Publishing|Python for Secret Agents|Lott, Steven F.|9781783980437\n20140423|Pearson Education (US)|Starting Out with Python|Tony Gaddis|9780133743692\n2021|Simvol-Pljus|Programming in Python 3. Detailed guidance. / Programmirovanie na Python 3. Podrobnoe rukovodstvo.|Various authors|9785932861615\n2017|Independently Published|Python Programming For Intermediates: Learn The Fundamentals Of Python In 7 Days|Michael Knapp|9781521439555\n2014|Apress|Foundations of Python Network Programming|Rhodes, Brandon and Goerzen, John|9781430258551\n2009|Champion Writers, Inc.|Python Programming With Oracle Database|Ray Terrill|9781608300136\n2020|Springer|Essential Python for the Physicist|Giovanni Moruzzi|9783030450274\n2018|CreateSpace Independent Publishing Platform|Python: The Ultimate Beginners Guide to Learn and Understand Python Programming (Volume 1)|Webber, Mr Zach|9781986840156\n20160830|O'Reilly Media, Inc.|The Hitchhiker's Guide to Python|Kenneth Reitz; Tanya Schlusser|9781491933220\n20180903|Taylor & Francis|Nonlinear Digital Filtering with Python|Ronald K. Pearson; Moncef Gabbouj|9781498714136\n2011|Apress|Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source)|Hetland, Magnus Lie|9781430232384\n2019|Packt Publishing|Expert Python Programming: Become a master in Python by learning coding best practices and advanced programming concepts in Python 3.7, 3rd Edition|Jaworski, Michał and Ziadé, Tarek|9781789806779\n2011|Apress|Pro Android Python with SL4A: Writing Android Native Apps Using Python, Lua, and Beanshell|Ferrill, Paul|9781430235705\n2018|Packt Publishing|Hands-On Bitcoin Programming with Python: Build powerful online payment centric applications with Python|Garg, Harish|9781789533163\n2019|Independently Published|Coding: This Book Includes: Python Coding And Programming + Linux For Beginners + Learn Python Programming”|Clark, Michael and Learn, Michael|9781673163865\n2016|Packt Publishing|Modern Python Cookbook: The latest in modern Python recipes for the busy modern programmer|Lott, Steven F.|9781786463845\n2014|John Wiley & Sons|Beginning Programming With Python For Dummies|John Paul Mueller|9781118891476\n2014|Packt Publishing|Raspberry Pi Cookbook for Python Programmers|Cox, Tim|9781849696630\n2020|SAGE Publications Ltd|Programming with Python for Social Scientists|Brooker, Phillip|9781526431721\n15-07-2019|Packt Publishing|Hands-On Web Scraping with Python|Anish Chapagain|9781789536195\n2018|Independently published|Programming: 4 Manuscripts in 1 book: Python For Beginners, Python 3 Guide, Learn Java, Excel 2016|Needham, Timothy C.|9781728914671\n2015|Packt Publishing|Programming ArcGIS with Python Cookbook - Second Edition|Pimpler, Eric|9781785281259\n2018|Apress|Data Science Fundamentals for Python and MongoDB|Paper, David|9781484235973\n2015|Cambridge University Press|Python Programming for Biology: Bioinformatics and Beyond|Stevens, Tim J.|9780521895835\n2017|John Wiley & Sons|Digital Signal Processing (dsp) With Python Programming|Maurice Charbit|9781119373032\n2019|Independently Published|Python Coding: Step-by-step Beginners' Guide To Learning Python Programming Language With Hands-on Project. Exercises Included|Zed Fast|9781670440549\n2015|Apress|Beginning Python Games Development, Second Edition: With PyGame|McGugan, Will and Kinsley, Harrison|9781484209707\n2015|CreateSpace Independent Publishing Platform|Python Programming: Getting started FAST With Learning of Python Programming Basics in No Time (Programming is Easy) (Volume 3)|Gimson, Matthew|9781519564849\n2011|Apress|Foundations of Python Network Programming: The comprehensive guide to building network applications with Python (Books for Professionals by Professionals)|Goerzen, John and Bower, Tim and Rhodes, Brandon|9781430230045\n2018|CreateSpace Independent Publishing Platform|Python Programming: A Step By Step Guide For Beginners|Eddison, Leonard|9781986278577\n2016|People Post Press|Teach children to learn programming language Python version(Chinese Edition)|Bryson Payne|9787115416346\n2019|Independently published|Learning Python: The Ultimate Guide to Learning How to Develop Applications for Beginners with Python Programming Language Using Numpy, Matplotlib, Scipy and Scikit-learn|Hack, Samuel|9781086759440\n2017|Pearson|Introduction to Computing and Programming in Python with MyProgrammingLab, Global Edition|Guzdial, Mark J. and Ericson, Barbara|9781292109954\n2015|Springer|Data Structures and Algorithms with Python (Undergraduate Topics in Computer Science)|Lee, Kent D. and Hubbard, Steve|9783319130729\n2016|Sams,|Sams Teach Yourself Python Programming For Raspberry Pi In 24 Hours|Blum, Richard , 1962- (author.)|9780134389585\n2017|Packt Publishing|Python Social Media Analytics: Analyze and visualize data from Twitter, YouTube, GitHub, and more|Chatterjee, Siddhartha and Krystyanczuk, Michal|9781787126756\n2014|Chapman and Hall/CRC|Making Music with Computers: Creative Programming in Python (Chapman & Hall/CRC Textbooks in Computing)|Manaris, Bill and Brown, Andrew R.|9781482222210\n2021|American Geophysical Union|Python for Remote Sensing Applications in Earth Science: A Practical Programming Guide (Special Publications)|Esmaili, Rebekah B.|9781119606888\n2011|Springer|A Primer on Scientific Programming with Python (Texts in Computational Science and Engineering Book 6)|Langtangen, Hans Petter|9783642183669\n2019|Apress|Building Android Apps in Python Using Kivy with Android Studio: With Pyjnius, Plyer, and Buildozer|Gad, Ahmed Fawzy Mohamed|9781484250310\n2017|Packt Publishing|Statistics for Machine Learning: Techniques for exploring supervised, unsupervised, and reinforcement learning models with Python and R|Dangeti, Pratap|9781788291224\n2017|Springer|Introduction to Data Science: A Python Approach to Concepts, Techniques and Applications (Undergraduate Topics in Computer Science)|Igual, Laura and Santi Seguí and Jordi Vitrià and Eloi Puertas and Petia Radeva and Oriol Pujol and Sergio Escalera and Francesc Dantí and Lluís Garrido|9783319500171\n||Introduction To Computing And Programming In Python Plus Myprogramming Lab Without Pearson Etext -- Access Card Package (3rd Edition)||9780133591521\n2019|Independently Published|Python Programming: 2 Books In 1: Ultimate Beginner's Guide & 7 Days Crash Course, Learn Computer Programming, Machine Learning And Data Science Quickly With Step-by-step Exercises|John Russel|9781673121223\n2019|Springer|Programming for Computations - Python: A Gentle Introduction to Numerical Simulations with Python 3.6 (Texts in Computational Science and Engineering Book 15)|Linge, Svein and Hans Petter Langtangen|9783030168773\n2019-05-01T00:00:01Z|QuickStudy Reference Guides|Python Programming Language|Jayne, Berajah|9781423241881\n2016|Springer|Programming for Computations - Python: A Gentle Introduction to Numerical Simulations with Python (Texts in Computational Science and Engineering Book 15)|Linge, Svein and Langtangen, Hans Petter|9783319324289\n2022|Independently published|Python Programming for Beginners: The #1 Python Programming Crash Course for Beginners to Learn Python Coding Well & Fast (with Hands-On Exercises)|Publishing, Codeone|9798430918002\n2012|No Starch Press, Incorporated|Python for Kids: A Playful Introduction to Programming|Briggs, Jason R.|9781593274078\n2021|Real Python (realpython.com)|Python Basics: A Practical Introduction to Python 3|Amos, David and Bader, Dan and Jablonski, Joanna and Heisler, Fletcher|9781775093329\n2017|O'Reilly Media|Python for Data Analysis: Data Wrangling with Pandas, NumPy, and IPython|McKinney, Wes|9781491957660\n2021|Independently published|Python Programming for Beginners: The Ultimate Guide for Beginners to Learn Python Programming: Crash Course on Python Programming for Beginners (Python Programming Books)|Publishing, AMZ|9798536636619\n2019|No Starch Press|Python Crash Course, 2nd Edition: A Hands-On, Project-Based Introduction to Programming|Matthes, Eric|9781593279295\n2014|O'Reilly Media|Python Pocket Reference: Python In Your Pocket (Pocket Reference (O'Reilly))|Lutz, Mark|9781449357016\n2020|Packt Publishing|40 Algorithms Every Programmer Should Know: Hone your problem-solving skills by learning different algorithms and their implementation in Python|Ahmad, Imran|9781789801217\n2013|O'Reilly Media|Python Cookbook, Third Edition|Beazley, David and Jones, Brian K.|9781449340377\n2020|Independently published|Python for Beginners: 2 Books in 1: Python Programming for Beginners, Python Workbook|ACADEMY, PROGRAMMING LANGUAGES|9781654414016\n2020|Quickstudy|Python Standard Library: A Quickstudy Laminated Reference Guide|Jayne, Berajah|9781423244233\n2018-10-30T00:00:01Z|Packt Publishing|Python 3 Object-Oriented Programming: Build robust and maintainable software with object-oriented design patterns in Python 3.8, 3rd Edition|Phillips, Dusty|9781789615852\n2020|Esri Press|Python Scripting for ArcGIS Pro|Zandbergen, Paul A. and Zandbergen, Paul|9781589485006\n2016|Franklin, Beedle & Associates|Python Programming: An Introduction to Computer Science, 3rd Ed.|John Zelle|9781590282755\n2021|No Starch Press|Black Hat Python, 2nd Edition: Python Programming for Hackers and Pentesters|Seitz, Justin and Arnold, Tim|9781718501133\n2021|Independently published|Python for Beginners: Learn Python Programming With No Coding Experience in 7 Days: The Easiest & Quickest Way to Learn Python Coding, Programming, Web-Programming. Be a Python Programmer|Ozoemena, Santos|9798478596194\n2019|Addison-Wesley Professional|Effective Python: 90 Specific Ways to Write Better Python (Effective Software Development Series)|Brett, Slatkin|9780134854595\n2017|Addison-Wesley Professional|Learn Python 3 the Hard Way: A Very Simple Introduction to the Terrifyingly Beautiful World of Computers and Code (Zed Shaw's Hard Way Series)|A., Shaw Zed|9780134693903\n2021|Packt Publishing|Learn Python Programming: An in-depth introduction to the fundamentals of Python, 3rd Edition|Romano, Fabrizio and Kruger, Heinrich|9781801815093\n2021|McGraw-Hill Education TAB|Programming the Raspberry Pi, Third Edition: Getting Started with Python|Monk, Simon|9781264257355\n2021|Mike Murach & Associates|Murach's Python Programming (2nd Edition)|Joel Murach and Michael Urban|9781943872749\n2020|Rockridge Press|Python Programming for Beginners: A Kid's Guide to Coding Fundamentals|Foster, Patricia|9781646113880\n2020|Packt Publishing|40 Algorithms Every Programmer Should Know: Hone your problem-solving skills by learning different algorithms and their implementation in Python|Ahmad, Imran|9781789809862\n2020|Independently published|Learn Coding Basics for Kids, Young Adults and People Who Are Young at Heart, With Python: Python Computer Programming Made Easy!|Stanley, Jack C. and Gross, Erik D. and Academy, The Tech|9798677949418\n2017|Manning|Deep Learning with Python|Chollet, Francois|9781638352044\n2015|No Starch Press|Python Crash Course: A Hands-On, Project-Based Introduction to Programming|Matthes, Eric|9781593276034\n2021|Columbia Business School Publishing|Python for MBAs|Griffel, Mattan and Guetta, Daniel|9780231193931\n2015|Esri Press|Python Scripting for ArcGIS (Python Scripting (3))|Zandbergen, Paul A.|9781589483712\n2016|Mike Murach & Associates|Murach's Python Programming|Michael Urban and Joel Murach|9781890774974\n2018-11-29T00:00:01Z|Packt Publishing|Learn Robotics Programming: Build and control autonomous robots using Raspberry Pi 3 and Python|Staple, Danny|9781789340747\n2019|Independently published|Computer Programming And Cyber Security for Beginners: This Book Includes: Python Machine Learning, SQL, Linux, Hacking with Kali Linux, Ethical Hacking. Coding and Cybersecurity Fundamentals|Codings, Zach|9781671532908\n2015|Addison-Wesley Professional|Effective Python: 59 Specific Ways to Write Better Python (Effective Software Development Series)|Slatkin, Brett|9780134034287\n2020|Manning Publications|Tiny Python Projects: 21 small fun projects for Python beginners designed to build programming skill, teach new algorithms and techniques, and introduce software testing|Youens-Clark, Ken|9781617297519\n2020|Packt Publishing|Django 3 By Example: Build powerful and reliable Python web applications from scratch, 3rd Edition|Melé, Antonio|9781838989323\n2015|Pearson|Introduction to Computing and Programming in Python|Guzdial, Mark and Ericson, Barbara|9780134025544\n2021|Independently published|PYTHON: Learn Coding Programs with Python Programming and Master Data Analysis & Analytics, Data Science and Machine Learning with the Complete Crash Course for Beginners - 5 Manuscripts in 1 Book|Academy, TechExp|9798597916552\n2009|Addison-Wesley Professional|Programming in Python 3: A Complete Introduction to the Python Language|Summerfield, Mark|9780321680563\n2021|McGraw-Hill Education TAB|Programming the Raspberry Pi, Third Edition: Getting Started with Python|Monk, Simon|9781264257362\n2019|Independently published|Python Workbook: Learn How to Quickly and Effectively Program with Exercises, Projects, and Solutions|LANGUAGES ACADEMY, PROGRAMMING|9781653039296\n2020|Coherent Press|Python from the Very Beginning: With 100 exercises and answers|Whitington, John|9780957671157\n2017|Independently published|Python for Beginners: An Introduction to Learn Python Programming with Tutorials and Hands-On Examples|Metzler, Nathan|9781973108795\n2021|No Starch Press|Learn to Code by Solving Problems: A Python Programming Primer|Zingaro, Daniel|9781718501331\n2021|Packt Publishing|Hands-On Data Analysis with Pandas: A Python data science handbook for data collection, wrangling, analysis, and visualization, 2nd Edition|Molin, Stefanie|9781800563452\n2021|Packt Publishing|Interactive Dashboards and Data Apps with Plotly and Dash: Harness the power of a fully fledged frontend web framework in Python – no JavaScript required|Dabbas, Elias|9781800568914\n2020-06-29T00:00:01Z|Packt Publishing|Raspberry Pi Computer Vision Programming: Design and implement computer vision applications with Raspberry Pi, OpenCV, and Python 3, 2nd Edition|Pajankar, Ashwin|9781800207219\n2020|Frank|Python programming for beginners|Cannon, Jason|9783033083073\n2021|AI Publishing LLC|Hands-on Python Programming for Beginners: Learn Practical Python Fast|Publishing, AI|9781734790191\n2016|Sundog Publishing|Python Programming and Visualization for Scientists|Alex J. DeCaria|9780972903387\n2016|Packt Publishing|Python: Deeper Insights into Machine Learning: Leverage benefits of machine learning techniques using Python|Raschka, Sebastian and Julian, David and Hearty, John|9781787128545\n2015|McGraw-Hill Education TAB|Programming the Raspberry Pi, Second Edition: Getting Started with Python|Monk, Simon|9781259587412\n2020|Packt Publishing|Practical Data Analysis Using Jupyter Notebook: Learn how to speak the language of data by extracting useful and actionable insights using Python|Wintjen, Marc|9781838825096\n2021|O'Reilly Media|Think Bayes: Bayesian Statistics in Python|Downey, Allen B.|9781492089469\n2020|Apress|Machine Learning in the Oil and Gas Industry: Including Geosciences, Reservoir Engineering, and Production Engineering with Python|Pandey, Yogendra Narayan and Rastogi, Ayush and Kainkaryam, Sribharath and Bhattacharya, Srimoyee and Saputelli, Luigi|9781484260937\n2006|For Dummies|Python For Dummies|Maruch, Stef and Maruch, Aahz|9780471778646\n2014|Packt Publishing|Mastering Object-oriented Python|F. Lott, Steven|9781783280971\n2009|Addison-Wesley Professional|Python Essential Reference (Developer's Library)|Beazley, David|9780768687026\n2018|Packt Publishing|Learn Python Programming: The no-nonsense, beginner's guide to programming, data science, and web development with Python 3.7, 2nd Edition|Romano, Fabrizio|9781788996662\n2021|Princeton University Press|A Student's Guide to Python for Physical Modeling: Second Edition|Kinder, Jesse M. and Nelson, Philip|9780691223667\n2019|Independently published|Python Programming For Beginners: Learn The Basics Of Python Programming (Python Crash Course, Programming for Dummies)|Tudor, James|9781075311932\n2013|Pragmatic Bookshelf, The|Practical Programming: An Introduction to Computer Science Using Python 3 (Pragmatic Programmers)|Gries, Paul and Campbell, Jennifer and Montojo, Jason|9781937785451\n2021|Packt Publishing|Practical Discrete Mathematics: Discover math principles that fuel algorithms for computer science and machine learning with Python|White, Ryan T. and Ray, Archana Tikayat|9781838983505\n2012|McGraw-Hill Education Tab|Programming the Raspberry Pi: Getting Started with Python|Monk, Simon|9780071807838\n2021|Independently published|Data Science for Beginners: 4 books in 1 — Master the Basics of Python Programming and Learn The Art of Data Science with Real-World Applications to Artificial Intelligence and Machine Learning|Park, Andrew|9798788844732\n2020|No Starch Press|Python One-Liners: Write Concise, Eloquent Python Like a Professional|Mayer, Christian|9781718500518\n2017|Microsoft Press|Begin to Code with Python|Miles, Rob|9781509304530\n2022|Independently published|Python: 3 books in 1- Your complete guide to python programming with Python for Beginners, Python Data Analysis and Python Machine Learning|Ellison, Brady|9798410695930\n2018|Princeton University Press|A Student's Guide to Python for Physical Modeling: Updated Edition|Kinder, Jesse M. and Nelson, Philip|9781400889426\n2021|Independently published|PYTHON: Learn Coding Programs with Python Programming and Master Data Analysis & Analytics, Data Science and Machine Learning with the Complete Crash Course for Beginners - 5 Manuscripts in 1 Book|Academy, TechExp|9798789894958\n2021|Packt Publishing|Python GUI Programming with Tkinter: Design and build functional and user-friendly GUI applications, 2nd Edition|Moore, Alan D.|9781801815925\n2012|No Starch Press|Python for Kids: A Playful Introduction To Programming|Briggs, Jason|9781593274948\n2018-05-15T00:00:01Z|Packt Publishing|Python GUI Programming with Tkinter: Develop responsive and powerful GUI applications with Tkinter|Moore, Alan D.|9781788835886\n2019|Packt Publishing|Python Network Programming: Conquer all your networking challenges with the powerful Python language|Ratan, Abhishek and Chou, Eric and Kathiravelu, Pradeeban and Sarker, Dr. M. O. Faruque|9781788830232\n2009|Addison-Wesley Professional|Programming in Python 3: A Complete Introduction to the Python Language|Summerfield, Mark|9780321699879\n2020|Cambridge University Press|Numerical Methods in Physics with Python|Gezerlis, Alex|9781108805889\n2020|Packt Publishing|Python Data Cleaning Cookbook: Modern techniques and Python tools to detect and remove dirty data and extract key insights|Walker, Michael|9781800564596\n2018|Packt Publishing|Learn Python Programming: The no-nonsense, beginner's guide to programming, data science, and web development with Python 3.7, 2nd Edition|Romano, Fabrizio|9781788991650\n2017|CreateSpace Independent Publishing Platform|Python Programming: for Engineers and Scientists|Turk, Irfan|9781543173833\n2019-02-28T00:00:01Z|Packt Publishing|Advanced Python Programming: Build high performance, concurrent, and multi-threaded apps with Python using proven design patterns|Lanaro, Dr. Gabriele and Nguyen, Quan and Kasampalis, Sakis|9781838551216\n2019|Packt Publishing|Mastering OpenCV 4 with Python: A practical guide covering topics from image processing, augmented reality to deep learning with OpenCV 4 and Python 3.7|Villán, Alberto Fernández|9781789349757\n2017|Pragmatic Bookshelf|Practical Programming: An Introduction to Computer Science Using Python 3.6|Gries, Paul and Campbell, Jennifer and Montojo, Jason|9781680502688\n2021|Packt Publishing|Hands-On Data Analysis with Pandas: A Python data science handbook for data collection, wrangling, analysis, and visualization, 2nd Edition|Molin, Stefanie|9781800565913\n2019-10-01T00:00:01Z|Oxford Univ Pr|Python Programming: Using Problem Solving Approach|Thareja, Reema|9780199480173\n2013|O'Reilly Media|Twisted Network Programming Essentials: Event-driven Network Programming with Python|McKellar, Jessica and Fettig, Abe|9781449326111\n2018|No Starch Press|Impractical Python Projects: Playful Programming Activities to Make You Smarter|Vaughan, Lee|9781593278915\n2019-12-24T00:00:01Z|Independently published|Python GUI Programming with PyQt: A Beginner’s Guide to Python 3 and GUI Application Development|Metzler, Nathan|9781650440712\n2013|O'Reilly Media|Think Bayes: Bayesian Statistics in Python|Allen B. Downey|9781449370787\n2021|Packt Publishing|Hands-On Financial Trading with Python: A practical guide to using Zipline and other Python libraries for backtesting trading strategies|Pik, Jiri and Ghosh, Sourav|9781838988807\n2018|Packt Publishing|Bioinformatics with Python Cookbook: Learn how to use modern Python bioinformatics libraries and applications to do cutting-edge research in computational biology, 2nd Edition|Antao, Tiago|9781789349986\n2022|Cambridge University Press|Mathematical Logic through Python|Gonczarowski, Yannai A. and Nisan, Noam|9781108949477\n2013-09-07T00:00:01Z|CreateSpace Independent Publishing Platform|Python for Biologists: A complete programming course for beginners|Jones, Dr Martin|9781492346135\n2018|Packt Publishing|Mastering Python Design Patterns: A guide to creating smart, efficient, and reusable software, 2nd Edition|Ayeva, Kamon and Kasampalis, Sakis|9781788832069", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|SciPy 1.0: fundamental algorithms for scientific computing in Python|10.1038/s41592-019-0686-2|8661|421|Pauli Virtanen and R. Gommers and T. Oliphant and Matt Haberland and Tyler Reddy and D. Cournapeau and Evgeni Burovski and Pearu Peterson and Warren Weckesser and Jonathan Bright and Stéfan J. van der Walt and M. Brett and Joshua Wilson and K. Millman and N. Mayorov and Andrew R. J. Nelson and E. Jones and Robert Kern and Eric Larson and C. J. Carey and Ilhan Polat and Yu Feng and Eric W. Moore and J. Vanderplas and D. Laxalde and Josef Perktold and R. Cimrman and I. Henriksen and E. Quintero and Charles R. Harris and A. Archibald and Antônio H. Ribeiro and Fabian Pedregosa and P. van Mulbregt and Aditya Alessandro Pietro Alex Andreas Andreas Anthony Ant Vijaykumar Bardelli Rothberg Hilboll Kloeckner Sco and A. Vijaykumar and Alessandro Pietro Bardelli and Alex Rothberg and A. Hilboll and Andre Kloeckner and A. Scopatz and Antony Lee and A. Rokem and C. N. Woods and Chad Fulton and Charles Masson and C. Häggström and Clark Fitzgerald and D. Nicholson and David R. Hagen and D. Pasechnik and E. Olivetti and Eric Martin and Eric Wieser and Fabrice Silva and F. Lenders and Florian Wilhelm and G. Young and Gavin A. Price and G. Ingold and Gregory E. Allen and Gregory R. Lee and H. Audren and I. Probst and J. Dietrich and J. Silterra and James T. Webber and J. Slavič and J. Nothman and J. Buchner and Johannes Kulick and Johannes L. Schönberger and J. V. de Miranda Cardoso and J. Reimer and J. Harrington and Juan Rodríguez and Juan Nunez-Iglesias and Justin Kuczynski and K. Tritz and M. Thoma and M. Newville and Matthias Kümmerer and Maximilian Bolingbroke and Michael Tartre and M. Pak and Nathaniel J. Smith and N. Nowaczyk and Nikolay Shebanov and O. Pavlyk and P. A. Brodtkorb and Perry Lee and R. McGibbon and Roman Feldbauer and Sam Lewis and S. Tygier and Scott Sievert and S. Vigna and Stefan Peterson and S. More and Tadeusz Pudlik and T. Oshima and T. Pingel and T. Robitaille and Thomas Spura and T. Jones and T. Cera and Tim Leslie and Tiziano Zito and Tom Krauss and U. Upadhyay and Y. Halchenko and Y. Vázquez-Baeza|f0d35b37fec26c3f1ed09253cbb9304fb62208d1\n2014|scikit-image: image processing in Python|10.7717/peerj.453|2701|73|S. Walt and Johannes L. Schönberger and Juan Nunez-Iglesias and François Boulogne and Joshua D. Warner and Neil Yager and E. Gouillart and Tony Yu|a2fcf53f0aef0bfaec6353676c4f1d4e36aab5c0\n2016|Probabilistic programming in Python using PyMC3|10.7287/peerj.preprints.1686v1|1322|145|J. Salvatier and T. Wiecki and C. Fonnesbeck|8085b60ce1771647f11ccc4728397275b502f359\n2017|The atomic simulation environment-a Python library for working with atoms.|10.1088/1361-648X/aa680e|1291|28|Ask Hjorth Larsen and Jens Jørgen Mortensen and J. Blomqvist and I. Castelli and R. Christensen and M. Dulak and J. Friis and M. Groves and B. Hammer and Cory Hargus and E. Hermes and P. C. Jennings and Peter Bjerre Jensen and J. Kermode and J. Kitchin and Esben Leonhard Kolsbjerg and J. Kubal and K. Kaasbjerg and S. Lysgaard and Jón Bergmann Maronsson and Tristan Maxson and T. Olsen and L. Pastewka and Andrew A. Peterson and C. Rostgaard and J. Schiøtz and O. Schütt and M. Strange and K. Thygesen and T. Vegge and L. Vilhelmsen and M. Walter and Z. Zeng and K. Jacobsen|433d14e40f0d5362df4016270ba97e13371bc42a\n2012|Pyomo — Optimization Modeling in Python|10.1007/978-1-4614-3226-5|573|46|W. Hart and C. Laird and J. Watson and D. L. Woodruff|aad4604a72ae4856ae9fb4d0c3f8748a7a895b7b\n2018|Pingouin: statistics in Python|10.21105/joss.01026|362|55|Raphael Vallat|cbac8b0d82ea8e9251d5530695841d816cb196b9\n2020|Pymoo: Multi-Objective Optimization in Python|10.1109/ACCESS.2020.2990567|236|20|Julian Blank and K. Deb|61e27dbae190b82639c57f180ecf97e4c46fcad9\n2016|The Python ARM Radar Toolkit (Py-ART), a Library for Working with Weather Radar Data in the Python Programming Language|10.5334/JORS.119|181|14|Jonathan J. Helmus and S. Collis|49d96266eb10a539b120c2bac02cd4ad454bb089\n2019|Machine Learning Made Easy: A Review of Scikit-learn Package in Python Programming Language|10.3102/1076998619832248|82|6|J. Hao and T. Ho|a8fadb33a38f1096f84f64bd66345717a5bc3241\n2005|On the performance of the Python programming language for serial and parallel scientific computations|10.1155/2005/619804|81|1|Xing Cai and H. Langtangen and H. Moe|9f4c51b5bc52aaa33b3fb48857ecbfb0bcf3347d\n2013|Pygrass: An Object Oriented Python Application Programming Interface (API) for Geographic Resources Analysis Support System (GRASS) Geographic Information System (GIS)|10.3390/IJGI2010201|48|3|P. Zambelli and Sören Gebbert and M. Ciolli|4cb258581acc3e9821dab7fbac28d3c7b5e0d33c\n2020|DNA Features Viewer, a sequence annotations formatting and plotting library for Python|10.1101/2020.01.09.900589|45|1|Valentin Zulkower and S. Rosser|2539ed2a518f604511faa22716a936b21f715efd\n2016|User interfaces for computational science: A domain specific language for OOMMF embedded in Python|10.1063/1.4977225|39|2|M. Beg and R. Pepper and H. Fangohr|319b1d8a7fdb25fa0e8e6261d8b440303eaf120e\n2011|Programming language Python for data processing|10.1109/ICECENG.2011.6057428|28|1|Z. Dobesová|3b2574ca20143a380283d827f361f99de3d57b7e\n2016|Learning Scientific Programming with Python|10.1017/cbo9781139871754|25|0|Christian Hill|dd5059f388d500015f1d84a3a1bb7a5a0ced8c9f\n2013|Python to learn programming|10.1088/1742-6596/423/1/012027|21|1|A. Bogdanchikov and M. Zhaparov and R. Suliyev|33ff56972266b079cf0c76ed70e7d4b395ba7cab\n2018|Python Programming Language for Power System Analysis Education and Research|10.1109/TDC-LA.2018.8511780|21|2|Thiago R. Fernandes and Leonardo R. Fernandes and T. R. Ricciardi and Luis F. Ugarte and M. D. de Almeida|a5c0568085dbd68be3c889051a27981ed096e985\n2020|Converting 2D-Medical Image Files “DICOM” into 3D- Models, Based on Image Processing, and Analysing Their Results with Python Programming|10.37394/23205.2020.19.2|18|0|Rafeek Mamdouh and H. El-Bakry and A. Riad and Nashaat Elkhamisy|0d04472d639b5977d5ee3f06f87373a8832dc9e6\n2020|Topoly: Python package to analyze topology of polymers|10.1093/bib/bbaa196|17|0|P. Dabrowski-Tumanski and P. Rubach and W. Niemyska and B. Greń and J. I. Sulkowska|49097dc79099613a5057138be4146e853e8940d6\n2019|ML2SQL - Compiling a Declarative Machine Learning Language to SQL and Python|10.5441/002/edbt.2019.56|15|0|Maximilian E. Schüle and Matthias Bungeroth and Dimitri Vorona and A. Kemper and Stephan Günnemann and Thomas Neumann|d0a8f899cc206bcbc438b752b3e3667ef175b997\n2017|Implementation of vehicle detection algorithm for self-driving car on toll road cipularang using Python language|10.1109/ICEVT.2017.8323550|14|0|M. V. G. Aziz and H. Hindersah and A. S. Prihatmanto|c811d4b3d4c7a1d1ff9cdca8eec2110579898729\n2019|Boa Meets Python: A Boa Dataset of Data Science Software in Python Language|10.1109/MSR.2019.00086|13|1|Sumon Biswas and Md Johirul Islam and Yijia Huang and Hridesh Rajan|df3f507f3d46dece98a527999676b978af4ae987\n2008|Students' perceptions of python as a first programming language at wits|10.1145/1384271.1384407|11|0|I. Sanders and Sasha Langford|1857aa5c9463cc673839c765f0088663749674ad\n2006|Parallelizing PDE Solvers Using the Python Programming Language|10.1007/3-540-31619-1_9|11|0|Xing Cai and H. Langtangen|73af7fa141a3482b652c026b4868b166a6e9a064\n2020|Simple Visual-Aided Automated Titration Using the Python Programming Language|10.1021/acs.jchemed.9b00802|11|0|Song Wei Benjamin Tan and P. K. Naraharisetti and Siew Kian Chin and Lai Yeng Lee|93387a14fa9bdc092326d77e6dabf25e3e6a3ce2\n2017|Research on the improvement of python language programming course teaching methods based on visualization|10.1109/ICCSE.2017.8085571|10|0|Xiaoyan Kui and Weiguo Liu and Jiazhi Xia and Huakun Du|90757079d209870b3e881af763150b9614261cf4\n2018|It's Like Python But: Towards Supporting Transfer of Programming Language Knowledge|10.1109/VLHCC.2018.8506508|10|0|Nischal Shrestha and Titus Barik and Chris Parnin|1f3c99beff721ca21c61158862647662f349b103\n2005|Using the Python programming language for bioinformatics|10.1002/047001153X.G409314|9|1|M. Sanner|cae1431de64e6cb16452c7cb0fb83b836bc20b47\n2015|Which Programming Language Should Students Learn First? A Comparison of Java and Python|10.1109/LaTiCE.2015.15|9|0|Chieh-An Lo and Yu-Tzu Lin and Cheng-Chih Wu|f9e85681e331ab22bf55e92bab27b9b2726e4eb6\n2015|Python Programming for Biology: A beginners’ guide|10.1017/CBO9780511843556.003|8|0|T. Stevens and W. Boucher|0ef02287cecda2f9634f3612cb1d5f3f59094d9e\n2019|Scalable Parallel Programming in Python with Parsl|10.1145/3332186.3332231|8|0|Y. Babuji and A. Woodard and Zhuozhao Li and D. Katz and Ben Clifford and Ian T Foster and M. Wilde and K. Chard|b215861908a7dd5a0e9edc0ba4f3d59efdb6863c\n2019|Static Analyses in Python Programming Courses|10.1145/3287324.3287503|8|0|David Liu and A. Petersen|4263a39a1a90d843dd182483ba173b9f78b8a711\n2015|Is Python an Appropriate Programming Language for Teaching Programming in Secondary Schools?|10.1515/ijicte-2015-0005|8|1|Eva Mészárosová|d3231d487b138472a57be12699a2ddb8db666187\n2020|Analysis of Student Misconceptions using Python as an Introductory Programming Language|10.1145/3372356.3372360|8|0|Fionnuala Johnson and Stephen McQuistin and J. O'Donnell|69cc696d5609501347ffe491b279ee6c32be4c27\n2016|New implementation of OGC Web Processing Service in Python programming language. PyWPS-4 and issues we are facing with processing of large raster data using OGC WPS|10.5194/ISPRS-ARCHIVES-XLI-B7-927-2016|8|0|J. Cepicky and Luís Moreira de Sousa|e7beaf22b07976097bb8407de4b640664df21e4e\n2017|Computer programming with Python for industrial and systems engineers: Perspectives from an instructor and students|10.1002/cae.21837|7|0|Yong Wang and Kasey J. Hill and Erin C. Foley|1a5e834fc3549460b64cc413c63a6d3b9c07233a\n2018|CharmPy: A Python Parallel Programming Model|10.1109/CLUSTER.2018.00059|7|0|J. J. Galvez and K. Senthil and L. Kalé|25c5f91b8a22888ab43848da789ef7ea8d361f3f\n2015|Python Programming for Biology: Bioinformatics and Beyond|10.1017/cbo9780511843556|7|0|T. Stevens and W. Boucher|cede6c6ee0ad80759d25047b363c98d34290db41\n2014|PySy: a Python package for enhanced concurrent programming|10.1002/cpe.2981|6|0|Todd Williamson and R. Olsson|c533a666f816a4803bec727de7080d76ce811e93\n2020|Development of a Programming Course for Students of a Teacher Training Higher Education Institution Using the Programming Language Python|10.20511/PYR2020.V8N3.484|6|0|Mikhail S. Prokopyev and E. Vlasova and T. Tretyakova and M. A. Sorochinsky and Rimma Alekseyevna Solovyeva|a108642c864ee0bf46a80d53f309a61f17e97664\n2015|An Introduction to Python and Computer Programming|10.1007/978-981-287-609-6|5|1|Yue Zhang|75089958e2f34e5e536627b7ab309aa1b0ced814\n2010|Python Programming Fundamentals|10.1007/978-1-4471-6642-9|5|0|Kent D. Lee|5f086c30767069c2f3a69338121180b0db504220\n2015|Python as a First Programming Language for Biomedical Scientists|10.25080/MAJORA-7B98E3ED-002|5|1|B. Chapman and J. Irwin|3076af3155928a19242d87c0a0ff82204542cfc5\n2016|Python – A comprehensive yet free programming language for statisticians|10.1080/09720510.2015.1103446|5|0|X. U. Shukla and Dinesh J. Parmar|412310f67b2ff7a85ef9babbbeea478bcefc8cc8\n2014|TEACHING ALGORITHMIZATION AND PROGRAMMING USING PYTHON LANGUAGE|10.14308/ite000493|4|0|Lvov M. and K. V.|22c6d35f122ebb71d84eb923ec8b4f601e9b7f87\n2019|Neural Network Programming in Python|10.35940/ijitee.f1075.0486s419|4|0||5a61e58eb7bd9823d3fd46b6a62b9f5532fb7961\n2021|An Empirical Study for Common Language Features Used in Python Projects|10.1109/SANER50967.2021.00012|4|1|Yun Peng and Yu Zhang and Mingzhe Hu|ecdc0e16b9212657a80a92e3f32177c9801ad38d\n2020|Python as Multi Paradigm Programming Language|10.5120/ijca2020919775|4|0|Nimit Thaker and Abhilash Shukla|d14fe76d02ecd92ec2a9f9d8c68380e368df761f\n2018|Board Games in the Computer Science Class to Improve Students’ Knowledge of the Python Programming Language|10.1109/ICONIC.2018.8601207|4|0|D. Jordaan|a1789d56cc0b8c02c62523a1de4e9781ffb14191\n2016|The Core Python Language I|10.1017/CBO9781139871754.002|3|0|Christian Hill|1e843d30863753566df0bf4da1d07b8dd7074916\n2019|Application of python programming language in measurements|10.2298/FUEE1901001P|3|0|P. Pejovic|9d6fef95807c0caf7da9c58d309bf77010a66c40\n2019|An Analysis on Python Programming Language Demand and Its Recent Trend in Bangladesh|10.1145/3373509.3373540|3|0|Aaquib Javed and Monika Zaman and Mohammad Monir Uddin and Tasnova Nusrat|82f771befdb6a7d06abb4496cd6b4fb08bef6eb7" }, "pytorch": { "title": "PyTorch", "appeared": 2016, "type": "library", "creators": [ "Ronan Collobert" ], "website": "http://pytorch.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/pytorch" ], "domainName": { "registered": 2016, "awisRank": { "2022": 2871 }, "name": "pytorch.org" }, "githubRepo": { "firstCommit": 2012, "stars": 57068, "forks": 15871, "subscribers": 1601, "created": 2016, "updated": 2022, "description": "Tensors and Dynamic neural networks in Python with strong GPU acceleration", "issues": 9789, "url": "https://github.com/pytorch/pytorch" }, "wikipedia": { "related": [ "python", "cuda", "linux", "numpy" ], "summary": "PyTorch is an open-source machine learning library for Python, based on Torch, used for applications such as natural language processing. It is primarily developed by Facebook's artificial-intelligence research group, and Uber's \"Pyro\" software for probabilistic programming is built on it.PyTorch provides two high-level features: Tensor computation (like NumPy) with strong GPU acceleration Deep Neural Networks built on a tape-based autodiff system", "created": 2017, "backlinksCount": 41, "pageId": 54022970, "dailyPageViews": 594, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/PyTorch" }, "subreddit": [ { "url": "https://www.reddit.com/r/pytorch/" } ], "twitter": "https://twitter.com/pytorch", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "q-equational-programming-language": { "title": "Q", "appeared": 1991, "type": "pl", "creators": [ "Albert Gräf" ], "website": "https://q-lang.sourceforge.net", "country": [ "Germany" ], "originCommunity": [ "https://sourceforge.net/p/q-lang/_list/tickets" ], "wikipedia": { "example": [ "extern int puts(char*);\n hello = puts \"Hello, world!\";\n hello;" ], "related": [ "freebsd", "linux", "haskell", "lisp", "alice", "matlab", "llvmir", "c", "miranda", "puredata", "octave", "opengl", "faust", "supercollider" ], "summary": "Pure, successor to the equational language Q, is a dynamically typed, functional programming language based on term rewriting. It has facilities for user-defined operator syntax, macros, arbitrary-precision arithmetic (multiple-precision numbers), and compiling to native code through the LLVM. Pure is free and open-source software distributed (mostly) under the GNU Lesser General Public License version 3 or later. Pure comes with an interpreter and debugger, provides automatic memory management, has powerful functional and symbolic programming abilities, and interfaces to libraries in C (e.g., for numerics, low-level protocols, and other such tasks). At the same time, Pure is a small language designed from scratch; its interpreter is not large, and the library modules are written in Pure. The syntax of Pure resembles that of Miranda and Haskell, but it is a free-format language and thus uses explicit delimiters (rather than off-side rule indents) to denote program structure. The Pure language is a successor of the equational programming language Q, previously created by the same author, Albert Gräf at the University of Mainz, Germany. Relative to Q, it offers some important new features (such as local functions with lexical scoping, efficient vector and matrix support, and the built-in C interface) and programs run much faster as they are compiled just-in-time to native code on the fly. Pure is mostly aimed at mathematical applications and scientific computing currently, but its interactive interpreter environment, the C interface and the growing set of addon modules make it suitable for a variety of other applications, such as artificial intelligence, symbolic computation, and real-time multimedia processing. Pure plug-ins are available for the Gnumeric spreadsheet and Miller Puckette's Pure Data graphical multimedia software, which make it possible to extend these programs with functions written in the Pure language. Interfaces are also provided as library modules to GNU Octave, OpenCV, OpenGL, the GNU Scientific Library, FAUST, SuperCollider, and liblo (for Open Sound Control (OSC)).", "created": 2003, "backlinksCount": 34, "pageId": 20446791, "revisionCount": 77, "dailyPageViews": 8, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Q_(equational_programming_language)" }, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|CreateSpace Independent Publishing Platform|Q For Mortals: A Tutorial In Q Programming|Borror, Jeffry A.|9781434829016", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Static Type Inference for the Q language using Constraint Logic Programming|10.4230/LIPIcs.ICLP.2012.119|4|0|Zsolt Zombori and J. Csorba and P. Szeredi|416a54053b15552edd56b98f688135cb92061b9e\n2019|Programming quantum computers: a primer with IBM Q and D-Wave exercises|10.1145/3293883.3302578|3|0|F. Mueller and Greg Byrd and P. Dreher|4e8508575d95a7262084d73b61ecdf2c3691437d" }, "q-gert": { "title": "Q-GERT", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/39abe9aa531e0a87801b318172c84579e6353db2" ], "country": [ "United States" ], "originCommunity": [ "Virginia Polytechnic Institute and State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7433", "centralPackageRepositoryCount": 0 }, "q-sharp": { "title": "Q#", "appeared": 2017, "type": "pl", "website": "https://docs.microsoft.com/en-us/quantum/quantum-qr-intro?view=qsharp-preview", "aka": [ "qsharp" ], "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "namespace", "open", "as", "operation", "function", "body", "adjoint", "newtype", "controlled", "if", "elif", "else", "repeat", "until", "fixup", "for", "in", "while", "return", "fail", "within", "apply", "Adjoint", "Controlled", "Adj", "Ctl", "is", "self", "auto", "distribute", "invert", "intrinsic", "let", "set", "w/", "new", "not", "and", "or", "use", "borrow", "using", "borrowing", "mutable" ], "githubLanguage": { "type": "programming", "fileExtensions": [ "qs" ], "aceMode": "text", "tmScope": "source.qsharp", "aliases": [ "qsharp" ], "repos": 768, "id": "Q#" }, "githubBigQuery": { "repos": 4, "users": 4, "id": "Q#" }, "monaco": "qsharp", "leachim6": { "filepath": "q/QSharp.qs", "fileExtensions": [ "qs" ], "example": [ "namespace Quantum.HelloWorld {\n open Microsoft.Quantum.Canon;\n open Microsoft.Quantum.Intrinsic;\n\n\n operation HelloWorld() : Unit {\n Message(\"Hello World\");\n }\n}\n" ], "id": "QSharp" }, "rijuRepl": { "example": [ "namespace main {\n\n open Microsoft.Quantum.Canon;\n open Microsoft.Quantum.Intrinsic;\n\n @EntryPoint()\n operation Main() : Unit {\n Message(\"Hello, world!\");\n }\n}\n" ], "id": "https://riju.codes/qsharp" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "q": { "title": "Q", "appeared": 2003, "type": "pl", "creators": [ "Arthur Whitney" ], "originCommunity": [ "Kx Systems" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "q)select from t where name like \"ja*\",age>50\nname age\n--------\njack 60\n\nq)select rows:count i by age from t\nage| rows\n---| ----\n20 | 1\n50 | 2\n60 | 1" ], "related": [ "q-equational-programming-language", "scheme", "k", "apl", "sql" ], "summary": "Q is a proprietary array processing language developed by Arthur Whitney and commercialized by Kx Systems. The language serves as the query language for kdb+, a disk based and in-memory, column-based database. kdb+ is based upon K, a terse variant of APL. Q is a thin wrapper around K, providing a more readable, English-like interface.", "pageId": 18595067, "dailyPageViews": 99, "created": 2008, "backlinksCount": 23, "revisionCount": 91, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Q_(programming_language_from_Kx_Systems)" }, "githubLanguage": { "fileExtensions": [ "q" ], "type": "programming", "aceMode": "text", "tmScope": "source.q", "repos": 768, "id": "q" }, "githubBigQuery": { "repos": 170, "users": 157, "id": "q" }, "codeMirror": "q", "pygmentsHighlighter": { "filename": "q.py", "fileExtensions": [ "q" ], "id": "Q" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 7, "commitCount": 73, "sampleCount": 2, "example": [ "dst:`:tq\nsrc:`:tqsrc\nF:key src\n\n/ trade fields (types;widths) trf after 200609\ntf:`time`ex`sym`s`cond`size`price`stop`corr`seq`cts`trf\ntt:(\"TCSS*IFBIJCC \";9 1 6 10 4 9 11 1 2 16 1 1,1+20060930<\"I\"$-8#string first F)\n\n/ quote fields (types;widths)\nqf:`time`ex`sym`s`bid`bsize`ask`asize`cond`mmid`bex`aex`seq`bbo`qbbo`corr`cqs\nqt:(\"TCSSFIFIC*CCJCCCC \";9 1 6 10 11 7 11 7 1 4 1 1 16 1 1 1 1 2)\n\n/ sym[.s] \"e\"$pricebidask \ng:{[f;x]`sym`time xcols delete s from @[;`sym;{$[null y;x;` sv x,y]}';x`s]@[x;f;\"e\"$%;1e4]}\nfoo:{[d;f;t;g;x]@[;`sym;`p#].Q.dsftg[(dst;\"D\"$-8#string x;d);(` sv src,x;sum t 1;0);f;t;g]}\n\n\\t foo[`trade;tf;tt;g[`price] ]each F where F like\"taqtrade*[0-9]\";\n\\t foo[`quote;qf;qt;g[`bid`ask]]each F where F like\"taqquote*[0-9]\";\n\n\\\nhttp://www.nyxdata.com/Data-Products/Daily-TAQ\n" ], "url": "https://github.com/komsit37/sublime-q" }, "projectEuler": { "memberCount": { "2019": 132, "2022": 152 }, "id": "Q" }, "helloWorldCollection": [ "/* Hello world in Q */\n\nhello = writes \"Hello, world!\\n\";" ], "leachim6": { "filepath": "q/Q.q", "fileExtensions": [ "q" ], "example": [ "\"Hello World\"\n" ], "id": "Q" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Q", "tiobe": { "id": "Q" }, "jupyterKernel": [ "https://github.com/jvictorchen/IKdbQ", "https://github.com/newtux/KdbQ_kernel" ], "fileType": "text", "wordRank": 559, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|CreateSpace Independent Publishing Platform|Q For Mortals: A Tutorial In Q Programming|Borror, Jeffry A.|9781434829016", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Static Type Inference for the Q language using Constraint Logic Programming|10.4230/LIPIcs.ICLP.2012.119|4|0|Zsolt Zombori and J. Csorba and P. Szeredi|416a54053b15552edd56b98f688135cb92061b9e\n2019|Programming quantum computers: a primer with IBM Q and D-Wave exercises|10.1145/3293883.3302578|3|0|F. Mueller and Greg Byrd and P. Dreher|4e8508575d95a7262084d73b61ecdf2c3691437d" }, "qa4": { "title": "QA4", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/854ae442f80f0438f10d3df929c15fd7ff9f3f85" ], "country": [ "United State" ], "originCommunity": [ "Stanford Research Institute" ], "hopl": "https://hopl.info/showlanguage.prx?exp=345", "centralPackageRepositoryCount": 0 }, "qalb": { "title": "Qalb", "appeared": 2012, "type": "pl", "creators": [ "Ramsey Nasser" ], "website": "http://qlb-repl.herokuapp.com/", "country": [ "United States" ], "nativeLanguage": "Arabic", "originCommunity": [ "https://github.com/nasser/---/issues" ], "domainName": { "name": "qlb-repl.herokuapp.com" }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 667, "forks": 78, "subscribers": 48, "created": 2012, "updated": 2022, "firstCommit": 2012, "description": "قلب: لغة برمجة", "issues": 4, "url": "https://github.com/nasser/---" }, "repoStats": { "firstCommit": 2012, "commits": 114, "committers": 3, "files": 36 }, "wikipedia": { "related": [ "scheme", "lisp" ], "summary": "قلب (Levantine Arabic: [ʔalb]), transliterated Qalb, Qlb and Alb, is a functional programming language allowing a programmer to write programs completely in Arabic. Its name means heart and is a recursive acronym in Arabic meaning Qlb: a programming language (قلب: لغة برمجة, Qlb: Lughat Barmajah). It was developed in 2012 by Ramsey Nasser, a computer scientist at the Eyebeam Art + Technology Center in New York City, as both an artistic endeavor and as a response to the Anglophone bias in the vast majority of programming languages, which express their fundamental concepts using English words. The syntax is like that of Lisp or Scheme, consisting of parenthesized lists. All keywords are appropriate Arabic terms, and program text is laid out right-to-left, like all Arabic text. The language provides a minimal set of primitives for defining functions, conditionals, looping, list manipulation, and basic arithmetic expressions. It is Turing-complete, and the Fibonacci sequence and Conway's Game of Life have been implemented. Because all program text is written in Arabic, and the connecting strokes between characters in the Arabic script can be extended to any length, it is possible to align the source code in artistic patterns, in the tradition of Arabic calligraphy. A JavaScript-based interpreter is currently hosted on herokuapp and the project can be forked on GitHub.", "pageId": 38441485, "dailyPageViews": 20, "created": 2013, "backlinksCount": 5, "revisionCount": 35, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Qalb_(programming_language)" }, "leachim6": { "filepath": "q/Qalb", "example": [ "(قول \"Hello World\")\n" ], "id": "Qalb" }, "rijuRepl": { "example": [ "(قول \"مرحبا يا عالم\")\n" ], "id": "https://riju.codes/qalb" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "qas": { "title": "QAS", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1978bd5c4f806c4fbec9ca6e456d5b2f8d16526c" ], "country": [ "United States" ], "originCommunity": [ "Georgia Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7121", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "qb64": { "title": "QB64", "appeared": 2007, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://qb64.boards.net" ], "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "'" ] ], "wikipedia": { "example": [ "t1 = _FREETIMER\nt2 = _FREETIMER\nON TIMER(t1, 1) GOSUB Timer.Trap 'the code following the Timer.Trap label will be run every 1 second\n\nON TIMER(t2, .5) mySub 'QB64 can also trigger a SUB procedure with TIMER;\n' in this case mySUB will be triggered every 500 milliseconds\n\n'activate timers:\nTIMER(t1) ON\nTIMER(t2) ON\n\nDO 'go into an infinite loop until the window is closed\n _LIMIT 1 'run the main loop at 1 cycle per second, to show how timers are independent from main program flow\nLOOP\n\nTimer.Trap:\nPRINT \"1s; \";\nRETURN\n\nSUB mySub\n PRINT \"500ms; \";\nEND SUB" ], "related": [ "linux", "quickbasic", "basic", "qbasic" ], "summary": "QB64 (originally QB32) is a self-hosting BASIC compiler for Microsoft Windows, Linux and Mac OS X, designed to be compatible with Microsoft QBasic and QuickBASIC. QB64 is a C++ emitter, which is integrated with a C++ compiler to provide compilation via C++ code and GCC optimization.QB64 implements most QBasic statements, and can run many QBasic programs, including Microsoft's QBasic Gorillas and Nibbles games. Furthermore, QB64 has been designed to contain an IDE resembling the QBASIC IDE. QB64 also extends the QBASIC programming language to include 64-bit data types, as well as better sound and graphics support. It can also emulate some DOS/x86 specific features such as INT 33h mouse access, and multiple timers.", "created": 2008, "backlinksCount": 102, "pageId": 18410776, "revisionCount": 233, "dailyPageViews": 90, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/QB64" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "qbasic": { "title": "QBasic", "appeared": 1991, "type": "pl", "documentation": [ "https://hwiegman.home.xs4all.nl/qbasic3.html" ], "standsFor": "Quick Beginners All purpose Symbolic Instruction Code", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "PRINT" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "ACCESS", "ALIAS", "ANY", "APPEND", "AS", "BASE", "BINARY", "BYVAL", "CASE", "CDECL", "DOUBLE", "ELSE", "ELSEIF", "ENDIF", "INTEGER", "IS", "LIST", "LOCAL", "LONG", "LOOP", "MOD", "NEXT", "OFF", "ON", "OUTPUT", "RANDOM", "SIGNAL", "SINGLE", "STEP", "STRING", "THEN", "TO", "UNTIL", "USING", "WEND" ], "wikipedia": { "related": [ "quickbasic", "gw-basic", "qb64", "microsoft-small-basic", "linux", "freebsd" ], "summary": "QBasic (Quick Beginners All purpose Symbolic Instruction Code) is an IDE and interpreter for a variety of the BASIC programming language which is based on QuickBASIC. Code entered into the IDE is compiled to an intermediate representation, and this IR is immediately interpreted on demand within the IDE. It can run under nearly all versions of DOS and 32-bit versions of Windows, or through emulation via DOSBox/DOSEMU on Linux, FreeBSD, and 64-bit versions of Windows. (QBasic is a DOS program and requires DOS or a DOS emulator. Windows XP comes with an emulator called DOS Virtual Machine, subsequent versions of Windows require an emulator such as DosBox.) For its time, QBasic provided a state-of-the-art IDE, including a debugger with features such as on-the-fly expression evaluation and code modification. It supports various inbuilt functions. Like QuickBASIC, but unlike earlier versions of Microsoft BASIC, QBasic is a structured programming language, supporting constructs such as subroutines and while loops. Line numbers, a concept often associated with BASIC, are supported for compatibility, but are not considered good form, having been replaced by descriptive line labels. QBasic has limited support for user-defined data types (structures), and several primitive types used to contain strings of text or numeric data.", "pageId": 23712097, "dailyPageViews": 378, "created": 2001, "backlinksCount": 385, "revisionCount": 921, "appeared": 1991, "url": "https://en.wikipedia.org/wiki/QBasic" }, "pygmentsHighlighter": { "filename": "basic.py", "fileExtensions": [ "BAS", "bas" ], "id": "QBasic" }, "leachim6": { "filepath": "q/QBasic.bas", "fileExtensions": [ "bas" ], "example": [ "\nPRINT \"Hello World\"\n" ], "id": "QBasic" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:QBasic", "replit": "https://repl.it/languages/qbasic", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nQBASIC Programming for Dummies|1994|Douglas Hergert|223808|4.33|6|1\nQBASIC Programming|1991|Peter Norton|2177275|4.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n1993|Que Publishing|QBasic By Example, Special Edition|Que Publishing|9781565294394\n1995|Irwin Professional Publishing|Quickbasic and Qbasic Using Modular Structure Alternate Edition With Visual Basic|Bradley, Julia Case|9780256207972\n1998|Prentice Hall|QBASIC with an Introduction to Visual BASIC 5.0 (4th Edition)|Schneider, David I.|9780139738760\n1994|Harpercollins College Div|Structured Programming With Microsoft Qbasic|Larry Joel Goldstein|9780065018387\n1994|Que Pub|Qbasic by Example (Programming Series)|Perry, Greg M.|9781565294547\n1994|For Dummies|QBasic Programming for Dummies|Hergert, Douglas|9781568840932\n2009-12-15T00:00:01Z|lulu.com|A course in programming with QBASIC|Hawken, Tony|9781445240695\n1991|Que Pub|Using Qbasic|Feldman, Phil and Rugg, Tom|9780880227131\n1994|Dellen Pub Co|A Brief Course in QBASIC with An Introduction to Visual BASIC (2nd Edition)|Schneider, David I.|9780024077417\n1995|Harpercollins College Div|Fundamentals of Qbasic Programming: Problem Solving and Application Development|Nickerson, Robert C.|9780673993786\n1994-06-01T00:00:01Z|Boyd & Fraser Pub Co|Complete Computer Concepts and Programming in Microsoft Qbasic (Shelly Cashman Series)|Shelly, Gary B. and Cashman, Thomas J. and Waggoner, Gloria A.|9780877096559\n1993|Que|Crash course in QBasic (Programming series)|Perry, Greg M.|9781565291652\n1991|Sams|Qbasic Programming|David I. Schneider|9780136587668\n1993|Sams|Qbasic Programming 101|Perry and Greg|9780672302817\n1994|Diane Pub Co|Qbasic Programming For Dummies|Douglas Hergert|9780788156724\n1994|Mis Pr|Teach Yourself Qbasic|Chuck Butkus|9781558283411\n1992|Que|Qbasic By Example|Greg M. Perry|9780880228114\n1993/02/25|Longman|QBASIC Programming: Structured Applications|Robert C. Nickerson|9780065013450\n1994|Que Pub|Easy Programming With Qbasic|Tory Stephen Toupin|9781565299955\n1993|West Pub. Co|Introduction To Programming In Qbasic|Susan K Baumann|9780314025371\n1996|Cengage Learning|Qbasic An Introduction To Programming|Gary B. Shelly and Thomas J. Cashman and Kevin M. Gleason|9780789503848\n1993|Harpercollins College Div|Structured Programming With Microsoft Qbasic|Larry Joel Goldstein|9780065018394\n1991|Brady|Qbasic Programming (peter Norton Programming Series)|David I. Schneider|9780136630227\n1999|Prentice Hall|Programming In Qbasic For Engineering Technology|Kenneth Craven|9780136227489\n1997|Hello World Pub|Hello Program Design: Introduction To Programming With Qbasic & Flowcharts|Janet E. Joy|9780964816046\n1993|Business One Irwin Computer|Ibm Pc And Compatibles: An Introduction To The Operating System, Qbasic Programming, And Applications|Larry Joel Goldstein|9781556239069", "semanticScholar": "" }, "qbe": { "title": "qbe", "appeared": 2015, "type": "pl", "description": "QBE aims to be a pure C embeddable backend that provides 70% of the performance of advanced compilers in 10% of the code. Its small size serves both its aspirations of correctness and our ability to understand, fix, and improve it. It also serves its users by providing trivial integration and great flexibility.", "website": "https://c9x.me/compile/", "country": [ "Unknown" ], "originCommunity": [ "https://lists.sr.ht/~mpu/qbe" ], "isbndb": "" }, "qcl": { "title": "QCL", "appeared": 2005, "type": "pl", "reference": [ "https://github.com/aviggiano/qcl" ], "country": [ "Austria" ], "originCommunity": [ "Technischen Universität Wien" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "leachim6": { "filepath": "q/QCL.qcl", "fileExtensions": [ "qcl" ], "example": [ "print \"Hello World\";\n" ], "id": "QCL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8263", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "qed-editor": { "title": "QED", "appeared": 1967, "type": "editor", "creators": [ "Butler Lampson", "L. Peter Deutsch", "Dana Angluin" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/QED_(text_editor)" } }, "qed-lang": { "title": "qed-lang", "appeared": 2015, "type": "pl", "website": "https://qed-lang.org", "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "domainName": { "name": "qed-lang.org" }, "example": [ "void Button(string text) {\n int col = 0xC0C0C0; @out(\" \" + text + \" \")\n} @out(rect()) @bgcol(col) @onpress(col = 0x808080) @onrelease([col = 0xC0C0C0, return()])\nButton(\"Form 1\");\nprintln(\"Form 1 clicked\");\nButton(\"Form 2\");\nprintln(\"Form 2 clicked\");\nButton(\"Quit\");\nreturn(0);" ], "twitter": "https://twitter.com/qedlang" }, "qfx": { "title": "QFX file format", "appeared": 1997, "type": "textDataFormat", "country": [ "United States" ], "originCommunity": [ "Intuit Inc" ], "related": [ "ofx" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/QFX_(file_format)" } }, "qif": { "title": "Quicken Interchange Format", "appeared": 2000, "type": "textDataFormat", "standsFor": "Quicken Interchange Format", "country": [ "United States" ], "originCommunity": [ "Intuit Inc" ], "wikipedia": { "summary": "Quicken Interchange Format (QIF) is an open specification for reading and writing financial data to media (i.e. files).", "backlinksCount": 78, "pageId": 463123, "dailyPageViews": 89, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Quicken_Interchange_Format" } }, "qlisp": { "title": "QLISP", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/34c3e2530d7543a7acce3053617f00bc195a24e5" ], "country": [ "United States" ], "originCommunity": [ "Lucid, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1426", "centralPackageRepositoryCount": 0 }, "qmake": { "title": "QMake", "appeared": 2002, "type": "pl", "reference": [ "http://doc.qt.io/archives/qt-4.8/qmake-tutorial.html" ], "country": [ "Finland" ], "originCommunity": [ "Qt Group plc" ], "example": [ "CONFIG += qt debug\nHEADERS += hello.h\nSOURCES += hello.cpp\nSOURCES += main.cpp\nwin32 {\n SOURCES += hellowin.cpp\n}\nunix {\n SOURCES += hellounix.cpp\n}\n!exists( main.cpp ) {\n error( \"No main.cpp file found\" )\n}\nwin32:debug {\n CONFIG += console\n}" ], "wikipedia": { "related": [ "linux", "freebsd", "makefile", "qt", "cmake" ], "summary": "qmake is an utility that automates the generation of makefiles. Makefiles are used by the program make to build executable programs from source code; therefore qmake is a make-makefile tool, or makemake for short. The makefiles that qmake produces are tailored to the particular platform where it is run from based on qmake project files. This way one set of build instructions can be used to create build instructions on different operating systems. qmake supports code generation for the following operating systems: Linux, Apple Mac OS X, Symbian, Microsoft Windows and Microsoft Windows CE. qmake was created by Trolltech (now The Qt Company). It is distributed and integrated with the Qt application framework, and automates the creation of moc (meta object compiler) and rcc (resource compiler) sources, which are used in Qt's meta-object system and in the integration of binary resources (e.g., pictures). The qmake tool helps simplify the build process for development projects across different platforms. It automates the generation of Makefiles so that only a few lines of information are needed to create each Makefile. You can use qmake for any software project, whether it is written with Qt or not.", "backlinksCount": 57, "pageId": 10962771, "created": 2007, "revisionCount": 48, "dailyPageViews": 31, "url": "https://en.wikipedia.org/wiki/Qmake" }, "githubLanguage": { "fileExtensions": [ "pro", "pri" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "qmake" ], "aceMode": "text", "tmScope": "source.qmake", "repos": 3624, "id": "QMake" }, "githubBigQuery": { "repos": 17519, "users": 13539, "id": "QMake" }, "linguistGrammarRepo": { "sampleCount": 4, "example": [ "#!/usr/bin/qmake\nmessage(This is QMake.)\n" ], "url": "https://github.com/textmate/cpp-qt.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "qml": { "title": "QML", "appeared": 2009, "type": "pl", "website": "http://qt-project.org/doc/qt-5/qmlapplications.html", "documentation": [ "https://doc.qt.io/qt-6/qtqml-documents-topic.html" ], "standsFor": "Qt Modeling Language", "country": [ "Finland" ], "originCommunity": [ "Qt Group plc" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasHexadecimals": { "example": "// 0x[0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "// [0-9][0-9]*\\.[0-9]+([eE][0-9]+)?[fd]?", "value": true }, "hasIntegers": { "example": "// [0-9]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "Item {\n Rectangle {\n id: myRect\n width: 120\n height: 100\n }\n Rectangle {\n width: myRect.width\n height: 200\n }\n}" ], "wikipedia": { "example": [ "MouseArea {\n onPressed: console.log(\"mouse button pressed\")\n }" ], "related": [ "json", "javascript", "ring" ], "summary": "QML (Qt Modeling Language) is a user interface markup language. It is a declarative language (similar to CSS and JSON) for designing user interface–centric applications. Inline JavaScript code handles imperative aspects. It is associated with Qt Quick, the UI creation kit originally developed by Nokia within the Qt framework. Qt Quick is often used for mobile applications where touch input, fluid animations (60 FPS) and user experience are crucial. QML is also used with Qt3D to describe a 3D scene and a \"frame graph\" rendering methodology. A QML document describes a hierarchical object tree. QML modules shipped with Qt include primitive graphical building blocks (e.g., Rectangle, Image), modeling components (e.g., FolderListModel, XmlListModel), behavioral components (e.g., TapHandler, DragHandler, State, Transition, Animation), and more complex controls (e.g., Button, Slider, Drawer, Menu). These elements can be combined to build components ranging in complexity from simple buttons and sliders, to complete internet-enabled programs. QML elements can be augmented by standard JavaScript both inline and via included .js files. Elements can also be seamlessly integrated and extended by C++ components using the Qt framework. QML is the language; its JavaScript runtime is the custom V4 engine, since Qt 5.2; and Qt Quick is the 2D scene graph and the UI framework based on it. These are all part of the Qt Declarative module, while the technology is no longer called Qt Declarative. QML and JavaScript code can be compiled into native C++ binaries with the Qt Quick Compiler. Alternatively there is a QML cache file format which stores a compiled version of QML dynamically for faster startup the next time it is run.", "pageId": 28116392, "created": 2010, "backlinksCount": 114, "revisionCount": 213, "dailyPageViews": 182, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/QML" }, "githubLanguage": { "fileExtensions": [ "qml", "qbs" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nSwordfish90 cool-retro-term https://github.com/Swordfish90.png https://github.com/Swordfish90/cool-retro-term QML #44a51c 11081 489 197 \"A good looking terminal emulator which mimics the old cathode display...\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "tmScope": "source.qml", "repos": 14755, "id": "QML" }, "githubBigQuery": { "repos": 5249, "users": 4140, "id": "QML" }, "pygmentsHighlighter": { "filename": "webmisc.py", "fileExtensions": [ "qml", "qbs" ], "id": "QML" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2014, "committerCount": 1, "commitCount": 9, "sampleCount": 1, "example": [ "/****************************************************************************\n**\n** Copyright (C) 2015 The Qt Company Ltd.\n** Contact: http://www.qt.io/licensing\n**\n** This file is part of the Qt Build Suite.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and The Qt Company. For licensing terms and\n** conditions see http://www.qt.io/terms-conditions. For further information\n** use the contact form at http://www.qt.io/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file. Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https://www.gnu.org/licenses/lgpl.html and\n** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.\n**\n** In addition, as a special exception, The Qt Company gives you certain additional\n** rights. These rights are described in The Qt Company LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************/\n\nimport qbs 1.0\nimport qbs.FileInfo\nimport qbs.ModUtils\n\nModule {\n property string buildVariant: \"debug\"\n property bool enableDebugCode: buildVariant == \"debug\"\n property bool debugInformation: (buildVariant == \"debug\")\n property string optimization: (buildVariant == \"debug\" ? \"none\" : \"fast\")\n readonly property stringList hostOS: undefined // set internally\n property string hostOSVersion: {\n if (hostOS && hostOS.contains(\"osx\")) {\n return getNativeSetting(\"/System/Library/CoreServices/ServerVersion.plist\", \"ProductVersion\") ||\n getNativeSetting(\"/System/Library/CoreServices/SystemVersion.plist\", \"ProductVersion\");\n } else if (hostOS && hostOS.contains(\"windows\")) {\n var version = getNativeSetting(\"HKEY_LOCAL_MACHINE\\\\Software\\\\Microsoft\\\\Windows NT\\\\CurrentVersion\", \"CurrentVersion\");\n return version + \".\" + hostOSBuildVersion;\n }\n }\n\n property string hostOSBuildVersion: {\n if (hostOS.contains(\"osx\")) {\n return getNativeSetting(\"/System/Library/CoreServices/ServerVersion.plist\", \"ProductBuildVersion\") ||\n getNativeSetting(\"/System/Library/CoreServices/SystemVersion.plist\", \"ProductBuildVersion\");\n } else if (hostOS.contains(\"windows\")) {\n return getNativeSetting(\"HKEY_LOCAL_MACHINE\\\\Software\\\\Microsoft\\\\Windows NT\\\\CurrentVersion\", \"CurrentBuildNumber\");\n }\n }\n\n readonly property var hostOSVersionParts: hostOSVersion ? hostOSVersion.split('.').map(function(item) { return parseInt(item, 10); }) : []\n readonly property int hostOSVersionMajor: hostOSVersionParts[0] || 0\n readonly property int hostOSVersionMinor: hostOSVersionParts[1] || 0\n readonly property int hostOSVersionPatch: hostOSVersionParts[2] || 0\n\n property stringList targetOS: hostOS\n property string pathListSeparator: hostOS.contains(\"windows\") ? \";\" : \":\"\n property string pathSeparator: hostOS.contains(\"windows\") ? \"\\\\\" : \"/\"\n property string profile\n property stringList toolchain\n property string architecture\n property bool install: false\n property string installSourceBase\n readonly property string installRoot: undefined\n property string installDir\n property string installPrefix: \"\"\n property path sysroot\n\n PropertyOptions {\n name: \"buildVariant\"\n allowedValues: ['debug', 'release']\n description: \"name of the build variant\"\n }\n\n PropertyOptions {\n name: \"optimization\"\n allowedValues: ['none', 'fast', 'small']\n description: \"optimization level\"\n }\n\n validate: {\n var validator = new ModUtils.PropertyValidator(\"qbs\");\n validator.setRequiredProperty(\"architecture\", architecture,\n \"you might want to re-run 'qbs-setup-toolchains'\");\n validator.setRequiredProperty(\"hostOS\", hostOS);\n validator.setRequiredProperty(\"targetOS\", targetOS);\n if (hostOS && (hostOS.contains(\"windows\") || hostOS.contains(\"osx\"))) {\n validator.setRequiredProperty(\"hostOSVersion\", hostOSVersion,\n \"could not detect host operating system version; \" +\n \"verify that system files and registry keys have not \" +\n \"been modified.\");\n if (hostOSVersion)\n validator.addVersionValidator(\"hostOSVersion\", hostOSVersion, 2, 4);\n\n validator.setRequiredProperty(\"hostOSBuildVersion\", hostOSBuildVersion,\n \"could not detect host operating system build version; \" +\n \"verify that system files or registry have not been \" +\n \"tampered with.\");\n }\n\n validator.addCustomValidator(\"architecture\", architecture, function (value) {\n return architecture === canonicalArchitecture(architecture);\n }, \"'\" + architecture + \"' is invalid. You must use the canonical name '\" +\n canonicalArchitecture(architecture) + \"'\");\n\n validator.validate();\n }\n\n // private properties\n property var commonRunEnvironment: {\n var env = {};\n if (targetOS.contains(\"windows\")) {\n env[\"PATH\"] = [\n FileInfo.joinPaths(installRoot, installPrefix)\n ];\n } else if (hostOS.contains(\"darwin\") && targetOS.contains(\"darwin\")) {\n env[\"DYLD_FRAMEWORK_PATH\"] = [\n FileInfo.joinPaths(installRoot, installPrefix, \"Library\", \"Frameworks\"),\n FileInfo.joinPaths(installRoot, installPrefix, \"lib\"),\n FileInfo.joinPaths(installRoot, installPrefix)\n ].join(pathListSeparator);\n\n env[\"DYLD_LIBRARY_PATH\"] = [\n FileInfo.joinPaths(installRoot, installPrefix, \"lib\"),\n FileInfo.joinPaths(installRoot, installPrefix, \"Library\", \"Frameworks\"),\n FileInfo.joinPaths(installRoot, installPrefix)\n ].join(pathListSeparator);\n\n if (targetOS.contains(\"ios-simulator\") && sysroot) {\n env[\"DYLD_ROOT_PATH\"] = [sysroot];\n }\n } else if (hostOS.contains(\"unix\") && targetOS.contains(\"unix\")) {\n env[\"LD_LIBRARY_PATH\"] = [\n FileInfo.joinPaths(installRoot, installPrefix, \"lib\")\n ];\n }\n\n return env;\n }\n\n // internal properties\n readonly property string version: [versionMajor, versionMinor, versionPatch].join(\".\")\n readonly property int versionMajor: undefined // set internally\n readonly property int versionMinor: undefined // set internally\n readonly property int versionPatch: undefined // set internally\n}\n" ], "url": "https://github.com/skozlovf/Sublime-QML" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "qoir": { "title": "QOIR", "appeared": 2022, "type": "binaryDataFormat", "creators": [ "Nigel Tao" ], "description": "A Fast, Simple, Lossless Image File Format based on QOI ( http://qoiformat.org )", "website": "https://nigeltao.github.io", "documentation": [ "https://github.com/nigeltao/qoir#readme" ], "reference": [ "https://nigeltao.github.io/blog/2022/qoir.html" ], "fileExtensions": [ "qoir" ], "country": [ "Australia" ], "originCommunity": [ "https://github.com/nigeltao/qoir/issues" ], "domainName": { "name": "nigeltao.github.io" }, "writtenIn": [ "c", "cpp", "go" ], "githubRepo": { "firstCommit": 2022, "stars": 66, "forks": 3, "subscribers": 7, "created": 2022, "updated": 2022, "description": "A fast, simple, lossless image file format.", "issues": 1, "url": "https://github.com/nigeltao/qoir" }, "isOpenSource": true }, "qore": { "title": "Qore", "appeared": 2006, "type": "pl", "creators": [ "David Nichols" ], "website": "http://qore.org/", "fileExtensions": [ "q", "qm", "qtest" ], "country": [ "Czech Republic" ], "originCommunity": [ "https://github.com/qorelanguage" ], "domainName": { "registered": 2008, "name": "qore.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "printf" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2006, "stars": 41, "forks": 9, "subscribers": 15, "created": 2015, "updated": 2022, "description": "Qore Programming Language", "issues": 232, "url": "https://github.com/qorelanguage/qore" }, "repoStats": { "firstCommit": 2006, "commits": 13332, "committers": 51, "files": 1879 }, "wikipedia": { "summary": "Qore is an interpreted, high-level, general-purpose, garbage collected dynamic programming language, featuring support for code embedding and sandboxing with optional strong typing and a focus on fundamental support for multithreading and SMP scalability. Qore is unique because it is an interpreted scripting language with fundamental support for multithreading (meaning more than one part of the same code can run at the same time), and additionally because it features automatic memory management (meaning programmers do not have to allocate and free memory explicitly) while also supporting the RAII idiom with destructors for scope-based resource management and exception-safe programming. This is due to Qore's unique prompt collection implementation for garbage collection.", "backlinksCount": 9, "pageId": 33850384, "dailyPageViews": 6, "url": "https://en.wikipedia.org/wiki/Qore_(programming_language)" }, "leachim6": { "filepath": "q/Qore.q", "fileExtensions": [ "q" ], "example": [ "#!/usr/bin/env qore\n%exec-class HelloWorld\nclass HelloWorld\n{\n constructor()\n {\n\t background $.say(\"Hello World\");\n }\n private say($arg)\n {\n\t printf(\"%s\\n\", $arg);\n }\n}\n" ], "id": "Qore" } }, "qr-code": { "title": "QR code", "appeared": 1994, "type": "barCodeFormat", "country": [ "Japan" ], "originCommunity": [ "DENSO Corporation" ], "wikipedia": { "summary": "QR code (abbreviated from Quick Response code) is the trademark for a type of matrix barcode (or two-dimensional barcode) first designed in 1994 for the automotive industry in Japan. A barcode is a machine-readable optical label that contains information about the item to which it is attached. In practice, QR codes often contain data for a locator, identifier, or tracker that points to a website or application. A QR code uses four standardized encoding modes (numeric, alphanumeric, byte/binary, and kanji) to store data efficiently; extensions may also be used.The Quick Response system became popular outside the automotive industry due to its fast readability and greater storage capacity compared to standard UPC barcodes. Applications include product tracking, item identification, time tracking, document management, and general marketing.A QR code consists of black squares arranged in a square grid on a white background, which can be read by an imaging device such as a camera, and processed using Reed–Solomon error correction until the image can be appropriately interpreted. The required data is then extracted from patterns that are present in both horizontal and vertical components of the image.", "backlinksCount": 1287, "pageId": 828436, "dailyPageViews": 6415, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/QR_code" }, "isbndb": "" }, "qt": { "title": "Qt", "appeared": 1995, "type": "framework", "website": "https://www.qt.io/", "country": [ "Finland" ], "originCommunity": [ "Qt Group plc" ], "domainName": { "registered": 2013, "awisRank": { "2022": 5609 }, "name": "qt.io" }, "writtenIn": [ "cpp" ], "wikipedia": { "related": [ "android", "ios", "linux", "sql", "xml", "json", "visual-studio-editor", "qml", "javascript", "sibelius-software", "qmake", "solaris", "opengl", "qtscript", "xpath", "xquery", "unix", "emacs-editor" ], "summary": "Qt ( \"cute\") is a cross-platform application framework that is used for developing application software that can be run on various software and hardware platforms with little or no change in the underlying codebase, while still being a native application with native capabilities and speed. Qt is currently being developed both by The Qt Company, a publicly listed company, and the Qt Project under open-source governance, involving individual developers and firms working to advance Qt. Qt is available with both proprietary and open source GPL 2.0, GPL 3.0, and LGPL 3.0 licenses.", "pageId": 25204, "dailyPageViews": 790, "created": 2001, "backlinksCount": 734, "revisionCount": 2376, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Qt_(software)" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2014, "committerCount": 7, "commitCount": 50, "url": "https://github.com/textmate/cpp-qt.tmbundle" }, "twitter": "https://twitter.com/qtproject", "fileType": "text", "wordRank": 9774, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAdvanced Qt Programming: Creating Great Software with C++ and Qt 4|2010|Mark Summerfield|11204811|4.00|41|1\nC++ GUI Programming with Qt 4|2008|Jasmin Blanchette|2659927|3.72|83|7\nC++ GUI Programming with Qt 4|2006|Jasmin Blanchette|561698|3.76|38|1\nRapid GUI Programming with Python and Qt: The Definitive Guide to PyQt Programming|2007|Mark Summerfield|1790241|3.95|77|6\nC++ GUI Programming with Qt 3|2004|Jasmin Blanchette|561701|3.69|16|0" }, "qtscript": { "title": "QtScript", "appeared": 2008, "type": "pl", "wikipedia": { "related": [ "ecmascript" ], "summary": "QtScript is a scripting engine that has been part of the Qt cross-platform application framework since version 4.3.0. The scripting language is based on the ECMAScript standard with a few extensions, such as QObject-style signal and slot connections. The library contains the engine, and a C++ API for evaluating QtScript code and exposing custom QObject-derived C++ classes to QtScript. The QtScript Binding Generator provides bindings for the Qt API to access directly from ECMAScript. QtScript and the binding generator are used for Amarok 2's scripting system. The current (as of Qt 4.7) implementation uses JavaScriptCore and will not be further developed. The module is deprecated as of Qt 5.5.", "pageId": 9609819, "created": 2007, "backlinksCount": 145, "revisionCount": 64, "dailyPageViews": 27, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/QtScript" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "quadril": { "title": "QUADRIL", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9a9ef05e8de07e13d502c7a35c0190c21fdd26ad" ], "country": [ "United States" ], "originCommunity": [ "Boeing Computer Services Co" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4148", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "quaint-lang": { "title": "quaint-lang", "appeared": 2015, "type": "pl", "country": [ "Bulgaria" ], "originCommunity": [ "https://github.com/bbu/quaint-lang/issues" ], "githubRepo": { "firstCommit": 2015, "stars": 58, "forks": 1, "subscribers": 5, "created": 2015, "updated": 2021, "description": "An experimental statically typed procedural language with first-class resumable functions.", "issues": 2, "url": "https://github.com/bbu/quaint-lang" }, "repoStats": { "firstCommit": 2015, "commits": 28, "committers": 2, "files": 47 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n11507234|Show HN: Quaint – a statically typed language with seamless resumable functions|2016-04-15 20:05:29 UTC|1460750729|bluetomcat|3|4" }, "quaint": { "title": "Quaint", "appeared": 2014, "type": "textMarkup", "creators": [ "Olivier Breuleux" ], "description": "Quaint is a markup language that you can use to write documents. It is similar to Markdown, but it is more powerful and more extensible.", "website": "http://breuleux.github.io/quaint/", "webRepl": [ "http://breuleux.github.io/quaint/tryit.html" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/breuleux/quaint/issues" ], "writtenIn": [ "earl-grey" ], "related": [ "markdown", "scroll" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": ";; A comment", "value": true }, "hasComments": { "example": ";; A comment", "value": true }, "lineCommentToken": [ [ ";;" ] ], "example": [ ";; Edit me!\n\nmeta ::\n title = My Resume\n author = My Name\n\n= meta::title\n\nHello, my name is __meta::author and this is meta::title~! I have many skills:\n\n* Pirate skills\n * Eye patch\n * Peg leg\n* _Ninja skills\n css ::\n .invisible { color: transparent; }\n # span.invisible % Stealth!\n # Nunchakus\n* Robot skills\n * Beep! Boop!\n* I can also cook!\n + Meal + Can I cook it? + How good?\n | Potatoes | Yes | Delicious\n | Steak | Yes | Rare\n | Egg salad | You bet! | Decadent\n | Cheesecake | Yes!!! | Oh my god\n\nMy website is @@{web}. Find me on Google@@http://google.com~! It's easy as 2 + 2 = {2 + 2}!\n\nweb => http://my.amazing.website.com\n\nPlease embed my `code on your website:\n\njavascript &\n function virus() { alert(\"AAAAAAAAHHH\"); }\n\n@@image:assets/quaint-small.png" ], "githubRepo": { "firstCommit": 2014, "stars": 28, "forks": 0, "subscribers": 4, "created": 2015, "updated": 2022, "description": "The Quaint markup language", "issues": 0, "url": "https://github.com/breuleux/quaint" }, "repoStats": { "firstCommit": 2014, "commits": 351, "committers": 1, "files": 49 } }, "quake": { "title": "Quake", "appeared": 2001, "type": "pl", "description": "Quake is a simple, specialized language and its interpreter drawing on elements of the C language, the Bourne shell, and the C pre-processor. The cm3 compiler includes a quake interpreter as its extension language. In fact, the configuration file, cm3.cfg, and m3makefiles are quake scripts. Quake was designed to be a simple extension language for the builder. Building a complete, general-purpose language was not one of the goals. Cm3 calls out to quake every time it needs to do something that needs to be specialized such as compiling C files or linking.", "reference": [ "https://modula3.elegosoft.com/cm3/doc/help/cm3/quake.html", "https://www.computer-dictionary-online.org/definitions-q/quake.html" ], "country": [ "United States" ], "originCommunity": [ "Digital Equipment Corporation" ], "example": [ "proc simple(prefix, suffix) is\n q = prefix & \".\" & suffix\n end" ], "githubLanguage": { "type": "programming", "filenames": [ "m3makefile", "m3overrides" ], "aceMode": "text", "tmScope": "source.quake", "repos": 1, "id": "Quake" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 3, "commitCount": 7, "sampleCount": 2, "example": [ "include(ROOT & \"/m3overrides\")\nM3_FRONT_FLAGS += \"-vsdebug\"\n_M3BUNDLE_OVERRIDE = \"T\"" ], "url": "https://github.com/newgrammars/quake" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "quakec": { "title": "QuakeC", "appeared": 1996, "type": "pl", "creators": [ "John Carmack" ], "country": [ "United States" ], "originCommunity": [ "id Software LLC" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "bprint" ] ], "wikipedia": { "related": [ "c", "linux" ], "summary": "QuakeC is an interpreted language developed in 1996 by John Carmack of id Software to program parts of the video game Quake. Using QuakeC, a programmer is able to customize Quake to great extents by adding weapons, changing game logic and physics, and programming complex scenarios. It can be used to control many aspects of the game itself, such as parts of the AI, triggers, or changes in the level. The Quake engine was the only game engine to use QuakeC. Following engines used DLL game modules for customization written in C and C++ from id Tech 4 on.", "pageId": 25207, "created": 2001, "backlinksCount": 91, "revisionCount": 124, "dailyPageViews": 30, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/QuakeC" }, "leachim6": { "filepath": "q/QuakeC.qc", "fileExtensions": [ "qc" ], "example": [ "bprint(\"Hello World\\n\");" ], "id": "QuakeC" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:QuakeC", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCurly Bracket Programming Languages: C, Java, C++, Perl, JavaScript, PHP, Ruby, Bcpl, awk, Quakec, Objective-C, Cyclone, Pike, Unrealscript, Rc|2010|Books LLC|14292084|3.00|1|0", "isbndb": "" }, "quanta": { "title": "Quanta", "appeared": 2003, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d5247b244fdd7c87bac66d71e3e77dd4c1ba5200" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Westminster" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6732", "centralPackageRepositoryCount": 0, "isbndb": "" }, "quel": { "title": "QUEL", "appeared": 1976, "type": "queryLanguage", "creators": [ "Michael Stonebraker" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "example": [ "range of E is EMPLOYEE\nretrieve into W\n(COMP = E.Salary / (E.Age - 18))\nwhere E.Name = \"Jones\"" ], "wikipedia": { "example": [ "retrieve (a=count(y.i by y.d where y.str = \"ii*\" or y.str = \"foo\"),b=max(count(y.i by y.d)))" ], "related": [ "sql" ], "summary": "QUEL is a relational database query language, based on tuple relational calculus, with some similarities to SQL. It was created as a part of the Ingres DBMS effort at University of California, Berkeley, based on Codd's earlier suggested but not implemented Data Sub-Language ALPHA. QUEL was used for a short time in most products based on the freely available Ingres source code, most notably in an implementation called POSTQUEL supported by POSTGRES. As Oracle and DB2 gained market share in the early 1980s, most companies then supporting QUEL moved to SQL instead. QUEL continues to be available as a part of the Ingres DBMS, although no QUEL-specific language enhancements have been added for many years.", "created": 2003, "pageId": 33661295, "backlinksCount": 60, "revisionCount": 84, "dailyPageViews": 33, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/QUEL_query_languages" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "query-by-example": { "title": "Query by Example", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f320e453ae65ddf0a3789f4383fa164481c7a8b3" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "wikipedia": { "example": [ "SELECT * FROM Contacts WHERE City='Sampleton' AND Zipcode='12345';" ], "related": [ "sql", "graphql" ], "summary": "Query by Example (QBE) is a database query language for relational databases. It was devised by Moshé M. Zloof at IBM Research during the mid-1970s, in parallel to the development of SQL. It is the first graphical query language, using visual tables where the user would enter commands, example elements and conditions. Many graphical front-ends for databases use the ideas from QBE today. Originally limited only for the purpose of retrieving data, QBE was later extended to allow other operations, such as inserts, deletes and updates, as well as creation of temporary tables. The motivation behind QBE is that a parser can convert the user's actions into statements expressed in a database manipulation language, such as SQL. Behind the scenes, it is this statement that is actually executed. A suitably comprehensive front-end can minimize the burden on the user to remember the finer details of SQL, and it is easier and more productive for end-users (and even programmers) to select tables and columns by selecting them rather than typing in their names, In the context of information retrieval, QBE has a somewhat different meaning. The user can submit a document, or several documents, and ask for \"similar\" documents to be retrieved from a document database [see search by multiple examples]. Similarity search is based comparing document vectors (see Vector Space Model). QBE is a seminal work in end-user development, frequently cited in research papers as an early example of this topic. Currently, QBE is supported in several relational database front ends, notably Microsoft Access, which implements \"Visual Query by Example\", as well as Microsoft SQL Server Enterprise Manager. It is also implemented in several object-oriented databases (e.g. in db4o). QBE is based on the logical formalism called tableau query, although QBE adds some extensions to that, much like SQL is based on the relational algebra.", "backlinksCount": 47, "pageId": 2271084, "dailyPageViews": 136, "created": 2005, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Query_by_Example" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3957", "centralPackageRepositoryCount": 0 }, "quexal": { "title": "quexal", "appeared": 2007, "type": "esolang", "description": "Quetzal (pronounced ket-sal) is a tangible programming language designed for children and novice programmers to control LEGO MINDSTORMS robots.", "country": [ "United States" ], "originCommunity": [ "Tufts University" ], "firstAnnouncement": "http://hci.cs.tufts.edu/tern/horn-jacob-tei07.pdf", "announcementMethod": "paper", "fileType": "text", "centralPackageRepositoryCount": 0 }, "quick-macros": { "title": "Quick Macros", "appeared": 1997, "type": "pl", "reference": [ "http://www.quickmacros.com/features.html" ], "country": [ "Lithuania" ], "originCommunity": [ "https://www.libreautomate.com/forum" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8634", "centralPackageRepositoryCount": 0, "isbndb": "" }, "quickbasic": { "title": "QuickBASIC", "appeared": 1985, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "example": [ "REM sample of bubble sort\nN = 10\nDIM A(N) AS INTEGER\nFOR L = 1 TO N\n A(L) = INT(RND * 10 + 1)\nNEXT\nFOR X = 1 TO N\n FOR Y = 1 TO N - 1\n IF A(X) < A(Y) THEN SWAP A(X), A(Y)\n NEXT\nNEXT\nFOR L = 1 TO N\n PRINT A(L)\nNEXT\nEND" ], "related": [ "qbasic", "basic", "gw-basic", "visual-basic", "linux", "freebasic", "qb64", "powerbasic", "turbo-basic" ], "summary": "Microsoft QuickBASIC (also QB) is an Integrated Development Environment (or IDE) and compiler for the BASIC programming language that was developed by Microsoft. QuickBASIC runs mainly on DOS, though there was a short-lived version for the classic Mac OS. It is loosely based on GW-BASIC but adds user-defined types, improved programming structures, better graphics and disk support and a compiler in addition to the interpreter. Microsoft marketed QuickBASIC as the introductory level for their BASIC Professional Development System. Microsoft marketed two other similar IDEs for C and Pascal, viz QuickC and QuickPascal.", "created": 2002, "backlinksCount": 224, "pageId": 63569, "revisionCount": 337, "dailyPageViews": 91, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/QuickBASIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5233", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1995|Irwin Professional Publishing|Quickbasic and Qbasic Using Modular Structure Alternate Edition With Visual Basic|Bradley, Julia Case|9780256207972\n1991|McGraw-Hill College|Programming With Quickbasic|Zage, Wayne M.|9780070730014\n||An Introduction to Programming with QuickBASIC|Head and Fred L.|9780030151491\n1989|Que Pub|Quickbasic Advanced Techniques (Programming Series)|Aitken, Peter G.|9780880224314\n1995T|Dryden Press|Introduction to programming with QuickBASIC|Head, Fred L|9780030982897\n1988|Microsoft Press|Microsoft QuickBASIC: Developing Structured Programs in the Microsoft QuickBASIC Programming Environment|Hergert, Douglas A.|9781556151255\n1991|Pearson College Div|Standard Basic Programming With Quickbasic|Catlin, Avery|9780138408282\n1991|Harcourt College Pub|Common-Sense Basic: Structured Programming With Microsoft Quickbasic|Dean, Alice M. and Effinger, Grove and Effinger, Gove W.|9780155122970\n1991|Pws Pub Co|Structured Programming With Quickbasic (Pws-Kent Series in Computer Science)|Payne, James|9780534930608\n1992|Course Technology|Programming In Quickbasic|James S. Quasney|9780878357772\n1989|Mis Pr|Quickbasic Advanced Programming Tools|Mark Goodwin|9781558280403\n1989|Que Pub|Quickbasic Programmer's Toolkit/book And Disk (programming Series)|Tom Rugg and Phil Feldman|9780880224505\n1989|Scott Foresman Trade|Quickbasic Business Programming (scott, Foresman Ibm Computer Books)|James Perotti|9780673384553" }, "quicklisp-pm": { "title": "quicklisp-pm", "appeared": 2010, "type": "packageManager", "creators": [ "Zach Beane" ], "website": "https://www.quicklisp.org/beta/", "country": [ "United States" ], "originCommunity": [ "https://github.com/quicklisp/quicklisp-client/issues" ], "githubRepo": { "firstCommit": 2010, "stars": 263, "forks": 66, "subscribers": 23, "created": 2010, "updated": 2022, "description": "Quicklisp client.", "issues": 72, "url": "https://github.com/quicklisp/quicklisp-client" }, "packageCount": 1500, "forLanguages": [ "common-lisp" ], "twitter": "https://twitter.com/quicklisp" }, "quicksight-app": { "title": "quicksight-app", "appeared": 2015, "type": "application", "website": "https://aws.amazon.com/quicksight/", "reference": [ "https://aws.amazon.com/about-aws/whats-new/2015/10/introducing-amazon-quicksight-now-in-preview/" ], "country": [ "United States" ], "originCommunity": [ "Amazon Web Services, Inc" ] }, "quikscript": { "title": "QUIKSCRIPT", "appeared": 1965, "type": "pl", "country": [ "United States" ], "firstAnnouncement": "http://delivery.acm.org/10.1145/370000/364959/p350-tonge.pdf", "announcementMethod": "paper", "wikipedia": { "related": [ "simscript" ], "summary": "QUIKSCRIPT is a simulation language derived from SIMSCRIPT, based on 20-GATE.", "dailyPageViews": 3, "pageId": 1064160, "created": 2004, "backlinksCount": 11, "revisionCount": 19, "appeared": 1965, "url": "https://en.wikipedia.org/wiki/QUIKSCRIPT" }, "hopl": "https://hopl.info/showlanguage.prx?exp=236", "fileType": "text", "centralPackageRepositoryCount": 0 }, "quiktran": { "title": "QUIKTRAN", "appeared": 1964, "type": "pl", "reference": [ "https://www.wikiwand.com/en/QUIKTRAN" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "hopl": "https://hopl.info/showlanguage.prx?exp=461" }, "quilt": { "title": "QUILT", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a7e4c4dcea0774d202731133b6839b373cc694ba" ], "country": [ "United States" ], "originCommunity": [ "San Diego State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4447", "wordRank": 9825, "centralPackageRepositoryCount": 0 }, "qunity": { "title": "Qunity", "appeared": 2022, "type": "pl", "description": "Qunity: A Unified Language for Quantum and Classical Computing", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/ud33h4/qunity_a_unified_language_for_quantum_and/", "https://arxiv.org/abs/2204.12384" ], "country": [ "United States" ], "originCommunity": [ "University of Maryland", "University of Chicago", "Amazon" ] }, "quorum": { "title": "quorum", "appeared": 2013, "type": "pl", "website": "https://quorumlanguage.com/", "reference": [ "https://bitbucket.org/stefika/quorum-language" ], "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "domainName": { "awisRank": { "2022": 7434304 }, "name": "quorumlanguage.com" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "output" ] ], "stringToken": [ [ "\"" ] ], "leachim6": { "filepath": "q/Quorum.quorum", "fileExtensions": [ "quorum" ], "example": [ "output \"Hello World\"\n" ], "id": "Quorum" } }, "qute": { "title": "QUTE", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ab3aba994b5448a0d11e05a3344e7cee6615030b" ], "country": [ "Japan" ], "originCommunity": [ "University of Tokyo" ], "wikipedia": { "summary": "Qute is a Japanese video game company created in 1999. Apart from game development, they offer technology consultancy in other areas such as health care or graphic design.", "backlinksCount": 11, "pageId": 41840571, "dailyPageViews": 6, "created": 2014, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Qute" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2873", "centralPackageRepositoryCount": 0 }, "quty": { "title": "Quty", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/cca3db20ac9ef2f63352d5be7e115204af65e1f0" ], "country": [ "Japan" ], "originCommunity": [ "Tohoku University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1115", "centralPackageRepositoryCount": 0 }, "r": { "title": "R", "appeared": 1993, "type": "pl", "creators": [ "Ross Ihaka", "Robert Gentleman" ], "website": "https://www.r-project.org", "documentation": [ "https://devdocs.io/r/" ], "emailList": [ "https://www.r-project.org/mail.html" ], "fileExtensions": [ "r", "R", "RData", "rds", "rda" ], "country": [ "United States" ], "originCommunity": [ "University of Auckland" ], "domainName": { "registered": 1999, "awisRank": { "2017": 6883, "2022": 6182 }, "name": "r-project.org" }, "releaseNotesUrl": "https://developer.r-project.org/", "visualParadigm": false, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasBitWiseOperators": { "example": "! x\nx & y\nx && y\nx | y\nx || y\nxor(x, y)", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasImports": { "example": "source(\"filename.r\")", "value": true }, "hasLazyEvaluation": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasPipes": { "example": "# R has pipes via a library like dplyr\nstarwars %>% filter(species == \"Droid\")", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": false }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "print" ] ], "assignmentToken": [ [ "=" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "if", "else", "repeat", "while", "function", "for", "in", "next", "break", "TRUE", "FALSE", "NULL", "Inf", "NaN", "NA", "NA_integer_", "NA_real_", "NA_complex_", "NA_character_", "..." ], "wikipedia": { "example": [ "install.packages(\"caTools\") # install external package\nlibrary(caTools) # external package providing write.gif function\njet.colors <- colorRampPalette(c(\"#00007F\", \"blue\", \"#007FFF\", \"cyan\", \"#7FFF7F\",\n \"yellow\", \"#FF7F00\", \"red\", \"#7F0000\"))\ndx <- 400 # define width\ndy <- 400 # define height\nC <- complex( real=rep(seq(-2.2, 1.0, length.out=dx), each=dy ),\n imag=rep(seq(-1.2, 1.2, length.out=dy), dx ) )\nC <- matrix(C,dy,dx) # reshape as square matrix of complex numbers\nZ <- 0 # initialize Z to zero\nX <- array(0, c(dy,dx,20)) # initialize output 3D array\nfor (k in 1:20) { # loop with 20 iterations\n Z <- Z^2+C # the central difference equation\n X[,,k] <- exp(-abs(Z)) # capture results\n}\nwrite.gif(X, \"Mandelbrot.gif\", col=jet.colors, delay=100)" ], "related": [ "common-lisp", "s", "scheme", "julia", "c", "fortran", "java", "python", "latex", "apl", "matlab", "octave", "knitr", "sweave", "utf-8", "rstudio-editor", "eclipse-editor", "emacs-editor", "lyx-editor", "perl", "ruby", "f-sharp", "spss", "stata", "mathematica" ], "summary": "R is an open source programming language and software environment for statistical computing and graphics that is supported by the R Foundation for Statistical Computing. The R language is widely used among statisticians and data miners for developing statistical software and data analysis. Polls, surveys of data miners, and studies of scholarly literature databases show that R's popularity has increased substantially in recent years. R is a GNU package. The source code for the R software environment is written primarily in C, Fortran, and R. R is freely available under the GNU General Public License, and pre-compiled binary versions are provided for various operating systems. While R has a command line interface, there are several graphical front-ends available.", "pageId": 376707, "dailyPageViews": 3651, "created": 2003, "backlinksCount": 1479, "revisionCount": 2219, "appeared": 1993, "fileExtensions": [ "r", "R", "RData", "rds", "rda" ], "url": "https://en.wikipedia.org/wiki/R_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "r", "rd", "rsx" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nrstudio bookdown https://github.com/rstudio.png https://github.com/rstudio/bookdown R #198CE7 1586 711 44 \"Authoring Books and Technical Documents with R Markdown\"\nhadley r4ds https://github.com/hadley.png https://github.com/hadley/r4ds R #198CE7 2051 2560 44 \"R for data science: a book\"\nrfordatascience tidytuesday https://github.com/rfordatascience.png https://github.com/rfordatascience/tidytuesday R #198CE7 1062 490 94 \"Official repo for the #tidytuesday project\"\nrstudio shiny https://github.com/rstudio.png https://github.com/rstudio/shiny R #198CE7 3527 1528 46 \"Easy interactive web applications with R\"\nrstudio rmarkdown https://github.com/rstudio.png https://github.com/rstudio/rmarkdown R #198CE7 1596 676 29 \"Dynamic Documents for R\"\nswirldev swirl_courses https://github.com/swirldev.png https://github.com/swirldev/swirl_courses R #198CE7 3009 6259 30 \"🎓 A collection of interactive courses for the swirl R package.\"\ngriffithlab rnaseq_tutorial https://github.com/griffithlab.png https://github.com/griffithlab/rnaseq_tutorial R #198CE7 767 417 30 \"Informatics for RNA-seq: A web resource for analysis on the cloud. Educational tutorials and working pipelines for RNA-seq analysis including an introduction to: cloud computing, critical file formats, reference genomes, gene annotation, expression, differential expression, alternative splicing, data visualization, and interpretation.\"\nsatijalab seurat https://github.com/satijalab.png https://github.com/satijalab/seurat R #198CE7 540 326 25 \"R toolkit for single cell genomics\"", "trendingProjectsCount": 9, "type": "programming", "filenames": [ ".Rprofile", "expr-dist" ], "interpreters": [ "Rscript" ], "aceMode": "r", "codemirrorMode": "r", "codemirrorMimeType": "text/x-rsrc", "tmScope": "source.r", "aliases": [ "R", "Rscript", "splus" ], "repos": 689533, "id": "R" }, "githubBigQuery": { "repos": 29347, "users": 20273, "id": "R" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/r", "monaco": "r", "codeMirror": "r", "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2016, "committerCount": 13, "commitCount": 226, "sampleCount": 7, "example": [ "hello <- function() {\n print(\"hello, world!\")\n}\nhello()\n" ], "url": "https://github.com/textmate/r.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/REditorSupport/languageserver\nwrittenIn r" ], "projectEuler": { "memberCount": { "2019": 1115, "2022": 1329 }, "id": "R" }, "helloWorldCollection": [ "# Hello World in R\ncat(\"Hello world\\n\")\n" ], "leachim6": { "filepath": "r/R.R", "fileExtensions": [ "R" ], "example": [ "cat(\"Hello World\")\n" ], "id": "R" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:R", "quineRelay": "R", "rijuRepl": { "example": [ "print(\"Hello, world!\")\n" ], "id": "https://riju.codes/r" }, "tryItOnline": "r", "indeedJobs": { "2017": 3912, "query": "r data scientist" }, "linkedInSkill": { "2018": 1026107, "id": "r" }, "stackOverflowSurvey": { "2021": { "users": 4185, "medianSalary": 59454, "fans": 4015, "percentageUsing": 0.05 } }, "officialBlogUrl": [ "https://developer.r-project.org/Blog/public/" ], "faqPageUrl": [ "https://cran.r-project.org/doc/FAQ/R-FAQ.html" ], "downloadPageUrl": [ "https://cran.r-project.org/bin/windows/base/" ], "subreddit": [ { "memberCount": { "2017": 12731, "2022": 29980 }, "url": "https://reddit.com/r/Rlanguage" } ], "meetup": { "memberCount": 26230, "groupCount": 84, "url": "https://www.meetup.com/topics/r-programming-language" }, "tiobe": { "currentRank": 11, "id": "R" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2426", "pypl": "R", "packageRepository": [ "https://cran.r-project.org/", "http://bioconductor.org/" ], "twitter": "https://twitter.com/_r_foundation", "ubuntuPackage": "r-base", "jupyterKernel": [ "http://irkernel.github.io/" ], "fileType": "text", "wordRank": 179, "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2009|Oxford University Press|Building Bioinformatics Solutions: with Perl, R and MySQL|Bessant, Conrad and Shadforth, Ian and Oakley, Darren|9780199230235\n2014|Chapman and Hall/CRC|Introduction to Scientific Programming and Simulation Using R (Chapman & Hall/CRC The R Series)|Jones, Owen and Maillardet, Robert and Robinson, Andrew|9781466569997\n2013|Wiley|Data Mining and Business Analytics with R|Ledolter, Johannes|9781118447147\n2009|Springer Verlag|Introducing Monte Carlo Methods with R (Use R!)|Christian P. Robert and George Casella|9781441915757\n2008|Springer|Software for Data Analysis: Programming with R (Statistics and Computing)|John M. Chambers|9780387759357\n2020|Chapman and Hall/CRC|Interactive Web-Based Data Visualization with R, plotly, and shiny (Chapman & Hall/CRC The R Series)|Sievert, Carson|9781138331457\n2008|Springer|Data Manipulation with R (Use R!)|Spector, Phil|9780387747309\n2020|O'Reilly Media|Practical Statistics for Data Scientists: 50+ Essential Concepts Using R and Python|Bruce, Peter and Bruce, Andrew and Gedeck, Peter|9781492072942\n2007|Cambridge University Press|A First Course in Statistical Programming with R|Braun, W. John|9780521694247\n2008|Chapman and Hall/CRC|R Programming for Bioinformatics (Chapman & Hall/CRC Computer Science & Data Analysis)|Gentleman, Robert|9781420063677\n2013|Packt Publishing|Web Application Development with R Using Shiny|Beeley, Chris|9781783284474\n2009|Chapman and Hall/CRC|Introduction to Scientific Programming and Simulation Using R (Chapman & Hall/CRC The R Series)|Jones, Owen and Maillardet, Robert and Robinson, Andrew|9781420068726\n2004|Chapman and Hall/CRC|Linear Models with R (Chapman & Hall/CRC Texts in Statistical Science)|Faraway, Julian J.|9781584884255\n2015|O'Reilly Media|R Packages: Organize, Test, Document, and Share Your Code|Wickham, Hadley|9781491910597\n2016|CRC Press|R for Programmers: Mastering the Tools|Zhang, Dan|9781498736817\n2015|Packt Publishing|Building a Recommendation System with R|Gorakala, Suresh K. and Usuelli, Michele|9781783554492\n2020|CRC Press|Mathematics and Programming for Machine Learning with R|Claster, William|9780367507855\n2016|Packt Publishing|RStudio for R Statistical Computing Cookbook|Cirillo, Andrea|9781784391034\n2016|Routledge|Quantitative Corpus Linguistics with R|Gries, Stefan Th.|9781138816282\n2017|Apress|Functional Data Structures in R: Advanced Statistical Programming in R|Mailund, Thomas|9781484231432\n2005|Springer|Analysis of Integrated and Cointegrated Time Series with R (Use R)|Pfaff, Bernhard|9780387279596\n2020||Visual Linguistics With R|Christoph Rühlemann|9789027207104\n2017|O'Reilly Media|Efficient R Programming: A Practical Guide to Smarter Programming|Gillespie, Colin and Lovelace, Robin|9781491950784\n2010|Packt Publishing|Statistical Analysis with R|M. Quick, John|9781849512084\n2016|Packt Publishing|Big Data Analytics with R: Leverage R Programming to uncover hidden patterns in your Big Data|Walkowiak, Simon|9781786466457\n2011|O'Reilly Media|Getting Started with RStudio: An Integrated Development Environment for R|Verzani, John|9781449309039\n2019|Manning Publications|Practical Data Science with R|Nina Zumel and John Mount|9781617295874\n2007|Cambridge University Press|A First Course in Statistical Programming with R|Braun, W. John and Murdoch, Duncan J.|9780521872652\n2015|SAGE Publications Ltd|An Introduction to R for Spatial Analysis and Mapping|Brunsdon, Chris and Comber, Lex|9781446272947\n2014|Packt Publishing|R Machine Learning Essentials|Usuelli, Michele|9781783987740\n2016|Packt Publishing|R Data Structures and Algorithms|Prakash, Dr. PKS and Rao, Achyutuni Sri Krishna|9781786465153\n2019|Packt Publishing|R Machine Learning Projects: Implement supervised, unsupervised, and reinforcement learning techniques using R 3.5|Chinnamgari, Dr. Sunil Kumar|9781789807943\n2018|Apress|Machine Learning Using R: With Time Series and Industry-Based Use Cases in R|Ramasubramanian, Karthik and Singh, Abhishek|9781484242148\n2017|Springer|Introduction to Statistics and Data Analysis: With Exercises, Solutions and Applications in R|Heumann, Christian and Schomaker, Michael and Shalabh|9783319461625\n2012|Wiley|The Essential R Reference|Gardener, Mark|9781118391419\n2014|Apress|Using R for Statistics|Baldock, Sarah|9781484201398\n20161212|O'Reilly Media, Inc.|R for Data Science|Hadley Wickham; Garrett Grolemund|9781491910344\n2018|Manning Publications|Beyond Spreadsheets with R: A beginner's guide to R and RStudio|Carroll, Dr Jonathan|9781617294594\n2020|Apress|Advanced R 4 Data Programming and the Cloud: Using PostgreSQL, AWS, and Shiny|Wiley, Matt and Wiley, Joshua F.|9781484259726\n2014|Springer|Beginning Data Science with R|Pathak, Manas A.|9783319120652", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|brms: An R Package for Bayesian Multilevel Models Using Stan|10.18637/JSS.V080.I01|3062|267|P. Bürkner|4bf0e9786d6638dc7d4b1fc929def68da9003c4e\n2017|Advanced Bayesian Multilevel Modeling with the R Package brms|10.32614/RJ-2018-017|928|89|P. Bürkner|232a4da46a5f77ff1fc725fd06a4967a57c3b651\n2006|Support Vector Machines in R|10.18637/JSS.V015.I09|555|32|Alexandros Karatzoglou and David Meyer and K. Hornik|1c0020ad0f0a6c7bed9fc395b292d9007e17d72f\n2010|EBImage—an R package for image processing with applications to cellular phenotypes|10.1093/bioinformatics/btq046|507|26|Grégoire Pau and Florian Fuchs and O. Sklyar and M. Boutros and W. Huber|c7ba786c84c9c5161604e021551a23f098028eba\n2012|Evaluating the Design of the R Language - Objects and Functions for Data Analysis|10.1007/978-3-642-31057-7_6|125|4|Floréal Morandat and B. Hill and Leo Osvald and J. Vitek|85dbdb61a133eecbde3cf635de9c84eaecf249fa\n2019|formr: A study framework allowing for automated feedback generation and complex longitudinal experience-sampling studies using R|10.3758/s13428-019-01236-y|98|3|Ruben C. Arslan and Matthias Walther and Cyril S. Tata|220ea16cf578f440570b383dfbea6b4b24a5a6bd\n2016|Optimizing R language execution via aggressive speculation|10.1145/2989225.2989236|29|0|Lukas Stadler and Adam Welc and Christian Humer and Mick J. Jordan|c17ac40f0fb475c810c70a52b3dd6535454eabf4\n2012|Tight Coupling of R and Distributed Linear Algebra for High-Level Programming with Big Data|10.1109/SC.Companion.2012.113|13|0|D. Schmidt and G. Ostrouchov and Wei-Chen Chen and Pragneshkumar B. Patel|bcc6a968df0d63be5bd21044a81c956377796d81\n2012|The Functional Programming Language R and the Paradigm of Dynamic Scientific Programming - (Position Paper)|10.1007/978-3-642-40447-4_12|5|0|B. T. Widemann and Carl Friedrich Bolz-Tereick and C. Grelck|134c0c03c08b6496c7c6075a4366a96c4708ece1" }, "r2ml": { "title": "R2ML", "appeared": 2003, "type": "xmlFormat", "website": "https://web.archive.org/web/20150218164258/https://www.rewerse.net", "country": [ "Germany" ], "originCommunity": [ "Ludwig-Maximilians-Universität" ], "domainName": { "registered": 2003, "name": "rewerse.net" }, "wikipedia": { "summary": "The REWERSE Rule Markup Language (R2ML) is developed by the REWERSE Working Group I1 for the purpose of rules interchange between different systems and tools.", "backlinksCount": 4, "pageId": 5006904, "dailyPageViews": 3, "url": "https://en.wikipedia.org/wiki/R2ML" } }, "r3": { "title": "r3", "appeared": 2021, "type": "pl", "creators": [ "Pablo H. Reda" ], "country": [ "Argentina" ], "originCommunity": [ "https://github.com/phreda4/r3/issues" ], "related": [ "forth" ], "githubRepo": { "firstCommit": 2021, "stars": 22, "forks": 3, "subscribers": 4, "created": 2021, "updated": 2022, "description": "r3 programing language", "issues": 1, "url": "https://github.com/phreda4/r3" }, "repoStats": { "firstCommit": 2021, "commits": 466, "committers": 1, "files": 487 } }, "r4": { "title": "r4", "appeared": 2009, "type": "pl", "website": "https://phreda4.github.io", "country": [ "Argentina" ], "originCommunity": [ "https://github.com/phreda4/r4/issues" ], "domainName": { "name": "phreda4.github.io" }, "githubRepo": { "firstCommit": 2009, "stars": 100, "forks": 8, "subscribers": 9, "created": 2015, "updated": 2022, "description": ":r4 concatenative programming language with ideas from ColorForth.", "issues": 0, "url": "https://github.com/phreda4/reda4" }, "repoStats": { "firstCommit": 2009, "commits": 2041, "committers": 5, "files": 1135 } }, "ra": { "title": "ra", "appeared": 2015, "type": "pl", "creators": [ "Omar Ahmad" ], "website": "http://ra-lang.sourceforge.net", "domainName": { "name": "ra-lang.sourceforge.net" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9087509|Ra|http://ra-lang.sourceforge.net/|2015-02-21 23:43:25 UTC|1424562205|oahmad04|0|2" }, "rack": { "title": "RACK", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1e4bfbc1a4bd82c5417553610d5face22374d295" ], "country": [ "United States" ], "originCommunity": [ "RAND Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4021", "wordRank": 4680, "centralPackageRepositoryCount": 0 }, "racket": { "title": "Racket", "appeared": 1994, "type": "pl", "creators": [ "Matthias Felleisen", "Matthew Flatt", "Robert Bruce Findler", "Shriram Krishnamurthi" ], "website": "http://racket-lang.org", "documentation": [ "https://docs.racket-lang.org/" ], "fileExtensions": [ "rkt", "rktl", "rktd", "scrbl", "plt", "ss", "scm" ], "originCommunity": [ "PLT Inc." ], "domainName": { "registered": 2010, "awisRank": { "2017": 77757, "2022": 253298 }, "name": "racket-lang.org" }, "releaseNotesUrl": "https://docs.racket-lang.org/release/index.html", "visualParadigm": false, "hasStrings": { "example": "\"hello world\"", "value": true }, "isLisp": { "example": "", "value": true }, "hasSymbolTables": { "example": ";; Some programming languages allow the symbol table to be manipulated at run-time, so that symbols can be added at any time.", "value": true }, "hasComments": { "example": "", "value": true }, "hasImports": { "example": "(require (prefix-in tcp: racket/tcp))", "value": true }, "hasMacros": { "example": "; https://docs.racket-lang.org/guide/macros.html\n(define-syntax-rule (swap x y)\n(let ([tmp x])\n (set! x y)\n (set! y tmp)))", "value": true }, "hasMixins": { "example": "(mixin (interface-expr ...) (interface-expr ...)\n class-clause ...)", "value": true }, "hasPrefixNotation": { "example": "(+ 1 2 3)", "value": true }, "hasModules": { "example": "(module nest racket\n (provide (for-syntax meta-eggs)\n (for-meta 1 meta-chicks)\n num-eggs)\n (define-for-syntax meta-eggs 2)\n (define-for-syntax meta-chicks 3)\n (define num-eggs 2))", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasHomoiconicity": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "display" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "#lang typed/racket\n\n(: fact (Integer -> Integer))\n(define (fact n)\n (cond [(zero? n) 1]\n [else (* n (fact (- n 1)))]))" ], "related": [ "x86-isa", "powerpc", "sparc", "mips", "arm", "scheme", "eiffel", "rust", "clojure", "lisp", "java", "unicode", "json", "unix", "linux", "arc" ], "summary": "Racket is a general purpose, multi-paradigm programming language in the Lisp-Scheme family. One of its design goals is to serve as a platform for language creation, design, and implementation. The language is used in a variety of contexts such as scripting, general-purpose programming, computer science education, and research. The platform provides an implementation of the Racket language (including a sophisticated run-time system, various libraries, JIT compiler, and more) along with a development environment called DrRacket (formerly named DrScheme) written in Racket itself. The IDE and an accompanying programming curriculum is used in the ProgramByDesign outreach program, an attempt to turn computing and programming into \"an indispensable part of the liberal arts curriculum\". The core language is known for its extensive macro system which enables the creation of embedded and domain-specific languages, language constructs such as classes or modules, and separate dialects of Racket with different semantics. The platform distribution is free and open-source software distributed under the GNU Lesser General Public License (LGPL) license. Extensions and packages written by the community are uploaded to Racket's centralized package catalog. While the Racket distribution continues to support Scheme variants, the new Racket language was launched on 7 June 2010, Racket was launched. https://racket-lang.org/new-name.html", "pageId": 3350021, "dailyPageViews": 286, "created": 2005, "backlinksCount": 184, "revisionCount": 504, "appeared": 1994, "fileExtensions": [ "rkt", "rktl", "rktd", "scrbl", "plt", "ss", "scm" ], "url": "https://en.wikipedia.org/wiki/Racket_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "rkt", "rktd", "rktl", "scrbl" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nsalimt Courses- https://github.com/salimt.png https://github.com/salimt/Courses- Racket #3c5caa 43 73 9 \"Quiz & Assignment of Coursera\"", "trendingProjectsCount": 2, "type": "programming", "interpreters": [ "racket" ], "aceMode": "lisp", "tmScope": "source.racket", "repos": 17790, "id": "Racket" }, "githubBigQuery": { "repos": 3760, "users": 3026, "id": "Racket" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "rkt", "rktd", "rktl" ], "id": "Racket" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 1, "commitCount": 122, "sampleCount": 2, "example": [ "; Clean, simple and efficient code -- that's the power of Racket!\n; http://racket-lang.org/\n\n(define (bottles n more)\n (printf \"~a bottle~a of beer~a\"\n (case n [(0) \"no more\"] [(1) \"1\"] [else n])\n (if (= n 1) \"\" \"s\")\n more))\n\n(for ([n (in-range 99 0 -1)])\n (bottles n \" on the wall, \")\n (bottles n \".\\n\")\n (printf \"Take one down and pass it around, \")\n (bottles (sub1 n) \" on the wall.\\n\\n\"))\n\n(displayln \"No more bottles of beer on the wall, no more bottles of beer.\")\n(displayln \"Go to the store and buy some more, 99 bottles of beer on the wall.\")\n" ], "url": "https://github.com/soegaard/racket-highlight-for-github" }, "projectEuler": { "memberCount": { "2019": 282, "2022": 316 }, "id": "Racket" }, "helloWorldCollection": [ ";; Hello world in Racket\n\n#lang racket/base\n\"Hello, World!\"" ], "leachim6": { "filepath": "r/Racket.rkt", "fileExtensions": [ "rkt" ], "example": [ "#lang racket\n\"Hello World\"\n" ], "id": "Racket" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Racket", "rijuRepl": { "example": [ "#lang racket/base\n(display \"Hello, world!\\n\")\n" ], "id": "https://riju.codes/racket" }, "tryItOnline": "racket", "indeedJobs": { "2017": 1, "query": "racket engineer" }, "linkedInSkill": { "2018": 4702, "id": "racket" }, "officialBlogUrl": [ "https://blog.racket-lang.org/" ], "faqPageUrl": [ "https://www.cs.uni.edu/~wallingf/teaching/cs3540/resources/racket-faq.html" ], "downloadPageUrl": [ "https://download.racket-lang.org/" ], "meetup": { "memberCount": 735, "groupCount": 6, "url": "https://www.meetup.com/topics/racket" }, "conference": [ "https://con.racket-lang.org/ RacketCon" ], "tiobe": { "id": "Racket" }, "packageRepository": [ "https://pkgs.racket-lang.org/" ], "twitter": "https://twitter.com/racketlang", "jupyterKernel": [ "https://github.com/rmculpepper/iracket" ], "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2021-01-08T00:00:01Z|No Starch Press|Racket Programming the Fun Way: From Strings to Turing Machines|Stelly, James. W.|9781718500822\n2021|No Starch Press|Racket Programming the Fun Way: From Strings to Turing Machines|Stelly, James. W.|9781718500839\n2021|Apress|Introducing Blockchain with Lisp: Implement and Extend Blockchains with the Racket Language|Sitnikovski, Boro|9781484269695\n20130613|Random House Publishing Services|Realm of Racket|Matthias Felleisen; David Van Horn; Conrad Barski; |9781593274924", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|A Programmable Programming Language|https://doi.org/10.1145/3127323|55|1|M. Felleisen and R. Findler and M. Flatt and S. Krishnamurthi and Eli Barzilay and J. McCarthy and Sam Tobin-Hochstadt|3d545f95bb19155aaf4c879ada275823671391e2\n2015|The Racket Manifesto|10.4230/LIPIcs.SNAPL.2015.113|58|6|M. Felleisen and R. Findler and M. Flatt and S. Krishnamurthi and Eli Barzilay and J. McCarthy and Sam Tobin-Hochstadt|6c8a2bf06c9247d6e06aa0c1dbc910a8fbae0358\n2013|Whalesong: running racket in the browser|10.1145/2508168.2508172|12|1|Daniel Yoo and S. Krishnamurthi|699cb7f7addac731632d8e5101b4ae59bdad8c29\n2012|Seeing the futures: profiling shared-memory parallel racket|10.1145/2364474.2364485|6|0|J. Swaine and B. Fetscher and Vincent St-Amour and R. Findler and M. Flatt|3cae77be712cf01d407754e8b0622287016c0bb2\n2018|Racets: Faceted Execution in Racket|10.29007/lqkv|4|0|Kristopher K. Micinski and Zhanpeng Wang and Thomas Gilray|76a1e16c9a3ccd47db9ce7502d5d4f7c392bc93b\n2021|Racket Programming Language|10.1007/978-1-4842-6969-5_2|4|0|Boro Sitnikovski|a1b5030322cb7a41ca61f52199bfffa9159610f7\n2017|Educating Computer Science Educators Online - A Racket MOOC for Elementary Math Teachers of Finland|10.5220/0006257800470058|3|0|Tiina Partanen and Pia Niemelä and Linda Mannila and T. Poranen|0a5358f85e4c6859bc54b390c343e3d6071bf0d7\n2015|Combining Processing with Racket|10.1007/978-3-319-27653-3_10|2|1|Hugo F. Correia and A. Leitão|b1ca8a3ed852b8d3f72a5ab2fcd23bf5040c801b\n2019|From Macros to DSLs: The Evolution of Racket|10.4230/LIPIcs.SNAPL.2019.5|2|0|Ryan Culpepper and M. Felleisen and M. Flatt and S. Krishnamurthi|36f5196490c23969ec86f8c693fb04c4d8b7fd8b\n2017|High-Performance Graphics in Racket with DirectX|10.1007/978-3-319-65482-9_66|1|0|A. Bossard|8f722e460468744541fb0819dac316bd7e36e673" }, "raco-pm": { "title": "raco-pm", "appeared": 2012, "type": "packageManager", "website": "https://pkgs.racket-lang.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/racket" ], "domainName": { "name": "pkgs.racket-lang.org" }, "packageCount": 1122, "forLanguages": [ "racket" ] }, "radish": { "title": "Radish", "appeared": 2022, "type": "pl", "description": "Radish Programming Language", "website": "https://radishpl.com/", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wn5vtm/radish_programming_language/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/teo67/Radish/issues" ] }, "ragel": { "title": "Ragel", "appeared": 2007, "type": "pl", "website": "http://complang.org/ragel/", "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/bnoordhuis/ragel/issues" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasHexadecimals": { "example": "# 0x[0-9A-Fa-f]+", "value": true }, "hasIntegers": { "example": "# [+-]?[0-9]+", "value": true }, "lineCommentToken": [ [ "#" ] ], "example": [ "=begin\n%%{\n machine simple_scanner;\n\n action Emit {\n emit data[(ts+8)..(te-7)].pack('c*')\n }\n\n foo = 'STARTFOO' any+ :>> 'ENDFOO';\n \n main := |*\n foo => Emit;\n any;\n *|;\n}%%\n=end\n\n\n# Scans a file for \"STARTFOO[...]ENDFOO\" blocks and outputs their contents.\n#\n# ENV['CHUNK_SIZE'] determines how much of the file to read in at a time, allowing you to control memory usage.\n#\n# Uses ragel's scanner functionality even though it's not strictly necessary.\nclass SimpleScanner\n attr_reader :path\n\n def initialize(path)\n @path = path\n %% write data;\n # % (this fixes syntax highlighting)\n end\n\n def emit(foo)\n $stdout.puts foo\n end\n \n def perform\n # So that ragel doesn't try to get it from data.length\n pe = :ignored\n eof = :ignored\n\n %% write init;\n # % (this fixes syntax highlighting)\n\n leftover = []\n \n File.open(path) do |f|\n while chunk = f.read(ENV['CHUNK_SIZE'].to_i)\n data = leftover + chunk.unpack('c*')\n p ||= 0\n pe = data.length\n\n %% write exec;\n # % (this fixes syntax highlighting)\n if ts\n leftover = data[ts..pe]\n p = p - ts\n ts = 0\n else\n leftover = []\n p = 0\n end\n end\n end\n end\nend\n\ns = SimpleScanner.new ARGV[0]\ns.perform" ], "githubRepo": { "firstCommit": 2007, "stars": 152, "forks": 18, "subscribers": 5, "created": 2013, "updated": 2022, "description": "Ragel State Machine Compiler - http://www.complang.org/ragel/", "issues": 1, "url": "https://github.com/bnoordhuis/ragel" }, "repoStats": { "firstCommit": 2007, "commits": 821, "committers": 8, "files": 475 }, "wikipedia": { "related": [ "c", "d", "go", "ruby", "java", "regex", "ascii", "xuml", "umple" ], "summary": "Ragel is a finite-state machine compiler and a parser generator. Initially Ragel supported output for C, C++ and Assembly source code,. Although subsequently extended to support several other languages (said to be Objective C, D, Go, Ruby, and Java) this support of other languages was withdrawn . It supports the generation of table or control flow driven state machines from regular expressions and/or state charts and can also build lexical analysers via the longest-match method. Ragel specifically targets text parsing and input validation.", "created": 2006, "pageId": 8052388, "backlinksCount": 21, "revisionCount": 88, "dailyPageViews": 29, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Ragel" }, "githubLanguage": { "fileExtensions": [ "rl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "aliases": [ "ragel-rb", "ragel-ruby" ], "repos": 66, "id": "Ragel" }, "githubBigQuery": { "repos": 317, "users": 295, "id": "Ragel" }, "pygmentsHighlighter": { "filename": "parsers.py", "id": "Ragel" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "rails": { "title": "Ruby on Rails", "appeared": 2005, "type": "framework", "website": "http://rubyonrails.org", "country": [ "Denmark" ], "originCommunity": [ "https://github.com/rails" ], "domainName": { "registered": 2004, "awisRank": { "2022": 21670 }, "name": "rubyonrails.org" }, "releaseNotesUrl": "https://rubyonrails.org/category/releases", "versions": { "2005": [ "1.0" ], "2007": [ "2.0" ], "2010": [ "3.0" ], "2013": [ "4.0" ], "2016": [ "5.0" ], "2019": [ "6.0" ], "2021": [ "7.0" ] }, "wikipedia": { "related": [ "ruby", "json", "xml", "html", "javascript", "jquery", "coffeescript", "sass", "rest", "nginx-config", "soap", "erb", "jruby", "mysql", "postgresql", "scala" ], "summary": "Ruby on Rails, or Rails, is a server-side web application framework written in Ruby under the MIT License. Rails is a model–view–controller (MVC) framework, providing default structures for a database, a web service, and web pages. It encourages and facilitates the use of web standards such as JSON or XML for data transfer, and HTML, CSS and JavaScript for display and user interfacing. In addition to MVC, Rails emphasizes the use of other well-known software engineering patterns and paradigms, including convention over configuration (CoC), don't repeat yourself (DRY), and the active record pattern.", "pageId": 1421401, "dailyPageViews": 1044, "created": 2005, "backlinksCount": 817, "revisionCount": 2172, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Ruby_on_Rails" }, "leachim6": { "filepath": "r/Ruby on Rails.rb", "example": [ "class HelloWorld < app\n print \"Hello World\"\n end\nend\n" ], "id": "Ruby on Rails" }, "indeedJobs": { "2017": 4423, "query": "rails engineer" }, "linkedInSkill": { "2018": 191984, "id": "ruby-on-rails" }, "twitter": "https://twitter.com/rails", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nRuby for Rails: Ruby Techniques for Rails Developers|2006|David A. Black|8159|3.75|176|11" }, "rainbow": { "title": "rainbow", "appeared": 2009, "type": "pl", "description": "Rainbow is an implementation of Arc in Java. It is fairly complete, providing continuations and tail-call optimization.", "website": "https://vmlanguages.is-research.de/rainbow/", "country": [ "United States" ], "originCommunity": [ "https://github.com/conanite/rainbow/issues" ], "githubRepo": { "firstCommit": 2008, "stars": 54, "forks": 3, "subscribers": 3, "created": 2008, "updated": 2022, "description": "arc in java", "issues": 1, "url": "https://github.com/conanite/rainbow" }, "repoStats": { "firstCommit": 2008, "commits": 114, "committers": 4, "files": 374 }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "raku": { "title": "Raku", "appeared": 2019, "type": "pl", "creators": [ "Larry Wall" ], "website": "https://www.raku.org/", "country": [ "United States" ], "originCommunity": [ "https://www.raku.org/community" ], "domainName": { "registered": 1999, "awisRank": { "2022": 666499 }, "name": "raku.org" }, "hasRefinementTypes": { "example": "subset Color of Any where Color | CMYK_Color;", "value": true }, "hasFunctionComposition": { "example": "my &foo = &f ∘ &g;", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "say" ] ], "stringToken": [ [ "\"" ] ], "example": [ "grammar Parser {\n rule TOP { I }\n token love { '♥' | love }\n token lang { < Raku Perl Rust Go Python Ruby > }\n }\n \n say Parser.parse: 'I ♥ Raku';\n # OUTPUT: ｢I ♥ Raku｣ love => ｢♥｣ lang => ｢Raku｣\n \n say Parser.parse: 'I love Perl';\n # OUTPUT: ｢I love Perl｣ love => ｢love｣ lang => ｢Perl｣\n start { sleep 1.5; print \"hi\" }\n await Supply.from-list().throttle: 2, {\n sleep 0.5;\n .print\n }\n # OUTPUT: ABCDhiEF\n # No floating point noise:\n say 0.1 + 0.2 == 0.3; # OUTPUT: True\n say (1/13 + 3/7 + 3/8).perl; # OUTPUT: <641/728>\n # Infinite list of primes:\n my @primes = ^∞ .grep: *.is-prime;\n say \"1001ˢᵗ prime is @primes[1000]\";\n \n # Lazily read words from a file\n .say for '50TB.file.txt'.IO.words;" ], "wikipedia": { "summary": "Raku is a member of the Perl family of programming languages. Formerly known as Perl 6, it was renamed in October 2019.While historically several interpreter and compiler implementations were being written, today only the Rakudo implementation is in active development. Raku introduces elements of many modern and historical languages. Compatibility with Perl is not a goal, though a compatibility mode is part of the specification. The design process for Raku began in 2000. In February 2015 a post on The Perl Foundation blog stated that \"The Perl6 team will attempt to get a development release of version 1.0 available for Larry's birthday in September and a Version 1.0 release by Christmas\", and on 25 December 2015, the first stable version of the specification was announced.Development on Pugs, the first high-traction implementation, began in 2005, and there have been multiple Raku implementation projects. Rakudo is based on NQP (Not Quite Perl) and can use MoarVM or the Java Virtual Machine as a runtime environment, and releases a new version every month (including precompiled Linux packages); in July 2010, the project released the first Rakudo Star distribution, a collection of a Raku implementation and related materials. Larry Wall maintains a reference grammar known as STD.pm6, written in Raku and bootstrapped with Perl.", "backlinksCount": 195, "pageId": 1146638, "dailyPageViews": -1, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Raku_(programming_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "6pl", "6pm", "nqp", "p6", "p6l", "p6m", "pl", "pl6", "pm", "pm6", "raku", "rakumod", "t" ], "interpreters": [ "perl6", "raku", "rakudo" ], "aceMode": "perl", "codemirrorMode": "perl", "codemirrorMimeType": "text/x-perl", "tmScope": "source.raku", "aliases": [ "perl6", "perl-6" ], "repos": 2521, "id": "Raku" }, "githubBigQuery": { "repos": 589, "users": 497, "id": "Raku" }, "leachim6": { "filepath": "r/Raku.raku", "fileExtensions": [ "raku" ], "example": [ "say \"Hello World\";\n" ], "id": "Raku" }, "isbndb": "year|publisher|title|authors|isbn13\n2020|Apress|Raku Fundamentals: A Primer with Examples, Projects, and Case Studies|Lenz, Moritz|9781484261088\n2019|DeepText|Using Raku: 100 Programming Challenges Solved in the Raku Programming Language|Shitov, Andrew|9789082156881\n2020|Apress|Raku Recipes: A Problem-Solution Approach|Merelo, J.J.|9781484262573\n20201012|Springer Nature|Raku Recipes|J.J. Merelo|9781484262580\n20200905|Springer Nature|Raku Fundamentals|Moritz Lenz|9781484261095" }, "ralph": { "title": "ralph", "appeared": 2010, "type": "pl", "creators": [ "Bastian Müller" ], "country": [ "Canada" ], "originCommunity": [ "https://github.com/turbolent/ralph/issues" ], "githubRepo": { "firstCommit": 2010, "stars": 74, "forks": 4, "subscribers": 7, "created": 2010, "updated": 2022, "description": "Ralph is a Lisp-1 dialect that compiles to JavaScript", "issues": 2, "url": "https://github.com/turbolent/ralph" }, "repoStats": { "firstCommit": 2010, "commits": 1212, "committers": 6, "files": 123 }, "semanticScholar": "" }, "ramdascript": { "title": "RamdaScript", "appeared": 2016, "type": "pl", "creators": [ "Yosbel Marín" ], "website": "https://yosbelms.github.io/ramdascript/", "country": [ "United States" ], "compilesTo": [ "javascript" ], "githubRepo": { "stars": 132, "forks": 5, "subscribers": 4, "created": 2016, "updated": 2018, "description": "ram Lisp that compiles to JavaScript in the Ramda way", "url": "https://github.com/yosbelms/ramdascript" }, "repoStats": { "firstCommit": 2016, "commits": 64, "committers": 6, "files": 39 } }, "ramen": { "title": "ramen", "appeared": 2017, "type": "pl", "creators": [ "Cedric Cellier" ], "country": [ "Germany" ], "originCommunity": [ "https://github.com/rixed/ramen/issues" ], "githubRepo": { "firstCommit": 2017, "stars": 13, "forks": 3, "subscribers": 2, "created": 2017, "updated": 2022, "description": "A stream processing language and compiler for small-scale monitoring", "issues": 216, "url": "https://github.com/rixed/ramen" }, "repoStats": { "firstCommit": 2017, "commits": 6207, "committers": 7, "files": 613 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n16771435|Show HN: A stream processing language and compiler for small-scale monitoring|2018-04-06 06:55:57 UTC|1522997757|rixed|0|4" }, "ramis-software": { "title": "Ramis software", "appeared": 1960, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Mathtech, Inc" ], "wikipedia": { "related": [ "focus", "cobol" ], "summary": "RAMIS (Random Access Management Information System) is a fourth-generation programming language (4GL) capable of creating and maintaining databases consisting of named files containing both numeric and alphabetic fields and subsequently producing detailed simple or complex reports using a very simple English like language. As such it is easily mastered by non-programmers. A typical program - either to create or maintain a database or to create quite complex reports - would normally consist of a handful of lines of code which could be written or understood by non-professional programmers. \"End users\" as they became known. Such end users could be trained to use RAMIS in a matter of days and so large companies would often have several hundred such users scattered throughout the company.", "created": 2007, "backlinksCount": 8, "pageId": 2491336, "revisionCount": 4, "dailyPageViews": 3, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/Ramis_software" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4567", "centralPackageRepositoryCount": 0 }, "raml": { "title": "RAML", "appeared": 2013, "type": "yamlFormat", "website": "http://raml.org/spec.html", "documentation": [ "https://raml.org/developers/document-your-api" ], "standsFor": "RESTful API Modeling Language", "country": [ "United States" ], "originCommunity": [ "https://github.com/raml-org" ], "githubRepo": { "firstCommit": 2013, "stars": 3780, "forks": 853, "subscribers": 160, "created": 2013, "updated": 2022, "description": "RAML Specification", "issues": 223, "url": "https://github.com/raml-org/raml-spec" }, "repoStats": { "firstCommit": 2013, "commits": 655, "committers": 41, "files": 11 }, "githubLanguage": { "fileExtensions": [ "raml" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "yaml", "codemirrorMode": "yaml", "codemirrorMimeType": "text/x-yaml", "tmScope": "source.yaml", "repos": 4190, "id": "RAML" }, "githubBigQuery": { "repos": 472, "users": 416, "id": "RAML" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 25, "commitCount": 205, "sampleCount": 1, "example": [ "#%RAML 0.8\n\ntitle: World Music API\nbaseUri: http://example.api.com/{version}\nversion: v1\ntraits:\n - paged:\n queryParameters:\n pages:\n description: The number of pages to return\n type: number\n - secured: !include http://raml-example.com/secured.yml\n/songs:\n is: [ paged, secured ]\n get:\n queryParameters:\n genre:\n description: filter the songs by genre\n post:\n /{songId}:\n get:\n responses:\n 200:\n body:\n application/json:\n schema: |\n { \"$schema\": \"http://json-schema.org/schema\",\n \"type\": \"object\",\n \"description\": \"A canonical song\",\n \"properties\": {\n \"title\": { \"type\": \"string\" },\n \"artist\": { \"type\": \"string\" }\n },\n \"required\": [ \"title\", \"artist\" ]\n }\n application/xml:\n delete:\n description: |\n This method will *delete* an **individual song**" ], "url": "https://github.com/atom/language-yaml" }, "languageServerProtocolProject": [ "https://github.com/raml-org/raml-language-server" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2020|BPB Publications|Hands-on MuleSoft Anypoint platform Volume 1: Designing and Implementing RAML APIs with MuleSoft Anypoint Platform (English Edition)|Nachimuthu, Nanda|9789389898231" }, "rand-abel": { "title": "RAND-ABEL", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8f90c09710ecbe16aa469091353e63e82827f819" ], "hopl": "https://hopl.info/showlanguage.prx?exp=777", "centralPackageRepositoryCount": 0, "isbndb": "" }, "rant": { "title": "rant", "appeared": 2014, "type": "pl", "website": "http://berkin.me/rant", "country": [ "United States" ], "originCommunity": [ "https://github.com/TheBerkin/rant3/pulls" ], "githubRepo": { "firstCommit": 2014, "stars": 3021, "forks": 109, "subscribers": 80, "created": 2014, "updated": 2022, "description": "(Obsolete) Archive of Rant 3.x.", "issues": 9, "url": "https://github.com/TheBerkin/Rant" }, "repoStats": { "firstCommit": 2014, "commits": 991, "committers": 15, "files": 363 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8711621|Show HN: Rant, a procedural text generation language|2014-12-07 08:01:54 UTC|1417939314|atlantique|36|155", "isbndb": "" }, "rapid": { "title": "RAPID", "appeared": 1994, "type": "pl", "originCommunity": [ "ABB Group" ], "wikipedia": { "related": [ "c" ], "summary": "RAPID is a high-level programming language used to control ABB industrial robots. RAPID was introduced along with S4 Control System in 1994 by ABB, superseding the ARLA programming language. Features in the language include: Routine parameters: Procedures - used as a subprogram. Functions - return a value of a specific type and are used as an argument of an instruction. Trap routines - a means of responding to interrupts. Arithmetic and logical expressions Automatic error handling Modular programs Multi tasking", "created": 2010, "backlinksCount": 17, "pageId": 26407459, "revisionCount": 45, "dailyPageViews": 46, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/RAPID" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5407", "wordRank": 3809, "centralPackageRepositoryCount": 0 }, "rapidbatch": { "title": "RapidBatch", "appeared": 2017, "type": "pl", "creators": [ "Jan Max Meyer" ], "website": "http://www.rapidbatch.com", "reference": [ "https://www.phorward-software.com/download/MUSEUM/jmksf/rb/rb_linux/manuals/" ], "country": [ "Germany" ], "originCommunity": [ "Phorward Software Technologies" ], "githubRepo": { "firstCommit": 2017, "stars": 6, "forks": 0, "subscribers": 3, "created": 2017, "updated": 2022, "description": "Scripting language; compiler and virtual machine", "issues": 0, "url": "https://github.com/phorward/rapidbatch" }, "repoStats": { "firstCommit": 2017, "commits": 22, "committers": 2, "files": 95 }, "hopl": "https://hopl.info/showlanguage.prx?exp=8637", "centralPackageRepositoryCount": 0 }, "rapidgen-rpl": { "title": "rapidgen-rpl", "appeared": 1983, "type": "pl", "description": "RapidGen translates the XML into a concise and transparent format of decision tables for decision logic programming —RPL— a rich, purpose-built language developed by the company. Supports high speed execution of decision models. Is capable of processing large data volumes. Preserves traceability to the original DMN model.", "country": [ "United Kingdom" ], "originCommunity": [ "RapidGen Software Ltd" ], "example": [ "Days_leave <- 22\nAGE < 18 Y N N N N ELSE\nAGE >= 60 N Y - N N -\nSERVICE >= 30 N - Y N N -\nSERVICE >= 15 N - - Y N -\nAGE >= 45 N - - - Y -\nDays_leave + 5 X X X . . .\nDays_leave + 2 . . . X X .\nDays_leave + 3 . X X . . ." ] }, "rapidq": { "title": "RapidQ", "appeared": 2000, "type": "pl", "country": [ "Unknown" ], "originCommunity": [ "https://groups.io/g/rapidq" ], "wikipedia": { "related": [ "linux", "unix", "solaris", "mysql" ], "summary": "RapidQ (also known as Rapid-Q) is a free, cross-platform, semi-object-oriented dialect of the BASIC programming language. It can create console, graphical user interface, and Common Gateway Interface applications. The integrated development environment includes a drag-and-drop form designer, syntax highlighting, and single-button compilation. Versions are available for Microsoft Windows, Linux, Solaris, and HP-UX. Additional functionality not normally seen in BASIC languages are function callbacks and primitive object-orientation. The language is called semi-object-oriented by its author because there are only two levels of the class hierarchy: built-in classes, and user-defined classes derived from those; the latter cannot be extended further. The ability to call external shared libraries is available, thus giving full access to the underlying operating system's application program interface. Other capabilities include built-in interfaces to DirectX and MySQL. RapidQ features a bytecode compiler that produces standalone executables by binding the generated bytecode with the interpreter. No external run time libraries are needed; the bytecode interpreter is self-contained. The file sizes of executable files created by RapidQ are about 150 kilobytes or larger for console applications. RapidQ's author, William Yu, sold the source code to REAL Software, the makers of REALbasic, in 2000.The freely distributed program has been improved and many additional components have been created by an active user group.", "created": 2004, "backlinksCount": 98, "pageId": 38261225, "revisionCount": 98, "dailyPageViews": 11, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/RapidQ" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:RapidQ", "centralPackageRepositoryCount": 0 }, "rapidwrite": { "title": "RAPIDWRITE", "appeared": 1962, "type": "pl", "reference": [ "https://www.sciencedirect.com/science/article/abs/pii/S0066413863800117" ], "country": [ "United Kingdom" ], "originCommunity": [ "International Computers and Tabulators Ltd" ], "hopl": "https://hopl.info/showlanguage.prx?exp=462" }, "rapira": { "title": "Rapira", "appeared": 1987, "type": "pl", "creators": [ "Andrey Ershov" ], "website": "http://freeduke33.github.io/rerap2", "reference": [ "http://ershov.iis.nsk.su/ru/node/772586" ], "country": [ "Russia" ], "nativeLanguage": "Russian", "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "output:" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 22, "forks": 4, "subscribers": 3, "created": 2015, "updated": 2022, "firstCommit": 2015, "description": "ReRap2 is an interpreter for the Russian and English dialects of the Rapira programming language.", "issues": 0, "url": "https://github.com/freeduke33/rerap2" }, "repoStats": { "firstCommit": 2015, "commits": 21, "committers": 4, "files": 147 }, "wikipedia": { "example": [ "proc start()\n output: 'Hello, world!!!';\nend proc" ], "related": [ "pop-2", "setl", "algol" ], "summary": "Rapira is also a name for the T-12 antitank gun. Rapira (Russian: Рапира, rapier) is an educational procedural programming language developed in the Soviet Union and implemented on Agat computer, PDP-11 clones (Electronika, DVK, BK series) and Intel-8080/Z80 clones (Korvet). It was an interpreted language with dynamic type system and high level constructions. The language originally had a Russian-based set of keywords, but English and Moldovan were added later. Also, it was more elegant and easier to use than existing Pascal implementations of the time. Rapira was used in teaching computer programming in Soviet schools. The programming environment included a text editor and an integrated debugger. Sample program: ПРОЦ СТАРТ() ВЫВОД: 'Привет, мир!!!' КОН ПРОЦ The same, but using the English lexics [sic, from the article referenced below]: proc start() output: 'Hello, world!!!'; end proc Rapira's ideology was based on such languages as POP-2 and SETL, with strong influences from ALGOL.", "pageId": 146951, "dailyPageViews": 19, "created": 2002, "backlinksCount": 10, "revisionCount": 59, "url": "https://en.wikipedia.org/wiki/Rapira" }, "leachim6": { "filepath": "r/Rapira.rap", "fileExtensions": [ "rap" ], "example": [ "output: \"Hello World\";\n" ], "id": "Rapira" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Rapira", "rijuRepl": { "example": [ "вывод: \"Hello, world!\"\n" ], "id": "https://riju.codes/rapira" }, "tryItOnline": "rapira", "hopl": "https://hopl.info/showlanguage.prx?exp=5224", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "raptor": { "title": "raptor", "appeared": 2015, "type": "visual", "screenshot": "https://pldb.com/screenshots/raptor.png", "description": "RAPTOR is a flowchart-based programming environment, designed specifically to help students visualize their algorithms and avoid syntactic baggage.", "website": "https://raptor.martincarlisle.com/", "country": [ "United States" ], "originCommunity": [ "US Air Force Academy" ], "domainName": { "name": "raptor.martincarlisle.com" }, "visualParadigm": true }, "raptorjit": { "title": "raptorjit", "appeared": 2009, "type": "pl", "creators": [ "Mike Pall" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/raptorjit" ], "githubRepo": { "firstCommit": 2009, "stars": 789, "forks": 34, "subscribers": 64, "created": 2017, "updated": 2022, "description": "RaptorJIT: A dynamic language for system programming (LuaJIT fork)", "issues": 127, "url": "https://github.com/raptorjit/raptorjit" }, "repoStats": { "firstCommit": 2009, "commits": 2698, "committers": 19, "files": 437 } }, "rascal": { "title": "Rascal", "appeared": 2013, "type": "grammarLanguage", "description": "Rascal solves this problem by integrating source code analysis, transformation, and generation primitives on the language level. Use it for any kind of metaprogramming task: to construct parsers for programming languages, to analyze and transform source code, or to define new DSLs with full IDE support. Rascal is a programming language; such that meta programs can be created by, understood by, and debugged by programmers.", "website": "https://www.rascal-mpl.org/", "country": [ "The Netherlands" ], "originCommunity": [ "https://github.com/usethesource" ], "domainName": { "registered": 2010, "awisRank": { "2022": 7828413 }, "name": "rascal-mpl.org" }, "githubRepo": { "firstCommit": 2008, "stars": 317, "forks": 67, "subscribers": 27, "created": 2012, "updated": 2022, "description": "The implementation of the Rascal meta-programming language (including interpreter, type checker, parser generator, compiler and JVM based run-time system)", "issues": 401, "url": "https://github.com/usethesource/rascal" }, "repoStats": { "firstCommit": 2008, "commits": 20580, "committers": 98, "files": 1336 }, "wikipedia": { "related": [ "linux", "unix", "antlr" ], "summary": "Rascal is an experimental domain specific language for metaprogramming, such as static code analysis, program transformation and implementation of domain specific languages. It is a general meta language in the sense that it does not have a bias for any particular software language. It includes primitives from relational calculus and term rewriting. Its syntax and semantics are based on procedural (imperative) and functional programming.", "backlinksCount": 11, "pageId": 26118915, "created": 2010, "revisionCount": 23, "dailyPageViews": 7, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/RascalMPL" }, "githubLanguage": { "fileExtensions": [ "rsc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.rascal", "repos": 722, "id": "Rascal" }, "githubBigQuery": { "repos": 107, "users": 99, "id": "Rascal" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 3, "commitCount": 39, "sampleCount": 4, "example": [ "module Syntax\n\nextend lang::std::Layout;\nextend lang::std::Id;\n\nstart syntax Machine = machine: State+ states;\nsyntax State = @Foldable state: \"state\" Id name Trans* out;\nsyntax Trans = trans: Id event \":\" Id to;\n" ], "url": "https://github.com/usethesource/rascal-syntax-highlighting" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Rascal", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "rascalmpl": { "title": "RascalMPL", "appeared": 2010, "type": "pl", "website": "http://www.rascal-mpl.org", "country": [ "The Netherlands" ], "originCommunity": [ "Centrum Wiskunde & Informatica" ], "domainName": { "registered": 2010, "awisRank": { "2022": 7828413 }, "name": "rascal-mpl.org" }, "wikipedia": { "related": [ "linux", "unix", "antlr" ], "summary": "Rascal is an experimental domain specific language for metaprogramming, such as static code analysis, program transformation and implementation of domain specific languages. It is a general meta language in the sense that it does not have a bias for any particular software language. It includes primitives from relational calculus and term rewriting. Its syntax and semantics are based on procedural (imperative) and functional programming.", "pageId": 26118915, "created": 2010, "backlinksCount": 11, "revisionCount": 23, "dailyPageViews": 7, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/RascalMPL" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "rason": { "title": "rason", "appeared": 2015, "type": "pl", "website": "https://www.rason.com/", "country": [ "United States" ], "originCommunity": [ "Frontline Systems Inc" ], "domainName": { "registered": 2003, "awisRank": { "2022": 3103476 }, "name": "rason.com" }, "related": [ "ampl", "gams", "siman" ], "example": [ "{\n data :\n {\n \"price\" : { value: 200 },\n \"capacity\" : { value: 100 },\n \"sold\" : { value: 110 },\n \"refund_no_shows\" : { value: 0.5 },\n \"refund_overbook\" : { value: 1.25 }\n },\n uncertainVariables : \n {\n \"no_shows\" : { formula: \"PsiLogNormal(0.1*sold, 0.06*sold)\" }\n },\n formulas :\n {\n \"show_ups\" : { formula: \"sold - Round(no_shows, 0)\" },\n \"overbook\" : { formula: \"Max(0, show_ups - capacity)\" }\n },\n uncertainFunctions :\n {\n \"revenue\" : { formula: \"price*(sold - refund_no_shows * Round(no_shows, 0) - refund_overbook * overbook)\",\n mean : [], stdev: [], max : [], min : [] }\n }\n}" ] }, "rasp": { "title": "RASP", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7f8a4a11f2288ca6629b6ab8747f5f52af31f477" ], "country": [ "Yugoslavia" ], "originCommunity": [ "University of Belgrade" ], "wikipedia": { "summary": "A rasp is a tool used for shaping wood or other material. Rasp or RASP may also refer to: Ranger Assessment and Selection Program, the United States Army Rangers selection and training RASP computing model, random-access stored-program machine The Rasp, a book by Philip MacDonald Residents Against SARP Pollution Runtime application self-protection", "backlinksCount": 2, "pageId": 49583178, "dailyPageViews": 2, "created": 2016, "url": "https://en.wikipedia.org/wiki/RASP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1427", "centralPackageRepositoryCount": 0 }, "ratfiv": { "title": "Ratfiv", "appeared": 1980, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Institute for Cancer Research" ], "wikipedia": { "related": [ "fortran", "c", "ratfor" ], "summary": "Ratfiv is an enhanced version of the Ratfor programming language, a preprocessor for Fortran designed to give it C-like capabilities. Fortran was widely used for scientific programming but had very basic control-flow primitives (\"do\" and \"goto\") and no \"macro\" facility which limited its expressiveness. The name of the language is a pun (Ratfor (RATional FORtran) -> \"Rat Four\" -> \"Rat Five\" -> RatFiv). Ratfiv was developed by Bill Wood at the Institute for Cancer Research, Philadelphia, PA in the early 1980s and released on several DECUS (Digital Equipment Users Group) SIG (Special Interest Group) tapes. It is based on the original Ratfor by B. Kernighan and P. J. Plauger, with rewrites and enhancements by David Hanson and friends (U. of Arizona), Joe Sventek and Debbie Scherrer (Lawrence Berkeley National Laboratory). Ratfiv V2.1 was distributed on the DECUS RSX82a SIG tape.", "pageId": 642890, "created": 2004, "backlinksCount": 7, "revisionCount": 42, "dailyPageViews": 8, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Ratfiv" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ratfor": { "title": "RATFOR", "appeared": 1976, "type": "pl", "description": "Ratfor (short for Rational Fortran) is a programming language implemented as a preprocessor for Fortran 66. It provided modern control structures, unavailable in Fortran 66, to replace GOTOs and statement numbers.", "website": "http://sepwww.stanford.edu/doku.php?id=sep:software:ratfor", "country": [ "United States" ], "originCommunity": [ "Stanford University" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "IF (A .GT. B) THEN\n MAX = A\n ELSE\n MAX = B\n ENDIF" ], "related": [ "fortran", "c", "unix", "ratfiv" ], "summary": "Ratfor (short for Rational Fortran) is a programming language implemented as a preprocessor for Fortran 66. It provided modern control structures, unavailable in Fortran 66, to replace GOTOs and statement numbers.", "pageId": 390257, "created": 2003, "backlinksCount": 35, "revisionCount": 71, "dailyPageViews": 21, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/Ratfor" }, "leachim6": { "filepath": "r/RatFor.ratfor", "fileExtensions": [ "ratfor" ], "example": [ "print *, 'Hello World'\nend" ], "id": "RatFor" }, "rijuRepl": { "example": [ "PRINT *, 'Hello, world!'\nEND\n" ], "id": "https://riju.codes/ratfor" }, "hopl": "https://hopl.info/showlanguage.prx?exp=692", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "ratsno": { "title": "RATSNO", "appeared": 1977, "type": "pl", "reference": [ "https://drhanson.net/pro/publications.html", "https://drhanson.s3.amazonaws.com/storage/documents/ratsno.pdf", "https://semanticscholar.org/paper/0c7f56162f4afe836cd132d440cb3497af345583" ], "country": [ "United States" ], "originCommunity": [ "Yale University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2906", "centralPackageRepositoryCount": 0 }, "ravenscar-profile": { "title": "Ravenscar profile", "appeared": 1997, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "University of York" ], "wikipedia": { "example": [ "pragma Task_Dispatching_Policy (FIFO_Within_Priorities);\npragma Locking_Policy (Ceiling_Locking);\npragma Detect_Blocking;\npragma Restrictions (\n No_Abort_Statements,\n No_Dynamic_Attachment,\n No_Dynamic_Priorities,\n No_Implicit_Heap_Allocations,\n No_Local_Protected_Objects,\n No_Local_Timing_Events,\n No_Protected_Type_Allocators,\n No_Relative_Delay,\n No_Requeue_Statements,\n No_Select_Statements,\n No_Specific_Termination_Handlers,\n No_Task_Allocators,\n No_Task_Hierarchy,\n No_Task_Termination,\n Simple_Barriers,\n Max_Entry_Queue_Length => 1,\n Max_Protected_Entries => 1,\n Max_Task_Entries => 0,\n No_Dependence => Ada.Asynchronous_Task_Control,\n No_Dependence => Ada.Calendar,\n No_Dependence => Ada.Execution_Time.Group_Budget,\n No_Dependence => Ada.Execution_Time.Timers,\n No_Dependence => Ada.Task_Attributes);" ], "related": [ "ada", "spark" ], "summary": "The Ravenscar profile is a subset of the Ada tasking features designed for safety-critical hard real-time computing. It was defined by a separate technical report in Ada 95; it is now part of the Ada 2012 Standard. It has been named after the English village of Ravenscar, the location of the 8th International Real-Time Ada Workshop (IRTAW 8).", "created": 2005, "backlinksCount": 9, "pageId": 1938385, "revisionCount": 29, "dailyPageViews": 16, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Ravenscar_profile" }, "centralPackageRepositoryCount": 0 }, "razor": { "title": "Razor", "appeared": 2010, "type": "template", "country": [ "United States" ], "originCommunity": [ "Microsoft" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/ASP.NET_Razor" }, "monaco": "razor" }, "rbasic": { "title": "rbasic", "appeared": 1985, "type": "pl", "creators": [ "Mike Welch" ], "description": "RBASIC was an in-house language, written by Mike Welch of Hemet, California, in 1985, for Diversified Data Design (DDD), currently in Culver City, California, for use at DDD's customer Medi-Sec, formerly of Santa Monica, CA. DDD was run by Horace Clark at the time, Medi-Sec was run by Neal Green. RBASIC was a dialect of BASIC with an included relational database.", "reference": [ "http://www.troubleshooters.com/lpm/200406/200406.htm" ], "country": [ "United States" ], "originCommunity": [ "Diversified Data Design" ] }, "rbs": { "title": "rbs", "appeared": 2020, "type": "headerLang", "description": "We defined a new language called RBS for type signatures for Ruby 3. The signatures are written in .rbs files which is different from Ruby code. You can consider the .rbs files are similar to .d.ts files in TypeScript or .h files in C/C++/ObjC. The benefit of having different files is it doesn't require changing Ruby code to start type checking. You can opt-in type checking safely without changing any part of your workflow.", "reference": [ "https://developer.squareup.com/blog/the-state-of-ruby-3-typing/" ], "fileExtensions": [ "rbs" ], "country": [ "United States" ], "originCommunity": [ "Square Capital, LLC" ], "related": [ "ruby" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# sig/merchant.rbs\n\nclass Merchant\n attr_reader token: String\n attr_reader name: String\n attr_reader employees: Array[Employee]\n\n def initialize(token: String, name: String) -> void\n\n def each_employee: () { (Employee) -> void } -> void\n | () -> Enumerator[Employee, void]\nend" ] }, "rbscript": { "title": "rbscript", "appeared": 1996, "type": "pl", "reference": [ "https://docs.xojo.com/index.php/RBScript" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "Dim years, days As Integer\nyears = Val(Input(\"\")) // Prompt the user to enter a value\ndays = years * 365" ], "centralPackageRepositoryCount": 0 }, "rc": { "title": "Rc", "appeared": 1989, "type": "pl", "creators": [ "Tom Duff" ], "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "example": [ "a |[2] b # pipe only standard error of a to b — in Bourne shell as a 3>&2 2>&1 >&3 | b\na <>b # opens b as a's standard input and standard output\na <{b} <{c} # becomes a {standard output of b} {standard output of c}" ], "related": [ "bourne-shell", "c", "algol", "bash" ], "summary": "rc (for \"run commands\") is the command line interpreter for Version 10 Unix and Plan 9 from Bell Labs operating systems. It resembles the Bourne shell, but its syntax is somewhat simpler. It was created by Tom Duff, who is better known for an unusual C programming language construct (\"Duff's device\"). A port of the original rc to Unix is part of Plan 9 from User Space. A rewrite of rc for Unix-like operating systems by Byron Rakitzis is also available but includes some incompatible changes. Rc uses C-like control structures instead of ALGOL-like, as the original Bourne shell, except that it uses an if not construct instead of else and has a Bourne-like for loop to iterate over lists. In rc all variables are lists of strings, which eliminates the need for constructs like \"$@\".", "created": 2003, "backlinksCount": 77, "pageId": 171918, "revisionCount": 173, "dailyPageViews": 65, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Rc" }, "rijuRepl": { "example": [ "echo Hello, world!\n" ], "id": "https://riju.codes/rc" }, "wordRank": 4637, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|RC3: Consistency Directed Cache Coherence for x86-64 with RC Extensions|10.1109/PACT.2015.37|9|2|M. Elver and V. Nagarajan|36d51b7e6965e92ff53bd104bb4c10628890f656\n2008|Modelling the universal dielectric response in heterogeneous materials using 3-D RC networks|10.7498/aps.57.957|3|1|Xiao Zhe and Huang Ming and Wu Yue-Feng and Peng Jin-hui|6011397a184e9f89ea4e2cc572cb7bd61b171181" }, "rcpp": { "title": "RC++", "appeared": 2001, "type": "pl", "reference": [ "https://staffwww.dcs.shef.ac.uk/people/J.Marshall/publications/WrightMarshall2003.pdf", "https://semanticscholar.org/paper/18bab5069d96b2d4d4fab9f160c750605f62f2ef" ], "country": [ "United States and United Kingdom" ], "originCommunity": [ "IKuni Inc", "Imperial College London" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7414", "centralPackageRepositoryCount": 0 }, "rdata-format": { "title": "rdata-format", "appeared": 2000, "type": "binaryDataFormat", "reference": [ "https://www.rdocumentation.org/packages/base/versions/3.5.1/topics/save" ], "fileExtensions": [ "Rdata", "rdata", "rda", "RData" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/datacamp" ], "fileType": "binary", "centralPackageRepositoryCount": 0 }, "rdf-schema": { "title": "RDF Schema", "appeared": 1998, "type": "grammarLanguage", "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "example": [ "@prefix rdf: .\n@prefix rdfs: .\n@prefix ex: .\n@prefix zoo: .\nex:dog1 rdf:type ex:animal .\nex:cat1 rdf:type ex:cat .\nex:cat rdfs:subClassOf ex:animal .\nzoo:host rdfs:range ex:animal .\nex:zoo1 zoo:host ex:cat2 ." ], "wikipedia": { "summary": "RDF Schema (Resource Description Framework Schema, variously abbreviated as RDFS, RDF(S), RDF-S, or RDF/S) is a set of classes with certain properties using the RDF extensible knowledge representation data model, providing basic elements for the description of ontologies, otherwise called RDF vocabularies, intended to structure RDF resources. These resources can be saved in a triplestore to reach them with the query language SPARQL. The first version was published by the World-Wide Web Consortium (W3C) in April 1998, and the final W3C recommendation was released in February 2004. Many RDFS components are included in the more expressive Web Ontology Language (OWL).", "backlinksCount": 307, "pageId": 1984223, "dailyPageViews": 161, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/RDF_Schema" } }, "rdf": { "title": "RDF", "appeared": 1997, "type": "dataNotation", "website": "https://www.w3.org/RDF/", "documentation": [ "https://www.w3.org/TR/rdf-concepts/" ], "standsFor": "Resource Description Framework", "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "related": [ "json-ld" ], "hasTypeInference": { "example": "", "value": true }, "hasTriples": { "example": "", "value": true }, "wikipedia": { "example": [ "@prefix rdf: .\n@prefix foaf: .\n@prefix dc: .\n\n\n dc:publisher \"Wikipedia\" ;\n dc:title \"Tony Benn\" ;\n foaf:primaryTopic [\n a foaf:Person ;\n foaf:name \"Tony Benn\"\n ] ." ], "related": [ "owl", "xml", "turtle", "json", "unicode", "sparql", "sql", "python" ], "summary": "The Resource Description Framework (RDF) is a family of World Wide Web Consortium (W3C) specifications originally designed as a metadata data model. It has come to be used as a general method for conceptual description or modeling of information that is implemented in web resources, using a variety of syntax notations and data serialization formats. It is also used in knowledge management applications. RDF was adopted as a W3C recommendation in 1999. The RDF 1.0 specification was published in 2004, the RDF 1.1 specification in 2014.", "pageId": 53847, "dailyPageViews": 815, "created": 2001, "backlinksCount": 698, "revisionCount": 947, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Resource_Description_Framework" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nCreating The Semantic Web With Rdf: Professional Developer's Guide||Johan Hjelm|774684|3.75|4|0", "isbndb": "year|publisher|title|authors|isbn13\n2003|O'Reilly Media|Practical RDF|Shelley Powers|9780596002633\n2014|Morgan Kaufmann|RDF Database Systems: Triples Storage and SPARQL Query Processing|Curé, Olivier and Blin, Guillaume|9780127999579\n20030718|O'Reilly Media, Inc.|Practical RDF|Shelley Powers|9780596550516\n20030718|O'Reilly Media, Inc.|Practical RDF|Shelley Powers|9780596515614\n20170929|Springer Nature|Validating RDF Data|Jose Emilio Labra Gayo; Eric Prud'hommeaux; Iovka Boneva; Dimitris Kontokostas|9783031794780", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|RDFPath: Path Query Processing on Large RDF Graphs with MapReduce|10.1007/978-3-642-25953-1_5|39|2|Martin Przyjaciel-Zablocki and A. Schätzle and Thomas Hornung and G. Lausen|1c57966c41f0d706921a53ae1b431ef0b6b3255a\n2014|Towards the Novel Reasoning among Particles in PSO by the Use of RDF and SPARQL|10.1155/2014/121782|24|0|Iztok Fister and Xin-She Yang and Karin Ljubič and D. Fister and J. Brest and Iztok Fister|27cd8f658901437c5217cd34b927b81ec0eac466\n2008|An RDF Query Language based on Logic Programming|10.1016/j.entcs.2008.04.093|22|2|J. Almendros-Jiménez|2a58d3ac9b4b69b42fa4d06462805850f5312eca\n2003|Experience in Using RDF in Agent-Mediated Knowledge Architectures|10.1007/978-3-540-24612-1_12|19|1|K. Hui and Stuart W. Chalmers and P. Gray and A. Preece|72ba869a6b732d42fe79706bd335b636c9feec38\n2012|A Logic Programming approach for Access Control over RDF|10.4230/LIPIcs.ICLP.2012.381|16|1|Nuno Lopes and S. Kirrane and Antoine Zimmermann and A. Polleres and A. Mileo|7a1b220a2f2f65c8bfc78aa1a0ea768ec366d69a\n2015|Streaming transformation of XML to RDF using XPath-based mappings|10.1145/2814864.2814880|13|2|Jyun-Yao Huang and C. Lange and S. Auer|0bf807c6a9f72cc4ce841fea043c3a84828d66bd\n2008|Taming Existence in RDF Querying|10.1007/978-3-540-88737-9_22|9|0|François Bry and Tim Furche and Clemens Ley and B. Linse and Bruno Marnette|d28233ad60802219774027435000384fcf58065b\n2019|Conformance Test Cases for the RDF Mapping Language (RML)|10.1007/978-3-030-21395-4_12|8|0|Pieter Heyvaert and David Chaves-Fraga and Freddy Priyatna and Óscar Corcho and E. Mannens and R. Verborgh and Anastasia Dimou|2c9fb44d70d374eea5f529f7d4511411bf74a4df\n2018|Mapping Diverse Data to RDF in Practice|10.1007/978-3-030-00671-6_26|7|1|A. Chortaras and G. Stamou|70e9a4efa19345c27c79f930b70b930ba902ab41\n2016|Acacia-RDF: An X10-Based Scalable Distributed RDF Graph Database Engine|10.1109/CLOUD.2016.0075|6|0|Miyuru Dayarathna and Isuru Herath and Yasima Dewmini and Gayan Mettananda and Sameera Nandasiri and Sanath Jayasena and T. Suzumura|846ccf52d4d27043b4ce677e74a2b9768a02268d\n2016|Introducing Acacia-RDF: An X10-Based Scalable Distributed RDF Graph Database Engine|10.1109/IPDPSW.2016.31|5|0|Miyuru Dayarathna and Isuru Herath and Yasima Dewmini and Gayan Mettananda and Sameera Nandasiri and Sanath Jayasena and T. Suzumura|f51c080bc77897a0e247cb354a130a7b200e84a9\n2013|The RDF Pipeline Framework: Automating Distributed, Dependency-Driven Data Pipelines|10.1007/978-3-642-39437-9_5|3|1|David Booth|d255f83821c7c0ef8036e8ef3bd09c2c459b8416\n2014|IDE Integrated RDF Exploration, Access and RDF-Based Code Typing with LITEQ|10.1007/978-3-319-11955-7_75|3|0|Stefan Scheglmann and R. Lämmel and Martin Leinberger and Steffen Staab and Matthias Thimm and E. Viegas|c75d38f98b8d5cf5891c26a11be34cead9a0ba5d\n2017|Generation of Test Questions from RDF Files Using PYTHON and SPARQL|10.1088/1742-6596/806/1/012009|3|0|A. Omarbekova and A. Sharipbay and A. Barlybaev|74dd69c8377529e55c41ae7f8d6585be47653248\n2013|Inductive Triple Graphs: A Purely Functional Approach to Represent RDF|10.1007/978-3-319-04534-4_7|2|0|Jose Emilio Labra Gayo and J. Jeuring and J. Rodríguez|52197d9406e3c246266c046c516baffaaa89a5c5\n2019|C-ASP: Continuous ASP-Based Reasoning over RDF Streams|10.1007/978-3-030-20528-7_4|2|1|Thu-Le Pham and M. Ali and A. Mileo|1fce308b73ab1aa436507c54ffb94d7eee6dcbba\n2019|SQL2SPARQL4RDF: Automatic SQL to SPARQL Conversion for RDF Querying|10.1145/3372938.3372968|1|0|Ahmed Abatal and Khadija Alaoui and L. Alaoui and M. Bahaj|894a309620c4613fe4dddef4da8f7b4f38fe1218" }, "rdfa": { "title": "RDFa", "appeared": 2004, "type": "xmlFormat", "website": "http://rdfa.info/", "country": [ "United States" ], "originCommunity": [ "World Wide Web Consortium" ], "domainName": { "registered": 2006, "awisRank": { "2022": 4531168 }, "name": "rdfa.info" }, "related": [ "json-ld" ], "example": [ "
\n Wikinomics\n Don Tapscott\n 2006-10-01\n
" ], "wikipedia": { "summary": "RDFa (or Resource Description Framework in Attributes) is a W3C Recommendation that adds a set of attribute-level extensions to HTML, XHTML and various XML-based document types for embedding rich metadata within Web documents. The RDF data-model mapping enables its use for embedding RDF subject-predicate-object expressions within XHTML documents. It also enables the extraction of RDF model triples by compliant user agents. The RDFa community runs a wiki website to host tools, examples, and tutorials.", "backlinksCount": 212, "pageId": 4321818, "dailyPageViews": 1419, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/RDFa" }, "isbndb": "" }, "rdml": { "title": "Rapid Development and Maintenance Language", "appeared": 2005, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/LANSA_(development_environment)", "https://www.lansa.com/" ], "standsFor": "Rapid Development and Maintenance Language", "country": [ "United States" ], "originCommunity": [ "IBM" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "rdoc": { "title": "RDoc", "appeared": 2004, "type": "textMarkup", "website": "https://ruby.github.io/rdoc/", "country": [ "Japan" ], "originCommunity": [ "https://github.com/ruby" ], "wikipedia": { "related": [ "ruby-document-format" ], "summary": "RDoc, designed by Dave Thomas, is an embedded documentation generator for the Ruby programming language. It analyzes Ruby source code, generating a structured collection of pages for Ruby objects and methods. Code comments can be added in a natural style. RDoc is included as part of the Ruby core distribution. The RDoc software and format are successors to the Ruby Document format (with associated software RD). RDoc can produce usable documentation even if the target source code does not contain explicit comments as it will still parse the classes, modules, and methods, and list them in the generated API files. RDoc also provides the engine for creating Ruby ri data files, providing access to API information from the command line. RDoc and ri are currently maintained by Eric Hodel and Ryan Davis.", "pageId": 9599474, "created": 2007, "backlinksCount": 14, "revisionCount": 40, "dailyPageViews": 10, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/RDoc" }, "githubLanguage": { "fileExtensions": [ "rdoc" ], "trendingProjectsCount": 0, "type": "prose", "aceMode": "rdoc", "tmScope": "text.rdoc", "wrap": true, "repos": 0, "id": "RDoc" }, "linguistGrammarRepo": { "firstCommit": 2009, "lastCommit": 2010, "committerCount": 3, "commitCount": 13, "sampleCount": 1, "example": [ "= \\RDoc - Ruby Documentation System\n\nhome :: https://github.com/rdoc/rdoc\nrdoc :: http://docs.seattlerb.org/rdoc\nbugs :: https://github.com/rdoc/rdoc/issues\ncode quality :: {\"code}[https://codeclimate.com/github/rdoc/rdoc]\n\n== Description\n\nRDoc produces HTML and command-line documentation for Ruby projects. RDoc\nincludes the +rdoc+ and +ri+ tools for generating and displaying documentation\nfrom the command-line.\n\n== Generating Documentation\n\nOnce installed, you can create documentation using the +rdoc+ command\n\n $ rdoc [options] [names...]\n\nFor an up-to-date option summary, type\n\n $ rdoc --help\n\nA typical use might be to generate documentation for a package of Ruby\nsource (such as RDoc itself).\n\n $ rdoc\n\nThis command generates documentation for all the Ruby and C source\nfiles in and below the current directory. These will be stored in a\ndocumentation tree starting in the subdirectory +doc+.\n\nYou can make this slightly more useful for your readers by having the\nindex page contain the documentation for the primary file. In our\ncase, we could type\n\n % rdoc --main README.rdoc\n\nYou'll find information on the various formatting tricks you can use\nin comment blocks in the documentation this generates.\n\nRDoc uses file extensions to determine how to process each file. File names\nending +.rb+ and +.rbw+ are assumed to be Ruby source. Files\nending +.c+ are parsed as C files. All other files are assumed to\ncontain just Markup-style markup (with or without leading '#' comment\nmarkers). If directory names are passed to RDoc, they are scanned\nrecursively for C and Ruby source files only.\n\nTo generate documentation using +rake+ see RDoc::Task.\n\nTo generate documentation programmatically:\n\n gem 'rdoc'\n require 'rdoc/rdoc'\n\n options = RDoc::Options.new\n # see RDoc::Options\n\n rdoc = RDoc::RDoc.new\n rdoc.document options\n # see RDoc::RDoc\n\n== Writing Documentation\n\nTo write documentation for RDoc place a comment above the class, module,\nmethod, constant, or attribute you want documented:\n\n ##\n # This class represents an arbitrary shape by a series of points.\n\n class Shape\n\n ##\n # Creates a new shape described by a +polyline+.\n #\n # If the +polyline+ does not end at the same point it started at the\n # first pointed is copied and placed at the end of the line.\n #\n # An ArgumentError is raised if the line crosses itself, but shapes may\n # be concave.\n\n def initialize polyline\n # ...\n end\n\n end\n\nThe default comment markup format is the RDoc::Markup format.\nTomDoc[rdoc-ref:RDoc::TomDoc], Markdown[rdoc-ref:RDoc::Markdown] and\nRD[rdoc-ref:RDoc::RD] format comments are also supported. You can set the\ndefault comment format for your entire project by creating a\n.rdoc_options file. See RDoc::Options@Saved+Options for instructions\non creating one. You can also set the comment format for a single file\nthrough the +:markup:+ directive, but this is only recommended if you wish to\nswitch markup formats. See RDoc::Markup@Other+directives.\n\nComments can contain directives that tell RDoc information that it cannot\notherwise discover through parsing. See RDoc::Markup@Directives to control\nwhat is or is not documented, to define method arguments or to break up\nmethods in a class by topic. See RDoc::Parser::Ruby for directives used to\nteach RDoc about metaprogrammed methods.\n\nSee RDoc::Parser::C for documenting C extensions with RDoc.\n\nTo determine how well your project is documented run rdoc -C lib to\nget a documentation coverage report. rdoc -C1 lib includes parameter\nnames in the documentation coverage report.\n\n== Bugs\n\nSee CONTRIBUTING@Bugs for information on filing a bug report. It's OK to file\na bug report for anything you're having a problem with. If you can't figure\nout how to make RDoc produce the output you like that is probably a\ndocumentation bug.\n\n== License\n\nRDoc is Copyright (c) 2001-2003 Dave Thomas, The Pragmatic Programmers.\nPortions (c) 2007-2011 Eric Hodel. Portions copyright others, see individual\nfiles and LEGAL.rdoc for details.\n\nRDoc is free software, and may be redistributed under the terms specified in\nLICENSE.rdoc.\n\n== Warranty\n\nThis software is provided \"as is\" and without any express or implied\nwarranties, including, without limitation, the implied warranties of\nmerchantability and fitness for a particular purpose.\n" ], "url": "https://github.com/joshaven/RDoc.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "rds-format": { "title": "rds-format", "appeared": 2011, "type": "binaryDataFormat", "description": "Can also be an ASCII data format.", "reference": [ "https://groups.google.com/forum/#!search/saveRDS%7Csort:date/r-help-archive/0FDc1dogqIk/60BvIxO2LHoJ" ], "fileExtensions": [ "rds" ], "country": [ "United States" ], "originCommunity": [ "https://groups.google.com/g/r-help-archive" ], "fileType": "binary", "centralPackageRepositoryCount": 0 }, "react-native": { "title": "React Native", "appeared": 2015, "type": "library", "creators": [ "Ben Alpert" ], "website": "http://www.reactnative.com/", "country": [ "United States" ], "originCommunity": [ "Facebook, Inc or TheFacebook, Inc" ], "domainName": { "registered": 2015, "awisRank": { "2022": 2683585 }, "name": "reactnative.com" }, "githubRepo": { "stars": 103571, "forks": 22211, "subscribers": 3667, "created": 2015, "updated": 2022, "firstCommit": 2015, "description": "A framework for building native applications using React", "issues": 2183, "url": "https://github.com/facebook/react-native" }, "leachim6": { "filepath": "r/React Native.js", "example": [ "import React from \"react\";\nimport { Text, View } from \"react-native\";\n\nexport default function HelloWorld() {\n return (\n \n Hello World\n \n );\n}\n" ], "id": "React Native" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming React Native||Dotan Nahum|51202148|4.67|3|1" }, "readable-lisp": { "title": "readable-lisp", "appeared": 2013, "type": "pl", "website": "https://readable.sourceforge.io/", "reference": [ "https://www.reddit.com/r/lisp/comments/1pyg07/why_not_use_indentations_rather_than_numerous/" ], "country": [ "United States" ], "originCommunity": [ "https://sourceforge.net/p/readable/mailman" ], "domainName": { "name": "readable.sourceforge.io" } }, "readable": { "title": "Readable", "appeared": 2018, "type": "textMarkup", "creators": [ "Lépine Kong" ], "description": "The ReAdABLE Human Format aims at Agile Documentation by making WRITING and READING document easier for End User and Developer alike, while allowing a high degree of flexibility. Its primary goal is to generate Markdown (and conversion to other formats in the future) while being even simpler (less code to memorize) and richer (adding meta-data is straightforward and creating new semantics is easy).", "website": "https://readablehumanformat.com/", "reference": [ "https://readable.red/" ], "country": [ "France" ], "originCommunity": [ "https://github.com/lepinekong/readablehumanformat/issues" ], "domainName": { "name": "readablehumanformat.com" }, "writtenIn": [ "red" ], "example": [ "Red [\n Title: \"How to Write Good Article\"\n Build: 1.0.0.4\n Credits: [\"Sibeesh Venu\"]\n Owners: [\"Lépine Kong\"]\n References: [\n https://www.c-sharpcorner.com/article/how-to-write-good-articles/\n ]\n File: howtowritegoodarticle.red.red\n Output-files: [howtowritegoodarticle.red.md]\n Categories: [Blogging]\n Tags: [Markdown Blogging Writing Documentation Templating Scaffolding]\n Dates: [\n Creation: 2018-05-12 19:13:42\n Update: 2018-05-15 19:09:59\n ]\n Languages: [\"english\"]\n]\n\nArticle: [\n\n Title: {How To Write Good Articles}\n\n Source: [\n .title: {ReAdABLE Source (version 1.0)}\n .text: {[http://readablehumanformat.com/examples/howtowritegoodarticle.red](https://github.com/lepinekong/readablehumanformat/blob/master/examples/howtowritegoodarticle.red)\n }\n .Published-Url: http://readablehumanformat.com/create.codesnippet.fast \n ] \n\n Credit: [\n .title: {Credit}\n .text: {\n [\"How To Write Good Articles\" by *Sibeesh Venu*](https://www.c-sharpcorner.com/article/how-to-write-good-articles/)\n }\n ]\n\n Point-1: [\n .title: {Point 1: Introduction}\n .text: {\n Replace this paragraph with your own content, guidance and example are kept available in .guidance and .example fields (metadata) within the ReAdABLE source if you need to remember.\n *Guidance:*\n >An introduction is very important when you write an article. A good introduction can make the reader want to read further. Trust me, it is very useful too. In this part you can describe what exactly you are going to say/do in the rest of the article. It must be brief. And please never use any code blocks in your introduction, that is never meant to be there. This is the part which lets your readers understand where/what exactly you are intending to do. \n *Example:*\n \n >I am neither an expert nor a guru. But still I suppose I have improved by writing articles for the past two years. I still remember my first article, there were so many mistakes. Remember one thing: “Mistakes are the key to success.” Here I will point out a few things which I follow while writing articles. Please feel free to add your own points to this article. I hope you will like this.\n }\n\n .image: https://i.imgur.com/rNmBuuv.png\n\n .guidance: {\n An introduction is very important when you write an article. A good introduction can make the reader want to read further. Trust me, it is very useful too. In this part you can describe what exactly you are going to say/do in the rest of the article. It must be brief. And please never use any code blocks in your introduction, that is never meant to be there. This is the part which lets your readers understand where/what exactly you are intending to do. \n }\n .example: {\n I am neither an expert nor a guru. But still I suppose I have improved by writing articles for the past two years. I still remember my first article, there were so many mistakes. Remember one thing: “Mistakes are the key to success.” Here I will point out a few things which I follow while writing articles. Please feel free to add your own points to this article. I hope you will like this.\n }\n ]\n\n Point-2: [\n\n .title: {Point 2: Background}\n .text: {\n In this part, you can explain what made you write this article. You can explain the problems you faced here, or when you had this problem. This should be brief too, here you can also include source code. Please do remember that this is just the background, so it is not advisable to include full source code and explain it here.\n }\n .guidance: {\n In this part, you can explain what made you write this article. You can explain the problems you faced here, or when you had this problem. This should be brief too, here you can also include source code. Please do remember that this is just the background, so it is not advisable to include full source code and explain it here. \n }\n .example: {\n Example: Last week one of my friends asked this question: \"How do you write good articles?\" I am dedicating this article to him. I hope he will like this. \n }\n ]\n\n Point-3: [\n .title: {Point 3: What are you going to do?}\n .text: {\n Here you can explain the things which you are going to do in this article. You can list them for better readability. You can explain these points one by one. You can also add some code snippets. But whenever you add any code, please try to explain even if it is basic. That will help some beginners to understand things more easily. You may feel that this basic explanation is not necessary as you have so much experience and you may be good at it. But what about the beginners? I always believe they are the real beneficiaries of your articles. We must concentrate on both kinds of users; i.e., beginners and experienced.\n }\n .image: https://csharpcorner-mindcrackerinc.netdna-ssl.com/article/how-to-write-good-articles/Images/What-you-are-going-to-do.jpg\n\n .guidance: {\n Here you can explain the things which you are going to do in this article. You can list them for better readability. You can explain these points one by one. You can also add some code snippets. But whenever you add any code, please try to explain even if it is basic. That will help some beginners to understand things more easily. You may feel that this basic explanation is not necessary as you have so much experience and you may be good at it. But what about the beginners? I always believe they are the real beneficiaries of your articles. We must concentrate on both kinds of users; i.e., beginners and experienced.\n } \n\n\n ]\n\n Point-4: [\n .title: {Point 4: How are you going to do it?}\n .text: {\n This can be the continuation of point three. This is where you can explain the possible ways that you can fix your problem, or the possible ways to achieve the same tasks. Any tasks can be achieved in different ways right? So when you write any article, you must think from all perspectives.\n This will make your article rich in content. And this is where you must concentrate more on the coding part. When you write code in your article, it must be formatted well. If you use WordPress as a CMS (Content Management System) for your blog, you can go for any syntax highlighter plugins, or you can customize your own. If you post the article in any of the social communities, please use their formatting options.\n If you have any images which explain the workflow for any tasks, it is always advisable to include those. An image is more understandable than reading the content, but always limit yourself to not include more than 10 images per article. When you include the images, please try to convert them to a particular size (example: width: 650 PX), this will make your article look good. But no worries if you have a low resolution image, and if you think enlarging that will cause any clarity issues, you can always use the same without conversion.\n One thing you must remember is that you can always include all the things you have tried and what the output was that you got from it. If you do so, your reader will see that if he or she does that, they will get the same output. So it is not only about the the scenario which works fine, but also about the errors/problems.\n }\n .guidance: {\n This can be the continuation of point three. This is where you can explain the possible ways that you can fix your problem, or the possible ways to achieve the same tasks. Any tasks can be achieved in different ways right? So when you write any article, you must think from all perspectives.\n This will make your article rich in content. And this is where you must concentrate more on the coding part. When you write code in your article, it must be formatted well. If you use WordPress as a CMS (Content Management System) for your blog, you can go for any syntax highlighter plugins, or you can customize your own. If you post the article in any of the social communities, please use their formatting options.\n If you have any images which explain the workflow for any tasks, it is always advisable to include those. An image is more understandable than reading the content, but always limit yourself to not include more than 10 images per article. When you include the images, please try to convert them to a particular size (example: width: 650 PX), this will make your article look good. But no worries if you have a low resolution image, and if you think enlarging that will cause any clarity issues, you can always use the same without conversion.\n One thing you must remember is that you can always include all the things you have tried and what the output was that you got from it. If you do so, your reader will see that if he or she does that, they will get the same output. So it is not only about the the scenario which works fine, but also about the errors/problems.\n }\n\n ]\n\n Point-5: [\n\n .title: {Point 5: Always include output}\n .text: {\n An output is the outcome of what we tried, right? So what if you don't include that? Isn’t that bad? You can include the output as an image or any content. It can be any result set too.\n }\n .guidance: {\n An output is the outcome of what we tried, right? So what if you don't include that? Isn’t that bad? You can include the output as an image or any content. It can be any result set too.\n } \n ]\n\n Point-6: [\n .title: {Point 6: Include source code as a downloadable format}\n .text: {\n Please add source code as a downloadable format whenever possible. This will definitely help your reader, so that he/she doesn’t need to worry about the initial set up. We all are a community, guys, and we love helping each other. Am I right?\n }\n .guidance: {\n Please add source code as a downloadable format whenever possible. This will definitely help your reader, so that he/she doesn’t need to worry about the initial set up. We all are a community, guys, and we love helping each other. Am I right?\n } \n ]\n\n Point-7: [\n .title: {Point 7: Format the entire content}\n .text: {\n There are so many things you must concentrate on when it comes to formatting. I am listing a few of them here.\n - Use the same font for the entire article\n - Use bold for the headings\n - Highlight the lines, if it is very important (Example: Notes)\n - Use code formatter when you write codes\n - Resize and align images properly\n - Make sure that that headings start with a capital letter (CamelCasing) \n }\n .guidance: {\n There are so many things you must concentrate on when it comes to formatting. I am listing a few of them here.\n - Use the same font for the entire article\n - Use bold for the headings\n - Highlight the lines, if it is very important (Example: Notes)\n - Use code formatter when you write codes\n - Resize and align images properly\n - Make sure that that headings start with a capital letter (CamelCasing) \n } \n ]\n\n Point-8: [\n\n .title: {Point 8: Give credit}\n .text: {\n This is very important. Whenever you take something from any site, please try to give credit to the content owner by providing the links/name. For example, if you are taking an image from any site, you can include the site name just below the image. Trust me, this will make you genuine. And in the end, it is all about being genuine right?\n }\n .guidance: {\n This is very important. Whenever you take something from any site, please try to give credit to the content owner by providing the links/name. For example, if you are taking an image from any site, you can include the site name just below the image. Trust me, this will make you genuine. And in the end, it is all about being genuine right?\n } \n ]\n\n Point-9: [\n\n .title: {Point 9: Write a conclusion}\n .text: {\n The conclusion is the last part of your article; you can summarize the things you have written here. And also if you want, you can always ask some questions to your readers so that the bond between you and your readers will be in multibind format (Yes, like we have in Angular JS. LOL). You can always ask for feedback; feedback is something that we all are looking for. Each and every piece of feedback is valuable whether it is negative or positive. If you get any negative feedback, be happy and try to improve on the things that are being suggested.\n In a speech in South Africa in 1890 Mahatma Gandhi said this:\n * * “A customer is the most important visitor on our premises. He is not dependent on us. We are dependent on him. He is not an interruption of our work. He is the purpose of it. He is not an outsider of our business. He is part of it. We are not doing him a favour by serving him. He is doing us a favour by giving us the opportunity to do so.”\n }\n .guidance: {\n The conclusion is the last part of your article; you can summarize the things you have written here. And also if you want, you can always ask some questions to your readers so that the bond between you and your readers will be in multibind format (Yes, like we have in Angular JS. LOL). You can always ask for feedback; feedback is something that we all are looking for. Each and every piece of feedback is valuable whether it is negative or positive. If you get any negative feedback, be happy and try to improve on the things that are being suggested.\n In a speech in South Africa in 1890 Mahatma Gandhi said this:\n * * “A customer is the most important visitor on our premises. He is not dependent on us. We are dependent on him. He is not an interruption of our work. He is the purpose of it. He is not an outsider of our business. He is part of it. We are not doing him a favour by serving him. He is doing us a favour by giving us the opportunity to do so.”\n } \n ]\n]\n\nunless exists? lib: %lib/ReAdABLE.Human.Format.lib.red [\n lib: http://readablehumanformat.com/lib.red\n]\n\ndo read lib\ndo read .to-file \"C:\\rebol\\.system.user\\.code\\.domains\\.apps\\Authoring\\libraries\\.system.user.apps.authoring.library.red\"\n\nmarkdown-gen\n\n; deploy to .github local workspace\ntry [\n .copy-file %howtowritegoodarticle.red \n .copy-file %howtowritegoodarticle.md \n]" ], "githubRepo": { "firstCommit": 2018, "stars": 7, "forks": 1, "subscribers": 4, "created": 2018, "updated": 2021, "description": "ReAdABLE Human Format", "issues": 9, "url": "https://github.com/lepinekong/readablehumanformat" }, "repoStats": { "firstCommit": 2018, "commits": 112, "committers": 2, "files": 23 }, "isbndb": "year|publisher|title|authors|isbn13\n2022|Packt Publishing|Crystal Programming: A project-based introduction to building efficient, safe, and readable web and CLI applications|Dietrich, George and Bernal, Guilherme|9781801818674\n2019-01-25T00:00:01Z|Packt Publishing|Hands-On Data Structures and Algorithms with Rust: Learn programming techniques to build effective, maintainable, and readable code in Rust 2018|Matzinger, Claus|9781788995528\n2012|O'Reilly Media|Maintainable JavaScript: Writing Readable Code|Zakas, Nicholas C.|9781449327682\n19940406|World Scientific Publishing|Machine Proofs In Geometry: Automated Production Of Readable Proofs For Geometry Theorems|ShangChing Chou; XiaoShan Gao; JingZhong Zhang|9789812798152" }, "real-time-cmix": { "title": "Real-time Cmix", "appeared": 1992, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Princeton University", "Columbia University", "University of Virginia" ], "wikipedia": { "related": [ "tcp", "linux", "minc", "c", "supercollider" ], "summary": "Real-Time Cmix (RTcmix) is one of the MUSIC-N family of computer music programming languages. RTcmix is descended from the MIX program developed by Paul Lansky at Princeton University in 1978 to perform algorithmic composition using digital audio soundfiles on a IBM 3031 mainframe computer. After synthesis functions were added, the program was renamed Cmix in the 1980s. Real-time capability was added by Brad Garton and David Topper in the mid-1990s, with support for TCP socket connectivity, interactive control of the scheduler, and object-oriented embedding of the synthesis engine into fully featured applications. Over the years Cmix/RTcmix has run on a variety of computer platforms and operating systems, including NeXT, Sun Microsystems, IRIX, Linux, and Mac OS X. It is and has always been an open source project, differentiating it from commercial synthesizers and music software. It is currently developed by a group of computer music researchers at Princeton, Columbia University, and the University of Virginia. RTcmix has a number of unique (or highly unusual) features when compared with other synthesis and signal processing languages. For one, it has a built-in MINC parser, which enables the user to write C-style code within the score file, extending its innate capability for algorithmic composition and making it closer in some respects to later music software such as SuperCollider and Max/MSP. It uses a single-script instruction file (the score file), and synthesis and signal processing routines (called instruments) exist as compile shared libraries. This is different from MUSIC-N languages such as Csound where the instruments exist in a second file written in a specification language that builds the routines out of simple building blocks (organized as opcodes or unit generators). RTcmix has similar functionality to Csound and other computer music languages, however, and their shared lineage means that scripts written for one language will be extremely familiar-looking (if not immediately comprehensible) to users of the other language.", "created": 2004, "backlinksCount": 158, "pageId": 479728, "revisionCount": 34, "dailyPageViews": 9, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/Real-time_Cmix" }, "centralPackageRepositoryCount": 0 }, "real-time-concurrent-c": { "title": "Real-Time Concurrent C", "appeared": 1991, "type": "pl", "reference": [ "https://www-ccs.cs.umass.edu/spring/internal/rts_library/node35.html", "https://semanticscholar.org/paper/a99af939a0ed0b105862d6a569ad6f8864e0a4be" ], "country": [ "United States" ], "originCommunity": [ "AT&T" ], "supersetOf": [ "cpp" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7878", "centralPackageRepositoryCount": 0 }, "real-time-euclid": { "title": "Real-Time Euclid", "appeared": 1986, "type": "pl", "reference": [ "https://www.sciencedirect.com/science/article/pii/S1474667017512653", "https://semanticscholar.org/paper/d3919948faeff1e0b6d1c1c6ebf98aa735fd7937" ], "country": [ "United States" ], "originCommunity": [ "New Jersey Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1263", "centralPackageRepositoryCount": 0 }, "real-time-mentat": { "title": "Real-Time Mentat", "appeared": 1989, "type": "pl", "description": "Real-time Mentat, a programming environment designed to simplify the task of programming real-time applications in distributed and parallel environments, is described. It is based on the same data-driven computation model and object-oriented programming paradigm as Mentat.", "reference": [ "https://semanticscholar.org/paper/faed7ee4901b4a18b1704db121f0737ef2c9337e" ], "country": [ "United States" ], "originCommunity": [ "University of Virginia" ], "related": [ "mentat" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1517", "centralPackageRepositoryCount": 0 }, "realbasic": { "title": "REALBasic (now Xojo)", "appeared": 1996, "type": "pl", "description": "REALBasic is now known as Xojo.", "country": [ "United States" ], "originCommunity": [ "https://github.com/xojo" ], "related": [ "xojo" ], "githubLanguage": { "fileExtensions": [ "rbbas", "rbfrm", "rbmnu", "rbres", "rbtbar", "rbuistate" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.vbnet", "repos": 99, "id": "REALbasic" }, "githubBigQuery": { "repos": 17, "users": 5, "id": "REALbasic" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:REALbasic" }, "reason": { "title": "Reason", "appeared": 2016, "type": "pl", "website": "https://reasonml.github.io/", "documentation": [ "https://reasonml.github.io/docs/en/what-and-why" ], "aka": [ "reasonml" ], "originCommunity": [ "Facebook" ], "domainName": { "awisRank": { "2017": 272174, "2022": 636094 }, "name": "reasonml.github.io" }, "compilesTo": [ "ocaml" ], "writtenIn": [ "ocaml" ], "related": [ "rust", "elm", "purescript", "fable-lang", "clojurescript", "swift", "haxe" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasDestructuring": { "example": "type person = {name: string, age: int};\nlet somePerson = {name: \"Guy\", age: 30};\nlet {name, age} = somePerson;", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "// 0[oO][0-7][0-7_]*", "value": true }, "hasHexadecimals": { "example": "// 0[xX][\\da-fA-F][\\da-fA-F_]*", "value": true }, "hasFloats": { "example": "// -?\\d[\\d_]*(.[\\d_]*)?([eE][+\\-]?\\d[\\d_]*)", "value": true }, "hasIntegers": { "example": "// \\d[\\d_]*", "value": true }, "hasBinaryNumbers": { "example": "// 0[bB][01][01_]*", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "print_string" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "as", "assert", "begin", "class", "constraint", "do", "done", "downto", "else", "end", "exception", "external", "false", "for", "fun", "esfun", "function", "functor", "if", "in", "include", "inherit", "initializer", "lazy", "let", "switch", "module", "pub", "mutable", "new", "nonrec", "object", "of", "open", "pri", "rec", "sig", "struct", "then", "to", "true", "try", "type", "val", "virtual", "when", "while", "with" ], "example": [ "type schoolPerson = Teacher | Director | Student(string);\n\nlet greeting = person =>\n switch (person) {\n | Teacher => \"Hey Professor!\"\n | Director => \"Hello Director.\"\n | Student(\"Richard\") => \"Still here Ricky?\"\n | Student(anyOtherName) => \"Hey, \" ++ anyOtherName ++ \".\"\n };" ], "githubRepo": { "stars": 9670, "forks": 448, "subscribers": 188, "created": 2015, "updated": 2022, "firstCommit": 2016, "description": "Simple, fast & type safe code that leverages the JavaScript & OCaml ecosystems", "issues": 474, "url": "https://github.com/facebook/reason" }, "repoStats": { "firstCommit": 2016, "commits": 2223, "committers": 159, "files": 598 }, "githubLanguage": { "fileExtensions": [ "re", "rei" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "rust", "codemirrorMode": "rust", "codemirrorMimeType": "text/x-rustsrc", "tmScope": "source.reason", "repos": 1924, "id": "Reason" }, "githubBigQuery": { "repos": 24, "users": 23, "id": "Reason" }, "pygmentsHighlighter": { "filename": "ml.py", "fileExtensions": [ "re", "rei" ], "id": "ReasonML" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 1, "commitCount": 10, "sampleCount": 5, "example": [ "type component = {displayName: string};\n\nlet module Bar = {\n let createElement c::c=? children => {\n displayName: \"test\"\n };\n};\n\nlet module Nesting = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module Much = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module Foo = {\n let createElement a::a=? b::b=? children => {\n displayName: \"test\"\n };\n};\n\nlet module One = {\n let createElement\n test::test=?\n foo::foo=?\n children => {\n displayName: \"test\"\n };\n let createElementobvioustypo\n test::test\n children => {\n displayName: \"test\"\n };\n};\n\nlet module Two = {\n let createElement foo::foo=? children => {\n displayName: \"test\"\n };\n};\n\nlet module Sibling = {\n let createElement\n foo::foo=?\n (children: list component) => {\n displayName: \"test\"\n };\n};\n\nlet module Test = {\n let createElement yo::yo=? children => {\n displayName: \"test\"\n };\n};\n\nlet module So = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module Foo2 = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module Text = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module Exp = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module Pun = {\n let createElement intended::intended=? children => {\n displayName: \"test\"\n };\n};\n\nlet module Namespace = {\n let module Foo = {\n let createElement\n intended::intended=?\n anotherOptional::x=100\n children => {\n displayName: \"test\"\n };\n };\n};\n\nlet module LotsOfArguments = {\n let createElement\n argument1::argument1=?\n argument2::argument2=?\n argument3::argument3=?\n argument4::argument4=?\n argument5::argument5=?\n argument6::argument6=?\n children => {\n displayName: \"test\"\n };\n};\n\nlet div argument1::argument1=? children => {\n displayName: \"test\"\n};\n\nlet module List1 = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module List2 = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet module List3 = {\n let createElement children => {\n displayName: \"test\"\n };\n};\n\nlet (/><) a b => a + b;\n\nlet (><) a b => a + b;\n\nlet (/>) a b => a + b;\n\nlet (><\\/) a b => a + b;\n\nlet tag1 = 5 />< 6;\n\nlet tag2 = 5 >< 7;\n\nlet tag3 = 5 /> 7;\n\nlet tag4 = 5 ><\\/ 7;\n\nlet b = 2;\n\nlet selfClosing = ;\n\nlet selfClosing2 = ;\n\nlet selfClosing3 =\n ;\n\nlet a = a + 2) /> ;\n\nlet a3 = ;\n\nlet a4 =\n \n \n \n ;\n\nlet a5 = \"testing a string here\" ;\n\nlet a6 =\n \n \"testing a string here\" \n \n \"another string\" \n \n (2 + 4) \n ;\n\nlet intended = true;\n\nlet punning = ;\n\nlet namespace = ;\n\nlet c = ;\n\nlet d = ;\n\nlet spaceBefore =\n ;\n\nlet spaceBefore2 = ;\n\nlet siblingNotSpaced =\n ;\n\nlet jsxInList = [];\n\nlet jsxInList2 = [];\n\nlet jsxInListA = [];\n\nlet jsxInListB = [];\n\nlet jsxInListC = [];\n\nlet jsxInListD = [];\n\nlet jsxInList3 = [, , ];\n\nlet jsxInList4 = [, , ];\n\nlet jsxInList5 = [, ];\n\nlet jsxInList6 = [, ];\n\nlet jsxInList7 = [, ];\n\nlet jsxInList8 = [, ];\n\nlet testFunc b => b;\n\nlet jsxInFnCall = testFunc ;\n\nlet lotsOfArguments =\n \n \n ;\n\nlet lowerCase =
;\n\nlet b = 0;\n\nlet d = 0;\n\n/*\n * Should pun the first example:\n */\nlet a = 5 ;\n\nlet a = 5 ;\n\nlet a = 5 ;\n\nlet a = 0.55 ;\n\nlet a = Foo.createElement \"\" [@JSX];\n\nlet ident = a ;\n\nlet fragment1 = <> ;\n\nlet fragment2 = <> ;\n\nlet fragment3 = <> ;\n\nlet fragment4 = <> ;\n\nlet fragment5 = <> ;\n\nlet fragment6 = <> ;\n\nlet fragment7 = <> ;\n\nlet fragment8 = <> ;\n\nlet fragment9 = <> 2 2 2 2 ;\n\nlet fragment10 = <> 2.2 3.2 4.6 1.2 ;\n\nlet fragment11 = <> \"str\" ;\n\nlet fragment12 = <> (6 + 2) (6 + 2) (6 + 2) ;\n\nlet fragment13 = <> fragment11 fragment11 ;\n\nlet listOfItems1 = 1 2 3 4 5 ;\n\nlet listOfItems2 =\n 1.0 2.8 3.8 4.0 5.1 ;\n\nlet listOfItems3 =\n fragment11 fragment11 ;\n\n/*\n * Several sequential simple jsx expressions must be separated with a space.\n */\nlet thisIsRight a b => ();\n\nlet tagOne children => ();\n\nlet tagTwo children => ();\n\n/* thisIsWrong ; */\nthisIsRight ;\n\n/* thisIsWrong ; */\nthisIsRight ;\n\nlet a children => ();\n\nlet b children => ();\n\nlet thisIsOkay =\n ;\n\nlet thisIsAlsoOkay =\n ;\n\n/* Doesn't make any sense, but suppose you defined an\n infix operator to compare jsx */\n < ;\n\n > ;\n\n < ;\n\n > ;\n\nlet listOfListOfJsx = [<> ];\n\nlet listOfListOfJsx = [<> ];\n\nlet listOfListOfJsx = [\n <> ,\n <> \n];\n\nlet listOfListOfJsx = [\n <> ,\n <> ,\n ...listOfListOfJsx\n];\n\nlet sameButWithSpaces = [<> ];\n\nlet sameButWithSpaces = [<> ];\n\nlet sameButWithSpaces = [\n <> ,\n <> \n];\n\nlet sameButWithSpaces = [\n <> ,\n <> ,\n ...sameButWithSpaces\n];\n\n/*\n * Test named tag right next to an open bracket.\n */\nlet listOfJsx = [];\n\nlet listOfJsx = [];\n\nlet listOfJsx = [, ];\n\nlet listOfJsx = [, , ...listOfJsx];\n\nlet sameButWithSpaces = [];\n\nlet sameButWithSpaces = [];\n\nlet sameButWithSpaces = [, ];\n\nlet sameButWithSpaces = [\n ,\n ,\n ...sameButWithSpaces\n];\n\n\n/**\n * Test no conflict with polymorphic variant types.\n */\ntype thisType = [ | `Foo | `Bar];\n\ntype t 'a = [< thisType] as 'a;\n\nlet asd =\n \"a\" \"b\" [@foo];\n\nlet asd2 =\n One.createElementobvioustypo\n test::false\n [\"a\", \"b\"]\n [@JSX]\n [@foo];\n\nlet span\n test::(test: bool)\n foo::(foo: int)\n children => 1;\n\nlet asd =\n \"a\" \"b\" [@foo];\n\n/* \"video\" call doesn't end with a list, so the expression isn't converted to JSX */\nlet video test::(test: bool) children => children;\n\nlet asd2 = video test::false 10 [@JSX] [@foo];\n\nlet div children => 1;\n\n((fun () => div) ()) [] [@JSX];\n\nlet myFun () =>\n <>\n \n \n \n \n \n \n \n \n \n \n \n ;\n\nlet myFun () => <> ;\n\nlet myFun () =>\n <>\n \n \n \n \n \n \n \n \n \n \n \n ;\n\n\n/**\n * Children should wrap without forcing attributes to.\n */\n\n \n \n \n \n;\n/**\n * Failing test cases:\n */\n/* let res = ) > */\n/* */\n/* ; */\n/* let res = ) />; */\n" ], "url": "https://github.com/reasonml-editor/language-reason" }, "languageServerProtocolProject": [ "https://github.com/jaredly/reason-language-server\nwrittenIn ocaml" ], "leachim6": { "filepath": "r/Reason.re", "fileExtensions": [ "re" ], "example": [ "print_string \"Hello World\"\n" ], "id": "Reason" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Reason", "rijuRepl": { "example": [ "print_string(\"Hello, world!\\n\");" ], "id": "https://riju.codes/reasonml" }, "tryItOnline": "reason", "officialBlogUrl": [ "https://reasonml.github.io/blog/" ], "meetup": { "memberCount": 901, "groupCount": 11, "url": "https://www.meetup.com/topics/reasonml" }, "fileType": "text", "wordRank": 1246, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2006|Pc Publishing|Fast Guide To Propellerhead Reason|Hollin Jones; Debbie Poyser; Derek Johnson|9781870775274", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|Interval propagation to reason about sets: Definition and implementation of a practical language|10.1007/BF00137870|177|14|C. Gervet|6532f8973c4640b8feec743a9937f02ac16f6a38\n2006|How to reason with OWL in a logic programming system|10.1109/RULEML.2006.14|33|1|M. Krötzsch and P. Hitzler and Denny Vrandečić and Michael Sintek|a022506f8daec551f86ec601b1e9e972a86271ee\n2019|Semantic Query Integration With Reason|10.22152/programming-journal.org/2019/3/13|6|0|Philipp Seifer and Martin Leinberger and R. Lämmel and Steffen Staab|7f31fa37c6311d844637ea126e1c47dd5fd387a9" }, "rebeca-modeling-language": { "title": "Rebeca Modeling Language", "appeared": 2004, "type": "pl", "creators": [ "Marjan Sirjani" ], "website": "https://rebeca-lang.org", "reference": [ "https://rebeca-lang.org/assets/theses/Mapping-UML-Diagrams-to-the-Reactive-Object-Language-(Rebeca).pdf", "https://rebeca-lang.org/assets/theses/Mapping-UML-Diagrams-to-the-Reactive-Object-Language-(Rebeca).pdf#glo%3Arebeca" ], "country": [ "Iran" ], "originCommunity": [ "Sharif University of Technology" ], "githubRepo": { "firstCommit": 2015, "stars": 3, "forks": 2, "subscribers": 1, "created": 2015, "updated": 2022, "issues": 1, "url": "https://github.com/rebeca-lang/org.rebecalang.compiler" }, "repoStats": { "firstCommit": 2015, "commits": 128, "committers": 7, "files": 291 }, "wikipedia": { "summary": "Rebeca (acronym for Reactive Objects Language) is an actor-based modeling language with a formal foundation, designed in an effort to bridge the gap between formal verification approaches and real applications. It can be considered as a reference model for concurrent computation, based on an operational interpretation of the actor model. It is also a platform for developing object-based concurrent systems in practice. Besides having an appropriate and efficient way for modeling concurrent and distributed systems, one needs a formal verification approach to ensure their correctness. Rebeca is supported by a set of verification tools. Earlier tools provided a front-end to work with Rebeca code, and to translate the Rebeca code into input languages of well-known and mature model checkers (like SPIN and NuSMV) and thus, were able to verify their properties. Rebeca, since 2005, is supported by a direct model checker based on Modere (the Model checking Engine of Rebeca). Modular verification and abstraction techniques are used to reduce the state space and make it possible to verify complicated reactive systems. Besides these techniques, Modere supports partial order reduction and symmetry reduction.", "created": 2017, "backlinksCount": 3, "pageId": 5999175, "revisionCount": 1, "dailyPageViews": 4, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Rebeca_Modeling_Language" }, "centralPackageRepositoryCount": 0 }, "rebol": { "title": "REBOL", "appeared": 1997, "type": "pl", "creators": [ "Carl Sassenrath" ], "website": "http://www.rebol.com", "documentation": [ "http://www.rebol.com/docs.html" ], "standsFor": "Relative Expression-Based Object Language", "fileExtensions": [ "r", "reb" ], "originCommunity": [ "REBOL Technologies" ], "domainName": { "registered": 1997, "awisRank": { "2022": 1353792 }, "name": "rebol.com" }, "canWriteToDisk": { "example": "write %helloworld.txt \"Hello, world!^/\"", "value": true }, "hasComments": { "example": "", "value": true }, "hasExceptions": { "example": "catch [throw 22 print \"You'll never see this.\"]\n\ntry/except [read %does_not_exist] [print \"File not found\"]", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasHomoiconicity": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasLists": { "example": "my-list: [1 two 3.0 \"four\"]", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"\n{He said \"That looks good!\"}", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "print", "probe" ] ], "stringToken": [ [ "\"", "{", "}" ] ], "booleanTokens": [ [ "true", "false" ] ], "wikipedia": { "example": [ "Digit: charset [#\"0\" - #\"9\"]\nValue: [some Digit | \"(\" Expr \")\"]\nProduct: [Value any [[\"*\"| \"/\"] Value]]\nSum: [Product any [[\"+\"| \"-\"] Product]]\nExpr: Sum\nparse/all \"12+13\" Expr" ], "related": [ "self", "forth", "lisp", "logo", "json", "red", "javascript", "c", "algol", "s-expressions", "peg" ], "summary": "Rebol ( REB-əl; historically REBOL) is a cross-platform data exchange language and a multi-paradigm dynamic programming language designed by Carl Sassenrath for network communications and distributed computing. It introduces the concept of dialecting: small, optimized, domain-specific languages for code and data, which is also the most notable property of the language according to its designer Carl Sassenrath: Although it can be used for programming, writing functions, and performing processes, its greatest strength is the ability to easily create domain-specific languages or dialects Douglas Crockford, known for his involvement in the development of JavaScript, has described Rebol as \"a more modern language, but with some very similar ideas to Lisp, in that it's all built upon a representation of data which is then executable as programs\" and as one of JSON's influences. Originally, the language and its official implementation were proprietary and closed source, developed by REBOL Technologies. Following discussion with Lawrence Rosen, the Rebol version 3 interpreter was released under the Apache 2.0 license on December 12, 2012. Older versions are only available in binary form, and no source release for them is planned. Rebol has been used to program Internet applications (both client- and server-side), database applications, utilities, and multimedia applications.", "pageId": 26384, "dailyPageViews": 21, "created": 2013, "backlinksCount": 77, "revisionCount": 1, "appeared": 1997, "fileExtensions": [ "r", "reb" ], "url": "https://en.wikipedia.org/wiki/REBOL" }, "githubLanguage": { "fileExtensions": [ "reb", "r", "r2", "r3", "rebol" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.rebol", "repos": 30469, "id": "Rebol" }, "githubBigQuery": { "repos": 1647, "users": 1543, "id": "Rebol" }, "pygmentsHighlighter": { "filename": "rebol.py", "fileExtensions": [ "r", "r3", "reb" ], "id": "REBOL" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 1, "commitCount": 7, "sampleCount": 6, "example": [ "Rebol []\nhello: func [] [\n print \"hello, world!\"\n]\nhello\n" ], "url": "https://github.com/Oldes/Sublime-REBOL" }, "projectEuler": { "memberCount": { "2019": 14, "2022": 15 }, "id": "REBOL" }, "helloWorldCollection": [ "; Hello World in REBOL\n\nprint \"Hello World!\"" ], "leachim6": { "filepath": "r/Rebol.reb", "fileExtensions": [ "reb" ], "example": [ "print \"Hello World\"\n" ], "id": "Rebol" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:REBOL", "rijuRepl": { "example": [ "REBOL [Title: \"Main\"]\nprint \"Hello, world!\"\n" ], "id": "https://riju.codes/rebol" }, "tryItOnline": "rebol", "indeedJobs": { "2022": 0, "query": "rebol developer" }, "tiobe": { "id": "REBOL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2438", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nRebol for Dummies [With Rebol for 37 Systems]|2000|Ralph Roberts|2387078|3.00|5|0\nRebol Programming||Olivier Auverlot|5823181|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n|Wiley Technology Publishing|Rebol Programming|Olivier Auverlot|9780470846759", "semanticScholar": "" }, "rebus": { "title": "Rebus", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0fef0f529ec75d81d92ece5111c53dee6594f169" ], "country": [ "United States" ], "originCommunity": [ "The University of Arizona" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2780", "centralPackageRepositoryCount": 0, "isbndb": "" }, "rec-sm": { "title": "REC/SM", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bbff167febe7ad3193f3f15f9a45d5d7f94bb216" ], "country": [ "United States" ], "originCommunity": [ "Florida International University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4429", "centralPackageRepositoryCount": 0 }, "rec-studio": { "title": "REC Studio", "appeared": 2010, "type": "decompiler", "description": "REC Studio is an interactive decompiler. It reads a Windows, Linux, Mac OS X or raw executable file, and attempts to produce a C-like representation of the code and data used to build the executable file. It has been designed to read files produced for many different targets, and it has been compiled on several host systems.", "website": "https://www.backerstreet.com/rec/rec.htm" }, "recfiles": { "title": "Recfiles", "appeared": 1994, "type": "dataNotation", "creators": [ "Jose E. Marchesi" ], "description": "GNU recutils is a set of tools and libraries to access human-editable, text-based databases called recfiles. The data is stored as a sequence of records, each record containing an arbitrary number of named fields. Advanced capabilities usually found in other data storage systems are supported: data types, data integrity (keys, mandatory fields, etc.) as well as the ability of records to refer to other records (sort of foreign keys). Despite its simplicity, recfiles can be used to store medium-sized databases.", "reference": [ "https://www.gnu.org/software/recutils/" ], "fileExtensions": [ "rec" ], "country": [ "United States" ], "originCommunity": [ "Free Software Foundation" ], "hasComments": { "example": "# Blah blah…\n# Unlike some file formats, comments in recfiles must be complete lines. You cannot start a comment in the middle of a line.", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "%rec: Book\n%mandatory: Title\n%type: Location enum loaned home unknown\n%doc:\n+ A book in my personal collection.\n\nTitle: GNU Emacs Manual\nAuthor: Richard M. Stallman\nPublisher: FSF\nLocation: home\n\nTitle: The Colour of Magic\nAuthor: Terry Pratchett\nLocation: loaned\n\nTitle: Mio Cid\nAuthor: Anonymous\nLocation: home\n\nTitle: chapters.gnu.org administration guide\nAuthor: Nacho Gonzalez\nAuthor: Jose E. Marchesi\nLocation: unknown\n\nTitle: Yeelong User Manual\nLocation: home" ], "wikipedia": { "summary": "recfiles is a file format for human-editable, plain text databases. Databases using this file format can be edited using any text editor. recfiles allow for basic relational database operations, typing, auto-incrementing, as well as a simple join operation. Recutils is a collection of tools, like recfmt, recsel, and rec2csv used to work with recfile databases. Various software libraries support the format.", "backlinksCount": 1, "pageId": 63063548, "dailyPageViews": -1, "appeared": 1964, "url": "https://en.wikipedia.org/wiki/Recfiles" } }, "recol": { "title": "RECOL", "appeared": 1963, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5b609b7d586079b6ffe0b3330f2dc03389a03078" ], "country": [ "United States" ], "originCommunity": [ "Radio Corporation of America" ], "hopl": "https://hopl.info/showlanguage.prx?exp=186", "centralPackageRepositoryCount": 0 }, "red-lang": { "title": "Red", "appeared": 1972, "type": "pl", "creators": [ "John Backus" ], "description": "interested in pure functional programming, with no side-effects on storage or the external world.", "reference": [ "http://www.mcjones.org/dustydecks/archives/2007/04/01/60/" ], "country": [ "United States" ], "originCommunity": [ "IBM" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1997|Sams|Red Hat Linux Unleashed|Pitts, David|9780672311734\n2005|Sams|Red Hat Fedora 4: Unleashed|Hudson, Paul and Ball, Bill and Duff, Hoyt|9780672327926\n2003|For Dummies|Red Hat Linux All-in-One Desk Reference For Dummies|Barkakati, Naba|9780764524424\n2004|Sams|Red Hat Linux Fedora Unleashed|Ball, Bill and Duff, Hoyt|9780672326295", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|Research on red wave and green wave coordinated control model in arterial road for different traffic demands|10.1109/ICMT.2011.6003197|3|0|Shujian Zheng and Jian-min Xu|6724aad495f178db0c31374d4677ed7ac4c81ee6" }, "red": { "title": "Red", "appeared": 2011, "type": "pl", "creators": [ "Nenad Rakocevic" ], "website": "http://www.red-lang.org/", "documentation": [ "https://www.red-lang.org/p/documentation.html" ], "fileExtensions": [ "red", "reds" ], "country": [ "China" ], "originCommunity": [ "https://github.com/red" ], "domainName": { "registered": 2010, "awisRank": { "2022": 1393281 }, "name": "red-lang.org" }, "writtenIn": [ "red" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ ";" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 4845, "forks": 407, "subscribers": 209, "created": 2011, "updated": 2022, "firstCommit": 2011, "description": "Red is a next-generation programming language strongly inspired by Rebol, but with a broader field of usage thanks to its native-code compiler, from system programming to high-level scripting and cross-platform reactive GUI, while providing modern support for concurrency, all in a zero-install, zero-config, single 1MB file! ", "issues": 543, "url": "https://github.com/red/red" }, "repoStats": { "firstCommit": 2011, "commits": 15037, "committers": 111, "files": 622 }, "wikipedia": { "example": [ "Red/System [Title: \"A factorial script\"]\n\nfactorial: func [\n\tx [integer!] ; This is compulsory in Red/System\n\treturn: [integer!] ; This is compulsory in Red/System\n][\n\teither x = 0 [1][x * factorial x - 1]\n]" ], "related": [ "linux", "scala", "lua", "x86-isa", "arm", "freebsd", "android" ], "summary": "Red is a computer programming language. Red was made to overcome the limitations of the programming language Rebol. Introduced in 2011 by Nenad Rakocevic, Red is both an imperative and functional programming language. Its syntax and general usage overlaps that of the interpreted Rebol language (which was introduced in 1997). The implementation choices of Red intend to create a full stack programming language: Red can be used for extremely high-level programming (DSLs and GUIs) as well as low-level programming (operating systems and device drivers). Key to the approach is that the language has two parts: Red/System and Red. Red/System is similar to C, but packaged into a Rebol lexical structure – for example, one would write if x > y [print \"Hello\"] instead of if (x > y) {printf(\"Hello\\n\");}. Red is a homoiconic language capable of meta-programming, with semantics similar to Rebol's. Red's runtime library is written in Red/System, and uses a hybrid approach: it compiles what it can deduce statically and uses an embedded interpreter otherwise. The project roadmap includes a just-in-time compiler for cases in between, but this has not yet been implemented. Red seeks to remain independent of any other toolchain; it does its own code generation. It is therefore possible to cross-compile Red programs from any platform it supports to any other, via a command-line switch. Both Red and Red/System are distributed as open-source software under the modified BSD license. The runtime library is distributed under the more permissive Boost Software License.", "pageId": 35733875, "dailyPageViews": 64, "created": 2012, "backlinksCount": 23, "revisionCount": 105, "appeared": 2011, "fileExtensions": [ "red", "reds" ], "url": "https://en.wikipedia.org/wiki/Red_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "red", "reds" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.red", "aliases": [ "red/system" ], "repos": 453, "id": "Red" }, "githubBigQuery": { "repos": 98, "users": 92, "id": "Red" }, "pygmentsHighlighter": { "filename": "rebol.py", "fileExtensions": [ "red", "reds" ], "id": "Red" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2015, "committerCount": 3, "commitCount": 34, "sampleCount": 2, "example": [ "Red/System [\n Title: \"Red/System example file\"\n Purpose: \"Just some code for testing Pygments colorizer\"\n Language: http://www.red-lang.org/\n]\n\n#include %../common/FPU-configuration.reds\n\n; C types\n\n#define time! long!\n#define clock! long!\n\ndate!: alias struct! [\n second [integer!] ; 0-61 (60?)\n minute [integer!] ; 0-59\n hour [integer!] ; 0-23\n\n day [integer!] ; 1-31\n month [integer!] ; 0-11\n year [integer!] ; Since 1900\n\n weekday [integer!] ; 0-6 since Sunday\n yearday [integer!] ; 0-365\n daylight-saving-time? [integer!] ; Negative: unknown\n]\n\n#either OS = 'Windows [\n #define clocks-per-second 1000\n][\n ; CLOCKS_PER_SEC value for Syllable, Linux (XSI-conformant systems)\n ; TODO: check for other systems\n #define clocks-per-second 1000'000\n] \n\n#import [LIBC-file cdecl [\n\n ; Error handling\n\n form-error: \"strerror\" [ ; Return error description.\n code [integer!]\n return: [c-string!]\n ]\n print-error: \"perror\" [ ; Print error to standard error output.\n string [c-string!]\n ]\n\n\n ; Memory management\n\n make: \"calloc\" [ ; Allocate zero-filled memory.\n chunks [size!]\n size [size!]\n return: [binary!]\n ]\n resize: \"realloc\" [ ; Resize memory allocation.\n memory [binary!]\n size [size!]\n return: [binary!]\n ]\n ]\n \n JVM!: alias struct! [\n reserved0 [int-ptr!]\n reserved1 [int-ptr!]\n reserved2 [int-ptr!]\n \n DestroyJavaVM [function! [[JNICALL] vm [JVM-ptr!] return: [jint!]]]\n AttachCurrentThread [function! [[JNICALL] vm [JVM-ptr!] penv [struct! [p [int-ptr!]]] args [byte-ptr!] return: [jint!]]]\n DetachCurrentThread [function! [[JNICALL] vm [JVM-ptr!] return: [jint!]]]\n GetEnv [function! [[JNICALL] vm [JVM-ptr!] penv [struct! [p [int-ptr!]]] version [integer!] return: [jint!]]]\n AttachCurrentThreadAsDaemon [function! [[JNICALL] vm [JVM-ptr!] penv [struct! [p [int-ptr!]]] args [byte-ptr!] return: [jint!]]]\n]\n\n ;just some datatypes for testing:\n \n #some-hash\n 10-1-2013\n quit\n \n ;binary:\n #{00FF0000}\n #{00FF0000 FF000000}\n #{00FF0000\tFF000000} ;with tab instead of space\n 2#{00001111}\n 64#{/wAAAA==}\n 64#{/wAAA A==} ;with space\t inside\n 64#{/wAAA\tA==} ;with tab inside\n \n \n ;string with char\n {bla ^(ff) foo}\n {bla ^(( foo}\n ;some numbers:\n 12\n 1'000\n 1.2\n FF00FF00h\n \n ;some tests of hexa number notation with not common ending\n [ff00h ff00h] ff00h{} FFh\"foo\" 00h(1 + 2) (AEh)\n\n;normal words:\nfoo char\n\n;get-word\n:foo\n \n;lit-word:\n'foo 'foo\n\nto-integer foo\nfoo/(a + 1)/b\n\ncall/output reform ['which interpreter] path: copy \"\"\n\n version-1.1: 00010001h\n \n #if type = 'exe [\n push system/stack/frame ;-- save previous frame pointer\n system/stack/frame: system/stack/top ;-- @@ reposition frame pointer just after the catch flag\n]\npush CATCH_ALL ;-- exceptions root barrier\npush 0 ;-- keep stack aligned on 64-bit" ], "url": "https://github.com/Oldes/Sublime-Red" }, "languageServerProtocolProject": [ "https://github.com/bitbegin/redlangserver\nwrittenIn red" ], "leachim6": { "filepath": "r/Red.red", "fileExtensions": [ "red" ], "example": [ "Red [Needs: 'View]\nview [text \"Hello World\"] " ], "id": "Red" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Red", "rijuRepl": { "example": [ "Red [Title: \"Main\"]\n\nprint \"Hello, world!\"\n" ], "id": "https://riju.codes/red" }, "tryItOnline": "red", "officialBlogUrl": [ "https://www.red-lang.org/" ], "faqPageUrl": [ "https://www.red-lang.org/2015/12/answers-to-community-questions.html" ], "tiobe": { "id": "Red" }, "twitter": "https://twitter.com/red_lang", "fileType": "text", "wordRank": 554, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "redcode": { "title": "Redcode", "appeared": 1984, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bolt Beranek and Newman Inc" ], "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "example": [ "0000: ADD.AB # 4, $ 3\n 0001: MOV.F $ 2, @ 2\n 0002: JMP.B $ -2, $ 0\n 0003: DAT.F # 0, # 0" ], "related": [ "assembly-language" ], "summary": "Core War is a 1984 programming game created by D. G. Jones and A. K. Dewdney in which two or more battle programs (called \"warriors\") compete for control of a virtual computer. These battle programs are written in an abstract assembly language called Redcode.", "pageId": 274362, "created": 2003, "backlinksCount": 52, "revisionCount": 377, "dailyPageViews": 111, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Core_War" }, "githubLanguage": { "fileExtensions": [ "cw" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 36, "id": "Redcode" }, "githubBigQuery": { "repos": 109, "users": 104, "id": "Redcode" }, "pygmentsHighlighter": { "filename": "esoteric.py", "fileExtensions": [ "cw" ], "id": "Redcode" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "redis": { "title": "Redis", "appeared": 2009, "type": "application", "website": "https://redis.io/", "country": [ "United States" ], "originCommunity": [ "Redis Ltd" ], "domainName": { "registered": 2010, "awisRank": { "2017": 22387, "2022": 9888 }, "name": "redis.io" }, "writtenIn": [ "c" ], "hasStrings": { "example": "", "value": true }, "keywords": [ "APPEND", "AUTH", "BGREWRITEAOF", "BGSAVE", "BITCOUNT", "BITFIELD", "BITOP", "BITPOS", "BLPOP", "BRPOP", "BRPOPLPUSH", "CLIENT", "KILL", "LIST", "GETNAME", "PAUSE", "REPLY", "SETNAME", "CLUSTER", "ADDSLOTS", "COUNT-FAILURE-REPORTS", "COUNTKEYSINSLOT", "DELSLOTS", "FAILOVER", "FORGET", "GETKEYSINSLOT", "INFO", "KEYSLOT", "MEET", "NODES", "REPLICATE", "RESET", "SAVECONFIG", "SET-CONFIG-EPOCH", "SETSLOT", "SLAVES", "SLOTS", "COMMAND", "COUNT", "GETKEYS", "CONFIG", "GET", "REWRITE", "SET", "RESETSTAT", "DBSIZE", "DEBUG", "OBJECT", "SEGFAULT", "DECR", "DECRBY", "DEL", "DISCARD", "DUMP", "ECHO", "EVAL", "EVALSHA", "EXEC", "EXISTS", "EXPIRE", "EXPIREAT", "FLUSHALL", "FLUSHDB", "GEOADD", "GEOHASH", "GEOPOS", "GEODIST", "GEORADIUS", "GEORADIUSBYMEMBER", "GETBIT", "GETRANGE", "GETSET", "HDEL", "HEXISTS", "HGET", "HGETALL", "HINCRBY", "HINCRBYFLOAT", "HKEYS", "HLEN", "HMGET", "HMSET", "HSET", "HSETNX", "HSTRLEN", "HVALS", "INCR", "INCRBY", "INCRBYFLOAT", "KEYS", "LASTSAVE", "LINDEX", "LINSERT", "LLEN", "LPOP", "LPUSH", "LPUSHX", "LRANGE", "LREM", "LSET", "LTRIM", "MGET", "MIGRATE", "MONITOR", "MOVE", "MSET", "MSETNX", "MULTI", "PERSIST", "PEXPIRE", "PEXPIREAT", "PFADD", "PFCOUNT", "PFMERGE", "PING", "PSETEX", "PSUBSCRIBE", "PUBSUB", "PTTL", "PUBLISH", "PUNSUBSCRIBE", "QUIT", "RANDOMKEY", "READONLY", "READWRITE", "RENAME", "RENAMENX", "RESTORE", "ROLE", "RPOP", "RPOPLPUSH", "RPUSH", "RPUSHX", "SADD", "SAVE", "SCARD", "SCRIPT", "FLUSH", "LOAD", "SDIFF", "SDIFFSTORE", "SELECT", "SETBIT", "SETEX", "SETNX", "SETRANGE", "SHUTDOWN", "SINTER", "SINTERSTORE", "SISMEMBER", "SLAVEOF", "SLOWLOG", "SMEMBERS", "SMOVE", "SORT", "SPOP", "SRANDMEMBER", "SREM", "STRLEN", "SUBSCRIBE", "SUNION", "SUNIONSTORE", "SWAPDB", "SYNC", "TIME", "TOUCH", "TTL", "TYPE", "UNSUBSCRIBE", "UNLINK", "UNWATCH", "WAIT", "WATCH", "ZADD", "ZCARD", "ZCOUNT", "ZINCRBY", "ZINTERSTORE", "ZLEXCOUNT", "ZRANGE", "ZRANGEBYLEX", "ZREVRANGEBYLEX", "ZRANGEBYSCORE", "ZRANK", "ZREM", "ZREMRANGEBYLEX", "ZREMRANGEBYRANK", "ZREMRANGEBYSCORE", "ZREVRANGE", "ZREVRANGEBYSCORE", "ZREVRANK", "ZSCORE", "ZUNIONSTORE", "SCAN", "SSCAN", "HSCAN", "ZSCAN" ], "githubRepo": { "stars": 55750, "forks": 21459, "subscribers": 2609, "created": 2009, "updated": 2022, "firstCommit": 2009, "description": "Redis is an in-memory database that persists on disk. The data model is key-value, but many different kind of values are supported: Strings, Lists, Sets, Sorted Sets, Hashes, Streams, HyperLogLogs, Bitmaps.", "issues": 2094, "url": "https://github.com/antirez/redis" }, "wikipedia": { "related": [ "actionscript", "c", "csharp", "clojure", "common-lisp", "d", "dart", "erlang", "go", "haskell", "haxe", "io", "java", "julia", "lua", "objective-c", "ocaml", "perl", "php", "puredata", "python", "r", "racket", "ruby", "rust", "scala", "smalltalk", "tcl", "aws", "azure" ], "summary": "Redis is an open-source in-memory database project implementing a distributed, in-memory key-value store with optional durability. Redis supports different kinds of abstract data structures, such as strings, lists, maps, sets, sorted sets, hyperloglogs, bitmaps and spatial indexes. The project is mainly developed by Salvatore Sanfilippo and is currently sponsored by Redis Labs. Redis Labs creates and maintains the official Redis Enterprise Pack.", "pageId": 24956915, "dailyPageViews": 707, "created": 2009, "backlinksCount": 140, "revisionCount": 577, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Redis" }, "monaco": "redis", "leachim6": { "filepath": "r/Redis", "example": [ "set Hello World" ], "id": "Redis" }, "rijuRepl": { "example": [ "ECHO \"Hello, world!\"\n" ], "id": "https://riju.codes/redis" }, "linkedInSkill": { "2018": 59099, "id": "redis" }, "twitter": "https://twitter.com/redisfeed", "jupyterKernel": [ "https://github.com/supercoderz/redis_kernel" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "redpanda-app": { "title": "redpanda-app", "appeared": 2009, "type": "application", "description": "Redpanda is a queue for people who deal with massive data streams.", "website": "https://vectorized.io/", "country": [ "United States" ], "originCommunity": [ "Redpanda Data" ], "domainName": { "name": "vectorized.io" } }, "redprl": { "title": "redprl", "appeared": 2016, "type": "pl", "creators": [ "Jonathan Sterling" ], "website": "http://www.redprl.org/", "country": [ "Various" ], "originCommunity": [ "https://github.com/RedPRL" ], "domainName": { "registered": 2016, "name": "redprl.org" }, "githubRepo": { "firstCommit": 2016, "stars": 222, "forks": 19, "subscribers": 34, "created": 2016, "updated": 2022, "description": "The People's Refinement Logic", "issues": 12, "url": "https://github.com/redprl/sml-redprl" }, "repoStats": { "firstCommit": 2016, "commits": 1234, "committers": 21, "files": 185 }, "semanticScholar": "" }, "redscript": { "title": "redscript", "appeared": 2013, "type": "pl", "website": "http://redscript.org/", "domainName": { "registered": 2021, "name": "redscript.org" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n5478569|Show HN: RedScript, a Ruby flavored compile to JS language|2013-04-02 10:58:33 UTC|1364900313|adambrod|0|2" }, "redshift": { "title": "Amazon Redshift", "appeared": 2012, "type": "queryLanguage", "reference": [ "https://docs.aws.amazon.com/redshift/latest/dg/c_redshift-sql.html" ], "originCommunity": [ "Amazon" ], "related": [ "postgresql", "sql", "mysql" ], "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "AES128", "AES256", "ALL", "ALLOWOVERWRITE", "ANALYSE", "ANALYZE", "AND", "ANY", "ARRAY", "AS", "ASC", "AUTHORIZATION", "AZ64", "BACKUP", "BETWEEN", "BINARY", "BLANKSASNULL", "BOTH", "BYTEDICT", "BZIP2", "CASE", "CAST", "CHECK", "COLLATE", "COLUMN", "CONSTRAINT", "CREATE", "CREDENTIALS", "CROSS", "CURRENT_DATE", "CURRENT_TIME", "CURRENT_TIMESTAMP", "CURRENT_USER", "CURRENT_USER_ID", "DEFAULT", "DEFERRABLE", "DEFLATE", "DEFRAG", "DELTA", "DELTA32K", "DESC", "DISABLE", "DISTINCT", "DO", "ELSE", "EMPTYASNULL", "ENABLE", "ENCODE", "ENCRYPT", "ENCRYPTION", "END", "EXCEPT", "EXPLICIT", "FALSE", "FOR", "FOREIGN", "FREEZE", "FROM", "FULL", "GLOBALDICT256", "GLOBALDICT64K", "GRANT", "GROUP", "GZIP", "HAVING", "IDENTITY", "IGNORE", "ILIKE", "IN", "INITIALLY", "INNER", "INTERSECT", "INTO", "IS", "ISNULL", "JOIN", "LANGUAGE", "LEADING", "LEFT", "LIKE", "LIMIT", "LOCALTIME", "LOCALTIMESTAMP", "LUN", "LUNS", "LZO", "LZOP", "MINUS", "MOSTLY16", "MOSTLY32", "MOSTLY8", "NATURAL", "NEW", "NOT", "NOTNULL", "NULL", "NULLS", "OFF", "OFFLINE", "OFFSET", "OID", "OLD", "ON", "ONLY", "OPEN", "OR", "ORDER", "OUTER", "OVERLAPS", "PARALLEL", "PARTITION", "PERCENT", "PERMISSIONS", "PLACING", "PRIMARY", "RAW", "READRATIO", "RECOVER", "REFERENCES", "RESPECT", "REJECTLOG", "RESORT", "RESTORE", "RIGHT", "SELECT", "SESSION_USER", "SIMILAR", "SNAPSHOT", "SOME", "SYSDATE", "SYSTEM", "TABLE", "TAG", "TDES", "TEXT255", "TEXT32K", "THEN", "TIMESTAMP", "TO", "TOP", "TRAILING", "TRUE", "TRUNCATECOLUMNS", "UNION", "UNIQUE", "USER", "USING", "VERBOSE", "WALLET", "WHEN", "WHERE", "WITH", "WITHOUT" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Amazon_Redshift" }, "monaco": "redshift" }, "reduce": { "title": "REDUCE", "appeared": 2011, "type": "pl", "website": "http://www.reduce-algebra.com", "reference": [ "https://en.wikipedia.org/wiki/Anthony_C._Hearn" ], "country": [ "United States" ], "originCommunity": [ "https://sourceforge.net/p/reduce-algebra/_members" ], "domainName": { "awisRank": { "2022": 12117381 }, "name": "reduce-algebra.com" }, "wikipedia": { "related": [ "portable-standard-lisp", "lisp", "algol", "unix", "linux", "camal" ], "summary": "Reduce is a general-purpose computer algebra system geared towards applications in physics. The development of the Reduce computer algebra system was started in the 1960s by Anthony C. Hearn. Since then, many scientists from all over the world have contributed to its development under his direction. Reduce is written entirely in its own LISP dialect called Portable Standard Lisp, expressed in an ALGOL-like syntax called RLISP. The latter is used as a basis for Reduce's user-level language. Implementations of Reduce are available on most variants of Unix, Linux, Microsoft Windows, or Apple Macintosh systems by using an underlying Portable Standard Lisp or Codemist Standard LISP implementation. Reduce was open sourced in December 2008 and is available for free under a modified BSD license on SourceForge. Previously it had cost $695.", "pageId": 499024, "created": 2004, "backlinksCount": 75, "revisionCount": 2, "dailyPageViews": 2, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/REDUCE" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Reduce", "fileType": "text", "wordRank": 2036, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|Springer|Simulation Strategies to Reduce Recidivism: Risk Need Responsivity (RNR) Modeling for the Criminal Justice System|Faye S. Taxman|9781461461883\n2022|Manning|Data-Oriented Programming: Reduce complexity by rethinking data|Sharvit, Yehonathan|9781617298578", "semanticScholar": "" }, "ref-arf": { "title": "REF-ARF", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/26da054184537d329800f4cb4c6316dd08f6e7a7" ], "country": [ "United States" ], "originCommunity": [ "Carnegie-Mellon University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=525", "centralPackageRepositoryCount": 0 }, "refal": { "title": "Refal", "appeared": 1968, "type": "pl", "creators": [ "Valentin Turchin" ], "website": "http://www.refal.net", "country": [ "United States" ], "originCommunity": [ "http://pespmc1.vub.ac.be/TURCHIN.html" ], "domainName": { "registered": 1999, "awisRank": { "2022": 8850474 }, "name": "refal.net" }, "hasLineComments": { "example": "* A comment", "value": true }, "hasComments": { "example": "* A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "lineCommentToken": [ [ "*" ] ], "printToken": [ [ ";\n s.A e.1 = s.A ;\n = ; };" ], "related": [ "prolog", "lisp" ], "summary": "Refal (Recursive functions algorithmic language) \"is functional programming language oriented toward symbol manipulation\", including \"string processing, translation, [and] artificial intelligence\". It is one of the oldest members of this family, first conceived in 1966 as a theoretical tool with the first implementation appearing in 1968. Refal was intended to combine mathematical simplicity with practicality for writing large and sophisticated programs. Unlike other functional programming languages, Refal is based on pattern matching. Its pattern matching works in the forward direction rather than backwards (starting from the goal) as in Prolog. The basic data structure of Lisp and Prolog is a linear list consed up from the beginning. Refal lists are built and scanned from both ends, and pattern matching allows to match against nested lists as well as the top-level one. (In effect, the basic data structure of Refal is a tree rather than a list). According to the authors, this gives freedom and convenience in creating data structures while using only mathematically simple control mechanisms of pattern matching and substitution. Refal also includes a feature called the freezer to support efficient partial evaluation. Refal can be applied to the processing and transformation of tree structures, similarly to XSLT.", "pageId": 14926151, "dailyPageViews": 16, "created": 2007, "backlinksCount": 17, "revisionCount": 78, "appeared": 1966, "url": "https://en.wikipedia.org/wiki/Refal" }, "helloWorldCollection": [ "* Hello world in Refal\n\n$ENTRY Go { = ;}\nHello {\n = ;\n}" ], "leachim6": { "filepath": "r/Refal.ref", "fileExtensions": [ "ref" ], "example": [ "$ENTRY Go { = ;}\nHello {\n = ;\n}" ], "id": "Refal" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Refal", "hopl": "https://hopl.info/showlanguage.prx?exp=595", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "refer": { "title": "Refer", "appeared": 1978, "type": "textMarkup", "country": [ "United States" ], "originCommunity": [ "Bell Laboratories" ], "example": [ "%A Brian W. Kernighan\n%A Lorinda L. Cherry\n%T A System for Typesetting Mathematics\n%J J. Comm. ACM\n%V 18\n%N 3\n%D March 1978\n%P 151-157\n%K eqn\n.[\nkernighan cherry eqn\n.]" ], "wikipedia": { "summary": "refer is a program for managing bibliographic references, and citing them in troff documents. It is implemented as a troff preprocessor. refer was written by Mike Lesk at Bell Laboratories in or before 1978, and is now available as part of most Unix-like operating systems. A free reimplementation exists as part of the groff package. As of 2015, refer sees little use, primarily because troff itself is not used much for longer technical writing that might need software support for reference and citation management. As of 2016, some reference management software (for instance, RefWorks) will import refer data.", "backlinksCount": 48, "pageId": 4310897, "dailyPageViews": 13, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/Refer_(software)" } }, "refined-c": { "title": "Refined C", "appeared": 1984, "type": "pl", "creators": [ "Henry G. Dietz" ], "reference": [ "https://semanticscholar.org/paper/d7a4f792359ca2b47f15110c8a6a59c151e729ff" ], "country": [ "United States" ], "originCommunity": [ "Polytechnic University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1116", "centralPackageRepositoryCount": 0 }, "reflex-framework": { "title": "reflex-framework", "appeared": 2015, "type": "framework", "website": "https://reflex-frp.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/reflex-frp" ], "domainName": { "name": "reflex-frp.org" }, "githubRepo": { "firstCommit": 2015, "stars": 990, "forks": 144, "subscribers": 67, "created": 2014, "updated": 2022, "description": "Interactive programs without callbacks or side-effects. Functional Reactive Programming (FRP) uses composable events and time-varying values to describe interactive systems as pure functions. Just like other pure functional code, functional reactive code is easier to get right on the first try, maintain, and reuse.", "issues": 86, "url": "https://github.com/reflex-frp/reflex" } }, "reflisp": { "title": "RefLisp", "appeared": 1988, "type": "pl", "reference": [ "https://sourceforge.net/projects/reflisp/" ], "country": [ "United States" ], "originCommunity": [ "https://sourceforge.net/p/reflisp/bugs" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1022", "centralPackageRepositoryCount": 0 }, "reforth": { "title": "reforth", "appeared": 2013, "type": "pl", "description": "Reforth tries to solve my gripes without fundamentally changing Forth's elegance and simplicity.", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/seanpringle/reforth/issues" ], "example": [ "begin\n condition\n if operation\n next\n end\n condition1\n if operation1\n leave\n end\nend\n10 for\n condition\n if operation\n leave\n end\nend" ], "githubRepo": { "firstCommit": 2013, "stars": 69, "forks": 10, "subscribers": 12, "created": 2013, "updated": 2022, "description": "Rethinking Forth", "issues": 1, "url": "https://github.com/seanpringle/reforth" }, "repoStats": { "firstCommit": 2013, "commits": 77, "committers": 3, "files": 14 } }, "regent": { "title": "REGENT", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ff6309a89c34ffd1f0ede9c29e5eb5c955f50c30" ], "country": [ "Germany" ], "originCommunity": [ "Karlsruher Institut für Technologie" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4089", "centralPackageRepositoryCount": 0 }, "regex": { "title": "Regular Expressions", "appeared": 1951, "type": "queryLanguage", "country": [ "United States" ], "originCommunity": [ "University of Wisconsin-Madison" ], "hasComments": { "example": "", "value": false }, "hasLineComments": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "", "value": false }, "wikipedia": { "example": [ "Hello World\n contains a character other than a, b, and c." ], "related": [ "unix", "perl", "sed", "awk", "ascii", "snobol", "grep", "vi-editor", "emacs-editor", "tcl", "postgresql", "unicode", "perl-6", "peg", "sgml", "pcre", "php", "java", "python", "ecmascript", "linux", "vim-editor", "javascript", "ruby", "c", "lisp", "utf-8", "isbn" ], "summary": "A regular expression, regex or regexp (sometimes called a rational expression) is, in theoretical computer science and formal language theory, a sequence of characters that define a search pattern. Usually this pattern is then used by string searching algorithms for \"find\" or \"find and replace\" operations on strings. The concept arose in the 1950s when the American mathematician Stephen Cole Kleene formalized the description of a regular language. The concept came into common use with Unix text-processing utilities. Since the 1980s, different syntaxes for writing regular expressions exist, one being the POSIX standard and another, widely used, being the Perl syntax. Regular expressions are used in search engines, search and replace dialogs of word processors and text editors, in text processing utilities such as sed and AWK and in lexical analysis. Many programming languages provide regex capabilities, built-in, or via libraries.", "pageId": 25717, "dailyPageViews": 3569, "created": 2001, "backlinksCount": 2228, "revisionCount": 2877, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Regular_expression" }, "githubLanguage": { "fileExtensions": [ "regexp", "regex" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "source.regexp", "aliases": [ "regexp", "regex" ], "repos": 58614, "id": "Regular Expression" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 1, "commitCount": 68, "sampleCount": 4, "example": [ "\\b(\\d*1[1-3]th|\\d*0th|(?:(?!11st)\\d)*1st|\\d*2nd|(?:(?!13rd)\\d*)3rd|\\d*[4-9]th)\\b\n" ], "url": "https://github.com/Alhadis/language-regexp" }, "subreddit": [ { "memberCount": { "2022": 5278 }, "url": "https://reddit.com/r/regex" } ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "regina": { "title": "Regina", "appeared": 2001, "type": "pl", "reference": [ "https://sourceforge.net/projects/regina-rexx/" ], "country": [ "United States" ], "originCommunity": [ "https://sourceforge.net/p/regina-rexx/_list/tickets" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2444", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "regulus": { "title": "REGULUS", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/5389de78b1dd5daf85bb3bbfdd36e303de5bfaad" ], "country": [ "Canada" ], "originCommunity": [ "University of British Columbia" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4109", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "reia": { "title": "Reia", "appeared": 2008, "type": "pl", "website": "http://reia-lang.org", "reference": [ "http://www.unlimitednovelty.com/2011/06/why-im-stopping-work-on-reia.html" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/tarcieri/reia/issues" ], "domainName": { "registered": 2008, "name": "reia-lang.org" }, "hasAssignment": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "puts" ] ], "assignmentToken": [ [ "=" ] ], "example": [ "# Hello, world!\n\"Hello, world!\".puts()\n\n# Assignment\nnumber = 42\nopposite = true\n\n# Conditions\nnumber = -42 if opposite\n\n# Lists (stored as immutable singly-linked lists)\nlist = [1, 2, 3, 4, 5]\n\n# Tuples (think of them as immutable arrays)\ntuple = (1, 2, 3, 4, 5)\n\n# Atoms (known as symbols to Ruby people)\n# Think of them as an open-ended enumeration\natom = :up_and_atom\n\n# Dicts (also known as hashes to Ruby people)\ndict = {:foo => 1, :bar => 2, :baz => 3}\n\n# Strings (unlike Erlang, Reia has a real String type!)\nstring = \"I'm a string! Woohoo I'm a string! #{'And I interpolate too!'}\"\n\n# Ranges\nrange = 0..42\n\n# Funs (anonymous functions, a.k.a. lambdas, procs, closures, etc.)\n# Calling me with plustwo(40) would return 42\nplustwo = fun(n) { n + 2 }\n\n# Modules (collections of functions)\n# Calling Plusser.addtwo(40) would return 42\nmodule Plusser\n def addtwo(n)\n n + 2\n end\nend\n\n# Classes (of immutable objects. Once created objects can't be changed!)\nclass Adder\n # Reia supports binding instance variables directly when they're passed\n # as arguments to initialize\n def initialize(@n); end\n\n def plus(n)\n @n + n\n end\nend\n\n# Instantiate classes by calling Classname(arg1, arg2, ...)\n# For you Ruby people who want Classname.new(...) this is coming soon!\nfortytwo = Adder(40).plus(2)\n\n# Function references can be obtained by omitting parens from a function call,\n# like JavaScript or Python\nnumbers = [1,2,3]\nreverser = [1,2,3].reverse\n\n# Function references can be invoked just like lambdas\nreversed = reverser() # reversed is now [3,2,1]\n\n# You can add a ! to the end of any method to rebind the method receiver to \n# the return value of the given method minus the bang.\nnumbers.reverse!() # numbers is now [3,2,1]\n\n# List comprehensions\ndoubled = [n * 2 for n in numbers] # doubled is [6,4,2]" ], "githubRepo": { "firstCommit": 2008, "stars": 777, "forks": 40, "subscribers": 13, "created": 2008, "updated": 2022, "description": "Ruby-like hybrid OOP/functional programming language for BEAM, the Erlang VM", "issues": 7, "url": "https://github.com/tarcieri/reia" }, "repoStats": { "firstCommit": 2008, "commits": 1465, "committers": 14, "files": 110 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n1889905|Reia - Ruby's powerful syntax with Erlang concurrency and fault-tolerance|http://reia-lang.org/|2010-11-10 11:10:55 UTC|1289387455|rubyrescue|1|2" }, "reko-decompiler": { "title": "Reko", "appeared": 2007, "type": "decompiler", "creators": [ "John Källén" ], "website": "https://uxmal.github.io/reko", "country": [ "Sweden" ], "originCommunity": [ "https://github.com/uxmal/reko/issues" ], "githubRepo": { "firstCommit": 2007, "stars": 1374, "forks": 178, "subscribers": 69, "created": 2015, "updated": 2022, "description": "Reko is a binary decompiler.", "issues": 167, "url": "https://github.com/uxmal/reko" } }, "rel-english": { "title": "REL English", "appeared": 1975, "type": "pl", "reference": [ "https://www.rand.org/pubs/authors/h/henisz-dostert_bozena.html", "https://semanticscholar.org/paper/8444ce1af42bd88e2c4c581f67f20efc65b3a1bf" ], "country": [ "United States" ], "originCommunity": [ "RAND Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=693", "centralPackageRepositoryCount": 0 }, "rel-lang": { "title": "rel-lang", "appeared": 2015, "type": "pl", "website": "http://relevant.ai", "country": [ "United States" ], "originCommunity": [ "https://github.com/relevant-ai" ], "githubRepo": { "firstCommit": 2015, "stars": 24, "forks": 2, "subscribers": 5, "created": 2015, "updated": 2017, "description": "Documentation on REL, the fancy JSON syntax for building cards for the relevant iOS app", "issues": 1, "url": "https://github.com/relevant-ai/RelevantCardsDocumentation" }, "repoStats": { "firstCommit": 2015, "commits": 178, "committers": 4, "files": 35 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9734412|Show HN: REL – A JSON-based programming language|2015-06-17 18:54:38 UTC|1434567278|wircho|1|2" }, "rel": { "title": "REL", "appeared": 1968, "type": "pl", "creators": [ "Peter C. Lockemann", "Frederick B. Thompson" ], "reference": [ "https://semanticscholar.org/paper/ba528fcdd157e7c1aa41bd9504038fc0ec0a4269" ], "country": [ "United States" ], "originCommunity": [ "California Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3192", "centralPackageRepositoryCount": 0 }, "relational-data-file": { "title": "Relational Data File", "appeared": 1965, "type": "queryLanguage", "description": "A tool for mechanized inference execution and data retrieval.", "reference": [ "https://www.rand.org/pubs/research_memoranda/RM4793.html" ], "aka": [ "rdf" ], "originCommunity": [ "RAND" ], "example": [ "IF (x AUTHORED PAPER y)\nAND (y SUBJECT INDEXED UNDER pattern recognition)\nTHEN (x CONDUCTS RESEARCH ON pattern recognition)" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "relational-production-language": { "title": "RPL", "appeared": 1988, "type": "queryLanguage", "description": "The Relational Production Language (RPL) solves the paradigm mismatch between expert systems and database systems by relying on the relational data model as the underlying formalism for an expert system. The result is a formally-defined production system language with immediate access to conventional databases. Working memory is modeled as a relational database and rules consist of a relational query on the left hand side (LHS) and database updates on the right hand side (RHS).", "reference": [ "https://www.semanticscholar.org/paper/The-Relational-Production-Language%3A-A-Production-Delcambre-Etheredge/619dd36bbc11c8c8533f786aaa86391c78271819" ], "aka": [ "rpl" ], "country": [ "United States" ], "originCommunity": [ "University Of Southwestern Louisiana" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "relationlog": { "title": "Relationlog", "appeared": 2001, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f116f44111bc612531792a2ab4267adb7e2c21b8" ], "country": [ "Canada" ], "originCommunity": [ "University of Regina" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7143", "centralPackageRepositoryCount": 0 }, "relax": { "title": "relax", "appeared": 2000, "type": "grammarLanguage", "creators": [ "Makoto Murata" ], "description": "RELAX (REgular LAnguage description for XML) is a specification for describing XML-based languages. XHTML 1.0, for example, can be described in RELAX. A description written in RELAX is called a RELAX grammar. An XML document can be verified against a RELAX grammar. Compared with DTD(Document Type Definition), RELAX has new features: RELAX grammars are represented in the XML instance syntax. RELAX borrows rich datatypes of XML Schema Part 2. RELAX is namespace-aware", "website": "http://www.xml.gr.jp/relax/", "country": [ "Japan" ], "originCommunity": [ "https://www.gr.jp" ], "related": [ "dtd" ], "example": [ "\n\n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n \n \n \n \n\n \n\n" ] }, "relaxng": { "title": "RELAX NG", "appeared": 2001, "type": "grammarLanguage", "website": "https://relaxng.org/", "country": [ "Japan" ], "originCommunity": [ "https://relaxng.org" ], "domainName": { "registered": 2001, "awisRank": { "2022": 2914903 }, "name": "relaxng.org" }, "hasComments": { "example": "# Comments start with a # and continue to the end of the line:", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# A RELAX NG compact syntax pattern\n# for an address book.\nelement addressBook {\n # an entry in the address book\n element card {\n element name { text },\n element email { text } # an email address\n }*\n}" ], "wikipedia": { "summary": "In computing, RELAX NG (REgular LAnguage for XML Next Generation) is a schema language for XML - a RELAX NG schema specifies a pattern for the structure and content of an XML document. A RELAX NG schema is itself an XML document but RELAX NG also offers a popular compact, non-XML syntax. Compared to other XML schema languages RELAX NG is considered relatively simple. It was defined by a committee specification of the OASIS RELAX NG technical committee in 2001 and 2002, based on Murata Makoto's RELAX and James Clark's TREX, and also by part two of the international standard ISO/IEC 19757: Document Schema Definition Languages (DSDL). ISO/IEC 19757-2 was developed by ISO/IEC JTC1/SC34 and published in its first version in 2003.", "backlinksCount": 815, "pageId": 347005, "dailyPageViews": 152, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/RELAX_NG" }, "isbndb": "" }, "relfun": { "title": "RELFUN", "appeared": 1986, "type": "pl", "reference": [ "http://dl.acm.org/citation.cfm?id=15045" ], "country": [ "Germany" ], "originCommunity": [ "Universitaet Kaiserslautern" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2446", "centralPackageRepositoryCount": 0 }, "relix": { "title": "Relix", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c941521abbeed0baeeed57311f02e3051ab5e78a" ], "country": [ "Canada" ], "originCommunity": [ "McGill University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1882", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "remix": { "title": "remix", "appeared": 2016, "type": "pl", "creators": [ "Jay McCarthy" ], "website": "https://docs.racket-lang.org/remix/index.html", "reference": [ "https://pkgs.racket-lang.org/package/remix" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/jeapostrophe/remix/issues" ], "githubRepo": { "firstCommit": 2013, "stars": 34, "forks": 3, "subscribers": 5, "created": 2013, "updated": 2022, "description": "remix - a revised version of Racket", "issues": 16, "url": "https://github.com/jeapostrophe/remix" }, "repoStats": { "firstCommit": 2013, "commits": 127, "committers": 5, "files": 39 } }, "ren-c": { "title": "Ren-C", "appeared": 2012, "type": "pl", "description": "Ren-C is a deeply redesigned LGPL 3.0-licensed derivative of the Rebol 3 codebase. It explores solutions to some of the Rebol language's longstanding open questions, adding fundamental new evaluation abilities and API embeddings.", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/metaeducation" ], "forkOf": [ "rebol" ], "githubRepo": { "firstCommit": 2012, "stars": 102, "forks": 27, "subscribers": 27, "created": 2015, "updated": 2022, "description": "Library for embedding a Rebol interpreter into C codebases", "issues": 105, "url": "https://github.com/metaeducation/ren-c" }, "repoStats": { "firstCommit": 2012, "commits": 8995, "committers": 55, "files": 1037 }, "isbndb": "", "semanticScholar": "" }, "ren-notation": { "title": "Ren", "appeared": 2013, "type": "dataNotation", "description": "Ren is a lightweight data-exchange text format. It is programming language independent with familiar conventions. Whitespace separates values, but is not significant beyond that. Ren has two main data structures: An ordered group of values, called a list; A collection of name/value pairs, called a map", "website": "http://www.ren-data.org/", "spec": "https://github.com/humanistic/REN", "reference": [ "http://pointillistic.com/ren/" ], "fileExtensions": [ "ren" ], "country": [ "United States" ], "originCommunity": [ "Pointillistic Software" ], "domainName": { "registered": 2014, "name": "ren-data.org" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "booleanTokens": [ [ "true", "false" ] ], "example": [ "[]\t\t\t; empty list\n#()\t\t\t; empty map\n[a 1 true #three]\t; non-empty list\n#(a: 1 b: \"two\")\t; non-empty map\n\"Ren Example 1\"\t; string\n-42\t\t\t; number\n98.6\t\t\t; another number\ntrue\t\t\t; literal true\nfalse\t\t; literal false\nnone\t\t\t; literal nil/null/nada\n#(\t\t\t; a bigger map\n quote:\t \"禅 saying: ^\"仁 rocks!^\"\"\n utf-8: \"^(CE91) to ^(cf89)\"\n sci-phi: 0.1618e1\n tax-rate: 3.9%\n price: $79.99\n url: http://www.ren-data.org/\n email: info@ren-data.org\n hashtag: #ren\n date: 2013-04-17/18:37:39-06:00\n warning: 00:02 ; = 00:00:120.0\n ip-addr: 127.0.0.1\n geo-pos: 43.6x116.7x817\n hex: 16#{DECAFBAD CAFE 00FF}\n base-64: 64#{UmVuIGlzIGRhdGE=} \n)" ], "isbndb": "" }, "renderman-shading-language": { "title": "RenderMan Shading Language", "appeared": 1989, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Pixar Animation Studios" ], "wikipedia": { "example": [ "float length(vector v) {\n return sqrt(v . v); /* . is a dot product */\n}" ], "related": [ "isbn" ], "summary": "Renderman Shading Language (abbreviated RSL) is a component of the RenderMan Interface Specification, and is used to define shaders. The language syntax is C-like. A shader written in RSL can be used without changes on any RenderMan-compliant renderer, such as Pixar's PhotoRealistic RenderMan, DNA Research's 3Delight, Sitexgraphics' Air or an open source solution such as Pixie or Aqsis. RenderMan Shading Language defines standalone functions and five types of shaders: surface, light, volume, imager and displacement shaders. An example of a surface shader that defines a metal surface is: Shaders do the work by reading and writing special variables such as Cs (surface color), N (normal at given point), and Ci (final surface color). The arguments to the shaders are global parameters that are attached to objects of the model (so one metal shader can be used for different metals and so on). Shaders have no return values, but functions can be defined which take arguments and return a value. For example, the following function computes vector length using the dot product operator \".\":", "created": 2006, "backlinksCount": 22, "pageId": 5405333, "revisionCount": 50, "dailyPageViews": 11, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/RenderMan_Shading_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1518", "centralPackageRepositoryCount": 0 }, "renderscript": { "title": "RenderScript", "appeared": 2011, "type": "pl", "description": "RenderScript is a component of the Android operating system for mobile devices that offers an API for acceleration that takes advantage of heterogeneous hardware. It allows developers to increase the performance of their applications at the cost of writing more complex (lower-level) code.", "website": "http://developer.android.com/guide/topics/renderscript/index.html", "reference": [ "https://developer.android.com/guide/topics/renderscript/advanced" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/*\n * Copyright (C) 2012 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n#pragma version(1)\n#pragma rs java_package_name(com.android.gallery3d.filtershow.filters)\n#pragma rs_fp_relaxed\n\nint32_t gWidth;\nint32_t gHeight;\nconst uchar4 *gPixels;\nrs_allocation gIn;\n\nfloat gCoeffs[9];\n\nvoid root(const uchar4 *in, uchar4 *out, const void *usrData, uint32_t x, uint32_t y) {\n uint32_t x1 = min((int32_t)x+1, gWidth-1);\n uint32_t x2 = max((int32_t)x-1, 0);\n uint32_t y1 = min((int32_t)y+1, gHeight-1);\n uint32_t y2 = max((int32_t)y-1, 0);\n\n float4 p00 = rsUnpackColor8888(gPixels[x1 + gWidth * y1]);\n float4 p01 = rsUnpackColor8888(gPixels[x + gWidth * y1]);\n float4 p02 = rsUnpackColor8888(gPixels[x2 + gWidth * y1]);\n float4 p10 = rsUnpackColor8888(gPixels[x1 + gWidth * y]);\n float4 p11 = rsUnpackColor8888(gPixels[x + gWidth * y]);\n float4 p12 = rsUnpackColor8888(gPixels[x2 + gWidth * y]);\n float4 p20 = rsUnpackColor8888(gPixels[x1 + gWidth * y2]);\n float4 p21 = rsUnpackColor8888(gPixels[x + gWidth * y2]);\n float4 p22 = rsUnpackColor8888(gPixels[x2 + gWidth * y2]);\n\n p00 *= gCoeffs[0];\n p01 *= gCoeffs[1];\n p02 *= gCoeffs[2];\n p10 *= gCoeffs[3];\n p11 *= gCoeffs[4];\n p12 *= gCoeffs[5];\n p20 *= gCoeffs[6];\n p21 *= gCoeffs[7];\n p22 *= gCoeffs[8];\n\n p00 += p01;\n p02 += p10;\n p11 += p12;\n p20 += p21;\n\n p22 += p00;\n p02 += p11;\n\n p20 += p22;\n p20 += p02;\n\n p20 = clamp(p20, 0.f, 1.f);\n *out = rsPackColorTo8888(p20.r, p20.g, p20.b);\n}\n" ], "wikipedia": { "related": [ "android", "cuda" ], "summary": "RenderScript is a component of the Android operating system for mobile devices that offers an API for acceleration that takes advantage of heterogeneous hardware. It allows developers to increase the performance of their applications at the cost of writing more complex (lower-level) code. It provides the developer three primary tools: A simple 3D rendering API, a compute API similar to CUDA, and a C99-derived language.", "pageId": 32576047, "created": 2011, "backlinksCount": 186, "revisionCount": 69, "dailyPageViews": 32, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/RenderScript" }, "githubLanguage": { "fileExtensions": [ "rs", "rsh" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 696, "id": "RenderScript" }, "githubBigQuery": { "repos": 407, "users": 379, "id": "RenderScript" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nRenderScript: parallel computing on Android, the easy way||Alberto Marchetti|52506360|4.00|1|0\nRenderscript: Parallel Computing on Android, the Easy Way||Alberto Marchetti|51643141|0.0|0|0" }, "renpy": { "title": "Ren'Py", "appeared": 2004, "type": "pl", "country": [ "England" ], "originCommunity": [ "https://github.com/renpy" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "related": [ "python", "cython", "linux", "freebsd", "android", "ios", "utf-8" ], "summary": "The Ren'Py Visual Novel Engine is a free software engine which facilitates the creation of visual novels, a form of computer-mediated storytelling. Ren'Py is a portmanteau of ren'ai (恋愛), the Japanese word for 'romantic love', a common element of games made using Ren'Py; and Python, the programming language that Ren'Py runs on. Ren'Py has proved attractive to English-language hobbyists; over 1000 games use the Ren'Py engine, nearly all in English.", "pageId": 17474146, "created": 2008, "backlinksCount": 250, "revisionCount": 375, "dailyPageViews": 130, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Ren'Py" }, "githubLanguage": { "fileExtensions": [ "rpy" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "python", "tmScope": "source.renpy", "aliases": [ "renpy" ], "repos": 3124, "id": "Ren'Py" }, "githubBigQuery": { "repos": 49, "users": 47, "id": "Ren'Py" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 26, "commitCount": 238, "sampleCount": 1, "example": [ "### Demo Script Example ###\n\n# This script, but not the artwork associated with it, is in the\n# public domain. Feel free to use it as the basis for your own\n# game.\n\n# If you're trying to understand this script, I recommend skipping\n# down to the line beginning with 'label start:', at least on your\n# first read-through.\n\n# This init block runs first, and sets up all sorts of things that\n# are used by the rest of the game. Variables that are set in init\n# blocks are _not_ saved, unless they are changed later on in the\n# program.\n\ninit:\n\n # Set up the size of the screen, and the window title.\n $ config.screen_width = 800\n $ config.screen_height = 600\n $ config.window_title = \"The Ren'Py Demo Game\"\n\n # Declare the images that are used in the program.\n\n # Backgrounds.\n image bg carillon = \"carillon.jpg\"\n image bg whitehouse = \"whitehouse.jpg\"\n image bg washington = \"washington.jpg\"\n image bg onememorial = \"1memorial.jpg\"\n image black = Solid((0, 0, 0, 255))\n\n # Character pictures.\n image eileen happy = \"9a_happy.png\"\n image eileen vhappy = \"9a_vhappy.png\"\n image eileen concerned = \"9a_concerned.png\"\n\n # A character object. This object lets us have the character say\n # dialogue without us having to repeatedly type her name. It also\n # lets us change the color of her name.\n\n $ e = Character('Eileen', color=(200, 255, 200, 255))\n\n# The start label marks the place where the main menu jumps to to\n# begin the actual game.\n\nlabel start:\n\n # The save_name variable sets the name of the save game. Like all\n # variables declared outside of init blocks, this variable is\n # saved and restored with a save file.\n $ save_name = \"Introduction\"\n\n # This variable is only used by our game. If it's true, it means\n # that we won the date.\n $ date = False\n\n # Clear the game runtime timer, so it doesn't reflect time spent\n # sitting at the main menu.\n $ renpy.clear_game_runtime()\n\n # Start some m" ], "url": "https://github.com/williamd1k0/language-renpy.git" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "report-writer-language": { "title": "RPT", "appeared": 1961, "type": "pl", "reference": [ "https://publibfp.dhe.ibm.com/epubs/pdf/c2643014.pdf", "https://www.microfocus.com/documentation/visual-cobol/VC40/EclWin/HRLHLHWRI01.html" ], "standsFor": "Report Writer Language", "country": [ "England" ], "originCommunity": [ "Micro Focus International plc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2457", "centralPackageRepositoryCount": 0 }, "rescript": { "title": "Rescript", "appeared": 2020, "type": "pl", "description": "ReScript is a robustly typed language that compiles to efficient and human-readable JavaScript. It comes with a lightning fast compiler toolchain that scales to any codebase size.", "website": "https://rescript-lang.org/", "webRepl": [ "https://rescript-lang.org/try" ], "domainName": { "registered": 2020, "awisRank": { "2022": 712029 }, "name": "rescript-lang.org" }, "compilesTo": [ "javascript" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "Js.log" ] ], "stringToken": [ [ "\"" ] ], "example": [ "module Button = {\n @react.component\n let make = (~count: int) => {\n let times = switch count {\n | 1 => \"once\"\n | 2 => \"twice\"\n | n => Belt.Int.toString(n) ++ \" times\"\n }\n let msg = \"Click me \" ++ times\n\n \n }\n}" ], "githubLanguage": { "type": "programming", "fileExtensions": [ "res" ], "interpreters": [ "ocaml" ], "aceMode": "rust", "codemirrorMode": "rust", "codemirrorMimeType": "text/x-rustsrc", "tmScope": "source.rescript", "repos": 1604, "id": "ReScript" }, "githubBigQuery": { "repos": 54, "users": 52, "id": "ReScript" }, "leachim6": { "filepath": "r/ReScript.res", "fileExtensions": [ "res" ], "example": [ "Js.log(\"Hello World\")" ], "id": "ReScript" }, "twitter": "https://twitter.com/rescriptlang" }, "resharper-editor": { "title": "resharper-editor", "appeared": 2004, "type": "editor", "website": "https://www.jetbrains.com/resharper", "country": [ "Czechia" ], "originCommunity": [ "JetBrains s.r.o" ] }, "rest": { "title": "REST", "appeared": 1996, "type": "protocol", "documentation": [ "https://restfulapi.net/", "https://docs.github.com/en/rest" ], "country": [ "United States" ], "originCommunity": [ "University of California, Irvine" ], "wikipedia": { "related": [ "wsdl", "soap", "url", "xml", "html", "json", "http", "javascript" ], "summary": "Representational state transfer (REST) or RESTful web services are a way of providing interoperability between computer systems on the Internet. REST-compliant Web services allow requesting systems to access and manipulate textual representations of Web resources using a uniform and predefined set of stateless operations. Other forms of Web services exist, which expose their own arbitrary sets of operations such as WSDL and SOAP. \"Web resources\" were first defined on the World Wide Web as documents or files identified by their URLs, but today they have a much more generic and abstract definition encompassing every thing or entity that can be identified, named, addressed or handled, in any way whatsoever, on the Web. In a RESTful Web service, requests made to a resource's URI will elicit a response that may be in XML, HTML, JSON or some other defined format. The response may confirm that some alteration has been made to the stored resource, and it may provide hypertext links to other related resources or collections of resources. Using HTTP, as is most common, the kind of operations available include those predefined by the HTTP methods GET, POST, PUT, DELETE and so on. By using a stateless protocol and standard operations, REST systems aim for fast performance, reliability, and the ability to grow, by re-using components that can be managed and updated without affecting the system as a whole, even while it is running. The term representational state transfer was introduced and defined in 2000 by Roy Fielding in his doctoral dissertation. Fielding's dissertation explained the REST principles were known as the \"HTTP object model\" beginning in 1994, and were used in designing the HTTP 1.1 and Uniform Resource Identifiers (URI) standards. The term is intended to evoke an image of how a well-designed Web application behaves: it is a network of Web resources (a virtual state-machine) where the user progresses through the application by selecting links, such as /user/tom, and operations such as GET or DELETE (state transitions), resulting in the next resource (representing the next state of the application) being transferred to the user for their use.", "pageId": 907222, "dailyPageViews": 4834, "created": 2004, "backlinksCount": 381, "revisionCount": 2534, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Representational_state_transfer" }, "indeedJobs": { "2022": 26215, "query": "rest developer" }, "fileType": "text", "wordRank": 1547, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|Pearson|SOA with REST: Principles, Patterns & Constraints for Building Enterprise Solutions with REST (The Pearson Service Technology Series from Thomas Erl)|Erl, Thomas and Carlyle, Benjamin and Pautasso, Cesare and Balasubramanian, Raj|9780137012510\n2018|Independently published|The Simple Six: The Easy Way to Get in Shape and Stay in Shape for the Rest of your Life|Dobbins, Clinton|9781791509408\n2012|O'Reilly Media|Building Web Applications with Erlang: Working with REST and Web Sockets on Yaws|Kessin, Zachary|9781449309961\n|O'reilly Media|Programming Web Services With Rest|Kendall Grant Clark|9780596006037\n2015|Apress|Pro REST API Development with Node.js|Doglio, Fernando|9781484209172", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|The Ensembl REST API: Ensembl Data for Any Language|10.1093/bioinformatics/btu613|144|13|Andrew D. Yates and Kathryn Beal and S. Keenan and W. McLaren and M. Pignatelli and G. Ritchie and Magali Ruffier and K. Taylor and Alessandro Vullo and P. Flicek|2f037c4247c4eaf4e7c732777e7b9956a029d9fa\n2005|A patient-identity security mechanism for electronic medical records during transit and at rest|10.1080/14639230500209443|21|0|H. Chao and S. Twu and Chin-Ming Hsu|ace709d8335dbf12c4a2586c26161c13ffd8c8ab\n2018|Eleven quick tips to build a usable REST API for life sciences|10.1371/journal.pcbi.1006542|9|0|Aleksandra Tarkowska and D. Carvalho-Silva and C. E. Cook and E. Turner and R. Finn and Andrew D. Yates|40baed8ce82389d779c7f22c4b7da3c4cd21c81a\n2016|Metamodeling vs Metaprogramming: A Case Study on Developing Client Libraries for REST APIs|10.1007/978-3-319-42061-5_13|7|0|M. Scheidgen and Sven Efftinge and Frederik Marticke|76472a147f943c45cf6fececcb83916666e42923\n2019|Implementasi Rest Api Web Service dalam Membangun Aplikasi Multiplatform untuk Usaha Jasa|10.30812/MATRIK.V18I2.407|6|0|Romi Choirudin and Ahmat Adil|c31322f615830daa87f30a05b97055913d46fcd9\n2018|API REST Web service and backend system Of Lecturer’s Assessment Information System on Politeknik Negeri Bali|10.1088/1742-6596/953/1/012069|3|0|I. Manuaba and E. Rudiastini|bd201af25bb641d6589e8ed9edf8eab4a5b2730d\n2015|Matlab Adapter - Online Access to Matlab/Simulink Based on REST Web Services|10.1007/978-3-319-18503-3_20|2|0|Miroslav Gula and K. Žáková|3b95c0284310a8cc6d3cb628757d0144153a85c3\n2019|Comparative Study between Web Services Technologies: REST and WSDL|10.1109/3ICT.2019.8910298|1|0|Rashed A. Bahlool and A. Zeki|8b241398fc0f8d2cfd4f83bf6722fcb741ddebd4" }, "restructuredtext": { "title": "reStructuredText", "appeared": 2002, "type": "textMarkup", "creators": [ "David Goodger" ], "description": "\"reStructuredText\" is ONE word, not two! reStructuredText is an easy-to-read, what-you-see-is-what-you-get plaintext markup syntax and parser system. It is useful for in-line program documentation (such as Python docstrings), for quickly creating simple web pages, and for standalone documents. reStructuredText is designed for extensibility for specific application domains. The reStructuredText parser is a component of Docutils. reStructuredText is a revision and reinterpretation of the StructuredText and Setext lightweight markup systems.", "documentation": [ "https://docutils.sourceforge.io/rst.html" ], "reference": [ "http://docutils.sourceforge.net/rst.html" ], "country": [ "Canada" ], "originCommunity": [ "https://sourceforge.net/p/docutils/_list/tickets" ], "hasSemanticIndentation": { "example": "", "value": true }, "wikipedia": { "example": [ "::\n\n some literal text\n\nThis may also be used inline at the end of a paragraph, like so::\n\n some more literal text\n\n.. code:: python\n\n print(\"A literal block directive explicitly marked as python code\")" ], "related": [ "rest", "java", "pod", "perl", "python", "cmake", "markdown", "org", "textile", "html", "asciidoc", "txt2tags" ], "summary": "reStructuredText (sometimes abbreviated as RST, ReST, or reST) is a file format for textual data used primarily in the Python programming language community for technical documentation. It is part of the Docutils project of the Python Doc-SIG (Documentation Special Interest Group), aimed at creating a set of tools for Python similar to Javadoc for Java or POD for Perl. Docutils can extract comments and information from Python programs, and format them into various forms of program documentation. In this sense, reStructuredText is a lightweight markup language designed to be both (a) processable by documentation-processing software such as Docutils, and (b) easily readable by human programmers who are reading and writing Python source code.", "pageId": 730903, "dailyPageViews": 161, "created": 2004, "backlinksCount": 56, "revisionCount": 259, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/ReStructuredText" }, "githubLanguage": { "fileExtensions": [ "rst", "rest", "resttxt", "rsttxt" ], "trendingProjectsCount": 0, "type": "prose", "aceMode": "text", "codemirrorMode": "rst", "codemirrorMimeType": "text/x-rst", "tmScope": "text.restructuredtext", "wrap": true, "aliases": [ "rst" ], "repos": 31, "id": "reStructuredText" }, "monaco": "restructuredtext", "pygmentsHighlighter": { "filename": "markup.py", "fileExtensions": [ "rst", "rest" ], "id": "reStructuredText" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 16, "commitCount": 101, "sampleCount": 1, "example": [ "Contributing to SciPy\n=====================\n\nThis document aims to give an overview of how to contribute to SciPy. It\ntries to answer commonly asked questions, and provide some insight into how the\ncommunity process works in practice. Readers who are familiar with the SciPy\ncommunity and are experienced Python coders may want to jump straight to the\n`git workflow`_ documentation.\n\n\nContributing new code\n---------------------\n\nIf you have been working with the scientific Python toolstack for a while, you\nprobably have some code lying around of which you think \"this could be useful\nfor others too\". Perhaps it's a good idea then to contribute it to SciPy or\nanother open source project. The first question to ask is then, where does\nthis code belong? That question is hard to answer here, so we start with a\nmore specific one: *what code is suitable for putting into SciPy?*\nAlmost all of the new code added to scipy has in common that it's potentially\nuseful in multiple scientific domains and it fits in the scope of existing\nscipy submodules. In principle new submodules can be added too, but this is\nfar less common. For code that is specific to a single application, there may\nbe an existing project that can use the code. Some scikits (`scikit-learn`_,\n`scikits-image`_, `statsmodels`_, etc.) are good examples here; they have a\nnarrower focus and because of that more domain-specific code than SciPy.\n\nNow if you have code that you would like to see included in SciPy, how do you\ngo about it? After checking that your code can be distributed in SciPy under a\ncompatible license (see FAQ for details), the first step is to discuss on the\nscipy-dev mailing list. All new features, as well as changes to existing code,\nare discussed and decided on there. You can, and probably should, already\nstart this discussion before your code is finished.\n\nAssuming the outcome of the discussion on the mailing list is positive and you\nhave a function or piece of code that does what you nee" ], "url": "https://github.com/Lukasa/language-restructuredtext" }, "leachim6": { "filepath": "r/reStructuredText.rst", "fileExtensions": [ "rst" ], "example": [ "============\nHello World\n============\n\n" ], "id": "reStructuredText" }, "rijuRepl": { "example": [ "Hello, world!\n" ], "id": "https://riju.codes/restructuredtext" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "retdec": { "title": "RetDec", "appeared": 2017, "type": "decompiler", "website": "https://retdec.com/", "country": [ "Czech Republic" ], "originCommunity": [ "Avast Software s.r.o." ], "domainName": { "registered": 2015, "name": "retdec.com" }, "githubRepo": { "firstCommit": 2017, "stars": 6617, "forks": 814, "subscribers": 235, "created": 2017, "updated": 2022, "description": "RetDec is a retargetable machine-code decompiler based on LLVM.", "issues": 389, "url": "https://github.com/avast/retdec" } }, "retroforth": { "title": "retroforth", "appeared": 2000, "type": "pl", "creators": [ "Charles Childers" ], "website": "http://www.retroforth.org/", "country": [ "United States" ], "originCommunity": [ "http://forthworks.com" ], "domainName": { "registered": 2004, "name": "retroforth.org" } }, "reuse-description-language": { "title": "Reuse Description Language", "appeared": 2005, "type": "pl", "description": "RDL: A Language for Framework Instantiation Representation", "reference": [ "https://cs.uwaterloo.ca/research/tr/2005/CS-2005-11.pdf" ], "aka": [ "RDL" ], "country": [ "Brazil and Canada" ], "originCommunity": [ "Pontifical University Catholic of Rio Grande do Sul", "Pontifical University of Rio de Janeiro", "University of Waterloo" ], "centralPackageRepositoryCount": 0 }, "reverse-polish-notation": { "title": "Reverse Polish notation", "appeared": 1953, "type": "notation", "documentation": [ "https://www-stone.ch.cam.ac.uk/documentation/rrf/rpn.html", "https://docs.racket-lang.org/rpn/index.html" ], "country": [ "Germany" ], "originCommunity": [ "Zuse-Ingenieurbüro Hopferau" ], "wikipedia": { "example": [ "15 7 1 1 + − ÷ 3 × 2 1 1 + + − =\n15 7 1 1 + − ÷ 3 × 2 2 + − =\n15 7 1 1 + − ÷ 3 × 4 − =\n15 7 2 − ÷ 3 × 4 − =\n15 5 ÷ 3 × 4 − =\n 3 3 × 4 − =\n 9 4 − =\n 5" ], "related": [ "forth", "postscript", "rpl", "factor", "bibtex", "befunge", "joy", "iptscrae", "android", "unix", "dc" ], "summary": "Reverse Polish notation (RPN), also known as Polish postfix notation or simply postfix notation, is a mathematical notation in which operators follow their operands, in contrast to Polish notation (PN), in which operators precede their operands. It does not need any parentheses as long as each operator has a fixed number of operands. The description \"Polish\" refers to the nationality of logician Jan Łukasiewicz, who invented Polish notation in 1924.The reverse Polish scheme was proposed in 1954 by Arthur Burks, Don Warren, and Jesse Wright and was independently reinvented by Friedrich L. Bauer and Edsger W. Dijkstra in the early 1960s to reduce computer memory access and utilize the stack to evaluate expressions. The algorithms and notation for this scheme were extended by Australian philosopher and computer scientist Charles L. Hamblin in the mid-1950s.During the 1970s and 1980s, Hewlett-Packard used RPN in all of their desktop and hand-held calculators, and continued to use it in some into the 2010's. In computer science, reverse Polish notation is used in stack-oriented programming languages such as Forth and PostScript. Most of what follows is about binary operators. An example of a unary operator whose standard notation may be interpreted as reverse Polish notation is the factorial, \"n!\".", "created": 2002, "backlinksCount": 211, "pageId": 26513, "revisionCount": 1037, "dailyPageViews": 836, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/Reverse_Polish_notation" }, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "revit-app": { "title": "Autodesk Revit", "appeared": 1997, "type": "application", "country": [ "United States" ], "originCommunity": [ "Autodesk, Inc" ], "wikipedia": { "summary": "Autodesk Revit is building information modelling software for architects, landscape architects, structural engineers, MEP engineers, designers and contractors. The original software was developed by Charles River Software, founded in 1997, renamed Revit Technology Corporation in 2000, and acquired by Autodesk in 2002. The software allows users to design a building and structure and its components in 3D, annotate the model with 2D drafting elements, and access building information from the building model's database. Revit is 4D BIM capable with tools to plan and track various stages in the building's lifecycle, from concept to construction and later maintenance and/or demolition.", "backlinksCount": 185, "pageId": 7399459, "dailyPageViews": 462, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Autodesk_Revit" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "revolution-programming-language": { "title": "Revolution", "appeared": 1993, "type": "pl", "creators": [ "Mark Waddingham" ], "website": "https://livecode.com/", "renamedTo": [ "livecode" ], "country": [ "United Kingdom" ], "originCommunity": [ "LiveCode Ltd" ], "githubRepo": { "firstCommit": 2013, "stars": 448, "forks": 223, "subscribers": 71, "created": 2013, "updated": 2022, "description": "LiveCode cross-platform development environment (engine)", "issues": 198, "url": "https://github.com/livecode/livecode" }, "repoStats": { "firstCommit": 2013, "commits": 29990, "committers": 124, "files": 7646 }, "wikipedia": { "example": [ "put url \"binfile:picture.jpg\" into url \"ftp://john:passwd@ftp.example.net:2121/picture.jpg\"" ], "related": [ "linux", "unix", "android", "ios", "hypertalk", "hypercard", "sql" ], "summary": "LiveCode (formerly Revolution and MetaCard) is a cross-platform rapid application development runtime environment inspired by HyperCard. It features the Transcript (formerly MetaTalk) programming language which belongs to the family of xTalk scripting languages like HyperCard's HyperTalk.The environment was introduced in 2001. The \"Revolution\" development system was based on the MetaCard engine technology which Runtime Revolution later acquired from MetaCard Corporation in 2003. The platform won the Macworld Annual Editor's Choice Award for \"Best Development Software\" in 2004. \"Revolution\" was renamed \"LiveCode\" in the fall of 2010. \"LiveCode\" is developed and sold by Runtime Revolution Ltd., based in Edinburgh, Scotland. In March, 2015, the company was renamed \"LiveCode Ltd.\", to unify the company name with the product. In April 2013 a free/open source version 'LiveCode Community Edition 6.0' was published after a successful crowdfunding campaign at Kickstarter. The code base was re-licensed and made available as free and open source software with a version in April 2013. LiveCode runs on iOS, Android, OS X, Windows 95 through Windows 10, Raspberry Pi and several variations of Unix, including Linux, Solaris, and BSD. It can be used for mobile, desktop and server/CGI applications. The iOS (iPhone and iPad) version was released in December 2010. The first version to deploy to the Web was released in 2009. It is the most widely used HyperCard/HyperTalk clone, and the only one that runs on all major operating systems. A developer release of v.8 was announced in New York on March 12, 2015. This major enhancement to the product includes a new, separate development language, known as \"LiveCode Builder\", which is capable of creating new object classes called \"widgets\". In earlier versions, the set of object classes was fixed, and could only be enhanced via the use of ordinary procedural languages like C. The new language, which runs in its own IDE, is a departure from the transitional x-talk paradigm in that it permits typing of variables. But the two environments are fully integrated, and apart from the ability to create new objects, development in LiveCode proceeds in the normal way, within the established IDE. A second crowdfunding campaign to Bring HTML5 to LiveCode reached funding goals of nearly $400,000 USD on July 31, 2014. LiveCode developer release 8.0 DP4 (August 31, 2015) was the first to include a standalone deployment option to HTML5.", "created": 2011, "backlinksCount": 56, "pageId": 30890362, "revisionCount": 5, "dailyPageViews": 2, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Revolution_(programming_language)" }, "centralPackageRepositoryCount": 0 }, "rexon": { "title": "Rexon", "appeared": 1978, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Rexon Business Machines" ], "wikipedia": { "related": [ "business-basic" ], "summary": "Rexon Business Machines, later Rexon, Inc., was a manufacturer of small business computer systems founded by Ben C. Wang in 1978 in Culver City, California. It also became a major manufacturer of tape drives and related products. At its height, it played a significant role in the development and sale of magnetic tape data storage products. It traded on the NASDAQ under the symbol REXN until it filed for bankruptcy in 1995 and was acquired by Legacy Storage Systems, a Canadian company. It was last headquartered in Longmont, Colorado.", "created": 2007, "backlinksCount": 10, "pageId": 8827963, "revisionCount": 28, "dailyPageViews": 6, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/Rexon" }, "centralPackageRepositoryCount": 0 }, "rexx": { "title": "Rexx", "appeared": 1979, "type": "pl", "creators": [ "Mike Cowlishaw" ], "documentation": [ "https://www.ibm.com/docs/en/zos/2.1.0?topic=guide-learning-rexx-language" ], "fileExtensions": [ "cmd", "exec", "rexx", "rex" ], "country": [ "United Kingdom" ], "originCommunity": [ "IBM" ], "hasComments": { "example": "* => 1000000000 */", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "say" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "ChangeCodePage: procedure /* protect SIGNAL settings */\n signal on syntax name ChangeCodePage.Trap\n return SysQueryProcessCodePage()\n ChangeCodePage.Trap: return 1004 /* windows-1252 on OS/2 */" ], "related": [ "arexx", "netrexx", "object-rexx", "pl-i", "algol", "cms-exec", "exec-2", "perl", "assembly-language", "tcl", "python", "java", "linux", "unix", "solaris", "visual-basic", "jscript" ], "summary": "Rexx (Restructured Extended Executor) is an interpreted programming language developed at IBM by Mike Cowlishaw. It is a structured, high-level programming language designed for ease of learning and reading. Proprietary and open source REXX interpreters exist for a wide range of computing platforms; compilers exist for IBM mainframe computers. Rexx is used as a scripting and macro language, and is often used for processing data and text and generating reports; these similarities with Perl mean that Rexx works well in Common Gateway Interface (CGI) programming and it is indeed used for this purpose. Rexx is the primary scripting language in some operating systems, e.g. OS/2, MVS, VM, AmigaOS, and is also used as an internal macro language in some other software, such as KEDIT, THE and the ZOC terminal emulator. Additionally, the Rexx language can be used for scripting and macros in any program that uses Windows Scripting Host ActiveX scripting engines languages (e.g. VBScript and JScript) if one of the Rexx engines is installed. Rexx is supplied with VM/SP on up, TSO/E Version 2 on up, OS/2 (1.3 and later, where it is officially named Procedures Language/2), AmigaOS Version 2 on up, PC DOS (7.0 or 2000), and Windows NT 4.0 (Resource Kit: Regina). REXX scripts for OS/2 share the filename extension .cmd with other scripting languages, and the first line of the script specifies the interpreter to be used. REXX macros for REXX-aware applications use extensions determined by the application. In the late 1980s Rexx became the common scripting language for IBM Systems Application Architecture, where it was renamed \"SAA Procedure Language REXX.\" A Rexx script or command is sometimes referred to as an EXEC in a nod to Rexx's role as a replacement for the older EXEC command language on CP/CMS and VM/370 and EXEC 2 command language on VM/SP.", "pageId": 25572284, "dailyPageViews": 43, "created": 2012, "backlinksCount": 91, "revisionCount": 3, "appeared": 1979, "fileExtensions": [ "cmd", "exec", "rexx", "rex" ], "url": "https://en.wikipedia.org/wiki/REXX" }, "githubLanguage": { "fileExtensions": [ "rexx", "pprx", "rex" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "regina", "rexx" ], "aceMode": "text", "tmScope": "source.rexx", "aliases": [ "arexx" ], "repos": 263, "id": "REXX" }, "githubBigQuery": { "repos": 71, "users": 69, "id": "REXX" }, "pygmentsHighlighter": { "filename": "scripting.py", "fileExtensions": [ "rexx", "rex", "rx", "arexx" ], "id": "Rexx" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2017, "committerCount": 2, "commitCount": 13, "sampleCount": 4, "example": [ "/* rexx */\nPARSE ARG filnamn\nIF filnamn='' THEN DO\n filnamn='raw'\n filnamn='font.shapes'\n end\nIF ~open(fil,filnamn,r) THEN EXIT 10\npixwidth=48\nebwidth=pixwidth/8\npixheight=48\ndepth=4\nSAY \"Skriver utfil...\"\nCALL open utfil,\"RAM:utfil\",W\nCALL skriv pixwidth,2\nCALL skriv pixheight,2\nCALL skriv depth,2\nCALL skriv ebwidth,2\nbltsize=Right(C2B(D2C(pixheight)),10,\"00\")\nbltsize=bltsize || Right(C2B(D2C(ebwidth)),6,\"00\")\n/* SAY bltsize */\nCALL skriv C2D(B2C(bltsize)),2\nCALL skriv 0,4 /* xhandle, yhandle*/\nCALL skriv 0,4 /* datapekare */\nCALL skriv 0,4 /* cookiepekare */\nCALL skriv ebwidth*pixheight,2 /* onebpmem */\nCALL skriv ebwidth*pixheight+pixheight*2,2 /* onebpmemx */\nCALL skriv ebwidth*pixheight*depth,2 /* allbpmem */\nCALL skriv ebwidth*pixheight*depth+pixheight*2*depth,2 /* allbpmemx */\nCALL skriv 0,2 /* padding */\nCALL Close utfil\nEXIT\n\nskriv:\nsay \"Skriver $\"D2X(arg(1)) \"(\"arg(2) \"byte)\"\ncall writech utfil,right(D2C(ARG(1)),ARG(2),\"00\"x)\nreturn\n\nvisacookie:\n rad=copies('00'x,pixheight*ebwidth)\n say \"Initierar bitmap till\" pixheight*ebwidth*depth\n say \"Ett bitplan =\" pixheight*ebwidth\n bmap.=''\n say \"laser in\"\n do bitplan=1 to depth\n say \"laser plan\" bitplan\n rad=bitor(rad,readch(fil,pixheight*ebwidth))\n end\n ln=1\n say \"skriver ut\"\n do for pixheight\n say c2b(substr(rad,ln,bredd/8))\n ln=ln+bredd/8\n end\nreturn" ], "url": "https://github.com/mblocker/rexx-sublime" }, "projectEuler": { "memberCount": { "2019": 11, "2022": 11 }, "id": "Rexx" }, "leachim6": { "filepath": "r/Rexx.rexx", "fileExtensions": [ "rexx" ], "example": [ "<>=\nSay \"Hello World\"\n" ], "id": "Rexx" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:REXX", "quineRelay": "REXX", "rijuRepl": { "example": [ "say \"Hello, world!\"\n" ], "id": "https://riju.codes/rexx" }, "tryItOnline": "rexx", "indeedJobs": { "2022": 40, "query": "rexx engineer" }, "tiobe": { "id": "REXX" }, "hopl": "https://hopl.info/showlanguage.prx?exp=868", "ubuntuPackage": "regina-rexx", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming In Rexx|1992|Charles Daney|1795698|4.40|5|0\nThe REXX Language on TSO: REXX Functions|2013|Gabriel F. Gargiulo|27160540|4.00|2|0\nREXX Programmer's Reference|2005|Howard Fosdick|1795688|3.58|12|1\nThe REXX Language: A Practical Approach to Programing|1990|Michael Cowlishaw|1795697|4.33|12|0\nrexx tutorial for beginners:learn rexx programming: learn rexx programming very fast||Anmol Goyal|59640536|5.00|1|0\nRexx: Advanced Techniques For Programmers|1992|Peter C. Kiesel|13267128|3.00|2|0\nThe REXX Language on TSO|2012|Gabriel F. Gargiulo|27149752|4.00|3|0\nObject-Oriented Programming with REXX|1997|Thomas Ender|7323905|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1990T|McGraw-Hill|Programming in REXX|Daney, Charles|9780070153059\n1990|Prentice Hall|The Rexx Language: A Practical Approach to Programming|Cowlishaw, Michael|9780137806515\n2005|Wrox|Rexx Programmer's Reference|Fosdick, Howard|9780764579967\n1985|Prentice Hall|The REXX language: A practical approach to programming|Cowlishaw, M. F|9780137807352\n1985|Prentice Hall|Modern Programming Using Rexx|O'Hara, Robert P. and Gomberg, David Roos|9780135973110\n1988|Prentice Hall|Modern Programming Using Rexx|O'Hara, Robert P. and Gomberg, David Roos|9780135973295\n1997|Prentice Hall|The Net REXX Language|Michael F. Cowlishaw|9780138063320\n1997|Wiley|Object-oriented Programming With Rexx|Tom Ender|9780471118442\n20121206|Springer Nature|Practical Usage of TSO REXX|Anthony S. Rudd|9781447107552\n20101001|De Gruyter|REXX Grundlagen für die z/OS Praxis|Johann Deuring|9783486598759\n1996|Ibm|Vm/esa Gui Facility Developer's Guide Rexx And C++ Gui Programming|Ibm Redbooks|9780738408699", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1984|The design of the REXX language|10.1145/24686.24687|12|0|M. Cowlishaw|390c4c26f46bc92ef15fff9dfd99ba1e563bbdeb\n1994|The early history of REXX|10.1109/85.329753|5|0|M. Cowlishaw|e47b141a0094c59c652e2e715829b321298b546f\n1989|REXX on TSO/E|10.1147/sj.282.0274|2|0|Gerhard E. Hoernes|caadce71ca7e82e1ba8e3e0a471db6be758e6525\n1991|Partial Compilation of REXX|10.1147/sj.303.0312|1|0|R. Pinter and P. Vortman and Zvi Weiss|2d3d89b37f8cfa39ac9b00eeae8507a09f6e350e" }, "rf-maple": { "title": "RF-Maple", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/35319210e378378f3c772aa93246bb6351323c3c" ], "country": [ "Canada" ], "originCommunity": [ "University of British Columbia" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5506", "centralPackageRepositoryCount": 0 }, "rfc": { "title": "RFC", "appeared": 1969, "type": "notation", "creators": [ "Steve Crocker" ], "documentation": [ "https://www.ietf.org/standards/rfcs/" ], "standsFor": "Request for Comments", "country": [ "United States" ], "originCommunity": [ "University of California, Los Angeles" ], "wikipedia": { "example": [ "RFC 2046 Media Types November 1996\n\n\n A. Collected Grammar .................................... 43\n\n1. Introduction\n\n The first document in this set, RFC 2045, defines a number of header\n fields, including Content-Type. The Content-Type field is used to\n specify the nature of the data in the body of a MIME entity, by\n giving media type and subtype identifiers, and by providing auxiliary\n information that may be required for certain media types. After the" ], "related": [ "ascii" ], "summary": "A Request for Comments (RFC) is a type of publication from the Internet Engineering Task Force (IETF) and the Internet Society (ISOC), the principal technical development and standards-setting bodies for the Internet. An RFC is authored by engineers and computer scientists in the form of a memorandum describing methods, behaviors, research, or innovations applicable to the working of the Internet and Internet-connected systems. It is submitted either for peer review or simply to convey new concepts, information, or (occasionally) engineering humor. The IETF adopts some of the proposals published as RFCs as Internet Standards. Request for Comments documents were invented by Steve Crocker in 1969 to help record unofficial notes on the development of ARPANET. RFCs have since become official documents of Internet specifications, communications protocols, procedures, and events.", "pageId": 25540, "dailyPageViews": 700, "created": 2001, "backlinksCount": 739, "revisionCount": 757, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Request_for_Comments" }, "fileType": "text", "wordRank": 5769, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2022-02-21|tredition|SAP interface programming with RFC and VBA|Karl Josef Hensel|9783347574793", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Performance Evaluation for SOAP and RFC in SAP Netweaver Platform|10.1109/ICWS.2010.114|1|0|Z. Cao and R. Jandhyala and Shiva Koduvayur|dc676ab52f397f4cb4994fe9f732d27842efafec" }, "rgb-format": { "title": "Silicon Graphics Image", "appeared": 1996, "type": "binaryDataFormat", "reference": [ "https://media.xiph.org/svt/SGIIMAGESPEC" ], "country": [ "United States" ], "originCommunity": [ "Silicon Graphics, Inc" ], "wikipedia": { "summary": "Silicon Graphics Image (SGI) or the RGB file format is the native raster graphics file format for Silicon Graphics workstations. The format was invented by Paul Haeberli. It can be run-length encoded (RLE). Among others FFmpeg and ImageMagick support this format.", "backlinksCount": 164, "pageId": 4832977, "dailyPageViews": 40, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Silicon_Graphics_Image" } }, "rhet": { "title": "RHET", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/054759c784505fb4fa6d40afc4eb573fd6704824" ], "country": [ "United States" ], "originCommunity": [ "University of Rochester" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7726", "centralPackageRepositoryCount": 0 }, "rhine": { "title": "rhine", "appeared": 2014, "type": "pl", "creators": [ "Ramkumar Ramachandra" ], "country": [ "France" ], "originCommunity": [ "https://github.com/artagnon/rhine/issues" ], "githubRepo": { "firstCommit": 2014, "stars": 159, "forks": 8, "subscribers": 6, "created": 2015, "updated": 2022, "description": "🔬 a C++ compiler middle-end, using an LLVM backend", "issues": 0, "url": "https://github.com/artagnon/rhine" }, "repoStats": { "firstCommit": 2015, "commits": 460, "committers": 1, "files": 194 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n11321164|Show HN: Rhine – A typed Elixir-inspired language on LLVM|2016-03-20 00:18:24 UTC|1458433104|artagnon|16|81" }, "rholang": { "title": "Rholang", "appeared": 2016, "type": "contractLanguage", "description": "Rholang is an open and scalable blockchain language designed for speed, reliability and formal process orchestration build on latest research in the reflective high order process calculus.", "website": "https://rchain-community.github.io/", "documentation": [ "https://rchain-community.github.io/docs" ], "originCommunity": [ "https://rchain-community.github.io/" ], "domainName": { "name": "rchain-community.github.io" }, "writtenIn": [ "scala", "c", "cpp", "python" ], "example": [ "new helloworld, stdout(`rho:io:stdout`) in { \n contract helloworld( world ) = { \n for( @msg <- world ) { \n stdout!(msg) \n }\n } | \n new world, world2 in {\n helloworld!(*world) | \n world!(\"Hello World\") |\n helloworld!(*world2) | \n world2!(\"Hello World again\")\n }\n}\n" ], "githubRepo": { "stars": 678, "forks": 215, "subscribers": 87, "created": 2017, "updated": 2023, "description": "Blockchain (smart contract) platform using CBC-Casper proof of stake + Rholang for concurrent execution.", "issues": 132, "url": "https://github.com/rchain/rchain" }, "repoStats": { "firstCommit": 2017, "commits": 14740, "committers": 136, "files": 1593 }, "indeedJobs": { "2022": 13, "query": "couchdb developer" }, "subreddit": [ { "memberCount": { "2022": 1000 }, "url": "https://www.reddit.com/r/CouchDB" } ], "twitter": "https://twitter.com/rchain_coop", "isOpenSource": true }, "rhoscript": { "title": "rhoscript", "appeared": 2013, "type": "pl", "website": "http://www.rhoscript.com", "domainName": { "name": "rhoscript.com" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n6272294|Show HN: I designed a language for code golf, compiling to Common Lisp|2013-08-25 15:17:19 UTC|1377443839|n_c|40|102" }, "rhtml": { "title": "RHTML", "appeared": 2004, "type": "template", "description": "RHTML is HTML mixed with Ruby, using HTML tags. All of Ruby is available for programming along with HTML.", "reference": [ "https://www.tutorialspoint.com/ruby-on-rails/rails-and-rhtml.htm" ], "country": [ "Various" ], "originCommunity": [ "https://github.com/rails" ], "example": [ "
    \n <% @products.each do |p| %>\n
  • <%= @p.name %>
    • \n <% end %>\n
" ], "githubLanguage": { "fileExtensions": [ "rhtml" ], "trendingProjectsCount": 0, "repos": 0, "id": "RHTML" }, "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "rhtml" ], "id": "RHTML" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 76, "commitCount": 458, "url": "https://github.com/atom/language-ruby" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "ricscript": { "title": "RicScript", "appeared": 2019, "type": "pl", "creators": [ "Rickard" ], "githubRepo": { "firstCommit": 2019, "stars": 26, "forks": 1, "subscribers": 3, "created": 2019, "updated": 2022, "description": "My own modern scripting language; implemented in C using old school yacc & flex", "issues": 0, "url": "https://github.com/Ricardicus/ric-script" }, "repoStats": { "firstCommit": 2019, "commits": 987, "committers": 10, "files": 498 } }, "rider-editor": { "title": "rider-editor", "appeared": 2017, "type": "editor", "website": "https://www.jetbrains.com/rider", "country": [ "Czechia" ], "originCommunity": [ "JetBrains s.r.o" ] }, "riff": { "title": "Riff", "appeared": 2020, "type": "pl", "creators": [ "Darryl Abbate" ], "website": "https://riff.cx", "webRepl": [ "https://riff.run" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/riff-lang" ], "githubRepo": { "firstCommit": 2020, "stars": 18, "forks": 1, "subscribers": 2, "created": 2020, "updated": 2022, "description": "The Riff interpreter", "issues": 55, "url": "https://github.com/riff-lang/riff" }, "repoStats": { "firstCommit": 2020, "commits": 717, "committers": 1, "files": 148 } }, "rigal": { "title": "RIGAL", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7f537c1112181c9facf25190ac259bf5214d82ec" ], "country": [ "Former USSR or Latvia" ], "originCommunity": [ "Institute of Mathematics and Computer Science of the Latvia University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1357", "centralPackageRepositoryCount": 0 }, "rigc": { "title": "RigC", "appeared": 2021, "type": "pl", "creators": [ "Poeta Kodu" ], "website": "https://rigc-lang.org", "fileExtensions": [ "rigc" ], "country": [ "Poland" ], "originCommunity": [ "https://github.com/RigCLang" ], "keywords": [ "as", "break", "class", "const", "continue", "do", "else", "enum", "export", "false", "for", "from", "func", "if", "import", "of", "override", "ret", "template", "true", "type_name", "union", "var", "while" ], "githubRepo": { "stars": 10, "forks": 3, "subscribers": 2, "created": 2021, "updated": 2022, "description": "A prototype of RigC programming language.", "url": "https://github.com/RigCLang/rigc-lang/" }, "repoStats": { "firstCommit": 2021, "commits": 301, "committers": 8, "files": 137 } }, "ring": { "title": "Ring", "appeared": 2016, "type": "pl", "creators": [ "Mahmoud Fayed" ], "website": "http://ring-lang.net", "fileExtensions": [ "ring", "rh", "rform" ], "country": [ "Saudi Arabia" ], "originCommunity": [ "King Saud University" ], "domainName": { "registered": 2016, "name": "ring-lang.net" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "c", "linux", "lua", "python", "ruby", "csharp", "basic", "qml", "xbase" ], "summary": "Ring is a dynamic and general-purpose programming language. It can be embedded in C/C++ projects, extended using C/C++ code and/or used as a standalone language. The supported programming paradigms are imperative, procedural, object-oriented, functional, Meta programming, declarative programming using nested structures, and natural programming. The language is portable (Windows, Linux, Mac OS X, Android, etc.) and can be used to create Console, GUI, Web, Games and Mobile applications.", "pageId": 52912829, "dailyPageViews": 42, "created": 2017, "backlinksCount": 6, "revisionCount": 91, "appeared": 2016, "fileExtensions": [ "ring", "rh", "rform" ], "url": "https://en.wikipedia.org/wiki/Ring_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "ring" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.ring", "repos": 195, "id": "Ring" }, "githubBigQuery": { "repos": 3, "users": 3, "id": "Ring" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2017, "committerCount": 1, "commitCount": 6, "sampleCount": 4, "example": [ "New App\n{\n I want window\n The window title = \"hello world\"\n}\n\nClass App\n\n func geti\n if nIwantwindow = 0\n nIwantwindow++\n ok\n\n func getwant\n if nIwantwindow = 1\n nIwantwindow++\n ok\n\n func getwindow\n if nIwantwindow = 2\n nIwantwindow= 0\n see \"Instruction : I want window\" + nl\n ok\n if nWindowTitle = 0\n nWindowTitle++\n ok\n\n func settitle cValue\n if nWindowTitle = 1\n nWindowTitle=0\n see \"Instruction : Window Title = \" + cValue + nl\n ok\n\n private\n\n # Attributes for the instruction I want window\n i want window\n nIwantwindow = 0\n # Attributes for the instruction Window title\n # Here we don't define the window attribute again\n title\n nWindowTitle = 0\n # Keywords to ignore, just give them any value\n the=0\n" ], "url": "https://github.com/MahmoudFayed/atom-language-ring" }, "leachim6": { "filepath": "r/Ring.ring", "fileExtensions": [ "ring" ], "example": [ "see \"Hello World\" " ], "id": "Ring" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Ring", "tiobe": { "id": "Ring" }, "fileType": "text", "wordRank": 1517, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2020|Apress|Beginning Ring Programming: From Novice to Professional|Ayouni, Mansour|9781484258323\n2017|Independently published|The Lily and the Cross: A Ring and Crown Novel|de la Cruz, Melissa|9781973305514", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1968|Programming Techniques: ASP—a ring implemented associative structure package|10.1145/363567.363576|23|1|C. Lang and J. Gray|4aac001b7741dc79056c86e9aaa4a2e20841b68e\n1979|A concurrent computer architecture and a ring based implementation|10.1145/800090.802887|18|0|E. P. Farrell and N. Ghani and Philip C. Treieaven|e7264016181480b2b7998c0144ba6a3fa6e9c5c8\n2002|A fairness algorithm for high-speed networks based on a resilient packet ring architecture|10.1109/ICSMC.2002.1173424|12|1|S. Gjessing and A. Maus|8d161696f4d67072322de750cb62f0423b66190a\n2014|A Method of Parametric Design of Automobile Synchronizer Ring Based on UG Secondary Development Tools|10.4028/www.scientific.net/AMM.716-717.635|2|0|H. Cui and Na Tian and R. Li and Xiuhua Men|10158e3240736e06a7f86557b88a091125c04648\n2020|Automated and robust beam data validation of a preconfigured ring gantry linear accelerator using a 1D tank with synchronized beam delivery and couch motions|10.1002/acm2.12946|1|0|N. Knutson and Matthew C. Schmidt and F. Reynoso and Y. Hao and T. Mazur and E. Laugeman and Geoffrey D. Hugo and S. Mutic and H. Li and W. Ngwa and B. Cai and E. Sajo|5031e2a80bf90ede774a65ee8fb018ee2dc1e34c\n2021|Monitoring and Predicting Occupant’s Sleep Quality by Using Wearable Device OURA Ring and Smart Building Sensors Data (Living Laboratory Case Study)|10.3390/buildings11100459|1|0|Elena Malakhatka and Anas Al Al Rahis and Osman Osman and P. Lundqvist|164c0ee640f4e4e977905185cd4c693c1d12ab13" }, "rio": { "title": "rio", "appeared": 2017, "type": "pl", "reference": [ "https://web.archive.org/web/20180228184559/https://www.cs.ou.edu/~tjpalmer/" ], "country": [ "United States" ], "originCommunity": [ "University of Oklahoma" ], "githubRepo": { "firstCommit": 2017, "stars": 30, "subscribers": 6, "created": 2017, "updated": 2022, "description": "Goal: A script-feeling, safe, naturally compatible replacement for C, with no runtime nor std lib of its own.", "issues": 12, "forks": 0, "url": "https://github.com/tjpalmer/rio" }, "repoStats": { "firstCommit": 2017, "commits": 759, "committers": 3, "files": 129 } }, "ripple": { "title": "Ripple", "appeared": 2014, "type": "pl", "creators": [ "Yuya Watari" ], "description": "Ripple is a programming language which is well designed for numerical simulations.", "website": "https://github.com/Ripple-Lang/Ripple", "reference": [ "https://link.springer.com/chapter/10.1007/978-3-319-98809-2_9" ], "country": [ "Japan" ], "originCommunity": [ "Tokyo Institute of Technology" ], "example": [ "// Stage\n// - A target object of this simulation\nstage n as long; // the number of mice\n// Parameter\nparam c as int; // the number of mice which one mouse gives birth to\n// Initialization\ninit {\n n<0> = 2; // n<0> means the value of n when time is 0\n}\n// Operation\n// - Code which is executed every time (like recurrence formula)\noperation {\n n = n * c; // \"now\" and \"next\" are keywords in Ripple. next == now + 1.\n}" ], "githubRepo": { "stars": 2, "forks": 0, "subscribers": 2, "created": 2014, "updated": 2017, "description": "Programming Language \"Ripple\"", "url": "https://github.com/Ripple-Lang/Ripple" }, "repoStats": { "firstCommit": 2014, "commits": 20, "committers": 3, "files": 175 } }, "risc-v": { "title": "RISC-V", "appeared": 2010, "type": "isa", "aka": [ "riscv" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "linux", "verilog", "llvmir", "freebsd", "javascript", "assembly-language", "mips", "powerpc", "sparc", "x86-isa", "arm", "mmx" ], "summary": "RISC-V (pronounced \"risk-five\") is an open instruction set architecture (ISA) based on established reduced instruction set computing (RISC) principles. In contrast to most ISAs, the RISC-V ISA can be freely used for any purpose, permitting anyone to design, manufacture and sell RISC-V chips and software. While not the first open ISA, it is significant because it is designed to be useful in modern computerized devices such as warehouse-scale cloud computers, high-end mobile phones and the smallest embedded systems. Such uses demand that the designers consider both performance and power efficiency. The instruction set also has a substantial body of supporting software, which fixes a usual weakness of new instruction sets. The project began in 2010 at the University of California, Berkeley, but many contributors are volunteers and industry workers outside the university. The RISC-V ISA has been designed with small, fast, and low-power real-world implementations in mind, but without over-architecting for a particular microarchitecture style. As of May 2017, version 2.2 of the userspace ISA is fixed and the privileged ISA is available as draft version 1.10.", "pageId": 43653496, "dailyPageViews": 424, "created": 2014, "backlinksCount": 243, "revisionCount": 714, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/RISC-V" }, "leachim6": { "filepath": "r/RISC V.s", "example": [ ".data\nhello_world: .asciiz \"Hello World\"\n\n.text\nmain: la a1, hello_world\n li a0, 4\n ecall\n\n li a0, 10\n ecall" ], "id": "RISC V" }, "rijuRepl": { "example": [ "\t.text\n\t.global main\nmain:\n\taddi a7, x0, 64\n\taddi a0, x0, 1\n\tla a1, message\n\taddi a2, x0, 14\n\tecall\n\taddi a7, x0, 93\n\taddi a0, x0, 0\n\tecall\n\t.data\nmessage:\n\t.string \"Hello, world!\\n\"\n" ], "id": "https://riju.codes/riscv" }, "fileType": "na", "centralPackageRepositoryCount": 0, "isbndb": "" }, "rise": { "title": "rise", "appeared": 2020, "type": "pl", "description": "Rise is a functional pattern-based language in the style of Lift. Rise provides a set of data-parallel high-level patterns that are used to describe computations over higher dimensional arrays (aka tensors) in an abstract way. For example, the map pattern applies a given function to every element of the input array. The zip pattern combines two input arrays pairwise to produce an output array of pairs. The reduce pattern is customized with a binary reduction operator (such as addition), a matching neutral element (such as zero), and an input array that is reduced to a single value (such as the sum of all elements).", "reference": [ "https://michel.steuwer.info/files/publications/2020/accML.pdf" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Glasgow" ], "example": [ "fun(A : N.K.float => fun(B : K.M.float =>\n A |> map(fun(arow =>\n B |> map(fun(bcol =>\n zip(arow, bcol) |> map(*) |> reduce(+, 0) )) ))))" ], "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2007|The rise and fall of High Performance Fortran: an historical object lesson|10.1145/1238844.1238851|127|13|K. Kennedy and C. Koelbel and H. Zima|73bf064ce3156572ce7909c2a1553f1fc4d08e35\n2015|Perceptions of non-CS majors in intro programming: The rise of the conversational programmer|10.1109/VLHCC.2015.7357224|42|5|Parmit K. Chilana and C. Alcock and Shruti Dembla and Anson Ho and A. Hurst and Brett Armstrong and Philip J. Guo|7b03e7fb24102b8bdb440693db048f3dde29156a\n2006|Flow Diagrams: Rise and Fall of the First Software Engineering Notation|10.1007/11783183_17|21|1|S. Morris and O. Gotel|682940be02444ad4d3aa068779ad6c416b68318e\n2016|Jolie Community on the Rise|10.1109/SOCA.2016.16|12|0|Alexey Bandura and N. Kurilenko and M. Mazzara and V. Rivera and Larisa Safina and Alexander Tchitchigin|6f65dfa3f92c14e3a224e6a08cc1148729f68b47\n2015|A Cultural Diffusion Model for the Rise and Fall of Programming Languages|10.13110/humanbiology.87.3.0224|6|1|S. Valverde and R. Solé|e056673e911bcbedc1b1a8217bcfafe179669509\n2018|The Rise of U.S. Spanish-Language Radio|10.1080/00947679.2018.12059208|1|0|Andrew Paxman|e6e77d925695352bce5cd67c18001f09bec2fd8a" }, "rita": { "title": "Rita", "appeared": 2019, "type": "pl", "creators": [ "Šarūnas Navickas" ], "country": [ "Lithuania" ], "originCommunity": [ "https://github.com/zaibacu/rita-dsl/issues" ], "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2019, "stars": 60, "forks": 3, "subscribers": 4, "created": 2019, "updated": 2022, "description": "A Domain Specific Language (DSL) for building language patterns. These can be later compiled into spaCy patterns, pure regex, or any other format", "issues": 7, "url": "https://github.com/zaibacu/rita-dsl" }, "repoStats": { "firstCommit": 2019, "commits": 611, "committers": 9, "files": 78 }, "pygmentsHighlighter": { "filename": "rita.py", "fileExtensions": [ "rita" ], "id": "Rita" } }, "rlab": { "title": "RLaB", "appeared": 1998, "type": "pl", "reference": [ "https://dl.acm.org/doi/fullHtml/10.5555/326286.326292", "https://web.archive.org/web/19990428033158/https://www.eskimo.com/~ians/rlab.html" ], "country": [ "United States" ], "originCommunity": [ "https://sourceforge.net/p/rlab/bugs" ], "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "matlab", "linux" ], "summary": "Rlab is an interactive, interpreted numerical computation program and its core programming language, written by Ian Searle. Rlab (the language) is very high level and is intended to provide fast prototyping and program development, as well as easy data-visualization, and processing. Rlab was not designed as a clone of MATLAB. However, as Rlab (the program) is intended to provide a good experimental environment (or laboratory) in which to do matrix math, the programming language possesses similar operators and concepts and could be called MATLAB-like. Rlab borrows some of the best features of the MATLAB language but provides them through a different syntax that has been modified in order to be more expressive while reducing ambiguity. The variable scoping rules facilitate the creation of larger programs and re-usable program libraries. A heterogeneous associative array datatype has been added to allow users to create and operate on arbitrary data structures. The fundamental data type is the dense floating point matrix (either real or complex), though string and sparse numerical matrices (both real and complex) are also provided. Rlab 2.1 is no longer under active development. Binary versions are available for Linux and for Windows, and source code is available under the GPL. Rlab 2.2 has been released as a part of the project rlabplus by Marijan Koštrun.", "pageId": 593529, "created": 2004, "backlinksCount": 6, "revisionCount": 38, "dailyPageViews": 12, "url": "https://web.archive.org/web/20170310231827/https://en.wikipedia.org/wiki/Rlab" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:RLaB", "hopl": "https://hopl.info/showlanguage.prx?exp=5721", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nArticles on Free Mathematics Software, Including: Gnuplot, Gnu Octave, Scilab, Units (Software), Numpy, DC (Computer Program), Rlab, BC Programming Language, Perl Data Language, Gnu Linear Programming Kit, Root, Experix, Xnumbers, Snappea|2011|Hephaestus Books|17625508|4.00|1|0" }, "rlisp": { "title": "RLISP", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8ad8c22437ef1803e838ccd8eea4a5428726f2d1" ], "country": [ "Former USSR or Russia" ], "originCommunity": [ "Moscow State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4020", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1984|An antitranslator of the RLISP language|10.1145/1089389.1089393|1|0|A. Kryukov|8ad8c22437ef1803e838ccd8eea4a5428726f2d1" }, "rlmeta": { "title": "rlmeta", "appeared": 2018, "type": "grammarLanguage", "creators": [ "Rickard Lindberg" ], "website": "http://rickardlindberg.me/writing/rlmeta/", "country": [ "Sweden" ], "originCommunity": [ "https://github.com/rickardlindberg/rlmeta/issues" ] }, "rlox": { "title": "rlox", "appeared": 2004, "type": "pl", "website": "https://craftinginterpreters.com/", "country": [ "Italia" ], "originCommunity": [ "https://github.com/evacchi/crafting-interpreters/issues" ], "githubRepo": { "stars": 0, "forks": 0, "subscribers": 2, "created": 2020, "updated": 2022, "description": "Crafting Interpreters (clox)", "issues": 0, "url": "https://github.com/evacchi/crafting-interpreters/tree/main/rlox" } }, "rmarkdown": { "title": "RMarkdown", "appeared": 2014, "type": "textMarkup", "creators": [ "JJ Allaire" ], "website": "https://rmarkdown.rstudio.com/", "fileExtensions": [ "rmd" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/rstudio" ], "domainName": { "name": "rmarkdown.rstudio.com" }, "githubRepo": { "firstCommit": 2014, "stars": 2471, "forks": 933, "subscribers": 142, "created": 2014, "updated": 2022, "description": "Dynamic Documents for R", "issues": 207, "url": "https://github.com/rstudio/rmarkdown" }, "repoStats": { "firstCommit": 2014, "commits": 3920, "committers": 138, "files": 487 }, "githubLanguage": { "fileExtensions": [ "qmd", "rmd" ], "trendingProjectsCount": 0, "type": "prose", "aceMode": "markdown", "codemirrorMode": "gfm", "codemirrorMimeType": "text/x-gfm", "tmScope": "source.gfm", "wrap": true, "repos": 198, "id": "RMarkdown" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 58, "commitCount": 426, "sampleCount": 1, "example": [ "# An example RMarkdown\n\nSome text.\n\n## A graphic in R\n\n```{r}\nplot(1:10)\nhist(rnorm(10000))\n```" ], "url": "https://github.com/atom/language-gfm" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nBookdown: Authoring Books and Technical Documents with R Markdown||Yihui Xie|54265969|3.67|3|0\nbookdown: Authoring Books and Technical Documents with R Markdown (Chapman & Hall/CRC The R Series)||Yihui Xie|54727209|4.38|8|1", "semanticScholar": "" }, "robic": { "title": "Robic", "appeared": 1975, "type": "pl", "country": [ "Former USSR" ], "originCommunity": [ "USSR Ministry of Radio" ], "wikipedia": { "summary": "Robic (Russian: Робик) —a programming language created in the USSR for primary school education (8–11 years old children). The language was developed in 1975 and after changes was included in the Agat software system as \"schoolgirl\". The language uses syntax based on the Russian vocabulary. An interesting language feature is performer comprehension using, that is some object, that functions in some environment owned for each performer. It is possible to create and delete different types of performers. Each type of performer has its own command collection for main language command expansion.", "created": 2010, "backlinksCount": 6, "pageId": 29921130, "revisionCount": 16, "dailyPageViews": 3, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/Robic" }, "centralPackageRepositoryCount": 0 }, "robomind": { "title": "RoboMind", "appeared": 2005, "type": "pl", "website": "http://www.robomind.net", "country": [ "The Netherlands" ], "originCommunity": [ "University of Amsterdam", "Research Kitchen" ], "domainName": { "registered": 2005, "awisRank": { "2022": 4033597 }, "name": "robomind.net" }, "example": [ "paintWhite\nrepeat(4) {\n forward(2)\n right\n}" ], "wikipedia": { "example": [ "follow\n\nprocedure follow{\n if(frontIsWhite){\n forward(1)\t\t\n }\n else if(rightIsWhite){\n right\n }\n else if(leftIsWhite){\n left\n }\n else{\n end\n }\n follow\n}" ], "related": [ "java", "linux", "karel", "pascal", "logo", "javascript", "scratch", "microsoft-small-basic", "kodu-game-lab" ], "summary": "RoboMind is a simple educational programming environment with its own scripting language that allows beginners to learn the basics of computer science by programming a simulated robot. In addition to introducing common programming techniques, it also aims at offering insights in robotics and artificial intelligence. RoboMind is available as stand-alone application for Windows, Linux and Mac OS X. It was first released in 2005 and was originally developed by Arvid Halma, a student of the University of Amsterdam at that time. Since 2011 RoboMind is published by Research Kitchen.", "pageId": 10434801, "created": 2007, "backlinksCount": 12, "revisionCount": 57, "dailyPageViews": 17, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/RoboMind" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "robot-battle": { "title": "Robot Battle", "appeared": 1994, "type": "pl", "country": [ "United States" ], "originCommunity": [ "GarageGames LLC" ], "wikipedia": { "related": [ "c", "javascript" ], "summary": "Robot Battle is a programming game for Microsoft Windows where players design and code adaptable battling robots. Robot Battle takes strategy rather than reflexes, accuracy, or timing to succeed. What differentiates one robot from the next is its programming, for which the player is responsible. The game is inspired by the similar game RobotWar.", "created": 2004, "backlinksCount": 15, "pageId": 867311, "revisionCount": 85, "dailyPageViews": 13, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Robot_Battle" }, "centralPackageRepositoryCount": 0 }, "robotalk": { "title": "RoboTalk", "appeared": 1985, "type": "pl", "description": "Robotalk: A New Language To Control The Rhino Robot.", "reference": [ "https://era.library.ualberta.ca/items/0bcc754d-4053-4baf-aa16-dd2f0b124668", "https://www.researchgate.net/publication/295469881_ROBOTALK_A_NEW_LANGUAGE_TO_CONTROL_THE_RHINO_ROBOT" ], "country": [ "United States" ], "originCommunity": [ "Rhino Robotics Ltd" ], "centralPackageRepositoryCount": 0 }, "robotc": { "title": "robotc", "appeared": 2005, "type": "pl", "website": "http://www.robotc.net/", "country": [ "United States" ], "originCommunity": [ "Robomatter, Inc." ], "domainName": { "registered": 2007, "awisRank": { "2022": 3636087 }, "name": "robotc.net" }, "twitter": "https://twitter.com/robotc", "fileType": "text", "centralPackageRepositoryCount": 0 }, "robotframework": { "title": "RobotFramework", "appeared": 2013, "type": "pl", "website": "http://robotframework.org/", "documentation": [ "https://robotframework.org/robotframework/" ], "country": [ "Finland" ], "originCommunity": [ "Robot Framework ry" ], "domainName": { "registered": 2007, "awisRank": { "2022": 146514 }, "name": "robotframework.org" }, "githubRepo": { "stars": 7076, "forks": 1980, "subscribers": 473, "created": 2014, "updated": 2022, "description": "Generic automation framework for acceptance testing and RPA", "issues": 237, "firstCommit": 2013, "url": "https://github.com/robotframework/robotframework" }, "repoStats": { "firstCommit": 2013, "commits": 14154, "committers": 204, "files": 2336 }, "githubLanguage": { "fileExtensions": [ "robot" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "text.robot", "repos": 7602, "id": "RobotFramework" }, "githubBigQuery": { "repos": 515, "users": 447, "id": "RobotFramework" }, "pygmentsHighlighter": { "filename": "robotframework.py", "fileExtensions": [ "robot", "resource" ], "id": "RobotFramework" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2016, "committerCount": 7, "commitCount": 83, "sampleCount": 3, "example": [ "*** Settings ***\nDocumentation Example test case using the gherkin syntax.\n...\n... This test has a workflow similar to the keyword-driven\n... examples. The difference is that the keywords use higher\n... abstraction level and their arguments are embedded into\n... the keyword names.\n...\n... This kind of _gherkin_ syntax has been made popular by\n... [http://cukes.info|Cucumber]. It works well especially when\n... tests act as examples that need to be easily understood also\n... by the business people.\nLibrary CalculatorLibrary\n\n*** Test Cases ***\nAddition\n Given calculator has been cleared\n When user types \"1 + 1\"\n and user pushes equals\n Then result is \"2\"\n\n*** Keywords ***\nCalculator has been cleared\n Push button C\n\nUser types \"${expression}\"\n Push buttons ${expression}\n\nUser pushes equals\n Push button =\n\nResult is \"${result}\"\n Result should be ${result}\n" ], "url": "https://github.com/shellderp/sublime-robot-plugin" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "robots.txt": { "title": "Robots.txt", "appeared": 1994, "type": "configFormat", "creators": [ "Martijn Koster" ], "description": "A robots.txt file tells search engine crawlers which URLs the crawler can access on your site.", "reference": [ "https://developers.google.com/search/docs/advanced/robots/intro", "https://en.wikipedia.org/wiki/Robots_exclusion_standard" ], "country": [ "United Kingdom" ], "originCommunity": [ "https://web.archive.org/web/20131029200350/http://inkdroid.org/tmp/www-talk/4113.html" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "lineCommentToken": [ [ "#" ] ], "example": [ "User-agent: googlebot # all Google services\nDisallow: /private/ # disallow this directory\n\nUser-agent: googlebot-news # only the news service\nDisallow: / # disallow everything\n\nUser-agent: * # any robot\nDisallow: /something/ # disallow this directory" ] }, "roc": { "title": "Roc", "appeared": 2020, "type": "pl", "creators": [ "Richard Feldman" ], "website": "https://www.roc-lang.org/", "country": [ "United States" ], "originCommunity": [ "https://github.com/roc-lang" ], "githubRepo": { "stars": 1588, "forks": 90, "subscribers": 128, "created": 2019, "updated": 2023, "description": "Roc is a language for making delightful software.", "issues": 764, "url": "https://github.com/roc-lang/roc" }, "repoStats": { "firstCommit": 2019, "commits": 25815, "committers": 199, "files": 2238 } }, "rocket": { "title": "rocket", "appeared": 2018, "type": "pl", "country": [ "United States" ], "originCommunity": [ "https://github.com/camullen/Rocket/issues" ], "githubRepo": { "firstCommit": 2018, "stars": 8, "subscribers": 3, "created": 2018, "updated": 2019, "description": "Programming language for implementing business logic and state management", "forks": 0, "issues": 0, "url": "https://github.com/camullen/Rocket" }, "repoStats": { "firstCommit": 2018, "commits": 10, "committers": 1, "files": 4 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17703452|Show HN: Rocket – a language that lets you focus on your business logic|2018-08-07 02:18:21 UTC|1533608301|cmullen|1|7" }, "rockstar-rkt": { "title": "rockstar-rkt", "appeared": 2019, "type": "pl", "description": "Implementation of Rockstar in Racket.", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/whichxjy/rockstar-rkt/issues" ], "related": [ "rockstar" ], "githubRepo": { "firstCommit": 2019, "stars": 3, "created": 2019, "updated": 2019, "description": "Racket-imple­mented Rockstar 🤘", "forks": 0, "subscribers": 2, "issues": 0, "url": "https://github.com/whichxjy/rockstar-rkt" }, "repoStats": { "firstCommit": 2019, "commits": 91, "committers": 1, "files": 13 } }, "rockstar": { "title": "Rockstar", "appeared": 2018, "type": "esolang", "creators": [ "Dylan Beattie" ], "description": "Rockstar is a dynamically typed Turing-complete programming language. Rockstar is designed for creating computer programs that are also song lyrics, and is heavily influenced by the lyrical conventions of 1980s hard rock and power ballads.", "website": "https://codewithrockstar.com/", "country": [ "United Kingdom" ], "originCommunity": [ "https://github.com/RockstarLang" ], "domainName": { "registered": 2018, "awisRank": { "2022": 2809374 }, "name": "codewithrockstar.com" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "Scream" ] ], "stringToken": [ [ "\"" ] ], "example": [ "Midnight takes your heart and your soul\nWhile your heart is as high as your soul\nPut your heart without your soul into your heart\n\nGive back your heart\n\n\nDesire is a lovestruck ladykiller\nMy world is nothing \nFire is ice\nHate is water\nUntil my world is Desire,\nBuild my world up\nIf Midnight taking my world, Fire is nothing and Midnight taking my world, Hate is nothing\nShout \"FizzBuzz!\"\nTake it to the top\n\nIf Midnight taking my world, Fire is nothing\nShout \"Fizz!\"\nTake it to the top\n\nIf Midnight taking my world, Hate is nothing\nSay \"Buzz!\"\nTake it to the top\n\nWhisper my world " ], "githubRepo": { "firstCommit": 2018, "stars": 63, "forks": 2, "subscribers": 2, "created": 2021, "updated": 2022, "description": "The Rockstar programming language specification", "issues": 0, "url": "https://github.com/dylanbeattie/rockstar" }, "repoStats": { "firstCommit": 2018, "commits": 471, "committers": 54, "files": 237 }, "leachim6": { "filepath": "r/Rockstar.rock", "fileExtensions": [ "rock" ], "example": [ "Scream \"Hello World\"\n" ], "id": "Rockstar" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Rockstar", "tryItOnline": "rockstar", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "rocky-mountain-basic": { "title": "Rocky Mountain BASIC", "appeared": 1988, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Hewlett-Packard Company" ], "wikipedia": { "related": [ "basic", "assembly-language", "pascal", "hp-time-shared-basic" ], "summary": "Rocky Mountain BASIC (also RMB or RM-BASIC) is a dialect of the BASIC programming language created by Hewlett-Packard. It was especially popular for control of automatic test equipment using GPIB. It has several features which are or were unusual in BASIC dialects, such as event-driven operation, extensive external I/O support, complex number support, and matrix manipulation functions. Today, RMB is mainly used in environments where an investment in RMB software, hardware, or expertise already exists.", "created": 2005, "backlinksCount": 96, "pageId": 3112895, "revisionCount": 63, "dailyPageViews": 17, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/Rocky_Mountain_BASIC" }, "centralPackageRepositoryCount": 0 }, "roff": { "title": "ROFF", "appeared": 1971, "type": "textMarkup", "creators": [ "Joe Ossanna", "Ken Thompson" ], "country": [ "United States" ], "originCommunity": [ "AT&T Bell Laboratories" ], "related": [ "troff" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Roff_(software)" }, "githubLanguage": { "fileExtensions": [ "roff", "1", "1in", "1m", "1x", "2", "3", "3in", "3m", "3p", "3pm", "3qt", "3x", "4", "5", "6", "7", "8", "9", "l", "man", "mdoc", "me", "ms", "n", "nr", "rno", "tmac" ], "trendingProjectsCount": 0, "type": "markup", "filenames": [ "eqnrc", "mmn", "mmt", "troffrc", "troffrc-end" ], "aceMode": "text", "codemirrorMode": "troff", "codemirrorMimeType": "text/troff", "tmScope": "text.roff", "wrap": true, "aliases": [ "groff", "man", "manpage", "man page", "man-page", "mdoc", "nroff", "troff" ], "repos": 36672, "id": "Roff" }, "githubBigQuery": { "repos": 12001, "users": 10595, "id": "Roff" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 3, "commitCount": 351, "sampleCount": 8, "example": [ ".TH FOO 1\n.SH NAME\nfoo \\- bar\n.SH SYNOPSIS\n.B foo\n.I bar\n.SH DESCRIPTION\nFoo bar\n.BR baz\nquux.\n.PP\n.B Foo\nbar baz.\n" ], "url": "https://github.com/Alhadis/language-roff" }, "rijuRepl": { "example": [ ".PP\nHello, world!\n" ], "id": "https://riju.codes/roff" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2453", "fileType": "text", "centralPackageRepositoryCount": 0 }, "roku-brightscript": { "title": "Brightscript", "appeared": 2010, "type": "pl", "reference": [ "https://medium.com/float-left-insights/what-makes-roku-brightscript-a-powerful-scripting-language-5f46532f496d" ], "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "'" ] ], "githubLanguage": { "fileExtensions": [ "brs" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.brs", "repos": 832, "id": "Brightscript" }, "githubBigQuery": { "repos": 98, "users": 86, "id": "Brightscript" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2015, "committerCount": 3, "commitCount": 26, "sampleCount": 1, "example": [ "' *********************************************************\n' ** Simple Grid Screen Demonstration App\n' ** Jun 2010\n' ** Copyright (c) 2010 Roku Inc. All Rights Reserved.\n' *********************************************************\n\n'************************************************************\n'** Application startup\n'************************************************************\nSub Main()\n\n 'initialize theme attributes like titles, logos and overhang color\n initTheme()\n \n gridstyle = \"Flat-Movie\"\n\n 'set to go, time to get started\n while gridstyle <> \"\"\n print \"starting grid style= \";gridstyle\n screen=preShowGridScreen(gridstyle)\n gridstyle = showGridScreen(screen, gridstyle)\n end while\n\nEnd Sub\n\n\n'*************************************************************\n'** Set the configurable theme attributes for the application\n'** \n'** Configure the custom overhang and Logo attributes\n'** These attributes affect the branding of the application\n'** and are artwork, colors and offsets specific to the app\n'*************************************************************\n\nSub initTheme()\n app = CreateObject(\"roAppManager\")\n app.SetTheme(CreateDefaultTheme())\nEnd Sub\n\n'******************************************************\n'** @return The default application theme.\n'** Screens can make slight adjustments to the default\n'** theme by getting it from here and then overriding\n'** individual theme attributes.\n'******************************************************\nFunction CreateDefaultTheme() as Object\n theme = CreateObject(\"roAssociativeArray\")\n\n theme.ThemeType = \"generic-dark\"\n\n ' All these are greyscales\n theme.GridScreenBackgroundColor = \"#363636\"\n theme.GridScreenMessageColor = \"#808080\"\n theme.GridScreenRetrievingColor = \"#CCCCCC\"\n theme.GridScreenListNameColor = \"#FFFFFF\"\n\n ' Color values work here\n theme.GridScreenDescriptionTitleColor = \"#001090\"\n theme.GridScreenDescriptionDateColor = \"" ], "url": "https://github.com/cmink/BrightScript.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "rol": { "title": "ROL", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ed8f7e90e7d438d4b48e5f42c1f769b4fd3f3b18" ], "country": [ "Canada" ], "originCommunity": [ "University of Regina" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7140", "centralPackageRepositoryCount": 0 }, "rol2": { "title": "ROL2", "appeared": 1999, "type": "pl", "reference": [ "https://semanticscholar.org/paper/da45c8cdce3436038b8afc7246404391c64abe8a" ], "country": [ "Canada" ], "originCommunity": [ "University of Regina" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7141", "centralPackageRepositoryCount": 0 }, "roman-abacus-machine": { "title": "Roman abacus", "appeared": -2700, "type": "computingMachine", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Roman_abacus" } }, "roman-numerals": { "title": "Roman numerals", "appeared": -900, "type": "numeralSystem", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Roman_numerals" } }, "ron": { "title": "Ron", "appeared": 2015, "type": "dataNotation", "creators": [ "Juniper Tyree" ], "description": "RON is a simple readable data serialization format that looks similar to Rust syntax. It's designed to support all of Serde's data model, so structs, enums, tuples, arrays, generic maps, and primitive values.", "standsFor": "Rusty Object Notation", "country": [ "Finland" ], "originCommunity": [ "https://github.com/ron-rs" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "GameConfig( // optional struct name\n window_size: (800, 600),\n window_title: \"PAC-MAN\",\n fullscreen: false,\n \n mouse_sensitivity: 1.4,\n key_bindings: {\n \"up\": Up,\n \"down\": Down,\n \"left\": Left,\n \"right\": Right,\n \n // Uncomment to enable WASD controls\n /*\n \"W\": Up,\n \"A\": Down,\n \"S\": Left,\n \"D\": Right,\n */\n },\n \n difficulty_options: (\n start_difficulty: Easy,\n adaptive: false,\n ),\n)" ], "githubRepo": { "firstCommit": 2015, "stars": 2045, "forks": 98, "subscribers": 27, "created": 2015, "updated": 2022, "description": "Rusty Object Notation", "issues": 26, "url": "https://github.com/ron-rs/ron" }, "repoStats": { "firstCommit": 2015, "commits": 515, "committers": 66, "files": 87 }, "isbndb": "" }, "roop": { "title": "ROOP", "appeared": 1995, "type": "pl", "country": [ "China" ], "originCommunity": [ "Chengdu University" ], "visualParadigm": false, "wikipedia": { "summary": "ROOP is a multiparadigm programming language targeted at AI applications created at the Chengdu University of China. It combines rule-based, procedural, logical and object-oriented programming techniques.", "pageId": 931356, "created": 2004, "backlinksCount": 7, "revisionCount": 29, "dailyPageViews": 6, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/ROOP_(programming_language)" }, "tryItOnline": "roop", "fileType": "text", "centralPackageRepositoryCount": 0 }, "root-format": { "title": "root-format", "appeared": 1994, "type": "binaryDataFormat", "description": "ROOT provides a file format that is a machine-independent compressed binary format, including both the data and its description, and provides an open-source automated tool to generate the data description (or \"dictionary\") when saving data, and to generate C++ classes corresponding to this description when reading back the data.", "website": "https://root.cern.ch/input-and-output", "country": [ "Switzerland" ], "originCommunity": [ "Conseil Européen pour la Recherche Nucléaire" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/ROOT" } }, "root-lib": { "title": "ROOT", "appeared": 1994, "type": "library", "description": "A modular scientific software toolkit. It provides all the functionalities needed to deal with big data processing, statistical analysis, visualisation and storage. It is mainly written in C++ but integrated with other languages such as Python and R.", "website": "https://root.cern.ch/", "country": [ "Switzerland" ], "originCommunity": [ "Conseil européen pour la recherche nucléaire or CERN" ], "domainName": { "name": "root.cern.ch" }, "writtenIn": [ "cpp" ], "example": [ "#include \"Riostream.h\"\nvoid basic() {\n// read file $ROOTSYS/tutorials/tree/basic.dat\n// this file has 3 columns of float data\n TString dir = gROOT->GetTutorialDir();\n dir.Append(\"/tree/\");\n dir.ReplaceAll(\"/./\",\"/\");\n ifstream in;\n in.open(Form(\"%sbasic.dat\",dir.Data()));\n Float_t x,y,z;\n Int_t nlines = 0;\n auto f = TFile::Open(\"basic.root\",\"RECREATE\");\n TH1F h1(\"h1\",\"x distribution\",100,-4,4);\n TNtuple ntuple(\"ntuple\",\"data from ascii file\",\"x:y:z\");\n while (1) {\n in >> x >> y >> z;\n if (!in.good()) break;\n if (nlines < 5) printf(\"x=%8f, y=%8f, z=%8f\\n\",x,y,z);\n h1.Fill(x);\n ntuple.Fill(x,y,z);\n nlines++;\n }\n printf(\" found %d points\\n\",nlines);\n in.close();\n f->Write();\n}" ], "wikipedia": { "related": [ "linux", "solaris", "ia-32", "postscript", "svg", "latex", "python", "matlab", "matplotlib", "scipy", "numpy", "perl-data-language", "perl", "r", "igor-pro" ], "summary": "ROOT is an object-oriented program and library developed by CERN. It was originally designed for particle physics data analysis and contains several features specific to this field, but it is also used in other applications such as astronomy and data mining. Release 6.14.04 as of 2018-08-23", "pageId": 1048909, "created": 2004, "backlinksCount": 63, "revisionCount": 407, "dailyPageViews": 67, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/ROOT" }, "jupyterKernel": [ "https://github.com/root-mirror/root/tree/master/bindings/pyroot/JupyROOT" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "ros-msg": { "title": "ROS Message", "appeared": 2010, "type": "idl", "description": "The format of this language is simple: a message description is a list of data field descriptions and constant definitions on separate lines.", "reference": [ "http://wiki.ros.org/msg" ], "fileExtensions": [ "msg" ], "country": [ "United States and Canada and Australia" ], "originCommunity": [ "https://github.com/ros-infrastructure" ], "example": [ "int32 x\nint32 y" ] }, "roscoe": { "title": "ROSCOE", "appeared": 1979, "type": "pl", "reference": [ "https://openlibrary.org/books/OL14165919M/ROSCOE_programming_language_(RPF)_handbook." ], "standsFor": "Remote OS Conversational Operating Environment", "country": [ "United States" ], "originCommunity": [ "Applied Data Research, Inc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2378", "centralPackageRepositoryCount": 0 }, "rosetta-2": { "title": "Rosetta-2", "appeared": 2006, "type": "pl", "documentation": [ "https://iboysoft.com/wiki/rosetta-2.html" ], "reference": [ "https://dougallj.wordpress.com/2022/11/09/why-is-rosetta-2-fast/" ], "country": [ "United State" ], "originCommunity": [ "Apple Inc" ], "example": [ " https://dougallj.files.wordpress.com/2022/11/fupg8ipuuaehi0a-1.jpg" ], "wikipedia": { "summary": "Rosetta is a dynamic binary translator developed by Apple Inc. for macOS, an application compatibility layer between different instruction set architectures. It enables a transition to newer hardware, by automatically translating software. The name is a reference to the Rosetta Stone, the artifact which enabled translation of Egyptian hieroglyphs. The first version of Rosetta, introduced in 2006 in Mac OS X Tiger, was part of the Mac transition from PowerPC processors to Intel processors, allowing PowerPC applications to run on Intel-based Macs. The second version, introduced in 2020 as a component of macOS Big Sur, is part of the Mac transition from Intel processors to Apple silicon, allowing Intel applications to run on Apple silicon Macs.", "url": "https://en.wikipedia.org/wiki/Rosetta_(software)" }, "centralPackageRepositoryCount": 0 }, "rosetta-smalltalk": { "title": "Rosetta SMALLTALK", "appeared": 1979, "type": "pl", "creators": [ "Scott Warren" ], "reference": [ "https://semanticscholar.org/paper/266262bd1e882fc5aa4207cdbea493aa2eda3af6", "https://archive.org/details/RosettaBrochure/RosettaBrochure/mode/1up" ], "country": [ "United States" ], "originCommunity": [ "Rosetta" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7599", "centralPackageRepositoryCount": 0 }, "rosette-lang": { "title": "rosette-lang", "appeared": 2013, "type": "pl", "creators": [ "Emina Torlak", "Rastislav Bodik" ], "description": "Rosette is a solver-aided programming language that extends Racket with language constructs for program synthesis, verification, and more. To verify or synthesize code, Rosette compiles it to logical constraints solved with off-the-shelf SMT solvers. By combining virtualized access to solvers with Racket’s metaprogramming, Rosette makes it easy to develop synthesis and verification tools for new languages.", "website": "https://emina.github.io/rosette/", "reference": [ "https://homes.cs.washington.edu/~emina/pubs/rosette.onward13.pdf" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "#lang rosette\n\n(define (interpret formula)\n (match formula\n [`(∧ ,expr ...) (apply && (map interpret expr))]\n [`(∨ ,expr ...) (apply || (map interpret expr))]\n [`(¬ ,expr) (! (interpret expr))]\n [lit (constant lit boolean?)]))\n\n; This implements a SAT solver.\n(define (SAT formula)\n (solve (assert (interpret formula))))\n\n(SAT `(∧ r o (∨ s e (¬ t)) t (¬ e)))" ] }, "rosette": { "title": "Rosette", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ba979088994e5e3f6a4e9162490bef793a565024" ], "country": [ "United States" ], "originCommunity": [ "Microelectronics and Computer Technology Corporation or MCC" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6310", "centralPackageRepositoryCount": 0 }, "rosie": { "title": "rosie", "appeared": 2015, "type": "queryLanguage", "description": "RPL is a variant of modern Regular Expressions (regex) that is designed to scale to big data, many developers, and large collections of patterns. If you use regex, you already know a lot of RPL.", "website": "https://rosie-lang.org", "country": [ "United States" ], "originCommunity": [ "https://gitlab.com/rosie-pattern-language" ], "domainName": { "registered": 2016, "name": "rosie-lang.org" }, "example": [ "rosie --rpl 'd = [:digit:]' -o json match d" ], "gitlabRepo": "https://gitlab.com/rosie-pattern-language/rosie", "repoStats": { "firstCommit": 2016, "commits": 3871, "committers": 21, "files": 386 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "roslyn-compiler": { "title": "Roslyn compiler", "appeared": 2009, "type": "compiler", "website": "https://docs.microsoft.com/dotnet/csharp/roslyn-sdk/", "country": [ "United States" ], "originCommunity": [ "https://github.com/dotnet" ], "githubRepo": { "firstCommit": 2014, "stars": 16084, "forks": 3636, "subscribers": 1031, "created": 2015, "updated": 2022, "description": "The Roslyn .NET compiler provides C# and Visual Basic languages with rich code analysis APIs.", "issues": 9185, "url": "https://github.com/dotnet/roslyn" }, "wikipedia": { "summary": ".NET Compiler Platform, also known by its nickname Roslyn, is a set of open-source compilers and code analysis APIs for C# and Visual Basic .NET languages from Microsoft.The project notably includes self-hosting versions of the C# and VB.NET compilers – compilers written in the languages themselves. The compilers are available via the traditional command-line programs but also as APIs available natively from within .NET code. Roslyn exposes modules for syntactic (lexical) analysis of code, semantic analysis, dynamic compilation to CIL, and code emission.", "backlinksCount": 13, "pageId": 33644243, "dailyPageViews": -1, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Roslyn_(compiler)" } }, "rouge": { "title": "Rouge", "appeared": 2012, "type": "pl", "creators": [ "Arlen Cuss" ], "country": [ "Australia" ], "originCommunity": [ "https://web.archive.org/web/20120730121447/http://len.me" ], "githubRepo": { "firstCommit": 2012, "stars": 9, "forks": 18, "subscribers": 2, "created": 2012, "updated": 2021, "description": "Ruby + Clojure = Rouge", "issues": 0, "url": "https://github.com/vic/rouge" }, "repoStats": { "firstCommit": 2012, "commits": 173, "committers": 2, "files": 40 }, "githubLanguage": { "fileExtensions": [ "rg" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "clojure", "codemirrorMode": "clojure", "codemirrorMimeType": "text/x-clojure", "tmScope": "source.clojure", "repos": 78, "id": "Rouge" }, "githubBigQuery": { "repos": 12, "users": 11, "id": "Rouge" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 36, "commitCount": 149, "url": "https://github.com/atom/language-clojure" }, "fileType": "text", "wordRank": 8822, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "roy": { "title": "roy", "appeared": 2011, "type": "pl", "creators": [ "Brian McKenna" ], "website": "http://roy.brianmckenna.org/", "country": [ "Australia" ], "originCommunity": [ "https://github.com/puffnfresh/roy/issues" ], "domainName": { "name": "roy.brianmckenna.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "console.log" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2011, "stars": 830, "forks": 74, "subscribers": 47, "created": 2011, "updated": 2022, "description": "Small functional language that compiles to JavaScript.", "issues": 64, "url": "https://github.com/puffnfresh/roy" }, "repoStats": { "firstCommit": 2011, "commits": 569, "committers": 39, "files": 128 }, "leachim6": { "filepath": "r/Roy.roy", "fileExtensions": [ "roy" ], "example": [ "console.log \"Hello World\"\n" ], "id": "Roy" }, "replit": "https://repl.it/languages/roy", "twitter": "https://twitter.com/roylangjs", "fileType": "text", "wordRank": 5386, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2001|Springer|Aiding Decisions with Multiple Criteria: Essays in Honor of Bernard Roy (International Series in Operations Research & Management Science, 44)|Bouyssou, Denis and Jacquet-Lagrèze, Eric and Perny, Patrice and Slowiński, Roman and Vanderpooten, Daniel and Vincke, P.|9780792376118" }, "royalscript": { "title": "RoyalScript", "appeared": 2016, "type": "pl", "creators": [ "Josh Weinstein" ], "website": "https://jweinst1.github.io/Royalscript/", "country": [ "United States" ], "githubRepo": { "stars": 4, "forks": 2, "subscribers": 2, "created": 2016, "updated": 2017, "description": "A functional programming language that's Royal.", "url": "https://github.com/jweinst1/Royalscript" }, "repoStats": { "firstCommit": 2016, "commits": 269, "committers": 4, "files": 22 } }, "rpg-ii": { "title": "RPG II", "appeared": 1965, "type": "pl", "country": [ "United States" ], "originCommunity": [ "International Business Machines Corporation" ], "related": [ "ibm-rpg" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/IBM_RPG" }, "hopl": "https://hopl.info/showlanguage.prx?exp=238", "isbndb": "", "semanticScholar": "" }, "rpg-iii": { "title": "RPG III", "appeared": 1968, "type": "pl", "country": [ "United States" ], "originCommunity": [ "International Business Machines Corporation" ], "related": [ "ibm-rpg" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/IBM_RPG" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2455", "semanticScholar": "" }, "rpl-lang": { "title": "Reactive Plan Language", "appeared": 1993, "type": "pl", "description": "RPL (Reactive Plan Language) belongs to the family of notations for writing reactive plans for agents (e.g., robots) (Davis 1984, Ingrand and George 1990, Lyons 1990a,b, Gat 1991). Its immediate ancestor is Firby's (1987, 1989) RAP notation. Many of Firby's concepts have been carried over, but there are some differences", "reference": [ "https://www.researchgate.net/publication/2648978_A_Reactive_Plan_Language" ], "aka": [ "rpl" ], "country": [ "United States" ], "originCommunity": [ "Yale University" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "(DEF-INTERP-PROC LOOK-FOR (PL)\n (LOOK-FOR-PROPS PL)\n (WAIT-FOR VISUAL-INPUT*)\n (SEEN-OB-DESIGS PL) )\n\n ; Returns a list of desigs (Section 1.7), one for every object seen.\n (DEFFUNC SEEN-OB-DESIGS - (LST desig) (PL - (LST (LRCD symbol obj)))\n (FOR (I IN OB-POSITIONS*)\n (SAVE (CREATE-DESIG \"Perceived object\"\n ;Desig wil l print like: !:|Perceived object203|\n (CONS (LIST 'LOC I)\n (<# ( (X) (LIST (CAR X) (CADR X)))\n PL))\n ;Design property list\n ))))" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "rpl": { "title": "RPL", "appeared": 1984, "type": "pl", "standsFor": "Reverse Polish Lisp", "originCommunity": [ "Hewlett-Packard" ], "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "« \n 0 @ Start with zero on the stack\n 1 10 @ Loop from 1 to 10\n FOR I @ \"I\" is the local variable\n I + @ Add \"I\" to the running total\n NEXT @ Repeat...\n»" ], "related": [ "forth", "lisp", "assembly-language" ], "summary": "RPL (derived from Reverse Polish Lisp according to its original developers, whilst for a short while in 1987 HP marketing attempted to coin the backronym ROM-based Procedural Language for it) is a handheld calculator operating system and application programming language used on Hewlett-Packard's scientific graphing RPN (Reverse Polish Notation) calculators of the HP 28, 48, 49 and 50 series, but it is also usable on non-RPN calculators, such as the 38, 39 and 40 series. RPL is a structured programming language based on RPN, but equally capable of processing algebraic expressions and formulae, implemented as a threaded interpreter. RPL has many similarities to Forth, both languages being stack-based, as well as the list-based LISP. Contrary to previous HP RPN calculators, which had a fixed four-level stack, the stack used by RPL is only limited by available calculator RAM. RPL originated from HP's Corvallis, Oregon development facility in 1984 as a replacement for the previous practice of implementing the operating systems of calculators in assembly language. The last calculator supporting RPL, the HP 50g, was discontinued in 2015.", "pageId": 512681, "dailyPageViews": 52, "created": 2004, "backlinksCount": 57, "revisionCount": 164, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/RPL_(programming_language)" }, "projectEuler": { "memberCount": { "2019": 11, "2022": 11 }, "id": "RPL" }, "helloWorldCollection": [ "Hello World in RPL for the HP-28, HP-48, HP-49 and HP-50 series pocket calculators. No comments possible.\n\n<<\n \"HELLO WORLD\"\n 1 DISP\n 60 FREEZE\n>>\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:RPL", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAn Introduction to Hp48 System Rpl & Assembly Language Programming|1995|James Donnelly|20605176|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2010||Rpl (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130924690\n1995|Armstrong Pub Co|An Introduction To Hp48 System Rpl And Assembly Language Programming|James Donnelly|9781879828063" }, "rpm-package-manager": { "title": "Rpm", "appeared": 1997, "type": "packageManager", "website": "http://www.rpm.org", "country": [ "United States" ], "originCommunity": [ "Red Hat, Inc" ], "domainName": { "registered": 1996, "awisRank": { "2022": 714471 }, "name": "rpm.org" }, "wikipedia": { "related": [ "c", "perl", "linux", "fat", "gzip" ], "summary": "RPM Package Manager (RPM) (originally Red Hat Package Manager; now a recursive acronym) is a package management system. The name RPM refers to the following: the .rpm file format, files in the .rpm file format, software packaged in such files, and the package manager program itself. RPM was intended primarily for Linux distributions; the file format is the baseline package format of the Linux Standard Base. Even though it was created for use in Red Hat Linux, RPM is now used in many Linux distributions. It has also been ported to some other operating systems, such as Novell NetWare (as of version 6.5 SP3), IBM's AIX (as of version 4), CentOS, Fedora (operating system) created jointly between Red Hat and the Fedora community, and Oracle Linux. All versions or variants of the these Linux operating systems use the RPM Package Manager. An RPM package can contain an arbitrary set of files. The larger part of RPM files encountered are “binary RPMs” (or BRPMs) containing the compiled version of some software. There are also “source RPMs” (or SRPMs) files containing the source code used to produce a package. These have an appropriate tag in the file header that distinguishes them from normal (B)RPMs, causing them to be extracted to /usr/src on installation. SRPMs customarily carry the file extension “.src.rpm” (.spm on file systems limited to 3 extension characters, e.g. old DOS FAT).", "pageId": 21772272, "dailyPageViews": 391, "created": 2002, "backlinksCount": 35, "revisionCount": 847, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Rpm_(software)" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "rpm-spec": { "title": "RPM Spec", "appeared": 1997, "type": "application", "reference": [ "https://rpm-packaging-guide.github.io/#working-with-spec-files" ], "country": [ "United States" ], "originCommunity": [ "Red Hat, Inc" ], "githubLanguage": { "fileExtensions": [ "spec" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "codemirrorMode": "rpm", "codemirrorMimeType": "text/x-rpm-spec", "tmScope": "source.rpm-spec", "aliases": [ "specfile" ], "id": "RPM Spec" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 6, "commitCount": 72, "sampleCount": 3, "example": [ "#\n# spec file for package manos\n#\n# Copyright (c) 2010 Jackson Harper (jackson@novell.com)\n#\n#\n\nName: manos-devel\nVersion: 0.1.1\nRelease: 1\nLicense: MIT/X11\nBuildRoot: %{_tmppath}/manos-%{version}-build\nBuildRequires: mono-devel >= 2.6\nBuildRequires: mono-nunit >= 2.6\nSource0: manos-%{version}.tar.bz2\nSource1: rpmlintrc\nSummary: The Manos Web Application Framework\nGroup: Development/Web/Servers\nBuildArch: noarch\n\n%description\nManos is an easy to use, easy to test, high performance web application framework that stays out of your way and makes your life ridiculously simple.\n\n%files\n%defattr(-, root, root)\n%{_prefix}/lib/manos\n%{_bindir}/manos\n%{_datadir}/manos\n%{_prefix}/lib/pkgconfig/manos.pc\n%{_datadir}/man/man1/manos.1.gz\n\n%prep\n%setup -q -n manos-%{version}\n\n\n%build\n./configure --prefix=%{buildroot}%{_prefix} --install-prefix=%{_prefix}\nmake\n\n%install\nmake install\n\n%clean\nrm -rf %{buildroot}\n\n%changelog" ], "url": "https://github.com/waveclaw/language-rpm-spec" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "rpp": { "title": "R++", "appeared": 1990, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Bell Labs" ], "wikipedia": { "summary": "R++ is a rule-based programming language based on C++. The United States patent describes R++ as follows: The R++ extension permits rules to be defined as members of C++ classes. The programming system of the invention takes the classes with rules defined using R++ and generates C++ code from them in which the machinery required for the rules is implemented completely as C++ data members and functions of the classes involved in the rules. R++ was developed by Bell Labs in the 1990s, but due to the Bell System divestiture that split the legal rights to the work developed at the Laboratories between AT&T and Lucent, did not see immediate commercial development while the two companies disputed ownership.", "created": 2006, "backlinksCount": 12, "pageId": 8387439, "revisionCount": 32, "dailyPageViews": 20, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/R%2B%2B" }, "centralPackageRepositoryCount": 0 }, "rpscript": { "title": "rpscript", "appeared": 2018, "type": "pl", "website": "http://www.rpscript.com", "domainName": { "registered": 2021, "name": "rpscript.com" }, "githubRepo": { "firstCommit": 2018, "stars": 12, "subscribers": 2, "created": 2018, "updated": 2022, "description": "A scripting language for process automation", "issues": 3, "forks": 1, "url": "https://github.com/TYPECASTINGSG/rpscript" }, "repoStats": { "firstCommit": 2018, "commits": 83, "committers": 1, "files": 28 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17787802|Show HN: RPScript – Scripting language for process automation|2018-08-18 10:14:05 UTC|1534587245|wei3hua2|2|3", "twitter": "https://twitter.com/wei3hua2" }, "rpython": { "title": "Restricted Python", "appeared": 2007, "type": "pl", "description": "RPython is a restricted subset of Python that is amenable to static analysis. RPython is a proper subset of Python, is statically typed, and does not allow dynamic modification of class or method definitions; however, it can still take advantage of Python features such as mixins and first-class methods and classes.", "website": "https://rpython.readthedocs.io/en/latest/rpython.html", "reference": [ "https://dl.acm.org/citation.cfm?id=1297091" ], "country": [ "Estonia and United States" ], "originCommunity": [ "https://foss.heptapod.net/pypy/pypy/-/issues" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "rql": { "title": "RQL", "appeared": 2017, "type": "pl", "website": "https://web.archive.org/web/20220310181429/https://www.logilab.org/project/rql", "reference": [ "https://readthedocs.org/projects/rql", "https://rql.readthedocs.io/en/latest", "https://github.com/logilab" ], "country": [ "France" ], "originCommunity": [ "logilab.fr" ], "hasIntegers": { "example": "", "value": true }, "gitRepo": "https://forge.extranet.logilab.fr/cubicweb/RQL", "pygmentsHighlighter": { "filename": "sql.py", "fileExtensions": [ "rql" ], "id": "RQL" }, "semanticScholar": "" }, "rsharp": { "title": "rsharp", "appeared": 2003, "type": "pl", "creators": [ "Nenad Rakocevic" ], "description": "R# is a free programming language based on REBOL.", "website": "https://sourceforge.net/projects/r-sharp/", "country": [ "Montenegro" ], "originCommunity": [ "https://sourceforge.net/p/r-sharp/bugs" ], "semanticScholar": "" }, "rsl": { "title": "RAISE Specification Language", "appeared": 1992, "type": "pl", "reference": [ "https://link.springer.com/chapter/10.1007/978-3-540-74107-7_7" ], "standsFor": "Rigorous Approach to Industrial Software Engineering Specification Language", "country": [ "Macao and Denmark" ], "originCommunity": [ "United Nations University and Technical University of Denmark" ], "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "rsl" ], "id": "RSL" }, "centralPackageRepositoryCount": 0 }, "rss": { "title": "RSS", "appeared": 1999, "type": "protocol", "creators": [ "Dan Libby", "Ramanathan V. Guha" ], "standsFor": "Really Simple Syndication", "aka": [ "RDF Site Summary" ], "country": [ "Various" ], "originCommunity": [ "https://www.rssboard.org" ], "example": [ "\n\n\n \n https://pldb.com/\n PLDB: a Programming Language Database. Build the next great programming language.\n Wed, 22 Feb 2023 13:36:44 +0000\n en-us\n \n A brief interview with Tcl creator John Ousterhout\n https://pldb.com/posts/JohnOusterhout.html\n Wed, 08 Feb 2023 00:00:00 +0000\n \n \n Data entry Livestream\n https://pldb.com/posts/addingDataLivestream.html\n Wed, 08 Feb 2023 00:00:00 +0000\n \n\n" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/RSS" } }, "rstudio-editor": { "title": "RStudio", "appeared": 2011, "type": "editor", "website": "https://www.rstudio.com", "country": [ "United States" ], "originCommunity": [ "RStudio, Inc" ], "domainName": { "registered": 1998, "awisRank": { "2022": 8748 }, "name": "rstudio.com" }, "wikipedia": { "related": [ "java", "javascript", "ia-32", "r", "cfml", "linux", "qt", "knitr" ], "summary": "RStudio is a free and open-source integrated development environment (IDE) for R, a programming language for statistical computing and graphics. RStudio was founded by JJ Allaire, creator of the programming language ColdFusion. Hadley Wickham is the Chief Scientist at RStudio.RStudio is available in two editions: RStudio Desktop, where the program is run locally as a regular desktop application; and RStudio Server, which allows accessing RStudio using a web browser while it is running on a remote Linux server. Prepackaged distributions of RStudio Desktop are available for Windows, macOS, and Linux. RStudio is available in open source and commercial editions and runs on the desktop (Windows, macOS, and Linux) or in a browser connected to RStudio Server or RStudio Server Pro (Debian, Ubuntu, Red Hat Linux, CentOS, openSUSE and SLES).RStudio is partly written in the C++ programming language and uses the Qt framework for its graphical user interface. The bigger percentage of the code is written in Java, JavaScript is also amongst the languages used.Work on RStudio started around December 2010, and the first public beta version (v0.92) was officially announced in February 2011. Version 1.0 was released on 1 November 2016. Version 1.1 was released on 9 October 2017. In April 2018 it was announced RStudio will be providing operational and infrastructure support for Ursa Labs. Ursa Labs will focus on building a new data science runtime powered by Apache Arrow.", "pageId": 36691501, "created": 2012, "backlinksCount": 212, "revisionCount": 128, "dailyPageViews": 407, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/RStudio" }, "twitter": "https://twitter.com/rstudio", "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "rt-aslan": { "title": "RT-ASLAN", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f2e48d9e8637b879ffbaa8286f325ad670b54b43" ], "country": [ "United States" ], "originCommunity": [ "University of California, Santa Barbara" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7841", "centralPackageRepositoryCount": 0 }, "rt-cdl": { "title": "RT-CDL", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e0c5498adafdf30c7eeb6bbfb155ea6905ab03c4" ], "country": [ "United States and India" ], "originCommunity": [ "IBM Corporation and Tata Institute of Fundamental Research" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1520", "centralPackageRepositoryCount": 0 }, "rt-z": { "title": "RT-Z", "appeared": 1999, "type": "pl", "reference": [ "https://semanticscholar.org/paper/fc72ec7e7451bc3ebf46f1eb85a7b4a8a71bcf78" ], "country": [ "Germany" ], "originCommunity": [ "https://web.archive.org/web/20160601150532/https://www.first.fraunhofer.de/kontakt" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8161", "centralPackageRepositoryCount": 0 }, "rtf": { "title": "RTF", "appeared": 1987, "type": "textMarkup", "creators": [ "Richard Brodie", "Charles Simonyi", "David Luebbert" ], "standsFor": "Rich Text Format", "country": [ "United States" ], "originCommunity": [ "Microsoft Corporation" ], "example": [ "{\\rtf1\\ansi{\\fonttbl\\f0\\fswiss Helvetica;}\\f0\\pard\nThis is some {\\b bold} text.\\par\n}" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Rich_Text_Format" }, "githubLanguage": { "type": "markup", "fileExtensions": [ "rtf" ], "aceMode": "text", "tmScope": "text.rtf", "repos": 9429, "id": "Rich Text Format" }, "githubBigQuery": { "repos": 966, "users": 924, "id": "Rich Text Format" } }, "rtl-2": { "title": "RTL/2", "appeared": 1972, "type": "pl", "creators": [ "John Barnes" ], "country": [ "United Kingdom" ], "originCommunity": [ "Imperial Chemical Industries plc" ], "wikipedia": { "example": [ "RTL/2 Ref 1 - Language Specification\nRTL/2 Ref 2 - Introduction to RTL/2\nRTL/2 Ref 3 - RTL/2 Training Manual\nRTL/2 Ref 4 - System Standards\nRTL/2 Ref 5 - Stream I/O\nRTL/2 Ref 18 - Hints on writing RTL/2 Programs\nRTL/2 Ref 26 - Language Reference Card\nRTL/2 Ref 39 - Run time environment on the PDP-11\nRTL/2 Ref 63 - User Manual for the PDP-11 under RSX-11M\nRTL/2 Ref 107- VAX/VMS RTL/2 User Manual\nRTL/2 REF 130- The RTL/2 32 bit run time environment on the VAX" ], "summary": "RTL/2 was a high-level programming language developed at Imperial Chemical Industries Ltd by J.G.P. Barnes. It was originally used internally within ICI but was distributed by SPL International in 1974 It was designed for use in real-time computing (hence the initials RTL = real-time language). Based on concepts from Algol 68, it was intended to be a small, simple language. RTL/2 was standardised in 1980 by the British Standards Institution.RTL/2 was a strongly typed language with separate compilation. The compilation units contained one or more items known as \"bricks\", i.e.: procedure bricks, data bricks, stack bricks.A procedure brick was a procedure, which may or may not return a (scalar) value, have (scalar) parameters, or have local (scalar) variables. The entry mechanism and implementation of local variables was re-entrant. Non-scalar data could only be accessed via reference (so-called REF variables were considered scalar). A data brick was a named static collection of scalars, arrays and records. Programmers had to implement memory management themselves (there was no heap or garbage collection). A stack brick was an area of storage reserved for running all the procedures of a single process and contained the call stack, local variables and other housekeeping items. The extent to which stack bricks were actually used varied depending upon the host environment in which RTL/2 programs actually ran. Access to the host environment of an RTL/2 program was provided via special procedure and data bricks called SVC procedures and SVC data. These were accessible in RTL/2 but implemented in some other language in the host environment.", "created": 2010, "backlinksCount": 7, "pageId": 28045268, "revisionCount": 20, "dailyPageViews": 5, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/RTL/2" }, "hopl": "https://hopl.info/showlanguage.prx?exp=596", "centralPackageRepositoryCount": 0 }, "rtp-protocol": { "title": "Real-time Transport Protocol", "appeared": 1996, "type": "protocol", "country": [ "United States" ], "originCommunity": [ "Audio-Video Transport Working Group of the Internet Engineering Task Force" ], "wikipedia": { "summary": "The Real-time Transport Protocol (RTP) is a network protocol for delivering audio and video over IP networks. RTP is used in communication and entertainment systems that involve streaming media, such as telephony, video teleconference applications including WebRTC, television services and web-based push-to-talk features. RTP typically runs over User Datagram Protocol (UDP). RTP is used in conjunction with the RTP Control Protocol (RTCP). While RTP carries the media streams (e.g., audio and video), RTCP is used to monitor transmission statistics and quality of service (QoS) and aids synchronization of multiple streams. RTP is one of the technical foundations of Voice over IP and in this context is often used in conjunction with a signaling protocol such as the Session Initiation Protocol (SIP) which establishes connections across the network. RTP was developed by the Audio-Video Transport Working Group of the Internet Engineering Task Force (IETF) and first published in 1996 as RFC 1889, superseded by RFC 3550 in 2003.", "backlinksCount": 672, "pageId": 26163, "dailyPageViews": 661, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Real-time_Transport_Protocol" } }, "ru": { "title": "ru", "appeared": 2015, "type": "pl", "website": "http://ru-lang.org", "country": [ "Australia" ], "originCommunity": [ "https://github.com/jcouyang/ru/issues" ], "domainName": { "registered": 2021, "name": "ru-lang.org" }, "githubRepo": { "stars": 34, "forks": 3, "subscribers": 4, "created": 2015, "updated": 2019, "description": "clojurize javascript", "issues": 1, "url": "https://github.com/jcouyang/ru" }, "repoStats": { "firstCommit": 2015, "commits": 87, "committers": 2, "files": 37 }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9749286|Show HN: 入(rù-lang) – Clojurized JavaScript|http://ru-lang.org/|2015-06-20 07:28:32 UTC|1434785312|oyanglulu|8|51", "isbndb": "" }, "ruby-document-format": { "title": "Ruby Document format", "appeared": 1995, "type": "textMarkup", "country": [ "Various" ], "originCommunity": [ "https://ml.ruby-lang.org/mailman3/hyperkitty/list/ruby-talk@ml.ruby-lang.org" ], "wikipedia": { "example": [ "here.is_a?(Piece::Of::Code)\nprint <<\"END\"\nThis indented block will not be scanned for formatting\ncodes or directives, and spacing will be preserved.\nEND" ], "related": [ "ruby", "rdoc", "pod" ], "summary": "RD (Ruby Document) is a lightweight markup language for writing Ruby-related documents. It can be embedded in Ruby source code. RD is a traditional format. In modern Ruby, developers tend to write documents in RDoc instead of RD.", "pageId": 2111570, "created": 2005, "backlinksCount": 66, "revisionCount": 58, "dailyPageViews": 6, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Ruby_Document_format" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "ruby-mine-editor": { "title": "ruby-mine-editor", "appeared": 2008, "type": "editor", "website": "https://www.jetbrains.com/ruby/", "country": [ "Czech Republic" ], "originCommunity": [ "JetBrains s.r.o." ], "fileType": "na", "centralPackageRepositoryCount": 0 }, "ruby": { "title": "Ruby", "appeared": 1995, "type": "pl", "creators": [ "Yukihiro Matsumoto" ], "website": "https://www.ruby-lang.org", "documentation": [ "https://www.ruby-lang.org/en/documentation/" ], "emailList": [ "https://www.ruby-lang.org/en/community/mailing-lists/" ], "spec": "https://www.iso.org/standard/59579.html", "reference": [ "https://stackoverflow.com/questions/9446150/where-are-keywords-defined-in-ruby" ], "fileExtensions": [ "rb" ], "country": [ "Japan" ], "originCommunity": [ "https://ml.ruby-lang.org/mailman3/hyperkitty/list/ruby-talk@ml.ruby-lang.org/" ], "releaseNotesUrl": "https://www.ruby-lang.org/en/downloads/releases/", "proposals": "https://bugs.ruby-lang.org/projects/ruby-master/wiki/FeatureProposals", "visualParadigm": false, "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasEnums": { "example": "", "value": false }, "hasDependentTypes": { "example": "", "value": false }, "hasDisposeBlocks": { "example": "", "value": false }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasRegularExpressionsSyntaxSugar": { "example": "puts \"Hello World\".match(/\\w/)", "value": true }, "hasDuckTyping": { "example": "", "value": true }, "hasIntegers": { "example": "pldb = 80766866", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasAssignment": { "example": "pldb = 80766866", "value": true }, "hasExceptions": { "example": "def hello\n puts \"Hello, World!\"\n # start an exception handler\n begin\n raise \"This is an exception\"\n rescue => e\n puts \"Exception caught: #{e}\"\n end\n end\nhello", "value": true }, "hasFunctionOverloading": { "example": "", "value": false }, "hasAsyncAwait": { "example": "", "value": false }, "hasConstants": { "example": "# Constants in Ruby being with a capital letter. Will throw a warning or error, depending on runtime settings.\nName = \"John\" \n# Not a constant\nname = \"John\"", "value": true }, "hasClasses": { "example": "# A tiny Person class in Ruby:\nclass Person\n attr_accessor :name, :age, : # getter and setter methods\n def initialize(name, age)\n @name = name\n @age = age\n end\nend\n\n# Create a new Person object:\nperson = Person.new(\"John\", 30)\nputs person.name\nputs person.age\n\n# Change the age of the person:\nperson.age = 35\nputs person.age", "value": true }, "hasComments": { "example": "# This is a single line comment.", "value": true }, "hasMultiLineComments": { "example": "=begin\nA comment.\n=end", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasGenerators": { "example": "# Generator from an Enumerator object\nchars = Enumerator.new(['A', 'B', 'C', 'Z'])\n\n4.times { puts chars.next }\n\n# Generator from a block\ncount = Enumerator.new do |yielder|\n i = 0\n loop { yielder.yield i += 1 }\nend\n\n100.times { puts count.next }", "value": true }, "hasHereDocs": { "example": "", "value": true }, "hasDirectives": { "example": "coding: UTF-8", "value": true }, "hasImports": { "example": "load 'filename.rb'\nrequire 'filename'\nrequire 'trig.rb'", "value": true }, "hasIterators": { "example": "(0...42).each do |n|\n puts n\nend", "value": true }, "hasMixins": { "example": "module A\n def a1\n end\n def a2\n end\nend\nmodule B\n def b1\n end\n def b2\n end\nend\nclass Sample\ninclude A\ninclude B\n def s1\n end\nend\nsamp = Sample.new\nsamp.a1\nsamp.a2\nsamp.b1", "value": true }, "hasMultilineStrings": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasPrintDebugging": { "example": "puts \"Hi\"", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasRangeOperators": { "example": "(3...6)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "isCaseSensitive": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "multiLineCommentTokens": [ [ "=begin", "=end" ] ], "printToken": [ [ "puts" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "__ENCODING__", "__FILE__", "__LINE__", "alias", "and", "BEGIN", "begin", "break", "case", "class", "def", "defined", "do", "else", "elsif", "END", "end", "ensure", "false", "for", "if", "in", "module", "next", "nil", "not", "or", "redo", "rescue", "retry", "return", "self", "super", "then", "true", "undef", "unless", "until", "when", "while", "yield" ], "gource": "https://www.youtube.com/watch?v=-_y4y1o6YQY", "githubRepo": { "stars": 20194, "forks": 5296, "subscribers": 1140, "created": 2010, "updated": 2023, "description": "The Ruby Programming Language", "issues": 374, "url": "https://github.com/ruby/ruby" }, "repoStats": { "firstCommit": 1998, "commits": 94582, "committers": 815, "files": 10265 }, "wikipedia": { "example": [ "\"Hello, World!\".in_blue\n => \"Hello, World!\"" ], "related": [ "rails", "c", "yarv", "jruby", "ada", "clu", "dylan", "eiffel", "lisp", "lua", "perl", "python", "smalltalk", "clojure", "coffeescript", "crystal", "d", "elixir", "falcon", "groovy", "ioke", "julia", "mirah", "nu", "rust", "swift", "unicode", "regex", "yaml", "json", "xml", "java", "csharp", "jvm", "llvmir", "javascript", "objective-c", "parrot-vm", "linux", "solaris" ], "summary": "Ruby is a dynamic, reflective, object-oriented, general-purpose programming language. It was designed and developed in the mid-1990s by Yukihiro \"Matz\" Matsumoto in Japan. According to its creator, Ruby was influenced by Perl, Smalltalk, Eiffel, Ada, and Lisp. It supports multiple programming paradigms, including functional, object-oriented, and imperative. It also has a dynamic type system and automatic memory management.", "pageId": 25768, "dailyPageViews": 1731, "created": 2001, "backlinksCount": 3048, "revisionCount": 2618, "appeared": 2007, "fileExtensions": [ "rb" ], "url": "https://en.wikipedia.org/wiki/Ruby_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "rb", "builder", "eye", "fcgi", "gemspec", "god", "jbuilder", "mspec", "pluginspec", "podspec", "prawn", "rabl", "rake", "rbi", "rbuild", "rbw", "rbx", "ru", "ruby", "spec", "thor", "watchr" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nthepracticaldev dev.to https://github.com/thepracticaldev.png https://github.com/thepracticaldev/dev.to Ruby #701516 10232 1313 360 \"Where programmers share ideas and help each other grow\"\nrails rails https://github.com/rails.png https://github.com/rails/rails Ruby #701516 44018 17771 334 \"Ruby on Rails\"\nfaker-ruby faker https://github.com/faker-ruby.png https://github.com/faker-ruby/faker Ruby #701516 8005 2100 122 \"A library for generating fake data such as names, addresses, and phone numbers.\"\njekyll jekyll https://github.com/jekyll.png https://github.com/jekyll/jekyll Ruby #701516 38586 8424 318 \"🌐 Jekyll is a blog-aware static site generator in Ruby\"\nrapid7 metasploit-framework https://github.com/rapid7.png https://github.com/rapid7/metasploit-framework Ruby #701516 17501 8594 283 \"Metasploit Framework\"\nShopify liquid https://github.com/Shopify.png https://github.com/Shopify/liquid Ruby #701516 7357 957 91 \"Liquid markup language. Safe, customer facing template language for flexible web apps.\"\ntootsuite mastodon https://github.com/tootsuite.png https://github.com/tootsuite/mastodon Ruby #701516 18765 3265 424 \"Your self-hosted, globally interconnected microblogging community\"\nlynndylanhurley devise_token_auth https://github.com/lynndylanhurley.png https://github.com/lynndylanhurley/devise_token_auth Ruby #701516 2818 879 30 \"Token based authentication for Rails JSON APIs. Designed to work with jToker and ng-token-auth.\"\nHomebrew homebrew-core https://github.com/Homebrew.png https://github.com/Homebrew/homebrew-core Ruby #701516 6353 6781 198 \"🍻 Default formulae for the missing package manager for macOS\"\nplataformatec devise https://github.com/plataformatec.png https://github.com/plataformatec/devise Ruby #701516 20171 4823 118 \"Flexible authentication solution for Rails with Warden.\"\ngithub explore https://github.com/github.png https://github.com/github/explore Ruby #701516 1303 4960 74 \"Community-curated topic and collection pages on GitHub\"\nfastlane fastlane https://github.com/fastlane.png https://github.com/fastlane/fastlane Ruby #701516 26631 4084 396 \"🚀 The easiest way to automate building and releasing your iOS and Android apps\"\norbitalindex awesome-space https://github.com/orbitalindex.png https://github.com/orbitalindex/awesome-space Ruby #701516 637 32 423 \"🛰️🚀A list of awesome space-related packages and resources maintained by The Orbital Index\"\ndiscourse discourse https://github.com/discourse.png https://github.com/discourse/discourse Ruby #701516 28975 6539 249 \"A platform for community discussion. Free, open, simple.\"\nrest-client rest-client https://github.com/rest-client.png https://github.com/rest-client/rest-client Ruby #701516 4728 877 58 \"Simple HTTP and REST client for Ruby, inspired by microframework syntax for specifying actions.\"\nhuginn huginn https://github.com/huginn.png https://github.com/huginn/huginn Ruby #701516 22091 2380 253 \"Create agents that monitor and act on your behalf. Your agents are standing by!\"\nelastic logstash https://github.com/elastic.png https://github.com/elastic/logstash Ruby #701516 10512 2837 126 \"Logstash - transport and process your logs, events, or other data\"\nmperham sidekiq https://github.com/mperham.png https://github.com/mperham/sidekiq Ruby #701516 9802 1694 71 \"Simple, efficient background processing for Ruby\"\nsolidusio solidus https://github.com/solidusio.png https://github.com/solidusio/solidus Ruby #701516 2706 798 77 \"Solidus, Rails eCommerce System\"\nHomebrew brew https://github.com/Homebrew.png https://github.com/Homebrew/brew Ruby #701516 18868 4230 352 \"🍺 The missing package manager for macOS (or Linux)\"\neducation classroom https://github.com/education.png https://github.com/education/classroom Ruby #701516 1116 384 38 \"GitHub Classroom automates repository creation and access control, making it easy for teachers to distribute starter code and collect assignments on GitHub.\"\nthoughtbot factory_bot https://github.com/thoughtbot.png https://github.com/thoughtbot/factory_bot Ruby #701516 6596 1878 54 \"A library for setting up Ruby objects as test data.\"\nCocoaPods CocoaPods https://github.com/CocoaPods.png https://github.com/CocoaPods/CocoaPods Ruby #701516 11889 2130 89 \"The Cocoa Dependency Manager.\"\nruby ruby https://github.com/ruby.png https://github.com/ruby/ruby Ruby #701516 16129 4314 138 \"The Ruby Programming Language [mirror]\"\nsinatra sinatra https://github.com/sinatra.png https://github.com/sinatra/sinatra Ruby #701516 10680 1923 60 \"Classy web-development dressed in a DSL (official / canonical repo)\"", "trendingProjectsCount": 26, "type": "programming", "filenames": [ ".irbrc", ".pryrc", ".simplecov", "Appraisals", "Berksfile", "Brewfile", "Buildfile", "Capfile", "Dangerfile", "Deliverfile", "Fastfile", "Gemfile", "Guardfile", "Jarfile", "Mavenfile", "Podfile", "Puppetfile", "Rakefile", "Snapfile", "Steepfile", "Thorfile", "Vagrantfile", "buildfile" ], "interpreters": [ "ruby", "macruby", "rake", "jruby", "rbx" ], "aceMode": "ruby", "codemirrorMode": "ruby", "codemirrorMimeType": "text/x-ruby", "tmScope": "source.ruby", "aliases": [ "jruby", "macruby", "rake", "rb", "rbx" ], "repos": 2659551, "id": "Ruby" }, "githubBigQuery": { "repos": 374367, "users": 185514, "id": "Ruby" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/ruby", "monaco": "ruby", "codeMirror": "ruby", "pygmentsHighlighter": { "filename": "ruby.py", "fileExtensions": [ "rb", "rbw", "Rakefile", "rake", "gemspec", "rbx", "duby", "Gemfile", "Vagrantfile" ], "id": "Ruby" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 76, "commitCount": 458, "sampleCount": 20, "example": [ "module Foo\nend\n" ], "url": "https://github.com/atom/language-ruby" }, "languageServerProtocolProject": [ "https://github.com/castwide/solargraph\nwrittenIn ruby", "https://github.com/mtsmfm/language_server-ruby\nwrittenIn ruby", "https://github.com/swistak35/orbacle\nwrittenIn ruby", "https://github.com/kwerle/ruby_language_server\nwrittenIn ruby" ], "projectEuler": { "memberCount": { "2019": 5407, "2022": 5435 }, "id": "Ruby" }, "helloWorldCollection": [ "# Hello World in Ruby\nputs \"Hello World!\"\n" ], "leachim6": { "filepath": "r/Ruby.rb", "fileExtensions": [ "rb" ], "example": [ "#!/usr/bin/env ruby\nprint \"Hello World\"\n" ], "id": "Ruby" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Ruby", "quineRelay": "Ruby", "compilerExplorer": { "example": [ "# Type your code here, or load an example.\ndef square(num)\n num * num\nend" ], "id": "Ruby" }, "rijuRepl": { "example": [ "puts \"Hello, world!\"\n" ], "id": "https://riju.codes/ruby" }, "replit": "https://repl.it/languages/ruby", "tryItOnline": "ruby", "indeedJobs": { "2017": 8719, "query": "ruby engineer" }, "linkedInSkill": { "2018": 271878, "id": "ruby" }, "stackOverflowSurvey": { "2021": { "users": 5569, "medianSalary": 80000, "fans": 4942, "percentageUsing": 0.07 } }, "officialBlogUrl": [ "https://www.ruby-lang.org/en/community/weblogs/" ], "faqPageUrl": [ "https://www.ruby-lang.org/en/documentation/faq/" ], "downloadPageUrl": [ "https://www.ruby-lang.org/en/downloads/" ], "subreddit": [ { "memberCount": { "2017": 36676, "2022": 75926 }, "url": "https://reddit.com/r/ruby" } ], "meetup": { "memberCount": 705060, "groupCount": 932, "url": "https://www.meetup.com/topics/ruby" }, "conference": [ "https://rubyconf.org RubyConf" ], "tiobe": { "currentRank": 13, "id": "Ruby" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2458", "pypl": "Ruby", "packageRepository": [ "https://rubygems.org/" ], "ubuntuPackage": "ruby", "jupyterKernel": [ "https://github.com/SciRuby/iruby" ], "fileType": "text", "wordRank": 5813, "githubCopilotOptimized": true, "isbndb": "year|publisher|title|authors|isbn13\n2013|O'Reilly Media|Computer Science Programming Basics in Ruby: Exploring Concepts and Curriculum with Ruby|Frieder, Ophir and Frieder, Gideon and Grossman, David|9781449355975\n2008|O'Reilly Media|The Ruby Programming Language: Everything You Need to Know|Flanagan, David and Matsumoto, Yukihiro|9780596516178\n2010|Cengage Learning|Ruby Programming (Introduction to Programming)|Ford, Jr. Jerry Lee|9781111222376\n2009|Pragmatic Bookshelf|Programming Ruby 1.9: The Pragmatic Programmers' Guide (Facets of Ruby)|Thomas, Dave and Fowler, Chad and Hunt, Andy|9781934356081\n2013|No Starch Press|Ruby Under a Microscope: An Illustrated Guide to Ruby Internals|Shaughnessy, Pat|9781593275273\n2006|Pragmatic Bookshelf|Enterprise Integration with Ruby|Schmidt, Maik|9780976694069\n2007|Apress|Practical Ruby Projects: Ideas for the Eclectic Programmer (Books for Professionals by Professionals)|Cyll, Christopher|9781590599112\n2006|Wrox|Beginning Ruby on Rails|Holzner, Steve|9780470069158\n2002|Syngress|Ruby Developers Guide|Syngress and Feldt, Robert and Johnson, Lyle and Ortiz, Jonothon|9781928994640\n2007|For Dummies|Ruby on Rails For Dummies|Burd, Barry|9780470081204\n2002|Sams Publishing|Sams Teach Yourself Ruby in 21 Days|Slagell, Mark|9780672322525\n2002|John Wiley & Sons|Making Use of Ruby w/WS|Mahadevan, Suresh|9780471219729\n2007|SitePoint|Build Your Own Ruby on Rails Web Applications|Lenz, Patrick|9780975841952\n2009|AddisonWesley Professional|Distributed Programming with Ruby|Bates, Mark|9780321638366\n2010|Pragmatic Bookshelf|Metaprogramming Ruby: Program Like the Ruby Pros|Paolo Perrotta|9781934356470\n20150424|Pearson Technology Group|Ruby on Rails Tutorial|Michael Hartl|9780134077789\n2012|Addison-Wesley Professional|Practical Object-Oriented Design in Ruby: An Agile Primer (Addison-Wesley Professional Ruby Series)|Metz, Sandi|9780132930888\n2008|Addison-Wesley Professional|Ruby Phrasebook|Clinton, Jason D|9780672328978\n2011|Addison-Wesley Professional|Ruby on Rails 3 Tutorial: Learn Rails by Example (Livelessons)|Hartl, Michael|9780132492546\n2011|O'Reilly Media|MacRuby: The Definitive Guide: Ruby and Cocoa on OS X|Aimonetti, Matt|9781449380373\n2014|Apress|Ruby Quick Syntax Reference|Clements, Matt|9781430265696\n2007|No Starch Press|Ruby by Example: Concepts and Code|Baird, Kevin C.|9781593271602\n2009|Wrox|Ruby on Rails for Microsoft Developers|Cangiano, Antonio|9780470374955\n2020|Apress|Beginning Ruby 3: From Beginner to Pro|DiLeo, Carleton|9781484263235\n20170111|Springer Nature|Beginning Ruby|Peter Cooper|9781430223641\n20070501|Springer Nature|Beginning Ruby|Kenneth Cooper|9781430203643\n2017|Independently published|Ruby For Beginners: Your Guide To Easily Learn Ruby Programming in 7 days|Academy, iCode|9781521367704\n20071015|Springer Nature|Practical Ruby for System Administration|Andre Ben-Hamou|9781430201946\n2008|Emereo Pty Ltd|Using Ruby On Rails For Web Development, Introduction Guide To Ruby On Rails: An Extensive Roundup Of 100 Ultimate Resources|Jacob White|9781921573125\n2021|Packt Publishing|Polished Ruby Programming: Build better software with more intuitive, maintainable, scalable, and high-performance Ruby code|Evans, Jeremy|9781801072724\n2007|Addison-Wesley Professional|Design Patterns in Ruby (Addison-Wesley Professional Ruby Series)|Olsen, Russ|9780132702508\n2018|Addison-Wesley Professional|Practical Object-Oriented Design: An Agile Primer Using Ruby|Metz, Sandi|9780134456478\n2007|Addison-Wesley Professional|Design Patterns in Ruby|Olsen, Russ|9780321490452\n2020|Addison-Wesley Professional|Ruby on Rails Tutorial|Michael, Hartl|9780136702696\n2015|O'Reilly Media|Ruby Cookbook: Recipes for Object-Oriented Scripting|Carlson, Lucas and Richardson, Leonard|9781449373719\n2011|Addison-Wesley Professional|Eloquent Ruby (Addison-Wesley Professional Ruby Series)|Olsen, Russ|9780321584106\n2007|Apress|Pro Active Record: Databases with Ruby and Rails (Expert's Voice)|Pytel, Chad and Yurek, Jonathan and Marshall, Kevin|9781590598474\n2010|Addison-Wesley Professional|Rails AntiPatterns: Best Practice Ruby on Rails Refactoring (Addison-Wesley Professional Ruby Series)|Pytel, Chad and Saleh, Tammer|9780132660068\n2013|Pragmatic Bookshelf|Programming Ruby 1.9 & 2.0: The Pragmatic Programmers' Guide (The Facets of Ruby)|Thomas, Dave and Hunt, Andy and Fowler, Chad|9781937785499\n2016-05-10T00:00:01Z|Codemy.com|Intro To Ruby Programming: Beginners Guide Series|Elder, John|9780692714416\n2015-03-02T00:00:01Z|Addison-Wesley Professional|Ruby Way, The: Solutions and Techniques in Ruby Programming (Addison-Wesley Professional Ruby Series)|Fulton, Hal and Arko, André|9780321714633\n2014|Pragmatic Bookshelf|Metaprogramming Ruby 2: Program Like the Ruby Pros (Facets of Ruby)|Perrotta, Paolo|9781941222126\n2014|No Starch Press|Ruby Wizardry: An Introduction to Programming for Kids|Weinstein, Eric|9781593275662\n2014|Addison-Wesley Professional|Effective Ruby: 48 Specific Ways to Write Better Ruby (Effective Software Development Series)|Jones, Peter J.|9780133847062\n2015|Addison-Wesley Professional|Ruby Way, The: Solutions and Techniques in Ruby Programming (Addison-Wesley Professional Ruby Series)|Fulton, Hal and Arko, André|9780132480376\n2016|Addison-Wesley Professional|Ruby on Rails Tutorial: Learn Web Development with Rails (Addison-Wesley Professional Ruby Series)|Hartl, Michael|9780134597508\n2010|Cengage Learning|Ruby Programming (Introduction to Programming)|Ford Jr., Jerry Lee|9781133172567\n2014|Addison-Wesley Professional|Learn Ruby the Hard Way: A Simple and Idiomatic Introduction to the Imaginative World Of Computational Thinking with Code (Zed Shaw's Hard Way Series)|Shaw, Zed A.|9780133135633\n2016|CreateSpace Independent Publishing Platform|Ruby: Learn Ruby in 24 Hours or Less - A Beginner’s Guide To Learning Ruby Programming Now (Ruby, Ruby Programming, Ruby Course)|Dwight, Robert|9781533191618\n2021|ND Publishing|Ruby Beginner's Crash Course: Beginner's Guide to Ruby Programming, Ruby On Rails & Rails Programming|Start Guides, Quick|9781777942809\n2009|Manning Publications|The Well-Grounded Rubyist: Covers Ruby 1.9.1|David A. Black|9781933988658\n2020|Apress|Learn Rails 6: Accelerated Web Development with Ruby on Rails|Notodikromo, Adam|9781484260258\n2018-02-04T00:00:01Z|CreateSpace Independent Publishing Platform|Ruby Programming: Basics to Advanced Concepts|Andahi, Alban|9781984935014\n2007|No Starch Press|Ruby by Example: Concepts and Code|Baird, Kevin C.|9781593271480\n2010|Addison-Wesley Professional|Ruby on Rails 3 Tutorial: Learn Rails by Example (Addison-Wesley Professional Ruby Series)|Hartl, Michael|9780132564199\n2019|Packt Publishing|The Ruby Workshop: Develop powerful applications by writing clean, expressive code with Ruby and Ruby on Rails|Paul, Akshat and Philips, Peter and Szabó, Dániel and Wallace, Cheyne|9781838648879\n2006|O'Reilly Media|Ruby Cookbook (Cookbooks (O'Reilly))|Carlson, Lucas and Richardson, Leonard|9780596523695\n2001|O'Reilly Media|Ruby In A Nutshell|Yukihiro Matsumoto|9780596002145\n2018|Apress|Learn Rails 5.2: Accelerated Web Development with Ruby on Rails|Wintermeyer, Stefan|9781484234891\n2015-10-21T00:00:01Z|CreateSpace Independent Publishing Platform|RUBY Beginner's Crash Course: Ruby for Beginner's Guide to Ruby Programming, Ruby On Rails & Rails Programming (Ruby, Operating Systems, Programming) (Volume 1)|Guides, Quick Start|9781518721649\n2009|Addison-Wesley Professional|Distributed Programming with Ruby (Addison-Wesley Professional Ruby Series)|Bates, Mark|9780321699930\n2009|O'Reilly Media|Head First Rails: A Learner's Companion to Ruby on Rails|Griffiths, David|9780596515775\n2009|O'Reilly Media|Ruby Best Practices: Increase Your Productivity - Write Better Code|Brown, Gregory T|9780596523008\n2006|Addison-Wesley Professional|The Ruby Way, Second Edition: Solutions and Techniques in Ruby Programming (2nd Edition)|Fulton, Hal|9780672328848\n2006|Manning Publications|Ruby for Rails: Ruby Techniques for Rails Developers|David Black|9781932394696", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|BioRuby: bioinformatics software for the Ruby programming language|10.1093/bioinformatics/btq475|186|10|Naohisa Goto and P. Prins and M. Nakao and R. Bonnal and J. Aerts and Toshiaki Katayama|6806fe4a47310f6961cdaeca17fca6aed513d33f\n2001|Programming ruby|10.1145/505482.505496|40|5|Parasuram Anantharam|07cf5fc8f6a8cd4fdc419e541042297ff32f7c60\n2012|FSelector: a Ruby gem for feature selection|10.1093/bioinformatics/bts528|35|5|Tiejun Cheng and Yanli Wang and S. Bryant|9f44aa75bf8d4bd691ad30a31d4ae836774d7b3d\n2008|A little language for surveys: constructing an internal DSL in Ruby|10.1145/1593105.1593181|31|1|H. C. Cunningham|735dcf869561bd8c1cbcd51ab04a838ef79a1e9e\n2009|Feature-oriented programming with Ruby|10.1145/1629716.1629721|27|1|S. Günther and Sagar Sunkle|0a5e41f0b40a14c679edf1c45742e5d40e34de9e\n2009|The ruby intermediate language|10.1145/1640134.1640148|25|4|Michael Furr and Jong-hoon An and J. Foster and M. Hicks|0b6b91b17263b8b275514c19d6d74606836dcd39\n2014|FlowR: aspect oriented programming for information flow control in ruby|10.1145/2577080.2577090|17|1|Thomas Pasquier and J. Bacon and B. Shand|88725c499c0b425fcaaf36de32cdd287386a9870\n2014|αRby - An Embedding of Alloy in Ruby|10.1007/978-3-662-43652-3_5|16|3|Aleksandar Milicevic and I. Efrati and D. Jackson|c6709b3b8420194bacc64e8f1bd1149cbbeaf710\n2008|A machine vision extension for the Ruby programming language|10.1109/ICINFA.2008.4608143|7|0|J. Wedekind and B. Amavasai and K. Dutton and M. Boissenin|a0ea79afc0f997062f6305877ec38684fe9c33b6\n2008|Language design and implementation using ruby and the interpreter pattern|10.1145/1352135.1352155|4|0|Ariel Ortiz|602a908e10c1e586a5962823bbe7a3b749d822fb\n2018|Specializing ropes for ruby|10.1145/3237009.3237026|2|0|Kevin Menard and Chris Seaton and Benoit Daloze|6fcf92f1bf8a95512a01c0fef1236ac2610299db\n2020|Let’s Get It Started: Installing Ruby|10.1007/978-1-4842-1278-3_1|1|0|Pete Cooper|56bfb401cd9a9183005b3aae84ec7ed4c8c6b49f\n2013|A machine vision extension to the Ruby programming language using OpenCV and FFI|10.1109/IVCNZ.2013.6727013|1|0|A. Marburg and M. Hayes and A. Bainbridge-Smith|07e2461bccbd4a17609d022518a82bdba691c21d" }, "rubygems-pm": { "title": "RubyGems", "appeared": 2018, "type": "packageManager", "creators": [ "Nick Quaranto" ], "website": "https://rubygems.org", "country": [ "United States" ], "originCommunity": [ "https://github.com/rubygems" ], "domainName": { "registered": 2004, "awisRank": { "2022": 51462 }, "name": "rubygems.org" }, "wikipedia": { "summary": "RubyGems is a package manager for the Ruby programming language that provides a standard format for distributing Ruby programs and libraries (in a self-contained format called a \"gem\"), a tool designed to easily manage the installation of gems, and a server for distributing them. It was created by Chad Fowler and Richard Kilmer during RubyConf 2004.The interface for RubyGems is a command-line tool called gem which can install and manage libraries (the gems). RubyGems integrates with Ruby run-time loader to help find and load installed gems from standardized library folders. Though it is possible to use a private RubyGems repository, the public repository is most commonly used for gem management. The public repository helps users find gems, resolve dependencies and install them. RubyGems is bundled with the standard Ruby package as of Ruby 1.9.", "backlinksCount": 149, "pageId": 2866386, "dailyPageViews": 114, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/RubyGems" }, "packageCount": 154445, "packageInstallCount": 30861856790, "forLanguages": [ "ruby" ] }, "ruleml": { "title": "RuleML", "appeared": 2002, "type": "pl", "creators": [ "Harold Boley", "Benjamin Grosof", "Said Tabet" ], "country": [ "United States and Canada" ], "originCommunity": [ "RuleML Inc" ], "wikipedia": { "related": [ "xml" ], "summary": "RuleML is a global initiative, led by a non-profit organization RuleML Inc., that is devoted to advancing research and industry standards design activities in the technical area of rules that are semantic and highly inter-operable. The standards design takes the form primarily of a markup language, also known as RuleML. The research activities include an annual research conference, the RuleML Symposium, also known as RuleML for short. Founded in fall 2000 by Harold Boley, Benjamin Grosof, and Said Tabet, RuleML was originally devoted purely to standards design, but then quickly branched out into the related activities of coordinating research and organizing an annual research conference starting in 2002. The M in RuleML is sometimes interpreted as standing for Markup and Modeling. The markup language was developed to express both forward (bottom-up) and backward (top-down) rules in XML for deduction, rewriting, and further inferential-transformational tasks. It is defined by the Rule Markup Initiative, an open network of individuals and groups from both industry and academia that was formed to develop a canonical Web language for rules using XML markup and transformations from and to other rule standards/systems. Markup standards and initiatives related to RuleML include: Rule Interchange Format (RIF): The design and overall purpose of W3C's Rule Interchange Format (RIF) industry standard is based primarily on the RuleML industry standards design. Like RuleML, RIF embraces a multiplicity of potentially useful rule dialects that nevertheless share common characteristics. RuleML Technical Committee from Oasis-Open: An industry standards effort devoted to legal automation utilizing RuleML. Semantic Web Rule Language (SWRL): An industry standards design, based primarily on an early version of RuleML, whose development was funded in part by the DARPA Agent Markup Language (DAML) research program. Semantic Web Services Framework], particularly its Semantic Web Services Language: An industry standards design, based primarily on a medium-mature version of RuleML, whose development was funded in part by the DARPA Agent Markup Language (DAML) research program and the WSMO research effort of the EU. Mathematical Markup Language (MathML): However, MathML's Content Markup is better suited for defining functions rather than relations or general rules Predictive Model Markup Language (PMML): With this XML-based language one can define and share various models for data-mining results, including association rules Attribute Grammars in XML (AG-markup): For AG's semantic rules, there are various possible XML markups that are similar to Horn-rule markup Extensible Stylesheet Language Transformations (XSLT): This is a restricted term-rewriting system of rules, written in XML, for transforming XML documents into other text documents", "backlinksCount": 18, "pageId": 1568414, "dailyPageViews": 14, "created": 2005, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/RuleML" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7648", "centralPackageRepositoryCount": 0 }, "run-basic": { "title": "Run BASIC", "appeared": 2008, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Shoptalk Systems" ], "wikipedia": { "related": [ "liberty-basic", "basic", "html", "css", "javascript", "sqlite", "perl", "php", "linux" ], "summary": "Run BASIC is a web application server, based on the Liberty BASIC version of the BASIC programming language.", "created": 2007, "backlinksCount": 96, "pageId": 9043633, "revisionCount": 56, "dailyPageViews": 10, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Run_BASIC" }, "centralPackageRepositoryCount": 0 }, "runcible": { "title": "RUNCIBLE", "appeared": 1958, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f179a5e14cde9d538af898d2e8ad49e651855352" ], "country": [ "United States" ], "originCommunity": [ "Case Institute of Technology" ], "supersetOf": [ "it" ], "hopl": "https://hopl.info/showlanguage.prx?exp=111", "centralPackageRepositoryCount": 0 }, "runescript": { "title": "runescript", "appeared": 2001, "type": "pl", "description": "RuneScript is a scripting language that Jagex uses to create content for RuneScape. The game engine is not written in RuneScript, but instead Java.", "reference": [ "https://oldschool.runescape.wiki/w/RuneScript" ] }, "runic": { "title": "runic", "appeared": 2017, "type": "template", "description": "Runic is a first order templating language operating on arrays of strings.", "website": "https://wiki.xxiivv.com/#runic", "country": [ "Unknown" ], "originCommunity": [ "https://github.com/XXIIVV" ], "domainName": { "name": "wiki.xxiivv.com" }, "example": [ "* Header\n& Paragraph\n- List Element 1\n- List Element 2\n| table | row1\n| table | row2\n# -- CODE BLOCK\n> -- HTML BLOCK\nλ -- LAIN BLOCK" ] }, "runiq": { "title": "runiq", "appeared": 2015, "type": "pl", "website": "http://matthewtoast.github.io/runiq/", "country": [ "United States" ], "originCommunity": [ "https://github.com/matthewtoast/runiq/issues" ], "githubRepo": { "firstCommit": 2015, "stars": 22, "forks": 1, "subscribers": 1, "created": 2015, "updated": 2020, "description": ":aquarius: A Lisp-esque, JS-interpreted scripting language", "issues": 5, "url": "https://github.com/matthewtoast/runiq" }, "repoStats": { "firstCommit": 2015, "commits": 35, "committers": 1, "files": 88 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n10797249|Show HN: Runiq, a little Lisp-inspired language that runs on JavaScript|2015-12-27 12:29:51 UTC|1451219391|matthewtoast|3|24" }, "runoff": { "title": "RUNOFF", "appeared": 1965, "type": "textMarkup", "creators": [ "J. E. Saltzer" ], "country": [ "United States" ], "originCommunity": [ "MIT" ], "githubLanguage": { "fileExtensions": [ "rnh", "rno" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "text", "tmScope": "text.runoff", "wrap": true, "repos": 5, "id": "RUNOFF" }, "githubBigQuery": { "repos": 7, "users": 7, "id": "RUNOFF" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 3, "commitCount": 351, "sampleCount": 4, "example": [ ".na\n.ll 72\n.pl 90\n.m1 4\n.m2 4\n.m3 6\n.m4 6\n.sp 8\n.ds\n.ce\nCONTRIBUTING TO LINGUIST\n.sp\n.ce\nby\n.ce\nGITHUB\n.sp\n.ce\nand the\n.sp\n.ce\nOPEN SOURCE COMMUNITY\n.sp\n.bp\n.sp 5\n.ce\n_\bI_\bN_\bT_\bR_\bO_\bD_\bU_\bC_\bT_\bI_\bO_\bN:\n.sp\n Hi there! We're thrilled that you'd like to contribute to this\nproject. Your help is essential for keeping it great. This project\nadheres to the Contributor Covenant Code of Conduct. By participating,\nyou are expected to uphold this code.\n.br\nThe majority of contributions won't need to touch any Ruby code at all.\n.sp 5\n.ce\n_\bA_\bd_\bd_\bi_\bn_\bg _\ba_\bn _\be_\bx_\bt_\be_\bn_\bs_\bi_\bo_\bn _\bt_\bo _\ba\n_\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be\n.sp\n We try only to add new extensions once they have some usage on\nGitHub. In most cases we prefer that extensions be in use in hundreds of\nrepositories before supporting them in Linguist.\n.sp\nTo add support for a new extension:\n.sp\n.in 5\n.un 5\n1. Add your extension to the language entry in\n_\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be_\bs_\b._\by_\bm_\bl, keeping the extensions in\nalphabetical order.\n.br\n.un 5\n2. Add at least one sample for your extension to the samples directory\nin the correct subdirectory.\n.br\n.un 5\n3. Open a pull request, linking to a GitHub search result showing\nin-the-wild usage.\n.in 0\n.sp\nIn addition, if this extension is already listed in\n_\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be_\bs_\b._\by_\bm_\bl then sometimes a few more steps\nwill need to be taken:\n.sp\n.in 5\n.un 5\n1. Make sure that example .yourextension files are present in the\nsamples directory for each language that uses .yourextension.\n.br\n.un 5\n2. Test the performance of the Bayesian classifier with a relatively\nlarge number (1000s) of sample .yourextension files. (ping @arfon or\n@bkeepers to help with this) to ensure we're not misclassifying files.\n.br\n.un 5\n3. If the Bayesian classifier does a bad job with the sample files\nthen a heuristic may need to be written to help.\n.in 0\n.sp 5\n.ce\n_\bA_\bd_\bd_\bi_\bn_\bg _\ba _\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be\n.sp\n We try only to add languages once they have some usage on GitHub.\nIn most cases we prefer that each new extension be in use in hundreds of\nrepositories before supporting them in Linguist.\n.sp\nTo add support for a new language:\n.in 5\n.un 5\n1. Add an entry for your language to\n_\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be_\bs_\b._\by_\bm_\bl.\n.br\n.un 5\n2. Add a grammar for your language. Please only add grammars that have\na license that permits redistribution.\n.br\n.in +5\n.un 5\ni. Add your grammar as a submodule:\n.br\n.in +4\ngit submodule add\nhttps://github.com/Alhadis/language-roff\nvendor/grammars/language-roff\n.in -4\n.un 5\nii. Add your grammar to grammars.yml:\n.br\n.in +4\nscript/convert-grammars --add vendor/grammars/MyGrammar\n.in -4\n.un 5\niii. Download the license for the grammar by running script/licensed.\nBe careful to only commit the file for the new grammar, as this script\nmay update licenses for other grammars as well.\n.br\n.in -5\n.un 5\n3. Add samples for your language to the samples directory in the\ncorrect subdirectory.\n.br\n.un 5\n4. Open a pull request, linking to a GitHub search result showing\nin-the-wild usage.\n.br\n.in 0\n.sp\nIn addition, if your new language defines an extension that's already\nlisted in _\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be_\bs_\b._\by_\bm_\bl (such as `.foo`) then\nsometimes a few more steps will need to be taken:\n.sp\n.in +5\n.un 5\n1. Make sure that example .foo files are present in the samples\ndirectory for each language that uses .foo.\n.br\n.un 5\n2. Test the performance of the Bayesian classifier with a relatively\nlarge number (1000s) of sample `.foo` files. (ping @arfon or @bkeepers\nto help with this) to ensure we're not misclassifying files.\n.br\n.un 5\n3. If the Bayesian classifier does a bad job with the sample .foo\nfiles then a heuristic may need to be written to help.\n.br\n.in 0\n.sp\nRemember, the goal here is to try and avoid false positives!\n.sp 2\n.ce\n_\bF_\bi_\bx_\bi_\bn_\bg _\ba _\bm_\bi_\bs_\bc_\bl_\ba_\bs_\bs_\bi_\bf_\bi_\be_\bd\n_\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be\n.br\n Most languages are detected by their file extension defined in\n_\bl_\ba_\bn_\bg_\bu_\ba_\bg_\be_\bs_\b._\by_\bm_\bl. For disambiguating between\nfiles with common extensions, linguist applies some heuristics and a\nstatistical classifier. This process can help differentiate between,\nfor example, .h files which could be either C, C++, or Obj-C.\n.sp\n Misclassifications can often be solved by either adding a new\nfilename or extension for the language or adding more samples to make\nthe classifier smarter.\n.sp\n.m4 -2\n.ce\n_\bF_\bi_\bx_\bi_\bn_\bg _\bs_\by_\bn_\bt_\ba_\bx\n_\bh_\bi_\bg_\bh_\bl_\bi_\bg_\bh_\bt_\bi_\bn_\bg\n.br\n Syntax highlighting in GitHub is performed using\nTextMate-compatible grammars. These are the same grammars that TextMate,\nSublime Text and Atom use. Every language in languages.yml is mapped to\nits corresponding TM `scope`. This scope will be used when picking up a\ngrammar for highlighting.\n.sp\n Assuming your code is being detected as the right language, in most\ncases this is due to a bug in the language grammar rather than a bug in\nLinguist. _\bg_\br_\ba_\bm_\bm_\ba_\br_\bs_\b._\by_\bm_\bl lists all the grammars\nwe use for syntax highlighting on github.com. Find the one corresponding\nto your code's programming language and submit a bug report upstream.\n.sp\nIf you can, try to reproduce the highlighting problem in the text editor\nthat the grammar is designed for (TextMate, Sublime Text, or Atom) and\ninclude that information in your bug report.\n.sp\n You can also try to fix the bug yourself and submit a Pull Request.\nTextMate's documentation offers a good introduction on how to work with\nTextMate-compatible grammars. You can test grammars using Lightshow.\n.sp\n Once the bug has been fixed upstream, we'll pick it up for GitHub\nin the next release of Linguist.\n.sp 2\n.ce\n_\bT_\be_\bs_\bt_\bi_\bn_\bg\n.br\n For development you are going to want to checkout out the source.\nTo get it, clone the repo and run Bundler to install its dependencies.\n.sp\n.in 4\ngit clone https://github.com/github/linguist.git\n.br\ncd linguist/\n.br\nscript/bootstrap\n.br\n.in 0\n.sp\nTo run the tests:\n.sp\n.in 4\n bundle exec rake test\n.in 0\n.sp\n Sometimes getting the tests running can be too much work, especially\nif you don't have much Ruby experience. It's okay: be lazy and let our\nbuild bot Travis run the tests for you. Just open a pull request and the\nbot will start cranking away.\n.sp\n.ce\n_\bM_\ba_\bi_\bn_\bt_\ba_\bi_\bn_\be_\br_\bs\n.br\nLinguist is maintained with love by:\n.sp\n.in -2\n- @arfon (GitHub Staff)\n.br\n- @larsbrinkhoff\n.br\n- @pchaigno\n.in 0\n.br\n.sp\nAs Linguist is a production dependency for GitHub we have a couple of\nworkflow restrictions:\n.sp\n.in -2\n- Anyone with commit rights can merge Pull Requests provided that there\nis a :+1: from a GitHub member of staff\n.br\n- Releases are performed by GitHub staff so we can ensure GitHub.com\nalways stays up to date with the latest release of Linguist and there\nare no regressions in production.\n.in 0\n.sp\n.ce\n_\bR_\be_\bl_\be_\ba_\bs_\bi_\bn_\bg\n.sp\nIf you are the current maintainer of this gem:\n.sp\n.in 5\n.ul 5\n1. Create a branch for the release:\n.sp\n.in +2\ngit checkout -b cut-release-vxx.xx.xx\n.in -2\n.sp\n.ul 5\n2. Make sure your local dependencies are up to date:\n.sp\n.in +2\nscript/bootstrap\n.in -2\n.sp\n.ul 5\n3. If grammar submodules have not been updated recently, update them:\n.sp\n.in +2\ngit submodule update --remote _&_& git commit -a\n.in -2\n.sp\n.ul 5\n4. Ensure that samples are updated:\n.sp\n.in +2\nbundle exec rake samples\n.in -2\n.sp\n5. Ensure that tests are green:\n.sp\n.in +2\nbundle exec rake test\n.in -2\n.sp\n.ul 5\n6. Bump gem version in lib/linguist/version.rb\n.br\n.ul 5\n7. Make a PR to github/linguist\n.br\n.ul 5\n8. Build a local gem: `bundle exec rake build_gem`\n.br\n.ul 5\n9. Test the gem:\n.sp\n.in +5\n.un 5\ni. Bump the Gemfile and Gemfile.lock versions for an app which relies\non this gem\n.un 5\nii. Install the new gem locally\n.un 5\niii. Test behaviour locally, branch deploy, whatever needs to happen.\n.br\n.in -5\n.sp\n.ul 5\n10. Merge github/linguist PR\n.sp\n.ul 5\n11. Tag and push:\n.sp\n.in +2\ngit tag vx.xx.xx;\n.br\ngit push --tags\n.in -2\n.sp\n12. Push to rubygems.org\n.br\n.in +2\ngem push github-linguist-3.0.0.gem\n.in -2\n.sp 2\n" ], "url": "https://github.com/Alhadis/language-roff" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2460", "fileType": "text", "centralPackageRepositoryCount": 0 }, "runrev": { "title": "RunRev", "appeared": 2003, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "LiveCode Ltd" ], "wikipedia": { "related": [ "livecode", "ios", "linux", "android", "hypercard" ], "summary": "LiveCode Ltd. (formerly Runtime Revolution and Cross Worlds Computing makes the LiveCode cross-platform development environment (formerly called Revolution) for creating applications that run on iOS, Microsoft Windows, Linux, macOS, Android and Browsers. It is similar to Apple's discontinued HyperCard.", "created": 2016, "backlinksCount": 12, "pageId": 5185133, "revisionCount": 1, "dailyPageViews": 2, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/RunRev" }, "centralPackageRepositoryCount": 0 }, "ruri": { "title": "Ruri", "appeared": 2000, "type": "pl", "creators": [ "Tom Rothamel" ], "webRepl": [ "https://onegeek.org/software/ruri/demo.html" ], "reference": [ "https://onegeek.org/software/ruri", "https://gilles-hunault.leria-info.univ-angers.fr/hilapr/beers/schade/r.html#Ruri", "https://onegeek.org/software/ruri/current/Ruriref.txt" ], "country": [ "United States" ], "originCommunity": [ "https://onegeek.org/software/old.html" ], "gitRepo": "https://onegeek.org/software/ruri/current", "hopl": "https://hopl.info/showlanguage.prx?exp=8638", "centralPackageRepositoryCount": 0 }, "russell": { "title": "RUSSELL", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d640e15b414fcefd14a28b243f22bdfae0002bd2" ], "country": [ "United States" ], "originCommunity": [ "Cornell University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=527", "wordRank": 4448, "centralPackageRepositoryCount": 0 }, "rust-hir": { "title": "Rust HIR", "appeared": 2015, "type": "ir", "webRepl": [ "https://play.rust-lang.org/" ], "standsFor": "Rust High-level Intermediate Representation", "country": [ "Various" ], "originCommunity": [ "https://github.com/rust-lang/rfcs/issues" ], "firstAnnouncement": "https://github.com/rust-lang/rfcs/blob/master/text/1191-hir.md", "announcementMethod": "rfc", "related": [ "rust-mir", "swift-il" ], "example": [ "#[prelude_import]\nuse ::std::prelude::rust_2015::*;\n#[macro_use]\nextern crate std;\nfn main() { let mut vec = Vec::new(); vec.push(1); vec.push(2); }" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "rust-mir": { "title": "Rust MIR", "appeared": 2016, "type": "ir", "website": "https://www.rust-lang.org", "webRepl": [ "https://play.rust-lang.org/" ], "documentation": [ "https://blog.rust-lang.org/2016/04/19/MIR.html" ], "reference": [ "https://rustc-dev-guide.rust-lang.org/hir.html", "https://blog.rust-lang.org/2016/04/19/MIR.html" ], "standsFor": "Rust Mid-level Intermediate Representation", "country": [ "Various" ], "originCommunity": [ "https://github.com/rust-lang" ], "domainName": { "registered": 2010, "awisRank": { "2022": 10763 }, "name": "rust-lang.org" }, "compilesTo": [ "llvmir" ], "related": [ "swift-il" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// WARNING: This output format is intended for human consumers only\n// and is subject to change without notice. Knock yourself out.\nfn main() -> () {\n let mut _0: (); // return place in scope 0 at src/main.rs:1:11: 1:11\n let mut _1: std::vec::Vec; // in scope 0 at src/main.rs:2:9: 2:16\n let _2: (); // in scope 0 at src/main.rs:3:5: 3:16\n let mut _3: &mut std::vec::Vec; // in scope 0 at src/main.rs:3:5: 3:16\n let _4: (); // in scope 0 at src/main.rs:4:5: 4:16\n let mut _5: &mut std::vec::Vec; // in scope 0 at src/main.rs:4:5: 4:16\n scope 1 {\n debug vec => _1; // in scope 1 at src/main.rs:2:9: 2:16\n }\n\n bb0: {\n _1 = Vec::::new() -> bb1; // scope 0 at src/main.rs:2:19: 2:29\n // mir::Constant\n // + span: src/main.rs:2:19: 2:27\n // + user_ty: UserType(0)\n // + literal: Const { ty: fn() -> Vec {Vec::::new}, val: Value(Scalar()) }\n }\n\n bb1: {\n _3 = &mut _1; // scope 1 at src/main.rs:3:5: 3:16\n _2 = Vec::::push(move _3, const 1_i32) -> [return: bb2, unwind: bb5]; // scope 1 at src/main.rs:3:5: 3:16\n // mir::Constant\n // + span: src/main.rs:3:9: 3:13\n // + literal: Const { ty: for<'r> fn(&'r mut Vec, i32) {Vec::::push}, val: Value( Scalar()) }\n }\n\n bb2: {\n _5 = &mut _1; // scope 1 at src/main.rs:4:5: 4:16\n _4 = Vec::::push(move _5, const 2_i32) -> [return: bb3, unwind: bb5]; // scope 1 at src/main.rs:4:5: 4:16\n // mir::Constant\n // + span: src/main.rs:4:9: 4:13\n // + literal: Const { ty: for<'r> fn(&'r mut Vec, i32) {Vec::::push}, val: Value( Scalar()) }\n }\n\n bb3: {\n drop(_1) -> bb4; // scope 0 at src/main.rs:5:1: 5:2\n }\n\n bb4: {\n return; // scope 0 at src/main.rs:5:2: 5:2\n }\n\n bb5 (cleanup): {\n drop(_1) -> bb6; // scope 0 at src/main.rs:5:1: 5:2\n }\n\n bb6 (cleanup): {\n resume; // scope 0 at src/main.rs:1:1: 5:2\n }\n}" ], "gitRepo": "https://github.com/rust-lang/rust/tree/master/src/librustc_mir", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "rust": { "title": "Rust", "appeared": 2010, "type": "pl", "creators": [ "Graydon Hoare" ], "website": "https://www.rust-lang.org", "documentation": [ "https://www.rust-lang.org/learn", "https://devdocs.io/rust/" ], "reference": [ "https://blog.rust-lang.org/2018/11/27/Rust-survey-2018.html" ], "fileExtensions": [ "rs", "rlib" ], "originCommunity": [ "Mozilla" ], "domainName": { "registered": 2010, "awisRank": { "2022": 10763 }, "name": "rust-lang.org" }, "proposals": "https://github.com/rust-lang/rfcs", "visualParadigm": false, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasComments": { "example": "// https://doc.rust-lang.org/reference/comments.html\n// a comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasDirectives": { "example": "// A conditionally-compiled module\n#[cfg(target_os = \"linux\")]\nmod bar {\n /* ... */\n}\n// General metadata applied to the enclosing module or crate.\n#![crate_type = \"lib\"]\n// A function marked as a unit test\n#[test]\nfn test_foo() {\n /* ... */\n}\n// A lint attribute used to suppress a warning/error\n#[allow(non_camel_case_types)]\ntype int8_t = i8;\n\n// Inner attribute applies to the entire function.\nfn some_unused_variables() {\n #![allow(unused_variables)]\n\n let x = ();\n let y = ();\n let z = ();\n}", "value": true }, "hasImports": { "example": "use ::std::fs; // Imports from the `std` crate, not the module below.\nuse self::std::fs as self_fs; // Imports the module below.\nmod my;\nuse self::foo::Zoo as _;\n#[path = \"foo.rs\"]\nmod c;", "value": true }, "hasIterators": { "example": "for n in 0..42 {\n println!(\"{}\", n);\n}", "value": true }, "hasMacros": { "example": "// https://doc.rust-lang.org/book/ch19-06-macros.html\n#[macro_export]\nmacro_rules! vec {\n ( $( $x:expr ),* ) => {\n {\n let mut temp_vec = Vec::new();\n $(\n temp_vec.push($x);\n )*\n temp_vec\n }\n };\n}", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasPatternMatching": { "example": "", "value": true }, "hasPrintDebugging": { "example": "println!(\"Hi\");", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "println!" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "alignof", "as", "become", "box", "break", "const", "continue", "crate", "do", "else", "enum", "extern", "false", "final", "fn", "for", "if", "impl", "in", "let", "loop", "macro", "match", "mod", "move", "mut", "offsetof", "override", "priv", "proc", "pub", "pure", "ref", "return", "Self", "self", "sizeof", "static", "struct", "super", "trait", "true", "type", "typeof", "unsafe", "unsized", "use", "virtual", "where", "while", "yield" ], "gource": "https://www.youtube.com/watch?v=Ds0Psk1YmOc", "githubRepo": { "stars": 77242, "forks": 10314, "subscribers": 1489, "created": 2010, "updated": 2023, "description": "Empowering everyone to build reliable and efficient software.", "issues": 9522, "url": "https://github.com/rust-lang/rust" }, "repoStats": { "firstCommit": 2010, "commits": 227223, "committers": 6006, "files": 41028 }, "wikipedia": { "related": [ "linux", "freebsd", "android", "ios", "alef", "csharp", "cyclone", "erlang", "haskell", "haxe", "limbo", "newsqueak", "ruby", "scheme", "standard-ml", "swift", "crystal", "elm", "idris", "c", "ml", "go", "java", "ocaml", "llvmir", "d", "nim", "emacs-editor" ], "summary": "Rust is a systems programming language sponsored by Mozilla Research, which describes it as a \"safe, concurrent, practical language,\" supporting functional and imperative-procedural paradigms. Rust is syntactically similar to C++, but its designers intend it to provide better memory safety while maintaining performance. Rust is an open source programming language. Its designers have refined the language through the experiences of writing the Servo web browser layout engine and the Rust compiler. A large portion of current commits to the project are from community members. Rust won first place for \"most loved programming language\" in the Stack Overflow Developer Survey in 2016 and 2017; it is referenced in The Book of Mozilla as \"oxidised metal\".", "pageId": 29414838, "dailyPageViews": 1159, "created": 2010, "backlinksCount": 336, "revisionCount": 956, "appeared": 2016, "fileExtensions": [ "rs", "rlib" ], "url": "https://en.wikipedia.org/wiki/Rust_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "rs", "rsin" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nrust-lang rust https://github.com/rust-lang.png https://github.com/rust-lang/rust Rust #dea584 38932 6045 851 \"Empowering everyone to build reliable and efficient software.\"\nxi-editor druid https://github.com/xi-editor.png https://github.com/xi-editor/druid Rust #dea584 623 33 162 \"Data-oriented Rust UI design toolkit.\"\nyewstack yew https://github.com/yewstack.png https://github.com/yewstack/yew Rust #dea584 8506 323 422 \"Rust framework for building client web apps\"\ngetzola zola https://github.com/getzola.png https://github.com/getzola/zola Rust #dea584 2306 215 156 \"A fast static site generator in a single binary with everything built-in.\"\nwasmerio wasmer https://github.com/wasmerio.png https://github.com/wasmerio/wasmer Rust #dea584 4321 146 315 \"The Universal WebAssembly Runtime\"\ncloudflare wrangler https://github.com/cloudflare.png https://github.com/cloudflare/wrangler Rust #dea584 644 63 185 \"🤠 wrangle your cloudflare workers\"\nrust-unofficial awesome-rust https://github.com/rust-unofficial.png https://github.com/rust-unofficial/awesome-rust Rust #dea584 12178 807 497 \"A curated list of Rust code and resources.\"\nCraneStation wasmtime https://github.com/CraneStation.png https://github.com/CraneStation/wasmtime Rust #dea584 1282 90 130 \"Standalone JIT-style runtime for WebAssembly, using Cranelift\"\ntokio-rs tokio https://github.com/tokio-rs.png https://github.com/tokio-rs/tokio Rust #dea584 5810 483 326 \"A runtime for writing reliable asynchronous applications with Rust. Provides I/O, networking, scheduling, timers, ...\"\nSergioBenitez Rocket https://github.com/SergioBenitez.png https://github.com/SergioBenitez/Rocket Rust #dea584 7888 551 273 \"A web framework for Rust.\"\nhyperium hyper https://github.com/hyperium.png https://github.com/hyperium/hyper Rust #dea584 5153 752 171 \"An HTTP library for Rust\"\nrust-lang-nursery futures-rs https://github.com/rust-lang-nursery.png https://github.com/rust-lang-nursery/futures-rs Rust #dea584 2833 350 85 \"Zero-cost asynchronous programming in Rust\"\nSpotifyd spotifyd https://github.com/Spotifyd.png https://github.com/Spotifyd/spotifyd Rust #dea584 2017 106 112 \"A spotify daemon\"\nmaps4print azul https://github.com/maps4print.png https://github.com/maps4print/azul Rust #dea584 3105 123 211 \"Desktop GUI Framework\"\nrust-lang regex https://github.com/rust-lang.png https://github.com/rust-lang/regex Rust #dea584 1200 189 42 \"An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.\"\nservo servo https://github.com/servo.png https://github.com/servo/servo Rust #dea584 14762 2222 210 \"The Servo Browser Engine\"\ntokio-rs tracing https://github.com/tokio-rs.png https://github.com/tokio-rs/tracing Rust #dea584 262 27 127 \"Application level tracing for Rust.\"\nCraneStation cranelift https://github.com/CraneStation.png https://github.com/CraneStation/cranelift Rust #dea584 2066 172 138 \"Cranelift code generator\"\nggez ggez https://github.com/ggez.png https://github.com/ggez/ggez Rust #dea584 1715 213 79 \"Rust library to create a Good Game Easily\"\nrust-lang cargo https://github.com/rust-lang.png https://github.com/rust-lang/cargo Rust #dea584 4696 989 109 \"The Rust package manager\"\nsharkdp bat https://github.com/sharkdp.png https://github.com/sharkdp/bat Rust #dea584 15094 295 413 \"A cat(1) clone with wings.\"\nparitytech substrate https://github.com/paritytech.png https://github.com/paritytech/substrate Rust #dea584 1437 374 95 \"Substrate: The platform for blockchain innovators\"\ngfx-rs gfx https://github.com/gfx-rs.png https://github.com/gfx-rs/gfx Rust #dea584 3334 389 111 \"A low-overhead Vulkan-like GPU API for Rust.\"\nrust-lang rust-clippy https://github.com/rust-lang.png https://github.com/rust-lang/rust-clippy Rust #dea584 3740 498 114 \"A bunch of lints to catch common mistakes and improve your Rust code\"\nseanmonstar reqwest https://github.com/seanmonstar.png https://github.com/seanmonstar/reqwest Rust #dea584 1782 277 109 \"An easy and powerful Rust HTTP Client\"", "trendingProjectsCount": 26, "type": "programming", "aceMode": "rust", "codemirrorMode": "rust", "codemirrorMimeType": "text/x-rustsrc", "tmScope": "source.rust", "aliases": [ "rs" ], "repos": 356891, "id": "Rust" }, "githubBigQuery": { "repos": 15753, "users": 9148, "id": "Rust" }, "monaco": "rust", "codeMirror": "rust", "pygmentsHighlighter": { "filename": "rust.py", "fileExtensions": [ "rs", "rs.in" ], "id": "Rust" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 28, "commitCount": 181, "sampleCount": 3, "example": [ "extern crate foo;\nextern crate bar;\n\nuse foo::{self, quix};\nuse bar::car::*;\nuse bar;\n\nfn main() {\n println!(\"Hello {}\", \"World\");\n\n panic!(\"Goodbye\")\n}\n" ], "url": "https://github.com/zargony/atom-language-rust" }, "languageServerProtocolProject": [ "https://github.com/rust-lang-nursery/rls\nwrittenIn rust" ], "projectEuler": { "memberCount": { "2019": 507, "2022": 1227 }, "id": "Rust" }, "helloWorldCollection": [ "// Hello world in Rust\n\nfn main() {\n println!(\"Hello World!\");\n}" ], "leachim6": { "filepath": "r/Rust.rs", "fileExtensions": [ "rs" ], "example": [ "fn main() {\n println!(\"Hello World\");\n}\n" ], "id": "Rust" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Rust", "quineRelay": "Rust", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\npub fn square(num: i32) -> i32 {\n num * num\n}\n\n// If you use `main()`, declare it as `pub` to see it in the output:\n// pub fn main() { ... }\n" ], "id": "Rust" }, "rijuRepl": { "example": [ "fn main() {\n println!(\"Hello, world!\");\n}\n" ], "id": "https://riju.codes/rust" }, "replit": "https://repl.it/languages/rust", "tryItOnline": "rust", "indeedJobs": { "2017": 141, "query": "rust engineer" }, "stackOverflowSurvey": { "2021": { "users": 5799, "medianSalary": 77530, "fans": 15865, "percentageUsing": 0.07 } }, "officialBlogUrl": [ "https://blog.rust-lang.org/" ], "faqPageUrl": [ "https://prev.rust-lang.org/en-US/faq.html" ], "irc": "https://webchat.freenode.net/?channels=##rust", "discord": "https://discord.gg/rust-lang", "zulip": "https://rust-lang.zulipchat.com/", "subreddit": [ { "memberCount": { "2017": 30807, "2022": 186942 }, "url": "https://reddit.com/r/rust" } ], "meetup": { "memberCount": 29951, "groupCount": 122, "url": "https://www.meetup.com/topics/rust" }, "tiobe": { "currentRank": 31, "id": "Rust" }, "pypl": "Rust", "packageRepository": [ "https://crates.io/" ], "twitter": "https://twitter.com/rustlang", "ubuntuPackage": "rustc", "gdbSupport": true, "jupyterKernel": [ "https://github.com/google/evcxr/tree/master/evcxr_jupyter" ], "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2018|No Starch Press|The Rust Programming Language|Klabnik, Steve and Nichols, Carol|9781593278281\n2020|Manning Publications|Rust in Action|McNamara, TS|9781617294556\n2020|Packt Publishing|Creative Projects for Rust Programmers: Build exciting projects on domains such as web apps, WebAssembly, games, and parsing|Milanesi, Carlo|9781789346220\n2019|Packt Publishing|Rust Programming Cookbook: Explore the latest features of Rust 2018 for building fast and secure apps|Matzinger, Claus|9781789530667\n2019-08-12T00:00:01Z|No Starch Press|The Rust Programming Language (Covers Rust 2018)|Klabnik, Steve and Nichols, Carol|9781718500440\n2021|No Starch Press|Rust for Rustaceans: Idiomatic Programming for Experienced Developers|Gjengset, Jon|9781718501850\n2021|Pragmatic Bookshelf|Hands-on Rust|Wolverson, Herbert|9781680508802\n2021|No Starch Press|Rust for Rustaceans: Idiomatic Programming for Experienced Developers|Gjengset, Jon|9781718501867\n2019|No Starch Press|The Rust Programming Language (Covers Rust 2018)|Klabnik, Steve and Nichols, Carol|9781718500457\n2022|O'Reilly Media|Command-Line Rust: A Project-Based Primer for Writing Rust CLIs|Youens-Clark, Ken|9781098109431\n2021|Wiley|Beginning Rust Programming|Messier, Ric|9781119712978\n2020|Packt Publishing|Creative Projects for Rust Programmers: Build exciting projects on domains such as web apps, WebAssembly, games, and parsing|Milanesi, Carlo|9781789343878\n2021|Manning|Rust in Action|McNamara, Tim|9781638356226\n2021|Packt Publishing - ebooks Account|Rust Web Programming: A hands-on guide to developing fast and secure web apps with the Rust programming language|Flitton, Maxwell|9781800560819\n2019-01-25T00:00:01Z|Packt Publishing|Hands-On Data Structures and Algorithms with Rust: Learn programming techniques to build effective, maintainable, and readable code in Rust 2018|Matzinger, Claus|9781788995528\n2018|No Starch Press|The Rust Programming Language|Klabnik, Steve and Nichols, Carol|9781593278519\n2019-05-22T00:00:01Z|Packt Publishing|The Complete Rust Programming Reference Guide: Design, develop, and deploy effective software systems using the advanced constructs of Rust|Sharma, Rahul and Kaihlavirta, Vesa and Matzinger, Claus|9781838828103\n2020|Apress|Rust for the IoT: Building Internet of Things Apps with Rust and Raspberry Pi|Nusairat, Joseph Faisal|9781484258590\n2020|Apress|Rust for the IoT: Building Internet of Things Apps with Rust and Raspberry Pi|Nusairat, Joseph Faisal|9781484258606\n2019|Packt Publishing|Hands-On Microservices with Rust: Build, test, and deploy scalable and reactive microservices with Rust 2018|Kolodin, Denis|9781789341980\n2019|Apress|Practical Machine Learning with Rust: Creating Intelligent Applications in Rust|Bhattacharjee, Joydeep|9781484251218\n2019|Packt Publishing|Rust Programming Cookbook: Explore the latest features of Rust 2018 for building fast and secure apps|Matzinger, Claus|9781789531749\n2021|Wiley|Beginning Rust Programming|Messier, Ric|9781119712879\n2018|Packt Publishing|Hands-On Functional Programming in Rust: Build modular and reactive applications with functional programming techniques in Rust 2018|Johnson, Andrew|9781788831581\n2018|Packt Publishing|Rust High Performance: Learn to skyrocket the performance of your Rust applications|Eguia Moraza, Iban|9781788478236\n2018|Packt Publishing|Rust Programming By Example: Enter the world of Rust by building engaging, concurrent, reactive, and robust applications|Gomez, Guillaume and Boucher, Antoni|9781788470308\n2021|Apress|Practical Rust Web Projects: Building Cloud and Web-Based Applications|Lyu, Shing|9781484265895\n2018-05-31T00:00:01Z|Packt Publishing|Hands-On Functional Programming in Rust: Build modular and reactive applications with functional programming techniques in Rust 2018|Johnson, Andrew|9781788839358\n2020-12-24T00:00:01Z|Packt Publishing|Practical System Programming for Rust Developers: Build fast and secure software for Linux/Unix systems with the help of practical examples|Eshwarla, Prabhu|9781800560963\n2020|Apress|Practical Rust Projects: Building Game, Physical Computing, and Machine Learning Applications|Lyu, Shing|9781484255995\n2018-01-15T00:00:00.000Z|Armstrong Publications LLC|Step Ahead with Rust: Systems Programming in Rust|Jonathan Creekmore and James Miller|9780999361801\n2019|Packt Publishing|Mastering Rust: Learn about memory safety, type system, concurrency, and the new features of Rust 2018 edition, 2nd Edition|Sharma, Rahul and Kaihlavirta, Vesa|9781789341188\n2018|Packt Publishing|Rust Quick Start Guide: The easiest way to learn Rust programming|Arbuckle, Daniel|9781789616705\n2018-01-11T00:00:01Z|Packt Publishing|Rust Programming By Example: Enter the world of Rust by building engaging, concurrent, reactive, and robust applications|Gomez, Guillaume and Boucher, Antoni|9781788390637\n2020|Apress|Practical Rust Projects: Building Game, Physical Computing, and Machine Learning Applications|Lyu, Shing|9781484255988\n2019||The Rust Programming Language|Steve Klabnik and Carol Nichols|9781098122539\n2019|Electronic Industry Press|Rust programming(Chinese Edition)|ZHANG HAN DONG ZHU|9787121354854\n2022|Packt Publishing - ebooks Account|Practical WebAssembly-Explore the fundamentals of WebAssembly programming using Rust|Sendil Kumar Nellaiyapen|9781838828004\n2022|BPB Publications|Learn Rust Programming: Safe Code, Supports Low Level and Embedded Systems Programming with a Strong Ecosystem (English Edition)|Matzinger, Claus|9789355511546\n2022|BPB Publications|Rust Crash Course: Build High-Performance, Efficient and Productive Software with the Power of Next-Generation Programming Skills (English Edition)|Kumar, Abhishek|9789355510952\n24-11-2017|Packt Publishing|Learning Rust|Paul Johnson|9781785888885\n2021|O'reilly Media, Inc.|Programming Rust|Jim Blandy and Jason Orendorff and Leonora F.S. Tindall|9781492052562\n2017-05-30|Packt Publishing|Mastering Rust|Vesa Kaihlavirta|9781785881374\n20210611|O'Reilly Media, Inc.|Programming Rust|Jim Blandy; Jason Orendorff; Leonora F .S. Tindall|9781492052548\n20171121|O'Reilly Media, Inc.|Programming Rust|Jim Blandy; Jason Orendorff|9781491927236\n2015-05-27|Packt Publishing|Rust Essentials|Ivo Balbaert|9781785282133\n2017-07-27|Packt Publishing|Rust Cookbook|Vigneshwer Dhinakaran|9781785886218\n20180322|Springer Nature|Beginning Rust|Carlo Milanesi|9781484234686\n2021|翔泳社|Rust In Action|Tim McNamara|9784798160221\n26-02-2021|Packt Publishing|Rust Web Programming|Maxwell Flitton|9781800566095\n2022|O'reilly Media, Inc.|Command-line Rust|Ken Youens-Clark|9781098109400\n20220225|O'Reilly Media, Inc.|Rust Brain Teasers|Herbert Wolverson|9781680509557\n20220113|O'Reilly Media, Inc.|Command-Line Rust|Ken Youens-Clark|9781098109387\n||Network Programming With Rust|Abhishek Chanda|9781789348071\n30-10-2018|Packt Publishing|Rust Quick Start Guide|Daniel Arbuckle|9781789610611\n43047|Packt Publishing|Rust Essentials - Second Edition|Ivo Balbaert|9781788399135\n29-03-2018|Packt Publishing|Rust Standard Library Cookbook|Jan Hohenheim, Daniel Durante|9781788629652\n||Learn Rust In 7 Days|Matthew Stoodley|9781789805499\n2022-06-30|Packt Publishing|Rust Web Development with Rocket|Karuna Murti|9781800560826\n31-05-2018|Packt Publishing|Hands-On Concurrency with Rust|Brian L. Troutwine|9781788478359\n24-12-2020|Packt Publishing|Practical System Programming for Rust Developers|Prabhu Eshwarla|9781800562011\n29-04-2022|Packt Publishing|Game Development with Rust and WebAssembly|Eric Smith|9781801074995\n43607|Packt Publishing|The Complete Rust Programming Reference Guide|Rahul Sharma; Vesa Kaihlavirta; Claus Matzinger|9781838826383\n21-01-2022|Packt Publishing|Speed Up Your Python with Rust|Maxwell Flitton|9781801812320\n25-01-2019|Packt Publishing|Hands-On Data Structures and Algorithms with Rust|Claus Matzinger|9781788991490", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|The rust language|10.1145/2663171.2663188|238|25|Nicholas D. Matsakis and Felix S. Klock|50eba68089cf51323d95631c2f59ff916848863f\n2017|RustBelt: securing the foundations of the rust programming language|10.1145/3158154|192|23|Ralf Jung and Jacques-Henri Jourdan and R. Krebbers and Derek Dreyer|6a8ceba15f95d03617e79aaba35515776c4bc4d9\n2020|Is Rust Used Safely by Software Developers?|10.1145/3377811.3380413|23|5|A. Evans and Bradford Campbell and M. Soffa|8f564873814a12526a844d69c216ba2b599bdf9a\n2020|Understanding memory and thread safety practices and issues in real-world Rust programs|10.1145/3385412.3386036|23|5|Boqin Qin and Yilun Chen and Zeming Yu and Linhai Song and Yiying Zhang|d536933053c16f6ab16f92468542084630e72f55\n2017|POSTER: Rust SGX SDK: Towards Memory Safety in Intel SGX Enclave|10.1145/3133956.3138824|21|4|Yu Ding and Ran Duan and Long Li and Yueqiang Cheng and Yulong Zhang and Tanghui Chen and Tao Wei and Huibo Wang|187e2d1c888c5c0529e5a50c8c90efe9889cbd69\n2017|Sandcrust: Automatic Sandboxing of Unsafe Components in Rust|10.1145/3144555.3144562|20|3|Benjamin Lamowski and C. Weinhold and A. Lackorzynski and Hermann Härtig|2b7bd2b93f5aa66a65d9cfc7f0222a16d3aca007\n2018|Verifying Rust Programs with SMACK|10.1007/978-3-030-01090-4_32|20|1|Marek S. Baranowski and Shaobo He and Z. Rakamaric|350795523676e071a64d8d60acd30252db2c7eec\n2021|Safe systems programming in Rust|10.1145/3418295|17|0|Ralf Jung and Jacques-Henri Jourdan and R. Krebbers and Derek Dreyer|01bd07b28877e088aefc9a54ba842b8aa3b804f5\n2018|KRust: A Formal Executable Semantics of Rust|10.1109/TASE.2018.00014|12|1|Feng Wang and Fu Song and Min Zhang and Xiaoran Zhu and Jun Zhang|dc734f8a1e20f7de5dbbe8c668c0683381bbcb1a\n2019|Exploring Rust for Unikernel Development|10.1145/3365137.3365395|12|0|Stefan Lankes and J. Breitbart and Simon Pickartz|efa6eb7b43f19f8b072f9323ac2e838618537932\n2020|Understanding and evolving the Rust programming language|10.22028/D291-31946|11|1|Ralf Jung|37d7114d5a9bc202742bd0c248fe8af1a689d1b6\n2018|Fidelius Charm: Isolating Unsafe Rust Code|10.1145/3176258.3176330|8|2|Hussain M. J. Almohri and David Evans|d72458f9501963670b50ee9fe78e622425955630\n2020|Design of a DSL for Converting Rust Programming Language into RTL|10.1007/978-3-030-39746-3_36|8|0|K. Takano and Tetsuya Oda and M. Kohata|aaf8eeb909892036436dff4bef41a0924e730d6c\n2019|Identifying Barriers to Adoption for Rust through Online Discourse|10.4230/OASIcs.PLATEAU.2018.5|7|0|Anna Zeng and Will Crichton|6f6a28a3115e147e443a545fd8f75cf7a3babf1b\n2020|Memory-Safety Challenge Considered Solved? An In-Depth Study with All Rust CVEs|10.1145/3466642|6|1|Hui Xu and Zhuangbin Chen and Mingshen Sun and Yangfan Zhou and Michael R. Lyu|164b3187c0d904f04e96ac5f0d5b9fdeab0da547\n2020|Securing UnSafe Rust Programs with XRust|10.1145/3377811.3380325|6|2|Peiming Liu and Gang Zhao and Jeff Huang|f3b75979611c111233c9cd5e6674e71be83b6f13\n2021|GhostCell: separating permissions from data in Rust|10.1145/3473597|5|1|Joshua Yanovski and Hoang-Hai Dang and Ralf Jung and Derek Dreyer|c2e188799c7bdca68f6334b329682e12b1d58da9\n2021|A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust|10.1145/3443420|5|0|David J. Pearce|fede987ed6b38a516655cc05c3ed55a19068b1a9\n2016|What can the programming language Rust do for astrophysics?|10.1017/S1743921316013168|5|0|S. Blanco-Cuaresma and É. Bolmont|4567c1f22d80334eade2ceb396d43ae8e895b131\n2017|On utilizing rust programming language for Internet of Things|10.1109/CICN.2017.8319363|4|0|Tunç Uzlu and E. Saykol|c9cb48a5680fe6911ca620897980c51a8aa5f9a6\n2019|Structured Stream Parallelism for Rust|10.1145/3355378.3355384|3|0|Ricardo Pieper and Dalvan Griebler and L. G. Fernandes|2739f9c914bb01de599f4549b0e847b10c83c3df\n2021|Keeping Safe Rust Safe with Galeed|10.1145/3485832.3485903|3|0|Elijah Rivera and Samuel Mergendahl and Howie Shrobe and H. Okhravi and N. Burow|ff3de8816bc7685668a56da5c30eecc76c817558\n2022|RustHornBelt: a semantic foundation for functional verification of Rust programs with unsafe code|10.1145/3519939.3523704|2|0|Yusuke Matsushita and Xavier Denis and Jacques-Henri Jourdan and Derek Dreyer|36674fd3bc28fd3f01711de8785171c720a97a25\n2020|Towards Profile-Guided Optimization for Safe and Efficient Parallel Stream Processing in Rust|10.1109/SBAC-PAD49847.2020.00047|2|0|Stefan Sydow and Mohannad Nabelsee and S. Glesner and Paula Herber|336759267740e25049691e8f74374721dc4718a4\n2021|Rudra: Finding Memory Safety Bugs in Rust at the Ecosystem Scale|10.1145/3477132.3483570|2|1|Yechan Bae and Youngsuk Kim and Ammar Askar and Jungwon Lim and Taesoo Kim|57b463af9a5699fb4011435cee3429f51ce86113\n2018|Detecting Unsafe Raw Pointer Dereferencing Behavior in Rust|10.1587/TRANSINF.2018EDL8040|1|0|Zhijian Huang and Y. Wang and J. Liu|0dd40638f259c5b99cab356706943ee7697c811d\n2019|Basics of Rust|10.1007/978-1-4842-5121-8_1|1|0|J. Bhattacharjee|cc5c9f522aa65cb5ddb5f2dae650a3e7a0739b03\n2019|Devise Rust Compiler Optimizations on RISC-V Architectures with SIMD Instructions|10.1145/3339186.3339193|1|0|Heng Lin and Piyo Chen and Yuan-Shin Hwang and Jenq-Kuen Lee|fcee0c1a34783b7f7253dfccae2f29af38dd3259\n2019|Verification of Safety Functions Implemented in Rust - a Symbolic Execution based approach|10.1109/INDIN41052.2019.8972014|1|0|Marcus Lindner and Nils Fitinghoff and Johan Eriksson and P. Lindgren|f17890851dcaa805c0d47cc084113626c298382b\n2022|Verifying Dynamic Trait Objects in Rust|10.1109/ICSE-SEIP55303.2022.9794041|1|0|Alexa VanHattum and Daniel Schwartz-Narbonne and Nathan Chong and Adrian Sampson|1ff44db7ee219174273efba0e4a42bf24c1807cf\n2021|SafeDrop: Detecting Memory Deallocation Bugs of Rust Programs via Static Data-Flow Analysis|10.1145/3542948|1|0|Mohan Cui and Chengjun Chen and Hui Xu and Yangfan Zhou|9d0046724361849d494d42338bbb77874dd0bdf4\n2020|VRLifeTime -- An IDE Tool to Avoid Concurrency and Memory Bugs in Rust|10.1145/3372297.3420024|1|0|Ziyi Zhang and Boqin Qin and Yilun Chen and Linhai Song and Yiying Zhang|38a0f156a77cdac95dbac2affdeb3b9e91cc531c\n2020|Approach of a Coding Conventions for Warning and Suggestion in Transpiler for Rust Convert to RTL|10.1109/GCCE50665.2020.9292032|1|0|K. Takano and Tetsuya Oda and M. Kohata|9046c775dcb9ad9e21eaece1f90537f9741acf51\n2021|Translating C to safer Rust|10.1145/3485498|1|0|Mehmet Emre and Ryan Schroeder and Kyle Dewey and B. Hardekopf|d0fb133db727fc51913e623041a6e86eb99e8c6c\n2021|Performance vs Programming Effort between Rust and C on Multicore Architectures: Case Study in N-Body|10.1109/CLEI53233.2021.9640225|1|0|Manuel Costanzo and Enzo Rucci and M. Naiouf and A. D. Giusti|74dfb86326be51d0cc2d0aee69d3266d8994ea31\n2019|On Evaluating Rust as a Programming Language for the Future of Massive Agent-Based Simulations|10.1007/978-981-15-1078-6_2|1|0|Alessia Antelmi and G. Cordasco and Matteo D'Auria and Daniele De Vinco and A. Negro and Carmine Spagnuolo|f57083b736fa347d6e48d09bdc09a308df017eeb" }, "rustscript": { "title": "RustScript", "appeared": 2021, "type": "pl", "creators": [ "Mikail Khan" ], "description": "RustScript: A simple functional based programming language with as much relation to Rust as JavaScript has to Java", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/n58lkd/rustscript_a_simple_functional_based_programming/" ], "githubRepo": { "firstCommit": 2021, "stars": 22, "forks": 3, "subscribers": 2, "created": 2021, "updated": 2022, "description": "RustScript is a functional scripting language with as much relation to Rust as Javascript has to Java.", "issues": 0, "url": "https://github.com/mkhan45/RustScript" }, "repoStats": { "firstCommit": 2021, "commits": 29, "committers": 3, "files": 5 } }, "ruth": { "title": "RUTH", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/49f2e3ceb80e805bbbecc3ca3bb341a16b5134c8" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Stirling" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1358", "wordRank": 6946, "centralPackageRepositoryCount": 0 }, "rye": { "title": "Rye", "appeared": 2019, "type": "pl", "creators": [ "Janko Metelko" ], "website": "https://ryelang.blogspot.com", "country": [ "Slovenia" ], "originCommunity": [ "https://github.com/refaktor/rye/issues" ], "githubRepo": { "stars": 26, "forks": 3, "subscribers": 5, "created": 2020, "updated": 2022, "description": "work in progress dynamic programming language", "issues": 1, "url": "https://github.com/refaktor/rye" }, "repoStats": { "firstCommit": 2019, "commits": 382, "committers": 11, "files": 411 }, "subreddit": [ { "url": "https://www.reddit.com/r/ryelang/" } ] }, "s-algol": { "title": "S-algol", "appeared": 1979, "type": "pl", "creators": [ "Ron Morrison", "Tony Davie" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of St Andrews" ], "hasLineComments": { "example": "! A comment", "value": true }, "hasComments": { "example": "! A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "!" ] ], "printToken": [ [ "write" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "wikipedia": { "example": [ "! Comments are introduced by an exclamation point and continue until end of line.\n\n! The let keyword introduces declarations of constants and variables\n! Identifiers start with an alphabetic character followed by alphanumeric characters or the full stop (.)\n! An initial value must be given, and this determines the data type of declaration\n\nlet width := 10 ! := sets the value of a variable, this is an int\nlet animal := \"dog\" ! type string\n\nlet x := -7 ; let y := x + x ! ; separates clauses, needed only if there are two or more clauses on a line\n\nlet n.a = 6.022e+23 ! = is used to set the value of a constant, this is a cfloat (constant float)\n\n! if and case can have values and be used in expressions\nlet no.of.lives := if animal = \"cat\" then 9 else 1\n\n! Sieve of Eratosthenes\nwrite \"Find primes up to n = ?\"\nlet n = readi ! constant values can be set during the program run\nlet p = vector 2::n of true ! vector of bool with bounds 2 to n\nfor i = 2 to truncate(sqrt(n)) do ! for indexes are constants so they use = rather than :=\n if p(i) do ! vector dereference uses parens like a procedure call\n for j = 2 * i to n by i do\n p(j) := false\nfor i = 2 to n do\n if p(i) do write i, \"'n\" ! 'n in a literal string is a newline\n\n! structure (record) type for a binary tree of cstrings\n! the pntr data type can point to a structure of any type, type checking is done at runtime\nstructure tree.node(cstring name ; pntr left, right)\n\n! inserts a new string into the binary tree head\nprocedure insert.tree(cpntr head ; cstring new -> pntr)\n! the case clause ends with a mandatory default option, use default : {} if it is not needed\ncase true of\n head = nil : tree.node(new, nil, nil)\n new < head(name) : { head(left) := insert.tree(head(left), new) ; head }\n new > head(name) : { head(right) := insert.tree(head(right), new) ; head }\n default : head\n\nprocedure print.tree(cpntr head)\nif head ~= nil do ! ~= is the not equals operator\nbegin\n print.tree(head(left))\n write head(name), \"'n\"\n print.tree(head(right))\nend\n\nlet fruit := nil\nfruit := insert.tree(fruit, \"banana\")\nfruit := insert.tree(fruit, \"kiwi\")\nfruit := insert.tree(fruit, \"apple\")\nfruit := insert.tree(fruit, \"peach\")\nprint.tree(fruit) ! print in sorted order\n\n! The end of the S-algol program is indicated by ?\n?" ], "related": [ "algol-60", "ps-algol", "unix", "pascal", "c", "napier88", "algol" ], "summary": "S-algol (St Andrews Algol) is a computer programming language derivative of ALGOL 60 developed at the University of St Andrews in 1979 by Ron Morrison and Tony Davie. The language is a modification of ALGOL to contain orthogonal data types that Morrison created for his PhD thesis. Morrison would go on to become professor at the university and head of the department of computer science. The S-algol language was used for teaching at the university at an undergraduate level until 1999. It was also the language taught for several years in the 1980s at a local school in St. Andrews, Madras College. The computer science text Recursive Descent Compiling describes a recursive descent compiler for S-algol, using S-algol as the implementation language. PS-algol is a persistent derivative of S-algol. It was developed around 1981 at the Universities of Edinburgh and St Andrews. It supports database capability by providing for longevity of data in the form of a persistent heap that survives termination of PS-algol programs.", "created": 2006, "backlinksCount": 17, "pageId": 4706468, "revisionCount": 75, "dailyPageViews": 9, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/S-algol" }, "leachim6": { "filepath": "s/S Algol", "example": [ "write \"Hello World\"\n?\n" ], "id": "S Algol" }, "hopl": "https://hopl.info/showlanguage.prx?exp=869", "centralPackageRepositoryCount": 0, "isbndb": "" }, "s-expressions": { "title": "S-expressions", "appeared": 1960, "type": "dataNotation", "reference": [ "https://dev-docs.kicad.org/en/components/sexpr/" ], "country": [ "United States" ], "originCommunity": [ "Massachusetts Institute of Technology" ], "related": [ "i-expressions", "bayer-expressions" ], "example": [ "(x . y)" ], "wikipedia": { "example": [ "def parse_sexp(string):\n \"\"\"\n >>> parse_sexp(\"(+ 5 (+ 3 5))\")\n [['+', '5', ['+', '3', '5']]]\n \n \"\"\"\n sexp = [[]]\n word = ''\n in_str = False\n for char in string:\n if char is '(' and not in_str:\n sexp.append([])\n elif char is ')' and not in_str:\n if word:\n sexp[-1].append(word)\n word = ''\n temp = sexp.pop()\n sexp[-1].append(temp)\n elif char in (' ', '\\n', '\\t') and not in_str:\n if word:\n sexp[-1].append(word)\n word = ''\n elif char is '\\\"':\n in_str = not in_str\n else:\n word += char\n return sexp[0]" ], "related": [ "lisp", "scheme", "c", "common-lisp", "xml", "python", "islisp", "rfc" ], "summary": "In computing, s-expressions, sexprs or sexps (for \"symbolic expression\") are a notation for nested list (tree-structured) data, invented for and popularized by the programming language Lisp, which uses them for source code as well as data. In the usual parenthesized syntax of Lisp, an s-expression is classically defined as an atom, or an expression of the form (x . y) where x and y are s-expressions. The second, recursive part of the definition represents an ordered pair so that s-exprs are effectively binary trees. The definition of an atom varies per context; in the original definition by John McCarthy, it was assumed that there existed \"an infinite set of distinguishable atomic symbols\" represented as \"strings of capital Latin letters and digits with single embedded blanks\" (i.e., character string and numeric literals). Most modern sexpr notations in addition use an abbreviated notation to represent lists in s-expressions, so that (x y z) stands for (x . (y . (z . NIL))) where NIL is the special end-of-list object (alternatively written (), which is the only representation in Scheme). In the Lisp family of programming languages, s-expressions are used to represent both source code and data. Other uses of S-expressions are in Lisp-derived languages such as DSSSL, and as mark-up in communications protocols like IMAP and John McCarthy's CBCL. The details of the syntax and supported data types vary in the different languages, but the most common feature among these languages is the use of S-expressions and prefix notation.", "pageId": 54458, "dailyPageViews": 311, "created": 2002, "backlinksCount": 101, "revisionCount": 203, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/S-expression" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/sexpression", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "s-lang": { "title": "s-lang", "appeared": 1992, "type": "pl", "creators": [ "John E. Davis" ], "description": "S-Lang is an interpreted language that was designed from the start to be easily embedded into a program to provide it with a powerful extension language. Examples of programs that use S-Lang as an extension language include the jed text editor and the slrn newsreader. Although S-Lang does not exist as a separate application, it is distributed with a quite capable program called slsh (``slang-shell'') that embeds the interpreter and allows one to execute S-Lang scripts, or simply experiment with S-Lang at an interactive prompt. Many of the the examples in this document are presented in the context of one of the above applications. S-Lang was originally a stack language that supported a postscript-like syntax. For that reason, I named it S-Lang, where the S was supposed to emphasize its stack-based nature. About a year later, I began to work on a preparser that would allow one unfamiliar with stack based languages to make use of a more traditional infix syntax. Currently, the syntax of the language resembles C, nevertheless some postscript-like features still remain, e.g., the `%' character is still used as a comment delimiter.", "website": "http://www.jedsoft.org/slang/doc/html/slang.html", "country": [ "United States" ], "originCommunity": [ "https://www.jedsoft.org/slang/mailinglists.html" ], "example": [ "define init_array (a)\n{\n variable i, imax;\n\n imax = length (a);\n for (i = 0; i < imax; i++)\n {\n a[i] = 7;\n }\n}\n\nvariable A = Int_Type [10];\ninit_array (A);" ] }, "s-plus": { "title": "S-PLUS", "appeared": 1988, "type": "pl", "country": [ "United States" ], "originCommunity": [ "TIBCO Software Inc" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "related": [ "unix", "linux", "s", "excel-app", "spss", "solaris", "eclipse-editor", "r" ], "summary": "S-PLUS is a commercial implementation of the S programming language sold by TIBCO Software Inc.. It features object-oriented programming capabilities and advanced analytical algorithms.", "pageId": 3830007, "dailyPageViews": 74, "created": 2006, "backlinksCount": 133, "revisionCount": 81, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/S-PLUS" }, "helloWorldCollection": [ "# Hello World for S-Plus\ncat(\"Hello world\\n\")\n" ], "tiobe": { "id": "S-PLUS" }, "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "s-sl": { "title": "S/SL", "appeared": 1980, "type": "pl", "country": [ "Canada" ], "originCommunity": [ "University of Toronto" ], "wikipedia": { "related": [ "yacc", "pl-i", "euclid", "turing", "ada", "cobol" ], "summary": "The Syntax/Semantic Language (S/SL) is an executable high level specification language for recursive descent parsers, semantic analyzers and code generators developed by James Cordy, Ric Holt and David Wortman at the University of Toronto in 1980.S/SL is a small programming language that supports cheap recursion and defines input, output, and error token names (& values), semantic mechanisms (class interfaces whose methods are really escapes to routines in a host programming language but allow good abstraction in the pseudocode) and a pseudocode program that defines the syntax of the input language by the token stream the program accepts. Alternation, control flow and one-symbol look-ahead constructs are part of the language. The S/SL processor compiles this pseudocode into a table (byte-codes) that is interpreted by the S/SL table-walker (interpreter). The pseudocode language processes the input language in LL(1) recursive descent style but extensions allow it to process any LR(k) language relatively easily. S/SL is designed to provide excellent syntax error recovery and repair. It is more powerful and transparent than Yacc but can be slower. S/SL's \"semantic mechanisms\" extend its capabilities to all phases of compiling, and it has been used to implement all phases of compilation, including scanners, parsers, semantic analyzers, code generators and virtual machine interpreters in multi-pass language processors.S/SL has been used to implement production commercial compilers for languages such as PL/I, Euclid, Turing, Ada, and COBOL, as well as interpreters, command processors, and domain specific languages of many kinds. It is the primary technology used in IBM's ILE/400 COBOL compiler, and the ZMailer mail transfer agent uses S/SL for defining both its mail router processing language and its RFC 822 email address validation.", "pageId": 485828, "created": 2004, "backlinksCount": 21, "revisionCount": 35, "dailyPageViews": 13, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/S/SL_programming_language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1017", "fileType": "text", "centralPackageRepositoryCount": 0 }, "s-snobol": { "title": "S-Snobol", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1ce78a711bc09611ce51b9dbcbc586a018115f09" ], "country": [ "Scotland" ], "originCommunity": [ "Heriot-Watt Un1versity" ], "supersetOf": [ "snobol4" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4041", "centralPackageRepositoryCount": 0, "isbndb": "" }, "s": { "title": "S", "appeared": 1976, "type": "pl", "website": "http://ect.bell-labs.com/sl/S/", "country": [ "United States" ], "originCommunity": [ "Bell Laboratories" ], "hasHexadecimals": { "example": "", "value": true }, "wikipedia": { "related": [ "r", "s-plus", "c", "apl", "polymorphic-programming-language", "fortran", "unix", "postscript" ], "summary": "S is a statistical programming language developed primarily by John Chambers and (in earlier versions) Rick Becker and Allan Wilks of Bell Laboratories. The aim of the language, as expressed by John Chambers, is \"to turn ideas into software, quickly and faithfully\". The modern implementations of S is R, a part of the GNU free software project. S-PLUS, a commercial product, was formally sold by TIBCO Software.", "pageId": 919313, "dailyPageViews": 281, "created": 2004, "backlinksCount": 82, "revisionCount": 164, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/S_(programming_language)" }, "pygmentsHighlighter": { "filename": "r.py", "fileExtensions": [ "S", "R", ".Rhistory", ".Rprofile", ".Renviron" ], "id": "S" }, "tiobe": { "id": "S" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1117", "fileType": "text", "wordRank": 90, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2002|Springer|Modern Applied Statistics with S (Statistics and Computing)|W. N. Venables and B. D. Ripley|9780387954578\n2011|Springer|S Programming (Statistics and Computing)|Venables, William and Ripley, B.D.|9781441931900\n1988|Chapman & Hall|The New s Language: A Programming Environment for Data Analysis and Graphics (Wadsworth & Brooks/Cole computer science series)|Becker, Richard A. and Chambers, John M. and Wilks, Allan R.|9780534091927", "semanticScholar": "" }, "s2": { "title": "System 2", "appeared": 2008, "type": "pl", "website": "http://www.livejournal.com/doc/s2", "standsFor": "System 2", "country": [ "United States" ], "originCommunity": [ "Danga Interactive" ], "wikipedia": { "related": [ "perl", "http" ], "summary": "S2 (Style System 2) is an object-oriented programming language developed in the late 1990s by Brad Fitzpatrick, Martin \"Mart\" Atkins, and others for the online journaling service LiveJournal in order to allow users full control over the appearance of their pages. S2 source code is compiled into Perl, which the webserver can then execute directly for individual web page requests. The S2 system is, at its heart, completely general and can be used for almost any web application; however there exists no documentation for the implementation of S2 within other applications, which ties it relatively closely to LiveJournal. This article will make use of LiveJournal's implementation of S2 for examples. A link to detailed documentation about this implementation can be found at the bottom.", "pageId": 439466, "created": 2004, "backlinksCount": 13, "revisionCount": 45, "dailyPageViews": 5, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/S2_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "s3": { "title": "S3", "appeared": 1986, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "International Computers Limited" ], "hasComments": { "example": "@ a comment @", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "wikipedia": { "example": [ "GLOBAL STATIC () PROC KERMIT_THE_FROG IS\n (() REF()BYTE OPTION,\n () REF()BYTE VME_FILE,\n () REF()BYTE REM_FILE,\n () RESPONSE RESULT):\n \n BEGIN\n \n ()BYTE JSV_NAME := \"ASG\"; @ obtain value for ASG_ROUTE bool @\n CTM_JS_READ(JSV_NAME,NIL,NIL,ASG_ROUTE,RC_IGNORED);\n IF RC_IGNORED NE 0 THEN ASG_ROUTE := FALSE FI;\n \n @ verify parameter references (parameter values validated later): @\n @ OPTION must be of mode REF () BYTE, may not be ZLR or NIL @\n @ VME_FILE must be of mode REF () BYTE, may be ZLR, must not be NIL @\n @ REM_FILE must be of mode REF () BYTE, may be ZLR, must not be NIL @\n \n UNLESS (VERIFY OPTION AND VALIDR OPTION)\n AND (VERIFY VME_FILE AND (VALIDR VME_FILE OR NOT(VME_FILE IS NIL)))\n AND (VERIFY REM_FILE AND (VALIDR REM_FILE OR NOT(REM_FILE IS NIL)))\n THEN @ invalid parameter reference @\n RESULT := 10002 @ ARCH_INACCESSIBLE_PARAMETER @\n \n ELSF @ create resource block @\n CTM_JS_BEGIN(RESULT);\n RESULT <= 0\n THEN @ resource block created @\n LONG LONG WORD KERMIT_RESULT;\n ANY((3)LONG WORD AS_LW,(6) WORD AS_W) PARAMS;\n PARAMS.AS_LW := (BDESC OPTION,BDESC VME_FILE,BDESC REM_FILE);\n \n @ set up program error handler @\n IF KMT_EH_INFORM_PE_CONTINGENCY(RESULT);\n RESULT > 0\n THEN @ failed to set error handler @\n SKIP\n ELSF CTM_JS_CALL(NIL,PDESC KERMIT_SUPPORT,PARAMS.AS_W,KERMIT_RESULT,\n RESULT); @ create firewall @\n RESULT <= 0\n THEN @ either exited normally or via CTM_STOP @\n RESULT := IF (S'S'KERMIT_RESULT) <= 0\n THEN 0 @ ignore warnings @\n ELSE 52000 @ error return common resultcode @\n FI\n FI;\n \n CTM_JS_END(RC_IGNORED) @ end resource block @\n FI\n \n END" ], "related": [ "algol-68" ], "summary": "S3 is a structured, imperative high-level computer programming language. It was developed by the UK company International Computers Limited (ICL) for its 2900 Series mainframes. It is a system programming language with syntax influenced by ALGOL 68 but with data types and operators aligned to those offered by the 2900 Series. It was the implementation language of the operating system VME.", "pageId": 11484588, "created": 2007, "backlinksCount": 33, "revisionCount": 30, "dailyPageViews": 8, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/S3_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2462", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "sa-c-programming-language": { "title": "SA-C", "appeared": 1998, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Colorado State University and University of California,Riverside" ], "wikipedia": { "related": [ "sac-programming-language" ], "summary": "Single Assignment C (SA-C) (pronounced \"sassy\") is a member of the C programming language family designed to be directly and intuitively translatable into circuits, including FPGAs. To ease translation, SA-C does not include pointers and arithmetics thereon. To retain most of the expressiveness of C, SA-C instead features true n-dimensional arrays as first-class objects of the language.", "created": 2007, "backlinksCount": 6, "pageId": 8787221, "revisionCount": 15, "dailyPageViews": 7, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/SA-C_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3572", "centralPackageRepositoryCount": 0 }, "sa": { "title": "SA", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/609bace390ed9ec85c01605a04c135fd10896794" ], "country": [ "United States" ], "originCommunity": [ "SofTech, Inc." ], "hopl": "https://hopl.info/showlanguage.prx?exp=6661", "wordRank": 2195, "centralPackageRepositoryCount": 0 }, "saal": { "title": "SAAL", "appeared": 1966, "type": "assembly", "reference": [ "http://bitsavers.org/pdf/univac/1005/Univac_1005_Extended_System_Programmers_Reference_Manual_Apr68.pdf" ], "standsFor": "Single Address Assembly Language", "country": [ "United States" ], "originCommunity": [ "Sperry Rand Corporation" ], "hopl": "https://hopl.info/showlanguage.prx?exp=274" }, "sac-1": { "title": "SAC-1", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ee0f987db1371918e737d19aab3b5e8d100d518f" ], "country": [ "United States" ], "originCommunity": [ "The University of Wisconsin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=564", "centralPackageRepositoryCount": 0 }, "sac-2": { "title": "SAC-2", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/839a84441e677e36f98211b6d24532145ff9cb19" ], "country": [ "United States" ], "originCommunity": [ "University of Wisconsin-Madison" ], "hopl": "https://hopl.info/showlanguage.prx?exp=465", "centralPackageRepositoryCount": 0 }, "sac-programming-language": { "title": "SAC", "appeared": 1994, "type": "pl", "creators": [ "Sven-Bodo Scholz", "Clemens Grelck" ], "website": "https://www.sac-home.org/index", "country": [ "Germany" ], "originCommunity": [ "University of Kiel" ], "wikipedia": { "related": [ "sisal", "c", "haskell", "nesl", "nial", "fortran" ], "summary": "SAC (Single Assignment C) is a strict purely functional programming language whose design is focused on the needs of numerical applications. Emphasis is laid on efficient support for array processing. Efficiency concerns are essentially twofold. On the one hand, efficiency in program development is to be improved by the opportunity to specify array operations on a high level of abstraction. On the other hand, efficiency in program execution, i.e. the runtime performance of programs, in time and memory consumption, is still to be achieved by sophisticated compilation schemes. Only as far as the latter succeeds, the high-level style of specifications can actually be called useful. To facilitate compiling to efficiently executable code, certain functional language features which are not considered essential for numerical applications, e.g. higher-order functions, polymorphism, or lazy evaluation, are not (yet) supported by SAC. These may be found in general-purpose functional languages, e.g. Haskell, Clean, Miranda, or ML. To overcome the acceptance problems encountered by other functional or array based languages intended for numerical / array intensive applications, e.g. SISAL, NESL, Nial, APL, J, or K, particular regard is paid to ease the transition from a C / Fortran like programming environment to SAC. In more detail, the basic language design goals of SAC are to: provide a purely functional language with a syntax very similar to that of C in order to ease, for a large community of programmers, the transition from an imperative to a functional programming style; support multi-dimensional arrays as first class objects; allow the specification of shape- and dimension-invariant array operations; provide high-level array operations that liberate programming from tedious and error-prone specifications of starts, stops and strides for array traversals thereby improving code reusability and programming productivity, in general. incorporate a module system that allows for separate compilation, separate name spaces, and abstract data types, and, additionally, provides an interface to foreign languages in order to enable reuse of existing code; provide means for a smooth integration of states and state modifications into the functional paradigm based on uniqueness types; use the module system, the foreign language interface, and the integration of states in order to create a standard library which provides a functionality similar to that of the standard C libraries, e.g. powerful I/O facilities or mathematical functions; facilitate the compilation to host machine code which can be efficiently executed both in terms of time and space demand; facilitate the compilation for non-sequential program execution in multiprocessor environments.", "created": 2005, "backlinksCount": 11, "pageId": 2179985, "revisionCount": 32, "dailyPageViews": 11, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/SAC_programming_language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4989", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "safari": { "title": "Safari", "appeared": 2003, "type": "webBrowser", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Safari_(web_browser)" } }, "sagemath": { "title": "Sage", "appeared": 2005, "type": "pl", "website": "http://www.sagemath.org/", "documentation": [ "https://doc.sagemath.org/html/en/index.html" ], "aka": [ "Sage" ], "country": [ "United States" ], "originCommunity": [ "University of Washington" ], "domainName": { "registered": 2007, "awisRank": { "2022": 169903 }, "name": "sagemath.org" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "wikipedia": { "example": [ "sage: E2 = EllipticCurve(CC, [0,0,-2,1,1])\nsage: E2\nElliptic Curve defined by y^2 + (-2.00000000000000)*y = \n x^3 + 1.00000000000000*x + 1.00000000000000 over \n Complex Field with 53 bits of precision\nsage: E2.j_invariant()\n61.7142857142857" ], "related": [ "python", "cython", "linux", "solaris", "android", "ios", "ia-32", "arm", "sparc", "maple", "mathematica", "matlab", "maxima", "scipy", "numpy", "r", "latex", "sql", "fortran", "c", "common-lisp", "pari-gp", "sqlite", "matplotlib" ], "summary": "SageMath (previously Sage or SAGE, \"System for Algebra and Geometry Experimentation\") is a mathematical software with features covering many aspects of mathematics, including algebra, combinatorics, numerical mathematics, number theory, and calculus. The first version of SageMath was released on 24 February 2005 as free and open-source software under the terms of the GNU General Public License version 2, with the initial goals of creating an \"open source alternative to Magma, Maple, Mathematica, and MATLAB\". The originator and leader of the SageMath project, William Stein, is a mathematician at the University of Washington. SageMath uses a syntax resembling Python's supporting procedural, functional and object-oriented constructs.", "pageId": 4012438, "dailyPageViews": 179, "created": 2006, "backlinksCount": 269, "revisionCount": 846, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/SageMath" }, "githubLanguage": { "fileExtensions": [ "sage", "sagews" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "python", "codemirrorMode": "python", "codemirrorMimeType": "text/x-python", "tmScope": "source.python", "repos": 499, "id": "Sage" }, "githubBigQuery": { "repos": 84, "users": 83, "id": "Sage" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 13, "commitCount": 415, "sampleCount": 1, "example": [ "# -*- coding: utf-8 -*-\n#\n# Funciones en Python/Sage para el trabajo con polinomios con una\n# incógnita (x).\n#\n# Copyright (C) 2014-2015, David Abián \n#\n# This program is free software: you can redistribute it and/or modify it\n# under the terms of the GNU General Public License as published by the Free\n# Software Foundation, either version 3 of the License, or (at your option)\n# any later version.\n#\n# This program is distributed in the hope that it will be useful, but WITHOUT\n# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for\n# more details.\n#\n# You should have received a copy of the GNU General Public License along with\n# this program. If not, see .\n\ndef pols (grado=-1, K=GF(2), mostrar=False):\n \"\"\"Devuelve la lista de polinomios constantes y no constantes de\n coeficientes mónicos y grado igual o menor que el especificado.\n Si el grado indicado no es válido, devuelve una lista vacía.\n \"\"\"\n lpols = []\n if not grado.is_integer():\n grado = grado.round()\n if grado >= 0:\n var('x')\n xs = vector([(x^i) for i in range(grado+1)])\n V = VectorSpace(K,grado+1)\n lpols = [cs*xs for cs in V]\n if mostrar:\n for pol in lpols:\n print pol\n return lpols\n\ndef polsNoCtes (grado=-1, K=GF(2), mostrar=False):\n \"\"\"Devuelve la lista de polinomios no constantes de coeficientes mónicos y\n grado igual o menor que el especificado.\n Si el grado indicado no es válido, devuelve una lista vacía.\n \"\"\"\n lpols = []\n if not grado.is_integer():\n grado = grado.round()\n if grado >= 0:\n var('x')\n xs = vector([(x^i) for i in range(grado+1)])\n for cs in K^(grado+1):\n if cs[:grado] != vector(grado*[0]): # no constantes\n lpols += [cs*xs]\n if mostrar:\n for pol in lpols:\n print pol\n return lpols\n\ndef polsMismoGrado (grado=-1, K=GF(2), mostrar=False):\n \"\"\"Devuelve la lista de polinomios de coeficientes mónicos del grado\n especificado.\n Si el grado indicado no es válido, devuelve una lista vacía.\n \"\"\"\n lpols = []\n if not grado.is_integer():\n grado = grado.round()\n if grado >= 0:\n var('x')\n xs = vector([(x^(grado-i)) for i in [0..grado]])\n for cs in K^(grado+1):\n if cs[0] != 0: # polinomios del mismo grado\n lpols += [cs*xs]\n if mostrar:\n for pol in lpols:\n print pol\n return lpols\n\ndef excluirReducibles (lpols=[], mostrar=False):\n \"\"\"Filtra una lista dada de polinomios de coeficientes mónicos y devuelve\n aquellos irreducibles.\n \"\"\"\n var('x')\n irreds = []\n for p in lpols:\n fp = (p.factor_list())\n if len(fp) == 1 and fp[0][1] == 1:\n irreds += [p]\n if mostrar:\n for pol in irreds:\n print pol\n return irreds\n\ndef vecPol (vec=random_vector(GF(2),0)):\n \"\"\"Transforma los coeficientes dados en forma de vector en el polinomio\n que representan.\n \n Por ejemplo, con vecPol(vector([1,0,3,1])) se obtiene x³ + 3*x + 1.\n \n Para la función opuesta, véase polVec().\n \"\"\"\n var('x')\n xs = vector([x^(len(vec)-1-i) for i in range(len(vec))])\n return vec*xs\n\ndef polVec (p=None):\n \"\"\"Devuelve el vector de coeficientes del polinomio dado que acompañan a la\n incógnita x, de mayor a menor grado.\n \n Por ejemplo, con polVec(x^3 + 3*x + 1) se obtiene el vector (1, 0, 3, 1).\n \n Para la función opuesta, véase vecPol().\n \"\"\"\n cs = []\n if p != None:\n var('x')\n p(x) = p\n for i in [0..p(x).degree(x)]:\n cs.append(p(x).coefficient(x,i))\n cs = list(reversed(cs))\n return vector(cs)\n\ndef completar2 (p=0):\n \"\"\"Aplica el método de completar cuadrados en parábolas al polinomio dado de\n grado 2 y lo devuelve en su nueva forma.\n \n Si el polinomio dado no es válido, devuelve 0.\n \n Por ejemplo, con complCuad(3*x^2 + 12*x + 5) se obtiene 3*(x + 2)^2 - 7.\n \"\"\"\n var('x')\n p(x) = p.expand()\n if p(x).degree(x) != 2:\n p(x) = 0\n else:\n cs = polVec(p(x))\n p(x) = cs[0]*(x+(cs[1]/(2*cs[0])))^2+(4*cs[0]*cs[2]-cs[1]^2)/(4*cs[0])\n return p(x)\n" ], "url": "https://github.com/MagicStack/MagicPython" }, "projectEuler": { "memberCount": { "2019": 268, "2022": 312 }, "id": "Sage" }, "rijuRepl": { "example": [ "print(\"Hello, world!\")" ], "id": "https://riju.codes/sagemath" }, "faqPageUrl": [ "https://doc.sagemath.org/html/en/faq/faq-general.html" ], "downloadPageUrl": [ "https://www.sagemath.org/download.html" ], "twitter": "https://twitter.com/sagemath", "jupyterKernel": [ "http://www.sagemath.org/" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|American Mathematical Society|Sage for Undergraduates|Gregory V. Bard|9781470411114\n2015|Springer|Numerical Analysis Using Sage (Springer Undergraduate Texts in Mathematics and Technology)|Anastassiou, George A. and Mezei, Razvan A.|9783319167381", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|An Introduction to SAGE Programming|10.1002/9781119122869|8|2|Razvan A. Mezei|7e49bd271024001874d589cadd75a1288a5b1b56\n2015|Numerical Analysis Using Sage|10.1007/978-3-319-16739-8|2|0|G. Anastassiou and Razvan A. Mezei|0377a3a4f43c1bacbb6c4b95fc03275b1ee5c7ee" }, "sako": { "title": "System Automatycznego Kodowania Operacji", "appeared": 1960, "type": "pl", "reference": [ "https://historiainformatyki.pl/skan.php?doc_id=1489&type=pdf&for_download=1" ], "standsFor": "System Automatycznego Kodowania Operacji", "country": [ "Poland" ], "nativeLanguage": "Polish", "originCommunity": [ "Polish Academy of Sciences" ], "wikipedia": { "example": [ "K) PROGRAM DRUKUJE NAPIS HELLO WORLD\n LINIA\n TEKST:\n HELLO WORLD\n KONIEC" ], "summary": "SAKO (PL: System Automatycznego Kodowania Operacji - EN: Automatic Operation Encoding System) is a non-English-based programming language written for Polish computers XYZ, ZAM-2, ZAM-21 and ZAM-41.", "dailyPageViews": 4, "pageId": 38814216, "created": 2013, "backlinksCount": 4, "revisionCount": 12, "appeared": 1961, "url": "https://en.wikipedia.org/wiki/SAKO_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2178", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "sale": { "title": "SALE", "appeared": 1959, "type": "pl", "reference": [ "https://semanticscholar.org/paper/23dd92b1314f2a96a9e371f022a589d4a8b2593f" ], "hopl": "https://hopl.info/showlanguage.prx?exp=900", "wordRank": 425, "centralPackageRepositoryCount": 0 }, "salem": { "title": "SALEM", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4367a84671ef61fd70453cc75a8e4cecca266e6e" ], "country": [ "United States" ], "originCommunity": [ "Lehigh University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=347", "wordRank": 6293, "centralPackageRepositoryCount": 0 }, "salsa": { "title": "Simple Actor Language System and Architecture", "appeared": 2001, "type": "pl", "website": "http://wcl.cs.rpi.edu/salsa/", "standsFor": "Simple Actor Language System and Architecture", "country": [ "United States" ], "originCommunity": [ "Rensselaer Polytechnic Institute and University of Illinois at Urbana-Champaign" ], "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "wikipedia": { "example": [ "module demo;\n\n \n/*\n This behavior simply prints out a string,\n reads a line from the Standard Input,\n combines the return value of the Standard Input with other strings,\n and then prints out the combined string.\n*/\n\nbehavior StandardInputTest{\n\n public StandardInputTest() {}\n\n String mergeString(String str1, String str2, String str3) {\n return str1+str2+str3;\n }\n\n void act(String[] args) {\n standardOutput<-println(\"What's your name?\")@\n standardInput<-readLine()@\n self<-mergeString(\"Hi, \",token, \". Nice to meet you!\" )@\n standardOutput<-println(token);\n }\n}" ], "related": [ "java" ], "summary": "The SALSA programming language (Simple Actor Language System and Architecture) is an actor-oriented programming language that uses concurrency primitives beyond asynchronous message passing, including token-passing, join, and first-class continuations. It also supports distributed computing over the Internet with universal naming, remote communication, and migration linguistic abstractions and associated middleware. For portability, it produces Java code.", "pageId": 2344513, "dailyPageViews": 14, "created": 2005, "backlinksCount": 11, "revisionCount": 16, "appeared": 2001, "fileExtensions": [ "salsa" ], "url": "https://en.wikipedia.org/wiki/SALSA_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "saltstack": { "title": "SaltStack", "appeared": 2011, "type": "pl", "creators": [ "Thomas S Hatch" ], "website": "https://repo.saltstack.com/", "country": [ "United States" ], "originCommunity": [ "https://github.com/saltstack" ], "domainName": { "name": "repo.saltstack.com" }, "githubRepo": { "firstCommit": 2011, "stars": 12572, "forks": 5315, "subscribers": 553, "created": 2011, "updated": 2022, "description": "Software to automate the management and configuration of any infrastructure or application at scale. Get access to the Salt software package repository here: ", "issues": 2964, "url": "https://github.com/saltstack/salt" }, "repoStats": { "firstCommit": 2011, "commits": 128810, "committers": 4025, "files": 6539 }, "githubLanguage": { "fileExtensions": [ "sls" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "yaml", "codemirrorMode": "yaml", "codemirrorMimeType": "text/x-yaml", "tmScope": "source.yaml.salt", "aliases": [ "saltstate", "salt" ], "repos": 4398, "id": "SaltStack" }, "githubBigQuery": { "repos": 1680, "users": 1413, "id": "SaltStack" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2015, "committerCount": 6, "commitCount": 25, "sampleCount": 6, "example": [ "base:\n '*':\n - packages\n - coffeestats" ], "url": "https://github.com/saltstack/atom-salt" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2016|Packt Publishing|Mastering SaltStack - Second Edition|Hall, Joseph|9781786467027", "semanticScholar": "" }, "sam-coupe": { "title": "Sam Coupé", "appeared": 1989, "type": "pl", "country": [ "United Kingdom" ], "originCommunity": [ "Miles Gordon Technology" ], "wikipedia": { "related": [ "basic", "beta-basic", "fat", "linux", "unix" ], "summary": "The SAM Coupé (pronounced /sæm ku:peɪ/ from its original British English branding) is an 8-bit British home computer that was first released in late 1989. It is commonly considered a clone of the Sinclair ZX Spectrum computer, since it features a compatible screen mode and emulated compatibility, and it was marketed as a logical upgrade from the Spectrum. It was originally manufactured by Miles Gordon Technology (MGT), based in Swansea in the United Kingdom.", "created": 2003, "backlinksCount": 150, "pageId": 252218, "revisionCount": 491, "dailyPageViews": 42, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/SAM_Coup%C3%A9" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "sam-format": { "title": "SAM file format", "appeared": 2009, "type": "textDataFormat", "reference": [ "https://dash.harvard.edu/bitstream/handle/1/10246875/2723002.pdf?sequence=1" ], "country": [ "United Kingdom and United States and China" ], "originCommunity": [ "Wellcome Trust Sanger Institute and Broad Institute of MIT and Harvard and University of California Los Angeles and Boston College and University of Michigan and Chinese Academy of Science" ], "wikipedia": { "related": [ "tsv", "bam-format", "fastq-format" ], "summary": "Sequence Alignment Map (SAM) is a text-based format for storing biological sequences aligned to a reference sequence developed by Heng Li and Bob Handsaker et al. It is widely used for storing data, such as nucleotide sequences, generated by next generation sequencing technologies. The format supports short and long reads (up to 128Mbp) produced by different sequencing platforms and is used to hold mapped data within the Genome Analysis Toolkit (GATK) and across the Broad Institute, the Wellcome Sanger Institute, and throughout the 1000 Genomes Project. Sequence Alignment/Map (SAM) format for alignment of nucleotide sequences (e.g. sequencing reads) to (a) reference sequence(s). May contain base-call and alignment qualities and other data.", "pageId": 49906854, "created": 2016, "backlinksCount": 18, "revisionCount": 31, "dailyPageViews": 167, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/SAM_(file_format)" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "sam76": { "title": "SAM76", "appeared": 1970, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Western Electric Laboratories" ], "wikipedia": { "related": [ "forth", "c", "unix", "linux", "basic", "pascal", "lisp", "logo", "trac" ], "summary": "SAM76 is a macro programming language used from the late 1970s to the present 2007 initially ran on CP/M. The SAM76 language is a list and string processor designed for interactive and user-directed applications, including artificial intelligence programming, and permits high portability from machine to machine. The language shares certain features in common with LISP, Forth, and shell programming languages of the UNIX operating system. Claude A. R. Kagan, the language's developer, sought to combine within a single interpretive processor, the characteristics of two different string and general-purpose macro generators and the provisions to embed multiple infix operator mathematical systems. SAM76 was designed to: be very pure syntactically and semantically; require a minimum of user keyboarding to achieve powerful results; fit in a very small computer system; permit editing, testing, and executing modules interactively; not prevent the user from doing strange things with the syntax of the language yielding, however, predictable results. The language was based around the idea of programming with macros. A user will define a macro (a code word that can be defined by the user to invoke a specific set of instructions to perform a routine within the program) to execute a set of instructions, usually in either machine or assembly language, and use the macro in the program. In this way, a user need only define a routine once and then when that particular operation, or string is required, the user can substitute is with the macro name. Since then the language has been rewritten in C and compiles on Windows, Unix, Linux, and similar operating systems. The source code is available online and still compiles and runs as of 2006.", "pageId": 3879739, "dailyPageViews": 5, "created": 2006, "backlinksCount": 21, "revisionCount": 57, "appeared": 1970, "url": "https://web.archive.org/web/20160203211054/https://en.wikipedia.org/wiki/SAM76" }, "hopl": "https://hopl.info/showlanguage.prx?exp=781", "fileType": "text", "centralPackageRepositoryCount": 0 }, "saml": { "title": "Security Assertion Markup Language", "appeared": 2001, "type": "xmlFormat", "standsFor": "Security Assertion Markup Language", "country": [ "United States" ], "originCommunity": [ "Organization for the Advancement of Structured Information Standards" ], "example": [ "\n ..\n" ], "wikipedia": { "summary": "Security Assertion Markup Language (SAML, pronounced sam-el) is an open standard for exchanging authentication and authorization data between parties, in particular, between an identity provider and a service provider. As its name implies, SAML is an XML-based markup language for security assertions (statements that service providers use to make access-control decisions). SAML is also: A set of XML-based protocol messages A set of protocol message bindings A set of profiles (utilizing all of the above)The single most important use case that SAML addresses is web browser single sign-on (SSO). Single sign-on is relatively easy to accomplish within a security domain (using cookies, for example) but extending SSO across security domains is more difficult and resulted in the proliferation of non-interoperable proprietary technologies. The SAML Web Browser SSO profile was specified and standardized to promote interoperability. (For comparison, the more recent OpenID Connect protocol is an alternative approach to web browser SSO.)", "backlinksCount": 126, "pageId": 973888, "dailyPageViews": 1058, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Security_Assertion_Markup_Language" } }, "sampletalk": { "title": "Sampletalk", "appeared": 1991, "type": "pl", "reference": [ "https://sampletalk.github.io", "https://www.researchgate.net/publication/228631878_Knowledge_representation_via_verbal_description_generalization_alternative_programming_in_sampletalk_language" ], "country": [ "Unknown" ], "originCommunity": [ "https://github.com/sampletalk" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2941", "centralPackageRepositoryCount": 0 }, "saol": { "title": "SAOL", "appeared": 1999, "type": "pl", "description": "The MPEG-4 Structured Audio Orchestra Language", "reference": [ "https://dl.acm.org/citation.cfm?id=1116129" ], "standsFor": "Structured Audio Orchestra Language", "country": [ "Switzerland and United Kingdom" ], "originCommunity": [ "Moving Picture Experts Group" ], "wikipedia": { "related": [ "csound" ], "summary": "Structured Audio Orchestra Language (SAOL) is an imperative, MUSIC-N programming language designed for describing virtual instruments, processing digital audio, and applying sound effects. It was published as subpart 5 of MPEG-4 Part 3 (ISO/IEC 14496-3:1999) in 1999.As part of the MPEG-4 international standard, SAOL is one of the key components of the MPEG-4 Structured Audio toolset, along with: Structured Audio Score Language (SASL) Structured Audio Sample Bank Format (SASBF) The MPEG-4 SA scheduler MIDI support", "created": 2006, "backlinksCount": 11, "pageId": 8684340, "revisionCount": 17, "dailyPageViews": 6, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Structured_Audio_Orchestra_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6450", "centralPackageRepositoryCount": 0 }, "sap-hana": { "title": "SAP HANA", "appeared": 2010, "type": "database", "description": "In-memory relational database management system (RDBMS)", "country": [ "Germany" ], "originCommunity": [ "SAP SE" ] }, "sapphire": { "title": "Sapphire", "appeared": 1995, "type": "pl", "reference": [ "https://ibiblio.org/pub/linux/apps/sound/editors/sapphire.lsm", "http://wiki.c2.com/?SapphireLanguage", "https://web.archive.org/web/20060925114845/http://smallwiki.unibe.ch/sapphire", "https://timthompson.com/plum/cgi/showlist.cgi?oneid=97" ], "country": [ "Unknown" ], "originCommunity": [ "elf.dircon.co.uk" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6451", "wordRank": 9170, "centralPackageRepositoryCount": 0 }, "sarl": { "title": "SARL", "appeared": 2013, "type": "pl", "website": "http://www.sarl.io", "country": [ "Australia and France" ], "originCommunity": [ "https://github.com/sarl" ], "domainName": { "registered": 2013, "name": "sarl.io" }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "sarl" ], "id": "SARL" }, "isbndb": "" }, "sartex": { "title": "SARTEX", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/f312288e4d29468101dd9c2f42c6497e1f061d38" ], "country": [ "Switzerland" ], "originCommunity": [ "Swiss Federal Institute of Technology" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2861", "centralPackageRepositoryCount": 0 }, "sas": { "title": "SAS", "appeared": 1976, "type": "pl", "creators": [ "Anthony James Barr" ], "website": "https://www.sas.com", "documentation": [ "https://support.sas.com/en/documentation.html" ], "standsFor": "Statistical Analysis System", "country": [ "United States" ], "originCommunity": [ "North Carolina State University" ], "domainName": { "registered": 1990, "awisRank": { "2022": 8630 }, "name": "sas.com" }, "hasComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasLineComments": { "example": "* A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "lineCommentToken": [ [ "*" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "wikipedia": { "related": [ "html", "linux" ], "summary": "The SAS language is a computer programming language used for statistical analysis, created by Anthony James Barr at North Carolina State University. It can read in data from common spreadsheets and databases and output the results of statistical analyses in tables, graphs, and as RTF, HTML and PDF documents. The SAS language runs under compilers that can be used on Microsoft Windows, Linux, and various other UNIX and mainframe computers. The SAS System and World Programming System (WPS) are SAS language compilers.", "pageId": 19060492, "dailyPageViews": 151, "created": 2008, "backlinksCount": 50, "revisionCount": 92, "appeared": 1976, "url": "https://en.wikipedia.org/wiki/SAS_language" }, "githubLanguage": { "fileExtensions": [ "sas" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "sas", "codemirrorMimeType": "text/x-sas", "tmScope": "source.sas", "repos": 8407, "id": "SAS" }, "githubBigQuery": { "repos": 1350, "users": 1240, "id": "SAS" }, "pygmentsHighlighter": { "filename": "sas.py", "fileExtensions": [ "SAS", "sas" ], "id": "SAS" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2018, "committerCount": 14, "commitCount": 142, "sampleCount": 3, "example": [ "/* Example DATA step code for linguist */\n\nlibname source 'C:\\path\\to\\file'\n\ndata work.working_copy;\n\tset source.original_file.sas7bdat;\nrun;\n\ndata work.working_copy;\n\tset work.working_copy;\n\tif Purge = 1 then delete;\nrun;\n\ndata work.working_copy;\n\tset work.working_copy;\n\tif ImportantVariable = . then MissingFlag = 1;\nrun;" ], "url": "https://github.com/rpardee/sas.tmbundle" }, "projectEuler": { "memberCount": { "2019": 49, "2022": 54 }, "id": "SAS" }, "helloWorldCollection": [ "/* Hello world in SAS */\n\n* Writes as output title;\nTITLE \"Hello World!\";\n* writes to the log;\ndata _null_;\n PUT \"Hello world!\";\nrun;" ], "leachim6": { "filepath": "s/Sas.sas", "fileExtensions": [ "sas" ], "example": [ "%macro putit( string= ); \n %put &string; \n %mend; \n\n%putit(string=Hello World)\n" ], "id": "Sas" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SAS", "indeedJobs": { "2022": 1160, "query": "sas programmer" }, "linkedInSkill": { "2018": 352164, "id": "sas" }, "faqPageUrl": [ "https://www.sas.com/en_us/certification/faq.html" ], "subreddit": [ { "memberCount": { "2017": 2538, "2022": 7963 }, "url": "https://reddit.com/r/sas" } ], "tiobe": { "currentRank": 21, "id": "SAS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=733", "twitter": "https://twitter.com/sassoftware", "jupyterKernel": [ "https://github.com/sassoftware/sas_kernel" ], "fileType": "text", "wordRank": 8860, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nLearning SAS by Example: A Programmer's Guide|2007|Ron Cody|1320285|4.29|127|9\nSAS For Dummies|2007|Stephen McDaniel|970688|3.57|28|4", "isbndb": "year|publisher|title|authors|isbn13\n2005|Pearson|Applied Statistics and the SAS Programming Language|Cody, Ron and Smith, Jeffrey|9780131465329\n1995|Duxbury Press|Quick Start to Data Analysis with SAS|DiIorio, Frank and Hardy, Kenneth A.|9780534237608\n2009|Duxbury Press|Learning SAS in the Computer Lab (Advanced (Cengage Learning))|Elliott, Rebecca J. and Morrell, Christopher H.|9780495559689\n2014|SAS Institute|SAS Macro Programming Made Easy, Third Edition|Burlew, Michele M.|9781612906935\n2008|Springer|SAS for Data Analysis: Intermediate Statistical Methods (Statistics and Computing)|Marasinghe, Mervyn G. and Kennedy, William J.|9780387773711\n2011|SAS Institute|SAS Certification Prep Guide: Advanced Programming for SAS 9, Third Edition|SAS Institute|9781607649250\n2007|SAS Publishing|SAS Certification Prep Guide: Advanced Programming for SAS 9|SAS Publishing|9781599945590\n2013||SAS Programming 2: Data Manipulation Techniques|Davetta Dunlap|9781612905280\n|Sas Institute|SAS programming with Medicare administrative data|Gillingham, Matthew (author.)|9781612903224\n1996|SAS Institute|The SAS Workbook|Cody|9781555447571\n2012|Sas Institute|The Little Sas Book|Lora D. Delwiche and Susan J. Slaughter|9781629590134\n2008|SAS Institute|Stock Market Analysis Using the SAS System: Portfolio Selection and Evaluation|Institute, SAS|9781555446239\n1991|Appleton & Lange|Applied Statistics and the Sas Programming Language|Cody, Ronald P. and Smith Jeffrey K. and Smith, Jeffrey K.|9780135005545\n2000|Sas Inst|Introduction To Programming Concepts Using Sas Software Course Notes|Unknown|9781580256513\n20180905|SAS Institute Inc.|SAS Certification Prep Guide|Frank Voehl; H. James Harrington; Rick Fernandez; Brett Trusko|9781635269918\n2007|Wiley-interscience|Sas 9 Study Guide: Preparing For The Base Programming Certification Exam For Sas 9|Ali Hezaveh|9780470164983\n1997|Duxbury Resource Center|Sas Applications Programming: A Gentle Introduction|Frank C. Diiorio|9780534499709\n2000|Sas Inst|Sas Programming I: Essentials Course Notes|SAS institute|9781580256490\n2007|SAS Institute|SAS Graphics for Java: Examples Using SAS AppDev Studio and the Output Delivery System (SAS Press)|Wendy Bohnenkamp and Jackie Iverson|9781590476932\n2020|Routledge|SAS Programming for Elementary Statistics|Goad, Carla L.|9781138589025\n20190211|SAS Institute Inc.|SAS Certified Specialist Prep Guide|Lori M. Poloni-Staudinger; Michael R. Wolf|9781642951769\n2021|SPSS Inc.|SPSS Programming and Data Management: A Guide for SPSS and SAS Users, 3rd Edition|Raynald Levesque and SPSS Inc.|9781568273747\n2006|SAS Institute,|SAS Programming 1: Essentials: Course Notes|SAS|9781599947334\n2004|Sas Institute|Sas 9.1 Sql Procedure User's Guide|Inc Sas Institute and Sas Institute|9781590473344\n2020|Packt Publishing|Mastering SAS Programming for Data Warehousing: An advanced programming guide to designing and managing Data Warehouses using SAS|Wahi, Monika|9781789532371\n2008|SAS Institute|An Array of Challenges Test Your SAS Skills|Virgile, Robert|9781555448066\n2011|Springer|R for SAS and SPSS Users (Statistics and Computing)|Muenchen, Robert A.|9781461406853\n1994|Springer|Static Analysis: First International Static Analysis Symposium, SAS '94, Namur, Belgium, September 28 - 30, 1994. Proceedings (Lecture Notes in Computer Science, 864)||9783540584858\n20201207|SAS Institute Inc.|SAS Visual Analytics for SAS Viya|SAS Institute Inc.|9781952365102\n2000|Breakfast Communications Corp|Professional SAS Programming Logic|Aster, Rick|9781891957055\n1991|Pws-kent Publishing Co, Us|Sas Applications Programming: A Gentle Introduction|Frank C Diiorio|9780534984649\n2000|SAS Institute,|SAS SQL Procedure User's Guide,Version 8|SAS Institute Staff and Publishing SAS Publishing and SAS Publishing|9781580255998\n2012|SAS Institute|SAS Hash Object Programming Made Easy|Burlew, Michele M.|9781607648017\n20201125|SAS Institute Inc.|SAS Graphics for Clinical Trials by Example|Kriss Harris; Richann Watson|9781952365973\n20200626|SAS Institute Inc.|End-to-End Data Science with SAS|James Gearheart|9781642958065\n20170106|SAS Institute Inc.|Step-by-Step Programming with Base SAS 9.4|SAS Institute|9781629608068\n2005|Sas|Sas Programming Iii: Advanced Techniques Instructor-based Training|Sas|9781590478349\n2013|SAS Institute|PROC REPORT by Example: Techniques for Building Professional Reports Using SAS|Fine, Lisa|9781612907840\n2018|Vibrant Publishers|Sas Interview Questions You'll Most Likely Be Asked (job Interview Questions Series)|Publishers, Vibrant|9781949395129\n2019-02-11T00:00:01Z|SAS Institute|SAS Certified Specialist Prep Guide: Base Programming Using SAS 9.4||9781642951790\n2008|SAGE Publications, Inc|Data Analysis Using SAS|Peng, Chao-Ying Joanne|9781412956741\n2012|Springer|SAS for Epidemiologists: Applications and Methods|DiMaggio, Charles|9781461448549\n2007|SAS Institute|Learning SAS by Example: A Programmer's Guide|Cody, Ron|9781599941653\n2015|SAS Institute|Statistical Programming in SAS|Bailer, John|9781599946566\n2015-09-04T00:00:01Z|SAS Institute|SAS Certification Prep Guide: Base Programming for SAS 9, Third Edition||9781607649243\n2017-12-01T00:00:01Z|SAS Institute|SAS Certification Prep Guide: Base Programming for SAS 9, Fourth Edition|Institute, SAS|9781635263732\n2014|Notion Press|SAS Clinical Programming: In 18 Easy Steps|Prasad, Y. Lakshmi|9789384381639\n2019-10-16T00:00:01Z|SAS Institute|SAS Certified Professional Prep Guide: Advanced Programming Using SAS 9.4||9781642954678\n2017|SAS Institute|Practical and Efficient SAS Programming: The Insider's Guide|Messineo, Martha|9781635260236\n2014-03-01T00:00:01Z|SAS Institute|SAS Programming in the Pharmaceutical Industry, Second Edition|Shostak, Jack|9781612906041\n2019|SAS Institute|SAS Certified Professional Prep Guide: Advanced Programming Using SAS 9.4|Sas and Sas Institute|9781642956917\n2011|Springer|R for SAS and SPSS Users (Statistics and Computing)|Muenchen, Robert A.|9781461406846\n2019-02-11T00:00:01Z|SAS Institute|SAS Certified Specialist Prep Guide: Base Programming Using SAS 9.4||9781642951905\n2010|SAGE Publications Ltd|Discovering Statistics Using SAS|Field, Andy and Miles, Jeremy|9781849200929\n2008|SAS Institute|SAS Programming 2: Data Manipulation Techniques Course Notes|SAS|9781607642381\n2014|SAS Institute|Multiple Imputation of Missing Data Using SAS|Berglund, Patricia and Heeringa, Steven G.|9781612904528\n2015|SAS Institute|SAS Certification Prep Guide: Advanced Programming for SAS9, Fourth Edition||9781629593548\n2009|Jossey-Bass|SAS Essentials: A Guide to Mastering SAS for Research|Elliott, Alan C. and Woodward, Wayne A.|9780470461297\n2019|Chapman and Hall/CRC|Statistical Programming in SAS|Bailer, A. John|9780367358006\n2017|Packt Publishing|Big Data Analytics with SAS: Get actionable insights from your Big Data using the power of SAS|Pope, David|9781788294317\n2001|Psychology Press|Conducting Meta-Analysis Using SAS (Multivariate Applications Series)|Winfred Arthur Jr. and Winston Bennett Jr. and Allen I. Huffcutt|9780805838091\n2015-06-04T00:00:01Z|CreateSpace Independent Publishing Platform|Beginning SAS Programming: a true beginner's guide for learning SAS|Guo, Yufeng|9781514218990\n1997|Prentice Hall|Applied Statistics and the SAS Programming Language|Cody, Ronald P. and Smith, Jeffrey K.|9780137436422\n2009|SAS Publishing|SAS Certification Prep Guide SAS Certification Prep Guide: Advanced Programming for SAS 9, Second Edition|SAS Publishing|9781607640448\n2012|SAS Institute|Cody's Collection of Popular SAS Programming Tasks and How to Tackle Them|Cody, Ron|9781612903330\n2011|Breakfast Communications Corporation|Professional SAS Programmer's Pocket Reference|Rick Aster|9781891957185\n2019|Routledge|Statistical Programming in SAS|Bailer, A. John|9780367357979\n2005-09T|SAS Publishing|SAS Programming in the Pharmaceutical Industry|Jack Shostak|9781590477939\n2010-08-25T00:00:01Z|SAS Institute|SAS Programming for Enterprise Guide Users, Second Edition|Constable, Neil|9781607645283\n2018|SAS Institute|SAS Programming in the Pharmaceutical Industry, Second Edition|Shostak, Jack|9781635269147\n1995|SAS Publishing|SAS Programming by Example|Ronald P. Cody and Ray Pass|9781555446819\n2009|SAS Publishing|SAS Certification Prep Guide: Base Programming for SAS 9, Second Edition|SAS Publishing|9781607640455\n2017|SAS Institute|Step-by-Step Programming with Base SAS 9.4, Second Edition||9781629598949\n2012|Wiley|Using SAS for Principles of Econometrics, 4th Edition|Hill, R. Carter|9781118361726\n2012|SAS Institute|Data Quality for Analytics Using SAS|Svolba, Gerhard|9781612902272\n2006|SAS Publishing|SAS Macro Programming Made Easy, Second Edition|Michele M. Burlew|9781590478820\n2006|SAS Publishing|SAS Certification Prep Guide: Base Programming for SAS 9|SAS|9781590479223\n2008-12-03T00:00:01Z|SAS Institute|Step-By-Step Programming With Base SAS Software|Institute, SAS|9781580257916\n2005|Breakfast Communications Corp|Professional SAS Programming Shortcuts: Over 1,000 Ways to Improve Your SAS Programs|Aster, Rick|9781891957116\n2015-03-20|SAS Institute Inc.|SAS Programming 2: Data Manipulation Techniques|SAS Institute Inc.|9781629597508\n2007|SAS Institute|Basic Statistics Using SAS Enterprise Guide:: A Primer|Der, Geoff and Everitt, Brian S.|9781599945736\n1998|SAS Publishing|SAS Macro Programming Made Easy|Burlew, Michele M.|9781580253437\n1991|Cengage Learning|SAS Applications Programming: A Gentle Introduction (Duxbury Series in Statistics & Decision Sciences)|DiIorio, Frank C.|9780534923907\n2015|Apress|SAS Programming and Data Visualization Techniques: A Power User's Guide|Holland, Philip R.|9781484205693\n2011-07-01T00:00:01Z|Posts and Telecom Press|Applied Statistics and the SAS Programming Language (5th Edition) (Chinese Edition)|[Mei]Luo Na De·Ke Di Ling Jie Fu Li·Shi Mi Si|9787115252784\n1998|SAS Institute|SAS for Monte Carlo Studies: A Guide for Quantitative Researchers|Fan Ph.D., Xitao|9781590471418\n2021|SAS Institute|Getting Started with SAS Programming: Using SAS Studio in the Cloud (Hardcover edition)|Cody, Ron|9781953329202\n2018|SAS Institute|SAS Macro Programming Made Easy, Third Edition|Burlew, Michele M.|9781635269079\n2015|SAS Institute|Bayesian Analysis of Item Response Theory Models Using SAS|Stone, Clement A. and Zhu, Xiaowen|9781629596501\n2014|Wiley|Big Data, Big Innovation: Enabling Competitive Differentiation through Business Analytics (Wiley and SAS Business Series)|Stubbs, Evan|9781118925522\n2008|Springer|SAS for Data Analysis: Intermediate Statistical Methods (Statistics and Computing)|Marasinghe, Mervyn G. and William J. Kennedy|9780387773728\n2021|SAS Institute Inc.|SAS Programming 1:Essentials Course Notes|Bennett|9781629597355\n2016|CRC Press|Practical Statistical Methods: A SAS Programming Approach|Padgett, Lakshmi|9781439812549\n2007|Wiley-Interscience|Data Mining Using SAS Enterprise Miner|Matignon, Randall|9780470149010", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1986|Applied Statistics and the SAS Programming Language|10.2307/1271202|465|33|R. Cody and Jeffrey K. Smith|c0f9432b13bf1e85e5e647b9259e5164584f8220\n1990|What is the SAS System|10.1007/978-1-4615-9670-7_1|100|16|P. Herzberg|ccc9387e43de6ac9ec81b3144ce7735ac28409fa\n1986|Applied statistics and the SAS programming language (2nd ed.)|10.1037/025856|97|10|R. Cody and Jeffrey K. Smith|44ed2d49283af3772a79d7d2be46980e77d15e4f\n2007|Static Analysis, 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007, Proceedings|10.1007/978-3-540-74061-2|57|0|H. R. Nielson and G. Filé|3f7c96ddded4474e87f9bc389e34ee6943e5429b\n2008|SAS for Data Analysis: Intermediate Statistical Methods|10.18637/jss.v028.b01|17|0|W. Hartmann|ef23a88c303f1aec557b2f8e879207e948b0b7d2\n2006|Applied Statistics and the SAS® Programming Language, Statistical Analysis of Medical Data Using SAS|10.1198/tech.2006.s418|7|1||59a2fa02065323cb7b8bd63ffc346cafe4b21b72\n2016|Applied Statistics And The Sas Programming Language|10.1080/00401706.1998.10485547|6|1|Steffen Beich|522574159223e99ca5ed977f22a03001f4802102\n2008|Introduction to the SAS Language|10.1007/978-0-387-77372-8_1|1|0|M. Marasinghe and W. J. Kennedy|0c9a658f80a626cdc628692e03ca1642ec9ebf87\n2020|Automated Test Assembly Using SAS Operations Research Software in a Medical Licensing Examination|10.1177/0146621619847169|1|0|Can Shao and Silu Liu and H. Yang and Tsung-hsun Tsai|08f1de70767e9d28d43b9ae6be6c83def88e3278\n2012|%PROC_R: A SAS Macro that Enables Native R Programming in the Base SAS Environment|10.18637/JSS.V046.C02|1|0|Xin Wei|193c9e1f3166bc06301dcf8b4a11ddaefa7bcb15" }, "sasl-programming-language": { "title": "SASL", "appeared": 1972, "type": "pl", "creators": [ "David Turner" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of St Andrews" ], "wikipedia": { "related": [ "iswim", "krc", "haskell", "miranda" ], "summary": "SASL (from St Andrews Static Language, alternatively St Andrews Standard Language) is a purely functional programming language developed by David Turner at the University of St Andrews in 1972, based on the applicative subset of ISWIM. In 1976 Turner redesigned and reimplemented it as a non-strict (lazy) language. In this form it was the foundation of Turner's later languages KRC and Miranda, but SASL appears to be untyped whereas Miranda has polymorphic types. Burroughs Corporation used SASL to write a compiler and operating system.", "created": 2004, "backlinksCount": 16, "pageId": 1298198, "revisionCount": 36, "dailyPageViews": 12, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/SASL_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5836", "centralPackageRepositoryCount": 0 }, "sass": { "title": "Sass", "appeared": 2006, "type": "stylesheetLanguage", "creators": [ "Hampton Lintorn-Catlin" ], "website": "http://sass-lang.com/", "documentation": [ "https://sass-lang.com/documentation/" ], "standsFor": "syntactically awesome stylesheets", "country": [ "Various" ], "originCommunity": [ "https://github.com/sass" ], "domainName": { "registered": 2009, "awisRank": { "2017": 38454, "2022": 22267 }, "name": "sass-lang.com" }, "hasSemanticIndentation": { "example": "", "value": true }, "hasMixins": { "example": "@mixin reset-list\n margin: 0\n padding: 0\n list-style: none\n@mixin horizontal-list\n @include reset-list\n li\n display: inline-block\n margin:\n left: -2px\n right: 2em\nnav ul\n @include horizontal-list", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ ".error, .badError {\n border: 1px #f00;\n background: #fdd;\n}\n\n.error.intrusion,\n.badError.intrusion {\n font-size: 1.3em;\n font-weight: bold;\n}\n\n.badError {\n border-width: 3px;\n}" ], "related": [ "ruby", "yaml", "haml", "less", "stylus", "css", "php", "c", "java", "go", "eclipse-editor", "emacs-editor", "visual-studio-editor", "vim-editor", "visual-studio-code-editor" ], "summary": "Sass (syntactically awesome stylesheets) is a style sheet language initially designed by Hampton Catlin and developed by Natalie Weizenbaum. After its initial versions, Weizenbaum and Chris Eppstein continued to extend Sass with SassScript, a simple scripting language used in Sass files. Sass is a scripting language that is interpreted or compiled into Cascading Style Sheets (CSS). SassScript is the scripting language itself. Sass consists of two syntaxes. The original syntax, called \"the indented syntax\", uses a syntax similar to Haml. It uses indentation to separate code blocks and newline characters to separate rules. The newer syntax, \"SCSS\", uses block formatting like that of CSS. It uses braces to denote code blocks and semicolons to separate lines within a block. The indented syntax and SCSS files are traditionally given the extensions .sass and .scss, respectively. CSS3 consists of a series of selectors and pseudo-selectors that group rules that apply to them. Sass (in the larger context of both syntaxes) extends CSS by providing several mechanisms available in more traditional programming languages, particularly object-oriented languages, but that are not available to CSS3 itself. When SassScript is interpreted, it creates blocks of CSS rules for various selectors as defined by the Sass file. The Sass interpreter translates SassScript into CSS. Alternatively, Sass can monitor the .sass or .scss file and translate it to an output .css file whenever the .sass or .scss file is saved. Sass is simply syntactic sugar for CSS. The official implementation of Sass is open-source and coded in Ruby; however, other implementations exist, including PHP, and a high-performance implementation in C called libSass. There's also a Java implementation called JSass. Additionally, Vaadin has a Java implementation of Sass. The indented syntax is a metalanguage. SCSS is a nested metalanguage, as valid CSS is valid SCSS with the same semantics. Sass supports integration with the Firefox extension Firebug. SassScript provides the following mechanisms: variables, nesting, mixins, and selector inheritance.", "pageId": 20770982, "dailyPageViews": 594, "created": 2008, "backlinksCount": 84, "revisionCount": 256, "appeared": 2006, "fileExtensions": [ "sass", "scss" ], "url": "https://en.wikipedia.org/wiki/Sass_(stylesheet_language)" }, "githubLanguage": { "fileExtensions": [ "sass" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "sass", "codemirrorMode": "sass", "codemirrorMimeType": "text/x-sass", "tmScope": "source.sass", "repos": 8972, "id": "Sass" }, "githubBigQuery": { "repos": 466, "users": 439, "id": "Sass" }, "codeMirror": "sass", "pygmentsHighlighter": { "filename": "css.py", "fileExtensions": [ "sass" ], "id": "Sass" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2017, "committerCount": 39, "commitCount": 158, "sampleCount": 1, "example": [ "$blue: #3bbfce\n$margin: 16px\n\n.content-navigation\n border-color: $blue\n color: darken($blue, 9%)\n\n.border\n padding: $margin / 2\n margin: $margin / 2\n border-color: $blue\n" ], "url": "https://github.com/nathos/sass-textmate-bundle" }, "leachim6": { "filepath": "s/Sass.sass", "fileExtensions": [ "sass" ], "example": [ "body::before\n\tcontent: \"Hello World\"\n" ], "id": "Sass" }, "rijuRepl": { "example": [ "body:before\n content: \"Hello, world!\"\n" ], "id": "https://riju.codes/sass" }, "twitter": "https://twitter.com/sasscss", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|Sass and Compass for Designers|Frain, Ben|9781849694544\n2016|Packt Publishing|Mastering Sass|Watts, Luke|9781785889578\n2013|Packt Publishing|Sass and Compass for Designers (Community Experience Distilled)|Frain, Ben|9781849694551\n2016|Packt Publishing|Sass and Compass Designer's Cookbook|Jobsen, Bass|9781783286942\n20160324|O'Reilly Media, Inc.|Jump Start Sass|Hugo Giraudel; Miriam Suzanne|9781457199509\n20160324|O'Reilly Media, Inc.|Jump Start Sass|Hugo Giraudel|9781457199493\n20130222|Packt Publishing|Instant SASS CSS How-to|Alex Libby|9781782163794", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2014|Applying Stylus, Less, and Sass|10.1007/978-1-4842-0037-7_14|1|0|A. Mardan|feac0cc2a138d38a9b4962a18d82c8374539a2d6" }, "sassy": { "title": "Sassy", "appeared": 1999, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2399ac583e177c9db84bf451910f313269e2e632" ], "country": [ "United States" ], "originCommunity": [ "Colorado State University" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3571", "centralPackageRepositoryCount": 0 }, "sather-k": { "title": "Sather-K", "appeared": 1995, "type": "pl", "creators": [ "David Stoutamire", "Wolf Zimmermann", "Martin Trapp" ], "website": "https://web.archive.org/web/20011117054314/http://i44s11.info.uni-karlsruhe.de/sather/index_engl.html", "reference": [ "http://www.sai.msu.su/sal/F/1/SATHER-K.html" ], "country": [ "United States and Germany" ], "originCommunity": [ "University of California, Berkeley and Karlsruher Institut für Technologie" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2472", "centralPackageRepositoryCount": 0, "isbndb": "" }, "sather": { "title": "Sather", "appeared": 1990, "type": "pl", "creators": [ "Steve Omohundro" ], "website": "https://www.gnu.org/software/sather/", "country": [ "United States and New Zealand" ], "originCommunity": [ "University of California, Berkeley and University of Waikato and GNU project" ], "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "#OUT" ] ], "wikipedia": { "example": [ "upto!(once m:INT):SAME is\n i: INT := self; -- initialise i to the value of self, \n -- that is the integer of which this method is called\n loop\n if i>m then \n quit; -- leave the loop when i goes beyond m\n end;\n yield i; -- else use i as return value and stay in the loop\n i := i + 1; -- and increment\n end;\n end;" ], "related": [ "eiffel", "clu", "common-lisp", "scheme", "cool", "rust", "c" ], "summary": "Sather is an object-oriented programming language. It originated circa 1990 at the International Computer Science Institute (ICSI) at the University of California, Berkeley, developed by an international team led by Steve Omohundro. It supports garbage collection and generics by subtypes. Originally, it was based on Eiffel, but it has diverged, and now includes several functional programming features. It is probably best to view it as an object-oriented language, with many ideas borrowed from Eiffel. Even the name is inspired by Eiffel; the Sather Tower is a recognizable landmark at Berkeley, named after Jane Krom Sather, the widow of Peder Sather, who donated large sums to the foundation of the university. Sather also takes inspiration from other programming languages and paradigms: iterators, design by contract, abstract classes, multiple inheritance, anonymous functions, operator overloading, contravariant type system. The original Berkeley implementation (last stable version 1.1 was released in 1995, no longer maintained) has been adopted by the Free Software Foundation therefore becoming GNU Sather. Last stable GNU version (1.2.3) was released in July 2007 and the software is currently not maintained. There were several other variants: Sather-K from the University of Karlsruhe; Sather-W from the University of Waikato (implementation of Sather version 1.3); Peter Naulls' port of ICSI Sather 1.1 to RISC OS; and pSather, a parallel version of ICSI Sather addressing non-uniform memory access multiprocessor architectures but presenting a shared memory model to the programmer. The former ICSI Sather compiler (now GNU Sather) is implemented as a compiler to C, i.e., the compiler does not output object or machine code, but takes Sather source code and generates C source code as an intermediate language. Optimizing is left to the C compiler. The GNU Sather compiler, written in Sather itself, is dual licensed under the GNU GPL & LGPL.", "pageId": 28763, "dailyPageViews": 21, "created": 2001, "backlinksCount": 31, "revisionCount": 96, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Sather" }, "helloWorldCollection": [ "-- Hello World in Sather\n\n class HELLO is\n main is #OUT + \"Hello World!\\n\" end\n end\n" ], "leachim6": { "filepath": "s/Sather.sa", "fileExtensions": [ "sa" ], "example": [ "class MAIN is\n main is \n loop \n #OUT + \"Hello World\\n\" \n end \n end\nend\n" ], "id": "Sather" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Sather", "tiobe": { "id": "Sather" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1659", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010||Class-based Programming Languages: Java, C++, Python, Eiffel, Smalltalk, Ruby, Simula, Common Lisp, Oberon, Clu, Objective-c, Squeak, Sather|Books and LLC|9781156829424", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1994|Engineering a Programming Language: The Type and Class System of Sather|10.1007/3-540-57840-4_33|89|5|C. Szyperski and S. Omohundro and S. Murer|47859a3e075dddf97b090c2316b67bc591783c14\n1992|Sather Provides Nonproprietary Access to Object‐Oriented Programming|10.1063/1.4823098|9|0|S. Omohundro|d09b97715cb4b8a58cb8a16973406210394dd422\n1997|Efficient Extensible Synchronization in Sather|10.1007/3-540-63827-X_45|7|0|Jürgen Quittek and B. Weissman|a081fa7ad5c7a3bccb2baf18077bffd1fa36bbfe" }, "satysfi": { "title": "SATySFi", "appeared": 2015, "type": "textMarkup", "creators": [ "Takashi Suwa" ], "country": [ "Japan" ], "originCommunity": [ "https://github.com/gfngfn/SATySFi/issues" ], "githubRepo": { "firstCommit": 2015, "stars": 969, "forks": 75, "subscribers": 53, "created": 2015, "updated": 2022, "description": "A statically-typed, functional typesetting system", "issues": 90, "url": "https://github.com/gfngfn/SATySFi" }, "repoStats": { "firstCommit": 2015, "commits": 3551, "committers": 54, "files": 326 } }, "saustall": { "title": "SAUSTALL", "appeared": 1982, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c9c7261f525ac4d87e0f2b985130bc462a806259" ], "country": [ "Former West Germany or Germany" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4451", "centralPackageRepositoryCount": 0 }, "savi": { "title": "Savi", "appeared": 2018, "type": "pl", "creators": [ "Joe Eli McIlvain" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/savi-lang" ], "hasHexadecimals": { "example": "", "value": true }, "hasBinaryNumbers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "githubRepo": { "firstCommit": 2018, "stars": 125, "forks": 10, "subscribers": 7, "created": 2018, "updated": 2022, "description": "A fast language for programmers who are passionate about their craft.", "issues": 52, "url": "https://github.com/savi-lang/savi" }, "repoStats": { "firstCommit": 2018, "commits": 2308, "committers": 14, "files": 712 }, "pygmentsHighlighter": { "filename": "savi.py", "fileExtensions": [ "savi" ], "id": "Savi" } }, "sawzall": { "title": "Sawzall", "appeared": 2003, "type": "pl", "country": [ "United States" ], "originCommunity": [ "Google, Inc" ], "wikipedia": { "example": [ "count: table sum of int;\ntotal: table sum of float;\nsum_of_squares: table sum of float;\nx: float = input;\nemit count <- 1;\nemit total <- x;\nemit sum_of_squares <- x * x;" ], "related": [ "go", "protobuf", "gfs", "x86-isa" ], "summary": "Sawzall is a procedural domain-specific programming language, used by Google to process large numbers of individual log records. Sawzall was first described in 2003, and the szl runtime was open-sourced in August 2010. However, since the MapReduce table aggregators have not been released, the open-sourced runtime is not useful for large-scale data analysis of multiple log files off the shelf. Sawzall has been replaced by Lingo (logs in Go) for most purposes within Google.", "dailyPageViews": 17, "pageId": 12640293, "created": 2007, "backlinksCount": 470, "revisionCount": 59, "appeared": 2003, "url": "https://en.wikipedia.org/wiki/Sawzall_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "sb-one": { "title": "SB-ONE", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9005324a3c2dabee66224602b3a5583b922f4cfe" ], "country": [ "Germany" ], "originCommunity": [ "University Of Saarbrucken" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3997", "centralPackageRepositoryCount": 0 }, "sba": { "title": "SBA", "appeared": 1977, "type": "pl", "creators": [ "Moshe M. Zloof", "S. Peter de Jong" ], "reference": [ "https://semanticscholar.org/paper/143c5493bb3b8cb14ea07f77b6aa02a2e79ebe14" ], "country": [ "United States" ], "originCommunity": [ "International Business Machines Corporation" ], "supersetOf": [ "query-by-example" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4747", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2010|Bibliogov|Sba Reauthorization: Programming For Success|United States Congress Senate Committee|9781240498611\n2004|Government Printing Office|Sba Reauthorization: Programming For Success: Hearing Before The Committee On Small Business And Entrepreneurship, United States Senate, On|United States|9780160719622", "semanticScholar": "" }, "sbasic": { "title": "SBASIC", "appeared": 1983, "type": "pl", "creators": [ "Gilbert Ohnysty" ], "reference": [ "https://rosettacode.org/wiki/Category:S-BASIC" ], "country": [ "United States" ], "originCommunity": [ "Topaz Programming" ], "wikipedia": { "related": [ "smallbasic", "basic", "mbasic" ], "summary": "S-BASIC (for Structured Basic) was a \"structured\" BASIC variant, distributed with Kaypro CP/M systems. It was made by Topaz Programming is distributed by Micro-Ap (San Ramon, CA).SBasic was compatible with the syntax of Basic, a programming language commonly used in the 1970s through the 1980s, as well as Fortran77. However, the language relaxed many of the requirements of Basic and had more flexibility than Fortran. For instance, line numbers were optional, and permitted non-numeric characters. In addition, SBasic offered developers structured programming concepts, including recursion and nesting. Many PL-1 programs could be compiled with little modification, though SBasic did not offer an extensive function library. Among the more advanced features was the ability to \"base\" a variable or array, making the memory location dynamic and modifiable during execution. SBasic programs had the ability to access memory areas reserved for the operating system unless prohibited from doing so by the operating system itself. (Kaypro's CP/M had no such prohibitions.) This enabled direct utilization and modification of DMA and other memory areas. This feature also permitted a program to modify itself at run-time. This capability also allowed modifying the instruction pointer, so a program could effectively link other executable modules that were read during execution as data. Unlike Basic interpreters that stored \"p-code\" that was parsed by an execution module, SBasic was a two-pass compiler, ultimately producing .com files that were executable. The language was written in a subset of itself and compiled using a .com kernel, then stored on diskette (or hard drive on the last KayPro model). The source was distributed with some KayPro models. This encouraged open-source-like modification of the language, with some early pre-Internet user groups exchanging physical diskettes by regular mail. Not to be confused with the namesake SBasic (S for Spectral Basic) Programming Language for the commercial Spectral UV-Visible software.", "created": 2016, "backlinksCount": 83, "pageId": 22442254, "revisionCount": 1, "dailyPageViews": 2, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/SBASIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5081", "centralPackageRepositoryCount": 0 }, "sbcl": { "title": "Steel Bank Common Lisp", "appeared": 1999, "type": "pl", "website": "http://www.sbcl.org", "standsFor": "Steel Bank Common Lisp", "country": [ "United States" ], "originCommunity": [ "Carnegie Mellon University" ], "domainName": { "registered": 2003, "awisRank": { "2022": 1645444 }, "name": "sbcl.org" }, "wikipedia": { "summary": "Steel Bank Common Lisp (SBCL) is a free Common Lisp implementation that features a high-performance native compiler, Unicode support and threading. The name \"Steel Bank Common Lisp\" is a reference to Carnegie Mellon University Common Lisp from which SBCL forked: Andrew Carnegie made his fortune in the steel industry and Andrew Mellon was a successful banker.", "backlinksCount": 98, "pageId": 3349301, "dailyPageViews": 30, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Steel_Bank_Common_Lisp" } }, "sbml": { "title": "Systems Biology Markup Language", "appeared": 2006, "type": "xmlFormat", "standsFor": "Systems Biology Markup Language", "wikipedia": { "related": [ "xml", "rdf", "java", "python", "mathematica", "matlab", "mime" ], "summary": "The Systems Biology Markup Language (SBML) is a representation format, based on XML, for communicating and storing computational models of biological processes. It is a free and open standard with widespread software support and a community of users and developers. SBML can represent many different classes of biological phenomena, including metabolic networks, cell signaling pathways, regulatory networks, infectious diseases, and many others. It has been proposed as a standard for representing computational models in systems biology today.", "backlinksCount": 52, "pageId": 4461797, "created": 2006, "revisionCount": 191, "dailyPageViews": 17, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/SBML" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "sbol": { "title": "The Synthetic Biology Open Language", "appeared": 2010, "type": "xmlFormat", "website": "https://sbolstandard.org/", "country": [ "Unknown" ], "originCommunity": [ "https://groups.google.com/g/sbol-editors" ], "domainName": { "registered": 2010, "awisRank": { "2022": 2848072 }, "name": "sbolstandard.org" }, "twitter": "https://twitter.com/sbolstandard" }, "scala-js": { "title": "Scala.js", "appeared": 2013, "type": "pl", "creators": [ "Martin Odersky" ], "website": "https://www.scala-js.org/", "country": [ "United States and Switzerland" ], "originCommunity": [ "https://github.com/scala-js" ], "domainName": { "registered": 2013, "awisRank": { "2022": 1554040 }, "name": "scala-js.org" }, "compilesTo": [ "javascript" ], "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "println" ] ], "example": [ "class Person(val firstName: String, val lastName: String) {\n def fullName(): String =\n s\"$firstName $lastName\"\n}" ], "githubRepo": { "stars": 4324, "forks": 379, "subscribers": 157, "created": 2013, "updated": 2022, "firstCommit": 2013, "description": "Scala.js, the Scala to JavaScript compiler", "issues": 31, "url": "https://github.com/scala-js/scala-js" }, "repoStats": { "firstCommit": 2013, "commits": 7048, "committers": 110, "files": 2045 }, "wikipedia": { "example": [ "val urls = List(\"https://scala-lang.org\", \"https://github.com/scala/scala\")\n\ndef fromURL(url: String) = scala.io.Source.fromURL(url)\n .getLines().mkString(\"\\n\")\n\nval t = System.currentTimeMillis()\nurls.par.map(fromURL(_))\nprintln(\"time: \" + (System.currentTimeMillis - t) + \"ms\")" ], "related": [ "jvm", "javascript", "llvmir", "eiffel", "erlang", "haskell", "java", "lisp", "pizza", "standard-ml", "ocaml", "scheme", "smalltalk", "oz", "ceylon", "fantom", "f-sharp", "kotlin", "lasso", "red", "java-bytecode", "c", "android", "pascal", "csharp", "python", "ml", "csp", "groovy", "clojure", "swift", "perl", "go", "powershell", "objective-c", "r", "ruby" ], "summary": "Scala ( SKAH-lah) is a general-purpose programming language providing support for functional programming and a strong static type system. Designed to be concise, many of Scala's design decisions aimed to address criticisms of Java.Scala source code is intended to be compiled to Java bytecode, so that the resulting executable code runs on a Java virtual machine. Scala provides language interoperability with Java, so that libraries written in both languages may be referenced directly in Scala or Java code. Like Java, Scala is object-oriented, and uses a curly-brace syntax reminiscent of the C programming language. Unlike Java, Scala has many features of functional programming languages like Scheme, Standard ML and Haskell, including currying, type inference, immutability, lazy evaluation, and pattern matching. It also has an advanced type system supporting algebraic data types, covariance and contravariance, higher-order types (but not higher-rank types), and anonymous types. Other features of Scala not present in Java include operator overloading, optional parameters, named parameters, and raw strings. Conversely, a feature of Java not in Scala is checked exceptions, which have proved controversial.The name Scala is a portmanteau of scalable and language, signifying that it is designed to grow with the demands of its users.", "pageId": 3254510, "created": 2016, "backlinksCount": 843, "revisionCount": 1, "dailyPageViews": 2, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Scala.js_(programming_language)" }, "subreddit": [ { "memberCount": { "2022": 181 }, "url": "https://reddit.com/r/scalajs" } ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2016|Parallel incremental whole-program optimizations for Scala.js|10.1145/2983990.2984013|4|0|S. Doeraene and Tobias Schlatter|86c8c701f92f3a4712446204cb93b31e9e552c0b\n2016|Semantics-driven interoperability between Scala.js and JavaScript|10.1145/2998392.2998404|4|0|S. Doeraene and Tobias Schlatter and Nicolas Stucki|9575b847d866a9a78ad6693f4280a064634c8336\n2018|Scalagna 0.1: towards multi-tier programming with Scala and Scala.js|10.1145/3191697.3191731|4|0|Bob Reynders and Michael Greefs and D. Devriese and F. Piessens|54eb28a939999162d48773b236679fb40969b5bd" }, "scala": { "title": "Scala", "appeared": 2004, "type": "pl", "creators": [ "Martin Odersky" ], "website": "http://www.scala-lang.org", "webRepl": [ "https://scastie.scala-lang.org/" ], "documentation": [ "https://docs.scala-lang.org/" ], "emailList": [ "https://www.scala-lang.org/community/" ], "fileExtensions": [ "scala", "sc" ], "country": [ "Switzerland" ], "originCommunity": [ "École Polytechnique Fédérale de Lausanne" ], "domainName": { "registered": 2007, "awisRank": { "2022": 49909 }, "name": "scala-lang.org" }, "releaseNotesUrl": "https://www.scala-lang.org/download/all.html", "proposals": "https://docs.scala-lang.org/sips/all.html", "runsOnVm": [ "jvm" ], "visualParadigm": false, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasPartialApplication": { "example": "def add(x: Int, y: Int) = {x+y}; add(1, _: Int)", "value": true }, "hasComments": { "example": "", "value": true }, "hasMacros": { "example": "// https://docs.scala-lang.org/scala3/guides/macros/macros.html\nimport scala.quoted.* // imports Quotes, Expr\n\ndef inspectCode(x: Expr[Any])(using Quotes): Expr[Any] =\n println(x.show)\n x", "value": true }, "hasImplicitArguments": { "example": "// https://docs.scala-lang.org/tour/implicit-parameters.html\nabstract class Monoid[A] {\n def add(x: A, y: A): A\n def unit: A\n}\n\nobject ImplicitTest {\n implicit val stringMonoid: Monoid[String] = new Monoid[String] {\n def add(x: String, y: String): String = x concat y\n def unit: String = \"\"\n }\n \n implicit val intMonoid: Monoid[Int] = new Monoid[Int] {\n def add(x: Int, y: Int): Int = x + y\n def unit: Int = 0\n }\n \n def sum[A](xs: List[A])(implicit m: Monoid[A]): A =\n if (xs.isEmpty) m.unit\n else m.add(xs.head, sum(xs.tail))\n \n def main(args: Array[String]): Unit = {\n println(sum(List(1, 2, 3))) // uses intMonoid implicitly\n println(sum(List(\"a\", \"b\", \"c\"))) // uses stringMonoid implicitly\n }\n}", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMessagePassing": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasInheritance": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "println" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "abstract", "case", "catch", "class", "def", "do", "else", "extends", "false", "final", "finally", "for", "forSome", "if", "implicit", "import", "lazy", "match", "new", "null", "object", "override", "package", "private", "protected", "return", "sealed", "super", "this", "throw", "trait", "try", "true", "type", "val", "var", "while", "with", "yield" ], "wikipedia": { "example": [ "val urls = List(\"http://scala-lang.org\", \"https://github.com/scala/scala\")\n\ndef fromURL(url: String) = scala.io.Source.fromURL(url)\n .getLines().mkString(\"\\n\")\n\nval t = System.currentTimeMillis()\nurls.par.map(fromURL(_))\nprintln(\"time: \" + (System.currentTimeMillis - t) + \"ms\")" ], "related": [ "jvm", "javascript", "llvmir", "eiffel", "erlang", "haskell", "java", "lisp", "pizza", "standard-ml", "ocaml", "scheme", "smalltalk", "oz", "ceylon", "fantom", "f-sharp", "kotlin", "lasso", "red", "java-bytecode", "c", "android", "pascal", "csharp", "python", "ml", "csp", "groovy", "clojure", "php", "ruby" ], "summary": "Scala ( SKAH-lah) is a general-purpose programming language providing support for functional programming and a strong static type system. Designed to be concise, many of Scala's design decisions aimed to address criticisms of Java. Scala source code is intended to be compiled to Java bytecode, so that the resulting executable code runs on a Java virtual machine. Scala provides language interoperability with Java, so that libraries written in both languages may be referenced directly in Scala or Java code. Like Java, Scala is object-oriented, and uses a curly-brace syntax reminiscent of the C programming language. Unlike Java, Scala has many features of functional programming languages like Scheme, Standard ML and Haskell, including currying, type inference, immutability, lazy evaluation, and pattern matching. It also has an advanced type system supporting algebraic data types, covariance and contravariance, higher-order types (but not higher-rank types), and anonymous types. Other features of Scala not present in Java include operator overloading, optional parameters, named parameters, and raw strings. Conversely, a feature of Java not in Scala is checked exceptions, which have proved controversial. The name Scala is a portmanteau of scalable and language, signifying that it is designed to grow with the demands of its users.", "pageId": 3254510, "dailyPageViews": 1496, "created": 2004, "backlinksCount": 832, "revisionCount": 1472, "appeared": 2004, "fileExtensions": [ "scala", "sc" ], "url": "https://en.wikipedia.org/wiki/Scala_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "scala", "kojo", "sbt", "sc" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nAzure mmlspark https://github.com/Azure.png https://github.com/Azure/mmlspark Scala #c22d40 1637 354 79 \"Microsoft Machine Learning for Apache Spark\"\nlampepfl dotty https://github.com/lampepfl.png https://github.com/lampepfl/dotty Scala #c22d40 3551 535 72 \"Research compiler that will become Scala 3\"\nfreechipsproject chisel3 https://github.com/freechipsproject.png https://github.com/freechipsproject/chisel3 Scala #c22d40 933 212 45 \"Chisel 3: A Modern Hardware Design Language\"\napache spark https://github.com/apache.png https://github.com/apache/spark Scala #c22d40 23299 19958 464 \"Apache Spark\"\ncloudstateio cloudstate https://github.com/cloudstateio.png https://github.com/cloudstateio/cloudstate Scala #c22d40 246 26 127 \"Towards Serverless 2.0\"\nornicar lila https://github.com/ornicar.png https://github.com/ornicar/lila Scala #c22d40 5805 862 132 \"♞ lichess.org: the forever free, adless and open source chess server ♞\"\nyahoo kafka-manager https://github.com/yahoo.png https://github.com/yahoo/kafka-manager Scala #c22d40 7893 1920 187 \"A tool for managing Apache Kafka.\"\ntypelevel cats https://github.com/typelevel.png https://github.com/typelevel/cats Scala #c22d40 3436 874 68 \"Lightweight, modular, and extensible library for functional programming.\"\nscala scala https://github.com/scala.png https://github.com/scala/scala Scala #c22d40 12057 2789 154 \"The Scala programming language\"\nchipsalliance rocket-chip https://github.com/chipsalliance.png https://github.com/chipsalliance/rocket-chip Scala #c22d40 1180 495 34 \"Rocket Chip Generator\"\nInterestingLab waterdrop https://github.com/InterestingLab.png https://github.com/InterestingLab/waterdrop Scala #c22d40 573 187 45 生产环境的海量数据计算产品，文档地址：\nfpinscala fpinscala https://github.com/fpinscala.png https://github.com/fpinscala/fpinscala Scala #c22d40 4475 2519 59 \"Code, exercises, answers, and hints to go along with the book \"\"Functional Programming in Scala\"\"\"\napache incubator-livy https://github.com/apache.png https://github.com/apache/incubator-livy Scala #c22d40 375 242 30 \"Mirror of Apache livy (Incubating)\"\nscalameta metals https://github.com/scalameta.png https://github.com/scalameta/metals Scala #c22d40 874 106 60 \"Scala language server with rich IDE features 🚀\"\nlw-lin CoolplaySpark https://github.com/lw-lin.png https://github.com/lw-lin/CoolplaySpark Scala #c22d40 2688 1180 89 \"酷玩 Spark: Spark 源代码解析、Spark 类库等\"\ntwitter-archive snowflake https://github.com/twitter-archive.png https://github.com/twitter-archive/snowflake Scala #c22d40 5447 922 84 \"Snowflake is a network service for generating unique ID numbers at high scale with some simple guarantees.\"\nprisma prisma https://github.com/prisma.png https://github.com/prisma/prisma Scala #c22d40 15534 903 348 \"💾 Database Tools incl. ORM, Migrations and Admin UI (Postgres, MySQL & MongoDB)\"\nakka alpakka https://github.com/akka.png https://github.com/akka/alpakka Scala #c22d40 1027 490 15 \"Alpakka is a Reactive Enterprise Integration library for Java and Scala, based on Reactive Streams and Akka.\"\nmilessabin shapeless https://github.com/milessabin.png https://github.com/milessabin/shapeless Scala #c22d40 2855 465 24 \"Generic programming for Scala\"\ngitbucket gitbucket https://github.com/gitbucket.png https://github.com/gitbucket/gitbucket Scala #c22d40 7803 1077 53 \"A Git platform powered by Scala with easy installation, high extensibility & GitHub API compatibility\"", "trendingProjectsCount": 21, "type": "programming", "interpreters": [ "scala" ], "aceMode": "scala", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-scala", "tmScope": "source.scala", "repos": 219084, "id": "Scala" }, "githubBigQuery": { "repos": 34541, "users": 21181, "id": "Scala" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/scala", "monaco": "scala", "pygmentsHighlighter": { "filename": "jvm.py", "fileExtensions": [ "scala" ], "id": "Scala" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 4, "commitCount": 26, "sampleCount": 7, "example": [ "#!/bin/sh\nexec scala \"$0\" \"$@\"\n!#\n\nobject HelloWorld {\n def main(args: Array[String]) {\n println(\"Hello, world!\")\n }\n}\n" ], "url": "https://github.com/scala/vscode-scala-syntax" }, "languageServerProtocolProject": [ "https://github.com/dragos/dragos-vscode-scala\nwrittenIn scala", "https://github.com/scalameta/metals\nwrittenIn scala" ], "projectEuler": { "memberCount": { "2019": 1908, "2022": 1985 }, "id": "Scala" }, "helloWorldCollection": [ "// Hello world in Scala\n\nobject HelloWorld extends App {\n println(\"Hello world!\")\n}" ], "leachim6": { "filepath": "s/Scala.scala", "fileExtensions": [ "scala" ], "example": [ "object HelloWorld extends App {\n println(\"Hello World\")\n}\n" ], "id": "Scala" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Scala", "quineRelay": "Scala", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nobject Square {\n def square(num: Int): Int =\n num * num\n}\n" ], "id": "Scala" }, "rijuRepl": { "example": [ "println(\"Hello, world!\")\n" ], "id": "https://riju.codes/scala" }, "tryItOnline": "scala", "indeedJobs": { "2017": 3679, "query": "scala engineer" }, "linkedInSkill": { "2018": 84552, "id": "scala" }, "stackOverflowSurvey": { "2021": { "users": 2148, "medianSalary": 77832, "fans": 3165, "percentageUsing": 0.03 } }, "officialBlogUrl": [ "https://www.scala-lang.org/blog/" ], "eventsPageUrl": [ "https://scala-lang.org/events/" ], "faqPageUrl": [ "https://docs.scala-lang.org/tutorials/FAQ/index.html" ], "downloadPageUrl": [ "https://scala-lang.org/download/" ], "subreddit": [ { "memberCount": { "2017": 15219, "2022": 46218 }, "url": "https://reddit.com/r/scala" } ], "meetup": { "memberCount": 369728, "groupCount": 624, "url": "https://www.meetup.com/topics/scala" }, "tiobe": { "currentRank": 39, "id": "Scala" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6814", "pypl": "Scala", "packageRepository": [ "https://index.scala-lang.org/" ], "twitter": "https://twitter.com/scala_lang", "ubuntuPackage": "scala", "jupyterKernel": [ "https://github.com/mattpap/IScala", "https://github.com/alexarchambault/jupyter-scala" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming in Scala|2008|Martin Odersky|5852455|4.19|1325|87\nFunctional Programming in Scala|2013|Rúnar Bjarnason|19105535|4.44|486|45\nProgramming Scala|2009|Venkat Subramaniam|6163823|3.29|100|10\nProgramming Scala: Scalability = Functional Programming + Objects|2009|Dean Wampler|6724274|3.68|204|21", "isbndb": "year|publisher|title|authors|isbn13\n2016|Artima Press|Programming in Scala: Updated for Scala 2.12|Odersky, Martin and Spoon, Lex and Venners, Bill|9780981531687\n2014|Manning Publications|Functional Programming in Scala|Paul Chiusano and Rúnar Bjarnason|9781617290657\n2012|Chapman and Hall/CRC|Introduction to the Art of Programming Using Scala (Chapman & Hall/CRC Textbooks in Computing)|Lewis, Mark C.|9781439896662\n2016|Packt Publishing|Scala High Performance Programming|Theron, Vincent and Diamant, Michael|9781786466044\n2013|O'Reilly Media|Scala Cookbook: Recipes for Object-Oriented and Functional Programming|Alexander, Alvin|9781449339616\n2020|Artima Inc|Programming in Scala|Martin Odersky and Spoon, Lex and Venners, Bill|9780981531618\n2015|Packt Publishing|Scala Functional Programming Patterns|S.Khot, Atul|9781783985845\n2016|Packt Publishing|Scala for Data Science: Leverage the power of Scala with different tools to build scalable, robust data science applications|Bugnion, Pascal|9781785281372\n2013|Pragmatic Bookshelf|Functional Programming Patterns in Scala and Clojure: Write Lean Programs for the JVM|Bevilacqua-Linn, Michael|9781937785475\n2009|Apress|Beginning Scala (Expert's Voice in Open Source)|Pollak, David|9781430219897\n2018|Packt Publishing|Scala Reactive Programming: Build scalable, functional reactive microservices with Akka, Play, and Lagom|Posa, Rambabu|9781787288645\n20091001|Springer Nature|Beginning Scala|David Pollak|9781430219903\n2014|Packt Publishing|Learning Concurrent Programming in Scala|Prokopec, Aleksandar|9781783281411\n20141204|O'Reilly Media, Inc.|Programming Scala|Dean Wampler|9781491950166\n20171017|Springer Nature|Programming with Scala|Bhim P. Upadhyaya|9783319693682\n2017|Packt Publishing|Scala and Spark for Big Data Analytics: Explore the concepts of functional programming, data streaming, and machine learning|Karim, Md. Rezaul and Alla, Sridhar|9781783550500\n2021|Artima Press|Programming in Scala Fifth Edition|Odersky and Martin and Spoon and Lex and Venners and Bill and Sommers and Frank|9780997148008\n2016|Addison-Wesley Professional|Scala for the Impatient|S., Horstmann Cay|9780134540658\n2014|Manning|Functional Programming in Scala|Chiusano , Paul and Bjarnason, Runar|9781638353959\n2021|O'Reilly Media|Scala Cookbook: Recipes for Object-Oriented and Functional Programming|Alexander, Alvin|9781492051541\n2020|Li Haoyi|Hands-on Scala Programming: Learn Scala in a Practical, Project-Based Way|Li, Haoyi|9789811456930\n2014|Packt Publishing|Scala for Machine Learning|Nicolas, Patrick R.|9781783558759\n2012|Addison-Wesley Professional|Scala for the Impatient|S., Horstmann Cay|9780132761802\n2010|Addison-Wesley Professional|Scala for the Impatient|Horstmann, Cay|9780321774095\n2019|Packt Publishing|Hands-On Data Analysis with Scala: Perform data collection, processing, manipulation, and visualization with Scala|Gupta, Rajesh|9781789346114\n2018-05-24T00:00:01Z|Independently published|100+ Frequently Asked Interview Questions & Answers In Scala: Scala Programming (Interview Q & A Series)|Ojha, Bandana|9781982987701\n2018|Packt Publishing|Scala Design Patterns: Design modular, clean, and scalable applications by applying proven design patterns in Scala, 2nd Edition|Nikolov, Ivan|9781788472098\n2014|Packt Publishing|Learning Concurrent Programming in Scala|Prokopec, Aleksandar|9781783281428\n2019|Packt Publishing|Hands-On Data Analysis with Scala: Perform data collection, processing, manipulation, and visualization with Scala|Gupta, Rajesh|9781789344264\n2017|Chapman and Hall/CRC|Object-Orientation, Abstraction, and Data Structures Using Scala (Chapman & Hall/CRC Textbooks in Computing)|Lewis, Mark C. and Lacher, Lisa L.|9781498732178\n2021|Manning Publications|Get Programming with Scala|Sfregola, Daniela|9781617295270\n2016|Chapman and Hall/CRC|Introduction to Programming and Problem-Solving Using Scala (Chapman & Hall/CRC Textbooks in Computing Book 19)|Lewis, Mark C. and Lacher, Lisa|9781498730952\n2013|Manning Publications|Scala in Action: Covers Scala 2.10|Nilanjan Raychaudhuri|9781935182757\n2017|Packt Publishing|Learning Concurrent Programming in Scala - Second Edition|Prokopec, Aleksandar|9781786466891\n2016|Packt Publishing|Scala High Performance Programming|Theron, Vincent and Diamant, Michael|9781786467089\n2016|Packt Publishing|Scala Design Patterns|Nikolov, Ivan|9781785882029\n2019-07-06T00:00:01Z|Apress|Scala Programming for Big Data Analytics: Get Started With Big Data Analytics Using Apache Spark|Elahi, Irfan|9781484248096\n2015|Apress|Beginning Scala|Layka, Vishal and Pollak, David|9781484202326\n2020-02-11T00:00:01Z|Pragmatic Bookshelf|Modern Systems Programming with Scala Native: Write Lean, High-Performance Code without the JVM|Whaling, Richard|9781680506228\n2015|Packt Publishing|Scala Data Analysis Cookbook|Manivannan, Arun|9781784394998\n2015|Packt Publishing|RESTful Web Services with Scala|Dirksen, Jos|9781785283499\n2016|Packt Publishing|Scala Design Patterns|Nikolov, Ivan|9781785882500\n2016|Chapman and Hall/CRC|Introduction to Programming and Problem-Solving Using Scala (Chapman & Hall/CRC Textbooks in Computing Book 19)|Lewis, Mark C. and Lacher, Lisa|9781498730969\n2017-07-25T00:00:01Z|Packt Publishing|Scala and Spark for Big Data Analytics: Explore the concepts of functional programming, data streaming, and machine learning|Karim, Md. Rezaul and Alla, Sridhar|9781785280849\n2018|Packt Publishing|Learn Scala Programming: A comprehensive guide covering functional and reactive programming with Scala 2.13, Akka, and Lagom|Schmidt, Slava|9781788830997\n2016|Wrox|Professional Scala|Bogucki, Janek and Lacava, Alessandro and Bedrytski, Aliaksandr and de Detrich, Matthew and Neil, Benjamin|9781119267263\n2016|Packt Publishing|Building a Recommendation Engine with Scala|Ansari, Saleem|9781785282584\n2014|Packt Publishing|Scala for Machine Learning|Nicolas, Patrick R.|9781783558742\n2018|Packt Publishing|Scala Programming Projects: Build real world projects using popular Scala frameworks like Play, Akka, and Spark|Valot, Mikael and Jorand, Nicolas|9781788397643\n2014|Packt Publishing|Scala for Java Developers|Alexandre, Thomas|9781783283637\n2018|Apress|Practical Apache Spark: Using the Scala API|Chellappan, Subhashini and Ganesan, Dharanitharan|9781484236529\n2018|Packt Publishing|Mastering Functional Programming: Functional techniques for sequential and parallel programming with Scala|Kmetiuk, Anatolii|9781788620796\n2018-10-31T00:00:01Z|Packt Publishing|Learn Scala Programming: A comprehensive guide covering functional and reactive programming with Scala 2.13, Akka, and Lagom|Schmidt, Slava|9781788836302\n2016|Packt Publishing|Mastering Scala Machine Learning|Kozlov, Alex|9781785880889\n2012|Artima Inc|Actors in Scala|Haller, Philipp and Sommers, Frank|9780981531656\n2017|Apress|Practical Scala DSLs: Real-World Applications Using Domain Specific Languages|Riti, Pierluigi|9781484230367\n2016-10-16T00:00:01Z|CreateSpace Independent Publishing Platform|Scala programming: Learn Scala Programming FAST and EASY! (Programming is Easy) (Volume 11)|Gimson, Matthew|9781539510796\n2013T||Atomic Scala - learn programming in the language of the future|Bruce Eckel, Dianne Marsh|9780981872513\n2016|Packt Publishing|Scientific Computing with Scala|Jancauskas, Vytautas|9781785886942\n2018|Packt Publishing|Modern Scala Projects: Leverage the power of Scala for building data-driven and high-performant projects|Gurusamy, Ilango|9781788624114\n2013|Springer|Scala Design Patterns: Patterns for Practical Reuse and Design|Hunt, John|9783319021911\n2015|Packt Publishing|RESTful Web Services with Scala|Dirksen, Jos|9781785289408\n2013|Springer|Scala Design Patterns: Patterns for Practical Reuse and Design|Hunt, John|9783319021928\n2018-01-30T00:00:01Z|Packt Publishing|Learning Scala Programming: Object-oriented programming meets functional reactive to create Scalable and Concurrent programs|Sharma, Vikash|9781788392822\n2016-02-29|Packt Publishing - ebooks Account|Reactive Programming with Scala and Akka|Prasanna Kumar Sathyanarayanan|9781783984343\n2015|CreateSpace Independent Publishing Platform|Scala programming: Learning Scala fast!|Archer, Ralph|9781518888489\n2017-09-18T00:00:01Z|Independently published|XML Processing with Scala (Programming with Scala)|Upadhyaya, Bhim|9781549772054\n2017-05-29T00:00:01Z|CreateSpace Independent Publishing Platform|A taste of Functional Programming in Scala|Mandal, Malay|9781547018949\n2013|O'Reilly Media|Lift Cookbook: Recipes from the Community for Building Web Applications with Scala|Dallaway, Richard|9781449362683\n2017-07-27T00:00:01Z|Chapman and Hall/CRC|Introduction to the Art of Programming Using Scala|Lewis, Mark C.|9781138460836\n2015|Dreamtech Press India|Functional Programming In Scala|Chiusano Bjarnason|9789351197638\n2016|Machinery Industry Press|Scala programming combat(Chinese Edition)|Alvin Alexander ZHU|9787111526865\n2015|Createspace|Learn Scala For Java Developers|Toby Weston|9781508734178\n20200123|O'Reilly Media, Inc.|Modern Systems Programming with Scala Native|Richard Whaling|9781680507492\n2015|Apress|Concurrent Application Development Using Akka With Scala|Meetu Maltiar and Vikas Hazrati|9781430258964\n|Electronic Industry Press|Scala Programming (4th Edition) (by The Blog Post)(chinese Edition)|[ De ] Martin Odersky ( Ma Ding · Ao De Si Ji ) , Lex Spoon ( Lai Si · Peng ) , Bill Venners ( Bi Er · Wen Na Si ) , Gao Yu Xiang Yi|9787121402722\n20130801|O'Reilly Media, Inc.|Scala Cookbook|Alvin Alexander|9781449340322\n20090915|O'Reilly Media, Inc.|Programming Scala|Dean Wampler; Alex Payne|9781449379261\n2017-09-19|Packt Publishing|Scala Microservices|Jatin Puri and Selvam Palanimalai|9781786460134\n||Professional Scala|Nimish Narang|9781789531190\n20141204|O'Reilly Media, Inc.|Programming Scala|Dean Wampler; Alex Payne|9781491950159\n20210810|O'Reilly Media, Inc.|Scala Cookbook|Alvin Alexander|9781492051497\n20141211|O'Reilly Media, Inc.|Learning Scala|Jason Swartz|9781449368845\n20130801|O'Reilly Media, Inc.|Scala Cookbook|Alvin Alexander|9781449340339\n20210526|O'Reilly Media, Inc.|Programming Scala|Dean Wampler|9781492077848\n31-07-2018|Packt Publishing|Professional Scala|Mads Hartmann; Ruslan Shevchenko|9781789534702\n20141211|O'Reilly Media, Inc.|Learning Scala|Jason Swartz|9781449368838\n20131003|Simon & Schuster|Play for Scala|Peter Hilton; Erik Bakker|9781638353713\n20130124|O'Reilly Media, Inc.|Testing in Scala|Daniel Hinojosa|9781449360337\n2010||Scala (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130925253\n2016-09-15|LAP LAMBERT Academic Publishing|Concurrency in Scala|Marvin Hansen|9783659946080\n30-01-2018|Packt Publishing|Learning Scala Programming|Vikash Sharma|9781788391610\n20120513|Simon & Schuster|Scala in Depth|Josh Suereth|9781638352648\n20130408|Simon & Schuster|Scala in Action|Nilanjan Raychaudhuri|9781638352419\n20100923|Cambridge University Press|Steps in Scala|Christos K. K. Loverdos; Apostolos Syropoulos|9780511795985\n28-02-2018|Packt Publishing|Scala Reactive Programming|Rambabu Posa|9781787282872\n30-07-2018|Packt Publishing|Modern Scala Projects|Ilango gurusamy|9781788625272\n20220125|Springer Nature|Beginning Scala 3|David Pollak; Vishal Layka; Andres Sacco|9781484274224\n20130124|O'Reilly Media, Inc.|Testing in Scala|Daniel Hinojosa|9781449360344\n29-09-2018|Packt Publishing|Scala Programming Projects|Mikael Valot; Nicolas Jorand|9781788395342\n2020||Practical Fp In Scala|Gabriel Volpe|9781714556793\n20171212|Springer Nature|Scala for Java Developers|Toby Weston|9781484231081\n20211005|Simon & Schuster|Get Programming with Scala|Daniela Sfregola|9781638352259\n2016-12-08|Packt Publishing|Building Applications with Scala|Diego Pacheco|9781786461681\n27-04-2016|Packt Publishing|Scientific Computing with Scala|Vytautas Jancauskas|9781785887475\n28-01-2016|Packt Publishing|Scala for Data Science|Pascal Bugnion|9781785289385\n28-06-2016|Packt Publishing|Mastering Scala Machine Learning|Alex Kozlov|9781785885266\n29-12-2015|Packt Publishing|Scala Functional Programming Patterns|Atul S. Khot|9781783985852\n2016-12-08|Packt Publishing|Building Applications with Scala|Diego Pacheco|9781786461483\n20140425|Packt Publishing|Scala for Java Developers|Thomas Alexandre|9781783283644\n31-01-2018|Packt Publishing|Scala Machine Learning Projects|Md. Rezaul Karim|9781788471473\n2019|Independently Published|Scala Tutorials: Computer Programming Language Scala Tutorials To Learn The Easy Way!|Nitin Kanani|9781678687601\n2017|O'Reilly Media, Incorporated|Scala For Spark In Production|Alexy Khrabrov and Andy Petrella and Xavier Tordoir|9781491929285\n2015-11-12|Createspace Independent Publishing Platform|Scala Programming: Learn Scala Programming Fast And Easy! (programming Is Easy) (volume 11)|Matthew Gimson|9781519203540\n22-02-2017|Packt Publishing|Learning Concurrent Programming in Scala|Aleksandar Prokopec|9781786462145\n20150529|Packt Publishing|Mastering Play Framework for Scala|Shiti Saxena|9781783983810\n26-09-2017|Packt Publishing|Scala for Machine Learning - Second Edition|Patrick R. Nicolas|9781787126206\n20190226|Springer Nature|Data Structures and Algorithms with Scala|Bhim P. Upadhyaya|9783030125615\n2016-01-05|Packt Publishing|Building a Recommendation Engine with Scala|Saleem Ansari|9781785282980\n2016-02-29|Packt Publishing|Reactive Programming with Scala and Akka|Prasanna Kumar Sathyanarayanan|9781783984350\n20190705|Springer Nature|Scala Programming for Big Data Analytics|Irfan Elahi|9781484248102\n30-04-2019|Packt Publishing|Machine Learning with Scala Quick Start Guide|Md. Rezaul Karim|9781789345414\n20160826|CRC Press|Introduction to Programming and Problem-Solving Using Scala|Mark C. Lewis|9781498730976\n20121105|Taylor & Francis|Introduction to the Art of Programming Using Scala|Mark C. Lewis|9781466558724\n20170106|Taylor & Francis|Object-Orientation, Abstraction, and Data Structures Using Scala|Mark C. Lewis; Lisa L. Lacher|9781498732192\n20121105|Taylor & Francis|Introduction to the Art of Programming Using Scala|Mark C. Lewis|9781498759687", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2012|Chisel: Constructing hardware in a Scala embedded language|10.1145/2228360.2228584|597|85|J. Bachrach and H. Vo and B. Richards and Yunsup Lee and Andrew Waterman and R. Avizienis and J. Wawrzynek and K. Asanović|021464b67bb87cf6132b2eb5b0c4a61f31ec2775\n2014|Unifying functional and object-oriented programming with Scala|10.1145/2591013|50|6|Martin Odersky and Tiark Rompf|ac6a6e4601cd33d43cc71e8c1f6998d19228da64\n2011|Scala to the Power of Z3: Integrating SMT and Programming|10.1007/978-3-642-22438-6_30|40|0|A. Köksal and Viktor Kuncak and Philippe Suter|4a0eb42ded1878f39539aceca207f55dea2d8fbe\n2011|Closing the Gap Between Specification and Programming: VDM++ and Scala|10.29007/2w2f|12|3|K. Havelund|bf49af99588dcf766f2964ed2f0c7a6a526b2b92\n2010|Named and default arguments for polymorphic object-oriented languages: a discussion on the design implemented in the Scala language|10.1145/1774088.1774529|7|0|Lukas Rytz and Martin Odersky|d1d423354d12e5bca47e8aad6d0374d772b3acfb\n2016|Lightweight Session Programming in Scala (Artifact)|10.4230/DARTS.2.1.11|6|0|A. Scalas and N. Yoshida|62eb6ce864f9f5a03de6814e0d07cfbbfefea67d\n2016|A scalable infrastructure for teaching concepts of programming languages in Scala with WebLab: an experience report|10.1145/2998392.2998402|4|0|T. V. D. Lippe and Thomas Smith and Daniël A. A. Pelsmaeker and E. Visser|00ae557f0b8b87cb0fbb51b9f09858f2ce7df2e7\n2017|Introduction to the Art of Programming Using Scala|10.5860/choice.50-5635|4|0|Mark C. Lewis|adf89c24062d6bfde6d410687db812d3b62364fc\n2018|The Scala Language|10.1007/978-1-4842-3108-1_1|4|1|T. Weston|d37fe7e79b56102ee8ad9e5ae6e88142ffa11546\n2018|Scalagna 0.1: towards multi-tier programming with Scala and Scala.js|10.1145/3191697.3191731|4|0|Bob Reynders and Michael Greefs and D. Devriese and F. Piessens|54eb28a939999162d48773b236679fb40969b5bd\n2019|Scala implicits are everywhere: a large-scale study of the use of Scala implicits in the wild|10.1145/3360589|3|1|Filip Krikava and H. Miller and J. Vitek|f251ead7ee9604c89ac9e961bf82c61387003a8d\n2013|What are the Odds?: probabilistic programming in Scala|10.1145/2489837.2489848|3|0|Sandro Stucki and Nada Amin and Manohar Jonnalagedda and Tiark Rompf|dbf9f9b4d9345da707ddf3ffb4c699f09e45479f\n2021|Integrated Modeling and Development of Component-Based Embedded Software in Scala|10.1007/978-3-030-89159-6_16|3|0|K. Havelund and R. Bocchino|9578f08a6492ad0b8de98f42040e2ca633d36b9e\n2015|Associated types and constraint propagation for generic programming in Scala|10.1134/S0361768815040064|3|0|Artem Pelenitsyn|bc8f8736fa0e350445fae4f75fb4fd6dd9cf30d6\n2015|Distributed programming in Scala with APGAS|10.1145/2774975.2774977|2|1|Philippe Suter and O. Tardieu and Josh Milthorpe|1b566c35d3f4ed8850cf08eac619b0626c469142\n2016|Scowl: a Scala DSL for programming with the OWL API|10.21105/JOSS.00023|2|0|J. Balhoff|0e163b6bea8cd698c47661936fee17f6b061f637\n2012|Towards an agent-oriented programming language based on Scala|10.1063/1.4756170|2|0|Dejan Mitrovic and M. Ivanović and Z. Budimac|8265cc5bd3c727b6beb0f1c3cd477db425a3c12c\n2020|Implementing a Language for Distributed Systems: Choices and Experiences with Type Level and Macro Programming in Scala|10.22152/programming-journal.org/2020/4/17|2|0|P. Weisenburger and G. Salvaneschi|fa594cdb544a7d4f08d9d8246a810ae0e45ebc63\n2010|Extension of scala language by distributed and parallel computing tools with Linda coordination system|10.1007/S10559-010-9238-6|1|0|M. Glybovets and S. S. Gorohovskiy and M. S. Stukalo|97733d941f73d4f7b738b1285c4a3f0156bfd225\n2019|A tool written in Scala for preparation and analysis in MD simulation and 3D-RISM calculation of biomolecules|10.2142/biophysico.16.0_485|1|0|I. Onishi and Hiroto Tsuji and M. Irisa|12d2edebec462ed4571dc0aadea5991d54281802\n2019|Hybrid Taint Flow Analysis in Scala|10.1109/SSCI44817.2019.9002738|1|0|Mohammadreza Ashouri and C. Kreitz|38f3bd7f797332a97c4a5e2fa05e2aa9704a02e1\n2020|Kaizen: a scalable concolic fuzzing tool for Scala|10.1145/3426426.3428487|1|0|Mohammadreza Ashouri|6d04b9af1801e0ac90e04f238a23c3c5357b55d6\n2020|A Study of Big Data Analytics using Apache Spark with Python and Scala|10.1109/ICISS49785.2020.9315863|1|0|Y. Gupta and Surbhi Kumari|b932ecaf6825fb5a8b838dab9a0e66e7cea3eabf\n2015|Programming in Scala|10.1007/978-1-4842-0964-6_2|1|0|M. Guller|c70cd8d8c27808f6118bdd1bfd1d52fa13b8a6e8\n2019|Programming Behavioral Test Models for SMT Solving in Scala|10.1109/ICSTW.2019.00032|1|0|B. Aichernig and Benedikt Maderbacher and Stefan Tiran|d5130df1d0dffd54c5eba84255ef93804324de92\n2017|Implementation of a MIX Emulator: A Case Study of the Scala Programming Language Facilities|10.1515/acss-2017-0017|1|0|R. Batdalov and O. Ņikiforova|9d0840c9135fb1092d4ef9f0c59aaee46e371964" }, "scalpel": { "title": "SCALPEL", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0c5caf0afa67fb231d21762c6f46e85893de46e1" ], "country": [ "United States" ], "originCommunity": [ "The Medical College of Wisconsin" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4896", "centralPackageRepositoryCount": 0 }, "scaml": { "title": "Scala Markup Language", "appeared": 2010, "type": "template", "website": "https://scalate.github.io/scalate/documentation/scaml-reference.html", "country": [ "Japan and Greece" ], "originCommunity": [ "https://github.com/scalate" ], "githubLanguage": { "fileExtensions": [ "scaml" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "text", "tmScope": "source.scaml", "repos": 0, "id": "Scaml" }, "githubBigQuery": { "repos": 7, "users": 7, "id": "Scaml" }, "pygmentsHighlighter": { "filename": "html.py", "fileExtensions": [ "scaml" ], "id": "Scaml" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2015, "committerCount": 3, "commitCount": 7, "sampleCount": 1, "example": [ "%p\n Hello,\n World!" ], "url": "https://github.com/scalate/Scalate.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "scan": { "title": "SCAN", "appeared": 1987, "type": "pl", "reference": [ "https://semanticscholar.org/paper/01b11307ef7b8c67b1ebb60f56919cf69de44b09" ], "country": [ "Germany" ], "originCommunity": [ "Goethe University Frankfurt" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1521", "wordRank": 3956, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1996|Palingol: a declarative programming language to describe nucleic acids' secondary structures and to scan sequence database.|10.1093/NAR/24.8.1395|94|6|B. Billoud and M. Kontic and A. Viari|5da731820bc1c93b30a271da7ff90de85088dbf9\n1994|A Correctness Proof of Parallel Scan|10.1142/S0129626494000302|25|0|J. O'Donnell|d361f040b42a16a636bee7d5ccbc230ad262c2f8\n2002|Linear Scan Register Allocation in a High-Performance Erlang Compiler|10.1007/3-540-45587-6_8|14|1|E. Johansson and Konstantinos Sagonas|4a7247cc9148580ea490872ea30a11815ef90781\n2020|Detection of COVID-19 in Computed Tomography (CT) Scan Images using Deep Learning|10.30534/ijatcse/2020/77952020|2|0|Yahya Saleh Abdulrazak and Letchmikanthan Ilango|1af8f008987e15fa20a9e0e7a113b745a5e00d98" }, "scat": { "title": "SCAT", "appeared": 1957, "type": "assembly", "reference": [ "http://bitsavers.org/pdf/ibm/share/SOS_Reference_Manual_Jun61.pdf" ], "standsFor": "SHARE Compiler-Assembler-Translator", "hopl": "https://hopl.info/showlanguage.prx?exp=3197" }, "scenic": { "title": "Scenic", "appeared": 2019, "type": "pl", "description": "A Language for Scenario Specification and Scene Generation. We propose a new probabilistic programming language for the design and analysis of perception systems, especially those based on machine learning. Specifically, we consider the problems of training a perception system to handle rare events, testing its performance under different conditions, and debugging failures. We show how a probabilistic programming language can help address these problems by specifying distributions encoding interesting types of inputs and sampling these to generate specialized training and test sets. More generally, such languages can be used for cyber-physical systems and robotics to write environment models, an essential prerequisite to any formal analysis. In this paper, we focus on systems like autonomous cars and robots, whose environment is a scene, a configuration of physical objects and agents. We design a domain-specific language, Scenic, for describing scenarios that are distributions over scenes. As a probabilistic programming language, Scenic allows assigning distributions to features of the scene, as well as declaratively imposing hard and soft constraints over the scene. We develop specialized techniques for sampling from the resulting distribution, taking advantage of the structure provided by Scenic's domain-specific syntax. Finally, we apply Scenic in a case study on a convolutional neural network designed to detect cars in road images, improving its performance beyond that achieved by state-of-the-art synthetic data generation methods.", "reference": [ "https://scenic-lang.readthedocs.io/en/latest/", "https://dl.acm.org/doi/10.1145/3314221.3314633", "https://math.berkeley.edu/~dfremont/images/scenic-video-abstract.mp4" ], "country": [ "United States" ], "originCommunity": [ "University of California, Berkeley" ] }, "schemal": { "title": "SCHEMAL", "appeared": 1983, "type": "pl", "reference": [ "https://www.semanticscholar.org/paper/SCHEMAL%3A-Yet-Another-Conceptual-Schema-Definition-Frost/41d5967044ef078be763723f98cf93e90432cf3b" ], "country": [ "United Kingdom" ], "originCommunity": [ "University of Strathclyde" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5966", "centralPackageRepositoryCount": 0 }, "schemaorg": { "title": "Schema.org", "appeared": 2011, "type": "dataValidationLanguage", "website": "http://schema.org", "country": [ "Various" ], "originCommunity": [ "https://groups.google.com/g/schema-org-sg" ], "domainName": { "registered": 2005, "awisRank": { "2017": 26623, "2022": 12797 }, "name": "schema.org" }, "wikipedia": { "example": [ "" ], "related": [ "rdf", "owl", "turtle", "json", "csv", "url" ], "summary": "Schema.org is an initiative launched on 2 June 2011 by Bing, Google and Yahoo! (then operators of the world's largest search engines) to “create and support a common set of schemas for structured data markup on web pages.” In November 2011 Yandex (whose search engine is the largest one in Russia) joined the initiative. They propose using the schema.org vocabulary along with the Microdata, RDFa, or JSON-LD formats to mark up website content with metadata about itself. Such markup can be recognized by search engine spiders and other parsers, thus gaining access to the meaning of the sites (see Semantic Web). The initiative also describes an extension mechanism for adding additional properties. Public discussion of the initiative largely takes place on the W3C public vocabularies mailing list. In 2012, the GoodRelations ontology was integrated into Schema.org. Much of the vocabulary on schema.org was inspired by earlier formats such as Microformats, FOAF, and OpenCyc. Microformats, with its most dominant representative hCard, continue (as of 2015) to be published widely in the Web, where the deployment of schema.org has strongly increased between 2012 and end 2014. To test the validity of the data marked up with the schemas and Microdata, such validators as the Google Structured Data Testing Tool, Yandex Microformat validator and Bing Markup Validator can be used. Some Schema markups such as Organization and Person are used to influence Google's Knowledge Graph results.", "pageId": 31963682, "dailyPageViews": 154, "created": 2011, "backlinksCount": 58, "revisionCount": 183, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Schema.org" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "schematron": { "title": "Schematron", "appeared": 1999, "type": "xmlFormat", "country": [ "Republic of China (Taiwan)" ], "originCommunity": [ "Academia Sinica" ], "example": [ "\n \n Date rules\n \n ContractDate should be\nin the past because future contracts are not allowed.\n \n \n" ], "wikipedia": { "summary": "Schematron is a rule-based validation language for making assertions about the presence or absence of patterns in XML trees. It is a structural schema language expressed in XML using a small number of elements and XPath. In a typical implementation, the Schematron schema XML is processed into normal XSLT code for deployment anywhere that XSLT can be used. Schematron is capable of expressing constraints in ways that other XML schema languages like XML Schema and DTD cannot. For example, it can require that the content of an element be controlled by one of its siblings. Or it can request or require that the root element, regardless of what element that is, must have specific attributes. Schematron can also specify required relationships between multiple XML files. Constraints and content rules may be associated with \"plain-English\" validation error messages, allowing translation of numeric Schematron error codes into meaningful user error messages. The current ISO recommendation is Information technology, Document Schema Definition Languages (DSDL), Part 3: Rule-based validation, Schematron (ISO/IEC 19757-3:2016).", "backlinksCount": 35, "pageId": 347726, "dailyPageViews": 40, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/Schematron" } }, "scheme-2-d": { "title": "Scheme 2-D", "appeared": 2021, "type": "pl", "creators": [ "elucent" ], "description": "Introducing the future of Scheme...take your S-expressions to the next level with Scheme 2-D!", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/ntr4l5/introducing_the_future_of_schemetake_your/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/elucent/scheme2d/issues" ], "githubRepo": { "firstCommit": 2021, "stars": 68, "forks": 2, "subscribers": 2, "created": 2021, "updated": 2022, "description": "The future of programming.", "issues": 0, "url": "https://github.com/elucent/scheme2d" }, "repoStats": { "firstCommit": 2021, "commits": 1, "committers": 1, "files": 6 } }, "scheme": { "title": "Scheme", "appeared": 1970, "type": "pl", "creators": [ "Guy Steele", "Gerald Jay Sussman" ], "website": "http://www.scheme-reports.org/", "documentation": [ "https://docs.scheme.org/" ], "fileExtensions": [ "scm", "ss" ], "country": [ "United States" ], "originCommunity": [ "https://community.scheme.org/" ], "domainName": { "registered": 2009, "name": "scheme-reports.org" }, "releaseNotesUrl": "https://www.scheme.com/csv6.9c/6.9c.html", "isLisp": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasMacros": { "example": "(define-syntax backwards\n (syntax-rules ()\n ((_) (syntax-error \"(backwards) not allowed\"))\n ((_ e) e)\n ((_ e1 ... e2)\n (begin e2 (backwards e1 ...)))))", "value": true }, "hasPrefixNotation": { "example": "(+ 1 2 3)", "value": true }, "hasHomoiconicity": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "#| A comment\n|#", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ ";" ] ], "multiLineCommentTokens": [ [ "#|", "|#" ] ], "printToken": [ [ "display" ] ], "stringToken": [ [ "\"" ] ], "keywords": [ "case", "do", "let", "loop", "if", "else", "when", "cons", "car", "cdr", "cond", "lambda", "lambda*", "syntax-rules", "format", "set!", "quote", "eval", "append", "list", "list?", "member?", "load" ], "wikipedia": { "example": [ "(set! +\n (let ((original+ +))\n (lambda args\n (if (and (not (null? args)) (string? (car args)))\n (apply string-append args)\n (apply original+ args)))))\n(+ 1 2 3)\n===> 6\n(+ \"1\" \"2\" \"3\")\n===> \"123\"" ], "related": [ "t", "lisp", "algol", "clojure", "common-lisp", "dylan", "eulisp", "haskell", "javascript", "julia", "lua", "r", "s", "racket", "ruby", "rust", "scala", "planner", "ikarus", "larceny", "unicode", "s-expressions", "fortran", "c", "guile", "emacs-lisp", "android" ], "summary": "Scheme is a functional programming language and one of the two main dialects of the programming language Lisp. Unlike Common Lisp, the other main dialect, Scheme follows a minimalist design philosophy specifying a small standard core with powerful tools for language extension. Scheme was created during the 1970s at the MIT AI Lab and released by its developers, Guy L. Steele and Gerald Jay Sussman, via a series of memos now known as the Lambda Papers. It was the first dialect of Lisp to choose lexical scope and the first to require implementations to perform tail-call optimization, giving stronger support for functional programming and associated techniques such as recursive algorithms. It was also one of the first programming languages to support first-class continuations. It had a significant influence on the effort that led to the development of Common Lisp. The Scheme language is standardized in the official IEEE standard and a de facto standard called the Revisedn Report on the Algorithmic Language Scheme (RnRS). The most widely implemented standard is R5RS (1998); a new standard, R6RS, was ratified in 2007. Scheme has a diverse user base due to its compactness and elegance, but its minimalist philosophy has also caused wide divergence between practical implementations, so much that the Scheme Steering Committee calls it \"the world's most unportable programming language\" and \"a family of dialects\" rather than a single language.", "pageId": 28119, "dailyPageViews": 705, "created": 2001, "backlinksCount": 929, "revisionCount": 1710, "appeared": 1970, "fileExtensions": [ "scm", "ss" ], "url": "https://en.wikipedia.org/wiki/Scheme_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "scm", "sch", "sld", "sls", "sps", "ss" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "scheme", "guile", "bigloo", "chicken", "csi", "gosh", "r6rs" ], "aceMode": "scheme", "codemirrorMode": "scheme", "codemirrorMimeType": "text/x-scheme", "tmScope": "source.scheme", "repos": 16742, "id": "Scheme" }, "githubBigQuery": { "repos": 7221, "users": 5469, "id": "Scheme" }, "monaco": "scheme", "codeMirror": "scheme", "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "scm", "ss" ], "id": "Scheme" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2014, "committerCount": 10, "commitCount": 42, "sampleCount": 4, "example": [ "(define-library (libs basic)\n (export list2 x)\n (begin\n (define (list2 . objs) objs)\n (define x 'libs-basic)\n (define not-exported 'should-not-be-exported)\n ))\n" ], "url": "https://github.com/textmate/scheme.tmbundle" }, "projectEuler": { "memberCount": { "2019": 791, "2022": 817 }, "id": "Scheme" }, "helloWorldCollection": [ "; Hello World in Scheme\n\n(display \"Hello, world!\")\n(newline)" ], "leachim6": { "filepath": "s/Scheme.scm", "fileExtensions": [ "scm" ], "example": [ "(display \"Hello World\") (newline)\n" ], "id": "Scheme" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Scheme", "quineRelay": "Scheme", "rijuRepl": { "example": [ "(display \"Hello, world!\")\n(newline)\n" ], "id": "https://riju.codes/scheme" }, "replit": "https://repl.it/languages/scheme", "indeedJobs": { "2017": 1174, "query": "scheme engineer" }, "officialBlogUrl": [ "https://planet.scheme.org/" ], "eventsPageUrl": [ "https://events.scheme.org/" ], "faqPageUrl": [ "http://community.schemewiki.org/?scheme-faq" ], "tiobe": { "id": "Scheme" }, "hopl": "https://hopl.info/showlanguage.prx?exp=694", "ubuntuPackage": "guile-2.0", "jupyterKernel": [ "https://github.com/Calysto/calysto_scheme" ], "fileType": "text", "wordRank": 2803, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1997|Springer-verlag New York Inc.|Programming And Meta-programming In Scheme|Jon Pearce and D. Gries and F. B. Schneider|9780387983202\n1989|Mit Pr|Scheme and the Art of Programming|Springer, George and Friedman, Daniel P.|9780262192880\n2003|The MIT Press|The Scheme Programming Language|Dybvig, R. Kent|9780262541480\n2003|Kendall Hunt Publishing|INTRODUCTION TO PROGRAMMING LANGUAGES: PRINCIPLES, C, C++, SCHEME AND PROLOG|Yinong Chen|9780757503672\n1996|Prentice Hall|The Scheme Programming Language, ANSI Scheme|Dybvig, R. Kent|9780134546469\n2022|PHI Publisher|SCHEME PROGRAMMING LANGUAGE, THE, 4TH ED. [Paperback] DYBVIG|DYBVIG|9788120343009\n1988|Prentice Hall|An Introduction to Scheme|Smith, Jerry D.|9780134967127\n1989|The Mit Press 1989-09-13|Scheme And The Art Of Programming|Springer and George|9780262691369\n2021|Linus Publications, Inc.|An Introduction to Functional Programming with Scheme||9781934188996\n2012|LAP LAMBERT Academic Publishing|Chaos-based Encryption: A highly preferable Encryption Scheme|Sohail, Shahab Saquib and Ahmad, Musheer|9783659193880\n2019-11-15T00:00:01Z|Kendall Hunt Pub Co|Introduction to Programming Languages: Programming in C C++ Scheme Prolog C# and Python|Chen, Yinong|9781792407994\n2009|The MIT Press|The Scheme Programming Language, fourth edition|Dybvig, R. Kent|9780262258166\n2009|The MIT Press|The Scheme Programming Language, fourth edition (The MIT Press)|Dybvig, R. Kent|9780262512985\n1999|The MIT Press|Simply Scheme - 2nd Edition: Introducing Computer Science|Harvey, Brian and Wright, Matthew|9780262082815\n1990|The MIT Press|Programming in Scheme (The MIT Press)|Eisenberg, Michael|9780262550178\n2012|Springer|Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science)|Pearce, Jon|9781461216827\n1998|Course Technology|Concrete Abstractions: An Introduction to Computer Science Using Scheme|Hailperin, Max and Kaiser, Barbara and Knight, Karl|9780534952112\n2012-01-26T00:00:01Z|Kendall Hunt Publishing|INTRODUCTION TO PROGRAMMING LANGUAGES: PRINCIPLES, C, C++, SCHEME AND PROLOG|CHEN YINONG and TSAI WEI-TEK|9780757529740\n1983-05-01T00:00:01Z|Mcgraw Hill|Scheme and the Art of Programming|George Springer and Daniel P. Friedman|9780070605220\n2013|Springer|Exploring Computer Science with Scheme (Undergraduate Texts in Computer Science)|Grillmeyer, Oliver|9781475729375\n2012|Springer|Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science)|Pearce, Jon|9781461272434\n1995|Prentice Hall|The Scheme Programming Language|Dybvig, R. Kent|9780137918645\n1991-05-01T00:00:01Z|Inst of Elect & Electronic|IEEE Standard for the Scheme Programming Language/Std 1178-1990||9781559371254\n2015|LAP LAMBERT Academic Publishing|Subcarrier/Power allocation Scheme for OFDMA Networks: Load Adaptive, Decentralized and Time Efficient|Shahzad, Muhammad Adil and Hasan Ali, Aamir|9783659804083", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1986|Revised5 Report on the Algorithmic Language Scheme|10.1145/290229.290234|570|60|H. Abelson and R. K. Dybvig and C. T. Haynes and G. Rozas and IV N.I.Adams and D. Friedman and E. Kohlbecker and G. Steele and D. H. Bartley and R. Halstead and D. Oxley and G. Sussman and G. Brooks and C. Hanson and K. Pitman and M. Wand|cb447a69faf544c9047492fdb44e4c47c1cfdee1\n1991|Revised4 report on the algorithmic language scheme|10.1145/382130.382133|440|24|H. Abelson and R. K. Dybvig and C. T. Haynes and G. Rozas and N. Adams and D. Friedman and E. Kohlbecker and G. Steele and D. H. Bartley and R. Halstead and D. Oxley and G. Sussman and G. Brooks and C. Hanson and K. Pitman and M. Wand and W. Clinger and J. Rees|23cc11e91a6eb4c748995a8b7f5641930372d267\n2002|DrScheme: a programming environment for Scheme|10.1017/S0956796801004208|328|19|R. Findler and John Clements and C. Flanagan and M. Flatt and S. Krishnamurthi and P. Steckler and M. Felleisen|d8086b8d23801013482c2e571b387dee81bc1817\n2008|The design and implementation of typed scheme|10.1145/1328438.1328486|297|35|Sam Tobin-Hochstadt and M. Felleisen|1b4df92d7f0d9393103cafbdbc512c52a90296b8\n1986|Revised3 report on the algorithmic language scheme|10.1145/15042.15043|209|20|J. Rees and W. Clinger|43b2bcd702c7a2228814f59e393ab6c730c3ca29\n2009|Revised6 Report on the Algorithmic Language Scheme|10.1017/S0956796809990074|151|14|Michael Sperber and R. K. Dybvig and M. Flatt and A. V. Straaten and R. Findler and Jacob Matthews|b22d0c0a48e755098ff3bb4cf185a79847e32464\n1991|IEEE standard for the Scheme programming language|10.1109/ieeestd.1991.101032|117|6|Microcomputer Standards Subcommittee|41289b96500579c567de1ad9a62b26e9bc9c35ae\n2019|Adaptive Protection Coordination Scheme Using Numerical Directional Overcurrent Relays|10.1109/TII.2018.2834474|84|1|M. Alam|5d4f3a0aa3980cfe18f5e7081b421684258719fd\n2011|inGAP-sv: a novel scheme to identify and visualize structural variation from paired end mapping data|10.1093/nar/gkr506|79|4|J. Qi and F. Zhao|bf96c20e3672fb6bed09e9db4b1986f84c61bb6f\n2011|Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme|10.1007/s11241-011-9126-9|76|8|A. Burns and Robert I. Davis and P. Wang and Fengxiang Zhang|0087e4167285d7c66c067de4a87567764ee99a17\n1969|An automatic grading scheme for simple programming exercises|10.1145/362946.362981|56|3|J. Hext and J. W. Winings|cbbc8f3d96d80a67bbb44b98b982a1af6281fe48\n1988|Object-oriented programming in scheme|10.1145/62678.62720|52|1|N. Adams and J. Rees|ee3bcdeccb98e446d3b9933a59600e511f0afbb9\n2006|Concurrency oriented programming in termite scheme|10.1145/1159789.1159795|45|3|G. Germain|55088ec7fa27a01ddfe42566baacb2c7ca6e7e4c\n2010|A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model|10.1007/978-3-642-16901-4_39|22|0|Scott West and Sebastian Nanz and B. Meyer|851892ef4cf5ce2dc4e75cac11552dfcedefc2db\n2005|An Equational Specification for the Scheme Language|10.3217/jucs-011-07-1327|19|2|Marcelo d’Amorim and G. Rosu|ea7c32092b5674db19f7283d04ae2feb33252333\n1999|Programming World Wide Web pages in scheme|10.1145/344283.344292|17|2|K. Nørmark|5b85af04e42aad6999c822a7dd49d15bb0487a3e\n2012|An adaptive, agent-based protection scheme for radial distribution networks based on IEC 61850 and IEC 61499|10.1049/CP.2012.0764|15|0|D. Pala and C. Tornelli and G. Proserpio|ab95c06583442609ca79bacdc9c77b20dc9e1ca8\n2000|Bee: an integrated development environment for the Scheme programming language|10.1017/S0956796800003725|14|0|M. Serrano|f0250b025f5405ddfeace27d5064c7e2ed84b210\n2009|Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines|10.1007/978-3-642-04164-8_10|11|0|Malgorzata Biernacka and O. Danvy|ba374a28af09de2b858218ce61505622d8d4657a\n2012|Compiling a Functional Logic Language: The Basic Scheme|10.1007/978-3-642-29822-6_5|8|0|S. Antoy and Arthur Peters|7f9e1f99f01557d9f77a5507f075cad3e76086e2\n2012|Bringing Scheme programming to the iPhone—Experience|10.1002/spe.1073|4|0|Engineer Bainomugisha and Jorge Vallejos and E. G. Boix and Pascal Costanza and T. D'Hondt and W. Meuter|e4fafba1a9b6cceb6900afbe58b7d2fe0e5dfef9\n2003|Programming graphical user interfaces with Scheme|10.1017/S0956796802004537|3|0|Erick Gallesio and M. Serrano|412762582c8b78d290f9a7a6a17de3e904b89249\n1992|The Scheme Programming Language|10.1016/B978-0-444-88135-9.50013-9|1|0|J. Franco and D. Friedman and O. Danvy|e7273e4b345308eebaecead6e8306215da661ebe" }, "school": { "title": "School", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/70905eb4d4aaae0e05e3082a98f46196fb6d2d98" ], "country": [ "Brazil" ], "originCommunity": [ "Universidade Federal Fluminense, Valonguinho and Pontificia Universidade CatSlica" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1746", "wordRank": 165, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|Pearson|Growing Up Gifted: Developing the Potential of Children at School and at Home|Clark, Barbara|9780132620666\n2013|ALA Editions|The Whole School Library Handbook 2|Blanche Woolls|9780838911273\n2014|O'Reilly Media|21st Century C: C Tips from the New School|Klemens, Ben|9781491903896" }, "schoonschip": { "title": "Schoonschip", "appeared": 1963, "type": "pl", "country": [ "Netherlands" ], "originCommunity": [ "Utrecht University" ], "wikipedia": { "backlinksCount": 14, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/Schoonschip" }, "hopl": "https://hopl.info/showlanguage.prx?exp=208" }, "schrodingers-equation": { "title": "Schrödinger's Equation", "appeared": 1925, "type": "equation" }, "scieneer-common-lisp": { "title": "Scieneer Common Lisp", "appeared": 2002, "type": "pl", "country": [ "Australia" ], "originCommunity": [ "Scieneer Pty Ltd" ], "wikipedia": { "dailyPageViews": -1, "url": "https://web.archive.org/web/20150326124630/https://en.wikipedia.org/wiki/Scieneer_Common_Lisp" }, "centralPackageRepositoryCount": 0 }, "scikit-learn": { "title": "Scikit-learn", "appeared": 2007, "type": "library", "creators": [ "David Cournapeau" ], "website": "http://scikit-learn.org/stable/", "country": [ "Various" ], "originCommunity": [ "https://github.com/scikit-learn" ], "writtenIn": [ "python", "c", "cpp" ], "githubRepo": { "stars": 50599, "forks": 23178, "subscribers": 2179, "created": 2010, "updated": 2022, "firstCommit": 2010, "description": "scikit-learn: machine learning in Python", "issues": 2223, "url": "https://github.com/scikit-learn/scikit-learn" }, "wikipedia": { "related": [ "python", "cython", "c", "linux", "numpy", "scipy", "nltk", "tensorflow", "matplotlib", "pandas" ], "summary": "Scikit-learn (formerly scikits.learn) is a free software machine learning library for the Python programming language. It features various classification, regression and clustering algorithms including support vector machines, random forests, gradient boosting, k-means and DBSCAN, and is designed to interoperate with the Python numerical and scientific libraries NumPy and SciPy.", "pageId": 33490859, "dailyPageViews": 360, "created": 2011, "backlinksCount": 95, "revisionCount": 126, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Scikit-learn" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "scil-vp": { "title": "SCIL-VP", "appeared": 1992, "type": "pl", "reference": [ "https://semanticscholar.org/paper/381f53ba494689cbba80302370be44f1d8c4a78c" ], "country": [ "The Netherlands" ], "originCommunity": [ "University of Amsterdam" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5546", "centralPackageRepositoryCount": 0 }, "scilab": { "title": "Scilab", "appeared": 1990, "type": "pl", "documentation": [ "https://wiki.scilab.org/Documentation" ], "country": [ "Various" ], "originCommunity": [ "https://gitlab.com/groups/scilab/-/issues" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "// (\\d+\\.\\d*|\\d*\\.\\d+)([eEf][+-]?[0-9]+)?", "value": true }, "hasIntegers": { "example": "// \\d+", "value": true }, "hasScientificNotation": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "disp" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "// A simple plot of z = f(x,y)\nt=[0:0.3:2*%pi]';\nz=sin(t)*cos(t');\nplot3d(t,t,z)" ], "related": [ "c", "java", "fortran", "freebsd", "linux", "matlab", "octave", "modelica", "simulink", "sagemath" ], "summary": "Scilab is an open source, cross-platform numerical computational package and a high-level, numerically oriented programming language. It can be used for signal processing, statistical analysis, image enhancement, fluid dynamics simulations, numerical optimization, and modeling, simulation of explicit and implicit dynamical systems and (if the corresponding toolbox is installed) symbolic manipulations. Scilab is one of the two major open-source alternatives to MATLAB, the other one being GNU Octave. Scilab is similar enough to MATLAB that some book authors (who use it) argue that it is easy to transfer skills between the two systems. Scilab however puts less emphasis on (bidirectional) syntactic compatibility with MATLAB than Octave does.", "pageId": 153563, "dailyPageViews": 214, "created": 2002, "backlinksCount": 147, "revisionCount": 432, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Scilab" }, "githubLanguage": { "fileExtensions": [ "sci", "sce", "tst" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.scilab", "repos": 3986, "id": "Scilab" }, "githubBigQuery": { "repos": 13048, "users": 7234, "id": "Scilab" }, "pygmentsHighlighter": { "filename": "matlab.py", "fileExtensions": [ "sci", "sce", "tst" ], "id": "Scilab" }, "linguistGrammarRepo": { "firstCommit": 2007, "lastCommit": 2012, "committerCount": 2, "commitCount": 5, "sampleCount": 3, "example": [ "disp(%pi);\n\n" ], "url": "https://github.com/textmate/scilab.tmbundle" }, "leachim6": { "filepath": "s/SCILab.scilab", "fileExtensions": [ "scilab" ], "example": [ "disp(\"Hello World\")\n" ], "id": "SCILab" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Scilab", "rijuRepl": { "example": [ "disp(\"Hello, world!\")\n" ], "id": "https://riju.codes/scilab" }, "jupyterKernel": [ "https://github.com/calysto/scilab_kernel" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nEngineering and Scientific Computing with Scilab|1998|Claude Gomez|2443580|3.33|3|0\nProgramming in Scilab 4. 1|2009|Vinu V. Das|27685296|0.0|0|0\nScilab (a Free Software to Matlab)|2011|Hema Ramchandran|44003404|0.0|0|0\nIntroduction to Scilab: For Scientists and Engineers||Sandeep Nagar|53796871|0.0|0|0\nIntroduction to Scilab: For Engineers and Scientists||Sandeep Nagar|58537943|5.00|1|0\nIntroduction to Scilab for Scientists and Engineers||John Maclane|57266755|0.0|0|0\nSCILAB (A FREE SOFTWARE TO MATLAB)||ACHUTHSANKAR S.NAIR|44300566|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n20140203|Springer Nature|Praktische Mathematik mit MATLAB, Scilab und Octave|Frank Thuselt; Felix Paul Gennrich|9783642258251\n2011|S Chand|SCILAB (A Free Software To MATLAB)|NAIR, ACHUTHSANKAR S.|9788121939706\n2012|CreateSpace Independent Publishing Platform|Scilab by Example|Affouf, Dr. M.|9781479203444\n1999|Birkhäuser|Engineering and Scientific Computing with Scilab||9780817640095\n2019|Bentham Science Publishers|Arduino and Scilab based Projects|Gehlot, Anita and Singh, Rajesh and Singh, Bhupendra|9789811410918\n2009T|New Age International Publisher|Programming in Scilab 4. 1|Das, Vinu V.|9788122424713\n20171111|Springer Nature|Introduction to Scilab|Sandeep Nagar|9781484231920\n2019-03-05|Bentham Science Publishers|Arduino and Scilab based Projects|Rajesh Singh and Anita Gehlot and Bhupendra Singh|9789811410925", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1998|Engineering and Scientific Computing with Scilab|10.1007/978-1-4612-1584-4|147|5|C. Gomez|d2c3bab25c1d48eb7d14b1d6091dc88f2e19fc92\n2003|A SCILAB PROGRAM FOR COMPUTING GENERAL-RELATIVISTIC MODELS OF ROTATING NEUTRON STARS BY IMPLEMENTING HARTLE'S PERTURBATION METHOD|10.1142/S0129183103004516|10|0|P. Papasotiriou and V. Geroyannis|3b713fe97175d90ae76755898a3a386e56f48f63\n2017|Introduction to Scilab|10.1007/978-1-4842-3192-0|8|0|Sandeep Nagar|1d348c0a2f2b42ef8df539c7e6cc7a90dad33021\n2015|Comparison New Algorithm Modified Euler in Ordinary Differential Equation Using Scilab Programming|10.7763/LNSE.2015.V3.190|8|0|N. M. M. Yusop and M. Hasan and M. Rahmat|6a846d1b995a155911f8322dd7fe7777dbe42b91\n2012|From Scilab to High Performance Embedded Multicore Systems: The ALMA Approach|10.1109/DSD.2012.65|7|0|J. Becker and T. Stripf and Oliver Oey and M. Hübner and Steven Derrien and D. Ménard and O. Sentieys and G. Rauwerda and K. Sunesen and N. Kavvadias and K. Masselos and G. Goulas and P. Alefragis and N. Voros and D. Kritharidis and N. Mitas and D. Göhringer|3748b2f30f012d47c128d29aecf39846e4dc9b16\n2014|Scilab Textbook Companions [Focus on Education]|10.1109/MCS.2014.2308692|6|2|R. Braatz|cb980aa0fd953d12edbfba4add09ff420a7f70ba\n2012|A flexible approach for compiling scilab to reconfigurable multi-core embedded systems|10.1109/ReCoSoC.2012.6322879|2|0|T. Stripf and Oliver Oey and Thomas Bruckschlögl and Ralf König and M. Hübner and J. Becker and G. Rauwerda and K. Sunesen and N. Kavvadias and G. Dimitroulakos and K. Masselos and D. Kritharidis and N. Mitas and G. Goulas and P. Alefragis and N. Voros and Steven Derrien and D. Ménard and O. Sentieys and D. Göhringer and T. Perschke|4fb4e92c48743e60be986dc3d5de745df9f081d0\n2002|A Scilab Program For Computing Rotating Magnetic Compact Objects|10.1142/S0129183102003218|1|0|P. Papasotiriou and V. Geroyannis|8ab7a8573a12d34528c6b542384c8b4b7a4b1ba4\n2009|Java interface for Scilab based on the jLab environment|10.1109/ICASID.2009.5277009|1|0|Lilan Wu and Jianling Gao and Xiaoyao Xie|7a94b3788238c22cf10b0bfa0d4c92197984278b\n2017|Working with Scilab|10.1007/978-1-4842-3192-0_2|1|0|Sandeep Nagar|1adbeac4c9515127395915fbe9aaa04610b37fe5" }, "scipy": { "title": "SciPy", "appeared": 2001, "type": "library", "creators": [ "Eric Jones" ], "website": "https://www.scipy.org/scipylib/index.html", "country": [ "Various" ], "originCommunity": [ "https://github.com/scipy" ], "writtenIn": [ "python", "fortran", "c", "cpp" ], "githubRepo": { "stars": 9818, "forks": 4305, "subscribers": 331, "created": 2011, "updated": 2022, "firstCommit": 2001, "description": "SciPy library main repository", "issues": 1756, "url": "https://github.com/scipy/scipy" }, "wikipedia": { "related": [ "python", "fortran", "c", "numpy", "matplotlib", "pandas", "matlab", "octave", "scilab", "sagemath" ], "summary": "SciPy (pronounced \"Sigh Pie\") is an open source Python library used for scientific computing and technical computing. SciPy contains modules for optimization, linear algebra, integration, interpolation, special functions, FFT, signal and image processing, ODE solvers and other tasks common in science and engineering. SciPy builds on the NumPy array object and is part of the NumPy stack which includes tools like Matplotlib, pandas and SymPy, and an expanding set of scientific computing libraries. This NumPy stack has similar users to other applications such as MATLAB, GNU Octave, and Scilab. The NumPy stack is also sometimes referred to as the SciPy stack. SciPy is also a family of conferences for users and developers of these tools: SciPy (in the United States), EuroSciPy (in Europe) and SciPy.in (in India). Enthought originated the SciPy conference in the United States and continues to sponsor many of the international conferences as well as host the SciPy website. The SciPy library is currently distributed under the BSD license, and its development is sponsored and supported by an open community of developers. It is also supported by Numfocus which is a community foundation for supporting reproducible and accessible science.", "pageId": 263472, "dailyPageViews": 237, "created": 2003, "backlinksCount": 136, "revisionCount": 254, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/SciPy" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSciPy and NumPy: An Overview for Developers|2012|Eli Bressert|19175991|2.96|47|10\nLearning Scipy for Numerical and Scientific Computing|2013|Francisco Blanco-Silva|24378746|4.10|10|5\nLearning SciPy for Numerical and Scientific Computing - Second Edition|2015|Sergio J. Rojas G.|44764282|3.83|6|1\nScipy Programming Succinctly||James McCaffrey|55178971|0.0|0|0\nLearning Scipy for Numerical and Scientific Computing|2013|Francisco Javier Blanco Silva|27314402|0.0|0|0\nRaspberry Pi Supercomputing and Scientific Programming: MPI4PY, NumPy, and SciPy for Enthusiasts||Ashwin Pajankar|56182718|3.00|1|0\nNumerical Python: Scientific Computing and Data Science Applications with Numpy, Scipy and Matplotlib||Robert Johansson|66021570|0.0|0|0\nRaspberry Pi Image Processing Programming: Develop Real-Life Examples with Python, Pillow, and Scipy||Ashwin Pajankar|55317341|0.0|0|0" }, "scl": { "title": "Structured Control Language", "appeared": 1998, "type": "pl", "reference": [ "https://cache.industry.siemens.com/dl/files/188/1137188/att_27471/v1/SCLV4_e.pdf" ], "standsFor": "Structured Control Language", "example": [ "CASE TW OF\n 1: DISPLAY := OVEN_TEMP;\n 2: DISPLAY := MOTOR_SPEED;\n 3: DISPLAY := GROSS_TARE;\n QW4 := 16#0003;\n 4..10:DISPLAY := INT_TO_DINT (TW);\n QW4 := 16#0004;\n 11,13,19:DISPLAY:= 99;\n QW4 := 16#0005;\nELSE: DISPLAY := 0;\n TW_ERROR := 1;\nEND_CASE;" ], "semanticScholar": "" }, "sclipting": { "title": "Sclipting", "appeared": 2011, "type": "esolang", "description": "Sclipting is a stack-based golf language, inspired by GolfScript, that uses Chinese characters for instructions and Hangul syllables for data (strings and integers). The basic idea is that to minimise the number of characters in a program, the language should provide as many single-character instructions as possible. It was invented by Timwi in 2011. Sclipting is not considered finished as it can trivially be extended with more and more instructions assigned to new Chinese characters.", "fileType": "text", "centralPackageRepositoryCount": 0 }, "scm": { "title": "SCM", "appeared": 1990, "type": "pl", "creators": [ "Aubrey Jaffer" ], "wikipedia": { "related": [ "lisp", "c", "ia-32", "scheme", "guile", "linux", "unix", "emacs-editor", "bash" ], "summary": "SCM is a programming language, a dialect of the language Scheme. It is written in the language C, by Aubrey Jaffer, the author of the SLIB Scheme library and the JACAL interactive computer algebra (symbolic mathematics) program. It conforms to the standards R4RS, R5RS, and IEEE P1178. It is free and open-source software released under a GNU Lesser General Public License (LGPL).SCM runs on many different operating systems such as AmigaOS (also emulation), Linux, Atari-ST, macOS (SCM Mac), DOS, OS/2, NOS/VE, Unicos, VMS, Unix, and similar systems. SCM includes Hobbit, a Scheme-to-C compiler written originally in 2002 by Tanel Tammet. It generates C files which binaries can be dynamically or statically linked with an SCM executable. SCM includes linkable modules for SLIB features like sequence comparison, arrays, records, and byte-number conversions, and modules for Portable Operating System Interface (POSIX) system calls and network sockets, Readline, curses, and Xlib. On some platforms, SCM supports unexec (developed for Emacs and bash), which dumps an executable image from a running SCM. This results in a fast startup for SCM. SCM developed from Scheme In One Defun (SIOD) in about 1990. GNU Guile developed from SCM in 1993.", "created": 2006, "backlinksCount": 62, "pageId": 8561958, "dailyPageViews": 11, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/SCM_(Scheme_implementation)" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "scoop-pm": { "title": "Scoop", "appeared": 2013, "type": "packageManager", "creators": [ "Luke Sampson" ], "description": "A command-line installer for Windows", "website": "https://scoop.sh/", "domainName": { "registered": 2013, "awisRank": { "2022": 216483 }, "name": "scoop.sh" }, "githubRepo": { "firstCommit": 2013, "stars": 15828, "forks": 1248, "subscribers": 246, "created": 2013, "updated": 2022, "description": "A command-line installer for Windows.", "issues": 162, "url": "https://github.com/ScoopInstaller/Scoop" } }, "scoop": { "title": "SCOOP", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/92a1806be72b7394b62325577ff897d5320dfb57" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1428", "wordRank": 9716, "centralPackageRepositoryCount": 0 }, "scopes": { "title": "scopes", "appeared": 2016, "type": "pl", "creators": [ "Leonard Ritter" ], "website": "https://bitbucket.org/duangle/scopes", "reference": [ "https://scopes.readthedocs.io/en/latest/about.html" ] }, "score": { "title": "score", "appeared": 2013, "type": "pl", "website": "https://ossia.io", "domainName": { "registered": 2017, "awisRank": { "2022": 6212665 }, "name": "ossia.io" }, "visualParadigm": true, "githubRepo": { "firstCommit": 2013, "stars": 1071, "forks": 90, "subscribers": 55, "created": 2013, "updated": 2022, "description": "ossia score, an interactive sequencer for the intermedia arts", "issues": 303, "url": "https://github.com/OSSIA/score" }, "repoStats": { "firstCommit": 2013, "commits": 10585, "committers": 63, "files": 4152 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17982771|Show HN: Ossia score, a visual programming language for time|2018-09-13 21:27:39 UTC|1536874059|jcelerier|1|5", "isbndb": "" }, "scrapscript": { "title": "Scrapscript", "appeared": 2023, "type": "pl", "creators": [ "Taylor Troesh" ], "description": "All programs are data, expressions are content-addressable \"scraps\".Scrapscript rejects traditional package-management. Instead, “scrapyards” combine features from Smalltalk, Hackage, IPFS, GitHub, and StackOverflow. ", "website": "https://scrapscript.org/", "reference": [ "https://news.ycombinator.com/item?id=35712163" ], "influencedBy": [ "haskell", "json", "elm", "roc", "hackage-pm" ], "hasExpressions": { "example": "", "value": true }, "example": [ "greet <| person:ron 3\n\n. greet :: person -> text =\n | :cowboy -> \"howdy\"\n | :ron n -> \"hi \" ++ a ++ \"ron\" , a = text/repeat n \"a\"\n | :parent :m -> \"hey mom\"\n | :parent :f -> \"greetings father\"\n | :friend n -> \"yo\" |> list/repeat n |> string/join \" \"\n | :stranger \"felicia\" -> \"bye\"\n | :stranger name -> \"hello \" ++ name\n\n. person =\n : cowboy\n : ron int\n : parent s , s = (: m : f)\n : friend int\n : stranger text" ] }, "scratch": { "title": "Scratch", "appeared": 2002, "type": "visual", "screenshot": "https://pldb.com/screenshots/scratch.png", "website": "https://scratch.mit.edu/", "documentation": [ "https://scratch.mit.edu/developers" ], "fileExtensions": [ "scratch", "sb", "sprite", "sb2", "sprite2" ], "domainName": { "name": "scratch.mit.edu" }, "wikipedia": { "related": [ "squeak", "actionscript", "linux", "logo", "smalltalk", "hypercard", "starlogo", "etoys", "snap", "android", "python", "java", "basic", "arduino", "javascript", "blockly", "kodu-game-lab", "microsoft-small-basic" ], "summary": "Scratch is a free visual programming language developed by the MIT Media Lab. Scratch was created to help young people learn to think creatively, reason systematically and work collaboratively. It is used by students, teachers and parents to easily create interactive stories, animations, games, etc. It provides a stepping stone to the world of computer programming. It can also be used for a range of educational and entertainment constructionist purposes from math and science projects, including simulations and visualizations of experiments, recording lectures with animated presentations, to social sciences animated stories, and interactive art.", "pageId": 9236158, "dailyPageViews": 1368, "created": 2007, "backlinksCount": 328, "revisionCount": 1660, "appeared": 2002, "fileExtensions": [ "scratch", "sb", "sprite", "sb2", "sprite2" ], "url": "https://en.wikipedia.org/wiki/Scratch_(programming_language)" }, "projectEuler": { "memberCount": { "2019": 63, "2022": 98 }, "id": "Scratch" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Scratch", "annualReportsUrl": [ "https://scratch.mit.edu/annual-report" ], "faqPageUrl": [ "https://scratch.mit.edu/faq" ], "subreddit": [ { "memberCount": { "2017": 1072, "2022": 10081 }, "url": "https://reddit.com/r/scratch" } ], "meetup": { "memberCount": 6590, "groupCount": 47, "url": "https://www.meetup.com/topics/scratch" }, "tiobe": { "currentRank": 16, "id": "Scratch" }, "fileType": "text", "wordRank": 7665, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2014|Cengage Learning Ptr|Scratch 2.0 Programming For Teens|Ford, Jerry Lee.|9781305075191\n2014|Cengage Learning PTR|Scratch 2.0 Programming for Teens|Ford, Jr. Jerry Lee|9781305075191\n2007|SitePoint|Simply JavaScript: Everything You Need to Learn JavaScript From Scratch|Yank, Kevin and Adams, Cameron|9780980285802\n2015|DK Children|DK Workbooks: Coding with Scratch Workbook: An Introduction to Computer Programming|DK|9781465443922\n2015|For Dummies|Scratch For Kids For Dummies|Breen, Derek|9781119014874\n2008|Cengage Learning PTR|Scratch Programming for Teens|Ford, Jr. Jerry Lee|9781598635362\n2014|Packt Publishing|Scratch 2.0 Game Development HOTSHOT|Pul, Sergio van and Chiang, Jessica|9781849697569\n2009|Packt Publishing|Scratch 1.4: Beginner's Guide|Badger, Michael|9781847196767\n2016|CreateSpace Independent Publishing Platform|Advanced Scratch Programming: Learn to design programs for challenging games, puzzles, and animations|Joshi, Abhay B and Pande, Ravindra|9781539660842\n2018|Createspace Independent Publishing Platform|Pen Art In Scratch Programming: The Art Of Programming And The Programming Of Art|Abhay Joshi and Sandesh Gaikwad|9781719438292\n2019|Independently published|LEARN PYTHON PROGRAMMING: Write code from scratch in a clear & concise way, with a complete basic course. From beginners to intermediate, an hands-on project with examples, to follow step by step|GRAY, WILLIAM|9781098525729\n2019|O'reilly Media|Data Science From Scratch|Joel Grus|9781492041108\n2016|Packt Publishing|Raspberry Pi: Amazing Projects from Scratch|Pajankar, Ashwin and Kakkar, Arush and Poole, Matthew and Grimmett, Richard|9781787128491\n2019|Independently published|EXCEL VBA PROGRAMMING : This Book Includes :: A Step-by-Step Tutorial For Beginners To Learn Excel VBA Programming From Scratch and Intermediate ... VBA Programming For Professional Advancement|Bradley, Peter|9781794499881\n2019|Independently Published|Machine Learning With Python: Handbook Made For Beginners, From Scratch To Fluent Programming With Example And Basics Of Numpy, Pytorch, Keras, Scikit Learn, Tensorflow|Programming Languages Project|9781705333044\n2020-09-01T00:00:01Z|Rockridge Press|Scratch Programming for Beginners: A Kid's Guide to Coding Fundamentals|Burditt MS MA, Raina|9781647396381\n2021|No Starch Press|Scratch 3 Programming Playground: Learn to Program by Making Cool Games|Sweigart, Al|9781718500211\n2019|No Starch Press|25 Scratch 3 Games for Kids: A Playful Guide to Coding|Wainewright, Max|9781593279905\n2016-09-16T00:00:01Z|No Starch Press|Scratch Programming Playground: Learn to Program by Making Cool Games|Sweigart, Al|9781593277628\n2019-03-05T00:00:01Z|O'Reilly Media|Programming Bitcoin: Learn How to Program Bitcoin from Scratch|Song, Jimmy|9781492031499\n2017|DK Children|DK Workbooks: Scratch Challenge Workbook: Packed with Scratch Coding Activities|DK|9781465456861\n2019|No Starch Press|Super Scratch Programming Adventure! (Scratch 3)|The LEAD Project|9781718500129\n2021|No Starch Press|Network Programming with Go: Learn to Code Secure and Reliable Network Services from Scratch|Woodbeck, Adam|9781718500884\n2021|No Starch Press|Network Programming with Go: Code Secure and Reliable Network Services from Scratch|Woodbeck, Adam|9781718500891\n2019|O'Reilly Media|Programming Bitcoin: Learn How to Program Bitcoin from Scratch|Song, Jimmy|9781492031451\n2020|Independently published|Coding for Kids Ages 9-15: Simple HTML, CSS and JavaScript lessons to get you started with Programming from Scratch|Mather, Bob|9798644382446\n2021|No Starch Press|Scratch 3 Programming Playground: Learn to Program by Making Cool Games|Sweigart, Al|9781718500228\n2021|Packt Publishing|Hands-On Unity 2021 Game Development: Create, customize, and optimize your own professional games from scratch with Unity 2021, 2nd Edition|Borromeo, Nicolas Alejandro|9781801077286\n2021|Packt Publishing|Getting Started with Streamlit for Data Science: Create and deploy Streamlit web applications from scratch in Python|Richards, Tyler|9781800563209\n2019|No Starch Press|25 Scratch 3 Games for Kids: A Playful Guide to Coding|Wainewright, Max|9781593279912\n2013|No Starch Press|Super Scratch Programming Adventure! (Covers Version 2): Learn to Program by Making Cool Games (Covers Version 2)|The LEAD Project|9781593275570\n2021|Francesco Cammardella|Python programming: Crash Course guide: learn from scratch fundation of programming, data and coding skills. Apply your competences with hand on project exercises.|Kölling, Michail|9781990151408\n2018|Everything|The Everything Kids' Scratch Coding Book: Learn to Code and Create Your Own Cool Games!|Rukman, Jason|9781507207970\n2019|In Easy Steps Limited|Scratch Programming in easy steps|McManus, Sean|9781840788594\n2019|No Starch Press|Make Your Own Scratch Games!|Anthropy, Anna|9781593279370\n2019-09-12T00:00:01Z|Independently published|Scratch Programming: An In-depth Tutorial on Scratch Programming for Beginners|Morris, Mike|9781691642144\n2013-10-29T00:00:01Z|In Easy Steps Limited|Scratch Programming in easy steps: Covers versions 1.4 and 2.0|McManus, Sean|9781840786125\n2013-10-13T00:00:01Z|No Starch Press|Super Scratch Programming Adventure! (Covers Version 2): Learn to Program by Making Cool Games (Covers Version 2)|The LEAD Project|9781593275310\n2019|Packt Publishing|Angular Projects: Build nine real-world applications from scratch using Angular 8 and TypeScript|Mohammed, Zama Khan|9781838550387\n2021|Packt Publishing|Building Vue.js Applications with GraphQL: Develop a complete full-stack chat app from scratch using Vue.js, Quasar Framework, and AWS Amplify|Ribeiro, Heitor Ramon|9781800561748\n2015|MentorsCloud|Animation for Kids with Scratch Programming: Create Your Own Digital Art, Games, and Stories with Code|Takeuchi, Danny J|9780692527573\n2015-08-23T00:00:01Z|Addison-Wesley Professional|Embedded Programming with Android: Bringing Up an Android System from Scratch (Android Deep Dive)|Ye, Roger|9780134030005\n2012|No Starch Press|Super Scratch Programming Adventure! (Covers Version 1.4): Learn to Program By Making Cool Games|Project, The LEAD|9781593274092\n2018|Packt Publishing|Learning Java by Building Android Games: Learn Java and Android from scratch by building six exciting games, 2nd Edition|Horton, John|9781788836722\n2021|Packt Publishing|The TensorFlow Workshop: A hands-on guide to building deep learning models from scratch using real-world datasets|Moocarme, Matthew and So, Anthony and Maddalone, Anthony|9781800200227\n2020|BPB Publications|Parallel Programming with C# and .NET Core: Developing Multithreaded Applications Using C# and .NET Core 3.1 from Scratch (English Edition)|Verma, Rishabh and Shrivastava, Neha and Akella, Ravindra|9789389423327\n2009|Packt Publishing|Scratch 1.4: Beginner’s Guide|Badger, Michael|9781847196774\n2016|Packt Publishing|Beginning C++ Game Programming: Learn C++ from scratch and get started building your very own games|Horton, John|9781786467775\n2019-09-16T00:00:01Z|Independently published|Data Science from Scratch with Python: A Step By Step Guide for Beginner's and Faster Way To Learn Python In 7 Days & NLP using Advanced (Including Programming Interview Questions)|Wilson, Richard|9781693541377\n2021|Packt Publishing|Learning Java by Building Android Games: Learn Java and Android from scratch by building five exciting games, 3rd Edition|Horton, John|9781800565869\n2020|Springer|An Introduction to Data Analysis in R: Hands-on Coding, Data Mining, Visualization and Statistics from Scratch (Use R!)|Zamora Saiz, Alfonso and Quesada González, Carlos and Hurtado Gil, Lluís and Mondéjar Ruiz, Diego|9783030489977", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|The Scratch Programming Language and Environment|10.1145/1868358.1868363|1029|114|John H. Maloney and M. Resnick and N. Rusk and Brian Silverman and Evelyn Eastmond|26e08cbcf9b7622cb5e2257b7b8bce9020853f95\n2015|From Scratch to “Real” Programming|10.1145/2677087|179|4|M. Armoni and Orni Meerbaum-Salant and M. Ben-Ari|ec1b4c3760168d2f1109a0674c1d91c5f09be1be\n2016|Do code smells hamper novice programming? A controlled experiment on Scratch programs|10.1109/ICPC.2016.7503706|63|3|F. Hermans and Efthimia Aivaloglou|6ca49f01da2d755e7ca41391ff3c7968d5ce19d9\n2014|Effects of Using Alice and Scratch in an Introductory Programming Course for Corrective Instruction|10.2190/EC.51.2.c|46|3|Chih-Kai Chang|cdfcf0d29df12fa760ab0fa4bfdbb8fad20e1b32\n2019|Evaluating a course for teaching introductory programming with Scratch to pre-service kindergarten teachers|10.1504/IJTEL.2019.10020447|29|1|Stamatios Papadakis and M. Kalogiannakis|2ace596b1fb1e018e21938cfacd4ab72fd0aeb28\n2014|Language learning for visual and auditory learners using scratch toolkit|10.1109/ICCCI.2014.6921765|20|1|P. Sanjanaashree and M. A. Kumar and K. Soman|3bc17522a45874017635c9da475364eeba889c8c\n2015|“I have a tutorial for this”: the language of online peer support in the scratch programming community|10.1145/2771839.2771863|20|2|D. Fields and Katarina Pantić and Y. Kafai|dd876975007957896f116cf330b2aaa60c0f0709\n2013|The Effects of an Information-Technology Gifted Program on Friendship Using Scratch Programming Language and Clutter|10.7763/IJCCE.2013.V2.181|18|0|Seungki Shin and Phanwoo Park and Youngkwon Bae|1de083b6345bd201daee56967a33ebf63f6af155\n2014|Undergraduates Teach Game Programming Using Scratch|10.1109/MC.2014.49|11|2|P. Gruenbaum|61b814a3dbaeeb6c6891bc2bfb89c5a12c6ef26f\n2016|Lessons Learned from Teaching Scratch as an Introduction to Object-oriented Programming in Delphi|10.1080/18117295.2016.1189215|6|0|Sukie van Zyl and E. Mentz and M. Havenga|f9a8b9efda4ed17f7540bbb926b9b97ef9d8d6be\n2019|Programming a Humanoid Robot with the Scratch Language|10.1007/978-3-030-26945-6_20|6|1|Sílvia Moros and L. Wood and B. Robins and K. Dautenhahn and Á. González|ebbc5e5c364d0e02bb0cc8c9a30f46d4b60eaa37\n2012|Teaching Introductory Programming Concepts: A Comparison of Scratch and Arduino|10.15368/THESES.2012.95|5|0|A. Beug|81c185f394ae848b35a9bee8d7c30a707ed4298a\n2018|Perceptions of Scratch Programming among Secondary School Students in KwaZulu-Natal, South Africa|10.23962/10539/26112|5|1|M. Marimuthu and P. Govender|8e912594cad1f54fd57e3ea5063803d309956934\n2017|The Effect of In-service Training of Computer Science Teachers on Scratch Programming Language Skills Using an Electronic Learning Platform on Programming Skills and the Attitudes towards Teaching Programming|10.11114/JETS.V5I11.2608|5|1|Ahmed Alkaria and Riyadh A. Alhassan|995feadbabfdc1384eb0eb93fadd55b78813689f\n2012|The Effect of teaching Scratch in introductory programming course|10.14400/JDPM.2012.10.9.449|4|1|Jungshin Park and Seok-Gee Cho|7b50bb05a11f6a4d6d5a290131a702f64dff8bcc\n2020|Re-use of programming patterns or problem solving?: representation of scratch programs by TGraphs to support static code analysis|10.1145/3421590.3421604|4|1|Mike Talbot and Katharina Geldreich and Julia Sommer and Peter Hubwieser|5f355644094b15230c23ed08260b5b12348a65fd\n2020|Perceived Acceptance and Use of Scratch Software for Teaching Programming: A Scale Development Study|10.21585/IJCSES.V4I1.59|4|0|S. Yildiz and Alev Ates Cobanoglu and T. Kisla|846193a5ced34aad35bc3016e7dbbbc06ea5c50a\n2014|I Scratch and Sense But Can I Program?: An Investigation of Learning with a Block Based Programming Language|10.4018/ijicte.2014070107|4|0|N. Simpkins|607ec6b6cb346353cb9d3cf324ead72eb8d32afa\n2019|Which visual programming language best suits each school level? A look at Alice, iVProg, and Scratch|10.1109/EDUNINE.2019.8875788|4|0|Marcos Devaner do Nascimento and I. M. Félix and B. M. Ferreira and Lucas Mendonça de Souza and D. Dantas and L. de Oliveira Brandão and Anarosa de Oliveira Brandão|5e1352c084d00ba9c76169cf7c231b32e5fae1a6\n2020|DeepScratch: Scratch Programming Language Extension for Deep Learning Education|10.14569/ijacsa.2020.0110777|4|1|Nora S. Alturayeif and Nouf Alturaief and Zainab Alhathloul|cfa01263d3f1de77d6c5389d7775c1d3785371a4\n2021|Towards the Development of Computational Thinking and Mathematical Logic through Scratch|10.14569/IJACSA.2021.0120242|3|1|Benjamin Maraza-Quispe and A. Maurice and Olga Melina and Lita Marianela and Lenin Henry and Walter Cornelio and Luis Ernesto|aefe3bda1524db5d31bd6294c3b89f5056902004\n2016|Design and Implementation of Game for Learning Game Production Principles: Centering on Scratch Language|10.14400/JDC.2016.14.5.403|3|1|Hong-Sub Lee and Hyung-Won Jeong and Young-Kyo Kim|7af5fa58bdb0fa0d658d264a564a3c04c137f974\n2018|Comparison between the use of pseudocode and visual programming in programming teaching: An evaluation from scratch tool|10.23919/CISTI.2018.8399305|3|0|Críscilla M. C. Rezende and E. L. Bispo|b8c268f400d0c74b0ed3de81e3c05fbf860772da\n2018|Learning Block Programming using Scratch among School Children in Malaysia and Australia: An Exploratory Study|10.1109/ICCOINS.2018.8510586|3|0|N. Zamin and Hazrita Ab Rahim and K. Savita and E. Bhattacharyya and Maryam Zaffar and Siti Nor Katijah Mohd Jamil|ba00627b3ba7b9ee52a6122c45b5126d32406c2c\n2016|Learning Renewable Energy by Scratch Programming|10.12681/jret.8916|3|0|I. Balouktsis and Gerasimos Kekeris|841e9ac95ca9a978f0ac0b05e79a68c69ca3c89a\n2021|Assessment of Scratch Programming Language as a Didactic Tool to Teach Functions|10.3390/educsci11090499|3|0|Eduardo Quevedo Gutiérrez and Alberto Zapatera Llinares|6a0e4341f64ae4436a3e6a1ec95523373811f63c\n2021|Evolving Continuous Optimisers from Scratch|10.1007/s10710-021-09414-8|2|0|M. Lones|77c16cf8fb310a2b79aec08ced4169224f91930f\n2017|Measurement and Visualization of Programming Processes of Primary School Students in Scratch|10.1145/3137065.3137086|2|0|Alexandra Funke and Katharina Geldreich|825d48cacd9c6a957826e4cbd35023c4f706ed81\n2014|Use of problem-solving approach to teach scratch programming for adult novice programmers (abstract only)|10.1145/2538862.2544284|2|0|Chiung-Fang Chiu|bd2411207585923fa801c5f6a3d918e7183ac4fc\n2020|Motivating Adult Learners by Introducing Programming Concepts with Scratch|10.1145/3396802.3396818|2|0|Maren Krafft and G. Fraser and Neil Walkinshaw|10cf070e03bd0df34568adb36834741debb0724d\n2013|Using Visual Programming Language for Remedial Instruction: Comparison of Alice and Scratch|10.1007/978-3-642-41175-5_23|2|0|Ching Chang and Yu-Ling Lin and Chih-Kai Chang|2c480dce4eede0b36e89175bda9e783481714ccb\n2014|Computer simulation at school scratch and programming language choosing criteria|10.1109/EDUCON.2014.6826174|2|0|V. O. Dzhenzher|687a2ecc5143dc24878eb741b4d90f3d966f6d84\n2019|SCRATCH LANGUAGE OF PROGRAMMING VS ENGLISH LANGUAGE: COMPARING MATHEMATICAL AND LINGUISTIC FEATURES|10.21303/2461-4262.2019.00982|2|0|N. Lazebna and Y. Fedorova and M. Kuznetsova|23684d0c5e362ddc9fc0b1961aefeb7de1551eb6\n2021|Pengembangan Sekolah Inklusi dengan Pemanfaatan Media Visual Scratch dan Alat Peraga Manipulatif|10.30656/JPMWP.V5I1.2653|1|0|Ukhti Raudhatul Jannah and Fauzan Prasetyo Eka Putra and Ainur Rofiq Hafsi and H. Basri|e373775c36def1b7f6498b395140b1411e43877c\n2021|Introducing Machine Learning with Scratch and Robots as a Pilot Program for K-12 Computer Science Education|10.18178/ijlt.7.3.181-186|1|0|C. Chung and L. Shamir|08658fb44198da75de5f501d18bbe6bb2fc00eac\n2016|Linguistic and social treatment of Specific Language Impairment (SLI) using Scratch|10.1145/2930674.2935985|1|1|Noelia Di Pretoro|eba347beab6872ccb47a2fb7a721d26293f0af6a\n2011|The flow and self efficacy of sixth grade students under Scratch programming learning|10.1109/ICECENG.2011.6056787|1|0|A. Lai and Shi Guo|d59c554747b419d02b53b1daecc8bb74faf39c39\n2018|Accessible C-programming course from scratch using a MOOC platform without limitations|10.4995/HEAD18.2018.8176|1|0|J. A. Belloch and Adrián Castelló and Sergio Iserte|9972dd3478bf4cacbfa6aef7ffbbc74bffbc0151\n2018|Comparison between Pseudocode Usage and Visual Programming with Scratch in Programming Teaching|10.1109/LACLO.2018.00087|1|0|Críscilla M. C. Rezende and E. L. Bispo|87217b7ecac13edc5dcd0b929eabe729bc34de08\n2019|Programming Practice Using Scratch for Each Grade of Elementary School|10.1145/3322134.3322151|1|0|K. Yamamori|0d98b90962b21ac0a88b9de2554b935576ac57aa\n2021|Generating Agent Based Models From Scratch With Genetic Programming|10.1162/isal_a_00383|1|0|Rory Greig and Jordi Arranz|d587d425969e6d655bd394c071498f55539acb89\n2021|A Guided Scratch Visual Execution Environment to Introduce Programming Concepts to CS1 Students|10.3390/info12090378|1|0|Raquel Hijón-Neira and C. Connolly and D. Palacios-Alonso and Oriol Borrás-Gené|2a13233d76800cb5549ead20098d47bea4ed6810\n2016|Development and Application of Education Program Art Area Subject-based STEAM for Improvement of Elementary Students` Creativity: With a Scratch Programming Language|10.13000/JFMSE.2016.28.1.69|1|0|서영호 and 정승범 and 김종훈|2c759e31c59100c02dbafcf8351e81dd513eef6b\n2018|THE SCRATCH PROGRAMMING LANGUAGE IN COMPUTING SCIENCE TEACHING|10.21125/edulearn.2018.0739|1|0|Hana Bucková|967bb99994cbbc2f344db129b7141c6d2ad7b123\n2021|A Tangible Block Editor for the Scratch Programming Language|10.1145/3411763.3451833|1|1|Bryson Goolsby and D. Pawluk and Hyun Woo Kim and G. Fusco|ccfd6bc8898f035d28f6603aefd61eb017bed959" }, "scratchpad-ii": { "title": "Scratchpad II", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9bc13698fcea3d9faaf1c3cb0f9c8f0d29626c15" ], "hopl": "https://hopl.info/showlanguage.prx?exp=566", "centralPackageRepositoryCount": 0 }, "scratchpad": { "title": "Scratchpad", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/80eec44180b427c5468b26a8c905031715fffc88" ], "wikipedia": { "summary": "Scratchpad may refer to: A pad of paper, such as a notebook, for preliminary notes, sketches, or writings Scratchpad memory, also known as scratchpad, scratchpad RAM or local store. is a high-speed internal memory used for temporary storage of calculations, data, and other work in progress Scratchpad, the former name of Axiom, a free, general-purpose computer algebra system", "backlinksCount": 9, "pageId": 741724, "dailyPageViews": 27, "created": 2004, "url": "https://en.wikipedia.org/wiki/Scratchpad" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2728", "centralPackageRepositoryCount": 0 }, "screamer": { "title": "SCREAMER", "appeared": 1993, "type": "pl", "reference": [ "https://quickref.common-lisp.net/screamer.html" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2478", "centralPackageRepositoryCount": 0 }, "scribble": { "title": "scribble", "appeared": 1997, "type": "pl", "creators": [ "Matthew Flatt" ], "example": [ "#lang scribble/doc\n@(require scribble/manual \"utils.rkt\"\n (for-syntax racket/base)\n (for-label scribble/manual-struct\n version/utils\n syntax/quote))\n\n@(define lit-ellipses (racket ...))\n@(define lit-ellipses+ (racket ...+))\n\n@title[#:tag \"manual\" #:style 'toc]{Manual Forms}\n\n@defmodulelang[scribble/manual]{The @racketmodname[scribble/manual]\nlanguage provides all of @racketmodname[scribble/base] plus many\nadditional functions that are specific to writing Racket\ndocumentation. It also associates @tech{style properties} with the\ngenerated @racket[doc] export to select the default Racket manual\nstyle for rendering; see @secref[\"manual-render-style\"] for more\ninformation.\n\nThe @racketmodname[scribble/manual] name can also be used as a library\nwith @racket[require], in which case it provides all of the same\nbindings, but without setting the reader or setting the default\nrendering format to the Racket manual format.}" ], "githubRepo": { "firstCommit": 1997, "stars": 151, "forks": 81, "subscribers": 28, "created": 2014, "updated": 2022, "issues": 98, "url": "https://github.com/racket/scribble" }, "repoStats": { "firstCommit": 1997, "commits": 2165, "committers": 93, "files": 393 } }, "scribe": { "title": "Scribe", "appeared": 1980, "type": "pl", "country": [ "United States" ], "example": [ "@MakeSection(tag=beginning, title=\"The Beginning\")" ], "wikipedia": { "example": [ "@Heading(The Beginning)\n @Begin(Quotation)\n Let's start at the very beginning, a very good place to start\n @End(Quotation)" ], "related": [ "ibm-gml", "html", "latex", "css", "javascript", "emacs-editor", "tex" ], "summary": "Scribe is a markup language and word processing system which pioneered the use of descriptive markup. Scribe was revolutionary when it was proposed, because it involved for the first time a clean separation of presentation and content.", "pageId": 9313682, "dailyPageViews": 25, "created": 2007, "backlinksCount": 23, "revisionCount": 80, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Scribe_(markup_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2481", "fileType": "text", "centralPackageRepositoryCount": 0 }, "scrimshaw": { "title": "Scrimshaw", "appeared": 1993, "type": "pl", "reference": [ "http://cajun.cs.nott.ac.uk/compsci/epo/papers/volume6/issue4/ep6x4dsa.pdf" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4966", "centralPackageRepositoryCount": 0 }, "script": { "title": "SCRIPT markup", "appeared": 1999, "type": "pl", "example": [ ".ez on\n&P.This is a paragraph.\n&N1.First item\n&N2.First subitem\n&N2.Second subitem\n&N1.Second item" ], "wikipedia": { "example": [ ".ez on\n&P.This is a paragraph.\n&N1.First item\n&N2.First subitem\n&N2.Second subitem\n&N1.Second item" ], "related": [ "ibm-gml", "sgml", "scribe" ], "summary": "SCRIPT, any of a series of text markup languages starting with Script under Control Program-67/Cambridge Monitor System (CP-67/CMS) and Script/370 under Virtual Machine Facility/370 (VM/370); the current version, SCRIPT/VS, is part of IBM's Document Composition Facility (DCF) for IBM z/VM and z/OS systems. SCRIPT was developed for CP-67/CMS by Stuart Madnick at MIT, succeeding CTSS RUNOFF. SCRIPT is a procedural markup language. Inline commands called control words, indicated by a period in the first column of a logical line, describe the desired appearance of the formatted text. SCRIPT originally provided a 2PASS option to allow text to refer to variables defined later in the text, but subsequent versions allowed more than two passes.", "pageId": 4226836, "dailyPageViews": 17, "created": 2006, "backlinksCount": 18, "revisionCount": 121, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/SCRIPT_(markup)" }, "fileType": "text", "wordRank": 2443, "centralPackageRepositoryCount": 0 }, "scriptbasic": { "title": "ScriptBasic", "appeared": 1999, "type": "pl", "wikipedia": { "related": [ "c", "unix", "linux", "html", "tex", "pdf", "mysql", "postgresql", "regex" ], "summary": "ScriptBasic is a scripting language variant of BASIC. The source of the interpreter is available as a C program under the LGPL license. ScriptBasic generates intermediary code which is then interpreted by a runtime environment. ScriptBasic is available for Windows, Unix and Mac OS X and may be embedded in other programs as well. It can create standalone executable files. A runtime library is linked into the executable. It is available in precompiled binaries (setup.exe under Windows and uninstall also supported), dpkg and rpm for Linux and in source code form. The language, the interpreter is fully documented in the Users' Guide available in text, HTML, HTML Help, TeX, texi and PDF formats. ScriptBasic has been developed since 1999 and has reached a fairly matured state in terms of functions and stability. The precompiled version available for Windows and Linux includes a command line version and a standalone web server. This BASIC can be the choice for developers, who seek a BASIC variant that runs on UNIX as well as under Windows and Mac OS X (Intel). The Basic is embeddable with an option to compile your applications to a small footprint executable. ScriptBasic has an open interface for module developers. There are several external modules developed by the developer of ScriptBasic as well as by other developers. These include data base connection handling for various database systems (MySQL, PostgreSQL, ODBC, Berkeley DB and others), binding to the library CURL, PNG graphics, GTK+ graphical user interface, sockets, regular expressions, thread support, data compression and CGI. ScriptBasic also has an open interface for preprocessor developers. These are modules that may act not only during run-time but also compile time, thus making it possible to alter the language. Currently there is a single preprocessor that delivers debugger functionality. This lets the BASIC programmer run the BASIC program line by line, examine variable contents, set break points and all the usual debugging features. This debugger supports not only the command line version but also the web server implementation allowing full interactive debugging of CGI applications in BASIC. The architecture of the interpreter internally is object oriented and provides a clean and well documented interface to embed the interpreter into any application written in C or C++. The whole source code is extensively documented and commented, which is an outstanding feature compared to other embeddable script language implementations. Slides in HTML format with English narration in RealAudio format are also available to get a jump start learning the architecture and module, preprocessor and embedding developments. ScriptBasic is supported by a forum.", "created": 2002, "backlinksCount": 92, "pageId": 60650, "revisionCount": 78, "dailyPageViews": 9, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/ScriptBasic" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:ScriptBasic", "centralPackageRepositoryCount": 0 }, "scriptease": { "title": "ScriptEase", "appeared": 2001, "type": "pl", "description": "ScriptEase provides the most powerful and advanced form of JavaScript available today. Whereas other flavors of JavaScipt are embedded in web browsers and restricted to scripts that have been transmitted along with HTML documents, the ScriptEase processor allows you to run scripts locally, so you can use ScriptEase to write full fledged programs. In addition, ScriptEase has added commands and directives that increase and extend its power without interfering with the operation of standard JavaScript. These enhancements include preprocessor directives such as #include and #define, the switch/case statement, and the built-in Buffer object.", "website": "http://old.minford.k12.oh.us/sewse/manual/jsedesc.htm", "hasDirectives": { "example": "", "value": true }, "example": [ "while( ThereAreUncalledNamesOnTheList() == true){\n name=GetNameFromTheList();\n CallthePerson(name);\n LeaveTheMessage();\n }" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3619" }, "scriptol": { "title": "Scriptol", "appeared": 2001, "type": "pl", "wikipedia": { "related": [ "xml" ], "summary": "Scriptol is an object-oriented programming language that allows users to declare an XML document as a class. The language is universal and allows users to create dynamic web pages, as well as create scripts and binary applications.", "created": 2008, "backlinksCount": 6, "pageId": 19949822, "revisionCount": 23, "dailyPageViews": 4, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Scriptol" }, "centralPackageRepositoryCount": 0 }, "scriptx": { "title": "ScriptX", "appeared": 1995, "type": "pl", "reference": [ "https://en.wikipedia.org/wiki/ScriptX" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2483", "centralPackageRepositoryCount": 0 }, "scroll-lang": { "title": "SCROLL", "appeared": 1970, "type": "pl", "description": "A pattern recording language.", "reference": [ "https://semanticscholar.org/paper/06a2ad826a19844977fa42f5e7081fbbff967a15" ], "related": [ "troff" ], "example": [ "A$/BCD$IEF$" ], "hopl": "https://hopl.info/showlanguage.prx?exp=530", "wordRank": 6842, "centralPackageRepositoryCount": 0 }, "scroll": { "title": "Scroll", "appeared": 2020, "type": "textMarkup", "isPublicDomain": true, "creators": [ "Breck Yunits" ], "description": "An extensible alternative to Markdown built on Tree Notation.", "website": "https://scroll.pub/", "webRepl": [ "https://try.scroll.pub/" ], "domainName": { "registered": 2021, "name": "scroll.pub" }, "subsetOf": [ "treenotation" ], "related": [ "markdown", "treenotation", "grammar" ], "hasImports": { "example": "import settings.scroll", "value": true }, "hasTernaryOperators": { "example": "", "value": false }, "hasSemanticIndentation": { "example": "* A link to PLDB\n https://pldb.com", "value": true }, "example": [ "title This is Scroll. The keyword for title is title.\n\nparagraph\n Scroll is an extensible alternative to Markdown." ], "githubRepo": { "firstCommit": 2019, "stars": 268, "forks": 5, "subscribers": 7, "created": 2019, "updated": 2022, "description": "The extensible alternative to Markdown.", "issues": 6, "url": "https://github.com/breck7/scroll" }, "repoStats": { "firstCommit": 2019, "commits": 953, "committers": 6, "files": 97 }, "isOpenSource": true }, "scsh": { "title": "Scsh", "appeared": 2002, "type": "pl", "wikipedia": { "example": [ "#!/usr/local/bin/scsh -s\n!#\n\n(define (executables dir)\n (with-cwd dir\n (filter file-executable? (directory-files dir #t))))\n(define (writeln x) (display x) (newline))\n\n(for-each writeln\n (append-map executables ((infix-splitter \":\") (getenv \"PATH\"))))" ], "related": [ "ia-32", "scheme", "regex" ], "summary": "Scsh (a Scheme shell) is computer software, a type of shell for an operating system. It is a Portable Operating System Interface (POSIX) application programming interface (API) layered on the programming language Scheme, in a manner to make the most of Scheme's ability for scripting. Scsh is limited to 32-bit platforms but there is a development version against the latest Scheme 48 that works in 64-bit mode. It is free and open-source software released under a BSD license.", "created": 2003, "backlinksCount": 60, "pageId": 380536, "revisionCount": 61, "dailyPageViews": 14, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Scsh" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2484", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "scss": { "title": "SCSS", "appeared": 2006, "type": "stylesheetLanguage", "creators": [ "Hampton Lintorn-Catlin" ], "website": "http://sass-lang.com/", "webRepl": [ "https://playcode.io/scss/" ], "reference": [ "https://en.wikipedia.org/wiki/Sass_(stylesheet_language)" ], "fileExtensions": [ "sass", "scss" ], "domainName": { "registered": 2009, "awisRank": { "2017": 38503, "2022": 22267 }, "name": "sass-lang.com" }, "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasMixins": { "example": "@mixin reset-list {\n margin: 0;\n padding: 0;\n list-style: none;\n}\n@mixin horizontal-list {\n @include reset-list;\n\n li {\n display: inline-block;\n margin: {\n left: -2px;\n right: 2em;\n }\n }\n}\nnav ul {\n @include horizontal-list;\n}", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "\"" ] ], "githubLanguage": { "fileExtensions": [ "scss" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "scss", "codemirrorMode": "css", "codemirrorMimeType": "text/x-scss", "tmScope": "source.css.scss", "repos": 335325, "id": "SCSS" }, "githubBigQuery": { "repos": 8503, "users": 7569, "id": "SCSS" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/scss", "monaco": "scss", "pygmentsHighlighter": { "filename": "css.py", "fileExtensions": [ "scss" ], "id": "SCSS" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2015, "committerCount": 32, "commitCount": 203, "sampleCount": 1, "example": [ "$blue: #3bbfce;\n$margin: 16px;\n\n.content-navigation {\n border-color: $blue;\n color:\n darken($blue, 9%);\n}\n\n.border {\n padding: $margin / 2;\n margin: $margin / 2;\n border-color: $blue;\n}\n" ], "url": "https://github.com/MarioRicalde/SCSS.tmbundle" }, "leachim6": { "filepath": "s/SCSS.scss", "fileExtensions": [ "scss" ], "example": [ "body::before {\n content: \"Hello World\";\n}\n" ], "id": "SCSS" }, "rijuRepl": { "example": [ "body:before {\n content: \"Hello, world!\";\n}\n" ], "id": "https://riju.codes/scss" }, "twitter": "https://twitter.com/sasscss", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nAdvances in Systems, Computing Sciences and Software Engineering: Proceedings of Scss 2005|2006|Tarek Sobh|23111454|0.0|0|0\nAdvances in Systems, Computing Sciences and Software Engineering: Proceedings of Scss 2005|2006|Tarek Sobh|369788|0.0|0|0", "isbndb": "" }, "sdf-format": { "title": "sdf-format", "appeared": 2012, "type": "xmlFormat", "description": "SDF is an XML format that describes objects and environments for robot simulators, visualization, and control. Originally developed as part of the Gazebo robot simulator, SDF was designed with scientific robot applications in mind. Over the years, SDF has become a stable, robust, and extensible format capable of describing all aspects of robots, static and dynamic objects, lighting, terrain, and even physics.", "website": "http://sdformat.org/", "reference": [ "https://bitbucket.org/osrf/sdformat" ], "domainName": { "registered": 2013, "awisRank": { "2022": 1629752 }, "name": "sdformat.org" }, "centralPackageRepositoryCount": 0 }, "sdf": { "title": "SDF", "appeared": 1989, "type": "grammarLanguage", "reference": [ "https://semanticscholar.org/paper/869172852497052bc81d041c914c328bb16561ca" ], "wikipedia": { "summary": "SDF may refer to:", "backlinksCount": 45, "pageId": 174081, "dailyPageViews": 70, "created": 2003, "appeared": 1955, "url": "https://en.wikipedia.org/wiki/SDF" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1522", "centralPackageRepositoryCount": 0 }, "sdl": { "title": "Shared Dataspace Language", "appeared": 1988, "type": "pl", "description": "he authors are currently evaluating the use of shared dataspace paradigm as the basis for a novel programming language, called SDL (Shared Dataspace Language), that supports large-scale concurrency. Their goal is to develop the software support needed for the design, analysis, understanding, and testing of programs involving many thousands of concurrent processes running on a highly parallel multiprocessor. The authors provide an overview of the key SDL features, using small examples to illustrate its power and flexibility", "reference": [ "https://ieeexplore.ieee.org/document/12526" ], "standsFor": "Shared Dataspace Language", "wikipedia": { "backlinksCount": 17, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/SDL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1429" }, "sdlbasic": { "title": "SdlBasic", "appeared": 2002, "type": "pl", "hasPrintDebugging": { "example": "", "value": true }, "printToken": [ [ "print" ] ], "wikipedia": { "example": [ "Function swap( a, b )\n tmp = a\n a = b\n b = tmp\nEnd Function\nv1=10\nv2=20\nprint v1, v2\nswap( v1, v2 )\nprint v1, v2" ], "related": [ "basic", "wxbasic" ], "summary": "SdlBasic is a multiplatform interpreter for BASIC, using the SDL libraries. Its interpreter core is based on wxBasic. The interpreter can be very useful for people who are familiar with ANSI-BASIC interpreters and are curious or needing SDL library features on their coding development. Using the IDE it is possible to create an executable.", "created": 2007, "backlinksCount": 12, "pageId": 13475116, "revisionCount": 49, "dailyPageViews": 4, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/SdlBasic" }, "centralPackageRepositoryCount": 0 }, "sdms": { "title": "SDMS", "appeared": 2001, "type": "pl", "reference": [ "https://ips-lmu.github.io/The-EMU-SDMS-Manual/chap-querysys-impl.html" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2488", "centralPackageRepositoryCount": 0 }, "sdtm": { "title": "SDTM", "appeared": 2004, "type": "standard", "wikipedia": { "summary": "SDTM (Study Data Tabulation Model) defines a standard structure for human clinical trial (study) data tabulations and for nonclinical study data tabulations that are to be submitted as part of a product application to a regulatory authority such as the United States Food and Drug Administration (FDA). The Submission Data Standards team of Clinical Data Interchange Standards Consortium (CDISC) defines SDTM. On July 21, 2004, SDTM was selected as the standard specification for submitting tabulation data to the FDA for clinical trials and on July 5, 2011 for nonclinical studies. Eventually, all data submissions will be expected to conform to this format. As a result, clinical and nonclinical Data Managers will need to become proficient in the SDTM to prepare submissions and apply the SDTM structures, where appropriate, for operational data management.", "backlinksCount": 9, "pageId": 18408210, "dailyPageViews": 68, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/SDTM" } }, "search": { "title": "SEARCH", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/26be180d2f132f987602c9556b072d2f99e31324" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6667", "wordRank": 41, "centralPackageRepositoryCount": 0 }, "secure-operations-language": { "title": "Secure Operations Language", "appeared": 1970, "type": "pl", "aka": [ "sol" ], "wikipedia": { "related": [ "solidity" ], "summary": "The Secure Operations Language (SOL) was developed jointly by the United States Naval Research Laboratory and Utah State University in the United States. SOL is a domain-specific synchronous programming language for developing distributed applications and is based on software engineering principles developed in the Software Cost Reduction project at the Naval Research Laboratory in the late 1970s and early 1980s. SOL is intended to be a domain-specific language for developing service-based systems. Concurrently, a domain-specific extension of Java (SOLj) is being developed (FTDCS 2007) Application domains include sensor networks, defense and space systems, healthcare delivery, power control, etc. The investigators of the project are Dr. Ramesh Bharadwaj from the Naval Research Laboratory and Dr. Supratik Mukhopadhyay from Utah State University.", "pageId": 4536722, "created": 2006, "backlinksCount": 7, "revisionCount": 23, "dailyPageViews": 11, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/Secure_Operations_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "sed": { "title": "sed", "appeared": 1974, "type": "pl", "creators": [ "Lee E. McMahon" ], "documentation": [ "https://www.gnu.org/software/sed/manual/sed.html" ], "country": [ "United States" ], "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "example": [ "This is my dog, whose name is Frank.\nThis is my fish,\nwhose name is George.\nThis is my goat, whose name is Adam." ], "related": [ "c", "chomski", "perl", "awk", "unix", "regex", "grep", "ecmascript", "vi-editor", "vim-editor" ], "summary": "sed (stream editor) is a Unix utility that parses and transforms text, using a simple, compact programming language. sed was developed from 1973 to 1974 by Lee E. McMahon of Bell Labs, and is available today for most operating systems. sed was based on the scripting features of the interactive editor ed (\"editor\", 1971) and the earlier qed (\"quick editor\", 1965–66). sed was one of the earliest tools to support regular expressions, and remains in use for text processing, most notably with the substitution command. Other options for doing \"stream editing\" include AWK and Perl.", "pageId": 27163, "dailyPageViews": 329, "created": 2001, "backlinksCount": 486, "revisionCount": 750, "appeared": 1974, "url": "https://en.wikipedia.org/wiki/Sed" }, "githubLanguage": { "fileExtensions": [ "sed" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "gsed", "minised", "sed", "ssed" ], "aceMode": "text", "tmScope": "source.sed", "repos": 322, "id": "sed" }, "githubBigQuery": { "repos": 1075, "users": 998, "id": "sed" }, "pygmentsHighlighter": { "filename": "textedit.py", "fileExtensions": [ "sed", "[gs]sed" ], "id": "Sed" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 1, "commitCount": 31, "sampleCount": 1, "example": [ "# Towers of Hanoi in sed.\n#\n#\t@(#)hanoi.sed\t8.1 (Berkeley) 6/6/93\n# $FreeBSD$\n#\n#\n# Ex:\n# Run \"sed -f hanoi.sed\", and enter:\n#\n#\t:abcd: : :\n#\n# note -- TWO carriage returns were once required, this will output the\n# sequence of states involved in moving 4 rings, the largest called \"a\" and\n# the smallest called \"d\", from the first to the second of three towers, so\n# that the rings on any tower at any time are in descending order of size.\n# You can start with a different arrangement and a different number of rings,\n# say :ce:b:ax: and it will give the shortest procedure for moving them all\n# to the middle tower. The rules are: the names of the rings must all be\n# lower-case letters, they must be input within 3 fields (representing the\n# towers) and delimited by 4 colons, such that the letters within each field\n# are in alphabetical order (i.e. rings are in descending order of size).\n#\n# For the benefit of anyone who wants to figure out the script, an \"internal\"\n# line of the form\n#\t\tb:0abx:1a2b3 :2 :3x2\n# has the following meaning: the material after the three markers :1, :2,\n# and :3 represents the three towers; in this case the current set-up is\n# \":ab : :x :\". The numbers after a, b and x in these fields indicate\n# that the next time it gets a chance, it will move a to tower 2, move b\n# to tower 3, and move x to tower 2. The string after :0 just keeps track\n# of the alphabetical order of the names of the rings. The b at the\n# beginning means that it is now dealing with ring b (either about to move\n# it, or re-evaluating where it should next be moved to).\n#\n# Although this version is \"limited\" to 26 rings because of the size of the\n# alphabet, one could write a script using the same idea in which the rings\n# were represented by arbitrary [strings][within][brackets], and in place of\n# the built-in line of the script giving the order of the letters of the\n# alphabet, it would accept from the user a line giving the ordering to be\n# assumed, e.g. [ucbvax][decvax][hplabs][foo][bar].\n#\n#\t\t\tGeorge Bergman\n#\t\t\tMath, UC Berkeley 94720 USA\n\n# cleaning, diagnostics\ns/ *//g\n/^$/d\n/[^a-z:]/{a\\\nIllegal characters: use only a-z and \":\". Try again.\nd\n}\n/^:[a-z]*:[a-z]*:[a-z]*:$/!{a\\\nIncorrect format: use\\\n\\\t: string1 : string2 : string3 :\\\nTry again.\nd\n}\n/\\([a-z]\\).*\\1/{a\\\nRepeated letters not allowed. Try again.\nd\n}\n# initial formatting\nh\ns/[a-z]/ /g\nG\ns/^:\\( *\\):\\( *\\):\\( *\\):\\n:\\([a-z]*\\):\\([a-z]*\\):\\([a-z]*\\):$/:1\\4\\2\\3:2\\5\\1\\3:3\\6\\1\\2:0/\ns/[a-z]/&2/g\ns/^/abcdefghijklmnopqrstuvwxyz/\n:a\ns/^\\(.\\).*\\1.*/&\\1/\ns/.//\n/^[^:]/ba\ns/\\([^0]*\\)\\(:0.*\\)/\\2\\1:/\ns/^[^0]*0\\(.\\)/\\1&/\n:b\n# outputting current state without markers\nh\ns/.*:1/:/\ns/[123]//gp\ng\n:c\n# establishing destinations\n/^\\(.\\).*\\1:1/td\n/^\\(.\\).*:1[^:]*\\11/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\31/\n/^\\(.\\).*:1[^:]*\\12/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\33/\n/^\\(.\\).*:1[^:]*\\13/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\32/\n/^\\(.\\).*:2[^:]*\\11/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\33/\n/^\\(.\\).*:2[^:]*\\12/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\32/\n/^\\(.\\).*:2[^:]*\\13/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\31/\n/^\\(.\\).*:3[^:]*\\11/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\32/\n/^\\(.\\).*:3[^:]*\\12/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\31/\n/^\\(.\\).*:3[^:]*\\13/s/^\\(.\\)\\(.*\\1\\([a-z]\\).*\\)\\3./\\3\\2\\33/\nbc\n# iterate back to find smallest out-of-place ring\n:d\ns/^\\(.\\)\\(:0[^:]*\\([^:]\\)\\1.*:\\([123]\\)[^:]*\\1\\)\\4/\\3\\2\\4/\ntd\n# move said ring (right, resp. left)\ns/^\\(.\\)\\(.*\\)\\1\\([23]\\)\\(.*:\\3[^ ]*\\) /\\1\\2 \\4\\1\\3/\ns/^\\(.\\)\\(.*:\\([12]\\)[^ ]*\\) \\(.*\\)\\1\\3/\\1\\2\\1\\3\\4 /\ntb\ns/.*/Done! Try another, or end with ^D./p\nd\n" ], "url": "https://github.com/Alhadis/language-sed" }, "leachim6": { "filepath": "s/Sed.sed", "fileExtensions": [ "sed" ], "example": [ "#!/usr/bin/sed -f sed.sed\nc\\\nHello World\nq\n" ], "id": "Sed" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Sed", "quineRelay": "sed", "rijuRepl": { "example": [ "s/.*/Hello, world!/\n" ], "id": "https://riju.codes/sed" }, "tryItOnline": "sed", "tiobe": { "id": "sed" }, "hopl": "https://hopl.info/showlanguage.prx?exp=782", "ubuntuPackage": "sed", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1997|O'Reilly Media|sed & awk|Dougherty, Dale and Robbins, Arnold|9781565922259\n2002|O'Reilly Media|Sed and Awk: Pocket Reference, 2nd Edition |Arnold Robbins|9780596003524\n19970301|O'Reilly Media, Inc.|sed & awk|Dale Dougherty; Arnold Robbins|9781449396602\n19970301|O'Reilly Media, Inc.|sed & awk|Dale Dougherty; Arnold Robbins|9781449301880\n20020612|O'Reilly Media, Inc.|sed and awk Pocket Reference|Arnold Robbins|9780596552022\n20020612|O'Reilly Media, Inc.|sed and awk Pocket Reference|Arnold Robbins|9780596529024", "semanticScholar": "" }, "seed7": { "title": "Seed7", "appeared": 2005, "type": "pl", "creators": [ "Thomas Mertes" ], "website": "http://seed7.sourceforge.net", "fileExtensions": [ "sd7", "s7i" ], "domainName": { "name": "seed7.sourceforge.net" }, "hasComments": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "writeln" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "linux", "unix", "pascal", "modula-2", "ada", "algol-68", "c", "java", "unicode", "tls", "http", "ftp", "smtp", "mysql", "mariadb", "sqlite", "postgresql", "xml" ], "summary": "Seed7 is an extensible general-purpose programming language designed by Thomas Mertes. It is syntactically similar to Pascal and Ada. Along with many other features, it provides an extension mechanism. Seed7 supports introducing new syntax elements and their semantics into the language, and allows new language constructs to be defined and written in Seed7. For example, programmers can introduce syntax and semantics of new statements and user defined operator symbols. The implementation of Seed7 differs significantly from that of languages with hard-coded syntax and semantics.", "pageId": 36346048, "dailyPageViews": 37, "created": 2012, "backlinksCount": 78, "revisionCount": 114, "appeared": 2005, "fileExtensions": [ "sd7", "s7i" ], "url": "https://en.wikipedia.org/wiki/Seed7" }, "helloWorldCollection": [ "# Hello World in Seed7\n\n$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n begin\n writeln(\"Hello World!\");\n end func;\n" ], "leachim6": { "filepath": "s/Seed7.s7", "fileExtensions": [ "s7" ], "example": [ "$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n begin\n writeln(\"Hello World\");\n end func;\n" ], "id": "Seed7" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Seed7", "tiobe": { "id": "Seed7" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "segras": { "title": "SEGRAS", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1aacd7f379e51e0c42f5835e13cb746c84bd4098" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5834", "centralPackageRepositoryCount": 0 }, "self": { "title": "Self", "appeared": 1987, "type": "pl", "creators": [ "David Ungar" ], "website": "http://www.selflanguage.org", "documentation": [ "https://handbook.selflanguage.org/2017.1/index.html" ], "reference": [ "https://www.youtube.com/watch?v=Ox5P7QyL774" ], "country": [ "United States" ], "domainName": { "registered": 2009, "awisRank": { "2022": 8060537 }, "name": "selflanguage.org" }, "hasMessagePassing": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "'Hello world'", "value": true }, "printToken": [ [ "printLine" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "_AddSlots: (| porsche911 <- sportsCar copy |).\nporsche911 name:'Bobs Porsche'." ], "related": [ "smalltalk", "newtonscript", "javascript", "io", "agora", "squeak", "lisaac", "lua", "factor", "rebol", "java", "solaris", "linux", "c", "cecil", "ioke" ], "summary": "Self is an object-oriented programming language based on the concept of prototypes. Self began as a dialect of Smalltalk, being dynamically typed and using just-in-time compilation (JIT) as well as the prototype-based approach to objects: it was first used as an experimental test system for language design in the 1980s and 1990s. In 2006, Self was still being developed as part of the Klein project, which was a Self virtual machine written fully in Self. The latest version is 2017.1 released in May 2017. Several just-in-time compilation techniques were pioneered and improved in Self research as they were required to allow a very high level object oriented language to perform at up to half the speed of optimized C. Much of the development of Self took place at Sun Microsystems, and the techniques they developed were later deployed for Java's HotSpot virtual machine. At one point a version of Smalltalk was implemented in Self. Because it was able to use the JIT, this also gave extremely good performance.", "pageId": 60265, "dailyPageViews": 88, "created": 2002, "backlinksCount": 87, "revisionCount": 350, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/Self_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "self" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "none", "repos": 36, "id": "Self" }, "githubBigQuery": { "repos": 26, "users": 24, "id": "Self" }, "helloWorldCollection": [ "(| \"Hello World in Self\"\n\n hello = (| | 'Hello World!' print)\n|)\n" ], "leachim6": { "filepath": "s/Self.self", "fileExtensions": [ "self" ], "example": [ "'Hello World' printLine" ], "id": "Self" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Self", "hopl": "https://hopl.info/showlanguage.prx?exp=1361", "fileType": "text", "wordRank": 697, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|CreateSpace Independent Publishing Platform|Dark NLP: How To Use Neuro-linguistic Programming For Self Mastery, Getting What You Want, Mastering Others And To Gain An Advantage Over Anyone|Pace, Michael|9781518825392", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2007|Self|10.1145/1238844.1238853|218|8|D. Ungar and Randall B. Smith|f2ba08767970ae656b6af921fd96dd359e27ab41\n1995|Programming as an Experience: The Inspiration for Self|10.1007/3-540-49538-X_15|112|5|Randall B. Smith and D. Ungar|8f4083c32a564a9f101ae6e907b94d4e50dc739f" }, "semanol": { "title": "SEMANOL", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4810b42eb213a6adf752106172ff55e9e3c3cd39" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4078", "centralPackageRepositoryCount": 0 }, "semi-thue-system": { "title": "Semi-Thue", "appeared": 1914, "type": "grammarLanguage", "creators": [ "Axel Thue" ], "aka": [ "string rewriting system", "SRS" ], "related": [ "post-canonical-system" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Semi-Thue" } }, "semicolon": { "title": "semicolon", "appeared": 2012, "type": "esolang", "creators": [ "Pavan Kumar Sunkara" ], "description": "An esoteric language made up of only semicolons. You can't escape the semicolon monster!", "website": "https://pksunkara.com/semicolon", "documentation": [ "https://esolangs.org/wiki/Semicolon" ], "country": [ "India" ], "originCommunity": [ "https://github.com/pksunkara/semicolon/pulls" ], "versions": { "2015": [ "v0.1.3" ] }, "related": [ "brainfuck" ], "influencedBy": [ "brainfuck" ], "githubRepo": { "firstCommit": 2012, "stars": 128, "forks": 11, "subscribers": 5, "created": 2012, "updated": 2022, "description": "A language of semicolons", "issues": 0, "url": "https://github.com/pksunkara/semicolon" }, "repoStats": { "firstCommit": 2012, "commits": 29, "committers": 4, "files": 7 }, "isOpenSource": true }, "semver": { "title": "Semantic Versioning", "appeared": 2011, "type": "schema", "creators": [ "Tom Preston-Werner" ], "description": "Semantic versioning (aka SemVer)[1], currently the best known and most widely adopted version scheme in this category, uses a sequence of three digits (Major.Minor.Patch), an optional prerelease tag and optional build meta tag. In this scheme, risk and functionality are the measures of significance. Breaking changes are indicated by increasing the major number (high risk), new non-breaking features increment the minor number (medium risk) and all other non-breaking changes increment the patch number (lowest risk). The presence of a prerelease tag (-alpha, -beta) indicates substantial risk, as does a major number of zero (0.y.z), which is used to indicate a work-in-progress that may contain any level of potentially breaking changes (highest risk).", "website": "https://semver.org/", "aka": [ "SemVer semver" ], "domainName": { "registered": 2009, "awisRank": { "2022": 114374 }, "name": "semver.org" }, "example": [ "1.5.12" ], "githubRepo": { "firstCommit": 2011, "stars": 6140, "forks": 747, "subscribers": 186, "created": 2011, "updated": 2022, "description": "Semantic Versioning Specification", "issues": 116, "url": "https://github.com/semver/semver" }, "repoStats": { "firstCommit": 2011, "commits": 151, "committers": 41, "files": 10 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "send-standard": { "title": "Standard for Exchange of Non-clinical Data", "appeared": 2002, "type": "standard", "aka": [ "SEND" ], "wikipedia": { "summary": "The Standard for Exchange of Nonclinical Data (SEND) is an implementation of the CDISC Standard Data Tabulation Model (SDTM) for nonclinical studies, which specifies a way to present nonclinical data in a consistent format. These types of studies are related to animal testing conducted during drug development. Raw data of toxicology animal studies started after December 18, 2016 to support submission of new drugs to the US Food and Drug Administration will be submitted to the agency using SEND. Having a common model to which the industry can conform enables benefits such as the ability for vendors to develop tools, for inter-organizational data exchange that is consistent in format regardless of the parties involved, and so on. A SEND package consists of a few parts, but the main focus is on individual endpoint data. Endpoints typically map to domains (essentially, datasets), with a number of variables (a.k.a., columns or fields).", "backlinksCount": 11, "pageId": 18417601, "dailyPageViews": 13, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/Standard_for_Exchange_of_Non-clinical_Data" } }, "sensetalk": { "title": "SenseTalk", "appeared": 2001, "type": "pl", "creators": [ "Douglas Simons" ], "website": "http://sensetalk.com/", "domainName": { "registered": 2001, "awisRank": { "2022": 11913961 }, "name": "sensetalk.com" }, "wikipedia": { "related": [ "hypertalk", "hypercard", "plist" ], "summary": "SenseTalk is an English-like scripting language derived from the HyperTalk language used in HyperCard. SenseTalk was originally developed as the scripting language within the HyperSense multimedia authoring application on the NeXTStep and OpenStep platforms. SenseTalk resurfaced in 2002 as the scripting language in eggPlant, the first commercial Mac OS X and cross-platform GUI testing application.", "created": 2007, "backlinksCount": 10, "pageId": 9096092, "revisionCount": 52, "dailyPageViews": 11, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/SenseTalk" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "sentient": { "title": "sentient", "appeared": 2016, "type": "pl", "website": "http://sentient-lang.org", "domainName": { "registered": 2016, "name": "sentient-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n12432312|Sentient: a declarative language that lets you describe what your problem is|http://sentient-lang.org/|2016-09-05 21:25:53 UTC|1473110753|vmorgulis|2|4" }, "seph-programming-language": { "title": "Seph", "appeared": 2010, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Seph_%28programming_language%29" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "seph": { "title": "seph", "appeared": 2013, "type": "pl", "website": "https://seph-lang.org", "domainName": { "name": "seph-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n6560572|Seph programming language|https://seph-lang.org/|2013-10-16 16:31:50 UTC|1381941110|albertzeyer|0|1", "isbndb": "" }, "sepi": { "title": "sepi", "appeared": 2012, "type": "pl", "description": "SePi is a concurrent, message-passing programming language based on the pi-calculus. The language features synchronous, bi-directional channel-based communication.", "website": "http://rss.di.fc.ul.pt/tools/sepi/", "centralPackageRepositoryCount": 0, "isbndb": "" }, "seq": { "title": "Seq", "appeared": 2019, "type": "pl", "description": "A High-Performance Language for Bioinformatics. Here, we introduce Seq, the first language tailored specifically to bioinformatics, which marries the ease and productivity of Python with C-like performance. Seq is a subset of Python—and in many cases a drop-in replacement—yet also incorporates novel bioinformatics- and computational genomics-oriented data types, language constructs and optimizations. Seq enables users to write high-level, Pythonic code without having to worry about low-level or domain-specific optimizations, and allows for seamless expression of the algorithms, idioms and patterns found in many genomics or bioinformatics applications. On equivalent CPython code, Seq attains a performance improvement of up to two orders of magnitude, and a 175× improvement once domain-specific language features and optimizations are used. With parallelism, we demonstrate up to a 650× improvement. Compared to optimized C++ code, which is already difficult for most biologists to produce, Seq frequently attains up to a 2× improvement, and with shorter, cleaner code. Thus, Seq opens the door to an age of democratization of highly-optimized bioinformatics software.", "reference": [ "http://cb.csail.mit.edu/cb/seq/oopsla19-paper34.pdf" ], "subsetOf": [ "python" ], "example": [ "from sys import argv\nfrom genomeindex import *\n\n# index and process 20-mers\ndef process(kmer: k20, index: GenomeIndex[k20]):\n prefetch index[kmer], index[~kmer]\n hits_fwd = index[kmer]\n hits_rev = index[~kmer]" ] }, "seque": { "title": "Seque", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3dba059eef95967127526055454cf5cd969a6221" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1433", "centralPackageRepositoryCount": 0 }, "sequel-2": { "title": "SEQUEL 2", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b5cab20a32862302d24fc4dbfc454090d132124e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3959", "centralPackageRepositoryCount": 0 }, "sequencel": { "title": "SequenceL", "appeared": 1989, "type": "pl", "wikipedia": { "example": [ "cmd:>prime(100...200)\n [101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199]" ], "related": [ "x86-isa", "arm", "linux", "opencl", "c", "csharp", "fortran", "java", "python", "lisp", "haskell", "pascal", "eclipse-editor" ], "summary": "SequenceL is a general purpose functional programming language and auto-parallelizing (Parallel computing) compiler and tool set, whose primary design objectives are performance on multi-core processor hardware, ease of programming, platform portability/optimization, and code clarity and readability. Its main advantage is that it can be used to write straightforward code that automatically takes full advantage of all the processing power available, without programmers needing to be concerned with identifying parallelisms, specifying vectorization, avoiding race conditions, and other challenges of manual directive-based programming approaches such as OpenMP. Programs written in SequenceL can be compiled to multithreaded code that runs in parallel, with no explicit indications from a programmer of how or what to parallelize. As of 2015, versions of the SequenceL compiler generate parallel code in C++ and OpenCL, which allows it to work with most popular programming languages, including C, C++, C#, Fortran, Java, and Python. A platform-specific runtime manages the threads safely, automatically providing parallel performance according to the number of cores available, currently supporting x86, OpenPOWER/POWER8, and ARM platforms.", "pageId": 37895661, "created": 2012, "backlinksCount": 43, "revisionCount": 191, "dailyPageViews": 22, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/SequenceL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SequenceL", "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "sequential-function-chart": { "title": "SFC", "appeared": 1993, "type": "pl", "aka": [ "sfc" ], "visualParadigm": true, "wikipedia": { "related": [ "drakon" ], "summary": "Sequential function chart (SFC) is a graphical programming language used for programmable logic controllers (PLCs). It is one of the five languages defined by IEC 61131-3 standard. The SFC standard is defined as, Preparation of function charts for control systems, and was based on GRAFCET (itself based on binary Petri nets). It can be used to program processes that can be split into steps. Main components of SFC are: Steps with associated actions; Transitions with associated logic conditions; Directed links between steps and transitions.Steps in an SFC diagram can be active or inactive. Actions are only executed for active steps. A step can be active for one of two motives: It is an initial step as specified by the programmer. It was activated during a scan cycle and not deactivated since.Steps are activated when all steps above it are active and the connecting transition is superable (i.e. its associated condition is true). When a transition is passed, all steps above are deactivated at once and after all steps below are activated at once. Actions associated with steps can be of several types, the most relevant ones being Continuous (N), Set (S) and Reset (R). Apart from the obvious meaning of Set and Reset, an N action ensures that its target variable is set to 1 as long as the step is active. An SFC rule states that if two steps have an N action on the same target, the variable must never be reset to 0. It is also possible to insert LD (Ladder Diagram) actions inside an SFC program (and this is the standard way, for instance, to work on integer variables). SFC is an inherently parallel language in that multiple control flows — Program Organization Units (POUs) in the standard's parlance — can be active at once. Non-standard extensions to the language include macroactions: i.e. actions inside a program unit that influence the state of another program unit. The most relevant such macroaction is \"forcing\", in which a POU can decide the active steps of another POU.", "pageId": 2009084, "dailyPageViews": 78, "created": 2005, "backlinksCount": 19, "revisionCount": 82, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Sequential_function_chart" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "sequential-pascal": { "title": "Sequential Pascal", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ad8a640f90f26afefdbac81f5a6706990d795130" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3794", "centralPackageRepositoryCount": 0 }, "serious": { "title": "Serious", "appeared": 2021, "type": "pl", "creators": [ "lorentzj" ], "website": "https://github.com/lorentzj/serious", "country": [ "Unknown" ], "example": [ "let x = 3;\nlet y = 4;\nprint (x^2 + y^2)^0.5;" ], "githubRepo": { "stars": 0, "forks": 0, "subscribers": 1, "created": 2021, "updated": 2022, "description": "A simple language for mathematical transformations", "url": "https://github.com/lorentzj/serious" }, "repoStats": { "firstCommit": 2023, "commits": 80, "committers": 1, "files": 65 } }, "service-modeling-language": { "title": "Service Modeling Language", "appeared": 2009, "type": "pl", "wikipedia": { "related": [ "xml", "xpath" ], "summary": "Service Modeling Language (SML) and Service Modeling Language Interchange Format (SML-IF) are a pair of XML-based specifications created by leading information technology companies that define a set of XML instance document extensions for expressing links between elements, a set of XML Schema extensions for constraining those links, and a way to associate Schematron rules with global element declarations, global complex type definitions, and/or model documents. The SML specification defines model concepts, and the SML-IF specification describes a packaging format for exchanging SML-based models. SML and SML-IF were standardized in a W3C working group chartered to produce W3C Recommendations for the Service Modeling Language by refining the “Service Modeling Language” (SML) Member Submission, addressing implementation experience and feedback on the specifications. The submission was from an industry group consisting of representatives from BEA Systems, BMC, CA, Cisco, Dell, EMC, HP, IBM, Intel, Microsoft, and Sun Microsystems. They were published as W3C Recommendations on May 12, 2009. In the market and in applying by vendors, SML is seen as a successor/replacement for earlier developed standards like DCML and Microsoft's (in hindsight) proprietary System Definition Model or SDM. See for a historically helpful relation between SDM and DCML, and for the joint pressrelease announcing SML. In the Microsoft section of it the sequel role to SDM is mentioned.", "created": 2006, "backlinksCount": 7, "pageId": 6211462, "revisionCount": 48, "dailyPageViews": 7, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Service_Modeling_Language" }, "centralPackageRepositoryCount": 0 }, "sespath": { "title": "SESPATH", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1b72929ddaba0ae8684a0883d73ec10347800df0" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5754", "centralPackageRepositoryCount": 0 }, "sespool": { "title": "SESPOOL", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ff3636dadf21444d09eb2edde32d8da834d326bb" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2811", "centralPackageRepositoryCount": 0 }, "set-builder-notation": { "title": "Set-builder notation", "appeared": 1942, "type": "notation", "example": [ "\\{l\\ |\\ l\\in L\\}" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Set-builder_notation" } }, "setl": { "title": "SETL", "appeared": 1969, "type": "pl", "creators": [ "Jacob T. Schwartz" ], "description": "SETL is a general-purpose, high-level programming language in which sets and first-order mappings are fundamental to the syntax and semantics of the language. This lends great conciseness and readability to a wide range of applications, from basic data filtering and transformation to the abstract presentation of complex algorithms. SETL is particularly good for software prototyping.", "website": "http://setl.org/setl/", "country": [ "United States" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "print" ] ], "wikipedia": { "example": [ "procedure factorial(n); -- calculates the factorial n!\n return if n = 1 then 1 else n * factorial(n - 1) end if;\nend factorial;" ], "related": [ "algol-60", "abc", "ada", "python" ], "summary": "SETL (SET Language) is a very high-level programming language based on the mathematical theory of sets. It was originally developed by (Jack) Jacob T. Schwartz at the New York University (NYU) Courant Institute of Mathematical Sciences in the late 1960s.", "pageId": 916963, "created": 2004, "backlinksCount": 51, "revisionCount": 101, "dailyPageViews": 34, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/SETL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SETL", "rijuRepl": { "example": [ "print(\"Hello, world!\");\n" ], "id": "https://riju.codes/setl" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1268", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming with Sets: An Introduction to Setl|1986|Jacob T. Schwartz|1634697|4.50|2|0\nSoftware Prototyping Mit Setl|1989|Ernst-Erich Doberkat|37857661|0.0|0|0\nThe Setl Project Master Catalog. a Comprehensive Listing of Reports, Working Papers, and Computer Readable Document and Program Files Pertaining to Work at Nyu on the Setl Set-Theoretic Programming Language||Robert Abes|47398006|0.0|0|0\nThe Setl Project Master Catalog: A Comprehensive Listing of Reports, Working Papers, and Computer Readable Document and Program Files Pertaining to Work at New York University on the Setl Set-Theoretic Programming Language (Classic Reprint)||Robert Abes|65986497|0.0|0|0\nRecursive Data Types in Setl: Automatic Determination, Data Language Description, and Efficient Implementation (Classic Reprint)|2015|Gerald Weiss|46378170|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1986|Springer-Verlag|Programming With Sets: An Introduction to Setl|J.T. Schwartz and Robert B.K. Dewar|9780387963990\n2012|Springer|Programming With Sets: An Introduction To Setl (monographs In Computer Science)|J.t. Schwartz and R.b.k. Dewar and E. Dubinsky and E. Schonberg|9781461395775", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1981|An Automatic Technique for Selection of Data Representations in SETL Programs|10.1145/357133.357135|126|3|E. Schonberg and J. Schwartz and M. Sharir|c4cfe5caa2075b49bc98c89f60db94c7c4ea410e\n1979|Programming by Refinement, as Exemplified by the SETL Representation Sublanguage|10.1145/357062.357064|108|4|R. Dewar and Art Grand and Ssu-Cheng Liu and J. Schwartz and E. Schonberg|0fb3b1a16b1d1db4a45b4b1d996ec04e684d073e\n1983|Experience with the SETL Optimizer|10.1145/357195.357197|55|1|S. Freudenberger and J. Schwartz and M. Sharir|b302fd5defe19bef88feae29febaa68ced105451\n1979|Automatic data structure selection in SETL|10.1145/567752.567771|49|4|E. Schonberg and J. Schwartz and M. Sharir|c12ce42f5bf7f8365741c382327bbb5fe38f78cb\n1984|Software Prototyping using the SETL Programming Language|10.1109/MS.1984.229465|42|3|Philippe B Kruchten and E. Schonberg and Jacob Schwart|d83f02d5a64785edff281447b800be5712c6cb0e\n1974|Review of On programming: an interim report on the SETL project, intallment II: the SETL language and examples of its use by J. T. Schwartz. New York University, 1973.|10.1145/953220.953221|33|0|Thomas I. M. Ho|d0eeb665746375cff009fcab8d3d65c635456d7f\n2013|SETL and the Evolution of Programming|10.1007/978-1-4471-4282-9_4|14|0|R. Dewar|692971735fdfdc18a559fb9065aea0e376a891f6\n1987|Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach|10.1007/3-540-50241-6_29|9|2|E. Dahlhaus|71735ced25de6672431a7796b804a285dfc286ff\n1979|The elements of SETL style.|10.1145/800177.810021|8|0|R. Dewar and E. Schonberg|6d52a4b15e5968eeb4ab379c5cc035c372be581e\n1974|Automatic and semiautomatic optimization of SETL|10.1145/800233.807044|6|0|J. Schwartz|c7608e1ddd05667d6d8a1eae29d388cc9c929c1d\n1987|Development of a Programming Environment for Setl|10.1007/BFb0022095|5|0|V. Donzeau-Gouge and Catherine Dubois and P. Facon and F. Jean|4e77fd5689d27d41591d99ea12e13a08f52820a0" }, "setlog": { "title": "SetLog", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8dda7214c62f8ad4a7eb1cdaa4db880b622bdb1a" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3775", "centralPackageRepositoryCount": 0 }, "setlx": { "title": "setlx", "appeared": 2011, "type": "pl", "description": "setlX is an interpreter for the high level programming language SetlX (set language extended). The most distinguishing feature of this language is the support it offers for sets and lists. As set theory is the language of mathematics, many mathematical algorithms that are formulated in terms of set theory have very straightforward implementations in SetlX. Designed mostly by Karl Stroetmann, the SetlX language is an evolution of Setl by Jack Schwartz. It was specifically conceived to make the unique features of Setl more accessible to today's computer science students. This interpreter is currently the SetlX reference implementation.", "website": "https://randoom.org/Software/SetlX/", "githubRepo": { "firstCommit": 2011, "stars": 24, "forks": 12, "subscribers": 7, "created": 2014, "updated": 2022, "description": "setlX is an interpreter for the high level programming-language SetlX (set language extended).", "issues": 1, "url": "https://github.com/herrmanntom/setlX" }, "repoStats": { "firstCommit": 2011, "commits": 1728, "committers": 25, "files": 1253 } }, "setun": { "title": "Setun", "appeared": 1958, "type": "computingMachine", "wikipedia": { "backlinksCount": 101, "appeared": 1958, "url": "https://en.wikipedia.org/wiki/Setun" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5292" }, "seval": { "title": "SEVAL", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/201c3578661625d11503886631409a7e81e96bdd" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4155", "centralPackageRepositoryCount": 0 }, "seymour": { "title": "Seymour", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c1ff6ef218e147749d1b81062d5aa4b3bfe4a90e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5730", "centralPackageRepositoryCount": 0 }, "sgml": { "title": "SGML", "appeared": 1986, "type": "textMarkup", "standsFor": "Standard Generalized Markup Language", "country": [ "United States" ], "wikipedia": { "example": [ "\nfirst line\nsecond line\n" ], "related": [ "ibm-gml", "html", "xml", "scheme", "linux", "hytime", "regex", "unicode", "xquery", "java-server-pages", "scala", "dtd", "s-expressions", "latex" ], "summary": "The Standard Generalized Markup Language (SGML; ISO 8879:1986) is a standard for defining generalized markup languages for documents. ISO 8879 Annex A.1 defines generalized markup: Generalized markup is based on two postulates: Markup should be declarative: it should describe a document's structure and other attributes, rather than specify the processing to be performed on it. Declarative markup is less likely to conflict with unforeseen future processing needs and techniques. Markup should be rigorous so that the techniques available for processing rigorously-defined objects like programs and databases can be used for processing documents as well. HTML was theoretically an example of an SGML-based language until HTML 5, which admits that browsers cannot parse it as SGML (for compatibility reasons) and codifies exactly what they must do instead. DocBook SGML and LinuxDoc are better examples, as they were used almost exclusively with actual SGML tools.", "pageId": 28994, "dailyPageViews": 384, "created": 2001, "backlinksCount": 761, "revisionCount": 575, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Standard_Generalized_Markup_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1435", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSGML for Dummies [With CDROM]|1997|William von Hagen|1025599|0.0|0|0\nSgml For Dummies Quick Reference||William von Hagen|18182883|0.0|0|0\nPARSEME.1st: SGML for Software Developers|1997|Sean McGrath|2235173|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1995|Prentice Hall|Developing Sgml Dtds: From Text to Model to Markup|Maler, Eve and El Andaloussi, Jeanne|9780133098815\n1998|Prentice Hall|Sgml at Work|Vint, Danny R.|9780136365723", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|Using SGML as a Basis for Data-Intensive Natural Language Processing|10.1023/A:1001053128638|31|5|D. McKelvie and Chris Brew and H. Thompson|90f6397fb414b7739cc34ed6c53fb276f14da7f0" }, "sh": { "title": "sh", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4d9cdae4e506c6b9e445e78f918b0b5ca2d60991" ], "rijuRepl": { "example": [ "echo \"Hello, world!\"\n" ], "id": "https://riju.codes/sh" }, "hopl": "https://hopl.info/showlanguage.prx?exp=568", "wordRank": 5250, "centralPackageRepositoryCount": 0 }, "sha-1-hash-function": { "title": "SHA-1", "appeared": 1993, "type": "hashFunction", "wikipedia": { "summary": "In cryptography, SHA-1 (Secure Hash Algorithm 1) is a cryptographic hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest – typically rendered as a hexadecimal number, 40 digits long. It was designed by the United States National Security Agency, and is a U.S. Federal Information Processing Standard.Since 2005 SHA-1 has not been considered secure against well-funded opponents, as of 2010 many organizations have recommended its replacement. NIST formally deprecated use of SHA-1 in 2011 and disallowed its use for digital signatures in 2013. Since 2020 attacks against SHA-1 are as practical as against MD5. It is recommended to remove SHA-1 in from products as soon as possible and use instead SHA-256 or SHA-3. Replacing SHA-1 is urgent where it's used for signatures. All major web browser vendors ceased acceptance of SHA-1 SSL certificates in 2017. In February 2017, CWI Amsterdam and Google announced they had performed a collision attack against SHA-1, publishing two dissimilar PDF files which produced the same SHA-1 hash.", "backlinksCount": 1092, "pageId": 26672, "dailyPageViews": 1478, "appeared": 1993, "url": "https://en.wikipedia.org/wiki/SHA-1" } }, "sha-2-hash-function": { "title": "SHA-2", "appeared": 2001, "type": "hashFunction", "wikipedia": { "summary": "SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA). They are built using the Merkle–Damgård structure, from a one-way compression function itself built using the Davies–Meyer structure from a (classified) specialized block cipher. SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of six hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256. SHA-256 and SHA-512 are novel hash functions computed with 32-bit and 64-bit words, respectively. They use different shift amounts and additive constants, but their structures are otherwise virtually identical, differing only in the number of rounds. SHA-224 and SHA-384 are truncated versions of SHA-256 and SHA-512 respectively, computed with different initial values. SHA-512/224 and SHA-512/256 are also truncated versions of SHA-512, but the initial values are generated using the method described in Federal Information Processing Standards (FIPS) PUB 180-4. SHA-2 was published in 2001 by the National Institute of Standards and Technology (NIST) a U.S. federal standard (FIPS). The SHA-2 family of algorithms are patented in US patent 6829355. The United States has released the patent under a royalty-free license.Currently, the best public attacks break preimage resistance for 52 out of 64 rounds of SHA-256 or 57 out of 80 rounds of SHA-512, and collision resistance for 46 out of 64 rounds of SHA-256.", "backlinksCount": 623, "pageId": 1638777, "dailyPageViews": 1651, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/SHA-2" } }, "sha-3-hash-function": { "title": "SHA-3", "appeared": 2015, "type": "hashFunction", "wikipedia": { "summary": "SHA-3 (Secure Hash Algorithm 3) is the latest member of the Secure Hash Algorithm family of standards, released by NIST on August 5, 2015. Although part of the same series of standards, SHA-3 is internally different from the MD5-like structure of SHA-1 and SHA-2. SHA-3 is a subset of the broader cryptographic primitive family Keccak (), designed by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche, building upon RadioGatún. Keccak's authors have proposed additional uses for the function, not (yet) standardized by NIST, including a stream cipher, an authenticated encryption system, a \"tree\" hashing scheme for faster hashing on certain architectures, and AEAD ciphers Keyak and Ketje.Keccak is based on a novel approach called sponge construction. Sponge construction is based on a wide random function or random permutation, and allows inputting (\"absorbing\" in sponge terminology) any amount of data, and outputting (\"squeezing\") any amount of data, while acting as a pseudorandom function with regard to all previous inputs. This leads to great flexibility. NIST does not currently plan to withdraw SHA-2 or remove it from the revised Secure Hash Standard. The purpose of SHA-3 is that it can be directly substituted for SHA-2 in current applications if necessary, and to significantly improve the robustness of NIST's overall hash algorithm toolkit.The creators of the Keccak algorithms and the SHA-3 functions suggest using the faster function KangarooTwelve with adjusted parameters and a new tree hashing mode without extra overhead for small message sizes.", "backlinksCount": 215, "pageId": 20394543, "dailyPageViews": 807, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/SHA-3" } }, "shadama": { "title": "shadama", "appeared": 2017, "type": "pl", "creators": [ "Yoshiki Ohshima", "Dan Amelang", "Bert Freudenberg" ], "description": "Shadama is the prototype of a programming language for writing programs that create, control and visualize large numbers of objects. The Shadama environment supports liveness, yet Shadama programs are run on the GPU, which enables high performance. The primary goal of the language is to facilitate the writing of scientific simulations by students at the high school level.", "reference": [ "https://news.ycombinator.com/item?id=19530732" ], "githubRepo": { "firstCommit": 2017, "stars": 18, "forks": 4, "subscribers": 4, "created": 2017, "updated": 2021, "issues": 1, "url": "https://github.com/yoshikiohshima/Shadama" }, "repoStats": { "firstCommit": 2017, "commits": 359, "committers": 3, "files": 74 } }, "shade": { "title": "shade", "appeared": 2012, "type": "pl", "githubRepo": { "url": "https://github.com/chameco/Shade" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n4973566|Show HN: Shade, a language based on C, Go, and Haskell|2012-12-27 15:21:16 UTC|1356621676|chameco|0|15" }, "shaderlab": { "title": "ShaderLab", "appeared": 2000, "type": "pl", "reference": [ "https://docs.unity3d.com/Manual/SL-Shader.html" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "githubLanguage": { "fileExtensions": [ "shader" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nunity3d-jp UnityChanToonShaderVer2_Project https://github.com/unity3d-jp.png https://github.com/unity3d-jp/UnityChanToonShaderVer2_Project ShaderLab #ccc 561 104 64 \"UnityChanToonShaderVer2 Project / v.2.0.7 Release\"\ncandycat1992 Unity_Shaders_Book https://github.com/candycat1992.png https://github.com/candycat1992/Unity_Shaders_Book ShaderLab #ccc 1835 741 83 \"📖 书籍《Unity Shader入门精要》源代码\"", "trendingProjectsCount": 3, "type": "programming", "aceMode": "text", "tmScope": "source.shaderlab", "repos": 59455, "id": "ShaderLab" }, "githubBigQuery": { "repos": 1210, "users": 1132, "id": "ShaderLab" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2017, "committerCount": 2, "commitCount": 5, "sampleCount": 3, "example": [ "// From https://github.com/Unity-Technologies/PostProcessing,\n// licensed under MIT licence.\n\nShader \"Hidden/Post FX/Depth Of Field\"\n{\n Properties\n {\n _MainTex (\"\", 2D) = \"black\"\n }\n\n CGINCLUDE\n #pragma exclude_renderers d3d11_9x\n #pragma target 3.0\n ENDCG\n\n SubShader\n {\n Cull Off ZWrite Off ZTest Always\n\n // (0) Downsampling, prefiltering & CoC\n Pass\n {\n CGPROGRAM\n #pragma multi_compile __ UNITY_COLORSPACE_GAMMA\n #pragma vertex VertDOF\n #pragma fragment FragPrefilter\n #include \"DepthOfField.cginc\"\n ENDCG\n }\n\n // (1) Pass 0 + temporal antialiasing\n Pass\n {\n CGPROGRAM\n #pragma vertex VertDOF\n #pragma fragment FragPrefilter\n #define PREFILTER_TAA\n #include \"DepthOfField.cginc\"\n ENDCG\n }\n\n // (2-5) Bokeh filter with disk-shaped kernels\n Pass\n {\n CGPROGRAM\n #pragma vertex VertDOF\n #pragma fragment FragBlur\n #define KERNEL_SMALL\n #include \"DepthOfField.cginc\"\n ENDCG\n }\n\n Pass\n {\n CGPROGRAM\n #pragma vertex VertDOF\n #pragma fragment FragBlur\n #define KERNEL_MEDIUM\n #include \"DepthOfField.cginc\"\n ENDCG\n }\n\n Pass\n {\n CGPROGRAM\n #pragma vertex VertDOF\n #pragma fragment FragBlur\n #define KERNEL_LARGE\n #include \"DepthOfField.cginc\"\n ENDCG\n }\n\n Pass\n {\n CGPROGRAM\n #pragma vertex VertDOF\n #pragma fragment FragBlur\n #define KERNEL_VERYLARGE\n #include \"DepthOfField.cginc\"\n ENDCG\n }\n\n // (6) Postfilter blur\n Pass\n {\n CGPROGRAM\n #pragma vertex VertDOF\n #pragma fragment FragPostBlur\n #include \"DepthOfField.cginc\"\n ENDCG\n }\n }\n\n FallBack Off\n}" ], "url": "https://github.com/tgjones/shaders-tmLanguage" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "shadow": { "title": "SHADOW", "appeared": 1958, "type": "pl", "description": "This paper provides an account of the Shadow language that is used to describe syntax and of a corresponding subroutine that enables a computer to perform syntactic analysis. The input to this subroutine consists of a string to be analyzed and a description of the syntax that is to be used. The syntax is expressed in the Shadow language. The output consists of a trace table that expresses the results of the syntactic analysis in a tabular form. Several versions of the subroutine and some associated programs have been in use now for over three years. The present account of the language and the subroutine contains a summary of material that has been described previously in unpublished reports and also some additional discussion of the work in relation to the more general questions of problem-oriented languages and string transformations.", "reference": [ "https://dl.acm.org/doi/10.1145/368959.368992" ], "hopl": "https://hopl.info/showlanguage.prx?exp=168", "wordRank": 4505, "isbndb": "year|publisher|title|authors|isbn13\n2007|Syngress|Stealing the Network: How to Own a Shadow|Long, Johnny and Mullen, Timothy and Russell, Ryan|9781597490818" }, "shakespeare-programming-language": { "title": "Shakespeare", "appeared": 2001, "type": "pl", "wikipedia": { "example": [ "Romeo, a young man with a remarkable patience.\nJuliet, a likewise young woman of remarkable grace.\nOphelia, a remarkable woman much in dispute with Hamlet.\nHamlet, the flatterer of Andersen Insulting A/S.\n\n Act I: Hamlet's insults and flattery.\n Scene I: The insulting of Romeo.\n[Enter Hamlet and Romeo]\nHamlet:\nYou lying stupid fatherless big smelly half-witted coward! You are as\nstupid as the difference between a handsome rich brave hero and thyself!\nSpeak your mind!\nYou are as brave as the sum of your fat little stuffed misused dusty\nold rotten codpiece and a beautiful fair warm peaceful sunny summer's\nday. You are as healthy as the difference between the sum of the\nsweetest reddest rose and my father and yourself! Speak your mind!\nYou are as cowardly as the sum of yourself and the difference\nbetween a big mighty proud kingdom and a horse. Speak your mind.\nSpeak your mind!\n[Exit Romeo]\n Scene II: The praising of Juliet.\n[Enter Juliet]\nHamlet:\nThou art as sweet as the sum of the sum of Romeo and his horse and his\nblack cat! Speak thy mind!\n[Exit Juliet]\n Scene III: The praising of Ophelia.\n[Enter Ophelia]\nHamlet:\nThou art as lovely as the product of a large rural town and my amazing\nbottomless embroidered purse. Speak thy mind!\nThou art as loving as the product of the bluest clearest sweetest sky\nand the sum of a squirrel and a white horse. Thou art as beautiful as\nthe difference between Juliet and thyself. Speak thy mind!\n[Exeunt Ophelia and Hamlet]\n\n Act II: Behind Hamlet's back.\n Scene I: Romeo and Juliet's conversation.\n[Enter Romeo and Juliet]\nRomeo:\nSpeak your mind. You are as worried as the sum of yourself and the\ndifference between my small smooth hamster and my nose. Speak your\nmind!\nJuliet:\nSpeak YOUR mind! You are as bad as Hamlet! You are as small as the\ndifference between the square of the difference between my little pony\nand your big hairy hound and the cube of your sorry little\ncodpiece. Speak your mind!\n[Exit Romeo]\n Scene II: Juliet and Ophelia's conversation.\n[Enter Ophelia]\nJuliet:\nThou art as good as the quotient between Romeo and the sum of a small\nfurry animal and a leech. Speak your mind!\nOphelia:\nThou art as disgusting as the quotient between Romeo and twice the\ndifference between a mistletoe and an oozing infected blister! Speak\nyour mind!\n[Exeunt]" ], "related": [ "assembly-language" ], "summary": "The Shakespeare Programming Language (SPL) is an esoteric programming language designed by Jon Åslund and Karl Hasselström. Like the Chef programming language, it is designed to make programs appear to be something other than programs; in this case, Shakespearean plays. A character list in the beginning of the program declares a number of stacks, naturally with names like \"Romeo\" and \"Juliet\". These characters enter into dialogue with each other in which they manipulate each other's topmost values, push and pop each other, and do I/O. The characters can also ask each other questions which behave as conditional statements. On the whole, the programming model is very similar to assembly language but much more verbose.", "created": 2015, "backlinksCount": 13, "pageId": 667776, "revisionCount": 1, "dailyPageViews": 35, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Shakespeare_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "shakespeare": { "title": "Shakespeare", "appeared": 1993, "type": "esolang", "website": "http://shakespearelang.sourceforge.net/report/shakespeare/", "wikipedia": { "example": [ "Act II: Behind Hamlet's back.\n Scene I: Romeo and Juliet's conversation.\n[Enter Romeo and Juliet]\nRomeo:\nSpeak your mind. You are as worried as the sum of yourself and the\ndifference between my small smooth hamster and my nose. Speak your\nmind!\nJuliet:\nSpeak YOUR mind! You are as bad as Hamlet! You are as small as the\ndifference between the square of the difference between my little pony\nand your big hairy hound and the cube of your sorry little\ncodpiece. Speak your mind!\n[Exit Romeo]\n Scene II: Juliet and Ophelia's conversation.\n[Enter Ophelia]\nJuliet:\nThou art as good as the quotient between Romeo and the sum of a small\nfurry animal and a leech. Speak your mind!\nOphelia:\nThou art as disgusting as the quotient between Romeo and twice the\ndifference between a mistletoe and an oozing infected blister! Speak\nyour mind!\n[Exeunt]" ], "related": [ "assembly-language" ], "summary": "The Shakespeare Programming Language (SPL) is an esoteric programming language designed by Jon Åslund and Karl Hasselström. Like the Chef programming language, it is designed to make programs appear to be something other than programs; in this case, Shakespearean plays. A character list in the beginning of the program declares a number of stacks, naturally with names like \"Romeo\" and \"Juliet\". These characters enter into dialogue with each other in which they manipulate each other's topmost values, push and pop each other, and do I/O. The characters can also ask each other questions which behave as conditional statements. On the whole, the programming model is very similar to assembly language but much more verbose.", "pageId": 667776, "dailyPageViews": 100, "created": 2004, "backlinksCount": 11, "revisionCount": 177, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Shakespeare_Programming_Language" }, "helloWorldCollection": [ "The Infamous Hello World Program in Shakespeare.\n\nRomeo, a young man with a remarkable patience.\nJuliet, a likewise young woman of remarkable grace.\nOphelia, a remarkable woman much in dispute with Hamlet.\nHamlet, the flatterer of Andersen Insulting A/S.\n\n\n Act I: Hamlet's insults and flattery.\n\n Scene I: The insulting of Romeo.\n\n[Enter Hamlet and Romeo]\n\nHamlet:\n You lying stupid fatherless big smelly half-witted coward!\n You are as stupid as the difference between a handsome rich brave\n hero and thyself! Speak your mind!\n\n You are as brave as the sum of your fat little stuffed misused dusty\n old rotten codpiece and a beautiful fair warm peaceful sunny summer's\n day. You are as healthy as the difference between the sum of the\n sweetest reddest rose and my father and yourself! Speak your mind!\n\n You are as cowardly as the sum of yourself and the difference\n between a big mighty proud kingdom and a horse. Speak your mind.\n\n Speak your mind!\n\n[Exit Romeo]\n\n Scene II: The praising of Juliet.\n\n[Enter Juliet]\n\nHamlet:\n Thou art as sweet as the sum of the sum of Romeo and his horse and his\n black cat! Speak thy mind!\n\n[Exit Juliet]\n\n Scene III: The praising of Ophelia.\n\n[Enter Ophelia]\n\nHamlet:\n Thou art as lovely as the product of a large rural town and my amazing\n bottomless embroidered purse. Speak thy mind!\n\n Thou art as loving as the product of the bluest clearest sweetest sky\n and the sum of a squirrel and a white horse. Thou art as beautiful as\n the difference between Juliet and thyself. Speak thy mind!\n\n[Exeunt Ophelia and Hamlet]\n\n\n Act II: Behind Hamlet's back.\n\n Scene I: Romeo and Juliet's conversation.\n\n[Enter Romeo and Juliet]\n\nRomeo:\n Speak your mind. You are as worried as the sum of yourself and the\n difference between my small smooth hamster and my nose. Speak your\n mind!\n\nJuliet:\n Speak YOUR mind! You are as bad as Hamlet! You are as small as the\n difference between the square of the difference between my little pony\n and your big hairy hound and the cube of your sorry little\n codpiece. Speak your mind!\n\n[Exit Romeo]\n\n Scene II: Juliet and Ophelia's conversation.\n\n[Enter Ophelia]\n\nJuliet:\n Thou art as good as the quotient between Romeo and the sum of a small\n furry animal and a leech. Speak your mind!\n\nOphelia:\n Thou art as disgusting as the quotient between Romeo and twice the\n difference between a mistletoe and an oozing infected blister! Speak\n your mind!\n\n[Exeunt]\n" ], "quineRelay": "Shakespeare", "rijuRepl": { "example": [ "The Infamous Hello World Program.\n\nRomeo, a young man with a remarkable patience.\nJuliet, a likewise young woman of remarkable grace.\nOphelia, a remarkable woman much in dispute with Hamlet.\nHamlet, the flatterer of Andersen Insulting A/S.\n\n\n Act I: Hamlet's insults and flattery.\n\n Scene I: The insulting of Romeo.\n\n[Enter Hamlet and Romeo]\n\nHamlet:\n You lying stupid fatherless big smelly half-witted coward!\n You are as stupid as the difference between a handsome rich brave\n hero and thyself! Speak your mind!\n\n You are as brave as the sum of your fat little stuffed misused dusty\n old rotten codpiece and a beautiful fair warm peaceful sunny summer's\n day. You are as healthy as the difference between the sum of the\n sweetest reddest rose and my father and yourself! Speak your mind!\n\n You are as cowardly as the sum of yourself and the difference\n between a big mighty proud kingdom and a horse. Speak your mind.\n\n Speak your mind!\n\n[Exit Romeo]\n\n Scene II: The praising of Juliet.\n\n[Enter Juliet]\n\nHamlet:\n Thou art as sweet as the sum of the sum of Romeo and his horse and his\n black cat! Speak thy mind!\n\n[Exit Juliet]\n\n Scene III: The praising of Ophelia.\n\n[Enter Ophelia]\n\nHamlet:\n Thou art as lovely as the product of a large rural town and my amazing\n bottomless embroidered purse. Speak thy mind!\n\n Thou art as loving as the product of the bluest clearest sweetest sky\n and the sum of a squirrel and a white horse. Thou art as beautiful as\n the difference between Juliet and thyself. Speak thy mind!\n\n[Exeunt Ophelia and Hamlet]\n\n\n Act II: Behind Hamlet's back.\n\n Scene I: Romeo and Juliet's conversation.\n\n[Enter Romeo and Juliet]\n\nRomeo:\n Speak your mind. You are as worried as the sum of yourself and the\n difference between my small smooth hamster and my nose. Speak your\n mind!\n\nJuliet:\n Speak YOUR mind! You are as bad as Hamlet! You are as small as the\n difference between the square of the difference between my little pony\n and your big hairy hound and the cube of your sorry little\n codpiece. Speak your mind!\n\n[Exit Romeo]\n\n Scene II: Juliet and Ophelia's conversation.\n\n[Enter Ophelia]\n\nJuliet:\n Thou art as good as the quotient between Romeo and the sum of a small\n furry animal and a leech. Speak your mind!\n\nOphelia:\n Thou art as disgusting as the quotient between Romeo and twice the\n difference between a mistletoe and an oozing infected blister! Speak\n your mind!\n\n[Exeunt]\n" ], "id": "https://riju.codes/shakespeare" }, "fileType": "text", "wordRank": 7050, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1999|For Dummies|Shakespeare For Dummies|Doyle, John and Lischner, Ray|9780764551352" }, "shakti": { "title": "shakti", "appeared": 2019, "type": "pl", "description": "the latest iteration of k, Shakti k. The language is capable of managing streaming, in-memory, historical, relational, and time-series data. The distributed model extends out to multiple machines whether on-premise or in the cloud. Shakti k provides connectivity via Python, HTTP, SSL/TLS, and json. Shakti k supports compression and encryption for data, whether in-memory, in-flight or on disk. Shakti k also has primitives for blockchain operations.", "website": "https://shakti.com", "domainName": { "registered": 2002, "awisRank": { "2022": 7145969 }, "name": "shakti.com" }, "example": [ "b + 1 2 3" ], "twitter": "https://twitter.com/shaktidb" }, "sham": { "title": "sham", "appeared": 2016, "type": "grammarLanguage", "reference": [ "https://arxiv.org/abs/2005.09028" ], "githubRepo": { "firstCommit": 2016, "stars": 62, "forks": 6, "subscribers": 10, "created": 2016, "updated": 2022, "description": "A DSL for runtime code generation in racket", "issues": 2, "url": "https://github.com/rjnw/sham" }, "repoStats": { "firstCommit": 2016, "commits": 462, "committers": 7, "files": 209 } }, "shapefile": { "title": "Shapefile", "appeared": 1995, "type": "binaryDataFormat", "fileExtensions": [ "shp", "shx", "dbf" ], "originCommunity": [ "Esri" ], "wikipedia": { "related": [ "dbase", "autocad-app", "xbase", "unicode" ], "summary": "The shapefile format is a popular geospatial vector data format for geographic information system (GIS) software. It is developed and regulated by Esri as a (mostly) open specification for data interoperability among Esri and other GIS software products. The shapefile format can spatially describe vector features: points, lines, and polygons, representing, for example, water wells, rivers, and lakes. Each item usually has attributes that describe it, such as name or temperature.", "pageId": 2770513, "dailyPageViews": 487, "created": 2005, "backlinksCount": 385, "revisionCount": 416, "appeared": 1990, "url": "https://en.wikipedia.org/wiki/Shapefile" }, "fileType": "binary", "centralPackageRepositoryCount": 0 }, "shapeup": { "title": "ShapeUp", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/43b485d56606e188e24563d8ae2fe520ad555bf4" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6350", "centralPackageRepositoryCount": 0 }, "shared-prolog": { "title": "Shared Prolog", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0e2bd2386d4b9a2ec012c40359884c83793acfe5" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6621", "centralPackageRepositoryCount": 0 }, "sharpscript": { "title": "sharpscript", "appeared": 2019, "type": "pl", "website": "https://sharpscript.net", "domainName": { "registered": 2019, "awisRank": { "2022": 4325549 }, "name": "sharpscript.net" } }, "sheep-lang": { "title": "Sheep", "appeared": 2000, "type": "pl", "creators": [ "Wouter Van Oortmerssen" ], "description": "New scripting/querying/ipc/programming language I created for Amiga Inc. There is no publicly available material right now, except for an introductory article at Amiga World, an interview at OSNews.com, and this released screenshot of an early sheep beta in action: SHEEP was planned to have familiar beginner friendly syntax and semantics coupled with multimethods, automatic memory management without garbage collection (linearity), powerful datatypes, pattern matching, strong and dynamic typing living together in harmony, integrated access to all the new Amiga OS features, and optional compiled output comparable to C in speed and size.", "website": "http://strlen.com/sheep-language/", "reference": [ "https://www.osnews.com/story/169/interview-wouter-van-oortmerssen-on-sheep/" ], "hasSemanticIndentation": { "example": "define pythtree ax:real ay:real bx:real by:real depth:int do\n cx = ax-ay+by\n end", "value": true }, "example": [ "— Tree of Pythagoras\n\n— based on an old E example by Raymond Hoving\n\n\nimport “ave”\n\n\ndefine pythtree ax:real ay:real bx:real by:real depth:int do\n\n cx = ax-ay+by\n\n cy = ax+ay-bx\n\n dx = bx+by-ay\n\n dy = ax-bx+by\n\n ex = 0.5*(cx-cy+dx+dy)\n\n ey = 0.5*(cx+cy-dx+dy)\n\n c = -1-depth*$100020\n\n ave_line cx cy ax ay c\n\n ave_line ax ay bx by c\n\n ave_line bx by dx dy c\n\n ave_line dx dy cx cy c\n\n ave_line cx cy ex ey c\n\n ave_line ex ey dx dy c\n\n if depth < 12 then\n pythtree cx cy ex ey depth+1\n pythtree ex ey dx dy depth+1\n end\nend\n\nwidth = 640\nheight = 480\n\nave_openwindow \"Pythagoras Tree\" width height 0\n\npythtree width/2-width/12 height-20 width/2+width/12 height-20 0\n\nave_update\nrepeat\nuntil ave_getmessage = 'Q'" ], "isbndb": "year|publisher|title|authors|isbn13\n1985|Butterworth-Heinemann|Genetics of Reproduction in Sheep|Land, R. B.|9780407003026" }, "sheep": { "title": "SHEEP", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bdecae8d0cd3598d5b0990312026e9a2f37c89a6" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1748", "wordRank": 6717, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1985|Butterworth-Heinemann|Genetics of Reproduction in Sheep|Land, R. B.|9780407003026" }, "sheerpower-4gl": { "title": "SheerPower 4GL", "appeared": 2006, "type": "pl", "reference": [ "http://forums.devarticles.com/programming-tools-11/sheerpower-4gl-is-the-next-generation-programming-language-for-windows-10331.html" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8643", "centralPackageRepositoryCount": 0 }, "sheerpower4gl": { "title": "SheerPower4GL", "appeared": 2000, "type": "pl", "wikipedia": { "related": [ "mysql" ], "summary": "SheerPower 4GL is a Fourth-generation programming language developed by Touch Technologies, Inc [1]. SheerPower 4GL is the result of porting Touch Technologies' Intouch 4GL programming language that runs on OpenVMS (for DEC Alpha and VAX computers) to Windows, launching in 2000. Downloads are free from the official SheerPower 4GL website.[2] SheerPower 4GL is similar to the BASIC programming language, and is easy to learn.", "created": 2006, "backlinksCount": 3, "pageId": 4463430, "revisionCount": 25, "dailyPageViews": 3, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/SheerPower4GL" }, "centralPackageRepositoryCount": 0 }, "shen": { "title": "Shen", "appeared": 2011, "type": "pl", "creators": [ "Mark Tarver" ], "website": "http://shenlanguage.org/", "emailList": [ "https://groups.google.com/g/qilang" ], "domainName": { "registered": 2011, "awisRank": { "2017": 5269738 }, "name": "shenlanguage.org" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "printToken": [ [ "pr" ] ], "stringToken": [ [ "\"" ] ], "githubLanguage": { "fileExtensions": [ "shen" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.shen", "repos": 50, "id": "Shen" }, "githubBigQuery": { "repos": 16, "users": 14, "id": "Shen" }, "pygmentsHighlighter": { "filename": "lisp.py", "fileExtensions": [ "shen" ], "id": "Shen" }, "linguistGrammarRepo": { "firstCommit": 2017, "lastCommit": 2018, "committerCount": 1, "commitCount": 67, "sampleCount": 3, "example": [ "(load \"grammar.shen\")\n\n\\*\n\nJSON Lexer\n\n1. Read a stream of characters\n2. Whitespace characters not in strings should be discarded.\n3. Whitespace characters in strings should be preserved\n4. Strings can contain escaped double quotes. e.g. \"\\\"\"\n\n*\\\n\n(define whitespacep\n \\* e.g. ASCII 32 == #\\Space. *\\\n \\* All the others are whitespace characters from an ASCII table. *\\\n Char -> (member Char [\"c#9;\" \"c#10;\" \"c#11;\" \"c#12;\" \"c#13;\" \"c#32;\"]))\n\n(define replace-whitespace\n \"\" -> \"\"\n (@s Whitespace Suffix) -> (@s \"\" (replace-whitespace Suffix)) where (whitespacep Whitespace)\n (@s Prefix Suffix) -> (@s Prefix (replace-whitespace Suffix)))\n\n(define fetch-until-unescaped-doublequote\n [] -> []\n [\"\\\" \"c#34;\" | Chars] -> [\"\\\" \"c#34;\" | (fetch-until-unescaped-doublequote Chars)]\n [\"c#34;\" | Chars] -> []\n [Char | Chars] -> [Char | (fetch-until-unescaped-doublequote Chars)])\n\n\\* (define strip-whitespace-chars *\\\n\\* [] -> [] *\\\n\\* [\"c#34;\" | Chars] -> [\"c#34;\" | ( *\\\n\\* [WhitespaceChar | Chars] -> (strip-whitespace-chars Chars) where (whitespace? WhitespaceChar) *\\\n\\* [Char | Chars] -> [Char | (strip-whitespace-chars Chars)]) *\\\n\n(define tokenise\n JSONString ->\n (let CharList (explode JSONString)\n CharList))" ], "url": "https://github.com/rkoeninger/sublime-shen" }, "helloWorldCollection": [ "\\\\ Hello world in Shen\n\n(0-) (pr \"hello world\")" ], "leachim6": { "filepath": "s/Shen.shen", "fileExtensions": [ "shen" ], "example": [ "(pr \"Hello World\")\n" ], "id": "Shen" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Shen", "fileType": "text", "centralPackageRepositoryCount": 0 }, "shex": { "title": "ShEx", "appeared": 2012, "type": "grammarLanguage", "example": [ "PREFIX : \nPREFIX schema: \n\n:Person {\n schema:name xsd:string ;\n schema:knows @:Person * ;\n}" ], "wikipedia": { "summary": "Shape Expressions (ShEx) is a language for validating and describing RDF. It was proposed at the 2012 RDF Validation Workshop as a high-level, concise language for RDF validation. The shapes can be defined in a human-friendly compact syntax called ShExC or using any Resource Description Framework (RDF) serialization formats like JSON-LD or Turtle. ShEx expressions can be used both to describe RDF and to automatically check the conformance of RDF data. The syntax of ShEx is similar to Turtle and SPARQL while the semantics is inspired by regular expression languages like RelaxNG.", "backlinksCount": 16, "pageId": 53655818, "dailyPageViews": 5, "appeared": 2013, "url": "https://en.wikipedia.org/wiki/ShEx" } }, "shift": { "title": "SHIFT", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4fcf5445af012a958f3cfca6bb6fee0660039996" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4015", "wordRank": 3711, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1997|The SHIFT Programming Language and Run-time System for Dynamic Networks of Hybrid Automata|10.1007/978-3-642-59615-5_17|101|4|A. Deshpande and A. Gollu and L. Semenzato|a27433a62b9ac6933b2db74bd41b90bef93f489f\n1996|Java and the Shift to Net-Centric Computing|10.1109/2.532043|99|7|M. Hamilton|7d78cac92f90cdcef26c0ec967cf922c52f19e63\n1998|The SHIFT programming language for dynamic networks of hybrid automata|10.1109/9.664163|69|0|A. Deshpande and Aleks Göllü and L. Semenzato|3c59c30180d3a3cef378e1d53985d0a1515c3523\n2007|Developers shift to dynamic programming languages|10.1109/MC.2007.53|67|3|L. Paulson|dba78117e6cca56292fdb7e9b4940f5c60eec6a4\n2003|The impact of international television : a paradigm shift|10.4324/9781410607041|49|2|M. Elasmar|cb847e523facd31fd3708a56eee5b1228f78c7ae\n1995|The appropriateness of predicate invention as bias shift operation in ILP|10.1007/BF00993476|21|2|I. Stahl|de43c8abdd20ea21928c79fbadb53234d0cf2b05\n2008|Concurrent software engineering: preparing for paradigm shift|10.1145/1370256.1370270|18|1|P. Grogono and B. Shearing|ba3da66276756e7140b1c126d1cf8a8447238d97\n2011|Simulation of Water-Gas Shift Membrane Reactor for Integrated Gasification Combined Cycle Plant with CO2 Capture|10.5545/SV-JME.2011.100|14|0|Andrej Lotrič and M. Sekavčnik and C. Kunze and H. Spliethoff|82a036ef8a554a1a0cce040ab2f93ce5e2dbecdd\n2010|What sequential games, the tychonoff theorem and the double-negation shift have in common|10.1145/1863597.1863605|13|1|M. Escardó and Paulo Oliva|82d747ebe43e04396460d98afc320717550528d7\n1997|The use of SHIFT in system design|10.1109/CDC.1997.650718|5|0|A. Deshpande and P. Varaiya|6a29b685a2b11d95f64bb459bf25b7b110e5b39e\n1997|Object-oriented design of automated highway simulations using the SHIFT programming language|10.1109/ITSC.1997.660465|4|0|A. Gollu and M. Kourjanski|b82acf5f71d26abcbf44c1ad7ab8f8f99eb6c9d8" }, "shill": { "title": "shill", "appeared": 2014, "type": "pl", "website": "http://shill-lang.org", "domainName": { "registered": 2014, "name": "shill-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n8365300|Shill: A Secure Shell Scripting Language|http://shill-lang.org|2014-09-25 02:44:26 UTC|1411613066|thinkmoore|43|85", "isbndb": "" }, "shiv": { "title": "shiv", "appeared": 2018, "type": "pl", "description": "The Shiv programming language is a language designed around extending the langauge itself. Its main features include: Simple, light-weight yet expressive syntax; Powerful metaprogramming capabilities.", "gitlabRepo": "https://gitlab.com/count.j0ecool/shiv" }, "shml": { "title": "shml", "appeared": 2015, "type": "textMarkup", "website": "https://maxcdn.github.io/shml/", "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n10517290|Show HN: SHML (shell markup language)|2015-11-06 01:14:58 UTC|1446772498|jdorfman|12|71" }, "shoe": { "title": "SHOE", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ad51c68b765b1e4bdd57166dd5f934103a920389" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5609", "wordRank": 4274, "centralPackageRepositoryCount": 0, "isbndb": "" }, "short-code-computer-language": { "title": "Short Code computer language", "appeared": 1949, "type": "pl", "wikipedia": { "example": [ "X3 = ( X1 + Y1 ) / X1 * Y1 substitute variables\nX3 03 09 X1 07 Y1 02 04 X1 Y1 substitute operators and parentheses. \n Note multiplication is represented\n by juxtaposition.\n07Y10204X1Y1 group into 12-byte words.\n0000X30309X1" ], "summary": "Short Code was one of the first higher-level languages ever developed for an electronic computer. Unlike machine code, Short Code statements represented mathematic expressions rather than a machine instruction. Also known as an automatic programming, the source code was not compiled but executed through an interpreter to simplify the programming process; the execution time was much slower though.", "created": 2006, "backlinksCount": 20, "pageId": 5276950, "revisionCount": 83, "dailyPageViews": 31, "appeared": 1950, "url": "https://en.wikipedia.org/wiki/Short_Code_(computer_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2707", "centralPackageRepositoryCount": 0 }, "shrdlu": { "title": "SHRDLU", "appeared": 1968, "type": "application", "creators": [ "Terry Winograd" ], "wikipedia": { "backlinksCount": 73, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/SHRDLU" }, "hopl": "https://hopl.info/showlanguage.prx?exp=4580" }, "si-library": { "title": "SI Library", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3a9921fe4a806184e2d69c2e17064b89a1eefce0" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3696", "centralPackageRepositoryCount": 0 }, "si": { "title": "SI", "appeared": 1960, "type": "notation", "standsFor": "Système international", "wikipedia": { "related": [ "isq", "symbol", "unicode" ], "summary": "The International System of Units (abbreviated as SI, from the French Système international (d'unités)) is the modern form of the metric system, and is the most widely used system of measurement. It comprises a coherent system of units of measurement built on seven base units and a set of twenty prefixes to the unit names and unit symbols that may be used when specifying multiples and fractions of the units. The system also specifies lowercase names for 22 derived units. The system was published in 1960 as a result of an initiative that began in 1948. It is based on the metre–kilogram–second system of units (MKS) rather than any variant of the centimetre–gram–second system of units (CGS). SI is intended to be an evolving system, so prefixes and units are created and unit definitions are modified through international agreement as the technology of measurement progresses and the precision of measurements improves. The 24th and 25th General Conferences on Weights and Measures (CGPM) in 2011 and 2014, for example, discussed a proposal to change the definition of the kilogram, linking it to an invariant of nature rather than to the mass of a material artefact, thereby ensuring long-term stability. The motivation for the development of the SI was the diversity of units that had sprung up within the CGS systems and the lack of coordination between the various disciplines that used them. The CGPM, which was established by the Metre Convention of 1875, brought together many international organisations to not only agree on the definitions and standards of the new system but also agree on the rules for writing and presenting measurements in a standardised manner around the world. The International System of Units has been adopted by all developed countries except the United States.", "pageId": 26764, "dailyPageViews": 2882, "created": 2001, "backlinksCount": 3469, "revisionCount": 4748, "appeared": 1948, "url": "https://en.wikipedia.org/wiki/International_System_of_Units" }, "fileType": "text", "wordRank": 3835, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Experimental Study and Prediction of Performance and Emission in an SI Engine Using Alternative Fuel with Artificial Neural Network|10.18245/IJAET.438048|13|0|M. K. Balki and Volkan Çavuş and İ. U. Duran and Resul Tuna and C. Sayın|cfdf914e2c013f4ccb73634f89e76c222c5257b3\n2020|Si una imagen vale más que mil palabras: ¿cuánto puede decir un gráfico de cajas?|10.5281/ZENODO.4792263|1|0|D. D. Ávila and V. M. Ramírez-Arrieta|568d90449953ad07956258dfa0095d1f31794332" }, "sibelius-software": { "title": "Sibelius", "appeared": 1998, "type": "pl", "wikipedia": { "related": [ "assembly-language", "musicxml", "qt", "powerpc" ], "summary": "Sibelius is a scorewriter program developed and released by Sibelius Software Limited (now part of Avid Technology). It is the world's largest selling music notation program. Beyond creating, editing and printing music scores, Sibelius can also play the music back using sampled or synthesised sounds. It produces printed scores, and can also publish them via the Internet for others to access. Less advanced versions of Sibelius at lower prices have been released, as have various add-ons for the software. Named after the Finnish composer Jean Sibelius, the company was founded in April 1993 by twin brothers Ben and Jonathan Finn to market the eponymous music notation program they had created. It went on to develop and distribute various other music software products, particularly for education. In addition to its head office in Cambridge and subsequently London, Sibelius Software opened offices in the US, Australia and Japan, with distributors and dealers in many other countries worldwide. The company won numerous awards, including the Queen's Award for Innovation in 2005. In August 2006 the company was acquired by Avid, to become part of its Digidesign division, which also manufactures the leading digital audio workstation Pro Tools. In July 2012, Avid announced plans to divest its consumer businesses, closed the Sibelius London office, and removed the original development team, despite extensive protests on Facebook and elsewhere. Avid subsequently recruited some new programmers to continue development of Sibelius.", "created": 2018, "backlinksCount": 34, "pageId": 190901, "revisionCount": 1, "dailyPageViews": 35, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/Sibelius_(software)" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "sibilant": { "title": "Sibilant", "appeared": 2010, "type": "pl", "creators": [ "Jacob Rothstein" ], "website": "https://sibilant.org/", "fileExtensions": [ "sibilant" ], "country": [ "United States" ], "keywords": [ "assign", "def", "do", "each", "if", "lambda", "pipe", "set", "this", "var", "when" ], "githubRepo": { "stars": 383, "forks": 51, "subscribers": 19, "created": 2010, "updated": 2020, "description": "Just another compile-to-js LISP-like language", "url": "https://github.com/jbr/sibilant" }, "repoStats": { "firstCommit": 2010, "commits": 641, "committers": 15, "files": 90 } }, "sidopsp": { "title": "SIDOPS+", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/82f44d2e0c182e726ec69edb76fda10c65088b04" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6491", "centralPackageRepositoryCount": 0 }, "sierra": { "title": "sierra", "appeared": 2018, "type": "pl", "website": "https://sierra-lang.github.io", "domainName": { "name": "sierra-lang.github.io" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n18340730|Sierra – A SIMD Extension for C++|https://sierra-lang.github.io/|2018-10-30 19:56:37 UTC|1540929397|jeffreyrogers|4|35" }, "sieve": { "title": "Sieve mail filtering language", "appeared": 2008, "type": "application", "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "wikipedia": { "example": [ "# Sieve filter\n\n# Declare the extensions used by this script.\n#\nrequire [\"fileinto\", \"reject\"];\n\n# Messages bigger than 100K will be rejected with an error message\n#\nif size :over 100K {\n reject \"I'm sorry, I do not accept mail over 100kb in size. \nPlease upload larger files to a server and send me a link.\nThanks.\";\n}\n\n# Mails from a mailing list will be put into the folder \"mailinglist\" \n#\nelsif address :is [\"From\", \"To\"] \"mailinglist@blafasel.invalid\" {\n fileinto \"INBOX.mailinglist\";\n}\n\n# Spam Rule: Message does not contain my address in To, CC or Bcc\n# header, or subject is something with \"money\" or \"Viagra\".\n#\nelsif anyof (not address :all :contains [\"To\", \"Cc\", \"Bcc\"] \"me@blafasel.invalid\", \nheader :matches \"Subject\" [\"*money*\",\"*Viagra*\"]) {\n fileinto \"INBOX.spam\";\n}\n\n# Keep the rest.\n# This is not necessary because there is a \"implicit keep\" Rule\n#\nelse {\n keep;\n}" ], "related": [ "sed", "awk", "unicode", "smtp" ], "summary": "Sieve is a programming language that can be used for email filtering. It owes its creation to the CMU Cyrus Project, creators of Cyrus IMAP server. The language is not tied to any particular operating system or mail architecture. It requires the use of RFC 2822-compliant messages, but otherwise should generalize to other systems that meet these criteria. The current version of Sieve's base specification is outlined in RFC 5228, published in January 2008.", "pageId": 2684593, "dailyPageViews": 78, "created": 2005, "backlinksCount": 24, "revisionCount": 78, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Sieve_(mail_filtering_language)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "sieve" ], "aceMode": "text", "codemirrorMode": "sieve", "codemirrorMimeType": "application/sieve", "tmScope": "source.sieve", "repos": 10, "id": "Sieve" }, "githubBigQuery": { "repos": 9, "users": 9, "id": "Sieve" }, "codeMirror": "sieve", "pygmentsHighlighter": { "filename": "sieve.py", "fileExtensions": [ "siv", "sieve" ], "id": "Sieve" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "sigma-76": { "title": "SIGMA 76", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/86a91e01da17e7ac09865c907441e10bf471feae" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7103", "centralPackageRepositoryCount": 0 }, "signal": { "title": "SIGNAL", "appeared": 1982, "type": "pl", "country": [ "France" ], "wikipedia": { "related": [ "esterel", "lustre", "simulink", "isbn" ], "summary": "SIGNAL is a programming language based on synchronized data-flow (flows + synchronization): a process is a set of equations on elementary flows describing both data and control. The SIGNAL formal model provides the capability to describe systems with several clocks (polychronous systems) as relational specifications. Relations are useful as partial specifications and as specifications of non-deterministic devices (for instance a non-deterministic bus) or external processes (for instance an unsafe car driver). Using SIGNAL allows one to specify an application, to design an architecture, to refine detailed components down to RTOS or hardware description. The SIGNAL model supports a design methodology which goes from specification to implementation, from abstraction to concretization, from synchrony to asynchrony. SIGNAL has been mainly developed in INRIAEspresso team since the 1980s, at the same time as similar programming languages, Esterel and Lustre.", "pageId": 32475185, "dailyPageViews": 13, "created": 2011, "backlinksCount": 13, "revisionCount": 60, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/SIGNAL_(programming_language)" }, "tiobe": { "id": "SIGNAL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1270", "fileType": "text", "wordRank": 2383, "centralPackageRepositoryCount": 0 }, "sil": { "title": "SIL", "appeared": 1990, "type": "pl", "creators": [ "Niels Houbak" ], "description": "A Simulation Language", "reference": [ "https://semanticscholar.org/paper/77e57334cb2b0799b259d562027eceda852bcb32" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1593", "centralPackageRepositoryCount": 0 }, "sile": { "title": "sile", "appeared": 2012, "type": "textMarkup", "description": "SILE is a typesetting system. Its job is to produce beautiful printed documents from raw content.", "website": "https://sile-typesetter.org", "reference": [ "https://news.ycombinator.com/item?id=22393099" ], "domainName": { "registered": 2014, "awisRank": { "2022": 7558156 }, "name": "sile-typesetter.org" }, "related": [ "latex" ], "githubRepo": { "firstCommit": 2012, "stars": 1217, "forks": 77, "subscribers": 45, "created": 2013, "updated": 2022, "description": "Simon’s Improved Layout Engine", "issues": 324, "url": "https://github.com/sile-typesetter/sile" }, "repoStats": { "firstCommit": 2012, "commits": 5678, "committers": 75, "files": 775 } }, "silk": { "title": "silk", "appeared": 2019, "type": "pl", "website": "https://ajaymt.github.io/silk/", "reference": [ "https://news.ycombinator.com/item?id=22926080" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "printf" ] ], "example": [ "// this is a comment\n\nextern func printf(s *i8) void;\n\nfunc main(argc i32, argv **i8) i32 {\n printf(\"hello, world\\n\");\n\n if argc > 1 {\n val arg = @(argv + 1);\n printf(arg);\n }\n\n return 0;\n}" ], "githubRepo": { "firstCommit": 2019, "stars": 68, "forks": 1, "subscribers": 4, "created": 2019, "updated": 2022, "description": "The Silk Programming Language", "issues": 1, "url": "https://github.com/AjayMT/silk" }, "repoStats": { "firstCommit": 2019, "commits": 90, "committers": 1, "files": 30 }, "isbndb": "" }, "sill": { "title": "sill", "appeared": 2015, "type": "pl", "creators": [ "Dennis Griffith" ], "description": "A programming language based on the intuitionistic linear logic view of session types.", "reference": [ "http://groups.inf.ed.ac.uk/abcd/session-implementations.html" ], "githubRepo": { "firstCommit": 2015, "stars": 26, "forks": 3, "subscribers": 7, "created": 2015, "updated": 2020, "issues": 1, "url": "https://github.com/ISANobody/sill" }, "repoStats": { "firstCommit": 2015, "commits": 86, "committers": 2, "files": 127 }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "siman-iv": { "title": "SIMAN IV", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/00862625916f9e7662e656dfbf080a440842acd8" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4714", "centralPackageRepositoryCount": 0 }, "siman": { "title": "SIMAN", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3bdfdd481108dc2b8810633f245e8efc8be414a3" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1056", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1987|Critique of SIMAN as a programming language (abstract only)|10.1145/322917.323046|3|0|D. Thuente|3bdfdd481108dc2b8810633f245e8efc8be414a3" }, "simcal": { "title": "SIMCAL", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b30700935ad38c0fdccd03deee80bb0d58863877" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5748", "centralPackageRepositoryCount": 0 }, "simcode": { "title": "SimCode", "appeared": 1997, "type": "pl", "description": "SimCode is a C like description language. You use it to define the characteristics and behavior of the device you are modeling. It includes functions to define parameters such as propagation delays, load characteristics, strengths, and so on. The device behavior is defined using truth tables, math functions and conditional control statements, such as IF..THEN statements. Digital SimCode is a proprietary language - devices created with it are not compatible with other simulators, nor are digital components created for other simulators compatible with Altium Designer's Mixed-Signal Circuit Simulator.", "reference": [ "https://en.wikipedia.org/wiki/CircuitMaker" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "//============================================================\n//Section 1\n# ls74 source\n//1/2- 74LS74 D flip-flop Digital SimCode Model\n//typical prop delay values from TI 1981 2nd edition data book\n//============================================================\n//Section 2\nINPUTS VCC, GND, PRE, DATA, CLK, CLR;\nOUTPUTS VCC_LD, PRE_LD, DATA_LD, CLK_LD, CLR_LD, QN, Q;\nINTEGERS tblIndex;\nREALS tplh_val, tphl_val, ts_val, th_val, trec_val, tt_val, temp_tp,\n      clk_twl, clk_twh, pre_clr_twl, ril_val, rih_val, ricc_val;\nPWR_GND_PINS(VCC,GND);     //set pwr_param and gnd_param values\nSUPPLY_MIN_MAX(4.75,5.25); //test for min supply=4.75 and max supply=5.25\nVOL_VOH_MIN(0.2,-0.4,0.1); //vol_param=gnd_param+0.2,voh_param=pwr_param-0.4\nVIL_VIH_VALUE(1.25,1.35);  //set input threshold values: vil and vih\nIO_PAIRS(PRE:PRE_LD, DATA:DATA_LD, CLK:CLK_LD, CLR:CLR_LD);\n//Section 3\nIF (init_sim) THEN\n BEGIN        //select prop delay, setup, hold, and width times\n  //NOTE: both ttlh and tthl are the same value\n  tt_val= (MIN_TYP_MAX(tt_param: NULL, 5n,  NULL));\n  temp_tp= (PWL_TABLE(sim_temp: -75, -5n, 125, 5n)); //tp temperature affect\n  tplh_val= (MIN_TYP_MAX(tp_param: NULL, 14n, 25n) + temp_tp);\n  tphl_val= (MIN_TYP_MAX(tp_param: NULL, 20n, 40n) + temp_tp);\n  ts_val= (20n);\n  th_val= (5n);\n  trec_val= (5n);\n  clk_twl= (25n);      //not specified - derived from fmax\n  clk_twh= (25n);\n  pre_clr_twl= (20n);\n  //LS stdout drive IOL max=8mA @ VOL typ=0.35V:rol_param=0.35V/8mA=43.75\n  //LS stdout drive IOL max=8mA @ VOL max=0.5V: rol_param=0.5V/8mA=62.5\n  rol_param= (MIN_TYP_MAX(drv_param: 62.5, 43.75,  NULL));\n  //LS stdout drive IOS min=20mA @ VCC max=5.25V: roh_param=5.25V/20mA=262.5\n  //LS stdout drive IOS max=100mA @ VCC max=5.25V:roh_param=5.25V/100mA=52.5\n  roh_param= (MIN_TYP_MAX(drv_param: 262.5, NULL, 52.5));\n  //LS input load IIH max=20uA @ Vin=2.7V: ril= (2.7-vol_param)/20uA=125k\n  ril_val= (MIN_TYP_MAX(ld_param: NULL, NULL, 125k));\n  //LS input load IIL max=-0.4mA @ Vin=0.4V:rih= (voh_param-0.4)/0.4mA=10.5k\n  rih_val= (MIN_TYP_MAX(ld_param: NULL, NULL, 10.5k));\n  //Icc @ 5V: 2500= 4mA/2 typical, 1250= 8mA/2 max\n  ricc_val= (MIN_TYP_MAX(i_param: NULL, 2500, 1250));\n  STATE Q = ONE;            // initialize output states\n  STATE QN = ZERO;\n  EXIT;\n END;\n//Section 4\nDRIVE Q QN = (v0=vol_param,v1=voh_param,ttlh=tt_val,tthl=tt_val);\nLOAD PRE_LD DATA_LD CLK_LD CLR_LD =\n(v0=vol_param,r0=ril_val,v1=voh_param,r1=rih_val,io=1e9,t=1p);\n//Section 5\nEXT_TABLE tblIndex\nPRE CLR CLK DATA    Q     QN\n0   1   X   X       H     L\n1   0   X   X       L     H\n0   0   X   X       H     H\n1   1   ^   X       DATA  ~DATA\n1   1   X   X       Q     ~Q;\nLOAD VCC_LD = (v0=gnd_param,r0=ricc_val,t=1p);\n//Section 6\nIF (warn_param) THEN\n  BEGIN\n    IF (PRE && CLR) THEN\n      BEGIN\n        SETUP_HOLD(CLK=LH DATA Ts=ts_val Th=th_val \"CLK->DATA\");\n        RECOVER(CLK=LH PRE CLR Trec=trec_val \"CLK->PRE or CLR\");\n        WIDTH(CLK Twl=clk_twl Twh=clk_twh \"CLK\");\n        WIDTH(PRE CLR Twl= pre_clr_twl \"PRE or CLR\");\n      END;\n  END;\n//Section 7\nDELAY Q QN =\n  CASE (TRAN_LH) : tplh_val\n  CASE (TRAN_HL) : tphl_val\nEND;\nEXIT;" ], "wikipedia": { "related": [ "csharp", "arduino", "eagle", "kicad", "subversion", "gerber-image" ], "summary": "CircuitMaker is electronic design automation software for printed circuit board designs targeted at the hobby, hacker, and maker community. CircuitMaker is available as freeware, and the hardware designed with it may be used for commercial and non-commercial purposes without limitations. It is currently available publicly as version 1.3 by Altium Limited, with the first non-beta release on January 17, 2016.", "backlinksCount": 42, "pageId": 48639018, "created": 2018, "revisionCount": 1, "dailyPageViews": 1, "appeared": 2016, "url": "https://en.wikipedia.org/wiki/SimCode" }, "isOpenSource": false, "centralPackageRepositoryCount": 0 }, "simdis": { "title": "SIMDIS", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/59978bfd8d4589728fbf33f04df0087e21012cbe" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6578", "centralPackageRepositoryCount": 0 }, "simfactory": { "title": "SIMFACTORY", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3b1e2b55a9f7880f29a910e7dcce27df8fba3ecb" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4740", "centralPackageRepositoryCount": 0 }, "simit": { "title": "simit", "appeared": 2016, "type": "pl", "website": "http://simit-lang.org", "domainName": { "registered": 2016, "name": "simit-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n12201066|Simit: A language for computing on sparse systems|http://simit-lang.org/index.html|2016-08-01 09:20:09 UTC|1470043209|panic|3|37" }, "simkin-programming-language": { "title": "Simkin", "appeared": 1995, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Simkin_%28programming_language%29" }, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "siml-i": { "title": "SIML/I", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7049c6dcdd8c23835dbc59dc57001864f46ce12c" ], "hopl": "https://hopl.info/showlanguage.prx?exp=870", "centralPackageRepositoryCount": 0 }, "simnet": { "title": "SIMNET", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a64f348cba3877c5a15e3ca894b02a2e27d8ef7d" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4739", "centralPackageRepositoryCount": 0 }, "simodula": { "title": "SIMODULA", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ebd700e97d4878944143e00bae7214cad1a3a7f7" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8230", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "simons-basic": { "title": "Simons' BASIC", "appeared": 1983, "type": "pl", "wikipedia": { "related": [ "commodore-basic" ], "summary": "This product is widely, but incorrectly, called \"Simon's BASIC\", because of confusion between the first name \"Simon\" and the surname \"Simons\".Simons' BASIC was an extension to BASIC 2.0 for the Commodore 64 home computer. Written by 16-year-old British programmer David Simons in 1983, it was distributed by Commodore in cartridge format.", "created": 2005, "backlinksCount": 20, "pageId": 3415270, "revisionCount": 121, "dailyPageViews": 16, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/Simons%27_BASIC" }, "centralPackageRepositoryCount": 0 }, "simpas": { "title": "SIMPAS", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a329cd47c2e6839e061a3591e97756816aeb3610" ], "hopl": "https://hopl.info/showlanguage.prx?exp=929", "centralPackageRepositoryCount": 0 }, "simpl": { "title": "SIMPL", "appeared": 1990, "type": "pl", "reference": [ "https://www.crestron.com/en-US/Products/Control-Hardware-Software/Software/Control-System-Software/SW-SIMPL-PLUS" ], "wikipedia": { "summary": "Synchronous Interprocess Messaging Project for LINUX (SIMPL) is a free and open-source project that allows QNX-style synchronous message passing by adding a Linux library using user space techniques like shared memory and Unix pipes to implement SendMssg/ReceiveMssg/ReplyMssg inter-process messaging mechanisms.", "backlinksCount": 26, "pageId": 35101726, "dailyPageViews": 18, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/SIMPL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5221", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2008|Lulu.com|Programming the SIMPL Way|Collins, John and Findlay, Robert|9780557012701" }, "simple-binary-encoding": { "title": "Simple Binary Encoding", "appeared": 2013, "type": "pl", "description": "SBE is an OSI layer 6 presentation for encoding and decoding binary application messages for low-latency financial applications. This repository contains the reference implementations in Java, C++, Golang, C#, and Rust", "website": "https://yafetn.github.io/2023/01/12/sbe.html", "documentation": [ "https://github.com/real-logic/simple-binary-encoding/wiki" ], "reference": [ "https://github.com/real-logic/simple-binary-encoding" ], "originCommunity": [ "https://github.com/FIXTradingCommunity/fix-simple-binary-encoding" ], "releaseNotesUrl": "https://github.com/real-logic/simple-binary-encoding/wiki/Change-Log", "related": [ "python", "java", "rust" ], "githubRepo": { "stars": 27780, "forks": 469, "updated": 2023, "description": "Simple Binary Encoding (SBE) - High Performance Message Codec", "issues": 20, "url": "https://github.com/real-logic/simple-binary-encoding" }, "repoStats": { "firstCommit": 2013, "commits": 3506, "committers": 111, "files": 360 }, "officialBlogUrl": [ "https://github.com/real-logic/simple-binary-encoding/wiki/Blogs-and-Announcements" ] }, "simple-stackless-lisp": { "title": "Simple Stackless Lisp", "appeared": 2022, "type": "pl", "description": "I wrote a simple stackless lisp", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/wcom1h/i_wrote_a_simple_stackless_lisp/" ] }, "simple": { "title": "SIMPLE", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0a66cbf7265e60133c03dc31ebc2966a188e37ac" ], "wikipedia": { "summary": "SIMPLE may refer to:", "backlinksCount": 33, "pageId": 42897433, "dailyPageViews": 8, "created": 2014, "appeared": 1995, "url": "https://en.wikipedia.org/wiki/SIMPLE" }, "hopl": "https://hopl.info/showlanguage.prx?exp=118", "wordRank": 933, "centralPackageRepositoryCount": 0 }, "simplescript": { "title": "SimpleScript", "appeared": 2013, "type": "pl", "reference": [ "https://github.com/ajlopez/SimpleScript" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8645", "centralPackageRepositoryCount": 0 }, "simplictiy": { "title": "Simplicity", "appeared": 2017, "type": "pl", "description": "Simplicity is a work-in-progress low-level programming language with greater flexibility and expressiveness than Bitcoin Script. Simplicity is a typed, combinator-based, functional language without loops and recursion, designed to be used for crypto-currencies and blockchain applications.", "writtenIn": [ "php", "c", "tcl", "haskell" ], "githubRepo": { "stars": 231, "forks": 36, "updated": 2022, "description": "Simplicity is a blockchain programming language designed as an alternative to Bitcoin script.", "issues": 12, "url": "https://github.com/ElementsProject/simplicity" }, "repoStats": { "firstCommit": 2017, "commits": 739, "committers": 8, "files": 232 }, "officialBlogUrl": [ "https://blog.blockstream.com/en-simplicity-github/" ] }, "simpp": { "title": "Sim++", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/021cefc297259a7913ff880e96590fe02108411d" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4718", "centralPackageRepositoryCount": 0, "isbndb": "" }, "simscript": { "title": "SIMSCRIPT", "appeared": 1963, "type": "pl", "country": [ "United States" ], "originCommunity": [ "RAND" ], "wikipedia": { "related": [ "fortran", "simula", "quikscript", "gpss" ], "summary": "SIMSCRIPT is a free-form, English-like general-purpose simulation language conceived by Harry Markowitz and Bernard Hausner at the RAND Corporation in 1963. It was implemented as a Fortran preprocessor on the IBM 7090 and was designed for large discrete event simulations. It influenced Simula. Though earlier versions were released into the public domain, SIMSCRIPT was commercialized by Markowitz's company, California Analysis Center, Inc., which produced proprietary versions SIMSCRIPT I.5 and SIMSCRIPT II.5.", "pageId": 1064164, "dailyPageViews": 17, "created": 2004, "backlinksCount": 13, "revisionCount": 46, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/SIMSCRIPT" }, "hopl": "https://hopl.info/showlanguage.prx?exp=190", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Simscript II Programming Language|1969|P. J. Kiviat|17288845|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1983|Caci Products Co|Simscript Ii.5: Programming Language|Ed Russell|9789996806339\n1969|Prentice-hall|The Simscript Ii Programming Language (prentice-hall Series In Automatic Computation)|Philip J Kiviat|9780138101763\n||Simulation Programming Languages: Simula, Mathematica, Simulation Language, Simscript Ii.5, Spice, Eicaslab, Modelica, Goldsim|Books and LLC|9781155277387" }, "simul": { "title": "SIMUL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2fa187c21e65fb07067e13bc5776965fe574d46b" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7100", "centralPackageRepositoryCount": 0 }, "simula-67": { "title": "SIMULA 67", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/15a48af9713fbd02ed8fd5837e979d42e32db58e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=301", "centralPackageRepositoryCount": 0 }, "simula": { "title": "Simula", "appeared": 1965, "type": "pl", "creators": [ "Ole-Johan Dahl" ], "documentation": [ "https://portablesimula.github.io/github.io/doc/SimulaTextBook.pdf" ], "country": [ "Norway" ], "influencedBy": [ "algol-60" ], "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "! A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "!" ] ], "printToken": [ [ "OutText" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "True", "False" ] ], "wikipedia": { "example": [ "Simulation Begin\n Class FittingRoom; Begin\n Ref (Head) door;\n Boolean inUse;\n Procedure request; Begin\n If inUse Then Begin\n Wait (door);\n door.First.Out;\n End;\n inUse:= True;\n End;\n Procedure leave; Begin\n inUse:= False;\n Activate door.First;\n End;\n door:- New Head;\n End;\n \n Procedure report (message); Text message; Begin\n OutFix (Time, 2, 0); OutText (\": \" & message); OutImage;\n End;\n\n Process Class Person (pname); Text pname; Begin\n While True Do Begin\n Hold (Normal (12, 4, u));\n report (pname & \" is requesting the fitting room\");\n fittingroom1.request;\n report (pname & \" has entered the fitting room\");\n Hold (Normal (3, 1, u));\n fittingroom1.leave;\n report (pname & \" has left the fitting room\");\n End;\n End;\n\n Integer u;\n Ref (FittingRoom) fittingRoom1;\n\n fittingRoom1:- New FittingRoom;\n Activate New Person (\"Sam\");\n Activate New Person (\"Sally\");\n Activate New Person (\"Andy\");\n Hold (100);\nEnd;" ], "related": [ "algol-60", "object-pascal", "java", "csharp", "algol", "smalltalk", "beta", "doi", "isbn" ], "summary": "Simula is the name of two simulation programming languages, Simula I and Simula 67, developed in the 1960s at the Norwegian Computing Center in Oslo, by Ole-Johan Dahl and Kristen Nygaard. Syntactically, it is a fairly faithful superset of ALGOL 60. Simula 67 introduced objects, classes, inheritance and subclasses, virtual procedures, coroutines, and discrete event simulation, and features garbage collection. Also other forms of subtyping (besides inheriting subclasses) were introduced in Simula derivatives. Simula is considered the first object-oriented programming language. As its name suggests, Simula was designed for doing simulations, and the needs of that domain provided the framework for many of the features of object-oriented languages today. Simula has been used in a wide range of applications such as simulating VLSI designs, process modeling, protocols, algorithms, and other applications such as typesetting, computer graphics, and education. The influence of Simula is often understated, and Simula-type objects are reimplemented in C++, Object Pascal, Java, C# and several other languages. Computer scientists such as Bjarne Stroustrup, creator of C++, and James Gosling, creator of Java, have acknowledged Simula as a major influence.", "pageId": 29513, "dailyPageViews": 218, "created": 2002, "backlinksCount": 153, "revisionCount": 435, "appeared": 1965, "url": "https://en.wikipedia.org/wiki/Simula" }, "helloWorldCollection": [ "! Hello World in Simula;\n\nBEGIN\n OutText(\"Hello World!\");\n OutImage;\nEND\n" ], "leachim6": { "filepath": "s/Simula.sim", "fileExtensions": [ "sim" ], "example": [ "Begin\n OutText (\"Hello World\");\n Outimage;\nEnd;" ], "id": "Simula" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Simula", "tryItOnline": "simula", "tiobe": { "id": "Simula" }, "hopl": "https://hopl.info/showlanguage.prx?exp=170", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nObject-Oriented Programming with SIMULA|1989|Bjørn Kirkerud|3923315|0.0|0|0\nAnti-fragile ICT Systems (Simula SpringerBriefs on Computing)||Kjell Jørgen Hole|61222579|3.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n1989-11-01T00:00:01Z|Addison-Wesley|Object-Oriented Programming With Simula (International Computer Science Series)|Kirkerud, Bjorn|9780201175745\n1987|Alfred Waller Ltd|An Introduction to Programming in Simula (Computer Science Texts)|Pooley, R. J.|9780632016112\n1987|Alfred Waller Ltd|Introduction To Programming With Simula (computer Science Texts)|R. J. Pooley|9780632014224", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1972|General Concepts of the Simula 67 Programming Language|10.1016/0066-4138(72)90004-3|18|0|J. Ichbiah and S. Morse|b960d635e5452df1e01b52de7c9e0f2c1e6ecee7\n1980|An Abstract Type for Statistics Collection in Simula|10.1145/357114.357118|14|0|C. Landwehr|527d7f67574dba3a8ae98cd8ca14aee9e3d74350\n1986|Object-oriented simulation—Ada, C++, Simula|10.1145/318242.318278|7|0|B. Unger|b3e4886211aca2b370165510714fcc394a145ccc\n1968|A comparison between simula and fortran|10.1007/BF01933421|6|0|J. Palme|dbeb6a36b04553de59c6aa5328605f7a8c84c8be\n1971|Simulation data structures using SIMULA 67|10.1145/800294.811447|6|1|J. Vaucher|22ef52b7ff6713f19e0b0a0521241e34e676e4c2\n1984|An Outline of the Programming Language Simula|10.1016/0096-0551(84)90018-3|6|0|M. Papazoglou and P. Georgiadis and D. Maritsas|80191d485bfa1963ee27d0d877a0ad36dd6f1c52\n1976|Evaluation of ALGOL 68, JOVIAL J3B, PASCAL, SIMULA 67, and TACPOL vs. TINMAN Requirements for a Common High Order Programming Language.|10.21236/ada033893|3|0|J. Goodenough and C. McGowan and J. R. Kelly|be654e5389930136859ef4263619d9f59a5ee216\n1982|Uses of the SIMULA process concept|10.1002/spe.4380120205|2|0|J. Palme|32efb94171675f3c5931f3c463006e4e2cde195c\n2007|An Accidental Simula User|10.1007/978-3-540-73589-2_10|2|0|L. Cardelli|ff6f1c49ff00efa483807fae71ef2a0f2baf6a04\n2007|Celebrating 40 years of language evolution: simula 67 to the present and beyond|10.1145/1297846.1297971|2|0|S. Fraser and James Gosling and Anders Hejlsberg and O. Madsen and B. Meyer and G. Steele|83da4c78b3244a29958643c508918bbcacaf966a\n1978|ACM SIGPLAN history of programming languages conference SIMULA language summary|10.1145/960118.808390|2|0|W. Franta|75b608fd523e890864babecbd61c402c817cc4e5\n1986|Ada, as seen from Simula|10.1002/j.1097-024X.1986.tb00001.x|1|0|S. Krogdahl and K. A. Olsen|9b52e08be43911cf540732b3afc9c2aa93a83823\n1976|Experience from the standardization of the SIMULA programming language|10.1002/spe.4380060314|1|0|J. Palme|785beabc4eb91d414c0cbf015824057586d0bb72\n1981|The class concept in the Simula programming language|10.1145/800142.805365|1|0|J. Palme and M. Wallin|2a07093ebd4db925ac02c36887b37eb2b7ccef37" }, "simulink": { "title": "Simulink", "appeared": 1984, "type": "pl", "website": "https://www.mathworks.com/products/simulink.html?s_cid=wiki_simulink_2", "originCommunity": [ "MathWorks" ], "wikipedia": { "related": [ "linux", "matlab", "c", "vhdl", "verilog", "modelica", "labview" ], "summary": "Simulink, developed by MathWorks, is a graphical programming environment for modeling, simulating and analyzing multidomain dynamical systems. Its primary interface is a graphical block diagramming tool and a customizable set of block libraries. It offers tight integration with the rest of the MATLAB environment and can either drive MATLAB or be scripted from it. Simulink is widely used in automatic control and digital signal processing for multidomain simulation and Model-Based Design.", "pageId": 562695, "dailyPageViews": 299, "created": 2004, "backlinksCount": 133, "revisionCount": 300, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Simulink" }, "tiobe": { "id": "Simulink" }, "fileType": "text", "isOpenSource": false, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nMATLAB and Simulink for Engineers|2011|Agam Kumar Tyagi|19308397|4.33|12|0\nIntroduction To Simulink With Engineering Applications||Steven T. Karris|2003806|2.00|1|0\nModeling and Simulation in Simulink for Engineers and Scientists|2005|Mohammad Nuruzzaman|160556|3.50|2|0", "isbndb": "year|publisher|title|authors|isbn13\n2001|Prentice Hall|Mastering Simulink 4 (2nd Edition)|Dabney, James B. and Harman, Thomas L.|9780130170859\n2018|Bentham Science Publishers|Arduino meets MATLAB: Interfacing, Programs and Simulink|Singh, Rajesh and Gehlot, Anita and Singh, Bhupendra and Choudhury, Sushabhan|9781681087276\n2013|Packt Publishing|Getting Started with Simulink|Zamboni, Luca|9781782171386\n2010|Springer|Embedded Software Design and Programming of Multiprocessor System-on-Chip: Simulink and System C Case Studies (Embedded Systems)|Popovici, Katalin and Rousseau, Frédéric and Jerraya, Ahmed A. and Wolf, Marilyn|9781441955678\n2016|CRC Press|Modeling and Simulation in Ecotoxicology with Applications in MATLAB and Simulink|Dixon, Kenneth R.|9781439855188\n|MathWorks Inc|MATLAB & Simulink Student Release 2009a||9780979223990\n2010|Chapman and Hall/CRC|Introduction to the Simulation of Dynamics Using Simulink (Chapman & Hall/CRC Computational Science)|Gray, Michael A.|9781439880999\n2017|Createspace Independent Publishing Platform|Signal Processing In Matlab. Simulink Blocks And Code Generation|G. Peck|9781981953967\n2019|Independently Published|Simulink Code Generation|National Aeronautics and Space Adm Nasa|9781794071049\n2016|De Gruyter|MATLAB - Simulink - Stateflow|Anne Angermann; Michael Beuschel; Martin Rau; Ulrich Wohlfarth|9783110484953\n20201123|De Gruyter|MATLAB – Simulink – Stateflow|Anne Angermann; Michael Beuschel; Martin Rau; Ulrich Wohlfarth|9783110636710\n2011||Modeling & Simulation Using Matlab Simulink (with Cd )|Dr. Shailendra Jain|9788126530052\n2013|John Wiley & Sons|System Simulation Techniques With Matlab And Simulink|Dingyü Xue and Yang Chen|9781118694350\n2013-09-16|Wiley|System Simulation Techniques with MATLAB and Simulink|Dingyü Xue and Yang Chen|9781118694374\n20100702|Taylor & Francis|Introduction to the Simulation of Dynamics Using Simulink|Michael A. Gray|9781439818985\n2016-08-10|LAP LAMBERT Academic Publishing|Application of MATLAB and SIMULINK Modeling for Beginners|Ephraim Nwoye|9783659934582", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Design of FPGA-controlled power electronics and drives using MATLAB Simulink|10.1109/ECCE-ASIA.2013.6579155|40|5|Y. Siwakoti and G. Town|5bf67012ede77841fb8263f48a850ae3cd8126ec\n2014|Simulations of pattern dynamics for reaction-diffusion systems via SIMULINK|10.1186/1752-0509-8-45|14|0|Kaier Wang and M. Steyn-Ross and D. Steyn-Ross and M. Wilson and J. Sleigh and Y. Shiraishi|239713b51a61bfe75b627474e82433217a19232c\n2009|Implementation of a Complete GPS Receiver on the C6713 DSP through Simulink|10.5081/JGPS.8.1.76|13|0|G. Hamza and A. Zekry and M. Moustafa|4678e64df53932fe13c61acced572dfd71cfdd80\n2006|Simulink Model for Double Buffering|10.1109/IECON.2006.348142|8|0|R. Sheeparamatti and B. G. Sheeparamatti and M. Bharamagoudar and N. Ambali|b8195a48dc6c84058d452c261e04a1462f98f196\n2014|Contract-Based Verification of MATLAB and Simulink Matrix-Manipulating Code|10.1007/978-3-319-11737-9_26|8|1|J. Wiik and Pontus Boström|5e7912085fd135f8c19d7fc3ab607f2090777ec2\n2002|A Library of Simulink Blocks for Real-Time Control of HEV Traction Drives|10.4271/2002-01-1934|6|0|J. Chiasson and Yinghui Lu and L. Tolbert|fd9a86a96989bf776c6222c5585375c033ec1fc4\n2017|A Synchronous Look at the Simulink Standard Library|10.1145/3126516|6|0|T. Bourke and Francois Carcenac and J. Colaço and B. Pagano and Cédric Pasteur and Marc Pouzet|c362ba3357fd7c3e864accbce5b06fd40f883aa2\n2014|Simulation of the E1 and E6 Galileo Signals using SIMULINK|10.5120/15431-4043|2|0|M. Elhawary and G. Gomah and A. Zekry and I. Hafez|44190f24eccc53d870f19d245ccb7dee7c2bef88\n2004|Porting GENESIS to SIMULINK|10.1109/IEMBS.2004.1404441|1|0|F.R. Campos and J. Enderle|92b47581fbb803b74d561e91431e7b4915afb5bf\n2014|GPS RECEIVER IMPLEMENTATION USING SIMULINK|10.21090/ijaerd.010568|1|0|N. Chowdary and C.Abhishek and N.Sasikiran|cca174da520ca43ba521b18e3774ead4d5817e79\n2016|Automation tool to deploy Simulink models into programmable system-on-chip|10.1109/INDUSCON.2016.7874519|1|0|Alexandre A. A. de Almeida and W. D. A. P. Ferreira and A. D. da Silva|195748f55862b1349b04a0096e275650ad531c2c\n2017|Actuation of Electro-Pneumatic System using MATLAB Simulink and Arduino Controller- A case of a Mechatronics systems Lab|10.2991/ICCASP-16.2017.10|1|0|P. Parikh and R. Vasani and S. Sheth and J. Gohil|5c402f4df6ec95ee17417613674a8b2cdc0bc30f\n2019|COMPARISON OF R AND MATLAB SIMULINK in Educating High School Students with ODE Modeling Skills|10.18260/2-1-370.660-105620|1|0|Jianming Geng|d0d11dd94a1e191b255156c708f4357feebac4cd" }, "sina": { "title": "sina", "appeared": 1989, "type": "pl", "description": "SINA is an object-oriented language for distributed and concurrent programming.", "reference": [ "https://pdfs.semanticscholar.org/0846/eb0b3771a8d0b3b1e1cf886c857ebe615d02.pdf" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1525", "fileType": "text", "centralPackageRepositoryCount": 0 }, "sinclair-basic": { "title": "Sinclair BASIC", "appeared": 1979, "type": "pl", "creators": [ "Steve Vickers" ], "wikipedia": { "example": [ " 10 PRINT \"Hello world!\"\n " ], "related": [ "basic", "microsoft-basic", "beta-basic", "superbasic", "sam-coupe", "unix", "groovy", "linux" ], "summary": "Sinclair BASIC is a dialect of the programming language BASIC used in the 8-bit home computers from Sinclair Research and Timex Sinclair. The Sinclair BASIC interpreter was made by Nine Tiles Networks Ltd.", "created": 2003, "backlinksCount": 136, "pageId": 395538, "revisionCount": 253, "dailyPageViews": 43, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/Sinclair_BASIC" }, "isOpenSource": false, "centralPackageRepositoryCount": 0, "isbndb": "" }, "sing-sharp": { "title": "Sing Sharp", "appeared": 2005, "type": "pl", "supersetOf": [ "spec-sharp" ], "wikipedia": { "example": [ "static int Main(string![] args)\n requires args.Length > 0;\n ensures return == 0;\n {\n foreach(string arg in args)\n {\n Console.WriteLine(arg);\n }\n return 0;\n }" ], "related": [ "csharp", "eiffel", "java" ], "summary": "Spec# is a programming language with specification language features that extends the capabilities of the C# programming language with Eiffel-like contracts, including object invariants, preconditions and postconditions. Like ESC/Java, it includes a static checking tool based on a theorem prover that is able to statically verify many of these invariants. It also includes a variety of other minor extensions to the language, such as non-null reference types. The code contracts API in the .NET Framework 4.0 has evolved with Spec#. Microsoft Research developed both Spec# and C#; in turn, Spec# serves as the foundation of the Sing# programming language, which Microsoft Research also developed.", "created": 2005, "backlinksCount": 82, "pageId": 3078904, "revisionCount": 39, "dailyPageViews": 12, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Sing_Sharp" }, "centralPackageRepositoryCount": 0 }, "singular": { "title": "singular", "appeared": 1987, "type": "pl", "description": "Singular is a computer algebra system for polynomial computations, with special emphasis on commutative and non-commutative algebra, algebraic geometry, and singularity theory.", "website": "https://www.singular.uni-kl.de/", "domainName": { "name": "singular.uni-kl.de" }, "jupyterKernel": [ "https://github.com/sebasguts/jupyter_kernel_singular" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "siphash-hash-function": { "title": "SipHash", "appeared": 2011, "type": "hashFunction", "wikipedia": { "summary": "SipHash is an add–rotate–xor (ARX) based family of pseudorandom functions created by Jean-Philippe Aumasson and Daniel J. Bernstein in 2012, in response to a spate of \"hash flooding\" denial-of-service attacks in late 2011.Although designed for use as a hash function in the computer science sense, SipHash is fundamentally different from cryptographic hash functions like SHA in that it is only suitable as a message authentication code: a keyed hash function like HMAC. That is, SHA is designed so that it is difficult for an attacker to find two messages X and Y such that SHA(X) = SHA(Y), even though anyone may compute SHA(X). SipHash instead guarantees that, having seen Xi and SipHash(Xi, k), an attacker who does not know the key k cannot find (any information about) k or SipHash(Y, k) for any message Y ∉ {Xi} which they have not seen before.", "backlinksCount": 125, "pageId": 37927149, "dailyPageViews": 70, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/SipHash" } }, "siprol": { "title": "Siprol", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/34e484d2d3655d488b45d1bd7968fe8869811a32" ], "hopl": "https://hopl.info/showlanguage.prx?exp=930", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "siri": { "title": "Siri", "appeared": 1991, "type": "pl", "hopl": "https://hopl.info/showlanguage.prx?exp=1660" }, "sisal": { "title": "SISAL", "appeared": 1983, "type": "pl", "creators": [ "James McGraw" ], "country": [ "United Kingdom" ], "visualParadigm": false, "hasStaticTyping": { "example": "", "value": true }, "wikipedia": { "related": [ "pascal", "c", "fortran", "haskell", "sac-programming-language", "grep" ], "summary": "SISAL (\"Streams and Iteration in a Single Assignment Language\") is a general-purpose single assignment functional programming language with strict semantics, implicit parallelism, and efficient array handling. SISAL outputs a dataflow graph in Intermediary Form 1 (IF1). It was derived from VAL (Value-oriented Algorithmic Language, designed by Jack Dennis), and adds recursion and finite streams. It has a Pascal-like syntax and was designed to be a common high-level language for numerical programs on a variety of multiprocessors.", "pageId": 57406, "dailyPageViews": 16, "created": 2002, "backlinksCount": 33, "revisionCount": 69, "appeared": 1983, "url": "https://en.wikipedia.org/wiki/SISAL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Sisal", "tryItOnline": "sisal", "hopl": "https://hopl.info/showlanguage.prx?exp=1057", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "sisc": { "title": "SISC", "appeared": 2007, "type": "pl", "wikipedia": { "related": [ "java", "guile", "c" ], "summary": "SISC is an R5RS Scheme implementation, which includes a full number tower, hygienic macros, proper tail recursion, and first class continuations. SISC is short for Second Interpreter of Scheme Code, in reference to its predecessor LISC, the Lightweight Interpreter of Scheme Code.SISC is free software, dual-licensed under the Mozilla Public License and the GNU General Public License, Version 2. It was developed by Scott G. Miller and Matthias Radestock.", "backlinksCount": 10, "pageId": 13363730, "dailyPageViews": 11, "created": 2007, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/SISC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=8646", "centralPackageRepositoryCount": 0 }, "sitemap": { "title": "Sitemap", "appeared": 2001, "type": "xmlFormat", "description": "Sitemaps are an easy way for webmasters to inform search engines about pages on their sites that are available for crawling. In its simplest form, a Sitemap is an XML file that lists URLs for a site along with additional metadata about each URL (when it was last updated, how often it usually changes, and how important it is, relative to other URLs in the site) so that search engines can more intelligently crawl the site.", "website": "https://sitemaps.org/", "reference": [ "https://en.wikipedia.org/wiki/Site_map" ], "domainName": { "registered": 2001, "awisRank": { "2022": 37655 }, "name": "sitemaps.org" }, "example": [ "\n\n\n\n \n\n http://www.example.com/\n\n 2005-01-01\n\n monthly\n\n 0.8\n\n \n\n " ] }, "sixten": { "title": "sixten", "appeared": 2014, "type": "pl", "creators": [ "Olle Fredriksson" ], "reference": [ "https://ollef.github.io/blog/posts/query-based-compilers.html" ], "githubRepo": { "firstCommit": 2014, "stars": 712, "forks": 29, "subscribers": 48, "created": 2017, "updated": 2022, "description": "Functional programming with fewer indirections", "issues": 37, "url": "https://github.com/ollef/sixten" }, "repoStats": { "firstCommit": 2014, "commits": 1118, "committers": 10, "files": 418 } }, "sizzle": { "title": "sizzle", "appeared": 2008, "type": "queryLanguage", "website": "https://sizzlejs.com/", "domainName": { "registered": 2008, "name": "sizzlejs.com" }, "githubRepo": { "firstCommit": 2008, "stars": 6157, "forks": 979, "subscribers": 293, "created": 2008, "updated": 2022, "description": "A sizzlin' hot selector engine.", "issues": 18, "url": "https://github.com/jquery/sizzle" }, "repoStats": { "firstCommit": 2008, "commits": 1065, "committers": 65, "files": 76 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1993|Cas Education Group|Performance Programming: Making Rpg Sizzle|Mike Dawson|9781884322082\n1993|29th Street Pr|Performance Programming: Making Rpg Sizzle|Mike Dawson|9781882419395" }, "sk8": { "title": "SK8", "appeared": 1988, "type": "pl", "wikipedia": { "url": "https://en.wikipedia.org/wiki/SK8_(programming_language)" }, "isbndb": "" }, "sketchpad-iii": { "title": "Sketchpad III", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/bf1fcedc27f73110cec7321a8808fcd651db2b00" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3885", "centralPackageRepositoryCount": 0 }, "sketchpad": { "title": "Sketchpad", "appeared": 1962, "type": "pl", "wikipedia": { "summary": "Sketchpad (a.k.a. Robot Draftsman) was a computer program written by Ivan Sutherland in 1963 in the course of his PhD thesis, for which he received the Turing Award in 1988, and the Kyoto Prize in 2012. It pioneered the way for human–computer interaction (HCI). Sketchpad is considered to be the ancestor of modern computer-aided design (CAD) programs as well as a major breakthrough in the development of computer graphics in general. For example, the graphical user interface (GUI) was derived from the Sketchpad as well as modern object oriented programming. Ivan Sutherland demonstrated with it that computer graphics could be used for both artistic and technical purposes in addition to showing a novel method of human-computer interaction.", "backlinksCount": 181, "pageId": 78126, "dailyPageViews": 121, "appeared": 1963, "url": "https://en.wikipedia.org/wiki/Sketchpad" }, "hopl": "https://hopl.info/showlanguage.prx?exp=191" }, "skew": { "title": "skew", "appeared": 2015, "type": "pl", "creators": [ "Evan Wallace" ], "website": "http://skew-lang.org", "fileExtensions": [ "sk" ], "country": [ "United States" ], "domainName": { "registered": 2014, "name": "skew-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n11493721|Skew: A programming language for developing cross platform applications|http://skew-lang.org/|2016-04-14 01:32:03 UTC|1460597523|megacity|0|8" }, "skil": { "title": "SKIL", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4925173df1dca86dd01182e8e1b2d0d5f84fdb69" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2187", "centralPackageRepositoryCount": 0, "isbndb": "" }, "skip": { "title": "skip", "appeared": 2018, "type": "pl", "website": "http://skiplang.com/", "originCommunity": [ "Facebook" ], "domainName": { "registered": 2017, "name": "skiplang.com" }, "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print_string" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "firstCommit": 2018, "stars": 1912, "forks": 71, "subscribers": 60, "created": 2018, "updated": 2022, "description": "A programming language to skip the things you have already computed", "issues": 46, "url": "https://github.com/skiplang/skip" }, "repoStats": { "firstCommit": 2018, "commits": 361, "committers": 23, "files": 6358 }, "leachim6": { "filepath": "s/Skip.sk", "fileExtensions": [ "sk" ], "example": [ "fun main(): void {\n print_string(\"Hello World\")\n}" ], "id": "Skip" }, "fileType": "text", "wordRank": 1838, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2017|Lioncrest Publishing|Skip College, Start Programming: The Complete How-To Guide to Teaching Yourself Software Development|Hinton, Sam|9781619616899" }, "skookumscript": { "title": "skookumscript", "appeared": 2004, "type": "pl", "website": "http://skookumscript.com/", "reference": [ "http://forum.skookumscript.com/t/agog-labs-joins-epic-games-rip-sk/1799/8" ], "domainName": { "registered": 2009, "awisRank": { "2022": 6463173 }, "name": "skookumscript.com" } }, "skulpt": { "title": "skulpt", "appeared": 2009, "type": "pl", "creators": [ "Scott Graham" ], "description": "Skulpt is an entirely in-browser implementation of Python.", "website": "http://www.skulpt.org/", "domainName": { "registered": 2009, "awisRank": { "2022": 2261322 }, "name": "skulpt.org" }, "githubRepo": { "firstCommit": 2009, "stars": 3164, "forks": 877, "subscribers": 114, "created": 2012, "updated": 2022, "description": "Skulpt is a Javascript implementation of the Python programming language", "issues": 255, "url": "https://github.com/skulpt/skulpt" }, "repoStats": { "firstCommit": 2009, "commits": 5615, "committers": 138, "files": 3215 }, "jupyterKernel": [ "https://github.com/Calysto/skulpt_python" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "sky": { "title": "SKY", "appeared": 2000, "type": "pl", "reference": [ "https://semanticscholar.org/paper/33ef6c3feeb784b6db625d403e9d11a82ad0f117" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6207", "wordRank": 2872, "centralPackageRepositoryCount": 0 }, "sl": { "title": "SL", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e582507f1e51b45028230f161f516e6e1f086f18" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2832", "wordRank": 5776, "centralPackageRepositoryCount": 0 }, "sl5": { "title": "SL5", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2393fa7f1575958f9877a42ba1481cb31b13eaf5" ], "hopl": "https://hopl.info/showlanguage.prx?exp=783", "centralPackageRepositoryCount": 0 }, "slam-ii": { "title": "SLAM II", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/19605932bb7cfdb44d2426dd9efa78b4f614432d" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2507", "centralPackageRepositoryCount": 0 }, "slang": { "title": "SLANG", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/202c377173b5f557336cab1580222977bec16509" ], "rijuRepl": { "example": [ "message(\"Hello, world!\");\n" ], "id": "https://riju.codes/slang" }, "hopl": "https://hopl.info/showlanguage.prx?exp=154", "centralPackageRepositoryCount": 0 }, "slash": { "title": "Slash", "appeared": 2012, "type": "pl", "website": "http://slash-lang.org/", "domainName": { "name": "slash-lang.org" }, "githubRepo": { "firstCommit": 2012, "stars": 387, "forks": 23, "subscribers": 38, "created": 2012, "updated": 2022, "description": "A new language for the web", "issues": 13, "url": "https://github.com/slash-lang/slash" }, "repoStats": { "firstCommit": 2012, "commits": 1199, "committers": 8, "files": 232 }, "githubLanguage": { "fileExtensions": [ "sl" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "text.html.slash", "repos": 572, "id": "Slash" }, "githubBigQuery": { "repos": 427, "users": 388, "id": "Slash" }, "pygmentsHighlighter": { "filename": "slash.py", "fileExtensions": [ "sla" ], "id": "Slash" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2014, "committerCount": 1, "commitCount": 6, "sampleCount": 1, "example": [ "<%\n\nclass Env {\n def init {\n @memory = [];\n @ptr = 0;\n }\n\n def ptr { @ptr }\n def ptr=(ptr) { @ptr = ptr }\n\n def current_value { @memory[@ptr] || 0 }\n def current_value=(value) { @memory[@ptr] = value }\n}\n\nclass AST {\n class Next {\n def eval(env) {\n env.ptr++;\n }\n }\n\n class Prev {\n def eval(env) {\n env.ptr--;\n }\n }\n\n class Inc {\n def eval(env) {\n env.current_value++;\n }\n }\n\n class Dec {\n def eval(env) {\n env.current_value--;\n }\n }\n\n class Output {\n def eval(env) {\n print(env.current_value.char);\n }\n }\n\n class Input {\n def eval(env) {\n ...\n }\n }\n\n class Sequence {\n def init(nodes) {\n @nodes = nodes;\n }\n\n def eval(env) {\n for node in @nodes {\n node.eval(env);\n }\n }\n }\n\n class Loop {\n def init(seq) {\n @seq = seq;\n }\n\n def eval(env) {\n while env.current_value != 0 {\n @seq.eval(env);\n }\n }\n }\n}\n\nclass Parser {\n def init(str) {\n @chars = str.split(\"\");\n }\n\n def parse {\n @stack = [[]];\n for char in @chars {\n _parse_char(char);\n }\n if @stack.length != 1 {\n throw SyntaxError.new(\"unexpected end of input\");\n }\n AST::Sequence.new(@stack.last);\n }\n\n def _parse_char(char) {\n switch char {\n \">\" { _add(AST::Next.new); }\n \"<\" { _add(AST::Prev.new); }\n \"+\" { _add(AST::Inc.new); }\n \"-\" { _add(AST::Dec.new); }\n \".\" { _add(AST::Output.new); }\n \",\" { _add(AST::Input.new); }\n \"[\" { _open_loop(); }\n \"]\" { _close_loop(); }\n }\n }\n\n def _add(node) {\n @stack.last.push(node);\n }\n\n def _open_loop {\n @stack.push([]);\n }\n\n def _close_loop {\n if @stack.length == 1 {\n throw SyntaxError.new(\"unexpected ']'\");\n }\n\n nodes = @stack.pop;\n _add(AST::Loop.new(AST::Sequence.new(nodes)));\n }\n}\n\nsrc = File.read(ARGV.first);\nast = Parser.new(src).parse;\nast.eval(Env.new);\n" ], "url": "https://github.com/slash-lang/Slash.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "sleuth": { "title": "SLEUTH", "appeared": 1962, "type": "assembly", "reference": [ "http://bitsavers.org/pdf/univac/1107/UT-2574_Sleuth_Apr62.pdf" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3220", "semanticScholar": "" }, "slice": { "title": "Slice", "appeared": 2011, "type": "pl", "reference": [ "https://zeroc.com/products/ice" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "// YellowPages.ice\nmodule YellowPages\n{\n class PersonDetails\n {\n string phoneNumber;\n optional(1) string address;\n }\n\n interface PhoneBook\n {\n PersonDetails find(string name);\n }\n}" ], "githubLanguage": { "fileExtensions": [ "ice" ], "type": "programming", "aceMode": "text", "tmScope": "source.slice", "repos": 40, "id": "Slice" }, "githubBigQuery": { "repos": 20, "users": 13, "id": "Slice" }, "linguistGrammarRepo": { "firstCommit": 2018, "lastCommit": 2018, "committerCount": 5, "commitCount": 14, "sampleCount": 1, "example": [ "#pragma once\n\n#ifndef SOME_TEST\n[[\"java:package:linguist\"]]\n#endif\n\nmodule Linguist\n{\n enum MyEnum\n {\n One,\n Two,\n Three\n }\n\n struct MyStruct\n {\n // An int\n int a;\n /* string */\n string b;\n\n MyEnum e;\n }\n\n exception MyException {\n string e;\n }\n\n dictionary MyDict;\n\n sequence MyEnumSeq;\n\n class BaseClass {\n int value = -1;\n }\n\n class MyClass extends BaseClass\n {\n MyDict info;\n\n optional(1) string op;\n }\n\n\n interface MyInterface\n {\n void operationA(out bool valid);\n idempotent void operationB(int a);\n MyEnumseq getEnum();\n\n [\"cpp:const\", \"cpp:noexcept\"] string getName();\n }\n}" ], "url": "https://github.com/zeroc-ice/vscode-slice" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "slick": { "title": "Slick", "appeared": 2020, "type": "pl", "creators": [ "Kye W. Shi" ], "githubRepo": { "firstCommit": 2020, "stars": 0, "forks": 0, "subscribers": 2, "created": 2020, "updated": 2021, "description": "cool language thing", "issues": 0, "url": "https://github.com/kwshi/slick" }, "repoStats": { "firstCommit": 2020, "commits": 231, "committers": 5, "files": 47 }, "rijuRepl": { "example": [ "def main:\n print \"Hello, world!\"\n" ], "id": "https://riju.codes/slick" } }, "slideshow": { "title": "Slideshow", "appeared": 2000, "type": "textMarkup", "creators": [ "Matthew Flatt", "Robert Bruce Findler" ], "description": "Slideshow is a library for creating presentation slides. Unlike Powerpoint, Slideshow provides no WYSIWYG interface for constructing slides. Instead, like Beamer, a presentation is generated by a program", "documentation": [ "https://docs.racket-lang.org/slideshow" ], "emailList": [ "https://lists.racket-lang.org" ], "fileExtensions": [ ".rkt" ], "country": [ "United States" ], "originCommunity": [ "University of Utah", "Northwestern University" ], "versions": { "2023": [ "v8.8" ] }, "writtenIn": [ "racket", "scheme" ], "githubRepo": { "firstCommit": 2000, "stars": 32, "forks": 18, "subscribers": 24, "created": 2014, "updated": 2022, "issues": 8, "url": "https://github.com/racket/slideshow" }, "repoStats": { "firstCommit": 2000, "commits": 566, "committers": 29, "files": 90 }, "isOpenSource": true }, "slim-lang": { "title": "Slim", "appeared": 2011, "type": "template", "description": "A lightweight templating engine", "website": "http://slim-lang.com/", "domainName": { "registered": 2010, "awisRank": { "2017": 824418, "2022": 3570207 }, "name": "slim-lang.com" }, "example": [ "doctype html\nhtml\n head\n title Slim Examples\n meta name=\"keywords\" content=\"template language\"\n meta name=\"author\" content=author\n javascript:\n alert('Slim supports embedded javascript!')\n\n body\n h1 Markup examples" ], "githubRepo": { "firstCommit": 2010, "stars": 5110, "forks": 502, "subscribers": 122, "created": 2010, "updated": 2022, "description": "Slim is a template language whose goal is to reduce the syntax to the essential parts without becoming cryptic.", "issues": 80, "url": "https://github.com/slim-template/slim" }, "repoStats": { "firstCommit": 2010, "commits": 1973, "committers": 122, "files": 125 }, "githubLanguage": { "fileExtensions": [ "slim" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "text", "codemirrorMode": "slim", "codemirrorMimeType": "text/x-slim", "tmScope": "text.slim", "repos": 305, "id": "Slim" }, "githubBigQuery": { "repos": 206, "users": 176, "id": "Slim" }, "pygmentsHighlighter": { "filename": "webmisc.py", "fileExtensions": [ "slim" ], "id": "Slim" }, "linguistGrammarRepo": { "firstCommit": 2010, "lastCommit": 2017, "committerCount": 24, "commitCount": 109, "sampleCount": 1, "example": [ "doctype html\nhtml\n head\n title Slim Examples\n meta name=\"keywords\" content=\"template language\"\n meta name=\"author\" content=author\n javascript:\n alert('Slim supports embedded javascript!')\n\n body\n h1 Markup examples\n\n #content\n p This example shows you how a basic Slim file looks like.\n\n == yield\n\n - unless items.empty?\n table\n - for item in items do\n tr\n td.name = item.name\n td.price = item.price\n - else\n p\n | No items found. Please add some inventory.\n Thank you!\n\n div id=\"footer\"\n = render 'footer'\n | Copyright © #{year} #{author}" ], "url": "https://github.com/slim-template/ruby-slim.tmbundle" }, "leachim6": { "filepath": "s/Slim.slim", "fileExtensions": [ "slim" ], "example": [ "doctype html\nhead\n title Hello World\nbody\n h1 Hello World" ], "id": "Slim" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2011|Teach Yourself|The NLP Diet: Think Yourself Slim - For Good|Archer, Jeff|9781444137316", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|Implementing UML associations in Java: a slim code pattern for a complex modeling concept|10.1145/1562100.1562104|16|0|Dominik Gessenharter|261c93ab54d81ea57a2165818d085a4a7b213885\n2008|Generating GO Slim Using Relational Database Management Systems to Support Proteomics Analysis|10.1109/CBMS.2008.77|5|0|Getiria Onsongo and Hongwei Xie and T. Griffin and J. Carlis|19f5f9a33940c252ac394ce7b21aad3db7cafdbd" }, "slim-pl": { "title": "slim-pl", "appeared": 1999, "type": "pl", "creators": [ "Herman Venter" ], "description": "Slim is a general-purpose programming language resembling SETL. It is more like a cousin to SETL than a child, since it shares a common heritage with SETL, but was independently designed.", "website": "http://setl.org/slim/", "fileType": "text", "centralPackageRepositoryCount": 0 }, "slim": { "title": "slim", "appeared": 2010, "type": "pl", "website": "http://slim-lang.com", "documentation": [ "https://www.slimframework.com/docs/v4/" ], "domainName": { "registered": 2010, "awisRank": { "2022": 3570207 }, "name": "slim-lang.com" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n2821133|Slim - A Fast, Lightweight Template Engine for Ruby|http://slim-lang.com/|2011-07-29 10:47:44 UTC|1311936464|duck|7|5", "isbndb": "year|publisher|title|authors|isbn13\n2011|Teach Yourself|The NLP Diet: Think Yourself Slim - For Good|Archer, Jeff|9781444137316", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|Implementing UML associations in Java: a slim code pattern for a complex modeling concept|10.1145/1562100.1562104|16|0|Dominik Gessenharter|261c93ab54d81ea57a2165818d085a4a7b213885\n2008|Generating GO Slim Using Relational Database Management Systems to Support Proteomics Analysis|10.1109/CBMS.2008.77|5|0|Getiria Onsongo and Hongwei Xie and T. Griffin and J. Carlis|19f5f9a33940c252ac394ce7b21aad3db7cafdbd" }, "slip": { "title": "SLIP", "appeared": 1960, "type": "pl", "wikipedia": { "related": [ "fortran", "algol" ], "summary": "SLIP is a list processing computer programming language, invented by Joseph Weizenbaum in the 1960s. The name SLIP stands for Symmetric LIst Processor. It was first implemented as an extension to the Fortran programming language, and later embedded into MAD and ALGOL.", "pageId": 4449554, "created": 2006, "backlinksCount": 8, "revisionCount": 30, "dailyPageViews": 14, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/SLIP_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3550", "fileType": "text", "wordRank": 5110, "centralPackageRepositoryCount": 0 }, "slips": { "title": "SLIPS", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c02b5654ebb137f3023a56ba7ed8a1f3c445e6da" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1271", "centralPackageRepositoryCount": 0, "isbndb": "" }, "slog": { "title": "SLOG", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e9a06552354c3247ebff305e21ad8386b45089ee" ], "hopl": "https://hopl.info/showlanguage.prx?exp=746", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "slony": { "title": "Slony", "appeared": 2004, "type": "application", "creators": [ "Steve Singer" ], "description": "Slony-I is a \"master to multiple slaves\" replication system for PostgreSQL supporting cascading (e.g. - a node can feed another node which feeds another node...) and failover.", "website": "https://www.slony.info/", "documentation": [ "https://www.slony.info/documentation/" ], "country": [ "United States" ], "originCommunity": [ "https://github.com/ssinger/slony1-engine" ], "domainName": { "name": "slony.info" }, "githubRepo": { "stars": 35, "forks": 19, "updated": 2020, "description": "Slony-I is a \"master to multiple slaves\" replication system with cascading and failover.The big picture for the development of Slony-I is a master-slave system that includes all features and capabilities needed to replicate large databases to a reasonably limited number of slave systems.", "issues": 1, "url": "https://github.com/ssinger/slony1-engine" }, "wikipedia": { "related": [ "c", "postgresql", "linux", "sql", "plpgsql", "pl-sql", "perl", "javascript" ], "summary": "Slony-I is an asynchronous master-slave replication system for the PostgreSQL DBMS, providing support for cascading and failover. Asynchronous means that when a database transaction has been committed to the master server, it is not yet guaranteed to be available in slaves. Cascading means that replicas can be created (and updated) via other replicas, i.e. they needn't directly connect to the master.", "pageId": 15462886, "dailyPageViews": 2, "created": 2008, "url": "https://en.wikipedia.org/wiki/Slony-I" }, "isOpenSource": true }, "slope": { "title": "Slope", "appeared": 2021, "type": "pl", "creators": [ "Sloum" ], "description": "A small s-expression based programming language", "website": "https://slope.colorfield.space", "standsFor": "SLOum's Programming Environment", "fileExtensions": [ "slo" ], "country": [ "United States" ], "writtenIn": [ "go" ], "influencedBy": [ "scheme" ], "visualParadigm": false, "isLisp": { "example": "", "value": true }, "hasMacros": { "example": "", "value": true }, "hasPrefixNotation": { "example": "(+ 1 2)", "value": true }, "hasBitWiseOperators": { "example": "(& 0xFF 0x1B)", "value": true }, "hasBooleans": { "example": "(define open? #t)", "value": true }, "hasLineComments": { "example": "; I am a comment", "value": true }, "hasComments": { "example": "; I am a comment", "value": true }, "hasBuiltInRegex": { "example": "(regex-match? `[0-9]+` \"Hello 12345\")\n(regex-replace `Hello, (\\w+)!$` \"Hello, world!\" \"Goodbye, $1!\")", "value": true }, "hasNamespaces": { "example": "(ns-create 'hello-world)\n(ns-define\n 'hello-world\n 'print\n (lambda ()\n (display \"hello world!\\n\")))\n(hello-world::print)", "value": true }, "canUseQuestionMarksAsPartOfIdentifier": { "example": "(define yes? #t)", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"hello world\"\n`hello\twold`", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasGotos": { "example": "", "value": false }, "hasImports": { "example": "(load-mod my-module)\n(load \"examples/test.slo\")", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasVariadicFunctions": { "example": "(lambda (...) (apply + ...))", "value": true }, "hasSwitch": { "example": "(case my-num\n (5 (display \"Five!\"))\n (0 (display \"Zero!\"))\n (else (display \"Not an option\")))", "value": true }, "hasZeroBasedNumbering": { "example": "", "value": true }, "hasIncrementAndDecrementOperators": { "example": "", "value": false }, "hasConditionals": { "example": "(if positive? 1 -1)", "value": true }, "lineCommentToken": [ [ ";" ] ], "printToken": [ [ "display" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "#t", "#f" ] ], "keywords": [ "define", "set!", "lambda", "cond", "case", "if", "for", "load", "load-mod", "load-mod-file", "usage", "macro", "eval", "apply", "and", "or", "begin", "begin0", "exists", "coeval" ], "example": [ "; hello world\n(define greeting \"Hello\")\n(display greeting \", world!\\n\")\n" ], "packageRepository": [ "https://git.rawtext.club/slope-lang/packages" ] }, "slpl": { "title": "SLPL", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/146f70bc6d6f4cb0824f4acbd9dc1980fdf33cde" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3490", "centralPackageRepositoryCount": 0 }, "smalgol": { "title": "SMALGOL", "appeared": 1961, "type": "pl", "reference": [ "https://semanticscholar.org/paper/b900690962424fd186d196f16837a8f4aea81e58" ], "hopl": "https://hopl.info/showlanguage.prx?exp=155", "centralPackageRepositoryCount": 0 }, "smali": { "title": "Smali", "appeared": 2010, "type": "assembly", "documentation": [ "https://github.com/JesusFreke/smali/wiki" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "stringToken": [ [ "\"" ] ], "example": [ ".method public getTokens(I)I\n .locals 2\n .param p1, \"amt\" # I\n \n .prologue\n const/4 v0, 0x0\n \n .line 512\n iget-boolean v1, p0, Lcom/limbenjamin/Example;->isPaid:Z\n \n if-nez v1, :cond_1\n \n .line 514\n :cond_0\n :goto_0\n return v0\n \n .line 513\n :cond_1\n iget-object v1, p0, Lcom/limbenjamin/Example;->handler:Lcom/limbenjamin/ExampleHandler;\n \n if-eqz v1, :cond_0\n \n .line 514\n move v3, p1\n \n iget-object v0, p0, Lcom/limbenjamin/Example;->handler:Lcom/limbenjamin/ExampleHandler;\n \n invoke-interface {v0, v3}, Lcom/limbenjamin/ExampleHandler;->creditTokens(I)V\n \n move-result v0\n \n goto :goto_0\n.end method" ], "githubRepo": { "firstCommit": 2009, "stars": 5465, "forks": 1021, "subscribers": 285, "created": 2012, "updated": 2022, "description": "smali/baksmali", "issues": 121, "url": "https://github.com/JesusFreke/smali" }, "repoStats": { "firstCommit": 2009, "commits": 1942, "committers": 49, "files": 930 }, "githubLanguage": { "fileExtensions": [ "smali" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nAhMyth AhMyth-Android-RAT https://github.com/AhMyth.png https://github.com/AhMyth/AhMyth-Android-RAT Smali #ccc 1554 764 152 \"Android Remote Administration Tool\"\nphhusson treble_experimentations https://github.com/phhusson.png https://github.com/phhusson/treble_experimentations Smali #ccc 827 200 36 \"Notes about tinkering with Android Project Treble\"", "trendingProjectsCount": 3, "type": "programming", "aceMode": "text", "tmScope": "source.smali", "repos": 2479, "id": "Smali" }, "githubBigQuery": { "repos": 212, "users": 195, "id": "Smali" }, "pygmentsHighlighter": { "filename": "dalvik.py", "fileExtensions": [ "smali" ], "id": "Smali" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2016, "committerCount": 4, "commitCount": 46, "sampleCount": 7, "example": [ ".class public Lcom/tdq/game/shootbubble/sprite/PenguinSprite;\n.super Lcom/tdq/game/shootbubble/sprite/Sprite;\n.source \"PenguinSprite.java\"\n\n\n# static fields\n.field public static final LOST_SEQUENCE:[[I\n\n.field public static final STATE_FIRE:I = 0x2\n\n.field public static final STATE_GAME_LOST:I = 0x5\n\n.field public static final STATE_GAME_WON:I = 0x4\n\n.field public static final STATE_TURN_LEFT:I = 0x0\n\n.field public static final STATE_TURN_RIGHT:I = 0x1\n\n.field public static final STATE_VOID:I = 0x3\n\n.field public static final WON_SEQUENCE:[[I\n\n\n# instance fields\n.field private count:I\n\n.field private currentPenguin:I\n\n.field private finalState:I\n\n.field private nextPosition:I\n\n.field private rand:Ljava/util/Random;\n\n.field private spritesImage:Lcom/tdq/game/shootbubble/sprite/BmpWrap;\n\n\n# direct methods\n.method static constructor ()V\n .locals 8\n\n .prologue\n const/4 v7, 0x4\n\n const/4 v6, 0x3\n\n const/4 v5, 0x1\n\n const/4 v4, 0x0\n\n const/4 v3, 0x2\n\n .line 67\n const/16 v0, 0x8\n\n new-array v0, v0, [[I\n\n new-array v1, v3, [I\n\n fill-array-data v1, :array_0\n\n aput-object v1, v0, v4\n\n new-array v1, v3, [I\n\n fill-array-data v1, :array_1\n\n aput-object v1, v0, v5\n\n new-array v1, v3, [I\n\n fill-array-data v1, :array_2\n\n aput-object v1, v0, v3\n\n new-array v1, v3, [I\n\n fill-array-data v1, :array_3\n\n aput-object v1, v0, v6\n\n new-array v1, v3, [I\n\n fill-array-data v1, :array_4\n\n aput-object v1, v0, v7\n\n const/4 v1, 0x5\n\n new-array v2, v3, [I\n\n fill-array-data v2, :array_5\n\n aput-object v2, v0, v1\n\n const/4 v1, 0x6\n\n new-array v2, v3, [I\n\n fill-array-data v2, :array_6\n\n aput-object v2, v0, v1\n\n const/4 v1, 0x7\n\n new-array v2, v3, [I\n\n fill-array-data v2, :array_7\n\n aput-object v2, v0, v1\n\n sput-object v0, Lcom/tdq/game/shootbubble/sprite/PenguinSprite;->LOST_SEQUENCE:[[I\n\n .line 69\n const/16 v0, 0x8\n\n new-array v0, v0, [[I\n\n new-array v1, v3, [I\n\n fil" ], "url": "https://github.com/ShaneWilton/sublime-smali" }, "leachim6": { "filepath": "s/Smali.smali", "fileExtensions": [ "smali" ], "example": [ ".class public LHelloWorld;\n\n.super Ljava/lang/Object;\n\n.method public static main([Ljava/lang/String;)V\n .registers 2\n\n sget-object v0, Ljava/lang/System;->out:Ljava/io/PrintStream;\n\n const-string\tv1, \"Hello World\"\n\n invoke-virtual {v0, v1}, Ljava/io/PrintStream;->println(Ljava/lang/String;)V\n\n return-void\n.end method\n" ], "id": "Smali" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Slicing droids: program slicing for smali code|10.1145/2480362.2480706|112|18|Johannes Hoffmann and M. Ussath and Thorsten Holz and Michael Spreitzenbarth|501b2aa2c55dedef322fffe84054c9c9678a61a4" }, "small-c": { "title": "Small-C", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2f227e7312a4176b28168e024f80303a6e8890b4" ], "wikipedia": { "related": [ "c", "unix", "assembly-language", "tinyc-compiler" ], "summary": "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.", "backlinksCount": 20, "pageId": 98145, "dailyPageViews": 33, "created": 2002, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Small-C" }, "hopl": "https://hopl.info/showlanguage.prx?exp=932", "centralPackageRepositoryCount": 0 }, "small-euclid": { "title": "Small Euclid", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/91c78fc5a7433421f5f9a1fb0ebfbf1ceae84d6a" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7312", "centralPackageRepositoryCount": 0 }, "small-x": { "title": "SMALL-X", "appeared": 1985, "type": "pl", "reference": [ "https://semanticscholar.org/paper/51d74cfa7b2be7e090e07bcd967a2f564fa7ad08" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7644", "centralPackageRepositoryCount": 0 }, "small": { "title": "Small", "appeared": 1980, "type": "pl", "creators": [ "Nevil Brownlee" ], "standsFor": "Small Machine Algol Like Language", "wikipedia": { "related": [ "algol", "fortran", "lua", "squirrel" ], "summary": "SMALL, Small Machine Algol Like Language, is a programming language developed by Dr. Nevil Brownlee of Auckland University.", "pageId": 1808130, "created": 2005, "backlinksCount": 18, "revisionCount": 77, "dailyPageViews": 7, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/SMALL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=871", "fileType": "text", "wordRank": 350, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2004|Addison-Wesley Professional|Crystal Clear: A Human-Powered Methodology for Small Teams: A Human-Powered Methodology for Small Teams|Cockburn, Alistair and Paul Becker, Alistair|9780201699470\n2016|No Starch Press|Learn to Program with Small Basic: An Introduction to Programming with Games, Art, Science, and Math|Marji, Majed and Price, Ed|9781593277024\n2004|Prentice Hall|Small Java How To Program|Deitel, Harvey M. and Deitel, Paul J.|9780131486607\n2010|Threshold Editions|Arguing with Idiots: How to Stop Small Minds and Big Government|Beck, Glenn and Balfe, Kevin|9781416595021" }, "smallbasic": { "title": "SmallBASIC", "appeared": 2001, "type": "pl", "website": "https://smallbasic.github.io", "reference": [ "https://sourceforge.net/projects/smallbasic/" ], "domainName": { "awisRank": { "2022": 7190149 }, "name": "smallbasic.github.io" }, "githubRepo": { "firstCommit": 2003, "stars": 153, "forks": 27, "subscribers": 8, "created": 2012, "updated": 2022, "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", "issues": 15, "url": "https://github.com/smallbasic/SmallBASIC" }, "repoStats": { "firstCommit": 2003, "commits": 2546, "committers": 12, "files": 617 }, "wikipedia": { "related": [ "microsoft-small-basic", "basic", "qbasic", "c", "gw-basic", "brainfuck", "linux", "android" ], "summary": "SmallBASIC is a BASIC programming language dialect with interpreters released as free software under the GNU General Public License version 2.", "created": 2003, "backlinksCount": 107, "pageId": 320475, "revisionCount": 125, "dailyPageViews": 15, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/SmallBASIC" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "smalltalk-76": { "title": "Smalltalk-76", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/10e8fa8adad9e6267e97478d17d42d607b80b6a4" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2844", "centralPackageRepositoryCount": 0 }, "smalltalk-80": { "title": "Smalltalk-80", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/9f9c72ea353b513b67dc85a2563142936743b162" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1058", "centralPackageRepositoryCount": 0 }, "smalltalk-mt": { "title": "Smalltalk MT", "appeared": 1994, "type": "pl", "wikipedia": { "related": [ "smalltalk", "c" ], "summary": "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.", "created": 2007, "backlinksCount": 6, "pageId": 9443964, "revisionCount": 12, "dailyPageViews": 3, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Smalltalk_MT" }, "centralPackageRepositoryCount": 0 }, "smalltalk-v": { "title": "Smalltalk/V", "appeared": 1986, "type": "pl", "reference": [ "https://www.springer.com/la/book/9780387973944" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1274", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "smalltalk-yx": { "title": "Smalltalk YX", "appeared": 2007, "type": "pl", "wikipedia": { "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Smalltalk_YX" }, "centralPackageRepositoryCount": 0 }, "smalltalk": { "title": "Smalltalk", "appeared": 1972, "type": "pl", "creators": [ "Alan Kay", "Dan Ingalls", "Adele Goldberg" ], "documentation": [ "https://www.gnu.org/software/smalltalk/manual/html_node/" ], "country": [ "United States" ], "hasMultipleDispatch": { "example": "", "value": true }, "hasMacros": { "example": "", "value": false }, "hasComments": { "example": "", "value": true }, "hasGarbageCollection": { "example": "", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasMessagePassing": { "example": "", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "\" A comment\n\"", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasAssignment": { "example": "", "value": true }, "hasStrings": { "example": "'Hello world'", "value": true }, "multiLineCommentTokens": [ [ "\"" ] ], "printToken": [ [ "displayNl" ] ], "assignmentToken": [ [ ":=" ] ], "stringToken": [ [ "'" ] ], "wikipedia": { "example": [ "quadMultiply: i1 and: i2\n \"This method multiplies the given numbers by each other and the result by 4.\"\n | mul |\n mul := i1 * i2.\n ^mul * 4" ], "related": [ "pharo", "squeak", "visualworks", "lisp", "simula", "euler", "imp", "planner", "logo", "applescript", "dart", "dylan", "erlang", "etoys", "falcon", "go", "groovy", "io", "ioke", "java", "lasso", "lisaac", "newtonscript", "object-rexx", "objective-c", "php", "perl-6", "python", "ruby", "scala", "scratch", "self", "sql", "flavors", "clos", "prolog", "ascii", "javascript", "visual-smalltalk-enterprise", "smalltalk-mt", "jvm", "strongtalk" ], "summary": "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.", "pageId": 28319, "dailyPageViews": 826, "created": 2001, "backlinksCount": 1030, "revisionCount": 1228, "appeared": 1972, "url": "https://en.wikipedia.org/wiki/Smalltalk" }, "githubLanguage": { "fileExtensions": [ "st", "cs" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "codemirrorMode": "smalltalk", "codemirrorMimeType": "text/x-stsrc", "tmScope": "source.smalltalk", "aliases": [ "squeak" ], "repos": 9336, "id": "Smalltalk" }, "githubBigQuery": { "repos": 5607, "users": 4736, "id": "Smalltalk" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/smalltalk", "codeMirror": "smalltalk", "pygmentsHighlighter": { "filename": "smalltalk.py", "fileExtensions": [ "st" ], "id": "Smalltalk" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2017, "committerCount": 5, "commitCount": 22, "sampleCount": 10, "example": [ "ChartJs\ndataFunction\n\t^ 'bars'" ], "url": "https://github.com/tomas-stefano/smalltalk-tmbundle" }, "projectEuler": { "memberCount": { "2019": 104, "2022": 111 }, "id": "Smalltalk" }, "leachim6": { "filepath": "s/SmallTalk.sm", "fileExtensions": [ "sm" ], "example": [ "Transcript show: 'Hello World'.\n" ], "id": "SmallTalk" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Smalltalk", "quineRelay": "Smalltalk", "rijuRepl": { "example": [ "'Hello, world!' displayNl !\n" ], "id": "https://riju.codes/smalltalk" }, "tiobe": { "id": "Smalltalk" }, "hopl": "https://hopl.info/showlanguage.prx?exp=828", "packageRepository": [ "http://smalltalkhub.com/" ], "ubuntuPackage": "gnu-smalltalk", "fileType": "text", "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSmallTalk 80: The Language|1989|Adele Goldberg|924473|4.20|40|3\nSmallTalk 80 Language: The Language and Its Implementation|1983|Adele Goldberg|1831608|4.68|37|0\nSmallTalk-80: The Interactive Programming Environment|1983|Adele Goldberg|1831611|4.33|6|0", "isbndb": "year|publisher|title|authors|isbn13\n1997|Addison-Wesley|On to Smalltalk|Winston, Patrick Henry|9780201498271\n2000|Morgan Kaufmann|Object-Oriented Implementation of Numerical Methods: An Introduction with Java & Smalltalk (The Morgan Kaufmann Series in Software Engineering and Programming)|Besset, Didier H.|9781558606791\n2008|Springer-Verlag New York, LLC|Advances in Smalltalk|Wolfgang De Meuter|9783540718352\n20070531|Springer Nature|Advances in Smalltalk|Wolfgang De Meuter|9783540718369\n2008|Pearson Technology Group|Discovering Smalltalk (Addison-Wesley Object Technology Series)|LaLonde, Wilf|9780805327205\n1988|Addison-Wesley|An Introduction to Object-Oriented Programming and Smalltalk|Pinson, Lewis J. and Wiener, Richard S.|9780201191271\n1996|Pearson|Smalltalk Best Practice Patterns|Beck, Kent|9780132852128\n1996|Pearson|Smalltalk Best Practice Patterns|Beck, Kent|9780134769042\n1989|Addison-Wesley Professional|Smalltalk 80: The Language|Goldberg, Adele and Robson, David|9780201136883\n1998|Addison-Wesley Professional|The Design Patterns Smalltalk Companion|Alpert, Sherman and Brown, Kyle and Woolf, Bobby|9780201184624\n2015|Springer Vieweg|Programming Smalltalk – Object-Orientation from the Beginning: An introduction to the principles of programming|Brauer, Johannes|9783658068233\n2015|Springer Vieweg|Programming Smalltalk – Object-Orientation from the Beginning: An introduction to the principles of programming|Brauer, Johannes|9783658068226\n1997|Prentice Hall|Object-Oriented Programming With C++ and Smalltalk|Drake, Caleb|9780131037977\n2015|ISTE Press - Elsevier|Object-oriented Programming with Smalltalk|Wertz, Harald|9781785480164\n1998|SIGS|The VisualAge for Smalltalk Primer Book With CD-ROM (SIGS: Advances in Object Technology, Series Number 16)|Li, Liwu|9780521646697\n2012|Springer Science & Business Media|Practical Smalltalk|Dan Shafer and Dean A. Ritz|9781461390671\n||Smalltalk Programming Language Family: Smalltalk, Squeak, Seaside, Ibm Visualage, Scratch, Gnu Smalltalk, Visual Smalltalk Enterprise, Aida]web|Books and LLC|9781155755953\n1995|Prima Pub|Smalltalk Programming For Windows|Dan Shafer|9781559587532\n1992|Reader Network|Advanced Windows Programming In Smalltalk|Dan Shafer|9781881513049\n||Smalltalk V Tutorial And Programming Handbook|Digitalk Inc|9781124086477\n20090417|Springer Nature|Grundkurs Smalltalk - Objektorientierung von Anfang an|Johannes Brauer|9783834893154\n2011||Articles On Smalltalk Programming Language Family, Including|Hephaestus Books|9781243303554\n1997/01/30|Brooks/Cole|Smalltalk in Brief: Introduction to Object-Oriented Software Development|Kenneth Alfred Lambert and Martin Osborne|9780314205568\n1998|Prentice Hall|World Wide Web Programming: Visualage For C++ And Smalltalk (visualage Series)|Andreas Bitterer and Marc Carrel-billiard|9780136124665\n1987|MIT Press|The Design and Evaluation of a High Performance Smalltalk System|David M. Ungar|9780262210102\n1995|Premier|Ibm Smalltalk Programming For Windows And Os/2/book And Disk|Shafer and Dan and Herndon and Scott|9781559587495\n1996|Sigs|Developing Visual Programming Applications Using Smalltalk (sigs: Advances In Object Technology)|Michael Linderman|9780135692295\n1996|Sigs|Developing Visual Programming Applications Using Smalltalk (sigs: Advances In Object Technology)|Michael Linderman|9781884842283\n1992|Premier Pr|Smalltalk Programming For Windows (prima Practical Programming Series/book And 3 1/2 Disk)|Dan Shafer and Scott Herndon and Laurence Rozier|9781559582377", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1984|Making smalltalk a database system|10.1145/602259.602300|420|14|G. Copeland and D. Maier|959baa1fe387cbabdcc729411be7bb935f56d8cb\n2011|How developers use the dynamic features of programming languages: the case of smalltalk|10.1145/1985441.1985448|53|4|Oscar Callaú and R. Robbes and É. Tanter and D. Röthlisberger|0b15fdbf3ef064d80d9d5d4de25f5fd198e731bb\n1980|Extending object oriented programming in Smalltalk|10.1145/800087.802792|51|2|I. Goldstein and D. Bobrow|0ca3ea0a470fcbd8078ea5ea6144e07b494fdc15\n1991|Teaching Smalltalk as a first programming language|10.1145/107004.107046|27|0|Suzanne Skublics and P. White|e8b86f220f076eb4dd0e47a1f801259a69e18c85\n1987|Smalltalk as a programming language for robotics?|10.1109/ROBOT.1987.1087894|17|0|W. LaLonde and Dave A. Thomas and Kent Johnson|c7513ebd5a282d6b062e379f2997a1e4bd98b0df\n1983|The object oriented pre-compiler: programming Smalltalk 80 methods in C language|10.1145/948093.948095|16|0|Brad J. Cox|8c27238c4278c72801bc0166242a95f100c7d957\n1987|Object-oriented programming in Smalltalk and ADA|10.1145/38765.38826|15|0|E. Seidewitz|011b1daad5226830a6ae1be4bd0443c5e4e1fd6a\n2011|PHANtom: a modern aspect language for Pharo Smalltalk|10.1145/2166929.2166939|10|1|J. Fabry and Daniel Galdames|dda4fc4ab5d99522fb446c6fd202ba415f343ee8\n2012|Efficient Method Lookup Customization for Smalltalk|10.1007/978-3-642-30561-0_10|6|0|J. Vraný and Jan Kurs and Claus Gittinger|7f8e57223bea959247929b01ff9c5bc81dec99a3\n2006|Scl: A Simple, Uniform and Operational Language for Component-Oriented Programming in Smalltalk|10.1007/978-3-540-71836-9_5|5|0|L. Fabresse and C. Dony and M. Huchard|ef9d9e944b0da3fa81c23eb99d9917397669822e\n2012|On the integration of Smalltalk and Java: practical experience with STX:LIBJAVA|10.1145/2448963.2448968|4|0|Marcel Hlopko and Jan Kurs and J. Vraný and Claus Gittinger|0907378a9af8c4759c857c2974baa9f7d1375594\n2013|On planning an evaluation of the impact of identifier names on the readability and quality of smalltalk programs|10.1109/USER.2013.6603079|3|0|Mircea Lungu and Jan Kurs|a117cfdf256c0d57a6148efcb39960914f0fe040\n1993|A visual programming environment for Smalltalk|10.1109/VL.1993.269599|3|0|I. Borne|98ac5d8473c91499be4b47d296d7c15d3f2f55b7\n2010|Programming For Pre College Education Using Squeak Smalltalk|10.18260/1-2--16161|3|1|Kathryn N. Rodhouse and Benjamin Cooper and S. Watkins|6a372109ad0086d5d32e3c4121884520cfd8fa4e\n2012|Refactoring support for Smalltalk using static type inference|10.1145/2448963.2448964|1|0|Martin Unterholzner|fe3d3fd09a89d96f1340e656cda2fb4550080e85\n2011|A Smalltalk implementation of Exil, a component-based programming language|10.1145/2166929.2166932|1|1|P. Spacek and C. Dony and Chouki Tibermacine and L. Fabresse|1097d8c549654b2308a6ae2c559da511b00b6f1e" }, "smalltalkhub-pm": { "title": "smalltalkhub-pm", "appeared": 2011, "type": "packageManager", "website": "http://smalltalkhub.com/", "domainName": { "registered": 2011, "name": "smalltalkhub.com" }, "packageCount": 4534, "forLanguages": [ "smalltalk" ] }, "smallvdm": { "title": "SmallVDM", "appeared": 1993, "type": "pl", "reference": [ "http://www.lbd.dcc.ufmg.br/colecoes/sbes/1991/0016.pdf" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1749", "centralPackageRepositoryCount": 0 }, "smart": { "title": "SMART", "appeared": 1964, "type": "pl", "reference": [ "https://semanticscholar.org/paper/cb1d8b313870c05983bee1c94c2e799bcdc63f29" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2511", "wordRank": 2207, "centralPackageRepositoryCount": 0 }, "smartgameformat": { "title": "SmartGameFormat", "appeared": 1987, "type": "pl", "website": "https://www.red-bean.com/sgf/", "pygmentsHighlighter": { "filename": "sgf.py", "fileExtensions": [ "sgf" ], "id": "SmartGameFormat" } }, "smarts": { "title": "SMILES arbitrary target specification", "appeared": 1987, "type": "textDataFormat", "creators": [ "David Weininger" ], "reference": [ "https://pubs.acs.org/doi/10.1021/ci00057a005" ], "example": [ "[$([NH2][CX4]),$([NH]([CX4])[CX4]),$([NX3]([CX4])([CX4])[CX4])]" ], "wikipedia": { "summary": "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.", "backlinksCount": 6, "pageId": 14837266, "dailyPageViews": -1, "appeared": 1962, "url": "https://en.wikipedia.org/wiki/SMILES_arbitrary_target_specification" }, "isbndb": "" }, "smartsheet-app": { "title": "Smartsheet", "appeared": 2006, "type": "application", "wikipedia": { "summary": "Smartsheet is a software as a service (SaaS) application for collaboration and work management that is developed and marketed by Smartsheet Inc. It is used to assign tasks, track project progress, manage calendars, share documents, and manage other work, using a spreadsheet-like user interface.", "backlinksCount": 77, "pageId": 48461551, "dailyPageViews": 270, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Smartsheet" } }, "smarty": { "title": "Smarty", "appeared": 2006, "type": "template", "creators": [ "Monte Ohrt", "Messju Mohr", "Uwe Tews" ], "website": "http://www.smarty.net", "domainName": { "registered": 2002, "awisRank": { "2022": 119996 }, "name": "smarty.net" }, "example": [ "\n\n\n \n {$title_text|escape}\n\n\n {* This is a little comment that won't be visible in the HTML source *}\n{$body_html}\n \n" ], "wikipedia": { "example": [ "define('SMARTY_DIR', 'smarty-2.6.22/');\nrequire_once(SMARTY_DIR . 'Smarty.class.php');\n\n$smarty = new Smarty();\n$smarty->template_dir = './templates/';\n$smarty->compile_dir = './templates/compile/';\n\n$smarty->assign('title_text', 'TITLE: This is the Smarty basic example ...');\n$smarty->assign('body_html', '

BODY: This is the message set using assign()

');\n\n$smarty->display('index.tpl');" ], "related": [ "php", "isbn", "twig" ], "summary": "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.", "pageId": 774939, "dailyPageViews": 63, "created": 2018, "backlinksCount": 67, "revisionCount": 4, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Smarty_(template_engine)" }, "githubLanguage": { "fileExtensions": [ "tpl" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nhelm charts https://github.com/helm.png https://github.com/helm/charts Smarty #ccc 9872 9946 429 \"Curated applications for Kubernetes\"\nbitnami charts https://github.com/bitnami.png https://github.com/bitnami/charts Smarty #ccc 596 328 51 \"Helm Charts\"\nconfluentinc cp-helm-charts https://github.com/confluentinc.png https://github.com/confluentinc/cp-helm-charts Smarty #ccc 286 251 19 \"The Confluent Platform Helm charts enable you to deploy Confluent Platform services on Kubernetes for development, test, and proof of concept environments.\"\nistio installer https://github.com/istio.png https://github.com/istio/installer Smarty #ccc 81 65 7 \"A modular, a-la-carte installer for Istio components\"\ncloudnativeapp charts https://github.com/cloudnativeapp.png https://github.com/cloudnativeapp/charts Smarty #ccc 120 49 48 \"Localized Helm charts from Helm Hub to China\"\nAnankke SSPanel-Uim https://github.com/Anankke.png https://github.com/Anankke/SSPanel-Uim Smarty #ccc 2661 1683 224 \"SSPanel V3 魔改再次修改版\"\nfluxcd flux-get-started https://github.com/fluxcd.png https://github.com/fluxcd/flux-get-started Smarty #ccc 32 631 6 \"Getting started with Flux and the Helm Operator\"", "trendingProjectsCount": 8, "type": "programming", "aceMode": "smarty", "codemirrorMode": "smarty", "codemirrorMimeType": "text/x-smarty", "tmScope": "text.html.smarty", "repos": 31402, "id": "Smarty" }, "githubBigQuery": { "repos": 17325, "users": 14285, "id": "Smarty" }, "codeMirror": "smarty", "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "tpl" ], "id": "Smarty" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 8, "commitCount": 34, "url": "https://github.com/textmate/php-smarty.tmbundle" }, "tiobe": { "id": "Smarty" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2006|Packt Publishing|Smarty PHP Template Programming And Applications|Hasin Hayder and J. P. Maia and Lucian Gheorghe|9781904811404\n2006-04-30|Packt Publishing|Smarty PHP Template Programming and Applications|Hasin Hayder and Joao Prado Maia and Lucian Gheorghe|9781847190284\n20070619|O'Reilly Media, Inc.|PHP and Smarty on Large-Scale Web Development|Bruno Pedro|9780596513795\n2006|Packt Pub.|Smarty: PHP template programming and applications : a step-by-step guide to building PHP web sites and applications using the Smarty templating engine|Prado Maia, João.|9781904811404" }, "smdl": { "title": "SMDL", "appeared": 2010, "type": "pl", "reference": [ "https://www.semanticscholar.org/paper/Standard-Music-Description-Language-%28-SMDL-%29-ISO-%2F/a57cc9b150280aa50a7c19dffe091e1ec42ae5a5" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6456", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "smile": { "title": "Smile data interchange format", "appeared": 2010, "type": "binaryDataFormat", "creators": [ "Tatu Saloranta" ], "githubRepo": { "firstCommit": 2017, "stars": 64, "forks": 16, "subscribers": 5, "created": 2017, "updated": 2022, "description": "New home for Smile format (https://en.wikipedia.org/wiki/Smile_(data_interchange_format))", "issues": 2, "url": "https://github.com/FasterXML/smile-format-specification" }, "wikipedia": { "summary": "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.", "backlinksCount": 36, "pageId": 42337945, "dailyPageViews": 48, "url": "https://en.wikipedia.org/wiki/Smile_(data_interchange_format)" } }, "smiles-format": { "title": "Smiles", "appeared": 1988, "type": "textDataFormat", "standsFor": "Simplified molecular-input line-entry system", "fileExtensions": [ "smi" ], "example": [ "CC(=O)NCCC1=CNc2c1cc(OC)cc2\nCC(=O)NCCc1c[nH]c2ccc(OC)cc12" ], "wikipedia": { "summary": "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).", "backlinksCount": 17590, "pageId": 28569, "dailyPageViews": 413, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/Simplified_molecular-input_line-entry_system" }, "isbndb": "" }, "smithy": { "title": "Smithy", "appeared": 2016, "type": "pl", "website": "https://smithy.io/", "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "smithy.py", "fileExtensions": [ "smithy" ], "id": "Smithy" } }, "smoke": { "title": "SMOKE", "appeared": 1992, "type": "pl", "reference": [ "https://www.semanticscholar.org/paper/The-SmOKE-Music-Representation%2C-Description-and-Pope/6d0d47dccc92d7baea5fe3d1f90a1c106b8562c2" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6457", "wordRank": 4236, "centralPackageRepositoryCount": 0 }, "smolcs": { "title": "SMoLCS", "appeared": 1986, "type": "pl", "reference": [ "https://www.osti.gov/biblio/5384759" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1275", "centralPackageRepositoryCount": 0 }, "smpl": { "title": "Semantic Patch Language", "appeared": 2006, "type": "grammarLanguage", "creators": [ "Yoann Padioleau" ], "website": "http://coccinelle.lip6.fr/", "domainName": { "name": "coccinelle.lip6.fr" }, "githubRepo": { "firstCommit": 2006, "stars": 489, "forks": 95, "subscribers": 30, "created": 2010, "updated": 2022, "description": "Source code of the Coccinelle project (mirror of the main Coccinelle repository located at Inria)", "issues": 205, "url": "https://github.com/coccinelle/coccinelle" }, "repoStats": { "firstCommit": 2006, "commits": 7329, "committers": 79, "files": 5029 }, "wikipedia": { "summary": "Coccinelle (French for ladybug) is an open-source utility for matching and transforming the source code of programs written in the C programming language.", "backlinksCount": 13, "pageId": 31592209, "dailyPageViews": 20, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/Coccinelle_(software)" }, "githubLanguage": { "type": "programming", "fileExtensions": [ "cocci" ], "aceMode": "text", "tmScope": "source.smpl", "aliases": [ "coccinelle" ], "repos": 15, "id": "SmPL" }, "githubBigQuery": { "repos": 120, "users": 114, "id": "SmPL" }, "isbndb": "", "semanticScholar": "" }, "smsl": { "title": "SMSL", "appeared": 1995, "type": "pl", "reference": [ "http://xml.coverpages.org/smslFerris0.html" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2513", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "smt": { "title": "SMT", "appeared": 2003, "type": "pl", "description": "Common input and output languages for SMT solvers.", "website": "http://smtlib.cs.uiowa.edu/language.shtml", "standsFor": "Satisfiability Modulo Theories", "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "; Getting assertions\n(set-option :produce-assertions true)\n(set-logic QF_UF)\n(declare-const p Bool) (declare-const q Bool)\n(push 1)\n (assert (or p q))\n (push 1)\n (assert (not q))\n (get-assertions)\n ; ((or p q)\n ; (not q)\n ; )\n (pop 1)\n (get-assertions)\n ; ((or p q))\n (pop 1)\n (get-assertions)\n ; ()\n(exit)" ], "githubLanguage": { "fileExtensions": [ "smt2", "smt" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "boolector", "cvc4", "mathsat5", "opensmt", "smtinterpol", "smt-rat", "stp", "verit", "yices2", "z3" ], "aceMode": "text", "tmScope": "source.smt", "repos": 582, "id": "SMT" }, "githubBigQuery": { "repos": 149, "users": 130, "id": "SMT" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2015, "committerCount": 3, "commitCount": 31, "sampleCount": 4, "example": [ "(set-logic QF_LIA)\n(set-info :source | SMT-COMP'06 organizers |)\n(set-info :smt-lib-version 2.0)\n(set-info :category \"check\")\n(set-info :status unsat)\n(set-info :notes |This benchmark is designed to check if the DP supports bignumbers.|)\n(declare-fun x1 () Int)\n(declare-fun x2 () Int)\n(declare-fun x3 () Int)\n(declare-fun x4 () Int)\n(declare-fun x5 () Int)\n(declare-fun x6 () Int)\n(assert (and (or (>= x1 1000) (>= x1 1002)) \n (or (>= x2 (* 1230 x1)) (>= x2 (* 1003 x1))) \n\t\t\t (or (>= x3 (* 1310 x2)) (>= x3 (* 1999 x2)))\n\t\t\t (or (>= x4 (* 4000 x3)) (>= x4 (* 8000 x3))) \n\t\t\t (or (<= x5 (* (- 4000) x4)) (<= x5 (* (- 8000) x4)))\n\t\t\t (or (>= x6 (* (- 3) x5)) (>= x6 (* (- 2) x5))) (< x6 0)))\n(check-sat)\n(exit)" ], "url": "https://github.com/SRI-CSL/SMT.tmbundle.git" }, "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2011|Scala to the Power of Z3: Integrating SMT and Programming|10.1007/978-3-642-22438-6_30|40|0|A. Köksal and Viktor Kuncak and Philippe Suter|4a0eb42ded1878f39539aceca207f55dea2d8fbe\n2016|SMT Solving for Functional Programming over Infinite Structures|10.4204/EPTCS.207.3|19|2|Bartek Klin and Michal Szynwelski|cb714bd967b3c358fa09b7a53f22e2263733ab45\n2012|SMT in Verification, Modeling, and Testing at Microsoft|10.1007/978-3-642-39611-3_3|3|0|N. Bjørner|7e3016d5a49d83bed334c62de6a077e5f4d35ea9\n2020|Effective Encodings of Constraint Programming Models to SMT|10.1007/978-3-030-58475-7_9|3|0|E. Davidson and Ozgur Akgun and Joan Espasa and P. Nightingale|b8eb4528ac0d6d7a32ebbf18bc4aa30c3cb1f1b1\n2020|Inter-theory dependency analysis for SMT string solvers|10.1145/3428260|2|1|Minh-Thai Trinh and D. Chu and J. Jaffar|2e4f01ec5c2aea7a759445024a25c8fc866dfacc\n2020|Using SMT Solver and Logic Puzzles for Teaching Computational Logics in Discrete Mathematics Class|10.1145/3328778.3372686|1|0|Shin Hong|23be6c89f123ecb7e590aa023618518241bba3e2\n2019|Programming Behavioral Test Models for SMT Solving in Scala|10.1109/ICSTW.2019.00032|1|0|B. Aichernig and Benedikt Maderbacher and Stefan Tiran|d5130df1d0dffd54c5eba84255ef93804324de92" }, "smtp": { "title": "SMTP", "appeared": 1982, "type": "protocol", "documentation": [ "https://www.rfc-editor.org/rfc/rfc5321" ], "standsFor": "Simple Mail Transfer Protocol", "aka": [ "smtp" ], "wikipedia": { "example": [ "S: 220 smtp2.example.com ESMTP Postfix\nC: EHLO bob.example.com\nS: 250-smtp2.example.com Hello bob.example.org [192.0.2.201]\nS: 250-SIZE 14680064\nS: 250-PIPELINING\nS: 250 HELP" ], "related": [ "ftp", "http", "tls", "tcp", "udp", "ascii", "mime", "utf-8", "mbox", "doi" ], "summary": "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.", "pageId": 27675, "dailyPageViews": 2662, "created": 2001, "backlinksCount": 794, "revisionCount": 1436, "appeared": 1982, "url": "https://en.wikipedia.org/wiki/Simple_Mail_Transfer_Protocol" }, "fileType": "na", "wordRank": 9812, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgrammer's Guide to Internet Mail: Smtp, Pop, Imap, and LDAP|1999|John Rhoton|1056515|4.00|6|1", "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|E-Mail Client Multiplatform for the Transfer of Information Using the SMTP Java Protocol Without Access to a Browser|10.1007/978-3-319-77703-0_109|5|0|Liliana Enciso and Ruben Baez and Alvaro Maldonado and Elmer Zelaya-Policarpo and P. Quezada-Sarmiento|20f4749d79e5ee96d45b4722aaff505de1f648b3" }, "smx-computer-language": { "title": "SMX", "appeared": 1998, "type": "pl", "wikipedia": { "example": [ "%expand%\n%if(%not(%exists(/tmp/gbook.sq3))\n ,%sql(sqlite:/tmp/gbook.sq3,CREATE TABLE guests (name text, comment text))\n)\n%if(%and(%form(name),%form(comment))\n ,%sql(sqlite:/tmp/gbook.sq3,\"INSERT INTO guests (name, comment) VALUES (%sqlq(%form(name)),%sqlq(%form(comment)))\")\n)\n%sql(sqlite:/tmp/gbook.sq3,SELECT * FROM guests\n ,

%html-quote(%col(name)) said %html-quote(%col(comment))

\n

\n

\n
Name: \n
Comment: \n
\n
\n)" ], "related": [ "perl", "php", "sql" ], "summary": "SMX (from Server Macro Expansion) is a macro processing language designed to embed macros in web pages. Originally shipped with the popular Internet Factory's Commerce Builder software, it has been ported as an Apache module.", "created": 2005, "backlinksCount": 16, "pageId": 2231975, "revisionCount": 56, "dailyPageViews": 10, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/SMX_%28computer_language%29" }, "centralPackageRepositoryCount": 0 }, "snakemake": { "title": "snakemake", "appeared": 2012, "type": "pl", "description": "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.", "reference": [ "https://academic.oup.com/bioinformatics/article/28/19/2520/290322" ], "example": [ "SAMPLES = \"100 101 102 103\".split()\n\nREF = \"hg19.fa\"\n\nrule all:\n\n input: \"{sample}.coverage.pdf\".format(sample = sample)\n\n    for sample in SAMPLES\n\nrule fastq_to_sai:\n\n  input: ref = REF, reads = \"{sample}.{group}.fastq\"\n\n  output: temp(\"{sample}.{group}.sai\")\n\n  shell: \"bwa aln {input.ref} {input.reads} > {output}\"\n\nrule sai_to_bam:\n\n  input: REF, \"{sample}.1.sai\", \"{sample}.2.sai\",\n\n     \"{sample}.1.fastq\", \"{sample}.2.fastq\"\n\n  output: protected(\"{sample}.bam\")\n\n  shell: \"bwa sampe {input} | samtools view -Sbh - > {output}\"\n\nrule remove_duplicates:\n\n  input: \"{sample}.bam\"\n\n  output: \"{sample}.nodup.bam\"\n\n  shell: \"samtools rmdup {input} {output}\"\n\nrule plot_coverage_histogram:\n\n  input: \"{sample}.nodup.bam\"\n\n  output: hist = \"{sample}.coverage.pdf\"\n\n  run:\n\n    from matplotlib.pyplot import hist, savefig\n\n    hist(list(map(int,\n\n      shell(\"samtools mpileup {input} | cut -f4\",\n\n      iterable = True))))\n\n    savefig(output.hist)" ], "centralPackageRepositoryCount": 0 }, "snap": { "title": "Snap!", "appeared": 2011, "type": "pl", "creators": [ "Brian Harvey" ], "wikipedia": { "related": [ "javascript", "squeak", "scratch", "scheme", "logo", "smalltalk", "python", "c", "linux", "ios" ], "summary": "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.", "pageId": 34236881, "created": 2011, "backlinksCount": 28, "revisionCount": 101, "dailyPageViews": 77, "appeared": 2011, "fileExtensions": [ "ypr", "ysp", "xml" ], "url": "https://en.wikipedia.org/wiki/Snap!_(programming_language)" }, "fileType": "text", "wordRank": 7321, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "snaptag": { "title": "SnapTag", "appeared": 2011, "type": "barCodeFormat", "wikipedia": { "summary": "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.", "backlinksCount": 6, "pageId": 34198843, "dailyPageViews": 28, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/SnapTag" } }, "snbt": { "title": "SNBT", "appeared": 2011, "type": "pl", "website": "https://minecraft.fandom.com/wiki/NBT_format", "pygmentsHighlighter": { "filename": "mcfunction.py", "fileExtensions": [ "snbt" ], "id": "SNBT" } }, "snit": { "title": "Snit", "appeared": 2002, "type": "pl", "wikipedia": { "related": [ "tcl" ], "summary": "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", "created": 2018, "backlinksCount": 4, "pageId": 56734123, "revisionCount": 13, "dailyPageViews": 4, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Snit" }, "centralPackageRepositoryCount": 0 }, "snobat": { "title": "SNOBAT", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/564741ecb91fb8f1d5d5c2e9a6d65d5afbde36d9" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3767", "centralPackageRepositoryCount": 0 }, "snobol": { "title": "SNOBOL", "appeared": 1962, "type": "pl", "creators": [ "David J. Farber", "Ralph E. Griswold" ], "website": "http://www.snobol4.org", "documentation": [ "https://buildmedia.readthedocs.org/media/pdf/snobol/stable/snobol.pdf" ], "country": [ "United States" ], "domainName": { "registered": 2002, "name": "snobol4.org" }, "hasLineComments": { "example": "* A comment", "value": true }, "hasComments": { "example": "* A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "*" ] ], "printToken": [ [ "OUTPUT" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "OUTPUT = \"This program will ask you for personal names\"\n OUTPUT = \"until you press return without giving it one\"\n NameCount = 0 :(GETINPUT)\n AGAIN NameCount = NameCount + 1\n OUTPUT = \"Name \" NameCount \": \" PersonalName\n GETINPUT OUTPUT = \"Please give me name \" NameCount + 1 \n PersonalName = INPUT\n PersonalName LEN(1) :S(AGAIN)\n OUTPUT = \"Finished. \" NameCount \" names requested.\"\n END" ], "related": [ "spitbol", "icon", "lua", "comit", "trac", "javascript", "awk", "perl", "regex", "algol", "cobol", "prolog", "apl", "basic", "fortran", "c", "ada", "unicon" ], "summary": "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.", "pageId": 29515, "dailyPageViews": 64, "created": 2002, "backlinksCount": 116, "revisionCount": 322, "appeared": 1962, "url": "https://en.wikipedia.org/wiki/SNOBOL" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/snobol", "pygmentsHighlighter": { "filename": "snobol.py", "fileExtensions": [ "snobol" ], "id": "Snobol" }, "helloWorldCollection": [ "* Hello World in Snobol\n\n OUTPUT = \"Hello World!\"\n" ], "leachim6": { "filepath": "s/SNOBOL", "example": [ " OUTPUT = \"Hello World\"\nEND\n" ], "id": "SNOBOL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Snobol", "rijuRepl": { "example": [ " OUTPUT = \"Hello, world!\"\nEND\n" ], "id": "https://riju.codes/snobol" }, "hopl": "https://hopl.info/showlanguage.prx?exp=171", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Snobol 4 Programming Language||Ralph E. Griswold|4019527|3.80|5|1\nThe Snobol 4 Programming Language|1971|Andrew Clues|766467|3.00|1|0\nSnobol Programming for the Humanities|1985|Susan Hockey|5060467|4.00|1|0\nThe Programmer's Introduction to Snobol|1976|Ward Douglas Maurer|6455209|0.0|0|0\nSnobol: An Introduction to Programming (Hayden computer programming series)|1975|Peter R Newsted|13307178|2.50|2|1\nEncyclopedia of Microcomputers: Volume 15 - Reporting on Parallel Software to Snobol||Allen Kent|42221988|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1971|Prentice-Hall|The SNOBOL 4 programming language (Automatic Computation)|Ralph E. Griswold and J. F. Poage and I. P. Polonsky|9780138153731\n1968|Prentice-hall|The Snobol 4 Programming Language|Ralph E Griswold|9780138153571\n1986-03-06T00:00:01Z|Oxford University Press|SNOBOL Programming for the Humanities|Hockey, Susan|9780198246763\n1976|Elsevier Science|The Programmer's Introduction to SNOBOL (Programming Languages Series, 3) (Elsevier Computer Science Library)|Ward Douglas Maurer|9780444001726\n1986|Oxford University Press|Snobol Programming For The Humanities|Susan Hockey|9780198246756", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1964|SNOBOL , A String Manipulation Language|10.1145/321203.321207|119|2|D. Farber and R. Griswold and I. P. Polonsky|30901b8eb11da71262fd343114efcb42c5c486fa\n1968|The SNOBOL 4 programming language|10.2307/2004908|57|1|R. Griswold|f5022fa2514ea495dd2da3f0ea81649ba1ac1faa\n1978|A history of the SNOBOL programming languages|10.1145/960118.808393|4|0|R. Griswold|4249a854acc44740b5f7d45782bfa6c63eb13286\n1978|ACM SIGPLAN history of programming languages conference SNOBOL language summary|10.1145/960118.808392|2|0|Michael D. Shapiro|d13d6d105ce3b5aaad7e1af1d6b85eb9d207b51d" }, "snobol3": { "title": "SNOBOL3", "appeared": 1996, "type": "pl", "reference": [ "https://onlinelibrary.wiley.com/doi/abs/10.1002/j.1538-7305.1966.tb04224.x", "https://www.jstor.org/stable/30199238", "https://www.snobol3.org/" ] }, "snobol4": { "title": "SNOBOL4", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/32d6dba909eeb71b93305b407c0332fce43ecc7b" ], "supersetOf": [ "snobol3" ], "hasComments": { "example": "", "value": true }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SNOBOL4", "tryItOnline": "snobol4", "hopl": "https://hopl.info/showlanguage.prx?exp=303", "centralPackageRepositoryCount": 0 }, "snoop": { "title": "SNOOP", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/57dbda987a11b2ea83808638d35230306ba1120e" ], "wikipedia": { "summary": "\"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", "backlinksCount": 12, "pageId": 2117831, "dailyPageViews": 18, "created": 2005, "url": "https://en.wikipedia.org/wiki/Snoop" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1436", "centralPackageRepositoryCount": 0 }, "snostorm": { "title": "Snostorm", "appeared": 1984, "type": "pl", "reference": [ "http://www.fredosaurus.com/notes-snostorm/snostorm-overview.html" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7197", "centralPackageRepositoryCount": 0, "isbndb": "" }, "snowball-programming-language": { "title": "Snowball", "appeared": 1971, "type": "pl", "wikipedia": { "related": [ "snobol", "java", "ascii", "c" ], "summary": "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' \".", "created": 2004, "backlinksCount": 9, "pageId": 919808, "revisionCount": 32, "dailyPageViews": 10, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Snowball_%28programming_language%29" }, "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "sbl" ], "id": "Snowball" }, "centralPackageRepositoryCount": 0 }, "snowman-decompiler": { "title": "Snowman", "appeared": 2015, "type": "decompiler", "githubRepo": { "firstCommit": 2015, "stars": 2183, "forks": 308, "subscribers": 118, "created": 2015, "updated": 2022, "description": "Snowman decompiler", "issues": 98, "url": "https://github.com/yegord/snowman" }, "leachim6": { "filepath": "s/Snowman.sm", "fileExtensions": [ "sm" ], "example": [ "~\"Hello World\"sPvG\n" ], "id": "Snowman" } }, "snql": { "title": "SNQL: A Social Network Query and Transformation Language", "appeared": 2011, "type": "queryLanguage", "reference": [ "http://ceur-ws.org/Vol-749/paper18.pdf" ], "example": [ "CONSTRUCT CP1\n WHERE EP2 FILTER ((A3 != A4) AND (A3 = A1 OR A3 = A2) AND\n (A4 = A1 OR A4 = A5))\n AND (TC(A1, A2, EP1) WITH L1=’John’)\n AND (TC(A1, A5, EP3) WITH L1=’John’)\nFROM FriendshipNetwork" ], "centralPackageRepositoryCount": 0 }, "soap": { "title": "SOAP", "appeared": 1998, "type": "xmlFormat", "creators": [ "Dave Winer", "Don Box", "Bob Atkinson", "Mohsen Al-Ghosein" ], "documentation": [ "https://knowledge.channeladvisor.com/kc?id=kb_article&sysparm_article=KB0018150&sys_kb_id=b02d13c91bd5d1d42d9eea40604bcb2e&spa=1" ], "standsFor": "Simple Object Access Protocol", "wikipedia": { "example": [ "POST /InStock HTTP/1.1\nHost: www.example.org\nContent-Type: application/soap+xml; charset=utf-8\nContent-Length: 299\nSOAPAction: \"http://www.w3.org/2003/05/soap-envelope\"\n\n\n\n \n \n \n \n GOOGLE\n \n \n" ], "related": [ "http", "smtp", "linux", "xml", "tcp", "wddx", "rfc", "wsdl", "tls", "json", "rest" ], "summary": "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.", "pageId": 29215, "dailyPageViews": 2103, "created": 2001, "backlinksCount": 752, "revisionCount": 1982, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/SOAP" }, "indeedJobs": { "2022": 7493, "query": "soap language" }, "fileType": "text", "wordRank": 5253, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2002|O'Reilly Media|Programming Web Services With SOAP|James Snell and Doug Tidwell and Pavel Kulchenko|9780596000950\n2000|Microsoft Press|XML and Soap Programming for BizTalk Servers (DV-MPS Programming)|Travis, Brian E|9780735611269\n2012|McFarland & Company, Incorporated Publishers|Soap Operas Worldwide: Cultural and Serial Realities|Marilyn J. Matelski|9780786472802\n2002|O'Reilly Media|Java and SOAP|Englander, Robert|9780596001759\n2003|Addison Wesley Publishing Company|J2EE Web Services: XML SOAP WSDL UDDI WS-I JAX-RPC JAXR SAAJ JAXP|Monson-Haefel, Richard|9780321146182\n2010|University Press of Mississippi|The Survival of Soap Opera: Transformations for a New Media Era||9781604737165\n2004|Rowman & Littlefield Publishers|The Soap Opera Paradigm: Television Programming and Corporate Priorities|Wittebols, James H.|9780742520028\n2002|Sybex Inc|SOAP Programming with Java|Brogden, Bill and Brogden, William B.|9780782129281\n1998|McFarland Publishing|Soap Operas Worldwide: Cultural and Serial Realities|Matelski, Marilyn J.|9780786405572\n||Advanced Soap Programming|Adams and Ryan|9780596003296\n20020520|O'Reilly Media, Inc.|Java and SOAP|Robert Englander|9780596515638", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2003|Using SOAP and .NET Web Service to build SCORM RTE and LMS|10.1109/AINA.2003.1192913|28|4|T. Shih and Wen-Chih Chang and Nigel H. Lin and Louis H. Lin and Hun-Hui Hsu and C. Hsieh|803cf64d6eeff0275e575582ab81b7108f8902a8\n2017|Investigations On Some Aspects of Reliability of Content Based Routing SOAP based Windows Communication Foundation Services|10.4018/IJIRR.2017010102|10|0|S. Medhi and A. Bora and T. Bezboruah|bececc6bd005df2a6cae40c8046cc4397241b531\n1973|Babel and SOAP applications of extensible compilers|10.1002/spe.4380030105|7|0|R. Scowen|46af397f66815b344043a1948e525f1ba93da7c9\n2004|Efficient SOAP processing in embedded systems|10.1109/ECBS.2004.1316691|7|0|J. Janecek|513297da0006bcebf35fd31674c51b15e71de074\n2004|On the Performance of SOAP in a Non-trivial Peer-to-Peer Experiment|10.1007/978-3-540-24848-4_14|2|0|T. V. Cutsem and S. Mostinckx and W. Meuter and J. Dedecker and T. D'Hondt|46cc9de5ea190504115f7125e51fd700945701bb\n2007|A Comparative Performance Evaluation of Different Implementations of the SOAP Protocol.|10.1109/ECOWS.2007.16|2|0|José A. García and Roi Blanco and Antonio Blanco and J. París|eec1add1eff3ce46c3f5c5b5f8546048ab0f0d53\n2010|Performance Evaluation for SOAP and RFC in SAP Netweaver Platform|10.1109/ICWS.2010.114|1|0|Z. Cao and R. Jandhyala and Shiva Koduvayur|dc676ab52f397f4cb4994fe9f732d27842efafec\n2018|Analisis dan Perancangan Sistem Mediation dengan Protokol Soap pada Web Service untuk Mengintegrasikan Antar Sistem Informasi yang Berbeda Platform|10.31937/SI.V8I2.665|1|0|Muhamad Femy Mulya and Nofita Rismawati|73fa067903aa710f02efa59af7f4c60168a8f06d" }, "soaplang": { "title": "Symbolic Optimal Assembly Program", "appeared": 1955, "type": "assembly", "reference": [ "http://www.columbia.edu/cu/computinghistory/650.html" ], "aka": [ "SOAP" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "soar-ml": { "title": "Soar Markup Language", "appeared": 2014, "type": "xmlFormat", "reference": [ "http://web.eecs.umich.edu/~soar/tutorial16/Tutorial-2016-SW-sml.pdf" ], "aka": [ "SML" ], "semanticScholar": "" }, "social-networks-query-language": { "title": "SoQL", "appeared": 2009, "type": "queryLanguage", "description": "language for querying and creating data in social networks. The language is designed to meet the growing need of social networks participants to efficiently manage the large, and quickly growing, amounts of data available to them, as well as automate processes of creating new data.", "standsFor": "Social Networks Query language", "aka": [ "soql" ], "centralPackageRepositoryCount": 0 }, "socialite": { "title": "socialite", "appeared": 2015, "type": "pl", "website": "http://socialite-lang.github.io", "domainName": { "name": "socialite-lang.github.io" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n9316131|Query Language for Large-Scale Graph Analysis|http://socialite-lang.github.io/|2015-04-03 14:44:01 UTC|1428072241|wspeirs|0|2", "isbndb": "" }, "solaris-pm": { "title": "solaris-pm", "appeared": 2004, "type": "packageManager", "website": "http://pkg.oracle.com/solaris/release/en/index.shtml", "packageCount": 6444, "forLanguages": [ "solaris" ] }, "solaris": { "title": "Solaris", "appeared": 1992, "type": "os", "wikipedia": { "dailyPageViews": 1015, "url": "https://en.wikipedia.org/wiki/Solaris_(operating_system)" }, "packageRepository": [ "http://pkg.oracle.com/solaris/release/en/index.shtml" ] }, "solid": { "title": "solid", "appeared": 2013, "type": "pl", "githubRepo": { "firstCommit": 2013, "stars": 274, "forks": 17, "subscribers": 22, "created": 2013, "updated": 2022, "description": "A minimalist interpreted language, with a clean object model and a tiny VM.", "issues": 1, "url": "https://github.com/chameco/Solid" }, "repoStats": { "firstCommit": 2013, "commits": 88, "committers": 7, "files": 31 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n6427498|Show HN: Solid, a scripting language with a tiny VM|2013-09-22 18:48:11 UTC|1379875691|chameco|15|63", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1999|EUGENE: an optimisation model for integrated regional solid waste management planning|10.1504/IJEP.1999.002297|61|3|C. Berger and G. Savard and A. Wizere|a7ccd8c1a62b4867f162ab4753dbe28a0550bd61\n1992|Programming language for solid variational geometry|10.1016/0010-4485(92)90062-F|27|0|A. Paoluzzi and C. Sansoni|2860d41d0aec1ec184c56f2aac2ce173c4c09e87\n2000|Gibbs energy minimization in gas + liquid + solid systems|10.1002/(SICI)1096-987X(200003)21:4<247::AID-JCC1>3.0.CO;2-J|21|0|D. Ebel and M. Ghiorso and R. Sack and L. Grossman|b2e10a89654f9586ca3f24ed55a2399cd1a69ada\n2015|Draining the Swamp: Micro Virtual Machines as Solid Foundation for Language Development|10.4230/LIPIcs.SNAPL.2015.321|14|1|Kunshan Wang and Yi Lin and S. Blackburn and Michael Norrish and Antony Lloyd Hosking|ca923347fcc26a84a49e38f9858e041628f2c9c6\n2019|Sound and robust solid modeling via exact real arithmetic and continuity|10.1145/3341703|5|0|Benjamin Sherman and Jesse Michel and Michael Carbin|8ca71ac5beaff0d916ab1959429f7bdeaf031ae6\n2015|AutoMT, a library for tensor operations and its performance evaluation for solid continuum mechanics applications|10.1299/MEL.15-00349|2|0|H. Kawai and Kohmei Satoh and Y. Yusa and Takayuki Uomoto and R. Shioya and H. Okada|bd4921c9d759df2da0c2cb5a9b964cbb53d53ae0\n2018|Application of MatLab for Solid Surface Analysis by Means of X-Ray Photoelectron Spectroscopy|10.1109/INFORINO.2018.8581857|1|0|A. Lubenchenko and O. I. Lubenchenko and D. A. Ivanov and I. Ivanova|2ae7effa66f2bf108e969d2ae3db9d0686f067e7\n2020|Automatic differentiation for solid mechanics|10.1007/s11831-019-09396-y|1|0|A. Vigliotti and F. Auricchio|0143a22a66d985840874071a2eacf3d8522c334a\n2018|Micro virtual machines: A solid foundation for managed language implementation|10.25911/5D612129114FA|1|1|Kunshan Wang|62daa20f4e86a24e6c883da5173ea0b00f1c8b1b" }, "solidity": { "title": "Solidity", "appeared": 2014, "type": "contractLanguage", "creators": [ "Christian Reitwiessner", "Alex Beregszaszi" ], "website": "http://github.com/ethereum/solidity", "webRepl": [ "https://ethereum.github.io/browser-solidity/" ], "releaseNotesUrl": "https://blog.soliditylang.org/category/releases/", "writtenIn": [ "cpp" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "pragma", "solidity", "contract", "library", "using", "struct", "function", "modifier", "constructor", "address", "string", "bool", "Int", "Uint", "Byte", "Fixed", "Ufixed", "int", "int8", "int16", "int24", "int32", "int40", "int48", "int56", "int64", "int72", "int80", "int88", "int96", "int104", "int112", "int120", "int128", "int136", "int144", "int152", "int160", "int168", "int176", "int184", "int192", "int200", "int208", "int216", "int224", "int232", "int240", "int248", "int256", "uint", "uint8", "uint16", "uint24", "uint32", "uint40", "uint48", "uint56", "uint64", "uint72", "uint80", "uint88", "uint96", "uint104", "uint112", "uint120", "uint128", "uint136", "uint144", "uint152", "uint160", "uint168", "uint176", "uint184", "uint192", "uint200", "uint208", "uint216", "uint224", "uint232", "uint240", "uint248", "uint256", "byte", "bytes", "bytes1", "bytes2", "bytes3", "bytes4", "bytes5", "bytes6", "bytes7", "bytes8", "bytes9", "bytes10", "bytes11", "bytes12", "bytes13", "bytes14", "bytes15", "bytes16", "bytes17", "bytes18", "bytes19", "bytes20", "bytes21", "bytes22", "bytes23", "bytes24", "bytes25", "bytes26", "bytes27", "bytes28", "bytes29", "bytes30", "bytes31", "bytes32", "fixed", "fixed0x8", "fixed0x16", "fixed0x24", "fixed0x32", "fixed0x40", "fixed0x48", "fixed0x56", "fixed0x64", "fixed0x72", "fixed0x80", "fixed0x88", "fixed0x96", "fixed0x104", "fixed0x112", "fixed0x120", "fixed0x128", "fixed0x136", "fixed0x144", "fixed0x152", "fixed0x160", "fixed0x168", "fixed0x176", "fixed0x184", "fixed0x192", "fixed0x200", "fixed0x208", "fixed0x216", "fixed0x224", "fixed0x232", "fixed0x240", "fixed0x248", "fixed0x256", "fixed8x8", "fixed8x16", "fixed8x24", "fixed8x32", "fixed8x40", "fixed8x48", "fixed8x56", "fixed8x64", "fixed8x72", "fixed8x80", "fixed8x88", "fixed8x96", "fixed8x104", "fixed8x112", "fixed8x120", "fixed8x128", "fixed8x136", "fixed8x144", "fixed8x152", "fixed8x160", "fixed8x168", "fixed8x176", "fixed8x184", "fixed8x192", "fixed8x200", "fixed8x208", "fixed8x216", "fixed8x224", "fixed8x232", "fixed8x240", "fixed8x248", "fixed16x8", "fixed16x16", "fixed16x24", "fixed16x32", "fixed16x40", "fixed16x48", "fixed16x56", "fixed16x64", "fixed16x72", "fixed16x80", "fixed16x88", "fixed16x96", "fixed16x104", "fixed16x112", "fixed16x120", "fixed16x128", "fixed16x136", "fixed16x144", "fixed16x152", "fixed16x160", "fixed16x168", "fixed16x176", "fixed16x184", "fixed16x192", "fixed16x200", "fixed16x208", "fixed16x216", "fixed16x224", "fixed16x232", "fixed16x240", "fixed24x8", "fixed24x16", "fixed24x24", "fixed24x32", "fixed24x40", "fixed24x48", "fixed24x56", "fixed24x64", "fixed24x72", "fixed24x80", "fixed24x88", "fixed24x96", "fixed24x104", "fixed24x112", "fixed24x120", "fixed24x128", "fixed24x136", "fixed24x144", "fixed24x152", "fixed24x160", "fixed24x168", "fixed24x176", "fixed24x184", "fixed24x192", "fixed24x200", "fixed24x208", "fixed24x216", "fixed24x224", "fixed24x232", "fixed32x8", "fixed32x16", "fixed32x24", "fixed32x32", "fixed32x40", "fixed32x48", "fixed32x56", "fixed32x64", "fixed32x72", "fixed32x80", "fixed32x88", "fixed32x96", "fixed32x104", "fixed32x112", "fixed32x120", "fixed32x128", "fixed32x136", "fixed32x144", "fixed32x152", "fixed32x160", "fixed32x168", "fixed32x176", "fixed32x184", "fixed32x192", "fixed32x200", "fixed32x208", "fixed32x216", "fixed32x224", "fixed40x8", "fixed40x16", "fixed40x24", "fixed40x32", "fixed40x40", "fixed40x48", "fixed40x56", "fixed40x64", "fixed40x72", "fixed40x80", "fixed40x88", "fixed40x96", "fixed40x104", "fixed40x112", "fixed40x120", "fixed40x128", "fixed40x136", "fixed40x144", "fixed40x152", "fixed40x160", "fixed40x168", "fixed40x176", "fixed40x184", "fixed40x192", "fixed40x200", "fixed40x208", "fixed40x216", "fixed48x8", "fixed48x16", "fixed48x24", "fixed48x32", "fixed48x40", "fixed48x48", "fixed48x56", "fixed48x64", "fixed48x72", "fixed48x80", "fixed48x88", "fixed48x96", "fixed48x104", "fixed48x112", "fixed48x120", "fixed48x128", "fixed48x136", "fixed48x144", "fixed48x152", "fixed48x160", "fixed48x168", "fixed48x176", "fixed48x184", "fixed48x192", "fixed48x200", "fixed48x208", "fixed56x8", "fixed56x16", "fixed56x24", "fixed56x32", "fixed56x40", "fixed56x48", "fixed56x56", "fixed56x64", "fixed56x72", "fixed56x80", "fixed56x88", "fixed56x96", "fixed56x104", "fixed56x112", "fixed56x120", "fixed56x128", "fixed56x136", "fixed56x144", "fixed56x152", "fixed56x160", "fixed56x168", "fixed56x176", "fixed56x184", "fixed56x192", "fixed56x200", "fixed64x8", "fixed64x16", "fixed64x24", "fixed64x32", "fixed64x40", "fixed64x48", "fixed64x56", "fixed64x64", "fixed64x72", "fixed64x80", "fixed64x88", "fixed64x96", "fixed64x104", "fixed64x112", "fixed64x120", "fixed64x128", "fixed64x136", "fixed64x144", "fixed64x152", "fixed64x160", "fixed64x168", "fixed64x176", "fixed64x184", "fixed64x192", "fixed72x8", "fixed72x16", "fixed72x24", "fixed72x32", "fixed72x40", "fixed72x48", "fixed72x56", "fixed72x64", "fixed72x72", "fixed72x80", "fixed72x88", "fixed72x96", "fixed72x104", "fixed72x112", "fixed72x120", "fixed72x128", "fixed72x136", "fixed72x144", "fixed72x152", "fixed72x160", "fixed72x168", "fixed72x176", "fixed72x184", "fixed80x8", "fixed80x16", "fixed80x24", "fixed80x32", "fixed80x40", "fixed80x48", "fixed80x56", "fixed80x64", "fixed80x72", "fixed80x80", "fixed80x88", "fixed80x96", "fixed80x104", "fixed80x112", "fixed80x120", "fixed80x128", "fixed80x136", "fixed80x144", "fixed80x152", "fixed80x160", "fixed80x168", "fixed80x176", "fixed88x8", "fixed88x16", "fixed88x24", "fixed88x32", "fixed88x40", "fixed88x48", "fixed88x56", "fixed88x64", "fixed88x72", "fixed88x80", "fixed88x88", "fixed88x96", "fixed88x104", "fixed88x112", "fixed88x120", "fixed88x128", "fixed88x136", "fixed88x144", "fixed88x152", "fixed88x160", "fixed88x168", "fixed96x8", "fixed96x16", "fixed96x24", "fixed96x32", "fixed96x40", "fixed96x48", "fixed96x56", "fixed96x64", "fixed96x72", "fixed96x80", "fixed96x88", "fixed96x96", "fixed96x104", "fixed96x112", "fixed96x120", "fixed96x128", "fixed96x136", "fixed96x144", "fixed96x152", "fixed96x160", "fixed104x8", "fixed104x16", "fixed104x24", "fixed104x32", "fixed104x40", "fixed104x48", "fixed104x56", "fixed104x64", "fixed104x72", "fixed104x80", "fixed104x88", "fixed104x96", "fixed104x104", "fixed104x112", "fixed104x120", "fixed104x128", "fixed104x136", "fixed104x144", "fixed104x152", "fixed112x8", "fixed112x16", "fixed112x24", "fixed112x32", "fixed112x40", "fixed112x48", "fixed112x56", "fixed112x64", "fixed112x72", "fixed112x80", "fixed112x88", "fixed112x96", "fixed112x104", "fixed112x112", "fixed112x120", "fixed112x128", "fixed112x136", "fixed112x144", "fixed120x8", "fixed120x16", "fixed120x24", "fixed120x32", "fixed120x40", "fixed120x48", "fixed120x56", "fixed120x64", "fixed120x72", "fixed120x80", "fixed120x88", "fixed120x96", "fixed120x104", "fixed120x112", "fixed120x120", "fixed120x128", "fixed120x136", "fixed128x8", "fixed128x16", "fixed128x24", "fixed128x32", "fixed128x40", "fixed128x48", "fixed128x56", "fixed128x64", "fixed128x72", "fixed128x80", "fixed128x88", "fixed128x96", "fixed128x104", "fixed128x112", "fixed128x120", "fixed128x128", "fixed136x8", "fixed136x16", "fixed136x24", "fixed136x32", "fixed136x40", "fixed136x48", "fixed136x56", "fixed136x64", "fixed136x72", "fixed136x80", "fixed136x88", "fixed136x96", "fixed136x104", "fixed136x112", "fixed136x120", "fixed144x8", "fixed144x16", "fixed144x24", "fixed144x32", "fixed144x40", "fixed144x48", "fixed144x56", "fixed144x64", "fixed144x72", "fixed144x80", "fixed144x88", "fixed144x96", "fixed144x104", "fixed144x112", "fixed152x8", "fixed152x16", "fixed152x24", "fixed152x32", "fixed152x40", "fixed152x48", "fixed152x56", "fixed152x64", "fixed152x72", "fixed152x80", "fixed152x88", "fixed152x96", "fixed152x104", "fixed160x8", "fixed160x16", "fixed160x24", "fixed160x32", "fixed160x40", "fixed160x48", "fixed160x56", "fixed160x64", "fixed160x72", "fixed160x80", "fixed160x88", "fixed160x96", "fixed168x8", "fixed168x16", "fixed168x24", "fixed168x32", "fixed168x40", "fixed168x48", "fixed168x56", "fixed168x64", "fixed168x72", "fixed168x80", "fixed168x88", "fixed176x8", "fixed176x16", "fixed176x24", "fixed176x32", "fixed176x40", "fixed176x48", "fixed176x56", "fixed176x64", "fixed176x72", "fixed176x80", "fixed184x8", "fixed184x16", "fixed184x24", "fixed184x32", "fixed184x40", "fixed184x48", "fixed184x56", "fixed184x64", "fixed184x72", "fixed192x8", "fixed192x16", "fixed192x24", "fixed192x32", "fixed192x40", "fixed192x48", "fixed192x56", "fixed192x64", "fixed200x8", "fixed200x16", "fixed200x24", "fixed200x32", "fixed200x40", "fixed200x48", "fixed200x56", "fixed208x8", "fixed208x16", "fixed208x24", "fixed208x32", "fixed208x40", "fixed208x48", "fixed216x8", "fixed216x16", "fixed216x24", "fixed216x32", "fixed216x40", "fixed224x8", "fixed224x16", "fixed224x24", "fixed224x32", "fixed232x8", "fixed232x16", "fixed232x24", "fixed240x8", "fixed240x16", "fixed248x8", "ufixed", "ufixed0x8", "ufixed0x16", "ufixed0x24", "ufixed0x32", "ufixed0x40", "ufixed0x48", "ufixed0x56", "ufixed0x64", "ufixed0x72", "ufixed0x80", "ufixed0x88", "ufixed0x96", "ufixed0x104", "ufixed0x112", "ufixed0x120", "ufixed0x128", "ufixed0x136", "ufixed0x144", "ufixed0x152", "ufixed0x160", "ufixed0x168", "ufixed0x176", "ufixed0x184", "ufixed0x192", "ufixed0x200", "ufixed0x208", "ufixed0x216", "ufixed0x224", "ufixed0x232", "ufixed0x240", "ufixed0x248", "ufixed0x256", "ufixed8x8", "ufixed8x16", "ufixed8x24", "ufixed8x32", "ufixed8x40", "ufixed8x48", "ufixed8x56", "ufixed8x64", "ufixed8x72", "ufixed8x80", "ufixed8x88", "ufixed8x96", "ufixed8x104", "ufixed8x112", "ufixed8x120", "ufixed8x128", "ufixed8x136", "ufixed8x144", "ufixed8x152", "ufixed8x160", "ufixed8x168", "ufixed8x176", "ufixed8x184", "ufixed8x192", "ufixed8x200", "ufixed8x208", "ufixed8x216", "ufixed8x224", "ufixed8x232", "ufixed8x240", "ufixed8x248", "ufixed16x8", "ufixed16x16", "ufixed16x24", "ufixed16x32", "ufixed16x40", "ufixed16x48", "ufixed16x56", "ufixed16x64", "ufixed16x72", "ufixed16x80", "ufixed16x88", "ufixed16x96", "ufixed16x104", "ufixed16x112", "ufixed16x120", "ufixed16x128", "ufixed16x136", "ufixed16x144", "ufixed16x152", "ufixed16x160", "ufixed16x168", "ufixed16x176", "ufixed16x184", "ufixed16x192", "ufixed16x200", "ufixed16x208", "ufixed16x216", "ufixed16x224", "ufixed16x232", "ufixed16x240", "ufixed24x8", "ufixed24x16", "ufixed24x24", "ufixed24x32", "ufixed24x40", "ufixed24x48", "ufixed24x56", "ufixed24x64", "ufixed24x72", "ufixed24x80", "ufixed24x88", "ufixed24x96", "ufixed24x104", "ufixed24x112", "ufixed24x120", "ufixed24x128", "ufixed24x136", "ufixed24x144", "ufixed24x152", "ufixed24x160", "ufixed24x168", "ufixed24x176", "ufixed24x184", "ufixed24x192", "ufixed24x200", "ufixed24x208", "ufixed24x216", "ufixed24x224", "ufixed24x232", "ufixed32x8", "ufixed32x16", "ufixed32x24", "ufixed32x32", "ufixed32x40", "ufixed32x48", "ufixed32x56", "ufixed32x64", "ufixed32x72", "ufixed32x80", "ufixed32x88", "ufixed32x96", "ufixed32x104", "ufixed32x112", "ufixed32x120", "ufixed32x128", "ufixed32x136", "ufixed32x144", "ufixed32x152", "ufixed32x160", "ufixed32x168", "ufixed32x176", "ufixed32x184", "ufixed32x192", "ufixed32x200", "ufixed32x208", "ufixed32x216", "ufixed32x224", "ufixed40x8", "ufixed40x16", "ufixed40x24", "ufixed40x32", "ufixed40x40", "ufixed40x48", "ufixed40x56", "ufixed40x64", "ufixed40x72", "ufixed40x80", "ufixed40x88", "ufixed40x96", "ufixed40x104", "ufixed40x112", "ufixed40x120", "ufixed40x128", "ufixed40x136", "ufixed40x144", "ufixed40x152", "ufixed40x160", "ufixed40x168", "ufixed40x176", "ufixed40x184", "ufixed40x192", "ufixed40x200", "ufixed40x208", "ufixed40x216", "ufixed48x8", "ufixed48x16", "ufixed48x24", "ufixed48x32", "ufixed48x40", "ufixed48x48", "ufixed48x56", "ufixed48x64", "ufixed48x72", "ufixed48x80", "ufixed48x88", "ufixed48x96", "ufixed48x104", "ufixed48x112", "ufixed48x120", "ufixed48x128", "ufixed48x136", "ufixed48x144", "ufixed48x152", "ufixed48x160", "ufixed48x168", "ufixed48x176", "ufixed48x184", "ufixed48x192", "ufixed48x200", "ufixed48x208", "ufixed56x8", "ufixed56x16", "ufixed56x24", "ufixed56x32", "ufixed56x40", "ufixed56x48", "ufixed56x56", "ufixed56x64", "ufixed56x72", "ufixed56x80", "ufixed56x88", "ufixed56x96", "ufixed56x104", "ufixed56x112", "ufixed56x120", "ufixed56x128", "ufixed56x136", "ufixed56x144", "ufixed56x152", "ufixed56x160", "ufixed56x168", "ufixed56x176", "ufixed56x184", "ufixed56x192", "ufixed56x200", "ufixed64x8", "ufixed64x16", "ufixed64x24", "ufixed64x32", "ufixed64x40", "ufixed64x48", "ufixed64x56", "ufixed64x64", "ufixed64x72", "ufixed64x80", "ufixed64x88", "ufixed64x96", "ufixed64x104", "ufixed64x112", "ufixed64x120", "ufixed64x128", "ufixed64x136", "ufixed64x144", "ufixed64x152", "ufixed64x160", "ufixed64x168", "ufixed64x176", "ufixed64x184", "ufixed64x192", "ufixed72x8", "ufixed72x16", "ufixed72x24", "ufixed72x32", "ufixed72x40", "ufixed72x48", "ufixed72x56", "ufixed72x64", "ufixed72x72", "ufixed72x80", "ufixed72x88", "ufixed72x96", "ufixed72x104", "ufixed72x112", "ufixed72x120", "ufixed72x128", "ufixed72x136", "ufixed72x144", "ufixed72x152", "ufixed72x160", "ufixed72x168", "ufixed72x176", "ufixed72x184", "ufixed80x8", "ufixed80x16", "ufixed80x24", "ufixed80x32", "ufixed80x40", "ufixed80x48", "ufixed80x56", "ufixed80x64", "ufixed80x72", "ufixed80x80", "ufixed80x88", "ufixed80x96", "ufixed80x104", "ufixed80x112", "ufixed80x120", "ufixed80x128", "ufixed80x136", "ufixed80x144", "ufixed80x152", "ufixed80x160", "ufixed80x168", "ufixed80x176", "ufixed88x8", "ufixed88x16", "ufixed88x24", "ufixed88x32", "ufixed88x40", "ufixed88x48", "ufixed88x56", "ufixed88x64", "ufixed88x72", "ufixed88x80", "ufixed88x88", "ufixed88x96", "ufixed88x104", "ufixed88x112", "ufixed88x120", "ufixed88x128", "ufixed88x136", "ufixed88x144", "ufixed88x152", "ufixed88x160", "ufixed88x168", "ufixed96x8", "ufixed96x16", "ufixed96x24", "ufixed96x32", "ufixed96x40", "ufixed96x48", "ufixed96x56", "ufixed96x64", "ufixed96x72", "ufixed96x80", "ufixed96x88", "ufixed96x96", "ufixed96x104", "ufixed96x112", "ufixed96x120", "ufixed96x128", "ufixed96x136", "ufixed96x144", "ufixed96x152", "ufixed96x160", "ufixed104x8", "ufixed104x16", "ufixed104x24", "ufixed104x32", "ufixed104x40", "ufixed104x48", "ufixed104x56", "ufixed104x64", "ufixed104x72", "ufixed104x80", "ufixed104x88", "ufixed104x96", "ufixed104x104", "ufixed104x112", "ufixed104x120", "ufixed104x128", "ufixed104x136", "ufixed104x144", "ufixed104x152", "ufixed112x8", "ufixed112x16", "ufixed112x24", "ufixed112x32", "ufixed112x40", "ufixed112x48", "ufixed112x56", "ufixed112x64", "ufixed112x72", "ufixed112x80", "ufixed112x88", "ufixed112x96", "ufixed112x104", "ufixed112x112", "ufixed112x120", "ufixed112x128", "ufixed112x136", "ufixed112x144", "ufixed120x8", "ufixed120x16", "ufixed120x24", "ufixed120x32", "ufixed120x40", "ufixed120x48", "ufixed120x56", "ufixed120x64", "ufixed120x72", "ufixed120x80", "ufixed120x88", "ufixed120x96", "ufixed120x104", "ufixed120x112", "ufixed120x120", "ufixed120x128", "ufixed120x136", "ufixed128x8", "ufixed128x16", "ufixed128x24", "ufixed128x32", "ufixed128x40", "ufixed128x48", "ufixed128x56", "ufixed128x64", "ufixed128x72", "ufixed128x80", "ufixed128x88", "ufixed128x96", "ufixed128x104", "ufixed128x112", "ufixed128x120", "ufixed128x128", "ufixed136x8", "ufixed136x16", "ufixed136x24", "ufixed136x32", "ufixed136x40", "ufixed136x48", "ufixed136x56", "ufixed136x64", "ufixed136x72", "ufixed136x80", "ufixed136x88", "ufixed136x96", "ufixed136x104", "ufixed136x112", "ufixed136x120", "ufixed144x8", "ufixed144x16", "ufixed144x24", "ufixed144x32", "ufixed144x40", "ufixed144x48", "ufixed144x56", "ufixed144x64", "ufixed144x72", "ufixed144x80", "ufixed144x88", "ufixed144x96", "ufixed144x104", "ufixed144x112", "ufixed152x8", "ufixed152x16", "ufixed152x24", "ufixed152x32", "ufixed152x40", "ufixed152x48", "ufixed152x56", "ufixed152x64", "ufixed152x72", "ufixed152x80", "ufixed152x88", "ufixed152x96", "ufixed152x104", "ufixed160x8", "ufixed160x16", "ufixed160x24", "ufixed160x32", "ufixed160x40", "ufixed160x48", "ufixed160x56", "ufixed160x64", "ufixed160x72", "ufixed160x80", "ufixed160x88", "ufixed160x96", "ufixed168x8", "ufixed168x16", "ufixed168x24", "ufixed168x32", "ufixed168x40", "ufixed168x48", "ufixed168x56", "ufixed168x64", "ufixed168x72", "ufixed168x80", "ufixed168x88", "ufixed176x8", "ufixed176x16", "ufixed176x24", "ufixed176x32", "ufixed176x40", "ufixed176x48", "ufixed176x56", "ufixed176x64", "ufixed176x72", "ufixed176x80", "ufixed184x8", "ufixed184x16", "ufixed184x24", "ufixed184x32", "ufixed184x40", "ufixed184x48", "ufixed184x56", "ufixed184x64", "ufixed184x72", "ufixed192x8", "ufixed192x16", "ufixed192x24", "ufixed192x32", "ufixed192x40", "ufixed192x48", "ufixed192x56", "ufixed192x64", "ufixed200x8", "ufixed200x16", "ufixed200x24", "ufixed200x32", "ufixed200x40", "ufixed200x48", "ufixed200x56", "ufixed208x8", "ufixed208x16", "ufixed208x24", "ufixed208x32", "ufixed208x40", "ufixed208x48", "ufixed216x8", "ufixed216x16", "ufixed216x24", "ufixed216x32", "ufixed216x40", "ufixed224x8", "ufixed224x16", "ufixed224x24", "ufixed224x32", "ufixed232x8", "ufixed232x16", "ufixed232x24", "ufixed240x8", "ufixed240x16", "ufixed248x8", "event", "enum", "let", "mapping", "private", "public", "external", "inherited", "payable", "true", "false", "var", "import", "constant", "if", "else", "for", "else", "for", "while", "do", "break", "continue", "throw", "returns", "return", "suicide", "new", "is", "this", "super" ], "example": [ "// SPDX-License-Identifier: MIT\npragma solidity >=0.6.0 <0.9.0;\n\ncontract HelloWorld {\n function helloWorld() external pure returns (string memory) {\n return \"Hello, World!\";\n }\n}" ], "gource": "https://www.youtube.com/watch?v=szY2wTXaG9Q", "githubRepo": { "stars": 17321, "forks": 4124, "subscribers": 657, "created": 2015, "updated": 2022, "firstCommit": 2014, "description": "Solidity, the Smart Contract Programming Language", "issues": 1103, "url": "https://github.com/ethereum/solidity" }, "repoStats": { "firstCommit": 2014, "commits": 25408, "committers": 740, "files": 9812 }, "wikipedia": { "example": [ "contract GavCoin\n{\n mapping(address=>uint) balances;\n uint constant totalCoins = 100000000000;\n\n /// Endows creator of contract with 1m GAV.\n function GavCoin(){\n balances[msg.sender] = totalCoins;\n }\n\n /// Send $((valueInmGAV / 1000).fixed(0,3)) GAV from the account of $(message.caller.address()), to an account accessible only by $(to.address()).\n function send(address to, uint256 valueInmGAV) {\n if (balances[msg.sender] >= valueInmGAV) {\n balances[to] += valueInmGAV;\n balances[msg.sender] -= valueInmGAV;\n }\n }\n\n /// getter function for the balance\n function balance(address who) constant returns (uint256 balanceInmGAV) {\n balanceInmGAV = balances[who];\n }\n\n}" ], "related": [ "javascript", "ecmascript", "visual-studio-editor", "azure", "aws" ], "summary": "Solidity is a contract-oriented programming language for writing smart contracts. It is used for implementing smart contracts on various blockchain platforms. It was developed by Gavin Wood, Christian Reitwiessner, Alex Beregszaszi, Liana Husikyan, Yoichi Hirai and several former Ethereum core contributors to enable writing smart contracts on blockchain platforms such as Ethereum.", "pageId": 6817996, "dailyPageViews": 405, "created": 2006, "backlinksCount": 41, "revisionCount": 148, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/Solidity" }, "githubLanguage": { "trendingProjectsCount": 0, "type": "programming", "fileExtensions": [ "sol" ], "aceMode": "text", "tmScope": "source.solidity", "repos": 87183, "id": "Solidity" }, "githubBigQuery": { "repos": 78, "users": 76, "id": "Solidity" }, "monaco": "solidity", "pygmentsHighlighter": { "filename": "solidity.py", "fileExtensions": [ "sol" ], "id": "Solidity" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 11, "commitCount": 38, "url": "https://github.com/davidhq/SublimeEthereum.git" }, "languageServerProtocolProject": [ "https://github.com/CodeChain-io/solidity-language-server\nwrittenIn typescript" ], "leachim6": { "filepath": "s/Solidity.sol", "fileExtensions": [ "sol" ], "example": [ "pragma solidity ^0.8.9;\n\ncontract HelloWorld {\n function render () public pure returns (string memory) {\n return 'Hello World';\n }\n}\n" ], "id": "Solidity" }, "compilerExplorer": { "example": [ "// SPDX-License-Identifier: UNLICENSED\npragma solidity >=0.4.0;\n\ncontract Square {\n function square(uint32 num) public pure returns (uint32) {\n return num * num;\n }\n}\n" ], "id": "Solidity" }, "indeedJobs": { "2022": 937, "query": "solidity developer" }, "officialBlogUrl": [ "https://blog.soliditylang.org/" ], "tiobe": { "id": "Solidity" }, "twitter": "https://twitter.com/solidity_lang", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nThe Solidity Programmer's Handbook||Tony Hontzeas|66375248|0.0|0|0\nSolidity Programming Essentials: A beginner's guide to build smart contracts for Ethereum and blockchain||Ritesh Modi|60029591|3.62|8|1\nIntroducing Ethereum and Solidity: Foundations of Cryptocurrency and Blockchain Programming for Beginners||Chris Dannen|53853238|3.41|110|15\nEthereum Developer: Learn Solidity From Scratch||Merunas Grincalaitis|60911135|4.50|2|0\nSOLIDITY AND ETHEREUM: Mining and Programming of Blockchain of 2017||Michael Bitman|58182701|5.00|1|0\nThe Essentials of Smart Contract Development for Solidity Developers||Seungwon Go|66309129|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2019|Packt Publishing|Mastering Blockchain Programming with Solidity: Write production-ready smart contracts for Ethereum blockchain with Solidity|Chittoda, Jitendra|9781839218262\n2017|Packt Publishing|Building Blockchain Projects: Building decentralized Blockchain applications with Ethereum and Solidity|Prusty, Narayan|9781787125339\n2019|Packt Publishing|Mastering Blockchain Programming with Solidity: Write production-ready smart contracts for Ethereum blockchain with Solidity|Chittoda, Jitendra|9781839218637\n2018|Apress|Building Games with Ethereum Smart Contracts: Intermediate Projects for Solidity Developers|Iyer, Kedar and Dannen, Chris|9781484234921\n2018|Packt Publishing|Solidity Programming Essentials: A beginner's guide to build smart contracts for Ethereum and blockchain|Modi, Ritesh|9781788838375\n2018|Packt Publishing|Ethereum Smart Contract Development: Build blockchain-based decentralized applications using solidity|Mukhopadhyay, Mayukh|9781788472623\n2020|BPB Publications|Smart Contract Development with Solidity and Ethereum: Building Smart Contracts with the Azure Blockchain (English Edition)|Mittal, Akhil|9789388511919\n2018|Packt Publishing|Solidity Programming Essentials: A beginner's guide to build smart contracts for Ethereum and blockchain|Modi, Ritesh|9781788831383\n2022|Apress|Blockchain and Ethereum Smart Contract Solution Development: Dapp Programming with Solidity|Zhang, Weijia and Anand, Tej|9781484281635\n2018|Independently published|Solidity Programming Language 101: Beginner Guide|Raja, Ismail and Mohamed, Fazith|9781719883405\n2022|Packt Publishing|Solidity Programming Essentials: A guide to building smart contracts and tokens using the widely used Solidity language, 2nd Edition|Modi, Ritesh|9781803231181\n2019|O'reilly Media|Hands-on Smart Contract Development With Solidity And Ethereum|Kevin Solorio and Randall Kanna and David H. Hoover|9781492045236\n2019|Mechanical Industry Press|Solidity Programming: A Beginner's Guide to Building Ethereum and Blockchain Smart Contracts(Chinese Edition)|[ YIN DU ] LI TE SHEN · MO DI ( Ritesh , Modi ) ZHU|9787111616009\n20220610|Packt Publishing|Solidity Programming Essentials|Ritesh Modi|9781803234793\n20200831|Springer Nature|Ethereum Smart Contract Development in Solidity|Gavin Zheng; Longxiang Gao; Liqun Huang; Jian Guan|9789811562181\n20191125|O'Reilly Media, Inc.|Hands-On Smart Contract Development with Solidity and Ethereum|Kevin Solorio; Randall Kanna; David H. Hoover|9781492045212", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2018|Smart contracts: security patterns in the ethereum ecosystem and solidity|10.1109/IWBOSE.2018.8327565|178|13|Maximilian Wöhrer and U. Zdun|7d7ce972902c66f4a506c7f35f13aaba40a58880\n2018|Lolisa: Formal Syntax and Semantics for a Subset of the Solidity Programming Language|10.1155/2020/6191537|29|1|Zheng Yang and Hang Lei|129c3bd87981c6bc0111535b9519fb876a6d9c48\n2018|Towards Verification of Ethereum Smart Contracts: A Formalization of Core of Solidity|10.1007/978-3-030-03592-1_13|25|0|Jakub Zakrzewski|f1fc26e258271ce34cf4279f6bdb9800f208edc4\n2020|Semantic Understanding of Smart Contracts: Executable Operational Semantics of Solidity|10.1109/SP40000.2020.00066|20|2|Jiao Jiao and Shuanglong Kan and Shang-Wei Lin and D. Sanán and Yang Liu and Jun Sun|0a8388d08f03018eeb471bd5455c8abaa03d6763\n2020|SMT-Friendly Formalization of the Solidity Memory Model|10.1007/978-3-030-44914-8_9|16|1|Á. Hajdu and Dejan Jovanovic|50babffb567b68fdfcd33d8429c177fb2dc644d6\n2019|Degree Validation Application Using Solidity and Ethereum Blockchain|10.1109/SoutheastCon42311.2019.9020503|5|1|C. BouSaba and Ethan Anderson|a53fb00dc5a8b8e35be98bcc63d935850f83f04f\n2019|Deviant: A Mutation Testing Tool for Solidity Smart Contracts|10.1109/Blockchain.2019.00050|4|0|Patrick Chapman and Dianxiang Xu and Lin Deng and Yin Xiong|268fe44b85113a74863d4a0fdb2f9374a2bba445\n2020|Gap between Theory and Practice: An Empirical Study of Security Patches in Solidity|10.1145/3377811.3380424|4|0|Sungjae Hwang and S. Ryu|9dcd7b3836935d81f00c1d5462b716495ded76b6\n2019|Modularizing Cross-Cutting Concerns with Aspect-Oriented Extensions for Solidity|10.1109/DAPPCON.2019.00033|3|1|Chien-Che Hung and Kung Chen and Chun-Feng Liao|35f732815e102f612e962bfa8f4d20dfb868997b\n2020|PASO: A Web-Based Parser for Solidity Language Analysis|10.1109/IWBOSE50093.2020.9050263|3|0|Giuseppe Antonio Pierro and R. Tonelli|39d8fb3b837c0baff2e56341b93f4ac3d3ae9182\n2019|A New Approach to Prevent Reentrant Attack in Solidity Smart Contracts|10.1007/978-981-15-3278-8_6|2|0|C. Dong and Yuanhong Li and Liang Tan|af8e33b8c5bc0645c3dea27af95deecb4befe7d7\n2019|Programming Smart Contracts in Ethereum Blockchain using Solidity|10.1145/3287324.3287542|2|0|Debasis Bhattacharya and M. Canul and S. Knight and M. Azhar and Rajiv Malkan|bebefcf6281e90d91a057752ab55c07c81b90d99\n2018|Basic Solidity Programming|10.1007/978-1-4842-4075-5_3|1|0|Debajani Mohanty|f44c815df713192f26213201fe5b12696e2c4f41" }, "solmar": { "title": "SOLMAR", "appeared": 1978, "type": "pl", "reference": [ "https://semanticscholar.org/paper/967a79ce57f41139ee09a922747f05e6b17d5391" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2814", "centralPackageRepositoryCount": 0 }, "son": { "title": "son", "appeared": 2017, "type": "textMarkup", "creators": [ "Ian Grant Jeffries" ], "description": "A minimal subset of JSON for machine-to-machine communication", "reference": [ "https://www.reddit.com/r/haskell/comments/5zdq5y/rfc_son_subset_of_json_for_machinetomachine/" ], "githubRepo": { "stars": 357, "forks": 6, "subscribers": 11, "created": 2017, "updated": 2022, "firstCommit": 2017, "description": "Work in progress. Best alternative: https://matrix.org/docs/spec/appendices.html#canonical-json", "issues": 9, "url": "https://github.com/seagreen/Son" }, "repoStats": { "firstCommit": 2017, "commits": 22, "committers": 1, "files": 44 }, "fileType": "text", "wordRank": 1417, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "sophia": { "title": "Sophia", "appeared": 2018, "type": "contractLanguage", "creators": [ "Robert Virding" ], "website": "https://aeternity.com/aesophia", "related": [ "solidity" ], "hasStrings": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "booleanTokens": [ [ "true", "false" ] ], "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" ], "githubRepo": { "firstCommit": 2018, "stars": 42, "forks": 19, "subscribers": 30, "created": 2018, "updated": 2022, "description": " Stand alone compiler for the Sophia smart contract language", "issues": 42, "url": "https://github.com/aeternity/aesophia" }, "repoStats": { "firstCommit": 2018, "commits": 1095, "committers": 32, "files": 278 }, "monaco": "sophia" }, "soql-lang": { "title": "Socrata Query Language", "appeared": 2012, "type": "queryLanguage", "reference": [ "https://dev.socrata.com/docs/queries/" ] }, "soql": { "title": "SOQL", "appeared": 2006, "type": "queryLanguage", "website": "https://developer.salesforce.com/docs/atlas.en-us.soql_sosl.meta/soql_sosl/sforce_api_calls_soql.htm", "reference": [ "https://resources.docs.salesforce.com/sfdc/pdf/apex_api.pdf?major=146" ], "standsFor": "Salesforce Object Query Language", "originCommunity": [ "Salesforce" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "sora": { "title": "sora", "appeared": 2019, "type": "pl", "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/dgs976/cast_expressions_syntax_semantics/?utm_source=share&utm_medium=ios_app&utm_name=iossmf" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "func get(node: &mut Foo, k: usize) -> maybe &mut Foo {\n if k == 0 {\n return node // no semicolons, only newlines\n } else if let next = node->next { // node->next is a maybe &mut Foo, this accesses the value of the maybe type.\n return get(next, k-1)\n } else {\n return null\n }\n}" ] }, "sorca": { "title": "SORCA", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3b085eee154ef98219230b9257a8a3b1fed7ee76" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6695", "centralPackageRepositoryCount": 0 }, "sort-merge-generator": { "title": "Sort Merge Generator", "appeared": 1951, "type": "pl", "wikipedia": { "summary": "The Sort Merge Generator was an application developed by Betty Holberton in 1951 for the Univac I and is one of the first examples of using a computer to create a computer program. The input to the application was a specification of files and the kind of sort and merge operations to use, and the output would be machine code for performing the specification.", "created": 2007, "backlinksCount": 9, "pageId": 9992844, "revisionCount": 13, "dailyPageViews": 4, "appeared": 1951, "url": "https://en.wikipedia.org/wiki/Sort_Merge_Generator" }, "centralPackageRepositoryCount": 0 }, "sosl": { "title": "SOSL", "appeared": 2006, "type": "queryLanguage", "website": "https://developer.salesforce.com/docs/atlas.en-us.soql_sosl.meta/soql_sosl/sforce_api_calls_sosl.htm", "reference": [ "https://resources.docs.salesforce.com/sfdc/pdf/apex_api.pdf?major=146" ], "standsFor": "Salesforce Object Search Language", "originCommunity": [ "Salesforce" ], "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "souffle": { "title": "souffle", "appeared": 2019, "type": "pl", "website": "https://souffle-lang.github.io", "domainName": { "name": "souffle-lang.github.io" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n19664658|A Specialized B-Tree for Concurrent Datalog Evaluation|https://souffle-lang.github.io/news/2019/02/20/ppopp19-paper/|2019-04-15 11:52:44 UTC|1555329164|matt_d|4|174", "isbndb": "" }, "soul": { "title": "soul", "appeared": 2000, "type": "queryLanguage", "description": "Program queries can answer important software engineering questions ranging from “is my code bug free?” over “does my code follow the prescribed design?” to “how can my code be refactored?”. SOUL is a Prolog-like language with specialized features for querying programs.", "website": "http://soft.vub.ac.be/SOUL/", "reference": [ "https://github.com/Ducasse/SOUL" ], "fileType": "text", "wordRank": 2403, "centralPackageRepositoryCount": 0 }, "soulver": { "title": "Soulver", "appeared": 2005, "type": "editor", "description": "It's a notepad that gives instant answers to calculations in your text.", "website": "https://soulver.app/", "example": [ "3 × 3\n120 + 30\nJune 12 + 3 weeks\n100 EUR in USD\n30% of 700\n$30/day is what per year" ] }, "souper": { "title": "souper", "appeared": 2014, "type": "optimizingCompiler", "description": "A superoptimizer for LLVM IR", "githubRepo": { "firstCommit": 2014, "stars": 1782, "forks": 150, "subscribers": 68, "created": 2014, "updated": 2022, "description": "A superoptimizer for LLVM IR", "issues": 87, "url": "https://github.com/google/souper" }, "repoStats": { "firstCommit": 2014, "commits": 861, "committers": 31, "files": 819 }, "isbndb": "" }, "sourcelair-editor": { "title": "sourcelair-editor", "appeared": 2011, "type": "editor" }, "sourcepawn": { "title": "SourcePawn", "appeared": 2014, "type": "pl", "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasOctals": { "example": "", "value": true }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "multiLineCommentTokens": [ [ "/*", "*/" ] ], "githubRepo": { "firstCommit": 2014, "stars": 239, "forks": 53, "subscribers": 33, "created": 2014, "updated": 2022, "description": "A small, statically typed scripting language.", "issues": 62, "url": "https://github.com/alliedmodders/sourcepawn" }, "repoStats": { "firstCommit": 2014, "commits": 1344, "committers": 44, "files": 1220 }, "githubLanguage": { "fileExtensions": [ "sp", "inc" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.sourcepawn", "aliases": [ "sourcemod" ], "repos": 7547, "id": "SourcePawn" }, "githubBigQuery": { "repos": 9023, "users": 6524, "id": "SourcePawn" }, "pygmentsHighlighter": { "filename": "pawn.py", "fileExtensions": [ "sp" ], "id": "SourcePawn" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2016, "committerCount": 6, "commitCount": 56, "sampleCount": 6, "example": [ "/* Fixed point arithmetic\n *\n * (c) Copyright 1998-2011, ITB CompuPhase\n * This file is provided as is (no warranties).\n */\n#pragma library Fixed\n\nconst fround_method: {\n fround_round = 0,\n fround_floor,\n fround_ceil,\n fround_tozero,\n fround_unbiased\n}\n\nnative Fixed:fixed(value);\nnative Fixed:strfixed(const string[]);\nnative Fixed:fmul(Fixed:oper1, Fixed:oper2);\nnative Fixed:fdiv(Fixed:dividend, Fixed:divisor);\nnative Fixed:ffract(Fixed:value);\nnative fround(Fixed:value, fround_method:method=fround_round);\nnative Fixed:fpower(Fixed:value, exponent);\nnative Fixed:fsqroot(Fixed:value);\nnative Fixed:fabs(Fixed:value);\n\n#pragma rational Fixed(3)\n\n/* user defined operators */\nnative Fixed:operator*(Fixed:oper1, Fixed:oper2) = fmul;\nnative Fixed:operator/(Fixed:oper1, Fixed:oper2) = fdiv;\nnative Fixed:operator=(oper) = fixed;\n\nstock Fixed:operator++(Fixed:oper)\n return oper + fixed(1);\n\nstock Fixed:operator--(Fixed:oper)\n return oper - fixed(1);\n\nstock Fixed:operator*(Fixed:oper1, oper2)\n return Fixed: (_:oper1 * oper2); /* \"*\" is commutative */\n\nstock Fixed:operator/(Fixed:oper1, oper2)\n return oper1 / fixed(oper2);\n\nstock Fixed:operator/(oper1, Fixed:oper2)\n return fdiv(fixed(oper1), oper2);\n\nstock Fixed:operator+(Fixed:oper1, oper2)\n return oper1 + fixed(oper2); /* \"+\" is commutative */\n\nstock Fixed:operator-(Fixed:oper1, oper2)\n return oper1 - fixed(oper2);\n\nstock Fixed:operator-(oper1, Fixed:oper2)\n return fixed(oper1) - oper2;\n\nstock bool:operator>(Fixed:oper1, oper2)\n return oper1 > fixed(oper2);\n\nstock bool:operator>(oper1, Fixed:oper2)\n return fixed(oper1) > oper2;\n\nstock bool:operator>=(Fixed:oper1, oper2)\n return oper1 >= fixed(oper2);\n\nstock bool:operator>=(oper1, Fixed:oper2)\n return fixed(oper1) >= oper2;\n\nstock bool:operator<(Fixed:oper1, oper2)\n return oper1 < fixed(oper2);\n\nstock bool:operator<(oper1, Fixed:oper2)\n return fixed(oper1) < oper2;\n\nstock bool:operator<=(Fixed:oper1, oper2)\n return oper1 <= fixed(oper2);\n\nstock bool:operator<=(oper1, Fixed:oper2)\n return fixed(oper1) <= oper2;\n\nstock bool:operator==(Fixed:oper1, oper2) /* \"==\" is commutative */\n return oper1 == fixed(oper2);\n\nstock bool:operator!=(Fixed:oper1, oper2) /* \"!=\" is commutative */\n return oper1 != fixed(oper2);\n\n/* forbidden operations */\nforward operator%(Fixed:oper1, Fixed:oper2);\nforward operator%(Fixed:oper1, oper2);\nforward operator%(oper1, Fixed:oper2);" ], "url": "https://github.com/github-linguist/sublime-sourcepawn" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "sourcetree": { "title": "Sourcetree", "appeared": 2010, "type": "application", "creators": [ "Atlassian" ], "description": "Sourcetree is a free graphical user interface (GUI) desktop client that simplifies how you interact with Git repositories so that you can fully concentrate on coding", "website": "https://www.sourcetreeapp.com/", "documentation": [ "https://confluence.atlassian.com/get-started-with-sourcetree" ], "reference": [ "https://github.com/magit/magit#readme" ], "country": [ "USA" ], "originCommunity": [ "https://community.atlassian.com/t5/Sourcetree/ct-p/sourcetree" ], "domainName": { "name": "sourcetreeapp.com" }, "related": [ "git", "magit" ] }, "southampton-basic-system": { "title": "Southampton BASIC System", "appeared": 1960, "type": "pl", "wikipedia": { "example": [ "2 2 1\n1 -1 0\n4 -3 -2" ], "related": [ "basic" ], "summary": "Southampton BASIC System (SOBS) was a dialect of the BASIC programming language developed for and used on ICT 1900 series computers in the late 1960s and early 1970s; it was implemented under the MINIMOP operating system at the University of Southampton and also ran under MAXIMOP. It was operated from a Teletype terminal, though CRT terminals could also be used.", "created": 2009, "backlinksCount": 118, "pageId": 22846640, "revisionCount": 29, "dailyPageViews": 5, "appeared": 1960, "url": "https://en.wikipedia.org/wiki/Southampton_BASIC_System" }, "centralPackageRepositoryCount": 0 }, "sox": { "title": "Schema for Object-Oriented XML", "appeared": 1998, "type": "xmlFormat", "wikipedia": { "summary": "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.", "backlinksCount": 9, "pageId": 3859480, "dailyPageViews": 5, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Schema_for_Object-Oriented_XML" }, "semanticScholar": "" }, "soy": { "title": "Soy", "appeared": 2008, "type": "template", "reference": [ "https://godoc.org/github.com/robfig/soy" ], "aka": [ "Google Closure Templates" ], "fileExtensions": [ "soy" ], "originCommunity": [ "Google" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "example": [ "/**\n * Greets a person and optionally a list of other people.\n * @param name The name of the person.\n * @param additionalNames The additional names to greet. May be an empty list.\n */\n{template .helloNames}\n // Greet the person.\n {call .helloName data=\"all\" /}
\n // Greet the additional people.\n {foreach $additionalName in $additionalNames}\n {call .helloName}\n {param name: $additionalName /}\n {/call}\n {if not isLast($additionalName)}\n
// break after every line except the last\n {/if}\n {ifempty}\n No additional people to greet.\n {/foreach}\n{/template}" ], "semanticScholar": "" }, "sp-k": { "title": "SP/k", "appeared": 1974, "type": "pl", "creators": [ "Ric Holt", "D.B. Wortman", "D.T. Barnard", "James Cordy" ], "country": [ "Canada" ], "wikipedia": { "related": [ "pl-i", "turing", "pl-c", "watfiv" ], "summary": "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.", "pageId": 827334, "created": 2004, "backlinksCount": 12, "revisionCount": 22, "dailyPageViews": 6, "appeared": 1974, "url": "https://en.wikipedia.org/wiki/SP/k" }, "hopl": "https://hopl.info/showlanguage.prx?exp=784", "fileType": "text", "centralPackageRepositoryCount": 0 }, "space": { "title": "Space", "appeared": 2013, "type": "dataNotation", "isDead": "true\nhttps://github.com/breck7/space", "isPublicDomain": true, "creators": [ "Breck Yunits" ], "description": "Space is a lightweight language for objects. Space is like XML or JSON, with less punctuation and more power.", "website": "https://github.com/breck7/space", "successorOf": [ "note" ], "hasSemanticIndentation": { "example": "settings\n title Note", "value": true }, "example": [ "settings\n title Note" ], "githubRepo": { "firstCommit": 2012, "stars": 8, "forks": 1, "subscribers": 3, "created": 2012, "updated": 2017, "description": "This has been replaced by Space", "issues": 0, "url": "https://github.com/breck7/note" }, "isOpenSource": true }, "spade": { "title": "SPADE", "appeared": 2018, "type": "pl", "reference": [ "http://www.drdobbs.com/parallel/the-spade-programming-language-dig-it/228701402" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2516", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|A Code Generation Approach for Auto-Vectorization in the Spade Compiler|10.1007/978-3-642-13374-9_26|6|0|Huayong Wang and H. Andrade and B. Gedik and Kun-Lung Wu|8e25edc80a72a1bb8f3839e661abf316f762a925\n1998|SPADE : analog/digital mixed signal simulator with analog hardware description language|10.1109/ICECS.1998.813375|2|0|H. Sagesaka and H. Irii and H. Asai|f8d33afae0f3327c98e78213d37c031a026d50ac" }, "sparc": { "title": "SPARC", "appeared": 1987, "type": "isa", "originCommunity": [ "Sun Microsystems" ], "wikipedia": { "related": [ "mips", "ml", "lisp", "solaris", "freebsd", "linux", "verilog", "systemverilog" ], "summary": "SPARC, for Scalable Processor Architecture, is a reduced instruction set computing (RISC) instruction set architecture (ISA) originally developed by Sun Microsystems. Its design was strongly influenced by the experimental Berkeley RISC system developed in the early 1980s. First released in 1987, SPARC was one of the most successful early commercial RISC systems, and its success led to the introduction of similar RISC designs from a number of vendors through the 1980s and 90s. The first implementation of the original 32-bit architecture (SPARC V7) was used in Sun's Sun-4 workstation and server systems, replacing their earlier Sun-3 systems based on the Motorola 68000 series of processors. SPARC V8 added a number of improvements that were part of the SuperSPARC series of processors released in 1992. SPARC V9, released in 1993, introduced a 64-bit architecture and was first released in Sun's UltraSPARC processors in 1995. Later, SPARC processors were used in SMP and CC-NUMA servers produced by Sun, Solbourne and Fujitsu, among others. The design was turned over to the SPARC International trade group in 1989, and since then its architecture has been developed by its members. SPARC International is also responsible for licensing and promoting the SPARC architecture, managing SPARC trademarks (including SPARC, which it owns), and providing conformance testing. SPARC International was intended to grow the SPARC architecture to create a larger ecosystem; SPARC has been licensed to several manufacturers, including Atmel, Bipolar Integrated Technology, Cypress Semiconductor, Fujitsu, Matsushita and Texas Instruments. Due to SPARC International, SPARC is fully open, non-proprietary and royalty-free. By September 2017, the latest commercial high-end SPARC processors are Fujitsu's SPARC64 XII (introduced in 2017 for its SPARC M12 server) and SPARC64 XIfx (introduced in 2015 for its PRIMEHPC FX100 supercomputer); and Oracle's SPARC M8 (introduced in September 2017 for its high-end servers). On Friday, September 1, 2017, after a round of layoffs that started in Oracle Labs in November of 2016, Oracle finally killed off SPARC design after the completion of the M8. Nearly the entire processor core development group in Austin was let go, and the same for the SOC teams in California and Burlington.", "pageId": 36954, "dailyPageViews": 431, "created": 2002, "backlinksCount": 955, "revisionCount": 1055, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/SPARC" }, "fileType": "na", "wordRank": 9263, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSparc Architecture, Assembly Language Programming, And C|1994|Richard S. Paul|1710983|4.10|10|0\nThe SPARC Technical Papers|1991|Ben J. Catanzaro|7075115|0.0|0|0\nSPARC Assembly Language Reference Manual|2002|Sun Microsystems Press|2384657|4.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n1999|Pearson|SPARC Architecture, Assembly Language Programming, and C|Paul, Richard|9780130255969\n1993-07-28T00:00:01Z|Prentice Hall|Sparc Architecture, Assembly Language Programming, and C|Paul, Richard P.|9780138768898", "semanticScholar": "" }, "spark-pm": { "title": "spark-pm", "appeared": 2014, "type": "packageManager", "website": "https://spark-packages.org/", "domainName": { "registered": 2014, "awisRank": { "2022": 2327190 }, "name": "spark-packages.org" }, "packageCount": 441, "forLanguages": [ "spark" ] }, "spark": { "title": "SPARK", "appeared": 1988, "type": "pl", "documentation": [ "https://spark.apache.org/documentation.html" ], "country": [ "United Kingdom" ], "wikipedia": { "example": [ "procedure Increment (X : in out Counter_Type)\n with Global => null,\n Depends => (X => X),\n Pre => X < Counter_Type'Last,\n Post => X = X'Old + 1;" ], "related": [ "scala", "java", "python", "linux", "ada", "eiffel", "z-notation" ], "summary": "SPARK is a formally defined computer programming language based on the Ada programming language, intended for the development of high integrity software used in systems where predictable and highly reliable operation is essential. It facilitates the development of applications that demand safety, security, or business integrity. Originally, there were three versions of the SPARK language (SPARK83, SPARK95, SPARK2005) based on Ada 83, Ada 95 and Ada 2005 respectively. A fourth version of the SPARK language, SPARK 2014, based on Ada 2012, was released on April 30, 2014. SPARK 2014 is a complete re-design of the language and supporting verification tools. The SPARK language consists of a well-defined subset of the Ada language that uses contracts to describe the specification of components in a form that is suitable for both static and dynamic verification. In SPARK83/95/2005, the contracts are encoded in Ada comments (and so are ignored by any standard Ada compiler), but are processed by the SPARK \"Examiner\" and its associated tools. SPARK 2014, in contrast, uses Ada 2012's built-in \"aspect\" syntax to express contracts, bringing them into the core of the language. The main tool for SPARK 2014 (GNATprove) is based on the GNAT/GCC infrastructure, and re-uses almost the entirety of the GNAT Ada 2012 front-end.", "pageId": 291874, "dailyPageViews": 194, "created": 2003, "backlinksCount": 54, "revisionCount": 202, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/SPARK_(programming_language)" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SPARK", "tiobe": { "id": "SPARK" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2518", "packageRepository": [ "https://spark-packages.org/" ], "fileType": "text", "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2015|CreateSpace Independent Publishing Platform|A collection of Advanced Data Science and Machine Learning Interview Questions Solved in Python and Spark (II): Hands-on Big Data and Machine ... of Programming Interview Questions)|Gulli, Dr Antonio|9781518678646\n2016|Packt Publishing|Apache Spark 2 for Beginners|Thottuvaikkatumana, Rajanarayanan|9781785885006\n2016|Packt Publishing|Spark for Data Science|Duvvuri, Srinivas and Singhal, Bikramaditya|9781785885655\n2015|Springer|Guide to High Performance Distributed Computing: Case Studies with Hadoop, Scalding and Spark (Computer Communications and Networks)|Srinivasa, K.G. and Muppalla, Anil Kumar|9783319134963\n20200611|Springer Nature|Beginning Apache Spark Using Azure Databricks|Robert Ilijason|9781484257814\n2015|O'Reilly Media, Inc.|Learning Spark|Holden Karau; Andy Konwinski; Patrick Wendell; Matei Zaharia|9781449359058\n2017|Packt Publishing|Scala and Spark for Big Data Analytics: Explore the concepts of functional programming, data streaming, and machine learning|Karim, Md. Rezaul and Alla, Sridhar|9781783550500\n2017|Packt Publishing|Frank Kane's Taming Big Data with Apache Spark and Python|Kane, Frank|9781787288300\n2016|Sams Publishing|Apache Spark in 24 Hours, Sams Teach Yourself|Aven, Jeffrey|9780672338519\n2015|Packt Publishing|Spark Cookbook|Yadav, Rishi|9781783987078\n2018|Apress|Beginning Apache Spark 2: With Resilient Distributed Datasets, Spark SQL, Structured Streaming and Spark Machine Learning library|Luu, Hien|9781484235799\n2018|Addison-Wesley Professional|Data Analytics with Spark Using Python (Addison-Wesley Data & Analytics Series)|Aven, Jeffrey|9780134844879\n2015|Apress|Big Data Analytics with Spark: A Practitioner's Guide to Using Spark for Large Scale Data Analysis|Guller, Mohammed|9781484209646\n2019-07-06T00:00:01Z|Apress|Scala Programming for Big Data Analytics: Get Started With Big Data Analytics Using Apache Spark|Elahi, Irfan|9781484248096\n2017|Packt Publishing|Building Data Streaming Applications with Apache Kafka: Design, develop and streamline applications using Apache Kafka, Storm, Heron and Spark|Kumar, Manish and Singh, Chanchal|9781787287631\n2008|No Starch Press|LEGO MINDSTORMS NXT One-Kit Wonders: Ten Inventions to Spark Your Imagination|James Floyd Kelly and Matthias Paul Scholz and Christopher R. Smith and Martijn Boogaarts and Jonathan Daudelin and Eric D. Burdo and Laurens Valk and BlueTooth Kiwi|9781593271886\n2015|Packt Publishing|Apache Spark Graph Processing|Ramamonjison, Rindra|9781784398958\n2017-07-25T00:00:01Z|Packt Publishing|Scala and Spark for Big Data Analytics: Explore the concepts of functional programming, data streaming, and machine learning|Karim, Md. Rezaul and Alla, Sridhar|9781785280849\n2018|Packt Publishing|Apache Spark Deep Learning Cookbook: Over 80 recipes that streamline deep learning in a distributed environment with Apache Spark|Sherif, Ahmed and Ravindra, Amrith|9781788471558\n2016|Packt Publishing|Fast Data Processing with Spark 2 - Third Edition|Sankar, Krishna|9781785882968\n2017|Packt Publishing|Apache Spark 2.x Cookbook: Cloud-ready recipes for analytics and data science|Yadav, Rishi|9781787127517\n2018|Packt Publishing|Scala Programming Projects: Build real world projects using popular Scala frameworks like Play, Akka, and Spark|Valot, Mikael and Jorand, Nicolas|9781788397643", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|Spark SQL: Relational Data Processing in Spark|10.1145/2723372.2742797|1155|207|Michael Armbrust and Reynold Xin and Cheng Lian and Yin Huai and Davies Liu and Joseph K. Bradley and X. Meng and Tomer Kaftan and M. Franklin and A. Ghodsi and M. Zaharia|ada0b87cd5c30d31186c38fb12e631d29426a3bf\n2016|Big data analytics on Apache Spark|10.1007/s41060-016-0027-9|154|9|Salman Salloum and Ruslan Dautov and Xiaojun Chen and P. Peng and J. Huang|ac11fc3acdf5233bda411dee6d72a424e0b33c4e\n2016|SparkR: Scaling R Programs with Spark|10.1145/2882903.2903740|64|6|S. Venkataraman and Zongheng Yang and Davies Liu and Eric Liang and H. Falaki and X. Meng and Reynold Xin and A. Ghodsi and M. Franklin and I. Stoica and M. Zaharia|e15af92a24901d442e04cfc302cfd97690c76567\n2015|Big Data Analytics with Spark|10.1007/978-1-4842-0964-6|46|3|M. Guller|25f55b9bf29625ba1ea3195954bc4e13896218c0\n2016|An Apache Spark Implementation for Sentiment Analysis on Twitter Data|10.1007/978-3-319-57045-7_2|28|1|Alexandros Baltas and Andreas Kanavos and A. Tsakalidis|33a041e8f6e5f535967963744df2944ea055f73f\n2015|Collaborative filtering recommendation algorithm based on Hadoop and Spark|10.1109/ICIT.2015.7125310|24|1|B. Kupisz and O. Unold|a8cfb27e02c645844e52a0b1e4cc8223a14df450\n2014|Verification and testing of mobile robot navigation algorithms: A case study in SPARK|10.1109/IROS.2014.6942753|16|0|P. Trojanek and K. Eder|1f7f84ca0cf9f80ada0171b7688333f0f767ce1f\n2019|Accelerating Apache Spark with FPGAs|10.1002/cpe.4222|15|1|Ehsan Ghasemi and P. Chow|5c9632977246f144e7ded8aa0434f346b3954f0b\n2016|Accelerating Apache Spark Big Data Analysis with FPGAs|10.1109/UIC-ATC-ScalCom-CBDCom-IoP-SmartWorld.2016.0119|9|1|Ehsan Ghasemi and P. Chow|64bc5eaea64aff8058389fc99ae9bbc028cbb752\n2016|Processing large-scale data with Apache Spark|10.5351/KJAS.2016.29.6.1077|7|0|Seyoon Ko and Joong-Ho Won|6cc2ec3e364f5e43d007aac98dad5a699deab269\n2017|A comparative between hadoop mapreduce and apache Spark on HDFS|10.1145/3109761.3109775|7|1|Mohamed Saouabi and Abdellah Ezzati|658dc31f6816c51eba77bf82ca1eab4a25812deb\n2015|Vispark: GPU-accelerated distributed visual computing using spark|10.1137/15M1026407|5|0|Woohyuk Choi and Sumin Hong and W. Jeong|2d8d418428b4136b16bd19b2cde9f9687f7a0493\n2016|Accelerating Apache Spark Big Data Analysis with FPGAs|10.1109/FCCM.2016.33|5|0|Ehsan Ghasemi and P. Chow|9490f7fef5e522a37325d2ac93a9e90b4dfe0847\n2018|Property-Based Testing for Spark Streaming|10.1017/S1471068419000012|5|0|A. Riesco and J. Rodríguez-Hortalá|3cae1a0770719faee2ac310fce3caba8809baa6e\n2019|Practical Application of SPARK to OpenUxAS|10.1007/978-3-030-30942-8_45|4|0|M. Aiello and Claire Dross and P. Rogers and Laura R. Humphrey and James Hamil|9318d3a58cc12d1f805081980d9544f5af6e3e21\n2011|Software vulnerabilities precluded by spark|10.1145/2070337.2070356|3|0|Joyce L. Tokar and F. D. Jones and P. Black and Chris E. Dupilka|7e7088d89c49024a330ec2be2ba3d53dc65bde23\n2019|SWRL Parallel Reasoning Method with Spark SQL|10.1109/icis46139.2019.8940207|3|0|Wan Li and Huaai Kang and Dongbo Ma and Weiwei Wei|fd6f4d41bf848523ab01b02e0d3438a4aec0fa50\n2020|SWRL Parallel Reasoning Implementation with Spark SQL|10.1088/1757-899X/719/1/012020|3|0|Wan Li and Huaai Kang and Dongbo Ma and Weiwei Wei|a84fa79f3f38fa34859e323e092d24b19467278b\n2016|DatalogRA: datalog with recursive aggregation in the spark RDD model|10.1145/2960414.2960417|2|0|Marek Rogala and J. Hidders and J. Sroka|1deb70b80cdbc0b1847816d0a945e202c3d0755e\n2016|Optimized Parallelization of Binary Classification Algorithms Based on Spark|10.1109/ISCID.2016.2028|2|0|Yushui Geng and Jianguo Zhang|85a2aec6505a0f356c0abe323937b43fe0719d17\n2016|Large-Scale Text Similarity Computing with Spark|10.14257/IJGDC.2016.9.4.09|2|0|Xiaoan Bao and Dai Shichao and N. Zhang and Chenghai Yu|ca1ca96b823cca3696db83ad1dd4b36c79060390\n2018|Performance Analysis Using Apriori Algorithm Along with Spark and Python|10.1145/3277104.3277108|2|0|F. Gao and C. Bhowmick and Jiangjiang Liu|042691aff45e64f931394ab5fc810c93cc165e97\n2019|Teaching Deductive Verification Through Frama-C and SPARK for Non Computer Scientists|10.1007/978-3-030-32441-4_2|2|0|Léo Creuse and Claire Dross and C. Garion and J. Hugues and Joffrey Huguet|fdbc7321e5bed553d0971d3420a9a4b40aff23d4\n2020|Performance evaluation of Apache Hadoop and Apache Spark for parallelization of compute-intensive tasks|10.1145/3428757.3429121|2|0|Alexander Döschl and Max-Emanuel Keller and P. Mandl|c5721b160564d5fa45473020874189c5db20ae9a\n2017|Spark and Scala (keynote)|10.1145/3136000.3148042|1|0|Reynold Xin|f793547799d7d6fb7470ccc879bf2735bb34315b\n2019|Processing Large Raster and Vector Data in Apache Spark|10.18420/btw2019-43|1|0|Stefan Hagedorn and O. Birli and K. Sattler|c03fd819fe32f9aebe52e97a1a6fa836be4474bf\n2020|Comparison of MPI and Spark for Data Science Applications|10.1109/ipdpsw50202.2020.00123|1|0|Manvi Saxena and S. Jha and Saba Khan and John Rodgers and P. Lindner and E. Gabriel|786aaf60ab08643849817b57914cac8fdd33e6b4\n2020|Translation of Array-Based Loops to Spark SQL|10.1109/BigData50022.2020.9378136|1|0|Md Hasanuzzaman Noor and L. Fegaras|234ba3a287178ddce5af915d5c16950d3e0a4064\n2020|A Study of Big Data Analytics using Apache Spark with Python and Scala|10.1109/ICISS49785.2020.9315863|1|0|Y. Gupta and Surbhi Kumari|b932ecaf6825fb5a8b838dab9a0e66e7cea3eabf\n2021|Integration of Cassandra and Spark in Computer Aided Drug Design|10.32628/CSEIT217112|1|0|R. NithaV|c558ef5553fdf5eaaac4c69fbaa6e631f53159c9" }, "sparqcode": { "title": "SPARQCode", "appeared": 2010, "type": "barCodeFormat", "wikipedia": { "url": "https://en.wikipedia.org/wiki/SPARQCode" } }, "sparql": { "title": "SPARQL", "appeared": 2008, "type": "queryLanguage", "webRepl": [ "https://dbpedia.org/sparql" ], "documentation": [ "https://www.w3.org/TR/rdf-sparql-query/", "https://docs.stardog.com/tutorials/learn-sparql" ], "reference": [ "https://www.w3.org/TR/rdf-sparql-query/" ], "cheatSheetUrl": [ "http://www.iro.umontreal.ca/~lapalme/ift6281/sparql-1_1-cheat-sheet.pdf" ], "standsFor": "SPARQL Protocol and RDF Query Language", "originCommunity": [ "W3C" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasFloats": { "example": "# [+\\-]?(\\d+\\.\\d*[eE][+-]?\\d+|\\.?\\d+[eE][+-]?\\d+)", "value": true }, "hasIntegers": { "example": "# [+\\-]?\\d+", "value": true }, "lineCommentToken": [ [ "#" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "add", "as", "asc", "ask", "base", "by", "clear", "construct", "copy", "create", "data", "delete", "desc", "describe", "distinct", "drop", "false", "filter", "from", "graph", "group", "having", "in", "insert", "limit", "load", "minus", "move", "named", "not", "offset", "optional", "order", "prefix", "reduced", "select", "service", "silent", "to", "true", "undef", "union", "using", "values", "where", "with" ], "wikipedia": { "example": [ "PREFIX ex: \nSELECT ?capital\n ?country\nWHERE\n {\n ?x ex:cityname ?capital ;\n ex:isCapitalOf ?y .\n ?y ex:countryname ?country ;\n ex:isInContinent ex:Africa .\n }" ], "related": [ "rdf", "sql", "xquery", "turtle", "geo-ml" ], "summary": "SPARQL (pronounced \"sparkle\", a recursive acronym for SPARQL Protocol and RDF Query Language) is an RDF query language, that is, a semantic query language for databases, able to retrieve and manipulate data stored in Resource Description Framework (RDF) format. It was made a standard by the RDF Data Access Working Group (DAWG) of the World Wide Web Consortium, and is recognized as one of the key technologies of the semantic web. On 15 January 2008, SPARQL 1.0 became an official W3C Recommendation, and SPARQL 1.1 in March, 2013. SPARQL allows for a query to consist of triple patterns, conjunctions, disjunctions, and optional patterns. Implementations for multiple programming languages exist. There exist tools that allow one to connect and semi-automatically construct a SPARQL query for a SPARQL endpoint, for example ViziQuer. In addition, there exist tools that translate SPARQL queries to other query languages, for example to SQL and to XQuery.", "pageId": 2574343, "dailyPageViews": 379, "created": 2005, "backlinksCount": 480, "revisionCount": 380, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/SPARQL" }, "githubLanguage": { "fileExtensions": [ "sparql", "rq" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "codemirrorMode": "sparql", "codemirrorMimeType": "application/sparql-query", "tmScope": "source.sparql", "repos": 0, "id": "SPARQL" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/sparql", "monaco": "sparql", "codeMirror": "sparql", "pygmentsHighlighter": { "filename": "rdf.py", "fileExtensions": [ "rq", "sparql" ], "id": "SPARQL" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2015, "committerCount": 2, "commitCount": 128, "sampleCount": 2, "example": [ "PREFIX foaf: \nSELECT ?name ?email\nWHERE {\n ?person a foaf:Person.\n ?person foaf:name ?name.\n ?person foaf:mbox ?email.\n}\n" ], "url": "https://github.com/peta/turtle.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/stardog-union/stardog-language-servers/tree/master/packages/sparql-language-server\nwrittenIn typescript" ], "leachim6": { "filepath": "s/SparQL.sparql", "fileExtensions": [ "sparql" ], "example": [ "SELECT ?h WHERE { \n VALUES ?h { \"Hello World\" } \n}\n" ], "id": "SparQL" }, "jupyterKernel": [ "https://github.com/paulovn/sparql-kernel" ], "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2013|O'Reilly Media|Learning SPARQL: Querying and Updating with SPARQL 1.1|DuCharme, Bob|9781449371432\n2014|Morgan Kaufmann|RDF Database Systems: Triples Storage and SPARQL Query Processing|Curé, Olivier and Blin, Guillaume|9780127999579\n20130703|O'Reilly Media, Inc.|Learning SPARQL|Bob DuCharme|9781449371487\n20130703|O'Reilly Media, Inc.|Learning SPARQL|Bob DuCharme|9781449371470", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2007|From SPARQL to rules (and back)|10.1145/1242572.1242679|220|19|A. Polleres|f0cab66649c3593b8defc7c7989d84b4acae2c2d\n2011|PigSPARQL: mapping SPARQL to Pig Latin|10.1145/1999299.1999303|112|12|A. Schätzle and Martin Przyjaciel-Zablocki and G. Lausen|81836d9086683ceab2af97428dffbab6004d4a6b\n2016|Sparklis: An expressive query builder for SPARQL endpoints with guidance in natural language|10.3233/SW-150208|111|6|S. Ferré|fd8a81c0b066eb23b38659f95fdd83ce29d3b3c6\n2017|A SPARQL Extension for Generating RDF from Heterogeneous Formats|10.1007/978-3-319-58068-5_3|98|9|M. Lefrançois and Antoine Zimmermann and Noorani Bakerally|4a109ebd285f579e3daa3a11bafdb9b7894cbd0b\n2013|Sorry, i don't speak SPARQL: translating SPARQL queries into natural language|10.1145/2488388.2488473|98|2|A. N. Ngomo and Lorenz Bühmann and Christina Unger and Jens Lehmann and D. Gerber|0d985477fe44764f6bd2fe9a6bfa38ff048a8333\n2016|AskNow: A Framework for Natural Language Query Formalization in SPARQL|10.1007/978-3-319-34129-3_19|70|8|Mohnish Dubey and Sourish Dasgupta and A. Sharma and Konrad Höffner and Jens Lehmann|9e163940219265fc4595bb3c66f7a35f83b2943f\n2018|Dynamic Linked Data: A SPARQL Event Processing Architecture|10.3390/fi10040036|37|0|L. Roffia and Paolo Azzoni and Cristiano Aguzzi and Fabio Viola and Francesco Antoniazzi and T. S. Cinotti|f9896a40e497b74caabf5ef7f25db77f51689ac0\n2013|SQUALL: A Controlled Natural Language as Expressive as SPARQL 1.1|10.1007/978-3-642-38824-8_10|30|7|S. Ferré|3eadd38475cfad8e4267b946550f04add0252269\n2014|Towards the Novel Reasoning among Particles in PSO by the Use of RDF and SPARQL|10.1155/2014/121782|24|0|Iztok Fister and Xin-She Yang and Karin Ljubič and D. Fister and J. Brest and Iztok Fister|27cd8f658901437c5217cd34b927b81ec0eac466\n2015|Linked Data Queries as Jigsaw Puzzles: a Visual Interface for SPARQL Based on Blockly Library|10.1145/2808435.2808467|6|0|P. Bottoni and Miguel Ceriani|195e38b8701bae75bc634d60e7df2fe91cfddbb0\n2009|SWOBE - embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the satisfiability of queries and for the determination of query result types|10.1145/1529282.1529561|4|0|Sven Groppe and Jana Neumann and V. Linnemann|4b64a186f0a10be716c051f666cdeac1a851bed7\n2017|Authorization Proxy for SPARQL Endpoints|10.1007/978-3-319-67597-8_20|3|0|Riste Stojanov and Milos Jovanovik|ba91a4697df0f4e3143b8609dd0f12ab3851ea97\n2017|Generation of Test Questions from RDF Files Using PYTHON and SPARQL|10.1088/1742-6596/806/1/012009|3|0|A. Omarbekova and A. Sharipbay and A. Barlybaev|74dd69c8377529e55c41ae7f8d6585be47653248\n2019|Tuning Fuzzy SPARQL Queries in a Fuzzy Logic Programming Environment|10.1109/FUZZ-IEEE.2019.8858958|3|0|J. Almendros-Jiménez and A. Becerra-Terón and G. Moreno and J. A. Riaza|42f59c1c7c434aae1f4d8f4d2ab4fcd46337cab2\n2020|An Approach of Automatic SPARQL Generation for BIM Data Extraction|10.3390/app10248794|2|0|Dongming Guo and Erling Onstein and Angela Daniela La Rosa|09a17efd129440582beae6d906eadc6e1b017671\n2020|DaRLing: A Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries|10.1017/S1471068420000204|2|0|A. Fiorentino and J. Zangari and M. Manna|a186269b94b12386891b504f5a886da8e23aac89\n2017|The Quranic Nature Ontology: From Sparql Endpoint to Java Application and Reasoning|10.11113/IJIC.V7N2.140|1|0|S. Khan and Mohammed Mahmudur Rahman and A. B. M. S. Sadi and T. Anwar and S. Mohammed and S. A. Chowdhury|d0f7a30d99cc0d8e5041e91cd525ec4ec6a49704\n2019|SQL2SPARQL4RDF: Automatic SQL to SPARQL Conversion for RDF Querying|10.1145/3372938.3372968|1|0|Ahmed Abatal and Khadija Alaoui and L. Alaoui and M. Bahaj|894a309620c4613fe4dddef4da8f7b4f38fe1218" }, "spatial": { "title": "Spatial", "appeared": 2018, "type": "pl", "creators": [ "David Koeplinger" ], "description": "Spatial: A High Level Programming Language for FPGAs", "website": "https://spatial-lang.org/", "standsFor": "Specify Parameterized Accelerators Through Inordinately Abstract Language", "domainName": { "registered": 2018, "name": "spatial-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "import spatial.dsl._\n\n@spatial object HelloSpatial extends SpatialApp {\n def main(args: Array[String]): Void = {\n // Create ArgIn\n val x = ArgIn[Int]\n \n // Set `x` to the value of the first command line argument\n setArg(x, args(0).to[Int])\n \n Accel {\n // Create 16x32 SRAM and a Register\n val s = SRAM[Int](16,32)\n val r = Reg[Int]\n \n // Loop over each element in SRAM\n Foreach(16 by 1, 32 by 1){(i,j) => \n s(i,j) = i + j\n }\n // Store element into the register, based on the input arg\n r := s(x,x)\n\n // Print value of register (only shows in Scala simulation)\n println(r\"Value of SRAM at (${x.value},${x.value}) is ${r.value}\")\n }\n\n }\n} " ], "githubRepo": { "firstCommit": 2017, "stars": 225, "forks": 30, "subscribers": 21, "created": 2018, "updated": 2022, "description": "Spatial: \"Specify Parameterized Accelerators Through Inordinately Abstract Language\"", "issues": 70, "url": "https://github.com/stanford-ppl/spatial" }, "repoStats": { "firstCommit": 2017, "commits": 4575, "committers": 22, "files": 2376 }, "fileType": "text", "wordRank": 6389, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|ISTE Press - Elsevier|Agent-Based Spatial Simulation with NetLogo Volume 1|Banos, Arnaud and Lang, Christophe and Marilleau, Nicolas|9781785480553\n2015|SAGE Publications Ltd|An Introduction to R for Spatial Analysis and Mapping|Brunsdon, Chris and Comber, Lex|9781446272947\n20181207|Taylor & Francis|Spatial Data Analysis in Ecology and Agriculture Using R|Richard E. Plant|9781351189897\n2002|London ; Taylor & Francis, 2002.|Java Programming For Spatial Sciences|Jo Wood|9780203166178\n1975|Iowa State Pr|Spatial Sector Programming Models In Agriculture|Earl O. Heady and Uma K. Srivastava|9780813815756\n1971|Methuen|Combinatorial Programming, Spatial Analysis And Planning|Allen John Scott|9780416665109\n2015|Springer|Spatial Auditory Human-Computer Interfaces (SpringerBriefs in Computer Science)|Sodnik, Jaka and Tomažič, Sašo|9783319221113\n2008|Springer|Open Source Approaches in Spatial Data Handling (Advances in Geographic Information Science Book 2)||9783540748311\n1998|Ios Pr Inc|Qualitative Spatial Reasoning Theory And Practice: Theory And Practice--application To Robot Navigation (frontiers In Artificial Intelligence And Applications, 47)|M.t. Escrig|9789051994124\n2009|Springer|Spatial Information Theory: 9th International Conference, COSIT 2009, Aber Wrac'h, France, September 21-25, 2009, Proceedings (Lecture Notes in Computer Science (5756))||9783642038310\n2015|SAGE Publications Ltd|An Introduction to R for Spatial Analysis and Mapping|Brunsdon, Chris and Comber, Lex|9781446272954\n2020|Springer|Spatial Modeling in Forest Resources Management: Rural Livelihood and Sustainable Development (Environmental Science and Engineering)||9783030565411\n2012|Springer|Decentralized Spatial Computing: Foundations of Geosensor Networks|Duckham, Matt|9783642308536" }, "speakeasy": { "title": "Speakeasy", "appeared": 2006, "type": "pl", "creators": [ "Stanley Cohen" ], "website": "http://speakeasy.com", "domainName": { "registered": 1998, "awisRank": { "2022": 3410715 }, "name": "speakeasy.com" }, "wikipedia": { "example": [ "$ In the following statement \n$ selector must be >= 1 and <= N\n\nGO TO label1, label2, ..., labelN : selector \n...\nlabel1:\n...\nlabel2:\n...\n...\nlabelN:\n..." ], "related": [ "mortran", "c", "solaris", "apl", "matlab", "linux", "fortran" ], "summary": "Speakeasy is a numerical computing interactive environment also featuring an interpreted programming language. It was initially developed for internal use at the Physics Division of Argonne National Laboratory by the theoretical physicist Stanley Cohen. He eventually founded Speakeasy Computing Corporation to make the program available commercially. Speakeasy is a very long-lasting numerical package. In fact, the original version of the environment was built around a core dynamic data repository called \"Named storage\" developed in the early 1960s, while the most recent version has been released in 2006. Speakeasy was aimed to make the computational work of the physicists at the Argonne National Laboratory easier. It was initially conceived to work on mainframes (the only kind of computers at that time), and was subsequently ported to new platforms (minicomputers, personal computers) as they became available. The porting of the same code on different platforms was made easier by using Mortran metalanguage macros to face systems dependencies and compilers deficiencies and differences. Speakeasy is currently available on several platforms : PCs running Windows, macOS, Linux, departmental computers and workstations running several flavors of Linux, AIX or Solaris. Speakeasy was also among the first interactive numerical computing environments, having been implemented in such a way on a CDC 3600 system, and later on IBM TSO machines as one was in beta-testing at the Argonne National Laboratory at the time. Almost since the beginning (as the dynamic linking functionality was made available in the operating systems) Speakeasy features the capability of expanding its operational vocabulary using separated modules, dynamically linked to the core processor as they are needed. For that reason such modules were called \"linkules\" (LINKable-modULES). They are functions with a generalized interface, which can be written in FORTRAN or in C. The independence of each of the new modules from the others and from the main processor is of great help in improving the system, especially it was in the old days. This easy way of expanding the functionalities of the main processor was often exploited by the users to develop their own specialized packages. Besides the programs, functions and subroutines the user can write in the Speakeasy's own interpreted language, linkules add functionalities carried out with the typical performances of compiled programs. Among the packages developed by the users, one of the most important is \"Modeleasy\", originally developed as \"FEDeasy\" in the early 1970s at the research department of the Federal Reserve Board of Governors in Washington D.C.. Modeleasy implements special objects and functions for large econometric models estimation and simulation. Its evolution led eventually to its distribution as an independent product.", "pageId": 24641580, "created": 2009, "backlinksCount": 81, "revisionCount": 126, "dailyPageViews": 15, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Speakeasy_(computational_environment)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=660", "twitter": "https://twitter.com/heyspeakeasy", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "spec-sharp": { "title": "Spec Sharp", "appeared": 2004, "type": "pl", "wikipedia": { "example": [ "static int Main(string![] args)\n requires args.Length > 0;\n ensures return == 0;\n {\n foreach(string arg in args)\n {\n Console.WriteLine(arg);\n }\n return 0;\n }" ], "related": [ "csharp", "eiffel", "java" ], "summary": "Spec# is a programming language with specification language features that extends the capabilities of the C# programming language with Eiffel-like contracts, including object invariants, preconditions and postconditions. Like ESC/Java, it includes a static checking tool based on a theorem prover that is able to statically verify many of these invariants. It also includes a variety of other minor extensions to the language, such as non-null reference types. The code contracts API in the .NET Framework 4.0 has evolved with Spec#. Microsoft Research developed both Spec# and C#; in turn, Spec# serves as the foundation of the Sing# programming language, which Microsoft Research also developed.", "created": 2005, "backlinksCount": 82, "pageId": 3078904, "revisionCount": 74, "dailyPageViews": 16, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Spec_Sharp" }, "centralPackageRepositoryCount": 0 }, "spec": { "title": "Spec", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1586e884530ba49ebb7f01ef767db0df56df71f9" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1597", "wordRank": 6331, "centralPackageRepositoryCount": 0 }, "specl": { "title": "SPECL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/1f6ab415013766ba3d43b4eb5297d7906436a837" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3899", "centralPackageRepositoryCount": 0 }, "specol": { "title": "SPECOL", "appeared": 1968, "type": "pl", "reference": [ "https://semanticscholar.org/paper/cfbe65b69c50cf500260f3bf2434c04f90387e7e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3229", "centralPackageRepositoryCount": 0 }, "specrtl": { "title": "specrtl", "appeared": 2011, "type": "pl", "description": "specRTL (Spec Register Transfer Language) is a language designed to replace the existing RTL form machine descriptions which along with C Code forms the backend of GCC.", "reference": [ "https://www.cse.iitb.ac.in/grc/software/specRTL/specRTL.pdf" ], "example": [ "concrete *cmp_ccno_1.insn instantiates set_compare\n{\n root(reg(NULL:FLAGS_REG),0=nonimmediate_operand:SWI:\",?m\",\n1=const0_operand:SWI:\"\");\n}\n{:\n \"ix86_match_ccmode (insn, CCNOmode)\"\n \"@\n test{}\\t%0, %0\n cmp{}\\t{%1, %0|%0,%1}\"\n [(set_attr \"type\" \"test,icmp\")\n (set_attr \"length_immediate\" \"0,1\")\n (set_attr \"mode\" \"\")]\n:}" ], "centralPackageRepositoryCount": 0 }, "speedcoding": { "title": "Speedcoding", "appeared": 1953, "type": "pl", "creators": [ "John Backus" ], "wikipedia": { "related": [ "assembly-language", "fortran", "algol-58", "basic", "c", "pl-i", "pact-i", "mumps", "ratfor", "short-code-computer-language" ], "summary": "Speedcoding or Speedcode was the first high-level programming language created for an IBM computer. The language was developed by John Backus in 1953 for the IBM 701 to support computation with floating point numbers. Here high level means symbolic and aiming for natural language expressivity as a goal as opposed to machine or hardware instruction oriented coding. The idea arose from the difficulty of programming the IBM SSEC machine when Backus was hired to calculate astronomical positions in early 1950. The speedcoding system was an interpreter and focused on ease of use at the expense of system resources. It provided pseudo-instructions for common mathematical functions: logarithms, exponentiation, and trigonometric operations. The resident software analyzed pseudo-instructions one by one and called the appropriate subroutine. Speedcoding was also the first implementation of decimal input/output operations. Although it substantially reduced the effort of writing many jobs, the running time of a program that was written with the help of Speedcoding was usually ten to twenty times that of machine code. The interpreter took 310 memory words, about 30% of the memory available on a 701.", "pageId": 6616312, "created": 2006, "backlinksCount": 16, "revisionCount": 53, "dailyPageViews": 63, "appeared": 1953, "url": "https://en.wikipedia.org/wiki/Speedcoding" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "speedie": { "title": "Speedie", "appeared": 2022, "type": "pl", "creators": [ "Theodore H Smith" ], "description": "\"General-purpose modern and clean object-oriented programming language.\"", "website": "http://github.com/gamblevore/speedie", "webRepl": [ "http://github.com/gamblevore/speedie" ], "documentation": [ "https://github.com/gamblevore/speedie/blob/main/Documentation" ], "emailList": [ "https://t.me/speedie_dev" ], "fileExtensions": [ "spd", "scproj" ], "country": [ "United Kingdom" ], "domainName": { "registered": 2023, "name": "speedie.dev" }, "supersetOf": [ "jeebox" ], "writtenIn": [ "speedie", "cpp" ], "related": [ "i-expressions", "json", "yaml", "toml", "xml", "haml", "ini", "grammar", "treenotation" ], "influencedBy": [ "javascript", "python", "c", "lua", "cpp", "visual-basic", "hypercard", "html", "css", "xml", "json" ], "visualParadigm": false, "hasPartialApplication": { "example": "\nmain\n\"hello world ${app.args[0]}\"\n", "value": true }, "hasMultipleDispatch": { "example": "", "value": false }, "hasMaps": { "example": "|| x = [\"a\":\"Apple\", \"b\":\"Bird\", \"c\":\"Cat\"]\nprintline x[\"b\"] // Bird", "value": true }, "hasPipes": { "example": "", "value": true }, "hasManualMemoryManagement": { "example": "", "value": false }, "hasPolymorphism": { "example": "|object| x = somefunction()\n|| y = x.render // returns a string by calling the virtual func \"render\"", "value": true }, "hasAssertStatements": { "example": "class Person\n |int| age\n setter age\n // \"expect\" will actually add an Error to a list of errors\n expect (value >= 0) (\"bad age $value set!\")\n .age = value\n\nmain\n || p = person()\n p.age = -10\n if !stderr.ok\n \"Oof we got some errors\"", "value": true }, "hasDocComments": { "example": "function Find (|string| pattern, |int| pos=0, |int|)\n description \"Returns the position of pattern in self, starting from 'pos'. If not found, we return -1.\"", "value": true }, "hasUnicodeIdentifiers": { "example": "class é©©\n constructor\n printline .class.name // \"é©©\"", "value": true }, "hasDefaultParameters": { "example": "function Find (|string| pattern, |int| pos=0, |int|)", "value": true }, "hasMagicGettersAndSetters": { "example": "", "value": true }, "hasMacros": { "example": "", "value": true }, "hasTypeInference": { "example": "|| x = \"Hello\"\n|| y = FunctionThatReturnsAString() // is now a string\nx = 1 // fails to compile\ny = 2 // fails to compile", "value": true }, "hasStaticTyping": { "example": "|| x = \"Hello\"\nx = 1 // fails to compile... because x is a string", "value": true }, "hasIncrementAndDecrementOperators": { "example": "|| x = 1\nx++\nx--", "value": true }, "hasSingleDispatch": { "example": "|| x = \"str\"\n|| i = x.find(\"t\")", "value": true }, "hasModules": { "example": "module App\n function Path (|string|)\n // return the app's path here", "value": true }, "hasExplicitTypeCasting": { "example": "|| x = message()\n|| y = x|object| // lose type info\n|| z = y|message| // regain it", "value": true }, "hasStructs": { "example": "struct Fuel\n |int| A\n |byte| B", "value": true }, "hasEnums": { "example": "flags\n A\n B\n C\n D\n// A=1, B=2, C=4, D=8\nconstants\n X\n Y\n Z\n W\n// X=0, Y=1, Z=3, W=4", "value": true }, "canWriteToDisk": { "example": "\"helloworld.txt\" <~ \"Hello, world!\\n\"", "value": true }, "hasDuckTyping": { "example": "", "value": false }, "hasRegularExpressionsSyntaxSugar": { "example": "", "value": false }, "isCaseSensitive": { "example": "|| Same = \"x\" == \"X\" // same = false", "value": true }, "hasCaseInsensitiveIdentifiers": { "example": "if \"abc\".LeNgTh == 3\n \"cool length\"", "value": true }, "hasTernaryOperators": { "example": "while\n printline (1,0)(random[]>0.5)", "value": true }, "hasMessagePassing": { "example": "|| chld = app.fork(\"ipc_identifier_123\", app.rawargs)\nchld <~ \"send message\"\nprintline chld.get // receive message", "value": true }, "hasBitWiseOperators": { "example": "x << y", "value": true }, "canDoShebang": { "example": "#!/usr/local/bin/spd", "value": true }, "hasSymbolTables": { "example": "", "value": true }, "hasDynamicProperties": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasContinue": { "example": "for i in 10\n if i < 5: continue\n printline i // 6,7,8,9", "value": true }, "hasBreak": { "example": "for i in 10\n if i > 3: exit\n printline i // 1,2,3", "value": true }, "hasConstants": { "example": "constants\n Opened = 1\n Closed = 2", "value": true }, "hasGarbageCollection": { "example": "|| msg = message()\nDoSomethingWith(msg)\n// msg now gets disposed\n", "value": true }, "hasComments": { "example": "// comment", "value": true }, "hasMultiLineComments": { "example": "/*\nmultiline\ncomments\n*/", "value": true }, "hasImports": { "example": "import Proj", "value": true }, "hasAssignment": { "example": "name = \"John\"", "value": true }, "hasWhileLoops": { "example": "while true\n \"hello\"", "value": true }, "hasForLoops": { "example": "while i in 10\n \"hello: $i\"", "value": true }, "hasEscapeCharacters": { "example": "|| str = \"\\01\\02\\03\"", "value": true }, "hasCharacters": { "example": "|| char = 'b'\nif b > 32\n \"good\"", "value": true }, "hasStringConcatOperator": { "example": "|| ab = \"a\" + \"b\"", "value": true }, "hasMemberVariables": { "example": "class abc\n |int| def", "value": true }, "hasTryCatch": { "example": "|| data = \"somefile\".file.readall\nif !data\n stderr.printerrors // prints any file-system error that occurred during .readall", "value": false }, "hasStatementTerminatorCharacter": { "example": "if x: x++, x*=2, return\n", "value": true }, "hasSelfOrThisWord": { "example": "self.Remove\n.remove", "value": true }, "hasRequiredMainFunction": { "example": "main\n \"hello world\"", "value": true }, "hasDynamicSizedArrays": { "example": "|| arr = []\narr <~ \"abc\"", "value": true }, "canReadCommandLineArgs": { "example": "printline app[0]", "value": true }, "hasFnArguments": { "example": "function ABC (|string| name)", "value": true }, "hasGlobalScope": { "example": "|| x = 123\nfunction abc\n x = 10", "value": true }, "hasVoidFunctions": { "example": "|| x = 123\nfunction abc\n x = 10", "value": true }, "hasMethodOverloading": { "example": "", "value": true }, "hasTimestamps": { "example": "printline __time_id__", "value": true }, "hasTypeParameters": { "example": "function ABC (|string| name)", "value": true }, "hasStaticMethods": { "example": "class abc\n module\n function Print\n \"abc\"\nmain\n abc.print", "value": true }, "hasVirtualFunctions": { "example": "class abc\n virtual DoSomething (|string| name)\n behaviour DoSomething\n printline \"hello: $name\"", "value": true }, "hasSourceMaps": { "example": "linkage\n bannedclasses (file, process, shellstream, archive)\n // using these classes... even indirectly, will create an error\n // the error message will show the entire call-chain that reached these classes", "value": true }, "supportsBreakpoints": { "example": "debugger", "value": true }, "hasInfixNotation": { "example": "seven = 3 + 4", "value": true }, "hasMultilineStrings": { "example": "\"hello\nyou\nbeauty\"", "value": true }, "hasHomoiconicity": { "example": "The~entire~Language is (%written in:@Jeebox)", "value": true }, "hasPointers": { "example": "|| i = 0\n|| p = &i\n*p = 1\nif (i == 1)\n \"success\"", "value": true }, "hasIntegers": { "example": "pldb = 80766866", "value": true }, "hasUnitsOfMeasure": { "example": "|| time = 1day - 10s\n|| size = 10.2MB", "value": true }, "hasLists": { "example": "myList = [1, 2, 3, 4, 5]", "value": true }, "hasFunctions": { "example": "function Example (|string| data)\n file <~ data", "value": true }, "hasOctals": { "example": "", "value": false }, "hasHexadecimals": { "example": "|| num = 0xBEEF", "value": true }, "hasFloats": { "example": "|| num = 0.0", "value": true }, "hasBinaryNumbers": { "example": "|| num = 0b010101", "value": true }, "hasConstructors": { "example": "class Foobar\n |float| x\n |float| y\n constructor (|float| r=1, |float| alpha=0)\n .x = r * alpha.cos\n .y = r * alpha.sin\n\n|| a = foobar()\n|| b = foobar(3)\n|| c = foobar(5, M_PI/4)", "value": true }, "hasIterators": { "example": "|| items = [5,6,7,8]\nfor i in items\n printline i", "value": true }, "hasForEachLoops": { "example": "|| items = [5,6,7,8]\nfor i in items\n printline i", "value": true }, "hasSingleTypeArrays": { "example": "|array of string| s\ns <~ \"abc\" // ok\ns <~ 1 // fail", "value": true }, "hasReservedWords": { "example": "|| return = 123\n|| if = 456\nif if == 456\n return return", "value": false }, "hasFunctionOverloading": { "example": "function volume (|float| a, |float|)\n return a*a*a\nfunction volume (|float| r, |float| h, |float|)\n // volume of a cylinder\n return math.pi*r*r*h", "value": true }, "hasNamespaces": { "example": "", "value": false }, "hasMultipleInheritance": { "example": "", "value": false }, "hasOperatorOverloading": { "example": "str = \"a\" + \"b\"\narray <~ str", "value": true }, "hasUserDefinedOperators": { "example": "class myclass\n |int| Num\n operator add (|int| x, |myclass|)\n return myclass(.num + x)\n render\n fs <~ .num\n\nmain\n || x = myclass(1)\n || y = myclass(2)\n || z = y + x\n printline z", "value": true }, "hasUnaryOperators": { "example": "|| x = !0", "value": true }, "hasNull": { "example": "|| msg = message()\nwhile\n if msg != nil\n \"msg exists\"\n else\n \"empty\"\n return\n msg = nil", "value": true }, "hasSemanticIndentation": { "example": "class Person\n |string| name", "value": true }, "hasInheritance": { "example": "class Person (Animal)", "value": true }, "hasAccessModifiers": { "example": "class Person\n |int| age\n setter age\n expect (value >= 0) (\"bad age $value set!\")\n .age = value\nmain\n || p = person()\n p.age = -1 // calls a function rather than the property\n || n = p.age // reads the property directly!", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasDisposeBlocks": { "example": "using SomeObject\n for 10\n Someobject.dosomework\n if (random[]>0.5)\n return // someobject.SyntaxUsingComplete called here\n// someobject.SyntaxUsingComplete called here too", "value": true }, "hasPrintDebugging": { "example": "\"error 1 here\"", "value": true }, "hasZeroBasedNumbering": { "example": "printline [\"a\", \"b\", \"c\"][0] // prints \"a\"", "value": true }, "hasTemplates": { "example": "", "value": false }, "hasThreads": { "example": "", "value": false }, "hasClasses": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "print" ] ], "assignmentToken": [ [ "=" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "#require", "#expect", "#error", "and", "asm", "break", "class", "continue", "else", "elseif", "false", "for", "if", "is", "in", "import", "module", "or", "return", "require", "expect", "error", "virtual", "behaviour", "function", "syntax", "syx", "self", "true", "with", "yield", "while", "xor" ], "githubLanguage": { "fileExtensions": [ "spd", "scproj" ], "type": "programming", "tmScope": "source.spd", "id": "Speedie" }, "helloWorldCollection": [ "main\n \"Hello World!\"" ], "pypl": "spd", "twitter": "https://twitter.com/gamblevore", "gdbSupport": false, "fileType": "text" }, "spf-standard": { "title": "Sender Policy Framework", "appeared": 2000, "type": "standard", "wikipedia": { "url": "https://en.wikipedia.org/wiki/Sender_Policy_Framework" } }, "spice-lisp": { "title": "Spice Lisp", "appeared": 1980, "type": "pl", "creators": [ "Scott Fahlman" ], "wikipedia": { "related": [ "pascal", "c", "ada", "common-lisp" ], "summary": "Spice Lisp is a Lisp dialect and its implementation originally written by CMU's Spice Lisp Group which targeted the microcode of the 16-bit PERQ workstation and its Accent operating system; it used that workstation's microcode abilities (it provided microcodes for Pascal, C, and Ada besides) to implement a stack architecture to store its data structures as 32-bit objects and to enable runtime type-checking. It would later be popular on other workstations. Spice Lisp evolved into CMUCL, a Common Lisp implementation.", "created": 2006, "backlinksCount": 52, "pageId": 7460216, "revisionCount": 19, "dailyPageViews": 7, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Spice_Lisp" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3526", "centralPackageRepositoryCount": 0, "isbndb": "" }, "spice": { "title": "Spice", "appeared": 2021, "type": "pl", "website": "https://www.spicelang.com", "domainName": { "registered": 2021, "name": "spicelang.com" }, "hasIntegers": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "pygmentsHighlighter": { "filename": "spice.py", "fileExtensions": [ "spice" ], "id": "Spice" }, "isbndb": "year|publisher|title|authors|isbn13\n2020|Academic Press|Programming for Electrical Engineers: MATLAB and Spice|Squire Ph.D., James C. and Brown Ph.D., Julie Phillips|9780128215029" }, "spider": { "title": "spider", "appeared": 2014, "type": "pl", "creators": [ "Alon Gubkin" ], "website": "http://spiderlang.org/", "fileExtensions": [ "spider" ], "country": [ "Unknown" ], "compilesTo": [ "javascript" ], "hasInheritance": { "example": "", "value": true }, "githubRepo": { "stars": 1300, "forks": 46, "subscribers": 49, "created": 2014, "updated": 2017, "description": "Unsurprising JavaScript - No longer active", "url": "https://github.com/alongubkin/spider" }, "repoStats": { "firstCommit": 2014, "commits": 368, "committers": 10, "files": 159 } }, "spiderbasic": { "title": "SpiderBasic", "appeared": 2015, "type": "pl", "website": "https://www.spiderbasic.com/", "fileExtensions": [ "pb" ], "country": [ "France" ], "originCommunity": [ "Fantaisie Software" ], "hasInheritance": { "example": "", "value": true }, "keywords": [ "And", "Array", "Bool", "Break", "CallDebugger", "Case", "ClearStructure", "CompilerCase", "CompilerElse", "CompilerElseIf", "CompilerEndIf", "CompilerEndSelect", "CompilerIf", "CompilerSelect", "Continue", "CopyStructure", "Data", "DataSection", "Debug", "DebugLevel", "Declare", "DeclareModule", "Default", "Define", "Defined", "Dim", "DisableExplicit", "DisableDebugger", "DisableJS", "Else", "ElseIf", "EnableASM", "EnableExplicit", "EnableDebugger", "EnableJS", "End", "EndDataSection", "EndDeclareModule", "EndEnumeration", "EndIf", "EndImport", "EndInterface", "EndMacro", "EndModule", "EndProcedure", "EndSelect", "EndStructure", "EndWith", "Enumeration", "Extends", "For", "ForEach", "Forever", "Global", "Import", "IncludeFile", "IncludePath", "Interface", "List", "Macro", "MacroExpandedCount", "Map", "Module", "NewList", "NewMap", "Next", "Not", "OffsetOf", "Or", "Procedure", "ProcedureReturn", "Protected", "Prototype", "Read", "ReDim", "Repeat", "Restore", "Runtime", "Select", "Shared", "SizeOf", "Static", "Step", "Structure", "Subsystem", "Swap", "To", "TypeOf", "UndefineMacro", "Until", "UnuseModule", "UseModule", "Wend", "With", "While", "XIncludeFile", "XOr" ], "githubRepo": { "stars": 72, "forks": 49, "subscribers": 19, "created": 2019, "updated": 2022, "description": "PureBasic OpenSource Projects", "url": "https://github.com/fantaisie-software/purebasic" }, "repoStats": { "firstCommit": 2019, "commits": 325, "committers": 31, "files": 3510 } }, "spidermonkey": { "title": "SpiderMonkey", "appeared": 1996, "type": "vm", "creators": [ "Brendan Eich" ], "website": "https://spidermonkey.dev/", "inputLanguages": [ "javascript", "wasm" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/SpiderMonkey" }, "discourse": "https://discourse.mozilla.org/c/spidermonkey", "twitter": "https://www.twitter.com/spidermonkeyjs", "isOpenSource": true }, "spil": { "title": "SPIL", "appeared": 1973, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0d03b10638a96002b64bfb64d9a51350d13bf2c6" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3900", "centralPackageRepositoryCount": 0 }, "spill": { "title": "Spill", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/2cbce914ee3b9db6db1bfcae59c6094232c44888" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4454", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n20190910|Taylor & Francis|Information Engineering of Emergency Treatment for Marine Oil Spill Accidents|Lin Mu; Lizhe Wang; Jining Yan|9781000691016", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Mathematical Model and Computer Simulation for Oil Spill in Ice Waters Around Island Based on FLUENT|10.4304/jcp.8.4.1027-1034|6|0|Wei Li and X. Liang and Jianguo Lin|a76124a8c961ca5d1cff22869a6b25b912db0256" }, "spin": { "title": "Spin", "appeared": 2006, "type": "pl", "description": "The multicore Propeller microcontroller opens up a new level of invention possibilities for students. Programming it in its native high-level language, Spin, makes optimal use of this unique and powerful multicore microcontroller. Spin's design was inspired by great attributes of three other languages, Delphi, C, and Python, and by envisioning new solutions to common programming problems. Like Python, Spin uses indentation whitespace, rather than curly braces or keywords, to delimit blocks.", "reference": [ "https://learn.parallax.com/educators/teach/spin-programming-multicore-propeller" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "'" ] ], "booleanTokens": [ [ "true", "false" ] ], "githubLanguage": { "fileExtensions": [ "spin" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.spin", "repos": 38264, "id": "Propeller Spin" }, "githubBigQuery": { "repos": 129, "users": 101, "id": "Propeller Spin" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 3, "commitCount": 10, "sampleCount": 10, "example": [ "''****************************************\n''* Debug_Lcd v1.2 *\n''* Authors: Jon Williams, Jeff Martin *\n''* Copyright (c) 2006 Parallax, Inc. *\n''* See end of file for terms of use. *\n''****************************************\n''\n'' Debugging wrapper for Serial_Lcd object\n''\n'' v1.2 - March 26, 2008 - Updated by Jeff Martin to conform to Propeller object initialization standards.\n'' v1.1 - April 29, 2006 - Updated by Jon Williams for consistency.\n''\n\n\nOBJ\n\n lcd : \"serial_lcd\" ' driver for Parallax Serial LCD\n num : \"simple_numbers\" ' number to string conversion\n\n\nPUB init(pin, baud, lines) : okay\n\n'' Initializes serial LCD object\n'' -- returns true if all parameters okay\n\n okay := lcd.init(pin, baud, lines) \n\n\nPUB finalize\n\n'' Finalizes lcd object -- frees the pin (floats)\n\n lcd.finalize\n\n \nPUB putc(txbyte)\n\n'' Send a byte to the terminal\n\n lcd.putc(txbyte)\n \n \nPUB str(strAddr)\n\n'' Print a zero-terminated string\n\n lcd.str(strAddr)\n\n\nPUB dec(value)\n\n'' Print a signed decimal number\n\n lcd.str(num.dec(value)) \n\n\nPUB decf(value, width) \n\n'' Prints signed decimal value in space-padded, fixed-width field\n\n lcd.str(num.decf(value, width)) \n \n\nPUB decx(value, digits) \n\n'' Prints zero-padded, signed-decimal string\n'' -- if value is negative, field width is digits+1\n\n lcd.str(num.decx(value, digits)) \n\n\nPUB hex(value, digits)\n\n'' Print a hexadecimal number\n\n lcd.str(num.hex(value, digits))\n\n\nPUB ihex(value, digits)\n\n'' Print an indicated hexadecimal number\n\n lcd.str(num.ihex(value, digits)) \n\n\nPUB bin(value, digits)\n\n'' Print a binary number\n\n lcd.str(num.bin(value, digits))\n\n\nPUB ibin(value, digits)\n\n'' Print an indicated (%) binary number\n\n lcd.str(num.ibin(value, digits)) \n \n\nPUB cls\n\n'' Clears LCD and moves cursor to home (0, 0) position\n\n lcd.cls \n\n\nPUB home\n\n'' Moves cursor to 0, 0\n\n lcd.home\n \n\nPUB gotoxy(col, line)\n\n'' Moves cursor to col/line\n\n lcd.gotoxy(col, line)\n\n \nPUB clrln(line)\n\n'' Clears line\n\n lcd.clrln(line)\n\n\nPUB cursor(type)\n\n'' Selects cursor type\n'' 0 : cursor off, blink off \n'' 1 : cursor off, blink on \n'' 2 : cursor on, blink off \n'' 3 : cursor on, blink on\n\n lcd.cursor(type)\n \n\nPUB display(status)\n\n'' Controls display visibility; use display(false) to hide contents without clearing\n\n if status\n lcd.displayOn\n else\n lcd.displayOff\n\n\nPUB custom(char, chrDataAddr)\n\n'' Installs custom character map\n'' -- chrDataAddr is address of 8-byte character definition array\n\n lcd.custom(char, chrDataAddr)\n\n \nPUB backLight(status)\n\n'' Enable (true) or disable (false) LCD backlight\n'' -- affects only backlit models\n\n lcd.backLight(status)\n\n{{\n\n┌──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┐\n│ TERMS OF USE: MIT License │ \n├──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┤\n│Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation │ \n│files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, │\n│modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software│\n│is furnished to do so, subject to the following conditions: │\n│ │\n│The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.│\n│ │\n│THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE │\n│WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR │\n│COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, │\n│ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. │\n└──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┘\n}} " ], "url": "https://github.com/bitbased/sublime-spintools" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Spin", "fileType": "text", "wordRank": 5184, "centralPackageRepositoryCount": 0 }, "spip": { "title": "SPIP", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/89137321e60ede138005ba4ff84ea3c5a57496e7" ], "wikipedia": { "related": [ "php", "sql", "sqlite", "postgresql", "html", "xml", "csv", "yaml", "url" ], "summary": "SPIP (Système de Publication pour l'Internet) is a free software content management system designed for web site publishing, oriented towards online collaborative editing. The software is designed for easy setup, use and maintenance, and is used in public and private institutions. The last P in the word SPIP stands for both Partagé (shared) and Participatif (participative), in the sense that the software is designed for collective online editing. Its mascot is a flying squirrel. It is used both by institutional sites, community portals, academic sites, personal webpages, and news sites.", "backlinksCount": 27, "pageId": 10279391, "dailyPageViews": 19, "created": 2007, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/SPIP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7981", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "spir-v": { "title": "spir-v", "appeared": 2015, "type": "ir", "description": "Abstract. SPIR-V is a new platform-independent intermediate language. It is a self-contained, fully specified, binary format for representing graphical-shader stages and compute kernels for multiple APIs. Physically, it is a stream of 32-bit words. Logically, it is a header and a linear stream of instructions. These encode, first, a set of annotations and decorations, and second a collection of functions. Each function encodes a control-flow graph (CFG) of basic blocks, with additional instructions to preserve source-code structured flow control. Load/store instructions are used to access declared variables, which includes all input/output (IO). Intermediate results bypassing load/store use single static-assignment (SSA) representation. Data objects are represented logically, with hierarchical type information: There is no flattening of aggregates or assignment to physical register banks, etc. Selectable addressing models establish whether general pointers may be used, or if memory access is purely logical.", "reference": [ "https://www.khronos.org/registry/spir-v/papers/WhitePaper.html" ], "related": [ "spir" ] }, "spir": { "title": "Standard Portable Intermediate Representation", "appeared": 2014, "type": "ir", "wikipedia": { "summary": "Standard Portable Intermediate Representation (SPIR) is an intermediate language for parallel compute and graphics by Khronos Group, originally developed for use with OpenCL. SPIR was rewritten into SPIR-V in March 2015.", "backlinksCount": 58, "pageId": 45602476, "dailyPageViews": 52, "appeared": 2014, "url": "https://en.wikipedia.org/wiki/Standard_Portable_Intermediate_Representation" }, "semanticScholar": "" }, "spiral": { "title": "spiral", "appeared": 2017, "type": "pl", "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "inl x = 2 // Define a 64-bit integer in Spiral.\ninl mult a b = a * b\ninl f g = g 1 2, g 3.0 4.0 // Would give a type error in F#.\nf mult" ], "githubRepo": { "firstCommit": 2017, "stars": 847, "forks": 24, "subscribers": 35, "created": 2017, "updated": 2022, "description": "Functional language with intensional polymorphism and first-class staging.", "issues": 0, "url": "https://github.com/mrakgr/The-Spiral-Language" }, "repoStats": { "firstCommit": 2017, "commits": 7372, "committers": 10, "files": 1685 } }, "spitbol": { "title": "SPITBOL", "appeared": 1971, "type": "pl", "country": [ "United States" ], "wikipedia": { "related": [ "snobol", "sparc" ], "summary": "SPITBOL (Speedy Implementation of SNOBOL) is a compiled implementation of the SNOBOL4 programming language. Originally targeted for the IBM System/360 and System/370 family of computers, it has now been ported to most major microprocessors including the SPARC. It was created by Robert Dewar and Ken Belcher, who were then at the Illinois Institute of Technology. Prior to the development of SPITBOL, SNOBOL4 was thought to be slow, memory-intensive, and impossible to compile due to its dynamic nature. While delayed binding prevents everything from being determined at compile time, SPITBOL adopts various strategies for making decisions as early as possible. Recent versions of the SPITBOL compiler are available. Since 2001 the source code for the original SPITBOL 360 compiler has been made available under the GNU General Public License. MACRO SPITBOL is an implementation of SPITBOL written in the 1970s by Robert Dewar and Anthony P. McCann. MACRO SPITBOL is coded in MINIMAL, an assembly language for an abstract machine. The instruction set is carefully defined to allow some latitude in its implementation, so that hardware operations favorable to string processing can be exploited. An implementation of MINIMAL that was designed for interpretation on microcomputers was done by translating MINIMAL into MICRAL using a translator that was itself implemented in SPITBOL. The MICRAL version of MACRO SPITBOL, together with the MICRAL interpreter ran in under 40K bytes. This extreme object code compression of MICRAL is achieved using a set of machine code macro substitutions that minimizes the space required for the object code and macro table. The complexity of known algorithms for an optimal solution to this problem are high, but efficient heuristics attain near-optimal results. The source code for MACRO SPITBOL was released under the GNU General Public License on April 17, 2009.", "pageId": 389674, "dailyPageViews": 7, "created": 2003, "backlinksCount": 14, "revisionCount": 57, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/SPITBOL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=570", "fileType": "text", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "spl": { "title": "Structured Product Labeling", "appeared": 2004, "type": "xmlFormat", "wikipedia": { "summary": "Structured Product Labeling (SPL) is a Health Level Seven International (HL7) standard which defines the content of human prescription drug labeling in an XML format. The \"drug label\" includes all published material accompanying a drug, such as the actual label on a prescribed dose as well as the package insert which contains a great deal of detailed information about the drug. As of Release 4 of the SPL standard, 22,000 FDA informational product inserts have been encoded according to the standard.SPL documents contain both the content of labeling (all text, tables and figures) for a product along with additional machine readable information (drug listing data elements). Drug listing data elements include information about the product (product and generic names, ingredients, ingredient strengths, dosage forms, routes of administration, appearance, DEA schedule) and the packaging (package quantity and type).", "backlinksCount": 23, "pageId": 8150231, "dailyPageViews": 14, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Structured_Product_Labeling" }, "semanticScholar": "" }, "splaw": { "title": "SPLAW", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4a6d235cc051e490b0e1bcc26971fe0eb91af2c5" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4157", "centralPackageRepositoryCount": 0 }, "spline-font-database": { "title": "Spline Font Database", "appeared": 2004, "type": "application", "reference": [ "https://fontforge.github.io/sfdformat.html" ], "example": [ "SplineFontDB: 3.0\nFontName: Ambrosia\nFullName: Ambrosia\nFamilyName: Ambrosia\nDefaultBaseFilename: Ambrosia-1.0\nWeight: Medium\nCopyright: Copyright (C) 1995-2000 by George Williams\nComments: This is a funny font.\nUComments: \"This is a funny font.\"\nFontLog: \"Create Jan 2008\"\nVersion: 001.000\nItalicAngle: 0\nUnderlinePosition: -133\nUnderlineWidth: 20\nAscent: 800\nDescent: 200\nsfntRevision: 0x00078106\nWidthSeparation: 140\nLayerCount: 4\nLayer: 0 0 \"Back\" 1\nLayer: 1 1 \"Fore\" 0\nLayer: 2 0 \"Cubic_Fore\" 0\nLayer: 3 0 \"Test\" 1\nDisplaySize: -24\nDisplayLayer: 1\nAntiAlias: 1\nWinInfo: 64 16 4\nFitToEm: 1\nUseUniqueID: 0\nUseXUID: 1\nXUID: 3 18 21\nEncoding: unicode\nOrder2: 1\nOnlyBitmaps: 0\nMacStyle: 0\nTeXData: 1 10485760 0 269484 134742 89828 526385 1048576 89828\nCreationTime: 1151539072\nModificationTime: 11516487392\nGaspTable 3 8 2 16 1 65535 3 0\nDEI: 91125\nExtremaBound: 30" ], "githubLanguage": { "fileExtensions": [ "sfd" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "yaml", "tmScope": "text.sfd", "id": "Spline Font Database" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2018, "committerCount": 2, "commitCount": 51, "url": "https://github.com/Alhadis/language-fontforge" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "split-c": { "title": "Split-C", "appeared": 1995, "type": "pl", "wikipedia": { "related": [ "c", "cilk" ], "summary": "Split-C is a parallel extension of the C programming language. The Split-C project website describes Split-C as: a parallel extension of the C programming language that supports efficient access to a global address space on current distributed memory multiprocessors. It retains the \"small language\" character of C and supports careful engineering and optimization of programs by providing a simple, predictable cost model. Development of Split-C appears to be at a standstill since 1996. Split-C is similar to Cilk.", "created": 2006, "backlinksCount": 12, "pageId": 5472261, "revisionCount": 13, "dailyPageViews": 11, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Split-C" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "sporth": { "title": "sporth", "appeared": 2015, "type": "pl", "isDead": "true\nhttps://paulbatchelor.github.io/proj/sporth.html", "description": "A small stack-based audio language.", "website": "https://paulbatchelor.github.io/proj/sporth", "githubRepo": { "firstCommit": 2015, "stars": 247, "forks": 23, "subscribers": 12, "created": 2015, "updated": 2019, "description": "A small stack-based audio language.", "url": "https://github.com/PaulBatchelor/Sporth" }, "isbndb": "" }, "sprint": { "title": "SPRINT", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a359fd0ffc2922f1f2a0e4cc9e0f04a57112db66" ], "hopl": "https://hopl.info/showlanguage.prx?exp=305", "wordRank": 7448, "centralPackageRepositoryCount": 0 }, "sprite-os": { "title": "Sprite Operating System", "appeared": 1984, "type": "os", "originCommunity": [ "University of California, Berkeley" ], "writtenIn": [ "c" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Sprite_(operating_system)" } }, "spry": { "title": "spry", "appeared": 2015, "type": "pl", "creators": [ "Göran Krampe" ], "description": "Spry borrows homoiconicity from Rebol and Lisp, free form syntax from Forth and Rebol, the word of different types from Rebol, good data structure literal support from JavaScript and the general coding experience and style from Smalltalk. It also has a few ideas of its own, like an interesting argument passing mechanism and a relatively novel take on OO.", "website": "http://sprylang.se/", "aka": [ "ni" ], "domainName": { "name": "sprylang.se" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "lineCommentToken": [ [ "#" ] ], "booleanTokens": [ [ "True", "False" ] ], "example": [ "# Let's add a method to:do: that works as in Smalltalk.\n# Methods take the first argument, the \"receiver\", from the left\n# and binds it to \"self\".\nto:do: = method [:to :block\n n = self\n [n <= to] whileTrue: [\n do block n\n ..n = (n + 1)]]\n\n# Then we can loop in Smalltalk style echoing 1 to 5!\n1 to: 5 do: [echo :x]\n\n# We can similarly implement select: from Smalltalk\nselect: = method [:pred\n result = ([] clone)\n self reset\n [self end?] whileFalse: [\n n = (self next)\n do pred n then: [result add: n]]\n ^result]\n\n# Then use it to produce [3 4]\necho ([1 2 3 4] select: [:x > 2])" ], "githubRepo": { "firstCommit": 2015, "stars": 378, "forks": 23, "subscribers": 28, "created": 2015, "updated": 2022, "description": "A Smalltalk and Rebol inspired language implemented as an AST interpreter in Nim", "issues": 1, "url": "https://github.com/gokr/spry" }, "repoStats": { "firstCommit": 2015, "commits": 386, "committers": 4, "files": 106 }, "leachim6": { "filepath": "n/Ni.nic", "fileExtensions": [ "nic" ], "example": [ "#48!#65!#6c!#6c!#6f!#20!#57!#6f!#72!#6c!#64!\n" ], "id": "Ni" } }, "sps": { "title": "Symbolic Programming System", "appeared": 1959, "type": "pl", "reference": [ "http://bitsavers.org/pdf/ibm/1620/C26-5600-1_Symbolic_Programming_System_Apr63.pdf" ], "standsFor": "Symbolic Programming System", "hopl": "https://hopl.info/showlanguage.prx?exp=2524" }, "spss": { "title": "SPSS", "appeared": 1968, "type": "pl", "website": "https://www.ibm.com/us-en/marketplace/spss-statistics", "documentation": [ "https://www.ibm.com/support/pages/ibm-spss-statistics-28-documentation" ], "country": [ "United States" ], "releaseNotesUrl": "https://www.ibm.com/support/pages/ibm-spss-statistics-200-release-notess", "hasComments": { "example": "* A comment where first character must be *.", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "related": [ "linux", "java", "python", "visual-basic", "r", "ascii", "sql", "html", "xml", "unix" ], "summary": "SPSS Statistics is a software package used for logical batched and non-batched statistical analysis. Long produced by SPSS Inc., it was acquired by IBM in 2009. The current versions (2015) are officially named IBM SPSS Statistics. Companion products in the same family are used for survey authoring and deployment (IBM SPSS Data Collection, now divested under UNICOM Intelligence), data mining (IBM SPSS Modeler), text analytics, and collaboration and deployment (batch and automated scoring services). The software name originally stood for Statistical Package for the Social Sciences (SPSS), reflecting the original market, although the software is now popular in other fields as well, including the health sciences and marketing.", "pageId": 179088, "dailyPageViews": 1898, "created": 2002, "backlinksCount": 503, "revisionCount": 878, "appeared": 1968, "url": "https://en.wikipedia.org/wiki/SPSS" }, "helloWorldCollection": [ "* SPSS Syntax\n* \"Hello World\" title in the Output Window of SPSS via SPSS Syntax.\n\nTITLE 'Hello World'.\n" ], "leachim6": { "filepath": "s/SPSS.spss", "fileExtensions": [ "spss" ], "example": [ "BEGIN PROGRAM.\nprint \"Hello World\"\nEND PROGRAM." ], "id": "SPSS" }, "indeedJobs": { "2022": 25, "query": "spss developer" }, "linkedInSkill": { "2018": 956163, "id": "spss" }, "tiobe": { "id": "SPSS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=240", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSPSS For Dummies|2007|Arthur Griffith|959353|3.54|67|10\nSPSS Statistics for Dummies|2015|Keith McCormick|45494211|4.10|10|2", "isbndb": "year|publisher|title|authors|isbn13\n2007|For Dummies|SPSS For Dummies|Griffith, Arthur|9780470113448\n2021|SPSS Inc.|SPSS Programming and Data Management: A Guide for SPSS and SAS Users, 3rd Edition|Raynald Levesque and SPSS Inc.|9781568273747\n2011|Springer|R for SAS and SPSS Users (Statistics and Computing)|Muenchen, Robert A.|9781461406853\n2011|Springer|R for SAS and SPSS Users (Statistics and Computing)|Muenchen, Robert A.|9781461406846\n2013|Routledge|Multilevel and Longitudinal Modeling with IBM SPSS (Quantitative Methodology Series)|Heck, Ronald H.|9780415817110\n2017|Wiley|SPSS Statistics for Data Analysis and Visualization|McCormick, Keith and Salcedo, Jesus|9781119003663\n2009|SAGE Publications Ltd|Using SPSS Syntax: A Beginner′s Guide|Collier, Jacqueline|9781446246658\n2017|Packt Publishing|IBM SPSS Modeler Essentials: Effective techniques for building powerful data mining and predictive analytics solutions|Salcedo, Jesus and McCormick, Keith|9781788296823\n2004|SAGE Publications, Inc|An Intermediate Guide to SPSS Programming: Using Syntax for Data Management|Boslaugh, Sarah E.|9781483389332\n2004|SAGE Publications, Inc|An Intermediate Guide to SPSS Programming: Using Syntax for Data Management|Boslaugh, Sarah E.|9780761931850\n2022|Khanna Publishing House|Data Science And Analytics: With Python, R And Spss Programming|V.K. Jain|9789386173676\n2006|SPSS Inc.|SPSS Programming and Data Management|SPSS|9781568273907", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2009|A Guide to Doing Statistics in Second Language Research Using SPSS|10.4324/9781315775661|722|116|Jenifer Larson-Hall|795142d7d53536ecb8195638fa9dd1eb6bda44d2\n2012|An SPSS R-Menu for Ordinal Factor Analysis|10.18637/JSS.V046.I04|200|25|Mário Basto and J. Pereira|9b3db04e8286b35f6c6e0dde28e5b8d275ddcff0\n2017|SPSS Statistics for Data Analysis and Visualization|10.1002/9781119183426|35|4|Keith McCormick and Jesus Salcedo|ff06fc8f0b627f0f061abe7ccc277a9f67856938\n2005|An intermediate guide to SPSS programming : using syntax for data management|10.5860/choice.42-5913|8|0|S. Boslaugh|2156927494658615734e43c893f25f4f58dcf186\n2014|Using the Statistical Program R Instead of SPSS To Analyze Data|10.1021/BK-2014-1166.CH008|6|1|Hui Tang and Pengsheng Ji|e81f588b28d078867894a82bdaeb73f9bf40b9bc" }, "spyder-editor": { "title": "Spyder", "appeared": 2009, "type": "editor", "wikipedia": { "related": [ "python", "qt", "linux", "numpy", "scipy", "matplotlib", "pandas", "cython", "regex", "vim-editor" ], "summary": "Spyder is an open source cross-platform integrated development environment (IDE) for scientific programming in the Python language. Spyder integrates with a number of prominent packages in the scientific Python stack, including NumPy, SciPy, Matplotlib, pandas, IPython, SymPy and Cython, as well as other open source software. It is released under the MIT license.Initially created and developed by Pierre Raybaut in 2009, since 2012 Spyder has been maintained and continuously improved by a team of scientific Python developers and the community. Spyder is extensible with first- and third-party plugins, includes support for interactive tools for data inspection and embeds Python-specific code quality assurance and introspection instruments, such as Pyflakes, Pylint and Rope. It is available cross-platform through Anaconda, on Windows with WinPython and Python (x,y), on macOS through MacPorts, and on major Linux distributions such as Arch Linux, Debian, Fedora, Gentoo Linux, openSUSE and Ubuntu.Spyder uses Qt for its GUI, and is designed to use either of the PyQt or PySide Python bindings. QtPy, a thin abstraction layer developed by the Spyder project and later adopted by multiple other packages, provides the flexibility to use either backend.", "pageId": 34226513, "created": 2011, "backlinksCount": 81, "revisionCount": 149, "dailyPageViews": 294, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Spyder_(software)" }, "fileType": "na", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "sqhtml": { "title": "SQHTML", "appeared": 2022, "type": "pl", "creators": [ "Katrina Grace" ], "website": "https://sqhtml.swordglowsblue.com/", "country": [ "United States" ], "githubRepo": { "stars": 1, "forks": 0, "subscribers": 1, "updated": 2022, "description": "The worst way to build a website", "url": "https://github.com/KatrinaKitten/sqhtml/" }, "repoStats": { "firstCommit": 2022, "commits": 4, "committers": 2, "files": 6 } }, "sql-92": { "title": "SQL-92", "appeared": 1992, "type": "pl", "wikipedia": { "related": [ "sql", "c", "ada", "mumps", "sql-psm" ], "summary": "SQL-92 was the third revision of the SQL database query language. Unlike SQL-89, it was a major revision of the standard. Aside from a few minor incompatibilities, the SQL-89 standard is forward-compatible with SQL-92. The standard specification itself grew about five times compared to SQL-89. Much of it was due to more precise specifications of existing features; the increase due to new features was only by a factor of 1.5–2. Many of the new features had already been implemented by vendors before the new standard was adopted. However, most of the new features were added to the \"intermediate\" and \"full\" tiers of the specification, meaning that conformance with SQL-92 entry level was scarcely any more demanding than conformance with SQL-89. Later revisions of the standard include SQL:1999 (SQL3), SQL:2003, SQL:2008, SQL:2011 and SQL:2016.", "created": 2005, "backlinksCount": 76, "pageId": 2264160, "revisionCount": 76, "dailyPageViews": 105, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/SQL-92" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6829", "centralPackageRepositoryCount": 0, "isbndb": "" }, "sql-psm": { "title": "SQL/PSM", "appeared": 1996, "type": "pl", "wikipedia": { "related": [ "mysql", "mariadb", "sqlpl", "ada", "sql", "sql-92", "pl-sql", "plpgsql", "postgresql", "transact-sql" ], "summary": "SQL/PSM (SQL/Persistent Stored Modules) is an ISO standard mainly defining an extension of SQL with a procedural language for use in stored procedures. Initially published in 1996 as an extension of SQL-92 (ISO/IEC 9075-4:1996, a version sometimes called PSM-96 or even SQL-92/PSM), SQL/PSM was later incorporated into the multi-part SQL:1999 standard, and has been part 4 of that standard since then, most recently in SQL:2016. The SQL:1999 part 4 covered less than the original PSM-96 because the SQL statements for defining, managing, and invoking routines were actually incorporated into part 2 SQL/Foundation, leaving only the procedural language itself as SQL/PSM. The SQL/PSM facilities are still optional as far as the SQL standard is concerned; most of them are grouped in Features P001-P008. SQL/PSM standardizes syntax and semantics for control flow, exception handling (called \"condition handling\" in SQL/PSM), local variables, assignment of expressions to variables and parameters, and (procedural) use of cursors. It also defines an information schema (metadata) for stored procedures. SQL/PSM is one language in which methods for the SQL:1999 structured types can be defined. The other is Java, via SQL/JRT. IBM's SQL PL (used in DB2) and Mimer SQL's PSM were the first two products implementing SQL/PSM. In practice those two, and perhaps also MySQL/MariaDB's procedural language, are closest to the SQL/PSM standard. SQL/PSM resembles and is inspired by PL/SQL, as well as PL/pgSQL, so they are similar languages. With PostgreSQL v9 some SQL/PSM features, like overloading of SQL-invoked functions and procedures are now supported. A PostgreSQL addon implements SQL/PSM (alongside its own procedural language), although it is not part of the core product.RDF functionality in OpenLink Virtuoso was developed entirely through SQL/PSM, combined with custom datatypes (e.g., ANY for handling URI and Literal relation objects), sophisticated indexing, and flexible physical storage choices (column-wise or row-wise).", "created": 2007, "backlinksCount": 80, "pageId": 11665200, "revisionCount": 58, "dailyPageViews": 41, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/SQL/PSM" }, "centralPackageRepositoryCount": 0 }, "sql": { "title": "SQL", "appeared": 1974, "type": "queryLanguage", "creators": [ "Donald D. Chamberlin", "Raymond F. Boyce" ], "documentation": [ "https://docs.data.world/documentation/sql/concepts/basic/intro.html" ], "spec": "https://modern-sql.com/standard", "standsFor": "Structured Query Language", "country": [ "United States" ], "originCommunity": [ "IBM" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": true }, "hasStrings": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "isCaseSensitive": { "example": "", "value": false }, "hasBooleans": { "example": "", "value": true }, "hasIntegers": { "example": "-- [0-9]+", "value": true }, "hasFixedPoint": { "example": "", "value": true }, "lineCommentToken": [ [ "--" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "stringToken": [ [ "'" ] ], "booleanTokens": [ [ "TRUE", "FALSE" ] ], "keywords": [ "ADD", "ALL", "ALLOCATE", "ALTER", "AND", "ANY", "ARE", "AS", "ASC", "ASSERTION", "AT", "AUTHORIZATION", "AVG", "BEGIN", "BETWEEN", "BIT", "BOOLEAN", "BOTH", "BY", "CALL", "CASCADE", "CASCADED", "CASE", "CAST", "CHAR", "CHARACTER", "CHECK", "CLOSE", "COLLATE", "COLLATION", "COLUMN", "COMMIT", "CONNECT", "CONNECTION", "CONSTRAINT", "CONSTRAINTS", "CONTINUE", "CONVERT", "CORRESPONDING", "COUNT", "CREATE", "CURRENT", "CURRENT_DATE", "CURRENT_TIME", "CURRENT_TIMESTAMP", "CURRENT_USER", "CURSOR", "DEALLOCATE", "DEC", "DECIMAL", "DECLARE", "DEFERRABLE", "DEFERRED", "DELETE", "DESC", "DESCRIBE", "DIAGNOSTICS", "DISCONNECT", "DISTINCT", "DOUBLE", "DROP", "ELSE", "END", "ENDEXEC", "ESCAPE", "EXCEPT", "EXCEPTION", "EXEC", "EXECUTE", "EXISTS", "EXPLAIN", "EXTERNAL", "FALSE", "FETCH", "FIRST", "FLOAT", "FOR", "FOREIGN", "FOUND", "FROM", "FULL", "FUNCTION", "GET", "GET_CURRENT_CONNECTION", "GLOBAL", "GO", "GOTO", "GRANT", "GROUP", "HAVING", "HOUR", "IDENTITY", "IMMEDIATE", "IN", "INDICATOR", "INITIALLY", "INNER", "INOUT", "INPUT", "INSENSITIVE", "INSERT", "INT", "INTEGER", "INTERSECT", "INTO", "IS", "ISOLATION", "JOIN", "KEY", "LAST", "LEFT", "LIKE", "LONGINT", "LOWER", "LTRIM", "MATCH", "MAX", "MIN", "MINUTE", "NATIONAL", "NATURAL", "NCHAR", "NVARCHAR", "NEXT", "NO", "NOT", "NULL", "NULLIF", "NUMERIC", "OF", "ON", "ONLY", "OPEN", "OPTION", "OR", "ORDER", "OUT", "OUTER", "OUTPUT", "OVERLAPS", "PAD", "PARTIAL", "PREPARE", "PRESERVE", "PRIMARY", "PRIOR", "PRIVILEGES", "PROCEDURE", "PUBLIC", "READ", "REAL", "REFERENCES", "RELATIVE", "RESTRICT", "REVOKE", "RIGHT", "ROLLBACK", "ROWS", "RTRIM", "SCHEMA", "SCROLL", "SECOND", "SELECT", "SESSION_USER", "SET", "SMALLINT", "SOME", "SPACE", "SQL", "SQLCODE", "SQLERROR", "SQLSTATE", "SUBSTR", "SUBSTRING", "SUM", "SYSTEM_USER", "TABLE", "TEMPORARY", "TIMEZONE_HOUR", "TIMEZONE_MINUTE", "TO", "TRAILING", "TRANSACTION", "TRANSLATE", "TRANSLATION", "TRUE", "UNION", "UNIQUE", "UNKNOWN", "UPDATE", "UPPER", "USER", "USING", "VALUES", "VARCHAR", "VARYING", "VIEW", "WHENEVER", "WHERE", "WITH", "WORK", "WRITE", "XML", "XMLEXISTS", "XMLPARSE", "XMLSERIALIZE", "YEAR" ], "wikipedia": { "related": [ "sql-92", "datalog", "linq", "powershell", "c", "sql-psm", "sqlpl", "transact-sql", "mysql", "pl-sql", "ada", "postgresql", "plpgsql", "java", "perl", "python", "tcl", "javascript", "xml", "xquery", "dot-ql", "isbl", "quel", "mumps", "isbn", "doi" ], "summary": "SQL ( ( listen) ESS-kew-EL or ( listen) SEE-kwəl or SKWEEL, Structured Query Language) is a domain-specific language used in programming and designed for managing data held in a relational database management system (RDBMS), or for stream processing in a relational data stream management system (RDSMS). In comparison to older read/write APIs like ISAM or VSAM, SQL offers two main advantages: first, it introduced the concept of accessing many records with one single command; and second, it eliminates the need to specify how to reach a record, e.g. with or without an index. Originally based upon relational algebra and tuple relational calculus, SQL consists of a data definition language, data manipulation language, and data control language. The scope of SQL includes data insert, query, update and delete, schema creation and modification, and data access control. Although SQL is often described as, and to a great extent is, a declarative language (4GL), it also includes procedural elements. SQL was one of the first commercial languages for Edgar F. Codd's relational model, as described in his influential 1970 paper, \"A Relational Model of Data for Large Shared Data Banks\". Despite not entirely adhering to the relational model as described by Codd, it became the most widely used database language. SQL became a standard of the American National Standards Institute (ANSI) in 1986, and of the International Organization for Standardization (ISO) in 1987. Since then, the standard has been revised to include a larger set of features. Despite the existence of such standards, most SQL code is not completely portable among different database systems without adjustments.", "pageId": 29004, "dailyPageViews": 3084, "created": 2001, "backlinksCount": 4159, "revisionCount": 4153, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/SQL" }, "githubLanguage": { "fileExtensions": [ "sql", "cql", "ddl", "inc", "mysql", "prc", "tab", "udf", "viw" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "sql", "codemirrorMode": "sql", "codemirrorMimeType": "text/x-sql", "tmScope": "source.sql", "repos": 1222, "id": "SQL" }, "githubBigQuery": { "repos": 641, "users": 602, "id": "SQL" }, "monaco": "sql", "codeMirror": "sql", "pygmentsHighlighter": { "filename": "sql.py", "fileExtensions": [ "sql" ], "id": "SQL" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2016, "committerCount": 15, "commitCount": 224, "sampleCount": 12, "example": [ "--this is the most basic oracle sql command\nselect * from dual;\n\n" ], "url": "https://github.com/textmate/sql.tmbundle" }, "projectEuler": { "memberCount": { "2019": 104, "2022": 124 }, "id": "SQL" }, "helloWorldCollection": [ "# Hello World in SQL\n\nSELECT 'Hello World';\n" ], "leachim6": { "filepath": "s/SQL.sql", "fileExtensions": [ "sql" ], "example": [ "SELECT 'Hello World';\n" ], "id": "SQL" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SQL", "indeedJobs": { "2022": 147983, "query": "sql developer" }, "linkedInSkill": { "2018": 7163429, "id": "sql" }, "stackOverflowSurvey": { "2021": { "users": 38835, "medianSalary": 56228, "fans": 26631, "percentageUsing": 0.47 } }, "tiobe": { "currentRank": 9, "id": "sql" }, "hopl": "https://hopl.info/showlanguage.prx?exp=533", "jupyterKernel": [ "https://teradata.github.io/jupyterextensions/" ], "fileType": "text", "wordRank": 2975, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSQL, PL/SQL: The Programming Language of Oracle|2002|Ivan Bayross|1678914|4.05|729|77\nSQL for Dummies|1997|Allen G. Taylor|2164512|3.48|178|10\nJoe Celko's SQL for Smarties: Advanced SQL Programming|1995|Joe Celko|1032791|3.96|172|11\nOracle PL/SQL Programming|1993|Steven Feuerstein|2405226|3.93|250|14\nThe Language of SQL|2010|Larry Rockoff|13895510|3.95|79|5", "isbndb": "year|publisher|title|authors|isbn13\n2008|Cengage Learning|A Guide to SQL (Available Titles Skills Assessment Manager (SAM) - Office 2010)|Pratt, Philip J. and Last, Mary Z.|9780324597684\n2009|Cengage Learning|ASP .NET Programming with C# & SQL Server (Web Technologies)|Gosselin, Don|9781423903246\n2007|Addison-Wesley Professional|SQL for MySQL Developers: A Comprehensive Tutorial and Reference|van der Lans, Rick|9780131497351\n2012|Wrox|Beginning Microsoft SQL Server 2012 Programming|Atkinson, Paul and Vieira, Robert|9781118102282\n2014|Questing Vole Press|SQL (Database Programming)|Fehily, Chris|9781937842314\n2013|Microsoft Press|Microsoft SQL Server 2012 Step by Step (Step by Step Developer)|LeBlanc, Patrick|9780735663862\n2009|Jones & Bartlett Learning|Essential SQL on SQL Server 2008|Bagui, Dr. Sikha and Earp, Dr. Richard|9780763781385\n2012|Apress|SQL Server 2012 T-SQL Recipes: A Problem-Solution Approach (Expert's Voice in SQL Server)|Brimhall, Jason and Dye, David and Roberts, Timothy and Sheffield, Wayne and Gennick, Jonathan and Sack, Joseph|9781430242000\n2014|CreateSpace Independent Publishing Platform|SQL Server 2014 Design & Programming|Toth, Kalman|9781499529593\n1999|Mcgraw-hill Osborne Media|Oracle Sql & Pl/sql Annotated Archives|Kevin Loney and Rachel Carmichael|9780078825361\n2009|Microsoft Press|Inside Microsoft® SQL Server® 2008: T-SQL Programming (Developer Reference)|Itzik Ben-Gan and Dejan Sarka and Roger Wolter and Greg Low and Ed Katibah and Isaac Kunen|9780735626027\n2004|Course Technology|A Guide to SQL|Pratt, Philip J.|9780619216740\n2007|For Dummies|SQL All-in-One Desk Reference For Dummies|Taylor, Allen G.|9780470119280\n2005|Wrox|Beginning Transact-SQL with SQL Server 2000 and 2005|Turley, Paul|9780764579554\n2012|Apress|Beginning SQL Server 2012 for Developers (Expert's Voice SQL Server)|Dewson, Robin|9781430237501\n2000|Wrox|Professional SQL Server 2000 DTS (Data Transformation Services)|Chaffin, Mark and Knight, Brian and Robinson, Todd|9780764543685\n2006|Wrox|Beginning SQL Server 2005 Programming|Vieira, Robert|9780764584336\n2008|Wrox|Professional Microsoft SQL Server 2008 Reporting Services|Turley, Paul and Silva, Thiago and Smith, Bryan C. and Withee, Ken|9780470242018\n2006|For Dummies|Oracle PL / SQL For Dummies|Michael Rosenblum and Paul Dorsey|9780764599576\n2005|O'Reilly Media|Learning SQL|Beaulieu, Alan|9780596007270\n2006|Sams Publishing|Microsoft SQL Server 2005 Unleashed|Ray Rankins and Paul Bertucci and Chris Gallelli and Alex T. Silverstein|9780672328244\n2000|Microsoft Press|Inside Microsoft SQL Server 2000|Kalen Delaney|9780735609983\n2006|Microsoft Press|Inside Microsoft SQL Server 2005: T-SQL Querying (Developer Reference)|Itzik Ben-Gan and Lubor Kollar and Dejan Sarka|9780735623132\n2005|Apress|Pro SQL Server 2005|Thomas Rizzo and Adam Machanic and Robin Dewson and Rob Walters and Joseph Sack and Julian Skinner and Louis Davidson|9781590594773\n2003|McGraw-Hill Osborne Media|SQL Server 2000 Stored Procedure & XML Programming, Second Edition|Dejan Sunderic|9780072228960\n2000|Sams|Sams Teach Yourself SQL in 24 Hours (2nd Edition)|Plew, Ronald R. and Stephens, Ryan K.|9780672318993\n2001|McGraw-Hill Companies|Troubleshooting SQL||9780072134896\n2001|Addison-Wesley Professional|Guru's Guide to SQL Server Stored Procedures, XML, and HTML, The|Henderson, Ken|9780201700466\n2005|Morgan Kaufmann|Joe Celko's SQL for Smarties: Advanced SQL Programming Third Edition (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780123693792\n2012|Apress|Pro T-SQL 2012 Programmer's Guide (Expert's Voice in SQL Server)|Coles, Michael and Shaw, Scott and Natarajan, Jay and Bruchez, Rudi|9781430245964\n2009|Jones & Bartlett Learning|The Sql Programming Language|Kirk Scott|9780763766740\n1999|Sams|SQL Unleashed|Youness, Sakhr and Boutquin, Pierre and Ladanyi, Hans|9780672317095\n2006|Morgan Kaufmann|Joe Celko's Analytics and OLAP in SQL (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780123695123\n2008|Morgan Kaufmann|Joe Celko's Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780123741370\n1997|Morgan Kaufmann|Joe Celko's SQL Puzzles and Answers (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9781558604537\n1998|Ventana Pr|The SQL Programmer's Reference: Windows 95/Nt & Unix|Freeze, Wayne S.|9781566047609\n2006|O'Reilly Media|Programming SQL Server 2005: Prepare for Deeper SQL Server Waters|Bill Hamilton|9780596004798\n2001|Microsoft Press|Data Mining with Microsoft SQL Server(TM) 2000 Technical Reference (Developer Reference)|Seidman, Claude|9780735612716\n2007|Open University Worldwide|The Database Language Sql|Open University. Relational databases: theory and practice Course Team|9780749215750\n2009|Microsoft Press|Smart Business Intelligence Solutions with Microsoft® SQL Server® 2008 (Developer Reference)|Langit, Lynn and Goff, Kevin S.|9780735625808\n1999|Sams|Microsoft SQL Server 7.0 Programming Unleashed (2nd Edition)|John Papa and Matthew Shepker and Peter Debetta and Dave Martin and Randy Charles Morin|9780672312939\n2007|McGraw-Hill Education|MCTS SQL Server 2005 Implementation & Maintenance Study Guide (Exam 70-431)|Carpenter, Tom|9780072263213\n2006|Wrox|Professional SQL Server 2005 Reporting Services|Turley, Paul and Bryant, Todd and Counihan, James and DuVarney, Dave|9780764584978\n2016|McGraw-Hill Education|Microsoft SQL Server 2016: A Beginner's Guide, Sixth Edition|Petkovic, Dusan|9781259641800\n2010|McGraw-Hill Education|Hands-On Microsoft SQL Server 2008 Integration Services, Second Edition|Nanda, Ashwani|9780071736404\n2004|Rational Press|The Rational Guide to: SQL Server Reporting Services (Rational Guides)|Mann, A. T.|9780972688895\n2006|Wrox|Professional SQL Server 2005 XML|Klein, Scott|9780764597923\n2000|McGraw-Hill Osborne Media|SQL Server 2000 Design & T-SQL Programming|Reilly, Michael and Poolet, Michelle|9780072123753\n2018|Packt Publishing|SQL Server 2017 Machine Learning Services with R: Data exploration, modeling, and advanced analytics|Kastrun, Tomaz and Koesmarno, Julie|9781787283572\n2009|O'Reilly Media|SQL and Relational Theory: How to Write Accurate SQL Code|Date, C. J.|9780596523060\n2011|McGraw-Hill Education|Microsoft SQL Server 2008 R2 Master Data Services|Graham, Tyler and Selhorn, Suzanne|9780071756235\n2009|Sybex|Mastering SQL Server 2008|Lee, Michael and Bieker, Gentry|9780470289044\n2001|Wiley|Scripting XML and WMI for Microsoft(r) SQL Server 2000: Professional Developer's Guide|Martinsson, Tobias|9780471399513\n1989|Que Pub|Sql Programmer's Guide (programming Series)|Umang Gupta and William Gietz|9780880223904\n2020|Questing Vole Press|SQL Database Programming (Fifth Edition)|Fehily, Chris|9781937842475\n1994|Addison-Wesley|Introduction to SQL (2nd Edition)|Van Der Lans, Rick F. and Cools, Diane and Gray, Andrea|9780201624250\n2007|McGraw-Hill Interamericana|Programacion avanzada con SQL Server 2005/ Advance Programming with SQL Server 2005 (Spanish Edition)|Brust, Andrew J.|9789701058930\n2012|IBM Press|DB2 SQL Tuning Tips for z/OS Developers (IBM Press)|Andrews, Tony|9780133038460\n2010|Red Gate Books|Defensive Database Programming with SQL Server||9781906434458\n2010|For Dummies|SQL For Dummies|Taylor, Allen G.|9780470557419\n2001|Sybex|SQL Server Developer's Guide to OLAP with Analysis Services|Mike Gunderloy and Tim Sneath|9780782129571\n2000|Morgan Kaufmann|Understanding SQL and Java Together: A Guide to SQLJ, JDBC, and Related Technologies (The Morgan Kaufmann Series in Data Management Systems)|Melton, Jim and Eisenberg, Andrew|9781558605626\n2006|Microsoft Press|Programming Microsoft SQL Server 2005|Brust, Andrew and Forte, Stephen|9780735619234\n2006|Apress|Beginning SQL Server 2005 for Developers: From Novice to Professional (Expert's Voice)|Dewson, Robin|9781590595886\n1990|QED Information Sciences|Embedded SQL for DB2: Application design and programming|Sayles, Jonathan|9780894353086\n2005-03-04|Wiley|Beginning SQL|Paul Wilton and John Colby|9780764596322\n1999|Sams|Microsoft SQL Server 7.0 Unleashed|Bjeletich, Sharon and Gallagher, Simon and Minocha, Vipul and Mable, Greg|9780672312274\n2001|McGraw-Hill Osborne Media|Instant SQL Server 2000 Applications|Buczek, Greg|9780072133202\n2006|Wrox|Professional SQL Server 2005 CLR Programming: with Stored Procedures, Functions, Triggers, Aggregates and Types|Derek Comingore and Douglas Hinson|9780470054031\n2004|Sas Institute|Sas 9.1 Sql Procedure User's Guide|Inc Sas Institute and Sas Institute|9781590473344\n2008|Microsoft Press|Programming Microsoft® SQL Server® 2008|Leonard Lobel and Andrew J. Brust and Stephen Forte|9780735638198\n2000||Programming Sql Server With Xml [with 1]|Sankar and Krishna|9780735611757\n2010|Course Technology/cengage Learning,|Asp.net Programming With C# And Sql Server|Gosselin, Don|9780840031259\n2019|BPB Publications|Python Data Persistence: With SQL and NOSQL Databases|Lathkar, Malhar|9789388511759\n2007|Syngress|How to Cheat at Securing SQL Server 2005|Timothy Blum and Kevvie Fowler and Raymond Arthur Gabriel and K. Brian Kelley and Matt Shepherd|9781597491969\n2020|Wiley-IEEE Press|SQL Server Database Programming with Visual Basic.NET: Concepts, Designs and Implementations|Bai, Ying|9781119608608\n2007|ANAYA MULTIMEDIA|Bases de datos con SQL Server 2005 (Paso A Paso) (Spanish Edition)|Solid Quality Learning|9788441521315\n2019||Sql|Ryan Turner|9781076176479\n2004|Vk Publishers|Database Programming Using Vb.net & Sql Server 2000 (secrets Of Developing An Accounting Package Revealed)|Bharathi Krishna K. and Krishna K.|9788190133159\n1997|Microsoft Press|Hitchhiker's Guide to Visual Basic and SQL Server: William R. Vaughn (Microsoft Programming Series)|Vaughn, William|9781572315679\n2015|Apress|SQL Server T-SQL Recipes|Dye, David and Brimhall, Jason and Roberts, Timothy and Sheffield, Wayne and Sack, Joseph and Gennick, Jonathan|9781484200612\n2016|Createspace Independent Publishing Platform|Sql: Learn Sql In 24 Hours Or Less - A Beginner's Guide To Learning Sql Programming Now (sql, Sql Programming, Sql Course)|Robert Dwight|9781532716959\n20061101|Springer Nature|Mastering Oracle SQL and SQL*Plus|Lex deHaan|9781430200000\n2005|McGraw-Hill Education|SQL Demystified|Oppel, Andrew|9780071486729\n2018|CreateSpace Independent Publishing Platform|SQL: Simplified SQL Programming & Database Management For Beginners. Your Step-By-Step Guide to Learning The SQL Database (Simplified Programming- SQL)|Gosling, Steve|9781985732681\n2009|Packt Publishing|Oracle SQL Developer 2.1|Harper,Sue|9781847196262\n2012|Apress|Pro SQL Server 2012 BI Solutions (Expert's Voice in SQL Server)|Root, Randal and Mason, Caryn|9781430234890\n1994|Gupta Corp|Power Programming With Sql Windows|Rajesh Lalwani|9780131915459\n2000|Peer Information|Professional SQL Server 2000 Programming|Rob Vieira|9781861004482\n1999|Apress|Professional SQL Server 7.0 Programming|Rob Vieira|9781861002310\n2014|Questing Vole Press|Sql Short Course (database Programming)|Chris Fehily|9781937842338\n2000|SAS Institute,|SAS SQL Procedure User's Guide,Version 8|SAS Institute Staff and Publishing SAS Publishing and SAS Publishing|9781580255998\n2000|McGraw-Hill/OsborneMedia|SQL Server 2000 Stored Procedure Programming||9780072125665\n1997|Itp - Media|Official Sybase SQL Anywhere Developer's Guide|Richmond, Ian and Clayton, Steve and Ball, Derek|9781850328605\n2020|BPB Publications|Learn SQL with MySQL: Retrieve and Manipulate Data Using SQL Commands with Ease (English Edition)|Pajankar, Ashwin|9789389898088\n2020|Independently Published|Computer Programming: 4 Books In 1: Sql For Beginners, C# For Beginners, C# For Intermediate, Hacking With Kali Linux, Everything You Need For Mastering Programming & Cyber Security|Sutherland, Andrew|9781658138703\n2019|Independently Published|Sql: The Ultimate Guide To Programming In Sql For Beginners, With Exercises For Learning Sql Languages And The Coding, Easily And In A Short Time (step-by-step Guide)|Daniel Géron|9781708021979\n2000|Tsinghua University Press Pub. Date :2007-01|Sql Server 2005 Xml Advanced Programming(chinese Edition)|(mei)ke Lin (klein.s.) / Wang Xin|9787302141112\n1997|Microsoft Press|Inside Microsoft SQL Server 6.5 (Microsoft Programming Series)|Soukup, Ron|9781572313316\n1996|Microsoft Press|Hitchhiker's Guide to Visual Basic for SQL Server 95 (Solution developer series)|Vaughn, William|9781556159060\n1999|John Wiley & Sons|Essential Sqlj Programming: The Complete Guide To The Ansi Standard For Embedded Sql In Java|Julie Basu and Probal Shyamal Shome|9780471349204\n2021|microsoft|Microsoft Official Course 2073A: Programming a Microsoft SQL Server 2000 Database Course (Microsoft Official Course)||9780758061041\n2016|CreateSpace Independent Publishing Platform|Realizing Generic Data Warehouses by Generic SQL Programming: Teradata Edition (In the Age of Big Data: Generically Data Warehousing)|Jiang, Bin|9781512127287\n2020|Ben Chan|Programming For Data Science: 2 Books in 1: Cyber Security, SQL Programming, Beginners Course for Kids, and Newbies (Crash Course 2021)|Chan, Ben|9783949231407\n2019|ClydeBank Media LLC|SQL QuickStart Guide: The Simplified Beginner's Guide to Managing, Analyzing, and Manipulating Data With SQL|Shields, Walter|9781945051838\n2014|Cengage Learning|A Guide to SQL|Pratt, Philip J. and Last, Mary Z.|9781111527273\n2022|Independently published|SQL: 2 Books in 1 - The Ultimate Beginner & Intermediate Guides To Mastering SQL Programming Quickly (Computer Programming)|Reed, Mark|9798415220236\n2017|Pragmatic Programmers, LLC, The|SQL Antipatterns: Avoiding the Pitfalls of Database Programming (Pragmatic Programmers)|Karwin, Bill|9781934356555\n2013|Cengage Learning|MCSA Guide to Microsoft SQL Server 2012 (Exam 70-462) (Networking (Course Technology))|Akkawi, Faisal and Akkawi, Kayed and Schofield|9781285821139\n2022|Independently published|SQL: The Ultimate Intermediate Guide to Learning SQL Programming Step by Step (Computer Programming)|Reed, Mark|9798402491663\n2019|Apress|SQL Server 2019 Revealed: Including Big Data Clusters and Machine Learning|Ward, Bob|9781484254196\n2016|McGraw-Hill Education|Delivering Business Intelligence with Microsoft SQL Server 2016, Fourth Edition|Larson, Brian|9781259641497\n2020|Packt Publishing|Learn SQL Database Programming: Query and manipulate databases from popular relational database servers using SQL|Bush, Josephine|9781838981709\n2019-12-13T00:00:01Z|Apress|Beginning Database Programming Using ASP.NET Core 3: With MVC, Razor Pages, Web API, jQuery, Angular, SQL Server, and NoSQL|Joshi, Bipin|9781484255087\n2017-12-15T00:00:01Z|CreateSpace Independent Publishing Platform|SQL: Learn SQL In 2 Hours And Start Programming Today!|Alvin, Cooper|9781981745982\n2014|Rampant TechPress|SQL Design Patterns: The Expert Guide to SQL Programming (IT In-Focus) (Volume 4)|Tropashko, Vadim|9780977671540\n2012|Microsoft Press|Microsoft SQL Server 2012 T-SQL Fundamentals (Developer Reference)|Ben-Gan, Itzik|9780735658141\n2020|Packt Publishing|Learn SQL Database Programming: Query and manipulate databases from popular relational database servers using SQL|Bush, Josephine|9781838984762\n2020|Apress|Practical Azure SQL Database for Modern Developers: Building Applications in the Microsoft Cloud|Mauri, Davide and Coriani, Silvano and Hoffman, Anna and Mishra, Sanjay and Popovic, Jovan|9781484263709\n2020|In Easy Steps Limited|SQL in easy steps|McGrath, Mike|9781840789027\n2021|Wiley|SQL for Data Scientists: A Beginner's Guide for Building Datasets for Analysis|Teate, Renee M. P.|9781119669395\n2017|McGraw-Hill Education|OCA Oracle Database SQL Exam Guide (Exam 1Z0-071) (Oracle Press)|O'Hearn, Steve|9781259584619\n2014|Morgan Kaufmann|Joe Celko's SQL for Smarties: Advanced SQL Programming (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780128007617\n2018|Apress|SQL Server 2017 Query Performance Tuning: Troubleshoot and Optimize Query Performance|Fritchey, Grant|9781484238882\n2018|Apress|Beginning DAX with Power BI: The SQL Pro’s Guide to Better Business Intelligence|Seamark, Philip|9781484234778\n2020|Apress|SQL Server Data Automation Through Frameworks: Building Metadata-Driven Frameworks with T-SQL, SSIS, and Azure Data Factory|Andy Leonard and Kent Bradshaw|9781484262139\n2020|Apress|SQL Server 2019 AlwaysOn: Supporting 24x7 Applications with Continuous Uptime|Carter, Peter A.|9781484264799\n2012|Apress|SQL Server 2012 T-SQL Recipes: A Problem-Solution Approach (Expert's Voice in SQL Server)|Brimhall, Jason and Dye, David and Roberts, Timothy and Sheffield, Wayne and Gennick, Jonathan and Sack, Joseph|9781430242017\n2005|McGraw-Hill Education|SQL Demystified|Oppel, Andrew|9780072262247\n2015|CreateSpace Independent Publishing Platform|Programming: Computer Programming for Beginners: Learn the Basics of Java, SQL & C++ (Coding, C Programming, Java Programming, SQL Programming, JavaScript, Python, PHP)|Connor, Joseph|9781518662584\n2018|Apress|Securing SQL Server: DBAs Defending the Database|Carter, Peter A.|9781484241615\n2012|In Easy Steps Limited|SQL in easy steps|McGrath, Mike|9781840785432\n2008|Wiley|SQL Bible|Kriegel, Alex and Trukhnov, Boris M.|9780470229064\n2012|Microsoft Press|Microsoft SQL Server 2012 T-SQL Fundamentals (Developer Reference)|Ben-Gan, Itzik|9780735673953\n2019|Independently published|SQL: Comprehensive Beginners Guide to SQL Programming with Exercises and Case Studies|Jacobs, Paige|9781793213433\n2019|Independently published|SQL For Beginners SQL Made Easy: A Step-By-Step Guide to SQL Programming for the Beginner, Intermediate and Advanced User (Including Projects and Exercises)|Berg, Craig|9781695283565\n2013|Microsoft Press|Microsoft SQL Server 2012 Step by Step (Step by Step Developer)|LeBlanc, Patrick|9780735670037\n2015|Apress|Extending SSIS with .NET Scripting: A Toolkit for SQL Server Integration Services|van Rossum, Joost and Baccaro, Regis|9781484206386\n2014|McGraw-Hill Education|Microsoft SQL Server 2014 Query Tuning & Optimization|Nevarez, Benjamin|9780071829427\n2008|For Dummies|Microsoft SQL Server 2008 All-in-One Desk Reference For Dummies|Schneider, Robert D. and Gibson, Darril|9780470179543\n2019|Independently published|SQL Programming: The Ultimate Guide with Exercises, Tips and Tricks to Learn SQL|Parker, Damon|9781671682191\n2019|Clydebank Media Llc|SQL Quickstart Guide: The Simplified Beginner's Guide to Managing, Analyzing, and Manipulating Data With SQL|Shields, Walter|9781636100197\n2017|Apress|Building Custom Tasks for SQL Server Integration Services|Leonard, Andy|9781484229408\n2012|Morgan Kaufmann|Joe Celko's Trees and Hierarchies in SQL for Smarties (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780123877567\n2016-11-03T00:00:01Z|CreateSpace Independent Publishing Platform|SQL: Easy SQL Programming & Database Management For Beginners, Your Step-By-Step Guide To Learning The SQL Database (SQL Series)|Alvaro, Felix|9781539916055\n2019-07-28T00:00:01Z|Independently published|Coding by Doing: For Absolute Beginners – 2 Books in One – Learn SQL and Python Programming: Learn Programming Fast|Coding Languages Academy|9781082841828\n2017|Apress|XML and JSON Recipes for SQL Server: A Problem-Solution Approach|Grinberg, Alex|9781484231173\n2020|Packt Publishing|Introducing Microsoft SQL Server 2019: Reliability, scalability, and security both on premises and in the cloud|Gorman, Kellyn and Hirt, Allan and Noderer, Dave and Pearson, Mitchell and Rowland-Jones, James and Ryan, Dustin and Sirpal, Arun and Woody, Buck|9781838829827\n2009|Packt Publishing|Oracle SQL Developer 2.1|Harper, Sue|9781847196279\n2016|Packt Publishing|SQL Server 2016 Reporting Services Cookbook|Priyankara, Dinesh and Cain, Robert C.|9781786467997\n2020|Apress|Pro SQL Server Relational Database Design and Implementation: Best Practices for Scalability and Performance|Davidson, Louis|9781484264973\n2005|Morgan Kaufmann|Joe Celko's SQL Programming Style (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780120887972\n2019-12-05T00:00:01Z|Independently published|SQL Computer Programming for Beginners: The Ultimate Guide To Learn SQL Programming Basics, SQL Languages, Queries and Practice Problems, SQL Server and Database, Coding Languages for Beginners|Hack, Anthony|9781671803763\n2017-11-13T00:00:01Z|CreateSpace Independent Publishing Platform|\"SQL Programming & Database Management For Absolute Beginners SQL Server, Structured Query Language Fundamentals: \"\"Learn - By Doing\"\" Approach And Master SQL\"|Sullivan, William|9781979683821\n2009|Microsoft Press|Inside Microsoft® SQL Server® 2008: T-SQL Querying|Itzik Ben-Gan and Lubor Kollar and Dejan Sarka and Steve Kass|9780735638303\n2009|Sams Publishing|Sams Teach Yourself SQL in One Hour a Day|Stephens, Ryan and Plew, Ron and Jones, Arie|9780672330254\n2019|Apress|Query Store for SQL Server 2019: Identify and Fix Poorly Performing Queries|Boggiano, Tracy and Fritchey, Grant|9781484250044\n2009|Microsoft Press|Inside Microsoft® SQL Server® 2008: T-SQL Querying (Developer Reference)|Itzik Ben-Gan and Lubor Kollar and Dejan Sarka and Steve Kass|9780735626034\n2010-05-31T00:00:01Z|Red gate books|Defensive Database Programming with SQL Server|Kuznetsov, Alex|9781906434496\n2008|Microsoft Press|Microsoft® SQL Server® 2008 T-SQL Fundamentals (Developer Reference)|Ben-Gan, Itzik|9780735626010\n2021|BPB Publications|Learn T-SQL From Scratch: An Easy-to-Follow Guide for Designing, Developing, and Deploying Databases in the SQL Server and Writing T-SQL Queries Efficiently (English Edition)|Shukla, Brahmanand|9789391392413\n2009|Microsoft Press|Inside Microsoft SQL Server 2008 T-SQL Programming (Developer Reference)|Ben-Gan, Itzik and Sarka, Dejan and Wolter, Roger and Low, Greg and Katibah, Ed and Kunen, Isaac|9780735646476\n2015|Apress|SQL Server T-SQL Recipes|Dye, David and Brimhall, Jason and Roberts, Timothy and Sheffield, Wayne and Sack, Joseph and Gennick, Jonathan|9781484200629\n2020|Apress|Refactoring Legacy T-SQL for Improved Performance: Modern Practices for SQL Server Applications|Bohm, Lisa|9781484255810\n2012|Morgan Kaufmann|Joe Celko's Trees and Hierarchies in SQL for Smarties (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780123877338\n2016|Apress|Beginning SQL Queries: From Novice to Professional|Churcher, Clare|9781484219553\n2018|Apress|MySQL Connector/Python Revealed: SQL and NoSQL Data Storage Using MySQL for Python Programmers|Krogh, Jesper Wisborg|9781484236949\n2013|Sams Publishing|Microsoft SQL Server 2012 Unleashed|Rankins, Ray and Bertucci, Paul and Gallelli, Chris and Silverstein, Alex T.|9780133408515\n2006|McGraw-Hill Education|Microsoft SQL Server 2005 Stored Procedure Programming in T-SQL & .NET|Sunderic, Dejan|9780072262285\n2020|nelly B.L. International Consulting LTD.|SQL: 3 books in 1 - The Ultimate Beginners, Intermediate and Expert Guide to Master SQL Programming|Turner, Ryan|9781647710804\n2018|Apress|Pro SQL Server on Linux: Including Container-Based Deployment with Docker and Kubernetes|Ward, Bob|9781484241288\n2019-09-10T00:00:01Z|Independently published|SQL Programming: The Ultimate Step-By-Step Guide to Learning SQL for Beginners|Johnson, Bryan|9781692193959\n2018|Apress|SQL Primer: An Accelerated Introduction to SQL Basics|Batra, Rahul|9781484235768\n2010|Morgan Kaufmann|Joe Celko's SQL for Smarties: Advanced SQL Programming (The Morgan Kaufmann Series in Data Management Systems)|Celko, Joe|9780123820228\n2016|Apress|Beginning SQL Queries: From Novice to Professional|Churcher, Clare|9781484219546\n2012|Joes 2 Pros International LLC|SQL Queries 2012 Joes 2 Pros (R) Volume 4: Query Programming Objects for SQL Server 2012 (SQL Exam Prep Series 70-461 Volume 4 of 5)|Morelan, Rick and Dave, Pinal|9781939666031\n2021|Apress|High Performance SQL Server: Consistent Response for Mission-Critical Applications|Nevarez, Benjamin|9781484264911", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Synthesizing highly expressive SQL queries from input-output examples|10.1145/3062341.3062365|127|18|Chenglong Wang and Alvin Cheung and R. Bodík|8c7cf9c759dcca3195dea6e27c2e25ee9a05671c\n2009|Semantic Mapping between Natural Language Questions and SQL Queries via Syntactic Pairing|10.1007/978-3-642-12550-8_17|59|1|A. Giordani and Alessandro Moschitti|1f8a99790dd9124d528a718e55a0b27683685c77\n2009|The Script-Writer's Dream: How to Write Great SQL in Your Own Language, and Be Sure It Will Succeed|10.1007/978-3-642-03793-1_3|55|12|Ezra Cooper|c93c5db888d9d33b7834f9c791a390d65b2e9bf7\n2017|A Formal Semantics of SQL Queries, Its Validation, and Applications|10.14778/3151113.3151116|33|3|P. Guagliardo and L. Libkin|6fbeb731108f983aa5899e5bd0ee190c7943bffb\n2020|Efficiently Translating Complex SQL Query to MapReduce Jobflow on Cloud|10.1109/TCC.2017.2700842|24|0|Zhiang Wu and Aibo Song and Jie Cao and Junzhou Luo and Lu Zhang|186e8be20c8f665ad61720389b7c0a7358e1a105\n1996|SQL language summary|10.1145/234313.234374|19|2|Jim Melton|a9c2ff098f01a290a569b4cabaffe3210558c5ee\n2019|ML2SQL - Compiling a Declarative Machine Learning Language to SQL and Python|10.5441/002/edbt.2019.56|15|0|Maximilian E. Schüle and Matthias Bungeroth and Dimitri Vorona and A. Kemper and Stephan Günnemann and Thomas Neumann|d0a8f899cc206bcbc438b752b3e3667ef175b997\n1999|SQLJ Part 1: SQL routines using the Java programming language|10.1145/344816.344864|13|1|A. Eisenberg and Jim Melton|75aac5614558f08595d4b737c075e89e47040337\n2019|The Power of SQL Lambda Functions|10.5441/002/edbt.2019.49|12|0|Maximilian E. Schüle and Dimitri Vorona and Linnea Passing and Harald Lang and A. Kemper and Stephan Günnemann and Thomas Neumann|c8b92b0f91b4bbfbd1d591d2fec58626dd6abc38\n2015|Provenance for SQL through Abstract Interpretation: Value-less, but Worthwhile|10.14778/2824032.2824089|11|0|T. Müller and Torsten Grust|b1a57f8ed3084ba83cfcd896460777db15b638c8\n2017|Recommender system for learning SQL using hints|10.1080/10494820.2016.1244084|10|0|D. Lavbic and Tadej Matek and Aljaz Zrnec|ceb4ab8fb183838573b87cec5bd25c906949be24\n2014|Secured web application using combination of Query Tokenization and Adaptive Method in preventing SQL Injection Attacks|10.1109/I4CT.2014.6914229|9|2|Noor Ashitah Abu Othman and Fakariah Hani Mohd Ali and Mashyum Binti Mohd Noh|303cdd670ae8d664e6529b1bf6dfb443c077d2d8\n2009|Automatic Grading System on SQL Programming|10.1109/EmbeddedCom-ScalCom.2009.105|9|0|Haifeng Ke and Gaoyan Zhang and Hui Yan|a7954d5f57238a8dd66538407545cedbb3f67254\n2020|Duoquest: A Dual-Specification System for Expressive SQL Queries|10.1145/3318464.3389776|8|1|Christopher Baik and Zhongjun (Mark) Jin and Michael J. Cafarella and H. Jagadish|d7723ecfc43b0a6c4178f57ae53f8f4aabfd5f62\n1992|Functional SOL (FSOL), an SQL upward-compatible database programming language|10.1016/0020-0255(92)90015-Z|8|0|P. Valduriez and S. Danforth|7bde5edcbcf2edf9ca50cda548d3ed43c2b6fd13\n2019|Big SQL systems: an experimental evaluation|10.1007/s10586-019-02914-4|7|0|Victor Aluko and S. Sakr|3060d85dd740a8687b0834449c885d494be34db2\n2018|Meet cyrus: the query by voice mobile assistant for the tutoring and formative assessment of SQL learners|10.1145/3297280.3297523|5|1|Josue Espinosa Godinez and H. Jamil|3b86d14de4a21a0c30bca827fa8b0dea4c0b9396\n2020|Explaining Causes Behind SQL Query Formulation Errors|10.1109/FIE44824.2020.9274114|5|3|Toni Taipalus|8e0d0c73e91bb449ace38403402cd5713978c0c8\n2021|SQLRepair: Identifying and Repairing Mistakes in Student-Authored SQL Queries|10.1109/ICSE-SEET52601.2021.00030|5|3|Kai Presler-Marshall and S. Heckman and Kathryn T. Stolee|0a0e2ef9f1cab6b872f84dc3d2af85f8abf41967\n2017|Database Query Analyzer (DBQA): A Data-Oriented SQL Clause Visualization Tool|10.1145/3125659.3125688|4|1|Ryan Hardt and Esther Gutzmer|2621b328ec60ba6ac556b83f993ab28726027a94\n2008|An Evolutionary Method for Natural Language to SQL Translation|10.1007/978-3-540-89694-4_44|4|1|A. Afonso and L. C. Brito and Oto Vale|5d82136298dfca0da6c2ce808c87816696f14e40\n2018|Perancangan Aplikasi Pendeteksi Kesalahan Perintah SQL Query Menggunakan Algoritma Knuth Morris Pratt|10.30865/JURIKOM.V5I4.954|4|0|G. L. Ginting and Dian Puspita Napitupulu and Pristiwanto Pristiwanto|588c66889c14e86166d8e41cd6ebadda5ff2da65\n1995|Information Technology. Programming Language. The SQL Ada Module Description Language (SAMeDL).|10.3403/00539178|4|1|M. Graham|d5067e3310269f48c6035eee6db9d4e0e52f7b6e\n2017|A Typeful Integration of SQL into Curry|10.4204/EPTCS.234.8|3|0|M. Hanus and Julian Kroné|ff489391a309473dbfdb856a6c0a8f3270040622\n2018|Investigation of SQL Clone on MVC-based Application|10.12962/J23546026.Y2018I1.3511|3|0|Fawwaz Ali Akbar and S. Rochimah and R. J. Akbar|e19bbcf1c7ec995207888a0e8120e7cf04bc6f1b\n2019|SWRL Parallel Reasoning Method with Spark SQL|10.1109/icis46139.2019.8940207|3|0|Wan Li and Huaai Kang and Dongbo Ma and Weiwei Wei|fd6f4d41bf848523ab01b02e0d3438a4aec0fa50\n2019|A Review on Methods for Prevention of SQL Injection Attack|10.32628/IJSRST196258|3|0|Sweta Raut and Akshay Nikhare and Yogesh Punde and Snehal Manerao and Shubham Choudhary|76973c38a22770272431ee4c2b1981dc4a5c4383\n2019|SqlSol: An accurate SQL Query Synthesizer|10.1007/978-3-030-32409-4_7|3|0|Lin Cheng|eab5621008e6eb7221a1fe51fd4091a9fcc870f1\n2020|SWRL Parallel Reasoning Implementation with Spark SQL|10.1088/1757-899X/719/1/012020|3|0|Wan Li and Huaai Kang and Dongbo Ma and Weiwei Wei|a84fa79f3f38fa34859e323e092d24b19467278b\n2017|SQL Injection: The Longest Running Sequel in Programming History|10.15394/JDFSL.2017.1475|3|0|M. Horner and Thomas Hyslip|50275fe35ff9889a681ac8f584fecc5b178f10a9\n2016|S4J - Integrating SQL into Java at Compiler-Level|10.1007/978-3-319-46254-7_24|2|0|Keven Richly and M. Lorenz and Sebastian Oergel|5ca3eadf08f8c40d6a9980beda942b95c5b57acb\n2020|SQL for data scientists|10.14778/3415478.3415526|2|0|Uwe Röhm and L. Brent and Tim Dawborn and Bryn Jeffries|49244f6a94793935cd5c43c4165f41f55e006f30\n2020|Detection of SQL Injection Vulnerability in Embedded SQL|10.1587/transinf.2019edl8143|2|0|Young-Su Jang|3963e5801d6c2d0b051bd3519fb9c14d67f57b81\n2020|Translation of Array-Based Loops to Spark SQL|10.1109/BigData50022.2020.9378136|1|0|Md Hasanuzzaman Noor and L. Fegaras|234ba3a287178ddce5af915d5c16950d3e0a4064\n2020|Verification supported refactoring of embedded sql|10.1007/s11219-020-09517-y|1|0|Mirko Spasic and Milena Vujosevic-Janicic|826a68181bc2d39ab370bce1f48255ed0e97fcd2\n2020|Efficient dam management using SQL and GIS|10.37023/ee.7.2.1|1|0|Mario Jancetić and N. Kranjčić and Milan Rezo|4695c4d9c2484935742a3974090cac1e4f95c984\n2021|Data Transformation from SQL to NoSQL MongoDB Based on R Programming Language|10.1109/ISMSIT52890.2021.9604548|1|0|F. Hasan and Muhamad Shahbani Abu Bakar|90dcbe721505cef84e7f4649dc2b4ccbbd4e3ba3" }, "sqlalchemy": { "title": "Sqlalchemy", "appeared": 2006, "type": "queryLanguage", "creators": [ "Michael Bayer" ], "website": "https://www.sqlalchemy.org/", "documentation": [ "https://docs.sqlalchemy.org/en/14/" ], "emailList": [ "https://groups.google.com/g/sqlalchemy" ], "country": [ "United States" ], "originCommunity": [ "https://www.sqlalchemy.org/support.html" ], "writtenIn": [ "python" ], "githubRepo": { "stars": 62000, "forks": 1000, "subscribers": 95, "updated": 2022, "url": "https://github.com/sqlalchemy/sqlalchemy" }, "repoStats": { "firstCommit": 2005, "commits": 20900, "committers": 656, "files": 912 }, "wikipedia": { "example": [ "SELECT movies.id, movies.title, movies.year, movies.directed_by, directors.id, directors.name\nFROM movies LEFT OUTER JOIN directors ON directors.id = movies.directed_by " ], "url": "https://en.wikipedia.org/wiki/SQLAlchemy" }, "twitter": "https://twitter.com/sqlalchemy", "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nEssential SQLAlchemy|2008|Rick Copeland|3424571|3.30|47|4\nEssential Sqlalchemy: Mapping Python to Databases|2015|Jason Myers|27560172|3.83|66|4\nSqlalchemy: Database Access Using Python|2013|Mark Ramm|13660522|5|1|0\nSQLAlchemy Tutorial: Python SQL toolkit and Object Relational Mapper|2020|Gouic Books|50636637|4|1|0" }, "sqlar-format": { "title": "sqlar-format", "appeared": 2014, "type": "binaryDataFormat", "description": "This program (named \"sqlar\") operates much like \"zip\", except that the compressed archive it builds is stored in an SQLite database instead of a ZIP archive.", "reference": [ "https://sqlite.org/sqlar/doc/trunk/README.md" ], "related": [ "gzip", "zip-format" ] }, "sqlite-storage-format": { "title": "sqlite-storage-format", "appeared": 2000, "type": "binaryDataFormat", "description": "The complete state of an SQLite database is usually contained in a single file on disk called the \"main database file\". During a transaction, SQLite stores additional information in a second file called the \"rollback journal\", or if SQLite is in WAL mode, a write-ahead log file.", "reference": [ "https://www.sqlite.org/fileformat.html#:~:text=The%20complete%20state%20of%20an,a%20write%2Dahead%20log%20file." ] }, "sqlite": { "title": "SQLite", "appeared": 2000, "type": "queryLanguage", "isPublicDomain": true, "creators": [ "Dwayne Richard Hipp" ], "website": "https://sqlite.org", "webRepl": [ "https://sqlite.org/fiddle/index.html" ], "documentation": [ "https://www.sqlite.org/docs.html" ], "reference": [ "https://www.vldb.org/pvldb/vol15/p3535-gaffney.pdf" ], "domainName": { "registered": 2002, "awisRank": { "2017": 24351, "2022": 27031 }, "name": "sqlite.org" }, "usesSemanticVersioning": true, "releaseNotesUrl": "https://www.sqlite.org/changes.html", "versions": { "2022": [ "3.40.1" ] }, "writtenIn": [ "c" ], "hasBooleans": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "keywords": [ "ABORT", "ACTION", "ADD", "AFTER", "ALL", "ALTER", "ANALYZE", "AND", "AS", "ASC", "ATTACH", "AUTOINCREMENT", "BEFORE", "BEGIN", "BETWEEN", "BY", "CASCADE", "CASE", "CAST", "CHECK", "COLLATE", "COLUMN", "COMMIT", "CONFLICT", "CONSTRAINT", "CREATE", "CROSS", "CURRENT_DATE", "CURRENT_TIME", "CURRENT_TIMESTAMP", "DATABASE", "DEFAULT", "DEFERRABLE", "DEFERRED", "DELETE", "DESC", "DETACH", "DISTINCT", "DROP", "EACH", "ELSE", "END", "ESCAPE", "EXCEPT", "EXCLUSIVE", "EXISTS", "EXPLAIN", "FAIL", "FOR", "FOREIGN", "FROM", "FULL", "GLOB", "GROUP", "HAVING", "IF", "IGNORE", "IMMEDIATE", "IN", "INDEX", "INDEXED", "INITIALLY", "INNER", "INSERT", "INSTEAD", "INTERSECT", "INTO", "IS", "ISNULL", "JOIN", "KEY", "LEFT", "LIKE", "LIMIT", "MATCH", "NATURAL", "NO", "NOT", "NOTNULL", "NULL", "OF", "OFFSET", "ON", "OR", "ORDER", "OUTER", "PLAN", "PRAGMA", "PRIMARY", "QUERY", "RAISE", "RECURSIVE", "REFERENCES", "REGEXP", "REINDEX", "RELEASE", "RENAME", "REPLACE", "RESTRICT", "RIGHT", "ROLLBACK", "ROW", "SAVEPOINT", "SELECT", "SET", "TABLE", "TEMP", "TEMPORARY", "THEN", "TO", "TRANSACTION", "TRIGGER", "UNION", "UNIQUE", "UPDATE", "USING", "VACUUM", "VALUES", "VIEW", "VIRTUAL", "WHEN", "WHERE", "WITH", "WITHOUT" ], "gource": "https://www.youtube.com/watch?v=kjdxiG17hGM", "wikipedia": { "related": [ "c", "sql", "postgresql", "tcl", "json", "sql-92", "perl", "unicode", "jscript", "vbscript", "django", "drupal", "rails", "solaris", "android", "freebsd", "ios", "autoit", "basic", "freebasic", "purebasic", "visual-basic.net", "xojo", "csharp", "clipper", "curl", "d", "elixir", "emacs-lisp", "f-sharp", "go", "haskell", "haxe", "java", "javascript", "julia", "lisp", "common-lisp", "openlisp", "livecode", "labview", "lua", "matlab", "nim", "objective-c", "ocaml", "pascal", "free-pascal", "delphi", "php", "pike", "python", "r", "racket", "rebol", "ruby", "scheme", "smalltalk", "swift", "isbn", "doi" ], "summary": "SQLite ( or ) is a relational database management system contained in a C programming library. In contrast to many other database management systems, SQLite is not a client–server database engine. Rather, it is embedded into the end program. SQLite is ACID-compliant and implements most of the SQL standard, using a dynamically and weakly typed SQL syntax that does not guarantee the domain integrity. SQLite is a popular choice as embedded database software for local/client storage in application software such as web browsers. It is arguably the most widely deployed database engine, as it is used today by several widespread browsers, operating systems, and embedded systems (such as mobile phones), among others. SQLite has bindings to many programming languages.", "pageId": 244884, "dailyPageViews": 569, "created": 2003, "backlinksCount": 624, "revisionCount": 1414, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/SQLite" }, "antlr": "https://github.com/antlr/grammars-v4/tree/master/sqlite", "rijuRepl": { "example": [ "SELECT 'Hello, world!';\n" ], "id": "https://riju.codes/sqlite" }, "tryItOnline": "sqlite", "indeedJobs": { "2022": 561, "query": "sqlite developer" }, "officialBlogUrl": [ "https://www.sqlite.org/news.html" ], "faqPageUrl": [ "https://www.sqlite.org/faq.html" ], "subreddit": [ { "memberCount": { "2022": 2744 }, "url": "https://reddit.com/r/sqlite" } ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nIntroducing Sqlite for Mobile Developers||Jesse Feiler|48076971|3.50|2|0\nIntroducing SQLite for Mobile Developers||Jesse Feiler|56046925|0.0|0|0\niPhone Database Programming Exercises: SQLite|2010|Norman McEntire|40492191|2.00|1|0", "isbndb": "year|publisher|title|authors|isbn13\n2011|Apress|The Definitive Guide to SQLite (Expert's Voice in Open Source)|Allen, Grant and Owens, Mike|9781430232261\n20061206|Springer Nature|The Definitive Guide to SQLite|Mike Owens|9781430201724\n20161115|Springer Nature|Build iOS Database Apps with Swift and SQLite|Kevin Languedoc|9781484222324\n2015|Apress|Introducing SQLite for Mobile Developers|Feiler, Jesse|9781484217665\n2019-11-25T00:00:01Z|Independently published|Think PyQt: A Smarter Way to Explore MariaDB and SQLite Driven Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781711653815\n2019-11-24T00:00:01Z|Independently published|Learn PyQt By Example: A Quick Start Guide to MySQL and SQLite Driven Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781711134468\n2019|Independently published|Learn PyQt The Hard Way: A Quick Start Guide to PostgreSQL and SQLite Driven Programming|Siahaan, Vivian and Sianipar, Rismon Hasiholan|9781711384313\n2004|Sams|SQLite|Newman, Chris.|9780672326851", "semanticScholar": "" }, "sqlmp": { "title": "SQLMP", "appeared": 1991, "type": "pl", "reference": [ "https://semanticscholar.org/paper/08c34d90f92dc708f12853fc2dc48366c6af3336" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8033", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "sqlpl": { "title": "SQLPL", "appeared": 2009, "type": "pl", "wikipedia": { "related": [ "sql", "sql-psm", "pl-sql" ], "summary": "SQL PL stands for Structured Query Language Procedural Language and was developed by IBM as a set of commands that extend the use of SQL in the IBM DB2 (DB2 UDB Version 7) database system. It provides procedural programmability in addition to the querying commands of SQL. It is a subset of the SQL Persistent Stored Modules (SQL/PSM) language standard. As of DB2 version 9, SQL PL stored procedures can run natively inside the DB2 process (inside the DBM1 address space, more precisely) instead of being fenced in an external process. In DB2 version 9.7 IBM also added a PL/SQL front-end to this infrastructure (called \"SQL Unified Runtime Engine\"), meaning that procedural SQL using either the ISO standard or Oracle's syntax compile to bytecode running on the same engine in DB2.", "backlinksCount": 13, "pageId": 11665982, "created": 2007, "revisionCount": 29, "dailyPageViews": 30, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/SQL_PL" }, "githubLanguage": { "fileExtensions": [ "sql", "db2" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nmicrosoft sql-server-samples https://github.com/microsoft.png https://github.com/microsoft/sql-server-samples SQLPL #ccc 3773 3553 131 \"Official Microsoft GitHub Repository containing code samples for SQL Server\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "sql", "codemirrorMode": "sql", "codemirrorMimeType": "text/x-sql", "tmScope": "source.sql", "repos": 7609, "id": "SQLPL" }, "githubBigQuery": { "repos": 5147, "users": 4749, "id": "SQLPL" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2016, "committerCount": 15, "commitCount": 224, "sampleCount": 6, "example": [ "create procedure sleep (in sleeptime integer)\nbegin\n declare wait_until timestamp;\n\n set wait_until = (current timestamp + sleeptime seconds);\n while (wait_until > current timestamp)\n do\n end while;\nend!\n" ], "url": "https://github.com/textmate/sql.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "sqr": { "title": "Structured Query Reporter", "appeared": 1980, "type": "pl", "standsFor": "Structured Query Reporter", "hasLineComments": { "example": "! A comment", "value": true }, "hasComments": { "example": "! A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "!" ] ], "wikipedia": { "related": [ "sql", "c", "cobol" ], "summary": "SQR (Hyperion SQR Production Reporting, Part of OBIEE) is a programming language designed for generating reports from database management systems. The name is an acronym of Structured Query Reporter, which suggests its relationship to SQL (Structured Query Language). Any SQL statement can be embedded in an SQR program.", "pageId": 1862060, "dailyPageViews": 62, "created": 2005, "backlinksCount": 22, "revisionCount": 89, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/SQR" }, "helloWorldCollection": [ "! Hello World in SQR\nbegin-program\n print 'Hello, World.' (1,1)\nend-program" ], "tiobe": { "id": "SQR" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSQR Programmer Reference: SQR Language Version 2.x-5.x|2000|Don Mellen|41708101|4.00|1|0\nSQR Programmer Reference-Second Edition|2002|Don Mellen|41391721|0.0|0|0" }, "sqrl": { "title": "SQRL", "appeared": 2018, "type": "queryLanguage", "creators": [ "Josh Yudaken", "Pete Hunt", "Julian Tempelsman", "Paul Mou", "Yunjing Xu", "David Newman" ], "description": "SQRL was the language designed by Smyte, and later acquired by Twitter in 2018. It is a safe, stateful language for event streams, designed to make it easy to enforce anti-abuse rules.", "website": "https://sqrl-lang.github.io/sqrl/", "webRepl": [ "https://websqrl.vercel.app/twitter" ], "reference": [ "https://websqrl.vercel.app/twitter", "https://news.ycombinator.com/item?id=34680269" ], "standsFor": "Smyte Query and Rules Language", "originCommunity": [ "Smyte" ], "example": [ "LET Username := input();\nLET Message := concat(\"Hello, \", Username, \"!\");\nEOF" ], "githubRepo": { "stars": 17, "forks": 3, "subscribers": 1, "created": 2022, "updated": 2023, "description": "A safe, stateful rules language for event streams", "issues": 4, "url": "https://github.com/sqrl-lang/sqrl" }, "repoStats": { "firstCommit": 2018, "commits": 255, "committers": 12, "files": 685 } }, "square": { "title": "SQUARE", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/eb3e849c11a44bc211adc8d393bae752d8396808" ], "hopl": "https://hopl.info/showlanguage.prx?exp=696", "wordRank": 1834, "centralPackageRepositoryCount": 0 }, "squeak": { "title": "Squeak", "appeared": 1996, "type": "pl", "website": "http://www.squeak.org", "domainName": { "registered": 1999, "awisRank": { "2022": 1641904 }, "name": "squeak.org" }, "hasStrings": { "example": "'Hello world'", "value": true }, "stringToken": [ [ "'" ] ], "wikipedia": { "related": [ "smalltalk", "newsqueak", "ios", "pharo", "lisp", "logo", "simula", "self", "etoys", "scratch", "linux" ], "summary": "The Squeak programming language is a dialect of Smalltalk. It is object-oriented, class-based, and reflective. It was derived directly from Smalltalk-80 by a group at Apple Computer that included some of the original Smalltalk-80 developers. Its development was continued by the same group at Walt Disney Imagineering, where it was intended for use in internal Disney projects. Later on the group moved on to be supported by HP labs, SAP Labs and most recently Y Combinator. Squeak is cross-platform. Programs produced on one platform run bit-identical on all other platforms, and versions are available for many platforms including the obvious Windows/macOS/linux versions. The Squeak system includes code for generating a new version of the virtual machine (VM) on which it runs. It also includes a VM simulator written in Squeak. For these reasons, it is easily ported.", "pageId": 37426, "dailyPageViews": 111, "created": 2002, "backlinksCount": 142, "revisionCount": 339, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/Squeak" }, "helloWorldCollection": [ "\"Hello world in Squeak\"\n\nTranscript show: 'Hello World'" ], "tiobe": { "id": "Squeak" }, "twitter": "https://twitter.com/squeaksmalltalk", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n|Soft Research Center|Freely Squeak programming (2004) ISBN: 4883732037 [Japanese Import]||9784883732036\n20061122|Springer Nature|Squeak|Stephane Ducasse|9781430200376\n2010||Dynamically-typed Programming Languages: Lisp, Perl, Python, Mumps, Smalltalk, Ruby, Logo, Tcl, Self, Common Lisp, Objective-c, Rebol, Squeak|Books and LLC|9781156994207", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2002|AspectS - Aspect-Oriented Programming with Squeak|10.1007/3-540-36557-5_17|160|7|R. Hirschfeld|59c19cc694fa21a294d6b7cc4a397af1b2b791b3\n2001|Using squeak for teaching user interface software|10.1145/364447.364588|9|0|M. Guzdial|0cc84b7324c915508fe842505f395e8260c6e0cf\n2006|Prototyping Languages Related Constructs and Tools with Squeak|10.7892/BORIS.19422|9|1|Alexandre Bergel and M. Denker|2ac5618707ebdd9023bb301038a813b3a5d6254f\n2011|Squeak Etoys na modalidade 1 para 1: programação e autoria multimídia no desenvolvimento da conceituação|10.5753/CBIE.WIE.2011.1226-1235|8|0|P. Schäfer and Bruno Fagundes Sperb and L. Fagundes|58d8730b1ae00e2a04756fe689277de10da4bfa1\n2010|Programming For Pre College Education Using Squeak Smalltalk|10.18260/1-2--16161|3|1|Kathryn N. Rodhouse and Benjamin Cooper and S. Watkins|6a372109ad0086d5d32e3c4121884520cfd8fa4e\n2007|Global Environmental Education using Squeak and Field Servers|10.1109/C5.2007.19|2|0|Mamoru Matsuoka and H. Okumura and Tomosumi Sasaki and H. Shimamura and Tsutomu Shimomura and T. Kameoka|22ed311bf1468d9c38f5839288349ce25d01c0f5\n2004|A trial course of programming with Squeak|10.1109/C5.2004.1314394|1|0|Yoshiaki Matsuzawa and Manabu Sugiura and H. Ohiwa|9e3cf29e8428d1960dc03bad6f3b8c6aaa155c2d\n2012|Development of State-Based Squeak and an Examination of Its Effect on Robot Programming Education|10.3837/tiis.2012.11.008|1|0|Hiroyuki Aoki and JaMee Kim and Yukio Idosaka and T. Kamada and S. Kanemune and Won-Gyu Lee|ba29ddf8769049fb4d459910886f101e600d08d3" }, "squidconf": { "title": "SquidConf", "appeared": 1996, "type": "configFormat", "reference": [ "http://www.squid-cache.org/" ], "hasFloats": { "example": "", "value": true }, "keywords": [ "access_log", "acl", "always_direct", "announce_host", "announce_period", "announce_port", "announce_to", "anonymize_headers", "append_domain", "as_whois_server", "auth_param_basic", "authenticate_children", "authenticate_program", "authenticate_ttl", "broken_posts", "buffered_logs", "cache_access_log", "cache_announce", "cache_dir", "cache_dns_program", "cache_effective_group", "cache_effective_user", "cache_host", "cache_host_acl", "cache_host_domain", "cache_log", "cache_mem", "cache_mem_high", "cache_mem_low", "cache_mgr", "cachemgr_passwd", "cache_peer", "cache_peer_access", "cache_replacement_policy", "cache_stoplist", "cache_stoplist_pattern", "cache_store_log", "cache_swap", "cache_swap_high", "cache_swap_log", "cache_swap_low", "client_db", "client_lifetime", "client_netmask", "connect_timeout", "coredump_dir", "dead_peer_timeout", "debug_options", "delay_access", "delay_class", "delay_initial_bucket_level", "delay_parameters", "delay_pools", "deny_info", "dns_children", "dns_defnames", "dns_nameservers", "dns_testnames", "emulate_httpd_log", "err_html_text", "fake_user_agent", "firewall_ip", "forwarded_for", "forward_snmpd_port", "fqdncache_size", "ftpget_options", "ftpget_program", "ftp_list_width", "ftp_passive", "ftp_user", "half_closed_clients", "header_access", "header_replace", "hierarchy_stoplist", "high_response_time_warning", "high_page_fault_warning", "hosts_file", "htcp_port", "http_access", "http_anonymizer", "httpd_accel", "httpd_accel_host", "httpd_accel_port", "httpd_accel_uses_host_header", "httpd_accel_with_proxy", "http_port", "http_reply_access", "icp_access", "icp_hit_stale", "icp_port", "icp_query_timeout", "ident_lookup", "ident_lookup_access", "ident_timeout", "incoming_http_average", "incoming_icp_average", "inside_firewall", "ipcache_high", "ipcache_low", "ipcache_size", "local_domain", "local_ip", "logfile_rotate", "log_fqdn", "log_icp_queries", "log_mime_hdrs", "maximum_object_size", "maximum_single_addr_tries", "mcast_groups", "mcast_icp_query_timeout", "mcast_miss_addr", "mcast_miss_encode_key", "mcast_miss_port", "memory_pools", "memory_pools_limit", "memory_replacement_policy", "mime_table", "min_http_poll_cnt", "min_icp_poll_cnt", "minimum_direct_hops", "minimum_object_size", "minimum_retry_timeout", "miss_access", "negative_dns_ttl", "negative_ttl", "neighbor_timeout", "neighbor_type_domain", "netdb_high", "netdb_low", "netdb_ping_period", "netdb_ping_rate", "never_direct", "no_cache", "passthrough_proxy", "pconn_timeout", "pid_filename", "pinger_program", "positive_dns_ttl", "prefer_direct", "proxy_auth", "proxy_auth_realm", "query_icmp", "quick_abort", "quick_abort_max", "quick_abort_min", "quick_abort_pct", "range_offset_limit", "read_timeout", "redirect_children", "redirect_program", "redirect_rewrites_host_header", "reference_age", "refresh_pattern", "reload_into_ims", "request_body_max_size", "request_size", "request_timeout", "shutdown_lifetime", "single_parent_bypass", "siteselect_timeout", "snmp_access", "snmp_incoming_address", "snmp_port", "source_ping", "ssl_proxy", "store_avg_object_size", "store_objects_per_bucket", "strip_query_terms", "swap_level1_dirs", "swap_level2_dirs", "tcp_incoming_address", "tcp_outgoing_address", "tcp_recv_bufsize", "test_reachability", "udp_hit_obj", "udp_hit_obj_size", "udp_incoming_address", "udp_outgoing_address", "unique_hostname", "unlinkd_program", "uri_whitespace", "useragent_log", "visible_hostname", "wais_relay", "wais_relay_host", "wais_relay_port" ], "pygmentsHighlighter": { "filename": "configs.py", "fileExtensions": [ "squid.conf" ], "id": "SquidConf" } }, "squiggle": { "title": "squiggle", "appeared": 2015, "type": "pl", "website": "http://squiggle-lang.org", "domainName": { "registered": 2015, "name": "squiggle-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n10524071|Squiggle|http://squiggle-lang.org/|2015-11-07 07:31:29 UTC|1446881489|obilgic|1|2" }, "squire": { "title": "Squire", "appeared": 2021, "type": "pl", "creators": [ "Sam Westerman" ], "githubRepo": { "firstCommit": 2021, "stars": 47, "forks": 6, "subscribers": 2, "created": 2021, "updated": 2022, "description": "The medieval language held together by twine.", "issues": 2, "url": "https://github.com/sampersand/squire" }, "repoStats": { "firstCommit": 2021, "commits": 322, "committers": 5, "files": 111 } }, "squirrel": { "title": "Squirrel", "appeared": 2003, "type": "pl", "creators": [ "Alberto Demichelis" ], "website": "http://squirrel-lang.org/", "documentation": [ "http://squirrel-lang.org/squirreldoc/" ], "fileExtensions": [ "nut" ], "domainName": { "registered": 2005, "awisRank": { "2017": 2282029, "2022": 2975006 }, "name": "squirrel-lang.org" }, "writtenIn": [ "cpp" ], "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "githubRepo": { "stars": 706, "forks": 145, "subscribers": 61, "created": 2015, "updated": 2022, "firstCommit": 2015, "description": "Official repository for the programming language Squirrel", "issues": 80, "url": "https://github.com/albertodemichelis/squirrel" }, "repoStats": { "firstCommit": 2015, "commits": 286, "committers": 47, "files": 147 }, "wikipedia": { "example": [ "class BaseVector {\n constructor(...)\n {\n if(vargv.len() >= 3) {\n x = vargv[0];\n y = vargv[1];\n z = vargv[2];\n }\n }\n x = 0;\n y = 0;\n z = 0;\n }\n\n class Vector3 extends BaseVector {\n function _add(other)\n {\n if(other instanceof ::Vector3)\n return ::Vector3(x+other.x,y+other.y,z+other.z);\n else\n throw \"wrong parameter\";\n }\n function Print()\n {\n ::print(x+\",\"+y+\",\"+z+\"\\n\");\n }\n }\n\n local v0 = Vector3(1,2,3)\n local v1 = Vector3(11,12,13)\n local v2 = v0 + v1;\n v2.Print();" ], "related": [ "javascript", "lua", "python", "minid", "ecmascript", "ruby" ], "summary": "Squirrel is a high level imperative, object-oriented programming language, designed to be a light-weight scripting language that fits in the size, memory bandwidth, and real-time requirements of applications like video games and hardware such as Electric Imp. MirthKit, a simple toolkit for making and distributing open source, cross-platform 2D games, uses Squirrel for its platform. It is used extensively by Code::Blocks for scripting and was also used in Final Fantasy Crystal Chronicles: My Life as a King. It is also used in Left 4 Dead 2, Portal 2 and Thimbleweed Park for scripted events.", "pageId": 2819069, "dailyPageViews": 65, "created": 2005, "backlinksCount": 39, "revisionCount": 173, "appeared": 2003, "fileExtensions": [ "nut" ], "url": "https://en.wikipedia.org/wiki/Squirrel_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "nut" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "c_cpp", "codemirrorMode": "clike", "codemirrorMimeType": "text/x-c++src", "tmScope": "source.nut", "repos": 1513, "id": "Squirrel" }, "githubBigQuery": { "repos": 433, "users": 284, "id": "Squirrel" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 23, "commitCount": 359, "sampleCount": 1, "example": [ "//example from http://www.squirrel-lang.org/#documentation\n\nlocal table = {\n\ta = \"10\"\n\tsubtable = {\n\t\tarray = [1,2,3]\n\t},\n\t[10 + 123] = \"expression index\"\n}\n \nlocal array=[ 1, 2, 3, { a = 10, b = \"string\" } ];\n \nforeach (i,val in array)\n{\n\t::print(\"the type of val is\"+typeof val);\n}\n \n/////////////////////////////////////////////\n \nclass Entity\n{\t\n\tconstructor(etype,entityname)\n\t{\n\t\tname = entityname;\n\t\ttype = etype;\n\t}\n\t\t\t\t\t\t\t\t\t\n\tx = 0;\n\ty = 0;\n\tz = 0;\n\tname = null;\n\ttype = null;\n}\n \nfunction Entity::MoveTo(newx,newy,newz)\n{\n\tx = newx;\n\ty = newy;\n\tz = newz;\n}\n \nclass Player extends Entity {\n\tconstructor(entityname)\n\t{\n\t\tbase.constructor(\"Player\",entityname)\n\t}\n\tfunction DoDomething()\n\t{\n\t\t::print(\"something\");\n\t}\n\t\n}\n \nlocal newplayer = Player(\"da playar\");\n \nnewplayer.MoveTo(100,200,300);\t\n" ], "url": "https://github.com/textmate/c.tmbundle" }, "projectEuler": { "memberCount": { "2019": 34, "2022": 42 }, "id": "Squirrel" }, "helloWorldCollection": [ "#!/usr/bin/squirrelsh\n// Hello world in Squirrel\nprintl(\"Hello, world!\");" ], "leachim6": { "filepath": "s/Squirrel.nut", "fileExtensions": [ "nut" ], "example": [ "print(\"Hello World\");" ], "id": "Squirrel" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Squirrel", "quineRelay": "Squirrel", "rijuRepl": { "example": [ "print(\"Hello, world!\\n\")\n" ], "id": "https://riju.codes/squirrel" }, "tryItOnline": "squirrel", "tiobe": { "id": "Squirrel" }, "twitter": "https://twitter.com/squirrellang", "ubuntuPackage": "squirrel3", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "squoze": { "title": "SQUOZE", "appeared": 1958, "type": "binaryDataFormat", "wikipedia": { "backlinksCount": 5, "appeared": 1959, "url": "https://en.wikipedia.org/wiki/SQUOZE" }, "hopl": "https://hopl.info/showlanguage.prx?exp=5458" }, "squrl": { "title": "SQURL", "appeared": 1981, "type": "pl", "reference": [ "https://semanticscholar.org/paper/11dbc983e5c48d88c62a91b4493db16b27145b0d" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6252", "centralPackageRepositoryCount": 0 }, "sr-programming-language": { "title": "SR", "appeared": 1988, "type": "pl", "wikipedia": { "related": [ "occam" ], "summary": "SR (short for Synchronizing Resources) is a programming language designed for concurrent programming. Resources encapsulate processes and the variables they share, and can be separately compiled. Operations provide the primary mechanism for process interaction. SR provides a novel integration of the mechanisms for invoking and servicing operations. Consequently, it supports local and remote procedure call, rendezvous, message passing, dynamic process creation, multicast, semaphores and shared memory. Version 2.2 has been ported to the Apollo, DECstation, Data General AViiON, HP 9000 Series 300, Multimax, NeXT, PA-RISC, RS/6000, Sequent Symmetry, SGI IRIS, Sun-3, Sun-4 and others.", "created": 2004, "backlinksCount": 9, "pageId": 485875, "revisionCount": 28, "dailyPageViews": 10, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/SR_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "sr": { "title": "SR", "appeared": 1988, "type": "pl", "reference": [ "https://semanticscholar.org/paper/189e0959aaadfe87c36802bb050644b0d7e5fbd6" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1437", "wordRank": 4301, "centralPackageRepositoryCount": 0 }, "srecode-template": { "title": "SRecode Template", "appeared": 2000, "type": "textMarkup", "description": "Semantic Recoder (or SRecode) is a template manager and code generator that is a part of CEDET.", "reference": [ "https://www.gnu.org/software/emacs/manual/html_mono/srecode.html" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "githubLanguage": { "fileExtensions": [ "srt" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "lisp", "codemirrorMode": "commonlisp", "codemirrorMimeType": "text/x-common-lisp", "tmScope": "source.lisp", "repos": 705466, "id": "SRecode Template" }, "githubBigQuery": { "repos": 163, "users": 160, "id": "SRecode Template" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2018, "committerCount": 6, "commitCount": 40, "sampleCount": 1, "example": [ ";;; linguist.srt --- Template for linguist-example-mode\n\n;; Not copyrighted whatsoever.\n;;\n;; GPL can bite my shiny metal ass.\n;;\n;; GitHub: 1\n;; Stallman: 0\n\nset mode \"default\"\n\nset comment_start \";\"\n\nset LICENSE \"It's public domain, baby. This was written for the sole\npurpose of the format's inclusion and recognition by GitHub Linguist.\nThis block of multiline text was added because every other .srt file\nI could find was GPL-licensed and had long-winded copyright blobs in\nthe file's header. Also, check out my sick line-wrapping abilities.\"\n\nset DOLLAR \"$\"\n\ncontext file\n\n\ntemplate license\n----\n{{LICENSE:srecode-comment-prefix}}\n----\n\n\ntemplate filecomment :file :user :time\n----\n{{comment_start}} {{FILENAME}} --- {{^}}\n{{comment_prefix}} YUO WAN GPL?\n{{comment_prefix}} \n{{comment_prefix}} Copyright (C) {{YEAR}} {{?AUTHOR}}\n{{comment_prefix}}\n{{comment_prefix}} TUO BAD\n{{comment_prefix}} WE EXPAT PEOPLE\n{{comment_prefix}} {{EXPLETIVE}} YOU!\n{{>:copyright}}\n{{comment_end}}\n----\n\n;; end\n" ], "url": "https://github.com/textmate/lisp.tmbundle" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "srl": { "title": "SRL", "appeared": 2016, "type": "queryLanguage", "creators": [ "Karim Geiger" ], "website": "https://simple-regex.com/", "standsFor": "Simple Regex Language", "domainName": { "registered": 2016, "awisRank": { "2017": 5551277 }, "name": "simple-regex.com" }, "example": [ "begin with any of (digit, letter, one of \"._%+-\") once or more,\nliterally \"@\",\nany of (digit, letter, one of \".-\") once or more,\nliterally \".\",\nletter at least 2 times,\nmust end, case insensitive" ], "githubRepo": { "stars": 1806, "forks": 73, "subscribers": 53, "created": 2016, "updated": 2022, "firstCommit": 2016, "description": "Simple Regex Language", "issues": 11, "url": "https://github.com/SimpleRegex/SRL-PHP" }, "repoStats": { "firstCommit": 2016, "commits": 61, "committers": 4, "files": 51 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "srv": { "title": "srv", "appeared": 2010, "type": "idl", "website": "http://wiki.ros.org/srv", "fileExtensions": [ "srv" ], "example": [ "#request constants\nint8 FOO=1\nint8 BAR=2\n#request fields\nint8 foobar\nanother_pkg/AnotherMessage msg\n---\n#response constants\nuint32 SECRET=123456\n#response fields\nanother_pkg/YetAnotherMessage val\nCustomMessageDefinedInThisPackage value\nuint32 an_integer" ] }, "ssb": { "title": "Secure Scuttlebutt", "appeared": 2014, "type": "protocol", "website": "https://www.scuttlebutt.nz/", "aka": [ "SSB" ], "githubRepo": { "stars": 1670, "forks": 180, "subscribers": 76, "created": 2014, "updated": 2023, "description": "The gossip and replication server for Secure Scuttlebutt - a distributed social network", "issues": 40, "url": "https://github.com/ssbc/ssb-server" }, "repoStats": { "firstCommit": 2014, "commits": 2179, "committers": 55, "files": 19 }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Secure_Scuttlebutt" } }, "ssc-pm": { "title": "Boston College Statistical Software Components", "appeared": 1996, "type": "packageManager", "website": "https://www.stata.com/manuals/rssc.pdf", "reference": [ "https://ideas.repec.org/s/boc/bocode.html", "http://fmwww.bc.edu/repec/bocode/s/sscstats.html" ], "packageCount": 4608, "forLanguages": [ "stata" ] }, "ssharp": { "title": "Script.NET", "appeared": 2007, "type": "pl", "description": "S# is a weakly-typed dynamic language and runtime infrastructure to make your applications extendable, customizable and highly flexible.", "website": "http://www.protsyk.com/scriptdotnet/", "aka": [ "Script.NET" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "githubRepo": { "firstCommit": 2010, "stars": 118, "forks": 37, "subscribers": 17, "created": 2010, "updated": 2022, "description": "S# is a weakly-typed dynamic language and runtime infrastructure to make your applications extendable, customizable and highly flexible. It allows introducing expressions and large code blocks evaluation within your applications in the similar way Microsoft Office deals with VBScript, gives you possibilities providing rich formula evaluation capabilities like it can be seen in MS Excel and other office applications.", "issues": 16, "url": "https://github.com/PetroProtsyk/SSharp" }, "repoStats": { "firstCommit": 2010, "commits": 69, "committers": 6, "files": 420 }, "wikipedia": { "example": [ "function Push(item)\n[\n//Limit to 10 items\n pre(me{{Not a typo|.}}Count < 10 ); \n post();\n invariant();\n]\n{\n //me is mutated object, \n //stack in this case\n me.Push(item);\n}\n\nfunction Pop()\n[//Check emptiness hardik\n pre(me{{Not a typo|.}}Count > 0);\n post();\n invariant();\n]\n{\n return me.Pop();\n}\n\nstack = new Stack<|int|>();\n\n//Create Mutant hardik\n//1. Set Functions, override stack{{Not a typo|.}}Push\nmObject=[Push->Push,PopCheck->Pop];\n//2. Capture object\nmObject.Mutate(stack);\n\nfor (i=0; i<5; i++)\n mObject.Push(i);\n\nConsole.WriteLine((string)mObject.PopCheck());" ], "related": [ "javascript", "vba", "boo", "jython", "nemerle" ], "summary": "Script.NET or S# is a metaprogramming language that provides scripting functionality in Microsoft .NET applications, allowing runtime execution of custom functionality, similar to VBA in Microsoft Office applications. The syntax of Script.NET is similar to JavaScript. It is designed to be simple and efficient scripting language allowing to customize .NET applications. The language has a true runtime interpreter, and it is executed without generating additional in-memory assemblies. Script.NET is an open-source project.", "pageId": 13819923, "created": 2007, "backlinksCount": 11, "revisionCount": 63, "dailyPageViews": 23, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/Script.NET" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "ssi": { "title": "SSI", "appeared": 2004, "type": "template", "standsFor": "Server Side Includes", "wikipedia": { "related": [ "html", "nginx-config", "edge-side-includes" ], "summary": "Server Side Includes (SSI) is a simple interpreted server-side scripting language used almost exclusively for the Web. Code is processed by web servers. The most frequent use of SSI is to include the contents of one or more files into a web page on a web server. For example, a web page containing a daily quotation could include the quotation by placing the following code into the file of the web page: With one change of the quote.txt file, all pages that include the file will display the latest daily quotation. The inclusion is not limited to files, and may also be the text output from a program, or the value of a system variable such as the current time. Server Side Includes are useful for including a common piece of code throughout a site, such as a page header, a page footer and a navigation menu. Conditional navigation menus can be conditionally included using control directives. In order for a web server to recognize an SSI-enabled HTML file and therefore carry out these instructions, either the filename should end with a special extension, by default .shtml, .stm, .shtm, or, if the server is configured to allow this, set the execution bit of the file.As a simple programming language, SSI supports only one type: text. Its control flow is rather simple, choice is supported, but loops are not natively supported and can only be done by recursion using include or using HTTP redirect. The simple design of the language makes it easier to learn and use than most server-side scripting languages, while complicated server-side processing is often done with one of the more feature-rich programming languages. SSI is Turing complete.Apache, LiteSpeed, nginx, and IIS are the four major web servers that support this language. SSI has a simple syntax: . Directives are placed in HTML comments so that if SSI is not enabled, users will not see the SSI directives on the page, unless they look at its source. Note that the syntax does not allow spaces between the leading \"<\" and the directive.", "backlinksCount": 63, "pageId": 424381, "created": 2004, "revisionCount": 302, "dailyPageViews": 144, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Server_Side_Includes" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "ssl-lang": { "title": "ssl-lang", "appeared": 1976, "type": "pl", "description": "SSL (Software Specification Language) is a new formalism for the definition of specifications for software systems. The language provides a linear format for the representation of the information normally displayed in a two-dimensional module inter-dependency diagram. In comparing SSL to FORTRAN or ALGOL, it is found to be largely complementary to the algorithmic (procedural) languages. SSL is capable of representing explicitly module interconnections and global data flow, information which is deeply imbedded in the algorithmic languages. On the other hand, SSL is not designed to depict the control flow within modules. The SSL level of software design explicitly depicts intermodule data flow as a functional specification.", "reference": [ "https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19760014843.pdf" ], "example": [ "a+b*\n\n3.0 * sin ( r + 1.0)\n\n2 * (ifix(c) + blank_coinmon.icount)\n\nname. feldl\n\nname set + [oe, fred)" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "ssl": { "title": "SSL", "appeared": 1994, "type": "protocol", "reference": [ "https://en.wikipedia.org/wiki/Transport_Layer_Security#SSL_1.0,_2.0_and_3.0" ], "standsFor": "Secure Sockets Layer", "fileType": "na", "wordRank": 5835, "centralPackageRepositoryCount": 0 }, "ssml": { "title": "Speech Synthesis Markup Language", "appeared": 2010, "type": "xmlFormat", "reference": [ "https://www.w3.org/TR/speech-synthesis/" ], "example": [ "\n\n \n Telephone Menu: Level 1\n \n\n

\n \n \n For English, press one.\n \n \n \n \n Para español, oprima el dos.\n \n \n

\n\n" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/Speech_Synthesis_Markup_Language" } }, "stacklang": { "title": "stacklang", "appeared": 2018, "type": "pl", "creators": [ "Justin Hu" ], "website": "https://justinhuprime.github.io/StackLang/index.html", "githubRepo": { "firstCommit": 2018, "stars": 4, "subscribers": 2, "created": 2018, "updated": 2021, "description": "Stack-based interpreted programming language inspired by Racket", "issues": 3, "forks": 0, "url": "https://github.com/JustinHuPrime/StackLang" }, "repoStats": { "firstCommit": 2018, "commits": 312, "committers": 6, "files": 93 } }, "stackless-python": { "title": "Stackless Python", "appeared": 1998, "type": "interpreter", "wikipedia": { "related": [ "c", "python", "linux", "erlang", "limbo", "go" ], "summary": "Stackless Python, or Stackless, is a Python programming language interpreter, so named because it avoids depending on the C call stack for its own stack. In practice, Stackless Python uses the C stack, but the stack is cleared between function calls . The most prominent feature of Stackless is microthreads, which avoid much of the overhead associated with usual operating system threads. In addition to Python features, Stackless also adds support for coroutines, communication channels and task serialization.", "pageId": 2009536, "created": 2005, "backlinksCount": 47, "revisionCount": 140, "dailyPageViews": 68, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Stackless_Python" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "stage2": { "title": "STAGE2", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/31bb1c092dba2b1a692b87cd2ff859bb7ce735f7" ], "hopl": "https://hopl.info/showlanguage.prx?exp=534", "centralPackageRepositoryCount": 0 }, "stalin": { "title": "Stalin", "appeared": 2006, "type": "compiler", "creators": [ "Jeffrey Mark Siskind" ], "wikipedia": { "related": [ "scheme", "chicken" ], "summary": "Stalin (STAtic Language ImplementatioN) is an aggressive optimizing batch whole-program Scheme compiler written by Jeffrey Mark Siskind. It uses advanced flow analysis and type inference and a variety of other optimization techniques to produce code. Stalin is intended for production use in generating an optimized executable. The compiler itself runs slowly, and there is little or no support for debugging or other niceties. Full R4RS Scheme is supported, with a few minor and rarely encountered omissions. Interfacing to external C libraries is straightforward. The compiler itself does lifetime analysis and hence does not generate as much garbage as might be expected, but global reclamation of storage is done using the Boehm garbage collector. The name is a joke: \"Stalin brutally optimizes.\" Stalin is free software, licensed under the GNU General Public License (GPL), and is available online.", "created": 2005, "backlinksCount": 12, "pageId": 2828643, "dailyPageViews": 14, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Stalin_(Scheme_implementation)" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "stan": { "title": "Stan", "appeared": 2012, "type": "pl", "website": "http://mc-stan.org/", "domainName": { "awisRank": { "2022": 266535 }, "name": "mc-stan.org" }, "writtenIn": [ "cpp" ], "hasTypeInference": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "wikipedia": { "related": [ "ia-32", "r", "matlab", "stata" ], "summary": "Stan is a probabilistic programming language for statistical inference written in C++. The Stan language is used to specify a (Bayesian) statistical model with an imperative program calculating the log probability density function. Stan is licensed under the New BSD License. Stan is named in honour of Stanislaw Ulam, pioneer of the Monte Carlo method.", "pageId": 42243853, "dailyPageViews": 68, "created": 2014, "backlinksCount": 116, "revisionCount": 34, "appeared": 2012, "url": "https://en.wikipedia.org/wiki/Stan_(software)" }, "githubLanguage": { "fileExtensions": [ "stan" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.stan", "repos": 774, "id": "Stan" }, "githubBigQuery": { "repos": 154, "users": 134, "id": "Stan" }, "pygmentsHighlighter": { "filename": "modeling.py", "fileExtensions": [ "stan" ], "id": "Stan" }, "linguistGrammarRepo": { "firstCommit": 2015, "lastCommit": 2018, "committerCount": 2, "commitCount": 86, "sampleCount": 3, "example": [ "data {\n int N;\n vector[N] incumbency_88;\n vector[N] vote_86;\n vector[N] vote_88;\n}\nparameters {\n vector[3] beta;\n real sigma;\n}\nmodel {\n vote_88 ~ normal(beta[1] + beta[2] * vote_86\n + beta[3] * incumbency_88,sigma);\n}\n" ], "url": "https://github.com/jrnold/atom-language-stan" }, "twitter": "https://twitter.com/mcmc_stan", "fileType": "text", "wordRank": 9401, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2015|Chapman and Hall/CRC|Statistical Rethinking: A Bayesian Course with Examples in R and Stan (Chapman & Hall/CRC Texts in Statistical Science)|McElreath, Richard|9781482253443\n2014|Academic Press|Doing Bayesian Data Analysis: A Tutorial with R, JAGS, and Stan|Kruschke, John|9780124059160" }, "standard-lisp": { "title": "Standard Lisp", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/4de0a5d3085447a5c230e1469c0c466584cdb9e7" ], "hopl": "https://hopl.info/showlanguage.prx?exp=872", "centralPackageRepositoryCount": 0 }, "standard-ml": { "title": "Standard ML", "appeared": 1990, "type": "pl", "website": "http://sml-family.org", "documentation": [ "http://www.cs.cmu.edu/~rwh/isml/book.pdf" ], "aka": [ "sml", "standardml" ], "fileExtensions": [ "sml" ], "domainName": { "registered": 2014, "awisRank": { "2017": 560018 }, "name": "sml-family.org" }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "print" ] ], "wikipedia": { "example": [ "- haar [1, 2, 3, 4, ~4, ~3, ~2, ~1];\n val it = [0,20,4,4,~1,~1,~1,~1] : int list" ], "related": [ "alice", "dependent-ml", "hope", "elm", "fstar", "ocaml", "rust", "scala", "ml", "caml", "c", "poplog", "pop-11", "common-lisp", "prolog", "emacs-editor", "isabelle", "extended-ml", "f-sharp" ], "summary": "Standard ML (SML; Standard Meta Language) is a general-purpose, modular, functional programming language with compile-time type checking and type inference. It is popular among compiler writers and programming language researchers, as well as in the development of theorem provers. SML is a modern dialect of ML, the programming language used in the Logic for Computable Functions (LCF) theorem-proving project. It is distinctive among widely used languages in that it has a formal specification, given as typing rules and operational semantics in The Definition of Standard ML (1990, revised and simplified as The Definition of Standard ML (Revised) in 1997).", "pageId": 100337, "dailyPageViews": 301, "created": 2002, "backlinksCount": 185, "revisionCount": 411, "appeared": 1997, "fileExtensions": [ "sml" ], "url": "https://en.wikipedia.org/wiki/Standard_ML" }, "githubLanguage": { "fileExtensions": [ "ml", "fun", "sig", "sml" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nkomeiji-satori Dress https://github.com/komeiji-satori.png https://github.com/komeiji-satori/Dress \"Standard ML\" #dc566d 11618 1639 636 \"好耶 是女装\"", "trendingProjectsCount": 2, "type": "programming", "aceMode": "text", "codemirrorMode": "mllike", "codemirrorMimeType": "text/x-ocaml", "tmScope": "source.ml", "aliases": [ "sml" ], "repos": 392047, "id": "Standard ML" }, "githubBigQuery": { "repos": 2390, "users": 2046, "id": "Standard ML" }, "pygmentsHighlighter": { "filename": "ml.py", "fileExtensions": [ "sml", "sig", "fun" ], "id": "Standard ML" }, "linguistGrammarRepo": { "firstCommit": 2006, "lastCommit": 2015, "committerCount": 6, "commitCount": 51, "sampleCount": 5, "example": [ " \nsignature LAZY_BASE =\n sig \n type 'a lazy\n exception Undefined\n val force: 'a lazy -> 'a\n val delay: (unit -> 'a) -> 'a lazy\n val undefined: 'a lazy\n end\n\nsignature LAZY' =\n sig\n include LAZY_BASE\n val isUndefined: 'a lazy -> bool\n val inject : 'a -> 'a lazy\n val toString: ('a -> string) -> 'a lazy -> string\n val eq: ''a lazy * ''a lazy -> bool\n val eqBy: ('a * 'a -> bool) -> 'a lazy * 'a lazy -> bool\n val compare: ('a * 'a -> order) -> 'a lazy * 'a lazy -> order\n val map: ('a -> 'b) -> 'a lazy -> 'b lazy\n\n structure Ops: \n sig\n val ! : 'a lazy -> 'a (* force *)\n val ? : 'a -> 'a lazy (* inject *)\n end\n end\n" ], "url": "https://github.com/textmate/standard-ml.tmbundle" }, "leachim6": { "filepath": "s/Standard ML.sml", "example": [ "fun hello() = print(\"Hello World\\n\");\n\nhello()\n" ], "id": "Standard ML" }, "quineRelay": "Standard ML", "rijuRepl": { "example": [ "print \"Hello, world!\\n\";\n" ], "id": "https://riju.codes/standardml" }, "tiobe": { "id": "Standard ML" }, "ubuntuPackage": "mlton", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "staple": { "title": "STAPLE", "appeared": 1975, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e915bf4b9635c01b3a77c4a357c67a37b5859782" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2810", "centralPackageRepositoryCount": 0 }, "star-prolog": { "title": "*Prolog", "appeared": 1989, "type": "pl", "reference": [ "https://semanticscholar.org/paper/eb5328ea0faa0364b6892d192d506edb3b9d3d11" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4206", "centralPackageRepositoryCount": 0 }, "star": { "title": "Star", "appeared": 2021, "type": "pl", "creators": [ "ALANVF" ], "githubRepo": { "firstCommit": 2021, "stars": 91, "forks": 2, "subscribers": 6, "created": 2021, "updated": 2022, "description": "An experimental programming language that's made to be powerful, productive, and predictable", "issues": 0, "url": "https://github.com/ALANVF/star" }, "repoStats": { "firstCommit": 2021, "commits": 235, "committers": 3, "files": 678 } }, "starlark": { "title": "starlark", "appeared": 2018, "type": "pl", "creators": [ "Laurent Le Brun" ], "description": "The language used in Bazel. Starlark is designed to be small, simple, and thread-safe. Although it is inspired from Python, it is not a general-purpose language and most Python features are not included. Starlark is syntactically a subset of Python 3", "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "example": [ "# Define a number\nnumber = 18\n\n# Define a dictionary\npeople = {\n \"Alice\": 22,\n \"Bob\": 40,\n \"Charlie\": 55,\n \"Dave\": 14,\n}\n\nnames = \", \".join(people.keys()) # Alice, Bob, Charlie, Dave\n\n# Define a function\ndef greet(name):\n \"\"\"Return a greeting.\"\"\"\n return \"Hello {}!\".format(name)\n\ngreeting = greet(names)\n\nabove30 = [name for name, age in people.items() if age >= 30]\n\nprint(\"{} people are above 30.\".format(len(above30)))\n\ndef fizz_buzz(n):\n \"\"\"Print Fizz Buzz numbers from 1 to n.\"\"\"\n for i in range(1, n + 1):\n s = \"\"\n if i % 3 == 0:\n s += \"Fizz\"\n if i % 5 == 0:\n s += \"Buzz\"\n print(s if s else i)\n\nfizz_buzz(20)" ], "githubRepo": { "firstCommit": 2018, "stars": 1416, "forks": 97, "subscribers": 62, "created": 2018, "updated": 2022, "description": "Starlark Language", "issues": 65, "url": "https://github.com/bazelbuild/starlark" }, "repoStats": { "firstCommit": 2018, "commits": 108, "committers": 29, "files": 62 }, "githubLanguage": { "type": "programming", "fileExtensions": [ "bzl", "star" ], "filenames": [ "BUCK", "BUILD", "BUILD.bazel", "Tiltfile", "WORKSPACE" ], "aceMode": "python", "codemirrorMode": "python", "codemirrorMimeType": "text/x-python", "tmScope": "source.python", "aliases": [ "bazel", "bzl" ], "repos": 3423, "id": "Starlark" }, "githubBigQuery": { "repos": 1141, "users": 562, "id": "Starlark" }, "leachim6": { "filepath": "s/Starlark.star", "fileExtensions": [ "star" ], "example": [ "print(\"Hello World\")\n" ], "id": "Starlark" }, "isbndb": "" }, "starlogo": { "title": "StarLogo", "appeared": 2008, "type": "pl", "wikipedia": { "related": [ "logo", "netlogo", "etoys", "lisp", "connection-machine", "java", "squeak", "smalltalk", "scratch" ], "summary": "StarLogo is an agent-based simulation language developed by Mitchel Resnick, Eric Klopfer, and others at MIT Media Lab and MIT Scheller Teacher Education Program in Massachusetts. It is an extension of the Logo programming language, a dialect of Lisp. Designed for education, StarLogo can be used by students to model the behavior of decentralized systems. The first StarLogo ran on a Connection Machine 2 parallel computer. A subsequent version ran on Macintosh computers; this version became known later as MacStarLogo (and now is called MacStarLogo Classic). The current StarLogo is written in Java and works on most computers. StarLogo is also available in a version called OpenStarLogo. The source code for OpenStarLogo is available online, although the license under which it is released is not an open source license according to the Open Source Definition, because of restrictions on the commercial use of the code. StarLogo TNG (The Next Generation) version 1.0 was released in July 2008. It provides a 3D world using OpenGL graphics and a block-based graphical language to increase ease of use and learnability. It is written in C and Java. StarLogo TNG uses \"blocks\" to put together puzzle-like pieces. StarLogo TNG reads the blocks in the order you fit them together, and sets the program in the Spaceland view. StarLogo is a primary influence for the Kedama particle system, programmed by Yoshiki Oshima, found in the Etoys educational programming environment and language, which can be viewed as a Logo done originally in Squeak Smalltalk.", "created": 2004, "backlinksCount": 34, "pageId": 746828, "revisionCount": 86, "dailyPageViews": 26, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/StarLogo" }, "centralPackageRepositoryCount": 0 }, "staroffice-basic": { "title": "StarOffice Basic", "appeared": 2000, "type": "pl", "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "'" ] ], "wikipedia": { "example": [ "Sub ParaCount\n'\n' Count number of paragraphs in a text document\n'\n Dim Doc As Object, Enum As Object, TextEl As Object, Count As Long\n Doc = ThisComponent\n' Is this a text document?\n If Not Doc.SupportsService(\"com.sun.star.text.TextDocument\") Then\n MsgBox \"This macro must be run from a text document\", 64, \"Error\"\n Exit Sub\n End If\n Count = 0\n' Examine each component - paragraph or table?\n Enum = Doc.Text.CreateEnumeration\n While Enum.HasMoreElements\n TextEl = Enum.NextElement\n' Is the component a paragraph?\n If TextEl.SupportsService(\"com.sun.star.text.Paragraph\") Then\n Count = Count + 1\n End If\n Wend\n'Display result\n MsgBox Count, 0, \"Paragraph Count\"\nEnd Sub" ], "related": [ "basic", "vba", "isbn" ], "summary": "OpenOffice Basic (formerly known as StarOffice Basic or StarBasic or OOoBasic) is a dialect of the programming language BASIC that originated with the StarOffice office suite and spread through OpenOffice.org and derivatives such as LibreOffice (where it is known as LibreOffice Basic). The language is a domain-specific programming language which specifically serves the OpenOffice application suite.", "created": 2012, "backlinksCount": 113, "pageId": 318131, "revisionCount": 2, "dailyPageViews": 5, "url": "https://en.wikipedia.org/wiki/StarOffice_Basic" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "starpial": { "title": "starpial", "appeared": 2012, "type": "pl", "description": "Starpial is a stack-oriented functional logic programming language with OOP, recursive regex, dependent types, refinement types, and automatic parallelization based on transactions.", "hasDependentTypes": { "example": "", "value": true }, "githubRepo": { "stars": 7, "forks": 0, "subscribers": 3, "created": 2012, "updated": 2020, "firstCommit": 2012, "description": "Description of Starpial plus example programs", "issues": 0, "url": "https://github.com/ColonelJ/Starpial" }, "repoStats": { "firstCommit": 2012, "commits": 15, "committers": 2, "files": 10 }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "stata": { "title": "Stata", "appeared": 1985, "type": "pl", "creators": [ "William Gould" ], "website": "https://www.stata.com/", "documentation": [ "https://www.stata.com/features/documentation/" ], "reference": [ "http://www.haghish.com/statistics/stata-blog/stata-programming/ssc_stata_package_list.php" ], "originCommunity": [ "StataCorp" ], "domainName": { "registered": 1994, "awisRank": { "2022": 31269 }, "name": "stata.com" }, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "wikipedia": { "example": [ "program define fizzbuzz\n\targs x\n\tforvalues i = 1(1)`x' {\n\t\tif mod(`i',15) == 0 {\n\t\t\tdisplay \"fizzbuzz\"\n\t\t}\n\t\telse if mod(`i',5) == 0 {\n\t\t\tdisplay \"buzz\"\n\t\t}\n\t\telse if mod(`i',3) == 0 {\n\t\t\tdisplay \"fizz\"\n\t\t}\n\t\telse {\n\t\tdisplay `i'\n\t\t}\n\t}\nend" ], "related": [ "c", "linux", "ascii", "excel-app" ], "summary": "Stata is a general-purpose statistical software package created in 1985 by StataCorp. Most of its users work in research, especially in the fields of economics, sociology, political science, biomedicine and epidemiology. Stata's capabilities include data management, statistical analysis, graphics, simulations, regression, and custom programming. It also has a system to disseminate user-written programs that lets it grow continuously. The name Stata is a syllabic abbreviation of the words statistics and data. The FAQ for the official forum of Stata insists that the correct English pronunciation of Stata \"must remain a mystery\"; any of \"Stay-ta\", \"Sta-ta\" or \"Stah-ta\" are considered acceptable. There are four major builds of each version of Stata: Stata/MP for multiprocessor computers (including dual-core and multicore processors) Stata/SE for large databases Stata/IC, which is the standard version Numerics by Stata, supports any of the data sizes listed above in an embedded environment Small Stata, which was the smaller, student version for educational purchase only is no longer available.", "pageId": 1809002, "dailyPageViews": 319, "created": 2005, "backlinksCount": 246, "revisionCount": 370, "appeared": 1985, "url": "https://en.wikipedia.org/wiki/Stata" }, "githubLanguage": { "fileExtensions": [ "do", "ado", "doh", "ihlp", "mata", "matah", "sthlp" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.stata", "repos": 8344, "id": "Stata" }, "githubBigQuery": { "repos": 1032, "users": 867, "id": "Stata" }, "pygmentsHighlighter": { "filename": "stata.py", "fileExtensions": [ "do", "ado" ], "id": "Stata" }, "linguistGrammarRepo": { "firstCommit": 2009, "lastCommit": 2015, "committerCount": 3, "commitCount": 44, "sampleCount": 7, "example": [ "local MAXDIM 800\n" ], "url": "https://github.com/pschumm/Stata.tmbundle" }, "projectEuler": { "memberCount": { "2019": 14, "2022": 16 }, "id": "Stata" }, "helloWorldCollection": [ "/* Hello world in Stata */\n\n .program hello\n 1. display \"Hello, World!\"\n 2. end\n.hello\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Stata", "tiobe": { "id": "Stata" }, "packageRepository": [ "https://www.stata.com/manuals/rssc.pdf" ], "twitter": "https://twitter.com/stata", "jupyterKernel": [ "https://github.com/TiesdeKok/ipystata", "https://github.com/kylebarron/stata_kernel" ], "fileType": "text", "isOpenSource": false, "isbndb": "year|publisher|title|authors|isbn13\n2009|Stata Press|Microeconometrics Using Stata|A. Colin Cameron and Pravin K Trivedi|9781597180481\n2009|Stata Press|An Introduction to Stata Programming|Baum, Christopher F.|9781597180450\n2005|Association For Computing Machinery|ICS05: proceedings of the 19th ACM International Conference on Supercomputing : June 20-22, 2005, (workshop tutorials-June 19th), the Cambridge Marriot (Kendall Square) and the Stata Center (MIT), Cambridge, Massachusetts, 02139, USA|International Conference On Supercomputing (19th : 2005 : Cambridge, Mass.)|9781595931672\n2015|Stata Press|An Introduction to Stata Programming, Second Edition|Baum, Christopher F.|9781597181501\n2006|Stata Press|An Introduction to Modern Econometrics Using Stata|Baum, Christopher F.|9781597180139\n2019|Springer|Econometrics in Theory and Practice: Analysis of Cross Section, Time Series and Panel Data with Stata 15.1|Das, Panchanan|9789813290198\n2015|Packt Publishing|Data Analysis with Stata|Kothari, Prasad|9781782173175\n2021|Princeton University Press|Quantitative Social Science: An Introduction in Stata|Imai, Kosuke and Bougher, Lori D.|9780691191294\n2021|Princeton University Press|Quantitative Social Science: An Introduction in Stata|Bougher, Lori D. and Imai, Kosuke|9780691191096\n2005T|STATA PRESS|Programming Stata 9 (STATA RELEASE 9)|STATA|9781597180009\n2011-06-01T00:00:01Z|Statacorp Lp|STATA Programming Reference Manual: Release 12|Statacorp Lp|9781597180917\n2021|Stata Press|STATA PROGRAMMING REFERENCE MANUAL Release 11|Stata Corporation|9781597180603\n20160919|Cambridge University Press|Statistics Using Stata|Sharon Lawner Weinberg; Sarah Knapp Abramowitz|9781316678978\n20160919|Cambridge University Press|Statistics Using Stata|Sharon Lawner Weinberg; Sarah Knapp Abramowitz|9781316680162\n20200227|Cambridge University Press|Statistics Using Stata|Sharon Lawner Weinberg; Sarah Knapp Abramowitz|9781108808682\n28-10-2015|Packt Publishing|Data Analysis with Stata|Prasad Kothari|9781782173182\n2001|Stata Press 2001-12-01|Stata Programming Manual: Release 7|Stata Press|9781881228523\n||An Introduction To Stata Programming|Oleg Ishutin|9781680941128\n2013|Stata Press|Discovering Structural Equation Modeling Using Stata|Alan C. Acock|9781597181334\n20160324|Taylor & Francis|Biostatistics in Public Health Using STATA|Erick L. Suárez; Cynthia M. Pérez; Graciela M. Nogueras; Camille Moreno-Gorrín|9781498722025\n2007|N/a|Title: Stata Mata Matrix Programming [m] 4-6|Stata Press|9781597180368", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|Estimation of pre- and posttreatment average treatment effects with binary time-varying treatment using Stata|10.1177/1536867X19874224|23|2|G. Cerulli and Marco Ventura|2d2d96bec07c2c2a634d0cd2dd3f0c1413ba52fd\n2016|Markdoc: Literate Programming in Stata|10.1177/1536867X1601600409|9|0|E. F. Haghish|4cbaa4d80f1d00c433108a3796bde332899e783c\n2019|Seamless interactive language interfacing between R and Stata|10.1177/1536867X19830891|6|1|E. F. Haghish|c8141f9a90a0ca4bed665ac09964ab0367a9b366\n2017|An Introduction to Stata Programming (2nd Edition)|10.18637/JSS.V077.B03|4|0|O. Kirchkamp and H. Niggemann|4c047914591d95b0ee1f48c4f7ed44ff3902524b\n2010|Mata Matters: Stata in Mata|10.1177/1536867X1001000111|1|0|W. Gould|d6607a2dca41c0544affecf51c7f2dd6775f68c3" }, "statebox": { "title": "statebox", "appeared": 2008, "type": "visual", "screenshot": "https://pldb.com/screenshots/statebox.png", "website": "https://statebox.org/", "domainName": { "registered": 2008, "awisRank": { "2022": 7024957 }, "name": "statebox.org" }, "visualParadigm": true, "twitter": "https://twitter.com/statebox" }, "statemate": { "title": "Statemate", "appeared": 1998, "type": "pl", "reference": [ "https://semanticscholar.org/paper/23937871cf955d5ea9a48bd419465e3b3a6ff1c0" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2535", "centralPackageRepositoryCount": 0, "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1996|The STATEMATE semantics of statecharts|10.1145/235321.235322|1244|111|D. Harel and A. Naamad|4f271da140018025b8bede3e2ac91afa546f2c31" }, "static-typescript": { "title": "Static Typescript", "appeared": 2019, "type": "pl", "description": "We present Static TypeScript (STS), a subset of TypeScript (itself, a gradually typed superset of JavaScript), and its compiler/linker toolchain, which is implemented fully in TypeScript and runs in the web browser.", "reference": [ "https://www.microsoft.com/en-us/research/publication/static-typescript/" ], "subsetOf": [ "typescript" ], "supersetOf": [ "typescript" ], "isbndb": "" }, "statsplorer": { "title": "Statsplorer", "appeared": 2014, "type": "visual", "creators": [ "Krishna Subramanian", "Chat Wacharamanotham" ], "website": "https://hci.rwth-aachen.de/statsplorer", "oldName": "VisiStat", "related": [ "r" ], "githubRepo": { "firstCommit": 2013, "stars": 8, "forks": 14, "subscribers": 3, "created": 2013, "updated": 2021, "description": "An application that allows users to do basic statistical analysis on-the-fly. ", "issues": 1, "url": "https://github.com/imkrishsub/VisiStat" }, "repoStats": { "firstCommit": 2013, "commits": 1565, "committers": 4, "files": 489 } }, "status-quo-function": { "title": "SQF", "appeared": 2002, "type": "pl", "reference": [ "https://community.bistudio.com/wiki/SQF_syntax" ], "aka": [ "sqf" ], "example": [ "_num = 10;\n_num = _num + 20; systemChat str _num;" ], "githubLanguage": { "fileExtensions": [ "sqf", "hqf" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.sqf", "repos": 5963, "id": "SQF" }, "githubBigQuery": { "repos": 609, "users": 405, "id": "SQF" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2018, "committerCount": 16, "commitCount": 96, "sampleCount": 2, "example": [ "#include \n\n#define SET(VAR,VALUE) private #VAR; VAR = VALUE;\n#define CONV(VAR,ARRAY,POOL) VAR = ARRAY select (POOL find VAR);\n\n#define ALL_HITPOINTS_MAN [ \\\n \"HitHead\", \"HitBody\", \\\n \"HitLeftArm\", \"HitRightArm\", \\\n \"HitLeftLeg\",\"HitRightLeg\" \\\n]\n\n#define ALL_HITPOINTS_VEH [ \\\n \"HitBody\", \"HitHull\", \"HitEngine\", \"HitFuel\", \\\n \"HitTurret\", \"HitGun\", \\\n \"HitLTrack\", \"HitRTrack\", \\\n \"HitLFWheel\", \"HitRFWheel\", \"HitLF2Wheel\", \"HitRF2Wheel\", \"HitLMWheel\", \"HitRMWheel\", \"HitLBWheel\", \"HitRBWheel\", \\\n \"HitAvionics\", \"HitHRotor\", \"HitVRotor\", \\\n \"HitRGlass\", \"HitLGlass\", \"HitGlass1\", \"HitGlass2\", \"HitGlass3\", \"HitGlass4\", \"HitGlass5\", \"HitGlass6\" \\\n]" ], "url": "https://github.com/JonBons/Sublime-SQF-Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "status-quo-script": { "title": "status-quo-script", "appeared": 2001, "type": "pl", "reference": [ "https://community.bistudio.com/wiki/SQS_syntax" ], "aka": [ "sqs" ], "centralPackageRepositoryCount": 0 }, "steinhaus-moser-notation": { "title": "Steinhaus-Moser notation", "appeared": 1969, "type": "notation", "wikipedia": { "summary": "In mathematics, Steinhaus–Moser notation is a notation for expressing certain large numbers. It is an extension of Hugo Steinhaus's polygon notation, devised by Leo Moser.", "backlinksCount": 93, "pageId": 305463, "dailyPageViews": 33, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Steinhaus–Moser_notation" } }, "stella": { "title": "stella", "appeared": 1999, "type": "pl", "description": "STELLA is a strongly typed, object-oriented, Lisp-like language, designed to facilitate symbolic programming tasks in artificial intelligence applications. STELLA preserves those features of Common Lisp deemed essential for symbolic programming such as built-in support for dynamic data structures, heterogeneous collections, first-class symbols, powerful iteration constructs, name spaces, an object-oriented type system with a meta-object protocol, exception handling, and language extensibility through macros, but without compromising execution speed, interoperability with non-STELLA programs, and platform independence. STELLA programs are translated into a target language such as C++, Common Lisp, or Java, and then compiled with the native target language compiler to generate executable code. The language constructs of STELLA are restricted to those that can be translated directly into native constructs of the intended target languages, thus enabling the generation of highly efficient as well as readable code. As of Fall 2000, we have programmed approximately 100,000 lines of STELLA code - about 50% for the STELLA kernel itself and the other 50% for the PowerLoom knowledge representation system and related systems. Our subjective experience has been that it is only slightly more difficult to write and debug a STELLA program than a Lisp program, and that the inconvenience of having to supply some type information is much outweighed by the benefits such as catching many errors during compile time instead of at run time. The biggest benefit, however, seems to be that we can still leverage all the incremental code development benefits of Lisp, since we use the Common Lisp-based version of STELLA for prototyping. This allows us to incrementally define and redefine functions, methods and classes and to inspect, debug and fix incorrect code on the fly. Even the most sophisticated C++ or Java IDE's don't yet seem to support this fully incremental development style, i.e., a change in a class (every change in Java is a change to a class) still requires recompilation and restart of the application, and it is the restart that can be the most time consuming if one debugs a complex application that takes a significant time to reach a certain state.", "website": "https://www.isi.edu/isd/LOOM/Stella/index.html", "fileExtensions": [ "ste" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "(defun (lisp-null-array-symbol-string STRING) ((rank INTEGER))\n ;; Used in the lisp translation code, insdie a verbatim\n ;; to return Lisp-specific-code.\n (CASE rank\n (1 (return \"STELLA::NULL-1D-ARRAY\"))\n (2 (return \"STELLA::NULL-2D-ARRAY\"))\n (3 (return \"STELLA::NULL-3D-ARRAY\"))\n (4 (return \"STELLA::NULL-4D-ARRAY\"))\n (5 (return \"STELLA::NULL-5D-ARRAY\"))\n (otherwise (return \"STELLA::NULL\"))))" ], "isbndb": "" }, "stencil": { "title": "Stencil", "appeared": 2018, "type": "template", "creators": [ "Kyle Fuller" ], "description": "Stencil is a simple and powerful template language for Swift. It provides a syntax similar to Django and Mustache.", "website": "https://stencil.fuller.li/en/latest/", "example": [ "There are {{ articles.count }} articles.\n\n
    \n {% for article in articles %}\n
  • {{ article.title }} by {{ article.author }}
    • \n {% endfor %}\n
" ], "githubRepo": { "firstCommit": 2014, "stars": 2135, "forks": 216, "subscribers": 37, "created": 2014, "updated": 2022, "description": "Stencil is a simple and powerful template language for Swift.", "issues": 39, "url": "https://github.com/stencilproject/Stencil" }, "repoStats": { "firstCommit": 2014, "commits": 552, "committers": 54, "files": 98 }, "tryItOnline": "stencil", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "stl": { "title": "Statement List", "appeared": 1993, "type": "assembly", "description": "STL corresponds to the \"Instruction List\" language defined in the International Electrotechnical Commission's standard IEC 1131-3, although there are substantial differences with regard to the operations. STL corresponds to the Instruction List language defined in the IEC 61131-3 specification.", "reference": [ "http://www.plcdev.com/statement_list_stl_cheat_sheets" ], "standsFor": "Statement List", "githubLanguage": { "type": "data", "fileExtensions": [ "stl" ], "aceMode": "text", "tmScope": "source.stl", "aliases": [ "ascii stl", "stla" ], "repos": 0, "id": "STL" } }, "stockholm-format": { "title": "Stockholm format", "appeared": 1997, "type": "textDataFormat", "wikipedia": { "example": [ "Feature Description Description\n ------- ----------- --------------\n RF ReFerence annotation Often the consensus RNA or protein sequence is used as a reference\n Any non-gap character (e.g. x's) can indicate consensus/conserved/match columns\n .'s or -'s indicate insert columns\n ~'s indicate unaligned insertions\n Upper and lower case can be used to discriminate strong and weakly conserved \n residues respectively\n MM Model Mask Indicates which columns in an alignment should be masked, such\n that the emission probabilities for match states corresponding to\n those columns will be the background distribution." ], "related": [ "fasta-format" ], "summary": "Stockholm format is a multiple sequence alignment format used by Pfam and Rfam to disseminate protein and RNA sequence alignments. The alignment editors Ralee and Belvu support Stockholm format as do the probabilistic database search tools, Infernal and HMMER, and the phylogenetic analysis tool Xrate. A simple example of an Rfam alignment (UPSK RNA) with a pseudoknot in Stockholm format is shown below: # STOCKHOLM 1.0 #=GF ID UPSK #=GF SE Predicted; Infernal #=GF SS Published; PMID 9223489 #=GF RN [1] #=GF RM 9223489 #=GF RT The role of the pseudoknot at the 3' end of turnip yellow mosaic #=GF RT virus RNA in minus-strand synthesis by the viral RNA-dependent RNA #=GF RT polymerase. #=GF RA Deiman BA, Kortlever RM, Pleij CW; #=GF RL J Virol 1997;71:5990-5996. AF035635.1/619-641 UGAGUUCUCGAUCUCUAAAAUCG M24804.1/82-104 UGAGUUCUCUAUCUCUAAAAUCG J04373.1/6212-6234 UAAGUUCUCGAUCUUUAAAAUCG M24803.1/1-23 UAAGUUCUCGAUCUCUAAAAUCG #=GC SS_cons .AAA....<<<>>> // Here is a slightly more complex example showing the Pfam CBS domain: # STOCKHOLM 1.0 #=GF ID CBS #=GF AC PF00571 #=GF DE CBS domain #=GF AU Bateman A #=GF CC CBS domains are small intracellular modules mostly found #=GF CC in 2 or four copies within a protein. #=GF SQ 5 #=GS O31698/18-71 AC O31698 #=GS O83071/192-246 AC O83071 #=GS O83071/259-312 AC O83071 #=GS O31698/88-139 AC O31698 #=GS O31698/88-139 OS Bacillus subtilis O83071/192-246 MTCRAQLIAVPRASSLAEAIACAQKMRVSRVPVYERS #=GR O83071/192-246 SA 9998877564535242525515252536463774777 O83071/259-312 MQHVSAPVFVFECTRLAYVQHKLRAHSRAVAIVLDEY #=GR O83071/259-312 SS CCCCCHHHHHHHHHHHHHEEEEEEEEEEEEEEEEEEE O31698/18-71 MIEADKVAHVQVGNNLEHALLVLTKTGYTAIPVLDPS #=GR O31698/18-71 SS CCCHHHHHHHHHHHHHHHEEEEEEEEEEEEEEEEHHH O31698/88-139 EVMLTDIPRLHINDPIMKGFGMVINN..GFVCVENDE #=GR O31698/88-139 SS CCCCCCCHHHHHHHHHHHHEEEEEEEEEEEEEEEEEH #=GC SS_cons CCCCCHHHHHHHHHHHHHEEEEEEEEEEEEEEEEEEH O31699/88-139 EVMLTDIPRLHINDPIMKGFGMVINN..GFVCVENDE #=GR O31699/88-139 AS ________________*____________________ #=GR O31699/88-139 IN ____________1____________2______0____ // A minimal well formed Stockholm files should contain the header which states the format and version identifier, currently '# STOCKHOLM 1.0'. Followed by the sequences and corresponding unique sequence names: '' stands for \"sequence name\", typically in the form \"name/start-end\" or just \"name\". Finally, the \"//\" line indicates the end of the alignment. Sequence letters may include any characters except whitespace. Gaps may be indicated by \".\" or \"-\".", "backlinksCount": 23, "pageId": 17304991, "created": 2008, "revisionCount": 51, "dailyPageViews": 13, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Stockholm_format" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "stoical": { "title": "STOICAL", "appeared": 2000, "type": "pl", "reference": [ "http://stoical.sourceforge.net/summary.php" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5308", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "ston": { "title": "STON", "appeared": 2012, "type": "application", "creators": [ "Sven Van Caekenberghe" ], "githubRepo": { "firstCommit": 2012, "stars": 131, "forks": 28, "subscribers": 14, "created": 2012, "updated": 2022, "description": "STON - Smalltalk Object Notation - A lightweight text-based, human-readable data interchange format for class-based object-oriented languages like Smalltalk.", "issues": 1, "url": "https://github.com/svenvc/ston" }, "githubLanguage": { "fileExtensions": [ "ston" ], "trendingProjectsCount": 0, "type": "data", "group": "Smalltalk", "aceMode": "text", "tmScope": "source.smalltalk", "repos": 0, "id": "STON" }, "linguistGrammarRepo": { "firstCommit": 2011, "lastCommit": 2017, "committerCount": 5, "commitCount": 22, "sampleCount": 7, "example": [ "[1, 2, 3]" ], "url": "https://github.com/tomas-stefano/smalltalk-tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "stonecutter": { "title": "StoneCutter", "appeared": 2020, "type": "grammarLanguage", "creators": [ "John D. Leidel", "David Donofrio", "Frank Conlon" ], "description": "In this work we introduce the StoneCutter instruction set design language and tool infrastructure. StoneCutter provides a familiar, C-like language construct by which to develop the implementation for individual, programmable instructions. The LLVM-based StoneCutter compiler performs individual instruction and whole-ISA optimizations in order to generate a high performance, Chisel HDL representation of the target design. Utilizing the existing Chisel tools, users can also generate C++ cycle accurate simulation models as well as Verilog representations of the target design. As a result, StoneCutter provides a very rapid design environment for development and experimentation.", "reference": [ "https://dl.acm.org/doi/10.1145/3387902.3394029" ] }, "stoneknifeforth": { "title": "stoneknifeforth", "appeared": 2008, "type": "pl", "description": "This is StoneKnifeForth, a very simple language inspired by Forth. It is not expected to be useful; instead, its purpose is to show how simple a compiler can be. The compiler is a bit under two pages of code when the comments are removed. This package includes a “metacircular compiler” which is written in StoneKnifeForth and compiles StoneKnifeForth to an x86 Linux ELF executable.", "githubRepo": { "firstCommit": 2008, "stars": 369, "forks": 21, "subscribers": 23, "created": 2009, "updated": 2022, "description": "a tiny self-hosted Forth implementation", "issues": 3, "url": "https://github.com/kragen/stoneknifeforth" }, "repoStats": { "firstCommit": 2008, "commits": 113, "committers": 7, "files": 22 } }, "storymatic": { "title": "Storymatic", "appeared": 2022, "type": "pl", "creators": [ "Zachary Sakowitz" ], "website": "https://storymatic.zsnout.com/#/", "fileExtensions": [ "coffee" ], "country": [ "Unknown" ], "originCommunity": [ "zSnout" ], "keywords": [ "macro" ], "githubRepo": { "stars": 3, "forks": 0, "subscribers": 1, "created": 2022, "updated": 2022, "description": "A simple programming language packed with features that compiles straight to JavaScript for perfect in-browser portability.", "url": "https://github.com/zSnout/Storymatic" }, "repoStats": { "firstCommit": 2022, "commits": 568, "committers": 3, "files": 32 } }, "storyscript": { "title": "storyscript", "appeared": 2017, "type": "pl", "isDead": true, "description": "Storyscript is a language, editor, database, infra and community all-in-one. Create holistic apps, tools and workflows blazing fast that power your business.", "website": "https://storyscript.com", "domainName": { "registered": 2010, "awisRank": { "2022": 10081574 }, "name": "storyscript.com" }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "### \nStoryscript is a language, editor, database, infra and community all-in-one.\nCreate holistic apps, tools and workflows blazing fast that power your business. \n###\n\n\n# Pull data from a microservice\noutput = service action key:value\noutput = team/service action key:value\n# Discover and create services in the Storyscript Hub\n# Call a function\noutput = function_name(key:value)\n# A Storyscript function\n# or another programming language\n# Call type methods\noutput = variable.mutation(key:value)\n# Event streaming microservice\nwhen service action event key:value as output\n ... # run this block for every event\n# Types\nstring = \"Hello\"\ninteger = 1\nnumber = 1.3\nbool = true\nlist = [\"a\", \"b\", \"c\"]\nmap = {\"apple\": \"red\", \"banana\": \"yellow\"}\nregexp = /^foobar/\nempty = null\ntime = 1d35m\n# Destructuring\n{ apple, banana } = map\n# apple = \"red\", banana = \"yellow\"\n# Conditions\nif one > 1\n # ...\nelse if one == 1\n # ...\nelse\n # ...\n# Loops\nforeach list as item\n # ...\nwhile true\n # ...\n# Functions\nfunction name input:int returns int\n # ...\n return input\nname(input:1)\n# >>> 1" ], "githubRepo": { "firstCommit": 2017, "stars": 303, "forks": 33, "subscribers": 14, "created": 2017, "updated": 2019, "description": "The polyglot, cloud-native programming language for zero-devops deployments into Kubernetes.", "issues": 169, "url": "https://github.com/storyscript/welcome" }, "twitter": "https://twitter.com/storyscript_" }, "stos-basic": { "title": "STOS BASIC", "appeared": 1988, "type": "pl", "wikipedia": { "related": [ "basic", "amos" ], "summary": "STOS BASIC is a dialect of the BASIC programming language implemented on the Atari ST computer. STOS BASIC was originally developed by Jawx, François Lionet, and Constantin Sotiropoulos and published by Mandarin Software (now known as Europress Software). STOS Basic was a version of BASIC that was designed for creating games, but the set of powerful high-level graphics and sound commands it offered made it suitable for developing multimedia-intense software without any knowledge of the internals of the Atari ST.", "created": 2005, "backlinksCount": 102, "pageId": 1366035, "revisionCount": 65, "dailyPageViews": 23, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/STOS_BASIC" }, "centralPackageRepositoryCount": 0 }, "strand-programming-language": { "title": "Strand", "appeared": 1989, "type": "pl", "description": "Strand is a logic programming language designed for efficient programming of parallel computers.", "reference": [ "https://link.springer.com/chapter/10.1007/978-1-4471-3421-3_17" ], "wikipedia": { "related": [ "prolog" ], "summary": "Strand is a high-level symbolic language for parallel computing, similar in syntax to Prolog. Artificial Intelligence Ltd were awarded the British Computer Society Award for Technical Innovation 1989 for Strand88. The language was created by computer scientists Ian Foster and Stephen Taylor.", "created": 2006, "backlinksCount": 5, "pageId": 7837169, "revisionCount": 13, "dailyPageViews": 9, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Strand_%28programming_language%29" }, "centralPackageRepositoryCount": 0 }, "strat": { "title": "strat", "appeared": 2018, "type": "pl", "website": "https://strat.world/", "domainName": { "registered": 2022, "name": "strat.world" }, "example": [ "service HelloWorld {\n include \"Birth\"\n\n Birth -> \"Hello World!\"\n}" ], "githubRepo": { "firstCommit": 2018, "stars": 15, "subscribers": 6, "created": 2018, "updated": 2020, "description": "A language to represent and deploy portable cloud systems ->", "forks": 1, "issues": 2, "url": "https://github.com/stratworld/strat" }, "repoStats": { "firstCommit": 2018, "commits": 193, "committers": 3, "files": 136 }, "isbndb": "" }, "stratego": { "title": "Stratego/XT", "appeared": 1998, "type": "grammarLanguage", "wikipedia": { "summary": "Stratego/XT is a language and toolset for constructing stand-alone program transformation systems. It combines the Stratego transformation language with the XT toolset of transformation components, providing a framework for constructing stand-alone program transformation systems. The Stratego language is based on a programming paradigm called strategic term rewriting. It provides rewrite rules for expressing basic transformation steps. The application of these rules can be controlled using strategies, a form of subroutines. The XT toolset provides reusable transformation components and declarative languages for deriving new components, such as parsing grammars using the Modular Syntax Definition Formalism (SDF) and implementing pretty-printing.", "backlinksCount": 24, "pageId": 10255748, "dailyPageViews": 8, "appeared": 1998, "url": "https://en.wikipedia.org/wiki/Stratego/XT" } }, "strcmacs": { "title": "STRCMACS", "appeared": 1977, "type": "pl", "reference": [ "https://semanticscholar.org/paper/607a46544b5bed923670fe47b035339dab406f3a" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4356", "centralPackageRepositoryCount": 0 }, "streamit": { "title": "StreamIt", "appeared": 1992, "type": "pl", "reference": [ "https://www.researchgate.net/publication/2888414_StreamIt_A_Language_for_Streaming_Applications" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:StreamIt", "hopl": "https://hopl.info/showlanguage.prx?exp=4964", "centralPackageRepositoryCount": 0 }, "streem": { "title": "Streem", "appeared": 2014, "type": "pl", "creators": [ "Yukihiro Matsumoto" ], "description": "Streem is a stream based concurrent scripting language. It is based on a programming model similar to the shell, with influences from Ruby, Erlang, and other functional programming languages.", "website": "https://github.com/matz/streem", "country": [ "Japan" ], "originCommunity": [ "Ruby Association,NaCl" ], "keywords": [ "case", "class", "def", "else", "emit", "false", "if", "import", "method", "namespace", "new", "nil", "return", "skip", "true" ], "example": [ "# channel to broadcast to all clients\nbroadcast = chan()\ntcp_server(8008) | {s ->\n broadcast | s # connect to broadcast channel\n s | broadcast # broadcast incoming message\n}" ], "githubRepo": { "stars": 4600, "forks": 258, "subscribers": 366, "created": 2014, "updated": 2022, "url": "https://github.com/matz/streem" }, "repoStats": { "firstCommit": 2014, "commits": 986, "committers": 41, "files": 63 } }, "strema": { "title": "STREMA", "appeared": 1976, "type": "pl", "reference": [ "https://semanticscholar.org/paper/7884bb3ae93f3dae019e88bc0c5233093510f19c" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5970", "centralPackageRepositoryCount": 0 }, "stress": { "title": "STRESS", "appeared": 1963, "type": "pl", "reference": [ "https://www.amazon.com/STRESS-Structural-Engineering-System-Solver/dp/B0007G167S" ], "hopl": "https://hopl.info/showlanguage.prx?exp=211", "wordRank": 2989 }, "string-diagrams-notation": { "title": "String diagram", "appeared": 2007, "type": "notation", "wikipedia": { "summary": "In category theory, string diagrams are a way of representing morphisms in monoidal categories, or more generally 2-cells in 2-categories.", "backlinksCount": 17, "pageId": 3967296, "dailyPageViews": 16, "appeared": 2007, "url": "https://en.wikipedia.org/wiki/String_diagram" } }, "stringbean": { "title": "stringbean", "appeared": 2016, "type": "pl", "website": "http://stringbean-lang.com", "domainName": { "awisRank": { "2022": 8420624 }, "name": "stringbean-lang.com" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n11297599|Show HN: StringBean – 4K Featherweight Framework|http://stringbean-lang.com/|2016-03-16 14:32:47 UTC|1458138767|Narutu|12|28" }, "stringcomp": { "title": "STRINGCOMP", "appeared": 1967, "type": "pl", "wikipedia": { "backlinksCount": 6, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/STRINGCOMP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2743" }, "stripe": { "title": "Stripe company", "appeared": 2011, "type": "webApi", "originCommunity": [ "Stripe" ], "wikipedia": { "summary": "Stripe is a US technology company operating in over 25 countries that allows both private individuals and businesses to accept payments over the Internet. Stripe focuses on providing the technical, fraud prevention, and banking infrastructure required to operate on-line payment systems.", "pageId": 32845520, "dailyPageViews": 930, "created": 2011, "backlinksCount": 226, "revisionCount": 336, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Stripe_(company)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "strips": { "title": "Strips", "appeared": 1969, "type": "pl", "reference": [ "https://semanticscholar.org/paper/076ae14bfc68acdbaf2ab24913e152d49540e988" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "wikipedia": { "example": [ "Actions:\n // move from X to Y\n _Move(X, Y)_\n Preconditions: At(X), Level(low)\n Postconditions: not At(X), At(Y)\n \n // climb up on the box\n _ClimbUp(Location)_\n Preconditions: At(Location), BoxAt(Location), Level(low)\n Postconditions: Level(high), not Level(low)\n \n // climb down from the box\n _ClimbDown(Location)_\n Preconditions: At(Location), BoxAt(Location), Level(high)\n Postconditions: Level(low), not Level(high)\n \n // move monkey and box from X to Y\n _MoveBox(X, Y)_\n Preconditions: At(X), BoxAt(X), Level(low)\n Postconditions: BoxAt(Y), not BoxAt(X), At(Y), not At(X)\n \n // take the bananas\n _TakeBananas(Location)_\n Preconditions: At(Location), BananasAt(Location), Level(high)\n Postconditions: Have(bananas)" ], "summary": "In artificial intelligence, STRIPS (Stanford Research Institute Problem Solver) is an automated planner developed by Richard Fikes and Nils Nilsson in 1971 at SRI International. The same name was later used to refer to the formal language of the inputs to this planner. This language is the base for most of the languages for expressing automated planning problem instances in use today; such languages are commonly known as action languages. This article only describes the language, not the planner.", "backlinksCount": 39, "pageId": 1953958, "dailyPageViews": 119, "created": 2005, "appeared": 1971, "url": "https://en.wikipedia.org/wiki/STRIPS" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2413", "wordRank": 9151, "centralPackageRepositoryCount": 0 }, "strongtalk": { "title": "Strongtalk", "appeared": 1994, "type": "pl", "description": "Strongtalk is a major re-thinking of the Smalltalk-80 programming language and system. While retaining the basic Smalltalk syntax and semantics, it contains a number of significant advances.", "website": "http://strongtalk.org/", "reference": [ "https://wiki.c2.com/?StrongTalk" ], "country": [ "United States" ], "domainName": { "registered": 2006, "name": "strongtalk.org" }, "wikipedia": { "related": [ "smalltalk", "self", "java", "javascript" ], "summary": "Strongtalk is a Smalltalk environment with optional static typing support. Strongtalk can make some compile time checks, and offer \"stronger\" type safety guarantees; this is the source of its name. It is non-commercial, though it was originally a commercial project developed by a small start-up company called LongView Technologies (trading as Animorphic Systems).", "pageId": 1569550, "dailyPageViews": 21, "created": 2005, "backlinksCount": 15, "revisionCount": 65, "appeared": 1994, "url": "https://en.wikipedia.org/wiki/Strongtalk" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3364", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "structured-storage": { "title": "COM Structured Storage", "appeared": 2010, "type": "binaryDataFormat", "description": "The Compound File Binary File Format, a general-purpose file format that provides a file-system-like structure within a file for the storage of arbitrary, application-specific streams of data.", "reference": [ "https://docs.microsoft.com/en-us/openspecs/windows_protocols/ms-cfb/53989ce4-7b05-4f8d-829b-d08d6148375b?redirectedfrom=MSDN" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/COM_Structured_Storage" } }, "structured-text": { "title": "Structured text", "appeared": 2019, "type": "pl", "wikipedia": { "summary": "Structured text, abbreviated as ST or STX, is one of the five languages supported by the IEC 61131-3 standard, designed for programmable logic controllers (PLCs). It is a high level language that is block structured and syntactically resembles Pascal, on which it is based. All of the languages share IEC61131 Common Elements. The variables and function calls are defined by the common elements so different languages within the IEC 61131-3 standard can be used in the same program. Complex statements and nested instructions are supported: Iteration loops (REPEAT-UNTIL; WHILE-DO) Conditional execution (IF-THEN-ELSE; CASE) Functions (SQRT(), SIN())", "backlinksCount": 17, "pageId": 3432584, "dailyPageViews": 135, "appeared": 2019, "url": "https://en.wikipedia.org/wiki/Structured_text" }, "isbndb": "" }, "strudel": { "title": "strudel", "appeared": 2011, "type": "textDataFormat", "description": "Strudel is our graphical tool for visualizing genetic and physical maps of genomes for comparative purposes. The Strudel data format is tab delimited text with all features, homologs and potential reference URLs included in the same file.", "reference": [ "http://bioinf.scri.ac.uk/strudel/help/data.shtml" ], "example": [ "feature Rice 1 LOC_Os05g01020 gene 1903 \"TBC domain containing protein, expressed\"\nfeature Rice 1 LOC_Os09g20010 gene 10218 expressed protein\nfeature Barley 1H 12_30969 SNP 15 \nfeature Barley 1H 11_11223 SNP 78 \nfeature Barley 1H 11_11224 SNP 100 \nhomolog Barley 12_30969 Rice LOC_Os05g01020 7.00E-91 #00FF00\nhomolog Barley 11_11223 Rice LOC_Os09g20010 6.00E-50 \nchromosome Barley 1H #593423 \nURL Rice http://rice.plantbiology.msu.edu/cgi-bin/gbrowse/rice/?name=" ] }, "strudl": { "title": "STRUDL", "appeared": 1965, "type": "pl", "reference": [ "https://cedb.asce.org/CEDBsearch/record.jsp?dockey=0014460" ], "hopl": "https://hopl.info/showlanguage.prx?exp=348", "semanticScholar": "" }, "struql": { "title": "StruQL", "appeared": 1999, "type": "queryLanguage", "creators": [ "Mary Fernández", "Dan Suciu", "and Igor Tatarinov" ], "description": "A StruQL query is a function from a set of input graphs to an output graph.", "reference": [ "https://www.usenix.org/legacy/events/dsl99/full_papers/fernandez/fernandez.pdf" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ " // Link root page to page of all accounts\n link Root() -> \"Accounts\" -> AccountsPage()\n // AccountsPage refers to each account in account database and its associated page\n { where (acct, name, street, city, state, zip) in SQL.query(\"AccountDB\", \"select acct ...\")\n link AccountsPage() -> \"Info\" -> Info(acct),\n Info(acct) -> { \"Acct\" acct, \"Name\" name, \"Street\" street,\n \"City\" city, \"State\" state, \"Zip\" zip,\n \"AcctPage\" AcctPage(acct) },\n AcctPage(acct) -> \"Info\" -> Info(acct)\n \n // AcctPage refers to non-zero usage records in the usage database.\n { where (date, dom is int, intl is int) in SQL.query(\"UsageDB\", \"select date ...\", acct)\n dom + intl > 0\n link AcctPage(acct) -> \"UsageData\" -> UsageData(acct),\n UsageData(acct) -> \"Entry\" -> UsageEntry(acct, date),\n UsageEntry(acct, date) -> { \"Date\" date, \"Total\" (dom + intl) }\n }\n // Query postal database to determine possible aliases for account\n { where XMLRoot{root}, root -> \"addresses\".\"entry\" -> addr,\n addr -> { \"name\" alias, \"address\".\"street\" street1, \"address\".\"zip\" zip },\n street1 = street\n link Info(acct) -> \"Alias\" -> alias\n }\n }" ] }, "stutter-lang": { "title": "Stutter", "appeared": 2018, "type": "esolang", "isDead": true, "description": "The design goals of the Stutter Programming Language focus on the underlying idea that Stutter Code is a speakable language that contains no special syntax characters that are unpronounciable.", "reference": [ "https://web.archive.org/web/20210708104617/https://github.com/cookiengineer/stutter" ], "example": [ "let ratio be a Number and set it to 0.37\nlet variable be a Number\nset variable to 5\n\ncomment add is a method on the Number data type\nadd 12.0 to variable\n\ncomment all methods accept multiple parameters via the and conjunction\nmultiply variable with ratio and 1.5\n\ncomment results of methods can be redirected with the to preposition\nprint variable to standard output\n\ncomment generic calls can be done with the call verb\ncall log on console with variable and ratio\n\n\nif variable is greater than 2 then\n\n if variable is greater than 2.5 then\n call log on console with this is an example\n else if variable is lower than 2.5 then\n call alert on console with this is another example\n else\n call log on console with foo bar\n end\n\nend\n\n\nlet examples be a Number Array\nset examples to 1, 3, 7 and 9\n\nset index 0 on examples to 4\npush 3 to examples\n\n\ncomment whatever is the string representation of examples\nlet whatever be a String\njoin examples to whatever\n\ncomment copy is the string copy of examples\nlet copy be a String Array\nsplit whatever to copy\n\n\nfor each examples as key and value do\n\n let temp be value\n add 5 to value\n divide value by 1.76\n\n if temp is greater than 5 then\n break\n else\n call log on console with temp\n end\n\nend" ], "githubRepo": { "firstCommit": 2018, "stars": 6, "forks": 1, "subscribers": 1, "created": 2018, "updated": 2020, "description": ":book: The Stutter Language Specification and Test Suite", "url": "https://github.com/stutter-lang/stutter" } }, "stx": { "title": "stx", "appeared": 1999, "type": "pl", "description": "STx implements a powerful scripting language. This document will try to give you the necessary information to program your own applications. Scripts can be used to implement: simple processing lists, calling standard STx signal processing applications, signal processing application (like the Spectrogram & Parameters Viewer), complex database operations on the STx DataSet, in fact, everything you see in STx can be programmed in the macro language. The term STx script is a synonym for an application implemented using one or more STx macros, classes and SPU's, and executed by the script controller application BScript.", "website": "https://www.kfs.oeaw.ac.at/manual/3.8/html/programmerguide/1687.htm", "centralPackageRepositoryCount": 0 }, "stylus": { "title": "Stylus", "appeared": 2010, "type": "stylesheetLanguage", "creators": [ "TJ Holowaychuk" ], "website": "http://stylus-lang.com/", "domainName": { "registered": 2015, "awisRank": { "2017": 274066, "2022": 800241 }, "name": "stylus-lang.com" }, "hasSemanticIndentation": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "div.rectangle {\n -webkit-border-radius: 10px;\n -moz-border-radius: 10px;\n border-radius: 10px;\n}" ], "related": [ "sass", "css", "jade", "python" ], "summary": "Stylus is a dynamic stylesheet language that is compiled into Cascading Style Sheets (CSS). Its design is influenced by Sass and LESS. It's regarded as the fourth most used CSS preprocessor syntax. It was created by TJ Holowaychuk, a former programmer for Node.js and the creator of the Luna language. It is written in JADE and Node.js.", "pageId": 38256010, "dailyPageViews": 24, "created": 2013, "backlinksCount": 22, "revisionCount": 31, "appeared": 2010, "url": "https://en.wikipedia.org/wiki/Stylus_(stylesheet_language)" }, "githubLanguage": { "fileExtensions": [ "styl" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "stylus", "tmScope": "source.stylus", "repos": 5041, "id": "Stylus" }, "githubBigQuery": { "repos": 344, "users": 315, "id": "Stylus" }, "codeMirror": "stylus", "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2017, "committerCount": 19, "commitCount": 113, "sampleCount": 1, "example": [ "border-radius()\n -webkit-border-radius arguments\n -moz-border-radius arguments\n border-radius arguments\n\na.button\n border-radius 5px\n\nfonts = helvetica, arial, sans-serif\n\nbody {\n padding: 50px;\n font: 14px/1.4 fonts;\n}\n\nform\n input[type=text]\n padding: 5px\n border: 1px solid #eee\n color: #ddd\n\ntextarea\n @extends form input[type=text]\n padding: 10px\n\n$foo\n color: #FFF\n\n.bar\n background: #000\n @extends $foo\n" ], "url": "https://github.com/billymoon/Stylus" }, "leachim6": { "filepath": "s/Stylus.styl", "fileExtensions": [ "styl" ], "example": [ "body::before\n\tcontent: \"Hello World\" " ], "id": "Stylus" }, "fileType": "text", "wordRank": 6948, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "sub": { "title": "sub", "appeared": 2013, "type": "plzoo", "description": "eager, mutable records, statically typed, subtyping", "website": "http://plzoo.andrej.com/language/sub.html", "reference": [ "https://github.com/andrejbauer/plzoo" ], "wordRank": 1733, "centralPackageRepositoryCount": 0, "isbndb": "" }, "subl": { "title": "SubL", "appeared": 1989, "type": "pl", "reference": [ "https://cyc.com/archives/glossary/subl/" ], "aka": [ "SubLisp" ], "originCommunity": [ "Cycorp" ], "writtenIn": [ "allegro-common-lisp" ], "isLisp": { "example": "", "value": true } }, "subleq": { "title": "Subleq", "appeared": 2009, "type": "isa", "creators": [ "David Roberts" ], "fileExtensions": [ "sq" ], "githubRepo": { "firstCommit": 2009, "stars": 94, "forks": 13, "subscribers": 11, "created": 2009, "updated": 2022, "description": "CPU design and toolchain for a simple computer architecture", "issues": 0, "url": "https://github.com/davidar/subleq" }, "repoStats": { "firstCommit": 2009, "commits": 7, "committers": 2, "files": 35 }, "leachim6": { "filepath": "s/SubleQ.sq", "fileExtensions": [ "sq" ], "example": [ "loop: hello (-1)\n minusOne loop\n minusOne checkEnd+1\ncheckEnd: Z hello (-1) \n Z Z loop\n\t\t\t\t\n. minusOne: -1\n. hello: \"Hello World\\n\" Z: 0\n" ], "id": "SubleQ" }, "rijuRepl": { "example": [ "12 12 3\n36 37 6\n37 12 9\n37 37 12\n0 -1 15\n38 36 18\n12 12 21\n53 37 24\n37 12 27\n37 37 30\n36 12 -1\n37 37 0\n39 0 -1\n72 101 108\n108 111 44\n32 119 111\n114 108 100\n33 10 53\n" ], "id": "https://riju.codes/subleq" } }, "sublime-editor": { "title": "Sublime Text", "appeared": 2008, "type": "editor", "website": "http://www.sublimetext.com", "domainName": { "registered": 2007, "awisRank": { "2022": 9957 }, "name": "sublimetext.com" }, "wikipedia": { "related": [ "python", "linux", "textmate-editor", "regex", "wordpress", "emacs-editor", "vim-editor", "visual-studio-code-editor" ], "summary": "Sublime Text is a proprietary cross-platform source code editor with a Python application programming interface (API). It natively supports many programming languages and markup languages, and functions can be added by users with plugins, typically community-built and maintained under free-software licenses.", "pageId": 32794687, "created": 2011, "backlinksCount": 198, "revisionCount": 331, "dailyPageViews": 534, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Sublime_Text" }, "packageRepository": [ "https://packagecontrol.io/" ], "fileType": "na", "isOpenSource": false }, "sublime-syntax-test": { "title": "Sublime Syntax Test Lang", "appeared": 2008, "type": "grammarLanguage", "description": "A language for testing sublime syntax files.", "website": "https://www.sublimetext.com/docs/3/syntax.html#testing", "related": [ "sublime-syntax" ], "example": [ "// SYNTAX TEST \"Packages/C/C.sublime-syntax\"\n#pragma once\n// <- source.c meta.preprocessor.c++\n // <- keyword.control.import\n\n// foo\n// ^ source.c comment.line\n// <- punctuation.definition.comment\n\n/* foo */\n// ^ source.c comment.block\n// <- punctuation.definition.comment.begin\n// ^ punctuation.definition.comment.end\n\n#include \"stdio.h\"\n// <- meta.preprocessor.include.c++\n// ^ meta string punctuation.definition.string.begin\n// ^ meta string punctuation.definition.string.end\nint square(int x)\n// <- storage.type\n// ^ meta.function entity.name.function\n// ^ storage.type\n{\n return x * x;\n// ^^^^^^ keyword.control\n}\n\n\"Hello, World! // not a comment\";\n// ^ string.quoted.double\n// ^ string.quoted.double - comment" ], "isbndb": "" }, "sublime-syntax": { "title": "Sublime Syntax", "appeared": 2008, "type": "grammarLanguage", "description": "Sublime Syntax files are YAML files with a small header, followed by a list of contexts. Each context has a list of patterns that describe how to highlight text in that context, and how to change the current text.", "website": "https://www.sublimetext.com/docs/3/syntax.html", "fileExtensions": [ "sublime-syntax" ], "related": [ "yaml", "tmlanguage" ], "example": [ "%YAML 1.2\n---\nname: C\nfile_extensions: [c, h]\nscope: source.c\n\ncontexts:\n main:\n - match: \\b(if|else|for|while)\\b\n scope: keyword.control.c" ] }, "subrip-text": { "title": "SubRip Text", "appeared": 2005, "type": "application", "reference": [ "https://en.wikipedia.org/wiki/SubRip" ], "example": [ "168\n00:20:41,150 --> 00:20:45,109\n- How did he do that?\n- Made him an offer he couldn't refuse." ], "githubLanguage": { "fileExtensions": [ "srt" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "text", "tmScope": "text.srt", "repos": 521758, "id": "SubRip Text" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2016, "committerCount": 1, "commitCount": 4, "sampleCount": 1, "example": [ "1\n00:00:01,250 --> 00:00:03,740\nAdding NCL language.\n\n2\n00:00:04,600 --> 00:00:08,730\nThanks for the pull request! Do you know if these files are NCL too?\n\n3\n00:00:09,800 --> 00:00:13,700\nThose are poorly-named documentation files for NCL functions.\n\n4\n00:00:14,560 --> 00:00:17,200\n- What's better?\n- This is better.\n\n5\n00:00:18,500 --> 00:00:23,000\n- Would it be correct to recognise these files as text?\n- Yes.\n\n6\n00:00:23,890 --> 00:00:30,000\nIn that case, could you add \"NCL\" to the text entry in languages.yml too?\n\n7\n00:00:30,540 --> 00:00:35,250\nI added the example to \"Text\" and updated the license in the grammar submodule.\n\n8\n00:00:38,500 --> 00:00:42,360\nCloning the submodule fails for me in local with this URL.\n\n9\n00:00:42,360 --> 00:00:45,250\nCould you use Git or HTTPS...?\n\n10\n00:00:46,810 --> 00:00:50,000\nI updated the grammar submodule link to HTTPS.\n\n11\n00:00:51,100 --> 00:00:57,000\nIt's still failing locally. I don't think you can just update the .gitmodules file.\n\n12\n00:00:57,750 --> 00:01:03,000\nYou'll probably have to remove the submodule and add it again to be sure.\n\n13\n00:01:04,336 --> 00:01:11,800\n- I'll see first if it's not an issue on my side...\n- I removed the submodule and added it back with HTTPS.\n\n14\n00:01:13,670 --> 00:01:18,000\nI tested the detection of NCL files with 2000 samples.\n\n15\n00:01:18,000 --> 00:01:25,000\nThe Bayesian classifier doesn't seem to be very good at distinguishing text from NCL.\n\n16\n00:01:25,000 --> 00:01:30,740\nWe could try to improve it by adding more samples, or we can define a new heuristic rule.\n\n17\n00:01:31,300 --> 00:01:36,200\n- Do you want me to send you the sample files?\n- Yes, please do.\n\n18\n00:01:37,500 --> 00:01:39,500\nIn your inbox.\n\n19\n00:01:41,285 --> 00:01:48,216\n- So if I manually go through these and sort out the errors, would that help?\n- Not really.\n\n20\n00:01:48,540 --> 00:01:55,145\nIt's a matter of keywords so there's not much to do there except for adding new samples.\n\n21\n00:01:55,447 --> 00:02:02,000\nIf adding a few more samples doesn't improve things, we'll see how to define a new heuristic rule.\n\n22\n00:02:04,740 --> 00:02:09,600\n- I added quite a few NCL samples.\n- That's a bit over the top, isn't it?\n\n23\n00:02:10,250 --> 00:02:16,000\nWe currently can't add too many samples because of #2117.\n\n24\n00:02:18,000 --> 00:02:20,830\n(sigh) I decreased the number of added samples.\n\n25\n00:02:21,630 --> 00:02:25,300\nCould you test the detection results in local with the samples I gave you?\n\n26\n00:02:26,000 --> 00:02:28,670\n- What is the command to run that test?\n- Here...\n\n27\n00:02:28,716 --> 00:02:38,650\n[Coding intensifies]\n\n28\n00:02:38,650 --> 00:02:43,330\nIt is getting hung up on a false detection of Frege in one of the Text samples.\n\n29\n00:02:43,540 --> 00:02:46,115\nDo you have any suggestions for implementing a heuristic?\n\n30\n00:02:47,640 --> 00:02:55,200\n#2441 should fix this. In the meantime, you can change this in \"test_heuristics.rb\"\n\n31\n00:02:55,165 --> 00:02:57,240\nWhy did you have to change this?\n\n32\n00:02:57,777 --> 00:03:04,480\n- It doesn't work for me unless I do that.\n- Hum, same for me. Arfon, does it work for you?\n\n33\n00:03:04,920 --> 00:03:08,830\nRequiring linguist/language doesn't work for me either.\n\n34\n00:03:09,300 --> 00:03:13,885\nWe restructured some of the requires a while ago and I think this is just out-of-date code.\n\n35\n00:03:14,065 --> 00:03:20,950\nFrom a large sample of known NCL files taken from Github, it's now predicting with about 98% accuracy.\n\n36\n00:03:21,183 --> 00:03:28,000\nFor a large sample of other files with the NCL extension, it is around 92%.\n\n37\n00:03:27,880 --> 00:03:30,950\nFrom those, nearly all of the errors come from one GitHub repository,\n\n38\n00:03:30,950 --> 00:03:34,160\nand they all contain the text strings, \"The URL\" and \"The Title\".\n\n39\n00:03:35,660 --> 00:03:43,260\n- Do you mean 92% files correctly identified as text?\n- Yes, it correctly identifies 92% as text.\n\n40\n00:03:44,000 --> 00:03:46,150\nI'd really like to see this dramatically reduced.\n\n41\n00:03:46,150 --> 00:03:51,150\nWhat happens if we reduce to around 5 NCL sample files?\n\n42\n00:03:51,150 --> 00:03:52,600\nDoes Linguist still do a reasonable job?\n\n43\n00:03:53,470 --> 00:03:58,190\nI reduced it to 16 NCL samples and 8 text samples.\n\n44\n00:03:58,190 --> 00:04:01,720\nIt correctly classifies my whole set of known NCL files.\n\n45\n00:04:01,870 --> 00:04:05,730\nI tried with 5 samples but could not get the same level of accuracy.\n\n46\n00:04:06,670 --> 00:04:10,400\nIt incorrectly classifies all of the NCL files in this GitHub repository.\n\n47\n00:04:11,130 --> 00:04:14,660\nAll of these files contain the text strings, \"THE_URL:\" and \"THE_TITLE:\".\n\n48\n00:04:14,660 --> 00:04:19,500\nIt did not misclassify any other text-files with the extension NCL.\n\n49\n00:04:19,970 --> 00:04:25,188\nWith 100% accuracy? Does that mean it that the results are better with less samples??\n\n50\n00:04:25,610 --> 00:04:31,190\nI also removed a sample text-file which should have been classified as an NCL file.\n\n51\n00:04:31,000 --> 00:04:35,895\nI think that probably made most of the difference, although I didn't test it atomically.\n\n52\n00:04:35,895 --> 00:04:38,370\nOkay, that makes more sense.\n\n53\n00:04:39,515 --> 00:04:43,450\nI don't get the same results for the text files. Full results here.\n\n54\n00:04:44,650 --> 00:04:50,000\nThey all look correctly classified to me, except for the ones in Fanghuan's repository.\n\n55\n00:04:50,000 --> 00:04:55,920\nI manually went through all of the ones where I didn't already know based on the filename or the repository owner.\n\n56\n00:04:56,526 --> 00:05:00,000\n[Presses button] It now correctly classifies all of my test files.\n\n57\n00:05:00,000 --> 00:05:05,970\nR. Pavlick, thanks for this. These changes will be live in the next release of Linguist. In the next couple of weeks.\n\n58\n00:05:05,970 --> 00:05:07,450\nGreat! Thanks." ], "url": "https://github.com/314eter/atom-language-srt" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "subscript": { "title": "subscript", "appeared": 2012, "type": "pl", "website": "http://subscript-lang.org", "domainName": { "registered": 2012, "name": "subscript-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n4987582|SubScript: Programming with event driven math & concurrent fun|http://subscript-lang.org/|2012-12-30 23:43:30 UTC|1356911010|zoowar|0|2", "isbndb": "" }, "subtext": { "title": "Subtext", "appeared": 2005, "type": "pl", "website": "http://www.subtext-lang.org/", "domainName": { "registered": 2009, "name": "subtext-lang.org" }, "wikipedia": { "summary": "Subtext is a moderately visual programming language and environment, for writing application software. It is an experimental, research attempt to develop a new programming model, called Example Centric Programming, by treating copied blocks as first class prototypes, for program structure. It uses live text, similar to what occurs in spreadsheets as users update cells, for frequent feedback. It is intended to eventually be developed enough to become a practical language for daily use. It is planned to be open software; the license is not yet determined. Subtext was created by Jonathan Edwards who submitted a paper on the language to OOPSLA. It was accepted as part of the 2005 conference.", "pageId": 2199610, "dailyPageViews": 9, "created": 2005, "backlinksCount": 9, "revisionCount": 38, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Subtext_(programming_language)" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "subversion": { "title": "Subversion", "appeared": 2000, "type": "application", "website": "http://subversion.apache.org/", "originCommunity": [ "Apache" ], "domainName": { "name": "subversion.apache.org" }, "wikipedia": { "example": [ "componentfoo/\n /trunk/\n /tags/\n /1.1/\ncomponentbar/\n /trunk/\n /tags/\n /1.1/" ], "related": [ "c", "free-pascal", "freebsd", "xml", "csharp", "php", "python", "perl", "ruby", "java", "mime", "unix" ], "summary": "Apache Subversion (often abbreviated SVN, after its command name svn) is a software versioning and revision control system distributed as open source under the Apache License. Software developers use Subversion to maintain current and historical versions of files such as source code, web pages, and documentation. Its goal is to be a mostly compatible successor to the widely used Concurrent Versions System (CVS). The open source community has used Subversion widely: for example in projects such as Apache Software Foundation, Free Pascal, FreeBSD, GCC and SourceForge. CodePlex offers access to Subversion as well as to other types of clients. Subversion was created by CollabNet Inc. in 2000, and is now a top-level Apache project being built and used by a global community of contributors.", "pageId": 144868, "dailyPageViews": 491, "created": 2002, "backlinksCount": 493, "revisionCount": 1596, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Apache_Subversion" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "subx": { "title": "SubX", "appeared": 2019, "type": "assembly", "creators": [ "Kartik K. Agaram" ], "description": "Author of Mu decided this year to switch implementation from C++ to his own x86 assembler subset named SubX.", "reference": [ "https://github.com/akkartik/mu#readme" ], "fileExtensions": [ "subx" ], "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "#" ] ], "example": [ "# 0x20-0x7e: basic latin\n# 0x20 = space\n 08/size\n 00/is-combine\n 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00" ], "semanticScholar": "" }, "sue": { "title": "Sue", "appeared": 1971, "type": "pl", "reference": [ "https://semanticscholar.org/paper/39b1a4337bbe66835a052d75571896327cccea18" ], "hopl": "https://hopl.info/showlanguage.prx?exp=573", "wordRank": 5705, "centralPackageRepositoryCount": 0 }, "sugar": { "title": "Sugar", "appeared": 2006, "type": "pl", "creators": [ "Sébastien Pierre" ], "description": "Makes JavaScript development sweeter !", "website": "https://github.com/sebastien/sugar/blob/master/Documentation/sugar-quickref.pdf", "fileExtensions": [ "sjs" ], "country": [ "New Zealand" ], "example": [ " @module helloworld\n @class HelloWorld\n | This is a docstring for my hello world\n @property message\n @constructor\n message = \"Hello, World !\"\n @end\n @method say\n alert ( message )\n @end\n @end" ], "githubRepo": { "stars": 45, "forks": 3, "subscribers": 4, "created": 2006, "updated": 2017, "description": "Makes JavaScript development sweeter !", "url": "https://github.com/sebastien/sugar" }, "repoStats": { "firstCommit": 2006, "commits": 311, "committers": 9, "files": 528 } }, "sugarj": { "title": "sugarj", "appeared": 2012, "type": "grammarLanguage", "description": "SugarJ, a language on top of Java, SDF and Stratego, which supports syntactic extensibility.", "reference": [ "https://www.informatik.uni-marburg.de/~rendel/erdweg11sugarj.pdf" ] }, "sugarss": { "title": "SugarSS", "appeared": 2016, "type": "textMarkup", "creators": [ "Andrey Sitnik" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "githubRepo": { "firstCommit": 2016, "stars": 662, "forks": 38, "subscribers": 22, "created": 2016, "updated": 2022, "description": "Indent-based CSS syntax for PostCSS", "issues": 1, "url": "https://github.com/postcss/sugarss" }, "repoStats": { "firstCommit": 2016, "commits": 210, "committers": 19, "files": 51 }, "githubLanguage": { "fileExtensions": [ "sss" ], "trendingProjectsCount": 0, "type": "markup", "group": "CSS", "aceMode": "text", "tmScope": "source.css.postcss.sugarss", "repos": 0, "id": "SugarSS" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2017, "committerCount": 10, "commitCount": 231, "sampleCount": 1, "example": [ "@define-mixin size $size\n width: $size\n\n$big: 100px\n\n// Main block\n.block\n &_logo\n background: inline(\"./logo.png\")\n @mixin size $big" ], "url": "https://github.com/hudochenkov/Syntax-highlighting-for-PostCSS" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "sugartex": { "title": "sugartex", "appeared": 2018, "type": "textMarkup", "githubRepo": { "firstCommit": 2018, "stars": 74, "subscribers": 2, "created": 2018, "updated": 2020, "description": "SugarTeX is a more readable LaTeX language extension and transcompiler to LaTeX. Fast Unicode autocomplete in Atom editor via https://github.com/kiwi0fruit/atom-sugartex-completions", "issues": 3, "forks": 0, "url": "https://github.com/kiwi0fruit/sugartex" }, "repoStats": { "firstCommit": 2018, "commits": 95, "committers": 2, "files": 25 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17172953|Show HN: SugarTeX – readable LaTeX language extension and transcompiler to LaTeX|2018-05-28 15:31:45 UTC|1527521505|kiwi0fruit|49|53", "semanticScholar": "" }, "sugi": { "title": "Sugi", "appeared": 2021, "type": "pl", "creators": [ "sugi-lang" ], "githubRepo": { "firstCommit": 2021, "stars": 2, "forks": 0, "subscribers": 1, "created": 2021, "updated": 2022, "description": "A sequential and minimalistic programming language seeking the ultimate syntax.", "issues": 0, "url": "https://github.com/sugi-lang/sugi" }, "repoStats": { "firstCommit": 2021, "commits": 110, "committers": 2, "files": 3 } }, "summer": { "title": "SUMMER", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/3b06ca92ffd830149c113128480a1bb1ba263a28" ], "hopl": "https://hopl.info/showlanguage.prx?exp=934", "wordRank": 1201, "centralPackageRepositoryCount": 0 }, "sun-raster-format": { "title": "Sun Raster", "appeared": 1989, "type": "binaryDataFormat", "fileExtensions": [ "sun", "ras" ], "wikipedia": { "summary": "Sun Raster was a raster graphics file format used on SunOS by Sun Microsystems. The format has no MIME type, it is specified in @(#)rasterfile.h 1.11 89/08/21 SMI. The format was used for some research papers.ACDSee, FFmpeg, GIMP, ImageMagick, IrfanView, LibreOffice, Netpbm, PaintShop Pro, and XnView among others support Sun Raster image files. In version 2.13 XnView supported the file extensions .ras and .sun for this graphics file format. In version 2.1.4 FFmpeg could encode and decode Sun Raster pixel formats bgr24, pal8, gray, and monow. The format does not support transparency. The plain text Sun icon format specified in @(#)icon_load.h 10.5 89/09/05 SMI is unrelated to the Sun Raster format.", "backlinksCount": 111, "pageId": 42195377, "dailyPageViews": 25, "appeared": 1989, "url": "https://en.wikipedia.org/wiki/Sun_Raster" } }, "suneido": { "title": "Suneido", "appeared": 2000, "type": "pl", "creators": [ "Andrew McKinlay" ], "website": "https://suneido.com/", "country": [ "Canada" ], "originCommunity": [ "Suneido Software Corp" ], "domainName": { "registered": 2000, "awisRank": { "2017": 10371299, "2022": 2110415 }, "name": "suneido.com" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Suneido", "tiobe": { "id": "Suneido" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "superbasic": { "title": "SuperBASIC", "appeared": 1984, "type": "pl", "wikipedia": { "example": [ "100 DIM month$(12,9)\n 110 RESTORE \n 120 REMark QL User Guide's \"Data Read Restore\" example ii\n 130 REMark (appropriately amended relative to example i)\n 140 FOR count=1 TO 12 : READ month$(count) \n 150 DATA \"January\", \"February\", \"March\"\n 160 DATA \"April\",\"May\",\"June\"\n 170 DATA \"July\",\"August\",\"September\"\n 180 DATA \"October\",\"November\",\"December\"\n 190 DATA \"SUN\",\"MON\",\"TUE\",\"WED\",\"THU\",\"FRI\",\"SAT\"\n 199 END DEFine Iso" ], "related": [ "tymshare-superbasic", "isbn" ], "summary": "SuperBASIC is an advanced variant of the BASIC programming language with many structured programming additions. It was developed at Sinclair Research by Jan Jones during the early 1980s. Originally SuperBASIC was intended for a home computer, code-named SuperSpectrum, then under development. This project was later cancelled; however, SuperBASIC was subsequently included in the ROM firmware of the Sinclair QL microcomputer (announced in January 1984), also serving as the command line interpreter for the QL's Qdos operating system. It is notable for being the first second-generation BASIC to be integrated into a microcomputer's operating system, so making the latter user-extendable—as exemplified by Linus Torvalds in his formative years.", "created": 2004, "backlinksCount": 95, "pageId": 980058, "revisionCount": 58, "dailyPageViews": 9, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/SuperBASIC" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6742", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "supercollider": { "title": "SuperCollider", "appeared": 1996, "type": "pl", "website": "http://supercollider.github.io", "documentation": [ "https://doc.sccode.org/" ], "domainName": { "awisRank": { "2017": 776997, "2022": 1121861 }, "name": "supercollider.github.io" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "hasHexadecimals": { "example": "// 0x[0-9a-fA-F]+", "value": true }, "hasFloats": { "example": "// [0-9][0-9]*\\.[0-9]+([eE][0-9]+)?[fd]?", "value": true }, "hasIntegers": { "example": "// [0-9]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "postln" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "// Factorial function\nf = { |x| if(x == 0) { 1 } { f.(x-1) * x } };" ], "related": [ "freebsd", "linux", "smalltalk", "c", "lisp", "puredata", "scheme", "haskell", "scala", "clojure", "android", "ios", "emacs-editor", "vim-editor" ], "summary": "SuperCollider is an environment and programming language originally released in 1996 by James McCartney for real-time audio synthesis and algorithmic composition. Since then it has been evolving into a system used and further developed by both scientists and artists working with sound. It is an efficient and expressive dynamic programming language providing a framework for acoustic research, algorithmic music, interactive programming and live coding. Released under the terms of the GPLv2 in 2002, SuperCollider is free and open-source software.", "pageId": 346978, "dailyPageViews": 116, "created": 2003, "backlinksCount": 123, "revisionCount": 472, "appeared": 1996, "url": "https://en.wikipedia.org/wiki/SuperCollider" }, "githubLanguage": { "fileExtensions": [ "sc", "scd" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "sclang", "scsynth" ], "aceMode": "text", "tmScope": "source.supercollider", "repos": 3782, "id": "SuperCollider" }, "githubBigQuery": { "repos": 3713, "users": 2480, "id": "SuperCollider" }, "pygmentsHighlighter": { "filename": "supercollider.py", "fileExtensions": [ "sc", "scd" ], "id": "SuperCollider" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2017, "committerCount": 7, "commitCount": 16, "sampleCount": 5, "example": [ "WarpPreset {\n\t*new {|path|\n\t\tif(path.notNil) {\n\t\t\t^Object.readArchive(path);\n\t\t};\n\n\t\t^super.new.init();\n\t}\n\n\tinit {\n\n\t}\n\n\tsave {\n\t\tDialog.savePanel({|path|\n\t\t\tthis.writeArchive(path);\n\t\t});\n\t}\n}" ], "url": "https://github.com/supercollider/language-supercollider" }, "helloWorldCollection": [ "// Hello World in SuperCollider\n\n\"Hello, world!\".postln;" ], "leachim6": { "filepath": "s/SuperCollider.sc", "fileExtensions": [ "sc" ], "example": [ "\"Hello World\".postln;\n" ], "id": "SuperCollider" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SuperCollider", "tiobe": { "id": "SuperCollider" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6465", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nProgramming digital music with SuperCollider|2014|Peter Fitton|40386468|4.00|3|0", "isbndb": "year|publisher|title|authors|isbn13\n2013|Packt Publishing|Mapping and Visualization with SuperCollider|Koutsomichalis, Marinos|9781783289677\n2011|Random House Publishing Services|The SuperCollider Book|Scott Wilson|9780262295192\n2016|Logos Verlag Berlin|Introduction To Supercollider|Andrea Valle|9783832540173\n20131125|Packt Publishing|Mapping and Visualization with SuperCollider|Marinos Koutsomichalis|9781783289684", "semanticScholar": "" }, "superforth": { "title": "SuperForth", "appeared": 2022, "type": "pl", "description": "SuperForth v1.1", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/vgbtmd/superforth_v11/" ], "renamedTo": [ "cish" ], "related": [ "cish" ] }, "superjson": { "title": "Superjson", "appeared": 2014, "type": "dataNotation", "creators": [ "Matthew Mueller" ], "description": "A superset of JSON adding: undefined bigint Date RegExp Set Map Error", "supersetOf": [ "json" ], "example": [ "const object = {\n normal: 'string',\n timestamp: new Date(),\n test: /superjson/,\n};\n\nconst { json, meta } = serialize(object);" ], "githubRepo": { "firstCommit": 2014, "stars": 1517, "forks": 35, "subscribers": 12, "created": 2014, "updated": 2022, "description": "Safely serialize JavaScript expressions to a superset of JSON, which includes Dates, BigInts, and more.", "issues": 18, "url": "https://github.com/blitz-js/superjson" }, "repoStats": { "firstCommit": 2014, "commits": 343, "committers": 26, "files": 33 } }, "supermac": { "title": "SUPERMAC", "appeared": 1979, "type": "pl", "reference": [ "https://semanticscholar.org/paper/790cb2e8200766dfaf10fb7dcadb0d02096c0083" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2543", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "superplan": { "title": "Superplan", "appeared": 1951, "type": "pl", "creators": [ "Heinz Rutishauser" ], "country": [ "Germany" ], "hasAssignment": { "example": "", "value": true }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Superplan" } }, "supertalk": { "title": "SuperTalk", "appeared": 1989, "type": "pl", "supersetOf": [ "hypertalk" ], "wikipedia": { "related": [ "hypertalk" ], "summary": "SuperTalk is the scripting language used in SuperCard. SuperTalk is a descendant of HyperTalk.", "created": 2006, "backlinksCount": 6, "pageId": 5235763, "revisionCount": 25, "dailyPageViews": 5, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/SuperTalk" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SuperTalk", "hopl": "https://hopl.info/showlanguage.prx?exp=2544", "centralPackageRepositoryCount": 0 }, "superxpp": { "title": "Superx++", "appeared": 2001, "type": "pl", "wikipedia": { "created": 2007, "revisionCount": 1, "dailyPageViews": -1, "url": "https://en.wikipedia.org/wiki/Superx++" }, "centralPackageRepositoryCount": 0 }, "surge": { "title": "SURGE", "appeared": 1958, "type": "pl", "reference": [ "https://semanticscholar.org/paper/0069579b9d668db2d44493c8b30812268c451f01" ], "hopl": "https://hopl.info/showlanguage.prx?exp=130", "wordRank": 9536, "centralPackageRepositoryCount": 0, "isbndb": "" }, "svelte": { "title": "Svelte", "appeared": 2019, "type": "pl", "creators": [ "Rich Harris" ], "description": "Svelte is a radical new approach to building user interfaces. Whereas traditional frameworks like React and Vue do the bulk of their work in the browser, Svelte shifts that work into a compile step that happens when you build your app. Instead of using techniques like virtual DOM diffing, Svelte writes code that surgically updates the DOM when the state of your app changes.", "website": "https://svelte.dev/", "domainName": { "registered": 2019, "name": "svelte.dev" }, "example": [ "\n\n

Hello {name}!

" ], "githubRepo": { "firstCommit": 2016, "stars": 61681, "forks": 3004, "subscribers": 866, "created": 2016, "updated": 2022, "description": "Cybernetically enhanced web apps", "issues": 785, "url": "https://github.com/sveltejs/svelte" }, "repoStats": { "firstCommit": 2016, "commits": 7329, "committers": 665, "files": 5453 } }, "svg": { "title": "SVG", "appeared": 2001, "type": "textMarkup", "documentation": [ "https://developer.mozilla.org/en-US/docs/Web/SVG" ], "standsFor": "Scalable Vector Graphics", "originCommunity": [ "W3C" ], "hasLineComments": { "example": "", "value": false }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "multiLineCommentTokens": [ [ "" ] ], "wikipedia": { "example": [ "\n\n \n \n \n \n" ], "related": [ "xml", "css", "javascript", "pdf", "synchronized-multimedia-integration-language", "ecmascript", "gzip", "url", "html", "android", "dxf", "gnuplot", "vml" ], "summary": "Scalable Vector Graphics (SVG) is an XML-based vector image format for two-dimensional graphics with support for interactivity and animation. The SVG specification is an open standard developed by the World Wide Web Consortium (W3C) since 1999. SVG images and their behaviors are defined in XML text files. This means that they can be searched, indexed, scripted, and compressed. As XML files, SVG images can be created and edited with any text editor, as well as with drawing software. All major modern web browsers—including Mozilla Firefox, Internet Explorer, Google Chrome, Opera, Safari, and Microsoft Edge—have SVG rendering support.", "pageId": 27751, "dailyPageViews": 1237, "created": 2001, "backlinksCount": 34348, "revisionCount": 2645, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Scalable_Vector_Graphics" }, "githubLanguage": { "fileExtensions": [ "svg" ], "trendingProjectsCount": 0, "type": "data", "aceMode": "xml", "codemirrorMode": "xml", "codemirrorMimeType": "text/xml", "tmScope": "text.xml.svg", "repos": 27, "id": "SVG" }, "linguistGrammarRepo": { "firstCommit": 2004, "lastCommit": 2018, "committerCount": 12, "commitCount": 97, "url": "https://github.com/textmate/xml.tmbundle" }, "helloWorldCollection": [ "\n\n\n\n Hello World\n \n Hello World\n \n \n\n" ], "leachim6": { "filepath": "s/SVG.svg", "fileExtensions": [ "svg" ], "example": [ "\n\n Hello World\n \n Hello World\n \n \n" ], "id": "SVG" }, "indeedJobs": { "2022": 0, "query": "svg developer" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSvg Programming: The Graphical Web|2002|Kurt Cagle|838716|4.50|4|1\nFundamentals of SVG Programming|2003|Oswald Campesato|838718|4.00|2|0", "isbndb": "year|publisher|title|authors|isbn13\n2002|O'Reilly Media|SVG Essentials (O'Reilly XML)|Eisenberg, J. David|9780596002237\n2001|Que Publishing|Designing SVG Web Graphics|Watt, Andrew H. and Watt, Andrew H.|9780735711662\n2014|O'Reilly Media|SVG Essentials: Producing Scalable Vector Graphics with XML|Eisenberg, J. David and Bellamy-Royds, Amelia|9781449374358\n2012|Microsoft Press|Building Web Applications with SVG (Developer Reference)|Dailey, David and Frost, Jon and Strazzullo, Domenico|9780735675797\n2003|Charles River Media|Fundamentals of SVG Programming: Concepts to Source Code (Graphics Series)|Campesato, Oswald|9781584502982\n2012|Microsoft Press|Building Web Applications with SVG (Developer Reference)|Dailey, David and Frost, Jon and Strazzullo, Domenico|9780735660120\n2002|Apress|SVG Programming: The Graphical Web|Cagle, Kurt|9781590590195\n2002|McGraw-Hill/OsborneMedia|SVG For Designers: Using Scalable Vector Graphics in Next-Generation Web Sites (CLS.EDUCATION)|Binder, Kate|9780072225297\n20170317|O'Reilly Media, Inc.|SVG Animations|Sarah Drasner|9781491939659\n20141022|O'Reilly Media, Inc.|SVG Essentials|J. David Eisenberg|9781491945339\n20180906|Springer Nature|Beginning SVG|Alex Libby|9781484237601\n20141022|O'Reilly Media, Inc.|SVG Essentials|J. David Eisenberg; Amelia Bellamy-Royds|9781491945322\n20080101|Springer Nature|SVG Programming|Kurt Cagle|9781430208402\n20151022|O'Reilly Media, Inc.|SVG Text Layout|Amelia Bellamy-Royds; Kurt Cagle|9781491933770\n20151022|O'Reilly Media, Inc.|SVG Text Layout|Amelia Bellamy-Royds; Kurt Cagle|9781491933794\n20151005|O'Reilly Media, Inc.|SVG Colors, Patterns & Gradients|Amelia Bellamy-Royds; Kurt Cagle|9781491933695\n20151005|O'Reilly Media, Inc.|SVG Colors, Patterns & Gradients|Amelia Bellamy-Royds; Kurt Cagle|9781491933718\n2010|Springer-Verlag New York, LLC|Visualizing Information Using Svg and X3d: XML-Based Technologies for the XML-Based Web|Geroimenko and Vladimir and Chen and Chaomei|9781849969185\n20171017|O'Reilly Media, Inc.|Using SVG with CSS3 and HTML5|Amelia Bellamy-Royds; Kurt Cagle; Dudley Storey|9781491921920", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2019|Sketch-n-Sketch: Output-Directed Programming for SVG|10.1145/3332165.3347925|39|2|Brian Hempel and Justin Lubin and Ravi Chugh|b39498c78b491ebaedf1a7e8cbb76df774f0dfde\n2016|Semi-Automated SVG Programming via Direct Manipulation|10.1145/2984511.2984575|35|1|Brian Hempel and Ravi Chugh|74f3fd11b2a5d614f5ad33a93c5281cff769185c\n2002|SVG Programming: The Graphical Web|10.1007/978-1-4302-0840-2|14|1|K. Cagle|69e020d14ca95b93a5902f39be6acddbff3c2df3\n2013|Controlling the Movement of the Robot's Effector on the Plane Using the SVG Markup Language|10.4028/www.scientific.net/AMR.837.577|14|0|K. Foit|0e46ec17729b8a2009ffcb5fd807a89eea34cd1c" }, "svgbob": { "title": "svgbob", "appeared": 2016, "type": "textMarkup", "creators": [ "Jovansonlee Cesar" ], "description": "Svgbob is a diagramming model which uses a set of typing characters to approximate the intended shape.", "website": "https://ivanceras.github.io/svgbob-editor/", "visualParadigm": true, "githubRepo": { "firstCommit": 2016, "stars": 3209, "forks": 89, "subscribers": 40, "created": 2016, "updated": 2022, "description": "Convert your ascii diagram scribbles into happy little SVG", "issues": 24, "url": "https://github.com/ivanceras/svgbob" }, "repoStats": { "firstCommit": 2016, "commits": 579, "committers": 15, "files": 92 } }, "svl": { "title": "SVL", "appeared": 1994, "type": "pl", "reference": [ "https://www.chemcomp.com/journal/svl.htm" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5399", "centralPackageRepositoryCount": 0, "isbndb": "" }, "sw2": { "title": "SW2", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/115cd06b8285a903fec34df36ee3febcf497888f" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7649", "centralPackageRepositoryCount": 0 }, "swagger": { "title": "Swagger", "appeared": 2011, "type": "framework", "website": "http://swagger.io", "domainName": { "awisRank": { "2017": 27196, "2022": 12893 }, "name": "swagger.io" }, "wikipedia": { "related": [ "rest" ], "summary": "Swagger is an open source software framework backed by a large ecosystem of tools that helps developers design, build, document, and consume RESTful Web services. While most users identify Swagger by the Swagger UI tool, the Swagger toolset includes support for automated documentation, code generation, and test case generation. Sponsored by SmartBear Software, Swagger has been a strong supporter of Open Source Software and has widespread adoption.", "pageId": 49099012, "dailyPageViews": 247, "created": 2016, "backlinksCount": 9, "revisionCount": 32, "appeared": 2011, "url": "https://en.wikipedia.org/wiki/Swagger_(software)" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "swallow": { "title": "Swallow", "appeared": 2021, "type": "pl", "creators": [ "Saptak" ], "githubRepo": { "firstCommit": 2021, "stars": 1491, "forks": 72, "subscribers": 67, "created": 2021, "updated": 2022, "description": "A blazing fast language for the blazing fast world(WIP)", "issues": 3, "url": "https://github.com/peregrine-lang/Peregrine" }, "repoStats": { "firstCommit": 2021, "commits": 753, "committers": 41, "files": 103 } }, "sweave": { "title": "Sweave", "appeared": 2002, "type": "template", "fileExtensions": [ "rnw" ], "compilesTo": [ "latex" ], "example": [ "%-------------------------------------------\n\\section{Introduction}\n%--------------------------------------------\n\nJust a simple introduction to Sweave. \n\n<>=\na=1\nb=4\na+b\nprint(\"hello\")\n@\n\nWe can call R commands from the text. For example a+b= \\Sexpr{a+b}" ], "wikipedia": { "related": [ "r", "latex", "lyx-editor", "knitr" ], "summary": "Sweave is a function in the statistical programming language R that enables integration of R code into LaTeX or LyX documents. The purpose is \"to create dynamic reports, which can be updated automatically if data or analysis change\".The data analysis is performed at the moment of writing the report, or more exactly, at the moment of compiling the Sweave code with Sweave (i.e., essentially with R) and subsequently with LaTeX. This can facilitate the creation of up-to-date reports for the author. Because the Sweave files together with any external R files that might be sourced from them and the data files contain all the information necessary to trace back all steps of the data analyses, Sweave also has the potential to make research more transparent and reproducible to others. However, this is only the case to the extent that the author makes the data and the R and Sweave code available. If the author only publishes the resulting PDF document or printed versions thereof, a report created using Sweave is no more transparent or reproducible than the same report created with other statistical and text preparation software.", "backlinksCount": 24, "pageId": 16749071, "created": 2008, "revisionCount": 49, "dailyPageViews": 26, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Sweave" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "sweet-expressions": { "title": "Sweet Expressions", "appeared": 2013, "type": "dataNotation", "creators": [ "David A. Wheeler", "Alan Manuel K. Gloria" ], "description": "This SRFI describes a set of syntax extensions for Scheme, called sweet-expressions (t-expressions), that has the same descriptive power as s-expressions but is designed to be easier for humans to read.", "website": "https://srfi.schemers.org/srfi-110/srfi-110.html", "reference": [ "https://sourceforge.net/p/readable/code/ci/develop/tree/" ], "related": [ "i-expressions", "s-expressions" ], "hasSemanticIndentation": { "example": "", "value": true }, "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "lineCommentToken": [ [ ";" ] ], "example": [ "define fibfast(n) ; Typical function notation\n if {n < 2} ; Indentation, infix {...}\n n ; Single expr = no new list\n fibup n 2 1 0 ; Simple function calls" ] }, "sweetjs": { "title": "Sweet.js", "appeared": 2012, "type": "pl", "creators": [ "Tim Disney" ], "website": "https://sweetjs.org", "country": [ "United States" ], "originCommunity": [ "Facebook" ], "writtenIn": [ "javascript" ], "githubRepo": { "stars": 4500, "forks": 239, "subscribers": 132, "created": 2012, "updated": 2017, "description": "Sweeten your JavaScript.", "url": "https://github.com/sweet-js/sweet-core/" }, "repoStats": { "firstCommit": 2012, "commits": 2272, "committers": 41, "files": 88 } }, "swi-prolog": { "title": "SWI Prolog", "appeared": 1987, "type": "pl", "website": "http://www.swi-prolog.org/", "domainName": { "registered": 2001, "awisRank": { "2022": 191122 }, "name": "swi-prolog.org" }, "githubRepo": { "stars": 741, "forks": 157, "subscribers": 48, "created": 2014, "updated": 2023, "description": "SWI-Prolog Main development repository", "issues": 110, "url": "https://github.com/SWI-Prolog/swipl-devel" }, "repoStats": { "firstCommit": 1992, "commits": 31479, "committers": 159, "files": 1888 }, "wikipedia": { "related": [ "c", "prolog", "java", "rdf", "unix", "linux", "lisp", "emacs-editor" ], "summary": "SWI-Prolog is a free implementation of the programming language Prolog, commonly used for teaching and semantic web applications. It has a rich set of features, libraries for constraint logic programming, multithreading, unit testing, GUI, interfacing to Java, ODBC and others, literate programming, a web server, SGML, RDF, RDFS, developer tools (including an IDE with a GUI debugger and GUI profiler), and extensive documentation. SWI-Prolog runs on Unix, Windows, Macintosh and Linux platforms. SWI-Prolog has been under continuous development since 1987. Its main author is Jan Wielemaker. The name SWI is derived from Sociaal-Wetenschappelijke Informatica (\"Social Science Informatics\"), the former name of the group at the University of Amsterdam, where Wielemaker is employed. The name of this group has changed to HCS (Human-Computer Studies).", "pageId": 1719280, "created": 2005, "backlinksCount": 33, "revisionCount": 154, "dailyPageViews": 54, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/SWI-Prolog" }, "jupyterKernel": [ "https://github.com/madmax2012/SWI-Prolog-Kernel" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "swift-il": { "title": "SIL", "appeared": 2012, "type": "ir", "description": "SIL is an SSA-form IR with high-level semantic information designed to implement the Swift programming language. In contrast to LLVM IR, SIL is a generally target-independent format representation that can be used for code distribution, but it can also express target-specific concepts as well as LLVM can.", "website": "https://github.com/apple/swift/blob/master/docs/SIL.rst", "standsFor": "Swift Intermediate Language", "fileExtensions": [ "sil" ], "originCommunity": [ "Apple" ], "related": [ "cir", "llvmir" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "printToken": [ [ "print" ] ], "example": [ "// SIL is reliant on Swift's type system and declarations, so SIL syntax is an extension of Swift's. A .sil file is a Swift source file with added SIL definitions. The Swift source is parsed only for its declarations; Swift func bodies (except for nested declarations) and top-level code are ignored by the SIL parser. In a .sil file, there are no implicit imports; the swift and/or Builtin standard modules must be imported explicitly if used.\nsil_stage canonical\n\nimport Swift\n\n// Define types used by the SIL function.\n\nstruct Point {\n var x : Double\n var y : Double\n}\n\nclass Button {\n func onClick()\n func onMouseDown()\n func onMouseUp()\n}\n\n// Declare a Swift function. The body is ignored by SIL.\nfunc taxicabNorm(_ a:Point) -> Double {\n return a.x + a.y\n}\n\n// Define a SIL function.\n// The name @_T5norms11taxicabNormfT1aV5norms5Point_Sd is the mangled name\n// of the taxicabNorm Swift function.\nsil @_T5norms11taxicabNormfT1aV5norms5Point_Sd : $(Point) -> Double {\nbb0(%0 : $Point):\n // func Swift.+(Double, Double) -> Double\n %1 = function_ref @_Tsoi1pfTSdSd_Sd\n %2 = struct_extract %0 : $Point, #Point.x\n %3 = struct_extract %0 : $Point, #Point.y\n %4 = apply %1(%2, %3) : $(Double, Double) -> Double\n return %4 : Double\n}\n\n// Define a SIL vtable. This matches dynamically-dispatched method\n// identifiers to their implementations for a known static class type.\nsil_vtable Button {\n #Button.onClick: @_TC5norms6Button7onClickfS0_FT_T_\n #Button.onMouseDown: @_TC5norms6Button11onMouseDownfS0_FT_T_\n #Button.onMouseUp: @_TC5norms6Button9onMouseUpfS0_FT_T_\n}" ], "leachim6": { "filepath": "s/SIL.SIL", "fileExtensions": [ "SIL" ], "example": [ "print Hello World\n" ], "id": "SIL" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "swift": { "title": "Swift", "appeared": 2014, "type": "pl", "creators": [ "Chris Lattner" ], "website": "https://swift.org", "documentation": [ "https://www.swift.org/documentation/" ], "emailList": [ "https://www.swift.org/blog/forums/" ], "fileExtensions": [ "swift" ], "originCommunity": [ "Apple" ], "domainName": { "awisRank": { "2017": 83258, "2022": 53358 }, "name": "swift.org" }, "releaseNotesUrl": "https://github.com/apple/swift/blob/main/CHANGELOG.md", "proposals": "https://github.com/apple/swift-evolution", "versions": { "2014": [ "1.0" ], "2015": [ "2.0" ], "2016": [ "3.0" ], "2017": [ "4.0" ], "2019": [ "5.0" ] }, "visualParadigm": false, "hasVariableSubstitutionSyntax": { "example": "", "value": false }, "hasAssignment": { "example": "let label = UILabel()", "value": true }, "hasStrings": { "example": "\"hello world\"", "value": true }, "hasSingleDispatch": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "hasImports": { "example": "import UIKit\nimport UIKit.UITableViewController\nlet tvc = UITableViewController()\nlet vc = UIViewController()\nlet label = UILabel()", "value": true }, "hasInterfaces": { "example": "protocol MyProtocol {\ninit(parameter: Int)\nvar myVariable: Int { get set }\nvar myReadOnlyProperty: Int { get }\nfunc myMethod()\nfunc myMethodWithBody()\n}\nextension MyProtocol {\nfunc myMethodWithBody() {\n // implementation goes here\n }\n}", "value": true }, "hasOperatorOverloading": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasTypeInference": { "example": "", "value": true }, "hasLineComments": { "example": "// A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "isCaseSensitive": { "example": "", "value": true }, "hasBooleans": { "example": "", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasExceptions": { "example": "", "value": true }, "hasSwitch": { "example": "", "value": true }, "hasAccessModifiers": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "// 0o[0-7_]+", "value": true }, "hasHexadecimals": { "example": "// 0x[0-9a-fA-F_]+", "value": true }, "hasFloats": { "example": "// [0-9][0-9_]*(\\.[0-9_]+[eE][+\\-]?[0-9_]+|\\.[0-9_]*|[eE][+\\-]?[0-9_]+)", "value": true }, "hasIntegers": { "example": "// [0-9][0-9_]*", "value": true }, "hasBinaryNumbers": { "example": "// 0b[01_]+", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "booleanTokens": [ [ "true", "false" ] ], "keywords": [ "associatedtype", "class", "deinit", "enum", "extension", "func", "import", "init", "inout", "internal", "let", "operator", "private", "protocol", "public", "static", "struct", "subscript", "typealias", "var", "break", "case", "continue", "default", "defer", "do", "else", "fallthrough", "for", "guard", "if", "in", "repeat", "return", "switch", "where", "while", "as", "catch", "dynamicType", "false", "is", "nil", "rethrows", "super", "self", "Self", "throw", "throws", "true", "try", "#column", "#file", "#function", "#line", "#available", "#column", "#else#elseif", "#endif", "#file", "#function", "#if", "#line", "#selector", "associativity", "convenience", "dynamic", "didSet", "final", "get", "infix", "indirect", "lazy", "left", "mutating", "none", "nonmutating", "optional", "override", "postfix", "precedence", "prefix", "Protocol", "required", "right", "set", "Type", "unowned", "weak", "willSet" ], "gource": "https://www.youtube.com/watch?v=SFrdfk9Cvr8", "githubRepo": { "firstCommit": 2010, "stars": 60145, "forks": 9678, "subscribers": 2526, "created": 2015, "updated": 2022, "description": "The Swift Programming Language", "issues": 5994, "url": "https://github.com/apple/swift" }, "repoStats": { "firstCommit": 2010, "commits": 177613, "committers": 1379, "files": 24040 }, "wikipedia": { "example": [ "var someSortOfPrintableObject: SupportsToString\n...\nprint(someSortOfPrintableObject.toString())" ], "related": [ "linux", "freebsd", "csharp", "clu", "d", "haskell", "objective-c", "python", "ruby", "rust", "ios", "llvmir", "c", "smalltalk", "java", "unicode", "android", "kotlin" ], "summary": "Swift is a general-purpose, multi-paradigm, compiled programming language developed by Apple Inc. for iOS, macOS, watchOS, tvOS, and Linux. Swift is designed to work with Apple's Cocoa and Cocoa Touch frameworks and the large body of existing Objective-C (ObjC) code written for Apple products. It is built with the open source LLVM compiler framework and has been included in Xcode since version 6. On platforms other than Linux, it uses the Objective-C runtime library which allows C, Objective-C, C++ and Swift code to run within one program. Apple intended Swift to support many core concepts associated with Objective-C, notably dynamic dispatch, widespread late binding, extensible programming and similar features, but \"safer\" (easier to catch software bugs); Swift has features addressing some common programming errors like null pointers and provides syntactic sugar to help avoid the pyramid of doom. Swift supports the concept of protocol extensibility, an extensibility system that can be applied to types, structs and classes, which Apple promotes as a real change in programming paradigms they term \"protocol-oriented programming\" (similar to traits). Swift was introduced at Apple's 2014 Worldwide Developers Conference (WWDC). It underwent an upgrade to version 1.2 during 2014 and a more major upgrade to Swift 2 at WWDC 2015. Initially a proprietary language, version 2.2 was made open-source software under the Apache License 2.0 on December 3, 2015, for Apple's platforms and Linux. In March 2017, Swift made the top 10 in the monthly TIOBE index ranking of popular programming languages, while since then it slipped down the list to 20.", "pageId": 42946389, "dailyPageViews": 1501, "created": 2014, "backlinksCount": 518, "revisionCount": 1256, "appeared": 2014, "fileExtensions": [ "swift" ], "url": "https://en.wikipedia.org/wiki/Swift_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "swift" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nLoopKit Loop https://github.com/LoopKit.png https://github.com/LoopKit/Loop Swift #ffac45 478 657 49 \"An automated insulin delivery app template for iOS, built on LoopKit\"\nbrentsimmons NetNewsWire https://github.com/brentsimmons.png https://github.com/brentsimmons/NetNewsWire Swift #ffac45 2174 151 728 \"RSS reader for macOS.\"\ndkhamsing open-source-ios-apps https://github.com/dkhamsing.png https://github.com/dkhamsing/open-source-ios-apps Swift #ffac45 21111 3506 354 \"📱 Collaborative List of Open-Source iOS Apps\"\npedrommcarrasco Brooklyn https://github.com/pedrommcarrasco.png https://github.com/pedrommcarrasco/Brooklyn Swift #ffac45 2926 131 200 \"🍎 Screensaver inspired by Apple's Event on October 30, 2018\"\nyonaskolb XcodeGen https://github.com/yonaskolb.png https://github.com/yonaskolb/XcodeGen Swift #ffac45 2618 239 128 \"A Swift command line tool for generating your Xcode project\"\nmozilla-mobile firefox-ios https://github.com/mozilla-mobile.png https://github.com/mozilla-mobile/firefox-ios Swift #ffac45 8877 2061 77 \"Firefox for iOS\"\nhttpswift swifter https://github.com/httpswift.png https://github.com/httpswift/swifter Swift #ffac45 2776 406 56 \"Tiny http server engine written in Swift programming language.\"\nWenchaoD FSPagerView https://github.com/WenchaoD.png https://github.com/WenchaoD/FSPagerView Swift #ffac45 4633 551 142 \"FSPagerView is an elegant Screen Slide Library. It is extremely helpful for making Banner View、Product Show、Welcome/Guide Pages、Screen/ViewController Sliders.\"\nmarmelroy PhoneNumberKit https://github.com/marmelroy.png https://github.com/marmelroy/PhoneNumberKit Swift #ffac45 3094 357 97 \"A Swift framework for parsing, formatting and validating international phone numbers. Inspired by Google's libphonenumber.\"\nAlamofire Alamofire https://github.com/Alamofire.png https://github.com/Alamofire/Alamofire Swift #ffac45 31815 5728 273 \"Elegant HTTP Networking in Swift\"\nJohnCoates Aerial https://github.com/JohnCoates.png https://github.com/JohnCoates/Aerial Swift #ffac45 15249 815 273 \"Apple TV Aerial Screensaver for Mac\"\nReactiveX RxSwift https://github.com/ReactiveX.png https://github.com/ReactiveX/RxSwift Swift #ffac45 17102 2889 232 \"Reactive Programming in Swift\"\nluispadron UICircularProgressRing https://github.com/luispadron.png https://github.com/luispadron/UICircularProgressRing Swift #ffac45 1198 211 94 \"A circular progress bar for iOS written in Swift\"\napple swift-log https://github.com/apple.png https://github.com/apple/swift-log Swift #ffac45 1383 69 81 \"A Logging API for Swift\"\nstephencelis SQLite.swift https://github.com/stephencelis.png https://github.com/stephencelis/SQLite.swift Swift #ffac45 6327 1092 86 \"A type-safe, Swift-language layer over SQLite3.\"\nmatteocrippa awesome-swift https://github.com/matteocrippa.png https://github.com/matteocrippa/awesome-swift Swift #ffac45 17867 2509 205 \"A collaborative list of awesome Swift libraries and resources. Feel free to contribute!\"\nSCENEE FloatingPanel https://github.com/SCENEE.png https://github.com/SCENEE/FloatingPanel Swift #ffac45 2768 188 128 \"A clean and easy-to-use floating panel UI component for iOS\"\nkrzyzanowskim CryptoSwift https://github.com/krzyzanowskim.png https://github.com/krzyzanowskim/CryptoSwift Swift #ffac45 7218 823 93 \"CryptoSwift is a growing collection of standard and secure cryptographic algorithms implemented in Swift\"\nserhii-londar open-source-mac-os-apps https://github.com/serhii-londar.png https://github.com/serhii-londar/open-source-mac-os-apps Swift #ffac45 18202 1211 360 \"🚀 Awesome list of open source applications for macOS.\"\nHeroTransitions Hero https://github.com/HeroTransitions.png https://github.com/HeroTransitions/Hero Swift #ffac45 17276 1368 227 \"Elegant transition library for iOS & tvOS\"\nQuick Quick https://github.com/Quick.png https://github.com/Quick/Quick Swift #ffac45 8386 777 82 \"The Swift (and Objective-C) testing framework.\"\nradex SwiftyUserDefaults https://github.com/radex.png https://github.com/radex/SwiftyUserDefaults Swift #ffac45 3871 266 55 \"Modern Swift API for NSUserDefaults\"\nsindresorhus Gifski https://github.com/sindresorhus.png https://github.com/sindresorhus/Gifski Swift #ffac45 3753 109 595 \"🌈 Convert videos to high-quality GIFs on your Mac\"\nMortennn Dozer https://github.com/Mortennn.png https://github.com/Mortennn/Dozer Swift #ffac45 2187 78 162 \"Hide status bar icons on macOS\"\nmxcl PromiseKit https://github.com/mxcl.png https://github.com/mxcl/PromiseKit Swift #ffac45 11928 1160 135 \"Promises for Swift & ObjC.\"", "trendingProjectsCount": 26, "type": "programming", "aceMode": "text", "codemirrorMode": "swift", "codemirrorMimeType": "text/x-swift", "tmScope": "source.swift", "repos": 1044892, "id": "Swift" }, "githubBigQuery": { "repos": 42531, "users": 25149, "id": "Swift" }, "monaco": "swift", "codeMirror": "swift", "pygmentsHighlighter": { "filename": "objective.py", "fileExtensions": [ "swift" ], "id": "Swift" }, "linguistGrammarRepo": { "firstCommit": 2014, "lastCommit": 2018, "committerCount": 11, "commitCount": 101, "sampleCount": 43, "example": [ "println(\"Hello, world\")\n" ], "url": "https://github.com/textmate/swift.tmbundle" }, "languageServerProtocolProject": [ "https://github.com/apple/sourcekit-lsp\nwrittenIn swift" ], "projectEuler": { "memberCount": { "2019": 523, "2022": 690 }, "id": "Swift" }, "helloWorldCollection": [ "// Hello world in Swift\n\nprintln(\"Hello, world!\")" ], "leachim6": { "filepath": "s/Swift.swift", "fileExtensions": [ "swift" ], "example": [ "print(\"Hello World\")\n" ], "id": "Swift" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Swift", "compilerExplorer": { "example": [ "// Type your code here, or load an example.\nfunc square(n: Int) -> Int {\n return n * n\n}" ], "id": "Swift" }, "rijuRepl": { "example": [ "print(\"Hello, world!\")\n" ], "id": "https://riju.codes/swift" }, "replit": "https://repl.it/languages/swift", "indeedJobs": { "2017": 2043, "query": "swift developer" }, "linkedInSkill": { "2018": 171143, "id": "swift" }, "stackOverflowSurvey": { "2021": { "users": 4204, "medianSalary": 58911, "fans": 6353, "percentageUsing": 0.05 } }, "officialBlogUrl": [ "https://www.swift.org/blog/" ], "downloadPageUrl": [ "https://www.swift.org/download/" ], "subreddit": [ { "memberCount": { "2017": 29890, "2022": 93491 }, "url": "https://reddit.com/r/swift" } ], "meetup": { "memberCount": 154306, "groupCount": 375, "url": "https://www.meetup.com/topics/swift-language" }, "tiobe": { "currentRank": 20, "id": "Swift" }, "pypl": "Swift", "packageRepository": [ "https://cocoapods.org/" ], "twitter": "https://twitter.com/swiftlang", "fileType": "text", "wordRank": 9077, "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n2014|Peachpit Press|Swift for Beginners: Develop and Design|Pitre, Boisy G.|9780134044705\n2014|Apress|Transitioning to Swift|Gardner, Scott and Gardner, Scott|9781484204078\n2016|Big Nerd Ranch Guides|Swift Programming: The Big Nerd Ranch Guide (Big Nerd Ranch Guides)|Mathias, Matthew and Gallagher, John|9780134610610\n2018|Packt Publishing|Learn Swift by Building Applications: Explore Swift programming through iOS app development|Atanasov, Emil|9781786463920\n2015|Big Nerd Ranch Guides|Swift Programming: The Big Nerd Ranch Guide (Big Nerd Ranch Guides)|Mathias, Matthew and Gallagher, John|9780134398013\n2019|Packt Publishing|Mastering Swift 5: Deep dive into the latest edition of the Swift programming language, 5th Edition|Hoffman, Jon|9781789139860\n2015|Razeware LLC|The Swift Apprentice: Beginning Programming with Swift 2|Clayton, Janie and Gallagher, Alexis and Galloway, Matt and Ganem, Eli and Kerber, Erik and Morrow, Ben|9781942878131\n2016|Wrox|Swift iOS 24-Hour Trainer|Mishra, Abhishek|9781119073550\n2017|Packt Publishing|Mastering Swift 4 - Fourth Edition: An in-depth and comprehensive guide to modern programming techniques with Swift|Hoffman, Jon|9781788477802\n2015|Packt Publishing|Application Development with Swift|Ghareeb, Hossam|9781785288173\n2017|Razeware LLC|Swift Apprentice Third Edition: Beginning Programming with Swift 4|raywenderlich.com Team and Clayton, Janie and Gallagher, Alexis and Galloway, Matt and Morrow, Ben and Pupaza, Cosmin and van Impe, Steven|9781942878438\n2015-11-04|Packt Publishing|Mastering Swift 2|Jon Hoffman|9781785886034\n2020|Packt Publishing|iOS 13 Programming for Beginners: Get started with building iOS apps with Swift 5 and Xcode 11, 4th Edition|Sahar, Ahmad and Clayton, Craig|9781838821906\n2015|Apress|Beginning Swift Games Development for iOS|Goodwill, James and Matlock, Wesley|9781484204016\n2014|O'Reilly Media|iOS 8 Swift Programming Cookbook: Solutions & Examples for iOS Apps|Nahavandipoor, Vandad|9781491908693\n2017|Apress|macOS Programming for Absolute Beginners: Developing Apps Using Swift and Xcode|Wang, Wallace|9781484226612\n2019|Packt Publishing|Swift Protocol-Oriented Programming: Increase productivity and build faster applications with Swift 5, 4th Edition|Hoffman, Jon|9781789349023\n2017|Wiley|Swift in the Cloud|Williamson, Leigh and Ponzo, John and Bohrer, Patrick and Olivieri, Ricardo and Weinmeister, Karl and Kallner, Samuel|9781119368472\n2015|Apress|Learn Swift on the Mac: For OS X and iOS|Malik, Waqar|9781484203774\n2015|O'Reilly Media|iOS Swift Game Development Cookbook: Simple Solutions for Game Development Problems|Manning, Jonathon and Buttfield-Addison, Paris|9781491920800\n2016|Packt Publishing|Object Oriented Programming with Swift 2|Hillar, Gaston C.|9781785885693\n2020|Packt Publishing|Mastering Swift 5.3: Upgrade your knowledge and become an expert in the latest version of the Swift programming language, 6th Edition|Hoffman, Jon|9781800562158\n2015-11-06|Packt Publishing|Swift High Performance|Kostiantyn Koval|9781785282201\n2016|Packt Publishing|Swift Data Structure and Algorithms|Azar, Erik and Alebicto, Mario Eguiluz|9781785884504\n43892|Packt Publishing|Hands-On Swift 5 Microservices Development|Ralph Kuepper; Tanner Nelson|9781789534832\n2016|Apress|Migrating to Swift from Flash and ActionScript|Adams, Radoslava Leseva and Lesev, Hristo|9781484216668\n2016|Apress|Beginning CareKit Development: Develop CareKit Applications Using Swift|Baxter, Christopher|9781484222263\n2018|Packt Publishing|Reactive Programming with Swift 4: Build asynchronous reactive applications with easy-to-maintain and clean code using RxSwift and Xcode 9|Singh, Navdeep|9781787120211\n2019|Apress|Swift 5 for Absolute Beginners: Learn to Develop Apps for iOS|Kaczmarek, Stefan and Lees, Brad and Bennett, Gary|9781484248683\n2017|Apress|iOS Code Testing: Test-Driven Development and Behavior-Driven Development with Swift|Mishra, Abhishek|9781484226896\n2015-10-27|Packt Publishing|Swift 2 Blueprints|Cecil Costa|9781783980765\n2014|Apress|Swift Quick Syntax Reference|Campbell, Matthew|9781484204399\n2016-01-06|Wiley Professional Development (P&T)|Swift iOS 24-Hour Trainer|Abhishek Mishra|9781119073420\n2015|Apress|Migrating to Swift from Web Development|Liao, Sean and Punak, Mark and Nemec, Anthony|9781484209318\n2015|Apress|Swift Game Programming for Absolute Beginners|Egges, Arjan|9781484206508\n2016|CreateSpace Independent Publishing Platform|Beginner's Guide to iOS 10 App Development Using Swift 3: Xcode, Swift and App Design Fundamentals|Yamacli, Serhan|9781540452153\n2017|Packt Publishing|Swift iOS Programming for Kids: Help your kids build simple and engaging applications with Swift 3.0|Sommer, Steffen D. and Campagno, Jim|9781787125650\n2015|Apress|Swift OS X Programming for Absolute Beginners|Wang, Wallace|9781484212332\n2015|Big Nerd Ranch, Exclusive Worldwide Distribution Of The English Edition Of This Book By Pearson Technology Group|Swift Programming: The Big Nerd Ranch Guide|Mathias, Matthew (author.)|9780134398068\n2015|Apress|Developing for Apple TV using tvOS and Swift|Bennett, Gary and Lees, Brad and Kaczmarek, Stefan|9781484217153\n20161115|Springer Nature|Build iOS Database Apps with Swift and SQLite|Kevin Languedoc|9781484222324\n2015|Apress|Learn Swift 2 on the Mac: For OS X and iOS|Malik, Waqar|9781484216279\n2021|Razeware LLC|Swift Apprentice (Seventh Edition): Beginning Programming with Swift|Tutorial Team, raywenderlich and Ganim, Eli and Pupăză, Cosmin and Galloway, Matt and Morrow, Ben and Gallagher, Alexis and Amer, Ehab Yosry|9781950325528\n2021|Razeware LLC|Combine: Asynchronous Programming with Swift (Third Edition)|Tutorial Team, raywenderlich and Mishali, Shai and Pillet, Florent and Todorov, Marin and Gardner, Scott|9781950325498\n2020-11-27T00:00:01Z|Packt Publishing|iOS 14 Programming for Beginners: Get started with building iOS apps with Swift 5.3 and Xcode 12, 5th Edition|Sahar, Ahmad|9781800209749\n2021|Razeware LLC|Combine: Asynchronous Programming with Swift (Second Edition)|Tutorial Team, raywenderlich and Gardner, Scott and Mishali, Shai and Pillet, Florent and Todorov, Marin|9781950325467\n2021|Packt Publishing|iOS 15 Programming for Beginners: Kickstart your mobile app development journey by building iOS apps with Swift 5.5 and Xcode 13, 6th Edition|Sahar, Ahmad|9781801811248\n2019|Independently published|Swift: The Complete Guide for Beginners,Intermediate and Advanced Detailed Strategies To Master Swift Programming|Martin, MG|9781096672289\n2021|Packt Publishing|Mastering iOS 14 Programming: Build professional-grade iOS 14 applications with Swift 5.3 and Xcode 12.4, 4th Edition|Alebicto, Mario Eguiluz and Barker, Chris and Wals, Donny|9781838822842\n2020|Big Nerd Ranch Guides|Swift Programming: The Big Nerd Ranch Guide (Big Nerd Ranch Guides)|Ward, Mikey|9780135264201\n2019-11-25T00:00:01Z|Razeware LLC|Swift Apprentice (Fifth Edition): Beginning Programming with Swift|Tutorial Team, raywenderlich and Amer, Ehab and Gallagher, Alexis and Galloway, Matt and Ganim, Eli and Morrow, Ben and Pupaza, Cosmin|9781950325078\n2019|Apress|Beginning iPhone Development with Swift 5: Exploring the iOS SDK|Wang, Wallace|9781484248652\n2018|Packt Publishing|Swift Game Development: Learn iOS 12 game development using SpriteKit, SceneKit and ARKit 2.0, 3rd Edition|Shekar, Siddharth and Haney, Stephen|9781788472807\n2019|Apress|Pro iPhone Development with Swift 5: Design and Manage Top Quality Apps|Wang, Wallace|9781484249444\n2021|Razeware LLC|Data Structures & Algorithms in Swift (Fourth Edition): Implementing Practical Data Structures with Swift|Tutorial Team, raywenderlich and Lau, Kelvin and Ngo, Vincent|9781950325405\n2014|Apress|Beginning Xcode: Swift Edition|Knott, Matthew|9781484205389\n2017-12-26T00:00:01Z|Addison-Wesley Professional|Metal Programming Guide: Tutorial and Reference via Swift|Clayton, Janie|9780134668949\n2021|BPB Publications|iOS 15 Application Development for Beginners: Learn Swift Programming and Build iPhone Apps with SwiftUI and Xcode 13 (English Edition)|Kulsreshtha, Arpit|9789355511102\n2019-12-05T00:00:01Z|Razeware LLC|Combine: Asynchronous Programming with Swift (First Edition)|Tutorial Team, raywenderlich and Gardner, Scott and Mishali, Shai and Pillet, Florent and Todorov, Marin|9781942878841\n2019|Razeware LLC|Data Structures & Algorithms in Swift (Third Edition): Implementing Practical Data Structures with Swift|Tutorial Team, raywenderlich and Lau, Kelvin and Ngo, Vincent|9781942878995\n2020|Packt Publishing|iOS 13 Programming for Beginners: Get started with building iOS apps with Swift 5 and Xcode 11, 4th Edition|Sahar, Ahmad and Clayton, Craig|9781838820633\n2017|Apress|Beginning iPhone Development with Swift 4: Exploring the iOS SDK|Maskrey, Molly K.|9781484230725\n2021|Packt Publishing|Swift Cookbook: Over 60 proven recipes for developing better iOS applications with Swift 5.3, 2nd Edition|Moon, Keith and Barker, Chris|9781839210624\n2018|Packt Publishing|Hands-On Full-Stack Development with Swift: Develop full-stack web and native mobile applications using Swift and Vapor|Patel, Ankur|9781788626279\n2019-06-25T00:00:01Z|In Easy Steps Limited|Swift Programming in easy steps: Develop iOS apps - covers iOS 12 and Swift 5|Bartlett, Darryl|9781840787771\n2017|Razeware LLC|RxSwift: Reactive Programming with Swift|raywenderlich.com Team and Pillet, Florent and Bontognali, Junior and Todorov, Marin and Gardner, Scott|9781942878346\n2019|Independently published|Beginner’s Guide to iOS 13 App Development Using Swift 5.1: Xcode, Swift and App Design Fundamentals|Yamacli, Serhan|9781703090772\n2017|Apress|macOS Programming for Absolute Beginners: Developing Apps Using Swift and Xcode|Wang, Wallace|9781484226629\n2020|Packt Publishing|Learn SwiftUI: An introductory guide to creating intuitive cross-platform user interfaces using Swift 5|Barker, Chris|9781839210877\n2015|Peachpit Press|Swift for Beginners: Develop and Design|Pitre, Boisy G.|9780134289786\n2019-12-14T00:00:01Z|Devslopes|iOS 13 & Swift 5 Programming|Wahlbeck, Mark|9780578618111\n2015-02-01T00:00:01Z|Prentice Hall|Swift for Programmers (Deitel Developer Series)|Deitel, Paul J. and Deitel, Harvey|9780134021362\n2017|Apress|Learn Computer Science with Swift: Computation Concepts, Programming Paradigms, Data Management, and Modern Component Architectures with Swift and Playgrounds|Feiler, Jesse|9781484230657\n2017-03-22T00:00:01Z|Packt Publishing|Swift iOS Programming for Kids|Sommer, Steffen D. and Campagno, Jim|9781787120747\n2018-05-31T00:00:01Z|Packt Publishing|Beginning Swift: Master the fundamentals of programming in Swift 4|Kerr, Rob and Morstol, Kare|9781789534313\n2016|Packt Publishing|Test-Driven iOS Development with Swift|Hauser, Dr. Dominik|9781785880049\n2015|O'Reilly Media|Swift Pocket Reference|Gray, Anthony|9781491915424\n2017|Packt Publishing|Swift Functional Programming - Second Edition: Ease the creation, testing, and maintenance of Swift codes|Nayebi, Dr. Fatih|9781787283459\n2016|Packt Publishing|Swift Data Structure and Algorithms|Azar, Erik and Alebicto, Mario Eguiluz|9781785884658\n2017|Addison-Wesley Professional|iOS and macOS Performance Tuning: Cocoa, Cocoa Touch, Objective-C, and Swift (Developer's Library)|Weiher, Marcel|9780133085532\n2017|Packt Publishing|Swift 4 Protocol-Oriented Programming: Bring predictability, performance, and productivity to your Swift applications, 3rd Edition|Hoffman, Jon|9781788473828\n2016|Packt Publishing|Test-Driven iOS Development with Swift|Hauser, Dr. Dominik|9781785880735\n2018|Packt Publishing|iOS 12 Programming for Beginners: An introductory guide to iOS app development with Swift 4.2 and Xcode 10, 3rd Edition|Clayton, Craig|9781789348668\n2017-08-08T00:00:01Z|Pragmatic Bookshelf|Functional Programming: A PragPub Anthology: Exploring Clojure, Elixir, Haskell, Scala, and Swift||9781680502336\n2016-12-07T00:00:01Z|Razeware LLC|The Swift Apprentice Second Edition: Beginning programming with Swift 3|raywenderlich.com Team and Clayton, Janie and Gallagher, Alexis and Galloway, Matt and Ganem, Eli and Kerber, Erik and Morrow, Ben and Pupaza, Cosmin and Van Impe, Steven|9781942878230\n2017|Packt Publishing|Swift 4 Programming Cookbook: 50 task-oriented recipes to make you productive with Swift 4|Moon, Keith|9781786460899\n2015|Packt Publishing|Swift Cookbook - 50 Recipes to Help You Harness Swift|Costa, Cecil|9781784391898\n2015|Packt Publishing|Game Development with Swift: Embrace the mobile gaming revolution and bring your iPhone game ideas to life with Swift|Haney, Stephen|9781783550531\n2016|Packt Publishing|Swift 2 By Example|Scalzo, Giordano|9781785882777\n2018-01-09T00:00:01Z|O'Reilly Media|iOS 11 Swift Programming Cookbook: Solutions and Examples for iOS Apps|Nahavandipoor, Vandad|9781491992470\n2015-12-15T00:00:01Z|O'Reilly Media|Swift Pocket Reference: Programming for Ios and OS X: Covers Swift 2.1|Gray, Anthony|9781491940075\n2015|Apress|Pro Design Patterns in Swift|Freeman, Adam|9781484203958\n2014|Wrox|Beginning Swift Programming|Lee, Wei-Meng|9781119009313\n2018|Independently published|Introduction to Algorithms and Data Structures in Swift 4: Get ready for programming job interviews. Write better, faster Swift code. (Swift Clinic)|Nyisztor, Karoly|9781973291749\n2016|O'Reilly Media|iOS 10 Swift Programming Cookbook: Solutions and Examples for iOS Apps|Nahavandipoor, Vandad|9781491966433\n2015|Apress|Pro Design Patterns in Swift|Freeman, Adam|9781484203941\n2021|Addison-Wesley Professional|Programming in Swift (Developer's Library)|Kochan, Stephen G. and Mick, Patrick|9780134037578\n2015|Apress|Swift OS X Programming for Absolute Beginners|Wang, Wallace|9781484212349\n2017|Packt Publishing|Swift 4 Protocol-Oriented Programming: Bring predictability, performance, and productivity to your Swift applications, 3rd Edition|Hoffman, Jon|9781788470032\n2017|Packt Publishing|Swift Functional Programming - Second Edition: Ease the creation, testing, and maintenance of Swift codes|Nayebi, Dr. Fatih|9781787284500\n2016|Packt Publishing|Mastering Swift 3|Hoffman, Jon|9781786466129\n2017|Packt Publishing|Mastering Swift 3 - Linux|Hoffman, Jon|9781786460479\n2015|Packt Publishing|Learning Swift|Wagner, Andrew|9781784399627\n2017|BackupBrain|Bluetooth Low Energy in iOS Swift (Kindle Edition): Your Guide to Programming the Internet of Things (Bluetooth Low Energy Programming Book 1)|Gaitatzis, Tony|9781775128007\n2015|Packt Publishing|Swift 2 Design Patterns|Lange, Julien|9781785886119\n2018-01-31T00:00:01Z|Packt Publishing|Learn iOS 11 Programming with Swift 4 - Second Edition: Learn the fundamentals of iOS app development with Swift 4 and Xcode 9|Clayton, Craig|9781788390750\n2016|Packt Publishing|Swift 2 By Example|Scalzo, Giordano|9781785882920\n2014|Peachpit Press|Swift Translation Guide for Objective-C: Develop and Design|Kelly, Maurice|9780134044798\n2016|Addison-Wesley Professional|Learning Swift 2 Programming (2nd Edition)|Schatz, Jacob|9780134431598\n2015-09-11T00:00:01Z|Tenaya Creek Press|Understanding Swift Programming|Will, Craig A.|9780996228107\n2018-10-31T00:00:01Z|Packt Publishing|Mastering iOS 12 Programming: Build professional-grade iOS applications with Swift and Xcode 10, 3rd Edition|Wals, Donny|9781789133202\n2015|Apress|Beginning iPhone Development with Swift 2: Exploring the iOS SDK|Mark, David and Topley, Kim and Nutting, Jack and Olsson, Fredrik and LAMARCHE, JEFF|9781484217542\n2016|Apress|OS X App Development with CloudKit and Swift|Wade, Bruce|9781484218808\n2016-01-19T00:00:01Z|O'Reilly Media|iOS 9 Swift Programming Cookbook: Solutions and Examples for iOS Apps|Nahavandipoor, Vandad|9781491936696\n2015|Apress|Program the Internet of Things with Swift for iOS|Bakir, Ahmed and de la Torriente, Manny and Chesler, Gheorghe|9781484211946\n2015|Apress|Swift Game Programming for Absolute Beginners|Egges, Arjan|9781484206515\n2017|Packt Publishing|Mastering iOS 11 Programming: Build professional-grade iOS applications with Swift 4 and Xcode 9, 2nd Edition|Wals, Donny|9781788398237\n2017|Apress|Beginning Swift Games Development for iOS: Develop 2D and 3D games Using Apple's SceneKit and SpriteKit|Goodwill, James and Matlock, Wesley|9781484223109\n2016|Packt Publishing|Swift 3 New Features|Elliott, Keith|9781786462718\n2015|Apress|Beginning Swift Games Development for iOS|Goodwill, James and Matlock, Wesley|9781484204009\n2015|Addison-Wesley Professional|Learning Swift Programming (Addison-Wesley Learning)|Schatz, Jacob|9780133950403\n2014|Apress|Transitioning to Swift|Gardner, Scott|9781484204061\n2016|Razeware LLC|The Swift Apprentice: Updated for Swift 2.2: Beginning Programming with Swift 2.2|raywenderlich.com Team and Clayton, Janie and Gallagher, Alexis and Galloway, Matt and Ganem, Eli and Kerber, Erik and Morrow, Ben|9781942878179\n2014|O'Reilly Media|Introducing iOS 8: Swift Programming from Idea to App Store|Derico, Steve|9781491908617\n2018|Apress|Pro iPhone Development with Swift 4: Design and Manage Top Quality Apps|Maskrey, Molly and Wang, Wallace|9781484233818", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2015|The Swift Programming Language|10.1007/978-1-4842-0400-9_17|46|4|James Goodwill and Wesley Matlock|adcd58959ad2a95ba8aa1bb09326d3ed066aa9e8\n2016|An Empirical Study on the Usage of the Swift Programming Language|10.1109/SANER.2016.66|23|0|Marcel Rebouças and G. Pinto and Felipe Ebert and Weslley Torres and Alexander Serebrenik and F. C. Filho|b4be0cea3fc620a8f1028a4c8acf102e329f38a6\n2018|How Swift Developers Handle Errors|10.1145/3196398.3196428|15|0|Nathan Cassee and G. Pinto and F. C. Filho and Alexander Serebrenik|4692e9bacf9d1697c7360f04397b470bd2b4c537\n2015|Swift vs. Objective-C: A New Programming Language|10.9781/ijimai.2015.3310|12|0|Cristian González García and Jordán Pascual Espada and B. C. P. García-Bustelo and J. M. C. Lovelle|1da51dd08d172e1aec5db020817067a2cda12973\n2017|Visualizing Swift Projects as Cities|10.1109/ICSE-C.2017.115|5|0|Rafael Nunes and Marcel Rebouças and Francisco Soares-Neto and F. C. Filho|f23f315af89fa658b106470f999f96aec8730c6f\n2020|SWAN: a static analysis framework for swift|10.1145/3368089.3417924|5|0|Daniil Tiganov and Jeff Cho and Karim Ali and Julian Dolby|6494787cc4de4a9ff732b3f16d3f3059752f09a9\n2017|Dynamic atomicity: optimizing swift memory management|10.1145/3133841.3133843|4|1|D. Ungar and D. Grove and H. Franke|8439f7a913630eea665f55bfe35fb5b95b8ad3f5\n2014|Using Nion Swift for Data Collection, Analysis and Display|10.1017/S1431927614007272|3|0|C. Meyer and N. Dellby and Z. Dellby and T. Lovejoy and M. Sarahan and G. Skone and O. Krivanek|c2a158f586b5f2db34f5cbb625f59bd419b2099d\n2015|Beginning Swift Games Development for iOS|10.1007/978-1-4842-0400-9|3|0|James Goodwill and Wesley Matlock|99b7243cb20522080cf5ba1df32371278b055f34\n2019|Optimization of swift protocols|10.1145/3360590|2|0|R. Barik and Manu Sridharan and M. Ramanathan and Milind Chabbi|0187acc7b8ad265dd57ec91b415b8c59ccfb0a98\n2020|Trans-Compiler based Mobile Applications code converter: swift to java|10.1109/NILES50944.2020.9257928|2|0|Ahmad A. Muhammad and Amira G. Mahmoud and Shaymaa S. Elkalyouby and Rameez B. Hamza and A. Yousef|25ff1d466b8c50ebc94a57e0a8a0a9a5663a2e53\n2020|An SKOS-Based Vocabulary on the Swift Programming Language|10.1007/978-3-030-62466-8_16|2|0|Christian Grévisse and S. Rothkugel|c70241f4e51e7f1196655dfd6325e310e88ff373\n2015|EL FUTURO DE APPLE: SWIFT VERSUS OBJECTIVE-C|10.14483/UDISTRITAL.JOUR.REDES.2015.2.A01|1|0|Cristian González García and B. J. P. Espada and Cristina Pelayo G-Bustelo and J. M. C. Lovelle|2f7f41682a955c403fb854c7b050e0f36be4f409\n2015|A Swift Introduction to Swift App Development (Abstract Only)|10.1145/2676723.2678281|1|0|Michael P. Rogers and W. Siever|7b99beb5efb01555560035b37e40b21fa655d4c0\n2016|An Introduction to Swift|10.1007/978-1-4842-2223-2_23|1|0|Molly K. Maskrey and Kim Topley and David Mark and Fredrik Olsson and Jeff LaMarche|278ef58012ab40dec51e86e5ad8a942f86c5fabc\n2015|Program the Internet of Things with Swift for iOS|10.1007/978-1-4842-1194-6|1|0|A. Bakir and Gheorghe Chesler and Manny de la Torriente|320e46cdb72465d8474765664650d3fbed5165a6\n2018|Introducing Automatic Time Stamping (ATS) with a Reference Implementation in Swift|10.1109/ISORC.2018.00028|1|0|Sean Hamilton and Dhiman Sengupta and Rajesh E. Gupta|de6f049ff887591e8445247c752a0bea1a03b278\n2015|The Swift Language|10.1007/978-1-4842-0650-8_1|1|0|A. Egges|587238b49d4bf004dc20bac441ebbc692e69a144\n2017|Promotion of Educational Effectiveness by Translation-based Programming Language Learning Using Java and Swift|10.24251/HICSS.2017.016|1|0|Juhua Li and Kazunori Sakamoto and H. Washizaki and Y. Fukazawa|06a96400093f770fc2ec6e978e89adec99321162" }, "swizzle": { "title": "swizzle", "appeared": 2018, "type": "esolang", "creators": [ "Robert Swierczek" ], "example": [ "{M\n 1=i\n (i 100 <=?\n (i 15 % 0 ==?\n \"FizzBuzz\" P;\n :(i 3 % 0 ==?\n \"Fizz\" P;\n :(i 5 % 0 ==?\n \"Buzz\" P;\n :\n i \"%d\" P;;\n )))\n 10 \"%c\" P;;\n i++;\n @)\n}\nM" ], "githubRepo": { "firstCommit": 2018, "stars": 22, "subscribers": 5, "created": 2018, "updated": 2022, "description": "An esoteric programming language", "forks": 2, "issues": 1, "url": "https://github.com/rswier/swizzle" }, "repoStats": { "firstCommit": 2018, "commits": 27, "committers": 5, "files": 21 }, "isbndb": "" }, "swrl": { "title": "Semantic Web Rule Language", "appeared": 2004, "type": "xmlFormat", "standsFor": "Semantic Web Rule Language", "example": [ " \n \n \n \n x1\n x2\n \n \n x2\n x3\n \n \n \n \n x1\n x3\n \n \n" ], "wikipedia": { "summary": "The Semantic Web Rule Language (SWRL) is a proposed language for the Semantic Web that can be used to express rules as well as logic, combining OWL DL or OWL Lite with a subset of the Rule Markup Language (itself a subset of Datalog).The specification was submitted in May 2004 to the W3C by the National Research Council of Canada, Network Inference (since acquired by webMethods), and Stanford University in association with the Joint US/EU ad hoc Agent Markup Language Committee. The specification was based on an earlier proposal for an OWL rules language.SWRL has the full power of OWL DL, but at the price of decidability and practical implementations. However, decidability can be regained by restricting the form of admissible rules, typically by imposing a suitable safety condition.Rules are of the form of an implication between an antecedent (body) and consequent (head). The intended meaning can be read as: whenever the conditions specified in the antecedent hold, then the conditions specified in the consequent must also hold.", "backlinksCount": 158, "pageId": 6168884, "dailyPageViews": 69, "appeared": 2005, "url": "https://en.wikipedia.org/wiki/Semantic_Web_Rule_Language" }, "hopl": "https://hopl.info/showlanguage.prx?exp=7647" }, "swym": { "title": "Swym", "appeared": 2012, "type": "pl", "creators": [ "Laurie Cheers" ], "website": "https://web.archive.org/web/20201126155554/http://cheersgames.com/swym/wiki/index.php?title=Main_Page", "country": [ "Unknown" ], "originCommunity": [ "Cheers Games" ], "githubRepo": { "stars": 15, "forks": 1, "subscribers": 5, "created": 2012, "updated": 2017, "description": "The Swym programming language", "url": "https://github.com/LaurieCheers/Swym" }, "repoStats": { "firstCommit": 2012, "commits": 95, "committers": 3, "files": 369 } }, "sybyl-notation": { "title": "SYBYL line notation", "appeared": 1997, "type": "textDataFormat", "example": [ "C[1]H:CH:CH:CH:CH:CH:@1" ], "wikipedia": { "url": "https://en.wikipedia.org/wiki/SYBYL_line_notation" } }, "symbal": { "title": "SYMBAL", "appeared": 1972, "type": "pl", "description": "Formula Manipulation Language", "reference": [ "https://dl.acm.org/doi/10.1145/1086793.1086799" ], "hopl": "https://hopl.info/showlanguage.prx?exp=350", "semanticScholar": "" }, "symbmath": { "title": "SymbMath", "appeared": 1999, "type": "pl", "reference": [ "http://mathforum.org/kb/message.jspa?messageID=1552736" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2547", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "symbol": { "title": "SYMBOL", "appeared": 1971, "type": "pl", "documentation": [ "https://docs.symbol.dev/handbook/all-coding-guidelines.html" ], "reference": [ "https://semanticscholar.org/paper/5f4c1ed840783affd959097c5e6fd06350c7dc38" ], "wikipedia": { "related": [ "isbn" ], "summary": "A symbol is a mark, sign or word that indicates, signifies, or is understood as representing an idea, object, or relationship. Symbols allow people to go beyond what is known or seen by creating linkages between otherwise very different concepts and experiences. All communication (and data processing) is achieved through the use of symbols. Symbols take the form of words, sounds, gestures, ideas or visual images and are used to convey other ideas and beliefs. For example, a red octagon may be a symbol for \"STOP\". On a map, a blue line might represent a river. Numerals are symbols for numbers. Alphabetic letters may be symbols for sounds. Personal names are symbols representing individuals. A red rose may symbolize love and compassion. The variable 'x', in a mathematical equation, may symbolize the position of a particle in space. In cartography, an organized collection of symbols forms a legend for a map.", "backlinksCount": 4174, "pageId": 37673, "dailyPageViews": 1206, "created": 2002, "appeared": 1953, "url": "https://en.wikipedia.org/wiki/Symbol" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3238", "wordRank": 3244, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1983|Generation of Compiler Symbol Processing Mechanisms from Specifications|10.1145/69624.69625|33|0|S. Reiss|544e1f2013102ab0a28b4b6354c9372f622ebbd6\n1971|The hardware-implemented high-level machine language for SYMBOL|10.1145/1478786.1478866|28|1|G. Chesley and William R. Smith|c7783e94726668ad73f1919ede86b5386390a55a\n1966|On the implementation of AMBIT, a language for symbol manipulation|10.1145/365758.365765|18|0|C. Christensen|e6056ceb7e1012584680acf407c4de2b9f07f70e\n1981|Reflections on the High-Level Language Symbol Computer System|10.1109/C-M.1981.220530|16|0|D. Ditzel|c9c456acc44c6ca1e7e40a98a8779e939069c1b7\n1976|Abstraction and Verification in Alphard: A Symbol Table Example.|10.1007/978-1-4612-5979-4_11|14|0|R. L. London and M. Shaw and W. Wulf|3bcc141254b55417bdc1606542fb77bc5274ee50\n1973|Introduction to the SYMBOL 2R programming language|10.1145/800121.803928|12|1|H. Richards and C. Wright|bfc08716928f2876ff78a75d364df1537438c3c5\n1965|Programming Languages for Non-Numeric Processing—1: examples of symbol manipulation in the AMBIT Programming Language|10.1145/800197.806049|10|0|C. Christensen|f2c2c6c245da35c91ea58518a24cc627f2b65ead\n1973|High-level language translation in SYMBOL 2R|10.1145/800121.803926|9|1|J. Anderberg and C. L. Smith|27284751367b7246db2daa7a3245c247094993e4\n1966|Panon-1B: A programming language for symbol manipulation|10.1007/BF02575695|9|0|A. Caracciolo di Forino and L. Spanedda and N. Wolkenstein|373d99b2855da15ce9a33e1a90442396a2f62a90\n1899|The physical attributes and testing aspects of the symbol system|10.1145/1478786.1478868|8|0|Brooks E. Cowart and R. Rice and S. Lundstrom|1b9b2177f9e3fa8b76ce7fd5239c671fedbe2a49\n1987|Flexible symbol table structures for compiling C++|10.1002/spe.4380170803|6|0|Stephen C. Dewhurst|dbe31ee1e8958e736ce2803bdec9b4c525e4be60\n1962|A string language for symbol manipulation based on ALGOL 60|10.1145/366243.366745|6|0|J. Wegstein and W. W. Youden|de114e46faae7eff6390d13b0a1b1b7870cb4139\n1966|PANON-1B: A programming language for symbol manipulation|10.1145/800005.807956|6|0|A. C. D. Forino and L. Spanedda and N. Wolkenstein|558c3be32d038f51e0f87f8bc815ab5b04d155de\n2017|Towards Better Symbol Resolution for C/C++ Programs: A Cluster-Based Solution|10.1109/SCAM.2017.15|5|0|Richárd Szalay and Z. Porkoláb and Dániel Krupp|9fea27c612596c2e5ab2715ff8ad05ec4dfeb696\n1973|Program execution in the SYMBOL 2R computer|10.1145/800121.803927|4|0|P. C. Hutchison and K. Ethington|b5a10f7bb751142cadaee8d5ee15db8bce2df2bc\n2007|Icon, index, symbol and denotation, connotation, metasign|10.1515/SEM.2007.063|4|0|Kumiko Tanaka-Ishii and Yuichiro Ishii|6f28a46df7fdf298ec5e04f523144a694c632d18\n1899|SYMBOL hardware debugging facilities|10.1145/1478873.1478919|3|0|M. Calhoun|ffb01faa4e12692c95aab94d5547e3638367c7ad\n1982|The Use of a Symbol Processing Computer Language in Point Estimation of Parameters and in Construction of Confidence Intervals|10.1002/BIMJ.4710240206|3|0|H. Quednau|30290d6a3d566c194d18f76e5ca1a5caa8491df6\n1966|Symbol Manipulative Programming For Bibliographic Data Processing on Small Computer|10.5860/CRL_27_02_95|3|0|F. G. Kilgour|4b674523b2cd0fe44b5812e0cd13f17501e6366c" }, "symbolic-assembly": { "title": "SYMBOLIC ASSEMBLY", "appeared": 1956, "type": "assembly", "reference": [ "https://escholarship.org/content/qt4cn1c702/qt4cn1c702.pdf" ], "originCommunity": [ "IBM" ], "wikipedia": { "summary": "The Symbolic Assembly Program (SAP) is an assembler program for the IBM 704 computer. It was written by Roy Nutt at United Aircraft Corporation, and was distributed by the SHARE user's group beginning in 1956 as the Share Assembly Program. SAP succeeded an earlier program called NYAP1 (New York Assembly Program 1), which it closely resembled, and became the standard assembler for 704 users. It \"set the external form of an assembly language that was to be a model for all its successors and which persists almost unchanged to the present day.\"", "backlinksCount": 9, "pageId": 57068636, "dailyPageViews": 3, "appeared": 1956, "url": "https://en.wikipedia.org/wiki/Symbolic_Assembly_Program" }, "hopl": "https://hopl.info/showlanguage.prx?exp=131" }, "sympl": { "title": "SYMPL", "appeared": 1970, "type": "pl", "country": [ "United States" ], "wikipedia": { "related": [ "jovial", "fortran" ], "summary": "SYMPL is an obsolete programming language developed by the Control Data Corporation (CDC) for use on the CDC 6000 series computer systems in the 1970s and 1980s. It was based on a subset of CDCs version of JOVIAL, as an alternative to assembly language. A number of important CDC software products were implemented in SYMPL, including compilers, libraries, a full-screen editor, and major subsystems. SYMPL is a compiled, imperative, and procedural language. Compared to the Fortran of the day, SYMPL supports: Stronger data typing - All variables must be declared prior to use, Data structures - Including \"based\" dynamically allocated structures, Structured programming constructs, Nested procedures, In-fix \"bead\" (bit) and character manipulation A simple macro facilitySimplifications compared to JOVIAL include: fewer built-in data types, no recursive calls to procedures, and no COMPOOL concept.", "pageId": 5029025, "created": 2006, "backlinksCount": 7, "revisionCount": 21, "dailyPageViews": 6, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/SYMPL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=699", "fileType": "text", "centralPackageRepositoryCount": 0 }, "sympy": { "title": "SymPy", "appeared": 2007, "type": "library", "website": "https://www.sympy.org/", "domainName": { "registered": 2007, "awisRank": { "2022": 160824 }, "name": "sympy.org" }, "githubRepo": { "firstCommit": 2007, "stars": 9361, "forks": 3688, "subscribers": 283, "created": 2010, "updated": 2022, "description": "A computer algebra system written in pure Python", "issues": 4459, "url": "https://github.com/sympy/sympy" }, "twitter": "https://twitter.com/sympy" }, "synapse": { "title": "SYNAPSE", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/20c4d5f1148f4c058189ae2502a402045aa96069" ], "wikipedia": { "summary": "SyNAPSE is a DARPA program that aims to develop electronic neuromorphic machine technology, an attempt to build a new kind of cognitive computer with form, function, and architecture similar to the mammalian brain. Such artificial brains would be used in robots whose intelligence would scale with the size of the neural system in terms of total number of neurons and synapses and their connectivity. SyNAPSE is a backronym standing for Systems of Neuromorphic Adaptive Plastic Scalable Electronics. The name alludes to synapses, the junctions between biological neurons. The program is being undertaken by HRL Laboratories (HRL), Hewlett-Packard, and IBM Research. In November 2008, IBM and its collaborators were awarded $4.9 million in funding from DARPA while HRL and its collaborators were awarded $5.9 million in funding from DARPA. For the next phase of the project, DARPA added $16.1 million more to the IBM effort while HRL received an additional $10.7 million. In 2011, DARPA added $21 million more to the IBM project. and an additional $17.9 million to the HRL project. The SyNAPSE team for IBM is led by Dharmendra Modha, manager of IBM's cognitive computing initiative. The SyNAPSE team for HRL is led by Narayan Srinivasa, manager of HRL's Center for Neural and Emergent Systems.The initial phase of the SyNAPSE program developed nanometer scale electronic synaptic components capable of adapting the connection strength between two neurons in a manner analogous to that seen in biological systems (Hebbian learning), and simulated the utility of these synaptic components in core microcircuits that support the overall system architecture. Continuing efforts will focus on hardware development through the stages of microcircuit development, fabrication process development, single chip system development, and multi-chip system development. In support of these hardware developments, the program seeks to develop increasingly capable architecture and design tools, very large-scale computer simulations of the neuromorphic electronic systems to inform the designers and validate the hardware prior to fabrication, and virtual environments for training and testing the simulated and hardware neuromorphic systems.", "backlinksCount": 27, "pageId": 30292887, "dailyPageViews": 71, "created": 2011, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/SyNAPSE" }, "hopl": "https://hopl.info/showlanguage.prx?exp=6706", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2007|Birkhäuser|The Immune Synapse as a Novel Target for Therapy (Progress in Inflammation Research)||9783764382957\n20210616|Springer Nature|Beginning Azure Synapse Analytics|Bhadresh Shiyal|9781484270615\n29-04-2022|Packt Publishing|Azure Synapse Analytics Cookbook|Gaurav Agarwal, Meenakshi Muralidharan, Rohini Srivathsa|9781803245577" }, "synchronized-multimedia-integration-language": { "title": "SMIL", "appeared": 1997, "type": "pl", "wikipedia": { "related": [ "html", "svg", "javascript", "musicxml", "nested-context-language" ], "summary": "Synchronized Multimedia Integration Language (SMIL ()) is a World Wide Web Consortium recommended Extensible Markup Language (XML) markup language to describe multimedia presentations. It defines markup for timing, layout, animations, visual transitions, and media embedding, among other things. SMIL allows presenting media items such as text, images, video, audio, links to other SMIL presentations, and files from multiple web servers. SMIL markup is written in XML, and has similarities to HTML.", "created": 2001, "backlinksCount": 533, "pageId": 28704, "revisionCount": 315, "dailyPageViews": 101, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/Synchronized_Multimedia_Integration_Language" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "syndicate": { "title": "syndicate", "appeared": 2016, "type": "pl", "website": "http://syndicate-lang.org", "domainName": { "registered": 2016, "awisRank": { "2022": 10475189 }, "name": "syndicate-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n13381170|Syn·di·cate: actor-based concurrent language implemented in Racket/JavaScript|http://syndicate-lang.org/|2017-01-12 10:13:31 UTC|1484216011|aalireza|0|3" }, "synergist": { "title": "synergist", "appeared": 1986, "type": "pl", "description": "The Synergist language was created by a crew out of Michigan (USA) somewhere around 1986 or 1987. A guy named Kingsbury (can't remember his first name, but he's the brother of Digital Equipment Corporation guru Dan Kingsbury at https://networkingdynamics.com), was one of the principals in the group. Work on the project stopped by 1990." }, "synglish": { "title": "SYNGLISH", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/8c01670a5c0788a247c16b73c7660c2e9f7abb66" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3807", "centralPackageRepositoryCount": 0 }, "synon": { "title": "Synon", "appeared": 1986, "type": "pl", "wikipedia": { "related": [ "cobol", "csharp", "java", "ibm-rpg" ], "summary": "Synon was a software company which, at its height, dominated the worldwide market for third-party application development tools for the IBM System i (formerly AS/400) platform. Its products continue to be widely used in that sector today, distributed and supported by CA Inc.. Synon pioneered what is now sometimes called Architected Rapid Application Development (ARAD).", "created": 2004, "backlinksCount": 8, "pageId": 440599, "revisionCount": 93, "dailyPageViews": 26, "appeared": 1984, "url": "https://en.wikipedia.org/wiki/Synon" }, "hopl": "https://hopl.info/showlanguage.prx?exp=3435", "centralPackageRepositoryCount": 0 }, "synproc": { "title": "SYNPROC", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/e3d95f29f65dfbd24376403b75a7008ede6f20e0" ], "hopl": "https://hopl.info/showlanguage.prx?exp=6528", "centralPackageRepositoryCount": 0 }, "syntex": { "title": "SYNTEX", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ea6deec98c58f3bb38bfa0c6ede5490261fe822e" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4131", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "syntol": { "title": "SYNTOL", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a800ceddfe61a39c743837a36521d0b0ae3662dc" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2721", "centralPackageRepositoryCount": 0 }, "sysml": { "title": "SysML", "appeared": 2000, "type": "pl", "standsFor": "Systems Modeling Language", "wikipedia": { "related": [ "uml", "energese-notation" ], "summary": "The Systems Modeling Language (SysML) is a general-purpose modeling language for systems engineering applications. It supports the specification, analysis, design, verification and validation of a broad range of systems and systems-of-systems. SysML was originally developed by an open source specification project, and includes an open source license for distribution and use. SysML is defined as an extension of a subset of the Unified Modeling Language (UML) using UML's profile mechanism.", "pageId": 4883003, "dailyPageViews": 174, "created": 2006, "backlinksCount": 294, "revisionCount": 300, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/Systems_Modeling_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nA Practical Guide to SysML: The Systems Modeling Language|2008|Sanford Friedenthal|18339946|3.85|34|3\nSysml for Systems Engineering|2007|Jon Holt|3421557|3.50|4|0\nSystems Engineering with SysML/UML: Modeling, Analysis, Design|2008|Tim Weilkiens|2228839|3.75|20|0\nSysML Distilled: A Brief Guide to the Systems Modeling Language|2013|Lenny Delligatti|27430925|4.17|23|0\nSystems Engineering with Sysml/UML|2004|Tim Weilkiens|23097541|3.00|1|0\nSysml Distilled: A Brief Guide to the Systems Modeling Language|2013|Lenny Delligatti|41627127|4.00|1|0\nSysml for Systems Engineering: A Model-Based Approach|2013|Jon Holt|26442042|4.00|1|0\nSysML for Systems Engineering (Professional Applications of Computing)|2008|Jon Holt|40499990|3.00|1|0\nModel-Based Systems Engineering with OPM and SysML||Dov Dori|51180902|0.0|0|0\nVerification and Validation in Systems Engineering: Assessing UML/SysML Design Models|2010|Mourad Debbabi|15403382|0.0|0|0\nModel-Based Systems Engineering with OPM and SysML|2015|Dov Dori|46460168|2.00|1|0\nPractical Model-based Systems Engineering with SysML||PhD Oliver Alt|60459394|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n2016|Springer|Model-Based Systems Engineering with OPM and SysML|Dori, Dov|9781493932948\n20131108|Pearson Technology Group|SysML Distilled|Lenny Delligatti|9780133430332\n20090728|Springer Nature|Car Multimedia Systeme Modell-basiert testen mit SysML|Oliver Alt|9783834895677" }, "system-v-abi": { "title": "System V ABI", "appeared": 1983, "type": "binaryExecutable", "description": "An example of a symbol table can be found in the SysV Application Binary Interface (ABI) specification, which mandates how symbols are to be laid out in a binary file, so that different compilers, linkers and loaders can all consistently find and work with the symbols in a compiled object.", "reference": [ "https://software.intel.com/sites/default/files/article/402129/mpx-linux64-abi.pdf" ], "aka": [ "SysV ABI" ], "example": [ "Address Type Name\n00000020 a T_BIT\n00000040 a F_BIT\n00000080 a I_BIT\n20000004 t irqvec\n20000008 t fiqvec\n2000000c t InitReset" ] }, "systemverilog": { "title": "SystemVerilog", "appeared": 2002, "type": "pl", "documentation": [ "http://courses.eees.dei.unibo.it/LABMPHSENG/wp-content/uploads/2016/02/SystemVerilog_3.1a.pdf" ], "originCommunity": [ "Synopsys" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "", "value": true }, "hasMultiLineComments": { "example": "/* A comment\n*/", "value": true }, "hasWhileLoops": { "example": "", "value": true }, "hasClasses": { "example": "", "value": true }, "hasConstants": { "example": "", "value": true }, "hasFunctions": { "example": "", "value": true }, "hasInheritance": { "example": "", "value": true }, "hasConditionals": { "example": "", "value": true }, "hasOctals": { "example": "// ([1-9][_0-9]*)?\\s*\\'[sS]?[oO]\\s*[xXzZ?0-7][_xXzZ?0-7]*", "value": true }, "hasHexadecimals": { "example": "// ([1-9][_0-9]*)?\\s*\\'[sS]?[hH]\\s*[xXzZ?0-9a-fA-F][_xXzZ?0-9a-fA-F]*", "value": true }, "hasFloats": { "example": "// (\\d+\\.\\d*|\\.\\d+|\\d+)[eE][+-]?\\d+[lL]?", "value": true }, "hasIntegers": { "example": "// ([1-9][_0-9]*)?\\s*\\'[sS]?[dD]\\s*[xXzZ?0-9][_xXzZ?0-9]*", "value": true }, "hasBinaryNumbers": { "example": "// ([1-9][_0-9]*)?\\s*\\'[sS]?[bB]\\s*[xXzZ?01][_xXzZ?01]*", "value": true }, "lineCommentToken": [ [ "//" ] ], "multiLineCommentTokens": [ [ "/*", "*/" ] ], "keywords": [ "accept_on", "alias", "always", "always_comb", "always_ff", "always_latch", "and", "assert", "assign", "assume", "automatic", "before", "begin", "bind", "bins", "binsof", "bit", "break", "buf", "bufif0", "bufif1", "byte", "case", "casex", "casez", "cell", "chandle", "checker", "class", "clocking", "cmos", "config", "const", "constraint", "context", "continue", "cover", "covergroup", "coverpoint", "cross", "deassign", "default", "defparam", "design", "disable", "dist", "do", "edge", "else", "end", "endcase", "endchecker", "endclass", "endclocking", "endconfig", "endfunction", "endgenerate", "endgroup", "endinterface", "endmodule", "endpackage", "endprimitive", "endprogram", "endproperty", "endspecify", "endsequence", "endtable", "endtask", "enum", "event", "eventually", "expect", "export", "extends", "extern", "final", "first_match", "for", "force", "foreach", "forever", "fork", "forkjoin", "function", "generate", "genvar", "global", "highz0", "highz1", "if", "iff", "ifnone", "ignore_bins", "illegal_bins", "implements", "implies", "import", "incdir", "include", "initial", "inout", "input", "inside", "instance", "int", "integer", "interconnect", "interface", "intersect", "join", "join_any", "join_none", "large", "let", "liblist", "library", "local", "localparam", "logic", "longint", "macromodule", "matches", "medium", "modport", "module", "nand", "negedge", "nettype", "new", "nexttime", "nmos", "nor", "noshowcancelled", "not", "notif0", "notif1", "null", "or", "output", "package", "packed", "parameter", "pmos", "posedge", "primitive", "priority", "program", "property", "protected", "pull0", "pull1", "pulldown", "pullup", "pulsestyle_ondetect", "pulsestyle_onevent", "pure", "rand", "randc", "randcase", "randsequence", "rcmos", "real", "realtime", "ref", "reg", "reject_on", "release", "repeat", "restrict", "return", "rnmos", "rpmos", "rtran", "rtranif0", "rtranif1", "s_always", "s_eventually", "s_nexttime", "s_until", "s_until_with", "scalared", "sequence", "shortint", "shortreal", "showcancelled", "signed", "small", "soft", "solve", "specify", "specparam", "static", "string", "strong", "strong0", "strong1", "struct", "super", "supply0", "supply1", "sync_accept_on", "sync_reject_on", "table", "tagged", "task", "this", "throughout", "time", "timeprecision", "timeunit", "tran", "tranif0", "tranif1", "tri", "tri0", "tri1", "triand", "trior", "trireg", "type", "typedef", "union", "unique", "unique0", "unsigned", "until", "until_with", "untyped", "use", "uwire", "var", "vectored", "virtual", "void", "wait", "wait_order", "wand", "weak", "weak0", "weak1", "while", "wildcard", "wire", "with", "within", "wor", "xnor", "xor" ], "wikipedia": { "example": [ "class eth_frame;\n // Definitions as above\n covergroup cov;\n coverpoint dest {\n bins bcast[1] = {48'hFFFFFFFFFFFF};\n bins ucast[1] = default;\n }\n coverpoint f_type {\n bins length[16] = { [0:1535] };\n bins typed[16] = { [1536:32767] };\n bins other[1] = default;\n }\n psize: coverpoint payload.size {\n bins size[] = { 46, [47:63], 64, [65:511], [512:1023], [1024:1499], 1500 };\n }\n\n sz_x_t: cross f_type, psize;\n endgroup\nendclass" ], "related": [ "verilog", "vhdl", "openvera", "java", "c", "property-specification-language", "axiom" ], "summary": "SystemVerilog, standardized as IEEE 1800, is a hardware description and hardware verification language used to model, design, simulate, test and implement electronic systems. SystemVerilog is based on Verilog and some extensions, and since 2008 Verilog is now part of the same IEEE standard. It is commonly used in the semiconductor and electronic design industry as an evolution of Verilog.", "pageId": 2540686, "created": 2005, "backlinksCount": 305, "revisionCount": 385, "dailyPageViews": 225, "appeared": 2002, "fileExtensions": [ "header", "file" ], "url": "https://en.wikipedia.org/wiki/SystemVerilog" }, "githubLanguage": { "fileExtensions": [ "sv", "svh", "vh" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "verilog", "codemirrorMode": "verilog", "codemirrorMimeType": "text/x-systemverilog", "tmScope": "source.systemverilog", "repos": 9972, "id": "SystemVerilog" }, "githubBigQuery": { "repos": 1052, "users": 872, "id": "SystemVerilog" }, "monaco": "systemverilog", "pygmentsHighlighter": { "filename": "hdl.py", "fileExtensions": [ "sv", "svh" ], "id": "systemverilog" }, "linguistGrammarRepo": { "sampleCount": 4, "example": [ "function integer log2;\n input integer x;\n begin\n x = x-1;\n for (log2 = 0; x > 0; log2 = log2 + 1)\n x = x >> 1;\n end\nendfunction\n" ], "url": "https://github.com/TheClams/SystemVerilog" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:SystemVerilog", "fileType": "text", "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nSystemVerilog for Verification: A Guide to Learning the Testbench Language Features|2006|Chris Spear|4423331|4.19|16|1\nSystemverilog for Verification: A Guide to Learning the Testbench Language Features|2008|Christian B. Spear|16459520|4.71|7|1\nSystemverilog for Verification: A Guide to Learning the Testbench Language Features|2006|Chris Spear|959746|4.22|9|0", "isbndb": "year|publisher|title|authors|isbn13\n2012|Springer|SystemVerilog for Verification: A Guide to Learning the Testbench Language Features|Spear, Chris and Tumbush, Greg|9781461407140\n20060915|Springer Nature|SystemVerilog for Verification|Chris Spear|9780387270388\n2021|Packt Publishing|FPGA Programming for Beginners: Bring your ideas to life by creating hardware designs and electronic circuits with SystemVerilog|Bruno, Frank|9781789805413\n2021|Packt Publishing|FPGA Programming for Beginners: Bring your ideas to life by creating hardware designs and electronic circuits with SystemVerilog|Bruno, Frank|9781789807790\n2018|Wiley|FPGA Prototyping by SystemVerilog Examples: Xilinx MicroBlaze MCS SoC Edition|Chu, Pong P.|9781119282709\n2014|CreateSpace Independent Publishing Platform|Logic Design and Verification Using SystemVerilog|Thomas, Donald|9781500385781", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2017|Model-based design verification for embedded systems through SVOCL: an OCL extension for SystemVerilog|10.1007/s10617-017-9182-z|36|0|Muhammad Waseem Anwar and M. Rashid and F. Azam and M. Kashif|8a7f871e1b2f49cbf063a7d92f7b253a1be11a9e\n2019|A model-driven framework for design and verification of embedded systems through SystemVerilog|10.1007/s10617-019-09229-y|33|0|Muhammad Waseem Anwar and M. Rashid and F. Azam and M. Kashif and Wasi Haider Butt|fd1f66c3b18e1e704474946f8c3ad03404f5ecae\n2018|Verifying an Implementation of Genetic Algorithm on FPGA-SoC using SystemVerilog|10.3384/ECP171421095|1|0|Hayder Al-Hakeem and S. Karhu and J. Alander|8d919ca9f37b11536a68ee9998001efd7f0af503" }, "systemz": { "title": "IBM System z", "appeared": 2000, "type": "computingMachine", "wikipedia": { "related": [ "linux" ], "summary": "IBM System z (officially \"IBM z Systems\") is a family name used by IBM for all of its mainframe computers. In 2000, IBM renamed the existing System/390 to IBM eServer zSeries with the e depicted in IBM's red trademarked symbol, but because no specific machine names were changed for System/390, the zSeries name in common use refers only to the z900 and z990 generations of mainframes. In April 2006, with another generation of products, the official family was changed to IBM System z, which now includes both older IBM eServer zSeries models, the IBM System z9 models, the IBM System z10 models, and the newer IBM zEnterprise models. The IBM z13 is the last z Systems server to support running an operating system in ESA/390 architecture mode.", "pageId": 3968088, "dailyPageViews": 255, "created": 2018, "backlinksCount": 138, "revisionCount": 1, "appeared": 2000, "url": "https://en.wikipedia.org/wiki/IBM_System_z" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "t-lang": { "title": "t-lang", "appeared": 2019, "type": "pl", "creators": [ "Justin Hu" ], "reference": [ "https://www.reddit.com/r/ProgrammingLanguages/comments/ew0bjx/modules_in_t/" ], "githubRepo": { "firstCommit": 2019, "stars": 9, "subscribers": 3, "created": 2019, "updated": 2022, "description": "T is a C-like, module based programming language", "forks": 5, "issues": 38, "url": "https://github.com/JustinHuPrime/TCompiler" }, "repoStats": { "firstCommit": 2019, "commits": 1164, "committers": 7, "files": 651 } }, "t": { "title": "T", "appeared": 1980, "type": "pl", "country": [ "United States" ], "wikipedia": { "example": [ "(define-predicate pair?)\n (define-settable-operation (car pair))\n (define-settable-operation (cdr pair))\n (define (cons the-car the-cdr)\n (object nil\n ((pair? self) t)\n ((car self) the-car)\n ((cdr self) the-cdr)\n (((setter car) self new-car) (set the-car new-car))\n (((setter cdr) self new-cdr) (set the-cdr new-cdr))))" ], "related": [ "scheme", "eulisp", "joule", "c", "common-lisp" ], "summary": "The T programming language is a dialect of the Scheme programming language developed in the early 1980s by Jonathan A. Rees, Kent M. Pitman, and Norman I. Adams of Yale University as an experiment in language design and implementation. T's purpose is to test the thesis developed by Steele and Sussman in their series of papers about Scheme: that Scheme may be used as the basis for a practical programming language of exceptional expressive power, and that implementations of Scheme could perform better than other Lisp systems, and competitively with implementations of programming languages, such as C and BLISS, which are usually considered to be inherently more efficient than Lisp on conventional machine architectures. In 1987 Stephen Slade published the book \"The T Programming Language: A Dialect of LISP\". T contains some features that modern Scheme does not have. For example, T is object-oriented, and it has first-class environments, called locales, which can be modified non-locally and used as a module system. T has several extra special forms for lazy evaluation and flow control, as well as an equivalent to Common Lisp's setf. T, like Scheme, supports call-with-current-continuation, but it also has a more limited form called catch. From the T manual, a hypothetical implementation of cons could be: Through this example, we can see that objects in T are intimately related to closures and message-passing. A primitive called join puts two objects together, allowing for something resembling inheritance.", "pageId": 875484, "created": 2004, "backlinksCount": 36, "revisionCount": 52, "dailyPageViews": 21, "appeared": 1980, "url": "https://en.wikipedia.org/wiki/T_(programming_language)" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1019", "fileType": "text", "wordRank": 140, "centralPackageRepositoryCount": 0 }, "t2b": { "title": "t2b", "appeared": 2018, "type": "pl", "website": "https://thosakwe.github.io/t2b/index.html", "githubRepo": { "firstCommit": 2018, "stars": 374, "forks": 9, "subscribers": 12, "created": 2018, "updated": 2022, "description": "A wicked-powerful text macro language for building binary files.", "issues": 8, "url": "https://github.com/thosakwe/t2b" }, "repoStats": { "firstCommit": 2018, "commits": 34, "committers": 5, "files": 30 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n17289801|Show HN: T2b – A wicked-powerful text macro language for building binary files|2018-06-12 00:31:01 UTC|1528763461|thosakwe|52|117" }, "t3x": { "title": "T3X", "appeared": 1995, "type": "pl", "website": "http://www.t3x.org/", "reference": [ "https://news.ycombinator.com/item?id=14273177" ], "domainName": { "registered": 2000, "awisRank": { "2022": 11921361 }, "name": "t3x.org" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2549", "centralPackageRepositoryCount": 0, "semanticScholar": "" }, "tab": { "title": "tab", "appeared": 2015, "type": "pl", "website": "http://bitbucket.org/tkatchev/tab", "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n9055877|Show HN: The Tab programming language|2015-02-16 08:27:25 UTC|1424075245|otabdeveloper1|0|1" }, "tablam": { "title": "tablam", "appeared": 2020, "type": "queryLanguage", "creators": [ "Mario Montoya" ], "website": "http://www.tablam.org/", "domainName": { "registered": 2014, "awisRank": { "2022": 9825009 }, "name": "tablam.org" }, "example": [ "city ?where .population > 100_000 ?select .name, .country\npoints ?sort .x" ], "githubRepo": { "firstCommit": 2020, "stars": 132, "forks": 4, "subscribers": 7, "created": 2020, "updated": 2022, "description": "The practical relational programing language for data-oriented applications", "issues": 2, "url": "https://github.com/Tablam/TablaM" }, "repoStats": { "firstCommit": 2020, "commits": 230, "committers": 5, "files": 82 } }, "tablatal": { "title": "tablatal", "appeared": 2017, "type": "pl", "description": "This space-sensitive database format is designed to store a list of elements of the same length, accessible by id. The parser is 30 lines long, and allows for human-readable data structures for static sites such as Oscean, also see Indental. In the Tablatal file, the first line declares the key, the spacing between each key defines the length of the parameters for all subsequent lines.", "website": "https://wiki.xxiivv.com/#tablatal", "reference": [ "https://github.com/XXIIVV/Oscean" ], "domainName": { "name": "wiki.xxiivv.com" }, "example": [ "NAME AGE COLOR\nErica 12 Opal\nAlex 23 Cyan\nNike 34 Red\nRuca 45 Grey\nOr, [{name:Erica,Age:12,Color:Blue},{name:Alex,Age..}" ] }, "tableau-app": { "title": "Tableau Software", "appeared": 2003, "type": "application", "website": "https://www.tableau.com/", "domainName": { "registered": 1996, "awisRank": { "2022": 1648 }, "name": "tableau.com" }, "wikipedia": { "summary": "Tableau Software ( tab-LOH) is an interactive data visualization software company founded on January 2003 by Christian Chabot, Pat Hanrahan and Chris Stolte, in Mountain View, California. The company is currently headquartered in Seattle, Washington, United States focused on business intelligence. On June 10, 2019, Salesforce.com announced it would be acquiring Tableau.Chabot, Hanrahan and Stolte were researchers at the Department of Computer Science at Stanford University who specialized in visualization techniques for exploring and analyzing relational databases and data cubes. The company was started as a commercial outlet for research produced at Stanford between 1999-2002. Tableau products query relational databases, online analytical processing cubes, cloud databases, and spreadsheets to generate graph-type data visualizations. The products can also extract, store, and retrieve data from an in-memory data engine.", "backlinksCount": 126, "pageId": 19547325, "dailyPageViews": 1113, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/Tableau_Software" }, "twitter": "https://twitter.com/tableau" }, "tablog": { "title": "TABLOG", "appeared": 1984, "type": "pl", "reference": [ "https://semanticscholar.org/paper/feba5fea74f4bdaee572e422012d35da54aa6c4d" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2705", "centralPackageRepositoryCount": 0 }, "tabloid": { "title": "Tabloid", "appeared": 2020, "type": "esolang", "creators": [ "Linus Lee" ], "website": "https://tabloid.vercel.app", "domainName": { "name": "tabloid.vercel.app" }, "githubRepo": { "firstCommit": 2020, "stars": 269, "forks": 5, "subscribers": 4, "created": 2020, "updated": 2022, "description": "A minimal programming language inspired by clickbait headlines", "issues": 0, "url": "https://github.com/thesephist/tabloid" }, "repoStats": { "firstCommit": 2020, "commits": 35, "committers": 2, "files": 9 }, "rijuRepl": { "example": [ "YOU WON'T WANT TO MISS \"Hello, world\"\nPLEASE LIKE AND SUBSCRIBE\n" ], "id": "https://riju.codes/tabloid" } }, "tabsol": { "title": "TABSOL", "appeared": 1960, "type": "pl", "reference": [ "https://semanticscholar.org/paper/935925fdb843e18053639fedddd32ba92b85e5e1" ], "hopl": "https://hopl.info/showlanguage.prx?exp=142", "centralPackageRepositoryCount": 0 }, "tabtran": { "title": "TABTRAN", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/dd56ec8b7e1574191d4a155a06bd79d099aaf10a" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3245", "centralPackageRepositoryCount": 0 }, "tac": { "title": "TAC", "appeared": 1959, "type": "pl", "reference": [ "https://semanticscholar.org/paper/aaa63f95c0e7a5cf393ebbf5c5fd8b3a0846f299" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2550", "centralPackageRepositoryCount": 0 }, "tacl": { "title": "Tandem Advanced Command Language", "appeared": 1999, "type": "pl", "standsFor": "Tandem Advanced Command Language", "wikipedia": { "example": [ "?Section HELLO_BERNARD ROUTINE\n#OUTPUT Hello BERNARD" ], "related": [ "tal" ], "summary": "TACL (the Tandem Advanced Command Language) is the scripting programming language used in Tandem Computers. TACL is the shell.", "pageId": 1558785, "dailyPageViews": 18, "created": 2005, "backlinksCount": 6, "revisionCount": 60, "appeared": 1999, "url": "https://en.wikipedia.org/wiki/TACL" }, "helloWorldCollection": [ "Comment -- Hello World for TACL (Tandem Advanced Command Language)\n\n?tacl macro\n\n#OUTPUT Hello world" ], "tiobe": { "id": "TACL" }, "hopl": "https://hopl.info/showlanguage.prx?exp=1368", "fileType": "text", "centralPackageRepositoryCount": 0 }, "tacpol-programming-language": { "title": "TACPOL", "appeared": 1976, "type": "pl", "wikipedia": { "related": [ "pl-i" ], "summary": "TACPOL (Tactical Procedure Oriented Language) is a block structured programming language developed by the United States Army for the TACFIRE Tactical Fire Direction command and control application. TACPOL is similar to PL/I.", "created": 2005, "backlinksCount": 11, "pageId": 1719114, "revisionCount": 26, "dailyPageViews": 4, "appeared": 1975, "url": "https://en.wikipedia.org/wiki/TACPOL_%28programming_language%29" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2551", "centralPackageRepositoryCount": 0 }, "tactics": { "title": "TACTICS", "appeared": 1972, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c615c00538be3666bd9af59fb1620ab17a76e310" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7948", "wordRank": 8665, "centralPackageRepositoryCount": 0 }, "tads": { "title": "Text Adventure Development System", "appeared": 1988, "type": "application", "creators": [ "Michael J. Roberts" ], "website": "http://www.tads.org", "standsFor": "Text Adventure Development System", "domainName": { "registered": 2001, "awisRank": { "2022": 2519045 }, "name": "tads.org" }, "wikipedia": { "related": [ "unix", "linux", "inform", "c", "pascal", "java", "utf-8", "z-machine", "csharp" ], "summary": "Text Adventure Development System (TADS) is a prototype-based domain-specific programming language and set of standard libraries for creating interactive fiction (IF) games.", "pageId": 227991, "created": 2003, "backlinksCount": 71, "revisionCount": 130, "dailyPageViews": 29, "appeared": 1988, "url": "https://en.wikipedia.org/wiki/TADS" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "taf": { "title": "taf", "appeared": 2012, "type": "pl", "creators": [ "Manuel Simoni" ], "description": "A Lisp with row polymorphism, delimited continuations, and hygienic macros. [vaporware]", "reference": [ "http://www.manuelsimoni.net/taf/doc/plan.html" ], "hasLineComments": { "example": "; A comment", "value": true }, "hasComments": { "example": "; A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ ";" ] ], "example": [ "(define (make-person name email)\n #(person :name name :email email)) ; creates a person record with name and email fields\n\n(define-generic (to-string obj))\n(define-method (to-string (obj #(person :name :email))) ; matches persons and binds name and email field to local variables\n (concat (list name \" <\" email \">\")))\n\n(to-string (make-person \"Manuel\" \"msimoni@gmail.com\"))\n; ==> \"Manuel \"" ], "githubRepo": { "firstCommit": 2012, "stars": 56, "forks": 2, "subscribers": 9, "created": 2012, "updated": 2022, "description": "A Lisp with row polymorphism, delimited continuations, and hygienic macros. [vaporware]", "issues": 0, "url": "https://github.com/manuel/taf" }, "repoStats": { "firstCommit": 2012, "commits": 13, "committers": 1, "files": 12 } }, "tahoe-lafs": { "title": "Tahoe-LAFS", "appeared": 2007, "type": "filesystem", "wikipedia": { "summary": "Tahoe-LAFS (Tahoe Least-Authority File Store) is a free and open, secure, decentralized, fault-tolerant, distributed data store and distributed file system. It can be used as an online backup system, or to serve as a file or Web host similar to Freenet, depending on the front-end used to insert and access files in the Tahoe system. Tahoe can also be used in a RAID-like fashion using multiple disks to make a single large Redundant Array of Inexpensive Nodes (RAIN) pool of reliable data storage. The system is designed and implemented around the \"principle of least authority\" (POLA). Strict adherence to this convention is enabled by the use of cryptographic capabilities that provide the minimum set of privileges necessary to perform a given task by asking agents. A RAIN array acts as a storage volume; these servers do not need to be trusted by confidentiality or integrity of the stored data.", "backlinksCount": 152, "pageId": 24447073, "dailyPageViews": 50, "appeared": 2018, "url": "https://en.wikipedia.org/wiki/Tahoe-LAFS" } }, "taichi": { "title": "Taichi", "appeared": 2019, "type": "pl", "creators": [ "Yuanming Hu" ], "description": "Taichi Lang is an open-source, imperative, parallel programming language for high-performance numerical computation. It is embedded in Python and uses just-in-time (JIT) compiler frameworks, for example LLVM, to offload the compute-intensive Python code to the native GPU or CPU instructions.", "website": "https://taichi-lang.org/", "reference": [ "http://taichi.graphics/wp-content/uploads/2019/09/taichi_lang.pdf" ], "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// For CPU\nParallelize(int num_threads) // Multi-threading\nVectorize(int width) // Loop vectorization\n// For GPU\nBlockDim(int blockDim) // Specify GPU block size\n// For scratchpad optimization\nAssumeInRange(Expr base, int lower, int upper)\nCache(Expr)\n// Cache data into GPU L1 cache\nCacheL1(Expr)\nMore discussions on h" ], "githubRepo": { "firstCommit": 2016, "stars": 20126, "forks": 2031, "subscribers": 394, "created": 2016, "updated": 2022, "description": "Productive & portable high-performance programming in Python.", "issues": 581, "url": "https://github.com/taichi-dev/taichi" }, "repoStats": { "firstCommit": 2016, "commits": 11171, "committers": 272, "files": 1524 } }, "taijilang": { "title": "Taijilang", "appeared": 2014, "type": "pl", "creators": [ "Simeon Chaos" ], "website": "https://github.com/taijiweb/taijilang", "country": [ "Unknown" ], "writtenIn": [ "javascript" ], "githubRepo": { "stars": 64, "forks": 7, "subscribers": 13, "created": 2014, "updated": 2015, "description": "a customizable and extensible language with dynamic parser and meta compilation.", "url": "https://github.com/taijiweb/taijilang" }, "repoStats": { "firstCommit": 2014, "commits": 96, "committers": 2, "files": 176 } }, "taktentus": { "title": "taktentus", "appeared": 2015, "type": "esolang", "webRepl": [ "http://www.taktentus.doleczek.pl/" ], "reference": [ "https://esolangs.org/wiki/Taktentus" ], "example": [ "a := 15\na += -2" ] }, "tal": { "title": "TAL", "appeared": 2008, "type": "pl", "standsFor": "Transaction Application Language", "hasHexadecimals": { "example": "", "value": true }, "hasMultiLineComments": { "example": "", "value": true }, "hasComments": { "example": "", "value": true }, "wikipedia": { "related": [ "c", "algol", "pascal" ], "summary": "Transaction Application Language or TAL (originally \"Tandem Application Language\") is a block-structured, procedural language optimized for use on Tandem hardware. TAL resembles a cross between C and Pascal. It was the original system programming language for the Tandem CISC machines, which had no assembler. The design concept of TAL, an evolution of Hewlett Packard's SPL, was intimately associated and optimized with a microprogrammed CISC instruction set. Each TAL statement could easily compile into a sequence of instructions that manipulated data on a transient floating register stack. The register stack itself floated at the crest of the program's memory allocation and call stack. The language itself has the appearance of ALGOL or Pascal, with BEGIN and END statements. However, its semantics are far more like C. It does not permit indefinite levels of procedure nesting, it does not pass complex structured arguments by value, and it does not strictly type most variable references. Programming techniques are much like C using pointers to structures, occasional overlays, deliberate string handling and casts when appropriate. Available datatypes include 8 bit, 16 bit, 32 bit and (introduced later) 64 bit integers. Microcode level support was available for null terminated character strings. However, this is not commonly used. Originally the Tandem NonStop operating system was written in TAL. Recently much of it has been rewritten in C and TAL has been deprecated for new development. In the migration from CISC to RISC TAL was updated/replaced with pTAL - compilers allowed TAL to be accelerated/re-compiled into Native RISC Applications. In the current migration from RISC to Intel Itanium 2 TAL and pTAL has been replaced with epTAL, again - compilers allow TAL and pTAL code to be accelerated/re-compiled into native Itanium Applications. This article is based on material taken from the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the \"relicensing\" terms of the GFDL, version 1.3 or later.", "pageId": 1558864, "created": 2005, "backlinksCount": 9, "revisionCount": 22, "dailyPageViews": 17, "appeared": 2008, "url": "https://en.wikipedia.org/wiki/Transaction_Application_Language" }, "pygmentsHighlighter": { "filename": "tal.py", "fileExtensions": [ "tal" ], "id": "Tal" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:TAL", "hopl": "https://hopl.info/showlanguage.prx?exp=5587", "fileType": "text", "centralPackageRepositoryCount": 0 }, "tale": { "title": "TALE", "appeared": 1986, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6c47e00611809fa263c4c5ec9c93b3eba8c11361" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1279", "wordRank": 6089, "centralPackageRepositoryCount": 0 }, "tall": { "title": "TALL", "appeared": 1962, "type": "pl", "reference": [ "https://semanticscholar.org/paper/a2c76c944544b5fb7f23403b273ca5e02bd0f43c" ], "hopl": "https://hopl.info/showlanguage.prx?exp=173", "wordRank": 4724, "centralPackageRepositoryCount": 0 }, "tamgu": { "title": "tamgu", "appeared": 2019, "type": "pl", "creators": [ "Claude Roux" ], "githubRepo": { "firstCommit": 2019, "stars": 168, "subscribers": 8, "created": 2019, "updated": 2022, "description": "Tamgu (탐구), a FIL programming language: Functional, Imperative, Logical all in one for annotation and data augmentation", "forks": 13, "issues": 0, "url": "https://github.com/naver/tamgu" }, "repoStats": { "firstCommit": 2019, "commits": 537, "committers": 4, "files": 919 } }, "tampio": { "title": "tampio", "appeared": 2017, "type": "pl", "creators": [ "Iikka Hauhio" ], "nativeLanguage": "Finnish", "example": [ " Pienen luvun kertoma on\n riippuen siitä, onko se pienempi tai yhtä suuri kuin yksi,\n joko yksi\n tai pieni luku kerrottuna pienen luvun edeltäjän kertomalla.\n \n Luvun edeltäjä on se vähennettynä yhdellä.\n \n Olkoon pieni muuttuja uusi muuttuja, jonka arvo on nolla.\n \n Kun nykyinen sivu avautuu,\n pieneen muuttujaan luetaan luku\n ja nykyinen sivu näyttää pienen muuttujan arvon kertoman." ], "githubRepo": { "firstCommit": 2017, "stars": 203, "forks": 4, "subscribers": 5, "created": 2017, "updated": 2022, "description": "Tampio: An object-oriented programming language made to resemble Finnish", "issues": 0, "url": "https://github.com/fergusq/tampio" }, "repoStats": { "firstCommit": 2017, "commits": 228, "committers": 4, "files": 31 } }, "tangledown": { "title": "tangledown", "appeared": 2011, "type": "template", "creators": [ "Nicholas Bollweg" ], "description": "tangledown combines the simplicity of Markdown syntax with the sexiness of Tangle.js reactive documents and the loveliness of Rickshaw plots", "website": "http://bollwyvl.github.io/TangleDown/", "example": [ "If you eat t[number](cookies ' cookies'), you consume t[](calories ' calories'). This constitutes t[](dailypercent percent) of a daily intake of t[number](100 9000\n~~~~" ], "githubRepo": { "firstCommit": 2011, "stars": 30, "forks": 2, "subscribers": 4, "created": 2011, "updated": 2022, "description": "Markdown + Tangle.js + (someday) SymPy", "issues": 1, "url": "https://github.com/bollwyvl/tangledown" }, "repoStats": { "firstCommit": 2011, "commits": 28, "committers": 1, "files": 301 } }, "tao-lang": { "title": "Tao", "appeared": 2020, "type": "pl", "creators": [ "Joshua Barretto" ], "description": "A statically-typed functional language with polymorphism, typeclasses, sum types, pattern-matching, first-class functions, currying, good diagnostics, and much more!", "example": [ "fn factorial =\n | 0 => 1\n \\ y ~ x + 1 => y * factorial(x)" ], "githubRepo": { "stars": 408, "forks": 13, "subscribers": 10, "created": 2020, "updated": 2022, "description": "A statically-typed functional language with generics, typeclasses, sum types, pattern-matching, first-class functions, currying, algebraic effects, associated types, good diagnostics, etc.", "issues": 6, "firstCommit": 2020, "url": "https://github.com/zesterer/tao" }, "repoStats": { "firstCommit": 2020, "commits": 412, "committers": 8, "files": 143 }, "isbndb": "year|publisher|title|authors|isbn13\n2012|lulu.com|Tao Te Programming|Burns, Patrick|9781291130454\n2004|Addison-Wesley Professional|Tao of Network Security Monitoring, The: Beyond Intrusion Detection|Bejtlich, Richard|9780321246776" }, "tao": { "title": "TAO", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/381ddea5aaa085d5021140af4bc7fe948837f546" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1526", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2012|lulu.com|Tao Te Programming|Burns, Patrick|9781291130454\n2004|Addison-Wesley Professional|Tao of Network Security Monitoring, The: Beyond Intrusion Detection|Bejtlich, Richard|9780321246776" }, "tao3d": { "title": "tao3d", "appeared": 2003, "type": "pl", "creators": [ "Christophe de Dinechin" ], "description": "Tao3D is a programming language for interactive 3D.", "website": "http://tao3d.sourceforge.net/", "domainName": { "name": "tao3d.sourceforge.net" }, "related": [ "xl-lang" ], "example": [ "import SeasonsGreetingsTheme\n\ntheme \"SeasonsGreetings\"\nmain_title_slide \"The main title slide\",\n title \"Seasons Greetings theme\"\n subtitle \"A theme for the holidays\"\n\nsection_slide \"A section slide\",\n title \"Section title\"\n subtitle \"Section subtitle\"\n\nslide \"Bullet points\",\n * \"Bullet points\"\n ** \"More bullet points\"\n *** \"Deeper\"" ], "githubRepo": { "firstCommit": 2003, "stars": 167, "forks": 8, "subscribers": 17, "created": 2014, "updated": 2022, "description": "The Art of 3D, a new language for dynamic document description of real-time 3D animations", "issues": 5, "url": "https://github.com/c3d/tao3D" }, "repoStats": { "firstCommit": 2003, "commits": 9365, "committers": 26, "files": 1649 }, "twitter": "https://twitter.com/taodyne" }, "tap-code": { "title": "Tap code", "appeared": 1941, "type": "notation", "aka": [ "Knock Code" ], "wikipedia": { "related": [ "morse-code" ], "summary": "The tap code, sometimes called the knock code, is a way to encode text messages on a letter-by-letter basis in a very simple way. The message is transmitted using a series of tap sounds, hence its name. The tap code has been commonly used by prisoners to communicate with each other. The method of communicating is usually by tapping either the metal bars, pipes or the walls inside a cell.", "created": 2005, "backlinksCount": 97, "pageId": 3554669, "dailyPageViews": 212, "appeared": 1952, "url": "https://en.wikipedia.org/wiki/Tap_code" }, "centralPackageRepositoryCount": 0 }, "tap": { "title": "TAP", "appeared": 1988, "type": "protocol", "website": "https://testanything.org/", "standsFor": "Test Anything Protocol", "domainName": { "registered": 2007, "awisRank": { "2022": 9046034 }, "name": "testanything.org" }, "githubRepo": { "firstCommit": 2009, "stars": 37, "forks": 3, "subscribers": 17, "created": 2009, "updated": 2022, "description": "A draft standard for TAPv13 for submission to the IETF.", "issues": 1, "url": "https://github.com/TestAnything/test-anything-protocol" }, "repoStats": { "firstCommit": 2009, "commits": 10, "committers": 1, "files": 3 }, "wikipedia": { "example": [ "1..4\nok 1 - Input file opened\nnot ok 2 - First line of the input valid.\n More output from test 2. There can be\n arbitrary number of lines for any output\n so long as there is at least some kind\n of whitespace at beginning of line.\nok 3 - Read the rest of the file\n#TAP meta information\nnot ok 4 - Summarized correctly # TODO: not written yet" ], "related": [ "perl" ], "summary": "The Test Anything Protocol (TAP) is a protocol to allow communication between unit tests and a test harness. It allows individual tests (TAP producers) to communicate test results to the testing harness in a language-agnostic way. Originally developed for unit testing of the Perl interpreter in 1987, producers and parsers are now available for many development platforms.", "pageId": 7039060, "created": 2006, "backlinksCount": 19, "revisionCount": 122, "dailyPageViews": 56, "appeared": 1987, "url": "https://en.wikipedia.org/wiki/Test_Anything_Protocol" }, "pygmentsHighlighter": { "filename": "testing.py", "fileExtensions": [ "tap" ], "id": "TAP" }, "subreddit": [ { "memberCount": { "2017": 37, "2022": 81 }, "url": "https://reddit.com/r/testanythingprotocol" } ], "fileType": "na", "wordRank": 6828, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n2020|Springer|Tests and Proofs: 14th International Conference, TAP 2020, Held as Part of STAF 2020, Bergen, Norway, June 22–23, 2020, Proceedings (Programming and Software Engineering Book 12165)|Wolfgang Ahrendt and Heike Wehrheim|9783030509958\n2016|Springer|Tests and Proofs: 10th International Conference, TAP 2016, Held as Part of STAF 2016, Vienna, Austria, July 5-7, 2016, Proceedings (Lecture Notes in Computer Science Book 9762)|Bernhard K. Aichernig|9783319411354" }, "taql": { "title": "Table Query Language", "appeared": 1997, "type": "queryLanguage", "description": "The Table Query Language (TaQL) is an SQL-like high level language to do operations like selection, sort, and update on a casacore table. It is a very versatile language with full support for table columns containing array data. It has inherent support for masked arrays, units, and astronomical coordinates. It has a very rich set of functions (like cone search and array reduction) making it very suitable for astronomical applications. User defined functions can be added easily. It also has full support of grouping/aggregation and nested queries. An operation that can be expressed in a single function is the matching of two sky catalogues. It can be used from C++, Python, and the Casacore program taql.", "website": "https://casacore.github.io/casacore-notes/199.html", "reference": [ "https://casa.nrao.edu/aips2_docs/notes/199/node3.html" ], "aka": [ "tql" ], "jupyterKernel": [ "https://github.com/tammojan/taql-jupyter" ], "fileType": "text", "centralPackageRepositoryCount": 0 }, "tarmac": { "title": "Tarmac", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/62d49d2207de8b758216fc2e47961d96186bb737" ], "hopl": "https://hopl.info/showlanguage.prx?exp=4900", "centralPackageRepositoryCount": 0 }, "tarot": { "title": "tarot", "appeared": 2017, "type": "compiler", "description": "Tarot A self-hosted scheme compiler (to qcode) and virtual machine.", "website": "https://notabug.org/rain1/tarot-viewing", "fileType": "na", "centralPackageRepositoryCount": 0 }, "tasm": { "title": "TASM", "appeared": 1989, "type": "pl", "reference": [ "https://sourceforge.net/projects/guitasm8086/" ], "wikipedia": { "summary": "TASM may refer to: Turbo Assembler, Borland's x86 assembler Turbo Assembler, Omikron's Commodore 64-based 6502 assembler Table Assembler, a table driven cross-assembler for small microprocessors Tomahawk Anti-Ship Missile Tulsa Air and Space Museum & Planetarium The Amazing Spider-Man", "backlinksCount": 2, "pageId": 4888005, "dailyPageViews": 15, "url": "https://en.wikipedia.org/wiki/Tasm" }, "pygmentsHighlighter": { "filename": "asm.py", "fileExtensions": [ "asm", "ASM", "tasm" ], "id": "TASM" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2554", "centralPackageRepositoryCount": 0, "isbndb": "" }, "tawa": { "title": "Tawa", "appeared": 2021, "type": "pl", "creators": [ "Jan Blackquill" ], "githubRepo": { "firstCommit": 2021, "stars": 5, "forks": 0, "subscribers": 1, "created": 2021, "updated": 2022, "description": "Einfache funktionale Programmiersprache.", "issues": 0, "url": "https://github.com/tawasprache/kompilierer" }, "repoStats": { "firstCommit": 2021, "commits": 89, "committers": 2, "files": 78 } }, "taxa": { "title": "taxa", "appeared": 2014, "type": "pl", "creators": [ "Dan Motzenbecker" ], "githubRepo": { "firstCommit": 2014, "stars": 8, "forks": 1, "subscribers": 1, "created": 2014, "updated": 2021, "description": "A tiny language inside JavaScript to enforce type signatures.", "issues": 0, "url": "https://github.com/dmotz/taxa" }, "repoStats": { "firstCommit": 2014, "commits": 62, "committers": 1, "files": 8 }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n8282725|Show HN: Taxa – A tiny language inside JavaScript to enforce type signatures|2014-09-07 22:56:31 UTC|1410130591|dmotz|3|3" }, "taxis": { "title": "Taxis", "appeared": 1980, "type": "pl", "reference": [ "https://semanticscholar.org/paper/834d978e6ec4d8762be839fd18ea58c121bdf7d2" ], "hopl": "https://hopl.info/showlanguage.prx?exp=935", "centralPackageRepositoryCount": 0 }, "tbox-lib": { "title": "tbox-lib", "appeared": 2010, "type": "library", "website": "https://tboox.org", "domainName": { "registered": 2011, "awisRank": { "2022": 2511139 }, "name": "tboox.org" }, "githubRepo": { "firstCommit": 2010, "stars": 4054, "forks": 623, "subscribers": 203, "created": 2011, "updated": 2022, "description": "🎁 A glib-like multi-platform c library", "issues": 19, "url": "https://github.com/tboox/tbox" } }, "tcc": { "title": "tcc", "appeared": 1997, "type": "pl", "reference": [ "https://semanticscholar.org/paper/41bda42941c40decb8205f6fca5dddcacbfbd323" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3609", "centralPackageRepositoryCount": 0 }, "tcl": { "title": "Tcl", "appeared": 1988, "type": "pl", "creators": [ "John Ousterhout" ], "website": "http://www.tcl.tk", "documentation": [ "https://www.tcl.tk/doc/", "https://devdocs.io/tcl_tk/" ], "standsFor": "Tool Command Language", "fileExtensions": [ "tcl", "tbc" ], "domainName": { "awisRank": { "2022": 223557 }, "name": "tcl.tk" }, "releaseNotesUrl": "http://www.tcl.tk/software/tcltk/relnotes/index.tml?sc_format=wider", "visualParadigm": false, "hasComments": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasCaseInsensitiveIdentifiers": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "puts" ] ], "stringToken": [ [ "\"" ] ], "wikipedia": { "example": [ "oo::class create fruit {\n method eat {} {\n puts \"yummy!\"\n }\n}\noo::class create banana {\n superclass fruit\n constructor {} {\n my variable peeled\n set peeled 0\n }\n method peel {} {\n my variable peeled\n set peeled 1\n puts \"skin now off\"\n }\n method edible? {} {\n my variable peeled\n return $peeled\n }\n method eat {} {\n if {![my edible?]} {\n my peel\n }\n next\n }\n}\nset b [banana new]\n$b eat → prints \"skin now off\" and \"yummy!\"\nfruit destroy\n$b eat → error \"unknown command\"" ], "related": [ "awk", "lisp", "php", "tea", "powershell", "c", "python", "expect", "unicode", "regex", "java", "unix", "linux", "bourne-shell", "xotcl", "snit", "verilog", "vhdl", "udp", "mysql", "postgresql", "sqlite" ], "summary": "Tcl (pronounced \"tickle\" or tee cee ell, ) is a high-level, general-purpose, interpreted, dynamic programming language. It was designed with the goal of being very simple but powerful. Tcl casts everything into the mold of a command, even programming constructs like variable assignment and procedure definition. Tcl supports multiple programming paradigms, including object-oriented, imperative and functional programming or procedural styles. It is commonly used embedded into C applications, for rapid prototyping, scripted applications, GUIs, and testing. Tcl interpreters are available for many operating systems, allowing Tcl code to run on a wide variety of systems. Because Tcl is a very compact language, it is used on embedded systems platforms, both in its full form and in several other small-footprint versions. The popular combination of Tcl with the Tk extension is referred to as Tcl/Tk, and enables building a graphical user interface (GUI) natively in Tcl. Tcl/Tk is included in the standard Python installation in the form of Tkinter.", "pageId": 39880682, "dailyPageViews": 567, "created": 2001, "backlinksCount": 938, "revisionCount": 944, "appeared": 1988, "fileExtensions": [ "tcl", "tbc" ], "url": "https://en.wikipedia.org/wiki/Tcl" }, "githubLanguage": { "fileExtensions": [ "tcl", "adp", "tclin", "tm" ], "trendingProjectsCount": 0, "type": "programming", "filenames": [ "owh", "starfield" ], "interpreters": [ "tclsh", "wish" ], "aceMode": "tcl", "codemirrorMode": "tcl", "codemirrorMimeType": "text/x-tcl", "tmScope": "source.tcl", "repos": 13969, "id": "Tcl" }, "githubBigQuery": { "repos": 8111, "users": 7067, "id": "Tcl" }, "monaco": "tcl", "codeMirror": "tcl", "pygmentsHighlighter": { "filename": "tcl.py", "fileExtensions": [ "tcl", "rvt" ], "id": "Tcl" }, "linguistGrammarRepo": { "firstCommit": 2005, "lastCommit": 2013, "committerCount": 4, "commitCount": 56, "sampleCount": 2, "example": [ "# XDG Base Directory Specification handling\n#\n# Copyright (C) 2013 Lawrence Woodman\n#\n# Licensed under an MIT licence. Please see LICENCE.md for details.\n#\n# For XDG Base Directory Specification\n# http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html\n#\npackage require Tcl 8.5\n\nnamespace eval XDG {\n variable DEFAULTS \"\"\n namespace export DATA_HOME CONFIG_HOME CACHE_HOME\n namespace export RUNTIME_DIR DATA_DIRS CONFIG_DIRS\n}\n\nproc XDG::SetDefaults {} {\n variable DEFAULTS\n if {$DEFAULTS ne \"\"} return\n set DEFAULTS [list \\\n DATA_HOME [file join $::env(HOME) .local share] \\\n CONFIG_HOME [file join $::env(HOME) .config] \\\n CACHE_HOME [file join $::env(HOME) .cache] \\\n DATA_DIRS [list [file join /usr local share] [file join /usr share]] \\\n CONFIG_DIRS [list [file join /etc xdg ]]\n ]\n}\n\nproc XDG::XDGVarSet {var} {\n expr {[info exists ::env(XDG_$var)] && $::env(XDG_$var) ne \"\"}\n}\n\nproc XDG::Dir {var {subdir \"\"} } {\n variable DEFAULTS\n SetDefaults\n set dir [dict get $DEFAULTS $var]\n\n if {[XDGVarSet $var]} {\n set dir $::env(XDG_$var)\n }\n\n return [file join $dir $subdir]\n}\n\nproc XDG::Dirs {var {subdir \"\"} } {\n variable DEFAULTS\n SetDefaults\n set rawDirs [dict get $DEFAULTS $var]\n\n if {[XDGVarSet $var]} {\n set rawDirs [split $::env(XDG_$var) \":\"]\n }\n\n set outDirs {}\n foreach dir $rawDirs {\n lappend outDirs [file join $dir $subdir]\n }\n return $outDirs\n}\n\n# The remaining procs reference the environmental variables XDG_\n# followed by the proc name.\nproc XDG::DATA_HOME {{subdir \"\"}} {Dir DATA_HOME $subdir}\nproc XDG::CONFIG_HOME {{subdir \"\"}} {Dir CONFIG_HOME $subdir}\nproc XDG::CACHE_HOME {{subdir \"\"}} {Dir CACHE_HOME $subdir}\n\nproc XDG::RUNTIME_DIR {{subdir \"\"}} {\n if {![XDGVarSet RUNTIME_DIR]} { return {} }\n return [file join $::env(XDG_RUNTIME_DIR) $subdir]\n}\n\n# The following procs returning the directories as a list with the most\n# important first.\nproc XDG::DATA_DIRS {{subdir \"\"}} {Dirs DATA_DIRS $subdir}\nproc XDG::CONFIG_DIRS {{subdir \"\"}} {Dirs CONFIG_DIRS $subdir}\n" ], "url": "https://github.com/textmate/tcl.tmbundle" }, "projectEuler": { "memberCount": { "2019": 75, "2022": 71 }, "id": "Tcl" }, "helloWorldCollection": [ "#!/usr/local/bin/tclsh\n# Hello World in Tcl\n\nputs \"Hello World!\"\n" ], "leachim6": { "filepath": "t/Tcl.tcl", "fileExtensions": [ "tcl" ], "example": [ "puts \"Hello World\"" ], "id": "Tcl" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Tcl", "quineRelay": "Tcl", "rijuRepl": { "example": [ "puts {Hello, world!}\n" ], "id": "https://riju.codes/tcl" }, "tryItOnline": "tcl", "officialBlogUrl": [ "https://www.tcl.tk/software/tcltk/whatsnew.tml" ], "tiobe": { "id": "Tcl" }, "ubuntuPackage": "tcl", "jupyterKernel": [ "https://github.com/rpep/tcl_kernel" ], "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nPractical Programming in TCL & TK|1961|Brent B. Welch|1665118|3.87|55|2\nEffective Tcl/TK Programming: Writing Better Programs with TCL and TK|1997|Mark Harrison|800119|3.50|4|0\nTcl/TK Pocket Reference: Programming Tools|1998|Paul Raines|1370427|3.22|9|0\nTCL/TK Programmer's Reference|1999|Chris Nelson|3658168|5.00|1|1\nTcl/Tk 8.5 Programming Cookbook|2011|Bert Wheeler|15375794|3.00|1|0\nTcl/TK Programming for the Absolute Beginner|2007|Kurt Wall|2138390|4.00|1|1\nTCL 8.5 Network Programming|2010|Wojciech Kocjan|14701556|3.67|3|1\nTcl/TK: A Developer's Guide|2003|Clif Flynt|19278649|0.0|0|0\nTCL/TK for Dummies?|1997|Tim Webster|2387039|3.50|2|0\nCGI Programming with TCL [With CDROM]|1999|David Maggiano|5169621|0.0|0|0", "isbndb": "year|publisher|title|authors|isbn13\n1997|Addison-Wesley Professional|Effective Tcl/TK Programming: Writing Better Programs with TCL and TK|Harrison, Mark and McLennan, Michael|9780201634747\n2009|Addison-Wesley Professional|Tcl and the Tk Toolkit|Ousterhout, John and Jones, Ken|9780321336330\n2010|Packt Publishing|Tcl 8.5 Network Programming (Community Experience Distilled)|Kocjan, Wojciech and Beltowski, Piotr|9781849510967\n1997|Prentice Hall Ptr|Cgi Developer's Resource: Web Programming in Tcl and Perl (Resource Series)|Ivler, J. M. and Husain, Kamran|9780137277513\n1999|McGraw-Hill Inc.,US|Web TCL Complete|Stephen Ball|9780079137135\n2003|Pearson|Practical Programming in Tcl and Tk|Welch, Brent and Jones, Ken|9780130385604\n2017|CreateSpace Independent Publishing Platform|The Tcl Programming Language: A Comprehensive Guide|Nadkarni, Ashok P.|9781548679644\n1997|Prentice Hall|Practical Programming in Tcl & Tk|Welch, Brent B.|9780136168300\n1999|O'Reilly Media|TCL / TK in a Nutshell: A Desktop Quick Reference|Raines, Paul and Tranter, Jeff|9781565924338\n2007|Cengage Learning PTR|Tcl and Tk Programming for the Absolute Beginner|Wall, Kurt|9781598634389\n1994|Addison-Wesley Professional|Tcl and the Tk Toolkit|Ousterhout, John K.|9780201633375\n1999|Prentice Hall|Practical Programming in Tcl and Tk (3rd Edition)|Welch, Brent B.|9780130220288\n1995-04T|Prentice Hall|Practical Programming in Tcl and Tk/Book and Disk|Welch, Brent B.|9780131820074\n1999|Addison-wesley|Cgi Programming With Tcl|David Maggiano|9780201606294\n20100701|Packt Publishing|Tcl 8.5 Network Programming|Wojciech Kocjan; Piotr Beltowski|9781849510974\n1994|Addison-wesley|Tcl And The Tk Toolkit|Ousterhout, John K.|9780201633375", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n1994|VIPERS: a data flow visual programming environment based on the Tcl language|10.1145/192309.192361|21|3|Massimo Bernini and M. Mosconi|9aa8df179b2f6b3c252657a8813850e22d2fe7e9\n2014|Petascale Tcl with NAMD, VMD, and Swift/T|10.1109/HPTCDL.2014.7|18|0|James C. Phillips and J. Stone and Kirby L. Vandivort and Timothy G. Armstrong and J. Wozniak and M. Wilde and K. Schulten|dbc9036c86dbe20795e6eccc8393d02dd7251692" }, "tcoz": { "title": "TCOZ", "appeared": 2002, "type": "pl", "reference": [ "https://semanticscholar.org/paper/abd4e8a36f171b5024153eae873f894da112d8c5" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8160", "centralPackageRepositoryCount": 0 }, "tcp": { "title": "TCP", "appeared": 1974, "type": "protocol", "documentation": [ "https://www.rfc-editor.org/rfc/rfc793" ], "standsFor": "Transmission Control Protocol", "wikipedia": { "related": [ "udp", "ftp", "http", "smtp", "tls", "linux" ], "summary": "The Transmission Control Protocol (TCP) is one of the main protocols of the Internet protocol suite. It originated in the initial network implementation in which it complemented the Internet Protocol (IP). Therefore, the entire suite is commonly referred to as TCP/IP. TCP provides reliable, ordered, and error-checked delivery of a stream of octets between applications running on hosts communicating by an IP network. Major Internet applications such as the World Wide Web, email, remote administration, and file transfer rely on TCP. Applications that do not require reliable data stream service may use the User Datagram Protocol (UDP), which provides a connectionless datagram service that emphasizes reduced latency over reliability.", "pageId": 30538, "dailyPageViews": 3336, "created": 2001, "backlinksCount": 1522, "revisionCount": 3050, "appeared": 2009, "url": "https://en.wikipedia.org/wiki/Transmission_Control_Protocol" }, "fileType": "na", "wordRank": 5599, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nTCP / IP for Dummies|1991|Candace Leiden|2009304|3.73|52|3\nTcp/IP Sockets in C: Practical Guide for Programmers|2000|Michael J. Donahoo|6179335|4.15|54|3\nNetworking Personal Computers with TCP/IP: Building TCP/IP Networks|1995|Craig Hunt|674729|3.12|8|0\nTcp/IP Sockets in C#: Practical Guide for Programmers|2004|David Makofske|493608|3.81|37|3", "isbndb": "year|publisher|title|authors|isbn13\n1996|Addison-Wesley Professional|TCP/IP Illustrated: v. 3: TCP for Transactions, HTTP, NNTP and the Unix Domain Protocols (Addison-Wesley Professional Computing Series)|Stevens, W. Richard and Wright, Gary R.|9780201634952\n1993|Pearson Ptr|Internetworking With Tcp Ip Edition Volume 3|Comer, Douglas E|9780134742229", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2006|Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations|10.1145/1111037.1111043|49|2|S. Bishop and M. Fairbairn and Michael Norrish and Peter Sewell and Michael Smith and Keith Wansbrough|4a949f87b3f2a14b648c952add85a5e5f2026748\n2005|Developing a functional Tcp/Ip stack oriented towards Tcp connection replication|10.1145/1168117.1168131|4|0|J. París and Alberto Valderruten and V. M. Gulías|917b04487915d4ffd53948027401d239fd281175" }, "tcsh": { "title": "tcsh", "appeared": 1983, "type": "pl", "country": [ "United States" ], "hasPrintDebugging": { "example": "", "value": true }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "printToken": [ [ "echo" ] ], "stringToken": [ [ "\"" ] ], "githubLanguage": { "fileExtensions": [ "tcsh", "csh" ], "trendingProjectsCount": 0, "type": "programming", "group": "Shell", "interpreters": [ "tcsh", "csh" ], "aceMode": "sh", "codemirrorMode": "shell", "codemirrorMimeType": "text/x-sh", "tmScope": "source.shell", "repos": 0, "id": "Tcsh" }, "pygmentsHighlighter": { "filename": "shell.py", "fileExtensions": [ "tcsh", "csh" ], "id": "Tcsh" }, "linguistGrammarRepo": { "firstCommit": 2013, "lastCommit": 2018, "committerCount": 31, "commitCount": 243, "url": "https://github.com/atom/language-shellscript" }, "leachim6": { "filepath": "t/TCSH.tcsh", "fileExtensions": [ "tcsh" ], "example": [ "#!/bin/tcsh\necho \"Hello World\"\n" ], "id": "TCSH" }, "rijuRepl": { "example": [ "echo \"Hello, world!\"\n" ], "id": "https://riju.codes/tcsh" }, "tryItOnline": "tcsh", "hopl": "https://hopl.info/showlanguage.prx?exp=2560", "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "year|publisher|title|authors|isbn13\n1995|O'Reilly & Associates|Using csh & tcsh (Nutshell Handbooks)|DuBois, Paul|9781565921320\n19950701|O'Reilly Media, Inc.|Using csh & tcsh|Paul DuBois|9781449391683\n19950701|O'Reilly Media, Inc.|Using csh & tcsh|Paul DuBois|9781449391065" }, "tcsp": { "title": "TCSP", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/abd4e8a36f171b5024153eae873f894da112d8c5" ], "hopl": "https://hopl.info/showlanguage.prx?exp=8159", "centralPackageRepositoryCount": 0 }, "tdfl": { "title": "TDFL", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/352545d061619fb70e3754e577ae00413fc28620" ], "hopl": "https://hopl.info/showlanguage.prx?exp=1603", "centralPackageRepositoryCount": 0 }, "tdms": { "title": "TDMS", "appeared": 1970, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c0beb1ae94c1f370f7fe1e9d417fe48a530f02b6" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3257", "centralPackageRepositoryCount": 0 }, "tea-pl": { "title": "Tea", "appeared": 2019, "type": "library", "creators": [ "Eunice Jun", "Maureen Daum", "Jared Roesch", "Sarah E. Chasins", "Emery D. Berger", "Rene Just", "Katharina Reinecke" ], "description": "A High-level Language and Runtime System for Automating Statistical Analysis. Tea is implemented as an open-source Python library, so programmers can use Tea wherever they use Python, including within Python notebooks.", "website": "http://tea-lang.org/", "reference": [ "https://arxiv.org/abs/1904.05387" ], "domainName": { "registered": 2018, "name": "tea-lang.org" }, "writtenIn": [ "python" ], "related": [ "sas", "spss", "jmp", "r", "statsplorer" ] }, "tea-pm": { "title": "tea", "appeared": 2021, "type": "packageManager", "creators": [ "Max Howell" ], "description": "From the creator of brew, tea is a standalone, binary download for all platforms that puts the entire open source ecosystem at your fingertips. Casually and effortlessly use the latest and greatest or the oldest and most mature from any layer of any stack. Break down the silos between programming communities, throw together scripts that use entirely separate tools and languages and share them with the world with a simple one-liner.All you need is tea.", "website": "https://tea.xyz/", "reference": [ "https://tea.xyz/white-paper/" ], "country": [ "United States" ], "originCommunity": [ "tea inc" ], "writtenIn": [ "bash", "typescript", "c" ], "influencedBy": [ "homebrew-pm" ], "githubRepo": { "firstCommit": 2021, "stars": 1223, "forks": 66, "subscribers": 19, "created": 2021, "updated": 2022, "description": "the unified package manager (brew2)", "issues": 46, "url": "https://github.com/teaxyz/cli" }, "twitter": "https://twitter.com/teaxyz_", "isOpenSource": true }, "tea": { "title": "Tea", "appeared": 1997, "type": "pl", "website": "http://www2.pdmfc.com/tea", "hasPrintDebugging": { "example": "", "value": true }, "hasLineComments": { "example": "# A comment", "value": true }, "hasComments": { "example": "# A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "#" ] ], "printToken": [ [ "echo" ] ], "stringToken": [ [ "\"" ] ], "example": [ "echo \"Hello, world!\"", "class Square Rectangle (\n)\nmethod Square constructor ( size ) {\n $super constructor $size $size\n}" ], "wikipedia": { "related": [ "tcl", "java", "scheme", "xml", "jvm" ], "summary": "Tea is a high level scripting language for the Java environment. It combines features of Scheme, Tcl, and Java. Integrated support for all major programming paradigms. Functional programming language. Functions are first class objects. Scheme-like closures are intrinsic to the language. Support for object oriented programming. Modular libraries with autoloading on demand facilities. Large base of core functions and classes. String and list processing. Regular expressions. File and network I/O. Database access. XML processing. 100% Pure Java. The Tea interpreter is implemented in Java. Tea runs anywhere with a Java 1.6 JVM or higher. Java reflection features allow the use of Java libraries directly from Tea code. Intended to be easily extended in Java. For example, Tea supports relational database access through JDBC, regular expressions through GNU Regexp, and an XML parser through a SAX parser (XML4J for example).", "pageId": 3431871, "created": 2005, "backlinksCount": 20, "revisionCount": 55, "dailyPageViews": 14, "appeared": 1997, "url": "https://en.wikipedia.org/wiki/Tea_(programming_language)" }, "githubLanguage": { "fileExtensions": [ "tea" ], "trendingProjectsCount": 0, "type": "markup", "aceMode": "text", "tmScope": "source.tea", "repos": 17, "id": "Tea" }, "githubBigQuery": { "repos": 15, "users": 14, "id": "Tea" }, "pygmentsHighlighter": { "filename": "templates.py", "fileExtensions": [ "tea" ], "id": "Tea" }, "linguistGrammarRepo": { "firstCommit": 2012, "lastCommit": 2015, "committerCount": 3, "commitCount": 10, "sampleCount": 1, "example": [ "<% template foo() %>" ], "url": "https://github.com/pferruggiaro/sublime-tea" }, "leachim6": { "filepath": "t/Tea.tea", "fileExtensions": [ "tea" ], "example": [ "echo \"Hello World\"\n" ], "id": "Tea" }, "fileType": "text", "wordRank": 2862, "centralPackageRepositoryCount": 0, "isbndb": "" }, "teal": { "title": "teal", "appeared": 1987, "type": "pl", "website": "https://developer.algorand.org/docs/reference/teal/specification/", "pygmentsHighlighter": { "filename": "teal.py", "fileExtensions": [ "teal" ], "id": "teal" } }, "teasharp": { "title": "TeaSharp", "appeared": 2022, "type": "pl", "description": "My new programming language, TeaSharp", "reference": [ "https://reddit.com/r/ProgrammingLanguages/comments/vfzzk0/my_new_programming_language_teasharp/" ] }, "teco": { "title": "TECO", "appeared": 1963, "type": "pl", "standsFor": "Text editor character oriented", "country": [ "United States" ], "wikipedia": { "example": [ "0uz  ! clear repeat flag !\nB, switch lines and set flag !\nqbua  ! load B into A !\nl .-z;>  ! loop back if another line in buffer !\nqz;>  ! repeat if a switch was made last pass !" ], "related": [ "emacs-editor", "unix", "isbn" ], "summary": "TECO (; originally an acronym for [paper] Tape editor and corrector, but later Text editor and corrector, then Text editor character oriented) is a text editor originally developed at the Massachusetts Institute of Technology (MIT) in the 1960s, after which it was modified by many other people. TECO was a direct ancestor of Emacs, which was originally implemented in TECO macros.", "pageId": 30449, "dailyPageViews": 43, "created": 2001, "backlinksCount": 24, "revisionCount": 331, "appeared": 1962, "url": "https://en.wikipedia.org/wiki/TECO_(text_editor)" }, "projectEuler": { "memberCount": { "2019": 7, "2022": 8 }, "id": "TECO" }, "helloWorldCollection": [ "!Hello World in TECO\n!The $ symbol below wouldn't actually be a printing character -\n!it's the [escape] character, \\u001b!\nFTHello World$\n" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:Teco", "rijuRepl": { "example": [ "IHello, world!\n$HT$$\n" ], "id": "https://riju.codes/teco" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2563", "fileType": "text", "centralPackageRepositoryCount": 0 }, "tefkat": { "title": "Tefkat", "appeared": 2004, "type": "pl", "website": "http://tefkat.sourceforge.net/", "domainName": { "name": "tefkat.sourceforge.net" }, "example": [ "RULE ClassToTable\nFORALL Class c { name: n; }\nMAKE Table t { name: n; }\n;" ], "wikipedia": { "summary": "Tefkat is a Model Transformation Language and a model transformation engine. The language is based on F-logic and the theory of stratified logic programs. The engine is an Eclipse plug-in for the Eclipse Modeling Framework (EMF).", "backlinksCount": 4, "pageId": 7726497, "dailyPageViews": 2, "appeared": 2006, "url": "https://en.wikipedia.org/wiki/Tefkat" } }, "tektronix": { "title": "Tektronix 4050", "appeared": 1980, "type": "pl", "wikipedia": { "related": [ "basic" ], "summary": "The Tektronix 4050 was a series of three computer graphics microcomputers produced by Tektronix in the late 1970s through the early 1980s. The display technology was similar to the Tektronix 4010 terminal, using a storage tube display to avoid the need for video RAM. They were all-in-one designs with the display, keyboard, CPU and DC300 tape drive in a single desktop case. They also included a GPIB parallel bus interface for controlling lab and test equipment as well as connecting to external peripherals. A simple operating system and BASIC interpreter were included in ROM. A key concept of the systems was the use of a storage tube for the display. This allowed the screen to retain images drawn to it, eliminating the need for a framebuffer, computer memory devoted to the display. Most systems of the era had limited resolution due to the expense of the buffer needed to hold higher resolution images, but this was eliminated in the 4050s and allowed the resolution to be as high as the hardware could handle, which was ostensibly 1024 by 1024 but limited by the physical layout of the screen to 1024 by 780. It also allowed the machine to dedicate all of its memory to the programs running on it, as opposed to partitioning off a section for the buffer. The first model, the 4051, was based on 8-bit Motorola 6800 running at a 1 MHz. It normally shipped with 8 KB of RAM and was expandable using 8 KB modules to 32 KB. The remaining 32 KB of address space was reserved for ROM, which could be expanded using two external ROM cartridge of 8 KB each. It included six character sets in ROM and an extended dialect of BASIC that included various vector drawing commands. The 4051 was released in 1975 for the base price of $5,995. Adding the optional RS-232 interface allowed it to emulate a Tektronix 4012 terminal.The second model was the 4052, which in spite of the similar name was a very different system. This had a CPU based on four AMD 2901 4-bit bit-slice processors used together to make a single 16-bit processor. It could also be used in a 6800-compatible mode, allowing it to run software from the 4051, although it did so much faster than the original 4051. Released in 1978, it came with a full 32 KB of RAM for $9,795, and could be expanded to 64 KB for another $1,995. The 4054 was a version of the 4052 built around the 19\" screen from the 4014 terminal rather than the 11\" screen from the 4012, increasing resolution to 4,096 by 3,072. External storage units were available for the 405x series computers. The 4924 was an external version of the internal DC300 tape drive. The 4907 used single or dual Shugart 851R 8-inch floppy drives with 64 KB floppies and the larger, 2-drawer filing cabinet sized, 4909 storage unit used a CDC 96 megabyte hard drive with the first 16 megabytes in the form of a removable disc-pack. Two sizes of the 4956 graphics tablet offered a slow process for inputing from paper drawings. The 4952 joystick was used for graphics input. Because the direct view storage tubes do not flicker as do conventional CRTs, and because the BASIC programming interface allowed simple, rapid rendering of vector graphic displays, the 405x series were used in many theatrical contexts. In particular, 405x computers can frequently be seen in early Battlestar Galactica sets. The graphic display software was based upon software originally developed in the 1960s by Corning Glass Works for their Type 904 graphics terminal. The display for this system had characteristics to the similar to those of Tektronix storage tube display. It used small pixel regions composed of photosensitive glass, which could be darkened (forming a black line image) by writing, and would display this persistently until the entire display was erased. When Corning left the market this software base was sold to Tektronix. The original demo included an artillery game which was later adapted by high school students at Lindbergh High School in Renton, Washington to the HP 9830, and also adapted by Hewlett Packard for the HP 2647 intelligent graphics terminal demo tape and eventually similar games in Microsoft BASIC for the IBM-PC. Other games for the Tektronix included Weather Wars, with users directing lightning bolts and tornados against opponents in an environment affected by wind.", "backlinksCount": 22, "pageId": 7243450, "created": 2004, "revisionCount": 64, "dailyPageViews": 9, "appeared": 1957, "url": "https://en.wikipedia.org/wiki/Tektronix_4050" }, "centralPackageRepositoryCount": 0 }, "tela": { "title": "TeLa", "appeared": 2000, "type": "pl", "reference": [ "https://boutell.com/lsm/lsmbyid.cgi/001689" ], "rosettaCode": "http://www.rosettacode.org/wiki/Category:TeLa", "hopl": "https://hopl.info/showlanguage.prx?exp=3326", "centralPackageRepositoryCount": 0 }, "telcomp": { "title": "TELCOMP", "appeared": 1966, "type": "pl", "wikipedia": { "example": [ "1.04 TYPE #,\"ENTER ONE OF THE FOLLOWING:-\";MENU\n 1.05 TYPE FORM X FOR X=1:1:4 FOR END=10^15\n 1.06 READ GRNO IN FORM 15\n 1.065 DONE IF GRNO=END\n 1.07 TO STEP 1.06 IF GRNO>4\n 1.08 TO PART GRNO+1\n \n 2.01 DO PART 50\n 2.02 READ N,K\n 2.03 DO PART 51\n 2.04 TO PART 15\n \n ..\n \n 15.01 LINE FOR X=1:1:3\n 15.02 TYPE MINPL,MAXPL IN FORM 17\n 15.03 TYPE FORM 17\n 15.04 DO PART GRNO+15 FOR X=MNPL:STPL:MXPL\n \n 16.01 Y=(X^N)+K\n 16.02 Y1[X]=(((Y-MNPL)/(MXPL-MNPL))*2)-1\n \n ..\n \n FORM 15\n ITEM NUMBER? #####\n FORM 17\n MINIMUM ##### MAXIMUM ######" ], "related": [ "joss", "mumps", "logo" ], "summary": "TELCOMP was a programming language developed at Bolt, Beranek and Newman (BBN) in about 1964 and in use until at least 1974. BBN offered TELCOMP as a paid service, with first revenue in October 1965. The service was sold to a company called On-Line Systems in 1972. In the United Kingdom, TELCOMP was offered by Time Sharing, Ltd, a partnership between BBN and an entrepreneur named Richard Evans. It was an interactive, conversational language based on JOSS, developed by BBN after Cliff Shaw from RAND visited the labs in 1964 as part of the NIH survey. It was first implemented on the PDP-1 and was used to provide a commercial time sharing service by BBN in the Boston area and later by Time Sharing Ltd. in the United Kingdom. In 1996, Leo Beranek said \"We even developed a programming language called TELCOMP that to this day, some say was better than the programming language that the industry adopted, namely BASIC.\"There were at least three versions: TELCOMP I, TELCOMP II, and TELCOMP III. TELCOMP I was implemented on the PDP-1, TELCOMP II on the PDP-7 and TELCOMP III on the PDP-10, running on DEC 's TOPS-10 operating system or on BBN's own TENEX operating system. TELCOMP programs were normally input via a paper tape reader on a Teletype Model 33, which would be connected to a PDP via a modem and acoustic telephone line. Data could be read from the paper tape reader or from the Teletype keyboard. Output was either printed to the Teletype or sent to the paper tape punch. Early versions had no facility for on-line storage of programs or data. During data input using a Teletype, the user would type a response to a printed prompt. If, instead of hitting Return, the user hit Tab, another, possibly computed, prompt would be printed on the same line. This process could be repeated for the full width of the line. This unusual feature allowed very compact data entry, comparable to full-screen CRT data entry. It saved paper, and the input section of the form became part of the program's printed output. A later derivative of TELCOMP called STRINGCOMP was oriented towards string handling. Another BBN JOSS-derivative called FILECOMP was developed for the GE MEDINET system, which was cancelled. The implicit file handling system it contained was influential on the MUMPS global database system. The initial research for LOGO was carried out in TELCOMP, but only the JOSS-style errors and interaction made it through to the actual language.", "created": 2004, "backlinksCount": 16, "pageId": 991259, "revisionCount": 36, "dailyPageViews": 6, "appeared": 1965, "url": "https://en.wikipedia.org/wiki/TELCOMP" }, "hopl": "https://hopl.info/showlanguage.prx?exp=478", "centralPackageRepositoryCount": 0 }, "telefile-assembly": { "title": "telefile-assembly", "appeared": 1952, "type": "assembly", "description": "Assembly language for Teleregister Telefile.", "reference": [ "http://ed-thelen.org/comp-hist/BRL64-t.html#TELEREGISTER-TELEFILE" ], "centralPackageRepositoryCount": 0 }, "telnet-protocol": { "title": "Telnet", "appeared": 1969, "type": "protocol", "wikipedia": { "summary": "Telnet is a protocol used on the Internet or local area network to provide a bidirectional interactive text-oriented communication facility using a virtual terminal connection. User data is interspersed in-band with Telnet control information in an 8-bit byte oriented data connection over the Transmission Control Protocol (TCP). Telnet was developed in 1969 beginning with RFC 15, extended in RFC 855, and standardized as Internet Engineering Task Force (IETF) Internet Standard STD 8, one of the first Internet standards. The name stands for \"teletype network\".Historically, Telnet provided access to a command-line interface (usually, of an operating system) on a remote host, including most network equipment and operating systems with a configuration utility (including systems based on Windows NT). However, because of serious security concerns when using Telnet over an open network such as the Internet, its use for this purpose has waned significantly in favor of SSH. The term telnet is also used to refer to the software that implements the client part of the protocol. Telnet client applications are available for virtually all computer platforms. Telnet is also used as a verb. To telnet means to establish a connection using the Telnet protocol, either with command line client or with a programmatic interface. For example, a common directive might be: \"To change your password, telnet into the server, log in and run the passwd command.\" Most often, a user will be telnetting to a Unix-like server system or a network device (such as a router) and obtaining a login prompt to a command line text interface or a character-based full-screen manager.", "backlinksCount": 1050, "pageId": 31062, "dailyPageViews": 1394, "appeared": 1969, "url": "https://en.wikipedia.org/wiki/Telnet" }, "isbndb": "", "semanticScholar": "" }, "telos": { "title": "TELOS", "appeared": 1990, "type": "pl", "reference": [ "https://semanticscholar.org/paper/c9beac8bd544384d5c5a34bbd785da04f3692429" ], "wikipedia": { "summary": "A telos (from the Greek τέλος for \"end\", \"purpose\", or \"goal\") is an end or purpose, in a fairly constrained sense used by philosophers such as Aristotle. It is the root of the term \"teleology\", roughly the study of purposiveness, or the study of objects with a view to their aims, purposes, or intentions. Teleology figures centrally in Aristotle's biology and in his theory of causes. It is central to nearly all philosophical theories of history, such as those of Hegel and Marx. One running debate in modern philosophy of biology is to what extent teleological language (as in the \"purposes\" of various organs or life-processes) is unavoidable, or is simply a shorthand for ideas that can ultimately be spelled out non-teleologically. Philosophy of action also makes essential use of teleological vocabulary: on Davidson's account, an action is just something an agent does with an intention—that is, looking forward to some end to be achieved by the action. In contrast to telos, techne is the rational method involved in producing an object or accomplishing a goal or objective; however, the two methods are not mutually exclusive in principle.", "backlinksCount": 30, "pageId": 1067753, "dailyPageViews": 188, "created": 2004, "url": "https://en.wikipedia.org/wiki/Telos" }, "hopl": "https://hopl.info/showlanguage.prx?exp=2569", "centralPackageRepositoryCount": 0, "isbndb": "" }, "telsim": { "title": "TELSIM", "appeared": 1966, "type": "pl", "reference": [ "https://semanticscholar.org/paper/6ab01bcec029ce9b2c7a6374d490fec1c7e2ab11" ], "hopl": "https://hopl.info/showlanguage.prx?exp=275", "centralPackageRepositoryCount": 0 }, "templar": { "title": "Templar", "appeared": 1993, "type": "pl", "reference": [ "https://semanticscholar.org/paper/22ef8c3442ceca23372237b57f8ee42ad7fd564f" ], "hopl": "https://hopl.info/showlanguage.prx?exp=7113", "centralPackageRepositoryCount": 0 }, "template-attribute-language": { "title": "Template Attribute Language", "appeared": 2007, "type": "template", "example": [ "\n" ], "wikipedia": { "example": [ "\n ...\n \n ...\n \n \n \n
\n ...\n
\n " ], "related": [ "html", "xml", "python", "java", "perl", "perl-6", "common-lisp", "thymeleaf" ], "summary": "The Template Attribute Language (TAL) is a templating language used to generate dynamic HTML and XML pages. Its main goal is to simplify the collaboration between programmers and designers. This is achieved by embedding TAL statements inside valid HTML (or XML) tags which can then be worked on using common design tools. TAL was created for Zope but is used in other Python-based projects as well.", "backlinksCount": 19, "pageId": 10517358, "created": 2007, "revisionCount": 91, "dailyPageViews": 19, "url": "https://en.wikipedia.org/wiki/Template_Attribute_Language" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "tempo": { "title": "TEMPO", "appeared": 1995, "type": "pl", "reference": [ "https://semanticscholar.org/paper/d3c50895670c99ce179e5665b1fd6191dbe52a6d" ], "hopl": "https://hopl.info/showlanguage.prx?exp=2571", "centralPackageRepositoryCount": 0, "isbndb": "" }, "temporal-prolog": { "title": "Temporal Prolog", "appeared": 1983, "type": "pl", "reference": [ "https://semanticscholar.org/paper/ea77a97cf422a580316cfc292da1928318cc18c9" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5064", "centralPackageRepositoryCount": 0 }, "ten": { "title": "ten", "appeared": 2019, "type": "pl", "creators": [ "Ray Stubbs" ], "website": "https://ten-lang.io", "fileExtensions": [ "ten" ], "domainName": { "name": "ten-lang.io" }, "example": [ "each( irange( 1, 101 )\n [ num ]\n if\n num % 15 = 0: show\"FizzBuzz \"\n num % 3 = 0: show\"Fizz \"\n num % 5 = 0: show\"Buzz \"\n else\n show( num, \" \" )\n)\nshow( N )" ], "githubRepo": { "firstCommit": 2019, "stars": 36, "forks": 4, "subscribers": 6, "created": 2019, "updated": 2022, "description": "A minimal, consistent, embeddable scripting language.", "issues": 1, "url": "https://github.com/ten-lang/libten" }, "repoStats": { "firstCommit": 2019, "commits": 196, "committers": 1, "files": 184 } }, "tengo": { "title": "tengo", "appeared": 2019, "type": "pl", "website": "https://tengolang.com/", "domainName": { "name": "tengolang.com" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n18943482|Show HN: Tengo lang – A fast script language for Go|2019-01-18 21:55:37 UTC|1547848537|stephen82|1|6" }, "tensorflow": { "title": "TensorFlow", "appeared": 2015, "type": "library", "creators": [ "Manjunath Kudlur" ], "website": "https://www.tensorflow.org/", "domainName": { "registered": 2015, "awisRank": { "2022": 8821 }, "name": "tensorflow.org" }, "writtenIn": [ "python", "cpp", "cuda" ], "githubRepo": { "stars": 166107, "forks": 86926, "subscribers": 7835, "created": 2015, "updated": 2022, "firstCommit": 2015, "description": "An Open Source Machine Learning Framework for Everyone", "issues": 2317, "url": "https://github.com/tensorflow/tensorflow" }, "wikipedia": { "related": [ "python", "cuda", "linux", "android", "ios" ], "summary": "TensorFlow is an open-source software library for dataflow programming across a range of tasks. It is a symbolic math library, and also used for machine learning applications such as neural networks. It is used for both research and production at Google,‍   often replacing its closed-source predecessor, DistBelief. TensorFlow was developed by the Google Brain team for internal Google use. It was released under the Apache 2.0 open source license on November 9, 2015.", "pageId": 48508507, "dailyPageViews": 1652, "created": 2015, "backlinksCount": 111, "revisionCount": 360, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/TensorFlow" }, "indeedJobs": { "2017": 721, "query": "tensorflow engineer" }, "meetup": { "memberCount": 91480, "groupCount": 112, "url": "https://www.meetup.com/topics/tensorflow" }, "twitter": "https://twitter.com/tensorflow", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "goodreads": "title|year|author|goodreadsId|rating|ratings|reviews\nTensorFlow For Dummies (For Dummies (Computer/Tech))||Matthew Scarpino|60733334|0.0|0|0" }, "teradata-aster": { "title": "Teradata Aster", "appeared": 2005, "type": "database", "description": "Massively parallel processing (MPP) database management system", "country": [ "United States" ], "originCommunity": [ "Teradata Corporation" ] }, "teradata": { "title": "Teradata", "appeared": 1979, "type": "database", "description": "Relational database management system (RDBMS)", "country": [ "United States" ], "originCommunity": [ "Teradata Corporation" ] }, "tern": { "title": "tern", "appeared": 2019, "type": "pl", "website": "http://tern-lang.org", "domainName": { "registered": 2019, "name": "tern-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n19825828|Show HN: Tern Programming Language|http://tern-lang.org|2019-05-04 11:34:21 UTC|1556969661|gallna|0|2" }, "ternary-notation": { "title": "Ternary numeral system", "appeared": 2001, "type": "notation", "wikipedia": { "summary": "The ternary numeral system (also called base 3) has three as its base. Analogous to a bit, a ternary digit is a trit (trinary digit). One trit is equivalent to log2 3 (about 1.58496) bits of information. Although ternary most often refers to a system in which the three digits are all non–negative numbers, specifically 0, 1, and 2, the adjective also lends its name to the balanced ternary system, comprising the digits −1, 0 and +1, used in comparison logic and ternary computers.", "backlinksCount": 700, "pageId": 62950, "dailyPageViews": 353, "appeared": 2001, "url": "https://en.wikipedia.org/wiki/Ternary_numeral_system" } }, "terra": { "title": "Terra", "appeared": 2012, "type": "pl", "description": "Terra is a low-level system programming language that is embedded in and meta-programmed by the Lua programming language:", "website": "http://terralang.org/", "documentation": [ "https://docs.terra.money/" ], "domainName": { "awisRank": { "2022": 6480289 }, "name": "terralang.org" }, "hasLineComments": { "example": "-- A comment", "value": true }, "hasComments": { "example": "-- A comment", "value": true }, "hasPrintDebugging": { "example": "", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasStrings": { "example": "\"Hello world\"", "value": true }, "lineCommentToken": [ [ "--" ] ], "printToken": [ [ "print" ] ], "stringToken": [ [ "\"" ] ], "example": [ "-- This top-level code is plain Lua code.\nfunction printhello()\n -- This is a plain Lua function\n print(\"Hello, Lua!\")\nend\nprinthello()\n\n-- Terra is backwards compatible with C, we'll use C's io library in our example.\nC = terralib.includec(\"stdio.h\")\n\n-- The keyword 'terra' introduces a new Terra function.\nterra hello(argc : int, argv : &rawstring)\n -- Here we call a C function from Terra\n C.printf(\"Hello, Terra!\\n\")\n return 0\nend\n\n-- You can call Terra functions directly from Lua, they are JIT compiled \n-- using LLVM to create machine code\nhello(0,nil)\n\n-- Terra functions are first-class values in Lua, and can be introspected \n-- and meta-programmed using it\nhello:disas()\n--[[ output:\n assembly for function at address 0x60e6010\n 0x60e6010(+0): push rax\n 0x60e6011(+1): movabs rdi, 102129664\n 0x60e601b(+11): movabs rax, 140735712154681\n 0x60e6025(+21): call rax\n 0x60e6027(+23): xor eax, eax\n 0x60e6029(+25): pop rdx\n 0x60e602a(+26): ret\n]]\n\n-- You can save Terra code as executables, object files, or shared libraries \n-- and link them into existing programs\nterralib.saveobj(\"helloterra\",{ main = hello })" ], "githubRepo": { "firstCommit": 2012, "stars": 2432, "forks": 187, "subscribers": 100, "created": 2012, "updated": 2022, "description": "Terra is a low-level system programming language that is embedded in and meta-programmed by the Lua programming language.", "issues": 110, "url": "https://github.com/zdevito/terra" }, "repoStats": { "firstCommit": 2012, "commits": 1590, "committers": 68, "files": 740 }, "githubLanguage": { "fileExtensions": [ "t" ], "trendingProjectsCount": 0, "type": "programming", "interpreters": [ "lua" ], "aceMode": "lua", "codemirrorMode": "lua", "codemirrorMimeType": "text/x-lua", "tmScope": "source.terra", "repos": 410, "id": "Terra" }, "githubBigQuery": { "repos": 206, "users": 195, "id": "Terra" }, "linguistGrammarRepo": { "firstCommit": 2016, "lastCommit": 2016, "committerCount": 1, "commitCount": 3, "sampleCount": 3, "example": [ "C = terralib.includecstring [[\n\t#include \n\t#include \n]]\nlocal arraytypes = {}\nfunction Array(T)\n\tlocal struct ArrayImpl {\n\t\tdata : &T;\n\t\tN : int;\n\t}\n\tfunction ArrayImpl.metamethods.__typename(self)\n\t return \"Array(\"..tostring(T)..\")\"\n\tend\n\tarraytypes[ArrayImpl] = true\n\tterra ArrayImpl:init(N : int)\n\t\tself.data = [&T](C.malloc(N*sizeof(T)))\n\t\tself.N = N\n\tend\n\tterra ArrayImpl:free()\n\t\tC.free(self.data)\n\tend\n\tArrayImpl.metamethods.__apply = macro(function(self,idx)\n\t\treturn `self.data[idx]\n\tend)\n\tArrayImpl.metamethods.__methodmissing = macro(function(methodname,selfexp,...)\n\t\tlocal args = terralib.newlist {...}\n\t\tlocal i = symbol(int)\n\t\tlocal promotedargs = args:map(function(a)\n\t\t\tif arraytypes[a:gettype()] then\n\t\t\t\treturn `a(i)\n\t\t\telse\n\t\t\t\treturn a\n\t\t\tend\n\t\tend)\n\t\treturn quote\n\t\t\tvar self = selfexp\n\t\t\tvar r : ArrayImpl\n\t\t\tr:init(self.N)\n\t\t\tfor [i] = 0,r.N do\n\t\t\t\tr.data[i] = self.data[i]:[methodname](promotedargs)\n\t\t\tend\n\t\tin\n\t\t\tr\n\t\tend\n\tend)\n\treturn ArrayImpl\nend\n\nstruct Complex {\n\treal : float;\n\timag : float;\n}\n\nterra Complex:add(c : Complex) \n\treturn Complex { self.real + c.real, self.imag + c.imag }\nend\n\nComplexArray = Array(Complex)\nN = 10\nterra testit()\n\tvar ca : ComplexArray\n\tca:init(N)\n\tfor i = 0,N do\n\t\tca(i) = Complex { i, i + 1 }\n\tend\n\tvar ra = ca:add(ca)\n\treturn ra\nend\nlocal r = testit()\nassert(r.N == N)\nfor i = 0,N-1 do\n\tassert(r.data[i].real == 2*i)\n\tassert(r.data[i].imag == 2*(i+1))\nend\nassert(tostring(Array(int)) == \"Array(int32)\")" ], "url": "https://github.com/pyk/sublime-terra" }, "leachim6": { "filepath": "t/Terra.t", "fileExtensions": [ "t" ], "example": [ "print(\"Hello World\")\n" ], "id": "Terra" }, "rosettaCode": "http://www.rosettacode.org/wiki/Category:Terra", "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2013|Modeling the Earth with Fatiando a Terra|10.25080/MAJORA-8B375195-010|63|4|L. Uieda and V. C. Oliveira and V. Barbosa|ba6db75613a2daf1b9f5bb19602e67d5a281b124\n2016|Inversion of Land Surface Temperature (LST) Using Terra ASTER Data: A Comparison of Three Algorithms|10.3390/rs8120993|30|3|M. Ndossi and U. Avdan|be8ab3dc51a616ca6646f3f800239e33607e32b8\n2015|Terra|10.1145/2811267|24|0|Adriano Branco and Francisco Sant'anna and R. Ierusalimschy and Noemi Rodriguez and Silvana Rossetto|cb2405872210975b446017f54f115c45b5d4cda8\n2019|Delft Advanced Research Terra Simulator: General Purpose Reservoir Simulator with Operator-Based Linearization|10.4233/UUID:5F0F9B80-A7D6-488D-9BD2-D68B9D7B4B87|4|1|M. Khait|3986f7b8dd67a9c80b8b57c84accf6dcd94d2099" }, "terse": { "title": "terse", "appeared": 1986, "type": "assembly", "description": "TERSE is an x86 specific programming language compatible with the entire processor family from the 8088 through the Pentium 4 and beyond. It is a machine-level language that gives you all of the control available in assembly language with the ease-of-use and the look-and-feel of a high-level language like C.", "website": "http://www.terse.com/", "domainName": { "registered": 1996, "name": "terse.com" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "tetra": { "title": "tetra", "appeared": 2017, "type": "pl", "website": "http://www.tetra-lang.org", "domainName": { "name": "tetra-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n15511961|Tetra: A Language For Learning Parallel Programming|http://www.tetra-lang.org/|2017-10-19 22:09:49 UTC|1508450989|hunterrenard|0|4", "isbndb": "" }, "tetruss-app": { "title": "tetruss-app", "appeared": 1996, "type": "application", "description": " a suite of computer programs used for fluid dynamics and aerodynamics analysis and design.", "website": "https://tetruss.larc.nasa.gov/", "domainName": { "name": "tetruss.larc.nasa.gov" } }, "tex": { "title": "Tex", "appeared": 1978, "type": "pl", "isPublicDomain": true, "creators": [ "Donald Knuth" ], "website": "http://tug.org", "documentation": [ "https://tug.org/texlive/doc.html" ], "country": [ "United States" ], "domainName": { "registered": 1993, "awisRank": { "2017": 40951, "2022": 56352 }, "name": "tug.org" }, "hasLineComments": { "example": "% A comment", "value": true }, "hasMultiLineComments": { "example": "", "value": false }, "hasComments": { "example": "% A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "hasFixedPoint": { "example": "", "value": true }, "lineCommentToken": [ [ "%" ] ], "wikipedia": { "example": [ "The quadratic formula is $$-b \\pm \\sqrt{b^2 - 4ac} \\over 2a$$\n\\bye" ], "related": [ "pascal", "metafont", "troff", "unix", "latex", "m4", "c", "linux", "xetex", "unicode", "bibtex", "pdf", "emacs-editor", "lyx-editor", "vim-editor", "mediawiki", "isbn" ], "summary": "TeX ( or , see below), stylized within the system as TeX, is a typesetting system (or \"formatting system\") designed and mostly written by Donald Knuth and released in 1978. Together with the Metafont language for font description and the Computer Modern family of typefaces, TeX was designed with two main goals in mind: to allow anybody to produce high-quality books using minimal effort, and to provide a system that would give exactly the same results on all computers, at any point in time. TeX is free software, which made it accessible to a wide range of users. TeX is a popular means by which to typeset complex mathematical formulae; it has been noted as one of the most sophisticated digital typographical systems. TeX is popular in academia, especially in mathematics, computer science, economics, engineering, physics, statistics, and quantitative psychology. It has largely displaced Unix troff, the other favored formatting system, in many Unix installations, which use both for different purposes. It is also used for many other typesetting tasks, especially in the form of LaTeX, ConTeXt, and other macro packages.", "pageId": 30065, "dailyPageViews": 611, "created": 2001, "backlinksCount": 1657, "revisionCount": 1391, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/TeX" }, "githubLanguage": { "fileExtensions": [ "tex", "aux", "bbx", "cbx", "cls", "dtx", "ins", "lbx", "ltx", "mkii", "mkiv", "mkvi", "sty", "toc" ], "trendingProjects": "author name avatar url language languageColor stars forks currentPeriodStars description\nhmemcpy milewski-ctfp-pdf https://github.com/hmemcpy.png https://github.com/hmemcpy/milewski-ctfp-pdf TeX #3D6117 5720 272 198 \"Bartosz Milewski's 'Category Theory for Programmers' unofficial PDF and LaTeX source\"\ndeedy Deedy-Resume https://github.com/deedy.png https://github.com/deedy/Deedy-Resume TeX #3D6117 2479 651 74 \"A one page , two asymmetric column resume template in XeTeX that caters to an undergraduate Computer Science student\"\nsoulmachine leetcode https://github.com/soulmachine.png https://github.com/soulmachine/leetcode TeX #3D6117 7856 2866 124 LeetCode题解，151道题完整版\njacobeisenstein gt-nlp-class https://github.com/jacobeisenstein.png https://github.com/jacobeisenstein/gt-nlp-class TeX #3D6117 3281 833 47 \"Course materials for Georgia Tech CS 4650 and 7650, \"\"Natural Language\"\"\"\nbillryan resume https://github.com/billryan.png https://github.com/billryan/resume TeX #3D6117 2785 1155 82 \"An elegant \\LaTeX\\ résumé template\"\nsb2nov resume https://github.com/sb2nov.png https://github.com/sb2nov/resume TeX #3D6117 1217 488 63 \"Software developer resume in Latex\"\nrstudio cheatsheets https://github.com/rstudio.png https://github.com/rstudio/cheatsheets TeX #3D6117 1336 450 81 \"RStudio Cheat Sheets\"\nzhanwen MathModel https://github.com/zhanwen.png https://github.com/zhanwen/MathModel TeX #3D6117 611 261 121 研究生数学建模，数学建模竞赛优秀论文，数学建模算法，LaTeX论文模板，算法思维导图，参考书籍，Matlab软件教程，PPT\nlervag vimtex https://github.com/lervag.png https://github.com/lervag/vimtex TeX #3D6117 2076 200 75 \"A modern vim plugin for editing LaTeX files.\"\ntuhdo os01 https://github.com/tuhdo.png https://github.com/tuhdo/os01 TeX #3D6117 7627 431 92 \"Bootstrap yourself to write an OS from scratch. A book for self-learner.\"\ndart-lang language https://github.com/dart-lang.png https://github.com/dart-lang/language TeX #3D6117 504 43 48 \"Design of the Dart language\"\njikexueyuanwiki tensorflow-zh https://github.com/jikexueyuanwiki.png https://github.com/jikexueyuanwiki/tensorflow-zh TeX #3D6117 11183 4154 114 谷歌全新开源人工智能系统TensorFlow官方文档中文版\nrafalab dsbook https://github.com/rafalab.png https://github.com/rafalab/dsbook TeX #3D6117 237 216 28 \"Repository for data science book\"", "trendingProjectsCount": 14, "type": "markup", "aceMode": "tex", "codemirrorMode": "stex", "codemirrorMimeType": "text/x-stex", "tmScope": "text.tex.latex", "wrap": true, "aliases": [ "latex" ], "repos": 248842, "id": "TeX" }, "githubBigQuery": { "repos": 31515, "users": 24476, "id": "TeX" }, "pygmentsHighlighter": { "filename": "markup.py", "fileExtensions": [ "tex", "aux", "toc" ], "id": "TeX" }, "linguistGrammarRepo": { "sampleCount": 7, "example": [ "\\ProvidesFile{verbose.bbx}\n[\\abx@bbxid]\n\n\\RequireBibliographyStyle{authortitle}\n\n\\endinput\n" ], "url": "https://github.com/textmate/latex.tmbundle" }, "helloWorldCollection": [ "% Hello World in plain \\TeX\n\\immediate\\write16{Hello World!}\n\\end\n" ], "leachim6": { "filepath": "t/TeX.tex", "fileExtensions": [ "tex" ], "example": [ "Hello World\n\\bye" ], "id": "TeX" }, "indeedJobs": { "2022": 3, "query": "tex engineer" }, "eventsPageUrl": [ "https://tug.org/meetings.html" ], "faqPageUrl": [ "https://texfaq.org/" ], "tiobe": { "id": "Tex" }, "hopl": "https://hopl.info/showlanguage.prx?exp=833", "packageRepository": [ "https://ctan.org/" ], "twitter": "https://twitter.com/texusersgroup", "fileType": "text", "wordRank": 7751, "isOpenSource": true, "isbndb": "year|publisher|title|authors|isbn13\n1993|Computing McGraw-Hill|Tex and Latex: Drawing and Literate Programming/Book and Disk (McGraw-Hill Programming Tools for Scientists & Engineers)|Gurari, Eitan M.|9780079116161\n1993|Computing McGraw-Hill|Writing With Tex (McGraw-Hill Programming Tools for Scientists and Engineers)|Gurari, Eitan M.|9780070252073\n1994|Mcgraw-hill|Tex And Latex: Drawing And Literate Programming (mcgraw-hill Programming Tools For Scientists And Engineers)|Eitan Gurari|9780070252080", "semanticScholar": "year|title|doi|citations|influentialCitations|authors|paperId\n2010|Featherweight TeX and Parser Correctness|10.1007/978-3-642-19440-5_26|9|1|Sebastian Erdweg and K. Ostermann|2677fc5682d5b9597723bf24e1c4334779b44934" }, "texpr": { "title": "texpr", "appeared": 2013, "type": "pl", "website": "http://texpr.com", "domainName": { "registered": 2021, "name": "texpr.com" }, "hackerNewsDiscussions": "id|title|time|timestamp|by|comments|score\n5789798|Show HN: Time expressions - micro language for time management|2013-05-29 22:57:38 UTC|1369868258|njoy|0|3" }, "text-executive-programming-language": { "title": "Text Executive Programming Language", "appeared": 1979, "type": "pl", "aka": [ "tex" ], "wikipedia": { "example": [ "_ lastly we subs in x,y,z and then evaluate the goto mypgm_1_2!label_3 which does an interfile goto\n goto mycat/mypgm_?x?_?y?!label_?z?" ], "related": [ "awk", "tex", "ascii" ], "summary": "In 1979, Honeywell Information Systems announced a new programming language for their time-sharing service named TEX, an acronym for the Text Executive text processing system. TEX was a first generation scripting language, developed around the time of AWK and used by Honeywell initially as an in-house system test automation tool. TEX extended the Honeywell Time-Sharing service (TSS) line editor with programmable capabilities which allowed the user greater latitude in developing ease-of-use editing extensions as well as write scripts to automate many other time-sharing tasks formerly done by more complex TSS FORTRAN programs.", "pageId": 13852549, "created": 2007, "backlinksCount": 9, "revisionCount": 166, "dailyPageViews": 15, "appeared": 1979, "url": "https://en.wikipedia.org/wiki/Text_Executive_Programming_Language" }, "rijuRepl": { "example": [ "\\message{Hello, world!}\n" ], "id": "https://riju.codes/tex" }, "fileType": "text", "centralPackageRepositoryCount": 0, "isbndb": "" }, "textadept-editor": { "title": "Textadept", "appeared": 2007, "type": "editor", "website": "https://orbitalquark.github.io/textadept", "writtenIn": [ "c", "lua" ], "githubRepo": { "stars": 389, "forks": 27, "subscribers": 22, "created": 2020, "updated": 2023, "description": "Textadept is a fast, minimalist, and remarkably extensible cross-platform text editor for programmers.", "issues": 13, "url": "https://github.com/orbitalquark/textadept/" }, "wikipedia": { "url": "https://en.wikipedia.org/wiki/Textadept" } }, "textframe": { "title": "TextFrame", "appeared": 2008, "type": "textMarkup", "creators": [ "Mark Norman Francis" ], "githubRepo": { "firstCommit": 2008, "stars": 10, "forks": 0, "subscribers": 4, "created": 2008, "updated": 2021, "description": "Yet another lightweight markup language", "issues": 0, "url": "https://github.com/norm/textframe" }, "repoStats": { "firstCommit": 2008, "commits": 71, "committers": 2, "files": 50 }, "semanticScholar": "" }, "texti": { "title": "texti", "appeared": 2017, "type": "textMarkup", "isPublicDomain": true, "creators": [ "Gerald Bauer" ], "description": "The Best of Markdown, Wikipedia Markup, LaTeX & Friends - All Together Now", "website": "https://texti.github.io", "related": [ "markdown", "mediawiki" ], "example": [ "= Markup language =\n\nA '''markup language''' is a system for [[annotation|annotating]] a [[document]]\nin a way that is [[Syntax (logic)|syntactically distinguishable]] from the\ntext.[^] The idea and terminology\nevolved from the \"marking up\" of paper manuscripts, i.e., the revision\ninstructions by editors, traditionally written with a [[blue pencil (editing)|blue pencil]]\non authors' [[manuscript]]s." ], "githubRepo": { "stars": 10, "forks": 0, "subscribers": 4, "created": 2017, "updated": 2021, "description": "Website and Spec(ification) - Text with Instructions (.texti) - Structured Documents in Text with Formatting Conventions - The Best of Markdown, Wikipedia Markup, LaTeX & Friends - All Together Now", "issues": 0, "url": "https://github.com/texti/texti.github.io" }, "repoStats": { "firstCommit": 2017, "commits": 61, "committers": 1, "files": 13 } }, "textile": { "title": "Textile", "appeared": 2002, "type": "textMarkup", "creators": [ "netcarver" ], "website": "https://textile-lang.com", "example": [ "\"\"\"\n_This_ is a *test.*\n\n* One\n* Two\n* Three\n\nLink to \"Slashdot\":http://slashdot.org/\n\"\"\"" ], "githubRepo": { "firstCommit": 2010, "stars": 208, "forks": 48, "subscribers": 28, "created": 2010, "updated": 2022, "description": "Textile markup language parser for PHP", "issues": 25, "url": "https://github.com/textile/php-textile" }, "repoStats": { "firstCommit": 2010, "commits": 1519, "committers": 12, "files": 90 }, "wikipedia": { "related": [ "markdown", "php", "perl", "python", "ruby", "javascript", "csharp", "html", "qt", "ios", "android" ], "summary": "Textile is a lightweight markup language that uses a text formatting syntax to convert plain text into structured HTML markup. Textile is used for writing articles, forum posts, readme documentation, and any other type of written content published online.", "pageId": 2375629, "dailyPageViews": 141, "created": 2005, "backlinksCount": 75, "revisionCount": 496, "appeared": 2002, "url": "https://en.wikipedia.org/wiki/Textile_(markup_language)" }, "githubLanguage": { "fileExtensions": [ "textile" ], "trendingProjectsCount": 0, "type": "prose", "aceMode": "textile", "codemirrorMode": "textile", "codemirrorMimeType": "text/x-textile", "tmScope": "none", "wrap": true, "repos": 0, "id": "Textile" }, "codeMirror": "textile", "rijuRepl": { "example": [ "Hello, world!\n" ], "id": "https://riju.codes/textile" }, "fileType": "text", "wordRank": 8426, "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "" }, "textmate-editor": { "title": "TextMate", "appeared": 2004, "type": "editor", "website": "http://macromates.com/", "domainName": { "registered": 2003, "awisRank": { "2022": 382832 }, "name": "macromates.com" }, "wikipedia": { "example": [ "text.html.mediawiki\n markup.list.mediawiki\n meta.link.inline.external.mediawiki\n string.other.link.title.external.mediawiki" ], "related": [ "ftp", "plist", "regex", "bash", "php", "ruby", "markdown", "mips", "emacs-editor", "emacs-lisp", "rails" ], "summary": "TextMate is a general-purpose GUI text editor for Mac OS X created by Allan Odgaard. TextMate features declarative customizations, tabs for open documents, recordable macros, folding sections, snippets, shell integration, and an extensible bundle system.", "pageId": 3494476, "created": 2005, "backlinksCount": 160, "revisionCount": 519, "dailyPageViews": 87, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/TextMate" }, "fileType": "na", "centralPackageRepositoryCount": 0 }, "texy": { "title": "Texy!", "appeared": 2004, "type": "textMarkup", "website": "https://texy.info/", "domainName": { "registered": 2004, "awisRank": { "2022": 2750341 }, "name": "texy.info" }, "wikipedia": { "related": [ "php", "html", "css", "java" ], "summary": "Texy is a lightweight markup language as well as converter of this format to XHTML, in a form of a library written in the PHP scripting language. It allows the user to write structured documents without knowledge or using of HTML language. Users write documents in human-readable text format and Texy converts it to structurally valid and well-formed XHTML code. Texy! format includes tags for turning off the formatter as well as for direct CSS styling, thus it can be said it fully supports HTML and CSS. The format itself supports images, links (anchors), nested lists, and tables, among other things. Other built-in features include a support of long words division (with respect for language rules), roll-over images, clickable emails and URL (emails are obfuscated against spambots), and an auto-correct tool for several typographic issues: national single and double quotation marks, ellipses, em dashes, dimension sign, nonbreakable spaces (e.g. in phone numbers), acronyms, arrows and many others. PHP implementation of Texy has been developed by David Grudl since 2004. It runs on PHP version 4.3.3 or newer and it can be used in any other platform using XML/RPC service. Current stable version is 2.9. Version 3.0 is planned. Texy! is distributed under the GNU General Public License and New BSD License. Plugins for several content-management systems are included. Java implementation, named JTexy, is under development. The project has its own website with basic description, syntax overview, on-line demo, XMLRPC, forum. Support for English-speaking users could be described as poor.", "backlinksCount": 6, "pageId": 6877682, "created": 2006, "revisionCount": 34, "dailyPageViews": 5, "appeared": 2004, "url": "https://en.wikipedia.org/wiki/Texy!" }, "fileType": "text", "centralPackageRepositoryCount": 0 }, "tfl": { "title": "TFL", "appeared": 1996, "type": "pl", "reference": [ "https://semanticscholar.org/paper/04a0fbae513a8f13a75eb0667e62d4f9954993ca" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5416", "centralPackageRepositoryCount": 0 }, "the-message-system": { "title": "The Message System", "appeared": 1967, "type": "pl", "reference": [ "https://semanticscholar.org/paper/06b5f0b034330a6d1924a017c61f7d2c22c66990" ], "hopl": "https://hopl.info/showlanguage.prx?exp=5937", "centralPackageRepositoryCount": 0 }, "theos-multi-user-basic": { "title": "THEOS", "appeared": 1977, "type": "pl", "wikipedia": { "related": [ "c", "linux", "unix", "pick-operating-system" ], "summary": "THEOS, which translates from Greek as \"God\", is an operating system which started out as OASIS, a microcomputer operating system for small computers that use the Z80 processor. Originally written in the late 1970s by Timothy S. Williams as a low-cost alternative to the more expensive mini- and mainframe- computers that were popular in the day, OASIS provided time-sharing multiuser facilities to allow several users to utilise the resources of one computer. Similar in concept to MP/M or UNIX, THEOS uses external device drivers rather than a kernel, allowing it to be more portable to other environments, though support has been primarily directed towards industry-standard hardware (i.e. PC's). THEOS is specifically aimed at small business users, with a wide range of vertical-market applications packages being developed and supported by individuals and companies. THEOS operating systems have been distributed by THEOS Software Corporation in Walnut Creek, California, since 1983. As of 2003, Phase One Systems publishes software development tools for THEOS(R) systems. As well as porting tools, Phase One Systems distributed the Freedom query package and Control database package for THEOS systems, used to bring SQL-like data extraction tools to third-party software packages. The languages distributed with THEOS include THEOS Multi-User Basic and C. A powerful EXEC shell language can be used for task automation or to produce a turnkey system. When the operating system was launched for the IBM Personal Computer/AT in 1982, the decision was taken to change the name from OASIS to THEOS, short for THE Operating System. A number of security features exist, including dynamic passwords (where the password includes part of the date or time, or client IP address, or other dynamic elements), allow/deny security, a comprehensive inbound and outbound firewall, and an option to require a certain level of encryption in the workstation connection. In addition, the object file format is proprietary, and the operating system uses Intel \"protected mode\" to further increase defence against buffer overrun attacks. THEOS was introduced in Europe by Fujitsu and other hardware manufacturers 30 years ago, and is distributed by a number of distributors in Great Britain, Spain, Portugal, Germany, Italy and more. The 'current' version is THEOS Corona Commercial Release 6, which was released in December 2008, and a number of updates have been released since that time. The current Windows Workstation Client (as of May 2009) is version 3.16 from July 2003.", "backlinksCount": 95, "pageId": 1593766, "revisionCount": 102, "dailyPageViews": 37, "appeared": 1970, "url": "https://en.wikipedia.org/wiki/THEOS" }, "centralPackageRepositoryCount": 0 }, "thinbasic": { "title": "ThinBasic", "appeared": 2004, "type": "pl", "hasLineComments": { "example": "' A comment", "value": true }, "hasComments": { "example": "' A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "'" ] ], "wikipedia": { "example": [ "' Specifies program will use functions from console module\nuses \"Console\"\n\n' TBMain represents main body of the program\nfunction TBMain()\n ' Creates variable to hold user name\n local UserName as string\n\n ' Asks user for the name\n Console_Print(\"What is your name?: \")\n\n ' Stores it to variable\n UserName = Console_ReadLine\n\n ' If length of username is 0 then no name is specified, else program will say hello\n if len(UserName) = 0 then\n Console_PrintLine(\"No user name specified...\") \n else\n Console_PrintLine(\"Hello \" + UserName + \"!\") \n end if\n\n ' Waits for any key from user before program ends\n Console_WaitKey\nend function" ], "related": [ "basic", "c", "visual-basic", "powerbasic", "opengl", "opencl", "xml", "freebasic", "microsoft-macro-assembler" ], "summary": "thinBasic is a BASIC-like computer programming language interpreter with a central core engine architecture surrounded by many specialized modules. Although originally designed mainly for computer automation, thanks to its modular structure it can be used for wide range of tasks.", "created": 2005, "backlinksCount": 96, "pageId": 2046810, "revisionCount": 158, "dailyPageViews": 15, "appeared": 2015, "url": "https://en.wikipedia.org/wiki/ThinBasic" }, "isOpenSource": true, "centralPackageRepositoryCount": 0 }, "thinglab": { "title": "ThingLab", "appeared": 1979, "type": "pl", "wikipedia": { "related": [ "smalltalk" ], "summary": "ThingLab is a visual programming environment implemented in Smalltalk and designed at Xerox PARC by Alan Borning. A conventional system allows a user to provide inputs that produce outputs. A constraint-oriented system, such as ThingLab, allows the user to provide arbitrary inputs or outputs, then solves for whatever is unknown. ThingLab is viewed as one of the earliest constraint-oriented systems.ThingLab is credited in \"Fumbling the Future\" as a big reason Xerox continued to fund computer development.", "created": 2006, "backlinksCount": 3, "pageId": 4288444, "revisionCount": 19, "dailyPageViews": 3, "appeared": 1978, "url": "https://en.wikipedia.org/wiki/ThingLab" }, "hopl": "https://hopl.info/showlanguage.prx?exp=980", "centralPackageRepositoryCount": 0 }, "think-c": { "title": "THINK C", "appeared": 1986, "type": "pl", "wikipedia": { "related": [ "powerpc" ], "summary": "THINK C was an extension of ANSI C for the classic Mac OS developed by THINK Technologies; although named Lightspeed C in the original mid-1986 release, it was later renamed THINK C. THINK Technologies was later acquired by Symantec Corporation and the product continued to be developed by the original author, Michael Kahl. Version 3 and subsequent versions were essentially a subset of C++ and supported basic object oriented programming concepts such as single inheritance as well as extensions to the C standard that conformed more closely to the requirements of Mac OS programming. After version 6, the OOP facilities were expanded to a full C++ implementation, and the product was rebranded Symantec C++ for versions 7 and 8, now under development by different authors. THINK C (and later, Symantec C++) featured a class library and framework for Mac programming called the Think Class Library (TCL), which was used extensively for Macintosh application development. The Lightspeed/THINK C IDE was quite influential, though considered not as advanced as that belonging to THINK Pascal, its sister language product; it was considered the standard environment when MPW was considered an overpriced niche product, and most Macintosh products were developed in it for many years. With the transition of the Mac from 68K to PowerPC, however, Symantec was widely seen as having dropped the ball, and competitor Metrowerks's product CodeWarrior took control of the marketplace. Despite the decline in popularity of their IDE, Symantec was eventually chosen by Apple to provide next-generation C/C++ compilers for MPW in the form of Sc/Scpp for 68K alongside MrC/MrCpp for PowerPC. These remained Apple's standard compilers until the arrival of Mac OS X replaced them with GCC. Symantec subsequently exited the developer tool business.", "created": 2006, "backlinksCount": 86, "pageId": 3756993, "revisionCount": 56, "dailyPageViews": 18, "appeared": 1986, "url": "https://en.wikipedia.org/wiki/THINK_C" }, "centralPackageRepositoryCount": 0, "isbndb": "" }, "thorn": { "title": "thorn", "appeared": 2014, "type": "pl", "website": "http://www.thorn-lang.org", "domainName": { "registered": 2016, "name": "thorn-lang.org" }, "hackerNewsDiscussions": "id|title|url|time|timestamp|by|comments|score\n8244395|Thorn: A dynamically-typed concurrent language|http://www.thorn-lang.org/|2014-08-29 20:34:11 UTC|1409344451|mindcrime|1|4" }, "threaded-lists": { "title": "THREADED LISTS", "appeared": 1959, "type": "pl", "reference": [ "https://semanticscholar.org/paper/53605bf073df05fe0c25fa56789a0829be4c2483" ], "hopl": "https://hopl.info/showlanguage.prx?exp=3254", "centralPackageRepositoryCount": 0 }, "thrift": { "title": "Thrift", "appeared": 2007, "type": "idl", "website": "http://thrift.apache.org/", "originCommunity": [ "Apache" ], "domainName": { "name": "thrift.apache.org" }, "hasHexadecimals": { "example": "", "value": true }, "hasFloats": { "example": "", "value": true }, "hasIntegers": { "example": "", "value": true }, "example": [ "enum PhoneType {\n HOME,\n WORK,\n MOBILE,\n OTHER\n}\n\nstruct Phone {\n 1: i32 id,\n 2: string number,\n 3: PhoneType type\n}\n\nservice PhoneSvc {\n Phone findById(1: i32 id),\n list findAll()\n}" ], "wikipedia": { "example": [ "enum PhoneType {\n HOME,\n WORK,\n MOBILE,\n OTHER\n}\n\nstruct Phone {\n 1: i32 id,\n 2: string number,\n 3: PhoneType type\n}\n\nservice PhoneSvc {\n Phone findById(1: i32 id),\n list findAll()\n}" ], "related": [ "actionscript", "c", "csharp", "erlang", "go", "haskell", "java", "objective-c", "ocaml", "perl", "php", "python", "ruby", "smalltalk", "json", "soap", "xml", "asn-1", "protobuf" ], "summary": "Thrift is an interface definition language and binary communication protocol that is used to define and create services for numerous languages. It is used as a remote procedure call (RPC) framework and was developed at Facebook for \"scalable cross-language services development\". It combines a software stack with a code generation engine to build cross-platform services that can connect applications written in a variety of languages and frameworks, including ActionScript, C, C++, C#, Cappuccino, Cocoa, Delphi, Erlang, Go, Haskell, Java, Node.js, Objective-C, OCaml, Perl, PHP, Python, Ruby and Smalltalk. Although developed at Facebook, it is now an open source project in the Apache Software Foundation. The implementation was described in an April 2007 technical paper released by Facebook, now hosted on Apache.", "pageId": 10438451, "dailyPageViews": 281, "created": 2007, "backlinksCount": 381, "revisionCount": 188, "appeared": 2017, "url": "https://en.wikipedia.org/wiki/Apache_Thrift" }, "githubLanguage": { "fileExtensions": [ "thrift" ], "trendingProjectsCount": 0, "type": "programming", "aceMode": "text", "tmScope": "source.thrift", "repos": 447, "id": "Thrift" }, "githubBigQuery": { "repos": 3526, "users": 2983, "id": "Thrift" }, "pygmentsHighlighter": { "filename": "dsls.py", "fileExtensions": [ "thrift" ], "id": "Thrift" }, "linguistGrammarRepo": { "firstCommit": 2008, "lastCommit": 2014, "committerCount": 3, "commitCount": 30, "sampleCount": 1, "example": [ "struct PullRequest {\n 1: string title\n}\n\n\n" ], "url": "https://github.com/textmate/thrift.tmbundle" }, "fileType": "text", "isOpenSource": true, "centralPackageRepositoryCount": 0, "isbndb": "", "semanticScholar": "" }, "tht": { "title": "tht", "appeared": 2017, "type": "pl", "website": "https://tht-lang.org/", "domainName": { "name": "tht-lang.org" }, "hasLineComments": { "example": "// A comment", "value": true }, "hasComments": { "example": "// A comment", "value": true }, "hasSemanticIndentation": { "example": "", "value": false }, "lineCommentToken": [ [ "//" ] ], "example": [ "// Familiar variable and List syntax.\n$colors = ['red', 'blue', 'green'];\n// New JSON-style syntax for Maps\n$colorHex = {\n red: '#FF0000',\n green: '#00FF00',\n blue: '#0000FF',\n};\n// Built-in types have methods using\n// the mainstream 'dot' syntax.\n$colors.push('purple');\n// Extra parens aren't needed.\nif $colors.length() > 3 {\n $colors.pop();\n}\n// The standard library is organized\n// into modules.\nResponse.sendPage({\n title: 'Colors',\n body: bodyHtml($colors),\n});\n// Template Functions let you organize\n// your output (views) however you like.\n// (e.g. by component, module, file, etc.)\ntemplate bodyHtml($colors) {\n

Colors\n